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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f75643296f621a97b4965f32cf7d0a11246f838d | a4321d20e4c0cd1b4a79d323e28133071ad98685 | /src/qt/askpassphrasedialog.cpp | 6dee01376ebebaf5ab3c86fbb98214cad626d82e | [
"MIT"
] | permissive | sherlockcoin/8coin | 8089ce9a0633f6754fb50b225a9f5e2c0d206201 | 5755d41c3b49e5fa0ede9cc8abddffd314c04949 | refs/heads/master | 2021-01-09T09:17:48.704806 | 2014-04-23T09:15:48 | 2014-04-23T09:15:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,924 | cpp | #include "askpassphrasedialog.h"
#include "ui_askpassphrasedialog.h"
#include "guiconstants.h"
#include "walletmodel.h"
#include <QMessageBox>
#include <QPushButton>
#include <QKeyEvent>
AskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget *parent) :
QDialog(parent),
ui(new Ui::AskPassphraseDialog),
mode(mode),
model(0),
fCapsLock(false)
{
ui->setupUi(this);
ui->passEdit1->setMaxLength(MAX_PASSPHRASE_SIZE);
ui->passEdit2->setMaxLength(MAX_PASSPHRASE_SIZE);
ui->passEdit3->setMaxLength(MAX_PASSPHRASE_SIZE);
// Setup Caps Lock detection.
ui->passEdit1->installEventFilter(this);
ui->passEdit2->installEventFilter(this);
ui->passEdit3->installEventFilter(this);
switch(mode)
{
case Encrypt: // Ask passphrase x2
ui->passLabel1->hide();
ui->passEdit1->hide();
ui->warningLabel->setText(tr("Enter the new passphrase to the wallet.<br/>Please use a passphrase of <b>10 or more random characters</b>, or <b>eight or more words</b>."));
setWindowTitle(tr("Encrypt wallet"));
break;
case Unlock: // Ask passphrase
ui->warningLabel->setText(tr("This operation needs your wallet passphrase to unlock the wallet."));
ui->passLabel2->hide();
ui->passEdit2->hide();
ui->passLabel3->hide();
ui->passEdit3->hide();
setWindowTitle(tr("Unlock wallet"));
break;
case Decrypt: // Ask passphrase
ui->warningLabel->setText(tr("This operation needs your wallet passphrase to decrypt the wallet."));
ui->passLabel2->hide();
ui->passEdit2->hide();
ui->passLabel3->hide();
ui->passEdit3->hide();
setWindowTitle(tr("Decrypt wallet"));
break;
case ChangePass: // Ask old passphrase + new passphrase x2
setWindowTitle(tr("Change passphrase"));
ui->warningLabel->setText(tr("Enter the old and new passphrase to the wallet."));
break;
}
textChanged();
connect(ui->passEdit1, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));
connect(ui->passEdit2, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));
connect(ui->passEdit3, SIGNAL(textChanged(QString)), this, SLOT(textChanged()));
}
AskPassphraseDialog::~AskPassphraseDialog()
{
// Attempt to overwrite text so that they do not linger around in memory
ui->passEdit1->setText(QString(" ").repeated(ui->passEdit1->text().size()));
ui->passEdit2->setText(QString(" ").repeated(ui->passEdit2->text().size()));
ui->passEdit3->setText(QString(" ").repeated(ui->passEdit3->text().size()));
delete ui;
}
void AskPassphraseDialog::setModel(WalletModel *model)
{
this->model = model;
}
void AskPassphraseDialog::accept()
{
SecureString oldpass, newpass1, newpass2;
if(!model)
return;
oldpass.reserve(MAX_PASSPHRASE_SIZE);
newpass1.reserve(MAX_PASSPHRASE_SIZE);
newpass2.reserve(MAX_PASSPHRASE_SIZE);
// TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)
// Alternately, find a way to make this input mlock()'d to begin with.
oldpass.assign(ui->passEdit1->text().toStdString().c_str());
newpass1.assign(ui->passEdit2->text().toStdString().c_str());
newpass2.assign(ui->passEdit3->text().toStdString().c_str());
switch(mode)
{
case Encrypt: {
if(newpass1.empty() || newpass2.empty())
{
// Cannot encrypt with empty passphrase
break;
}
QMessageBox::StandardButton retval = QMessageBox::question(this, tr("Confirm wallet encryption"),
tr("WARNING: If you encrypt your wallet and lose your passphrase, you will <b>LOSE ALL OF YOUR 8coinS</b>!\nAre you sure you wish to encrypt your wallet?"),
QMessageBox::Yes|QMessageBox::Cancel,
QMessageBox::Cancel);
if(retval == QMessageBox::Yes)
{
if(newpass1 == newpass2)
{
if(model->setWalletEncrypted(true, newpass1))
{
QMessageBox::warning(this, tr("Wallet encrypted"),
tr("8Coin will close now to finish the encryption process. Remember that encrypting your wallet cannot fully protect your 8coin from being stolen by malware infecting your computer."));
QApplication::quit();
}
else
{
QMessageBox::critical(this, tr("Wallet encryption failed"),
tr("Wallet encryption failed due to an internal error. Your wallet was not encrypted."));
}
QDialog::accept(); // Success
}
else
{
QMessageBox::critical(this, tr("Wallet encryption failed"),
tr("The supplied passphrases do not match."));
}
}
else
{
QDialog::reject(); // Cancelled
}
} break;
case Unlock:
if(!model->setWalletLocked(false, oldpass))
{
QMessageBox::critical(this, tr("Wallet unlock failed"),
tr("The passphrase entered for the wallet decryption was incorrect."));
}
else
{
QDialog::accept(); // Success
}
break;
case Decrypt:
if(!model->setWalletEncrypted(false, oldpass))
{
QMessageBox::critical(this, tr("Wallet decryption failed"),
tr("The passphrase entered for the wallet decryption was incorrect."));
}
else
{
QDialog::accept(); // Success
}
break;
case ChangePass:
if(newpass1 == newpass2)
{
if(model->changePassphrase(oldpass, newpass1))
{
QMessageBox::information(this, tr("Wallet encrypted"),
tr("Wallet passphrase was successfully changed."));
QDialog::accept(); // Success
}
else
{
QMessageBox::critical(this, tr("Wallet encryption failed"),
tr("The passphrase entered for the wallet decryption was incorrect."));
}
}
else
{
QMessageBox::critical(this, tr("Wallet encryption failed"),
tr("The supplied passphrases do not match."));
}
break;
}
}
void AskPassphraseDialog::textChanged()
{
// Validate input, set Ok button to enabled when accepable
bool acceptable = false;
switch(mode)
{
case Encrypt: // New passphrase x2
acceptable = !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();
break;
case Unlock: // Old passphrase x1
case Decrypt:
acceptable = !ui->passEdit1->text().isEmpty();
break;
case ChangePass: // Old passphrase x1, new passphrase x2
acceptable = !ui->passEdit1->text().isEmpty() && !ui->passEdit2->text().isEmpty() && !ui->passEdit3->text().isEmpty();
break;
}
ui->buttonBox->button(QDialogButtonBox::Ok)->setEnabled(acceptable);
}
bool AskPassphraseDialog::event(QEvent *event)
{
// Detect Caps Lock key press.
if (event->type() == QEvent::KeyPress) {
QKeyEvent *ke = static_cast<QKeyEvent *>(event);
if (ke->key() == Qt::Key_CapsLock) {
fCapsLock = !fCapsLock;
}
if (fCapsLock) {
ui->capsLabel->setText(tr("Warning: The Caps Lock key is on."));
} else {
ui->capsLabel->clear();
}
}
return QWidget::event(event);
}
bool AskPassphraseDialog::eventFilter(QObject *, QEvent *event)
{
/* Detect Caps Lock.
* There is no good OS-independent way to check a key state in Qt, but we
* can detect Caps Lock by checking for the following condition:
* Shift key is down and the result is a lower case character, or
* Shift key is not down and the result is an upper case character.
*/
if (event->type() == QEvent::KeyPress) {
QKeyEvent *ke = static_cast<QKeyEvent *>(event);
QString str = ke->text();
if (str.length() != 0) {
const QChar *psz = str.unicode();
bool fShift = (ke->modifiers() & Qt::ShiftModifier) != 0;
if ((fShift && psz->isLower()) || (!fShift && psz->isUpper())) {
fCapsLock = true;
ui->capsLabel->setText(tr("Warning: The Caps Lock key is on."));
} else if (psz->isLetter()) {
fCapsLock = false;
ui->capsLabel->clear();
}
}
}
return false;
}
| [
"root@d1stkfactory"
] | root@d1stkfactory |
567c0cf94456223a5772e2f0437c4c629dc781e2 | 3bbaac515ad3cd3bf2c27e886a47b3c2a7acbecf | /src/Tree.h | 9a589c59a9b34ada594c61de1bf41648931087a4 | [] | no_license | zc444/image-clasification | e28a4031b18d9d6dd11eb05ac613e545f6501903 | 3966339433d41d4ba9f2920f7f9f195e289616c5 | refs/heads/master | 2022-12-22T15:40:46.609637 | 2020-09-11T01:59:26 | 2020-09-11T01:59:26 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,764 | h | //========================================================================
// Tree.h
//========================================================================
// Declarations for generic tree.
#ifndef TREE_H
#define TREE_H
#include <cstddef>
template <typename T>
class Tree {
private:
struct Node {
//Node( T v ) : value( v ), left( nullptr ), right( nullptr ) {}
Node( T v ){
value = v;
left = nullptr;
right = nullptr;
}
T value;
Node* left;
Node* right;
};
public:
Tree( unsigned int K = 0 );
~Tree();
// Copy constructor
Tree( const Tree<T>& tree );
// Methods
size_t size() const;
void add( const T& value );
bool find( const T& value ) const;
const T& find_closest( const T& value ) const;
void print() const;
int getK() const;
void setK(unsigned int K);
// Operator overloading
Tree<T>& operator=( const Tree<T>& tree );
private:
// helper function
void RemoveSubtree( Node* node_p );
void add_h( Node* nodetocheck, T value, Node* parentnode, int leftright );
void insert( Node* nodetoinsert, T value, Node* parentnode, int leftright );
//void size_h( Node* node, size_t& count ) const;
void find_h( Node* node, const T& value, bool& flag ) const;
Tree<T>::Node* binary_search( Node* node, int level, const T& value ) const; //const Tree<T>::Node*
T* exhaustive_search( Node* node, const T& value ) const;
void print_h( Node* node, int level ) const;
void copy( Node*& curr1, Node*& curr2 );
void addtree( Node* node );
Node* m_root;
size_t m_size;
unsigned int m_K;
};
// Include inline definitions
#include "Tree.inl"
#endif /* TREE_H */
| [
"zc444@cornell.edu"
] | zc444@cornell.edu |
1eaa4f95c85f6adf114a5c1f7dbca4bc458b5855 | aaab34e615cf2bd0909b7306164a6707e106fa38 | /ubuntu3/clientcout_2.cpp | 1bb708b6bdbd2e8ee9350d209fe4da757dfc3763 | [] | no_license | cyerrajodu0616/Des-Cracking | e85cc7c03d3e0510c4ace68a6db5d320af91e5c6 | 5679611bcdcf9d737112165673fd6fd9ff7f7e09 | refs/heads/master | 2021-01-01T05:22:36.751290 | 2016-05-05T18:14:17 | 2016-05-05T18:14:17 | 58,151,285 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 36,965 | cpp | #include<math.h>
#include<stdio.h> //printf
#include<string> //strlen
#include<sys/socket.h> //socket
#include<arpa/inet.h> //inet_addr
#include<unistd.h>
#include <stdlib.h>
#include <iostream>
#include <bitset>
#include <cstring>
using namespace std;
int sock;
class Key_Generation{
public :
int round;
//unsigned char Sample_key[64]={'0','0','0','1','0','0','1','1','0','0','1','1','0','1','0','0','0','1','0','1','0','1','1','1','0','1','1','1','1','0','0','1','1','0','0','1','1','0','1','1','1','0','1','1','1','1','0','0','1','1','0','1','1','1','1','1','1','1','1','1','0','0','0','1'};
//char Text[64];
//char Text1[64];
char Cipher[64];
//char Cipher1[64];
char Sub_Key[17][48];
char Left_Key[28];
char Right_Key[28];
char Expansion_Key[48];
char Permutation_Choice_1[56];
char Permutation_Choice_2[48];
char initialPermutation[64];
char inversePermutation[64];
char Iterated_Key[58];
char inputString[64];// = {'0','0','0','0','0','0','0','1','0','0','1','0','0','0','1','1','0','1','0','0','0','1','0','1','0','1','1','0','0','1','1','1','1','0','0','0','1','0','0','1','1','0','1','0','1','0','1','1','1','1','0','0','1','1','0','1','1','1','1','0','1','1','1','1'};
char leftText[17][32];
char rightText[17][32];
char exprightText[17][48];
char permRight[32];
char ciphertext[64];
char inversepermutation[64];
void Permutation_Choice1(int rounds, char *Sample_key,int *flag);
void Shift_Bits(int round,char Left_Key[28],char Right_Key[28]);
void inputTextProcessing();
void expansion(int round,char rightText[17][32], char Sub_Key[17][48]);
void permutateRightSubText(char permRight[32]);
void readInitialDataFromFile(int flag);
};
/*
Permutation_Choice1 function will remove pairity bits and load them in pre-defined order
into Permutation_Choice_1 array.
After Permutation choice 1, 57th bit of key should be 1st bit of Permutation choice 1
Left: 57 49 41 33 25 17 9 1 58 50 42 34 26 18 10 2 59 51 43 35 27 19 11 3 60 52 44 36
Right: 63 55 47 39 31 23 15 7 62 54 46 38 30 22 14 6 61 53 45 37 29 21 13 5 28 20 12 4
-------------------------------------------------------------------------------------------
AS array index is started from 0 we can consider this as 1, so 57 bit will be at 56th position of key
*/
void Key_Generation::Permutation_Choice1(int rounds, char *Sample_key,int *flag)
{
// for checking whether program fouund key or not
*flag =0;
Permutation_Choice_1[0]=Sample_key[57-1];
Permutation_Choice_1[1]=Sample_key[49-1];
Permutation_Choice_1[2]=Sample_key[41-1];
Permutation_Choice_1[3]=Sample_key[33-1];
Permutation_Choice_1[4]=Sample_key[25-1];
Permutation_Choice_1[5]=Sample_key[17-1];
Permutation_Choice_1[6]=Sample_key[9-1];
Permutation_Choice_1[7]=Sample_key[1-1];
Permutation_Choice_1[8]=Sample_key[58-1];
Permutation_Choice_1[9]=Sample_key[50-1];
Permutation_Choice_1[10]=Sample_key[42-1];
Permutation_Choice_1[11]=Sample_key[34-1];
Permutation_Choice_1[12]=Sample_key[26-1];
Permutation_Choice_1[13]=Sample_key[18-1];
Permutation_Choice_1[14]=Sample_key[10-1];
Permutation_Choice_1[15]=Sample_key[2-1];
Permutation_Choice_1[16]=Sample_key[59-1];
Permutation_Choice_1[17]=Sample_key[51-1];
Permutation_Choice_1[18]=Sample_key[43-1];
Permutation_Choice_1[19]=Sample_key[35-1];
Permutation_Choice_1[20]=Sample_key[27-1];
Permutation_Choice_1[21]=Sample_key[19-1];
Permutation_Choice_1[22]=Sample_key[11-1];
Permutation_Choice_1[23]=Sample_key[3-1];
Permutation_Choice_1[24]=Sample_key[60-1];
Permutation_Choice_1[25]=Sample_key[52-1];
Permutation_Choice_1[26]=Sample_key[44-1];
Permutation_Choice_1[27]=Sample_key[36-1];
Permutation_Choice_1[28]=Sample_key[63-1];
Permutation_Choice_1[29]=Sample_key[55-1];
Permutation_Choice_1[30]=Sample_key[47-1];
Permutation_Choice_1[31]=Sample_key[39-1];
Permutation_Choice_1[32]=Sample_key[31-1];
Permutation_Choice_1[33]=Sample_key[23-1];
Permutation_Choice_1[34]=Sample_key[15-1];
Permutation_Choice_1[35]=Sample_key[7-1];
Permutation_Choice_1[36]=Sample_key[62-1];
Permutation_Choice_1[37]=Sample_key[54-1];
Permutation_Choice_1[38]=Sample_key[46-1];
Permutation_Choice_1[39]=Sample_key[38-1];
Permutation_Choice_1[40]=Sample_key[30-1];
Permutation_Choice_1[41]=Sample_key[22-1];
Permutation_Choice_1[42]=Sample_key[14-1];
Permutation_Choice_1[43]=Sample_key[6-1];
Permutation_Choice_1[44]=Sample_key[61-1];
Permutation_Choice_1[45]=Sample_key[53-1];
Permutation_Choice_1[46]=Sample_key[45-1];
Permutation_Choice_1[47]=Sample_key[37-1];
Permutation_Choice_1[48]=Sample_key[29-1];
Permutation_Choice_1[49]=Sample_key[21-1];
Permutation_Choice_1[50]=Sample_key[13-1];
Permutation_Choice_1[51]=Sample_key[5-1];
Permutation_Choice_1[52]=Sample_key[28-1];
Permutation_Choice_1[53]=Sample_key[20-1];
Permutation_Choice_1[54]=Sample_key[12-1];
Permutation_Choice_1[55]=Sample_key[4-1];
for(int i=0;i<28;i++)
{
Left_Key[i]=Permutation_Choice_1[i];
}
for(int i=28;i<56;i++)
{
Right_Key[i-28]=Permutation_Choice_1[i];
}
// processing input string to divide into two halfs
inputTextProcessing();
//ROUNDS
for(int i=1;i<=rounds;i++)
{
Shift_Bits(i,Left_Key,Right_Key);
// subkeys finding
for (int j=0;j<48;j++)
{
Sub_Key[i][j] = Permutation_Choice_2[j];
}
// Text processing
expansion(i,rightText,Sub_Key);
// xor with lefttext
for (int p=0;p<32;p++)
{
if (permRight[p] == leftText[i-1][p])
{
rightText[i][p]= '0';
}
else
{
rightText[i][p]= '1';
}
}
// Copying Right half to left one
for(int j=0;j<32;j++)
{
leftText[i][j]=rightText[i-1][j];
}
}
for (int i=0;i<32;i++)
{
ciphertext[i]=rightText[16][i];
}
for (int i=0;i<32;i++)
{
ciphertext[i+32]=leftText[16][i];
}
//Inverse permutation
inversepermutation[0]=ciphertext[40-1];
inversepermutation[1]=ciphertext[8-1];
inversepermutation[2]=ciphertext[48-1];
inversepermutation[3]=ciphertext[16-1];
inversepermutation[4]=ciphertext[56-1];
inversepermutation[5]=ciphertext[24-1];
inversepermutation[6]=ciphertext[64-1];
inversepermutation[7]=ciphertext[32-1];
inversepermutation[8]=ciphertext[39-1];
inversepermutation[9]=ciphertext[7-1];
inversepermutation[10]=ciphertext[47-1];
inversepermutation[11]=ciphertext[15-1];
inversepermutation[12]=ciphertext[55-1];
inversepermutation[13]=ciphertext[23-1];
inversepermutation[14]=ciphertext[63-1];
inversepermutation[15]=ciphertext[31-1];
inversepermutation[16]=ciphertext[38-1];
inversepermutation[17]=ciphertext[6-1];
inversepermutation[18]=ciphertext[46-1];
inversepermutation[19]=ciphertext[14-1];
inversepermutation[20]=ciphertext[54-1];
inversepermutation[21]=ciphertext[22-1];
inversepermutation[22]=ciphertext[62-1];
inversepermutation[23]=ciphertext[30-1];
inversepermutation[24]=ciphertext[37-1];
inversepermutation[25]=ciphertext[5-1];
inversepermutation[26]=ciphertext[45-1];
inversepermutation[27]=ciphertext[13-1];
inversepermutation[28]=ciphertext[53-1];
inversepermutation[29]=ciphertext[21-1];
inversepermutation[30]=ciphertext[61-1];
inversepermutation[31]=ciphertext[29-1];
inversepermutation[32]=ciphertext[36-1];
inversepermutation[33]=ciphertext[4-1];
inversepermutation[34]=ciphertext[44-1];
inversepermutation[35]=ciphertext[12-1];
inversepermutation[36]=ciphertext[52-1];
inversepermutation[37]=ciphertext[20-1];
inversepermutation[38]=ciphertext[60-1];
inversepermutation[39]=ciphertext[28-1];
inversepermutation[40]=ciphertext[35-1];
inversepermutation[41]=ciphertext[3-1];
inversepermutation[42]=ciphertext[43-1];
inversepermutation[43]=ciphertext[11-1];
inversepermutation[44]=ciphertext[51-1];
inversepermutation[45]=ciphertext[19-1];
inversepermutation[46]=ciphertext[59-1];
inversepermutation[47]=ciphertext[27-1];
inversepermutation[48]=ciphertext[34-1];
inversepermutation[49]=ciphertext[2-1];
inversepermutation[50]=ciphertext[42-1];
inversepermutation[51]=ciphertext[10-1];
inversepermutation[52]=ciphertext[50-1];
inversepermutation[53]=ciphertext[18-1];
inversepermutation[54]=ciphertext[58-1];
inversepermutation[55]=ciphertext[26-1];
inversepermutation[56]=ciphertext[33-1];
inversepermutation[57]=ciphertext[1-1];
inversepermutation[58]=ciphertext[41-1];
inversepermutation[59]=ciphertext[9-1];
inversepermutation[60]=ciphertext[49-1];
inversepermutation[61]=ciphertext[17-1];
inversepermutation[62]=ciphertext[57-1];
inversepermutation[63]=ciphertext[25-1];
cout << "Program cipher" << endl;
for(int i=0;i<64;i++)
{
cout << inversepermutation[i];
}
cout<<endl<<"Cipher Text" << endl;
for(int i=0;i<64;i++)
{
cout<<Cipher[i];
if(inversepermutation[i] != Cipher[i])
{
*flag = -1;
break;
}
}
}
void Key_Generation::inputTextProcessing(){
initialPermutation[0]=inputString[57];
initialPermutation[1]=inputString[49];
initialPermutation[2]=inputString[41];
initialPermutation[3]=inputString[33];
initialPermutation[4]=inputString[25];
initialPermutation[5]=inputString[17];
initialPermutation[6]=inputString[9];
initialPermutation[7]=inputString[1];
initialPermutation[8]=inputString[59];
initialPermutation[9]=inputString[51];
initialPermutation[10]=inputString[43];
initialPermutation[11]=inputString[35];
initialPermutation[12]=inputString[27];
initialPermutation[13]=inputString[19];
initialPermutation[14]=inputString[11];
initialPermutation[15]=inputString[3];
initialPermutation[16]=inputString[61];
initialPermutation[17]=inputString[53];
initialPermutation[18]=inputString[45];
initialPermutation[19]=inputString[37];
initialPermutation[20]=inputString[29];
initialPermutation[21]=inputString[21];
initialPermutation[22]=inputString[13];
initialPermutation[23]=inputString[5];
initialPermutation[24]=inputString[63];
initialPermutation[25]=inputString[55];
initialPermutation[26]=inputString[47];
initialPermutation[27]=inputString[39];
initialPermutation[28]=inputString[31];
initialPermutation[29]=inputString[23];
initialPermutation[30]=inputString[15];
initialPermutation[31]=inputString[7];
initialPermutation[32]=inputString[56];
initialPermutation[33]=inputString[48];
initialPermutation[34]=inputString[40];
initialPermutation[35]=inputString[32];
initialPermutation[36]=inputString[24];
initialPermutation[37]=inputString[16];
initialPermutation[38]=inputString[8];
initialPermutation[39]=inputString[0];
initialPermutation[40]=inputString[58];
initialPermutation[41]=inputString[50];
initialPermutation[42]=inputString[42];
initialPermutation[43]=inputString[34];
initialPermutation[44]=inputString[26];
initialPermutation[45]=inputString[18];
initialPermutation[46]=inputString[10];
initialPermutation[47]=inputString[2];
initialPermutation[48]=inputString[60];
initialPermutation[49]=inputString[52];
initialPermutation[50]=inputString[44];
initialPermutation[51]=inputString[36];
initialPermutation[52]=inputString[28];
initialPermutation[53]=inputString[20];
initialPermutation[54]=inputString[12];
initialPermutation[55]=inputString[4];
initialPermutation[56]=inputString[62];
initialPermutation[57]=inputString[54];
initialPermutation[58]=inputString[46];
initialPermutation[59]=inputString[38];
initialPermutation[60]=inputString[30];
initialPermutation[61]=inputString[22];
initialPermutation[62]=inputString[14];
initialPermutation[63]=inputString[6];
//Divide Left and right array
for(int i=0; i<32; i++){
leftText[0][i] = initialPermutation[i];
}
for(int i=32; i<64; i++){
rightText[0][i-32] = initialPermutation[i];
}
}
void Key_Generation::expansion(int round,char rightText[17][32],char Sub_Key[17][48])
{
int sBox1[4][16]=
{
{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7},
{0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8},
{4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0},
{15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13}
};
int sBox2[4][16]=
{
15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10,
3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5,
0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15,
13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9
};
int sBox3[4][16]=
{
10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8,
13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1,
13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7,
1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12
};
int sBox4[4][16]=
{
7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15,
13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9,
10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4,
3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14
};
int sBox5[4][16]=
{
2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9,
14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6,
4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14,
11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3
};
int sBox6[4][16]=
{
12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11,
10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8,
9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6,
4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13
};
int sBox7[4][16]=
{
4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1,
13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6,
1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2,
6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12
};
int sBox8[4][16]=
{
13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7,
1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2,
7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8,
2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11
};
exprightText[round][0] = rightText[round-1][32-1];
exprightText[round][1] = rightText[round-1][1-1];
exprightText[round][2] = rightText[round-1][2-1];
exprightText[round][3] = rightText[round-1][3-1];
exprightText[round][4] = rightText[round-1][4-1];
exprightText[round][5] = rightText[round-1][5-1];
exprightText[round][6] = rightText[round-1][4-1];
exprightText[round][7] = rightText[round-1][5-1];
exprightText[round][8] = rightText[round-1][6-1];
exprightText[round][9] = rightText[round-1][7-1];
exprightText[round][10] = rightText[round-1][8-1];
exprightText[round][11] = rightText[round-1][9-1];
exprightText[round][12] = rightText[round-1][8-1];
exprightText[round][13] = rightText[round-1][9-1];
exprightText[round][14] = rightText[round-1][10-1];
exprightText[round][15] = rightText[round-1][11-1];
exprightText[round][16] = rightText[round-1][12-1];
exprightText[round][17] = rightText[round-1][13-1];
exprightText[round][18] = rightText[round-1][12-1];
exprightText[round][19] = rightText[round-1][13-1];
exprightText[round][20] = rightText[round-1][14-1];
exprightText[round][21] = rightText[round-1][15-1];
exprightText[round][22] = rightText[round-1][16-1];
exprightText[round][23] = rightText[round-1][17-1];
exprightText[round][24] = rightText[round-1][16-1];
exprightText[round][25] = rightText[round-1][17-1];
exprightText[round][26] = rightText[round-1][18-1];
exprightText[round][27] = rightText[round-1][19-1];
exprightText[round][28] = rightText[round-1][20-1];
exprightText[round][29] = rightText[round-1][21-1];
exprightText[round][30] = rightText[round-1][20-1];
exprightText[round][31] = rightText[round-1][21-1];
exprightText[round][32] = rightText[round-1][22-1];
exprightText[round][33] = rightText[round-1][23-1];
exprightText[round][34] = rightText[round-1][24-1];
exprightText[round][35] = rightText[round-1][25-1];
exprightText[round][36] = rightText[round-1][24-1];
exprightText[round][37] = rightText[round-1][25-1];
exprightText[round][38] = rightText[round-1][26-1];
exprightText[round][39] = rightText[round-1][27-1];
exprightText[round][40] = rightText[round-1][28-1];
exprightText[round][41] = rightText[round-1][29-1];
exprightText[round][42] = rightText[round-1][28-1];
exprightText[round][43] = rightText[round-1][29-1];
exprightText[round][44] = rightText[round-1][30-1];
exprightText[round][45] = rightText[round-1][31-1];
exprightText[round][46] = rightText[round-1][32-1];
exprightText[round][47] = rightText[round-1][1-1];
// xor with key
for (int i=0;i<48;i++)
{
if (exprightText[round][i] == Sub_Key[round][i])
{
exprightText[round][i]= '0';
}
else
{
exprightText[round][i]= '1';
}
}
int p = 0;
//int q = 0;
int bit4 = sBox1[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c1(bit4);
string str1 = c1.to_string();
p=p+6;
bit4 = sBox2[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c2(bit4);
str1 = str1.append(c2.to_string());
p=p+6;
bit4 = sBox3[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c3(bit4);
str1 = str1.append(c3.to_string());
p=p+6;
bit4 = sBox4[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c4(bit4);
str1 = str1.append(c4.to_string());
p=p+6;
bit4 = sBox5[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c5(bit4);
str1 = str1.append(c5.to_string());
p=p+6;
bit4 = sBox6[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c6(bit4);
str1 = str1.append(c6.to_string());
p=p+6;
bit4 = sBox7[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c7(bit4);
str1 = str1.append(c7.to_string());
p=p+6;
bit4 = sBox8[((exprightText[round][p]-'0')*2) + (exprightText[round][p+5]-'0')] [(((exprightText[round][p+1])-'0')*8) + (((exprightText[round][p+2])-'0')*4)+(((exprightText[round][p+3])-'0')*2) + ((exprightText[round][p+4])-'0')];
bitset<4> c8(bit4);
str1 = str1.append(c8.to_string());
char tmpRight[32];
for(int k=0;k<32;k++){
tmpRight[k] = (char)str1[k];
}
permutateRightSubText(tmpRight);
}
void Key_Generation::permutateRightSubText( char tempRight[32]){
permRight[0]=tempRight[16-1];
permRight[1]=tempRight[7-1];
permRight[2]=tempRight[20-1];
permRight[3]=tempRight[21-1];
permRight[4]=tempRight[29-1];
permRight[5]=tempRight[12-1];
permRight[6]=tempRight[28-1];
permRight[7]=tempRight[17-1];
permRight[8]=tempRight[1-1];
permRight[9]=tempRight[15-1];
permRight[10]=tempRight[23-1];
permRight[11]=tempRight[26-1];
permRight[12]=tempRight[5-1];
permRight[13]=tempRight[18-1];
permRight[14]=tempRight[31-1];
permRight[15]=tempRight[10-1];
permRight[16]=tempRight[2-1];
permRight[17]=tempRight[8-1];
permRight[18]=tempRight[24-1];
permRight[19]=tempRight[14-1];
permRight[20]=tempRight[32-1];
permRight[21]=tempRight[27-1];
permRight[22]=tempRight[3-1];
permRight[23]=tempRight[9-1];
permRight[24]=tempRight[19-1];
permRight[25]=tempRight[13-1];
permRight[26]=tempRight[30-1];
permRight[27]=tempRight[6-1];
permRight[28]=tempRight[22-1];
permRight[29]=tempRight[11-1];
permRight[30]=tempRight[4-1];
permRight[31]=tempRight[25-1];
}
void Key_Generation::Shift_Bits(int Round,char Left_Key[28],char Right_Key[28])
{
if (Round!=1 && Round!=2 && Round!=9 && Round!=16)
{
char temp1[2];
temp1[0]=Left_Key[0];
temp1[1]=Left_Key[1];
for ( int i=0;i<28;i++)
{
Left_Key[i] = Left_Key[i+2];
}
Left_Key[26]=temp1[0];
Left_Key[27]=temp1[1];
temp1[0] = Right_Key[0];
temp1[1] = Right_Key[1];
for ( int i=0;i<28;i++)
{
Right_Key[i] = Right_Key[i+2];
}
Right_Key[26]=temp1[0];
Right_Key[27]=temp1[1];
}
else
{
char temp1[1];
temp1[0] = Left_Key[0];
for ( int i=0;i<28;i++)
{
Left_Key[i] = Left_Key[i+1];
}
Left_Key[27]=temp1[0];
temp1[0] = Right_Key[0];
for ( int i=0;i<28;i++)
{
Right_Key[i] = Right_Key[i+1];
}
Right_Key[27]=temp1[0];
}
for (int i=0;i<28;i++)
{
Iterated_Key[i]=Left_Key[i];
}
for (int j=28;j<56;j++)
{
Iterated_Key[j]=Right_Key[j-28];
}
Permutation_Choice_2[0] = Iterated_Key[14-1];
Permutation_Choice_2[1] = Iterated_Key[17-1];
Permutation_Choice_2[2] = Iterated_Key[11-1];
Permutation_Choice_2[3] = Iterated_Key[24-1];
Permutation_Choice_2[4] = Iterated_Key[1-1];
Permutation_Choice_2[5] = Iterated_Key[5-1];
Permutation_Choice_2[6] = Iterated_Key[3-1];
Permutation_Choice_2[7] = Iterated_Key[28-1];
Permutation_Choice_2[8] = Iterated_Key[15-1];
Permutation_Choice_2[9] = Iterated_Key[6-1];
Permutation_Choice_2[10] = Iterated_Key[21-1];
Permutation_Choice_2[11] = Iterated_Key[10-1];
Permutation_Choice_2[12] = Iterated_Key[23-1];
Permutation_Choice_2[13] = Iterated_Key[19-1];
Permutation_Choice_2[14] = Iterated_Key[12-1];
Permutation_Choice_2[15] = Iterated_Key[4-1];
Permutation_Choice_2[16] = Iterated_Key[26-1];
Permutation_Choice_2[17] = Iterated_Key[8-1];
Permutation_Choice_2[18] = Iterated_Key[16-1];
Permutation_Choice_2[19] = Iterated_Key[7-1];
Permutation_Choice_2[20] = Iterated_Key[27-1];
Permutation_Choice_2[21] = Iterated_Key[20-1];
Permutation_Choice_2[22] = Iterated_Key[13-1];
Permutation_Choice_2[23] = Iterated_Key[2-1];
Permutation_Choice_2[24] = Iterated_Key[41-1];
Permutation_Choice_2[25] = Iterated_Key[52-1];
Permutation_Choice_2[26] = Iterated_Key[31-1];
Permutation_Choice_2[27] = Iterated_Key[37-1];
Permutation_Choice_2[28] = Iterated_Key[47-1];
Permutation_Choice_2[29] = Iterated_Key[55-1];
Permutation_Choice_2[30] = Iterated_Key[30-1];
Permutation_Choice_2[31] = Iterated_Key[40-1];
Permutation_Choice_2[32] = Iterated_Key[51-1];
Permutation_Choice_2[33] = Iterated_Key[45-1];
Permutation_Choice_2[34] = Iterated_Key[33-1];
Permutation_Choice_2[35] = Iterated_Key[48-1];
Permutation_Choice_2[36] = Iterated_Key[44-1];
Permutation_Choice_2[37] = Iterated_Key[49-1];
Permutation_Choice_2[38] = Iterated_Key[39-1];
Permutation_Choice_2[39] = Iterated_Key[56-1];
Permutation_Choice_2[40] = Iterated_Key[34-1];
Permutation_Choice_2[41] = Iterated_Key[53-1];
Permutation_Choice_2[42] = Iterated_Key[46-1];
Permutation_Choice_2[43] = Iterated_Key[42-1];
Permutation_Choice_2[44] = Iterated_Key[50-1];
Permutation_Choice_2[45] = Iterated_Key[36-1];
Permutation_Choice_2[46] = Iterated_Key[29-1];
Permutation_Choice_2[47] = Iterated_Key[32-1];
}
void Key_Generation::readInitialDataFromFile(int flag1){
FILE * CipherFile;
FILE * PlainText;
// FILE * CipherFile1;
//FILE * PlainText1;
char buffer [64];
if(flag1==1){
CipherFile = fopen ("//home//ubuntu//ciphertext1.txt" , "r");
if (CipherFile == NULL) perror ("Error opening file");
else
{
while ( ! feof (CipherFile) )
{
if ( fgets (buffer , 100 , CipherFile) == NULL ) break;
}
printf("Cipher From File");
for(int i=0;i<64;i++)
{
Cipher[i]=(char)buffer[i];
printf("%c",Cipher[i]);
}
// Cipher[64]='\0';
fclose (CipherFile);
}
PlainText = fopen ("//home//ubuntu//plaintext1.txt" , "r");
if (PlainText == NULL) perror ("Error opening file");
else
{
while ( ! feof (PlainText) )
{
if ( fgets (buffer , 100 , PlainText) == NULL ) break;
}
printf("Text From File");
for(int i=0;i<64;i++)
{
inputString[i]=(char)buffer[i];
printf(" %c ",inputString[i]);
}
// inputString[64]='\0';
fclose (PlainText);
}
}else{
CipherFile = fopen ("//home//ubuntu//ciphertext2.txt" , "r");
if (CipherFile == NULL) perror ("Error opening file");
else
{
while ( ! feof (CipherFile) )
{
if ( fgets (buffer , 100 , CipherFile) == NULL ) break;
}
for(int i=0;i<64;i++)
{
Cipher[i]=(char)buffer[i];
}
Cipher[64]='\0';
fclose (CipherFile);
}
PlainText = fopen ("//home//ubuntu//plaintext2.txt" , "r");
if (PlainText == NULL) printf ("Error opening file");
else
{
while ( ! feof (PlainText) )
{
if ( fgets (buffer , 100 , PlainText) == NULL ) break;
}
for(int i=0;i<64;i++)
{
inputString[i]=(char)buffer[i];
}
inputString[64]='\0';
fclose (PlainText);
}
}
}
void *clientReturn(void *arg){
char server_reply[20];
int msg_length;
if( msg_length = read(sock , server_reply , 20) < 0)
{
//br90eak;
exit(0);
}
puts(server_reply);
puts("\n server reply in clietn return");
if(strcmp(server_reply,"close")==0){
puts("ending thread\n");
cout<<pthread_self();
exit(0);
}
puts("end of client return");
}
void *desFunction(void *arg){
Key_Generation KG;
string str1;
unsigned long long int bit4 = 0;
int keyFound = -1;
int flag=0;
int msg_length=0;
int rounds = *(int*)arg;
cout << "rounds" << rounds <<endl;
KG.readInitialDataFromFile(1);
char sampleKey[64];
for(bit4=pow(2,51)*31; bit4<pow(2,56); bit4++){
bitset<64> key(bit4);
str1 = key.to_string();
for(int k=0;k<64;k++)
{
sampleKey[k] = (char)str1[k];
}
KG.Permutation_Choice1(rounds,sampleKey,&flag);
cout << "flag" << flag << endl;
if(flag == 0)
{
flag=1;
KG.readInitialDataFromFile(0);
KG.Permutation_Choice1(rounds,sampleKey,&flag);
if(flag == 0)
{
cout<<"Found: %ul:"<<bit4<<"\n";
keyFound = bit4;
write(sock,sampleKey,65);
exit(0);
break;
}
else
{
memset(sampleKey,' ',64);
write(sock,sampleKey,65);
exit(0);
cout << "not a key %d: " << bit4;
}
}
else
{ //memset(sampleKey,' ',64);
//write(sock,sampleKey,65);
// exit(0);
cout << "not a key %d: " << bit4;
}
}
}
int main(int argc, char *argv[])
{
//int sock;
int rounds = atoi(argv[1]);
struct sockaddr_in server;
//char message[1000] , server_reply[2000];
pthread_t cr,des;
//Create socket
sock = socket(AF_INET , SOCK_STREAM , 0);
if (sock == -1)
{
printf("Could not create socket");
}
server.sin_addr.s_addr = inet_addr("127.0.0.1");
server.sin_family = AF_INET;
server.sin_port = htons(3333);
//Connect to remote server
if (connect(sock , (struct sockaddr *)&server , sizeof(server)) < 0)
{
return 0;
}
pthread_create(&des,NULL,desFunction,&rounds);
pthread_create(&cr,NULL,clientReturn,NULL);
pthread_exit(NULL);
return 0;
}
| [
"yc.raghava@gmail.com"
] | yc.raghava@gmail.com |
9deff1803e77be2ffec995e34b566349cc087493 | db1979b2b8626f5e7c7a1ae47c6d2f70d573563d | /emulator/src/operations/branching.cpp | d857735a12951b7ee0cbe9b0be34cbc2ede1604c | [] | no_license | AaronJV/6808Emulator | 184920717e278115f67b2ceaa7ec6458c6827996 | 214cabcc180016a99e2c961e76fc5d7b21ef2eb7 | refs/heads/master | 2022-02-20T17:45:11.386272 | 2019-09-16T23:00:44 | 2019-09-16T23:00:44 | 140,091,148 | 0 | 0 | null | 2022-02-11T00:56:48 | 2018-07-07T14:29:01 | C++ | UTF-8 | C++ | false | false | 1,241 | cpp | #include "../m6808.hxx"
void M6808::BCC() {
FAIL();
};
void M6808::BCS() {
FAIL();
};
void M6808::BEQ() {
FAIL();
};
void M6808::CBEQ() {
FAIL();
};
void M6808::DBNZ() {
FAIL();
};
void M6808::BHCC() {
FAIL();
};
void M6808::BHCS() {
FAIL();
};
void M6808::BHI() {
FAIL();
};
void M6808::BIH() {
FAIL();
};
void M6808::BIL() {
FAIL();
};
void M6808::BLS() {
FAIL();
};
void M6808::BMC() {
FAIL();
};
void M6808::BMI() {
FAIL();
};
void M6808::BMS() {
FAIL();
};
void M6808::BNE() {
FAIL();
};
void M6808::BPL() {
FAIL();
};
void M6808::BRA() {
FAIL();
};
void M6808::BRN() {
FAIL();
};
void M6808::JMP() {
FAIL();
};
void M6808::BSR() {
FAIL();
};
void M6808::JSR() {
FAIL();
};
/**
* @brief Branch if Bit n in Memory Clear
*
* Tests bit n (n = 7, 6, 5, … 0) of location M and branches if the bit is clear
*
* CCR:
* - C: Set if Mn = 1; cleared otherwise
*/
void M6808::BRCLR() {
FAIL();
};
/**
* @brief Branch if Bit n in Memory Set
*
* Tests bit n (n = 7, 6, 5, … 0) of location M and branches if the bit is set
*
* CCR:
* - C: Set if Mn = 1; cleared otherwise
*/
void M6808::BRSET() {
FAIL();
}; | [
"aaron.vos@gmail.com"
] | aaron.vos@gmail.com |
57ab20cbd07f2d017592cefb5c9ee2705358843c | ca31ca0a28d45606100ab38e52c529a9899a925c | /agl/kernel/matrixt.h | 951fab8a62ad429f227ca20bffd65372f11913d8 | [] | no_license | Arcen/MedicalImage | e30d1edac5013fcfbe129868fa0da174e91efff8 | bf44553c7dddfe98d248033a1fd84afccafb0b97 | refs/heads/master | 2020-12-30T09:26:29.382207 | 2013-10-27T01:14:14 | 2013-10-27T01:14:14 | null | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 40,238 | h | ////////////////////////////////////////////////////////////////////////////////
// Matrix 型と要素数のテンプレート版（数値計算用のため精度と次元が必要で無いときには用いない）
// 未完成 BUG DEBUG
template<typename T>
class matrixT
{
array< vectorT<T> > mat;
// 横の行(row)をベクトルとしてもち、縦の列(column)方向の数
void allocate( const matrixT & m1, const matrixT & m2 )
{
allocate( minimum( m1.row(), m2.row() ), minimum( m1.column(), m2.column() ) );
}
void allocate( const int R, const int C )
{
mat.resize( R, 0 );
for ( int i = 0; i < R; ++i ) {
mat[i].allocate( C );
}
}
public:
matrixT() {}
matrixT( const int R, const int C ) { allocate( R, C ); zero(); }
matrixT( const matrixT & m1, const matrixT & m2 ) { allocate( m1, m2 ); zero(); }
matrixT( const matrixT & m ) { *this = m; }
matrixT & operator=( const matrixT & m ) { allocate( m.row(), m.column() ); for ( int r = 0; r < row(); ++r ) mat[r] = m.mat[r]; return *this; }
void input( const matrixC<T> & m ) { *this = matrixT( m.row(), m.column() ); for ( int r = 0; r < row(); ++r ) for ( int c = 0; c < column(); ++c ) mat[r][c] = m[r][c].real(); }
void output( matrixC<T> & m ) const { m = matrixC<T>( row(), column() ); for ( int r = 0; r < row(); ++r ) for ( int c = 0; c < column(); ++c ) m[r][c] = mat[r][c]; }
//行(row)の数、若しくは列(column)の要素数
int row() const { return mat.size; }
//列(column)の数、若しくは行(row)の要素数
int column() const { if ( ! row() ) return 0; return mat.first().dimension(); }
//演算
const matrixT operator-() const { matrixT result( row(), column() ); for ( int r = 0; r < row(); ++r ) result[r] = - mat[r]; return result; }
const matrixT operator+( const matrixT & m ) const { matrixT result( *this, m ); for ( int r = 0; r < result.row(); ++r ) result[r] = mat[r] + m.mat[r]; return result; }
const matrixT operator-( const matrixT & m ) const { matrixT result( *this, m ); for ( int r = 0; r < result.row(); ++r ) result[r] = mat[r] - m.mat[r]; return result; }
void operator+=( const matrixT & m ) { allocate( *this, m ); for ( int r = 0; r < row(); ++r ) mat[r] += m.mat[r]; }
void operator-=( const matrixT & m ) { allocate( *this, m ); for ( int r = 0; r < row(); ++r ) mat[r] -= m.mat[r]; }
const matrixT operator+( const T & m ) const { matrixT result( *this ); for ( int r = 0; r < result.row(); ++r ) result[r] += m; return result; }
const matrixT operator-( const T & m ) const { matrixT result( *this ); for ( int r = 0; r < result.row(); ++r ) result[r] -= m; return result; }
const matrixT operator*( const T & m ) const { matrixT result( *this ); for ( int r = 0; r < result.row(); ++r ) result[r] *= m; return result; }
const matrixT operator/( const T & m ) const { matrixT result( *this ); for ( int r = 0; r < result.row(); ++r ) result[r] /= m; return result; }
void operator+=( const T & m ) { for ( int r = 0; r < row(); ++r ) mat[r] += m; }
void operator-=( const T & m ) { for ( int r = 0; r < row(); ++r ) mat[r] -= m; }
void operator*=( const T & m ) { for ( int r = 0; r < row(); ++r ) mat[r] *= m; }
void operator/=( const T & m ) { for ( int r = 0; r < row(); ++r ) mat[r] /= m; }
bool operator==( const matrixT & m ) const { if ( row() != v.row() || column() != v.column() ) return false; for ( int i = 0; i < row(); ++i ) if ( mat[i] != m[i] ) return false; return true; }
bool operator!=( const matrixT & m ) const { return ! ( *this == m ); }
const vectorT<T> & operator[]( int r ) const { return mat[r]; }
vectorT<T> & operator[]( int r ) { return mat[r]; }
const matrixT operator*( const matrixT & m ) const
{
const int LR = row(), LC = column(), RR = m.row(), RC = m.column();
matrixT result = matrixT::zero( LR, RC );
for ( int r = 0; r < LR; ++r ) {
for ( int c = 0; c < RC; ++c ) {
T & sum = result[r][c];
for ( int s = 0; s < LC && s < RR; ++s ) {
sum += mat[r][s] * m[s][c];
}
}
}
return result;
}
const vectorT<T> operator*( const vectorT<T> v )
{
vectorT<T> result = vectorT<T>::zero( row() );
for ( int r = 0; r < row(); ++r ) {
T & sum = result[r];
for ( int c = 0; c < column() && c < v.dimension(); ++c ) {
sum += mat[r][c] * v[c];
}
}
return result;
}
//横ベクトルとして取り出す。
const vectorT<T> bra( int r ) const
{
return mat[r];
}
//縦ベクトルとして取り出す。
const vectorT<T> ket( int c ) const
{
vectorT<T> result( row() );
for ( int r = 0; r < row(); ++r ) {
result[r] = mat[r][c];
}
return result;
}
//横ベクトルを行列形式に変換
static matrixT bra( const vectorT<T> & v )
{
matrixT result( 1, v.dimension() );
result[0] = v;
return result;
}
//縦ベクトルを行列形式に変換
static matrixT ket( const vectorT<T> & v )
{
matrixT result( v.dimension(), 1 );
for ( int r = 0; r < v.dimension(); ++r ) {
result[r][0] = v[r];
}
return result;
}
void zero() { for ( int r = 0; r < row(); ++r ) mat[r].zero(); }
void one() { for ( int r = 0; r < row(); ++r ) mat[r].one(); }
void identity() { for ( int r = 0; r < row(); ++r ) mat[r].basis( r ); }
static const matrixT identity( int N ) { matrixT result( N, N ); result.identity(); return result; }
static const matrixT zero( int N ) { matrixT result( N, N ); result.zero(); return result; }
static const matrixT one( int N ) { matrixT result( N, N ); result.one(); return result; }
static const matrixT identity( int R, int C ) { matrixT result( R, C ); result.identity(); return result; }
static const matrixT zero( int R, int C ) { matrixT result( R, C ); result.zero(); return result; }
static const matrixT one( int R, int C ) { matrixT result( R, C ); result.one(); return result; }
//行の交換
void swapbra( int i, int j )
{
for ( int c = 0; c < column(); ++c ) swap( mat[i][c], mat[j][c] );
}
//列の交換
void swapket( int i, int j )
{
for ( int r = 0; r < row(); ++r ) swap( mat[r][i], mat[r][j] );
}
//行を別の行に係数を掛けて足す
void addbra( int from, int to, T v )
{
for ( int c = 0; c < column(); ++c ) mat[to][c] += v * mat[from][c];
}
//有効か調べる
bool valid() const
{
for ( int r = 0; r < row(); ++r ) if ( ! mat[r].valid() ) return false;
return true;
}
//0に近い要素を０にする
static const matrixT fix( const matrixT & m )
{
matrixT result( m );
for ( int i = 0; i < m.row(); ++i ) {
result[i] = vectorT<T>::fix( result[i] );
}
return result;
}
//転置
static const matrixT transpose( const matrixT & m )
{
matrixT result( m.column(), m.row() );
for ( int r = 0; r < m.row(); ++r ) {
for ( int c = 0; c < m.column(); ++c ) {
result[c][r] = m[r][c];
}
}
return result;
}
//内積
static T dot( const matrixT & left, const matrixT & right )
{
T result = 0;
for ( int r = 0; r < left.row() && r < right.row(); ++r ) {
result += vectorT<T>::dot( left[r], right[r] );
}
return result;
}
//ノルム
static T norm( const matrixT & m )
{
checkMaximum<T> mx;
for ( int r = 0; r < m.row(); ++r ) {
checkMaximum<T> mx;
T sum = 0;
for ( int c = 0; c < m.column(); ++c ) {
sum += absolute( m[r][c] );
}
mx( sum );
}
return mx ? mx() : 0;
}
//対角の積
const T trace() const
{
T result = 1;
for ( int r = 0; r < row() && r < column(); ++r ) {
result *= mat[r][r];
}
return result;
}
//対角行列
bool diagMatrix( T limit = epsilon ) const
{
T sum = 0;
for ( int r = 0; r < row(); ++r ) {
for ( int c = 0; c < column(); ++c ) {
if ( r != c ) sum += absolute( mat[r][c] );
}
}
return ( sum < limit );
}
//下三角行列
bool lowerMatrix( T limit = epsilon ) const
{
T sum = 0;
for ( int r = 0; r < row(); ++r ) {
for ( int c = 0; c < r && c < column(); ++c ) {
sum += absolute( mat[r][c] );
}
}
return ( sum < limit );
}
//上三角行列
bool upperMatrix( T limit = epsilon ) const
{
T sum = 0;
for ( int r = 0; r < row(); ++r ) {
for ( int c = r + 1; c < column(); ++c ) {
sum += absolute( mat[r][c] );
}
}
return ( sum < limit );
}
//正方行列
bool squareMatrix() const
{
if ( row() != column() ) return false;
return true;
}
//対称行列
bool symmetricMatrix() const
{
if ( row() != column() ) return false;
for ( int r = 0; r < row(); ++r ) {
for ( int c = 0; c < r; ++c ) {
if ( absolute( mat[c][r] - mat[c][r] ) > epsilon ) return false;
}
}
return true;
}
//小行列を取得
//縦方向と横方向の最初と最後の要素を指定
const matrixT minor( int rs, int cs, int re, int ce ) const
{
matrixT result( re - rs, ce - cs );
for ( int r = 0; r+rs < row() && r < result.row(); ++r ) {
for ( int c = 0; c+cs < column() && c < result.column(); ++c ) {
result[r][c] = mat[r+rs][c+cs];
}
}
return result;
}
//小行列を取得
const matrixT minor( int start, int end ) const
{
return minor( start, start, end, end );
}
//小行列をコピーして合成
void copy( int rs, int cs, const matrixT & src )
{
const int DR = row();
const int DC = column();
const int SR = src.row();
const int SC = src.column();
for ( int r = 0; r+rs < DR && r < SR; ++r ) {
for ( int c = 0; c+cs < DC && c < SC; ++c ) {
mat[r+rs][c+cs] = src[r][c];
}
}
}
//対角要素のみをもつ正方行列を作成
const matrixT diag() const
{
matrixT result = identity( minimum( row(), column() ) );
for ( int r = 0; r < row() && r < column(); ++r ) {
result[r][r] = mat[r][r];
}
return result;
}
//対角要素のベクトルを作成
const vectorT<T> diagVector() const
{
vectorT<T> result = vectorT<T>::zero( minimum( row(), column() ) );
for ( int r = 0; r < row() && r < column(); ++r ) {
result[r] = mat[r][r];
}
return result;
}
//対角行列の一般逆行列を戻す
const matrixT inverseDiag() const
{
matrixT result = identity( minimum( row(), column() ) );
for ( int r = 0; r < row() && r < column(); ++r ) {
result[r][r] = zerodivide<T>( 1, mat[r][r] );
}
return result;
}
//LU分解
//入力した行列をlu分解する
//L左下三角行列の対角成分が１，U右上三角行列でL * Uの形に行列を分解する
//ガウスの消去法で用いた対角要素に掛けた値をL行列の０にした個所に代入して置く事でLが計算できる．
//Uはガウスの消去法の結果である．
//ソースの元はアルゴリズム辞典
//注 ガウスの消去法：左下の要素を０にするために
//同じ列の対角要素の値にある値を掛けてその行全体を引く．
//これを左上から左から右へ，その後上から下へ順に行っていく手法
// LU分解の結果を用いてm*x=bからxを解く
bool luFactorization( matrixT & lu, vectorT<int> & exchange ) const
{
if ( ! squareMatrix() ) return false;
int N = row();
vectorT<T> weight( N );
exchange = vectorT<int>( N );
for ( int k = 0; k < N; k++ ) { // 各列について
exchange[k] = k;// 行交換情報の初期値
checkMaximum<T> mx;// その行の絶対値最大の要素を求める
for ( int j = 0; j < N; j++ ) {
mx( absolute( mat[k][j] ) );
}
if ( mx() == 0 ) return false; // 0 なら行列はLU分解できない
weight[k] = T( 1.0 / mx() ); // 最大絶対値の逆数
}
lu = *this;
for ( int k = 0; k < N; k++ ) { // 各行について
// より下の各行について重み×絶対値 が最大の行を見つける
{
checkMaximum<T> mx;
for ( int i = k; i < N; i++ ) {
const int ii = exchange[i];
mx( absolute( lu[ii][k] ) * weight[ii], i );
}
// 行番号を交換
swap( exchange[mx.sub], exchange[k] );
}
const int ik = exchange[k];//交換した後のk
const T vkk = lu[ik][k];//対角成分
if ( vkk == 0 ) return false;// 0 なら行列はLU分解できない
for ( int i = k + 1; i < N; i++) { // Gauss消去法
const int ii = exchange[i];//交換した後のi
lu[ii][k] /= vkk;//Lの要素
const T vik = lu[ii][k];
for ( int j = k + 1; j < N; j++) {
lu[ii][j] -= vik * lu[ik][j];
}
}
}
return true;
}
// 下三角行列として、ガウスの吐き出し法を行う
// L x = b
bool lSolve( const vectorT<T> & b, vectorT<T> & x, const vectorT<int> * exchange = NULL ) const
{
if ( ! squareMatrix() ) return false;
const int N = row();
if ( exchange && exchange->dimension() != N ) return false;
if ( b.dimension() != N ) return false;
x = vectorT<T>::zero( N );
// l * x = bを解く
for ( int i = 0; i < N; i++ ) {
const int ii = exchange ? (*exchange)[i] : i;
T t = b[ii];
for ( int j = 0; j < i; j++ ) {
t -= mat[ii][j] * x[j];
}
x[i] = zerodivide( t, mat[ii][i] );//0ならば不定
}
return true;
}
// 上三角行列として、ガウスの吐き出し法を行う
// R x = b
bool rSolve( const vectorT<T> & b, vectorT<T> & x, const vectorT<int> * exchange = NULL ) const
{
if ( ! squareMatrix() ) return false;
const int N = row();
if ( exchange && exchange->dimension() != N ) return false;
if ( b.dimension() != N ) return false;
x = vectorT<T>::zero( N );
// r * x = bを解く
for ( int i = N - 1; i >= 0; i-- ) {
const int ii = exchange ? (*exchange)[i] : i;
T t = b[ii];
for ( int j = i + 1; j < N; j++ ) {
t -= mat[ii][j] * x[j];
}
x[i] = zerodivide( t, mat[ii][i] );//0ならば不定
}
return true;
}
//LU分解にて方程式を解く（this=lu）LU x = b
bool luSolve( const vectorT<T> & b, vectorT<T> & x, const vectorT<int> * exchange = NULL ) const
{
matrixT L = *this;
matrixT R = *this;
for ( int r = 0; r < row(); ++r ) {
const int rr = exchange ? (*exchange)[r] : r;
L[rr][r] = 1;
for ( int c = r + 1; c < column(); ++c ) {
L[rr][c] = 0;
}
for ( int c = 0; c < r; ++c ) {
R[rr][c] = 0;
}
}
// L U x = b
// L y = bを解き、U x = yを解く
vectorT<T> y;
if ( ! L.lSolve( b, y, exchange ) ) return false;
if ( ! R.rSolve( y, x, exchange ) ) return false;
return true;
}
//GramSchmidt
//直交ベクトルを計算する。
//条件：各列ベクトルが1次独立でない場合には、数は少なくなる。
void gramSchmidt( matrixT & q ) const
{
if ( row() < column() ) {//横長ならば、転置して計算する
matrixT AT = transpose( *this );
AT.gramSchmidt( q );
q = transpose( q );
return;
}
//縦長なので、列ベクトルを直交するように求める
const int R = row();
const int C = column();
//グラムシュミットの方法
matrixT AT = transpose( *this );
array< vectorT<T> > orthogonal;
orthogonal.reserve( C );
for ( int c = 0; c < C; ++c ) {
const vectorT<T> & vc = AT[c];//c列のベクトル
vectorT<T> vo = vc;//直交するベクトル
//これまでに求めたベクトル群と平行な成分は全て削除する
for ( int i = 0; i < orthogonal.size; ++i ) {
vo -= orthogonal[i] * vectorT<T>::dot( vc, orthogonal[i] );
}
//垂直な成分があるか調べる
T n = vectorT<T>::norm( vo );
if ( n < epsilon ) continue;//垂直な成分が無いので、独立ではないため削除
orthogonal.push_back( vo / n );//正規化して保存
}
q.allocate( orthogonal.size, R );
for ( int c = 0; c < orthogonal.size; ++c ) {
q[c] = orthogonal[c];
}
q = transpose( q );
}
//行列の階数 SVDによる解法が普通みたいだが、1次独立なベクトルがいくつあるかを計算して求める
int rank() const
{
matrixT q;
gramSchmidt( q );
return minimum( q.row(), q.column() );
}
//QR分解
//行列Aを直交行列Qと右上三角行列Rに分解する．
//条件：各列ベクトルが1次独立、正方か縦長の行列であること
void qrFactorization( matrixT & q, matrixT & r ) const
{
//if ( row() < column() ) return false;//縦長の行列の時のみ計算可能
const int R = row();
const int C = column();
//修正グラムシュミットの方法
matrixT qT = transpose( *this );
r = identity( C );
for ( int k = 0; k < C; ++k ) {
//対角要素について
T & rkk = r[k][k];
rkk = vectorT<T>::norm( qT[k] );
//零ベクトルでも計算を続ける
qT[k] /= rkk;//rkk=0->qTk=0
for ( int j = k + 1; j < C; ++j ) {//その右
T & rkj = r[k][j];
rkj = vectorT<T>::dot( qT[k], qT[j] );//rkk=0->rkj=0
qT[j] -= qT[k] * rkj;
}
}
q = transpose( qT );
}
//行列をQR変換し、吐き出し法で方程式を解く
bool qrSolve( const vectorT<T> & b, vectorT<T> & x ) const
{
matrixT q, matrixT r;
qrFactorization( q, r );
// q r x = b
// r x = qT b
return r.rSolve( transpose( q ) * b, x );
}
//QR変換
//A=QRと分解し、A'=RQと変換する。これは、A'=Q'AQで相似変換
//P^-1APと相似変換を行う時のPも戻す
//条件：正方行列、QR分解可能（各列ベクトルが1次独立）
bool qrTransform( matrixT & P )
{
if ( ! squareMatrix() ) return false;
matrixT q, r;
qrFactorization( q, r );
*this = r * q;
P = transpose( q );
return true;
}
//コレスキー分解 mat=L (L*)の形に分解
//条件，正定値対称正則（全ての固有値が正），全ての主座小行列式が非零
bool choleskyFactorization( matrixT & l ) const
{
if ( ! symmetricMatrix() ) return false;
const int N = row();
l = identity( N );
for ( int i = 0; i < N; ++i ) {
for ( int j = 0; j < i; ++j ) {
T sum = 0;
for ( int k = 0; k < j; ++k ) {
sum += l[i][k] * l[j][k];
}
l[i][j] = zerodivide( sqrt( mat[i][j] - sum ), l[j][j] );
}
T sum = 0;
for ( int k = 0; k < i; ++k ) {
sum += l[i][k] * l[i][k];
}
T & lii = l[i][i];
lii = mat[i][i] - sum;
if ( lii <= 0 ) return false;
lii = sqrt( lii );
}
return true;
}
//修正コレスキー分解 mat=L D (L*)の形に分解
//条件，対称正則，全ての主座小行列式が非零
bool choleskyFactorization( matrixT<T> & l, matrixT<T> & d ) const
{
if ( ! symmetricMatrix( *this ) ) return false;
const int N = row();
l = identity( N );
d = identity( N );
for ( int i = 0; i < N; ++i ) {
for ( int j = 0; j < i; ++j ) {
T & lij = l[i][j];
lij = mat[i][j];
for ( int k = 0; k < j; ++k ) {
lij -= d[k][k] * l[i][k] * l[j][k];
}
if ( lij < 0 ) return false;
lij = zerodivide( lij, d[j][j] );
}
T & dii = d[i][i];
dii = mat[i][i];
for ( int k = 0; k < i; ++k ) {
dii -= d[k][k] * square( l[i][k] );
}
if ( dii <= 0 ) return false;
}
return true;
}
//逆行列
bool inverse( matrixT<T> & result ) const
{
if ( ! squareMatrix() ) {
result = generalInverse();//特異値分解が必要
return false;
}
const int N = row();
result = identity( N );
//LU分解
matrixT lu;//計算用
vectorT<int> exchange;//ピボット選択のためのテーブル 行を入れ替える
if ( ! luFactorization( lu, exchange ) ) {
result = generalInverse();//特異値分解が必要
return false;
}
//ｘに逆行列の１列が入るようにｂを単位行列から抜き出して計算する
vectorT<T> b;
vectorT<T> x;
for ( int i = 0; i < N; ++i ) {
b = vectorT<T>::zero( N );
b[i] = 1;
if ( ! lu.luSolve( b, x, & exchange ) ) {
result = generalInverse();//特異値分解が必要
return false;
}
for ( int j = 0; j < N; ++j ) result[j][i] = x[j];
}
return true;
}
//行列値
static T determinant( const matrixT<T> & m )
{
if ( ! m.squareMatrix() ) return 0;
const int N = m.row();
if ( N == 1 ) return m[0][0];
//次元が大きいときにはLU分解し，対角要素の積から行列式を計算する
matrixT lu;//計算用
vectorT<int> exchange;//ピボット選択のためのテーブル 行を入れ替える
if ( ! m.luFactorization( lu, exchange ) ) return 0;
T result = 1;
for ( int i = 0; i < N; ++i ) result *= lu[exchange[i]][i];
return result;
}
//正規化
static const matrixT normalize( const matrixT & m )
{
T l = determinant( m );
if ( absolute( l - 1 ) < epsilon ) return m;
return m / l;
}
//Householder変換
//列ベクトルvに垂直な平面鏡に映った列ベクトルxの像yは
//u=normalize(v)
//y=x-2(u･x)u
//y=(E-2v(vT)/((vT)v) 行列形式
//x(x1,...,xn)Tをy(x1,...,xi,y,0,...,0)T に移すHouseholder変換 0<=i<=N-2
//s=length(xi+1,...,xn) 長さを計算
//y=-sign( x[i] )*|s| 符号に気をつけて、yの要素を計算
//v=c(x-y)のため v(0,...,0,c( (xi+1) - y ), c(xi+2),...,c xn)
//cはvが√２の長さを持つための係数
//v・v = s^2 + y^2 - 2 xi y = 2 ( s^2 + | xi | * |s| ) = 2 c
//c=s^2 + | xi | * |s|で割ればいい。
//i: number of constant element
void householder( const vectorT<T> & x, vectorT<T> & v, T & y, int constant )
{
const int N = x.dimension();
*this = identity( N );
v = vectorT<T>::zero( N );
y = 0;
if ( N <= 0 || ! between( 0, constant, N - 2 ) ) {//無変換
return;
}
T s = 0;//変更可能な要素のユークリッドノルムを計算
for ( int j = constant; j < N; ++j ) {
s += square( x[j] );
}
s = sqrt( s );
if ( s == 0 ) {//長さが０なので，全て０．変換は単位行列
return;
}
y = - plus( x[constant] ) * s;//y=-sign( x[i] )*|s|
v = x;
for ( int j = 0; j < constant; ++j ) {
v[j] = 0;
}
v[constant] = x[constant] - y;
const T c = ::sqrt( square( s ) + absolute( x[constant] * s ) );
v /= c;
*this -= ket( v ) * bra( v );//縦ベクトルｘ横ベクトルで行列にして，単位行列から引く
}
//x(x1,...,xn)Tをy(y1,0,...,0)T |にうつす変換
//二重対角化で用いる
void householder1( const vectorT<T> & x, vectorT<T> & v, T & y1 )
{
householder( x, v, y1, 0 );
}
//x(x1,...,xn)Tをy(x1,y2,0,...,0)T |にうつす変換
//三重対角化、Hessenberg化で用いる
void householder2( const vectorT<T> & x, vectorT<T> & v, T & y2 )
{
householder( x, v, y2, 1 );
}
//Givens変換
// ( c, -s )
// ( s, c )
//単位行列において、を変換したい２つの行、列の対応する位置にcosθと±sinθの要素をもつ回転変換
//通常２つの行または列のうちある要素を零にするように回転する。
//G (a,b)T，aを零にするようなGivens変換の角度を返す
static const T givensLeftA( const T a, const T b )
{ return atan2( a, b ); }
//G (a,b)T，bを零にするようなGivens変換の角度を返す
static const T givensLeftB( const T a, const T b )
{ return atan2( -b, a ); }
//(a,b) G，aを零にするようなGivens変換の角度を返す
static const T givensRightA( const T a, const T b )
{ return atan2( -a, b ); }
//(a,b) G，bを零にするようなGivens変換の角度を返す
static const T givensRightB( const T a, const T b )
{ return atan2( b, a ); }
//左側から掛けて，iとkの行を変更しi,jの要素を０にするようなGivens変換行列を返す
const matrixT givensLeft( const int i, const int j, const int k )
{
matrixT g = identity( row(), column() );
const T & sita = ( j < i ) ? //消す要素が対角線からどちらにあるかが指標となる
givensLeftB( mat[k][j], mat[i][j] ) ://左下にある場合
givensLeftA( mat[i][j], mat[k][j] );//右上にある場合
const T & c = cos( sita );
const T & s = sin( sita );
//左下の要素に正のsが来るようにする
if ( k < i ) {
g[k][k] = c; g[k][i] = -s;
g[i][k] = s; g[i][i] = c;
} else {
g[i][i] = c; g[i][k] = -s;
g[k][i] = s; g[k][k] = c;
}
return g;
}
//右側から掛けて，kとjの列を変更しi,jの要素を０にするようなGivens変換行列を返す
const matrixT givensRight( const int i, const int j, const int k )
{
matrixT g = identity( row(), column() );
const T & sita = ( j < i ) ?
givensRightA( mat[i][j], mat[i][k] ) :
givensRightB( mat[i][k], mat[i][j] );
const T & c = cos( sita );
const T & s = sin( sita );
if ( j < k ) {
g[j][j] = c; g[j][k] = -s;
g[k][j] = s; g[k][k] = c;
} else {
g[k][k] = c; g[k][j] = -s;
g[j][k] = s; g[j][j] = c;
}
return g;
}
//左側から掛けて，iとjの行を変更しi,jの要素を０にするようなGivens変換行列を返す
const matrixT givensLeft( const int i, const int j )
{
return givensLeft( i, j, j );
}
//右側から掛けて，iとjの列を変更しi,jの要素を０にするようなGivens変換行列を返す
const matrixT givensRight( const int i, const int j )
{
return givensRight( i, j, i );
}
//三重対角化
//A->P† D3 Pと相似変換を行う時のPも戻す
void diag3( matrixT & P, bool U = true )
{
*this = fix( *this );
const int N = row();
P = identity( N );
if ( ! squareMatrix() ) return;
vectorT<T> x, v, vi;
x = vectorT<T>::zero( N );
v = vectorT<T>::zero( N );
T y2;
matrixT Pi;
for ( int i = 0; i < N - 2; ++i ) {
//右下の小行列だけを気にする
x = vectorT<T>::zero( N - i );//０にする列の要素だけを取り出す
for ( int j = i; j < N; ++j ) {
x[j-i] = mat[j][i];
}
Pi.householder2( x, vi, y2 );
//次元をあわせる
for ( int j = 0; j < i; ++j ) v[j] = 0;
for ( int j = i; j < N; ++j ) v[j] = vi[j-i];
Pi = identity( N ) - ket( v ) * bra( v );
P = P * Pi;//hessenberg化のときの射影は正規直交行列のため、転置はいらない
*this = fix( Pi * *this * Pi );
//零になっている個所を０に書き換えておく
for ( int j = i + 2; j < N; ++j ) {
if ( U ) mat[i][j] = 0;//Uがfalseの時には，右上に要素があるhessenberg化を行っている
mat[j][i] = 0;
}
}
}
//Hessenberg化
void hessenberg( matrixT & P )
{
diag3( P, false );
}
//二重対角化
//householder変換により，左右から異なる直交変換で二重対角化を行う．
//条件：正方行列
//A->L D2 R=diag2と直交変換を行う時のL,Rも戻す
void diag2( matrixT & L, matrixT & R )
{
*this = fix( *this );
L = identity( row() );
R = identity( column() );
vectorT<T> x, v;
T y;
matrixT P;
for ( int i = 0; i < row() - 1 && i < column() - 1; ++i ) {
//[i][i]より下の値を０とする
x = ket( i );
P.householder( x, v, y, i );
L = P * L;
*this = fix( P * *this );
if ( i == column() - 2 ) break;//ここで終了判定
//[i][i+1]より右の値を０とする
x = bra( i );
P.householder( x, v, y, i+1 );
R = R * P;
*this = fix( *this * P );
}
}
private:
////////////////////////////////////////////////////////////////////////////////
//三重対角化対称行列の[3][0],[0][3]の非対角要素が０の時に３重対角行列に戻すための追い込み
//追い込みの順序はドキュメント参照
void chasingDiag3( matrixT & u )
{
if ( column() <= 2 ) return;
const int c = column();
for ( int i = 2; i < column(); ++i ) {
if ( mat[i][i-2] == 0 ) return;
const matrixT & g = givensLeft( i, i - 2, i - 1 );
// ( U† G† ) G A G† ( G U )
u = g * u;
*this = fix( g * *this * transpose( g ) );
}
}
////////////////////////////////////////////////////////////////////////////////
//三重対角化対称行列用の固有値分解
//A=U† D Uに分解 Dは自身に入る
//U A U†=D
void evd4diag3( matrixT & u )
{
// U† D3 U ->U'† D U'
const int C = column();
//１列の三重対角行列の場合には，固有値分解が終了している
if ( C == 1 ) return;
while ( ! diagMatrix() ) {
//最初のGivens変換を求める。
matrixT G = identity( C, C );
{
const T & a = mat[0][0];
const T & b = mat[1][0];
const T & d = mat[1][1];
const T D = square( a - d ) + 4 * square( b );
const T lamda = ( a + d - sqrt( D ) ) / 2;
const T size = sqrt( square( a - lamda ) + square( b ) );
G[0][0] = ( a - lamda ) / size; G[0][1] = -b / size;
G[1][0] = b / size; G[1][1] = ( a - lamda ) / size;
}
// G† A Gとして変形する
matrixT GT = transpose( G );
u = GT * u;// ( U† G ) G† A G ( G† U )
*this = fix( GT * *this * G );
chasingDiag3( u );
//左上の非対角要素をチェック
if ( absolute( mat[1][0] ) < epsilon ) {
//この状態でi,iで４つに分けた時には右上も零行列になるため、２つに分けて処理を行う
//C==2なら、すでに対角化済みである。
if ( C == 2 ) return;
// 固有値を一つ固定し、右下の行列のみで計算する
matrixT d1 = minor( 1, 1, row(), column() );
matrixT u1 = identity( d1.column(), d1.column() );
d1.evd4diag3( u1 );
copy( 1, 1, d1 );
matrixT nu = identity( row(), column() );
nu.copy( 1, 1, u1 );
u = nu * u;
return;
}
}
}
public:
////////////////////////////////////////////////////////////////////////////////
//固有値の解析用に固有値の絶対値の大きい順にソート
static void sort4evd( vectorT<T> & values, matrixT & vectors )
{
const int N = values.dimension();
//選択ソート
for ( int i = 0; i < N; ++i ) {
//最大を探す
checkMaximum<T> mx;
for ( int j = i; j < N; ++j ) {
mx( absolute( values[j] ), j );
}
if ( i != mn.sub ) {
swap( values[i], values[mx.sub] );
swap( vectors[i], vectors[mx.sub] );
}
}
}
////////////////////////////////////////////////////////////////////////////////
//実対称行列の固有値と固有ベクトル
//Householder-QR法による
//非対象実行列の固有値・固有ベクトルは複素数になり、一般逆行列を求めるだけならば特異値分解で十分なため、実対称行列のみとする。
bool eigen( vectorT<T> & values, matrixT & vectors ) const
{
if ( ! symmetricMatrix() ) return false;
//三重対角行列に変更
matrixT A = *this;
// A->P† D3 P
A.diag3( vectors );
//固有値分解
// P† D3 P ->U† D U
A.evd4diag3( vectors );
values = A.diagVector();
vectors = transpose( vectors );//evec eval evec†にする
//sort4evd( values, vectors );
return true;
}
////////////////////////////////////////////////////////////////////////////////
//冪乗法
//最大の固有値と対応する固有ベクトルを求める
void powerMethod( T & eigenvalue, vectorT<T> & eigenvector ) const
{
eigenvector = vectorT<T>::normalize( vectorT<T>::one( column() ) );
do {
eigenvalue = vectorT<T>::dot( eigenvector, *this * eigenvector );
eigenvector = vectorT<T>::normalize( *this * eigenvector );
} while ( absolute( eigenvalue - vectorT<T>::dot( eigenvector, *this * eigenvector ) ) < tiny );
}
////////////////////////////////////////////////////////////////////////////////
//レイリー商逆反復法
//固有ベクトルの近似値から固有値を得、固有ベクトルも近似していく
void rayleighQuotientInverseIterationMethod( T & eigenvalue, vectorT<T> & eigenvector ) const
{
matrixT A = *this;
matrixT I = identity( row() );
eigenvalue = rayleighQuotient( eigenvector );
while ( vectorT<T>::norm( *this * eigenvector - eigenvector * eigenvalue ) > epsilon ) {
vectorT<T> nv = eigenvector;
( A - I * eigenvalue ).qrSolve( eigenvector, nv );
eigenvector = normalize( nv );
eigenvalue = rayleighQuotient( eigenvector );
};
}
////////////////////////////////////////////////////////////////////////////////
//レイリー商
//近似的な固有ベクトルから，固有値を計算する
const T rayleighQuotient( const vectorT<T> & eigenvector ) const
{
return zerodivide( vectorT<T>::dot( *this * eigenvector, eigenvector ),
vectorT<T>::dot( eigenvector, eigenvector ) );
}
private:
////////////////////////////////////////////////////////////////////////////////
//特異値分解
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
//縦型長方二重対角行列の右下の対角要素が０の時にその上の要素を０にするためのGivens変換
//追い込みの順序はドキュメント参照
void chasingRightBottom( matrixT & u )
{
if ( column() <= 1 ) return;
const int c = column();
for ( int i = c - 2; 0 <= i; --i ) {
if ( mat[i][c-1] == 0 ) return;
const matrixT & g = givensRight( i, c - 1 );
u = u * g;// X * G * G† * U†=X * G * (U*G)†
*this = fix( *this * g );
}
}
////////////////////////////////////////////////////////////////////////////////
//縦型長方二重対角行列の右下でない対角要素が０の時にその右の要素を０にするためのGivens変換
//追い込みの順序はドキュメント参照
void chasingDiag( matrixT & v, const int i )
{
if ( column() <= 1 ) return;
const int c = column();
for ( int j = i + 1; j < c; ++j ) {
if ( absolute( mat[i][j] ) < epsilon ) return;
const matrixT & g = givensLeft( i, j );
v = v * transpose( g );
*this = fix( g * *this );
}
}
////////////////////////////////////////////////////////////////////////////////
//縦型長方二重対角行列の対角要素とその上の要素が非０の時に対角行列に近づける
//追い込みの順序はドキュメント参照
void chasing( matrixT & v, matrixT & u )
{
if ( column() <= 1 ) return;
const matrixT & g01 = givensRight( 0, 1 );
u = u * g01;
*this = fix( *this * g01 );
const matrixT & g10 = givensLeft( 1, 0 );
v = v * transpose( g10 );
*this = fix( g10 * *this );
const int c = column();
const int r = row();
int i = 0, j = 2;
for ( ; i < r && j < c; ) {
const matrixT & gr = givensRight( i, j, i+1 );
u = u * gr;
*this = fix( *this * gr );
i += 2; j -= 1;
if ( ! ( i < r && j < c ) ) break;
const matrixT & gl = givensLeft( i, j );
v = v * transpose( gl );
*this = fix( gl * *this );
i -= 1; j += 2;
}
}
////////////////////////////////////////////////////////////////////////////////
//二重対角化行列用の特異値分解
//A=V D U†に分解 Dは自身に入る
void svd4diag2( matrixT & v, matrixT & u )
{
//零要素を検索
const int C = column();
//１列の二重対角行列の場合には，特異値分解が終了している
if ( C == 1 ) return;
while ( ! diagMatrix() ) {
//右下の対角要素をチェック
if ( absolute( mat[C-1][C-1] ) < epsilon ) {
chasingRightBottom( u );//左側から追い込んでその上の要素を全て零にする
}
for ( int i = C - 2; 0 <= i; --i ) {
// i, iの対角要素をチェック
if ( absolute( mat[i][i] ) < epsilon ) {
chasingDiag( v, i );//右側から追い込んでその右の要素を全て零にする
}
// i, i+1をチェック
if ( absolute( mat[i][i+1] ) < epsilon ) {
//この状態でi,iで４つに分けた時には右上も零行列になるため、２つに分けて処理を行う
// i,iまでとi+1,i+1からで二つにわける
matrixT d1 = minor( 0, 0, i + 1, i + 1 );
matrixT v1 = identity( d1.row(), d1.row() );
matrixT u1 = identity( d1.column(), d1.column() );
d1.svd4diag2( v1, u1 );
matrixT d2 = minor( i + 1, i + 1, row(), column() );
matrixT v2 = identity( d2.row(), d2.row() );
matrixT u2 = identity( d2.column(), d2.column() );
d2.svd4diag2( v2, u2 );
*this = zero( row(), column() );
copy( 0, 0, d1 );
copy( d1.row(), d1.column(), d2 );
matrixT nv = zero( row(), row() );
nv.copy( 0, 0, v1 );
nv.copy( v1.row(), v1.column(), v2 );
v = v * nv;
matrixT nu = zero( column(), column() );
nu.copy( 0, 0, u1 );
nu.copy( u1.row(), u1.column(), u2 );
u = u * nu;
return;
}
}
//追い込み
chasing( v, u );
}
}
public:
////////////////////////////////////////////////////////////////////////////////
//特異値分解用に特異値の絶対値の大きい順にソート
static void sort4svd( matrixT & v, matrixT & d, matrixT & u )
{
const int N = minimum( d.row(), d.column() );
//選択ソート
for ( int i = 0; i < N; ++i ) {
//最大を探す
checkMaximum<T> mx;
for ( int j = i; j < N; ++j ) {
mx( absolute( d[j][j] ), j );
}
if ( i != mn.sub ) {
swap( d[i][i], d[mx.sub][mx.sub] );
swap( v[i], v[mx.sub] );
swap( u[i], u[mx.sub] );
}
}
}
////////////////////////////////////////////////////////////////////////////////
//特異値分解
//A=V D U†に分解
//二重対角化を行い，Givens変換により非対角化要素を追い込みで零に近づけて，分解を行う手法
//条件：無し ただし，未ソート
void singularValueDecomposition( matrixT & v, matrixT & d, matrixT & u ) const
{
const int R = row();
const int C = column();
if ( C < R ) {//縦長方行列へ変換
matrixT A = transpose( *this );
A.singularValueDecomposition( u, d, v );
u = transpose( u );
v = transpose( v );
return;
}
//二重対角化行列へ変換
d = *this;
d.diag2( u, v );// A -> u A v = A'として二重対角化
// A = v† A' u†分解としては逆になる
v = transpose( v );// v A u†形式に変換
d.svd4diag2( v, u );//分解
//sort4svd( v, d, u );//ソート
}
////////////////////////////////////////////////////////////////////////////////
//Moore-Penroseの一般逆行列
const matrixT generalInverse() const
{
matrixT v, d, u;// A=v d u†と分解
singularValueDecomposition( v, d, u );
// A^+ = u 1/d v†
return u * d.inverseDiag() * transpose( v );
}
////////////////////////////////////////////////////////////////////////////////
//デバッグ用文字出力
static void debug( const matrixT & m, const char * tag = NULL )
{
if ( tag ) {
OutputDebugString( tag );
OutputDebugString( ":[matrix]\n" );
}
for ( int i = 0; i < m.row(); ++i ) {
vectorT<T>::debug( m[i] );
}
}
};
//四則演算
template<typename T>
const matrixT<T> operator+( const T & s, const matrixT<T> & m ) { return m + s; }
template<typename T>
const matrixT<T> operator-( const T & s, const matrixT<T> & m ) { return - m + s; }
template<typename T>
const matrixT<T> operator*( const T & s, const matrixT<T> & m ) { return m * s; }
template<typename T>
const matrixT<T> operator/( const T & s, const matrixT<T> & m )
{
matrixT<T> result( m );
for ( int r = 0; r < result.row(); ++r ) {
for ( int c = 0; c < result.column(); ++c ) {
result[r][c] = s / m[r][c];
}
}
return r;
}
template<typename T>
const vectorT<T> operator*( const vectorT<T> v, const matrixT<T> & m )
{
vectorT<T> result = vectorT<T>::zero( column() );
for ( int c = 0; c < column(); ++c ) {
T & sum = result[c];
for ( int r = 0; r < row() && r < v.dimension(); ++r ) {
sum += v[r] * m[r][c];
}
}
return result;
}
| [
"akira_asakura@dwango.co.jp"
] | akira_asakura@dwango.co.jp |
4fc07e3ffd7207f2fe00af68d4f61a968d1f99a8 | ee7390c9affabf29b5f048d6b79282a7448402df | /mvinuse.cpp | 8bd65f707e9ec39c03758ce70e986f856e021f9a | [] | no_license | sudarkoff/sandbox | cd369656f2c24866a8ad501c9be0e7e6ece6680a | ea4f2333547af0560cf51e3d84e88d872cbfe431 | refs/heads/master | 2016-09-06T05:58:46.959587 | 2014-09-22T23:39:57 | 2014-09-22T23:39:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 801 | cpp | #define STRICT
#include <windows.h>
#include <iostream>
int main(int argc, char* argv[])
{
if (argc < 3) {
std::cout << "Renames file that is currently in use.\n"
"\nUSAGE:\n\tmvinuse <src> <dst>\n";
return -1;
}
BOOL res = MoveFileEx(argv[1], argv[2], MOVEFILE_DELAY_UNTIL_REBOOT);
if (!res) {
DWORD err = GetLastError();
LPVOID lpMsgBuf;
FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM,
NULL, err, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPTSTR) &lpMsgBuf, 0, NULL);
std::cerr << "ERROR: " << lpMsgBuf << std::endl;
LocalFree( lpMsgBuf );
return err;
}
else {
std::cout << "Now, reboot the computer.\n";
return 0;
}
} | [
"george@sudarkoff.com"
] | george@sudarkoff.com |
7b60b8a529be644f2e57e5969a4ecc589bfe77b3 | f3f4f5a48b5ec2216b5c8e6cfe36dc9300aa8716 | /Lab2/AnalizatorLexical/StateMachine.h | f1172a7ef279be1b74db09919d549254456004f7 | [] | no_license | EpiCame/LFTC | 2013f3e7d33e8ad86991e292399a5a6cbd305f69 | 0082a223548bf9d006708e857af39f59c3eba54e | refs/heads/main | 2023-08-31T12:25:57.996730 | 2021-11-05T16:02:15 | 2021-11-05T16:02:15 | 415,064,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 785 | h | #pragma once
#include "State.h"
#include "Alphabet.h"
#include<string>
#include<set>
#include<vector>
using namespace std;
class StateMachine
{
private:
string filename;
State initialState;
vector<State> states = vector<State>();
Alphabet alphabet = Alphabet();
bool finiteAutomata;
bool checkFiniteAutomata();
// settere
void setInitialState(string line);
void setStates(string line);
void setFinalStates(string line);
void setTransitions(string line);
void setStateTransition(string line);
void setAlphabet(string line);
void readFromFile();
bool checkIfAlphabetContainsLetters(string str);
public:
StateMachine(string filename);
bool checkSequence(string input);
string findPrefix(string input);
~StateMachine();
};
| [
"noreply@github.com"
] | EpiCame.noreply@github.com |
3b7381212e4917b329e6a3ea3d92f7a0d9077de4 | e65e6b345e98633cccc501ad0d6df9918b2aa25e | /Atcoder/Grand/050/A.cpp | a163fe4ed1875901e18487a6e6959b90d532029b | [] | no_license | wcysai/CodeLibrary | 6eb99df0232066cf06a9267bdcc39dc07f5aab29 | 6517cef736f1799b77646fe04fb280c9503d7238 | refs/heads/master | 2023-08-10T08:31:58.057363 | 2023-07-29T11:56:38 | 2023-07-29T11:56:38 | 134,228,833 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 762 | cpp | #pragma GCC optimize(3)
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> P;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef __gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;
int n;
int main()
{
scanf("%d",&n);
if(n==1) {puts("1 1"); return 0;}
for(int i=1;i<=n;i++)
{
int x=2*i%n,y=(2*i+1)%n;
if(x==0) x=n; if(y==0) y=n;
printf("%d %d\n",x,y);
}
return 0;
}
| [
"wcysai@foxmail.com"
] | wcysai@foxmail.com |
13bb12a1a97b7b7e8bdbede655c5e25acc7b99c6 | 6581ff32670e4b30dd17c781975c95eac2153ebc | /libnode-v10.15.3/deps/v8/src/arm/simulator-arm.cc | e8eb4740900c211aad305df742c1bc2f54d8eccc | [
"Apache-2.0",
"LicenseRef-scancode-unicode",
"Zlib",
"ISC",
"LicenseRef-scancode-public-domain",
"NAIST-2003",
"BSD-3-Clause",
"BSD-2-Clause",
"Artistic-2.0",
"LicenseRef-scancode-unknown-license-reference",
"NTP",
"LicenseRef-scancode-openssl",
"MIT",
"ICU",
"LicenseRef-scancode-free-un... | permissive | pxscene/Spark-Externals | 6f3a16bafae1d89015f635b1ad1aa2efe342a001 | 92501a5d10c2a167bac07915eb9c078dc9aab158 | refs/heads/master | 2023-01-22T12:48:39.455338 | 2020-05-01T14:19:54 | 2020-05-01T14:19:54 | 205,173,203 | 1 | 35 | Apache-2.0 | 2023-01-07T09:41:55 | 2019-08-29T13:43:36 | C | UTF-8 | C++ | false | false | 208,273 | 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 <stdarg.h>
#include <stdlib.h>
#include <cmath>
#if V8_TARGET_ARCH_ARM
#include "src/arm/constants-arm.h"
#include "src/arm/simulator-arm.h"
#include "src/assembler-inl.h"
#include "src/base/bits.h"
#include "src/codegen.h"
#include "src/disasm.h"
#include "src/macro-assembler.h"
#include "src/objects-inl.h"
#include "src/runtime/runtime-utils.h"
#if defined(USE_SIMULATOR)
// Only build the simulator if not compiling for real ARM hardware.
namespace v8 {
namespace internal {
// static
base::LazyInstance<Simulator::GlobalMonitor>::type Simulator::global_monitor_ =
LAZY_INSTANCE_INITIALIZER;
// This macro provides a platform independent use of sscanf. The reason for
// SScanF not being implemented in a platform independent way through
// ::v8::internal::OS in the same way as SNPrintF is that the
// Windows C Run-Time Library does not provide vsscanf.
#define SScanF sscanf // NOLINT
// The ArmDebugger class is used by the simulator while debugging simulated ARM
// code.
class ArmDebugger {
public:
explicit ArmDebugger(Simulator* sim) : sim_(sim) { }
void Stop(Instruction* instr);
void Debug();
private:
static const Instr kBreakpointInstr =
(al | (7*B25) | (1*B24) | kBreakpoint);
static const Instr kNopInstr = (al | (13*B21));
Simulator* sim_;
int32_t GetRegisterValue(int regnum);
double GetRegisterPairDoubleValue(int regnum);
double GetVFPDoubleRegisterValue(int regnum);
bool GetValue(const char* desc, int32_t* value);
bool GetVFPSingleValue(const char* desc, float* value);
bool GetVFPDoubleValue(const char* desc, double* value);
// Set or delete a breakpoint. Returns true if successful.
bool SetBreakpoint(Instruction* breakpc);
bool DeleteBreakpoint(Instruction* breakpc);
// Undo and redo all breakpoints. This is needed to bracket disassembly and
// execution to skip past breakpoints when run from the debugger.
void UndoBreakpoints();
void RedoBreakpoints();
};
void ArmDebugger::Stop(Instruction* instr) {
// Get the stop code.
uint32_t code = instr->SvcValue() & kStopCodeMask;
// Print the stop message and code if it is not the default code.
if (code != kMaxStopCode) {
PrintF("Simulator hit stop %u\n", code);
} else {
PrintF("Simulator hit\n");
}
Debug();
}
int32_t ArmDebugger::GetRegisterValue(int regnum) {
if (regnum == kPCRegister) {
return sim_->get_pc();
} else {
return sim_->get_register(regnum);
}
}
double ArmDebugger::GetRegisterPairDoubleValue(int regnum) {
return sim_->get_double_from_register_pair(regnum);
}
double ArmDebugger::GetVFPDoubleRegisterValue(int regnum) {
return sim_->get_double_from_d_register(regnum).get_scalar();
}
bool ArmDebugger::GetValue(const char* desc, int32_t* value) {
int regnum = Registers::Number(desc);
if (regnum != kNoRegister) {
*value = GetRegisterValue(regnum);
return true;
} else {
if (strncmp(desc, "0x", 2) == 0) {
return SScanF(desc + 2, "%x", reinterpret_cast<uint32_t*>(value)) == 1;
} else {
return SScanF(desc, "%u", reinterpret_cast<uint32_t*>(value)) == 1;
}
}
return false;
}
bool ArmDebugger::GetVFPSingleValue(const char* desc, float* value) {
bool is_double;
int regnum = VFPRegisters::Number(desc, &is_double);
if (regnum != kNoRegister && !is_double) {
*value = sim_->get_float_from_s_register(regnum).get_scalar();
return true;
}
return false;
}
bool ArmDebugger::GetVFPDoubleValue(const char* desc, double* value) {
bool is_double;
int regnum = VFPRegisters::Number(desc, &is_double);
if (regnum != kNoRegister && is_double) {
*value = sim_->get_double_from_d_register(regnum).get_scalar();
return true;
}
return false;
}
bool ArmDebugger::SetBreakpoint(Instruction* breakpc) {
// Check if a breakpoint can be set. If not return without any side-effects.
if (sim_->break_pc_ != nullptr) {
return false;
}
// Set the breakpoint.
sim_->break_pc_ = breakpc;
sim_->break_instr_ = breakpc->InstructionBits();
// Not setting the breakpoint instruction in the code itself. It will be set
// when the debugger shell continues.
return true;
}
bool ArmDebugger::DeleteBreakpoint(Instruction* breakpc) {
if (sim_->break_pc_ != nullptr) {
sim_->break_pc_->SetInstructionBits(sim_->break_instr_);
}
sim_->break_pc_ = nullptr;
sim_->break_instr_ = 0;
return true;
}
void ArmDebugger::UndoBreakpoints() {
if (sim_->break_pc_ != nullptr) {
sim_->break_pc_->SetInstructionBits(sim_->break_instr_);
}
}
void ArmDebugger::RedoBreakpoints() {
if (sim_->break_pc_ != nullptr) {
sim_->break_pc_->SetInstructionBits(kBreakpointInstr);
}
}
void ArmDebugger::Debug() {
intptr_t last_pc = -1;
bool done = false;
#define COMMAND_SIZE 63
#define ARG_SIZE 255
#define STR(a) #a
#define XSTR(a) STR(a)
char cmd[COMMAND_SIZE + 1];
char arg1[ARG_SIZE + 1];
char arg2[ARG_SIZE + 1];
char* argv[3] = { cmd, arg1, arg2 };
// make sure to have a proper terminating character if reaching the limit
cmd[COMMAND_SIZE] = 0;
arg1[ARG_SIZE] = 0;
arg2[ARG_SIZE] = 0;
// Undo all set breakpoints while running in the debugger shell. This will
// make them invisible to all commands.
UndoBreakpoints();
while (!done && !sim_->has_bad_pc()) {
if (last_pc != sim_->get_pc()) {
disasm::NameConverter converter;
disasm::Disassembler dasm(converter);
// use a reasonably large buffer
v8::internal::EmbeddedVector<char, 256> buffer;
dasm.InstructionDecode(buffer,
reinterpret_cast<byte*>(sim_->get_pc()));
PrintF(" 0x%08x %s\n", sim_->get_pc(), buffer.start());
last_pc = sim_->get_pc();
}
char* line = ReadLine("sim> ");
if (line == nullptr) {
break;
} else {
char* last_input = sim_->last_debugger_input();
if (strcmp(line, "\n") == 0 && last_input != nullptr) {
line = last_input;
} else {
// Ownership is transferred to sim_;
sim_->set_last_debugger_input(line);
}
// Use sscanf to parse the individual parts of the command line. At the
// moment no command expects more than two parameters.
int argc = SScanF(line,
"%" XSTR(COMMAND_SIZE) "s "
"%" XSTR(ARG_SIZE) "s "
"%" XSTR(ARG_SIZE) "s",
cmd, arg1, arg2);
if ((strcmp(cmd, "si") == 0) || (strcmp(cmd, "stepi") == 0)) {
sim_->InstructionDecode(reinterpret_cast<Instruction*>(sim_->get_pc()));
} else if ((strcmp(cmd, "c") == 0) || (strcmp(cmd, "cont") == 0)) {
// Execute the one instruction we broke at with breakpoints disabled.
sim_->InstructionDecode(reinterpret_cast<Instruction*>(sim_->get_pc()));
// Leave the debugger shell.
done = true;
} else if ((strcmp(cmd, "p") == 0) || (strcmp(cmd, "print") == 0)) {
if (argc == 2 || (argc == 3 && strcmp(arg2, "fp") == 0)) {
int32_t value;
float svalue;
double dvalue;
if (strcmp(arg1, "all") == 0) {
for (int i = 0; i < kNumRegisters; i++) {
value = GetRegisterValue(i);
PrintF(
"%3s: 0x%08x %10d",
RegisterConfiguration::Default()->GetGeneralRegisterName(i),
value, value);
if ((argc == 3 && strcmp(arg2, "fp") == 0) &&
i < 8 &&
(i % 2) == 0) {
dvalue = GetRegisterPairDoubleValue(i);
PrintF(" (%f)\n", dvalue);
} else {
PrintF("\n");
}
}
for (int i = 0; i < DwVfpRegister::NumRegisters(); i++) {
dvalue = GetVFPDoubleRegisterValue(i);
uint64_t as_words = bit_cast<uint64_t>(dvalue);
PrintF("%3s: %f 0x%08x %08x\n", VFPRegisters::Name(i, true),
dvalue, static_cast<uint32_t>(as_words >> 32),
static_cast<uint32_t>(as_words & 0xFFFFFFFF));
}
} else {
if (GetValue(arg1, &value)) {
PrintF("%s: 0x%08x %d \n", arg1, value, value);
} else if (GetVFPSingleValue(arg1, &svalue)) {
uint32_t as_word = bit_cast<uint32_t>(svalue);
PrintF("%s: %f 0x%08x\n", arg1, svalue, as_word);
} else if (GetVFPDoubleValue(arg1, &dvalue)) {
uint64_t as_words = bit_cast<uint64_t>(dvalue);
PrintF("%s: %f 0x%08x %08x\n", arg1, dvalue,
static_cast<uint32_t>(as_words >> 32),
static_cast<uint32_t>(as_words & 0xFFFFFFFF));
} else {
PrintF("%s unrecognized\n", arg1);
}
}
} else {
PrintF("print <register>\n");
}
} else if ((strcmp(cmd, "po") == 0)
|| (strcmp(cmd, "printobject") == 0)) {
if (argc == 2) {
int32_t value;
OFStream os(stdout);
if (GetValue(arg1, &value)) {
Object* obj = reinterpret_cast<Object*>(value);
os << arg1 << ": \n";
#ifdef DEBUG
obj->Print(os);
os << "\n";
#else
os << Brief(obj) << "\n";
#endif
} else {
os << arg1 << " unrecognized\n";
}
} else {
PrintF("printobject <value>\n");
}
} else if (strcmp(cmd, "stack") == 0 || strcmp(cmd, "mem") == 0) {
int32_t* cur = nullptr;
int32_t* end = nullptr;
int next_arg = 1;
if (strcmp(cmd, "stack") == 0) {
cur = reinterpret_cast<int32_t*>(sim_->get_register(Simulator::sp));
} else { // "mem"
int32_t value;
if (!GetValue(arg1, &value)) {
PrintF("%s unrecognized\n", arg1);
continue;
}
cur = reinterpret_cast<int32_t*>(value);
next_arg++;
}
int32_t words;
if (argc == next_arg) {
words = 10;
} else {
if (!GetValue(argv[next_arg], &words)) {
words = 10;
}
}
end = cur + words;
while (cur < end) {
PrintF(" 0x%08" V8PRIxPTR ": 0x%08x %10d",
reinterpret_cast<intptr_t>(cur), *cur, *cur);
HeapObject* obj = reinterpret_cast<HeapObject*>(*cur);
int value = *cur;
Heap* current_heap = sim_->isolate_->heap();
if (((value & 1) == 0) ||
current_heap->ContainsSlow(obj->address())) {
PrintF(" (");
if ((value & 1) == 0) {
PrintF("smi %d", value / 2);
} else {
obj->ShortPrint();
}
PrintF(")");
}
PrintF("\n");
cur++;
}
} else if (strcmp(cmd, "disasm") == 0 || strcmp(cmd, "di") == 0) {
disasm::NameConverter converter;
disasm::Disassembler dasm(converter);
// use a reasonably large buffer
v8::internal::EmbeddedVector<char, 256> buffer;
byte* prev = nullptr;
byte* cur = nullptr;
byte* end = nullptr;
if (argc == 1) {
cur = reinterpret_cast<byte*>(sim_->get_pc());
end = cur + (10 * Instruction::kInstrSize);
} else if (argc == 2) {
int regnum = Registers::Number(arg1);
if (regnum != kNoRegister || strncmp(arg1, "0x", 2) == 0) {
// The argument is an address or a register name.
int32_t value;
if (GetValue(arg1, &value)) {
cur = reinterpret_cast<byte*>(value);
// Disassemble 10 instructions at <arg1>.
end = cur + (10 * Instruction::kInstrSize);
}
} else {
// The argument is the number of instructions.
int32_t value;
if (GetValue(arg1, &value)) {
cur = reinterpret_cast<byte*>(sim_->get_pc());
// Disassemble <arg1> instructions.
end = cur + (value * Instruction::kInstrSize);
}
}
} else {
int32_t value1;
int32_t value2;
if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
cur = reinterpret_cast<byte*>(value1);
end = cur + (value2 * Instruction::kInstrSize);
}
}
while (cur < end) {
prev = cur;
cur += dasm.InstructionDecode(buffer, cur);
PrintF(" 0x%08" V8PRIxPTR " %s\n", reinterpret_cast<intptr_t>(prev),
buffer.start());
}
} else if (strcmp(cmd, "gdb") == 0) {
PrintF("relinquishing control to gdb\n");
v8::base::OS::DebugBreak();
PrintF("regaining control from gdb\n");
} else if (strcmp(cmd, "break") == 0) {
if (argc == 2) {
int32_t value;
if (GetValue(arg1, &value)) {
if (!SetBreakpoint(reinterpret_cast<Instruction*>(value))) {
PrintF("setting breakpoint failed\n");
}
} else {
PrintF("%s unrecognized\n", arg1);
}
} else {
PrintF("break <address>\n");
}
} else if (strcmp(cmd, "del") == 0) {
if (!DeleteBreakpoint(nullptr)) {
PrintF("deleting breakpoint failed\n");
}
} else if (strcmp(cmd, "flags") == 0) {
PrintF("N flag: %d; ", sim_->n_flag_);
PrintF("Z flag: %d; ", sim_->z_flag_);
PrintF("C flag: %d; ", sim_->c_flag_);
PrintF("V flag: %d\n", sim_->v_flag_);
PrintF("INVALID OP flag: %d; ", sim_->inv_op_vfp_flag_);
PrintF("DIV BY ZERO flag: %d; ", sim_->div_zero_vfp_flag_);
PrintF("OVERFLOW flag: %d; ", sim_->overflow_vfp_flag_);
PrintF("UNDERFLOW flag: %d; ", sim_->underflow_vfp_flag_);
PrintF("INEXACT flag: %d;\n", sim_->inexact_vfp_flag_);
} else if (strcmp(cmd, "stop") == 0) {
int32_t value;
intptr_t stop_pc = sim_->get_pc() - Instruction::kInstrSize;
Instruction* stop_instr = reinterpret_cast<Instruction*>(stop_pc);
if ((argc == 2) && (strcmp(arg1, "unstop") == 0)) {
// Remove the current stop.
if (sim_->isStopInstruction(stop_instr)) {
stop_instr->SetInstructionBits(kNopInstr);
} else {
PrintF("Not at debugger stop.\n");
}
} else if (argc == 3) {
// Print information about all/the specified breakpoint(s).
if (strcmp(arg1, "info") == 0) {
if (strcmp(arg2, "all") == 0) {
PrintF("Stop information:\n");
for (uint32_t i = 0; i < sim_->kNumOfWatchedStops; i++) {
sim_->PrintStopInfo(i);
}
} else if (GetValue(arg2, &value)) {
sim_->PrintStopInfo(value);
} else {
PrintF("Unrecognized argument.\n");
}
} else if (strcmp(arg1, "enable") == 0) {
// Enable all/the specified breakpoint(s).
if (strcmp(arg2, "all") == 0) {
for (uint32_t i = 0; i < sim_->kNumOfWatchedStops; i++) {
sim_->EnableStop(i);
}
} else if (GetValue(arg2, &value)) {
sim_->EnableStop(value);
} else {
PrintF("Unrecognized argument.\n");
}
} else if (strcmp(arg1, "disable") == 0) {
// Disable all/the specified breakpoint(s).
if (strcmp(arg2, "all") == 0) {
for (uint32_t i = 0; i < sim_->kNumOfWatchedStops; i++) {
sim_->DisableStop(i);
}
} else if (GetValue(arg2, &value)) {
sim_->DisableStop(value);
} else {
PrintF("Unrecognized argument.\n");
}
}
} else {
PrintF("Wrong usage. Use help command for more information.\n");
}
} else if ((strcmp(cmd, "t") == 0) || strcmp(cmd, "trace") == 0) {
::v8::internal::FLAG_trace_sim = !::v8::internal::FLAG_trace_sim;
PrintF("Trace of executed instructions is %s\n",
::v8::internal::FLAG_trace_sim ? "on" : "off");
} else if ((strcmp(cmd, "h") == 0) || (strcmp(cmd, "help") == 0)) {
PrintF("cont\n");
PrintF(" continue execution (alias 'c')\n");
PrintF("stepi\n");
PrintF(" step one instruction (alias 'si')\n");
PrintF("print <register>\n");
PrintF(" print register content (alias 'p')\n");
PrintF(" use register name 'all' to print all registers\n");
PrintF(" add argument 'fp' to print register pair double values\n");
PrintF("printobject <register>\n");
PrintF(" print an object from a register (alias 'po')\n");
PrintF("flags\n");
PrintF(" print flags\n");
PrintF("stack [<words>]\n");
PrintF(" dump stack content, default dump 10 words)\n");
PrintF("mem <address> [<words>]\n");
PrintF(" dump memory content, default dump 10 words)\n");
PrintF("disasm [<instructions>]\n");
PrintF("disasm [<address/register>]\n");
PrintF("disasm [[<address/register>] <instructions>]\n");
PrintF(" disassemble code, default is 10 instructions\n");
PrintF(" from pc (alias 'di')\n");
PrintF("gdb\n");
PrintF(" enter gdb\n");
PrintF("break <address>\n");
PrintF(" set a break point on the address\n");
PrintF("del\n");
PrintF(" delete the breakpoint\n");
PrintF("trace (alias 't')\n");
PrintF(" toogle the tracing of all executed statements\n");
PrintF("stop feature:\n");
PrintF(" Description:\n");
PrintF(" Stops are debug instructions inserted by\n");
PrintF(" the Assembler::stop() function.\n");
PrintF(" When hitting a stop, the Simulator will\n");
PrintF(" stop and and give control to the ArmDebugger.\n");
PrintF(" The first %d stop codes are watched:\n",
Simulator::kNumOfWatchedStops);
PrintF(" - They can be enabled / disabled: the Simulator\n");
PrintF(" will / won't stop when hitting them.\n");
PrintF(" - The Simulator keeps track of how many times they \n");
PrintF(" are met. (See the info command.) Going over a\n");
PrintF(" disabled stop still increases its counter. \n");
PrintF(" Commands:\n");
PrintF(" stop info all/<code> : print infos about number <code>\n");
PrintF(" or all stop(s).\n");
PrintF(" stop enable/disable all/<code> : enables / disables\n");
PrintF(" all or number <code> stop(s)\n");
PrintF(" stop unstop\n");
PrintF(" ignore the stop instruction at the current location\n");
PrintF(" from now on\n");
} else {
PrintF("Unknown command: %s\n", cmd);
}
}
}
// Add all the breakpoints back to stop execution and enter the debugger
// shell when hit.
RedoBreakpoints();
#undef COMMAND_SIZE
#undef ARG_SIZE
#undef STR
#undef XSTR
}
bool Simulator::ICacheMatch(void* one, void* two) {
DCHECK_EQ(reinterpret_cast<intptr_t>(one) & CachePage::kPageMask, 0);
DCHECK_EQ(reinterpret_cast<intptr_t>(two) & CachePage::kPageMask, 0);
return one == two;
}
static uint32_t ICacheHash(void* key) {
return static_cast<uint32_t>(reinterpret_cast<uintptr_t>(key)) >> 2;
}
static bool AllOnOnePage(uintptr_t start, int size) {
intptr_t start_page = (start & ~CachePage::kPageMask);
intptr_t end_page = ((start + size) & ~CachePage::kPageMask);
return start_page == end_page;
}
void Simulator::set_last_debugger_input(char* input) {
DeleteArray(last_debugger_input_);
last_debugger_input_ = input;
}
void Simulator::SetRedirectInstruction(Instruction* instruction) {
instruction->SetInstructionBits(al | (0xF * B24) | kCallRtRedirected);
}
void Simulator::FlushICache(base::CustomMatcherHashMap* i_cache,
void* start_addr, size_t size) {
intptr_t start = reinterpret_cast<intptr_t>(start_addr);
int intra_line = (start & CachePage::kLineMask);
start -= intra_line;
size += intra_line;
size = ((size - 1) | CachePage::kLineMask) + 1;
int offset = (start & CachePage::kPageMask);
while (!AllOnOnePage(start, size - 1)) {
int bytes_to_flush = CachePage::kPageSize - offset;
FlushOnePage(i_cache, start, bytes_to_flush);
start += bytes_to_flush;
size -= bytes_to_flush;
DCHECK_EQ(0, start & CachePage::kPageMask);
offset = 0;
}
if (size != 0) {
FlushOnePage(i_cache, start, size);
}
}
CachePage* Simulator::GetCachePage(base::CustomMatcherHashMap* i_cache,
void* page) {
base::HashMap::Entry* entry = i_cache->LookupOrInsert(page, ICacheHash(page));
if (entry->value == nullptr) {
CachePage* new_page = new CachePage();
entry->value = new_page;
}
return reinterpret_cast<CachePage*>(entry->value);
}
// Flush from start up to and not including start + size.
void Simulator::FlushOnePage(base::CustomMatcherHashMap* i_cache,
intptr_t start, int size) {
DCHECK_LE(size, CachePage::kPageSize);
DCHECK(AllOnOnePage(start, size - 1));
DCHECK_EQ(start & CachePage::kLineMask, 0);
DCHECK_EQ(size & CachePage::kLineMask, 0);
void* page = reinterpret_cast<void*>(start & (~CachePage::kPageMask));
int offset = (start & CachePage::kPageMask);
CachePage* cache_page = GetCachePage(i_cache, page);
char* valid_bytemap = cache_page->ValidityByte(offset);
memset(valid_bytemap, CachePage::LINE_INVALID, size >> CachePage::kLineShift);
}
void Simulator::CheckICache(base::CustomMatcherHashMap* i_cache,
Instruction* instr) {
intptr_t address = reinterpret_cast<intptr_t>(instr);
void* page = reinterpret_cast<void*>(address & (~CachePage::kPageMask));
void* line = reinterpret_cast<void*>(address & (~CachePage::kLineMask));
int offset = (address & CachePage::kPageMask);
CachePage* cache_page = GetCachePage(i_cache, page);
char* cache_valid_byte = cache_page->ValidityByte(offset);
bool cache_hit = (*cache_valid_byte == CachePage::LINE_VALID);
char* cached_line = cache_page->CachedData(offset & ~CachePage::kLineMask);
if (cache_hit) {
// Check that the data in memory matches the contents of the I-cache.
CHECK_EQ(0,
memcmp(reinterpret_cast<void*>(instr),
cache_page->CachedData(offset), Instruction::kInstrSize));
} else {
// Cache miss. Load memory into the cache.
memcpy(cached_line, line, CachePage::kLineLength);
*cache_valid_byte = CachePage::LINE_VALID;
}
}
Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
// Set up simulator support first. Some of this information is needed to
// setup the architecture state.
size_t stack_size = 1 * 1024*1024; // allocate 1MB for stack
stack_ = reinterpret_cast<char*>(malloc(stack_size));
pc_modified_ = false;
icount_ = 0;
break_pc_ = nullptr;
break_instr_ = 0;
// Set up architecture state.
// All registers are initialized to zero to start with.
for (int i = 0; i < num_registers; i++) {
registers_[i] = 0;
}
n_flag_ = false;
z_flag_ = false;
c_flag_ = false;
v_flag_ = false;
// Initializing VFP registers.
// All registers are initialized to zero to start with
// even though s_registers_ & d_registers_ share the same
// physical registers in the target.
for (int i = 0; i < num_d_registers * 2; i++) {
vfp_registers_[i] = 0;
}
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = false;
v_flag_FPSCR_ = false;
FPSCR_rounding_mode_ = RN;
FPSCR_default_NaN_mode_ = false;
inv_op_vfp_flag_ = false;
div_zero_vfp_flag_ = false;
overflow_vfp_flag_ = false;
underflow_vfp_flag_ = false;
inexact_vfp_flag_ = false;
// The sp is initialized to point to the bottom (high address) of the
// allocated stack area. To be safe in potential stack underflows we leave
// some buffer below.
registers_[sp] = reinterpret_cast<int32_t>(stack_) + stack_size - 64;
// The lr and pc are initialized to a known bad value that will cause an
// access violation if the simulator ever tries to execute it.
registers_[pc] = bad_lr;
registers_[lr] = bad_lr;
last_debugger_input_ = nullptr;
}
Simulator::~Simulator() {
global_monitor_.Pointer()->RemoveProcessor(&global_monitor_processor_);
free(stack_);
}
// Get the active Simulator for the current thread.
Simulator* Simulator::current(Isolate* isolate) {
v8::internal::Isolate::PerIsolateThreadData* isolate_data =
isolate->FindOrAllocatePerThreadDataForThisThread();
DCHECK_NOT_NULL(isolate_data);
Simulator* sim = isolate_data->simulator();
if (sim == nullptr) {
// TODO(146): delete the simulator object when a thread/isolate goes away.
sim = new Simulator(isolate);
isolate_data->set_simulator(sim);
}
return sim;
}
// Sets the register in the architecture state. It will also deal with updating
// Simulator internal state for special registers such as PC.
void Simulator::set_register(int reg, int32_t value) {
DCHECK((reg >= 0) && (reg < num_registers));
if (reg == pc) {
pc_modified_ = true;
}
registers_[reg] = value;
}
// Get the register from the architecture state. This function does handle
// the special case of accessing the PC register.
int32_t Simulator::get_register(int reg) const {
DCHECK((reg >= 0) && (reg < num_registers));
// Stupid code added to avoid bug in GCC.
// See: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=43949
if (reg >= num_registers) return 0;
// End stupid code.
return registers_[reg] + ((reg == pc) ? Instruction::kPCReadOffset : 0);
}
double Simulator::get_double_from_register_pair(int reg) {
DCHECK((reg >= 0) && (reg < num_registers) && ((reg % 2) == 0));
double dm_val = 0.0;
// Read the bits from the unsigned integer register_[] array
// into the double precision floating point value and return it.
char buffer[2 * sizeof(vfp_registers_[0])];
memcpy(buffer, ®isters_[reg], 2 * sizeof(registers_[0]));
memcpy(&dm_val, buffer, 2 * sizeof(registers_[0]));
return(dm_val);
}
void Simulator::set_register_pair_from_double(int reg, double* value) {
DCHECK((reg >= 0) && (reg < num_registers) && ((reg % 2) == 0));
memcpy(registers_ + reg, value, sizeof(*value));
}
void Simulator::set_dw_register(int dreg, const int* dbl) {
DCHECK((dreg >= 0) && (dreg < num_d_registers));
registers_[dreg] = dbl[0];
registers_[dreg + 1] = dbl[1];
}
void Simulator::get_d_register(int dreg, uint64_t* value) {
DCHECK((dreg >= 0) && (dreg < DwVfpRegister::NumRegisters()));
memcpy(value, vfp_registers_ + dreg * 2, sizeof(*value));
}
void Simulator::set_d_register(int dreg, const uint64_t* value) {
DCHECK((dreg >= 0) && (dreg < DwVfpRegister::NumRegisters()));
memcpy(vfp_registers_ + dreg * 2, value, sizeof(*value));
}
void Simulator::get_d_register(int dreg, uint32_t* value) {
DCHECK((dreg >= 0) && (dreg < DwVfpRegister::NumRegisters()));
memcpy(value, vfp_registers_ + dreg * 2, sizeof(*value) * 2);
}
void Simulator::set_d_register(int dreg, const uint32_t* value) {
DCHECK((dreg >= 0) && (dreg < DwVfpRegister::NumRegisters()));
memcpy(vfp_registers_ + dreg * 2, value, sizeof(*value) * 2);
}
template <typename T, int SIZE>
void Simulator::get_neon_register(int reg, T (&value)[SIZE / sizeof(T)]) {
DCHECK(SIZE == kSimd128Size || SIZE == kDoubleSize);
DCHECK_LE(0, reg);
DCHECK_GT(SIZE == kSimd128Size ? num_q_registers : num_d_registers, reg);
memcpy(value, vfp_registers_ + reg * (SIZE / 4), SIZE);
}
template <typename T, int SIZE>
void Simulator::set_neon_register(int reg, const T (&value)[SIZE / sizeof(T)]) {
DCHECK(SIZE == kSimd128Size || SIZE == kDoubleSize);
DCHECK_LE(0, reg);
DCHECK_GT(SIZE == kSimd128Size ? num_q_registers : num_d_registers, reg);
memcpy(vfp_registers_ + reg * (SIZE / 4), value, SIZE);
}
// Raw access to the PC register.
void Simulator::set_pc(int32_t value) {
pc_modified_ = true;
registers_[pc] = value;
}
bool Simulator::has_bad_pc() const {
return ((registers_[pc] == bad_lr) || (registers_[pc] == end_sim_pc));
}
// Raw access to the PC register without the special adjustment when reading.
int32_t Simulator::get_pc() const {
return registers_[pc];
}
// Getting from and setting into VFP registers.
void Simulator::set_s_register(int sreg, unsigned int value) {
DCHECK((sreg >= 0) && (sreg < num_s_registers));
vfp_registers_[sreg] = value;
}
unsigned int Simulator::get_s_register(int sreg) const {
DCHECK((sreg >= 0) && (sreg < num_s_registers));
return vfp_registers_[sreg];
}
template<class InputType, int register_size>
void Simulator::SetVFPRegister(int reg_index, const InputType& value) {
unsigned bytes = register_size * sizeof(vfp_registers_[0]);
DCHECK_EQ(sizeof(InputType), bytes);
DCHECK_GE(reg_index, 0);
if (register_size == 1) DCHECK(reg_index < num_s_registers);
if (register_size == 2) DCHECK(reg_index < DwVfpRegister::NumRegisters());
memcpy(&vfp_registers_[reg_index * register_size], &value, bytes);
}
template<class ReturnType, int register_size>
ReturnType Simulator::GetFromVFPRegister(int reg_index) {
unsigned bytes = register_size * sizeof(vfp_registers_[0]);
DCHECK_EQ(sizeof(ReturnType), bytes);
DCHECK_GE(reg_index, 0);
if (register_size == 1) DCHECK(reg_index < num_s_registers);
if (register_size == 2) DCHECK(reg_index < DwVfpRegister::NumRegisters());
ReturnType value;
memcpy(&value, &vfp_registers_[register_size * reg_index], bytes);
return value;
}
void Simulator::SetSpecialRegister(SRegisterFieldMask reg_and_mask,
uint32_t value) {
// Only CPSR_f is implemented. Of that, only N, Z, C and V are implemented.
if ((reg_and_mask == CPSR_f) && ((value & ~kSpecialCondition) == 0)) {
n_flag_ = ((value & (1 << 31)) != 0);
z_flag_ = ((value & (1 << 30)) != 0);
c_flag_ = ((value & (1 << 29)) != 0);
v_flag_ = ((value & (1 << 28)) != 0);
} else {
UNIMPLEMENTED();
}
}
uint32_t Simulator::GetFromSpecialRegister(SRegister reg) {
uint32_t result = 0;
// Only CPSR_f is implemented.
if (reg == CPSR) {
if (n_flag_) result |= (1 << 31);
if (z_flag_) result |= (1 << 30);
if (c_flag_) result |= (1 << 29);
if (v_flag_) result |= (1 << 28);
} else {
UNIMPLEMENTED();
}
return result;
}
// Runtime FP routines take:
// - two double arguments
// - one double argument and zero or one integer arguments.
// All are consructed here from r0-r3 or d0, d1 and r0.
void Simulator::GetFpArgs(double* x, double* y, int32_t* z) {
if (use_eabi_hardfloat()) {
*x = get_double_from_d_register(0).get_scalar();
*y = get_double_from_d_register(1).get_scalar();
*z = get_register(0);
} else {
// Registers 0 and 1 -> x.
*x = get_double_from_register_pair(0);
// Register 2 and 3 -> y.
*y = get_double_from_register_pair(2);
// Register 2 -> z
*z = get_register(2);
}
}
// The return value is either in r0/r1 or d0.
void Simulator::SetFpResult(const double& result) {
if (use_eabi_hardfloat()) {
char buffer[2 * sizeof(vfp_registers_[0])];
memcpy(buffer, &result, sizeof(buffer));
// Copy result to d0.
memcpy(vfp_registers_, buffer, sizeof(buffer));
} else {
char buffer[2 * sizeof(registers_[0])];
memcpy(buffer, &result, sizeof(buffer));
// Copy result to r0 and r1.
memcpy(registers_, buffer, sizeof(buffer));
}
}
void Simulator::TrashCallerSaveRegisters() {
// We don't trash the registers with the return value.
registers_[2] = 0x50BAD4U;
registers_[3] = 0x50BAD4U;
registers_[12] = 0x50BAD4U;
}
int Simulator::ReadW(int32_t addr, Instruction* instr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoad(addr);
intptr_t* ptr = reinterpret_cast<intptr_t*>(addr);
return *ptr;
}
int Simulator::ReadExW(int32_t addr, Instruction* instr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoadExcl(addr, TransactionSize::Word);
global_monitor_.Pointer()->NotifyLoadExcl_Locked(addr,
&global_monitor_processor_);
intptr_t* ptr = reinterpret_cast<intptr_t*>(addr);
return *ptr;
}
void Simulator::WriteW(int32_t addr, int value, Instruction* instr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyStore(addr);
global_monitor_.Pointer()->NotifyStore_Locked(addr,
&global_monitor_processor_);
intptr_t* ptr = reinterpret_cast<intptr_t*>(addr);
*ptr = value;
}
int Simulator::WriteExW(int32_t addr, int value, Instruction* instr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
if (local_monitor_.NotifyStoreExcl(addr, TransactionSize::Word) &&
global_monitor_.Pointer()->NotifyStoreExcl_Locked(
addr, &global_monitor_processor_)) {
intptr_t* ptr = reinterpret_cast<intptr_t*>(addr);
*ptr = value;
return 0;
} else {
return 1;
}
}
uint16_t Simulator::ReadHU(int32_t addr, Instruction* instr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoad(addr);
uint16_t* ptr = reinterpret_cast<uint16_t*>(addr);
return *ptr;
}
int16_t Simulator::ReadH(int32_t addr, Instruction* instr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoad(addr);
int16_t* ptr = reinterpret_cast<int16_t*>(addr);
return *ptr;
}
uint16_t Simulator::ReadExHU(int32_t addr, Instruction* instr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoadExcl(addr, TransactionSize::HalfWord);
global_monitor_.Pointer()->NotifyLoadExcl_Locked(addr,
&global_monitor_processor_);
uint16_t* ptr = reinterpret_cast<uint16_t*>(addr);
return *ptr;
}
void Simulator::WriteH(int32_t addr, uint16_t value, Instruction* instr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyStore(addr);
global_monitor_.Pointer()->NotifyStore_Locked(addr,
&global_monitor_processor_);
uint16_t* ptr = reinterpret_cast<uint16_t*>(addr);
*ptr = value;
}
void Simulator::WriteH(int32_t addr, int16_t value, Instruction* instr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyStore(addr);
global_monitor_.Pointer()->NotifyStore_Locked(addr,
&global_monitor_processor_);
int16_t* ptr = reinterpret_cast<int16_t*>(addr);
*ptr = value;
}
int Simulator::WriteExH(int32_t addr, uint16_t value, Instruction* instr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
if (local_monitor_.NotifyStoreExcl(addr, TransactionSize::HalfWord) &&
global_monitor_.Pointer()->NotifyStoreExcl_Locked(
addr, &global_monitor_processor_)) {
uint16_t* ptr = reinterpret_cast<uint16_t*>(addr);
*ptr = value;
return 0;
} else {
return 1;
}
}
uint8_t Simulator::ReadBU(int32_t addr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoad(addr);
uint8_t* ptr = reinterpret_cast<uint8_t*>(addr);
return *ptr;
}
int8_t Simulator::ReadB(int32_t addr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoad(addr);
int8_t* ptr = reinterpret_cast<int8_t*>(addr);
return *ptr;
}
uint8_t Simulator::ReadExBU(int32_t addr) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoadExcl(addr, TransactionSize::Byte);
global_monitor_.Pointer()->NotifyLoadExcl_Locked(addr,
&global_monitor_processor_);
uint8_t* ptr = reinterpret_cast<uint8_t*>(addr);
return *ptr;
}
void Simulator::WriteB(int32_t addr, uint8_t value) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyStore(addr);
global_monitor_.Pointer()->NotifyStore_Locked(addr,
&global_monitor_processor_);
uint8_t* ptr = reinterpret_cast<uint8_t*>(addr);
*ptr = value;
}
void Simulator::WriteB(int32_t addr, int8_t value) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyStore(addr);
global_monitor_.Pointer()->NotifyStore_Locked(addr,
&global_monitor_processor_);
int8_t* ptr = reinterpret_cast<int8_t*>(addr);
*ptr = value;
}
int Simulator::WriteExB(int32_t addr, uint8_t value) {
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
if (local_monitor_.NotifyStoreExcl(addr, TransactionSize::Byte) &&
global_monitor_.Pointer()->NotifyStoreExcl_Locked(
addr, &global_monitor_processor_)) {
uint8_t* ptr = reinterpret_cast<uint8_t*>(addr);
*ptr = value;
return 0;
} else {
return 1;
}
}
int32_t* Simulator::ReadDW(int32_t addr) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyLoad(addr);
int32_t* ptr = reinterpret_cast<int32_t*>(addr);
return ptr;
}
void Simulator::WriteDW(int32_t addr, int32_t value1, int32_t value2) {
// All supported ARM targets allow unaligned accesses, so we don't need to
// check the alignment here.
base::LockGuard<base::Mutex> lock_guard(&global_monitor_.Pointer()->mutex);
local_monitor_.NotifyStore(addr);
global_monitor_.Pointer()->NotifyStore_Locked(addr,
&global_monitor_processor_);
int32_t* ptr = reinterpret_cast<int32_t*>(addr);
*ptr++ = value1;
*ptr = value2;
}
// Returns the limit of the stack area to enable checking for stack overflows.
uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
// The simulator uses a separate JS stack. If we have exhausted the C stack,
// we also drop down the JS limit to reflect the exhaustion on the JS stack.
if (GetCurrentStackPosition() < c_limit) {
return reinterpret_cast<uintptr_t>(get_sp());
}
// Otherwise the limit is the JS stack. Leave a safety margin of 1024 bytes
// to prevent overrunning the stack when pushing values.
return reinterpret_cast<uintptr_t>(stack_) + 1024;
}
// Unsupported instructions use Format to print an error and stop execution.
void Simulator::Format(Instruction* instr, const char* format) {
PrintF("Simulator found unsupported instruction:\n 0x%08" V8PRIxPTR ": %s\n",
reinterpret_cast<intptr_t>(instr), format);
UNIMPLEMENTED();
}
// Checks if the current instruction should be executed based on its
// condition bits.
bool Simulator::ConditionallyExecute(Instruction* instr) {
switch (instr->ConditionField()) {
case eq: return z_flag_;
case ne: return !z_flag_;
case cs: return c_flag_;
case cc: return !c_flag_;
case mi: return n_flag_;
case pl: return !n_flag_;
case vs: return v_flag_;
case vc: return !v_flag_;
case hi: return c_flag_ && !z_flag_;
case ls: return !c_flag_ || z_flag_;
case ge: return n_flag_ == v_flag_;
case lt: return n_flag_ != v_flag_;
case gt: return !z_flag_ && (n_flag_ == v_flag_);
case le: return z_flag_ || (n_flag_ != v_flag_);
case al: return true;
default: UNREACHABLE();
}
return false;
}
// Calculate and set the Negative and Zero flags.
void Simulator::SetNZFlags(int32_t val) {
n_flag_ = (val < 0);
z_flag_ = (val == 0);
}
// Set the Carry flag.
void Simulator::SetCFlag(bool val) {
c_flag_ = val;
}
// Set the oVerflow flag.
void Simulator::SetVFlag(bool val) {
v_flag_ = val;
}
// Calculate C flag value for additions.
bool Simulator::CarryFrom(int32_t left, int32_t right, int32_t carry) {
uint32_t uleft = static_cast<uint32_t>(left);
uint32_t uright = static_cast<uint32_t>(right);
uint32_t urest = 0xFFFFFFFFU - uleft;
return (uright > urest) ||
(carry && (((uright + 1) > urest) || (uright > (urest - 1))));
}
// Calculate C flag value for subtractions.
bool Simulator::BorrowFrom(int32_t left, int32_t right, int32_t carry) {
uint32_t uleft = static_cast<uint32_t>(left);
uint32_t uright = static_cast<uint32_t>(right);
return (uright > uleft) ||
(!carry && (((uright + 1) > uleft) || (uright > (uleft - 1))));
}
// Calculate V flag value for additions and subtractions.
bool Simulator::OverflowFrom(int32_t alu_out,
int32_t left, int32_t right, bool addition) {
bool overflow;
if (addition) {
// operands have the same sign
overflow = ((left >= 0 && right >= 0) || (left < 0 && right < 0))
// and operands and result have different sign
&& ((left < 0 && alu_out >= 0) || (left >= 0 && alu_out < 0));
} else {
// operands have different signs
overflow = ((left < 0 && right >= 0) || (left >= 0 && right < 0))
// and first operand and result have different signs
&& ((left < 0 && alu_out >= 0) || (left >= 0 && alu_out < 0));
}
return overflow;
}
// Support for VFP comparisons.
void Simulator::Compute_FPSCR_Flags(float val1, float val2) {
if (std::isnan(val1) || std::isnan(val2)) {
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = true;
v_flag_FPSCR_ = true;
// All non-NaN cases.
} else if (val1 == val2) {
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = true;
c_flag_FPSCR_ = true;
v_flag_FPSCR_ = false;
} else if (val1 < val2) {
n_flag_FPSCR_ = true;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = false;
v_flag_FPSCR_ = false;
} else {
// Case when (val1 > val2).
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = true;
v_flag_FPSCR_ = false;
}
}
void Simulator::Compute_FPSCR_Flags(double val1, double val2) {
if (std::isnan(val1) || std::isnan(val2)) {
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = true;
v_flag_FPSCR_ = true;
// All non-NaN cases.
} else if (val1 == val2) {
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = true;
c_flag_FPSCR_ = true;
v_flag_FPSCR_ = false;
} else if (val1 < val2) {
n_flag_FPSCR_ = true;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = false;
v_flag_FPSCR_ = false;
} else {
// Case when (val1 > val2).
n_flag_FPSCR_ = false;
z_flag_FPSCR_ = false;
c_flag_FPSCR_ = true;
v_flag_FPSCR_ = false;
}
}
void Simulator::Copy_FPSCR_to_APSR() {
n_flag_ = n_flag_FPSCR_;
z_flag_ = z_flag_FPSCR_;
c_flag_ = c_flag_FPSCR_;
v_flag_ = v_flag_FPSCR_;
}
// Addressing Mode 1 - Data-processing operands:
// Get the value based on the shifter_operand with register.
int32_t Simulator::GetShiftRm(Instruction* instr, bool* carry_out) {
ShiftOp shift = instr->ShiftField();
int shift_amount = instr->ShiftAmountValue();
int32_t result = get_register(instr->RmValue());
if (instr->Bit(4) == 0) {
// by immediate
if ((shift == ROR) && (shift_amount == 0)) {
UNIMPLEMENTED();
return result;
} else if (((shift == LSR) || (shift == ASR)) && (shift_amount == 0)) {
shift_amount = 32;
}
switch (shift) {
case ASR: {
if (shift_amount == 0) {
if (result < 0) {
result = 0xFFFFFFFF;
*carry_out = true;
} else {
result = 0;
*carry_out = false;
}
} else {
result >>= (shift_amount - 1);
*carry_out = (result & 1) == 1;
result >>= 1;
}
break;
}
case LSL: {
if (shift_amount == 0) {
*carry_out = c_flag_;
} else {
result <<= (shift_amount - 1);
*carry_out = (result < 0);
result <<= 1;
}
break;
}
case LSR: {
if (shift_amount == 0) {
result = 0;
*carry_out = c_flag_;
} else {
uint32_t uresult = static_cast<uint32_t>(result);
uresult >>= (shift_amount - 1);
*carry_out = (uresult & 1) == 1;
uresult >>= 1;
result = static_cast<int32_t>(uresult);
}
break;
}
case ROR: {
if (shift_amount == 0) {
*carry_out = c_flag_;
} else {
uint32_t left = static_cast<uint32_t>(result) >> shift_amount;
uint32_t right = static_cast<uint32_t>(result) << (32 - shift_amount);
result = right | left;
*carry_out = (static_cast<uint32_t>(result) >> 31) != 0;
}
break;
}
default: {
UNREACHABLE();
break;
}
}
} else {
// by register
int rs = instr->RsValue();
shift_amount = get_register(rs) & 0xFF;
switch (shift) {
case ASR: {
if (shift_amount == 0) {
*carry_out = c_flag_;
} else if (shift_amount < 32) {
result >>= (shift_amount - 1);
*carry_out = (result & 1) == 1;
result >>= 1;
} else {
DCHECK_GE(shift_amount, 32);
if (result < 0) {
*carry_out = true;
result = 0xFFFFFFFF;
} else {
*carry_out = false;
result = 0;
}
}
break;
}
case LSL: {
if (shift_amount == 0) {
*carry_out = c_flag_;
} else if (shift_amount < 32) {
result <<= (shift_amount - 1);
*carry_out = (result < 0);
result <<= 1;
} else if (shift_amount == 32) {
*carry_out = (result & 1) == 1;
result = 0;
} else {
DCHECK_GT(shift_amount, 32);
*carry_out = false;
result = 0;
}
break;
}
case LSR: {
if (shift_amount == 0) {
*carry_out = c_flag_;
} else if (shift_amount < 32) {
uint32_t uresult = static_cast<uint32_t>(result);
uresult >>= (shift_amount - 1);
*carry_out = (uresult & 1) == 1;
uresult >>= 1;
result = static_cast<int32_t>(uresult);
} else if (shift_amount == 32) {
*carry_out = (result < 0);
result = 0;
} else {
*carry_out = false;
result = 0;
}
break;
}
case ROR: {
if (shift_amount == 0) {
*carry_out = c_flag_;
} else {
uint32_t left = static_cast<uint32_t>(result) >> shift_amount;
uint32_t right = static_cast<uint32_t>(result) << (32 - shift_amount);
result = right | left;
*carry_out = (static_cast<uint32_t>(result) >> 31) != 0;
}
break;
}
default: {
UNREACHABLE();
break;
}
}
}
return result;
}
// Addressing Mode 1 - Data-processing operands:
// Get the value based on the shifter_operand with immediate.
int32_t Simulator::GetImm(Instruction* instr, bool* carry_out) {
int rotate = instr->RotateValue() * 2;
int immed8 = instr->Immed8Value();
int imm = base::bits::RotateRight32(immed8, rotate);
*carry_out = (rotate == 0) ? c_flag_ : (imm < 0);
return imm;
}
static int count_bits(int bit_vector) {
int count = 0;
while (bit_vector != 0) {
if ((bit_vector & 1) != 0) {
count++;
}
bit_vector >>= 1;
}
return count;
}
int32_t Simulator::ProcessPU(Instruction* instr,
int num_regs,
int reg_size,
intptr_t* start_address,
intptr_t* end_address) {
int rn = instr->RnValue();
int32_t rn_val = get_register(rn);
switch (instr->PUField()) {
case da_x: {
UNIMPLEMENTED();
break;
}
case ia_x: {
*start_address = rn_val;
*end_address = rn_val + (num_regs * reg_size) - reg_size;
rn_val = rn_val + (num_regs * reg_size);
break;
}
case db_x: {
*start_address = rn_val - (num_regs * reg_size);
*end_address = rn_val - reg_size;
rn_val = *start_address;
break;
}
case ib_x: {
*start_address = rn_val + reg_size;
*end_address = rn_val + (num_regs * reg_size);
rn_val = *end_address;
break;
}
default: {
UNREACHABLE();
break;
}
}
return rn_val;
}
// Addressing Mode 4 - Load and Store Multiple
void Simulator::HandleRList(Instruction* instr, bool load) {
int rlist = instr->RlistValue();
int num_regs = count_bits(rlist);
intptr_t start_address = 0;
intptr_t end_address = 0;
int32_t rn_val =
ProcessPU(instr, num_regs, kPointerSize, &start_address, &end_address);
intptr_t* address = reinterpret_cast<intptr_t*>(start_address);
// Catch null pointers a little earlier.
DCHECK(start_address > 8191 || start_address < 0);
int reg = 0;
while (rlist != 0) {
if ((rlist & 1) != 0) {
if (load) {
set_register(reg, *address);
} else {
*address = get_register(reg);
}
address += 1;
}
reg++;
rlist >>= 1;
}
DCHECK(end_address == ((intptr_t)address) - 4);
if (instr->HasW()) {
set_register(instr->RnValue(), rn_val);
}
}
// Addressing Mode 6 - Load and Store Multiple Coprocessor registers.
void Simulator::HandleVList(Instruction* instr) {
VFPRegPrecision precision =
(instr->SzValue() == 0) ? kSinglePrecision : kDoublePrecision;
int operand_size = (precision == kSinglePrecision) ? 4 : 8;
bool load = (instr->VLValue() == 0x1);
int vd;
int num_regs;
vd = instr->VFPDRegValue(precision);
if (precision == kSinglePrecision) {
num_regs = instr->Immed8Value();
} else {
num_regs = instr->Immed8Value() / 2;
}
intptr_t start_address = 0;
intptr_t end_address = 0;
int32_t rn_val =
ProcessPU(instr, num_regs, operand_size, &start_address, &end_address);
intptr_t* address = reinterpret_cast<intptr_t*>(start_address);
for (int reg = vd; reg < vd + num_regs; reg++) {
if (precision == kSinglePrecision) {
if (load) {
set_s_register_from_sinteger(
reg, ReadW(reinterpret_cast<int32_t>(address), instr));
} else {
WriteW(reinterpret_cast<int32_t>(address),
get_sinteger_from_s_register(reg), instr);
}
address += 1;
} else {
if (load) {
int32_t data[] = {
ReadW(reinterpret_cast<int32_t>(address), instr),
ReadW(reinterpret_cast<int32_t>(address + 1), instr)
};
set_d_register(reg, reinterpret_cast<uint32_t*>(data));
} else {
uint32_t data[2];
get_d_register(reg, data);
WriteW(reinterpret_cast<int32_t>(address), data[0], instr);
WriteW(reinterpret_cast<int32_t>(address + 1), data[1], instr);
}
address += 2;
}
}
DCHECK(reinterpret_cast<intptr_t>(address) - operand_size == end_address);
if (instr->HasW()) {
set_register(instr->RnValue(), rn_val);
}
}
// Calls into the V8 runtime are based on this very simple interface.
// Note: To be able to return two values from some calls the code in runtime.cc
// uses the ObjectPair which is essentially two 32-bit values stuffed into a
// 64-bit value. With the code below we assume that all runtime calls return
// 64 bits of result. If they don't, the r1 result register contains a bogus
// value, which is fine because it is caller-saved.
typedef int64_t (*SimulatorRuntimeCall)(int32_t arg0, int32_t arg1,
int32_t arg2, int32_t arg3,
int32_t arg4, int32_t arg5,
int32_t arg6, int32_t arg7,
int32_t arg8);
// These prototypes handle the four types of FP calls.
typedef int64_t (*SimulatorRuntimeCompareCall)(double darg0, double darg1);
typedef double (*SimulatorRuntimeFPFPCall)(double darg0, double darg1);
typedef double (*SimulatorRuntimeFPCall)(double darg0);
typedef double (*SimulatorRuntimeFPIntCall)(double darg0, int32_t arg0);
// This signature supports direct call in to API function native callback
// (refer to InvocationCallback in v8.h).
typedef void (*SimulatorRuntimeDirectApiCall)(int32_t arg0);
typedef void (*SimulatorRuntimeProfilingApiCall)(int32_t arg0, void* arg1);
// This signature supports direct call to accessor getter callback.
typedef void (*SimulatorRuntimeDirectGetterCall)(int32_t arg0, int32_t arg1);
typedef void (*SimulatorRuntimeProfilingGetterCall)(
int32_t arg0, int32_t arg1, void* arg2);
// Software interrupt instructions are used by the simulator to call into the
// C-based V8 runtime.
void Simulator::SoftwareInterrupt(Instruction* instr) {
int svc = instr->SvcValue();
switch (svc) {
case kCallRtRedirected: {
// Check if stack is aligned. Error if not aligned is reported below to
// include information on the function called.
bool stack_aligned =
(get_register(sp)
& (::v8::internal::FLAG_sim_stack_alignment - 1)) == 0;
Redirection* redirection = Redirection::FromInstruction(instr);
int32_t arg0 = get_register(r0);
int32_t arg1 = get_register(r1);
int32_t arg2 = get_register(r2);
int32_t arg3 = get_register(r3);
int32_t* stack_pointer = reinterpret_cast<int32_t*>(get_register(sp));
int32_t arg4 = stack_pointer[0];
int32_t arg5 = stack_pointer[1];
int32_t arg6 = stack_pointer[2];
int32_t arg7 = stack_pointer[3];
int32_t arg8 = stack_pointer[4];
STATIC_ASSERT(kMaxCParameters == 9);
bool fp_call =
(redirection->type() == ExternalReference::BUILTIN_FP_FP_CALL) ||
(redirection->type() == ExternalReference::BUILTIN_COMPARE_CALL) ||
(redirection->type() == ExternalReference::BUILTIN_FP_CALL) ||
(redirection->type() == ExternalReference::BUILTIN_FP_INT_CALL);
// This is dodgy but it works because the C entry stubs are never moved.
// See comment in codegen-arm.cc and bug 1242173.
int32_t saved_lr = get_register(lr);
intptr_t external =
reinterpret_cast<intptr_t>(redirection->external_function());
if (fp_call) {
double dval0, dval1; // one or two double parameters
int32_t ival; // zero or one integer parameters
int64_t iresult = 0; // integer return value
double dresult = 0; // double return value
GetFpArgs(&dval0, &dval1, &ival);
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
SimulatorRuntimeCall generic_target =
reinterpret_cast<SimulatorRuntimeCall>(external);
switch (redirection->type()) {
case ExternalReference::BUILTIN_FP_FP_CALL:
case ExternalReference::BUILTIN_COMPARE_CALL:
PrintF("Call to host function at %p with args %f, %f",
reinterpret_cast<void*>(FUNCTION_ADDR(generic_target)),
dval0, dval1);
break;
case ExternalReference::BUILTIN_FP_CALL:
PrintF("Call to host function at %p with arg %f",
reinterpret_cast<void*>(FUNCTION_ADDR(generic_target)),
dval0);
break;
case ExternalReference::BUILTIN_FP_INT_CALL:
PrintF("Call to host function at %p with args %f, %d",
reinterpret_cast<void*>(FUNCTION_ADDR(generic_target)),
dval0, ival);
break;
default:
UNREACHABLE();
break;
}
if (!stack_aligned) {
PrintF(" with unaligned stack %08x\n", get_register(sp));
}
PrintF("\n");
}
CHECK(stack_aligned);
switch (redirection->type()) {
case ExternalReference::BUILTIN_COMPARE_CALL: {
SimulatorRuntimeCompareCall target =
reinterpret_cast<SimulatorRuntimeCompareCall>(external);
iresult = target(dval0, dval1);
set_register(r0, static_cast<int32_t>(iresult));
set_register(r1, static_cast<int32_t>(iresult >> 32));
break;
}
case ExternalReference::BUILTIN_FP_FP_CALL: {
SimulatorRuntimeFPFPCall target =
reinterpret_cast<SimulatorRuntimeFPFPCall>(external);
dresult = target(dval0, dval1);
SetFpResult(dresult);
break;
}
case ExternalReference::BUILTIN_FP_CALL: {
SimulatorRuntimeFPCall target =
reinterpret_cast<SimulatorRuntimeFPCall>(external);
dresult = target(dval0);
SetFpResult(dresult);
break;
}
case ExternalReference::BUILTIN_FP_INT_CALL: {
SimulatorRuntimeFPIntCall target =
reinterpret_cast<SimulatorRuntimeFPIntCall>(external);
dresult = target(dval0, ival);
SetFpResult(dresult);
break;
}
default:
UNREACHABLE();
break;
}
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
switch (redirection->type()) {
case ExternalReference::BUILTIN_COMPARE_CALL:
PrintF("Returned %08x\n", static_cast<int32_t>(iresult));
break;
case ExternalReference::BUILTIN_FP_FP_CALL:
case ExternalReference::BUILTIN_FP_CALL:
case ExternalReference::BUILTIN_FP_INT_CALL:
PrintF("Returned %f\n", dresult);
break;
default:
UNREACHABLE();
break;
}
}
} else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
PrintF("Call to host function at %p args %08x",
reinterpret_cast<void*>(external), arg0);
if (!stack_aligned) {
PrintF(" with unaligned stack %08x\n", get_register(sp));
}
PrintF("\n");
}
CHECK(stack_aligned);
SimulatorRuntimeDirectApiCall target =
reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
target(arg0);
} else if (
redirection->type() == ExternalReference::PROFILING_API_CALL) {
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
PrintF("Call to host function at %p args %08x %08x",
reinterpret_cast<void*>(external), arg0, arg1);
if (!stack_aligned) {
PrintF(" with unaligned stack %08x\n", get_register(sp));
}
PrintF("\n");
}
CHECK(stack_aligned);
SimulatorRuntimeProfilingApiCall target =
reinterpret_cast<SimulatorRuntimeProfilingApiCall>(external);
target(arg0, Redirection::ReverseRedirection(arg1));
} else if (
redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
PrintF("Call to host function at %p args %08x %08x",
reinterpret_cast<void*>(external), arg0, arg1);
if (!stack_aligned) {
PrintF(" with unaligned stack %08x\n", get_register(sp));
}
PrintF("\n");
}
CHECK(stack_aligned);
SimulatorRuntimeDirectGetterCall target =
reinterpret_cast<SimulatorRuntimeDirectGetterCall>(external);
target(arg0, arg1);
} else if (
redirection->type() == ExternalReference::PROFILING_GETTER_CALL) {
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
PrintF("Call to host function at %p args %08x %08x %08x",
reinterpret_cast<void*>(external), arg0, arg1, arg2);
if (!stack_aligned) {
PrintF(" with unaligned stack %08x\n", get_register(sp));
}
PrintF("\n");
}
CHECK(stack_aligned);
SimulatorRuntimeProfilingGetterCall target =
reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(
external);
target(arg0, arg1, Redirection::ReverseRedirection(arg2));
} else {
// builtin call.
DCHECK(redirection->type() == ExternalReference::BUILTIN_CALL ||
redirection->type() == ExternalReference::BUILTIN_CALL_PAIR);
SimulatorRuntimeCall target =
reinterpret_cast<SimulatorRuntimeCall>(external);
if (::v8::internal::FLAG_trace_sim || !stack_aligned) {
PrintF(
"Call to host function at %p "
"args %08x, %08x, %08x, %08x, %08x, %08x, %08x, %08x, %08x",
reinterpret_cast<void*>(FUNCTION_ADDR(target)), arg0, arg1, arg2,
arg3, arg4, arg5, arg6, arg7, arg8);
if (!stack_aligned) {
PrintF(" with unaligned stack %08x\n", get_register(sp));
}
PrintF("\n");
}
CHECK(stack_aligned);
int64_t result =
target(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8);
int32_t lo_res = static_cast<int32_t>(result);
int32_t hi_res = static_cast<int32_t>(result >> 32);
if (::v8::internal::FLAG_trace_sim) {
PrintF("Returned %08x\n", lo_res);
}
set_register(r0, lo_res);
set_register(r1, hi_res);
}
set_register(lr, saved_lr);
set_pc(get_register(lr));
break;
}
case kBreakpoint: {
ArmDebugger dbg(this);
dbg.Debug();
break;
}
// stop uses all codes greater than 1 << 23.
default: {
if (svc >= (1 << 23)) {
uint32_t code = svc & kStopCodeMask;
if (isWatchedStop(code)) {
IncreaseStopCounter(code);
}
// Stop if it is enabled, otherwise go on jumping over the stop
// and the message address.
if (isEnabledStop(code)) {
ArmDebugger dbg(this);
dbg.Stop(instr);
}
} else {
// This is not a valid svc code.
UNREACHABLE();
break;
}
}
}
}
float Simulator::canonicalizeNaN(float value) {
// Default NaN value, see "NaN handling" in "IEEE 754 standard implementation
// choices" of the ARM Reference Manual.
constexpr uint32_t kDefaultNaN = 0x7FC00000u;
if (FPSCR_default_NaN_mode_ && std::isnan(value)) {
value = bit_cast<float>(kDefaultNaN);
}
return value;
}
Float32 Simulator::canonicalizeNaN(Float32 value) {
// Default NaN value, see "NaN handling" in "IEEE 754 standard implementation
// choices" of the ARM Reference Manual.
constexpr Float32 kDefaultNaN = Float32::FromBits(0x7FC00000u);
return FPSCR_default_NaN_mode_ && value.is_nan() ? kDefaultNaN : value;
}
double Simulator::canonicalizeNaN(double value) {
// Default NaN value, see "NaN handling" in "IEEE 754 standard implementation
// choices" of the ARM Reference Manual.
constexpr uint64_t kDefaultNaN = uint64_t{0x7FF8000000000000};
if (FPSCR_default_NaN_mode_ && std::isnan(value)) {
value = bit_cast<double>(kDefaultNaN);
}
return value;
}
Float64 Simulator::canonicalizeNaN(Float64 value) {
// Default NaN value, see "NaN handling" in "IEEE 754 standard implementation
// choices" of the ARM Reference Manual.
constexpr Float64 kDefaultNaN =
Float64::FromBits(uint64_t{0x7FF8000000000000});
return FPSCR_default_NaN_mode_ && value.is_nan() ? kDefaultNaN : value;
}
// Stop helper functions.
bool Simulator::isStopInstruction(Instruction* instr) {
return (instr->Bits(27, 24) == 0xF) && (instr->SvcValue() >= kStopCode);
}
bool Simulator::isWatchedStop(uint32_t code) {
DCHECK_LE(code, kMaxStopCode);
return code < kNumOfWatchedStops;
}
bool Simulator::isEnabledStop(uint32_t code) {
DCHECK_LE(code, kMaxStopCode);
// Unwatched stops are always enabled.
return !isWatchedStop(code) ||
!(watched_stops_[code].count & kStopDisabledBit);
}
void Simulator::EnableStop(uint32_t code) {
DCHECK(isWatchedStop(code));
if (!isEnabledStop(code)) {
watched_stops_[code].count &= ~kStopDisabledBit;
}
}
void Simulator::DisableStop(uint32_t code) {
DCHECK(isWatchedStop(code));
if (isEnabledStop(code)) {
watched_stops_[code].count |= kStopDisabledBit;
}
}
void Simulator::IncreaseStopCounter(uint32_t code) {
DCHECK_LE(code, kMaxStopCode);
DCHECK(isWatchedStop(code));
if ((watched_stops_[code].count & ~(1 << 31)) == 0x7FFFFFFF) {
PrintF("Stop counter for code %i has overflowed.\n"
"Enabling this code and reseting the counter to 0.\n", code);
watched_stops_[code].count = 0;
EnableStop(code);
} else {
watched_stops_[code].count++;
}
}
// Print a stop status.
void Simulator::PrintStopInfo(uint32_t code) {
DCHECK_LE(code, kMaxStopCode);
if (!isWatchedStop(code)) {
PrintF("Stop not watched.");
} else {
const char* state = isEnabledStop(code) ? "Enabled" : "Disabled";
int32_t count = watched_stops_[code].count & ~kStopDisabledBit;
// Don't print the state of unused breakpoints.
if (count != 0) {
if (watched_stops_[code].desc) {
PrintF("stop %i - 0x%x: \t%s, \tcounter = %i, \t%s\n",
code, code, state, count, watched_stops_[code].desc);
} else {
PrintF("stop %i - 0x%x: \t%s, \tcounter = %i\n",
code, code, state, count);
}
}
}
}
// Handle execution based on instruction types.
// Instruction types 0 and 1 are both rolled into one function because they
// only differ in the handling of the shifter_operand.
void Simulator::DecodeType01(Instruction* instr) {
int type = instr->TypeValue();
if ((type == 0) && instr->IsSpecialType0()) {
// multiply instruction or extra loads and stores
if (instr->Bits(7, 4) == 9) {
if (instr->Bit(24) == 0) {
// Raw field decoding here. Multiply instructions have their Rd in
// funny places.
int rn = instr->RnValue();
int rm = instr->RmValue();
int rs = instr->RsValue();
int32_t rs_val = get_register(rs);
int32_t rm_val = get_register(rm);
if (instr->Bit(23) == 0) {
if (instr->Bit(21) == 0) {
// The MUL instruction description (A 4.1.33) refers to Rd as being
// the destination for the operation, but it confusingly uses the
// Rn field to encode it.
// Format(instr, "mul'cond's 'rn, 'rm, 'rs");
int rd = rn; // Remap the rn field to the Rd register.
int32_t alu_out = rm_val * rs_val;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
}
} else {
int rd = instr->RdValue();
int32_t acc_value = get_register(rd);
if (instr->Bit(22) == 0) {
// The MLA instruction description (A 4.1.28) refers to the order
// of registers as "Rd, Rm, Rs, Rn". But confusingly it uses the
// Rn field to encode the Rd register and the Rd field to encode
// the Rn register.
// Format(instr, "mla'cond's 'rn, 'rm, 'rs, 'rd");
int32_t mul_out = rm_val * rs_val;
int32_t result = acc_value + mul_out;
set_register(rn, result);
} else {
// Format(instr, "mls'cond's 'rn, 'rm, 'rs, 'rd");
int32_t mul_out = rm_val * rs_val;
int32_t result = acc_value - mul_out;
set_register(rn, result);
}
}
} else {
// The signed/long multiply instructions use the terms RdHi and RdLo
// when referring to the target registers. They are mapped to the Rn
// and Rd fields as follows:
// RdLo == Rd
// RdHi == Rn (This is confusingly stored in variable rd here
// because the mul instruction from above uses the
// Rn field to encode the Rd register. Good luck figuring
// this out without reading the ARM instruction manual
// at a very detailed level.)
// Format(instr, "'um'al'cond's 'rd, 'rn, 'rs, 'rm");
int rd_hi = rn; // Remap the rn field to the RdHi register.
int rd_lo = instr->RdValue();
int32_t hi_res = 0;
int32_t lo_res = 0;
if (instr->Bit(22) == 1) {
int64_t left_op = static_cast<int32_t>(rm_val);
int64_t right_op = static_cast<int32_t>(rs_val);
uint64_t result = left_op * right_op;
hi_res = static_cast<int32_t>(result >> 32);
lo_res = static_cast<int32_t>(result & 0xFFFFFFFF);
} else {
// unsigned multiply
uint64_t left_op = static_cast<uint32_t>(rm_val);
uint64_t right_op = static_cast<uint32_t>(rs_val);
uint64_t result = left_op * right_op;
hi_res = static_cast<int32_t>(result >> 32);
lo_res = static_cast<int32_t>(result & 0xFFFFFFFF);
}
set_register(rd_lo, lo_res);
set_register(rd_hi, hi_res);
if (instr->HasS()) {
UNIMPLEMENTED();
}
}
} else {
if (instr->Bits(24, 23) == 3) {
if (instr->Bit(20) == 1) {
// ldrex
int rt = instr->RtValue();
int rn = instr->RnValue();
int32_t addr = get_register(rn);
switch (instr->Bits(22, 21)) {
case 0: {
// Format(instr, "ldrex'cond 'rt, ['rn]");
int value = ReadExW(addr, instr);
set_register(rt, value);
break;
}
case 2: {
// Format(instr, "ldrexb'cond 'rt, ['rn]");
uint8_t value = ReadExBU(addr);
set_register(rt, value);
break;
}
case 3: {
// Format(instr, "ldrexh'cond 'rt, ['rn]");
uint16_t value = ReadExHU(addr, instr);
set_register(rt, value);
break;
}
default:
UNREACHABLE();
break;
}
} else {
// The instruction is documented as strex rd, rt, [rn], but the
// "rt" register is using the rm bits.
int rd = instr->RdValue();
int rt = instr->RmValue();
int rn = instr->RnValue();
DCHECK_NE(rd, rn);
DCHECK_NE(rd, rt);
int32_t addr = get_register(rn);
switch (instr->Bits(22, 21)) {
case 0: {
// Format(instr, "strex'cond 'rd, 'rm, ['rn]");
int value = get_register(rt);
int status = WriteExW(addr, value, instr);
set_register(rd, status);
break;
}
case 2: {
// Format(instr, "strexb'cond 'rd, 'rm, ['rn]");
uint8_t value = get_register(rt);
int status = WriteExB(addr, value);
set_register(rd, status);
break;
}
case 3: {
// Format(instr, "strexh'cond 'rd, 'rm, ['rn]");
uint16_t value = get_register(rt);
int status = WriteExH(addr, value, instr);
set_register(rd, status);
break;
}
default:
UNREACHABLE();
break;
}
}
} else {
UNIMPLEMENTED(); // Not used by V8.
}
}
} else {
// extra load/store instructions
int rd = instr->RdValue();
int rn = instr->RnValue();
int32_t rn_val = get_register(rn);
int32_t addr = 0;
if (instr->Bit(22) == 0) {
int rm = instr->RmValue();
int32_t rm_val = get_register(rm);
switch (instr->PUField()) {
case da_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn], -'rm");
DCHECK(!instr->HasW());
addr = rn_val;
rn_val -= rm_val;
set_register(rn, rn_val);
break;
}
case ia_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn], +'rm");
DCHECK(!instr->HasW());
addr = rn_val;
rn_val += rm_val;
set_register(rn, rn_val);
break;
}
case db_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn, -'rm]'w");
rn_val -= rm_val;
addr = rn_val;
if (instr->HasW()) {
set_register(rn, rn_val);
}
break;
}
case ib_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn, +'rm]'w");
rn_val += rm_val;
addr = rn_val;
if (instr->HasW()) {
set_register(rn, rn_val);
}
break;
}
default: {
// The PU field is a 2-bit field.
UNREACHABLE();
break;
}
}
} else {
int32_t imm_val = (instr->ImmedHValue() << 4) | instr->ImmedLValue();
switch (instr->PUField()) {
case da_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn], #-'off8");
DCHECK(!instr->HasW());
addr = rn_val;
rn_val -= imm_val;
set_register(rn, rn_val);
break;
}
case ia_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn], #+'off8");
DCHECK(!instr->HasW());
addr = rn_val;
rn_val += imm_val;
set_register(rn, rn_val);
break;
}
case db_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn, #-'off8]'w");
rn_val -= imm_val;
addr = rn_val;
if (instr->HasW()) {
set_register(rn, rn_val);
}
break;
}
case ib_x: {
// Format(instr, "'memop'cond'sign'h 'rd, ['rn, #+'off8]'w");
rn_val += imm_val;
addr = rn_val;
if (instr->HasW()) {
set_register(rn, rn_val);
}
break;
}
default: {
// The PU field is a 2-bit field.
UNREACHABLE();
break;
}
}
}
if (((instr->Bits(7, 4) & 0xD) == 0xD) && (instr->Bit(20) == 0)) {
DCHECK_EQ(rd % 2, 0);
if (instr->HasH()) {
// The strd instruction.
int32_t value1 = get_register(rd);
int32_t value2 = get_register(rd+1);
WriteDW(addr, value1, value2);
} else {
// The ldrd instruction.
int* rn_data = ReadDW(addr);
set_dw_register(rd, rn_data);
}
} else if (instr->HasH()) {
if (instr->HasSign()) {
if (instr->HasL()) {
int16_t val = ReadH(addr, instr);
set_register(rd, val);
} else {
int16_t val = get_register(rd);
WriteH(addr, val, instr);
}
} else {
if (instr->HasL()) {
uint16_t val = ReadHU(addr, instr);
set_register(rd, val);
} else {
uint16_t val = get_register(rd);
WriteH(addr, val, instr);
}
}
} else {
// signed byte loads
DCHECK(instr->HasSign());
DCHECK(instr->HasL());
int8_t val = ReadB(addr);
set_register(rd, val);
}
return;
}
} else if ((type == 0) && instr->IsMiscType0()) {
if ((instr->Bits(27, 23) == 2) && (instr->Bits(21, 20) == 2) &&
(instr->Bits(15, 4) == 0xF00)) {
// MSR
int rm = instr->RmValue();
DCHECK_NE(pc, rm); // UNPREDICTABLE
SRegisterFieldMask sreg_and_mask =
instr->BitField(22, 22) | instr->BitField(19, 16);
SetSpecialRegister(sreg_and_mask, get_register(rm));
} else if ((instr->Bits(27, 23) == 2) && (instr->Bits(21, 20) == 0) &&
(instr->Bits(11, 0) == 0)) {
// MRS
int rd = instr->RdValue();
DCHECK_NE(pc, rd); // UNPREDICTABLE
SRegister sreg = static_cast<SRegister>(instr->BitField(22, 22));
set_register(rd, GetFromSpecialRegister(sreg));
} else if (instr->Bits(22, 21) == 1) {
int rm = instr->RmValue();
switch (instr->BitField(7, 4)) {
case BX:
set_pc(get_register(rm));
break;
case BLX: {
uint32_t old_pc = get_pc();
set_pc(get_register(rm));
set_register(lr, old_pc + Instruction::kInstrSize);
break;
}
case BKPT: {
ArmDebugger dbg(this);
PrintF("Simulator hit BKPT.\n");
dbg.Debug();
break;
}
default:
UNIMPLEMENTED();
}
} else if (instr->Bits(22, 21) == 3) {
int rm = instr->RmValue();
int rd = instr->RdValue();
switch (instr->BitField(7, 4)) {
case CLZ: {
uint32_t bits = get_register(rm);
int leading_zeros = 0;
if (bits == 0) {
leading_zeros = 32;
} else {
while ((bits & 0x80000000u) == 0) {
bits <<= 1;
leading_zeros++;
}
}
set_register(rd, leading_zeros);
break;
}
default:
UNIMPLEMENTED();
}
} else {
PrintF("%08x\n", instr->InstructionBits());
UNIMPLEMENTED();
}
} else if ((type == 1) && instr->IsNopLikeType1()) {
if (instr->BitField(7, 0) == 0) {
// NOP.
} else if (instr->BitField(7, 0) == 20) {
// CSDB.
} else {
PrintF("%08x\n", instr->InstructionBits());
UNIMPLEMENTED();
}
} else {
int rd = instr->RdValue();
int rn = instr->RnValue();
int32_t rn_val = get_register(rn);
int32_t shifter_operand = 0;
bool shifter_carry_out = 0;
if (type == 0) {
shifter_operand = GetShiftRm(instr, &shifter_carry_out);
} else {
DCHECK_EQ(instr->TypeValue(), 1);
shifter_operand = GetImm(instr, &shifter_carry_out);
}
int32_t alu_out;
switch (instr->OpcodeField()) {
case AND: {
// Format(instr, "and'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "and'cond's 'rd, 'rn, 'imm");
alu_out = rn_val & shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
}
break;
}
case EOR: {
// Format(instr, "eor'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "eor'cond's 'rd, 'rn, 'imm");
alu_out = rn_val ^ shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
}
break;
}
case SUB: {
// Format(instr, "sub'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "sub'cond's 'rd, 'rn, 'imm");
alu_out = rn_val - shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(!BorrowFrom(rn_val, shifter_operand));
SetVFlag(OverflowFrom(alu_out, rn_val, shifter_operand, false));
}
break;
}
case RSB: {
// Format(instr, "rsb'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "rsb'cond's 'rd, 'rn, 'imm");
alu_out = shifter_operand - rn_val;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(!BorrowFrom(shifter_operand, rn_val));
SetVFlag(OverflowFrom(alu_out, shifter_operand, rn_val, false));
}
break;
}
case ADD: {
// Format(instr, "add'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "add'cond's 'rd, 'rn, 'imm");
alu_out = rn_val + shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(CarryFrom(rn_val, shifter_operand));
SetVFlag(OverflowFrom(alu_out, rn_val, shifter_operand, true));
}
break;
}
case ADC: {
// Format(instr, "adc'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "adc'cond's 'rd, 'rn, 'imm");
alu_out = rn_val + shifter_operand + GetCarry();
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(CarryFrom(rn_val, shifter_operand, GetCarry()));
SetVFlag(OverflowFrom(alu_out, rn_val, shifter_operand, true));
}
break;
}
case SBC: {
// Format(instr, "sbc'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "sbc'cond's 'rd, 'rn, 'imm");
alu_out = (rn_val - shifter_operand) - (GetCarry() ? 0 : 1);
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(!BorrowFrom(rn_val, shifter_operand, GetCarry()));
SetVFlag(OverflowFrom(alu_out, rn_val, shifter_operand, false));
}
break;
}
case RSC: {
Format(instr, "rsc'cond's 'rd, 'rn, 'shift_rm");
Format(instr, "rsc'cond's 'rd, 'rn, 'imm");
break;
}
case TST: {
if (instr->HasS()) {
// Format(instr, "tst'cond 'rn, 'shift_rm");
// Format(instr, "tst'cond 'rn, 'imm");
alu_out = rn_val & shifter_operand;
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
} else {
// Format(instr, "movw'cond 'rd, 'imm").
alu_out = instr->ImmedMovwMovtValue();
set_register(rd, alu_out);
}
break;
}
case TEQ: {
if (instr->HasS()) {
// Format(instr, "teq'cond 'rn, 'shift_rm");
// Format(instr, "teq'cond 'rn, 'imm");
alu_out = rn_val ^ shifter_operand;
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
} else {
// Other instructions matching this pattern are handled in the
// miscellaneous instructions part above.
UNREACHABLE();
}
break;
}
case CMP: {
if (instr->HasS()) {
// Format(instr, "cmp'cond 'rn, 'shift_rm");
// Format(instr, "cmp'cond 'rn, 'imm");
alu_out = rn_val - shifter_operand;
SetNZFlags(alu_out);
SetCFlag(!BorrowFrom(rn_val, shifter_operand));
SetVFlag(OverflowFrom(alu_out, rn_val, shifter_operand, false));
} else {
// Format(instr, "movt'cond 'rd, 'imm").
alu_out =
(get_register(rd) & 0xFFFF) | (instr->ImmedMovwMovtValue() << 16);
set_register(rd, alu_out);
}
break;
}
case CMN: {
if (instr->HasS()) {
// Format(instr, "cmn'cond 'rn, 'shift_rm");
// Format(instr, "cmn'cond 'rn, 'imm");
alu_out = rn_val + shifter_operand;
SetNZFlags(alu_out);
SetCFlag(CarryFrom(rn_val, shifter_operand));
SetVFlag(OverflowFrom(alu_out, rn_val, shifter_operand, true));
} else {
// Other instructions matching this pattern are handled in the
// miscellaneous instructions part above.
UNREACHABLE();
}
break;
}
case ORR: {
// Format(instr, "orr'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "orr'cond's 'rd, 'rn, 'imm");
alu_out = rn_val | shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
}
break;
}
case MOV: {
// Format(instr, "mov'cond's 'rd, 'shift_rm");
// Format(instr, "mov'cond's 'rd, 'imm");
alu_out = shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
}
break;
}
case BIC: {
// Format(instr, "bic'cond's 'rd, 'rn, 'shift_rm");
// Format(instr, "bic'cond's 'rd, 'rn, 'imm");
alu_out = rn_val & ~shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
}
break;
}
case MVN: {
// Format(instr, "mvn'cond's 'rd, 'shift_rm");
// Format(instr, "mvn'cond's 'rd, 'imm");
alu_out = ~shifter_operand;
set_register(rd, alu_out);
if (instr->HasS()) {
SetNZFlags(alu_out);
SetCFlag(shifter_carry_out);
}
break;
}
default: {
UNREACHABLE();
break;
}
}
}
}
void Simulator::DecodeType2(Instruction* instr) {
int rd = instr->RdValue();
int rn = instr->RnValue();
int32_t rn_val = get_register(rn);
int32_t im_val = instr->Offset12Value();
int32_t addr = 0;
switch (instr->PUField()) {
case da_x: {
// Format(instr, "'memop'cond'b 'rd, ['rn], #-'off12");
DCHECK(!instr->HasW());
addr = rn_val;
rn_val -= im_val;
set_register(rn, rn_val);
break;
}
case ia_x: {
// Format(instr, "'memop'cond'b 'rd, ['rn], #+'off12");
DCHECK(!instr->HasW());
addr = rn_val;
rn_val += im_val;
set_register(rn, rn_val);
break;
}
case db_x: {
// Format(instr, "'memop'cond'b 'rd, ['rn, #-'off12]'w");
rn_val -= im_val;
addr = rn_val;
if (instr->HasW()) {
set_register(rn, rn_val);
}
break;
}
case ib_x: {
// Format(instr, "'memop'cond'b 'rd, ['rn, #+'off12]'w");
rn_val += im_val;
addr = rn_val;
if (instr->HasW()) {
set_register(rn, rn_val);
}
break;
}
default: {
UNREACHABLE();
break;
}
}
if (instr->HasB()) {
if (instr->HasL()) {
byte val = ReadBU(addr);
set_register(rd, val);
} else {
byte val = get_register(rd);
WriteB(addr, val);
}
} else {
if (instr->HasL()) {
set_register(rd, ReadW(addr, instr));
} else {
WriteW(addr, get_register(rd), instr);
}
}
}
void Simulator::DecodeType3(Instruction* instr) {
int rd = instr->RdValue();
int rn = instr->RnValue();
int32_t rn_val = get_register(rn);
bool shifter_carry_out = 0;
int32_t shifter_operand = GetShiftRm(instr, &shifter_carry_out);
int32_t addr = 0;
switch (instr->PUField()) {
case da_x: {
DCHECK(!instr->HasW());
Format(instr, "'memop'cond'b 'rd, ['rn], -'shift_rm");
UNIMPLEMENTED();
break;
}
case ia_x: {
if (instr->Bit(4) == 0) {
// Memop.
} else {
if (instr->Bit(5) == 0) {
switch (instr->Bits(22, 21)) {
case 0:
if (instr->Bit(20) == 0) {
if (instr->Bit(6) == 0) {
// Pkhbt.
uint32_t rn_val = get_register(rn);
uint32_t rm_val = get_register(instr->RmValue());
int32_t shift = instr->Bits(11, 7);
rm_val <<= shift;
set_register(rd, (rn_val & 0xFFFF) | (rm_val & 0xFFFF0000U));
} else {
// Pkhtb.
uint32_t rn_val = get_register(rn);
int32_t rm_val = get_register(instr->RmValue());
int32_t shift = instr->Bits(11, 7);
if (shift == 0) {
shift = 32;
}
rm_val >>= shift;
set_register(rd, (rn_val & 0xFFFF0000U) | (rm_val & 0xFFFF));
}
} else {
UNIMPLEMENTED();
}
break;
case 1:
UNIMPLEMENTED();
break;
case 2:
UNIMPLEMENTED();
break;
case 3: {
// Usat.
int32_t sat_pos = instr->Bits(20, 16);
int32_t sat_val = (1 << sat_pos) - 1;
int32_t shift = instr->Bits(11, 7);
int32_t shift_type = instr->Bit(6);
int32_t rm_val = get_register(instr->RmValue());
if (shift_type == 0) { // LSL
rm_val <<= shift;
} else { // ASR
rm_val >>= shift;
}
// If saturation occurs, the Q flag should be set in the CPSR.
// There is no Q flag yet, and no instruction (MRS) to read the
// CPSR directly.
if (rm_val > sat_val) {
rm_val = sat_val;
} else if (rm_val < 0) {
rm_val = 0;
}
set_register(rd, rm_val);
break;
}
}
} else {
switch (instr->Bits(22, 21)) {
case 0:
UNIMPLEMENTED();
break;
case 1:
if (instr->Bits(9, 6) == 1) {
if (instr->Bit(20) == 0) {
if (instr->Bits(19, 16) == 0xF) {
// Sxtb.
int32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, static_cast<int8_t>(rm_val));
} else {
// Sxtab.
int32_t rn_val = get_register(rn);
int32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, rn_val + static_cast<int8_t>(rm_val));
}
} else {
if (instr->Bits(19, 16) == 0xF) {
// Sxth.
int32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, static_cast<int16_t>(rm_val));
} else {
// Sxtah.
int32_t rn_val = get_register(rn);
int32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, rn_val + static_cast<int16_t>(rm_val));
}
}
} else {
UNREACHABLE();
}
break;
case 2:
if ((instr->Bit(20) == 0) && (instr->Bits(9, 6) == 1)) {
if (instr->Bits(19, 16) == 0xF) {
// Uxtb16.
uint32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, (rm_val & 0xFF) | (rm_val & 0xFF0000));
} else {
UNIMPLEMENTED();
}
} else {
UNIMPLEMENTED();
}
break;
case 3:
if ((instr->Bits(9, 6) == 1)) {
if (instr->Bit(20) == 0) {
if (instr->Bits(19, 16) == 0xF) {
// Uxtb.
uint32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, (rm_val & 0xFF));
} else {
// Uxtab.
uint32_t rn_val = get_register(rn);
uint32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, rn_val + (rm_val & 0xFF));
}
} else {
if (instr->Bits(19, 16) == 0xF) {
// Uxth.
uint32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, (rm_val & 0xFFFF));
} else {
// Uxtah.
uint32_t rn_val = get_register(rn);
uint32_t rm_val = get_register(instr->RmValue());
int32_t rotate = instr->Bits(11, 10);
switch (rotate) {
case 0:
break;
case 1:
rm_val = (rm_val >> 8) | (rm_val << 24);
break;
case 2:
rm_val = (rm_val >> 16) | (rm_val << 16);
break;
case 3:
rm_val = (rm_val >> 24) | (rm_val << 8);
break;
}
set_register(rd, rn_val + (rm_val & 0xFFFF));
}
}
} else {
// PU == 0b01, BW == 0b11, Bits(9, 6) != 0b0001
if ((instr->Bits(20, 16) == 0x1F) &&
(instr->Bits(11, 4) == 0xF3)) {
// Rbit.
uint32_t rm_val = get_register(instr->RmValue());
set_register(rd, base::bits::ReverseBits(rm_val));
} else {
UNIMPLEMENTED();
}
}
break;
}
}
return;
}
break;
}
case db_x: {
if (instr->Bits(22, 20) == 0x5) {
if (instr->Bits(7, 4) == 0x1) {
int rm = instr->RmValue();
int32_t rm_val = get_register(rm);
int rs = instr->RsValue();
int32_t rs_val = get_register(rs);
if (instr->Bits(15, 12) == 0xF) {
// SMMUL (in V8 notation matching ARM ISA format)
// Format(instr, "smmul'cond 'rn, 'rm, 'rs");
rn_val = base::bits::SignedMulHigh32(rm_val, rs_val);
} else {
// SMMLA (in V8 notation matching ARM ISA format)
// Format(instr, "smmla'cond 'rn, 'rm, 'rs, 'rd");
int rd = instr->RdValue();
int32_t rd_val = get_register(rd);
rn_val = base::bits::SignedMulHighAndAdd32(rm_val, rs_val, rd_val);
}
set_register(rn, rn_val);
return;
}
}
if (instr->Bits(5, 4) == 0x1) {
if ((instr->Bit(22) == 0x0) && (instr->Bit(20) == 0x1)) {
// (s/u)div (in V8 notation matching ARM ISA format) rn = rm/rs
// Format(instr, "'(s/u)div'cond'b 'rn, 'rm, 'rs);
int rm = instr->RmValue();
int32_t rm_val = get_register(rm);
int rs = instr->RsValue();
int32_t rs_val = get_register(rs);
int32_t ret_val = 0;
// udiv
if (instr->Bit(21) == 0x1) {
ret_val = bit_cast<int32_t>(base::bits::UnsignedDiv32(
bit_cast<uint32_t>(rm_val), bit_cast<uint32_t>(rs_val)));
} else {
ret_val = base::bits::SignedDiv32(rm_val, rs_val);
}
set_register(rn, ret_val);
return;
}
}
// Format(instr, "'memop'cond'b 'rd, ['rn, -'shift_rm]'w");
addr = rn_val - shifter_operand;
if (instr->HasW()) {
set_register(rn, addr);
}
break;
}
case ib_x: {
if (instr->HasW() && (instr->Bits(6, 4) == 0x5)) {
uint32_t widthminus1 = static_cast<uint32_t>(instr->Bits(20, 16));
uint32_t lsbit = static_cast<uint32_t>(instr->Bits(11, 7));
uint32_t msbit = widthminus1 + lsbit;
if (msbit <= 31) {
if (instr->Bit(22)) {
// ubfx - unsigned bitfield extract.
uint32_t rm_val =
static_cast<uint32_t>(get_register(instr->RmValue()));
uint32_t extr_val = rm_val << (31 - msbit);
extr_val = extr_val >> (31 - widthminus1);
set_register(instr->RdValue(), extr_val);
} else {
// sbfx - signed bitfield extract.
int32_t rm_val = get_register(instr->RmValue());
int32_t extr_val = rm_val << (31 - msbit);
extr_val = extr_val >> (31 - widthminus1);
set_register(instr->RdValue(), extr_val);
}
} else {
UNREACHABLE();
}
return;
} else if (!instr->HasW() && (instr->Bits(6, 4) == 0x1)) {
uint32_t lsbit = static_cast<uint32_t>(instr->Bits(11, 7));
uint32_t msbit = static_cast<uint32_t>(instr->Bits(20, 16));
if (msbit >= lsbit) {
// bfc or bfi - bitfield clear/insert.
uint32_t rd_val =
static_cast<uint32_t>(get_register(instr->RdValue()));
uint32_t bitcount = msbit - lsbit + 1;
uint32_t mask = 0xFFFFFFFFu >> (32 - bitcount);
rd_val &= ~(mask << lsbit);
if (instr->RmValue() != 15) {
// bfi - bitfield insert.
uint32_t rm_val =
static_cast<uint32_t>(get_register(instr->RmValue()));
rm_val &= mask;
rd_val |= rm_val << lsbit;
}
set_register(instr->RdValue(), rd_val);
} else {
UNREACHABLE();
}
return;
} else {
// Format(instr, "'memop'cond'b 'rd, ['rn, +'shift_rm]'w");
addr = rn_val + shifter_operand;
if (instr->HasW()) {
set_register(rn, addr);
}
}
break;
}
default: {
UNREACHABLE();
break;
}
}
if (instr->HasB()) {
if (instr->HasL()) {
uint8_t byte = ReadB(addr);
set_register(rd, byte);
} else {
uint8_t byte = get_register(rd);
WriteB(addr, byte);
}
} else {
if (instr->HasL()) {
set_register(rd, ReadW(addr, instr));
} else {
WriteW(addr, get_register(rd), instr);
}
}
}
void Simulator::DecodeType4(Instruction* instr) {
DCHECK_EQ(instr->Bit(22), 0); // only allowed to be set in privileged mode
if (instr->HasL()) {
// Format(instr, "ldm'cond'pu 'rn'w, 'rlist");
HandleRList(instr, true);
} else {
// Format(instr, "stm'cond'pu 'rn'w, 'rlist");
HandleRList(instr, false);
}
}
void Simulator::DecodeType5(Instruction* instr) {
// Format(instr, "b'l'cond 'target");
int off = (instr->SImmed24Value() << 2);
intptr_t pc_address = get_pc();
if (instr->HasLink()) {
set_register(lr, pc_address + Instruction::kInstrSize);
}
int pc_reg = get_register(pc);
set_pc(pc_reg + off);
}
void Simulator::DecodeType6(Instruction* instr) {
DecodeType6CoprocessorIns(instr);
}
void Simulator::DecodeType7(Instruction* instr) {
if (instr->Bit(24) == 1) {
SoftwareInterrupt(instr);
} else {
switch (instr->CoprocessorValue()) {
case 10: // Fall through.
case 11:
DecodeTypeVFP(instr);
break;
case 15:
DecodeTypeCP15(instr);
break;
default:
UNIMPLEMENTED();
}
}
}
// void Simulator::DecodeTypeVFP(Instruction* instr)
// The Following ARMv7 VFPv instructions are currently supported.
// vmov :Sn = Rt
// vmov :Rt = Sn
// vcvt: Dd = Sm
// vcvt: Sd = Dm
// vcvt.f64.s32 Dd, Dd, #<fbits>
// Dd = vabs(Dm)
// Sd = vabs(Sm)
// Dd = vneg(Dm)
// Sd = vneg(Sm)
// Dd = vadd(Dn, Dm)
// Sd = vadd(Sn, Sm)
// Dd = vsub(Dn, Dm)
// Sd = vsub(Sn, Sm)
// Dd = vmul(Dn, Dm)
// Sd = vmul(Sn, Sm)
// Dd = vdiv(Dn, Dm)
// Sd = vdiv(Sn, Sm)
// vcmp(Dd, Dm)
// vcmp(Sd, Sm)
// Dd = vsqrt(Dm)
// Sd = vsqrt(Sm)
// vmrs
// vdup.size Qd, Rt.
void Simulator::DecodeTypeVFP(Instruction* instr) {
DCHECK((instr->TypeValue() == 7) && (instr->Bit(24) == 0x0) );
DCHECK_EQ(instr->Bits(11, 9), 0x5);
// Obtain single precision register codes.
int m = instr->VFPMRegValue(kSinglePrecision);
int d = instr->VFPDRegValue(kSinglePrecision);
int n = instr->VFPNRegValue(kSinglePrecision);
// Obtain double precision register codes.
int vm = instr->VFPMRegValue(kDoublePrecision);
int vd = instr->VFPDRegValue(kDoublePrecision);
int vn = instr->VFPNRegValue(kDoublePrecision);
if (instr->Bit(4) == 0) {
if (instr->Opc1Value() == 0x7) {
// Other data processing instructions
if ((instr->Opc2Value() == 0x0) && (instr->Opc3Value() == 0x1)) {
// vmov register to register.
if (instr->SzValue() == 0x1) {
uint32_t data[2];
get_d_register(vm, data);
set_d_register(vd, data);
} else {
set_s_register(d, get_s_register(m));
}
} else if ((instr->Opc2Value() == 0x0) && (instr->Opc3Value() == 0x3)) {
// vabs
if (instr->SzValue() == 0x1) {
Float64 dm = get_double_from_d_register(vm);
constexpr uint64_t kSignBit64 = uint64_t{1} << 63;
Float64 dd = Float64::FromBits(dm.get_bits() & ~kSignBit64);
dd = canonicalizeNaN(dd);
set_d_register_from_double(vd, dd);
} else {
Float32 sm = get_float_from_s_register(m);
constexpr uint32_t kSignBit32 = uint32_t{1} << 31;
Float32 sd = Float32::FromBits(sm.get_bits() & ~kSignBit32);
sd = canonicalizeNaN(sd);
set_s_register_from_float(d, sd);
}
} else if ((instr->Opc2Value() == 0x1) && (instr->Opc3Value() == 0x1)) {
// vneg
if (instr->SzValue() == 0x1) {
Float64 dm = get_double_from_d_register(vm);
constexpr uint64_t kSignBit64 = uint64_t{1} << 63;
Float64 dd = Float64::FromBits(dm.get_bits() ^ kSignBit64);
dd = canonicalizeNaN(dd);
set_d_register_from_double(vd, dd);
} else {
Float32 sm = get_float_from_s_register(m);
constexpr uint32_t kSignBit32 = uint32_t{1} << 31;
Float32 sd = Float32::FromBits(sm.get_bits() ^ kSignBit32);
sd = canonicalizeNaN(sd);
set_s_register_from_float(d, sd);
}
} else if ((instr->Opc2Value() == 0x7) && (instr->Opc3Value() == 0x3)) {
DecodeVCVTBetweenDoubleAndSingle(instr);
} else if ((instr->Opc2Value() == 0x8) && (instr->Opc3Value() & 0x1)) {
DecodeVCVTBetweenFloatingPointAndInteger(instr);
} else if ((instr->Opc2Value() == 0xA) && (instr->Opc3Value() == 0x3) &&
(instr->Bit(8) == 1)) {
// vcvt.f64.s32 Dd, Dd, #<fbits>
int fraction_bits = 32 - ((instr->Bits(3, 0) << 1) | instr->Bit(5));
int fixed_value = get_sinteger_from_s_register(vd * 2);
double divide = 1 << fraction_bits;
set_d_register_from_double(vd, fixed_value / divide);
} else if (((instr->Opc2Value() >> 1) == 0x6) &&
(instr->Opc3Value() & 0x1)) {
DecodeVCVTBetweenFloatingPointAndInteger(instr);
} else if (((instr->Opc2Value() == 0x4) || (instr->Opc2Value() == 0x5)) &&
(instr->Opc3Value() & 0x1)) {
DecodeVCMP(instr);
} else if (((instr->Opc2Value() == 0x1)) && (instr->Opc3Value() == 0x3)) {
// vsqrt
lazily_initialize_fast_sqrt(isolate_);
if (instr->SzValue() == 0x1) {
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = fast_sqrt(dm_value, isolate_);
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = fast_sqrt(sm_value, isolate_);
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else if (instr->Opc3Value() == 0x0) {
// vmov immediate.
if (instr->SzValue() == 0x1) {
set_d_register_from_double(vd, instr->DoubleImmedVmov());
} else {
// Cast double to float.
float value = instr->DoubleImmedVmov().get_scalar();
set_s_register_from_float(d, value);
}
} else if (((instr->Opc2Value() == 0x6)) && (instr->Opc3Value() == 0x3)) {
// vrintz - truncate
if (instr->SzValue() == 0x1) {
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = trunc(dm_value);
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = truncf(sm_value);
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else {
UNREACHABLE(); // Not used by V8.
}
} else if (instr->Opc1Value() == 0x3) {
if (instr->Opc3Value() & 0x1) {
// vsub
if (instr->SzValue() == 0x1) {
double dn_value = get_double_from_d_register(vn).get_scalar();
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = dn_value - dm_value;
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
float sn_value = get_float_from_s_register(n).get_scalar();
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = sn_value - sm_value;
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else {
// vadd
if (instr->SzValue() == 0x1) {
double dn_value = get_double_from_d_register(vn).get_scalar();
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = dn_value + dm_value;
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
float sn_value = get_float_from_s_register(n).get_scalar();
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = sn_value + sm_value;
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
}
} else if ((instr->Opc1Value() == 0x2) && !(instr->Opc3Value() & 0x1)) {
// vmul
if (instr->SzValue() == 0x1) {
double dn_value = get_double_from_d_register(vn).get_scalar();
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = dn_value * dm_value;
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
float sn_value = get_float_from_s_register(n).get_scalar();
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = sn_value * sm_value;
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else if ((instr->Opc1Value() == 0x0)) {
// vmla, vmls
const bool is_vmls = (instr->Opc3Value() & 0x1);
if (instr->SzValue() == 0x1) {
const double dd_val = get_double_from_d_register(vd).get_scalar();
const double dn_val = get_double_from_d_register(vn).get_scalar();
const double dm_val = get_double_from_d_register(vm).get_scalar();
// Note: we do the mul and add/sub in separate steps to avoid getting a
// result with too high precision.
const double res = dn_val * dm_val;
set_d_register_from_double(vd, res);
if (is_vmls) {
set_d_register_from_double(vd, canonicalizeNaN(dd_val - res));
} else {
set_d_register_from_double(vd, canonicalizeNaN(dd_val + res));
}
} else {
const float sd_val = get_float_from_s_register(d).get_scalar();
const float sn_val = get_float_from_s_register(n).get_scalar();
const float sm_val = get_float_from_s_register(m).get_scalar();
// Note: we do the mul and add/sub in separate steps to avoid getting a
// result with too high precision.
const float res = sn_val * sm_val;
set_s_register_from_float(d, res);
if (is_vmls) {
set_s_register_from_float(d, canonicalizeNaN(sd_val - res));
} else {
set_s_register_from_float(d, canonicalizeNaN(sd_val + res));
}
}
} else if ((instr->Opc1Value() == 0x4) && !(instr->Opc3Value() & 0x1)) {
// vdiv
if (instr->SzValue() == 0x1) {
double dn_value = get_double_from_d_register(vn).get_scalar();
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = dn_value / dm_value;
div_zero_vfp_flag_ = (dm_value == 0);
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
float sn_value = get_float_from_s_register(n).get_scalar();
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = sn_value / sm_value;
div_zero_vfp_flag_ = (sm_value == 0);
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else {
UNIMPLEMENTED(); // Not used by V8.
}
} else {
if ((instr->VCValue() == 0x0) &&
(instr->VAValue() == 0x0)) {
DecodeVMOVBetweenCoreAndSinglePrecisionRegisters(instr);
} else if ((instr->VLValue() == 0x0) && (instr->VCValue() == 0x1)) {
if (instr->Bit(23) == 0) {
// vmov (ARM core register to scalar)
int vd = instr->VFPNRegValue(kDoublePrecision);
int rt = instr->RtValue();
int opc1_opc2 = (instr->Bits(22, 21) << 2) | instr->Bits(6, 5);
if ((opc1_opc2 & 0xB) == 0) {
// NeonS32/NeonU32
uint32_t data[2];
get_d_register(vd, data);
data[instr->Bit(21)] = get_register(rt);
set_d_register(vd, data);
} else {
uint64_t data;
get_d_register(vd, &data);
uint64_t rt_value = get_register(rt);
if ((opc1_opc2 & 0x8) != 0) {
// NeonS8 / NeonU8
int i = opc1_opc2 & 0x7;
int shift = i * kBitsPerByte;
const uint64_t mask = 0xFF;
data &= ~(mask << shift);
data |= (rt_value & mask) << shift;
set_d_register(vd, &data);
} else if ((opc1_opc2 & 0x1) != 0) {
// NeonS16 / NeonU16
int i = (opc1_opc2 >> 1) & 0x3;
int shift = i * kBitsPerByte * kShortSize;
const uint64_t mask = 0xFFFF;
data &= ~(mask << shift);
data |= (rt_value & mask) << shift;
set_d_register(vd, &data);
} else {
UNREACHABLE(); // Not used by V8.
}
}
} else {
// vdup.size Qd, Rt.
NeonSize size = Neon32;
if (instr->Bit(5) != 0)
size = Neon16;
else if (instr->Bit(22) != 0)
size = Neon8;
int vd = instr->VFPNRegValue(kSimd128Precision);
int rt = instr->RtValue();
uint32_t rt_value = get_register(rt);
uint32_t q_data[4];
switch (size) {
case Neon8: {
rt_value &= 0xFF;
uint8_t* dst = reinterpret_cast<uint8_t*>(q_data);
for (int i = 0; i < 16; i++) {
dst[i] = rt_value;
}
break;
}
case Neon16: {
// Perform pairwise op.
rt_value &= 0xFFFFu;
uint32_t rt_rt = (rt_value << 16) | (rt_value & 0xFFFFu);
for (int i = 0; i < 4; i++) {
q_data[i] = rt_rt;
}
break;
}
case Neon32: {
for (int i = 0; i < 4; i++) {
q_data[i] = rt_value;
}
break;
}
default:
UNREACHABLE();
break;
}
set_neon_register(vd, q_data);
}
} else if ((instr->VLValue() == 0x1) && (instr->VCValue() == 0x1)) {
// vmov (scalar to ARM core register)
int vn = instr->VFPNRegValue(kDoublePrecision);
int rt = instr->RtValue();
int opc1_opc2 = (instr->Bits(22, 21) << 2) | instr->Bits(6, 5);
uint64_t data;
get_d_register(vn, &data);
if ((opc1_opc2 & 0xB) == 0) {
// NeonS32 / NeonU32
int32_t int_data[2];
memcpy(int_data, &data, sizeof(int_data));
set_register(rt, int_data[instr->Bit(21)]);
} else {
uint64_t data;
get_d_register(vn, &data);
bool u = instr->Bit(23) != 0;
if ((opc1_opc2 & 0x8) != 0) {
// NeonS8 / NeonU8
int i = opc1_opc2 & 0x7;
int shift = i * kBitsPerByte;
uint32_t scalar = (data >> shift) & 0xFFu;
if (!u && (scalar & 0x80) != 0) scalar |= 0xFFFFFF00;
set_register(rt, scalar);
} else if ((opc1_opc2 & 0x1) != 0) {
// NeonS16 / NeonU16
int i = (opc1_opc2 >> 1) & 0x3;
int shift = i * kBitsPerByte * kShortSize;
uint32_t scalar = (data >> shift) & 0xFFFFu;
if (!u && (scalar & 0x8000) != 0) scalar |= 0xFFFF0000;
set_register(rt, scalar);
} else {
UNREACHABLE(); // Not used by V8.
}
}
} else if ((instr->VLValue() == 0x1) &&
(instr->VCValue() == 0x0) &&
(instr->VAValue() == 0x7) &&
(instr->Bits(19, 16) == 0x1)) {
// vmrs
uint32_t rt = instr->RtValue();
if (rt == 0xF) {
Copy_FPSCR_to_APSR();
} else {
// Emulate FPSCR from the Simulator flags.
uint32_t fpscr = (n_flag_FPSCR_ << 31) |
(z_flag_FPSCR_ << 30) |
(c_flag_FPSCR_ << 29) |
(v_flag_FPSCR_ << 28) |
(FPSCR_default_NaN_mode_ << 25) |
(inexact_vfp_flag_ << 4) |
(underflow_vfp_flag_ << 3) |
(overflow_vfp_flag_ << 2) |
(div_zero_vfp_flag_ << 1) |
(inv_op_vfp_flag_ << 0) |
(FPSCR_rounding_mode_);
set_register(rt, fpscr);
}
} else if ((instr->VLValue() == 0x0) &&
(instr->VCValue() == 0x0) &&
(instr->VAValue() == 0x7) &&
(instr->Bits(19, 16) == 0x1)) {
// vmsr
uint32_t rt = instr->RtValue();
if (rt == pc) {
UNREACHABLE();
} else {
uint32_t rt_value = get_register(rt);
n_flag_FPSCR_ = (rt_value >> 31) & 1;
z_flag_FPSCR_ = (rt_value >> 30) & 1;
c_flag_FPSCR_ = (rt_value >> 29) & 1;
v_flag_FPSCR_ = (rt_value >> 28) & 1;
FPSCR_default_NaN_mode_ = (rt_value >> 25) & 1;
inexact_vfp_flag_ = (rt_value >> 4) & 1;
underflow_vfp_flag_ = (rt_value >> 3) & 1;
overflow_vfp_flag_ = (rt_value >> 2) & 1;
div_zero_vfp_flag_ = (rt_value >> 1) & 1;
inv_op_vfp_flag_ = (rt_value >> 0) & 1;
FPSCR_rounding_mode_ =
static_cast<VFPRoundingMode>((rt_value) & kVFPRoundingModeMask);
}
} else {
UNIMPLEMENTED(); // Not used by V8.
}
}
}
void Simulator::DecodeTypeCP15(Instruction* instr) {
DCHECK((instr->TypeValue() == 7) && (instr->Bit(24) == 0x0));
DCHECK_EQ(instr->CoprocessorValue(), 15);
if (instr->Bit(4) == 1) {
// mcr
int crn = instr->Bits(19, 16);
int crm = instr->Bits(3, 0);
int opc1 = instr->Bits(23, 21);
int opc2 = instr->Bits(7, 5);
if ((opc1 == 0) && (crn == 7)) {
// ARMv6 memory barrier operations.
// Details available in ARM DDI 0406C.b, B3-1750.
if (((crm == 10) && (opc2 == 5)) || // CP15DMB
((crm == 10) && (opc2 == 4)) || // CP15DSB
((crm == 5) && (opc2 == 4))) { // CP15ISB
// These are ignored by the simulator for now.
} else {
UNIMPLEMENTED();
}
}
} else {
UNIMPLEMENTED();
}
}
void Simulator::DecodeVMOVBetweenCoreAndSinglePrecisionRegisters(
Instruction* instr) {
DCHECK((instr->Bit(4) == 1) && (instr->VCValue() == 0x0) &&
(instr->VAValue() == 0x0));
int t = instr->RtValue();
int n = instr->VFPNRegValue(kSinglePrecision);
bool to_arm_register = (instr->VLValue() == 0x1);
if (to_arm_register) {
int32_t int_value = get_sinteger_from_s_register(n);
set_register(t, int_value);
} else {
int32_t rs_val = get_register(t);
set_s_register_from_sinteger(n, rs_val);
}
}
void Simulator::DecodeVCMP(Instruction* instr) {
DCHECK((instr->Bit(4) == 0) && (instr->Opc1Value() == 0x7));
DCHECK(((instr->Opc2Value() == 0x4) || (instr->Opc2Value() == 0x5)) &&
(instr->Opc3Value() & 0x1));
// Comparison.
VFPRegPrecision precision = kSinglePrecision;
if (instr->SzValue() == 0x1) {
precision = kDoublePrecision;
}
int d = instr->VFPDRegValue(precision);
int m = 0;
if (instr->Opc2Value() == 0x4) {
m = instr->VFPMRegValue(precision);
}
if (precision == kDoublePrecision) {
double dd_value = get_double_from_d_register(d).get_scalar();
double dm_value = 0.0;
if (instr->Opc2Value() == 0x4) {
dm_value = get_double_from_d_register(m).get_scalar();
}
// Raise exceptions for quiet NaNs if necessary.
if (instr->Bit(7) == 1) {
if (std::isnan(dd_value)) {
inv_op_vfp_flag_ = true;
}
}
Compute_FPSCR_Flags(dd_value, dm_value);
} else {
float sd_value = get_float_from_s_register(d).get_scalar();
float sm_value = 0.0;
if (instr->Opc2Value() == 0x4) {
sm_value = get_float_from_s_register(m).get_scalar();
}
// Raise exceptions for quiet NaNs if necessary.
if (instr->Bit(7) == 1) {
if (std::isnan(sd_value)) {
inv_op_vfp_flag_ = true;
}
}
Compute_FPSCR_Flags(sd_value, sm_value);
}
}
void Simulator::DecodeVCVTBetweenDoubleAndSingle(Instruction* instr) {
DCHECK((instr->Bit(4) == 0) && (instr->Opc1Value() == 0x7));
DCHECK((instr->Opc2Value() == 0x7) && (instr->Opc3Value() == 0x3));
VFPRegPrecision dst_precision = kDoublePrecision;
VFPRegPrecision src_precision = kSinglePrecision;
if (instr->SzValue() == 1) {
dst_precision = kSinglePrecision;
src_precision = kDoublePrecision;
}
int dst = instr->VFPDRegValue(dst_precision);
int src = instr->VFPMRegValue(src_precision);
if (dst_precision == kSinglePrecision) {
double val = get_double_from_d_register(src).get_scalar();
set_s_register_from_float(dst, static_cast<float>(val));
} else {
float val = get_float_from_s_register(src).get_scalar();
set_d_register_from_double(dst, static_cast<double>(val));
}
}
bool get_inv_op_vfp_flag(VFPRoundingMode mode,
double val,
bool unsigned_) {
DCHECK((mode == RN) || (mode == RM) || (mode == RZ));
double max_uint = static_cast<double>(0xFFFFFFFFu);
double max_int = static_cast<double>(kMaxInt);
double min_int = static_cast<double>(kMinInt);
// Check for NaN.
if (val != val) {
return true;
}
// Check for overflow. This code works because 32bit integers can be
// exactly represented by ieee-754 64bit floating-point values.
switch (mode) {
case RN:
return unsigned_ ? (val >= (max_uint + 0.5)) ||
(val < -0.5)
: (val >= (max_int + 0.5)) ||
(val < (min_int - 0.5));
case RM:
return unsigned_ ? (val >= (max_uint + 1.0)) ||
(val < 0)
: (val >= (max_int + 1.0)) ||
(val < min_int);
case RZ:
return unsigned_ ? (val >= (max_uint + 1.0)) ||
(val <= -1)
: (val >= (max_int + 1.0)) ||
(val <= (min_int - 1.0));
default:
UNREACHABLE();
}
}
// We call this function only if we had a vfp invalid exception.
// It returns the correct saturated value.
int VFPConversionSaturate(double val, bool unsigned_res) {
if (val != val) {
return 0;
} else {
if (unsigned_res) {
return (val < 0) ? 0 : 0xFFFFFFFFu;
} else {
return (val < 0) ? kMinInt : kMaxInt;
}
}
}
int32_t Simulator::ConvertDoubleToInt(double val, bool unsigned_integer,
VFPRoundingMode mode) {
// TODO(jkummerow): These casts are undefined behavior if the integral
// part of {val} does not fit into the destination type.
int32_t result =
unsigned_integer ? static_cast<uint32_t>(val) : static_cast<int32_t>(val);
inv_op_vfp_flag_ = get_inv_op_vfp_flag(mode, val, unsigned_integer);
double abs_diff = unsigned_integer
? std::fabs(val - static_cast<uint32_t>(result))
: std::fabs(val - result);
inexact_vfp_flag_ = (abs_diff != 0);
if (inv_op_vfp_flag_) {
result = VFPConversionSaturate(val, unsigned_integer);
} else {
switch (mode) {
case RN: {
int val_sign = (val > 0) ? 1 : -1;
if (abs_diff > 0.5) {
result += val_sign;
} else if (abs_diff == 0.5) {
// Round to even if exactly halfway.
result = ((result % 2) == 0) ? result : result + val_sign;
}
break;
}
case RM:
result = result > val ? result - 1 : result;
break;
case RZ:
// Nothing to do.
break;
default:
UNREACHABLE();
}
}
return result;
}
void Simulator::DecodeVCVTBetweenFloatingPointAndInteger(Instruction* instr) {
DCHECK((instr->Bit(4) == 0) && (instr->Opc1Value() == 0x7) &&
(instr->Bits(27, 23) == 0x1D));
DCHECK(((instr->Opc2Value() == 0x8) && (instr->Opc3Value() & 0x1)) ||
(((instr->Opc2Value() >> 1) == 0x6) && (instr->Opc3Value() & 0x1)));
// Conversion between floating-point and integer.
bool to_integer = (instr->Bit(18) == 1);
VFPRegPrecision src_precision = (instr->SzValue() == 1) ? kDoublePrecision
: kSinglePrecision;
if (to_integer) {
// We are playing with code close to the C++ standard's limits below,
// hence the very simple code and heavy checks.
//
// Note:
// C++ defines default type casting from floating point to integer as
// (close to) rounding toward zero ("fractional part discarded").
int dst = instr->VFPDRegValue(kSinglePrecision);
int src = instr->VFPMRegValue(src_precision);
// Bit 7 in vcvt instructions indicates if we should use the FPSCR rounding
// mode or the default Round to Zero mode.
VFPRoundingMode mode = (instr->Bit(7) != 1) ? FPSCR_rounding_mode_
: RZ;
DCHECK((mode == RM) || (mode == RZ) || (mode == RN));
bool unsigned_integer = (instr->Bit(16) == 0);
bool double_precision = (src_precision == kDoublePrecision);
double val = double_precision ? get_double_from_d_register(src).get_scalar()
: get_float_from_s_register(src).get_scalar();
int32_t temp = ConvertDoubleToInt(val, unsigned_integer, mode);
// Update the destination register.
set_s_register_from_sinteger(dst, temp);
} else {
bool unsigned_integer = (instr->Bit(7) == 0);
int dst = instr->VFPDRegValue(src_precision);
int src = instr->VFPMRegValue(kSinglePrecision);
int val = get_sinteger_from_s_register(src);
if (src_precision == kDoublePrecision) {
if (unsigned_integer) {
set_d_register_from_double(
dst, static_cast<double>(static_cast<uint32_t>(val)));
} else {
set_d_register_from_double(dst, static_cast<double>(val));
}
} else {
if (unsigned_integer) {
set_s_register_from_float(
dst, static_cast<float>(static_cast<uint32_t>(val)));
} else {
set_s_register_from_float(dst, static_cast<float>(val));
}
}
}
}
// void Simulator::DecodeType6CoprocessorIns(Instruction* instr)
// Decode Type 6 coprocessor instructions.
// Dm = vmov(Rt, Rt2)
// <Rt, Rt2> = vmov(Dm)
// Ddst = MEM(Rbase + 4*offset).
// MEM(Rbase + 4*offset) = Dsrc.
void Simulator::DecodeType6CoprocessorIns(Instruction* instr) {
DCHECK_EQ(instr->TypeValue(), 6);
if (instr->CoprocessorValue() == 0xA) {
switch (instr->OpcodeValue()) {
case 0x8:
case 0xA:
case 0xC:
case 0xE: { // Load and store single precision float to memory.
int rn = instr->RnValue();
int vd = instr->VFPDRegValue(kSinglePrecision);
int offset = instr->Immed8Value();
if (!instr->HasU()) {
offset = -offset;
}
int32_t address = get_register(rn) + 4 * offset;
// Load and store address for singles must be at least four-byte
// aligned.
DCHECK_EQ(address % 4, 0);
if (instr->HasL()) {
// Load single from memory: vldr.
set_s_register_from_sinteger(vd, ReadW(address, instr));
} else {
// Store single to memory: vstr.
WriteW(address, get_sinteger_from_s_register(vd), instr);
}
break;
}
case 0x4:
case 0x5:
case 0x6:
case 0x7:
case 0x9:
case 0xB:
// Load/store multiple single from memory: vldm/vstm.
HandleVList(instr);
break;
default:
UNIMPLEMENTED(); // Not used by V8.
}
} else if (instr->CoprocessorValue() == 0xB) {
switch (instr->OpcodeValue()) {
case 0x2:
// Load and store double to two GP registers
if (instr->Bits(7, 6) != 0 || instr->Bit(4) != 1) {
UNIMPLEMENTED(); // Not used by V8.
} else {
int rt = instr->RtValue();
int rn = instr->RnValue();
int vm = instr->VFPMRegValue(kDoublePrecision);
if (instr->HasL()) {
uint32_t data[2];
get_d_register(vm, data);
set_register(rt, data[0]);
set_register(rn, data[1]);
} else {
int32_t data[] = { get_register(rt), get_register(rn) };
set_d_register(vm, reinterpret_cast<uint32_t*>(data));
}
}
break;
case 0x8:
case 0xA:
case 0xC:
case 0xE: { // Load and store double to memory.
int rn = instr->RnValue();
int vd = instr->VFPDRegValue(kDoublePrecision);
int offset = instr->Immed8Value();
if (!instr->HasU()) {
offset = -offset;
}
int32_t address = get_register(rn) + 4 * offset;
// Load and store address for doubles must be at least four-byte
// aligned.
DCHECK_EQ(address % 4, 0);
if (instr->HasL()) {
// Load double from memory: vldr.
int32_t data[] = {
ReadW(address, instr),
ReadW(address + 4, instr)
};
set_d_register(vd, reinterpret_cast<uint32_t*>(data));
} else {
// Store double to memory: vstr.
uint32_t data[2];
get_d_register(vd, data);
WriteW(address, data[0], instr);
WriteW(address + 4, data[1], instr);
}
break;
}
case 0x4:
case 0x5:
case 0x6:
case 0x7:
case 0x9:
case 0xB:
// Load/store multiple double from memory: vldm/vstm.
HandleVList(instr);
break;
default:
UNIMPLEMENTED(); // Not used by V8.
}
} else {
UNIMPLEMENTED(); // Not used by V8.
}
}
// Templated operations for NEON instructions.
template <typename T, typename U>
U Widen(T value) {
static_assert(sizeof(int64_t) > sizeof(T), "T must be int32_t or smaller");
static_assert(sizeof(U) > sizeof(T), "T must smaller than U");
return static_cast<U>(value);
}
template <typename T, typename U>
U Narrow(T value) {
static_assert(sizeof(int8_t) < sizeof(T), "T must be int16_t or larger");
static_assert(sizeof(U) < sizeof(T), "T must larger than U");
static_assert(std::is_unsigned<T>() == std::is_unsigned<U>(),
"Signed-ness of T and U must match");
// Make sure value can be expressed in the smaller type; otherwise, the
// casted result is implementation defined.
DCHECK_LE(std::numeric_limits<T>::min(), value);
DCHECK_GE(std::numeric_limits<T>::max(), value);
return static_cast<U>(value);
}
template <typename T>
T Clamp(int64_t value) {
static_assert(sizeof(int64_t) > sizeof(T), "T must be int32_t or smaller");
int64_t min = static_cast<int64_t>(std::numeric_limits<T>::min());
int64_t max = static_cast<int64_t>(std::numeric_limits<T>::max());
int64_t clamped = std::max(min, std::min(max, value));
return static_cast<T>(clamped);
}
template <typename T, typename U>
void Widen(Simulator* simulator, int Vd, int Vm) {
static const int kLanes = 8 / sizeof(T);
T src[kLanes];
U dst[kLanes];
simulator->get_neon_register<T, kDoubleSize>(Vm, src);
for (int i = 0; i < kLanes; i++) {
dst[i] = Widen<T, U>(src[i]);
}
simulator->set_neon_register(Vd, dst);
}
template <typename T, int SIZE>
void Abs(Simulator* simulator, int Vd, int Vm) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
for (int i = 0; i < kElems; i++) {
src[i] = std::abs(src[i]);
}
simulator->set_neon_register<T, SIZE>(Vd, src);
}
template <typename T, int SIZE>
void Neg(Simulator* simulator, int Vd, int Vm) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
for (int i = 0; i < kElems; i++) {
src[i] = -src[i];
}
simulator->set_neon_register<T, SIZE>(Vd, src);
}
template <typename T, typename U>
void SaturatingNarrow(Simulator* simulator, int Vd, int Vm) {
static const int kLanes = 16 / sizeof(T);
T src[kLanes];
U dst[kLanes];
simulator->get_neon_register(Vm, src);
for (int i = 0; i < kLanes; i++) {
dst[i] = Narrow<T, U>(Clamp<U>(src[i]));
}
simulator->set_neon_register<U, kDoubleSize>(Vd, dst);
}
template <typename T>
void AddSaturate(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kLanes = 16 / sizeof(T);
T src1[kLanes], src2[kLanes];
simulator->get_neon_register(Vn, src1);
simulator->get_neon_register(Vm, src2);
for (int i = 0; i < kLanes; i++) {
src1[i] = Clamp<T>(Widen<T, int64_t>(src1[i]) + Widen<T, int64_t>(src2[i]));
}
simulator->set_neon_register(Vd, src1);
}
template <typename T>
void SubSaturate(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kLanes = 16 / sizeof(T);
T src1[kLanes], src2[kLanes];
simulator->get_neon_register(Vn, src1);
simulator->get_neon_register(Vm, src2);
for (int i = 0; i < kLanes; i++) {
src1[i] = Clamp<T>(Widen<T, int64_t>(src1[i]) - Widen<T, int64_t>(src2[i]));
}
simulator->set_neon_register(Vd, src1);
}
template <typename T, int SIZE>
void Zip(Simulator* simulator, int Vd, int Vm) {
static const int kElems = SIZE / sizeof(T);
static const int kPairs = kElems / 2;
T src1[kElems], src2[kElems], dst1[kElems], dst2[kElems];
simulator->get_neon_register<T, SIZE>(Vd, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kPairs; i++) {
dst1[i * 2] = src1[i];
dst1[i * 2 + 1] = src2[i];
dst2[i * 2] = src1[i + kPairs];
dst2[i * 2 + 1] = src2[i + kPairs];
}
simulator->set_neon_register<T, SIZE>(Vd, dst1);
simulator->set_neon_register<T, SIZE>(Vm, dst2);
}
template <typename T, int SIZE>
void Unzip(Simulator* simulator, int Vd, int Vm) {
static const int kElems = SIZE / sizeof(T);
static const int kPairs = kElems / 2;
T src1[kElems], src2[kElems], dst1[kElems], dst2[kElems];
simulator->get_neon_register<T, SIZE>(Vd, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kPairs; i++) {
dst1[i] = src1[i * 2];
dst1[i + kPairs] = src2[i * 2];
dst2[i] = src1[i * 2 + 1];
dst2[i + kPairs] = src2[i * 2 + 1];
}
simulator->set_neon_register<T, SIZE>(Vd, dst1);
simulator->set_neon_register<T, SIZE>(Vm, dst2);
}
template <typename T, int SIZE>
void Transpose(Simulator* simulator, int Vd, int Vm) {
static const int kElems = SIZE / sizeof(T);
static const int kPairs = kElems / 2;
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vd, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kPairs; i++) {
std::swap(src1[2 * i + 1], src2[2 * i]);
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
simulator->set_neon_register<T, SIZE>(Vm, src2);
}
template <typename T, int SIZE>
void Test(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
src1[i] = (src1[i] & src2[i]) != 0 ? -1 : 0;
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T, int SIZE>
void Add(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
src1[i] += src2[i];
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T, int SIZE>
void Sub(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
src1[i] -= src2[i];
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T, int SIZE>
void Mul(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
src1[i] *= src2[i];
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T, int SIZE>
void ShiftLeft(Simulator* simulator, int Vd, int Vm, int shift) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
for (int i = 0; i < kElems; i++) {
src[i] <<= shift;
}
simulator->set_neon_register<T, SIZE>(Vd, src);
}
template <typename T, int SIZE>
void ShiftRight(Simulator* simulator, int Vd, int Vm, int shift) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
for (int i = 0; i < kElems; i++) {
src[i] >>= shift;
}
simulator->set_neon_register<T, SIZE>(Vd, src);
}
template <typename T, int SIZE>
void ArithmeticShiftRight(Simulator* simulator, int Vd, int Vm, int shift) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
for (int i = 0; i < kElems; i++) {
src[i] = ArithmeticShiftRight(src[i], shift);
}
simulator->set_neon_register<T, SIZE>(Vd, src);
}
template <typename T, int SIZE>
void ShiftLeftAndInsert(Simulator* simulator, int Vd, int Vm, int shift) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
T dst[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
simulator->get_neon_register<T, SIZE>(Vd, dst);
uint64_t mask = (1llu << shift) - 1llu;
for (int i = 0; i < kElems; i++) {
dst[i] = (src[i] << shift) | (dst[i] & mask);
}
simulator->set_neon_register<T, SIZE>(Vd, dst);
}
template <typename T, int SIZE>
void ShiftRightAndInsert(Simulator* simulator, int Vd, int Vm, int shift) {
static const int kElems = SIZE / sizeof(T);
T src[kElems];
T dst[kElems];
simulator->get_neon_register<T, SIZE>(Vm, src);
simulator->get_neon_register<T, SIZE>(Vd, dst);
uint64_t mask = ~((1llu << (kBitsPerByte * SIZE - shift)) - 1llu);
for (int i = 0; i < kElems; i++) {
dst[i] = (src[i] >> shift) | (dst[i] & mask);
}
simulator->set_neon_register<T, SIZE>(Vd, dst);
}
template <typename T, int SIZE>
void CompareEqual(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
src1[i] = src1[i] == src2[i] ? -1 : 0;
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T, int SIZE>
void CompareGreater(Simulator* simulator, int Vd, int Vm, int Vn, bool ge) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
if (ge)
src1[i] = src1[i] >= src2[i] ? -1 : 0;
else
src1[i] = src1[i] > src2[i] ? -1 : 0;
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T>
T MinMax(T a, T b, bool is_min) {
return is_min ? std::min(a, b) : std::max(a, b);
}
template <typename T, int SIZE>
void MinMax(Simulator* simulator, int Vd, int Vm, int Vn, bool min) {
static const int kElems = SIZE / sizeof(T);
T src1[kElems], src2[kElems];
simulator->get_neon_register<T, SIZE>(Vn, src1);
simulator->get_neon_register<T, SIZE>(Vm, src2);
for (int i = 0; i < kElems; i++) {
src1[i] = MinMax(src1[i], src2[i], min);
}
simulator->set_neon_register<T, SIZE>(Vd, src1);
}
template <typename T>
void PairwiseMinMax(Simulator* simulator, int Vd, int Vm, int Vn, bool min) {
static const int kElems = kDoubleSize / sizeof(T);
static const int kPairs = kElems / 2;
T dst[kElems], src1[kElems], src2[kElems];
simulator->get_neon_register<T, kDoubleSize>(Vn, src1);
simulator->get_neon_register<T, kDoubleSize>(Vm, src2);
for (int i = 0; i < kPairs; i++) {
dst[i] = MinMax(src1[i * 2], src1[i * 2 + 1], min);
dst[i + kPairs] = MinMax(src2[i * 2], src2[i * 2 + 1], min);
}
simulator->set_neon_register<T, kDoubleSize>(Vd, dst);
}
template <typename T>
void PairwiseAdd(Simulator* simulator, int Vd, int Vm, int Vn) {
static const int kElems = kDoubleSize / sizeof(T);
static const int kPairs = kElems / 2;
T dst[kElems], src1[kElems], src2[kElems];
simulator->get_neon_register<T, kDoubleSize>(Vn, src1);
simulator->get_neon_register<T, kDoubleSize>(Vm, src2);
for (int i = 0; i < kPairs; i++) {
dst[i] = src1[i * 2] + src1[i * 2 + 1];
dst[i + kPairs] = src2[i * 2] + src2[i * 2 + 1];
}
simulator->set_neon_register<T, kDoubleSize>(Vd, dst);
}
void Simulator::DecodeSpecialCondition(Instruction* instr) {
switch (instr->SpecialValue()) {
case 4: {
int Vd, Vm, Vn;
if (instr->Bit(6) == 0) {
Vd = instr->VFPDRegValue(kDoublePrecision);
Vm = instr->VFPMRegValue(kDoublePrecision);
Vn = instr->VFPNRegValue(kDoublePrecision);
} else {
Vd = instr->VFPDRegValue(kSimd128Precision);
Vm = instr->VFPMRegValue(kSimd128Precision);
Vn = instr->VFPNRegValue(kSimd128Precision);
}
switch (instr->Bits(11, 8)) {
case 0x0: {
if (instr->Bit(4) == 1) {
// vqadd.s<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
AddSaturate<int8_t>(this, Vd, Vm, Vn);
break;
case Neon16:
AddSaturate<int16_t>(this, Vd, Vm, Vn);
break;
case Neon32:
AddSaturate<int32_t>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
}
case 0x1: {
if (instr->Bits(21, 20) == 2 && instr->Bit(6) == 1 &&
instr->Bit(4) == 1) {
// vmov Qd, Qm.
// vorr, Qd, Qm, Qn.
uint32_t src1[4];
get_neon_register(Vm, src1);
if (Vm != Vn) {
uint32_t src2[4];
get_neon_register(Vn, src2);
for (int i = 0; i < 4; i++) {
src1[i] = src1[i] | src2[i];
}
}
set_neon_register(Vd, src1);
} else if (instr->Bits(21, 20) == 0 && instr->Bit(6) == 1 &&
instr->Bit(4) == 1) {
// vand Qd, Qm, Qn.
uint32_t src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
for (int i = 0; i < 4; i++) {
src1[i] = src1[i] & src2[i];
}
set_neon_register(Vd, src1);
} else {
UNIMPLEMENTED();
}
break;
}
case 0x2: {
if (instr->Bit(4) == 1) {
// vqsub.s<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
SubSaturate<int8_t>(this, Vd, Vm, Vn);
break;
case Neon16:
SubSaturate<int16_t>(this, Vd, Vm, Vn);
break;
case Neon32:
SubSaturate<int32_t>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
}
case 0x3: {
// vcge/vcgt.s<size> Qd, Qm, Qn.
bool ge = instr->Bit(4) == 1;
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
CompareGreater<int8_t, kSimd128Size>(this, Vd, Vm, Vn, ge);
break;
case Neon16:
CompareGreater<int16_t, kSimd128Size>(this, Vd, Vm, Vn, ge);
break;
case Neon32:
CompareGreater<int32_t, kSimd128Size>(this, Vd, Vm, Vn, ge);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0x6: {
// vmin/vmax.s<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
bool min = instr->Bit(4) != 0;
switch (size) {
case Neon8:
MinMax<int8_t, kSimd128Size>(this, Vd, Vm, Vn, min);
break;
case Neon16:
MinMax<int16_t, kSimd128Size>(this, Vd, Vm, Vn, min);
break;
case Neon32:
MinMax<int32_t, kSimd128Size>(this, Vd, Vm, Vn, min);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0x8: {
// vadd/vtst
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
if (instr->Bit(4) == 0) {
// vadd.i<size> Qd, Qm, Qn.
switch (size) {
case Neon8:
Add<uint8_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon16:
Add<uint16_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon32:
Add<uint32_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
// vtst.i<size> Qd, Qm, Qn.
switch (size) {
case Neon8:
Test<uint8_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon16:
Test<uint16_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon32:
Test<uint32_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
}
break;
}
case 0x9: {
if (instr->Bit(6) == 1 && instr->Bit(4) == 1) {
// vmul.i<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
Mul<uint8_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon16:
Mul<uint16_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon32:
Mul<uint32_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
}
case 0xA: {
// vpmin/vpmax.s<size> Dd, Dm, Dn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
bool min = instr->Bit(4) != 0;
switch (size) {
case Neon8:
PairwiseMinMax<int8_t>(this, Vd, Vm, Vn, min);
break;
case Neon16:
PairwiseMinMax<int16_t>(this, Vd, Vm, Vn, min);
break;
case Neon32:
PairwiseMinMax<int32_t>(this, Vd, Vm, Vn, min);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0xB: {
// vpadd.i<size> Dd, Dm, Dn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
PairwiseAdd<int8_t>(this, Vd, Vm, Vn);
break;
case Neon16:
PairwiseAdd<int16_t>(this, Vd, Vm, Vn);
break;
case Neon32:
PairwiseAdd<int32_t>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0xD: {
if (instr->Bit(4) == 0) {
float src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
for (int i = 0; i < 4; i++) {
if (instr->Bit(21) == 0) {
// vadd.f32 Qd, Qm, Qn.
src1[i] = src1[i] + src2[i];
} else {
// vsub.f32 Qd, Qm, Qn.
src1[i] = src1[i] - src2[i];
}
}
set_neon_register(Vd, src1);
} else {
UNIMPLEMENTED();
}
break;
}
case 0xE: {
if (instr->Bits(21, 20) == 0 && instr->Bit(4) == 0) {
// vceq.f32.
float src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
uint32_t dst[4];
for (int i = 0; i < 4; i++) {
dst[i] = (src1[i] == src2[i]) ? 0xFFFFFFFF : 0;
}
set_neon_register(Vd, dst);
} else {
UNIMPLEMENTED();
}
break;
}
case 0xF: {
if (instr->Bit(20) == 0 && instr->Bit(6) == 1) {
float src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
if (instr->Bit(4) == 1) {
if (instr->Bit(21) == 0) {
// vrecps.f32 Qd, Qm, Qn.
for (int i = 0; i < 4; i++) {
src1[i] = 2.0f - src1[i] * src2[i];
}
} else {
// vrsqrts.f32 Qd, Qm, Qn.
for (int i = 0; i < 4; i++) {
src1[i] = (3.0f - src1[i] * src2[i]) * 0.5f;
}
}
} else {
// vmin/vmax.f32 Qd, Qm, Qn.
bool min = instr->Bit(21) == 1;
for (int i = 0; i < 4; i++) {
src1[i] = MinMax(src1[i], src2[i], min);
}
}
set_neon_register(Vd, src1);
} else {
UNIMPLEMENTED();
}
break;
}
default:
UNIMPLEMENTED();
break;
}
break;
}
case 5:
if ((instr->Bits(18, 16) == 0) && (instr->Bits(11, 6) == 0x28) &&
(instr->Bit(4) == 1)) {
// vmovl signed
if ((instr->VdValue() & 1) != 0) UNIMPLEMENTED();
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kDoublePrecision);
int imm3 = instr->Bits(21, 19);
switch (imm3) {
case 1:
Widen<int8_t, int16_t>(this, Vd, Vm);
break;
case 2:
Widen<int16_t, int32_t>(this, Vd, Vm);
break;
case 4:
Widen<int32_t, int64_t>(this, Vd, Vm);
break;
default:
UNIMPLEMENTED();
break;
}
} else if (instr->Bits(21, 20) == 3 && instr->Bit(4) == 0) {
// vext.
int imm4 = instr->Bits(11, 8);
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
int Vn = instr->VFPNRegValue(kSimd128Precision);
uint8_t src1[16], src2[16], dst[16];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
int boundary = kSimd128Size - imm4;
int i = 0;
for (; i < boundary; i++) {
dst[i] = src1[i + imm4];
}
for (; i < 16; i++) {
dst[i] = src2[i - boundary];
}
set_neon_register(Vd, dst);
} else if (instr->Bits(11, 7) == 0xA && instr->Bit(4) == 1) {
// vshl.i<size> Qd, Qm, shift
int size = base::bits::RoundDownToPowerOfTwo32(instr->Bits(21, 16));
int shift = instr->Bits(21, 16) - size;
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
NeonSize ns = static_cast<NeonSize>(size / 16);
switch (ns) {
case Neon8:
ShiftLeft<uint8_t, kSimd128Size>(this, Vd, Vm, shift);
break;
case Neon16:
ShiftLeft<uint16_t, kSimd128Size>(this, Vd, Vm, shift);
break;
case Neon32:
ShiftLeft<uint32_t, kSimd128Size>(this, Vd, Vm, shift);
break;
default:
UNREACHABLE();
break;
}
} else if (instr->Bits(11, 7) == 0 && instr->Bit(4) == 1) {
// vshr.s<size> Qd, Qm, shift
int size = base::bits::RoundDownToPowerOfTwo32(instr->Bits(21, 16));
int shift = 2 * size - instr->Bits(21, 16);
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
NeonSize ns = static_cast<NeonSize>(size / 16);
switch (ns) {
case Neon8:
ArithmeticShiftRight<int8_t, kSimd128Size>(this, Vd, Vm, shift);
break;
case Neon16:
ArithmeticShiftRight<int16_t, kSimd128Size>(this, Vd, Vm, shift);
break;
case Neon32:
ArithmeticShiftRight<int32_t, kSimd128Size>(this, Vd, Vm, shift);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
case 6: {
int Vd, Vm, Vn;
if (instr->Bit(6) == 0) {
Vd = instr->VFPDRegValue(kDoublePrecision);
Vm = instr->VFPMRegValue(kDoublePrecision);
Vn = instr->VFPNRegValue(kDoublePrecision);
} else {
Vd = instr->VFPDRegValue(kSimd128Precision);
Vm = instr->VFPMRegValue(kSimd128Precision);
Vn = instr->VFPNRegValue(kSimd128Precision);
}
switch (instr->Bits(11, 8)) {
case 0x0: {
if (instr->Bit(4) == 1) {
// vqadd.u<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
AddSaturate<uint8_t>(this, Vd, Vm, Vn);
break;
case Neon16:
AddSaturate<uint16_t>(this, Vd, Vm, Vn);
break;
case Neon32:
AddSaturate<uint32_t>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
}
case 0x1: {
if (instr->Bits(21, 20) == 1 && instr->Bit(4) == 1) {
// vbsl.size Qd, Qm, Qn.
uint32_t dst[4], src1[4], src2[4];
get_neon_register(Vd, dst);
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
for (int i = 0; i < 4; i++) {
dst[i] = (dst[i] & src1[i]) | (~dst[i] & src2[i]);
}
set_neon_register(Vd, dst);
} else if (instr->Bits(21, 20) == 0 && instr->Bit(4) == 1) {
if (instr->Bit(6) == 0) {
// veor Dd, Dn, Dm
uint64_t src1, src2;
get_d_register(Vn, &src1);
get_d_register(Vm, &src2);
src1 ^= src2;
set_d_register(Vd, &src1);
} else {
// veor Qd, Qn, Qm
uint32_t src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
for (int i = 0; i < 4; i++) src1[i] ^= src2[i];
set_neon_register(Vd, src1);
}
} else {
UNIMPLEMENTED();
}
break;
}
case 0x2: {
if (instr->Bit(4) == 1) {
// vqsub.u<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
SubSaturate<uint8_t>(this, Vd, Vm, Vn);
break;
case Neon16:
SubSaturate<uint16_t>(this, Vd, Vm, Vn);
break;
case Neon32:
SubSaturate<uint32_t>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
}
case 0x3: {
// vcge/vcgt.u<size> Qd, Qm, Qn.
bool ge = instr->Bit(4) == 1;
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
CompareGreater<uint8_t, kSimd128Size>(this, Vd, Vm, Vn, ge);
break;
case Neon16:
CompareGreater<uint16_t, kSimd128Size>(this, Vd, Vm, Vn, ge);
break;
case Neon32:
CompareGreater<uint32_t, kSimd128Size>(this, Vd, Vm, Vn, ge);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0x6: {
// vmin/vmax.u<size> Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
bool min = instr->Bit(4) != 0;
switch (size) {
case Neon8:
MinMax<uint8_t, kSimd128Size>(this, Vd, Vm, Vn, min);
break;
case Neon16:
MinMax<uint16_t, kSimd128Size>(this, Vd, Vm, Vn, min);
break;
case Neon32:
MinMax<uint32_t, kSimd128Size>(this, Vd, Vm, Vn, min);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0x8: {
if (instr->Bit(4) == 0) {
// vsub.size Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
Sub<uint8_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon16:
Sub<uint16_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon32:
Sub<uint32_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
} else {
// vceq.size Qd, Qm, Qn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
switch (size) {
case Neon8:
CompareEqual<uint8_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon16:
CompareEqual<uint16_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
case Neon32:
CompareEqual<uint32_t, kSimd128Size>(this, Vd, Vm, Vn);
break;
default:
UNREACHABLE();
break;
}
}
break;
}
case 0xA: {
// vpmin/vpmax.u<size> Dd, Dm, Dn.
NeonSize size = static_cast<NeonSize>(instr->Bits(21, 20));
bool min = instr->Bit(4) != 0;
switch (size) {
case Neon8:
PairwiseMinMax<uint8_t>(this, Vd, Vm, Vn, min);
break;
case Neon16:
PairwiseMinMax<uint16_t>(this, Vd, Vm, Vn, min);
break;
case Neon32:
PairwiseMinMax<uint32_t>(this, Vd, Vm, Vn, min);
break;
default:
UNREACHABLE();
break;
}
break;
}
case 0xD: {
if (instr->Bits(21, 20) == 0 && instr->Bit(6) == 1 &&
instr->Bit(4) == 1) {
// vmul.f32 Qd, Qn, Qm
float src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
for (int i = 0; i < 4; i++) {
src1[i] = src1[i] * src2[i];
}
set_neon_register(Vd, src1);
} else if (instr->Bits(21, 20) == 0 && instr->Bit(6) == 0 &&
instr->Bit(4) == 0) {
// vpadd.f32 Dd, Dn, Dm
PairwiseAdd<float>(this, Vd, Vm, Vn);
} else {
UNIMPLEMENTED();
}
break;
}
case 0xE: {
if (instr->Bit(20) == 0 && instr->Bit(4) == 0) {
// vcge/vcgt.f32 Qd, Qm, Qn
bool ge = instr->Bit(21) == 0;
float src1[4], src2[4];
get_neon_register(Vn, src1);
get_neon_register(Vm, src2);
uint32_t dst[4];
for (int i = 0; i < 4; i++) {
if (ge) {
dst[i] = src1[i] >= src2[i] ? 0xFFFFFFFFu : 0;
} else {
dst[i] = src1[i] > src2[i] ? 0xFFFFFFFFu : 0;
}
}
set_neon_register(Vd, dst);
} else {
UNIMPLEMENTED();
}
break;
}
default:
UNREACHABLE();
break;
}
break;
}
case 7:
if ((instr->Bits(18, 16) == 0) && (instr->Bits(11, 6) == 0x28) &&
(instr->Bit(4) == 1)) {
// vmovl unsigned
if ((instr->VdValue() & 1) != 0) UNIMPLEMENTED();
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kDoublePrecision);
int imm3 = instr->Bits(21, 19);
switch (imm3) {
case 1:
Widen<uint8_t, uint16_t>(this, Vd, Vm);
break;
case 2:
Widen<uint16_t, uint32_t>(this, Vd, Vm);
break;
case 4:
Widen<uint32_t, uint64_t>(this, Vd, Vm);
break;
default:
UNIMPLEMENTED();
break;
}
} else if (instr->Opc1Value() == 7 && instr->Bit(4) == 0) {
if (instr->Bits(19, 16) == 0xB && instr->Bits(11, 9) == 0x3 &&
instr->Bit(6) == 1) {
// vcvt.<Td>.<Tm> Qd, Qm.
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
uint32_t q_data[4];
get_neon_register(Vm, q_data);
int op = instr->Bits(8, 7);
for (int i = 0; i < 4; i++) {
switch (op) {
case 0:
// f32 <- s32, round towards nearest.
q_data[i] = bit_cast<uint32_t>(std::round(
static_cast<float>(bit_cast<int32_t>(q_data[i]))));
break;
case 1:
// f32 <- u32, round towards nearest.
q_data[i] = bit_cast<uint32_t>(
std::round(static_cast<float>(q_data[i])));
break;
case 2:
// s32 <- f32, round to zero.
q_data[i] = static_cast<uint32_t>(
ConvertDoubleToInt(bit_cast<float>(q_data[i]), false, RZ));
break;
case 3:
// u32 <- f32, round to zero.
q_data[i] = static_cast<uint32_t>(
ConvertDoubleToInt(bit_cast<float>(q_data[i]), true, RZ));
break;
}
}
set_neon_register(Vd, q_data);
} else if (instr->Bits(17, 16) == 0x2 && instr->Bits(11, 7) == 0) {
if (instr->Bit(6) == 0) {
// vswp Dd, Dm.
uint64_t dval, mval;
int vd = instr->VFPDRegValue(kDoublePrecision);
int vm = instr->VFPMRegValue(kDoublePrecision);
get_d_register(vd, &dval);
get_d_register(vm, &mval);
set_d_register(vm, &dval);
set_d_register(vd, &mval);
} else {
// vswp Qd, Qm.
uint32_t dval[4], mval[4];
int vd = instr->VFPDRegValue(kSimd128Precision);
int vm = instr->VFPMRegValue(kSimd128Precision);
get_neon_register(vd, dval);
get_neon_register(vm, mval);
set_neon_register(vm, dval);
set_neon_register(vd, mval);
}
} else if (instr->Bits(11, 7) == 0x18) {
// vdup.<size> Dd, Dm[index].
// vdup.<size> Qd, Dm[index].
int vm = instr->VFPMRegValue(kDoublePrecision);
int imm4 = instr->Bits(19, 16);
int size = 0, index = 0, mask = 0;
if ((imm4 & 0x1) != 0) {
size = 8;
index = imm4 >> 1;
mask = 0xFFu;
} else if ((imm4 & 0x2) != 0) {
size = 16;
index = imm4 >> 2;
mask = 0xFFFFu;
} else {
size = 32;
index = imm4 >> 3;
mask = 0xFFFFFFFFu;
}
uint64_t d_data;
get_d_register(vm, &d_data);
uint32_t scalar = (d_data >> (size * index)) & mask;
uint32_t duped = scalar;
for (int i = 1; i < 32 / size; i++) {
scalar <<= size;
duped |= scalar;
}
uint32_t result[4] = {duped, duped, duped, duped};
if (instr->Bit(6) == 0) {
int vd = instr->VFPDRegValue(kDoublePrecision);
set_d_register(vd, result);
} else {
int vd = instr->VFPDRegValue(kSimd128Precision);
set_neon_register(vd, result);
}
} else if (instr->Bits(19, 16) == 0 && instr->Bits(11, 6) == 0x17) {
// vmvn Qd, Qm.
int vd = instr->VFPDRegValue(kSimd128Precision);
int vm = instr->VFPMRegValue(kSimd128Precision);
uint32_t q_data[4];
get_neon_register(vm, q_data);
for (int i = 0; i < 4; i++) q_data[i] = ~q_data[i];
set_neon_register(vd, q_data);
} else if (instr->Bits(11, 10) == 0x2) {
// vtb[l,x] Dd, <list>, Dm.
int vd = instr->VFPDRegValue(kDoublePrecision);
int vn = instr->VFPNRegValue(kDoublePrecision);
int vm = instr->VFPMRegValue(kDoublePrecision);
int table_len = (instr->Bits(9, 8) + 1) * kDoubleSize;
bool vtbx = instr->Bit(6) != 0; // vtbl / vtbx
uint64_t destination = 0, indices = 0, result = 0;
get_d_register(vd, &destination);
get_d_register(vm, &indices);
for (int i = 0; i < kDoubleSize; i++) {
int shift = i * kBitsPerByte;
int index = (indices >> shift) & 0xFF;
if (index < table_len) {
uint64_t table;
get_d_register(vn + index / kDoubleSize, &table);
result |=
((table >> ((index % kDoubleSize) * kBitsPerByte)) & 0xFF)
<< shift;
} else if (vtbx) {
result |= destination & (0xFFull << shift);
}
}
set_d_register(vd, &result);
} else if (instr->Bits(17, 16) == 0x2 && instr->Bits(11, 8) == 0x1) {
NeonSize size = static_cast<NeonSize>(instr->Bits(19, 18));
if (instr->Bit(6) == 0) {
int Vd = instr->VFPDRegValue(kDoublePrecision);
int Vm = instr->VFPMRegValue(kDoublePrecision);
if (instr->Bit(7) == 1) {
// vzip.<size> Dd, Dm.
switch (size) {
case Neon8:
Zip<uint8_t, kDoubleSize>(this, Vd, Vm);
break;
case Neon16:
Zip<uint16_t, kDoubleSize>(this, Vd, Vm);
break;
case Neon32:
UNIMPLEMENTED();
break;
default:
UNREACHABLE();
break;
}
} else {
// vuzp.<size> Dd, Dm.
switch (size) {
case Neon8:
Unzip<uint8_t, kDoubleSize>(this, Vd, Vm);
break;
case Neon16:
Unzip<uint16_t, kDoubleSize>(this, Vd, Vm);
break;
case Neon32:
UNIMPLEMENTED();
break;
default:
UNREACHABLE();
break;
}
}
} else {
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
if (instr->Bit(7) == 1) {
// vzip.<size> Qd, Qm.
switch (size) {
case Neon8:
Zip<uint8_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon16:
Zip<uint16_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon32:
Zip<uint32_t, kSimd128Size>(this, Vd, Vm);
break;
default:
UNREACHABLE();
break;
}
} else {
// vuzp.<size> Qd, Qm.
switch (size) {
case Neon8:
Unzip<uint8_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon16:
Unzip<uint16_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon32:
Unzip<uint32_t, kSimd128Size>(this, Vd, Vm);
break;
default:
UNREACHABLE();
break;
}
}
}
} else if (instr->Bits(17, 16) == 0 && instr->Bits(11, 9) == 0) {
// vrev<op>.size Qd, Qm
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
NeonSize size = static_cast<NeonSize>(instr->Bits(19, 18));
NeonSize op = static_cast<NeonSize>(static_cast<int>(Neon64) -
instr->Bits(8, 7));
switch (op) {
case Neon16: {
DCHECK_EQ(Neon8, size);
uint8_t src[16];
get_neon_register(Vm, src);
for (int i = 0; i < 16; i += 2) {
std::swap(src[i], src[i + 1]);
}
set_neon_register(Vd, src);
break;
}
case Neon32: {
switch (size) {
case Neon16: {
uint16_t src[8];
get_neon_register(Vm, src);
for (int i = 0; i < 8; i += 2) {
std::swap(src[i], src[i + 1]);
}
set_neon_register(Vd, src);
break;
}
case Neon8: {
uint8_t src[16];
get_neon_register(Vm, src);
for (int i = 0; i < 4; i++) {
std::swap(src[i * 4], src[i * 4 + 3]);
std::swap(src[i * 4 + 1], src[i * 4 + 2]);
}
set_neon_register(Vd, src);
break;
}
default:
UNREACHABLE();
break;
}
break;
}
case Neon64: {
switch (size) {
case Neon32: {
uint32_t src[4];
get_neon_register(Vm, src);
std::swap(src[0], src[1]);
std::swap(src[2], src[3]);
set_neon_register(Vd, src);
break;
}
case Neon16: {
uint16_t src[8];
get_neon_register(Vm, src);
for (int i = 0; i < 2; i++) {
std::swap(src[i * 4], src[i * 4 + 3]);
std::swap(src[i * 4 + 1], src[i * 4 + 2]);
}
set_neon_register(Vd, src);
break;
}
case Neon8: {
uint8_t src[16];
get_neon_register(Vm, src);
for (int i = 0; i < 4; i++) {
std::swap(src[i], src[7 - i]);
std::swap(src[i + 8], src[15 - i]);
}
set_neon_register(Vd, src);
break;
}
default:
UNREACHABLE();
break;
}
break;
}
default:
UNREACHABLE();
break;
}
} else if (instr->Bits(17, 16) == 0x2 && instr->Bits(11, 7) == 0x1) {
NeonSize size = static_cast<NeonSize>(instr->Bits(19, 18));
if (instr->Bit(6) == 0) {
int Vd = instr->VFPDRegValue(kDoublePrecision);
int Vm = instr->VFPMRegValue(kDoublePrecision);
// vtrn.<size> Dd, Dm.
switch (size) {
case Neon8:
Transpose<uint8_t, kDoubleSize>(this, Vd, Vm);
break;
case Neon16:
Transpose<uint16_t, kDoubleSize>(this, Vd, Vm);
break;
case Neon32:
Transpose<uint32_t, kDoubleSize>(this, Vd, Vm);
break;
default:
UNREACHABLE();
break;
}
} else {
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
// vtrn.<size> Qd, Qm.
switch (size) {
case Neon8:
Transpose<uint8_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon16:
Transpose<uint16_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon32:
Transpose<uint32_t, kSimd128Size>(this, Vd, Vm);
break;
default:
UNREACHABLE();
break;
}
}
} else if (instr->Bits(17, 16) == 0x1 && instr->Bit(11) == 0) {
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
NeonSize size = static_cast<NeonSize>(instr->Bits(19, 18));
if (instr->Bits(9, 6) == 0xD) {
// vabs<type>.<size> Qd, Qm
if (instr->Bit(10) != 0) {
// floating point (clear sign bits)
uint32_t src[4];
get_neon_register(Vm, src);
for (int i = 0; i < 4; i++) {
src[i] &= ~0x80000000;
}
set_neon_register(Vd, src);
} else {
// signed integer
switch (size) {
case Neon8:
Abs<int8_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon16:
Abs<int16_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon32:
Abs<int32_t, kSimd128Size>(this, Vd, Vm);
break;
default:
UNIMPLEMENTED();
break;
}
}
} else if (instr->Bits(9, 6) == 0xF) {
// vneg<type>.<size> Qd, Qm (signed integer)
if (instr->Bit(10) != 0) {
// floating point (toggle sign bits)
uint32_t src[4];
get_neon_register(Vm, src);
for (int i = 0; i < 4; i++) {
src[i] ^= 0x80000000;
}
set_neon_register(Vd, src);
} else {
// signed integer
switch (size) {
case Neon8:
Neg<int8_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon16:
Neg<int16_t, kSimd128Size>(this, Vd, Vm);
break;
case Neon32:
Neg<int32_t, kSimd128Size>(this, Vd, Vm);
break;
default:
UNIMPLEMENTED();
break;
}
}
} else {
UNIMPLEMENTED();
}
} else if (instr->Bits(19, 18) == 0x2 && instr->Bits(11, 8) == 0x5) {
// vrecpe/vrsqrte.f32 Qd, Qm.
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
uint32_t src[4];
get_neon_register(Vm, src);
if (instr->Bit(7) == 0) {
for (int i = 0; i < 4; i++) {
float denom = bit_cast<float>(src[i]);
div_zero_vfp_flag_ = (denom == 0);
float result = 1.0f / denom;
result = canonicalizeNaN(result);
src[i] = bit_cast<uint32_t>(result);
}
} else {
lazily_initialize_fast_sqrt(isolate_);
for (int i = 0; i < 4; i++) {
float radicand = bit_cast<float>(src[i]);
float result = 1.0f / fast_sqrt(radicand, isolate_);
result = canonicalizeNaN(result);
src[i] = bit_cast<uint32_t>(result);
}
}
set_neon_register(Vd, src);
} else if (instr->Bits(17, 16) == 0x2 && instr->Bits(11, 8) == 0x2 &&
instr->Bits(7, 6) != 0) {
// vqmovn.<type><size> Dd, Qm.
int Vd = instr->VFPDRegValue(kDoublePrecision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
NeonSize size = static_cast<NeonSize>(instr->Bits(19, 18));
bool is_unsigned = instr->Bit(6) != 0;
switch (size) {
case Neon8: {
if (is_unsigned) {
SaturatingNarrow<uint16_t, uint8_t>(this, Vd, Vm);
} else {
SaturatingNarrow<int16_t, int8_t>(this, Vd, Vm);
}
break;
}
case Neon16: {
if (is_unsigned) {
SaturatingNarrow<uint32_t, uint16_t>(this, Vd, Vm);
} else {
SaturatingNarrow<int32_t, int16_t>(this, Vd, Vm);
}
break;
}
case Neon32: {
if (is_unsigned) {
SaturatingNarrow<uint64_t, uint32_t>(this, Vd, Vm);
} else {
SaturatingNarrow<int64_t, int32_t>(this, Vd, Vm);
}
break;
}
default:
UNIMPLEMENTED();
break;
}
} else {
UNIMPLEMENTED();
}
} else if (instr->Bits(11, 7) == 0 && instr->Bit(4) == 1) {
// vshr.u<size> Qd, Qm, shift
int size = base::bits::RoundDownToPowerOfTwo32(instr->Bits(21, 16));
int shift = 2 * size - instr->Bits(21, 16);
int Vd = instr->VFPDRegValue(kSimd128Precision);
int Vm = instr->VFPMRegValue(kSimd128Precision);
NeonSize ns = static_cast<NeonSize>(size / 16);
switch (ns) {
case Neon8:
ShiftRight<uint8_t, kSimd128Size>(this, Vd, Vm, shift);
break;
case Neon16:
ShiftRight<uint16_t, kSimd128Size>(this, Vd, Vm, shift);
break;
case Neon32:
ShiftRight<uint32_t, kSimd128Size>(this, Vd, Vm, shift);
break;
default:
UNREACHABLE();
break;
}
} else if (instr->Bits(11, 8) == 0x5 && instr->Bit(6) == 0 &&
instr->Bit(4) == 1) {
// vsli.<size> Dd, Dm, shift
int imm7 = instr->Bits(21, 16);
if (instr->Bit(7) != 0) imm7 += 64;
int size = base::bits::RoundDownToPowerOfTwo32(imm7);
int shift = imm7 - size;
int Vd = instr->VFPDRegValue(kDoublePrecision);
int Vm = instr->VFPMRegValue(kDoublePrecision);
switch (size) {
case 8:
ShiftLeftAndInsert<uint8_t, kDoubleSize>(this, Vd, Vm, shift);
break;
case 16:
ShiftLeftAndInsert<uint16_t, kDoubleSize>(this, Vd, Vm, shift);
break;
case 32:
ShiftLeftAndInsert<uint32_t, kDoubleSize>(this, Vd, Vm, shift);
break;
case 64:
ShiftLeftAndInsert<uint64_t, kDoubleSize>(this, Vd, Vm, shift);
break;
default:
UNREACHABLE();
break;
}
} else if (instr->Bits(11, 8) == 0x4 && instr->Bit(6) == 0 &&
instr->Bit(4) == 1) {
// vsri.<size> Dd, Dm, shift
int imm7 = instr->Bits(21, 16);
if (instr->Bit(7) != 0) imm7 += 64;
int size = base::bits::RoundDownToPowerOfTwo32(imm7);
int shift = 2 * size - imm7;
int Vd = instr->VFPDRegValue(kDoublePrecision);
int Vm = instr->VFPMRegValue(kDoublePrecision);
switch (size) {
case 8:
ShiftRightAndInsert<uint8_t, kDoubleSize>(this, Vd, Vm, shift);
break;
case 16:
ShiftRightAndInsert<uint16_t, kDoubleSize>(this, Vd, Vm, shift);
break;
case 32:
ShiftRightAndInsert<uint32_t, kDoubleSize>(this, Vd, Vm, shift);
break;
case 64:
ShiftRightAndInsert<uint64_t, kDoubleSize>(this, Vd, Vm, shift);
break;
default:
UNREACHABLE();
break;
}
} else {
UNIMPLEMENTED();
}
break;
case 8:
if (instr->Bits(21, 20) == 0) {
// vst1
int Vd = (instr->Bit(22) << 4) | instr->VdValue();
int Rn = instr->VnValue();
int type = instr->Bits(11, 8);
int Rm = instr->VmValue();
int32_t address = get_register(Rn);
int regs = 0;
switch (type) {
case nlt_1:
regs = 1;
break;
case nlt_2:
regs = 2;
break;
case nlt_3:
regs = 3;
break;
case nlt_4:
regs = 4;
break;
default:
UNIMPLEMENTED();
break;
}
int r = 0;
while (r < regs) {
uint32_t data[2];
get_d_register(Vd + r, data);
WriteW(address, data[0], instr);
WriteW(address + 4, data[1], instr);
address += 8;
r++;
}
if (Rm != 15) {
if (Rm == 13) {
set_register(Rn, address);
} else {
set_register(Rn, get_register(Rn) + get_register(Rm));
}
}
} else if (instr->Bits(21, 20) == 2) {
// vld1
int Vd = (instr->Bit(22) << 4) | instr->VdValue();
int Rn = instr->VnValue();
int type = instr->Bits(11, 8);
int Rm = instr->VmValue();
int32_t address = get_register(Rn);
int regs = 0;
switch (type) {
case nlt_1:
regs = 1;
break;
case nlt_2:
regs = 2;
break;
case nlt_3:
regs = 3;
break;
case nlt_4:
regs = 4;
break;
default:
UNIMPLEMENTED();
break;
}
int r = 0;
while (r < regs) {
uint32_t data[2];
data[0] = ReadW(address, instr);
data[1] = ReadW(address + 4, instr);
set_d_register(Vd + r, data);
address += 8;
r++;
}
if (Rm != 15) {
if (Rm == 13) {
set_register(Rn, address);
} else {
set_register(Rn, get_register(Rn) + get_register(Rm));
}
}
} else {
UNIMPLEMENTED();
}
break;
case 0xA:
case 0xB:
if ((instr->Bits(22, 20) == 5) && (instr->Bits(15, 12) == 0xF)) {
// pld: ignore instruction.
} else if (instr->SpecialValue() == 0xA && instr->Bits(22, 20) == 7) {
// dsb, dmb, isb: ignore instruction for now.
// TODO(binji): implement
// Also refer to the ARMv6 CP15 equivalents in DecodeTypeCP15.
} else {
UNIMPLEMENTED();
}
break;
case 0x1D:
if (instr->Opc1Value() == 0x7 && instr->Opc3Value() == 0x1 &&
instr->Bits(11, 9) == 0x5 && instr->Bits(19, 18) == 0x2) {
if (instr->SzValue() == 0x1) {
int vm = instr->VFPMRegValue(kDoublePrecision);
int vd = instr->VFPDRegValue(kDoublePrecision);
double dm_value = get_double_from_d_register(vm).get_scalar();
double dd_value = 0.0;
int rounding_mode = instr->Bits(17, 16);
switch (rounding_mode) {
case 0x0: // vrinta - round with ties to away from zero
dd_value = round(dm_value);
break;
case 0x1: { // vrintn - round with ties to even
dd_value = nearbyint(dm_value);
break;
}
case 0x2: // vrintp - ceil
dd_value = ceil(dm_value);
break;
case 0x3: // vrintm - floor
dd_value = floor(dm_value);
break;
default:
UNREACHABLE(); // Case analysis is exhaustive.
break;
}
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(vd, dd_value);
} else {
int m = instr->VFPMRegValue(kSinglePrecision);
int d = instr->VFPDRegValue(kSinglePrecision);
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value = 0.0;
int rounding_mode = instr->Bits(17, 16);
switch (rounding_mode) {
case 0x0: // vrinta - round with ties to away from zero
sd_value = roundf(sm_value);
break;
case 0x1: { // vrintn - round with ties to even
sd_value = nearbyintf(sm_value);
break;
}
case 0x2: // vrintp - ceil
sd_value = ceilf(sm_value);
break;
case 0x3: // vrintm - floor
sd_value = floorf(sm_value);
break;
default:
UNREACHABLE(); // Case analysis is exhaustive.
break;
}
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else if ((instr->Opc1Value() == 0x4) && (instr->Bits(11, 9) == 0x5) &&
(instr->Bit(4) == 0x0)) {
if (instr->SzValue() == 0x1) {
int m = instr->VFPMRegValue(kDoublePrecision);
int n = instr->VFPNRegValue(kDoublePrecision);
int d = instr->VFPDRegValue(kDoublePrecision);
double dn_value = get_double_from_d_register(n).get_scalar();
double dm_value = get_double_from_d_register(m).get_scalar();
double dd_value;
if (instr->Bit(6) == 0x1) { // vminnm
if ((dn_value < dm_value) || std::isnan(dm_value)) {
dd_value = dn_value;
} else if ((dm_value < dn_value) || std::isnan(dn_value)) {
dd_value = dm_value;
} else {
DCHECK_EQ(dn_value, dm_value);
// Make sure that we pick the most negative sign for +/-0.
dd_value = std::signbit(dn_value) ? dn_value : dm_value;
}
} else { // vmaxnm
if ((dn_value > dm_value) || std::isnan(dm_value)) {
dd_value = dn_value;
} else if ((dm_value > dn_value) || std::isnan(dn_value)) {
dd_value = dm_value;
} else {
DCHECK_EQ(dn_value, dm_value);
// Make sure that we pick the most positive sign for +/-0.
dd_value = std::signbit(dn_value) ? dm_value : dn_value;
}
}
dd_value = canonicalizeNaN(dd_value);
set_d_register_from_double(d, dd_value);
} else {
int m = instr->VFPMRegValue(kSinglePrecision);
int n = instr->VFPNRegValue(kSinglePrecision);
int d = instr->VFPDRegValue(kSinglePrecision);
float sn_value = get_float_from_s_register(n).get_scalar();
float sm_value = get_float_from_s_register(m).get_scalar();
float sd_value;
if (instr->Bit(6) == 0x1) { // vminnm
if ((sn_value < sm_value) || std::isnan(sm_value)) {
sd_value = sn_value;
} else if ((sm_value < sn_value) || std::isnan(sn_value)) {
sd_value = sm_value;
} else {
DCHECK_EQ(sn_value, sm_value);
// Make sure that we pick the most negative sign for +/-0.
sd_value = std::signbit(sn_value) ? sn_value : sm_value;
}
} else { // vmaxnm
if ((sn_value > sm_value) || std::isnan(sm_value)) {
sd_value = sn_value;
} else if ((sm_value > sn_value) || std::isnan(sn_value)) {
sd_value = sm_value;
} else {
DCHECK_EQ(sn_value, sm_value);
// Make sure that we pick the most positive sign for +/-0.
sd_value = std::signbit(sn_value) ? sm_value : sn_value;
}
}
sd_value = canonicalizeNaN(sd_value);
set_s_register_from_float(d, sd_value);
}
} else {
UNIMPLEMENTED();
}
break;
case 0x1C:
if ((instr->Bits(11, 9) == 0x5) && (instr->Bit(6) == 0) &&
(instr->Bit(4) == 0)) {
// VSEL* (floating-point)
bool condition_holds;
switch (instr->Bits(21, 20)) {
case 0x0: // VSELEQ
condition_holds = (z_flag_ == 1);
break;
case 0x1: // VSELVS
condition_holds = (v_flag_ == 1);
break;
case 0x2: // VSELGE
condition_holds = (n_flag_ == v_flag_);
break;
case 0x3: // VSELGT
condition_holds = ((z_flag_ == 0) && (n_flag_ == v_flag_));
break;
default:
UNREACHABLE(); // Case analysis is exhaustive.
break;
}
if (instr->SzValue() == 0x1) {
int n = instr->VFPNRegValue(kDoublePrecision);
int m = instr->VFPMRegValue(kDoublePrecision);
int d = instr->VFPDRegValue(kDoublePrecision);
Float64 result = get_double_from_d_register(condition_holds ? n : m);
set_d_register_from_double(d, result);
} else {
int n = instr->VFPNRegValue(kSinglePrecision);
int m = instr->VFPMRegValue(kSinglePrecision);
int d = instr->VFPDRegValue(kSinglePrecision);
Float32 result = get_float_from_s_register(condition_holds ? n : m);
set_s_register_from_float(d, result);
}
} else {
UNIMPLEMENTED();
}
break;
default:
UNIMPLEMENTED();
break;
}
}
// Executes the current instruction.
void Simulator::InstructionDecode(Instruction* instr) {
if (v8::internal::FLAG_check_icache) {
CheckICache(i_cache(), instr);
}
pc_modified_ = false;
if (::v8::internal::FLAG_trace_sim) {
disasm::NameConverter converter;
disasm::Disassembler dasm(converter);
// use a reasonably large buffer
v8::internal::EmbeddedVector<char, 256> buffer;
dasm.InstructionDecode(buffer,
reinterpret_cast<byte*>(instr));
PrintF(" 0x%08" V8PRIxPTR " %s\n", reinterpret_cast<intptr_t>(instr),
buffer.start());
}
if (instr->ConditionField() == kSpecialCondition) {
DecodeSpecialCondition(instr);
} else if (ConditionallyExecute(instr)) {
switch (instr->TypeValue()) {
case 0:
case 1: {
DecodeType01(instr);
break;
}
case 2: {
DecodeType2(instr);
break;
}
case 3: {
DecodeType3(instr);
break;
}
case 4: {
DecodeType4(instr);
break;
}
case 5: {
DecodeType5(instr);
break;
}
case 6: {
DecodeType6(instr);
break;
}
case 7: {
DecodeType7(instr);
break;
}
default: {
UNIMPLEMENTED();
break;
}
}
}
if (!pc_modified_) {
set_register(pc, reinterpret_cast<int32_t>(instr)
+ Instruction::kInstrSize);
}
}
void Simulator::Execute() {
// Get the PC to simulate. Cannot use the accessor here as we need the
// raw PC value and not the one used as input to arithmetic instructions.
int program_counter = get_pc();
if (::v8::internal::FLAG_stop_sim_at == 0) {
// Fast version of the dispatch loop without checking whether the simulator
// should be stopping at a particular executed instruction.
while (program_counter != end_sim_pc) {
Instruction* instr = reinterpret_cast<Instruction*>(program_counter);
icount_++;
InstructionDecode(instr);
program_counter = get_pc();
}
} else {
// FLAG_stop_sim_at is at the non-default value. Stop in the debugger when
// we reach the particular instruction count.
while (program_counter != end_sim_pc) {
Instruction* instr = reinterpret_cast<Instruction*>(program_counter);
icount_++;
if (icount_ == ::v8::internal::FLAG_stop_sim_at) {
ArmDebugger dbg(this);
dbg.Debug();
} else {
InstructionDecode(instr);
}
program_counter = get_pc();
}
}
}
void Simulator::CallInternal(Address entry) {
// Adjust JS-based stack limit to C-based stack limit.
isolate_->stack_guard()->AdjustStackLimitForSimulator();
// Prepare to execute the code at entry
set_register(pc, static_cast<int32_t>(entry));
// Put down marker for end of simulation. The simulator will stop simulation
// when the PC reaches this value. By saving the "end simulation" value into
// the LR the simulation stops when returning to this call point.
set_register(lr, end_sim_pc);
// Remember the values of callee-saved registers.
// The code below assumes that r9 is not used as sb (static base) in
// simulator code and therefore is regarded as a callee-saved register.
int32_t r4_val = get_register(r4);
int32_t r5_val = get_register(r5);
int32_t r6_val = get_register(r6);
int32_t r7_val = get_register(r7);
int32_t r8_val = get_register(r8);
int32_t r9_val = get_register(r9);
int32_t r10_val = get_register(r10);
int32_t r11_val = get_register(r11);
// Set up the callee-saved registers with a known value. To be able to check
// that they are preserved properly across JS execution.
int32_t callee_saved_value = icount_;
set_register(r4, callee_saved_value);
set_register(r5, callee_saved_value);
set_register(r6, callee_saved_value);
set_register(r7, callee_saved_value);
set_register(r8, callee_saved_value);
set_register(r9, callee_saved_value);
set_register(r10, callee_saved_value);
set_register(r11, callee_saved_value);
// Start the simulation
Execute();
// Check that the callee-saved registers have been preserved.
CHECK_EQ(callee_saved_value, get_register(r4));
CHECK_EQ(callee_saved_value, get_register(r5));
CHECK_EQ(callee_saved_value, get_register(r6));
CHECK_EQ(callee_saved_value, get_register(r7));
CHECK_EQ(callee_saved_value, get_register(r8));
CHECK_EQ(callee_saved_value, get_register(r9));
CHECK_EQ(callee_saved_value, get_register(r10));
CHECK_EQ(callee_saved_value, get_register(r11));
// Restore callee-saved registers with the original value.
set_register(r4, r4_val);
set_register(r5, r5_val);
set_register(r6, r6_val);
set_register(r7, r7_val);
set_register(r8, r8_val);
set_register(r9, r9_val);
set_register(r10, r10_val);
set_register(r11, r11_val);
}
intptr_t Simulator::CallImpl(Address entry, int argument_count,
const intptr_t* arguments) {
// Set up arguments
// First four arguments passed in registers.
int reg_arg_count = std::min(4, argument_count);
if (reg_arg_count > 0) set_register(r0, arguments[0]);
if (reg_arg_count > 1) set_register(r1, arguments[1]);
if (reg_arg_count > 2) set_register(r2, arguments[2]);
if (reg_arg_count > 3) set_register(r3, arguments[3]);
// Remaining arguments passed on stack.
int original_stack = get_register(sp);
// Compute position of stack on entry to generated code.
int entry_stack = (original_stack - (argument_count - 4) * sizeof(int32_t));
if (base::OS::ActivationFrameAlignment() != 0) {
entry_stack &= -base::OS::ActivationFrameAlignment();
}
// Store remaining arguments on stack, from low to high memory.
memcpy(reinterpret_cast<intptr_t*>(entry_stack), arguments + reg_arg_count,
(argument_count - reg_arg_count) * sizeof(*arguments));
set_register(sp, entry_stack);
CallInternal(entry);
// Pop stack passed arguments.
CHECK_EQ(entry_stack, get_register(sp));
set_register(sp, original_stack);
return get_register(r0);
}
intptr_t Simulator::CallFPImpl(Address entry, double d0, double d1) {
if (use_eabi_hardfloat()) {
set_d_register_from_double(0, d0);
set_d_register_from_double(1, d1);
} else {
set_register_pair_from_double(0, &d0);
set_register_pair_from_double(2, &d1);
}
CallInternal(entry);
return get_register(r0);
}
uintptr_t Simulator::PushAddress(uintptr_t address) {
int new_sp = get_register(sp) - sizeof(uintptr_t);
uintptr_t* stack_slot = reinterpret_cast<uintptr_t*>(new_sp);
*stack_slot = address;
set_register(sp, new_sp);
return new_sp;
}
uintptr_t Simulator::PopAddress() {
int current_sp = get_register(sp);
uintptr_t* stack_slot = reinterpret_cast<uintptr_t*>(current_sp);
uintptr_t address = *stack_slot;
set_register(sp, current_sp + sizeof(uintptr_t));
return address;
}
Simulator::LocalMonitor::LocalMonitor()
: access_state_(MonitorAccess::Open),
tagged_addr_(0),
size_(TransactionSize::None) {}
void Simulator::LocalMonitor::Clear() {
access_state_ = MonitorAccess::Open;
tagged_addr_ = 0;
size_ = TransactionSize::None;
}
void Simulator::LocalMonitor::NotifyLoad(int32_t addr) {
if (access_state_ == MonitorAccess::Exclusive) {
// A load could cause a cache eviction which will affect the monitor. As a
// result, it's most strict to unconditionally clear the local monitor on
// load.
Clear();
}
}
void Simulator::LocalMonitor::NotifyLoadExcl(int32_t addr,
TransactionSize size) {
access_state_ = MonitorAccess::Exclusive;
tagged_addr_ = addr;
size_ = size;
}
void Simulator::LocalMonitor::NotifyStore(int32_t addr) {
if (access_state_ == MonitorAccess::Exclusive) {
// It is implementation-defined whether a non-exclusive store to an address
// covered by the local monitor during exclusive access transitions to open
// or exclusive access. See ARM DDI 0406C.b, A3.4.1.
//
// However, a store could cause a cache eviction which will affect the
// monitor. As a result, it's most strict to unconditionally clear the
// local monitor on store.
Clear();
}
}
bool Simulator::LocalMonitor::NotifyStoreExcl(int32_t addr,
TransactionSize size) {
if (access_state_ == MonitorAccess::Exclusive) {
// It is allowed for a processor to require that the address matches
// exactly (A3.4.5), so this comparison does not mask addr.
if (addr == tagged_addr_ && size_ == size) {
Clear();
return true;
} else {
// It is implementation-defined whether an exclusive store to a
// non-tagged address will update memory. Behavior is unpredictable if
// the transaction size of the exclusive store differs from that of the
// exclusive load. See ARM DDI 0406C.b, A3.4.5.
Clear();
return false;
}
} else {
DCHECK(access_state_ == MonitorAccess::Open);
return false;
}
}
Simulator::GlobalMonitor::Processor::Processor()
: access_state_(MonitorAccess::Open),
tagged_addr_(0),
next_(nullptr),
prev_(nullptr),
failure_counter_(0) {}
void Simulator::GlobalMonitor::Processor::Clear_Locked() {
access_state_ = MonitorAccess::Open;
tagged_addr_ = 0;
}
void Simulator::GlobalMonitor::Processor::NotifyLoadExcl_Locked(int32_t addr) {
access_state_ = MonitorAccess::Exclusive;
tagged_addr_ = addr;
}
void Simulator::GlobalMonitor::Processor::NotifyStore_Locked(
int32_t addr, bool is_requesting_processor) {
if (access_state_ == MonitorAccess::Exclusive) {
// It is implementation-defined whether a non-exclusive store by the
// requesting processor to an address covered by the global monitor
// during exclusive access transitions to open or exclusive access.
//
// For any other processor, the access state always transitions to open
// access.
//
// See ARM DDI 0406C.b, A3.4.2.
//
// However, similar to the local monitor, it is possible that a store
// caused a cache eviction, which can affect the montior, so
// conservatively, we always clear the monitor.
Clear_Locked();
}
}
bool Simulator::GlobalMonitor::Processor::NotifyStoreExcl_Locked(
int32_t addr, bool is_requesting_processor) {
if (access_state_ == MonitorAccess::Exclusive) {
if (is_requesting_processor) {
// It is allowed for a processor to require that the address matches
// exactly (A3.4.5), so this comparison does not mask addr.
if (addr == tagged_addr_) {
// The access state for the requesting processor after a successful
// exclusive store is implementation-defined, but according to the ARM
// DDI, this has no effect on the subsequent operation of the global
// monitor.
Clear_Locked();
// Introduce occasional strex failures. This is to simulate the
// behavior of hardware, which can randomly fail due to background
// cache evictions.
if (failure_counter_++ >= kMaxFailureCounter) {
failure_counter_ = 0;
return false;
} else {
return true;
}
}
} else if ((addr & kExclusiveTaggedAddrMask) ==
(tagged_addr_ & kExclusiveTaggedAddrMask)) {
// Check the masked addresses when responding to a successful lock by
// another processor so the implementation is more conservative (i.e. the
// granularity of locking is as large as possible.)
Clear_Locked();
return false;
}
}
return false;
}
Simulator::GlobalMonitor::GlobalMonitor() : head_(nullptr) {}
void Simulator::GlobalMonitor::NotifyLoadExcl_Locked(int32_t addr,
Processor* processor) {
processor->NotifyLoadExcl_Locked(addr);
PrependProcessor_Locked(processor);
}
void Simulator::GlobalMonitor::NotifyStore_Locked(int32_t addr,
Processor* processor) {
// Notify each processor of the store operation.
for (Processor* iter = head_; iter; iter = iter->next_) {
bool is_requesting_processor = iter == processor;
iter->NotifyStore_Locked(addr, is_requesting_processor);
}
}
bool Simulator::GlobalMonitor::NotifyStoreExcl_Locked(int32_t addr,
Processor* processor) {
DCHECK(IsProcessorInLinkedList_Locked(processor));
if (processor->NotifyStoreExcl_Locked(addr, true)) {
// Notify the other processors that this StoreExcl succeeded.
for (Processor* iter = head_; iter; iter = iter->next_) {
if (iter != processor) {
iter->NotifyStoreExcl_Locked(addr, false);
}
}
return true;
} else {
return false;
}
}
bool Simulator::GlobalMonitor::IsProcessorInLinkedList_Locked(
Processor* processor) const {
return head_ == processor || processor->next_ || processor->prev_;
}
void Simulator::GlobalMonitor::PrependProcessor_Locked(Processor* processor) {
if (IsProcessorInLinkedList_Locked(processor)) {
return;
}
if (head_) {
head_->prev_ = processor;
}
processor->prev_ = nullptr;
processor->next_ = head_;
head_ = processor;
}
void Simulator::GlobalMonitor::RemoveProcessor(Processor* processor) {
base::LockGuard<base::Mutex> lock_guard(&mutex);
if (!IsProcessorInLinkedList_Locked(processor)) {
return;
}
if (processor->prev_) {
processor->prev_->next_ = processor->next_;
} else {
head_ = processor->next_;
}
if (processor->next_) {
processor->next_->prev_ = processor->prev_;
}
processor->prev_ = nullptr;
processor->next_ = nullptr;
}
} // namespace internal
} // namespace v8
#endif // USE_SIMULATOR
#endif // V8_TARGET_ARCH_ARM
| [
"madanagopal_thirumalai@comcast.com"
] | madanagopal_thirumalai@comcast.com |
514ac0ee036fe990dbe4e6bb5c099f194b9b961d | 493fa2172dc55557d9d882d12cf9822c78fff08c | /BaseVr2/Plugins/VRExpansionPlugin/VRExpansionPlugin/Source/VRExpansionPlugin/Private/VRCharacterMovementComponent.cpp | f21825c3deaf84eba5abfbdf98e297b75f0ee75a | [
"MIT"
] | permissive | chriszavadil/OculusHandsWithAnimation | 217c534a050952866b1b4dbd6bef13ddd6e2e0b8 | 9157371e1874670a6f3cb4138dc65ff86d850265 | refs/heads/master | 2023-01-21T11:40:33.542357 | 2020-11-28T17:38:59 | 2020-11-28T17:38:59 | 310,038,703 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 172,424 | cpp | // Copyright 1998-2016 Epic Games, Inc. All Rights Reserved.
/*=============================================================================
Movement.cpp: Character movement implementation
=============================================================================*/
#include "VRCharacterMovementComponent.h"
#include "GameFramework/PhysicsVolume.h"
#include "GameFramework/GameNetworkManager.h"
#include "GameFramework/Character.h"
#include "GameFramework/GameState.h"
#include "Components/PrimitiveComponent.h"
#include "Animation/AnimMontage.h"
#include "DrawDebugHelpers.h"
//#include "PhysicsEngine/DestructibleActor.h"
#include "VRCharacter.h"
#include "VRExpansionFunctionLibrary.h"
// @todo this is here only due to circular dependency to AIModule. To be removed
#include "Navigation/PathFollowingComponent.h"
#include "AI/Navigation/AvoidanceManager.h"
#include "Components/CapsuleComponent.h"
#include "Components/BrushComponent.h"
//#include "Components/DestructibleComponent.h"
#include "Engine/DemoNetDriver.h"
#include "Engine/NetworkObjectList.h"
//#include "PerfCountersHelpers.h"
DEFINE_LOG_CATEGORY(LogVRCharacterMovement);
/**
* Character stats
*/
DECLARE_CYCLE_STAT(TEXT("Char StepUp"), STAT_CharStepUp, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char FindFloor"), STAT_CharFindFloor, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char ReplicateMoveToServer"), STAT_CharacterMovementReplicateMoveToServer, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char CallServerMove"), STAT_CharacterMovementCallServerMove, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char CombineNetMove"), STAT_CharacterMovementCombineNetMove, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char PhysWalking"), STAT_CharPhysWalking, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char PhysFalling"), STAT_CharPhysFalling, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char PhysNavWalking"), STAT_CharPhysNavWalking, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char NavProjectPoint"), STAT_CharNavProjectPoint, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char NavProjectLocation"), STAT_CharNavProjectLocation, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char AdjustFloorHeight"), STAT_CharAdjustFloorHeight, STATGROUP_Character);
DECLARE_CYCLE_STAT(TEXT("Char ProcessLanded"), STAT_CharProcessLanded, STATGROUP_Character);
// MAGIC NUMBERS
const float MAX_STEP_SIDE_Z = 0.08f; // maximum z value for the normal on the vertical side of steps
const float SWIMBOBSPEED = -80.f;
const float VERTICAL_SLOPE_NORMAL_Z = 0.001f; // Slope is vertical if Abs(Normal.Z) <= this threshold. Accounts for precision problems that sometimes angle normals slightly off horizontal for vertical surface.
// Defines for build configs
#if DO_CHECK && !UE_BUILD_SHIPPING // Disable even if checks in shipping are enabled.
#define devCode( Code ) checkCode( Code )
#else
#define devCode(...)
#endif
// Statics
namespace CharacterMovementComponentStatics
{
static const FName CrouchTraceName = FName(TEXT("CrouchTrace"));
static const FName ImmersionDepthName = FName(TEXT("MovementComp_Character_ImmersionDepth"));
static float fRotationCorrectionThreshold = 0.02f;
FAutoConsoleVariableRef CVarRotationCorrectionThreshold(
TEXT("vre.RotationCorrectionThreshold"),
fRotationCorrectionThreshold,
TEXT("Error threshold value before correcting a clients rotation.\n")
TEXT("Rotation is replicated at 2 decimal precision, so values less than 0.01 won't matter."),
ECVF_Default);
}
void UVRCharacterMovementComponent::Crouch(bool bClientSimulation)
{
if (!HasValidData())
{
return;
}
if (!bClientSimulation && !CanCrouchInCurrentState())
{
return;
}
// See if collision is already at desired size.
if (CharacterOwner->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight() == CrouchedHalfHeight)
{
if (!bClientSimulation)
{
CharacterOwner->bIsCrouched = true;
}
CharacterOwner->OnStartCrouch(0.f, 0.f);
return;
}
if (bClientSimulation && CharacterOwner->GetLocalRole() == ROLE_SimulatedProxy)
{
// restore collision size before crouching
ACharacter* DefaultCharacter = CharacterOwner->GetClass()->GetDefaultObject<ACharacter>();
if (VRRootCapsule)
VRRootCapsule->SetCapsuleSizeVR(DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleRadius(), DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight());
else
CharacterOwner->GetCapsuleComponent()->SetCapsuleSize(DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleRadius(), DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight());
bShrinkProxyCapsule = true;
}
// Change collision size to crouching dimensions
const float ComponentScale = CharacterOwner->GetCapsuleComponent()->GetShapeScale();
const float OldUnscaledHalfHeight = CharacterOwner->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight();
const float OldUnscaledRadius = CharacterOwner->GetCapsuleComponent()->GetUnscaledCapsuleRadius();
// Height is not allowed to be smaller than radius.
const float ClampedCrouchedHalfHeight = FMath::Max3(0.f, OldUnscaledRadius, CrouchedHalfHeight);
if (VRRootCapsule)
VRRootCapsule->SetCapsuleSizeVR(OldUnscaledRadius, ClampedCrouchedHalfHeight);
else
CharacterOwner->GetCapsuleComponent()->SetCapsuleSize(OldUnscaledRadius, ClampedCrouchedHalfHeight);
float HalfHeightAdjust = (OldUnscaledHalfHeight - ClampedCrouchedHalfHeight);
float ScaledHalfHeightAdjust = HalfHeightAdjust * ComponentScale;
if (!bClientSimulation)
{
// Crouching to a larger height? (this is rare)
if (ClampedCrouchedHalfHeight > OldUnscaledHalfHeight)
{
FCollisionQueryParams CapsuleParams(CharacterMovementComponentStatics::CrouchTraceName, false, CharacterOwner);
FCollisionResponseParams ResponseParam;
InitCollisionParams(CapsuleParams, ResponseParam);
FVector capLocation;
if (VRRootCapsule)
{
capLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
}
else
capLocation = UpdatedComponent->GetComponentLocation();
const bool bEncroached = GetWorld()->OverlapBlockingTestByChannel(capLocation - FVector(0.f, 0.f, ScaledHalfHeightAdjust), FQuat::Identity,
UpdatedComponent->GetCollisionObjectType(), GetPawnCapsuleCollisionShape(SHRINK_None), CapsuleParams, ResponseParam);
// If encroached, cancel
if (bEncroached)
{
if (VRRootCapsule)
VRRootCapsule->SetCapsuleSizeVR(OldUnscaledRadius, OldUnscaledHalfHeight);
else
CharacterOwner->GetCapsuleComponent()->SetCapsuleSize(OldUnscaledRadius, OldUnscaledHalfHeight);
return;
}
}
// Skipping this move down as the VR character's base root doesn't behave the same
if (bCrouchMaintainsBaseLocation)
{
// Intentionally not using MoveUpdatedComponent, where a horizontal plane constraint would prevent the base of the capsule from staying at the same spot.
//UpdatedComponent->MoveComponent(FVector(0.f, 0.f, -ScaledHalfHeightAdjust), UpdatedComponent->GetComponentQuat(), true, nullptr, EMoveComponentFlags::MOVECOMP_NoFlags, ETeleportType::TeleportPhysics);
}
CharacterOwner->bIsCrouched = true;
}
bForceNextFloorCheck = true;
// OnStartCrouch takes the change from the Default size, not the current one (though they are usually the same).
const float MeshAdjust = ScaledHalfHeightAdjust;
ACharacter* DefaultCharacter = CharacterOwner->GetClass()->GetDefaultObject<ACharacter>();
HalfHeightAdjust = (DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight() - ClampedCrouchedHalfHeight);
ScaledHalfHeightAdjust = HalfHeightAdjust * ComponentScale;
AdjustProxyCapsuleSize();
CharacterOwner->OnStartCrouch(HalfHeightAdjust, ScaledHalfHeightAdjust);
// Don't smooth this change in mesh position
if ((bClientSimulation && CharacterOwner->GetLocalRole() == ROLE_SimulatedProxy) || (IsNetMode(NM_ListenServer) && CharacterOwner->GetRemoteRole() == ROLE_AutonomousProxy))
{
FNetworkPredictionData_Client_Character* ClientData = GetPredictionData_Client_Character();
if (ClientData)
{
ClientData->MeshTranslationOffset -= FVector(0.f, 0.f, MeshAdjust);
ClientData->OriginalMeshTranslationOffset = ClientData->MeshTranslationOffset;
}
}
}
void UVRCharacterMovementComponent::UnCrouch(bool bClientSimulation)
{
if (!HasValidData())
{
return;
}
ACharacter* DefaultCharacter = CharacterOwner->GetClass()->GetDefaultObject<ACharacter>();
// See if collision is already at desired size.
if (CharacterOwner->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight() == DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight())
{
if (!bClientSimulation)
{
CharacterOwner->bIsCrouched = false;
}
CharacterOwner->OnEndCrouch(0.f, 0.f);
return;
}
const float CurrentCrouchedHalfHeight = CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleHalfHeight();
const float ComponentScale = CharacterOwner->GetCapsuleComponent()->GetShapeScale();
const float OldUnscaledHalfHeight = CharacterOwner->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight();
const float HalfHeightAdjust = DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight() - OldUnscaledHalfHeight;
const float ScaledHalfHeightAdjust = HalfHeightAdjust * ComponentScale;
/*const*/ FVector PawnLocation = UpdatedComponent->GetComponentLocation();
if (VRRootCapsule)
{
PawnLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
}
// Grow to uncrouched size.
check(CharacterOwner->GetCapsuleComponent());
if (!bClientSimulation)
{
// Try to stay in place and see if the larger capsule fits. We use a slightly taller capsule to avoid penetration.
const UWorld* MyWorld = GetWorld();
const float SweepInflation = KINDA_SMALL_NUMBER * 10.f;
FCollisionQueryParams CapsuleParams(CharacterMovementComponentStatics::CrouchTraceName, false, CharacterOwner);
FCollisionResponseParams ResponseParam;
InitCollisionParams(CapsuleParams, ResponseParam);
// Compensate for the difference between current capsule size and standing size
const FCollisionShape StandingCapsuleShape = GetPawnCapsuleCollisionShape(SHRINK_HeightCustom, -SweepInflation - ScaledHalfHeightAdjust); // Shrink by negative amount, so actually grow it.
const ECollisionChannel CollisionChannel = UpdatedComponent->GetCollisionObjectType();
bool bEncroached = true;
if (!bCrouchMaintainsBaseLocation)
{
// Expand in place
bEncroached = MyWorld->OverlapBlockingTestByChannel(PawnLocation, FQuat::Identity, CollisionChannel, StandingCapsuleShape, CapsuleParams, ResponseParam);
if (bEncroached)
{
// Try adjusting capsule position to see if we can avoid encroachment.
if (ScaledHalfHeightAdjust > 0.f)
{
// Shrink to a short capsule, sweep down to base to find where that would hit something, and then try to stand up from there.
float PawnRadius, PawnHalfHeight;
CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleSize(PawnRadius, PawnHalfHeight);
const float ShrinkHalfHeight = PawnHalfHeight - PawnRadius;
const float TraceDist = PawnHalfHeight - ShrinkHalfHeight;
const FVector Down = FVector(0.f, 0.f, -TraceDist);
FHitResult Hit(1.f);
const FCollisionShape ShortCapsuleShape = GetPawnCapsuleCollisionShape(SHRINK_HeightCustom, ShrinkHalfHeight);
const bool bBlockingHit = MyWorld->SweepSingleByChannel(Hit, PawnLocation, PawnLocation + Down, FQuat::Identity, CollisionChannel, ShortCapsuleShape, CapsuleParams);
if (Hit.bStartPenetrating)
{
bEncroached = true;
}
else
{
// Compute where the base of the sweep ended up, and see if we can stand there
const float DistanceToBase = (Hit.Time * TraceDist) + ShortCapsuleShape.Capsule.HalfHeight;
const FVector NewLoc = FVector(PawnLocation.X, PawnLocation.Y, PawnLocation.Z - DistanceToBase + StandingCapsuleShape.Capsule.HalfHeight + SweepInflation + MIN_FLOOR_DIST / 2.f);
bEncroached = MyWorld->OverlapBlockingTestByChannel(NewLoc, FQuat::Identity, CollisionChannel, StandingCapsuleShape, CapsuleParams, ResponseParam);
if (!bEncroached)
{
// Intentionally not using MoveUpdatedComponent, where a horizontal plane constraint would prevent the base of the capsule from staying at the same spot.
UpdatedComponent->MoveComponent(NewLoc - PawnLocation, UpdatedComponent->GetComponentQuat(), false, nullptr, EMoveComponentFlags::MOVECOMP_NoFlags, ETeleportType::TeleportPhysics);
}
}
}
}
}
else
{
// Expand while keeping base location the same.
FVector StandingLocation = PawnLocation + FVector(0.f, 0.f, StandingCapsuleShape.GetCapsuleHalfHeight() - CurrentCrouchedHalfHeight);
bEncroached = MyWorld->OverlapBlockingTestByChannel(StandingLocation, FQuat::Identity, CollisionChannel, StandingCapsuleShape, CapsuleParams, ResponseParam);
if (bEncroached)
{
if (IsMovingOnGround())
{
// Something might be just barely overhead, try moving down closer to the floor to avoid it.
const float MinFloorDist = KINDA_SMALL_NUMBER * 10.f;
if (CurrentFloor.bBlockingHit && CurrentFloor.FloorDist > MinFloorDist)
{
StandingLocation.Z -= CurrentFloor.FloorDist - MinFloorDist;
bEncroached = MyWorld->OverlapBlockingTestByChannel(StandingLocation, FQuat::Identity, CollisionChannel, StandingCapsuleShape, CapsuleParams, ResponseParam);
}
}
}
// Canceling this move because our VR capsule isn't actor based like it expects it to be
if (!bEncroached)
{
// Commit the change in location.
//UpdatedComponent->MoveComponent(StandingLocation - PawnLocation, UpdatedComponent->GetComponentQuat(), false, nullptr, EMoveComponentFlags::MOVECOMP_NoFlags, ETeleportType::TeleportPhysics);
bForceNextFloorCheck = true;
}
}
// If still encroached then abort.
if (bEncroached)
{
return;
}
CharacterOwner->bIsCrouched = false;
}
else
{
bShrinkProxyCapsule = true;
}
// Now call SetCapsuleSize() to cause touch/untouch events and actually grow the capsule
if (VRRootCapsule)
VRRootCapsule->SetCapsuleSizeVR(DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleRadius(), DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight(), true);
else
CharacterOwner->GetCapsuleComponent()->SetCapsuleSize(DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleRadius(), DefaultCharacter->GetCapsuleComponent()->GetUnscaledCapsuleHalfHeight(), true);
const float MeshAdjust = ScaledHalfHeightAdjust;
AdjustProxyCapsuleSize();
CharacterOwner->OnEndCrouch(HalfHeightAdjust, ScaledHalfHeightAdjust);
// Don't smooth this change in mesh position
if ((bClientSimulation && CharacterOwner->GetLocalRole() == ROLE_SimulatedProxy) || (IsNetMode(NM_ListenServer) && CharacterOwner->GetRemoteRole() == ROLE_AutonomousProxy))
{
FNetworkPredictionData_Client_Character* ClientData = GetPredictionData_Client_Character();
if (ClientData)
{
ClientData->MeshTranslationOffset += FVector(0.f, 0.f, MeshAdjust);
ClientData->OriginalMeshTranslationOffset = ClientData->MeshTranslationOffset;
}
}
}
FNetworkPredictionData_Client* UVRCharacterMovementComponent::GetPredictionData_Client() const
{
// Should only be called on client or listen server (for remote clients) in network games
check(CharacterOwner != NULL);
checkSlow(CharacterOwner->GetLocalRole() < ROLE_Authority || (CharacterOwner->GetRemoteRole() == ROLE_AutonomousProxy && GetNetMode() == NM_ListenServer));
checkSlow(GetNetMode() == NM_Client || GetNetMode() == NM_ListenServer);
if (!ClientPredictionData)
{
UVRCharacterMovementComponent* MutableThis = const_cast<UVRCharacterMovementComponent*>(this);
MutableThis->ClientPredictionData = new FNetworkPredictionData_Client_VRCharacter(*this);
}
return ClientPredictionData;
}
FNetworkPredictionData_Server* UVRCharacterMovementComponent::GetPredictionData_Server() const
{
// Should only be called on server in network games
check(CharacterOwner != NULL);
check(CharacterOwner->GetLocalRole() == ROLE_Authority);
checkSlow(GetNetMode() < NM_Client);
if (!ServerPredictionData)
{
UVRCharacterMovementComponent* MutableThis = const_cast<UVRCharacterMovementComponent*>(this);
MutableThis->ServerPredictionData = new FNetworkPredictionData_Server_VRCharacter(*this);
}
return ServerPredictionData;
}
void FSavedMove_VRCharacter::SetInitialPosition(ACharacter* C)
{
// See if we can get the VR capsule location
if (AVRCharacter * VRC = Cast<AVRCharacter>(C))
{
UVRCharacterMovementComponent * CharMove = Cast<UVRCharacterMovementComponent>(VRC->GetCharacterMovement());
if (VRC->VRRootReference)
{
VRCapsuleLocation = VRC->VRRootReference->curCameraLoc;
VRCapsuleRotation = UVRExpansionFunctionLibrary::GetHMDPureYaw_I(VRC->VRRootReference->curCameraRot);
LFDiff = VRC->VRRootReference->DifferenceFromLastFrame;
}
else
{
VRCapsuleLocation = FVector::ZeroVector;
VRCapsuleRotation = FRotator::ZeroRotator;
LFDiff = FVector::ZeroVector;
}
}
FSavedMove_VRBaseCharacter::SetInitialPosition(C);
}
void FSavedMove_VRCharacter::PrepMoveFor(ACharacter* Character)
{
UVRCharacterMovementComponent * CharMove = Cast<UVRCharacterMovementComponent>(Character->GetCharacterMovement());
// Set capsule location prior to testing movement
// I am overriding the replicated value here when movement is made on purpose
if (CharMove && CharMove->VRRootCapsule)
{
CharMove->VRRootCapsule->curCameraLoc = this->VRCapsuleLocation;
CharMove->VRRootCapsule->curCameraRot = this->VRCapsuleRotation;//FRotator(0.0f, FRotator::DecompressAxisFromByte(CapsuleYaw), 0.0f);
CharMove->VRRootCapsule->DifferenceFromLastFrame = FVector(LFDiff.X, LFDiff.Y, 0.0f);
CharMove->AdditionalVRInputVector = CharMove->VRRootCapsule->DifferenceFromLastFrame;
if (AVRBaseCharacter * BaseChar = Cast<AVRBaseCharacter>(CharMove->GetCharacterOwner()))
{
if (BaseChar->VRReplicateCapsuleHeight && this->LFDiff.Z > 0.0f && !FMath::IsNearlyEqual(this->LFDiff.Z, CharMove->VRRootCapsule->GetUnscaledCapsuleHalfHeight()))
{
BaseChar->SetCharacterHalfHeightVR(LFDiff.Z, false);
//CharMove->VRRootCapsule->SetCapsuleHalfHeight(this->LFDiff.Z, false);
}
}
CharMove->VRRootCapsule->GenerateOffsetToWorld(false, false);
}
FSavedMove_VRBaseCharacter::PrepMoveFor(Character);
}
bool UVRCharacterMovementComponent::ServerMoveVROld_Validate(float OldTimeStamp, FVector_NetQuantize10 OldAccel, uint8 OldMoveFlags, FVRConditionalMoveRep ConditionalReps)
{
return true;
}
bool UVRCharacterMovementComponent::ServerMoveVR_Validate(float TimeStamp, FVector_NetQuantize10 InAccel, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 MoveFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
return true;
}
bool UVRCharacterMovementComponent::ServerMoveVRExLight_Validate(float TimeStamp, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 MoveFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
return true;
}
bool UVRCharacterMovementComponent::ServerMoveVRDual_Validate(float TimeStamp0, FVector_NetQuantize10 InAccel0, uint8 PendingFlags, uint32 View0, FVector_NetQuantize100 OldCapsuleLoc, FVRConditionalMoveRep OldConditionalReps, FVector_NetQuantize100 OldLFDiff, uint16 OldCapsuleYaw, float TimeStamp, FVector_NetQuantize10 InAccel, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 NewFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
return true;
}
bool UVRCharacterMovementComponent::ServerMoveVRDualExLight_Validate(float TimeStamp0, uint8 PendingFlags, uint32 View0, FVector_NetQuantize100 OldCapsuleLoc, FVRConditionalMoveRep OldConditionalReps, FVector_NetQuantize100 OldLFDiff, uint16 OldCapsuleYaw, float TimeStamp, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 NewFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
return true;
}
bool UVRCharacterMovementComponent::ServerMoveVRDualHybridRootMotion_Validate(float TimeStamp0, FVector_NetQuantize10 InAccel0, uint8 PendingFlags, uint32 View0, FVector_NetQuantize100 OldCapsuleLoc, FVRConditionalMoveRep OldConditionalReps, FVector_NetQuantize100 OldLFDiff, uint16 OldCapsuleYaw, float TimeStamp, FVector_NetQuantize10 InAccel, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 NewFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
return true;
}
void UVRCharacterMovementComponent::ServerMoveVRDualHybridRootMotion_Implementation(
float TimeStamp0,
FVector_NetQuantize10 InAccel0,
uint8 PendingFlags,
uint32 View0,
FVector_NetQuantize100 OldCapsuleLoc,
FVRConditionalMoveRep OldConditionalReps,
FVector_NetQuantize100 OldLFDiff,
uint16 OldCapsuleYaw,
float TimeStamp,
FVector_NetQuantize10 InAccel,
FVector_NetQuantize100 ClientLoc,
FVector_NetQuantize100 CapsuleLoc,
FVRConditionalMoveRep ConditionalReps,
FVector_NetQuantize100 LFDiff,
uint16 CapsuleYaw,
uint8 NewFlags,
FVRConditionalMoveRep2 MoveReps,
uint8 ClientMovementMode)
{
// Keep new moves base and bone, but use the View of the old move
FVRConditionalMoveRep2 MoveRepsOld;
MoveRepsOld.ClientBaseBoneName = MoveReps.ClientBaseBoneName;
MoveRepsOld.ClientMovementBase = MoveReps.ClientMovementBase;
MoveRepsOld.UnpackAndSetINTRotations(View0);
// Scope these, they nest with Outer references so it should work fine, this keeps the update rotation and move autonomous from double updating the char
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableServerDualMoveScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
// First move received didn't use root motion, process it as such.
CharacterOwner->bServerMoveIgnoreRootMotion = CharacterOwner->IsPlayingNetworkedRootMotionMontage();
ServerMoveVR_Implementation(TimeStamp0, InAccel0, FVector(1.f, 2.f, 3.f), OldCapsuleLoc, OldConditionalReps, OldLFDiff, OldCapsuleYaw, PendingFlags, MoveRepsOld, ClientMovementMode);
CharacterOwner->bServerMoveIgnoreRootMotion = false;
ServerMoveVR_Implementation(TimeStamp, InAccel, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, NewFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRDual_Implementation(
float TimeStamp0,
FVector_NetQuantize10 InAccel0,
uint8 PendingFlags,
uint32 View0,
FVector_NetQuantize100 OldCapsuleLoc,
FVRConditionalMoveRep OldConditionalReps,
FVector_NetQuantize100 OldLFDiff,
uint16 OldCapsuleYaw,
float TimeStamp,
FVector_NetQuantize10 InAccel,
FVector_NetQuantize100 ClientLoc,
FVector_NetQuantize100 CapsuleLoc,
FVRConditionalMoveRep ConditionalReps,
FVector_NetQuantize100 LFDiff,
uint16 CapsuleYaw,
uint8 NewFlags,
FVRConditionalMoveRep2 MoveReps,
uint8 ClientMovementMode)
{
// Keep new moves base and bone, but use the View of the old move
FVRConditionalMoveRep2 MoveRepsOld;
MoveRepsOld.ClientBaseBoneName = MoveReps.ClientBaseBoneName;
MoveRepsOld.ClientMovementBase = MoveReps.ClientMovementBase;
MoveRepsOld.UnpackAndSetINTRotations(View0);
// Scope these, they nest with Outer references so it should work fine, this keeps the update rotation and move autonomous from double updating the char
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableServerDualMoveScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
ServerMoveVR_Implementation(TimeStamp0, InAccel0, FVector(1.f, 2.f, 3.f), OldCapsuleLoc, OldConditionalReps, OldLFDiff, OldCapsuleYaw, PendingFlags, MoveRepsOld, ClientMovementMode);
ServerMoveVR_Implementation(TimeStamp, InAccel, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, NewFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRDualExLight_Implementation(
float TimeStamp0,
uint8 PendingFlags,
uint32 View0,
FVector_NetQuantize100 OldCapsuleLoc,
FVRConditionalMoveRep OldConditionalReps,
FVector_NetQuantize100 OldLFDiff,
uint16 OldCapsuleYaw,
float TimeStamp,
FVector_NetQuantize100 ClientLoc,
FVector_NetQuantize100 CapsuleLoc,
FVRConditionalMoveRep ConditionalReps,
FVector_NetQuantize100 LFDiff,
uint16 CapsuleYaw,
uint8 NewFlags,
FVRConditionalMoveRep2 MoveReps,
uint8 ClientMovementMode)
{
// Keep new moves base and bone, but use the View of the old move
FVRConditionalMoveRep2 MoveRepsOld;
MoveRepsOld.ClientBaseBoneName = MoveReps.ClientBaseBoneName;
MoveRepsOld.ClientMovementBase = MoveReps.ClientMovementBase;
MoveRepsOld.UnpackAndSetINTRotations(View0);
// Scope these, they nest with Outer references so it should work fine, this keeps the update rotation and move autonomous from double updating the char
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableServerDualMoveScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
ServerMoveVR_Implementation(TimeStamp0, FVector::ZeroVector, FVector(1.f, 2.f, 3.f), OldCapsuleLoc, OldConditionalReps, OldLFDiff, OldCapsuleYaw, PendingFlags, MoveRepsOld, ClientMovementMode);
ServerMoveVR_Implementation(TimeStamp, FVector::ZeroVector, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, NewFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRExLight_Implementation(
float TimeStamp,
FVector_NetQuantize100 ClientLoc,
FVector_NetQuantize100 CapsuleLoc,
FVRConditionalMoveRep ConditionalReps,
FVector_NetQuantize100 LFDiff,
uint16 CapsuleYaw,
uint8 MoveFlags,
FVRConditionalMoveRep2 MoveReps,
uint8 ClientMovementMode)
{
ServerMoveVR_Implementation(TimeStamp, FVector::ZeroVector, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, MoveFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVROld_Implementation
(
float OldTimeStamp,
FVector_NetQuantize10 OldAccel,
uint8 OldMoveFlags,
FVRConditionalMoveRep ConditionalReps
)
{
if (!HasValidData() || !IsActive())
{
return;
}
FNetworkPredictionData_Server_Character* ServerData = GetPredictionData_Server_Character();
check(ServerData);
bool bAutoAcceptPacket = false;
if (MovementMode == MOVE_Custom && CustomMovementMode == (uint8)EVRCustomMovementMode::VRMOVE_Seated)
{
return;
}
else if (bJustUnseated)
{
ServerData->CurrentClientTimeStamp = OldTimeStamp;
bAutoAcceptPacket = true;
bJustUnseated = false;
}
if (!bAutoAcceptPacket && !VerifyClientTimeStamp(OldTimeStamp, *ServerData))
{
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("ServerMoveOld: TimeStamp expired. %f, CurrentTimeStamp: %f, Character: %s"), OldTimeStamp, ServerData->CurrentClientTimeStamp, *GetNameSafe(CharacterOwner));
return;
}
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Recovered move from OldTimeStamp %f, DeltaTime: %f"), OldTimeStamp, OldTimeStamp - ServerData->CurrentClientTimeStamp);
if (!ConditionalReps.RequestedVelocity.IsZero())
{
RequestedVelocity = ConditionalReps.RequestedVelocity;
bHasRequestedVelocity = true;
}
CustomVRInputVector = ConditionalReps.CustomVRInputVector;
MoveActionArray = ConditionalReps.MoveActionArray;
// Set capsule location prior to testing movement
// I am overriding the replicated value here when movement is made on purpose
/*if (VRRootCapsule)
{
VRRootCapsule->curCameraLoc = CapsuleLoc;
VRRootCapsule->curCameraRot = FRotator(0.0f, FRotator::DecompressAxisFromShort(CapsuleYaw), 0.0f);
VRRootCapsule->DifferenceFromLastFrame = FVector(LFDiff.X, LFDiff.Y, 0.0f);
AdditionalVRInputVector = VRRootCapsule->DifferenceFromLastFrame;
if (AVRBaseCharacter * BaseChar = Cast<AVRBaseCharacter>(CharacterOwner))
{
if (BaseChar->VRReplicateCapsuleHeight && LFDiff.Z > 0.0f && !FMath::IsNearlyEqual(LFDiff.Z, VRRootCapsule->GetUnscaledCapsuleHalfHeight()))
{
BaseChar->SetCharacterHalfHeightVR(LFDiff.Z, false);
}
}
VRRootCapsule->GenerateOffsetToWorld(false, false);
}*/
UE_LOG(LogVRCharacterMovement, Log, TEXT("Recovered move from OldTimeStamp %f, DeltaTime: %f"), OldTimeStamp, OldTimeStamp - ServerData->CurrentClientTimeStamp);
const UWorld* MyWorld = GetWorld();
const float DeltaTime = ServerData->GetServerMoveDeltaTime(OldTimeStamp, CharacterOwner->GetActorTimeDilation(*MyWorld));
if (DeltaTime > 0.f)
{
ServerData->CurrentClientTimeStamp = OldTimeStamp;
ServerData->ServerAccumulatedClientTimeStamp += DeltaTime;
ServerData->ServerTimeStamp = MyWorld->GetTimeSeconds();
ServerData->ServerTimeStampLastServerMove = ServerData->ServerTimeStamp;
MoveAutonomous(OldTimeStamp, DeltaTime, OldMoveFlags, OldAccel);
}
else
{
UE_LOG(LogVRCharacterMovement, Warning, TEXT("OldTimeStamp(%f) results in zero or negative actual DeltaTime(%f). Theoretical DeltaTime(%f)"),
OldTimeStamp, DeltaTime, OldTimeStamp - ServerData->CurrentClientTimeStamp);
}
}
void UVRCharacterMovementComponent::ServerMoveVR_Implementation(
float TimeStamp,
FVector_NetQuantize10 InAccel,
FVector_NetQuantize100 ClientLoc,
FVector_NetQuantize100 CapsuleLoc,
FVRConditionalMoveRep ConditionalReps,
FVector_NetQuantize100 LFDiff,
uint16 CapsuleYaw,
uint8 MoveFlags,
FVRConditionalMoveRep2 MoveReps,
uint8 ClientMovementMode)
{
if (!HasValidData() || !IsComponentTickEnabled())
{
return;
}
FNetworkPredictionData_Server_Character* ServerData = GetPredictionData_Server_Character();
check(ServerData);
bool bAutoAcceptPacket = false;
if (MovementMode == MOVE_Custom && CustomMovementMode == (uint8)EVRCustomMovementMode::VRMOVE_Seated)
{
return;
}
else if (bJustUnseated)
{
ServerData->CurrentClientTimeStamp = TimeStamp;
bAutoAcceptPacket = true;
bJustUnseated = false;
}
if (!bAutoAcceptPacket && !VerifyClientTimeStamp(TimeStamp, *ServerData))
{
const float ServerTimeStamp = ServerData->CurrentClientTimeStamp;
// This is more severe if the timestamp has a large discrepancy and hasn't been recently reset.
static const auto CVarNetServerMoveTimestampExpiredWarningThreshold = IConsoleManager::Get().FindConsoleVariable(TEXT("net.NetServerMoveTimestampExpiredWarningThreshold"));
if (ServerTimeStamp > 1.0f && FMath::Abs(ServerTimeStamp - TimeStamp) > CVarNetServerMoveTimestampExpiredWarningThreshold->GetFloat())
{
UE_LOG(LogVRCharacterMovement, Warning, TEXT("ServerMove: TimeStamp expired: %f, CurrentTimeStamp: %f, Character: %s"), TimeStamp, ServerTimeStamp, *GetNameSafe(CharacterOwner));
}
else
{
UE_LOG(LogVRCharacterMovement, Log, TEXT("ServerMove: TimeStamp expired: %f, CurrentTimeStamp: %f, Character: %s"), TimeStamp, ServerTimeStamp, *GetNameSafe(CharacterOwner));
}
return;
}
// Scope these, they nest with Outer references so it should work fine, this keeps the update rotation and move autonomous from double updating the char
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
bool bServerReadyForClient = true;
APlayerController* PC = Cast<APlayerController>(CharacterOwner->GetController());
if (PC)
{
bServerReadyForClient = PC->NotifyServerReceivedClientData(CharacterOwner, TimeStamp);
if (!bServerReadyForClient)
{
InAccel = FVector::ZeroVector;
}
}
// View components
//const uint16 ViewPitch = (View & 65535);
//const uint16 ViewYaw = ClientYaw;//(View >> 16);
const FVector Accel = InAccel;
const UWorld* MyWorld = GetWorld();
// Save move parameters.
const float DeltaTime = ServerData->GetServerMoveDeltaTime(TimeStamp, CharacterOwner->GetActorTimeDilation(*MyWorld));
ServerData->CurrentClientTimeStamp = TimeStamp;
ServerData->ServerTimeStamp = MyWorld->GetTimeSeconds();
ServerData->ServerTimeStampLastServerMove = ServerData->ServerTimeStamp;
FRotator ViewRot;
ViewRot.Pitch = FRotator::DecompressAxisFromShort(MoveReps.ClientPitch);
ViewRot.Yaw = FRotator::DecompressAxisFromShort(MoveReps.ClientYaw);
ViewRot.Roll = FRotator::DecompressAxisFromByte(MoveReps.ClientRoll);
if (PC && bUseClientControlRotation)
{
PC->SetControlRotation(ViewRot);
}
if (!bServerReadyForClient)
{
return;
}
// Perform actual movement
if ((MyWorld->GetWorldSettings()->GetPauserPlayerState() == NULL) && (DeltaTime > 0.f))
{
if (PC)
{
PC->UpdateRotation(DeltaTime);
}
if (!ConditionalReps.RequestedVelocity.IsZero())
{
RequestedVelocity = ConditionalReps.RequestedVelocity;
bHasRequestedVelocity = true;
}
CustomVRInputVector = ConditionalReps.CustomVRInputVector;
MoveActionArray = ConditionalReps.MoveActionArray;
// Set capsule location prior to testing movement
// I am overriding the replicated value here when movement is made on purpose
if (VRRootCapsule)
{
VRRootCapsule->curCameraLoc = CapsuleLoc;
VRRootCapsule->curCameraRot = FRotator(0.0f, FRotator::DecompressAxisFromShort(CapsuleYaw), 0.0f);
VRRootCapsule->DifferenceFromLastFrame = FVector(LFDiff.X, LFDiff.Y, 0.0f);
AdditionalVRInputVector = VRRootCapsule->DifferenceFromLastFrame;
if (BaseVRCharacterOwner)
{
if (BaseVRCharacterOwner->VRReplicateCapsuleHeight && LFDiff.Z > 0.0f && !FMath::IsNearlyEqual(LFDiff.Z, VRRootCapsule->GetUnscaledCapsuleHalfHeight()))
{
BaseVRCharacterOwner->SetCharacterHalfHeightVR(LFDiff.Z, false);
// BaseChar->ReplicatedCapsuleHeight.CapsuleHeight = LFDiff.Z;
//VRRootCapsule->SetCapsuleHalfHeight(LFDiff.Z, false);
}
}
VRRootCapsule->GenerateOffsetToWorld(false, false);
// #TODO: Should I actually implement the mesh translation from "Crouch"? Generally people are going to be
// IKing any mesh from the HMD instead.
/*
// Don't smooth this change in mesh position
if (bClientSimulation && CharacterOwner->Role == ROLE_SimulatedProxy)
{
FNetworkPredictionData_Client_Character* ClientData = GetPredictionData_Client_Character();
if (ClientData && ClientData->MeshTranslationOffset.Z != 0.f)
{
ClientData->MeshTranslationOffset += FVector(0.f, 0.f, MeshAdjust);
ClientData->OriginalMeshTranslationOffset = ClientData->MeshTranslationOffset;
}
}
*/
}
MoveAutonomous(TimeStamp, DeltaTime, MoveFlags, Accel);
bHasRequestedVelocity = false;
}
UE_CLOG(CharacterOwner&& UpdatedComponent, LogVRCharacterMovement, VeryVerbose, TEXT("ServerMove Time %f Acceleration %s Velocity %s Position %s Rotation %s DeltaTime %f Mode %s MovementBase %s.%s (Dynamic:%d)"),
TimeStamp, *Accel.ToString(), *Velocity.ToString(), *UpdatedComponent->GetComponentLocation().ToString(), *UpdatedComponent->GetComponentRotation().ToCompactString(), DeltaTime, *GetMovementName(),
*GetNameSafe(GetMovementBase()), *CharacterOwner->GetBasedMovement().BoneName.ToString(), MovementBaseUtility::IsDynamicBase(GetMovementBase()) ? 1 : 0);
// #TODO: Handle this better at some point? Client also denies it later on during correction (ApplyNetworkMovementMode in base movement)
// Pre handling the errors, lets avoid rolling back to/from custom movement modes, they tend to be scripted and this can screw things up
const uint8 CurrentPackedMovementMode = PackNetworkMovementMode();
if (CurrentPackedMovementMode != ClientMovementMode)
{
TEnumAsByte<EMovementMode> NetMovementMode(MOVE_None);
TEnumAsByte<EMovementMode> NetGroundMode(MOVE_None);
uint8 NetCustomMode(0);
UnpackNetworkMovementMode(ClientMovementMode, NetMovementMode, NetCustomMode, NetGroundMode);
// Custom movement modes aren't going to be rolled back as they are client authed for our pawns
if (NetMovementMode == EMovementMode::MOVE_Custom || MovementMode == EMovementMode::MOVE_Custom)
{
if(NetCustomMode == (uint8)EVRCustomMovementMode::VRMOVE_Climbing || CustomMovementMode == (uint8)EVRCustomMovementMode::VRMOVE_Climbing)
SetMovementMode(NetMovementMode, NetCustomMode);
}
}
ServerMoveHandleClientErrorVR(TimeStamp, DeltaTime, Accel, ClientLoc, ViewRot.Yaw, MoveReps.ClientMovementBase, MoveReps.ClientBaseBoneName, ClientMovementMode);
}
void UVRCharacterMovementComponent::CallServerMove
(
const class FSavedMove_Character* NewCMove,
const class FSavedMove_Character* OldCMove
)
{
// This is technically "safe", I know for sure that I am using my own FSavedMove
// I would have like to not override any of this, but I need a lot more specific information about the pawn
// So just setting flags in the FSaved Move doesn't cut it
// I could see a problem if someone overrides this override though
const FSavedMove_VRCharacter * NewMove = (const FSavedMove_VRCharacter *)NewCMove;
const FSavedMove_VRCharacter * OldMove = (const FSavedMove_VRCharacter *)OldCMove;
check(NewMove != nullptr);
//uint32 ClientYawPitchINT = 0;
//uint8 ClientRollBYTE = 0;
//NewMove->GetPackedAngles(ClientYawPitchINT, ClientRollBYTE);
const uint16 CapsuleYawShort = FRotator::CompressAxisToShort(NewMove->VRCapsuleRotation.Yaw);
const uint16 ClientYawShort = FRotator::CompressAxisToShort(NewMove->SavedControlRotation.Yaw);
// Determine if we send absolute or relative location
UPrimitiveComponent* ClientMovementBase = NewMove->EndBase.Get();
const FName ClientBaseBone = NewMove->EndBoneName;
const FVector SendLocation = MovementBaseUtility::UseRelativeLocation(ClientMovementBase) ? NewMove->SavedRelativeLocation : NewMove->SavedLocation;
// send old move if it exists
if (OldMove)
{
//const uint16 CapsuleYawShort = FRotator::CompressAxisToShort(OldMove->VRCapsuleRotation.Yaw);
ServerMoveVROld(OldMove->TimeStamp, OldMove->Acceleration, OldMove->GetCompressedFlags(), OldMove->ConditionalValues);
}
// Pass these in here, don't pass in to old move, it will receive the new move values in dual operations
// Will automatically not replicate them if movement base is nullptr (1 bit cost to check this)
FVRConditionalMoveRep2 NewMoveConds;
NewMoveConds.ClientMovementBase = ClientMovementBase;
NewMoveConds.ClientBaseBoneName = ClientBaseBone;
if (CharacterOwner && (CharacterOwner->bUseControllerRotationRoll || CharacterOwner->bUseControllerRotationPitch))
{
NewMoveConds.ClientPitch = FRotator::CompressAxisToShort(NewMove->SavedControlRotation.Pitch);
NewMoveConds.ClientRoll = FRotator::CompressAxisToByte(NewMove->SavedControlRotation.Roll);
}
NewMoveConds.ClientYaw = FRotator::CompressAxisToShort(NewMove->SavedControlRotation.Yaw);
FNetworkPredictionData_Client_Character* ClientData = GetPredictionData_Client_Character();
if (const FSavedMove_Character* const PendingMove = ClientData->PendingMove.Get())
{
// This should send same as the uint16 because it uses a packedINT send by default for shorts
//uint32 OldClientYawPitchINT = 0;
//uint8 OldClientRollBYTE = 0;
//ClientData->PendingMove->GetPackedAngles(OldClientYawPitchINT, OldClientRollBYTE);
uint32 cPitch = 0;
if (CharacterOwner && (CharacterOwner->bUseControllerRotationPitch))
cPitch = FRotator::CompressAxisToShort(ClientData->PendingMove->SavedControlRotation.Pitch);
uint32 cYaw = FRotator::CompressAxisToShort(ClientData->PendingMove->SavedControlRotation.Yaw);
// Switch the order of pitch and yaw to place Yaw in smallest value, this will cut down on rep cost since normally pitch is zero'd out in VR
uint32 OldClientYawPitchINT = (cPitch << 16) | (cYaw);
FSavedMove_VRCharacter* oldMove = (FSavedMove_VRCharacter*)ClientData->PendingMove.Get();
const uint16 OldCapsuleYawShort = FRotator::CompressAxisToShort(oldMove->VRCapsuleRotation.Yaw);
//const uint16 OldClientYawShort = FRotator::CompressAxisToShort(ClientData->PendingMove->SavedControlRotation.Yaw);
// If we delayed a move without root motion, and our new move has root motion, send these through a special function, so the server knows how to process them.
if ((PendingMove->RootMotionMontage == NULL) && (NewMove->RootMotionMontage != NULL))
{
// send two moves simultaneously
ServerMoveVRDualHybridRootMotion
(
PendingMove->TimeStamp,
PendingMove->Acceleration,
PendingMove->GetCompressedFlags(),
OldClientYawPitchINT,
oldMove->VRCapsuleLocation,
oldMove->ConditionalValues,
oldMove->LFDiff,
OldCapsuleYawShort,
NewMove->TimeStamp,
NewMove->Acceleration,
SendLocation,
NewMove->VRCapsuleLocation,
NewMove->ConditionalValues,
NewMove->LFDiff,
CapsuleYawShort,
NewMove->GetCompressedFlags(),
NewMoveConds,
NewMove->EndPackedMovementMode
);
}
else // Not Hybrid root motion rpc
{
// send two moves simultaneously
if (oldMove->Acceleration.IsZero() && NewMove->Acceleration.IsZero())
{
ServerMoveVRDualExLight
(
PendingMove->TimeStamp,
PendingMove->GetCompressedFlags(),
OldClientYawPitchINT,
oldMove->VRCapsuleLocation,
oldMove->ConditionalValues,
oldMove->LFDiff,
OldCapsuleYawShort,
NewMove->TimeStamp,
SendLocation,
NewMove->VRCapsuleLocation,
NewMove->ConditionalValues,
NewMove->LFDiff,
CapsuleYawShort,
NewMove->GetCompressedFlags(),
NewMoveConds,
NewMove->EndPackedMovementMode
);
}
else
{
ServerMoveVRDual
(
PendingMove->TimeStamp,
PendingMove->Acceleration,
PendingMove->GetCompressedFlags(),
OldClientYawPitchINT,
oldMove->VRCapsuleLocation,
oldMove->ConditionalValues,
oldMove->LFDiff,
OldCapsuleYawShort,
NewMove->TimeStamp,
NewMove->Acceleration,
SendLocation,
NewMove->VRCapsuleLocation,
NewMove->ConditionalValues,
NewMove->LFDiff,
CapsuleYawShort,
NewMove->GetCompressedFlags(),
NewMoveConds,
NewMove->EndPackedMovementMode
);
}
}
}
else
{
if (NewMove->Acceleration.IsZero())
{
ServerMoveVRExLight
(
NewMove->TimeStamp,
SendLocation,
NewMove->VRCapsuleLocation,
NewMove->ConditionalValues,
NewMove->LFDiff,
CapsuleYawShort,
NewMove->GetCompressedFlags(),
NewMoveConds,
NewMove->EndPackedMovementMode
);
}
else
{
ServerMoveVR
(
NewMove->TimeStamp,
NewMove->Acceleration,
SendLocation,
NewMove->VRCapsuleLocation,
NewMove->ConditionalValues,
NewMove->LFDiff,
CapsuleYawShort,
NewMove->GetCompressedFlags(),
NewMoveConds,
NewMove->EndPackedMovementMode
);
}
}
MarkForClientCameraUpdate();
}
void UVRCharacterMovementComponent::ServerMoveVROld(float OldTimeStamp, FVector_NetQuantize10 OldAccel, uint8 OldMoveFlags, FVRConditionalMoveRep ConditionalReps)
{
((AVRCharacter*)CharacterOwner)->ServerMoveVROld(OldTimeStamp, OldAccel, OldMoveFlags,ConditionalReps);
}
void UVRCharacterMovementComponent::ServerMoveVR(float TimeStamp, FVector_NetQuantize10 InAccel, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 CompressedMoveFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
((AVRCharacter*)CharacterOwner)->ServerMoveVR(TimeStamp, InAccel, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, CompressedMoveFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRExLight(float TimeStamp, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 CompressedMoveFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
((AVRCharacter*)CharacterOwner)->ServerMoveVRExLight(TimeStamp, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, CompressedMoveFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRDual(float TimeStamp0, FVector_NetQuantize10 InAccel0, uint8 PendingFlags, uint32 View0, FVector_NetQuantize100 OldCapsuleLoc, FVRConditionalMoveRep OldConditionalReps, FVector_NetQuantize100 OldLFDiff, uint16 OldCapsuleYaw, float TimeStamp, FVector_NetQuantize10 InAccel, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 NewFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
((AVRCharacter*)CharacterOwner)->ServerMoveVRDual(TimeStamp0, InAccel0, PendingFlags, View0, OldCapsuleLoc, OldConditionalReps, OldLFDiff, OldCapsuleYaw, TimeStamp, InAccel, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, NewFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRDualExLight(float TimeStamp0, uint8 PendingFlags, uint32 View0, FVector_NetQuantize100 OldCapsuleLoc, FVRConditionalMoveRep OldConditionalReps, FVector_NetQuantize100 OldLFDiff, uint16 OldCapsuleYaw, float TimeStamp, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 NewFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
((AVRCharacter*)CharacterOwner)->ServerMoveVRDualExLight(TimeStamp0, PendingFlags, View0, OldCapsuleLoc, OldConditionalReps, OldLFDiff, OldCapsuleYaw, TimeStamp, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, NewFlags, MoveReps, ClientMovementMode);
}
void UVRCharacterMovementComponent::ServerMoveVRDualHybridRootMotion(float TimeStamp0, FVector_NetQuantize10 InAccel0, uint8 PendingFlags, uint32 View0, FVector_NetQuantize100 OldCapsuleLoc, FVRConditionalMoveRep OldConditionalReps, FVector_NetQuantize100 OldLFDiff, uint16 OldCapsuleYaw, float TimeStamp, FVector_NetQuantize10 InAccel, FVector_NetQuantize100 ClientLoc, FVector_NetQuantize100 CapsuleLoc, FVRConditionalMoveRep ConditionalReps, FVector_NetQuantize100 LFDiff, uint16 CapsuleYaw, uint8 NewFlags, FVRConditionalMoveRep2 MoveReps, uint8 ClientMovementMode)
{
((AVRCharacter*)CharacterOwner)->ServerMoveVRDualHybridRootMotion(TimeStamp0, InAccel0, PendingFlags, View0, OldCapsuleLoc, OldConditionalReps, OldLFDiff, OldCapsuleYaw, TimeStamp, InAccel, ClientLoc, CapsuleLoc, ConditionalReps, LFDiff, CapsuleYaw, NewFlags, MoveReps, ClientMovementMode);
}
bool UVRCharacterMovementComponent::ShouldCheckForValidLandingSpot(float DeltaTime, const FVector& Delta, const FHitResult& Hit) const
{
// See if we hit an edge of a surface on the lower portion of the capsule.
// In this case the normal will not equal the impact normal, and a downward sweep may find a walkable surface on top of the edge.
if (Hit.Normal.Z > KINDA_SMALL_NUMBER && !Hit.Normal.Equals(Hit.ImpactNormal))
{
FVector PawnLocation = UpdatedComponent->GetComponentLocation();
if (VRRootCapsule)
PawnLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
if (IsWithinEdgeTolerance(PawnLocation, Hit.ImpactPoint, CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleRadius()))
{
return true;
}
}
return false;
}
void UVRCharacterMovementComponent::PhysWalking(float deltaTime, int32 Iterations)
{
SCOPE_CYCLE_COUNTER(STAT_CharPhysWalking);
if (deltaTime < MIN_TICK_TIME)
{
return;
}
if (!CharacterOwner || (!CharacterOwner->Controller && !bRunPhysicsWithNoController && !HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity() && (CharacterOwner->GetLocalRole() != ROLE_SimulatedProxy)))
{
Acceleration = FVector::ZeroVector;
Velocity = FVector::ZeroVector;
return;
}
if (!UpdatedComponent->IsQueryCollisionEnabled())
{
SetMovementMode(MOVE_Walking);
return;
}
devCode(ensureMsgf(!Velocity.ContainsNaN(), TEXT("PhysWalking: Velocity contains NaN before Iteration (%s)\n%s"), *GetPathNameSafe(this), *Velocity.ToString()));
bJustTeleported = false;
bool bCheckedFall = false;
bool bTriedLedgeMove = false;
float remainingTime = deltaTime;
// Rewind the players position by the new capsule location
RewindVRRelativeMovement();
// Perform the move
while ((remainingTime >= MIN_TICK_TIME) && (Iterations < MaxSimulationIterations) && CharacterOwner && (CharacterOwner->Controller || bRunPhysicsWithNoController || HasAnimRootMotion() || CurrentRootMotion.HasOverrideVelocity() || (CharacterOwner->GetLocalRole() == ROLE_SimulatedProxy)))
{
Iterations++;
bJustTeleported = false;
const float timeTick = GetSimulationTimeStep(remainingTime, Iterations);
remainingTime -= timeTick;
// Save current values
UPrimitiveComponent * const OldBase = GetMovementBase();
const FVector PreviousBaseLocation = (OldBase != NULL) ? OldBase->GetComponentLocation() : FVector::ZeroVector;
const FVector OldLocation = UpdatedComponent->GetComponentLocation();
// Used for ledge check
FVector OldCapsuleLocation = VRRootCapsule ? VRRootCapsule->OffsetComponentToWorld.GetLocation() : OldLocation;
const FFindFloorResult OldFloor = CurrentFloor;
RestorePreAdditiveRootMotionVelocity();
//RestorePreAdditiveVRMotionVelocity();
// Ensure velocity is horizontal.
MaintainHorizontalGroundVelocity();
const FVector OldVelocity = Velocity;
Acceleration.Z = 0.f;
// Apply acceleration
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
CalcVelocity(timeTick, GroundFriction, false, GetMaxBrakingDeceleration());
devCode(ensureMsgf(!Velocity.ContainsNaN(), TEXT("PhysWalking: Velocity contains NaN after CalcVelocity (%s)\n%s"), *GetPathNameSafe(this), *Velocity.ToString()));
}
ApplyRootMotionToVelocity(timeTick);
ApplyVRMotionToVelocity(deltaTime);//timeTick);
devCode(ensureMsgf(!Velocity.ContainsNaN(), TEXT("PhysWalking: Velocity contains NaN after Root Motion application (%s)\n%s"), *GetPathNameSafe(this), *Velocity.ToString()));
if (IsFalling())
{
// Root motion could have put us into Falling.
// No movement has taken place this movement tick so we pass on full time/past iteration count
StartNewPhysics(remainingTime + timeTick, Iterations - 1);
return;
}
// Compute move parameters
const FVector MoveVelocity = Velocity;
const FVector Delta = timeTick * MoveVelocity;
const bool bZeroDelta = Delta.IsNearlyZero();
FStepDownResult StepDownResult;
if (bZeroDelta)
{
remainingTime = 0.f;
// TODO: Bugged currently
/*if (VRRootCapsule && VRRootCapsule->bUseWalkingCollisionOverride)
{
FHitResult HitRes;
FCollisionQueryParams Params("RelativeMovementSweep", false, GetOwner());
FCollisionResponseParams ResponseParam;
VRRootCapsule->InitSweepCollisionParams(Params, ResponseParam);
Params.bFindInitialOverlaps = true;
bool bWasBlockingHit = false;
bWasBlockingHit = GetWorld()->SweepSingleByChannel(HitRes, VRRootCapsule->OffsetComponentToWorld.GetLocation(), VRRootCapsule->OffsetComponentToWorld.GetLocation() + VRRootCapsule->DifferenceFromLastFrame, FQuat(0.0f, 0.0f, 0.0f, 1.0f), VRRootCapsule->GetCollisionObjectType(), VRRootCapsule->GetCollisionShape(), Params, ResponseParam);
const FVector GravDir(0.f, 0.f, -1.f);
if (CanStepUp(HitRes) || (CharacterOwner->GetMovementBase() != NULL && CharacterOwner->GetMovementBase()->GetOwner() == HitRes.GetActor()))
StepUp(GravDir,VRRootCapsule->DifferenceFromLastFrame.GetSafeNormal2D(), HitRes, &StepDownResult);
}*/
}
else
{
// try to move forward
MoveAlongFloor(MoveVelocity, timeTick, &StepDownResult);
if (IsFalling())
{
// pawn decided to jump up
const float DesiredDist = Delta.Size();
if (DesiredDist > KINDA_SMALL_NUMBER)
{
const float ActualDist = (UpdatedComponent->GetComponentLocation() - OldLocation).Size2D();
remainingTime += timeTick * (1.f - FMath::Min(1.f, ActualDist / DesiredDist));
}
RestorePreAdditiveVRMotionVelocity();
StartNewPhysics(remainingTime, Iterations);
return;
}
else if (IsSwimming()) //just entered water
{
RestorePreAdditiveVRMotionVelocity();
StartSwimmingVR(OldCapsuleLocation, OldVelocity, timeTick, remainingTime, Iterations);
return;
}
}
// Update floor.
// StepUp might have already done it for us.
if (StepDownResult.bComputedFloor)
{
CurrentFloor = StepDownResult.FloorResult;
}
else
{
FindFloor(UpdatedComponent->GetComponentLocation(), CurrentFloor, bZeroDelta, NULL);
}
// check for ledges here
const bool bCheckLedges = !CanWalkOffLedges();
if (bCheckLedges && !CurrentFloor.IsWalkableFloor())
{
// calculate possible alternate movement
const FVector GravDir = FVector(0.f, 0.f, -1.f);
const FVector NewDelta = bTriedLedgeMove ? FVector::ZeroVector : GetLedgeMove(OldCapsuleLocation, Delta, GravDir);
if (!NewDelta.IsZero())
{
// first revert this move
RevertMove(OldLocation, OldBase, PreviousBaseLocation, OldFloor, false);
// avoid repeated ledge moves if the first one fails
bTriedLedgeMove = true;
// Try new movement direction
Velocity = NewDelta / timeTick;
remainingTime += timeTick;
RestorePreAdditiveVRMotionVelocity();
continue;
}
else
{
// see if it is OK to jump
// @todo collision : only thing that can be problem is that oldbase has world collision on
bool bMustJump = bZeroDelta || (OldBase == NULL || (!OldBase->IsQueryCollisionEnabled() && MovementBaseUtility::IsDynamicBase(OldBase)));
if ((bMustJump || !bCheckedFall) && CheckFall(OldFloor, CurrentFloor.HitResult, Delta, OldLocation, remainingTime, timeTick, Iterations, bMustJump))
{
RestorePreAdditiveVRMotionVelocity();
return;
}
bCheckedFall = true;
// revert this move
RevertMove(OldLocation, OldBase, PreviousBaseLocation, OldFloor, true);
remainingTime = 0.f;
RestorePreAdditiveVRMotionVelocity();
break;
}
}
else
{
// Validate the floor check
if (CurrentFloor.IsWalkableFloor())
{
if (ShouldCatchAir(OldFloor, CurrentFloor))
{
RestorePreAdditiveVRMotionVelocity();
HandleWalkingOffLedge(OldFloor.HitResult.ImpactNormal, OldFloor.HitResult.Normal, OldLocation, timeTick);
if (IsMovingOnGround())
{
// If still walking, then fall. If not, assume the user set a different mode they want to keep.
StartFalling(Iterations, remainingTime, timeTick, Delta, OldLocation);
}
return;
}
AdjustFloorHeight();
SetBase(CurrentFloor.HitResult.Component.Get(), CurrentFloor.HitResult.BoneName);
}
else if (CurrentFloor.HitResult.bStartPenetrating && remainingTime <= 0.f)
{
// The floor check failed because it started in penetration
// We do not want to try to move downward because the downward sweep failed, rather we'd like to try to pop out of the floor.
FHitResult Hit(CurrentFloor.HitResult);
Hit.TraceEnd = Hit.TraceStart + FVector(0.f, 0.f, MAX_FLOOR_DIST);
const FVector RequestedAdjustment = GetPenetrationAdjustment(Hit);
ResolvePenetration(RequestedAdjustment, Hit, UpdatedComponent->GetComponentQuat());
bForceNextFloorCheck = true;
}
// check if just entered water
if (IsSwimming())
{
RestorePreAdditiveVRMotionVelocity();
StartSwimmingVR(OldCapsuleLocation, Velocity, timeTick, remainingTime, Iterations);
return;
}
// See if we need to start falling.
if (!CurrentFloor.IsWalkableFloor() && !CurrentFloor.HitResult.bStartPenetrating)
{
const bool bMustJump = bJustTeleported || bZeroDelta || (OldBase == NULL || (!OldBase->IsQueryCollisionEnabled() && MovementBaseUtility::IsDynamicBase(OldBase)));
if ((bMustJump || !bCheckedFall) && CheckFall(OldFloor, CurrentFloor.HitResult, Delta, OldLocation, remainingTime, timeTick, Iterations, bMustJump))
{
RestorePreAdditiveVRMotionVelocity();
return;
}
bCheckedFall = true;
}
}
// Allow overlap events and such to change physics state and velocity
if (IsMovingOnGround())
{
// Make velocity reflect actual move
if (!bJustTeleported && timeTick >= MIN_TICK_TIME)
{
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
// TODO-RootMotionSource: Allow this to happen during partial override Velocity, but only set allowed axes?
Velocity = ((UpdatedComponent->GetComponentLocation() - OldLocation) / timeTick);
}
RestorePreAdditiveVRMotionVelocity();
}
}
// If we didn't move at all this iteration then abort (since future iterations will also be stuck).
if (UpdatedComponent->GetComponentLocation() == OldLocation)
{
RestorePreAdditiveVRMotionVelocity();
remainingTime = 0.f;
break;
}
}
if (IsMovingOnGround())
{
MaintainHorizontalGroundVelocity();
}
}
void UVRCharacterMovementComponent::CapsuleTouched(UPrimitiveComponent* OverlappedComp, AActor* Other, UPrimitiveComponent* OtherComp, int32 OtherBodyIndex, bool bFromSweep, const FHitResult& SweepResult)
{
if (!bEnablePhysicsInteraction)
{
return;
}
if (OtherComp != NULL && OtherComp->IsAnySimulatingPhysics())
{
/*const*/FVector OtherLoc = OtherComp->GetComponentLocation();
if (UVRRootComponent * rCap = Cast<UVRRootComponent>(OtherComp))
{
OtherLoc = rCap->OffsetComponentToWorld.GetLocation();
}
const FVector Loc = VRRootCapsule->OffsetComponentToWorld.GetLocation();//UpdatedComponent->GetComponentLocation();
FVector ImpulseDir = FVector(OtherLoc.X - Loc.X, OtherLoc.Y - Loc.Y, 0.25f).GetSafeNormal();
ImpulseDir = (ImpulseDir + Velocity.GetSafeNormal2D()) * 0.5f;
ImpulseDir.Normalize();
FName BoneName = NAME_None;
if (OtherBodyIndex != INDEX_NONE)
{
BoneName = ((USkinnedMeshComponent*)OtherComp)->GetBoneName(OtherBodyIndex);
}
float TouchForceFactorModified = TouchForceFactor;
if (bTouchForceScaledToMass)
{
FBodyInstance* BI = OtherComp->GetBodyInstance(BoneName);
TouchForceFactorModified *= BI ? BI->GetBodyMass() : 1.0f;
}
float ImpulseStrength = FMath::Clamp(Velocity.Size2D() * TouchForceFactorModified,
MinTouchForce > 0.0f ? MinTouchForce : -FLT_MAX,
MaxTouchForce > 0.0f ? MaxTouchForce : FLT_MAX);
FVector Impulse = ImpulseDir * ImpulseStrength;
OtherComp->AddImpulse(Impulse, BoneName);
}
}
void UVRCharacterMovementComponent::ReplicateMoveToServer(float DeltaTime, const FVector& NewAcceleration)
{
SCOPE_CYCLE_COUNTER(STAT_CharacterMovementReplicateMoveToServer);
check(CharacterOwner != NULL);
// Can only start sending moves if our controllers are synced up over the network, otherwise we flood the reliable buffer.
APlayerController* PC = Cast<APlayerController>(CharacterOwner->GetController());
if (PC && PC->AcknowledgedPawn != CharacterOwner)
{
return;
}
// Bail out if our character's controller doesn't have a Player. This may be the case when the local player
// has switched to another controller, such as a debug camera controller.
if (PC && PC->Player == nullptr)
{
return;
}
FNetworkPredictionData_Client_Character* ClientData = GetPredictionData_Client_Character();
if (!ClientData)
{
return;
}
// Update our delta time for physics simulation.
DeltaTime = ClientData->UpdateTimeStampAndDeltaTime(DeltaTime, *CharacterOwner, *this);
// Find the oldest (unacknowledged) important move (OldMove).
// Don't include the last move because it may be combined with the next new move.
// A saved move is interesting if it differs significantly from the last acknowledged move
FSavedMovePtr OldMove = NULL;
if (ClientData->LastAckedMove.IsValid())
{
for (int32 i = 0; i < ClientData->SavedMoves.Num() - 1; i++)
{
const FSavedMovePtr& CurrentMove = ClientData->SavedMoves[i];
if (CurrentMove->IsImportantMove(ClientData->LastAckedMove))
{
OldMove = CurrentMove;
break;
}
}
}
// Get a SavedMove object to store the movement in.
FSavedMovePtr NewMovePtr = ClientData->CreateSavedMove();
FSavedMove_Character* const NewMove = NewMovePtr.Get();
if (NewMove == nullptr)
{
return;
}
NewMove->SetMoveFor(CharacterOwner, DeltaTime, NewAcceleration, *ClientData);
const UWorld* MyWorld = GetWorld();
// Causing really bad crash when using vr offset location, rather remove for now than have it merge move improperly.
// see if the two moves could be combined
// do not combine moves which have different TimeStamps (before and after reset).
if (const FSavedMove_Character* PendingMove = ClientData->PendingMove.Get())
{
if (bAllowMovementMerging && PendingMove->CanCombineWith(NewMovePtr, CharacterOwner, ClientData->MaxMoveDeltaTime * CharacterOwner->GetActorTimeDilation(*MyWorld)))
{
QUICK_SCOPE_CYCLE_COUNTER(STAT_VRCharacterMovementComponent_CombineNetMove);
//SCOPE_CYCLE_COUNTER(STAT_CharacterMovementCombineNetMove);
// Only combine and move back to the start location if we don't move back in to a spot that would make us collide with something new.
/*const */FVector OldStartLocation = PendingMove->GetRevertedLocation();
// Modifying the location to account for capsule loc
FVector OverlapLocation = OldStartLocation;
if (VRRootCapsule)
OverlapLocation += VRRootCapsule->OffsetComponentToWorld.GetLocation() - VRRootCapsule->GetComponentLocation();
const bool bAttachedToObject = (NewMovePtr->StartAttachParent != nullptr);
if (bAttachedToObject || !OverlapTest(OverlapLocation, PendingMove->StartRotation.Quaternion(), UpdatedComponent->GetCollisionObjectType(), GetPawnCapsuleCollisionShape(SHRINK_None), CharacterOwner))
{
// Avoid updating Mesh bones to physics during the teleport back, since PerformMovement() will update it right away anyway below.
// Note: this must be before the FScopedMovementUpdate below, since that scope is what actually moves the character and mesh.
//AVRBaseCharacter * BaseCharacter = Cast<AVRBaseCharacter>(CharacterOwner);
FScopedMeshBoneUpdateOverrideVR ScopedNoMeshBoneUpdate(CharacterOwner->GetMesh(), EKinematicBonesUpdateToPhysics::SkipAllBones);
// Accumulate multiple transform updates until scope ends.
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, EScopedUpdate::DeferredUpdates);
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("CombineMove: add delta %f + %f and revert from %f %f to %f %f"), DeltaTime, ClientData->PendingMove->DeltaTime, UpdatedComponent->GetComponentLocation().X, UpdatedComponent->GetComponentLocation().Y, /*OldStartLocation.X*/OverlapLocation.X, /*OldStartLocation.Y*/OverlapLocation.Y);
NewMove->CombineWith(PendingMove, CharacterOwner, PC, OldStartLocation);
/************************/
if (PC)
{
// We reverted position to that at the start of the pending move (above), however some code paths expect rotation to be set correctly
// before character movement occurs (via FaceRotation), so try that now. The bOrientRotationToMovement path happens later as part of PerformMovement() and PhysicsRotation().
CharacterOwner->FaceRotation(PC->GetControlRotation(), NewMove->DeltaTime);
}
SaveBaseLocation();
NewMove->SetInitialPosition(CharacterOwner);
// Remove pending move from move list. It would have to be the last move on the list.
if (ClientData->SavedMoves.Num() > 0 && ClientData->SavedMoves.Last() == ClientData->PendingMove)
{
const bool bAllowShrinking = false;
ClientData->SavedMoves.Pop(bAllowShrinking);
}
ClientData->FreeMove(ClientData->PendingMove);
ClientData->PendingMove = nullptr;
PendingMove = nullptr; // Avoid dangling reference, it's deleted above.
}
else
{
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Not combining move [would collide at start location]"));
}
}
/*else
{
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Not combining move [not allowed by CanCombineWith()]"));
}*/
}
// Acceleration should match what we send to the server, plus any other restrictions the server also enforces (see MoveAutonomous).
Acceleration = NewMove->Acceleration.GetClampedToMaxSize(GetMaxAcceleration());
AnalogInputModifier = ComputeAnalogInputModifier(); // recompute since acceleration may have changed.
// Perform the move locally
CharacterOwner->ClientRootMotionParams.Clear();
CharacterOwner->SavedRootMotion.Clear();
PerformMovement(NewMove->DeltaTime);
NewMove->PostUpdate(CharacterOwner, FSavedMove_Character::PostUpdate_Record);
// Add NewMove to the list
if (CharacterOwner->IsReplicatingMovement())
{
check(NewMove == NewMovePtr.Get());
ClientData->SavedMoves.Push(NewMovePtr);
static const auto CVarNetEnableMoveCombining = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetEnableMoveCombining"));
const bool bCanDelayMove = (CVarNetEnableMoveCombining->GetInt() != 0) && CanDelaySendingMove(NewMovePtr);
if (bCanDelayMove && ClientData->PendingMove.IsValid() == false)
{
// Decide whether to hold off on move
// Decide whether to hold off on move
const float NetMoveDelta = FMath::Clamp(GetClientNetSendDeltaTime(PC, ClientData, NewMovePtr), 1.f / 120.f, 1.f / 5.f);
if ((MyWorld->TimeSeconds - ClientData->ClientUpdateTime) * MyWorld->GetWorldSettings()->GetEffectiveTimeDilation() < NetMoveDelta)
{
// Delay sending this move.
ClientData->PendingMove = NewMovePtr;
return;
}
}
ClientData->ClientUpdateTime = MyWorld->TimeSeconds;
UE_CLOG(CharacterOwner&& UpdatedComponent, LogVRCharacterMovement, VeryVerbose, TEXT("ClientMove Time %f Acceleration %s Velocity %s Position %s Rotation %s DeltaTime %f Mode %s MovementBase %s.%s (Dynamic:%d) DualMove? %d"),
NewMove->TimeStamp, *NewMove->Acceleration.ToString(), *Velocity.ToString(), *UpdatedComponent->GetComponentLocation().ToString(), *UpdatedComponent->GetComponentRotation().ToCompactString(), NewMove->DeltaTime, *GetMovementName(),
*GetNameSafe(NewMove->EndBase.Get()), *NewMove->EndBoneName.ToString(), MovementBaseUtility::IsDynamicBase(NewMove->EndBase.Get()) ? 1 : 0, ClientData->PendingMove.IsValid() ? 1 : 0);
bool bSendServerMove = true;
#if !(UE_BUILD_SHIPPING || UE_BUILD_TEST)
// Testing options: Simulated packet loss to server
const float TimeSinceLossStart = (MyWorld->RealTimeSeconds - ClientData->DebugForcedPacketLossTimerStart);
static const auto CVarNetForceClientServerMoveLossDuration = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetForceClientServerMoveLossDuration"));
static const auto CVarNetForceClientServerMoveLossPercent = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetForceClientServerMoveLossPercent"));
if (ClientData->DebugForcedPacketLossTimerStart > 0.f && (TimeSinceLossStart < CVarNetForceClientServerMoveLossDuration->GetFloat()))
{
bSendServerMove = false;
UE_LOG(LogVRCharacterMovement, Log, TEXT("Drop ServerMove, %.2f time remains"), CVarNetForceClientServerMoveLossDuration->GetFloat() - TimeSinceLossStart);
}
else if (CVarNetForceClientServerMoveLossPercent->GetFloat() != 0.f && (RandomStream.FRand() < CVarNetForceClientServerMoveLossPercent->GetFloat()))
{
bSendServerMove = false;
ClientData->DebugForcedPacketLossTimerStart = (CVarNetForceClientServerMoveLossDuration->GetFloat() > 0) ? MyWorld->RealTimeSeconds : 0.0f;
UE_LOG(LogVRCharacterMovement, Log, TEXT("Drop ServerMove, %.2f time remains"), CVarNetForceClientServerMoveLossDuration->GetFloat());
}
else
{
ClientData->DebugForcedPacketLossTimerStart = 0.f;
}
#endif
// Send move to server if this character is replicating movement
if (bSendServerMove)
{
SCOPE_CYCLE_COUNTER(STAT_CharacterMovementCallServerMove);
CallServerMove(NewMove, OldMove.Get());
}
}
ClientData->PendingMove = NULL;
}
/*
*
*
* END TEST AREA
*
*
*/
UVRCharacterMovementComponent::UVRCharacterMovementComponent(const FObjectInitializer& ObjectInitializer)
: Super(ObjectInitializer)
{
PostPhysicsTickFunction.bCanEverTick = true;
PostPhysicsTickFunction.bStartWithTickEnabled = false;
PrimaryComponentTick.TickGroup = TG_PrePhysics;
VRRootCapsule = NULL;
//VRCameraCollider = NULL;
// 0.1f is low slide and still impacts surfaces well
// This variable is a bit of a hack, it reduces the movement of the pawn in the direction of relative movement
//WallRepulsionMultiplier = 0.01f;
bUseClientControlRotation = false;
bAllowMovementMerging = true;
bRequestedMoveUseAcceleration = false;
}
void UVRCharacterMovementComponent::TickComponent(float DeltaTime, enum ELevelTick TickType, FActorComponentTickFunction *ThisTickFunction)
{
if (!HasValidData())
{
return;
}
if (CharacterOwner && CharacterOwner->IsLocallyControlled())
{
// Root capsule is now throwing out the difference itself, I use the difference for multiplayer sends
if (VRRootCapsule)
{
AdditionalVRInputVector = VRRootCapsule->DifferenceFromLastFrame;
}
else
{
AdditionalVRInputVector = FVector::ZeroVector;
}
}
Super::TickComponent(DeltaTime, TickType, ThisTickFunction);
}
// No support for crouching code yet
bool UVRCharacterMovementComponent::CanCrouch()
{
return false;
}
void UVRCharacterMovementComponent::ApplyRepulsionForce(float DeltaSeconds)
{
if (UpdatedPrimitive && RepulsionForce > 0.0f && CharacterOwner != nullptr)
{
const TArray<FOverlapInfo>& Overlaps = UpdatedPrimitive->GetOverlapInfos();
if (Overlaps.Num() > 0)
{
FCollisionQueryParams QueryParams;
QueryParams.bReturnFaceIndex = false;
QueryParams.bReturnPhysicalMaterial = false;
float CapsuleRadius = 0.f;
float CapsuleHalfHeight = 0.f;
CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleSize(CapsuleRadius, CapsuleHalfHeight);
const float RepulsionForceRadius = CapsuleRadius * 1.2f;
const float StopBodyDistance = 2.5f;
FVector MyLocation;
if (VRRootCapsule)
MyLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
else
MyLocation = UpdatedPrimitive->GetComponentLocation();
for (int32 i = 0; i < Overlaps.Num(); i++)
{
const FOverlapInfo& Overlap = Overlaps[i];
UPrimitiveComponent* OverlapComp = Overlap.OverlapInfo.Component.Get();
if (!OverlapComp || OverlapComp->Mobility < EComponentMobility::Movable)
{
continue;
}
// Use the body instead of the component for cases where we have multi-body overlaps enabled
FBodyInstance* OverlapBody = nullptr;
const int32 OverlapBodyIndex = Overlap.GetBodyIndex();
const USkeletalMeshComponent* SkelMeshForBody = (OverlapBodyIndex != INDEX_NONE) ? Cast<USkeletalMeshComponent>(OverlapComp) : nullptr;
if (SkelMeshForBody != nullptr)
{
OverlapBody = SkelMeshForBody->Bodies.IsValidIndex(OverlapBodyIndex) ? SkelMeshForBody->Bodies[OverlapBodyIndex] : nullptr;
}
else
{
OverlapBody = OverlapComp->GetBodyInstance();
}
if (!OverlapBody)
{
UE_LOG(LogVRCharacterMovement, Warning, TEXT("%s could not find overlap body for body index %d"), *GetName(), OverlapBodyIndex);
continue;
}
if (!OverlapBody->IsInstanceSimulatingPhysics())
{
continue;
}
FTransform BodyTransform = OverlapBody->GetUnrealWorldTransform();
FVector BodyVelocity = OverlapBody->GetUnrealWorldVelocity();
FVector BodyLocation = BodyTransform.GetLocation();
// Trace to get the hit location on the capsule
FHitResult Hit;
bool bHasHit = UpdatedPrimitive->LineTraceComponent(Hit, BodyLocation,
FVector(MyLocation.X, MyLocation.Y, BodyLocation.Z),
QueryParams);
FVector HitLoc = Hit.ImpactPoint;
bool bIsPenetrating = Hit.bStartPenetrating || Hit.PenetrationDepth > StopBodyDistance;
// If we didn't hit the capsule, we're inside the capsule
if (!bHasHit)
{
HitLoc = BodyLocation;
bIsPenetrating = true;
}
const float DistanceNow = (HitLoc - BodyLocation).SizeSquared2D();
const float DistanceLater = (HitLoc - (BodyLocation + BodyVelocity * DeltaSeconds)).SizeSquared2D();
if (bHasHit && DistanceNow < StopBodyDistance && !bIsPenetrating)
{
OverlapBody->SetLinearVelocity(FVector(0.0f, 0.0f, 0.0f), false);
}
else if (DistanceLater <= DistanceNow || bIsPenetrating)
{
FVector ForceCenter = MyLocation;
if (bHasHit)
{
ForceCenter.Z = HitLoc.Z;
}
else
{
ForceCenter.Z = FMath::Clamp(BodyLocation.Z, MyLocation.Z - CapsuleHalfHeight, MyLocation.Z + CapsuleHalfHeight);
}
OverlapBody->AddRadialForceToBody(ForceCenter, RepulsionForceRadius, RepulsionForce * Mass, ERadialImpulseFalloff::RIF_Constant);
}
}
}
}
}
void UVRCharacterMovementComponent::SetUpdatedComponent(USceneComponent* NewUpdatedComponent)
{
Super::SetUpdatedComponent(NewUpdatedComponent);
if (UpdatedComponent)
{
// Fill the VRRootCapsule if we can
VRRootCapsule = Cast<UVRRootComponent>(UpdatedComponent);
// Fill in the camera collider if we can
/*if (AVRCharacter * vrOwner = Cast<AVRCharacter>(this->GetOwner()))
{
VRCameraCollider = vrOwner->VRCameraCollider;
}*/
// Stop the tick forcing
UpdatedComponent->PrimaryComponentTick.RemovePrerequisite(this, PrimaryComponentTick);
// Start forcing the root to tick before this, the actor tick will still tick after the movement component
// We want the root component to tick first because it is setting its offset location based off of tick
this->PrimaryComponentTick.AddPrerequisite(UpdatedComponent, UpdatedComponent->PrimaryComponentTick);
}
}
FORCEINLINE_DEBUGGABLE bool UVRCharacterMovementComponent::SafeMoveUpdatedComponent(const FVector& Delta, const FRotator& NewRotation, bool bSweep, FHitResult& OutHit, ETeleportType Teleport)
{
return SafeMoveUpdatedComponent(Delta, NewRotation.Quaternion(), bSweep, OutHit, Teleport);
}
bool UVRCharacterMovementComponent::SafeMoveUpdatedComponent(const FVector& Delta, const FQuat& NewRotation, bool bSweep, FHitResult& OutHit, ETeleportType Teleport)
{
if (UpdatedComponent == NULL)
{
OutHit.Reset(1.f);
return false;
}
bool bMoveResult = MoveUpdatedComponent(Delta, NewRotation, bSweep, &OutHit, Teleport);
// Handle initial penetrations
if (OutHit.bStartPenetrating && UpdatedComponent)
{
const FVector RequestedAdjustment = GetPenetrationAdjustment(OutHit);
if (ResolvePenetration(RequestedAdjustment, OutHit, NewRotation))
{
FHitResult TempHit;
// Retry original move
bMoveResult = MoveUpdatedComponent(Delta, NewRotation, bSweep, &TempHit, Teleport);
// Remove start penetrating if this is a clean move, otherwise use the last moves hit as the result so step up actually attempts to work.
if (TempHit.bStartPenetrating)
OutHit = TempHit;
else
OutHit.bStartPenetrating = TempHit.bStartPenetrating;
}
}
return bMoveResult;
}
void UVRCharacterMovementComponent::MoveAlongFloor(const FVector& InVelocity, float DeltaSeconds, FStepDownResult* OutStepDownResult)
{
if (!CurrentFloor.IsWalkableFloor())
{
return;
}
// Move along the current floor
const FVector Delta = FVector(InVelocity.X, InVelocity.Y, 0.f) * DeltaSeconds;
FHitResult Hit(1.f);
FVector RampVector = ComputeGroundMovementDelta(Delta, CurrentFloor.HitResult, CurrentFloor.bLineTrace);
SafeMoveUpdatedComponent(RampVector, UpdatedComponent->GetComponentQuat(), true, Hit);
float LastMoveTimeSlice = DeltaSeconds;
if (Hit.bStartPenetrating)
{
// Allow this hit to be used as an impact we can deflect off, otherwise we do nothing the rest of the update and appear to hitch.
HandleImpact(Hit);
SlideAlongSurface(Delta, 1.f, Hit.Normal, Hit, true);
if (Hit.bStartPenetrating)
{
OnCharacterStuckInGeometry(&Hit);
}
}
else if (Hit.IsValidBlockingHit())
{
// We impacted something (most likely another ramp, but possibly a barrier).
float PercentTimeApplied = Hit.Time;
if ((Hit.Time > 0.f) && (Hit.Normal.Z > KINDA_SMALL_NUMBER) && IsWalkable(Hit))
{
// Another walkable ramp.
const float InitialPercentRemaining = 1.f - PercentTimeApplied;
RampVector = ComputeGroundMovementDelta(Delta * InitialPercentRemaining, Hit, false);
LastMoveTimeSlice = InitialPercentRemaining * LastMoveTimeSlice;
SafeMoveUpdatedComponent(RampVector, UpdatedComponent->GetComponentQuat(), true, Hit);
const float SecondHitPercent = Hit.Time * InitialPercentRemaining;
PercentTimeApplied = FMath::Clamp(PercentTimeApplied + SecondHitPercent, 0.f, 1.f);
}
if (Hit.IsValidBlockingHit())
{
if (CanStepUp(Hit) || (CharacterOwner->GetMovementBase() != NULL && CharacterOwner->GetMovementBase()->GetOwner() == Hit.GetActor()))
{
// hit a barrier, try to step up
const FVector GravDir(0.f, 0.f, -1.f);
// I add in the HMD difference from last frame to the step up check to enforce it stepping up
if (!StepUp(GravDir, (Delta * (1.f - PercentTimeApplied)) /*+ AdditionalVRInputVector.GetSafeNormal2D()*/, Hit, OutStepDownResult))
{
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("- StepUp (ImpactNormal %s, Normal %s"), *Hit.ImpactNormal.ToString(), *Hit.Normal.ToString());
HandleImpact(Hit, LastMoveTimeSlice, RampVector);
SlideAlongSurface(Delta, 1.f - PercentTimeApplied, Hit.Normal, Hit, true);
}
else
{
// Don't recalculate velocity based on this height adjustment, if considering vertical adjustments.
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("+ StepUp (ImpactNormal %s, Normal %s"), *Hit.ImpactNormal.ToString(), *Hit.Normal.ToString());
bJustTeleported |= !bMaintainHorizontalGroundVelocity;
}
}
else if (Hit.Component.IsValid() && !Hit.Component.Get()->CanCharacterStepUp(CharacterOwner))
{
HandleImpact(Hit, LastMoveTimeSlice, RampVector);
SlideAlongSurface(Delta, 1.f - PercentTimeApplied, Hit.Normal, Hit, true);
}
}
}
}
bool UVRCharacterMovementComponent::StepUp(const FVector& GravDir, const FVector& Delta, const FHitResult &InHit, FStepDownResult* OutStepDownResult)
{
SCOPE_CYCLE_COUNTER(STAT_CharStepUp);
if (!CanStepUp(InHit) || MaxStepHeight <= 0.f)
{
return false;
}
FVector OldLocation;
if (VRRootCapsule)
OldLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
else
OldLocation = UpdatedComponent->GetComponentLocation();
float PawnRadius, PawnHalfHeight;
CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleSize(PawnRadius, PawnHalfHeight);
// Don't bother stepping up if top of capsule is hitting something.
const float InitialImpactZ = InHit.ImpactPoint.Z;
if (InitialImpactZ > OldLocation.Z + (PawnHalfHeight - PawnRadius))
{
return false;
}
if (GravDir.IsZero())
{
return false;
}
// Gravity should be a normalized direction
ensure(GravDir.IsNormalized());
float StepTravelUpHeight = MaxStepHeight;
float StepTravelDownHeight = StepTravelUpHeight;
const float StepSideZ = -1.f * FVector::DotProduct(InHit.ImpactNormal, GravDir);//const float StepSideZ = -1.f * (InHit.ImpactNormal | GravDir);
float PawnInitialFloorBaseZ = OldLocation.Z -PawnHalfHeight;
float PawnFloorPointZ = PawnInitialFloorBaseZ;
if (IsMovingOnGround() && CurrentFloor.IsWalkableFloor())
{
// Since we float a variable amount off the floor, we need to enforce max step height off the actual point of impact with the floor.
const float FloorDist = FMath::Max(0.f, CurrentFloor.GetDistanceToFloor());
PawnInitialFloorBaseZ -= FloorDist;
StepTravelUpHeight = FMath::Max(StepTravelUpHeight - FloorDist, 0.f);
StepTravelDownHeight = (MaxStepHeight + MAX_FLOOR_DIST*2.f);
const bool bHitVerticalFace = !IsWithinEdgeTolerance(InHit.Location, InHit.ImpactPoint, PawnRadius);
if (!CurrentFloor.bLineTrace && !bHitVerticalFace)
{
PawnFloorPointZ = CurrentFloor.HitResult.ImpactPoint.Z;
}
else
{
// Base floor point is the base of the capsule moved down by how far we are hovering over the surface we are hitting.
PawnFloorPointZ -= CurrentFloor.FloorDist;
}
}
// Don't step up if the impact is below us, accounting for distance from floor.
if (InitialImpactZ <= PawnInitialFloorBaseZ)
{
return false;
}
// Scope our movement updates, and do not apply them until all intermediate moves are completed.
/*FScopedMovementUpdate*/ FVRCharacterScopedMovementUpdate ScopedStepUpMovement(UpdatedComponent, EScopedUpdate::DeferredUpdates);
// step up - treat as vertical wall
FHitResult SweepUpHit(1.f);
const FQuat PawnRotation = UpdatedComponent->GetComponentQuat();
MoveUpdatedComponent(-GravDir * StepTravelUpHeight, PawnRotation, true, &SweepUpHit);
if (SweepUpHit.bStartPenetrating)
{
// Undo movement
ScopedStepUpMovement.RevertMove();
return false;
}
// step fwd
FHitResult Hit(1.f);
MoveUpdatedComponent(Delta, PawnRotation, true, &Hit);
// Check result of forward movement
if (Hit.bBlockingHit)
{
if (Hit.bStartPenetrating)
{
// Undo movement
ScopedStepUpMovement.RevertMove();
return false;
}
// If we hit something above us and also something ahead of us, we should notify about the upward hit as well.
// The forward hit will be handled later (in the bSteppedOver case below).
// In the case of hitting something above but not forward, we are not blocked from moving so we don't need the notification.
if (SweepUpHit.bBlockingHit && Hit.bBlockingHit)
{
HandleImpact(SweepUpHit);
}
// pawn ran into a wall
HandleImpact(Hit);
if (IsFalling())
{
return true;
}
// adjust and try again
const float ForwardHitTime = Hit.Time;
const float ForwardSlideAmount = SlideAlongSurface(Delta, 1.f - Hit.Time, Hit.Normal, Hit, true);
if (IsFalling())
{
ScopedStepUpMovement.RevertMove();
return false;
}
// If both the forward hit and the deflection got us nowhere, there is no point in this step up.
if (ForwardHitTime == 0.f && ForwardSlideAmount == 0.f)
{
ScopedStepUpMovement.RevertMove();
return false;
}
}
// Step down
MoveUpdatedComponent(GravDir * StepTravelDownHeight, UpdatedComponent->GetComponentQuat(), true, &Hit);
// If step down was initially penetrating abort the step up
if (Hit.bStartPenetrating)
{
ScopedStepUpMovement.RevertMove();
return false;
}
FStepDownResult StepDownResult;
if (Hit.IsValidBlockingHit())
{
// See if this step sequence would have allowed us to travel higher than our max step height allows.
const float DeltaZ = Hit.ImpactPoint.Z - PawnFloorPointZ;
if (DeltaZ > MaxStepHeight)
{
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (too high Height %.3f) up from floor base %f"), DeltaZ, PawnInitialFloorBaseZ);
ScopedStepUpMovement.RevertMove();
return false;
}
// Reject unwalkable surface normals here.
if (!IsWalkable(Hit))
{
// Reject if normal opposes movement direction
const bool bNormalTowardsMe = (Delta | Hit.ImpactNormal) < 0.f;
if (bNormalTowardsMe)
{
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (unwalkable normal %s opposed to movement)"), *Hit.ImpactNormal.ToString());
ScopedStepUpMovement.RevertMove();
return false;
}
// Also reject if we would end up being higher than our starting location by stepping down.
// It's fine to step down onto an unwalkable normal below us, we will just slide off. Rejecting those moves would prevent us from being able to walk off the edge.
if (Hit.Location.Z > OldLocation.Z)
{
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (unwalkable normal %s above old position)"), *Hit.ImpactNormal.ToString());
ScopedStepUpMovement.RevertMove();
return false;
}
}
// Reject moves where the downward sweep hit something very close to the edge of the capsule. This maintains consistency with FindFloor as well.
if (!IsWithinEdgeTolerance(Hit.Location, Hit.ImpactPoint, PawnRadius))
{
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (outside edge tolerance)"));
ScopedStepUpMovement.RevertMove();
return false;
}
// Don't step up onto invalid surfaces if traveling higher.
if (DeltaZ > 0.f && !CanStepUp(Hit))
{
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (up onto surface with !CanStepUp())"));
ScopedStepUpMovement.RevertMove();
return false;
}
// See if we can validate the floor as a result of this step down. In almost all cases this should succeed, and we can avoid computing the floor outside this method.
if (OutStepDownResult != NULL)
{
FindFloor(UpdatedComponent->GetComponentLocation(), StepDownResult.FloorResult, false, &Hit);
// Reject unwalkable normals if we end up higher than our initial height.
// It's fine to walk down onto an unwalkable surface, don't reject those moves.
if (Hit.Location.Z > OldLocation.Z)
{
// We should reject the floor result if we are trying to step up an actual step where we are not able to perch (this is rare).
// In those cases we should instead abort the step up and try to slide along the stair.
if (!StepDownResult.FloorResult.bBlockingHit && StepSideZ < MAX_STEP_SIDE_Z)
{
ScopedStepUpMovement.RevertMove();
return false;
}
}
StepDownResult.bComputedFloor = true;
}
}
// Copy step down result.
if (OutStepDownResult != NULL)
{
*OutStepDownResult = StepDownResult;
}
// Don't recalculate velocity based on this height adjustment, if considering vertical adjustments.
bJustTeleported |= !bMaintainHorizontalGroundVelocity;
return true;
}
bool UVRCharacterMovementComponent::IsWithinEdgeTolerance(const FVector& CapsuleLocation, const FVector& TestImpactPoint, const float CapsuleRadius) const
{
const float DistFromCenterSq = (TestImpactPoint - CapsuleLocation).SizeSquared2D();
const float ReducedRadiusSq = FMath::Square(FMath::Max(VREdgeRejectDistance + KINDA_SMALL_NUMBER, CapsuleRadius - VREdgeRejectDistance));
return DistFromCenterSq < ReducedRadiusSq;
}
bool UVRCharacterMovementComponent::IsWithinClimbingEdgeTolerance(const FVector& CapsuleLocation, const FVector& TestImpactPoint, const float CapsuleRadius) const
{
const float DistFromCenterSq = (TestImpactPoint - CapsuleLocation).SizeSquared2D();
const float ReducedRadiusSq = FMath::Square(FMath::Max(VRClimbingEdgeRejectDistance + KINDA_SMALL_NUMBER, CapsuleRadius - VRClimbingEdgeRejectDistance));
return DistFromCenterSq < ReducedRadiusSq;
}
bool UVRCharacterMovementComponent::VRClimbStepUp(const FVector& GravDir, const FVector& Delta, const FHitResult &InHit, FStepDownResult* OutStepDownResult)
{
SCOPE_CYCLE_COUNTER(STAT_CharStepUp);
if (!CanStepUp(InHit) || MaxStepHeight <= 0.f)
{
return false;
}
FVector OldLocation;
if (VRRootCapsule)
OldLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
else
OldLocation = UpdatedComponent->GetComponentLocation();
float PawnRadius, PawnHalfHeight;
CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleSize(PawnRadius, PawnHalfHeight);
// Don't bother stepping up if top of capsule is hitting something.
const float InitialImpactZ = InHit.ImpactPoint.Z;
if (InitialImpactZ > OldLocation.Z + (PawnHalfHeight - PawnRadius))
{
return false;
}
// Don't step up if the impact is below us
if (InitialImpactZ <= OldLocation.Z - PawnHalfHeight)
{
return false;
}
if (GravDir.IsZero())
{
return false;
}
// Gravity should be a normalized direction
ensure(GravDir.IsNormalized());
float StepTravelUpHeight = MaxStepHeight;
float StepTravelDownHeight = StepTravelUpHeight;
const float StepSideZ = -1.f * (InHit.ImpactNormal | GravDir);
float PawnInitialFloorBaseZ = OldLocation.Z - PawnHalfHeight;
float PawnFloorPointZ = PawnInitialFloorBaseZ;
// Scope our movement updates, and do not apply them until all intermediate moves are completed.
FVRCharacterScopedMovementUpdate ScopedStepUpMovement(UpdatedComponent, EScopedUpdate::DeferredUpdates);
// step up - treat as vertical wall
FHitResult SweepUpHit(1.f);
const FQuat PawnRotation = UpdatedComponent->GetComponentQuat();
MoveUpdatedComponent(-GravDir * StepTravelUpHeight, PawnRotation, true, &SweepUpHit);
if (SweepUpHit.bStartPenetrating)
{
// Undo movement
ScopedStepUpMovement.RevertMove();
return false;
}
// step fwd
FHitResult Hit(1.f);
// Adding in the directional difference of the last HMD movement to promote stepping up
// Probably entirely wrong as Delta is divided by movement ticks but I want the effect to be stronger anyway
// This won't effect control based movement unless stepping forward at the same time, but gives RW movement
// the extra boost to get up over a lip
// #TODO test this more, currently appears to be needed for walking, but is harmful for other modes
// if (VRRootCapsule)
// MoveUpdatedComponent(Delta + VRRootCapsule->DifferenceFromLastFrame.GetSafeNormal2D(), PawnRotation, true, &Hit);
// else
MoveUpdatedComponent(Delta, PawnRotation, true, &Hit);
//MoveUpdatedComponent(Delta, PawnRotation, true, &Hit);
// Check result of forward movement
if (Hit.bBlockingHit)
{
if (Hit.bStartPenetrating)
{
// Undo movement
ScopedStepUpMovement.RevertMove();
return false;
}
// If we hit something above us and also something ahead of us, we should notify about the upward hit as well.
// The forward hit will be handled later (in the bSteppedOver case below).
// In the case of hitting something above but not forward, we are not blocked from moving so we don't need the notification.
if (SweepUpHit.bBlockingHit && Hit.bBlockingHit)
{
HandleImpact(SweepUpHit);
}
// pawn ran into a wall
HandleImpact(Hit);
if (IsFalling())
{
return true;
}
//Don't adjust for VR, it doesn't work correctly
ScopedStepUpMovement.RevertMove();
return false;
// adjust and try again
//const float ForwardHitTime = Hit.Time;
//const float ForwardSlideAmount = SlideAlongSurface(Delta, 1.f - Hit.Time, Hit.Normal, Hit, true);
//if (IsFalling())
//{
// ScopedStepUpMovement.RevertMove();
// return false;
//}
// If both the forward hit and the deflection got us nowhere, there is no point in this step up.
//if (ForwardHitTime == 0.f && ForwardSlideAmount == 0.f)
//{
// ScopedStepUpMovement.RevertMove();
// return false;
//}
}
// Step down
MoveUpdatedComponent(GravDir * StepTravelDownHeight, UpdatedComponent->GetComponentQuat(), true, &Hit);
// If step down was initially penetrating abort the step up
if (Hit.bStartPenetrating)
{
ScopedStepUpMovement.RevertMove();
return false;
}
FStepDownResult StepDownResult;
if (Hit.IsValidBlockingHit())
{
// See if this step sequence would have allowed us to travel higher than our max step height allows.
const float DeltaZ = Hit.ImpactPoint.Z - PawnFloorPointZ;
if (DeltaZ > MaxStepHeight)
{
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (too high Height %.3f) up from floor base %f"), DeltaZ, PawnInitialFloorBaseZ);
ScopedStepUpMovement.RevertMove();
return false;
}
// Reject unwalkable surface normals here.
if (!IsWalkable(Hit))
{
// Reject if normal opposes movement direction
const bool bNormalTowardsMe = (Delta | Hit.ImpactNormal) < 0.f;
if (bNormalTowardsMe)
{
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (unwalkable normal %s opposed to movement)"), *Hit.ImpactNormal.ToString());
ScopedStepUpMovement.RevertMove();
return false;
}
// Also reject if we would end up being higher than our starting location by stepping down.
// It's fine to step down onto an unwalkable normal below us, we will just slide off. Rejecting those moves would prevent us from being able to walk off the edge.
if (Hit.Location.Z > OldLocation.Z)
{
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (unwalkable normal %s above old position)"), *Hit.ImpactNormal.ToString());
ScopedStepUpMovement.RevertMove();
return false;
}
}
// Reject moves where the downward sweep hit something very close to the edge of the capsule. This maintains consistency with FindFloor as well.
if (!IsWithinClimbingEdgeTolerance(Hit.Location, Hit.ImpactPoint, PawnRadius))
{
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (outside edge tolerance)"));
ScopedStepUpMovement.RevertMove();
return false;
}
// Don't step up onto invalid surfaces if traveling higher.
if (DeltaZ > 0.f && !CanStepUp(Hit))
{
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("- Reject StepUp (up onto surface with !CanStepUp())"));
ScopedStepUpMovement.RevertMove();
return false;
}
// See if we can validate the floor as a result of this step down. In almost all cases this should succeed, and we can avoid computing the floor outside this method.
if (OutStepDownResult != NULL)
{
FindFloor(UpdatedComponent->GetComponentLocation(), StepDownResult.FloorResult, false, &Hit);
// Reject unwalkable normals if we end up higher than our initial height.
// It's fine to walk down onto an unwalkable surface, don't reject those moves.
if (Hit.Location.Z > OldLocation.Z)
{
// We should reject the floor result if we are trying to step up an actual step where we are not able to perch (this is rare).
// In those cases we should instead abort the step up and try to slide along the stair.
if (!StepDownResult.FloorResult.bBlockingHit && StepSideZ < MAX_STEP_SIDE_Z)
{
ScopedStepUpMovement.RevertMove();
return false;
}
}
StepDownResult.bComputedFloor = true;
}
}
// Copy step down result.
if (OutStepDownResult != NULL)
{
*OutStepDownResult = StepDownResult;
}
// Don't recalculate velocity based on this height adjustment, if considering vertical adjustments.
bJustTeleported |= !bMaintainHorizontalGroundVelocity;
return true;
}
void UVRCharacterMovementComponent::UpdateBasedMovement(float DeltaSeconds)
{
if (!HasValidData())
{
return;
}
const UPrimitiveComponent* MovementBase = CharacterOwner->GetMovementBase();
if (!MovementBaseUtility::UseRelativeLocation(MovementBase))
{
return;
}
if (!IsValid(MovementBase) || !IsValid(MovementBase->GetOwner()))
{
SetBase(NULL);
return;
}
// Ignore collision with bases during these movements.
TGuardValue<EMoveComponentFlags> ScopedFlagRestore(MoveComponentFlags, MoveComponentFlags | MOVECOMP_IgnoreBases);
FQuat DeltaQuat = FQuat::Identity;
FVector DeltaPosition = FVector::ZeroVector;
FQuat NewBaseQuat;
FVector NewBaseLocation;
if (!MovementBaseUtility::GetMovementBaseTransform(MovementBase, CharacterOwner->GetBasedMovement().BoneName, NewBaseLocation, NewBaseQuat))
{
return;
}
// Find change in rotation
const bool bRotationChanged = !OldBaseQuat.Equals(NewBaseQuat, 1e-8f);
if (bRotationChanged)
{
DeltaQuat = NewBaseQuat * OldBaseQuat.Inverse();
}
// only if base moved
if (bRotationChanged || (OldBaseLocation != NewBaseLocation))
{
// Calculate new transform matrix of base actor (ignoring scale).
const FQuatRotationTranslationMatrix OldLocalToWorld(OldBaseQuat, OldBaseLocation);
const FQuatRotationTranslationMatrix NewLocalToWorld(NewBaseQuat, NewBaseLocation);
if (CharacterOwner->IsMatineeControlled())
{
FRotationTranslationMatrix HardRelMatrix(CharacterOwner->GetBasedMovement().Rotation, CharacterOwner->GetBasedMovement().Location);
const FMatrix NewWorldTM = HardRelMatrix * NewLocalToWorld;
const FQuat NewWorldRot = bIgnoreBaseRotation ? UpdatedComponent->GetComponentQuat() : NewWorldTM.ToQuat();
MoveUpdatedComponent(NewWorldTM.GetOrigin() - UpdatedComponent->GetComponentLocation(), NewWorldRot, true);
}
else
{
FQuat FinalQuat = UpdatedComponent->GetComponentQuat();
if (bRotationChanged && !bIgnoreBaseRotation)
{
// Apply change in rotation and pipe through FaceRotation to maintain axis restrictions
const FQuat PawnOldQuat = UpdatedComponent->GetComponentQuat();
const FQuat TargetQuat = DeltaQuat * FinalQuat;
FRotator TargetRotator(TargetQuat);
CharacterOwner->FaceRotation(TargetRotator, 0.f);
FinalQuat = UpdatedComponent->GetComponentQuat();
if (PawnOldQuat.Equals(FinalQuat, 1e-6f))
{
// Nothing changed. This means we probably are using another rotation mechanism (bOrientToMovement etc). We should still follow the base object.
// @todo: This assumes only Yaw is used, currently a valid assumption. This is the only reason FaceRotation() is used above really, aside from being a virtual hook.
if (bOrientRotationToMovement || (bUseControllerDesiredRotation && CharacterOwner->Controller))
{
TargetRotator.Pitch = 0.f;
TargetRotator.Roll = 0.f;
MoveUpdatedComponent(FVector::ZeroVector, TargetRotator, false);
FinalQuat = UpdatedComponent->GetComponentQuat();
}
}
// Pipe through ControlRotation, to affect camera.
if (CharacterOwner->Controller)
{
const FQuat PawnDeltaRotation = FinalQuat * PawnOldQuat.Inverse();
FRotator FinalRotation = FinalQuat.Rotator();
UpdateBasedRotation(FinalRotation, PawnDeltaRotation.Rotator());
FinalQuat = UpdatedComponent->GetComponentQuat();
}
}
// We need to offset the base of the character here, not its origin, so offset by half height
float HalfHeight, Radius;
CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleSize(Radius, HalfHeight);
FVector const BaseOffset(0.0f, 0.0f, 0.0f);//(0.0f, 0.0f, HalfHeight);
FVector const LocalBasePos = OldLocalToWorld.InverseTransformPosition(UpdatedComponent->GetComponentLocation() - BaseOffset);
FVector const NewWorldPos = ConstrainLocationToPlane(NewLocalToWorld.TransformPosition(LocalBasePos) + BaseOffset);
DeltaPosition = ConstrainDirectionToPlane(NewWorldPos - UpdatedComponent->GetComponentLocation());
// move attached actor
if (bFastAttachedMove)
{
// we're trusting no other obstacle can prevent the move here
UpdatedComponent->SetWorldLocationAndRotation(NewWorldPos, FinalQuat, false);
}
else
{
// hack - transforms between local and world space introducing slight error FIXMESTEVE - discuss with engine team: just skip the transforms if no rotation?
FVector BaseMoveDelta = NewBaseLocation - OldBaseLocation;
if (!bRotationChanged && (BaseMoveDelta.X == 0.f) && (BaseMoveDelta.Y == 0.f))
{
DeltaPosition.X = 0.f;
DeltaPosition.Y = 0.f;
}
FHitResult MoveOnBaseHit(1.f);
const FVector OldLocation = UpdatedComponent->GetComponentLocation();
MoveUpdatedComponent(DeltaPosition, FinalQuat, true, &MoveOnBaseHit);
if ((UpdatedComponent->GetComponentLocation() - (OldLocation + DeltaPosition)).IsNearlyZero() == false)
{
OnUnableToFollowBaseMove(DeltaPosition, OldLocation, MoveOnBaseHit);
}
}
}
if (MovementBase->IsSimulatingPhysics() && CharacterOwner->GetMesh())
{
CharacterOwner->GetMesh()->ApplyDeltaToAllPhysicsTransforms(DeltaPosition, DeltaQuat);
}
}
}
FVector UVRCharacterMovementComponent::GetImpartedMovementBaseVelocity() const
{
FVector Result = FVector::ZeroVector;
if (CharacterOwner)
{
UPrimitiveComponent* MovementBase = CharacterOwner->GetMovementBase();
if (MovementBaseUtility::IsDynamicBase(MovementBase))
{
FVector BaseVelocity = MovementBaseUtility::GetMovementBaseVelocity(MovementBase, CharacterOwner->GetBasedMovement().BoneName);
if (bImpartBaseAngularVelocity)
{
// Base position should be the bottom of the actor since I offset the capsule now
const FVector CharacterBasePosition = (UpdatedComponent->GetComponentLocation()/* - FVector(0.f, 0.f, CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleHalfHeight())*/);
const FVector BaseTangentialVel = MovementBaseUtility::GetMovementBaseTangentialVelocity(MovementBase, CharacterOwner->GetBasedMovement().BoneName, CharacterBasePosition);
BaseVelocity += BaseTangentialVel;
}
if (bImpartBaseVelocityX)
{
Result.X = BaseVelocity.X;
}
if (bImpartBaseVelocityY)
{
Result.Y = BaseVelocity.Y;
}
if (bImpartBaseVelocityZ)
{
Result.Z = BaseVelocity.Z;
}
}
}
return Result;
}
void UVRCharacterMovementComponent::FindFloor(const FVector& CapsuleLocation, FFindFloorResult& OutFloorResult, bool bCanUseCachedLocation, const FHitResult* DownwardSweepResult) const
{
SCOPE_CYCLE_COUNTER(STAT_CharFindFloor);
//UE_LOG(LogVRCharacterMovement, Warning, TEXT("Find Floor"));
// No collision, no floor...
if (!HasValidData() || !UpdatedComponent->IsQueryCollisionEnabled())
{
OutFloorResult.Clear();
return;
}
//UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("[Role:%d] FindFloor: %s at location %s"), (int32)CharacterOwner->Role, *GetNameSafe(CharacterOwner), *CapsuleLocation.ToString());
check(CharacterOwner->GetCapsuleComponent());
FVector UseCapsuleLocation = CapsuleLocation;
if (VRRootCapsule)
UseCapsuleLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
// Increase height check slightly if walking, to prevent floor height adjustment from later invalidating the floor result.
const float HeightCheckAdjust = ((IsMovingOnGround() || IsClimbing()) ? MAX_FLOOR_DIST + KINDA_SMALL_NUMBER : -MAX_FLOOR_DIST);
float FloorSweepTraceDist = FMath::Max(MAX_FLOOR_DIST, MaxStepHeight + HeightCheckAdjust);
float FloorLineTraceDist = FloorSweepTraceDist;
bool bNeedToValidateFloor = true;
// For reverting
FFindFloorResult LastFloor = CurrentFloor;
// Sweep floor
if (FloorLineTraceDist > 0.f || FloorSweepTraceDist > 0.f)
{
UCharacterMovementComponent* MutableThis = const_cast<UCharacterMovementComponent*>((UCharacterMovementComponent*)this);
if (bAlwaysCheckFloor || !bCanUseCachedLocation || bForceNextFloorCheck || bJustTeleported)
{
MutableThis->bForceNextFloorCheck = false;
ComputeFloorDist(UseCapsuleLocation, FloorLineTraceDist, FloorSweepTraceDist, OutFloorResult, CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleRadius(), DownwardSweepResult);
}
else
{
// Force floor check if base has collision disabled or if it does not block us.
UPrimitiveComponent* MovementBase = CharacterOwner->GetMovementBase();
const AActor* BaseActor = MovementBase ? MovementBase->GetOwner() : NULL;
const ECollisionChannel CollisionChannel = UpdatedComponent->GetCollisionObjectType();
if (MovementBase != NULL)
{
MutableThis->bForceNextFloorCheck = !MovementBase->IsQueryCollisionEnabled()
|| MovementBase->GetCollisionResponseToChannel(CollisionChannel) != ECR_Block
|| MovementBaseUtility::IsDynamicBase(MovementBase);
}
const bool IsActorBasePendingKill = BaseActor && BaseActor->IsPendingKill();
if (!bForceNextFloorCheck && !IsActorBasePendingKill && MovementBase)
{
//UE_LOG(LogVRCharacterMovement, Log, TEXT("%s SKIP check for floor"), *CharacterOwner->GetName());
OutFloorResult = CurrentFloor;
bNeedToValidateFloor = false;
}
else
{
MutableThis->bForceNextFloorCheck = false;
ComputeFloorDist(UseCapsuleLocation, FloorLineTraceDist, FloorSweepTraceDist, OutFloorResult, CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleRadius(), DownwardSweepResult);
}
}
}
// #TODO: Modify the floor compute floor distance instead? Or just run movement logic differently for the bWalkingCollisionOverride setup.
// #VR Specific - ignore floor traces that are negative, this can be caused by a failed floor check while starting in penetration
if (VRRootCapsule && VRRootCapsule->bUseWalkingCollisionOverride && OutFloorResult.bBlockingHit && OutFloorResult.FloorDist <= 0.0f)
{
if (OutFloorResult.FloorDist <= -FMath::Max(MAX_FLOOR_DIST, CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleRadius()))
{
// This was a negative trace result, the game wants us to pull out of penetration
// But with walking collision override we don't want to do that, so check for the correct channel and throw away
// the new floor if it matches
ECollisionResponse FloorResponse;
if (OutFloorResult.HitResult.Component.IsValid())
{
FloorResponse = OutFloorResult.HitResult.Component->GetCollisionResponseToChannel(VRRootCapsule->WalkingCollisionOverride);
if (FloorResponse == ECR_Ignore || FloorResponse == ECR_Overlap)
OutFloorResult = LastFloor; // Move back to the last floor value, we are in penetration with a walking override
}
}
}
// OutFloorResult.HitResult is now the result of the vertical floor check.
// See if we should try to "perch" at this location.
if (bNeedToValidateFloor && OutFloorResult.bBlockingHit && !OutFloorResult.bLineTrace)
{
const bool bCheckRadius = true;
if (ShouldComputePerchResult(OutFloorResult.HitResult, bCheckRadius))
{
float MaxPerchFloorDist = FMath::Max(MAX_FLOOR_DIST, MaxStepHeight + HeightCheckAdjust);
if (IsMovingOnGround() || IsClimbing())
{
MaxPerchFloorDist += FMath::Max(0.f, PerchAdditionalHeight);
}
FFindFloorResult PerchFloorResult;
if (ComputePerchResult(GetValidPerchRadius(), OutFloorResult.HitResult, MaxPerchFloorDist, PerchFloorResult))
{
// Don't allow the floor distance adjustment to push us up too high, or we will move beyond the perch distance and fall next time.
const float AvgFloorDist = (MIN_FLOOR_DIST + MAX_FLOOR_DIST) * 0.5f;
const float MoveUpDist = (AvgFloorDist - OutFloorResult.FloorDist);
if (MoveUpDist + PerchFloorResult.FloorDist >= MaxPerchFloorDist)
{
OutFloorResult.FloorDist = AvgFloorDist;
}
// If the regular capsule is on an unwalkable surface but the perched one would allow us to stand, override the normal to be one that is walkable.
if (!OutFloorResult.bWalkableFloor)
{
OutFloorResult.SetFromLineTrace(PerchFloorResult.HitResult, OutFloorResult.FloorDist, FMath::Max(OutFloorResult.FloorDist, MIN_FLOOR_DIST), true);
}
}
else
{
// We had no floor (or an invalid one because it was unwalkable), and couldn't perch here, so invalidate floor (which will cause us to start falling).
OutFloorResult.bWalkableFloor = false;
}
}
}
}
// MOVED TO BASE VR CHARCTER MOVEMENT COMPONENT
// Also added a control variable for it there
/*
bool UVRCharacterMovementComponent::FloorSweepTest(
FHitResult& OutHit,
const FVector& Start,
const FVector& End,
ECollisionChannel TraceChannel,
const struct FCollisionShape& CollisionShape,
const struct FCollisionQueryParams& Params,
const struct FCollisionResponseParams& ResponseParam
) const
{
bool bBlockingHit = false;
if (!bUseFlatBaseForFloorChecks)
{
TArray<FHitResult> OutHits;
GetWorld()->SweepMultiByChannel(OutHits, Start, End, FQuat::Identity, TraceChannel, CollisionShape, Params, ResponseParam);
for (int i = 0; i < OutHits.Num(); i++)
{
if (OutHits[i].bBlockingHit && (OutHits[i].Component.IsValid() && !OutHits[i].Component->IsSimulatingPhysics()))
{
OutHit = OutHits[i];
bBlockingHit = true;
break;
}
}
//bBlockingHit = GetWorld()->SweepSingleByChannel(OutHit, Start, End, FQuat::Identity, TraceChannel, CollisionShape, Params, ResponseParam);
}
else
{
// Test with a box that is enclosed by the capsule.
const float CapsuleRadius = CollisionShape.GetCapsuleRadius();
const float CapsuleHeight = CollisionShape.GetCapsuleHalfHeight();
const FCollisionShape BoxShape = FCollisionShape::MakeBox(FVector(CapsuleRadius * 0.707f, CapsuleRadius * 0.707f, CapsuleHeight));
// First test with the box rotated so the corners are along the major axes (ie rotated 45 degrees).
TArray<FHitResult> OutHits;
GetWorld()->SweepMultiByChannel(OutHits, Start, End, FQuat(FVector(0.f, 0.f, -1.f), PI * 0.25f), TraceChannel, BoxShape, Params, ResponseParam);
for (int i = 0; i < OutHits.Num(); i++)
{
if (OutHits[i].bBlockingHit && (OutHits[i].Component.IsValid() && !OutHits[i].Component->IsSimulatingPhysics()))
{
OutHit = OutHits[i];
bBlockingHit = true;
break;
}
}
//bBlockingHit = GetWorld()->SweepSingleByChannel(OutHit, Start, End, FQuat(FVector(0.f, 0.f, -1.f), PI * 0.25f), TraceChannel, BoxShape, Params, ResponseParam);
if (!bBlockingHit)
{
// Test again with the same box, not rotated.
OutHit.Reset(1.f, false);
OutHits.Reset();
//TArray<FHitResult> OutHits;
GetWorld()->SweepMultiByChannel(OutHits, Start, End, FQuat::Identity, TraceChannel, BoxShape, Params, ResponseParam);
for (int i = 0; i < OutHits.Num(); i++)
{
if (OutHits[i].bBlockingHit && (OutHits[i].Component.IsValid() && !OutHits[i].Component->IsSimulatingPhysics()))
{
OutHit = OutHits[i];
bBlockingHit = true;
break;
}
}
//bBlockingHit = GetWorld()->SweepSingleByChannel(OutHit, Start, End, FQuat::Identity, TraceChannel, BoxShape, Params, ResponseParam);
}
}
return bBlockingHit;
}*/
float UVRCharacterMovementComponent::ImmersionDepth() const
{
float depth = 0.f;
if (CharacterOwner && GetPhysicsVolume()->bWaterVolume)
{
const float CollisionHalfHeight = CharacterOwner->GetSimpleCollisionHalfHeight();
if ((CollisionHalfHeight == 0.f) || (Buoyancy == 0.f))
{
depth = 1.f;
}
else
{
UBrushComponent* VolumeBrushComp = GetPhysicsVolume()->GetBrushComponent();
FHitResult Hit(1.f);
if (VolumeBrushComp)
{
FVector TraceStart;
FVector TraceEnd;
if (VRRootCapsule)
{
TraceStart = VRRootCapsule->OffsetComponentToWorld.GetLocation() + FVector(0.f, 0.f, CollisionHalfHeight);
TraceEnd = VRRootCapsule->OffsetComponentToWorld.GetLocation() - FVector(0.f, 0.f, CollisionHalfHeight);
}
else
{
TraceStart = UpdatedComponent->GetComponentLocation() + FVector(0.f, 0.f, CollisionHalfHeight);
TraceEnd = UpdatedComponent->GetComponentLocation() -FVector(0.f, 0.f, CollisionHalfHeight);
}
FCollisionQueryParams NewTraceParams(CharacterMovementComponentStatics::ImmersionDepthName, true);
VolumeBrushComp->LineTraceComponent(Hit, TraceStart, TraceEnd, NewTraceParams);
}
depth = (Hit.Time == 1.f) ? 1.f : (1.f - Hit.Time);
}
}
return depth;
}
///////////////////////////
// Navigation Functions
///////////////////////////
bool UVRCharacterMovementComponent::TryToLeaveNavWalking()
{
SetNavWalkingPhysics(false);
bool bCanTeleport = true;
if (CharacterOwner)
{
FVector CollisionFreeLocation;
if (VRRootCapsule)
CollisionFreeLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
else
CollisionFreeLocation = UpdatedComponent->GetComponentLocation();
// Think I need to create a custom "FindTeleportSpot" function, it is using ComponentToWorld location
bCanTeleport = GetWorld()->FindTeleportSpot(CharacterOwner, CollisionFreeLocation, UpdatedComponent->GetComponentRotation());
if (bCanTeleport)
{
if (VRRootCapsule)
{
// Technically the same actor but i am keepign the usage convention for clarity.
// Subtracting actor location from capsule to get difference in worldspace, then removing from collision free location
// So that it uses the correct location.
CharacterOwner->SetActorLocation(CollisionFreeLocation - (VRRootCapsule->OffsetComponentToWorld.GetLocation() - UpdatedComponent->GetComponentLocation()));
}
else
CharacterOwner->SetActorLocation(CollisionFreeLocation);
}
else
{
SetNavWalkingPhysics(true);
}
}
bWantsToLeaveNavWalking = !bCanTeleport;
return bCanTeleport;
}
void UVRCharacterMovementComponent::PhysFlying(float deltaTime, int32 Iterations)
{
if (deltaTime < MIN_TICK_TIME)
{
return;
}
// Rewind the players position by the new capsule location
RewindVRRelativeMovement();
RestorePreAdditiveRootMotionVelocity();
//RestorePreAdditiveVRMotionVelocity();
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
if (bCheatFlying && Acceleration.IsZero())
{
Velocity = FVector::ZeroVector;
}
const float Friction = 0.5f * GetPhysicsVolume()->FluidFriction;
CalcVelocity(deltaTime, Friction, true, GetMaxBrakingDeceleration());
}
ApplyRootMotionToVelocity(deltaTime);
//ApplyVRMotionToVelocity(deltaTime);
// Manually handle the velocity setup
LastPreAdditiveVRVelocity = (AdditionalVRInputVector) / deltaTime;
bool bExtremeInput = false;
if (LastPreAdditiveVRVelocity.SizeSquared() > FMath::Square(TrackingLossThreshold))
{
// Default to always holding position during flight to avoid too much velocity injection
AdditionalVRInputVector = FVector::ZeroVector;
LastPreAdditiveVRVelocity = FVector::ZeroVector;
}
Iterations++;
bJustTeleported = false;
FVector OldLocation = UpdatedComponent->GetComponentLocation();
const FVector Adjusted = Velocity * deltaTime;
FHitResult Hit(1.f);
SafeMoveUpdatedComponent(Adjusted + AdditionalVRInputVector, UpdatedComponent->GetComponentQuat(), true, Hit);
if (Hit.Time < 1.f)
{
const FVector GravDir = FVector(0.f, 0.f, -1.f);
const FVector VelDir = Velocity.GetSafeNormal();
const float UpDown = GravDir | VelDir;
bool bSteppedUp = false;
if ((FMath::Abs(Hit.ImpactNormal.Z) < 0.2f) && (UpDown < 0.5f) && (UpDown > -0.2f) && CanStepUp(Hit))
{
float stepZ = UpdatedComponent->GetComponentLocation().Z;
bSteppedUp = StepUp(GravDir, (Adjusted + AdditionalVRInputVector) * (1.f - Hit.Time) /*+ AdditionalVRInputVector.GetSafeNormal2D()*/, Hit, nullptr);
if (bSteppedUp)
{
OldLocation.Z = UpdatedComponent->GetComponentLocation().Z + (OldLocation.Z - stepZ);
}
}
if (!bSteppedUp)
{
//adjust and try again
HandleImpact(Hit, deltaTime, Adjusted);
SlideAlongSurface(Adjusted, (1.f - Hit.Time), Hit.Normal, Hit, true);
}
}
if (!bJustTeleported)
{
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
//Velocity = ((UpdatedComponent->GetComponentLocation() - OldLocation) - AdditionalVRInputVector) / deltaTime;
Velocity = ((UpdatedComponent->GetComponentLocation() - OldLocation)) / deltaTime;
}
RestorePreAdditiveVRMotionVelocity();
}
}
void UVRCharacterMovementComponent::PhysFalling(float deltaTime, int32 Iterations)
{
SCOPE_CYCLE_COUNTER(STAT_CharPhysFalling);
if (deltaTime < MIN_TICK_TIME)
{
return;
}
FVector FallAcceleration = GetFallingLateralAcceleration(deltaTime);
FallAcceleration.Z = 0.f;
const bool bHasLimitedAirControl = ShouldLimitAirControl(deltaTime, FallAcceleration);
// Rewind the players position by the new capsule location
RewindVRRelativeMovement();
float remainingTime = deltaTime;
while ((remainingTime >= MIN_TICK_TIME) && (Iterations < MaxSimulationIterations))
{
Iterations++;
float timeTick = GetSimulationTimeStep(remainingTime, Iterations);
remainingTime -= timeTick;
const FVector OldLocation = UpdatedComponent->GetComponentLocation();
const FVector OldCapsuleLocation = VRRootCapsule ? VRRootCapsule->OffsetComponentToWorld.GetLocation() : OldLocation;
const FQuat PawnRotation = UpdatedComponent->GetComponentQuat();
bJustTeleported = false;
RestorePreAdditiveRootMotionVelocity();
RestorePreAdditiveVRMotionVelocity();
const FVector OldVelocity = Velocity;
// Apply input
const float MaxDecel = GetMaxBrakingDeceleration();
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
// Compute Velocity
{
// Acceleration = FallAcceleration for CalcVelocity(), but we restore it after using it.
TGuardValue<FVector> RestoreAcceleration(Acceleration, FallAcceleration);
Velocity.Z = 0.f;
CalcVelocity(timeTick, FallingLateralFriction, false, BrakingDecelerationFalling);
Velocity.Z = OldVelocity.Z;
}
}
//Velocity += CustomVRInputVector / deltaTime;
// Compute current gravity
const FVector Gravity(0.f, 0.f, GetGravityZ());
float GravityTime = timeTick;
// If jump is providing force, gravity may be affected.
bool bEndingJumpForce = false;
if (CharacterOwner->JumpForceTimeRemaining > 0.0f)
{
// Consume some of the force time. Only the remaining time (if any) is affected by gravity when bApplyGravityWhileJumping=false.
const float JumpForceTime = FMath::Min(CharacterOwner->JumpForceTimeRemaining, timeTick);
GravityTime = bApplyGravityWhileJumping ? timeTick : FMath::Max(0.0f, timeTick - JumpForceTime);
// Update Character state
CharacterOwner->JumpForceTimeRemaining -= JumpForceTime;
if (CharacterOwner->JumpForceTimeRemaining <= 0.0f)
{
CharacterOwner->ResetJumpState();
bEndingJumpForce = true;
}
}
// Apply gravity
Velocity = NewFallVelocity(Velocity, Gravity, GravityTime);
// See if we need to sub-step to exactly reach the apex. This is important for avoiding "cutting off the top" of the trajectory as framerate varies.
static const auto CVarForceJumpPeakSubstep = IConsoleManager::Get().FindConsoleVariable(TEXT("p.ForceJumpPeakSubstep"));
if (CVarForceJumpPeakSubstep->GetInt() != 0 && OldVelocity.Z > 0.f && Velocity.Z <= 0.f && NumJumpApexAttempts < MaxJumpApexAttemptsPerSimulation)
{
const FVector DerivedAccel = (Velocity - OldVelocity) / timeTick;
if (!FMath::IsNearlyZero(DerivedAccel.Z))
{
const float TimeToApex = -OldVelocity.Z / DerivedAccel.Z;
// The time-to-apex calculation should be precise, and we want to avoid adding a substep when we are basically already at the apex from the previous iteration's work.
const float ApexTimeMinimum = 0.0001f;
if (TimeToApex >= ApexTimeMinimum && TimeToApex < timeTick)
{
const FVector ApexVelocity = OldVelocity + DerivedAccel * TimeToApex;
Velocity = ApexVelocity;
Velocity.Z = 0.f; // Should be nearly zero anyway, but this makes apex notifications consistent.
// We only want to move the amount of time it takes to reach the apex, and refund the unused time for next iteration.
remainingTime += (timeTick - TimeToApex);
timeTick = TimeToApex;
Iterations--;
NumJumpApexAttempts++;
}
}
}
//UE_LOG(LogCharacterMovement, Log, TEXT("dt=(%.6f) OldLocation=(%s) OldVelocity=(%s) NewVelocity=(%s)"), timeTick, *(UpdatedComponent->GetComponentLocation()).ToString(), *OldVelocity.ToString(), *Velocity.ToString());
ApplyRootMotionToVelocity(timeTick);
ApplyVRMotionToVelocity(deltaTime);
if (bNotifyApex && (Velocity.Z < 0.f))
{
// Just passed jump apex since now going down
bNotifyApex = false;
NotifyJumpApex();
}
// Compute change in position (using midpoint integration method).
FVector Adjusted = (0.5f * (OldVelocity + Velocity) * timeTick) /*+ ((AdditionalVRInputVector / deltaTime) * timeTick)*/;
// Special handling if ending the jump force where we didn't apply gravity during the jump.
if (bEndingJumpForce && !bApplyGravityWhileJumping)
{
// We had a portion of the time at constant speed then a portion with acceleration due to gravity.
// Account for that here with a more correct change in position.
const float NonGravityTime = FMath::Max(0.f, timeTick - GravityTime);
Adjusted = ((OldVelocity * NonGravityTime) + (0.5f * (OldVelocity + Velocity) * GravityTime)) /*+ ((AdditionalVRInputVector / deltaTime) * timeTick)*/;
}
// Move
FHitResult Hit(1.f);
SafeMoveUpdatedComponent(Adjusted, PawnRotation, true, Hit);
if (!HasValidData())
{
return;
}
float LastMoveTimeSlice = timeTick;
float subTimeTickRemaining = timeTick * (1.f - Hit.Time);
if (IsSwimming()) //just entered water
{
remainingTime += subTimeTickRemaining;
StartSwimmingVR(OldCapsuleLocation, OldVelocity, timeTick, remainingTime, Iterations);
return;
}
else if (Hit.bBlockingHit)
{
if (IsValidLandingSpot(VRRootCapsule->OffsetComponentToWorld.GetLocation()/*UpdatedComponent->GetComponentLocation()*/, Hit))
{
remainingTime += subTimeTickRemaining;
ProcessLanded(Hit, remainingTime, Iterations);
return;
}
else
{
// Compute impact deflection based on final velocity, not integration step.
// This allows us to compute a new velocity from the deflected vector, and ensures the full gravity effect is included in the slide result.
Adjusted = Velocity * timeTick;
// See if we can convert a normally invalid landing spot (based on the hit result) to a usable one.
if (!Hit.bStartPenetrating && ShouldCheckForValidLandingSpot(timeTick, Adjusted, Hit))
{
/*const */FVector PawnLocation = UpdatedComponent->GetComponentLocation();
if (VRRootCapsule)
PawnLocation = VRRootCapsule->OffsetComponentToWorld.GetLocation();
FFindFloorResult FloorResult;
FindFloor(PawnLocation, FloorResult, false, NULL);
if (FloorResult.IsWalkableFloor() && IsValidLandingSpot(PawnLocation, FloorResult.HitResult))
{
remainingTime += subTimeTickRemaining;
ProcessLanded(FloorResult.HitResult, remainingTime, Iterations);
return;
}
}
HandleImpact(Hit, LastMoveTimeSlice, Adjusted);
// If we've changed physics mode, abort.
if (!HasValidData() || !IsFalling())
{
return;
}
// Limit air control based on what we hit.
// We moved to the impact point using air control, but may want to deflect from there based on a limited air control acceleration.
FVector VelocityNoAirControl = OldVelocity;
FVector AirControlAccel = Acceleration;
if (bHasLimitedAirControl)
{
// Compute VelocityNoAirControl
{
// Find velocity *without* acceleration.
TGuardValue<FVector> RestoreAcceleration(Acceleration, FVector::ZeroVector);
TGuardValue<FVector> RestoreVelocity(Velocity, OldVelocity);
Velocity.Z = 0.f;
CalcVelocity(timeTick, FallingLateralFriction, false, MaxDecel);
VelocityNoAirControl = FVector(Velocity.X, Velocity.Y, OldVelocity.Z);
VelocityNoAirControl = NewFallVelocity(VelocityNoAirControl, Gravity, GravityTime);
}
const bool bCheckLandingSpot = false; // we already checked above.
AirControlAccel = (Velocity - VelocityNoAirControl) / timeTick;
const FVector AirControlDeltaV = LimitAirControl(LastMoveTimeSlice, AirControlAccel, Hit, bCheckLandingSpot) * LastMoveTimeSlice;
Adjusted = (VelocityNoAirControl + AirControlDeltaV) * LastMoveTimeSlice;
}
const FVector OldHitNormal = Hit.Normal;
const FVector OldHitImpactNormal = Hit.ImpactNormal;
FVector Delta = ComputeSlideVector(Adjusted, 1.f - Hit.Time, OldHitNormal, Hit);
// Compute velocity after deflection (only gravity component for RootMotion)
if (subTimeTickRemaining > KINDA_SMALL_NUMBER && !bJustTeleported)
{
const FVector NewVelocity = (Delta / subTimeTickRemaining);
Velocity = HasAnimRootMotion() || CurrentRootMotion.HasOverrideVelocityWithIgnoreZAccumulate() ? FVector(Velocity.X, Velocity.Y, NewVelocity.Z) : NewVelocity;
}
if (subTimeTickRemaining > KINDA_SMALL_NUMBER && (Delta | Adjusted) > 0.f)
{
// Move in deflected direction.
SafeMoveUpdatedComponent(Delta, PawnRotation, true, Hit);
if (Hit.bBlockingHit)
{
// hit second wall
LastMoveTimeSlice = subTimeTickRemaining;
subTimeTickRemaining = subTimeTickRemaining * (1.f - Hit.Time);
if (IsValidLandingSpot(VRRootCapsule->OffsetComponentToWorld.GetLocation()/*UpdatedComponent->GetComponentLocation()*/, Hit))
{
remainingTime += subTimeTickRemaining;
ProcessLanded(Hit, remainingTime, Iterations);
return;
}
HandleImpact(Hit, LastMoveTimeSlice, Delta);
// If we've changed physics mode, abort.
if (!HasValidData() || !IsFalling())
{
return;
}
// Act as if there was no air control on the last move when computing new deflection.
if (bHasLimitedAirControl && Hit.Normal.Z > VERTICAL_SLOPE_NORMAL_Z)
{
const FVector LastMoveNoAirControl = VelocityNoAirControl * LastMoveTimeSlice;
Delta = ComputeSlideVector(LastMoveNoAirControl, 1.f, OldHitNormal, Hit);
}
FVector PreTwoWallDelta = Delta;
TwoWallAdjust(Delta, Hit, OldHitNormal);
// Limit air control, but allow a slide along the second wall.
if (bHasLimitedAirControl)
{
const bool bCheckLandingSpot = false; // we already checked above.
const FVector AirControlDeltaV = LimitAirControl(subTimeTickRemaining, AirControlAccel, Hit, bCheckLandingSpot) * subTimeTickRemaining;
// Only allow if not back in to first wall
if (FVector::DotProduct(AirControlDeltaV, OldHitNormal) > 0.f)
{
Delta += (AirControlDeltaV * subTimeTickRemaining);
}
}
// Compute velocity after deflection (only gravity component for RootMotion)
if (subTimeTickRemaining > KINDA_SMALL_NUMBER && !bJustTeleported)
{
const FVector NewVelocity = (Delta / subTimeTickRemaining);
Velocity = HasAnimRootMotion() || CurrentRootMotion.HasOverrideVelocityWithIgnoreZAccumulate() ? FVector(Velocity.X, Velocity.Y, NewVelocity.Z) : NewVelocity;
}
// bDitch=true means that pawn is straddling two slopes, neither of which he can stand on
bool bDitch = ((OldHitImpactNormal.Z > 0.f) && (Hit.ImpactNormal.Z > 0.f) && (FMath::Abs(Delta.Z) <= KINDA_SMALL_NUMBER) && ((Hit.ImpactNormal | OldHitImpactNormal) < 0.f));
SafeMoveUpdatedComponent(Delta, PawnRotation, true, Hit);
if (Hit.Time == 0.f)
{
// if we are stuck then try to side step
FVector SideDelta = (OldHitNormal + Hit.ImpactNormal).GetSafeNormal2D();
if (SideDelta.IsNearlyZero())
{
SideDelta = FVector(OldHitNormal.Y, -OldHitNormal.X, 0).GetSafeNormal();
}
SafeMoveUpdatedComponent(SideDelta, PawnRotation, true, Hit);
}
if (bDitch || IsValidLandingSpot(VRRootCapsule->OffsetComponentToWorld.GetLocation()/*UpdatedComponent->GetComponentLocation()*/, Hit) || Hit.Time == 0.f)
{
remainingTime = 0.f;
ProcessLanded(Hit, remainingTime, Iterations);
return;
}
else if (GetPerchRadiusThreshold() > 0.f && Hit.Time == 1.f && OldHitImpactNormal.Z >= GetWalkableFloorZ())
{
// We might be in a virtual 'ditch' within our perch radius. This is rare.
const FVector PawnLocation = UpdatedComponent->GetComponentLocation();
const float ZMovedDist = FMath::Abs(PawnLocation.Z - OldLocation.Z);
const float MovedDist2DSq = (PawnLocation - OldLocation).SizeSquared2D();
if (ZMovedDist <= 0.2f * timeTick && MovedDist2DSq <= 4.f * timeTick)
{
Velocity.X += 0.25f * GetMaxSpeed() * (RandomStream.FRand() - 0.5f);
Velocity.Y += 0.25f * GetMaxSpeed() * (RandomStream.FRand() - 0.5f);
Velocity.Z = FMath::Max<float>(JumpZVelocity * 0.25f, 1.f);
Delta = Velocity * timeTick;
SafeMoveUpdatedComponent(Delta, PawnRotation, true, Hit);
}
}
}
}
}
}
else
{
// We are finding the floor and adjusting here now
// This matches the final falling Z up to the PhysWalking floor offset to prevent the visible hitch when going
// From falling to walking.
FindFloor(UpdatedComponent->GetComponentLocation(), CurrentFloor, false, NULL);
if (CurrentFloor.IsWalkableFloor())
{
// If the current floor distance is within the physwalking required floor offset
if (CurrentFloor.GetDistanceToFloor() < (MIN_FLOOR_DIST + MAX_FLOOR_DIST) / 2)
{
// Adjust to correct height
AdjustFloorHeight();
SetBase(CurrentFloor.HitResult.Component.Get(), CurrentFloor.HitResult.BoneName);
// If this is a valid landing spot, stop falling now so that we land correctly
if (IsValidLandingSpot(VRRootCapsule->OffsetComponentToWorld.GetLocation()/*UpdatedComponent->GetComponentLocation()*/, CurrentFloor.HitResult))
{
remainingTime += subTimeTickRemaining;
ProcessLanded(CurrentFloor.HitResult, remainingTime, Iterations);
return;
}
}
}
else if (CurrentFloor.HitResult.bStartPenetrating)
{
// The floor check failed because it started in penetration
// We do not want to try to move downward because the downward sweep failed, rather we'd like to try to pop out of the floor.
FHitResult Hitt(CurrentFloor.HitResult);
Hit.TraceEnd = Hit.TraceStart + FVector(0.f, 0.f, MAX_FLOOR_DIST);
const FVector RequestedAdjustment = GetPenetrationAdjustment(Hit);
ResolvePenetration(RequestedAdjustment, Hitt, UpdatedComponent->GetComponentQuat());
bForceNextFloorCheck = true;
}
}
if (Velocity.SizeSquared2D() <= KINDA_SMALL_NUMBER * 10.f)
{
Velocity.X = 0.f;
Velocity.Y = 0.f;
}
}
}
void UVRCharacterMovementComponent::PhysNavWalking(float deltaTime, int32 Iterations)
{
SCOPE_CYCLE_COUNTER(STAT_CharPhysNavWalking);
if (deltaTime < MIN_TICK_TIME)
{
return;
}
// Root motion not for VR
if ((!CharacterOwner || !CharacterOwner->Controller) && !bRunPhysicsWithNoController && !HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
Acceleration = FVector::ZeroVector;
Velocity = FVector::ZeroVector;
return;
}
// Rewind the players position by the new capsule location
RewindVRRelativeMovement();
RestorePreAdditiveRootMotionVelocity();
//RestorePreAdditiveVRMotionVelocity();
// Ensure velocity is horizontal.
MaintainHorizontalGroundVelocity();
devCode(ensureMsgf(!Velocity.ContainsNaN(), TEXT("PhysNavWalking: Velocity contains NaN before CalcVelocity (%s)\n%s"), *GetPathNameSafe(this), *Velocity.ToString()));
//bound acceleration
Acceleration.Z = 0.f;
//if (!HasRootMotion())
//{
CalcVelocity(deltaTime, GroundFriction, false, BrakingDecelerationWalking);
devCode(ensureMsgf(!Velocity.ContainsNaN(), TEXT("PhysNavWalking: Velocity contains NaN after CalcVelocity (%s)\n%s"), *GetPathNameSafe(this), *Velocity.ToString()));
//}
ApplyRootMotionToVelocity(deltaTime);
ApplyVRMotionToVelocity(deltaTime);
/*if (IsFalling())
{
// Root motion could have put us into Falling
StartNewPhysics(deltaTime, Iterations);
return;
}*/
Iterations++;
FVector DesiredMove = Velocity;
DesiredMove.Z = 0.f;
//const FVector OldPlayerLocation = GetActorFeetLocation();
const FVector OldLocation = GetActorFeetLocationVR();
const FVector DeltaMove = DesiredMove * deltaTime;
const bool bDeltaMoveNearlyZero = DeltaMove.IsNearlyZero();
FVector AdjustedDest = OldLocation + DeltaMove;
FNavLocation DestNavLocation;
bool bSameNavLocation = false;
if (CachedNavLocation.NodeRef != INVALID_NAVNODEREF)
{
if (bProjectNavMeshWalking)
{
const float DistSq2D = (OldLocation - CachedNavLocation.Location).SizeSquared2D();
const float DistZ = FMath::Abs(OldLocation.Z - CachedNavLocation.Location.Z);
const float TotalCapsuleHeight = CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleHalfHeight() * 2.0f;
const float ProjectionScale = (OldLocation.Z > CachedNavLocation.Location.Z) ? NavMeshProjectionHeightScaleUp : NavMeshProjectionHeightScaleDown;
const float DistZThr = TotalCapsuleHeight * FMath::Max(0.f, ProjectionScale);
bSameNavLocation = (DistSq2D <= KINDA_SMALL_NUMBER) && (DistZ < DistZThr);
}
else
{
bSameNavLocation = CachedNavLocation.Location.Equals(OldLocation);
}
if (bDeltaMoveNearlyZero && bSameNavLocation)
{
if (const INavigationDataInterface * NavData = GetNavData())
{
if (!NavData->IsNodeRefValid(CachedNavLocation.NodeRef))
{
CachedNavLocation.NodeRef = INVALID_NAVNODEREF;
bSameNavLocation = false;
}
}
}
}
if (bDeltaMoveNearlyZero && bSameNavLocation)
{
DestNavLocation = CachedNavLocation;
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("%s using cached navmesh location! (bProjectNavMeshWalking = %d)"), *GetNameSafe(CharacterOwner), bProjectNavMeshWalking);
}
else
{
SCOPE_CYCLE_COUNTER(STAT_CharNavProjectPoint);
// Start the trace from the Z location of the last valid trace.
// Otherwise if we are projecting our location to the underlying geometry and it's far above or below the navmesh,
// we'll follow that geometry's plane out of range of valid navigation.
if (bSameNavLocation && bProjectNavMeshWalking)
{
AdjustedDest.Z = CachedNavLocation.Location.Z;
}
// Find the point on the NavMesh
const bool bHasNavigationData = FindNavFloor(AdjustedDest, DestNavLocation);
if (!bHasNavigationData)
{
RestorePreAdditiveVRMotionVelocity();
SetMovementMode(MOVE_Walking);
return;
}
CachedNavLocation = DestNavLocation;
}
if (DestNavLocation.NodeRef != INVALID_NAVNODEREF)
{
FVector NewLocation(AdjustedDest.X, AdjustedDest.Y, DestNavLocation.Location.Z);
if (bProjectNavMeshWalking)
{
SCOPE_CYCLE_COUNTER(STAT_CharNavProjectLocation);
const float TotalCapsuleHeight = CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleHalfHeight() * 2.0f;
const float UpOffset = TotalCapsuleHeight * FMath::Max(0.f, NavMeshProjectionHeightScaleUp);
const float DownOffset = TotalCapsuleHeight * FMath::Max(0.f, NavMeshProjectionHeightScaleDown);
NewLocation = ProjectLocationFromNavMesh(deltaTime, OldLocation, NewLocation, UpOffset, DownOffset);
}
FVector AdjustedDelta = NewLocation - OldLocation;
if (!AdjustedDelta.IsNearlyZero())
{
// 4.16 UNCOMMENT
FHitResult HitResult;
SafeMoveUpdatedComponent(AdjustedDelta, UpdatedComponent->GetComponentQuat(), bSweepWhileNavWalking, HitResult);
/* 4.16 Delete*/
//const bool bSweep = UpdatedPrimitive ? UpdatedPrimitive->bGenerateOverlapEvents : false;
//FHitResult HitResult;
//SafeMoveUpdatedComponent(AdjustedDelta, UpdatedComponent->GetComponentQuat(), bSweep, HitResult);
// End 4.16 delete
}
// Update velocity to reflect actual move
if (!bJustTeleported && !HasAnimRootMotion() && !CurrentRootMotion.HasVelocity())
{
Velocity = (GetActorFeetLocationVR() - OldLocation) / deltaTime;
MaintainHorizontalGroundVelocity();
}
bJustTeleported = false;
}
else
{
StartFalling(Iterations, deltaTime, deltaTime, DeltaMove, OldLocation);
}
RestorePreAdditiveVRMotionVelocity();
}
void UVRCharacterMovementComponent::PhysSwimming(float deltaTime, int32 Iterations)
{
if (deltaTime < MIN_TICK_TIME)
{
return;
}
// Rewind the players position by the new capsule location
RewindVRRelativeMovement();
RestorePreAdditiveRootMotionVelocity();
float NetFluidFriction = 0.f;
float Depth = ImmersionDepth();
float NetBuoyancy = Buoyancy * Depth;
float OriginalAccelZ = Acceleration.Z;
bool bLimitedUpAccel = false;
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity() && (Velocity.Z > 0.33f * MaxSwimSpeed) && (NetBuoyancy != 0.f))
{
//damp positive Z out of water
Velocity.Z = FMath::Max(0.33f * MaxSwimSpeed, Velocity.Z * Depth*Depth);
}
else if (Depth < 0.65f)
{
bLimitedUpAccel = (Acceleration.Z > 0.f);
Acceleration.Z = FMath::Min(0.1f, Acceleration.Z);
}
Iterations++;
FVector OldLocation = UpdatedComponent->GetComponentLocation();
bJustTeleported = false;
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity())
{
const float Friction = 0.5f * GetPhysicsVolume()->FluidFriction * Depth;
CalcVelocity(deltaTime, Friction, true, GetMaxBrakingDeceleration());
Velocity.Z += GetGravityZ() * deltaTime * (1.f - NetBuoyancy);
}
ApplyRootMotionToVelocity(deltaTime);
FVector Adjusted = Velocity * deltaTime;
FHitResult Hit(1.f);
float remainingTime = deltaTime * SwimVR(Adjusted + AdditionalVRInputVector, Hit);
//may have left water - if so, script might have set new physics mode
if (!IsSwimming())
{
StartNewPhysics(remainingTime, Iterations);
return;
}
if (Hit.Time < 1.f && CharacterOwner)
{
HandleSwimmingWallHit(Hit, deltaTime);
if (bLimitedUpAccel && (Velocity.Z >= 0.f))
{
// allow upward velocity at surface if against obstacle
Velocity.Z += OriginalAccelZ * deltaTime;
Adjusted = Velocity * (1.f - Hit.Time)*deltaTime;
SwimVR(Adjusted, Hit);
if (!IsSwimming())
{
StartNewPhysics(remainingTime, Iterations);
return;
}
}
const FVector GravDir = FVector(0.f, 0.f, -1.f);
const FVector VelDir = Velocity.GetSafeNormal();
const float UpDown = GravDir | VelDir;
bool bSteppedUp = false;
if ((FMath::Abs(Hit.ImpactNormal.Z) < 0.2f) && (UpDown < 0.5f) && (UpDown > -0.2f) && CanStepUp(Hit))
{
float stepZ = UpdatedComponent->GetComponentLocation().Z;
const FVector RealVelocity = Velocity;
Velocity.Z = 1.f; // HACK: since will be moving up, in case pawn leaves the water
bSteppedUp = StepUp(GravDir, (Adjusted + AdditionalVRInputVector) * (1.f - Hit.Time), Hit);
if (bSteppedUp)
{
//may have left water - if so, script might have set new physics mode
if (!IsSwimming())
{
StartNewPhysics(remainingTime, Iterations);
return;
}
OldLocation.Z = UpdatedComponent->GetComponentLocation().Z + (OldLocation.Z - stepZ);
}
Velocity = RealVelocity;
}
if (!bSteppedUp)
{
//adjust and try again
HandleImpact(Hit, deltaTime, Adjusted);
SlideAlongSurface(Adjusted, (1.f - Hit.Time), Hit.Normal, Hit, true);
}
}
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity() && !bJustTeleported && ((deltaTime - remainingTime) > KINDA_SMALL_NUMBER) && CharacterOwner)
{
bool bWaterJump = !GetPhysicsVolume()->bWaterVolume;
float velZ = Velocity.Z;
Velocity = ((UpdatedComponent->GetComponentLocation() - OldLocation) - AdditionalVRInputVector) / (deltaTime - remainingTime);
if (bWaterJump)
{
Velocity.Z = velZ;
}
}
if (!GetPhysicsVolume()->bWaterVolume && IsSwimming())
{
SetMovementMode(MOVE_Falling); //in case script didn't change it (w/ zone change)
}
//may have left water - if so, script might have set new physics mode
if (!IsSwimming())
{
StartNewPhysics(remainingTime, Iterations);
}
}
void UVRCharacterMovementComponent::StartSwimmingVR(FVector OldLocation, FVector OldVelocity, float timeTick, float remainingTime, int32 Iterations)
{
if (remainingTime < MIN_TICK_TIME || timeTick < MIN_TICK_TIME)
{
return;
}
FVector NewLocation = VRRootCapsule ? VRRootCapsule->OffsetComponentToWorld.GetLocation() : UpdatedComponent->GetComponentLocation();
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity() && !bJustTeleported)
{
Velocity = (NewLocation - OldLocation) / timeTick; //actual average velocity
Velocity = 2.f*Velocity - OldVelocity; //end velocity has 2* accel of avg
Velocity = Velocity.GetClampedToMaxSize(GetPhysicsVolume()->TerminalVelocity);
}
const FVector End = FindWaterLine(NewLocation, OldLocation);
float waterTime = 0.f;
if (End != NewLocation)
{
const float ActualDist = (NewLocation - OldLocation).Size();
if (ActualDist > KINDA_SMALL_NUMBER)
{
waterTime = timeTick * (End - NewLocation).Size() / ActualDist;
remainingTime += waterTime;
}
MoveUpdatedComponent(End - NewLocation, UpdatedComponent->GetComponentQuat(), true);
}
if (!HasAnimRootMotion() && !CurrentRootMotion.HasOverrideVelocity() && (Velocity.Z > 2.f*SWIMBOBSPEED) && (Velocity.Z < 0.f)) //allow for falling out of water
{
Velocity.Z = SWIMBOBSPEED - Velocity.Size2D() * 0.7f; //smooth bobbing
}
if ((remainingTime >= MIN_TICK_TIME) && (Iterations < MaxSimulationIterations))
{
PhysSwimming(remainingTime, Iterations);
}
}
float UVRCharacterMovementComponent::SwimVR(FVector Delta, FHitResult& Hit)
{
FVector Start = VRRootCapsule ? VRRootCapsule->OffsetComponentToWorld.GetLocation() : UpdatedComponent->GetComponentLocation();
float airTime = 0.f;
SafeMoveUpdatedComponent(Delta, UpdatedComponent->GetComponentQuat(), true, Hit);
if (!GetPhysicsVolume()->bWaterVolume) //then left water
{
FVector NewLoc = VRRootCapsule ? VRRootCapsule->OffsetComponentToWorld.GetLocation() : UpdatedComponent->GetComponentLocation();
const FVector End = FindWaterLine(Start, NewLoc);
const float DesiredDist = Delta.Size();
if (End != NewLoc && DesiredDist > KINDA_SMALL_NUMBER)
{
airTime = (End - NewLoc).Size() / DesiredDist;
if (((NewLoc - Start) | (End - NewLoc)) > 0.f)
{
airTime = 0.f;
}
SafeMoveUpdatedComponent(End - NewLoc, UpdatedComponent->GetComponentQuat(), true, Hit);
}
}
return airTime;
}
bool UVRCharacterMovementComponent::CheckWaterJump(FVector CheckPoint, FVector& WallNormal)
{
if (!HasValidData())
{
return false;
}
FVector currentLoc = VRRootCapsule ? VRRootCapsule->OffsetComponentToWorld.GetLocation() : UpdatedComponent->GetComponentLocation();
// check if there is a wall directly in front of the swimming pawn
CheckPoint.Z = 0.f;
FVector CheckNorm = CheckPoint.GetSafeNormal();
float PawnCapsuleRadius, PawnCapsuleHalfHeight;
CharacterOwner->GetCapsuleComponent()->GetScaledCapsuleSize(PawnCapsuleRadius, PawnCapsuleHalfHeight);
CheckPoint = currentLoc + 1.2f * PawnCapsuleRadius * CheckNorm;
FVector Extent(PawnCapsuleRadius, PawnCapsuleRadius, PawnCapsuleHalfHeight);
FHitResult HitInfo(1.f);
FCollisionQueryParams CapsuleParams(SCENE_QUERY_STAT(CheckWaterJump), false, CharacterOwner);
FCollisionResponseParams ResponseParam;
InitCollisionParams(CapsuleParams, ResponseParam);
FCollisionShape CapsuleShape = GetPawnCapsuleCollisionShape(SHRINK_None);
const ECollisionChannel CollisionChannel = UpdatedComponent->GetCollisionObjectType();
bool bHit = GetWorld()->SweepSingleByChannel(HitInfo, currentLoc, CheckPoint, FQuat::Identity, CollisionChannel, CapsuleShape, CapsuleParams, ResponseParam);
if (bHit && !Cast<APawn>(HitInfo.GetActor()))
{
// hit a wall - check if it is low enough
WallNormal = -1.f * HitInfo.ImpactNormal;
FVector Start = currentLoc;//UpdatedComponent->GetComponentLocation();
Start.Z += MaxOutOfWaterStepHeight;
CheckPoint = Start + 3.2f * PawnCapsuleRadius * WallNormal;
FCollisionQueryParams LineParams(SCENE_QUERY_STAT(CheckWaterJump), true, CharacterOwner);
FCollisionResponseParams LineResponseParam;
InitCollisionParams(LineParams, LineResponseParam);
bHit = GetWorld()->LineTraceSingleByChannel(HitInfo, Start, CheckPoint, CollisionChannel, LineParams, LineResponseParam);
// if no high obstruction, or it's a valid floor, then pawn can jump out of water
return !bHit || IsWalkable(HitInfo);
}
return false;
}
FBasedPosition UVRCharacterMovementComponent::GetActorFeetLocationBased() const
{
return FBasedPosition(NULL, GetActorFeetLocationVR());
}
void UVRCharacterMovementComponent::ProcessLanded(const FHitResult& Hit, float remainingTime, int32 Iterations)
{
SCOPE_CYCLE_COUNTER(STAT_CharProcessLanded);
if (CharacterOwner && CharacterOwner->ShouldNotifyLanded(Hit))
{
CharacterOwner->Landed(Hit);
}
if (IsFalling())
{
if (GetGroundMovementMode() == MOVE_NavWalking)
{
// verify navmesh projection and current floor
// otherwise movement will be stuck in infinite loop:
// navwalking -> (no navmesh) -> falling -> (standing on something) -> navwalking -> ....
const FVector TestLocation = GetActorFeetLocationVR();
FNavLocation NavLocation;
const bool bHasNavigationData = FindNavFloor(TestLocation, NavLocation);
if (!bHasNavigationData || NavLocation.NodeRef == INVALID_NAVNODEREF)
{
SetGroundMovementMode(MOVE_Walking);
//GroundMovementMode = MOVE_Walking;
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("ProcessLanded(): %s tried to go to NavWalking but couldn't find NavMesh! Using Walking instead."), *GetNameSafe(CharacterOwner));
}
}
SetPostLandedPhysics(Hit);
}
IPathFollowingAgentInterface* PFAgent = GetPathFollowingAgent();
if (PFAgent)
{
PFAgent->OnLanded();
}
StartNewPhysics(remainingTime, Iterations);
}
///////////////////////////
// End Navigation Functions
///////////////////////////
void UVRCharacterMovementComponent::PostPhysicsTickComponent(float DeltaTime, FCharacterMovementComponentPostPhysicsTickFunction& ThisTickFunction)
{
if (bDeferUpdateBasedMovement)
{
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
UpdateBasedMovement(DeltaTime);
SaveBaseLocation();
bDeferUpdateBasedMovement = false;
}
}
void UVRCharacterMovementComponent::SimulateMovement(float DeltaSeconds)
{
if (!HasValidData() || UpdatedComponent->Mobility != EComponentMobility::Movable || UpdatedComponent->IsSimulatingPhysics())
{
return;
}
const bool bIsSimulatedProxy = (CharacterOwner->GetLocalRole() == ROLE_SimulatedProxy);
const FRepMovement& ConstRepMovement = CharacterOwner->GetReplicatedMovement();
// Workaround for replication not being updated initially
if (bIsSimulatedProxy &&
ConstRepMovement.Location.IsZero() &&
ConstRepMovement.Rotation.IsZero() &&
ConstRepMovement.LinearVelocity.IsZero())
{
return;
}
// If base is not resolved on the client, we should not try to simulate at all
if (CharacterOwner->GetReplicatedBasedMovement().IsBaseUnresolved())
{
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Base for simulated character '%s' is not resolved on client, skipping SimulateMovement"), *CharacterOwner->GetName());
return;
}
FVector OldVelocity;
FVector OldLocation;
// Scoped updates can improve performance of multiple MoveComponent calls.
{
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
bool bHandledNetUpdate = false;
if (bIsSimulatedProxy)
{
// Handle network changes
if (bNetworkUpdateReceived)
{
bNetworkUpdateReceived = false;
bHandledNetUpdate = true;
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Proxy %s received net update"), *GetNameSafe(CharacterOwner));
if (bNetworkMovementModeChanged)
{
ApplyNetworkMovementMode(CharacterOwner->GetReplicatedMovementMode());
bNetworkMovementModeChanged = false;
}
else if (bJustTeleported || bForceNextFloorCheck)
{
// Make sure floor is current. We will continue using the replicated base, if there was one.
bJustTeleported = false;
UpdateFloorFromAdjustment();
}
}
else if (bForceNextFloorCheck)
{
UpdateFloorFromAdjustment();
}
}
UpdateCharacterStateBeforeMovement(DeltaSeconds);
if (MovementMode != MOVE_None)
{
//TODO: Also ApplyAccumulatedForces()?
HandlePendingLaunch();
}
ClearAccumulatedForces();
if (MovementMode == MOVE_None)
{
return;
}
const bool bSimGravityDisabled = (bIsSimulatedProxy && CharacterOwner->bSimGravityDisabled);
const bool bZeroReplicatedGroundVelocity = (bIsSimulatedProxy && IsMovingOnGround() && ConstRepMovement.LinearVelocity.IsZero());
// bSimGravityDisabled means velocity was zero when replicated and we were stuck in something. Avoid external changes in velocity as well.
// Being in ground movement with zero velocity, we cannot simulate proxy velocities safely because we might not get any further updates from the server.
if (bSimGravityDisabled || bZeroReplicatedGroundVelocity)
{
Velocity = FVector::ZeroVector;
}
MaybeUpdateBasedMovement(DeltaSeconds);
// simulated pawns predict location
OldVelocity = Velocity;
OldLocation = UpdatedComponent->GetComponentLocation();
UpdateProxyAcceleration();
static const auto CVarNetEnableSkipProxyPredictionOnNetUpdate = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetEnableSkipProxyPredictionOnNetUpdate"));
// May only need to simulate forward on frames where we haven't just received a new position update.
if (!bHandledNetUpdate || !bNetworkSkipProxyPredictionOnNetUpdate || !CVarNetEnableSkipProxyPredictionOnNetUpdate->GetInt())
{
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Proxy %s simulating movement"), *GetNameSafe(CharacterOwner));
FStepDownResult StepDownResult;
MoveSmooth(Velocity, DeltaSeconds, &StepDownResult);
// find floor and check if falling
if (IsMovingOnGround() || MovementMode == MOVE_Falling)
{
if (StepDownResult.bComputedFloor)
{
CurrentFloor = StepDownResult.FloorResult;
}
else if (Velocity.Z <= 0.f)
{
FindFloor(UpdatedComponent->GetComponentLocation(), CurrentFloor, Velocity.IsZero(), NULL);
}
else
{
CurrentFloor.Clear();
}
if (!CurrentFloor.IsWalkableFloor())
{
if (!bSimGravityDisabled)
{
// No floor, must fall.
if (Velocity.Z <= 0.f || bApplyGravityWhileJumping || !CharacterOwner->IsJumpProvidingForce())
{
Velocity = NewFallVelocity(Velocity, FVector(0.f, 0.f, GetGravityZ()), DeltaSeconds);
}
}
SetMovementMode(MOVE_Falling);
}
else
{
// Walkable floor
if (IsMovingOnGround())
{
AdjustFloorHeight();
SetBase(CurrentFloor.HitResult.Component.Get(), CurrentFloor.HitResult.BoneName);
}
else if (MovementMode == MOVE_Falling)
{
if (CurrentFloor.FloorDist <= MIN_FLOOR_DIST || (bSimGravityDisabled && CurrentFloor.FloorDist <= MAX_FLOOR_DIST))
{
// Landed
SetPostLandedPhysics(CurrentFloor.HitResult);
}
else
{
if (!bSimGravityDisabled)
{
// Continue falling.
Velocity = NewFallVelocity(Velocity, FVector(0.f, 0.f, GetGravityZ()), DeltaSeconds);
}
CurrentFloor.Clear();
}
}
}
}
}
else
{
UE_LOG(LogVRCharacterMovement, Verbose, TEXT("Proxy %s SKIPPING simulate movement"), *GetNameSafe(CharacterOwner));
}
UpdateCharacterStateAfterMovement(DeltaSeconds);
// consume path following requested velocity
bHasRequestedVelocity = false;
OnMovementUpdated(DeltaSeconds, OldLocation, OldVelocity);
} // End scoped movement update
// Call custom post-movement events. These happen after the scoped movement completes in case the events want to use the current state of overlaps etc.
CallMovementUpdateDelegate(DeltaSeconds, OldLocation, OldVelocity);
SaveBaseLocation();
UpdateComponentVelocity();
bJustTeleported = false;
LastUpdateLocation = UpdatedComponent ? UpdatedComponent->GetComponentLocation() : FVector::ZeroVector;
LastUpdateRotation = UpdatedComponent ? UpdatedComponent->GetComponentQuat() : FQuat::Identity;
LastUpdateVelocity = Velocity;
}
void UVRCharacterMovementComponent::MoveSmooth(const FVector& InVelocity, const float DeltaSeconds, FStepDownResult* OutStepDownResult)
{
if (!HasValidData())
{
return;
}
// Custom movement mode.
// Custom movement may need an update even if there is zero velocity.
if (MovementMode == MOVE_Custom)
{
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
PhysCustom(DeltaSeconds, 0);
return;
}
FVector Delta = InVelocity * DeltaSeconds;
if (Delta.IsZero())
{
return;
}
FVRCharacterScopedMovementUpdate ScopedMovementUpdate(UpdatedComponent, bEnableScopedMovementUpdates ? EScopedUpdate::DeferredUpdates : EScopedUpdate::ImmediateUpdates);
if (IsMovingOnGround())
{
MoveAlongFloor(InVelocity, DeltaSeconds, OutStepDownResult);
}
else
{
FHitResult Hit(1.f);
SafeMoveUpdatedComponent(Delta, UpdatedComponent->GetComponentQuat(), true, Hit);
if (Hit.IsValidBlockingHit())
{
bool bSteppedUp = false;
if (IsFlying())
{
if (CanStepUp(Hit))
{
OutStepDownResult = NULL; // No need for a floor when not walking.
if (FMath::Abs(Hit.ImpactNormal.Z) < 0.2f)
{
const FVector GravDir = FVector(0.f, 0.f, -1.f);
const FVector DesiredDir = Delta.GetSafeNormal();
const float UpDown = GravDir | DesiredDir;
if ((UpDown < 0.5f) && (UpDown > -0.2f))
{
bSteppedUp = StepUp(GravDir, Delta * (1.f - Hit.Time), Hit, OutStepDownResult);
}
}
}
}
// If StepUp failed, try sliding.
if (!bSteppedUp)
{
SlideAlongSurface(Delta, 1.f - Hit.Time, Hit.Normal, Hit, false);
}
}
}
}
void UVRCharacterMovementComponent::SendClientAdjustment()
{
if (!HasValidData())
{
return;
}
FNetworkPredictionData_Server_Character* ServerData = GetPredictionData_Server_Character();
check(ServerData);
if (ServerData->PendingAdjustment.TimeStamp <= 0.f)
{
return;
}
const float CurrentTime = GetWorld()->GetTimeSeconds();
if (ServerData->PendingAdjustment.bAckGoodMove)
{
// just notify client this move was received
if (CurrentTime - ServerLastClientGoodMoveAckTime > NetworkMinTimeBetweenClientAckGoodMoves)
{
ServerLastClientGoodMoveAckTime = CurrentTime;
ClientAckGoodMove(ServerData->PendingAdjustment.TimeStamp);
}
}
else
{
// We won't be back in here until the next client move and potential correction is received, so use the correct time now.
// Protect against bad data by taking appropriate min/max of editable values.
const float AdjustmentTimeThreshold = bNetworkLargeClientCorrection ?
FMath::Min(NetworkMinTimeBetweenClientAdjustmentsLargeCorrection, NetworkMinTimeBetweenClientAdjustments) :
FMath::Max(NetworkMinTimeBetweenClientAdjustmentsLargeCorrection, NetworkMinTimeBetweenClientAdjustments);
// Check if correction is throttled based on time limit between updates.
if (CurrentTime - ServerLastClientAdjustmentTime > AdjustmentTimeThreshold)
{
ServerLastClientAdjustmentTime = CurrentTime;
const bool bIsPlayingNetworkedRootMotionMontage = CharacterOwner->IsPlayingNetworkedRootMotionMontage();
if (HasRootMotionSources())
{
FRotator Rotation = ServerData->PendingAdjustment.NewRot.GetNormalized();
FVector_NetQuantizeNormal CompressedRotation(Rotation.Pitch / 180.f, Rotation.Yaw / 180.f, Rotation.Roll / 180.f);
ClientAdjustRootMotionSourcePosition
(
ServerData->PendingAdjustment.TimeStamp,
CurrentRootMotion,
bIsPlayingNetworkedRootMotionMontage,
bIsPlayingNetworkedRootMotionMontage ? CharacterOwner->GetRootMotionAnimMontageInstance()->GetPosition() : -1.f,
ServerData->PendingAdjustment.NewLoc,
CompressedRotation,
ServerData->PendingAdjustment.NewVel.Z,
ServerData->PendingAdjustment.NewBase,
ServerData->PendingAdjustment.NewBaseBoneName,
ServerData->PendingAdjustment.NewBase != NULL,
ServerData->PendingAdjustment.bBaseRelativePosition,
PackNetworkMovementMode()
);
}
else if (bIsPlayingNetworkedRootMotionMontage)
{
FRotator Rotation = ServerData->PendingAdjustment.NewRot.GetNormalized();
FVector_NetQuantizeNormal CompressedRotation(Rotation.Pitch / 180.f, Rotation.Yaw / 180.f, Rotation.Roll / 180.f);
ClientAdjustRootMotionPosition
(
ServerData->PendingAdjustment.TimeStamp,
CharacterOwner->GetRootMotionAnimMontageInstance()->GetPosition(),
ServerData->PendingAdjustment.NewLoc,
CompressedRotation,
ServerData->PendingAdjustment.NewVel.Z,
ServerData->PendingAdjustment.NewBase,
ServerData->PendingAdjustment.NewBaseBoneName,
ServerData->PendingAdjustment.NewBase != NULL,
ServerData->PendingAdjustment.bBaseRelativePosition,
PackNetworkMovementMode()
);
}
else if (ServerData->PendingAdjustment.NewVel.IsZero())
{
ClientVeryShortAdjustPositionVR
(
ServerData->PendingAdjustment.TimeStamp,
ServerData->PendingAdjustment.NewLoc,
FRotator::CompressAxisToShort(ServerData->PendingAdjustment.NewRot.Yaw),
ServerData->PendingAdjustment.NewBase,
ServerData->PendingAdjustment.NewBaseBoneName,
ServerData->PendingAdjustment.NewBase != NULL,
ServerData->PendingAdjustment.bBaseRelativePosition,
PackNetworkMovementMode()
);
}
else
{
ClientAdjustPositionVR
(
ServerData->PendingAdjustment.TimeStamp,
ServerData->PendingAdjustment.NewLoc,
FRotator::CompressAxisToShort(ServerData->PendingAdjustment.NewRot.Yaw),
ServerData->PendingAdjustment.NewVel,
ServerData->PendingAdjustment.NewBase,
ServerData->PendingAdjustment.NewBaseBoneName,
ServerData->PendingAdjustment.NewBase != NULL,
ServerData->PendingAdjustment.bBaseRelativePosition,
PackNetworkMovementMode()
);
}
}
}
ServerData->PendingAdjustment.TimeStamp = 0;
ServerData->PendingAdjustment.bAckGoodMove = false;
ServerData->bForceClientUpdate = false;
}
void UVRCharacterMovementComponent::ClientVeryShortAdjustPositionVR(float TimeStamp, FVector NewLoc, uint16 NewYaw, UPrimitiveComponent* NewBase, FName NewBaseBoneName, bool bHasBase, bool bBaseRelativePosition, uint8 ServerMovementMode)
{
((AVRCharacter*)CharacterOwner)->ClientVeryShortAdjustPositionVR(TimeStamp, NewLoc, NewYaw, NewBase, NewBaseBoneName, bHasBase, bBaseRelativePosition, ServerMovementMode);
}
void UVRCharacterMovementComponent::ClientVeryShortAdjustPositionVR_Implementation
(
float TimeStamp,
FVector NewLoc,
uint16 NewYaw,
UPrimitiveComponent* NewBase,
FName NewBaseBoneName,
bool bHasBase,
bool bBaseRelativePosition,
uint8 ServerMovementMode
)
{
if (HasValidData())
{
ClientAdjustPositionVR(TimeStamp, NewLoc, NewYaw, FVector::ZeroVector, NewBase, NewBaseBoneName, bHasBase, bBaseRelativePosition, ServerMovementMode);
}
}
void UVRCharacterMovementComponent::ClientAdjustPositionVR(float TimeStamp, FVector NewLoc, uint16 NewYaw, FVector NewVel, UPrimitiveComponent* NewBase, FName NewBaseBoneName, bool bHasBase, bool bBaseRelativePosition, uint8 ServerMovementMode)
{
((AVRCharacter*)CharacterOwner)->ClientAdjustPositionVR(TimeStamp, NewLoc, NewYaw, NewVel, NewBase, NewBaseBoneName, bHasBase, bBaseRelativePosition, ServerMovementMode);
}
void UVRCharacterMovementComponent::ClientAdjustPositionVR_Implementation
(
float TimeStamp,
FVector NewLocation,
uint16 NewYaw,
FVector NewVelocity,
UPrimitiveComponent* NewBase,
FName NewBaseBoneName,
bool bHasBase,
bool bBaseRelativePosition,
uint8 ServerMovementMode
)
{
if (!HasValidData() || !IsActive())
{
return;
}
FNetworkPredictionData_Client_Character* ClientData = GetPredictionData_Client_Character();
check(ClientData);
// Make sure the base actor exists on this client.
const bool bUnresolvedBase = bHasBase && (NewBase == NULL);
if (bUnresolvedBase)
{
if (bBaseRelativePosition)
{
UE_LOG(LogNetPlayerMovement, Warning, TEXT("ClientAdjustPosition_Implementation could not resolve the new relative movement base actor, ignoring server correction! Client currently at world location %s on base %s"),
*UpdatedComponent->GetComponentLocation().ToString(), *GetNameSafe(GetMovementBase()));
return;
}
else
{
UE_LOG(LogNetPlayerMovement, Verbose, TEXT("ClientAdjustPosition_Implementation could not resolve the new absolute movement base actor, but WILL use the position!"));
}
}
// Ack move if it has not expired.
int32 MoveIndex = ClientData->GetSavedMoveIndex(TimeStamp);
if (MoveIndex == INDEX_NONE)
{
if (ClientData->LastAckedMove.IsValid())
{
UE_LOG(LogNetPlayerMovement, Log, TEXT("ClientAdjustPosition_Implementation could not find Move for TimeStamp: %f, LastAckedTimeStamp: %f, CurrentTimeStamp: %f"), TimeStamp, ClientData->LastAckedMove->TimeStamp, ClientData->CurrentTimeStamp);
}
return;
}
if (!bUseClientControlRotation)
{
float YawValue = FRotator::DecompressAxisFromShort(NewYaw);
// Trust the server's control yaw
if (ClientData->LastAckedMove.IsValid() && !FMath::IsNearlyEqual(ClientData->LastAckedMove->SavedControlRotation.Yaw, YawValue))
{
if (BaseVRCharacterOwner)
{
if (BaseVRCharacterOwner->bUseControllerRotationYaw)
{
AController * myController = BaseVRCharacterOwner->GetController();
if (myController)
{
//FRotator newRot = myController->GetControlRotation();
myController->SetControlRotation(FRotator(0.f, YawValue, 0.f));//(ClientData->LastAckedMove->SavedControlRotation);
}
}
BaseVRCharacterOwner->SetActorRotation(FRotator(0.f, YawValue, 0.f));
}
}
}
ClientData->AckMove(MoveIndex, *this);
FVector WorldShiftedNewLocation;
// Received Location is relative to dynamic base
if (bBaseRelativePosition)
{
FVector BaseLocation;
FQuat BaseRotation;
MovementBaseUtility::GetMovementBaseTransform(NewBase, NewBaseBoneName, BaseLocation, BaseRotation); // TODO: error handling if returns false
WorldShiftedNewLocation = NewLocation + BaseLocation;
}
else
{
WorldShiftedNewLocation = FRepMovement::RebaseOntoLocalOrigin(NewLocation, this);
}
// Trigger event
OnClientCorrectionReceived(*ClientData, TimeStamp, WorldShiftedNewLocation, NewVelocity, NewBase, NewBaseBoneName, bHasBase, bBaseRelativePosition, ServerMovementMode);
// Trust the server's positioning.
if (UpdatedComponent)
{
UpdatedComponent->SetWorldLocation(WorldShiftedNewLocation, false, nullptr, ETeleportType::TeleportPhysics);
}
Velocity = NewVelocity;
// Trust the server's movement mode
UPrimitiveComponent* PreviousBase = CharacterOwner->GetMovementBase();
ApplyNetworkMovementMode(ServerMovementMode);
// Set base component
UPrimitiveComponent* FinalBase = NewBase;
FName FinalBaseBoneName = NewBaseBoneName;
if (bUnresolvedBase)
{
check(NewBase == NULL);
check(!bBaseRelativePosition);
// We had an unresolved base from the server
// If walking, we'd like to continue walking if possible, to avoid falling for a frame, so try to find a base where we moved to.
if (PreviousBase && UpdatedComponent)
{
FindFloor(UpdatedComponent->GetComponentLocation(), CurrentFloor, false);
if (CurrentFloor.IsWalkableFloor())
{
FinalBase = CurrentFloor.HitResult.Component.Get();
FinalBaseBoneName = CurrentFloor.HitResult.BoneName;
}
else
{
FinalBase = nullptr;
FinalBaseBoneName = NAME_None;
}
}
}
SetBase(FinalBase, FinalBaseBoneName);
// Update floor at new location
UpdateFloorFromAdjustment();
bJustTeleported = true;
// Even if base has not changed, we need to recompute the relative offsets (since we've moved).
SaveBaseLocation();
LastUpdateLocation = UpdatedComponent ? UpdatedComponent->GetComponentLocation() : FVector::ZeroVector;
LastUpdateRotation = UpdatedComponent ? UpdatedComponent->GetComponentQuat() : FQuat::Identity;
LastUpdateVelocity = Velocity;
UpdateComponentVelocity();
ClientData->bUpdatePosition = true;
}
bool UVRCharacterMovementComponent::ServerCheckClientErrorVR(float ClientTimeStamp, float DeltaTime, const FVector& Accel, const FVector& ClientWorldLocation, float ClientYaw, const FVector& RelativeClientLocation, UPrimitiveComponent* ClientMovementBase, FName ClientBaseBoneName, uint8 ClientMovementMode)
{
// Check location difference against global setting
if (!bIgnoreClientMovementErrorChecksAndCorrection)
{
//const FVector LocDiff = UpdatedComponent->GetComponentLocation() - ClientWorldLocation;
#if ROOT_MOTION_DEBUG
if (RootMotionSourceDebug::CVarDebugRootMotionSources.GetValueOnAnyThread() == 1)
{
const FVector LocDiff = UpdatedComponent->GetComponentLocation() - ClientWorldLocation;
FString AdjustedDebugString = FString::Printf(TEXT("ServerCheckClientError LocDiff(%.1f) ExceedsAllowablePositionError(%d) TimeStamp(%f)"),
LocDiff.Size(), GetDefault<AGameNetworkManager>()->ExceedsAllowablePositionError(LocDiff), ClientTimeStamp);
RootMotionSourceDebug::PrintOnScreen(*CharacterOwner, AdjustedDebugString);
}
#endif
if (ServerExceedsAllowablePositionError(ClientTimeStamp, DeltaTime, Accel, ClientWorldLocation, RelativeClientLocation, ClientMovementBase, ClientBaseBoneName, ClientMovementMode))
{
return true;
}
#if !(UE_BUILD_SHIPPING || UE_BUILD_TEST)
static const auto CVarNetForceClientAdjustmentPercent = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetForceClientAdjustmentPercent"));
if (CVarNetForceClientAdjustmentPercent->GetFloat() > SMALL_NUMBER)
{
if (RandomStream.FRand() < CVarNetForceClientAdjustmentPercent->GetFloat())
{
UE_LOG(LogVRCharacterMovement, VeryVerbose, TEXT("** ServerCheckClientError forced by p.NetForceClientAdjustmentPercent"));
return true;
}
}
#endif
}
else
{
#if !UE_BUILD_SHIPPING
static const auto CVarNetShowCorrections = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetShowCorrections"));
if (CVarNetShowCorrections->GetInt() != 0)
{
UE_LOG(LogVRCharacterMovement, Warning, TEXT("*** Server: %s is set to ignore error checks and corrections."), *GetNameSafe(CharacterOwner));
}
#endif // !UE_BUILD_SHIPPING
}
// If we are rolling back client rotation
if (!bUseClientControlRotation && !FMath::IsNearlyEqual(FRotator::ClampAxis(ClientYaw), FRotator::ClampAxis(UpdatedComponent->GetComponentRotation().Yaw), CharacterMovementComponentStatics::fRotationCorrectionThreshold))
{
return true;
}
return false;
}
void UVRCharacterMovementComponent::ServerMoveHandleClientErrorVR(float ClientTimeStamp, float DeltaTime, const FVector& Accel, const FVector& RelativeClientLoc, float ClientYaw, UPrimitiveComponent* ClientMovementBase, FName ClientBaseBoneName, uint8 ClientMovementMode)
{
if (RelativeClientLoc == FVector(1.f, 2.f, 3.f)) // first part of double servermove
{
return;
}
FNetworkPredictionData_Server_Character* ServerData = GetPredictionData_Server_Character();
check(ServerData);
// Don't prevent more recent updates from being sent if received this frame.
// We're going to send out an update anyway, might as well be the most recent one.
APlayerController* PC = Cast<APlayerController>(CharacterOwner->GetController());
if ((ServerData->LastUpdateTime != GetWorld()->TimeSeconds))
{
const AGameNetworkManager* GameNetworkManager = (const AGameNetworkManager*)(AGameNetworkManager::StaticClass()->GetDefaultObject());
if (GameNetworkManager->WithinUpdateDelayBounds(PC, ServerData->LastUpdateTime))
{
return;
}
}
// Offset may be relative to base component
FVector ClientLoc = RelativeClientLoc;
if (MovementBaseUtility::UseRelativeLocation(ClientMovementBase))
{
FVector BaseLocation;
FQuat BaseRotation;
MovementBaseUtility::GetMovementBaseTransform(ClientMovementBase, ClientBaseBoneName, BaseLocation, BaseRotation);
ClientLoc += BaseLocation;
}
// Client may send a null movement base when walking on bases with no relative location (to save bandwidth).
// In this case don't check movement base in error conditions, use the server one (which avoids an error based on differing bases). Position will still be validated.
if (ClientMovementBase == nullptr && ClientMovementMode == MOVE_Walking)
{
ClientMovementBase = CharacterOwner->GetBasedMovement().MovementBase;
ClientBaseBoneName = CharacterOwner->GetBasedMovement().BoneName;
}
// Compute the client error from the server's position
// If client has accumulated a noticeable positional error, correct them.
bNetworkLargeClientCorrection = ServerData->bForceClientUpdate;
if (ServerData->bForceClientUpdate || ServerCheckClientErrorVR(ClientTimeStamp, DeltaTime, Accel, ClientLoc, ClientYaw, RelativeClientLoc, ClientMovementBase, ClientBaseBoneName, ClientMovementMode))
{
UPrimitiveComponent* MovementBase = CharacterOwner->GetMovementBase();
ServerData->PendingAdjustment.NewVel = Velocity;
ServerData->PendingAdjustment.NewBase = MovementBase;
ServerData->PendingAdjustment.NewBaseBoneName = CharacterOwner->GetBasedMovement().BoneName;
ServerData->PendingAdjustment.NewLoc = FRepMovement::RebaseOntoZeroOrigin(UpdatedComponent->GetComponentLocation(), this);
ServerData->PendingAdjustment.NewRot = UpdatedComponent->GetComponentRotation();
ServerData->PendingAdjustment.bBaseRelativePosition = MovementBaseUtility::UseRelativeLocation(MovementBase);
if (ServerData->PendingAdjustment.bBaseRelativePosition)
{
// Relative location
ServerData->PendingAdjustment.NewLoc = CharacterOwner->GetBasedMovement().Location;
// TODO: this could be a relative rotation, but all client corrections ignore rotation right now except the root motion one, which would need to be updated.
//ServerData->PendingAdjustment.NewRot = CharacterOwner->GetBasedMovement().Rotation;
}
#if !UE_BUILD_SHIPPING
static const auto CVarNetShowCorrections = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetShowCorrections"));
static const auto CVarNetCorrectionLifetime = IConsoleManager::Get().FindConsoleVariable(TEXT("p.NetCorrectionLifetime"));
if (CVarNetShowCorrections->GetInt() != 0)
{
const FVector LocDiff = UpdatedComponent->GetComponentLocation() - ClientLoc;
const FString BaseString = MovementBase ? MovementBase->GetPathName(MovementBase->GetOutermost()) : TEXT("None");
UE_LOG(LogVRCharacterMovement, Warning, TEXT("*** Server: Error for %s at Time=%.3f is %3.3f LocDiff(%s) ClientLoc(%s) ServerLoc(%s) Base: %s Bone: %s Accel(%s) Velocity(%s)"),
*GetNameSafe(CharacterOwner), ClientTimeStamp, LocDiff.Size(), *LocDiff.ToString(), *ClientLoc.ToString(), *UpdatedComponent->GetComponentLocation().ToString(), *BaseString, *ServerData->PendingAdjustment.NewBaseBoneName.ToString(), *Accel.ToString(), *Velocity.ToString());
const float DebugLifetime = CVarNetCorrectionLifetime->GetFloat();
DrawDebugCapsule(GetWorld(), UpdatedComponent->GetComponentLocation(), CharacterOwner->GetSimpleCollisionHalfHeight(), CharacterOwner->GetSimpleCollisionRadius(), FQuat::Identity, FColor(100, 255, 100), false, DebugLifetime);
DrawDebugCapsule(GetWorld(), ClientLoc, CharacterOwner->GetSimpleCollisionHalfHeight(), CharacterOwner->GetSimpleCollisionRadius(), FQuat::Identity, FColor(255, 100, 100), false, DebugLifetime);
}
#endif
ServerData->LastUpdateTime = GetWorld()->TimeSeconds;
ServerData->PendingAdjustment.DeltaTime = DeltaTime;
ServerData->PendingAdjustment.TimeStamp = ClientTimeStamp;
ServerData->PendingAdjustment.bAckGoodMove = false;
ServerData->PendingAdjustment.MovementMode = PackNetworkMovementMode();
//PerfCountersIncrement(PerfCounter_NumServerMoveCorrections);
}
else
{
if (ServerShouldUseAuthoritativePosition(ClientTimeStamp, DeltaTime, Accel, ClientLoc, RelativeClientLoc, ClientMovementBase, ClientBaseBoneName, ClientMovementMode))
{
const FVector LocDiff = UpdatedComponent->GetComponentLocation() - ClientLoc; //-V595
if (!LocDiff.IsZero() || ClientMovementMode != PackNetworkMovementMode() || GetMovementBase() != ClientMovementBase || (CharacterOwner && CharacterOwner->GetBasedMovement().BoneName != ClientBaseBoneName))
{
// Just set the position. On subsequent moves we will resolve initially overlapping conditions.
UpdatedComponent->SetWorldLocation(ClientLoc, false); //-V595
// Trust the client's movement mode.
ApplyNetworkMovementMode(ClientMovementMode);
// Update base and floor at new location.
SetBase(ClientMovementBase, ClientBaseBoneName);
UpdateFloorFromAdjustment();
// Even if base has not changed, we need to recompute the relative offsets (since we've moved).
SaveBaseLocation();
LastUpdateLocation = UpdatedComponent ? UpdatedComponent->GetComponentLocation() : FVector::ZeroVector;
LastUpdateRotation = UpdatedComponent ? UpdatedComponent->GetComponentQuat() : FQuat::Identity;
LastUpdateVelocity = Velocity;
}
}
// acknowledge receipt of this successful servermove()
ServerData->PendingAdjustment.TimeStamp = ClientTimeStamp;
ServerData->PendingAdjustment.bAckGoodMove = true;
}
//PerfCountersIncrement(PerfCounter_NumServerMoves);
ServerData->bForceClientUpdate = false;
}
FVector UVRCharacterMovementComponent::GetPenetrationAdjustment(const FHitResult& Hit) const
{
// This checks for a walking collision override on the penetrated object
// If found then it stops penetration adjustments.
if (MovementMode == EMovementMode::MOVE_Walking && VRRootCapsule && VRRootCapsule->bUseWalkingCollisionOverride && Hit.Component.IsValid())
{
ECollisionResponse WalkingResponse;
WalkingResponse = Hit.Component->GetCollisionResponseToChannel(VRRootCapsule->WalkingCollisionOverride);
if (WalkingResponse == ECR_Ignore || WalkingResponse == ECR_Overlap)
{
return FVector::ZeroVector;
}
}
FVector Result = Super::GetPenetrationAdjustment(Hit);
if (CharacterOwner)
{
const bool bIsProxy = (CharacterOwner->GetLocalRole() == ROLE_SimulatedProxy);
float MaxDistance = bIsProxy ? MaxDepenetrationWithGeometryAsProxy : MaxDepenetrationWithGeometry;
const AActor* HitActor = Hit.GetActor();
if (Cast<APawn>(HitActor))
{
MaxDistance = bIsProxy ? MaxDepenetrationWithPawnAsProxy : MaxDepenetrationWithPawn;
}
Result = Result.GetClampedToMaxSize(MaxDistance);
}
return Result;
} | [
"chris.leapforce@gmail.com"
] | chris.leapforce@gmail.com |
c9d75442edcf3767d81dcc76599b83911b15e801 | 0ca42c18e18b73fb8ea824113d2e6cd2f8584602 | /HexaVectorWin32Console/lib/RawStrHexaDecimal.h | 7164625ab957ec2d7c4ac6ad4811935f6e75b506 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | YuhichYOC/HexaVectorWin32Console | 5931800eb7d329a2705f65fe8b77b9c76c552a3f | 838663ee36ec9b05d19261cc40c0415f9b051554 | refs/heads/master | 2020-05-23T08:11:04.494105 | 2017-05-05T07:51:55 | 2017-05-05T07:51:55 | 70,298,625 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 941 | h | #ifdef RAWSTRHEXADECIMAL_EXPORTS
#define RAWSTRHEXADECIMAL_API __declspec(dllexport)
#else
#define RAWSTRHEXADECIMAL_API __declspec(dllimport)
#endif // RAWSTRHEXADECIMAL_EXPORTS
#pragma once
#include "stdafx.h"
#include "IHexaDecimal.h"
namespace HexaDecimalWin32
{
class RawStrHexaDecimal : public IHexaDecimal
{
private:
int mySize;
std::vector<HexaByte> * hexaValue;
std::string * myValue;
public:
ValueType GetType();
void SetSize(int arg);
int GetSize();
void SetHexa(std::vector<HexaByte> * arg);
std::vector<HexaByte> * GetHexa();
void SetValue(std::string * arg);
std::string * GetValue();
int GetNumericValue();
std::string GetRawValue();
void HexaToValue();
void ValueToHexa();
RawStrHexaDecimal();
~RawStrHexaDecimal();
};
}
using namespace HexaDecimalWin32;
| [
"y@DESKTOP-20VAU6S"
] | y@DESKTOP-20VAU6S |
85396ef802709fa64b6bc2b0a6f6cea4f0e46ee5 | 8f021f68cd0949afa8d119582c0b419b014919d8 | /URIOJ/uri1507-v2.cpp | 00566e3627fded0baad4c3c763e65259a9a8f781 | [] | no_license | Jonatankk/codigos | b9c8426c2f33b5142460a84337480b147169b3e6 | 233ae668bdf6cdd12dbc9ef243fb4ccdab49c933 | refs/heads/master | 2022-07-22T11:09:27.271029 | 2020-05-09T20:57:42 | 2020-05-09T20:57:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 536 | cpp | /*
* Leonardo Deliyannis Constantin
* URI 1507 - Subsequências
*/
#include <stdio.h>
#include <string.h>
#define LEN 112345
char s[LEN];
char t[112];
bool isSubSeq(int m, int n){
if(n == 0) return true;
if(m == 0) return false;
if(s[m-1] == t[n-1]){
return isSubSeq(m-1, n-1);
}
return isSubSeq(m-1, n);
}
int main(){
int N, Q;
scanf("%d", &N);
while(N--){
scanf("%s", s);
scanf("%d", &Q);
while(Q--){
scanf("%s", t);
printf("%s\n", isSubSeq(strlen(s), strlen(t)) ?
"Yes" : "No");
}
}
return 0;
}
| [
"constantin.leo@gmail.com"
] | constantin.leo@gmail.com |
3c82e1947229ddb771c66159767cd181d493d6cd | c365d25ee2237b3c260198827b33b0253d43eaf4 | /desafios/9298340-batch1/9298340-A04-PD/d.cpp | 0701789ed5eeb427f5d4ce4ee5773c1b0c437931 | [] | no_license | germanohn/competitive-programming | fb1249910ce951fe290e9a5be3876d3870ab8aa3 | fab9dc0e2998dd395c1b9d6639f8c187cf637669 | refs/heads/master | 2021-06-12T08:17:52.907705 | 2021-03-17T19:06:19 | 2021-03-17T19:06:19 | 58,595,999 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,007 | cpp | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define debug(args...) fprintf (stderr, args)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
// ATENCAO: cuidado com as variáveis dadas no exercício, nao as reutilize
ll fexp (ll b, ll e, ll mod) {
if (e == 0) return 1;
if (e == 1) return b % mod;
if (e % 2 == 0) return fexp (b*b % mod, e/2, mod) % mod;
return (b * fexp (b*b % mod, e/2, mod)) % mod;
}
int main () {
int t;
scanf ("%d", &t);
while (t--) {
int n, p, q;
scanf ("%d", &n);
for (int i = 2; i*i <= n; i++) {
if (n % i == 0) {
p = i, q = n/i;
break;
}
}
int phi = (p-1)*(q-1);
printf ("0 1 ");
int a, b;
a = (p * fexp (p % q, phi-1, q)) % n;
b = (q * fexp (q % p, phi-1, p)) % n;
if (a > b) swap (a, b);
printf ("%d %d\n", a, b);
}
}
| [
"Germano@Air-de-Germano.home"
] | Germano@Air-de-Germano.home |
6fb5c1daa8133c73a25017b69a971aac2fbf1335 | b6450920eea267353cf42a352a2199eab1c52683 | /src/IO/ParticleWriter.cpp | 760fb391dc68e218ea270e394490fe106554aeef | [
"BSD-2-Clause"
] | permissive | adityaIyerramesh98/quinoa | 2669cec1ba66c0a91a10120c714af7711957f060 | 81024013472ec286aa53ce1f0425580df7d5e047 | refs/heads/master | 2022-09-09T03:26:51.109709 | 2019-09-11T23:15:06 | 2019-09-11T23:15:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 660 | cpp | // *****************************************************************************
/*!
\file src/IO/ParticleWriter.cpp
\copyright 2012-2015 J. Bakosi,
2016-2018 Los Alamos National Security, LLC.,
2019 Triad National Security, LLC.
All rights reserved. See the LICENSE file for details.
\brief Charm++ group for outputing particle data to file via H5Part
\details Charm++ group for outputing particle data to file via H5Part in
parallel using MPI-IO.
*/
// *****************************************************************************
#include "ParticleWriter.hpp"
#include "particlewriter.def.h"
| [
"jbakosi@lanl.gov"
] | jbakosi@lanl.gov |
fa5616bb814864d57b6da7c6fff39c044322ad63 | 9763c69ff8a2d338bea4e7d57ae1d4f32c3a8a9a | /ethernet_tcp_relay/ethernet_tcp_relay.ino | e5eb775a27763894a959c824c08d3b80fd0675c0 | [] | no_license | appspace/arduino | 6840e7e341b755c12615fe16bfc2a5a7a916d74a | 41e33a6767caf871a6d14fa5aac8678f0c8ac7fa | refs/heads/master | 2020-05-17T23:09:06.160534 | 2014-10-09T03:07:27 | 2014-10-09T03:07:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,095 | ino | #include <SPI.h>
#include <Ethernet.h>
//#include <EthernetUdp.h>
#include <LiquidCrystal.h>
const byte LCD_RS = 48; const byte LCD_E = 49;
const byte LCD_D4 = 44; const byte LCD_D5 = 45;
const byte LCD_D6 = 46; const byte LCD_D7 = 47;
int RELAY_ON = LOW;
int RELAY_OFF = HIGH;
int relayPin[] = {31, 33, 35, 37, 39};
boolean relayState[] = {RELAY_OFF, RELAY_OFF, RELAY_OFF, RELAY_OFF, RELAY_OFF};
const int pinsConnected = 5;
byte mac[] = { 0xEE, 0xAD, 0xBE, 0xEF, 0xFE, 0xED };
IPAddress ip(192, 168, 1, 177);
IPAddress gateway(192,168,1, 1);
IPAddress subnet(255, 255, 0, 0);
unsigned long port = 1981;
char packetBuffer[UDP_TX_PACKET_MAX_SIZE];
EthernetServer server(port);
boolean alreadyConnected = false; // whether or not the client was connected previously
LiquidCrystal lcd(LCD_RS, LCD_E, LCD_D4, LCD_D5, LCD_D6, LCD_D7);
void setup() {
lcd.begin(16, 2);
initRelay();
initDHCPNetwork();
printNetworkInfo();
Serial.begin(115200);
Serial.print("Relay server address:");
Serial.println(Ethernet.localIP());
}
void printNetworkInfo() {
lcd.clear();
lcd.print(Ethernet.localIP()[0], DEC);
lcd.print(".");
lcd.print(Ethernet.localIP()[1], DEC);
lcd.print(".");
lcd.print(Ethernet.localIP()[2], DEC);
lcd.print(".");
lcd.print(Ethernet.localIP()[3], DEC);
lcd.setCursor(0, 1);
lcd.print("Port: ");
lcd.print(port, DEC);
}
void initStaticNetwork() {
Ethernet.begin(mac, ip, gateway, subnet);
server.begin();
}
void initDHCPNetwork() {
lcd.clear();
lcd.setCursor(0, 0);
lcd.print("DHCP Init");
if (Ethernet.begin(mac)==0) {
lcd.setCursor(0, 0);
lcd.print("DHCP failure");
lcd.setCursor(0, 1);
lcd.print("Cannot obtain IP");
for(;;) ;
}
}
void initRelay() {
lcd.setCursor(0,0);
lcd.print("Relay Pins Init");
for (int i=0; i<pinsConnected; i++) {
pinMode(relayPin[i], OUTPUT);
digitalWrite(relayPin[i], RELAY_OFF);
}
}
void loop() {
// wait for a new client:
EthernetClient client = server.available();
// when the client sends the first byte, say hello:
if (client) {
if (!alreadyConnected) {
// clead out the input buffer:
client.flush();
Serial.println("We have a new client");
client.println("Hello, client!");
alreadyConnected = true;
}
if (client.available() > 0) {
// read the bytes incoming from the client:
char thisChar = client.read();
// echo the bytes back to the client:
server.write(thisChar);
// echo the bytes to the server as well:
Serial.write(thisChar);
int relayInput = thisChar - 49;
if (relayInput>=0 && relayInput<pinsConnected) {
boolean state = relayState[relayInput];
state = !state;
Serial.print("Setting pin ");
Serial.print(relayInput, DEC);
Serial.print(" to ");
Serial.println(state, BIN);
relayState[relayInput] = state;
}
}
activateRelays();
}
}
void activateRelays() {
for (int i=0; i<pinsConnected; i++) {
digitalWrite(relayPin[i], relayState[i]);
}
}
| [
"eugenes.mobile@gmail.com"
] | eugenes.mobile@gmail.com |
ce5f53304855c095ae155ec0d6c5d085c726bc55 | b65982b9f43db47ac6a7b055d0d2eebad10a1597 | /CSES-Problem-master/Additional/prufer.cpp | 4a3140a7918cb941d8b5f80463486e5a03e99a72 | [] | no_license | HarshitVerma1/Competitive_Coding_Study_Material | 1a419f3a603e65e523103216aecab688a0203604 | 10657c26197174070d8767ddc1c0e640a672d3d0 | refs/heads/main | 2023-07-27T20:49:22.127595 | 2021-09-03T18:01:46 | 2021-09-03T18:01:46 | 335,115,275 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 870 | cpp | #include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <list>
#include <utility>
using namespace std;
int main()
{
int n;
cin >> n;
int counting[n] = {0};
set<int> set2;
for(int i=0;i<n;i++){
set2.insert(i);
}
vector<int> prufer(n-2);
for(int& x : prufer){
cin >> x;
--x;
counting[x]++;
set2.erase(x);
}
list<pair<int,int>> ans;
for(int x : prufer){
int y = *set2.begin();
ans.push_back({y,x});
set2.erase(y);
counting[x]--;
if(counting[x] == 0){
set2.insert(x);
}
}
set<int> :: iterator it,it2;
it = set2.begin();
it2 = it;
it++;
ans.push_back({*it,*it2});
for(pair<int,int> x : ans){
cout << x.first + 1 << ' ' << x.second + 1 << '\n';
}
return 0;
} | [
"harshitverma14366@gmail.com"
] | harshitverma14366@gmail.com |
81a6b14f674e9ac3f9966ec6af3f7b29dbf39638 | 1d6abe27a802d53f7fbd6eb5e59949044cbb3b98 | /tensorflow/compiler/xla/service/cpu/elemental_ir_emitter.cc | 05364a4492bc4f00e5da91653aaf9f1cfe207cb6 | [
"Apache-2.0"
] | permissive | STSjeerasak/tensorflow | 6bc8bf27fb74fd51a71150f25dc1127129f70222 | b57499d4ec0c24adc3a840a8e7e82bd4ce0d09ed | refs/heads/master | 2022-12-20T20:32:15.855563 | 2020-09-29T21:22:35 | 2020-09-29T21:29:31 | 299,743,927 | 5 | 1 | Apache-2.0 | 2020-09-29T21:38:19 | 2020-09-29T21:38:18 | null | UTF-8 | C++ | false | false | 4,382 | cc | /* Copyright 2017 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/compiler/xla/service/cpu/elemental_ir_emitter.h"
#include <string>
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Module.h"
#include "tensorflow/compiler/xla/service/hlo_casting_utils.h"
#include "tensorflow/compiler/xla/service/hlo_instruction.h"
#include "tensorflow/compiler/xla/service/hlo_instructions.h"
#include "tensorflow/compiler/xla/service/hlo_opcode.h"
#include "tensorflow/compiler/xla/service/llvm_ir/llvm_util.h"
#include "tensorflow/compiler/xla/types.h"
#include "tensorflow/compiler/xla/util.h"
#include "tensorflow/compiler/xla/xla_data.pb.h"
using xla::llvm_ir::IrArray;
namespace xla {
namespace cpu {
StatusOr<llvm::Value*> CpuElementalIrEmitter::EmitAtan2(PrimitiveType prim_type,
llvm::Value* lhs,
llvm::Value* rhs) {
string function_name;
bool cast_result_to_fp16 = false;
switch (prim_type) {
case F16:
cast_result_to_fp16 = true;
lhs = FPCast(lhs, b_->getFloatTy());
rhs = FPCast(rhs, b_->getFloatTy());
TF_FALLTHROUGH_INTENDED;
case F32:
function_name = "atan2f";
break;
case F64:
function_name = "atan2";
break;
default:
return Unimplemented("atan2");
}
// Create a function declaration.
llvm::Function* function = llvm::dyn_cast<llvm::Function>(
module_
->getOrInsertFunction(function_name, lhs->getType(), lhs->getType(),
rhs->getType())
.getCallee());
function->setCallingConv(llvm::CallingConv::C);
function->setDoesNotThrow();
function->setDoesNotAccessMemory();
// Create an instruction to call the function.
llvm::Value* result = Call(function, {lhs, rhs});
if (cast_result_to_fp16) {
result = FPCast(result, b_->getHalfTy());
}
return result;
}
StatusOr<llvm::Value*> CpuElementalIrEmitter::EmitTanh(PrimitiveType prim_type,
llvm::Value* value) {
bool cast_result_to_fp16 = false;
string function_name;
switch (prim_type) {
case F16:
cast_result_to_fp16 = true;
value = FPCast(value, b_->getFloatTy());
TF_FALLTHROUGH_INTENDED;
case F32:
function_name = "tanhf";
break;
case F64:
function_name = "tanh";
break;
default:
return Unimplemented("tanh");
}
// Create a function declaration.
llvm::Function* function = llvm::dyn_cast<llvm::Function>(
module_
->getOrInsertFunction(function_name, value->getType(),
value->getType())
.getCallee());
function->setCallingConv(llvm::CallingConv::C);
function->setDoesNotThrow();
function->setDoesNotAccessMemory();
// Create an instruction to call the function.
llvm::Value* result = Call(function, value);
if (cast_result_to_fp16) {
result = FPCast(result, b_->getHalfTy());
}
return result;
}
llvm_ir::ElementGenerator CpuElementalIrEmitter::MakeElementGenerator(
const HloInstruction* hlo,
const HloToElementGeneratorMap& operand_to_generator) {
switch (hlo->opcode()) {
case HloOpcode::kConvolution:
return [this, hlo, &operand_to_generator](const IrArray::Index& index) {
return ir_emitter_->EmitElementalConvolution(
Cast<HloConvolutionInstruction>(hlo),
operand_to_generator.at(hlo->operand(0)),
operand_to_generator.at(hlo->operand(1)), index);
};
default:
return ElementalIrEmitter::MakeElementGenerator(hlo,
operand_to_generator);
}
}
} // namespace cpu
} // namespace xla
| [
"gardener@tensorflow.org"
] | gardener@tensorflow.org |
5222c0f52186043864044198530b148e5fd4e192 | f15de2aceb891d74477e4ec89c4628de03237ec7 | /Objeto.cpp | cbbb68c6c9147b4797ff1d467b27b4bdbf5292da | [] | no_license | sergioarispejulio/RaytraceGraficas | 964e953bec2b158dbae8c7ef811a2d489788b2d8 | 0967b7e3cd9b92981fa3f040659be6977cf72a20 | refs/heads/master | 2020-06-02T14:53:25.203791 | 2015-03-23T00:16:44 | 2015-03-23T00:16:44 | 32,700,686 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 67 | cpp | #include "Objeto.h"
Objeto::Objeto()
{
}
Objeto::~Objeto()
{
}
| [
"sergio_arispe@hotmail.com"
] | sergio_arispe@hotmail.com |
72b225c84ce1db72785066a23ee3688aa035d6bf | 3b9b4049a8e7d38b49e07bb752780b2f1d792851 | /src/chrome/browser/ui/views/browser_dialogs_views.cc | 0ccb913976517ce2d59f8c0c4f2d178cbddf4557 | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | webosce/chromium53 | f8e745e91363586aee9620c609aacf15b3261540 | 9171447efcf0bb393d41d1dc877c7c13c46d8e38 | refs/heads/webosce | 2020-03-26T23:08:14.416858 | 2018-08-23T08:35:17 | 2018-09-20T14:25:18 | 145,513,343 | 0 | 2 | Apache-2.0 | 2019-08-21T22:44:55 | 2018-08-21T05:52:31 | null | UTF-8 | C++ | false | false | 2,647 | cc | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/browser_dialogs.h"
#include <memory>
#include "chrome/browser/extensions/api/chrome_device_permissions_prompt.h"
#include "chrome/browser/extensions/chrome_extension_chooser_dialog.h"
#include "chrome/browser/extensions/extension_install_prompt.h"
#include "chrome/browser/ui/login/login_handler.h"
#include "chrome/browser/ui/views/new_task_manager_view.h"
#include "components/chooser_controller/chooser_controller.h"
#if defined(OS_CHROMEOS)
#include "chrome/browser/ui/views/intent_picker_bubble_view.h"
#endif // OS_CHROMEOS
// This file provides definitions of desktop browser dialog-creation methods for
// all toolkit-views platforms other than Mac. It also provides the definitions
// on Mac when mac_views_browser=1 is specified in GYP_DEFINES. The file is
// excluded in a Mac Cocoa build: definitions under chrome/browser/ui/cocoa may
// select at runtime whether to show a Cocoa dialog, or the toolkit-views dialog
// provided by browser_dialogs.h.
// static
LoginHandler* LoginHandler::Create(net::AuthChallengeInfo* auth_info,
net::URLRequest* request) {
return chrome::CreateLoginHandlerViews(auth_info, request);
}
// static
void BookmarkEditor::Show(gfx::NativeWindow parent_window,
Profile* profile,
const EditDetails& details,
Configuration configuration) {
chrome::ShowBookmarkEditorViews(parent_window, profile, details,
configuration);
}
// static
ExtensionInstallPrompt::ShowDialogCallback
ExtensionInstallPrompt::GetDefaultShowDialogCallback() {
return ExtensionInstallPrompt::GetViewsShowDialogCallback();
}
void ChromeDevicePermissionsPrompt::ShowDialog() {
ShowDialogViews();
}
void ChromeExtensionChooserDialog::ShowDialog(
std::unique_ptr<ChooserController> chooser_controller) const {
ShowDialogImpl(std::move(chooser_controller));
}
namespace chrome {
ui::TableModel* ShowTaskManager(Browser* browser) {
return task_management::NewTaskManagerView::Show(browser);
}
void HideTaskManager() {
task_management::NewTaskManagerView::Hide();
}
bool NotifyOldTaskManagerBytesRead(const net::URLRequest& request,
int64_t bytes_read) {
return false;
}
} // namespace chrome
#if defined(OS_CHROMEOS)
BubbleShowPtr ShowIntentPickerBubble() {
return IntentPickerBubbleView::ShowBubble;
}
#endif // OS_CHROMEOS
| [
"changhyeok.bae@lge.com"
] | changhyeok.bae@lge.com |
3b238e15441879df39e339e8d10231f70940900b | bebb909a566c046afe55348f266982c678b45dde | /include/bitmanip/build.hpp | 2edfa392ea85e30c4f6cdb7ab8e95f221192bd47 | [
"MIT"
] | permissive | Eisenwave/bitmanip | 7b11529a723500613ebe1566a7705d6eb5765f40 | 5160121631db0fae01d60c58d03ddd7878bbb3a0 | refs/heads/master | 2023-07-19T11:01:01.239940 | 2021-09-28T15:50:44 | 2021-09-28T15:50:44 | 273,203,441 | 15 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 4,725 | hpp | #ifndef BITMANIP_BUILD_HPP
#define BITMANIP_BUILD_HPP
/*
* build.hpp
* -----------
* Captures information about the build, such as the C++ standard, compiler, debug/release build, etc.
*
* This header does not and should never have additional includes.
* See https://godbolt.org/z/xza5qY for testing.
*/
// C++ STANDARD DETECTION ==============================================================================================
#if __cplusplus >= 199711L
#define BITMANIP_CPP98_LEAST
#endif
#if __cplusplus >= 201103L
#define BITMANIP_CPP11_LEAST
#endif
#if __cplusplus >= 201402L
#define BITMANIP_CPP14_LEAST
#endif
#if __cplusplus >= 201703L
#define BITMANIP_CPP17_LEAST
#endif
#if __cplusplus >= 202002L
#define BITMANIP_CPP20_LEAST
#endif
#if __cplusplus == 199711L
#define BITMANIP_CPP98
#elif __cplusplus == 201103L
#define BITMANIP_CPP11
#elif __cplusplus == 201402L
#define BITMANIP_CPP14
#elif __cplusplus == 201703L
#define BITMANIP_CPP17
#elif __cplusplus == 202002L
#define BITMANIP_CPP20
#endif
// COMPILER DETECTION ==================================================================================================
#ifdef _MSC_VER
#define BITMANIP_MSVC _MSC_VER
#endif
#ifdef __GNUC__
#define BITMANIP_GNU_OR_CLANG
#endif
#ifdef __clang__
#define BITMANIP_CLANG __clang_major__
#endif
#if defined(__GNUC__) && !defined(__clang__)
#define BITMANIP_GNU __GNUC__
#endif
// Ensure that alternative operator keywords like not, and, etc. exist for MSVC (they don't by default).
// In C++20, the <ciso646> header was removed from the standard.
#if defined(BITMANIP_MSVC) && !defined(BITMANIP_CPP20_LEAST)
#include <ciso646>
#endif
#ifdef BITMANIP_GNU_OR_CLANG
#define BITMANIP_FWDHEADER(header) <bits/header##fwd.h>
#else
#define BITMANIP_FWDHEADER(header) <header>
#endif
// ARCH DETECTION ======================================================================================================
#ifdef __i386__
#define BITMANIP_X86
#endif
#ifdef __x86_64__
#define BITMANIP_X64
#endif
#ifdef _M_IX86
#define BITMANIP_X86
#endif
#ifdef _M_AMD64
#define BITMANIP_X64
#endif
#ifdef _M_ARM64
#define BITMANIP_ARM64
#endif
#if defined(BITMANIP_X86) || defined(BITMANIP_X64)
#define BITMANIP_X86_OR_X64
#endif
#if defined(BITMANIP_X64) || defined(BITMANIP_ARM64)
#define BITMANIP_64_BIT
#endif
// OS DETECTION ========================================================================================================
#ifdef __unix__
#define BITMANIP_UNIX
#endif
// ENDIANNES DETECTION =================================================================================================
/*
* In this section, the bool constant NATIVE_ENDIAN_LITTLE is defined.
* This happens either using __BYTE_ORDER__ macros or C++20's std::endian.
*/
#if defined(__BYTE_ORDER__) && __BYTE_ORDER__
// C++17 ENDIANNESS DETECTION USING __BYTE__ORDER MACRO ----------------------------------------------------------------
namespace bitmanip::build {
#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
constexpr bool NATIVE_ENDIAN_LITTLE = true;
#elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
constexpr bool NATIVE_ENDIAN_LITTLE = false;
#elif __BYTE_ORDER == __ORDER_PDP_ENDIAN__
#error "voxelio can't compile on platforms with PDP endianness"
#else
#error "__BYTE_ORDER__ has unrecognized value"
#endif
} // namespace bitmanip::build
#elif BITMANIP_CPP20_LEAST
// C++20 ENDIANNESS DETECTION ------------------------------------------------------------------------------------------
#include <bit>
namespace voxelio::build {
constexpr bool NATIVE_ENDIAN_LITTLE = std::endian::native == std::endian::little;
} // namespace voxelio::build
#elif defined(BITMANIP_X86_OR_X64)
// ARCHITECTURE BASED ENDIANNESS DETECTION -----------------------------------------------------------------------------
namespace voxelio::build {
constexpr bool NATIVE_ENDIAN_LITTLE = true;
} // namespace voxelio::build
#else
#error "Failed to detect platform endianness"
#endif
// ENDIAN ENUM =========================================================================================================
namespace bitmanip::build {
/**
* @brief Represents a byte order. Can be either Big Endian or Little Endian.
*/
enum class Endian : unsigned {
/// Least significant byte first.
LITTLE = 0,
/// Most significant byte first.
BIG = 1,
NATIVE = NATIVE_ENDIAN_LITTLE ? LITTLE : BIG
};
} // namespace bitmanip::build
// SOURCE LOCATION =====================================================================================================
namespace bitmanip {
struct SourceLocation {
const char *file;
const char *function;
unsigned long line;
};
} // namespace bitmanip
#endif // BITMANIP_BUILD_HPP
| [
"me@eisenwave.net"
] | me@eisenwave.net |
f0664f93fb4261f90a4b500bcc6e0739a5872cc6 | 2a8e57063eb04cf62490d272f560ed016f635741 | /utils/BP.h | 7dce19fb2c982ee9bb3a414a206f171e2a3463c6 | [
"BSD-3-Clause"
] | permissive | Kingsford-Group/squid | 668b2f502f0d4d4e596896c4763490ef77565811 | 851bde47a3ee83a11e22384f4ede479ce2ff6246 | refs/heads/master | 2022-04-29T07:55:20.190296 | 2022-04-07T13:13:51 | 2022-04-07T13:13:51 | 72,505,158 | 42 | 26 | BSD-3-Clause | 2022-04-06T23:20:12 | 2016-11-01T04:56:30 | C++ | UTF-8 | C++ | false | false | 960 | h | #ifndef __BP_H__
#define __BP_H__
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
class BP_t{
public:
string Chr;
int StartPos;
int EndPos;
bool IsLeft;
public:
BP_t(){}
BP_t(string Chr, int StartPos, int EndPos, bool IsLeft): Chr(Chr), StartPos(StartPos), EndPos(EndPos), IsLeft(IsLeft){};
bool operator < (const BP_t& rhs) const{
if(Chr!=rhs.Chr)
return Chr<rhs.Chr;
else if(StartPos!=rhs.StartPos)
return StartPos<rhs.StartPos;
else if(EndPos!=rhs.EndPos)
return EndPos<rhs.EndPos;
else
return IsLeft<rhs.IsLeft;
};
bool operator == (const BP_t& rhs) const{
return (Chr==rhs.Chr && StartPos==rhs.StartPos && EndPos==rhs.EndPos && IsLeft==rhs.IsLeft);
};
bool operator != (const BP_t& rhs) const{
return !(*this==rhs);
};
string Print(){
return Chr+"\t"+to_string(StartPos)+"\t"+to_string(EndPos)+"\t"+to_string(IsLeft);
};
};
#endif | [
"congm1@andrew.cmu.edu"
] | congm1@andrew.cmu.edu |
a6b470acab9800e54f320aedd081fb28c62315de | 4e3300ebbbc59e9e8528670ff1499c9df4fe21b9 | /source/render/NPlot/NPlotWidgetScope.cpp | e63e000a3da8e3c7873dfb6a4f684602e782dbfe | [] | no_license | droggen/Labeller | 6966da0649c131beea9721b60c34d41700295750 | 1120345a17f51940772d0dd8ec1fa2b3a2b1e3dc | refs/heads/master | 2022-11-29T20:07:23.446813 | 2020-08-13T16:14:56 | 2020-08-13T16:14:56 | 280,924,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,010 | cpp | #include "NPlotWidgetScope.h"
#include "SDL_gfxPrimitives_font.h"
NPlotWidgetScope::NPlotWidgetScope(QWidget * parent, Qt::WindowFlags f)
: NPlotWidgetBase(parent,f)
, Scope(0,0,2,2)
, alpha(false)
{
}
NPlotWidgetScope::~NPlotWidgetScope()
{
}
void NPlotWidgetScope::setData(const vector<vector<int> *> &_v,const vector<unsigned> &_color)
{
v=_v;
color=_color;
}
void NPlotWidgetScope::setAlpha(bool _alpha)
{
alpha=_alpha;
}
void NPlotWidgetScope::setSampleOffset(int co)
{
NPlotWidgetBase::setSampleOffset(co);
offsetsample = co;
}
void NPlotWidgetScope::plot()
{
painter.begin(&pixmap);
Scope::Plot(v,color);
painter.end();
NPlotWidgetBase::plot();
}
void NPlotWidgetScope::cleararea()
{
painter.setClipRect(basex,basey,w,h);
// Optimized version for 32-bit that keeps the alpha channel unchanged.
if( pixmap.format()==QImage::Format_RGB32 ||
pixmap.format()==QImage::Format_ARGB32 ||
pixmap.format()==QImage::Format_ARGB32_Premultiplied
)
{
rgb = pixmap.bits();
bpl = pixmap.bytesPerLine();
unsigned char *pixel,*pixelline;
pixel = rgb+4*basex+bpl*basey;
if(alpha)
{
// Optimized fadeout
for(unsigned y=0;y<h;y++)
{
pixelline=pixel;
for(unsigned x=0;x<w;x++)
{
// Read pixel
unsigned p=*(unsigned *)pixelline;
// Write divided by 2 (alpha=128) with corrected shifted bits.
*(unsigned *)pixelline = ((p>>1)&0x7f7f7f);
pixelline+=4;
}
pixel+=bpl;
}
}
else
{
// Clear.
for(unsigned y=0;y<h;y++)
{
pixelline=pixel;
for(unsigned x=0;x<w;x++)
{
// Keep alpha, clear RGB
*(unsigned *)pixelline = 0;
pixelline+=4;
}
pixel+=bpl;
}
}
}
else
{
// Unoptimized (non 32-bit)
if(alpha)
{
// QT version of fadeout.
painter.fillRect(basex,basey,w,h,QColor(0,0,0,208));
}
else
{
// QT version of clear.
painter.fillRect(basex,basey,w,h,QColor(0,0,0,255));
}
}
}
void NPlotWidgetScope::fastPixelColor(int x,int y,unsigned color)
{
painter.setPen(color);
painter.drawPoint(basex+x,basey+y);
}
void NPlotWidgetScope::lineColor(int x1,int y1,int x2,int y2,unsigned color)
{
painter.setPen(color);
painter.drawLine(basex+x1,basey+y1,basex+x2,basey+y2);
}
void NPlotWidgetScope::hLineColor(int x1,int y,int x2,unsigned color)
{
//if(pixmap->format()==QImage::Format_RGB32)
if( pixmap.format()==QImage::Format_RGB32 ||
pixmap.format()==QImage::Format_ARGB32 ||
pixmap.format()==QImage::Format_ARGB32_Premultiplied
)
//if(0)
{
int xtmp;
// Sort
if (x1 > x2) {
xtmp = x1;
x1 = x2;
x2 = xtmp;
}
//Check visibility of vline
if((y<0) || (y>=h))
return;
if((x1<0) && (x2<0))
return;
if((x1>=w) && (x2>=w))
return;
// Clip y
if(x1<0)
x1 = 0;
if(x2>=w)
x2=w-1;
// Rebase
x1+=basex;
x2+=basex;
y+=basey;
unsigned char *pixel,*pixellast;
pixel = rgb + 4*x1 + bpl*y;
pixellast = pixel + 4*(x2-x1);
for(;pixel<=pixellast;pixel+=4)
*(unsigned *)pixel=color;
}
else
{
lineColor(x1,y,x2,y,color);
}
}
void NPlotWidgetScope::fasthLineColor(int x1, int y, int x2, unsigned color)
{
hLineColor(x1,y,x2,color);
//lineColor(x1,y,x2,y,color);
}
void NPlotWidgetScope::vLineColor(int x,int y1,int y2,unsigned color)
{
//if(pixmap->format()==QImage::Format_RGB32)
if( pixmap.format()==QImage::Format_RGB32 ||
pixmap.format()==QImage::Format_ARGB32 ||
pixmap.format()==QImage::Format_ARGB32_Premultiplied
)
//if(0)
{
int ytmp;
// Sort
if (y1 > y2) {
ytmp = y1;
y1 = y2;
y2 = ytmp;
}
//Check visibility of vline
if((x<0) || (x>=w))
return;
if((y1<0) && (y2<0))
return;
if((y1>=h) && (y2>=h))
return;
// Clip y
if(y1<0)
y1 = 0;
if(y2>=h)
y2=h-1;
// Rebase
x+=basex;
y1+=basey;
y2+=basey;
// Height
int h=y2-y1;
//int bpl = 1;
unsigned char *pixel,*pixellast;
pixel = rgb + 4*x + bpl*y1;
pixellast = pixel + bpl*h;
for(;pixel<=pixellast;pixel+=bpl)
*(unsigned *)pixel=color;
}
else
{
//painter.fillRect(x1,y1,1,y2-y1+1,QColor(color));
lineColor(x,y1,x,y2,color);
}
// lineColor(x,y1,x1,y2,color);
}
void NPlotWidgetScope::fastvLineColor(int x, int y1, int y2, unsigned color)
{
vLineColor(x,y1,y2,color);
//lineColor(x,y1,x,y2,color);
}
void NPlotWidgetScope::fastStringColor(int x,int y,const char *s,unsigned color)
{
/* painter.setPen(color);
QFont f("Helvetica");
f.setPixelSize(11);
//f.setFixedPitch(true);
painter.setFont(f);
painter.drawText(basex+x,basey+y,s);
return;*/
//return;
// Empty string
if(*s==0)
return;
if(x<0 || y<0)
return;
if(y+7>=h)
return;
if(x+8*strlen(s)>=w)
return;
if(pixmap.format()!=QImage::Format_RGB32) // RGB32 is optimized
painter.setPen(color);
do
{
icharacterColor(x,y,*s,color);
x+=8;
}
while(*++s);
}
void NPlotWidgetScope::icharacterColor(int x,int y,char c,unsigned color)
{
unsigned char *data;
data = gfxPrimitivesFontdata+c*8;
unsigned char mask;
//if(pixmap->format()==QImage::Format_RGB32)
if( pixmap.format()==QImage::Format_RGB32 ||
pixmap.format()==QImage::Format_ARGB32 ||
pixmap.format()==QImage::Format_ARGB32_Premultiplied
)
//if(0)
{
x+=basex;
y+=basey;
unsigned pitch = pixmap.bytesPerLine();
unsigned char *p = pixmap.bits() + y*pitch + x*4;
for (int iy = 0; iy < 8; iy++)
{
mask=0x80;
for (int ix = 0; ix < 8; ix++)
{
if(*data&mask)
{
*(unsigned*)p=color;
}
mask>>=1;
p+=4;
}
data++;
p+=pitch-32;
}
}
else
{
for (int iy = 0; iy < 8; iy++)
{
mask=0x80;
for (int ix = 0; ix < 8; ix++)
{
if(*data&mask)
{
painter.drawPoint(basex+x+ix,basey+y+iy);
}
mask>>=1;
}
data++;
}
}
}
unsigned NPlotWidgetScope::fastColor(unsigned color)
{
return color;
}
void NPlotWidgetScope::fastStart()
{
//printf("S %p. T: %d. A: %d. px: %p f:%d x,y,w,h: %d,%d %d,%d\n",this,transparent,alpha,pixmap,pixmap->format(),basex,basey,w,h);
rgb = pixmap.bits();
bpl = pixmap.bytesPerLine();
}
void NPlotWidgetScope::fastStop()
{
return;
}
unsigned NPlotWidgetScope::ColorBlack()
{
return 0xff000000;
}
unsigned NPlotWidgetScope::ColorWhite()
{
return 0xffffffff;
}
unsigned NPlotWidgetScope::ColorGrey()
{
return 0xff7f7f7f;
}
unsigned NPlotWidgetScope::ColorLGrey()
{
return 0xff3f3f3f;
}
unsigned NPlotWidgetScope::ColorRed()
{
return 0xffff0000;
}
void NPlotWidgetScope::resizeEvent(QResizeEvent *event)
{
//printf("NPlotWidgetScope::resizeEvent: new size %d,%d.\n",event->size().width(),event->size().height());
Scope::Resize(0,0,event->size().width()/scale,event->size().height()/scale);
// Create a temporary event to fake the scaled size
QSize s(event->size().width()/scale,event->size().height()/scale);
QResizeEvent event2(s,event->oldSize());
//NPlotWidgetBase::resizeEvent(event); // Original
NPlotWidgetBase::resizeEvent(&event2); // With scale
event->accept();
}
void NPlotWidgetScope::mouseMoveEvent ( QMouseEvent * event )
{
//printf("mouseMoveEvent\n");
emit mouseMoved(x2s(event->x()/scale));
event->accept();
}
void NPlotWidgetScope::mousePressEvent ( QMouseEvent * event )
{
// signal / slot
emit mousePressed(event->button(),x2s(event->x()/scale));
//printf("mouse pressed: %d %d %d\n",event->x(),event->y(),event->button());
//printf("Converstion of pix -> sample %d -> %d\n",event->x(),x2s(event->x()));
switch(event->button())
{
case Qt::MidButton:
switch(event->modifiers())
{
case Qt::ShiftModifier:
SetVAuto();
break;
case Qt::NoModifier:
HZoomReset();
emit zoomHReseted();
break;
default:
event->ignore();
return;
}
break;
default:
event->ignore();
return;
}
event->accept();
repaint();
}
void NPlotWidgetScope::mouseReleaseEvent ( QMouseEvent * event )
{
// signal / slot
emit mouseReleased(event->button(),x2s(event->x()/scale));
event->ignore();
repaint();
}
void NPlotWidgetScope::wheelEvent (QWheelEvent * event)
{
QWidget::wheelEvent(event);
if(event->delta()>0)
{
if(event->modifiers()==Qt::ShiftModifier)
VZoomin();
if(event->modifiers()==Qt::ControlModifier)
PanDown();
if(event->modifiers()==Qt::NoModifier) {
HZoomin();
emit zoomHInned();
}
}
else
{
if(event->modifiers()==Qt::ShiftModifier)
VZoomout();
if(event->modifiers()==Qt::ControlModifier)
PanUp();
if(event->modifiers()==Qt::NoModifier) {
HZoomout();
emit zoomHOuted();
}
}
event->accept();
repaint();
}
void NPlotWidgetScope::keyPressEvent(QKeyEvent * event)
{
//printf("Key press event %d\n",event->key());
if(event->key()==Qt::Key_Up)
{
PanUp();
}
if(event->key()==Qt::Key_Down)
{
PanDown();
}
if(event->key()==Qt::Key_Left)
{
emit panLeft();
}
if(event->key()==Qt::Key_Right)
{
emit panRight();
}
if(event->key()==Qt::Key_PageUp)
{
// Zoom
if(event->modifiers()==Qt::ShiftModifier)
VZoomin();
if(event->modifiers()==Qt::NoModifier) {
HZoomin();
emit zoomHInned();
}
}
if(event->key()==Qt::Key_PageDown)
{
// Zoom
if(event->modifiers()==Qt::ShiftModifier)
VZoomout();
if(event->modifiers()==Qt::NoModifier) {
HZoomout();
emit zoomHOuted();
}
}
if(event->key()==Qt::Key_Return)
{
if(event->modifiers()==Qt::ShiftModifier)
SetVAuto();
if(event->modifiers()==Qt::NoModifier) {
HZoomReset();
emit zoomHReseted();
}
}
QPoint p = mapFromGlobal(QCursor::pos());
int sx = x2s(p.x());
//printf("mouse coord?: %d %d -> %d\n",p.x(),p.y(),sx);
emit keyPressed(event->key(),sx);
event->accept();
repaint();
}
| [
"droggen@gmail.com"
] | droggen@gmail.com |
6c168101c929c0c3ae90c00b6dff38aaa8f9cad3 | 6372f95e2ea3ae0fff7d946c09c710bbd56092b4 | /Development/Plugin/Warcraft3/yd_jass_api/DisableButtonBlp.cpp | b65537c7ac3509c10389ff5867222528d5897a36 | [
"Apache-2.0"
] | permissive | ttitt/YDWE | 341aa73e6d9e9ae8354b581aebb7f9981c09f7e0 | 427999a596309ef66982650592bf9ffe7e595f19 | refs/heads/master | 2021-01-20T16:28:58.344790 | 2017-06-24T05:00:33 | 2017-06-24T05:00:33 | 95,728,505 | 0 | 0 | null | 2017-06-29T02:01:41 | 2017-06-29T02:01:41 | null | GB18030 | C++ | false | false | 10,943 | cpp | #include <base/hook/iat.h>
#include <base/hook/fp_call.h>
#include <base/filesystem.h>
#include <base/path/helper.h>
#include <base/file/stream.h>
#include <base/warcraft3/virtual_mpq.h>
#include <base/warcraft3/jass/hook.h>
#include <base/warcraft3/jass.h>
#include <base/warcraft3/event.h>
#include <BlpConv/BlpConv.h>
#include <BlpConv/Blp.h>
#include <algorithm>
#include <map>
#include <stdint.h>
namespace base { namespace warcraft3 { namespace japi {
uint32_t kPasButton[] = {
#include "PasButton.h"
};
static inline unsigned char clamp_channel_bits8(int c)
{
if (c > 255)
return 255;
if (c < 0)
return 0;
return static_cast<unsigned char>(c);
}
static const size_t kBlpSize = 64;
bool BlpDisable(const IMAGE::BUFFER& input, IMAGE::BUFFER& output)
{
int input_width = 0;
int input_height = 0;
IMAGE::BUFFER input_pic, output_pic;
if (!IMAGE::BLP().Read(input, input_pic, &input_width, &input_height))
{
return false;
}
if (input_width != kBlpSize || input_height != kBlpSize)
{
return false;
}
output_pic.Resize(kBlpSize * kBlpSize * 4);
unsigned char* ptr = output_pic.GetData();
bool enable = false;
for (size_t i = 0; i < kBlpSize * kBlpSize; ++i)
{
IMAGE::BLP_RGBA const& pixel_a = reinterpret_cast<IMAGE::BLP_RGBA*>(kPasButton)[i];
IMAGE::BLP_RGBA const& pixel_b = reinterpret_cast<IMAGE::BLP_RGBA*>(input_pic.GetData())[i];
*ptr = clamp_channel_bits8(((255 - pixel_a.Alpha) * pixel_b.Red + pixel_a.Red) / (255 * 2));
if (*ptr++ > 63) enable = true;
*ptr = clamp_channel_bits8(((255 - pixel_a.Alpha) * pixel_b.Green + pixel_a.Green) / (255 * 2));
if (*ptr++ > 63) enable = true;
*ptr = clamp_channel_bits8(((255 - pixel_a.Alpha) * pixel_b.Blue + pixel_a.Blue) / (255 * 2));
if (*ptr++ > 63) enable = true;
*ptr++ = clamp_channel_bits8(255 - (255 - pixel_a.Alpha) * (255 - pixel_b.Alpha) / 255);
}
if (!enable)
{
ptr = output_pic.GetData();
for (size_t i = 0; i < kBlpSize * kBlpSize; ++i)
{
*ptr++ *= 2;
*ptr++ *= 2;
*ptr++ *= 2;
ptr++;
}
}
if (!IMAGE::BLP().Write(output_pic, output, kBlpSize, kBlpSize, 95))
{
return false;
}
return true;
}
bool BlpBlend(const IMAGE::BUFFER& input_a, const IMAGE::BUFFER& input_b, IMAGE::BUFFER& output)
{
int input_width = 0;
int input_height = 0;
IMAGE::BUFFER input_a_pic, input_b_pic, output_pic;
if (!IMAGE::BLP().Read(input_a, input_a_pic, &input_width, &input_height))
{
return false;
}
if (input_width != kBlpSize || input_height != kBlpSize)
{
return false;
}
if (!IMAGE::BLP().Read(input_b, input_b_pic, &input_width, &input_height))
{
return false;
}
if (input_width != kBlpSize || input_height != kBlpSize)
{
return false;
}
output_pic.Resize(kBlpSize * kBlpSize * 4);
unsigned char* ptr = output_pic.GetData();
for (size_t i = 0; i < kBlpSize * kBlpSize; ++i)
{
IMAGE::BLP_RGBA const& pixel_a = reinterpret_cast<IMAGE::BLP_RGBA*>(input_a_pic.GetData())[i];
IMAGE::BLP_RGBA const& pixel_b = reinterpret_cast<IMAGE::BLP_RGBA*>(input_b_pic.GetData())[i];
*ptr++ = clamp_channel_bits8(((255 - pixel_a.Alpha) * pixel_b.Red + pixel_a.Alpha * pixel_a.Red) / 255);
*ptr++ = clamp_channel_bits8(((255 - pixel_a.Alpha) * pixel_b.Green + pixel_a.Alpha * pixel_a.Green) / 255);
*ptr++ = clamp_channel_bits8(((255 - pixel_a.Alpha) * pixel_b.Blue + pixel_a.Alpha * pixel_a.Blue) / 255);
*ptr++ = clamp_channel_bits8(255 - (255 - pixel_a.Alpha) * (255 - pixel_b.Alpha) / 255);
}
if (!IMAGE::BLP().Write(output_pic, output, kBlpSize, kBlpSize, 95))
{
return false;
}
return true;
}
std::string ToFileName(const std::string& file)
{
size_t pos = file.find_last_of('\\');
if (pos == std::string::npos)
{
return file;
}
return file.substr(pos + 1, std::string::npos);
}
namespace real
{
uintptr_t SMemAlloc = 0;
uintptr_t SFileLoadFile = 0;
uintptr_t SFileUnloadFile = 0;
}
namespace fake
{
template <class T>
struct less
{
bool operator()(const T& lft, const T& rht) const
{
return (lft < _Right);
}
};
template <>
struct less<char>
{
bool operator()(const char& lft, const char& rht) const
{
return (tolower(static_cast<unsigned char>(lft)) < tolower(static_cast<unsigned char>(rht)));
}
};
template <>
struct less<std::string>
{
bool operator()(const std::string& lft, const std::string& rht) const
{
return std::lexicographical_compare(lft.begin(), lft.end(), rht.begin(), rht.end(), less<char>());
}
};
static std::map<std::string, std::string, less<std::string>> g_history;
static std::map<std::string, IMAGE::BUFFER, less<std::string>> g_virtualblp;
static std::string g_lastfilepath;
void* SMemAlloc(size_t amount)
{
return base::std_call<void*>(real::SMemAlloc, amount, ".\\SFile.cpp", 4072, 0);
}
bool read_virtual_button_blp(const char* filepath, IMAGE::BUFFER& blp)
{
auto it = g_virtualblp.find(filepath);
if (it == g_virtualblp.end())
{
return false;
}
blp.Assign(it->second.begin(), it->second.end());
return true;
}
bool read_virtual_button_blp(const char* filepath, const void** buffer_ptr, uint32_t* size_ptr, uint32_t reserve_size, OVERLAPPED* overlapped_ptr)
{
auto it = g_virtualblp.find(filepath);
if (it == g_virtualblp.end())
{
return false;
}
IMAGE::BUFFER& blp = it->second;
void* result = SMemAlloc(blp.GetSize() + reserve_size);
if (!result)
{
return false;
}
memcpy(result, blp.GetData(), blp.GetSize());
*buffer_ptr = result;
if (reserve_size) memset((unsigned char*)result + blp.GetSize(), 0, reserve_size);
if (size_ptr) *size_ptr = blp.GetSize();
if (overlapped_ptr && overlapped_ptr->hEvent) ::SetEvent(overlapped_ptr->hEvent);
return true;
}
bool read_button_blp(const char* filepath, IMAGE::BUFFER& blp)
{
if (read_virtual_button_blp(filepath, blp))
{
return true;
}
const void* buffer = 0;
uint32_t size = 0;
if (!base::std_call<bool>(real::SFileLoadFile, filepath, &buffer, &size, 0, 0))
{
return false;
}
blp.Assign((const char*)buffer, (const char*)buffer + size);
base::std_call<bool>(real::SFileUnloadFile, buffer);
return true;
}
bool disable_button_blp(const char* filename, const void** buffer_ptr, uint32_t* size_ptr, uint32_t reserve_size)
{
IMAGE::BUFFER input;
IMAGE::BUFFER output;
if (!read_button_blp(filename, input))
{
return false;
}
if (!BlpDisable(input, output))
{
return false;
}
void* result = SMemAlloc(output.GetSize() + reserve_size);
if (!result)
{
return false;
}
memcpy(result, output.GetData(), output.GetSize());
*buffer_ptr = result;
if (reserve_size) memset((unsigned char*)result + output.GetSize(), 0, reserve_size);
if (size_ptr) *size_ptr = output.GetSize();
return true;
}
int __stdcall SFileLoadFile(const char* filepath, const void** buffer_ptr, uint32_t* size_ptr, uint32_t reserve_size, OVERLAPPED* overlapped_ptr)
{
if (!buffer_ptr || !filepath)
{
return base::std_call<int>(real::SFileLoadFile, filepath, buffer_ptr, size_ptr, reserve_size, overlapped_ptr);
}
if (read_virtual_button_blp(filepath, buffer_ptr, size_ptr, reserve_size, overlapped_ptr))
{
g_lastfilepath = filepath;
return 1;
}
int suc = base::std_call<int>(real::SFileLoadFile, filepath, buffer_ptr, size_ptr, reserve_size, overlapped_ptr);
if (suc)
{
g_lastfilepath = filepath;
return suc;
}
#define DisString "replaceabletextures\\commandbuttonsdisabled\\dis"
#define StrLen(s) (sizeof(s) - 1)
if (0 == _strnicmp(filepath, DisString, StrLen(DisString)))
{
const char* filename = filepath + StrLen(DisString);
if (0 != _stricmp(ToFileName(g_lastfilepath).c_str(), filename))
{
for (const char* cur = filename;; cur += 3)
{
auto it = g_history.find(cur);
if (it != g_history.end())
{
suc = disable_button_blp(it->second.c_str(), buffer_ptr, size_ptr, reserve_size);
break;
}
if (0 != _strnicmp(cur, "dis", 3))
{
break;
}
}
}
else
{
suc = disable_button_blp(g_lastfilepath.c_str(), buffer_ptr, size_ptr, reserve_size);
if (suc)
{
g_history[filename] = g_lastfilepath;
}
else
{
if (0 == _strnicmp(g_lastfilepath.c_str(), DisString, StrLen(DisString)))
{
for (const char* cur = g_lastfilepath.c_str() + StrLen(DisString);; cur += 3)
{
auto it = g_history.find(cur);
if (it != g_history.end())
{
suc = disable_button_blp(it->second.c_str(), buffer_ptr, size_ptr, reserve_size);
if (suc)
{
g_history[filename] = it->second;
}
break;
}
if (0 != _strnicmp(cur, "dis", 3))
{
break;
}
}
}
}
}
}
g_lastfilepath = filepath;
if (overlapped_ptr && overlapped_ptr->hEvent) ::SetEvent(overlapped_ptr->hEvent);
return suc;
}
}
void __cdecl EXDclareButtonIcon(jass::jstring_t path)
{
std::string str_path = jass::from_trigstring(jass::from_string(path));
fake::g_history[ToFileName(str_path)] = str_path;
}
jass::jboolean_t __cdecl EXBlendButtonIcon(jass::jstring_t input_a, jass::jstring_t intput_b, jass::jstring_t output)
{
std::string str_intput_a = jass::from_trigstring(jass::from_string(input_a));
std::string str_intput_b = jass::from_trigstring(jass::from_string(intput_b));
std::string str_output = jass::from_trigstring(jass::from_string(output));
IMAGE::BUFFER buf_input_a, buf_input_b, buf_output;
if (!fake::read_button_blp(str_intput_a.c_str(), buf_input_a))
{
return false;
}
if (!fake::read_button_blp(str_intput_b.c_str(), buf_input_b))
{
return false;
}
if (!BlpBlend(buf_input_a, buf_input_b, fake::g_virtualblp[str_output]))
{
fake::g_virtualblp.erase(str_output);
return false;
}
return true;
}
void InitializeDisableButtonBlp()
{
// 会和虚拟mpq冲突，暂时的解决方法先把虚拟mpq加载起来
HMODULE module_handle = ::GetModuleHandleW(L"Game.dll");
virtual_mpq::initialize(module_handle);
real::SMemAlloc = (uintptr_t)::GetProcAddress(::GetModuleHandleW(L"Storm.dll"), (const char*)401);
real::SFileUnloadFile = (uintptr_t)::GetProcAddress(::GetModuleHandleW(L"Storm.dll"), (const char*)280);
real::SFileLoadFile = base::hook::iat(module_handle, "Storm.dll", (const char*)(279), (uintptr_t)fake::SFileLoadFile);
jass::japi_add((uintptr_t)EXDclareButtonIcon, "EXDclareButtonIcon", "(S)V");
jass::japi_add((uintptr_t)EXBlendButtonIcon, "EXBlendButtonIcon", "(SSS)B");
register_game_reset_event([&](uintptr_t)
{
fake::g_virtualblp.clear();
fake::g_lastfilepath.clear();
fake::g_history.clear();
});
}
}}}
| [
"actboy168@gmail.com"
] | actboy168@gmail.com |
88013e4e5ea9c1b974583d9d96c25c98044aa95f | 2af6cd77013844234c2dca0e34cb44dcd25cba20 | /codeforces/499B.cpp | 7b8b8895126170d5c4536654919acd17777610d4 | [] | no_license | SwampertX/judge_adventures | d593c8090b78a4aee6e467b3a5492c7b6e019fd1 | 7838eb6249f23f48da7ae0b2714a3bcd1e0fb721 | refs/heads/master | 2021-06-30T05:53:08.361556 | 2020-12-08T15:57:17 | 2020-12-08T15:57:17 | 165,352,481 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 426 | cpp | #include <bits/stdc++.h>
#define INF 2e18
#define MOD 10000007
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int n,m;
map<string,string> stlg;
int main(){
cin>>n>>m;
while(m--){
string s1,s2;cin>>s1>>s2;
stlg[s1]=(s1.length()<=s2.length()?s1:s2);
}
while(n--){
string s; cin>>s;
cout<<stlg[s]<<' ';
}
return 0;
}
| [
"tanyeejian@gmail.com"
] | tanyeejian@gmail.com |
8c1fedb900f5548bc7b97985cb583c95788ff894 | ede6bb95b22e8b2315fea50af2415691b17519a7 | /crtp/example-6/C.h | c7e770d11178cf8c9cf3461be93c8a98fd388673 | [
"MIT"
] | permissive | gusenov/examples-cpp | d3880c1bd436b7d0b8d4955266a580602a378f56 | f2e60b6d3d61cfcb7cc69aba1081162ce2de5193 | refs/heads/master | 2022-10-20T09:13:56.065787 | 2022-10-12T15:48:13 | 2022-10-12T15:48:13 | 154,664,278 | 21 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 129 | h | #ifndef C_H
#define C_H
#include "B.h"
class C : public B<C> {
void foo(...) {
std::cout << "C::foo()\n";
}
};
#endif
| [
"gusenov@live.ru"
] | gusenov@live.ru |
d4c4b1d730cbcabaefbb9138991f75d66425be53 | 748705e88fc2decb21871dcdacb7392037412c7c | /2C++WinterTest/(4)C++WinterTestDay4-1-17/(4)C++WinterTestDay4-1-17/main3.cpp | 5171751f51ff2da5af0554b1e0380c71e1ce8821 | [] | no_license | YangXxin1/persistence | 96ebe1d79e4b179cd3c03fcf5becaa30d7c0e659 | 79916f63576a1fdb5849a8f799696c0ea31036ec | refs/heads/master | 2022-12-06T05:23:48.117569 | 2020-09-02T10:07:44 | 2020-09-02T10:07:44 | 178,318,682 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 348 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for (int i = m, j = 0; i < m + n, j < n; ++i, ++j)
{
nums1[i] = nums2[j];
}
sort(nums1.begin(), nums1.end());
}
};
int main()
{
system("pause");
return 0;
} | [
"yx140513@163.com"
] | yx140513@163.com |
f5847b159b4f19d9a3c5da45d90ee9a25aa60832 | 7e90a1f8280618b97729d0b49b80c6814d0466e2 | /workspace_pc/catkin_ws/devel_isolated/gazebo_msgs/include/gazebo_msgs/JointRequestResponse.h | d49b80ecf7cb3f8ff6b8f4b21e06c26b5653a5f9 | [] | no_license | IreneYIN7/Map-Tracer | 91909f4649a8b65afed56ae3803f0c0602dd89ff | cbbe9acf067757116ec74c3aebdd672fd3df62ed | refs/heads/master | 2022-04-02T09:53:15.650365 | 2019-12-19T07:31:31 | 2019-12-19T07:31:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,163 | h | // Generated by gencpp from file gazebo_msgs/JointRequestResponse.msg
// DO NOT EDIT!
#ifndef GAZEBO_MSGS_MESSAGE_JOINTREQUESTRESPONSE_H
#define GAZEBO_MSGS_MESSAGE_JOINTREQUESTRESPONSE_H
#include <string>
#include <vector>
#include <map>
#include <ros/types.h>
#include <ros/serialization.h>
#include <ros/builtin_message_traits.h>
#include <ros/message_operations.h>
namespace gazebo_msgs
{
template <class ContainerAllocator>
struct JointRequestResponse_
{
typedef JointRequestResponse_<ContainerAllocator> Type;
JointRequestResponse_()
{
}
JointRequestResponse_(const ContainerAllocator& _alloc)
{
(void)_alloc;
}
typedef boost::shared_ptr< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> > Ptr;
typedef boost::shared_ptr< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> const> ConstPtr;
}; // struct JointRequestResponse_
typedef ::gazebo_msgs::JointRequestResponse_<std::allocator<void> > JointRequestResponse;
typedef boost::shared_ptr< ::gazebo_msgs::JointRequestResponse > JointRequestResponsePtr;
typedef boost::shared_ptr< ::gazebo_msgs::JointRequestResponse const> JointRequestResponseConstPtr;
// constants requiring out of line definition
template<typename ContainerAllocator>
std::ostream& operator<<(std::ostream& s, const ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> & v)
{
ros::message_operations::Printer< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >::stream(s, "", v);
return s;
}
} // namespace gazebo_msgs
namespace ros
{
namespace message_traits
{
// BOOLTRAITS {'IsFixedSize': True, 'IsMessage': True, 'HasHeader': False}
// {'sensor_msgs': ['/opt/ros/melodic/share/sensor_msgs/cmake/../msg'], 'std_msgs': ['/opt/ros/melodic/share/std_msgs/cmake/../msg'], 'trajectory_msgs': ['/opt/ros/melodic/share/trajectory_msgs/cmake/../msg'], 'gazebo_msgs': ['/home/gse5/catkin_ws/src/gazebo_ros_pkgs/gazebo_msgs/msg'], 'geometry_msgs': ['/opt/ros/melodic/share/geometry_msgs/cmake/../msg']}
// !!!!!!!!!!! ['__class__', '__delattr__', '__dict__', '__doc__', '__eq__', '__format__', '__getattribute__', '__hash__', '__init__', '__module__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__setattr__', '__sizeof__', '__str__', '__subclasshook__', '__weakref__', '_parsed_fields', 'constants', 'fields', 'full_name', 'has_header', 'header_present', 'names', 'package', 'parsed_fields', 'short_name', 'text', 'types']
template <class ContainerAllocator>
struct IsFixedSize< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct IsFixedSize< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> const>
: TrueType
{ };
template <class ContainerAllocator>
struct IsMessage< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct IsMessage< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> const>
: TrueType
{ };
template <class ContainerAllocator>
struct HasHeader< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
: FalseType
{ };
template <class ContainerAllocator>
struct HasHeader< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> const>
: FalseType
{ };
template<class ContainerAllocator>
struct MD5Sum< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
{
static const char* value()
{
return "d41d8cd98f00b204e9800998ecf8427e";
}
static const char* value(const ::gazebo_msgs::JointRequestResponse_<ContainerAllocator>&) { return value(); }
static const uint64_t static_value1 = 0xd41d8cd98f00b204ULL;
static const uint64_t static_value2 = 0xe9800998ecf8427eULL;
};
template<class ContainerAllocator>
struct DataType< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
{
static const char* value()
{
return "gazebo_msgs/JointRequestResponse";
}
static const char* value(const ::gazebo_msgs::JointRequestResponse_<ContainerAllocator>&) { return value(); }
};
template<class ContainerAllocator>
struct Definition< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
{
static const char* value()
{
return "\n"
"\n"
;
}
static const char* value(const ::gazebo_msgs::JointRequestResponse_<ContainerAllocator>&) { return value(); }
};
} // namespace message_traits
} // namespace ros
namespace ros
{
namespace serialization
{
template<class ContainerAllocator> struct Serializer< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
{
template<typename Stream, typename T> inline static void allInOne(Stream&, T)
{}
ROS_DECLARE_ALLINONE_SERIALIZER
}; // struct JointRequestResponse_
} // namespace serialization
} // namespace ros
namespace ros
{
namespace message_operations
{
template<class ContainerAllocator>
struct Printer< ::gazebo_msgs::JointRequestResponse_<ContainerAllocator> >
{
template<typename Stream> static void stream(Stream&, const std::string&, const ::gazebo_msgs::JointRequestResponse_<ContainerAllocator>&)
{}
};
} // namespace message_operations
} // namespace ros
#endif // GAZEBO_MSGS_MESSAGE_JOINTREQUESTRESPONSE_H
| [
"sh9339@outlook.com"
] | sh9339@outlook.com |
f112704534f8444bfcb1b68a99a6723400fc2ae5 | 911b977e29c308588e6f5664db15dd2b0b6f6bdc | /code/1143.最长公共子序列.cpp | 1da1899a341af2b0e28713a9eee0d6ef1f419f58 | [] | no_license | kevin-mei/leetcode | c9bd8fd763ad93421beb17f6d0a9a65587cc4a8d | b20cb39c809fb3df8e566f0c3f76704f8995d395 | refs/heads/master | 2023-04-29T15:53:35.691017 | 2021-05-19T00:14:44 | 2021-05-19T00:14:44 | 269,921,164 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,043 | cpp | /*
* @lc app=leetcode.cn id=1143 lang=cpp
*
* [1143] 最长公共子序列
*
* https://leetcode-cn.com/problems/longest-common-subsequence/description/
*
* algorithms
* Medium (60.39%)
* Likes: 276
* Dislikes: 0
* Total Accepted: 52.6K
* Total Submissions: 87.1K
* Testcase Example: '"abcde"\n"ace"'
*
* 给定两个字符串 text1 和 text2，返回这两个字符串的最长公共子序列的长度。
*
* 一个字符串的 子序列 是指这样一个新的字符串：它是由原字符串在不改变字符的相对顺序的情况下删除某些字符（也可以不删除任何字符）后组成的新字符串。
* 例如，"ace" 是 "abcde" 的子序列，但 "aec" 不是 "abcde"
* 的子序列。两个字符串的「公共子序列」是这两个字符串所共同拥有的子序列。
*
* 若这两个字符串没有公共子序列，则返回 0。
*
*
*
* 示例 1:
*
* 输入：text1 = "abcde", text2 = "ace"
* 输出：3
* 解释：最长公共子序列是 "ace"，它的长度为 3。
*
*
* 示例 2:
*
* 输入：text1 = "abc", text2 = "abc"
* 输出：3
* 解释：最长公共子序列是 "abc"，它的长度为 3。
*
*
* 示例 3:
*
* 输入：text1 = "abc", text2 = "def"
* 输出：0
* 解释：两个字符串没有公共子序列，返回 0。
*
*
*
*
* 提示:
*
*
* 1 <= text1.length <= 1000
* 1 <= text2.length <= 1000
* 输入的字符串只含有小写英文字符。
*
*
*/
// @lc code=start
//#include "pch.h"
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
// dp[i][j] (i,j>0)表示 text1的[0,i) 和text2的[0,j) 两个字符串的LCS的长度
// dp[m][n]表示 text1的 和text2的两个字符串的LCS的长度
// 所以声明的二维数组dp的大小应为m+1,n+1
int m = text1.size(), n = text2.size();
// 初始化(m+1,n+1)二维数组
vector< vector<int> > dp(m+1, vector<int>(n+1, 0));
// 减而治之：如果 text[i] == text[j], dp[i][j] = dp[i-1][j-1]+1;
// 分而治之：如果 text[i] != text[j], dp[i,j] = max(dp[i-1,j], dp[i,j-1]);
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
// 第i个元素下标为i-1
if(text1[i-1] == text2[j-1])
{
dp[i][j] = dp[i-1][j-1]+1;
}else
{
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}
}
return dp[m][n];
}
};
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
// 定义dp[i][j] 为text1[0,i] 和text2[0,j]的LCS长度
// if(text1[i] == text2[j]) dp[i][j] = dp[i-1][j-1]+1; (i>=1,j>=1)
// if(text1[i] != text2[j]) dp[i][j] = max(dp[i-1][j], dp[i][j-1]);(i>=1,j>=1)
// 递归基：dp[0][0] = text1[0] == text2[0]?1:0;
// dp[0][1] = （dp[0][0] || text1[0] == text2[1])?1:0;
// dp[0][2] = （dp[0][1] || text1[0] == text2[2])?1:0;
int m = text1.length(), n = text2.length();
if(0 == m || 0 == n)
return 0;
vector<vector<int> > dp(m, vector<int>(n,0));
// 处理递归基
dp[0][0] = text1[0] == text2[0]?1:0;
for(int i = 1; i < m;i++)
{
dp[i][0] = (dp[i-1][0] || text1[i] == text2[0])?1:0;
}
for(int j=1; j< n;j++)
{
dp[0][j] = (dp[0][j-1] || text1[0] == text2[j])?1:0;
}
//dp[i][j] 依赖于 dp[i-1][j-1]，先知道小的，再知道大的，所以，i,j 都是递增遍历
for(int i=1; i < m; i++)
{
for(int j=1; j < n;j++)
{
if(text1[i] == text2[j])
dp[i][j] = dp[i-1][j-1]+1;
else
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}
return dp[m-1][n-1];
}
};
// @lc code=end
| [
"824087038@qq.com"
] | 824087038@qq.com |
562a5c98bbee7c409b07ec3bbd4916598500dbdf | 94bdfe022f9d13a679b12f2a01ba9e06d3dd3295 | /codeforces/PRACTISE/1000-1200/K. Video Posts.cpp | 3371c59b28b56d2cfafec374acef3ba19fc27ef8 | [] | no_license | SaiVinay007/Competitive-Programming | 80d66b93531277172eedd87aac582c085b25803f | d79f4e5975b2aa66b96f62154d2d41a9192e4ab7 | refs/heads/master | 2020-08-07T05:10:17.324047 | 2020-01-09T09:55:01 | 2020-01-09T09:55:01 | 213,310,514 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,472 | cpp | #pragma GCC optimize ("-O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
ll NUM = 1e9+7;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define INF 1e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define zer ll(0)
// 10min
int main()
{
ll n,k;
cin>>n>>k;
v64 v(n,0);
ll sum=0;
forn(i,n)
{
cin>>v[i];
sum+=v[i];
}
ll each_len = sum/k;
ll flg = 0, cnt=0, tmp;
v64 s(k,0);
forn(i,n)
{
tmp += v[i];
s[cnt]+=1;
if(tmp==each_len)
{
cnt+=1;
tmp=0;
}
}
if(cnt==k)
{
cout<<"Yes"<<ln;
forn(i,k)
{
cout<< s[i]<<" ";
}
}
else
{
cout<<"No";
}
return 0;
} | [
"g.saivinay007@gmail.com"
] | g.saivinay007@gmail.com |
6ed1b156a61e5923c17461f026ad4e5e9d1414bc | abbb1e132b3d339ba2173129085f252e2f3311dc | /inference-engine/include/vpu/hddl_config.hpp | 5b669fa35bca522ca1869c981805049307f0e07a | [
"Apache-2.0"
] | permissive | 0xF6/openvino | 56cce18f1eb448e25053fd364bcbc1da9f34debc | 2e6c95f389b195f6d3ff8597147d1f817433cfb3 | refs/heads/master | 2022-12-24T02:49:56.686062 | 2020-09-22T16:05:34 | 2020-09-22T16:05:34 | 297,745,570 | 2 | 0 | Apache-2.0 | 2020-09-22T19:03:06 | 2020-09-22T19:03:04 | null | UTF-8 | C++ | false | false | 6,865 | hpp | // Copyright (C) 2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
/**
* @brief A header that defines advanced related properties for HDDL plugin.
* These properties should be used in SetConfig() and LoadNetwork() methods of plugins
*
* @file hddl_config.hpp
*/
#pragma once
#include "vpu_config.hpp"
namespace InferenceEngine {
namespace Metrics {
/**
* @brief Metric to get a int of the device number, String value is METRIC_HDDL_DEVICE_NUM
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_NUM, int);
/**
* @brief Metric to get a std::vector<std::string> of device names, String value is METRIC_HDDL_DEVICE_NAME
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_NAME, std::vector<std::string>);
/**
* @brief Metric to get a std::vector<float> of device thermal, String value is METRIC_HDDL_DEVICE_THERMAL
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_THERMAL, std::vector<float>);
/**
* @brief Metric to get a std::vector<uint32> of device ids, String value is METRIC_HDDL_DEVICE_ID
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_ID, std::vector<unsigned int>);
/**
* @brief Metric to get a std::vector<int> of device subclasses, String value is METRIC_HDDL_DEVICE_SUBCLASS
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_SUBCLASS, std::vector<int>);
/**
* @brief Metric to get a std::vector<uint32> of device total memory, String value is METRIC_HDDL_MEMORY_TOTAL
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_MEMORY_TOTAL, std::vector<unsigned int>);
/**
* @brief Metric to get a std::vector<uint32> of device used memory, String value is METRIC_HDDL_DEVICE_MEMORY_USED
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_MEMORY_USED, std::vector<unsigned int>);
/**
* @brief Metric to get a std::vector<float> of device utilization, String value is METRIC_HDDL_DEVICE_UTILIZATION
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_UTILIZATION, std::vector<float>);
/**
* @brief Metric to get a std::vector<std::string> of stream ids, String value is METRIC_HDDL_DEVICE_STREAM_ID
*/
DECLARE_METRIC_KEY(HDDL_STREAM_ID, std::vector<std::string>);
/**
* @brief Metric to get a std::vector<std::string> of device tags, String value is METRIC_HDDL_DEVICE_TAG
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_TAG, std::vector<std::string>);
/**
* @brief Metric to get a std::vector<int> of group ids, String value is METRIC_HDDL_GROUP_ID
*/
DECLARE_METRIC_KEY(HDDL_GROUP_ID, std::vector<int>);
/**
* @brief Metric to get a int number of device be using for group, String value is METRIC_HDDL_DEVICE_GROUP_USING_NUM
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_GROUP_USING_NUM, int);
/**
* @brief Metric to get a int number of total device, String value is METRIC_HDDL_DEVICE_TOTAL_NUM
*/
DECLARE_METRIC_KEY(HDDL_DEVICE_TOTAL_NUM, int);
} // namespace Metrics
/**
* @brief [Only for HDDLPlugin]
* Type: Arbitrary non-empty string. If empty (""), equals no set, default: "";
* This option allows to specify the number of MYX devices used for inference a specific Executable network.
* Note: Only one network would be allocated to one device.
* The number of devices for the tag is specified in the hddl_service.config file.
* Example:
* "service_settings":
* {
* "graph_tag_map":
* {
* "tagA":3
* }
* }
* It means that an executable network marked with tagA will be executed on 3 devices
*/
DECLARE_VPU_CONFIG(HDDL_GRAPH_TAG);
/**
* @brief [Only for HDDLPlugin]
* Type: Arbitrary non-empty string. If empty (""), equals no set, default: "";
* This config makes the executable networks to be allocated on one certain device (instead of multiple devices).
* And all inference through this executable network, will be done on this device.
* Note: Only one network would be allocated to one device.
* The number of devices which will be used for stream-affinity must be specified in hddl_service.config file.
* Example:
* "service_settings":
* {
* "stream_device_number":5
* }
* It means that 5 device will be used for stream-affinity
*/
DECLARE_VPU_CONFIG(HDDL_STREAM_ID);
/**
* @brief [Only for HDDLPlugin]
* Type: Arbitrary non-empty string. If empty (""), equals no set, default: "";
* This config allows user to control device flexibly. This config gives a "tag" for a certain device while
* allocating a network to it. Afterward, user can allocating/deallocating networks to this device with this "tag".
* Devices used for such use case is controlled by a so-called "Bypass Scheduler" in HDDL backend, and the number
* of such device need to be specified in hddl_service.config file.
* Example:
* "service_settings":
* {
* "bypass_device_number": 5
* }
* It means that 5 device will be used for Bypass scheduler.
*/
DECLARE_VPU_CONFIG(HDDL_DEVICE_TAG);
/**
* @brief [Only for HDDLPlugin]
* Type: "YES/NO", default is "NO".
* This config is a sub-config of DEVICE_TAG, and only available when "DEVICE_TAG" is set. After a user load a
* network, the user got a handle for the network.
* If "YES", the network allocated is bind to the device (with the specified "DEVICE_TAG"), which means all afterwards
* inference through this network handle will be executed on this device only.
* If "NO", the network allocated is not bind to the device (with the specified "DEVICE_TAG"). If the same network
* is allocated on multiple other devices (also set BIND_DEVICE to "False"), then inference through any handle of these
* networks may be executed on any of these devices those have the network loaded.
*/
DECLARE_VPU_CONFIG(HDDL_BIND_DEVICE);
/**
* @brief [Only for HDDLPlugin]
* Type: A signed int wrapped in a string, default is "0".
* This config is a sub-config of DEVICE_TAG, and only available when "DEVICE_TAG" is set and "BIND_DEVICE" is "False".
* When there are multiple devices running a certain network (a same network running on multiple devices in Bypass Scheduler),
* the device with a larger number has a higher priority, and more inference tasks will be fed to it with priority.
*/
DECLARE_VPU_CONFIG(HDDL_RUNTIME_PRIORITY);
/**
* @brief [Only for HDDLPlugin]
* Type: "YES/NO", default is "NO".
* SGAD is short for "Single Graph All Device". With this scheduler, once application allocates 1 network, all devices
* (managed by SGAD scheduler) will be loaded with this graph. The number of network that can be loaded to one device
* can exceed one. Once application deallocates 1 network from device, all devices will unload the network from them.
*/
DECLARE_VPU_CONFIG(HDDL_USE_SGAD);
/**
* @brief [Only for HDDLPlugin]
* Type: A signed int wrapped in a string, default is "0".
* This config gives a "group id" for a certain device when this device has been reserved for certain client, client
* can use this device grouped by calling this group id while other client can't use this device
* Each device has their own group id. Device in one group shares same group id.
*/
DECLARE_VPU_CONFIG(HDDL_GROUP_DEVICE);
} // namespace InferenceEngine
| [
"noreply@github.com"
] | 0xF6.noreply@github.com |
3cdfa6088261e2829d9f7bac992487d3baf629e2 | 4d508e0bd33dfc2134485ed19692d0c75dc05d67 | /src/V2World/EU4ToVic2Data/CountryDataFactory.cpp | f6912c2351abe74b01f09172fead8644727b3e79 | [
"MIT"
] | permissive | ParadoxGameConverters/Vic2ToHoI4 | 4f97a00eb989d45cf7c4c460a884273aceab3a46 | 518bdc4542eb9e2f3a6f4eb02659ef4d67fabb22 | refs/heads/master | 2023-08-17T15:20:41.599432 | 2023-08-12T01:31:06 | 2023-08-12T01:31:06 | 160,988,154 | 33 | 45 | MIT | 2023-09-04T23:13:34 | 2018-12-08T23:37:24 | C++ | UTF-8 | C++ | false | false | 791 | cpp | #include "src/V2World/EU4ToVic2Data/CountryDataFactory.h"
#include "external/common_items/CommonRegexes.h"
#include "external/common_items/ParserHelpers.h"
Vic2::CountryData::Factory::Factory()
{
registerKeyword("last_dynasty", [this](std::istream& theStream) {
countryData->lastDynasty = commonItems::singleString(theStream).getString();
});
registerKeyword("last_ruler_name", [this](std::istream& theStream) {
countryData->lastMonarch = commonItems::singleString(theStream).getString();
});
registerRegex(commonItems::catchallRegex, commonItems::ignoreItem);
}
std::unique_ptr<Vic2::CountryData> Vic2::CountryData::Factory::importCountryData(std::istream& theStream)
{
countryData = std::make_unique<CountryData>();
parseStream(theStream);
return std::move(countryData);
} | [
"noreply@github.com"
] | ParadoxGameConverters.noreply@github.com |
71ff4dbfea604d4f3e9416112ffcf9e3cca0131f | 3521808de88ff83d9a78bfc9fc4aee04bd513a32 | /include/NovosteBetaCath.hh | e1b757fe18d746bf3ba3d305a85d003d095bed82 | [] | no_license | kiarash-eng/IVBT | 3f3c2b9c6a7ee74166bb966caff6a2f259e07c88 | f9fe8d661cecfdab4c7f40963662605c551ac426 | refs/heads/main | 2023-03-04T21:49:01.300850 | 2021-02-17T18:59:51 | 2021-02-17T18:59:51 | 339,785,930 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,754 | hh | //////////////////////////////////////////////////////////////////////////
//
// Author: Joseph M. Decunha <joseph.decunha@mail.mcgill.ca>
//
// License & Copyright
// ===================
//
// Copyright 2016 Joseph M. Decunha <joseph.decunha@mail.mcgill.ca>
//
//
// 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 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//
//
//-----------------------------------------------------------------------
// Header file that defines the Novoste Beta Cath 3.5 French model
// for Intravascular Brachytherapy
//////////////////////////////////////////////////////////////////////////
#ifndef NovosteBetaCath_H
#define NovosteBetaCath_H 1
#include "globals.hh"
#include "SourceModel.hh"
class NovosteBetaCath : public SourceModel
{
public:
NovosteBetaCath(G4int, G4bool);
void CreateSource(G4VPhysicalVolume*);
void CleanSource();
void SetupDimensions();
private:
G4double sourceradius, shellradius, jacketradius, catheterouterradius, guidewireradius;
G4double sourcelength, shelllength, sourcetrainlength, jacketlength, catheterlength;
G4double catheterthickness;
G4double sourcetrainshift;
G4int numberofsources;
G4bool guidewire;
};
#endif | [
"jonathan.kalinowski@mail.mcgill.ca"
] | jonathan.kalinowski@mail.mcgill.ca |
49d00962ce2f6bb6ce8d0351d321e9249d5a914a | 8c671476b2aedebc8fee2fcf0c07fffbd11c5463 | /LYH/lyh_reactor/src/io_buf.cpp | 3b58035ca02b69b770c9c8c950ac2d88a2a0ce69 | [] | no_license | LEEYATWAH/MySimpleServer | 233e1dddba435f4ff25d184f682cb1510e9f5340 | 2d649b16fc28e5607017c7471ddb6d5f96eb5ab0 | refs/heads/master | 2022-11-22T10:34:08.512593 | 2020-07-19T10:15:55 | 2020-07-19T10:15:55 | 266,255,105 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 686 | cpp | #include <stdio.h>
#include <assert.h>
#include <string.h>
#include <io_buf.h>
io_buf::io_buf(int size):capacity(size),length(0),head(0),next(NULL){
data = new char[size];
assert(data);
}
//将已经处理过的数据，清空,将未处理的数据提前至数据首地址
void io_buf::adjust(){
if(head != 0){
if(length != 0){
memmove(data,data+head,length);
}
head = 0;
}
}
//将其他io_buf对象数据考本到自己中
void io_buf::copy(const io_buf *other){
memcpy(data,other->data+other->head,other->length);
head = 0;
length = other->length;
}
//处理长度为len的数据，移动head和修正length
void io_buf::pop(int len){
length -= len;
head += len;
} | [
"you@example.com"
] | you@example.com |
adf804542ded92a8beb55af3fe94d75fd27df9c0 | e766e93530c5ea535fda61e9f17379d9319df75e | /src/init.cpp | b54aff7aaae327405ffa2ed263a51283ffb28f42 | [
"MIT"
] | permissive | iscoin/interstellarcoin | eadcc886766106a581515a3f34f032d748626670 | 54bf527d0555dacf5ec29494bde2420ff7af6b43 | refs/heads/master | 2021-01-10T21:59:32.696000 | 2015-03-19T15:25:15 | 2015-03-19T15:25:15 | 32,468,110 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 29,338 | cpp | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Copyright (c) 2011-2012 Litecoin Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "db.h"
#include "walletdb.h"
#include "bitcoinrpc.h"
#include "net.h"
#include "init.h"
#include "util.h"
#include "ui_interface.h"
#include <boost/filesystem.hpp>
#include <boost/filesystem/fstream.hpp>
#include <boost/filesystem/convenience.hpp>
#include <boost/interprocess/sync/file_lock.hpp>
#include <boost/algorithm/string/predicate.hpp>
#ifndef WIN32
#include <signal.h>
#endif
using namespace std;
using namespace boost;
CWallet* pwalletMain;
CClientUIInterface uiInterface;
//////////////////////////////////////////////////////////////////////////////
//
// Shutdown
//
void ExitTimeout(void* parg)
{
#ifdef WIN32
Sleep(5000);
ExitProcess(0);
#endif
}
void StartShutdown()
{
#ifdef QT_GUI
// ensure we leave the Qt main loop for a clean GUI exit (Shutdown() is called in bitcoin.cpp afterwards)
uiInterface.QueueShutdown();
#else
// Without UI, Shutdown() can simply be started in a new thread
CreateThread(Shutdown, NULL);
#endif
}
void Shutdown(void* parg)
{
static CCriticalSection cs_Shutdown;
static bool fTaken;
// Make this thread recognisable as the shutdown thread
RenameThread("bitcoin-shutoff");
bool fFirstThread = false;
{
TRY_LOCK(cs_Shutdown, lockShutdown);
if (lockShutdown)
{
fFirstThread = !fTaken;
fTaken = true;
}
}
static bool fExit;
if (fFirstThread)
{
fShutdown = true;
nTransactionsUpdated++;
bitdb.Flush(false);
StopNode();
bitdb.Flush(true);
boost::filesystem::remove(GetPidFile());
UnregisterWallet(pwalletMain);
delete pwalletMain;
CreateThread(ExitTimeout, NULL);
Sleep(50);
printf("interstellarcoin exited\n\n");
fExit = true;
#ifndef QT_GUI
// ensure non UI client get's exited here, but let Bitcoin-Qt reach return 0; in bitcoin.cpp
exit(0);
#endif
}
else
{
while (!fExit)
Sleep(500);
Sleep(100);
ExitThread(0);
}
}
void HandleSIGTERM(int)
{
fRequestShutdown = true;
}
void HandleSIGHUP(int)
{
fReopenDebugLog = true;
}
//////////////////////////////////////////////////////////////////////////////
//
// Start
//
#if !defined(QT_GUI)
bool AppInit(int argc, char* argv[])
{
bool fRet = false;
try
{
//
// Parameters
//
// If Qt is used, parameters/litecoin.conf are parsed in qt/bitcoin.cpp's main()
ParseParameters(argc, argv);
if (!boost::filesystem::is_directory(GetDataDir(false)))
{
fprintf(stderr, "Error: Specified directory does not exist\n");
Shutdown(NULL);
}
ReadConfigFile(mapArgs, mapMultiArgs);
if (mapArgs.count("-?") || mapArgs.count("--help"))
{
// First part of help message is specific to interstellarcoin server / RPC client
std::string strUsage = _("interstellarcoin version") + " " + FormatFullVersion() + "\n\n" +
_("Usage:") + "\n" +
" interstellarcoin [options] " + "\n" +
" interstellarcoin [options] <command> [params] " + _("Send command to -server or interstellarcoin") + "\n" +
" interstellarcoin [options] help " + _("List commands") + "\n" +
" interstellarcoin [options] help <command> " + _("Get help for a command") + "\n";
strUsage += "\n" + HelpMessage();
fprintf(stderr, "%s", strUsage.c_str());
return false;
}
// Command-line RPC
for (int i = 1; i < argc; i++)
if (!IsSwitchChar(argv[i][0]) && !boost::algorithm::istarts_with(argv[i], "interstellarcoin:"))
fCommandLine = true;
if (fCommandLine)
{
int ret = CommandLineRPC(argc, argv);
exit(ret);
}
fRet = AppInit2();
}
catch (std::exception& e) {
PrintException(&e, "AppInit()");
} catch (...) {
PrintException(NULL, "AppInit()");
}
if (!fRet)
Shutdown(NULL);
return fRet;
}
extern void noui_connect();
int main(int argc, char* argv[])
{
bool fRet = false;
// Connect signal handlers
noui_connect();
fRet = AppInit(argc, argv);
if (fRet && fDaemon)
return 0;
return 1;
}
#endif
bool static InitError(const std::string &str)
{
uiInterface.ThreadSafeMessageBox(str, _("interstellarcoin"), CClientUIInterface::OK | CClientUIInterface::MODAL);
return false;
}
bool static InitWarning(const std::string &str)
{
uiInterface.ThreadSafeMessageBox(str, _("interstellarcoin"), CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
return true;
}
bool static Bind(const CService &addr, bool fError = true) {
if (IsLimited(addr))
return false;
std::string strError;
if (!BindListenPort(addr, strError)) {
if (fError)
return InitError(strError);
return false;
}
return true;
}
/* import from bitcoinrpc.cpp */
extern double GetDifficulty(const CBlockIndex* blockindex = NULL);
// Core-specific options shared between UI and daemon
std::string HelpMessage()
{
string strUsage = _("Options:") + "\n" +
" -conf=<file> " + _("Specify configuration file (default: interstellarcoin.conf)") + "\n" +
" -pid=<file> " + _("Specify pid file (default: interstellarcoin.pid)") + "\n" +
" -gen " + _("Generate coins") + "\n" +
" -gen=0 " + _("Don't generate coins") + "\n" +
" -datadir=<dir> " + _("Specify data directory") + "\n" +
" -dbcache=<n> " + _("Set database cache size in megabytes (default: 25)") + "\n" +
" -dblogsize=<n> " + _("Set database disk log size in megabytes (default: 100)") + "\n" +
" -timeout=<n> " + _("Specify connection timeout (in milliseconds)") + "\n" +
" -proxy=<ip:port> " + _("Connect through socks proxy") + "\n" +
" -socks=<n> " + _("Select the version of socks proxy to use (4-5, default: 5)") + "\n" +
" -tor=<ip:port> " + _("Use proxy to reach tor hidden services (default: same as -proxy)") + "\n"
" -dns " + _("Allow DNS lookups for -addnode, -seednode and -connect") + "\n" +
" -port=<port> " + _("Listen for connections on <port> (default: 42001 or testnet: 32001)") + "\n" +
" -maxconnections=<n> " + _("Maintain at most <n> connections to peers (default: 125)") + "\n" +
" -addnode=<ip> " + _("Add a node to connect to and attempt to keep the connection open") + "\n" +
" -connect=<ip> " + _("Connect only to the specified node(s)") + "\n" +
" -seednode=<ip> " + _("Connect to a node to retrieve peer addresses, and disconnect") + "\n" +
" -externalip=<ip> " + _("Specify your own public address") + "\n" +
" -onlynet=<net> " + _("Only connect to nodes in network <net> (IPv4, IPv6 or Tor)") + "\n" +
" -discover " + _("Discover own IP address (default: 1 when listening and no -externalip)") + "\n" +
" -irc " + _("Find peers using internet relay chat (default: 0)") + "\n" +
" -listen " + _("Accept connections from outside (default: 1 if no -proxy or -connect)") + "\n" +
" -bind=<addr> " + _("Bind to given address. Use [host]:port notation for IPv6") + "\n" +
" -dnsseed " + _("Find peers using DNS lookup (default: 1 unless -connect)") + "\n" +
" -banscore=<n> " + _("Threshold for disconnecting misbehaving peers (default: 100)") + "\n" +
" -bantime=<n> " + _("Number of seconds to keep misbehaving peers from reconnecting (default: 86400)") + "\n" +
" -maxreceivebuffer=<n> " + _("Maximum per-connection receive buffer, <n>*1000 bytes (default: 5000)") + "\n" +
" -maxsendbuffer=<n> " + _("Maximum per-connection send buffer, <n>*1000 bytes (default: 1000)") + "\n" +
" -detachdb " + _("Detach block and address databases. Increases shutdown time (default: 0)") + "\n" +
" -paytxfee=<amt> " + _("Fee per KB to add to transactions you send") + "\n" +
" -mininput=<amt> " + _("When creating transactions, ignore inputs with value less than this (default: 0.0001)") + "\n" +
#ifdef QT_GUI
" -server " + _("Accept command line and JSON-RPC commands") + "\n" +
#endif
#if !defined(WIN32) && !defined(QT_GUI)
" -daemon " + _("Run in the background as a daemon and accept commands") + "\n" +
#endif
" -testnet " + _("Use the test network") + "\n" +
" -debug " + _("Output extra debugging information. Implies all other -debug* options") + "\n" +
" -debugnet " + _("Output extra network debugging information") + "\n" +
" -logtimestamps " + _("Prepend debug output with timestamp") + "\n" +
" -printtoconsole " + _("Send trace/debug info to console instead of debug.log file") + "\n" +
#ifdef WIN32
" -printtodebugger " + _("Send trace/debug info to debugger") + "\n" +
#endif
" -rpcuser=<user> " + _("Username for JSON-RPC connections") + "\n" +
" -rpcpassword=<pw> " + _("Password for JSON-RPC connections") + "\n" +
" -rpcport=<port> " + _("Listen for JSON-RPC connections on <port> (default: 42000)") + "\n" +
" -rpcallowip=<ip> " + _("Allow JSON-RPC connections from specified IP address") + "\n" +
" -rpcconnect=<ip> " + _("Send commands to node running on <ip> (default: 127.0.0.1)") + "\n" +
" -blocknotify=<cmd> " + _("Execute command when the best block changes (%s in cmd is replaced by block hash)") + "\n" +
" -upgradewallet " + _("Upgrade wallet to latest format") + "\n" +
" -keypool=<n> " + _("Set key pool size to <n> (default: 100)") + "\n" +
" -rescan " + _("Rescan the block chain for missing wallet transactions") + "\n" +
" -checkblocks=<n> " + _("How many blocks to check at startup (default: 2500, 0 = all)") + "\n" +
" -checklevel=<n> " + _("How thorough the block verification is (0-6, default: 1)") + "\n" +
" -loadblock=<file> " + _("Imports blocks from external blk000?.dat file") + "\n" +
" -? " + _("This help message") + "\n";
strUsage += string() +
_("\nSSL options: (see the Bitcoin Wiki for SSL setup instructions)") + "\n" +
" -rpcssl " + _("Use OpenSSL (https) for JSON-RPC connections") + "\n" +
" -rpcsslcertificatechainfile=<file.cert> " + _("Server certificate file (default: server.cert)") + "\n" +
" -rpcsslprivatekeyfile=<file.pem> " + _("Server private key (default: server.pem)") + "\n" +
" -rpcsslciphers=<ciphers> " + _("Acceptable ciphers (default: TLSv1+HIGH:!SSLv2:!aNULL:!eNULL:!AH:!3DES:@STRENGTH)") + "\n";
return strUsage;
}
/** Initialize interstellarcoin.
* @pre Parameters should be parsed and config file should be read.
*/
bool AppInit2()
{
// ********************************************************* Step 1: setup
#ifdef _MSC_VER
// Turn off microsoft heap dump noise
_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);
_CrtSetReportFile(_CRT_WARN, CreateFileA("NUL", GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, 0));
#endif
#if _MSC_VER >= 1400
// Disable confusing "helpful" text message on abort, ctrl-c
_set_abort_behavior(0, _WRITE_ABORT_MSG | _CALL_REPORTFAULT);
#endif
#ifndef WIN32
umask(077);
#endif
#ifndef WIN32
// Clean shutdown on SIGTERM
struct sigaction sa;
sa.sa_handler = HandleSIGTERM;
sigemptyset(&sa.sa_mask);
sa.sa_flags = 0;
sigaction(SIGTERM, &sa, NULL);
sigaction(SIGINT, &sa, NULL);
// Reopen debug.log on SIGHUP
struct sigaction sa_hup;
sa_hup.sa_handler = HandleSIGHUP;
sigemptyset(&sa_hup.sa_mask);
sa_hup.sa_flags = 0;
sigaction(SIGHUP, &sa_hup, NULL);
#endif
// ********************************************************* Step 2: parameter interactions
fTestNet = GetBoolArg("-testnet");
// Keep irc seeding on by default for now.
// if (fTestNet)
// {
SoftSetBoolArg("-irc", true);
// }
if (mapArgs.count("-bind")) {
// when specifying an explicit binding address, you want to listen on it
// even when -connect or -proxy is specified
SoftSetBoolArg("-listen", true);
}
if (mapArgs.count("-connect")) {
// when only connecting to trusted nodes, do not seed via DNS, or listen by default
SoftSetBoolArg("-dnsseed", false);
SoftSetBoolArg("-listen", false);
}
if (mapArgs.count("-proxy")) {
// to protect privacy, do not listen by default if a proxy server is specified
SoftSetBoolArg("-listen", false);
}
if (!GetBoolArg("-listen", true)) {
// do not map ports or try to retrieve public IP when not listening (pointless)
SoftSetBoolArg("-upnp", false);
SoftSetBoolArg("-discover", false);
}
if (mapArgs.count("-externalip")) {
// if an explicit public IP is specified, do not try to find others
SoftSetBoolArg("-discover", false);
}
// ********************************************************* Step 3: parameter-to-internal-flags
fDebug = GetBoolArg("-debug");
// -debug implies fDebug*
if (fDebug)
fDebugNet = true;
else
fDebugNet = GetBoolArg("-debugnet");
bitdb.SetDetach(GetBoolArg("-detachdb", false));
#if !defined(WIN32) && !defined(QT_GUI)
fDaemon = GetBoolArg("-daemon");
#else
fDaemon = false;
#endif
if (fDaemon)
fServer = true;
else
fServer = GetBoolArg("-server");
/* force fServer when running without GUI */
#if !defined(QT_GUI)
fServer = true;
#endif
fPrintToConsole = GetBoolArg("-printtoconsole");
fPrintToDebugger = GetBoolArg("-printtodebugger");
fLogTimestamps = GetBoolArg("-logtimestamps");
if (mapArgs.count("-timeout"))
{
int nNewTimeout = GetArg("-timeout", 5000);
if (nNewTimeout > 0 && nNewTimeout < 600000)
nConnectTimeout = nNewTimeout;
}
// Continue to put "/P2SH/" in the coinbase to monitor
// BIP16 support.
// This can be removed eventually...
const char* pszP2SH = "/P2SH/";
COINBASE_FLAGS << std::vector<unsigned char>(pszP2SH, pszP2SH+strlen(pszP2SH));
if (mapArgs.count("-paytxfee"))
{
if (!ParseMoney(mapArgs["-paytxfee"], nTransactionFee))
return InitError(strprintf(_("Invalid amount for -paytxfee=<amount>: '%s'"), mapArgs["-paytxfee"].c_str()));
if (nTransactionFee > 0.25 * COIN)
InitWarning(_("Warning: -paytxfee is set very high. This is the transaction fee you will pay if you send a transaction."));
}
if (mapArgs.count("-mininput"))
{
if (!ParseMoney(mapArgs["-mininput"], nMinimumInputValue))
return InitError(strprintf(_("Invalid amount for -mininput=<amount>: '%s'"), mapArgs["-mininput"].c_str()));
}
// ********************************************************* Step 4: application initialization: dir lock, daemonize, pidfile, debug log
// Make sure only a single interstellarcoin process is using the data directory.
boost::filesystem::path pathLockFile = GetDataDir() / ".lock";
FILE* file = fopen(pathLockFile.string().c_str(), "a"); // empty lock file; created if it doesn't exist.
if (file) fclose(file);
static boost::interprocess::file_lock lock(pathLockFile.string().c_str());
if (!lock.try_lock())
return InitError(strprintf(_("Cannot obtain a lock on data directory %s. interstellarcoin is probably already running."), GetDataDir().string().c_str()));
#if !defined(WIN32) && !defined(QT_GUI)
if (fDaemon)
{
// Daemonize
pid_t pid = fork();
if (pid < 0)
{
fprintf(stderr, "Error: fork() returned %d errno %d\n", pid, errno);
return false;
}
if (pid > 0)
{
CreatePidFile(GetPidFile(), pid);
return true;
}
pid_t sid = setsid();
if (sid < 0)
fprintf(stderr, "Error: setsid() returned %d errno %d\n", sid, errno);
}
#endif
if (!fDebug)
ShrinkDebugFile();
printf("\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n");
printf("interstellarcoin version %s (%s)\n", FormatFullVersion().c_str(), CLIENT_DATE.c_str());
printf("Startup time: %s\n", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
printf("Default data directory %s\n", GetDefaultDataDir().string().c_str());
printf("Used data directory %s\n", GetDataDir().string().c_str());
std::ostringstream strErrors;
if (fDaemon)
fprintf(stdout, "interstellarcoin server starting\n");
int64 nStart;
// ********************************************************* Step 5: network initialization
int nSocksVersion = GetArg("-socks", 5);
if (nSocksVersion != 4 && nSocksVersion != 5)
return InitError(strprintf(_("Unknown -socks proxy version requested: %i"), nSocksVersion));
if (mapArgs.count("-onlynet")) {
std::set<enum Network> nets;
BOOST_FOREACH(std::string snet, mapMultiArgs["-onlynet"]) {
enum Network net = ParseNetwork(snet);
if (net == NET_UNROUTABLE)
return InitError(strprintf(_("Unknown network specified in -onlynet: '%s'"), snet.c_str()));
nets.insert(net);
}
for (int n = 0; n < NET_MAX; n++) {
enum Network net = (enum Network)n;
if (!nets.count(net))
SetLimited(net);
}
}
CService addrProxy;
bool fProxy = false;
if (mapArgs.count("-proxy")) {
addrProxy = CService(mapArgs["-proxy"], 9050);
if (!addrProxy.IsValid())
return InitError(strprintf(_("Invalid -proxy address: '%s'"), mapArgs["-proxy"].c_str()));
if (!IsLimited(NET_IPV4))
SetProxy(NET_IPV4, addrProxy, nSocksVersion);
if (nSocksVersion > 4) {
#ifdef USE_IPV6
if (!IsLimited(NET_IPV6))
SetProxy(NET_IPV6, addrProxy, nSocksVersion);
#endif
SetNameProxy(addrProxy, nSocksVersion);
}
fProxy = true;
}
// -tor can override normal proxy, -notor disables tor entirely
if (!(mapArgs.count("-tor") && mapArgs["-tor"] == "0") && (fProxy || mapArgs.count("-tor"))) {
CService addrOnion;
if (!mapArgs.count("-tor"))
addrOnion = addrProxy;
else
addrOnion = CService(mapArgs["-tor"], 9050);
if (!addrOnion.IsValid())
return InitError(strprintf(_("Invalid -tor address: '%s'"), mapArgs["-tor"].c_str()));
SetProxy(NET_TOR, addrOnion, 5);
SetReachable(NET_TOR);
}
// see Step 2: parameter interactions for more information about these
fNoListen = !GetBoolArg("-listen", true);
fDiscover = GetBoolArg("-discover", true);
fNameLookup = GetBoolArg("-dns", true);
bool fBound = false;
if (!fNoListen)
{
std::string strError;
if (mapArgs.count("-bind")) {
BOOST_FOREACH(std::string strBind, mapMultiArgs["-bind"]) {
CService addrBind;
if (!Lookup(strBind.c_str(), addrBind, GetListenPort(), false))
return InitError(strprintf(_("Cannot resolve -bind address: '%s'"), strBind.c_str()));
fBound |= Bind(addrBind);
}
} else {
struct in_addr inaddr_any;
inaddr_any.s_addr = INADDR_ANY;
#ifdef USE_IPV6
if (!IsLimited(NET_IPV6))
fBound |= Bind(CService(in6addr_any, GetListenPort()), false);
#endif
if (!IsLimited(NET_IPV4))
fBound |= Bind(CService(inaddr_any, GetListenPort()), !fBound);
}
if (!fBound)
return InitError(_("Failed to listen on any port. Use -listen=0 if you want this."));
}
if (mapArgs.count("-externalip"))
{
BOOST_FOREACH(string strAddr, mapMultiArgs["-externalip"]) {
CService addrLocal(strAddr, GetListenPort(), fNameLookup);
if (!addrLocal.IsValid())
return InitError(strprintf(_("Cannot resolve -externalip address: '%s'"), strAddr.c_str()));
AddLocal(CService(strAddr, GetListenPort(), fNameLookup), LOCAL_MANUAL);
}
}
BOOST_FOREACH(string strDest, mapMultiArgs["-seednode"])
AddOneShot(strDest);
// ********************************************************* Step 6: load blockchain
if (GetBoolArg("-loadblockindextest"))
{
CTxDB txdb("r");
txdb.LoadBlockIndex();
PrintBlockTree();
return false;
}
uiInterface.InitMessage(_("Loading block index..."));
printf("Loading block index...\n");
nStart = GetTimeMillis();
if (!LoadBlockIndex())
strErrors << _("Error loading blkindex.dat") << "\n";
// as LoadBlockIndex can take several minutes, it's possible the user
// requested to kill interstellarcoin-qt during the last operation. If so, exit.
// As the program has not fully started yet, Shutdown() is possibly overkill.
if (fRequestShutdown)
{
printf("Shutdown requested. Exiting.\n");
return false;
}
printf(" block index %15"PRI64d"ms\n", GetTimeMillis() - nStart);
if (GetBoolArg("-printblockindex") || GetBoolArg("-printblocktree"))
{
PrintBlockTree();
return false;
}
if (mapArgs.count("-printblock"))
{
string strMatch = mapArgs["-printblock"];
int nFound = 0;
for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
{
uint256 hash = (*mi).first;
if (strncmp(hash.ToString().c_str(), strMatch.c_str(), strMatch.size()) == 0)
{
CBlockIndex* pindex = (*mi).second;
CBlock block;
block.ReadFromDisk(pindex);
block.BuildMerkleTree();
block.print();
printf("\n");
nFound++;
}
}
if (nFound == 0)
printf("No blocks matching %s were found\n", strMatch.c_str());
return false;
}
if (mapArgs.count("-exportStatData"))
{
FILE* file = fopen((GetDataDir() / "blockstat.dat").string().c_str(), "w");
if (!file)
return false;
for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
{
CBlockIndex* pindex = (*mi).second;
CBlock block;
block.ReadFromDisk(pindex);
block.BuildMerkleTree();
fprintf(file, "%d,%s,%s,%d,%f,%u\n",
pindex->nHeight, /* todo: height */
block.GetHash().ToString().c_str(),
block.GetPoWHash().ToString().c_str(),
block.nVersion,
//CBigNum().SetCompact(block.nBits).getuint256().ToString().c_str(),
GetDifficulty(pindex),
block.nTime
);
}
fclose(file);
return false;
}
// ********************************************************* Step 7: load wallet
uiInterface.InitMessage(_("Loading wallet..."));
printf("Loading wallet...\n");
nStart = GetTimeMillis();
bool fFirstRun;
pwalletMain = new CWallet("wallet.dat");
int nLoadWalletRet = pwalletMain->LoadWallet(fFirstRun);
if (nLoadWalletRet != DB_LOAD_OK)
{
if (nLoadWalletRet == DB_CORRUPT)
strErrors << _("Error loading wallet.dat: Wallet corrupted") << "\n";
else if (nLoadWalletRet == DB_TOO_NEW)
strErrors << _("Error loading wallet.dat: Wallet requires newer version of interstellarcoin") << "\n";
else if (nLoadWalletRet == DB_NEED_REWRITE)
{
strErrors << _("Wallet needed to be rewritten: restart interstellarcoin to complete") << "\n";
printf("%s", strErrors.str().c_str());
return InitError(strErrors.str());
}
else
strErrors << _("Error loading wallet.dat") << "\n";
}
if (GetBoolArg("-upgradewallet", fFirstRun))
{
int nMaxVersion = GetArg("-upgradewallet", 0);
if (nMaxVersion == 0) // the -upgradewallet without argument case
{
printf("Performing wallet upgrade to %i\n", FEATURE_LATEST);
nMaxVersion = CLIENT_VERSION;
pwalletMain->SetMinVersion(FEATURE_LATEST); // permanently upgrade the wallet immediately
}
else
printf("Allowing wallet upgrade up to %i\n", nMaxVersion);
if (nMaxVersion < pwalletMain->GetVersion())
strErrors << _("Cannot downgrade wallet") << "\n";
pwalletMain->SetMaxVersion(nMaxVersion);
}
if (fFirstRun)
{
// Create new keyUser and set as default key
RandAddSeedPerfmon();
CPubKey newDefaultKey;
if (!pwalletMain->GetKeyFromPool(newDefaultKey, false))
strErrors << _("Cannot initialize keypool") << "\n";
pwalletMain->SetDefaultKey(newDefaultKey);
if (!pwalletMain->SetAddressBookName(pwalletMain->vchDefaultKey.GetID(), ""))
strErrors << _("Cannot write default address") << "\n";
}
printf("%s", strErrors.str().c_str());
printf(" wallet %15"PRI64d"ms\n", GetTimeMillis() - nStart);
RegisterWallet(pwalletMain);
CBlockIndex *pindexRescan = pindexBest;
if (GetBoolArg("-rescan"))
pindexRescan = pindexGenesisBlock;
else
{
CWalletDB walletdb("wallet.dat");
CBlockLocator locator;
if (walletdb.ReadBestBlock(locator))
pindexRescan = locator.GetBlockIndex();
}
if (pindexBest != pindexRescan)
{
uiInterface.InitMessage(_("Rescanning..."));
printf("Rescanning last %i blocks (from block %i)...\n", pindexBest->nHeight - pindexRescan->nHeight, pindexRescan->nHeight);
nStart = GetTimeMillis();
pwalletMain->ScanForWalletTransactions(pindexRescan, true);
printf(" rescan %15"PRI64d"ms\n", GetTimeMillis() - nStart);
}
// ********************************************************* Step 8: import blocks
if (mapArgs.count("-loadblock"))
{
BOOST_FOREACH(string strFile, mapMultiArgs["-loadblock"])
{
FILE *file = fopen(strFile.c_str(), "rb");
if (file)
LoadExternalBlockFile(file);
}
}
// ********************************************************* Step 9: load peers
uiInterface.InitMessage(_("Loading addresses..."));
printf("Loading addresses...\n");
nStart = GetTimeMillis();
{
CAddrDB adb;
if (!adb.Read(addrman))
printf("Invalid or missing peers.dat; recreating\n");
}
printf("Loaded %i addresses from peers.dat %"PRI64d"ms\n",
addrman.size(), GetTimeMillis() - nStart);
// ********************************************************* Step 10: start node
if (!CheckDiskSpace())
return false;
RandAddSeedPerfmon();
//// debug print
printf("mapBlockIndex.size() = %d\n", mapBlockIndex.size());
printf("nBestHeight = %d\n", nBestHeight);
printf("setKeyPool.size() = %d\n", pwalletMain->setKeyPool.size());
printf("mapWallet.size() = %d\n", pwalletMain->mapWallet.size());
printf("mapAddressBook.size() = %d\n", pwalletMain->mapAddressBook.size());
if (!CreateThread(StartNode, NULL))
InitError(_("Error: could not start node"));
if (fServer)
CreateThread(ThreadRPCServer, NULL);
// ********************************************************* Step 11: finished
uiInterface.InitMessage(_("Done loading"));
printf("Done loading\n");
if (!strErrors.str().empty())
return InitError(strErrors.str());
// Add wallet transactions that aren't already in a block to mapTransactions
pwalletMain->ReacceptWalletTransactions();
#if !defined(QT_GUI)
// Loop until process is exit()ed from shutdown() function,
// called from ThreadRPCServer thread when a "stop" command is received.
while (1)
Sleep(5000);
#endif
return true;
}
| [
"interstellarcoin@gmail.com"
] | interstellarcoin@gmail.com |
aea7fddde29975df25b31fa8d5f828fcd1f923f2 | acc2f5336d768a7d86dbd2eec441283cfd11d52d | /src/Core/GCUseBonusPointFail.h | 0d59fd866ff7586a3063b5f9b542e4818a0ce3ed | [] | no_license | stevexk/server | 86df9e8c2448ad97db9c3ab86820beec507ef092 | 4ddb6e7cfa510bb13ccd87f56db008aa1be1baad | refs/heads/master | 2020-01-23T22:00:57.359964 | 2015-09-18T14:58:27 | 2015-09-18T14:58:27 | null | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 2,571 | h | //////////////////////////////////////////////////////////////////////
//
// Filename : GCUseBonusPointFail.h
// Written By : crazydog
// Description :
//
//////////////////////////////////////////////////////////////////////
#ifndef __GC_USE_BONUS_POINT_FAIL_H__
#define __GC_USE_BONUS_POINT_FAIL_H__
// include files
#include "Packet.h"
#include "PacketFactory.h"
//////////////////////////////////////////////////////////////////////
//
// class GCUseBonusPointFail;
//
//////////////////////////////////////////////////////////////////////
class GCUseBonusPointFail : public Packet {
public :
// constructor
GCUseBonusPointFail() throw() {}
~GCUseBonusPointFail() {};
public :
// 입력스트림(버퍼)으로부터 데이타를 읽어서 패킷을 초기화한다.
void read(SocketInputStream & iStream) throw(ProtocolException, Error);
// 출력스트림(버퍼)으로 패킷의 바이너리 이미지를 보낸다.
void write(SocketOutputStream & oStream) const throw(ProtocolException, Error);
// execute packet's handler
void execute(Player* pPlayer) throw(ProtocolException, Error);
// get packet id
PacketID_t getPacketID() const throw() { return PACKET_GC_USE_BONUS_POINT_FAIL; }
// get packet's body size
PacketSize_t getPacketSize() const throw() { return 0; }
// get packet's name
string getPacketName() const throw() { return "GCUseBonusPointFail"; }
// get packet's debug string
string toString() const throw();
public :
private :
};
//////////////////////////////////////////////////////////////////////
//
// class GCUseBonusPointFailFactory;
//
// Factory for GCUseBonusPointFail
//
//////////////////////////////////////////////////////////////////////
class GCUseBonusPointFailFactory : public PacketFactory {
public :
// create packet
Packet* createPacket() throw() { return new GCUseBonusPointFail(); }
// get packet name
string getPacketName() const throw() { return "GCUseBonusPointFail"; }
// get packet id
PacketID_t getPacketID() const throw() { return Packet::PACKET_GC_USE_BONUS_POINT_FAIL; }
// get packet's max body size
PacketSize_t getPacketMaxSize() const throw() { return 0; }
};
//////////////////////////////////////////////////////////////////////
//
// class GCUseBonusPointFailHandler;
//
//////////////////////////////////////////////////////////////////////
class GCUseBonusPointFailHandler {
public :
// execute packet's handler
static void execute(GCUseBonusPointFail* pPacket, Player* pPlayer) throw(Error);
};
#endif
| [
"tiancaiamao@gmail.com"
] | tiancaiamao@gmail.com |
ca6e1ab30348bf826e6e35adb1a462d104f96bbe | 70450f0c551adf47b450468e424f4f90bebfb58d | /MuonGun/private/pybindings/Flux.cxx | c21f0ca25c53894dfd0170829537c88ccc0a0c65 | [
"MIT"
] | permissive | hschwane/offline_production | ebd878c5ac45221b0631a78d9e996dea3909bacb | e14a6493782f613b8bbe64217559765d5213dc1e | refs/heads/master | 2023-03-23T11:22:43.118222 | 2021-03-16T13:11:22 | 2021-03-16T13:11:22 | 280,381,714 | 0 | 0 | MIT | 2020-07-17T09:20:29 | 2020-07-17T09:20:29 | null | UTF-8 | C++ | false | false | 1,363 | cxx | /** $Id: Flux.cxx 177771 2019-12-09 09:25:23Z jvansanten $
* @file
* @author Jakob van Santen <vansanten@wisc.edu>
*
* $Revision: 177771 $
* $Date: 2019-12-09 02:25:23 -0700 (Mon, 09 Dec 2019) $
*/
#include <MuonGun/Flux.h>
#include <icetray/python/gil_holder.hpp>
#include "utils.h"
namespace I3MuonGun {
using namespace boost::python;
class PyFlux : public Flux, public wrapper<Flux> {
public:
virtual double GetLog(double h, double ct, unsigned m) const override
{
detail::gil_holder lock;
return get_override("GetLog")(h, ct, m);
}
};
}
void register_Flux()
{
using namespace I3MuonGun;
using namespace boost::python;
class_<Flux, boost::shared_ptr<Flux>, boost::noncopyable>("Flux", no_init)
DEF("__call__", &Flux::operator(), (args("depth"), "cos_theta", "multiplicity"))
#define PROPS (MinMultiplicity)(MaxMultiplicity)
BOOST_PP_SEQ_FOR_EACH(WRAP_PROP, Flux, PROPS)
#undef PROPS
;
class_<SplineFlux, bases<Flux> >("SplineFlux", init<const std::string&, const std::string&>())
;
class_<BMSSFlux, bases<Flux> >("BMSSFlux")
;
class_<PyFlux, boost::noncopyable>("FluxBase")
DEF("__call__", &Flux::operator(), (args("depth"), "cos_theta", "multiplicity"))
#define PROPS (MinMultiplicity)(MaxMultiplicity)
BOOST_PP_SEQ_FOR_EACH(WRAP_PROP, Flux, PROPS)
#undef PROPS
;
}
| [
"aolivas@umd.edu"
] | aolivas@umd.edu |
ba91e8d5b53b109723afae95ae7d9d7190e9fce7 | 6e050a341ac6a56aa2959ee12a078a68631fa394 | /ros/crossing/src/wallCentering.cpp | 658453f5424decba829c4fabbe5fec349f9d8412 | [] | no_license | wliu88/turtlebot_avoidance | a7c4183c3765c55a1a3ce284e6c8bcc2cad5e6a1 | af03dfadd1ebbfd0ae3f9aacfb948a88c261d3d1 | refs/heads/master | 2020-06-27T20:01:47.604326 | 2016-11-30T23:41:55 | 2016-11-30T23:41:55 | 74,520,234 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,759 | cpp | //
// WallCentering.cpp
// Version 2.0
// Created by Hongrui Zheng on 10/30/14.
// Revised by Carol Young on 11/03/14.
// Revised by Weiyu Liu on 11/10/14
//
//
#include <ros/ros.h>
#include <geometry_msgs/Twist.h>
#include <sensor_msgs/LaserScan.h>
#include <nav_msgs/Odometry.h>
#include <math.h>
//functions
void publish( double _angular, double _linear );
void scan_callback( const sensor_msgs::LaserScan& _msg );
void odometry_callback( const nav_msgs::Odometry& _msg );
// global variables
bool turnRight = false, turnLeft = false, goStraight = true;
int scanPoint = 50;
float cutoff = 0.1;
float gain = .25;
ros::Publisher pub;
int main( int argc, char** argv ) {
ros::init(argc, argv, "follow");
ros::NodeHandle nh;
ros::NodeHandle odm;
ros::Subscriber scan = nh.subscribe( "scan", 1, scan_callback);
ros::Subscriber subodm = odm.subscribe( "odom", 1, odometry_callback);
pub = nh.advertise<geometry_msgs::Twist>("cmd_vel", 1);
ros::Rate loop_rate(10);
while( ros::ok()) {
ros::spinOnce();
}
return(0);
}
void publish( double _angular, double _linear ) {
geometry_msgs::Twist vel;
vel.angular.z = _angular;
vel.linear.x = _linear;
pub.publish(vel);
return;
}
void odometry_callback( const nav_msgs::Odometry& _msg ){
// when turnRight is true and goStraight is false
// publish following velocities
if (turnRight && !goStraight) {
publish(-1 * gain * 1, 0.1);
}
// when turnLeft is true and goStraight is false
// publish following velocities
if (turnLeft && !goStraight) {
publish(gain * 1, 0.1);
}
// when goStraight is true, publish following velocities
if (goStraight) {
publish(0.0, 0.1);
}
return;
}
void scan_callback( const sensor_msgs::LaserScan& _msg ){
turnRight = false;
turnLeft = false;
goStraight = false;
// get the length of the ranges[] array
int arrayLength = (_msg.angle_max - _msg.angle_min) / _msg.angle_increment;
// get the distance to the right
float rightDis = _msg.ranges[scanPoint];
// left and right edge of the data has a difference of 12 points
// get the distance to the left
float leftDis = _msg.ranges[arrayLength - scanPoint - 12];
// The gain is used to adjust the angular velocity to make the turn more smoothly.
gain = fabs(rightDis - leftDis);
//ROS_INFO("%f, %f ", rightDis, leftDis);
// Here the action states are determined. A cutoff are used to ignore negligible noises.
if (rightDis > leftDis + cutoff) {
turnRight = true;
} else if (rightDis + cutoff < leftDis) {
turnLeft = true;
} else {
goStraight = true;
}
return;
}
| [
"weiyuliu69@yahoo.com"
] | weiyuliu69@yahoo.com |
55125bf497eb66998854511fa3ab9865ae8fb454 | a909df0ba2abf695df4a7d15350312d4c6463c48 | /UVa/929_2.cpp | e1b2b21ae3ad774cba9134aff082c3987557e067 | [] | no_license | SayaUrobuchi/uvachan | 1dadd767a96bb02c7e9449c48e463847480e98ec | c213f5f3dcfc72376913a21f9abe72988a8127a1 | refs/heads/master | 2023-07-23T03:59:50.638063 | 2023-07-16T04:31:23 | 2023-07-16T04:31:23 | 94,064,326 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,393 | cpp | #include <stdio.h>
#include <string.h>
int n, m, len, st, nx, ny, lx, ly, rx, ry;
char map[1000][1000];
int dis[1000][1000];
int heapx[600000], heapy[600000];
int wayx[4] = {0, 1, 0, -1};
int wayy[4] = {1, 0, -1, 0};
char str[5000];
int valid(int x, int y)
{
return x > -1 && x < n && y > -1 && y < m;
}
void swap(int *p, int *q)
{
st = *p;
*p = *q;
*q = st;
}
void heapdown(int now)
{
int left, right;
left = now + now;
right = left + 1;
if(left >= len)
{
return;
}
for(; left<len; left=now+now, right=left+1)
{
nx = heapx[now];
ny = heapy[now];
lx = heapx[left];
ly = heapy[left];
rx = heapx[right];
ry = heapy[right];
if(right >= len || dis[lx][ly] < dis[rx][ry])
{
if(dis[nx][ny] > dis[lx][ly])
{
swap(heapx+now, heapx+left);
swap(heapy+now, heapy+left);
now = left;
}
else
{
return;
}
}
else
{
if(dis[nx][ny] > dis[rx][ry])
{
swap(heapx+now, heapx+right);
swap(heapy+now, heapy+right);
now = right;
}
else
{
return;
}
}
}
}
void heapup(int now)
{
int temp;
temp = now / 2;
if(!temp)
{
return;
}
for(; temp; temp=now/2)
{
nx = heapx[now];
ny = heapy[now];
lx = heapx[temp];
ly = heapy[temp];
if(dis[nx][ny] < dis[lx][ly])
{
swap(heapx+now, heapx+temp);
swap(heapy+now, heapy+temp);
now = temp;
}
else
{
return;
}
}
}
void push(int x, int y, int value)
{
dis[x][y] = value;
heapx[len] = x;
heapy[len] = y;
heapup(len++);
}
int pop()
{
if(len == 1)
{
return 0;
}
heapx[0] = heapx[1];
heapy[0] = heapy[1];
heapx[1] = heapx[--len];
heapy[1] = heapy[len];
heapdown(1);
return 1;
}
int main()
{
int count, i, j, k, v, x, y, tx, ty;
scanf("%d", &count);
while(count--)
{
scanf("%d%d", &n, &m);
gets(str);
for(i=0; i<n; i++)
{
gets(str);
for(j=0, k=0; j<m; j++, k+=2)
{
map[i][j] = str[k] - 48;
dis[i][j] = 2147483647;
}
}
len = 1;
push(0, 0, map[0][0]);
for(; pop(); )
{
x = heapx[0];
y = heapy[0];
if(x == n-1 && y == m-1)
{
break;
}
if(dis[x][y] != -1)
{
for(k=0; k<4; k++)
{
tx = x + wayx[k];
ty = y + wayy[k];
if(valid(tx, ty))
{
if(dis[tx][ty] > dis[x][y] + map[tx][ty])
{
push(tx, ty, dis[x][y]+map[tx][ty]);
}
}
}
dis[x][y] = -1;
}
}
printf("%d\n", dis[x][y]);
}
return 0;
}
| [
"sa072688@gmail.com"
] | sa072688@gmail.com |
b5ca2cfa1e2daa1de79baf92609f0391e0d59a34 | 0b63fa8325233e25478b76d0b4a9a6ee3070056d | /src/appleseed/renderer/meta/benchmarks/benchmark_ewa.cpp | c2658dc50ca0edb728f5b64008c628842be4ec33 | [
"MIT"
] | permissive | hipopotamo-hipotalamo/appleseed | e8c61ccec64baf01b6aeb3cde4dd3031d37ece17 | eaf07e3e602218a35711e7495ac633ce210c6078 | refs/heads/master | 2020-12-07T02:39:27.454003 | 2013-10-29T13:10:59 | 2013-10-29T13:10:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,317 | cpp |
//
// This source file is part of appleseed.
// Visit http://appleseedhq.net/ for additional information and resources.
//
// This software is released under the MIT license.
//
// Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//
// appleseed.renderer headers.
#include "renderer/kernel/atomkraft/ewa.h"
#include "renderer/kernel/atomkraft/textureobject.h"
// appleseed.foundation headers.
#include "foundation/image/color.h"
#include "foundation/image/image.h"
#include "foundation/utility/benchmark.h"
// Standard headers.
#include <cstddef>
using namespace foundation;
using namespace renderer;
BENCHMARK_SUITE(AtomKraft_EWA)
{
struct Fixture
{
static const size_t TextureWidth = 2048;
static const size_t TextureHeight = 2048;
Image m_texture;
TextureObject m_texture_object;
ak::EWAFilter<4, TextureObject> m_filter;
Color4f m_result;
Fixture()
: m_texture(TextureWidth, TextureHeight, TextureWidth, TextureHeight, 4, PixelFormatFloat)
, m_texture_object(m_texture)
{
}
};
BENCHMARK_CASE_F(Filter_NoClamping, Fixture)
{
m_filter.filter(
m_texture_object,
1020.0f, // center x
1020.0f, // center y
10.0f, // du/dx
0.0f, // du/dy
0.0f, // dv/dx
10.0f, // dv/dy
100.0f, // max radius
&m_result[0]);
}
BENCHMARK_CASE_F(Filter_Clamping, Fixture)
{
m_filter.filter(
m_texture_object,
1020.0f, // center x
1020.0f, // center y
10.0f, // du/dx
0.0f, // du/dy
0.0f, // dv/dx
10.0f, // dv/dy
5.0f, // max radius
&m_result[0]);
}
}
| [
"beaune@aist.enst.fr"
] | beaune@aist.enst.fr |
3fef7d1741903d322baa2dc979948ab5df0be32a | 40f77053c8ef35f9044891a48ed47608b0eb6635 | /Fiction_Out.cpp | c3d124dfd62b16761e3dda103edbea4505c68055 | [] | no_license | Kandyba-Kat/LR8 | dc67624a5163602e3c0e41c9ca52f8e9e53d7e20 | f0b1e7636ff83a04697f823c5e80ba6a269949dd | refs/heads/main | 2023-04-11T13:43:03.104548 | 2021-04-21T04:52:19 | 2021-04-21T04:52:19 | 360,036,219 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 153 | cpp | #include <fstream>
#include "Fiction.h"
namespace myLab {
void Out(Fiction& f, ofstream& ofst)
{
ofst << ", Director's name = " << f.mDirector;
}
} | [
"kandyba.ekaterina2012@yandex.ru"
] | kandyba.ekaterina2012@yandex.ru |
7d7fbfdad93ad62946fe48178ed4a6cdf7995a1c | ec31f362bac924ba904a071a95a9ffebd43389d3 | /BOSS/src/utility/strnormalize.cpp | dd9ddfaecf68a86711a2357edef4227d319114b7 | [] | no_license | GaoJianchao/miniprog | 9562ba2703557cd923bade1e4b75da573e7088c3 | 929cc6a10291f58559980c7f285a78bc1ab05355 | refs/heads/master | 2022-03-06T00:54:04.229759 | 2016-12-17T12:48:05 | 2016-12-17T12:48:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 310,614 | cpp | #include "strnormalize.h"
using namespace std;
namespace b2bmlr{
#define SWAPBYTE(x) (((unsigned short)(x) >> 8) | (unsigned short)(x) << 8)
#define COMPBYTE(x, y) ((unsigned char)(x) << 8 | (unsigned char)(y))
static const unsigned short _tns[] =
{
0x8147 /* 丟 */, 0xB6AA /* 丢 */, // {{{
0x814B /* 並 */, 0xB2A2 /* 并 */,
0xC7AC /* 乾 */, 0xB8C9 /* 干 */,
0x8179 /* 亂 */, 0xC2D2 /* 乱 */,
0x8183 /* 亙 */, 0xD8A8 /* 亘 */,
0x8186 /* 亞 */, 0xD1C7 /* 亚 */,
0x81B3 /* 伋 */, 0xBCB3 /* 汲 */,
0x81B8 /* 伕 */, 0xB7F2 /* 夫 */,
0x81BB /* 伝 */, 0xB4AB /* 传 */,
0x81D0 /* 佇 */, 0xD8F9 /* 伫 */,
0x81D1 /* 佈 */, 0xB2BC /* 布 */,
0x81D7 /* 佔 */, 0xD5BC /* 占 */,
0x81DD /* 佪 */, 0xBBB2 /* 徊 */,
0x81E3 /* 併 */, 0xB2A2 /* 并 */,
0x81ED /* 來 */, 0xC0B4 /* 来 */,
0x81F6 /* 侖 */, 0xC2D8 /* 仑 */,
0x8248 /* 侶 */, 0xC2C2 /* 侣 */,
0x8249 /* 侷 */, 0xBED6 /* 局 */,
0x8252 /* 俁 */, 0xD9B6 /* 俣 */,
0x8253 /* 係 */, 0xCFB5 /* 系 */,
0x8262 /* 俠 */, 0xCFC0 /* 侠 */,
0x8274 /* 倀 */, 0xD8F6 /* 伥 */,
0x827A /* 倆 */, 0xC1A9 /* 俩 */,
0x827D /* 倉 */, 0xB2D6 /* 仓 */,
0x8280 /* 個 */, 0xB8F6 /* 个 */,
0x8283 /* 們 */, 0xC3C7 /* 们 */,
0x8286 /* 倖 */, 0xD0D2 /* 幸 */,
0x828D /* 倣 */, 0xB7C2 /* 仿 */,
0x8290 /* 倫 */, 0xC2D7 /* 伦 */,
0x82A5 /* 偉 */, 0xCEB0 /* 伟 */,
0x82BF /* 偪 */, 0xB1C6 /* 逼 */,
0x82C8 /* 側 */, 0xB2E0 /* 侧 */,
0x82C9 /* 偵 */, 0xD5EC /* 侦 */,
0x82CC /* 偺 */, 0xD4DB /* 咱 */,
0x82CE /* 偽 */, 0xCEB1 /* 伪 */,
0x82D8 /* 傌 */, 0xC2EE /* 骂 */,
0x82DC /* 傑 */, 0xBDDC /* 杰 */,
0x82E1 /* 傖 */, 0xD8F7 /* 伧 */,
0x82E3 /* 傘 */, 0xC9A1 /* 伞 */,
0x82E4 /* 備 */, 0xB1B8 /* 备 */,
0x82E5 /* 傚 */, 0xD0A7 /* 效 */,
0x82E7 /* 傜 */, 0xD1FE /* 瑶 */,
0x82ED /* 傢 */, 0xBCD2 /* 家 */,
0x82F2 /* 傭 */, 0xD3B6 /* 佣 */,
0x82F4 /* 傯 */, 0xD9CC /* 偬 */,
0x82F7 /* 傳 */, 0xB4AB /* 传 */,
0x82F8 /* 傴 */, 0xD8F1 /* 伛 */,
0x82F9 /* 債 */, 0xD5AE /* 债 */,
0x82FB /* 傷 */, 0xC9CB /* 伤 */,
0x8341 /* 傾 */, 0xC7E3 /* 倾 */,
0x8345 /* 僂 */, 0xD9CD /* 偻 */,
0x8348 /* 僅 */, 0xBDF6 /* 仅 */,
0x834A /* 僇 */, 0xC2BE /* 戮 */,
0x834C /* 僉 */, 0xD9DD /* 佥 */,
0x834D /* 僊 */, 0xCFC9 /* 仙 */,
0x8353 /* 僑 */, 0xC7C8 /* 侨 */,
0x8357 /* 僕 */, 0xC6CD /* 仆 */,
0x8365 /* 僥 */, 0xBDC4 /* 侥 */,
0x8366 /* 僨 */, 0xD9C7 /* 偾 */,
0x836C /* 僱 */, 0xB9CD /* 雇 */,
0x8372 /* 價 */, 0xBCDB /* 价 */,
0x8378 /* 儀 */, 0xD2C7 /* 仪 */,
0x837A /* 儂 */, 0xD9AF /* 侬 */,
0x837C /* 億 */, 0xD2DA /* 亿 */,
0x837D /* 儅 */, 0xB5B1 /* 当 */,
0x837E /* 儈 */, 0xBFEB /* 侩 */,
0x8380 /* 儉 */, 0xBCF3 /* 俭 */,
0x8382 /* 儌 */, 0xE1E8 /* 徼 */,
0x8386 /* 儐 */, 0xD9CF /* 傧 */,
0x8389 /* 儔 */, 0xD9B1 /* 俦 */,
0x838A /* 儕 */, 0xD9AD /* 侪 */,
0x838C /* 儗 */, 0xC4E2 /* 拟 */,
0x838D /* 儘 */, 0xBEA1 /* 尽 */,
0x8394 /* 償 */, 0xB3A5 /* 偿 */,
0x839E /* 優 */, 0xD3C5 /* 优 */,
0x83A6 /* 儲 */, 0xB4A2 /* 储 */,
0x83AB /* 儷 */, 0xD9B3 /* 俪 */,
0x83AC /* 儸 */, 0xC2DE /* 罗 */,
0x83AD /* 儹 */, 0xD4DC /* 攒 */,
0x83AE /* 儺 */, 0xD9D0 /* 傩 */,
0x83AF /* 儻 */, 0xD9CE /* 傥 */,
0x83B0 /* 儼 */, 0xD9B2 /* 俨 */,
0x83B4 /* 兇 */, 0xD0D7 /* 凶 */,
0x83B6 /* 兌 */, 0xB6D2 /* 兑 */,
0x83BA /* 兒 */, 0xB6F9 /* 儿 */,
0x83BC /* 兗 */, 0xD9F0 /* 兖 */,
0x83C8 /* 內 */, 0xC4DA /* 内 */,
0x83C9 /* 兩 */, 0xC1BD /* 两 */,
0x83D3 /* 冇 */, 0xCEDE /* 无 */,
0x83D4 /* 冊 */, 0xB2E1 /* 册 */,
0x83D9 /* 冑 */, 0xEBD0 /* 胄 */,
0x83E7 /* 冪 */, 0xC3DD /* 幂 */,
0x83F4 /* 凈 */, 0xBEBB /* 净 */,
0x83F6 /* 凍 */, 0xB6B3 /* 冻 */,
0x8443 /* 凜 */, 0xC1DD /* 凛 */,
0x8450 /* 凱 */, 0xBFAD /* 凯 */,
0x8465 /* 別 */, 0xB1F0 /* 别 */,
0x8468 /* 刪 */, 0xC9BE /* 删 */,
0x8471 /* 剄 */, 0xD8D9 /* 刭 */,
0x8474 /* 則 */, 0xD4F2 /* 则 */,
0x8476 /* 剉 */, 0xEFB1 /* 锉 */,
0x8477 /* 剋 */, 0xBFCB /* 克 */,
0x8478 /* 剎 */, 0xC9B2 /* 刹 */,
0x8482 /* 剛 */, 0xB8D5 /* 刚 */,
0x8483 /* 剝 */, 0xB0FE /* 剥 */,
0x848E /* 剮 */, 0xB9D0 /* 剐 */,
0x8492 /* 剴 */, 0xD8DC /* 剀 */,
0x8493 /* 創 */, 0xB4B4 /* 创 */,
0x8495 /* 剷 */, 0xB2F9 /* 铲 */,
0x849D /* 劃 */, 0xBBAE /* 划 */,
0x849E /* 劄 */, 0xD4FD /* 札 */,
0x84A1 /* 劇 */, 0xBEE7 /* 剧 */,
0x84A2 /* 劉 */, 0xC1F5 /* 刘 */,
0x84A3 /* 劊 */, 0xB9F4 /* 刽 */,
0x84A5 /* 劌 */, 0xD8DB /* 刿 */,
0x84A6 /* 劍 */, 0xBDA3 /* 剑 */,
0x84A9 /* 劑 */, 0xBCC1 /* 剂 */,
0x84C1 /* 劻 */, 0xBFEF /* 匡 */,
0x84C5 /* 勁 */, 0xBEA2 /* 劲 */,
0x84D3 /* 動 */, 0xB6AF /* 动 */,
0x84D4 /* 勗 */, 0xDBC3 /* 勖 */,
0x84D5 /* 務 */, 0xCEF1 /* 务 */,
0x84D7 /* 勛 */, 0xD1AB /* 勋 */,
0x84D9 /* 勝 */, 0xCAA4 /* 胜 */,
0x84DA /* 勞 */, 0xC0CD /* 劳 */,
0x84DD /* 勢 */, 0xCAC6 /* 势 */,
0x84DE /* 勣 */, 0xBBFD /* 积 */,
0x84E0 /* 勦 */, 0xBDCB /* 剿 */,
0x84EA /* 勱 */, 0xDBBD /* 劢 */,
0x84EC /* 勳 */, 0xD1AB /* 勋 */,
0x84EE /* 勵 */, 0xC0F8 /* 励 */,
0x84F1 /* 勸 */, 0xC8B0 /* 劝 */,
0x84F2 /* 勻 */, 0xD4C8 /* 匀 */,
0x8548 /* 匟 */, 0xBFBB /* 炕 */,
0x8551 /* 匭 */, 0xD8D0 /* 匦 */,
0x8552 /* 匯 */, 0xBBE3 /* 汇 */,
0x8554 /* 匱 */, 0xD8D1 /* 匮 */,
0x855E /* 區 */, 0xC7F8 /* 区 */,
0x8566 /* 協 */, 0xD0AD /* 协 */,
0x8572 /* 卹 */, 0xD0F4 /* 恤 */,
0x8573 /* 卻 */, 0xC8B4 /* 却 */,
0x8587 /* 厙 */, 0xD8C7 /* 厍 */,
0x858D /* 厤 */, 0xC0FA /* 历 */,
0x8592 /* 厭 */, 0xD1E1 /* 厌 */,
0x8596 /* 厲 */, 0xC0F7 /* 厉 */,
0x8598 /* 厴 */, 0xD8C9 /* 厣 */,
0x85A2 /* 參 */, 0xB2CE /* 参 */,
0x85B2 /* 叢 */, 0xB4D4 /* 丛 */,
0x85BC /* 吋 */, 0xB4E7 /* 寸 */,
0x85C7 /* 吳 */, 0xCEE2 /* 吴 */,
0x85C8 /* 吶 */, 0xC4C5 /* 呐 */,
0x85CE /* 呂 */, 0xC2C0 /* 吕 */,
0x85D5 /* 呎 */, 0xB3DF /* 尺 */,
0x864A /* 咼 */, 0xDFC3 /* 呙 */,
0x8654 /* 員 */, 0xD4B1 /* 员 */,
0x8668 /* 唄 */, 0xDFC2 /* 呗 */,
0x8688 /* 唸 */, 0xC4EE /* 念 */,
0x8696 /* 問 */, 0xCECA /* 问 */,
0x8697 /* 啑 */, 0xE0A9 /* 喋 */,
0x869B /* 啗 */, 0xE0A2 /* 啖 */,
0x86A1 /* 啞 */, 0xD1C6 /* 哑 */,
0x86A2 /* 啟 */, 0xC6F4 /* 启 */,
0x86A5 /* 啣 */, 0xCFCE /* 衔 */,
0x86B9 /* 喒 */, 0xD4DB /* 咱 */,
0x86BE /* 喚 */, 0xBBBD /* 唤 */,
0x86CA /* 喪 */, 0xC9A5 /* 丧 */,
0x86CB /* 喫 */, 0xB3D4 /* 吃 */,
0x86CC /* 喬 */, 0xC7C7 /* 乔 */,
0x86CE /* 單 */, 0xB5A5 /* 单 */,
0x86D1 /* 喲 */, 0xD3B4 /* 哟 */,
0x86DC /* 嗆 */, 0xC7BA /* 呛 */,
0x86DD /* 嗇 */, 0xD8C4 /* 啬 */,
0x86E1 /* 嗎 */, 0xC2F0 /* 吗 */,
0x86E8 /* 嗚 */, 0xCED8 /* 呜 */,
0x86EE /* 嗩 */, 0xDFEF /* 唢 */,
0x86F4 /* 嗶 */, 0xDFD9 /* 哔 */,
0x8740 /* 嘆 */, 0xCCBE /* 叹 */,
0x8744 /* 嘍 */, 0xE0B6 /* 喽 */,
0x8749 /* 嘔 */, 0xC5BB /* 呕 */,
0x874B /* 嘖 */, 0xDFF5 /* 啧 */,
0x874C /* 嘗 */, 0xB3A2 /* 尝 */,
0x874F /* 嘜 */, 0xDFE9 /* 唛 */,
0x8757 /* 嘩 */, 0xBBA9 /* 哗 */,
0x875A /* 嘮 */, 0xDFEB /* 唠 */,
0x875B /* 嘯 */, 0xD0A5 /* 啸 */,
0x875C /* 嘰 */, 0xDFB4 /* 叽 */,
0x875E /* 嘵 */, 0xDFD8 /* 哓 */,
0x8760 /* 嘸 */, 0xDFBC /* 呒 */,
0x8766 /* 噁 */, 0xB6F1 /* 恶 */,
0x876E /* 噉 */, 0xE0A2 /* 啖 */,
0x8775 /* 噓 */, 0xD0EA /* 嘘 */,
0x877D /* 噠 */, 0xDFD5 /* 哒 */,
0x8781 /* 噥 */, 0xDFE6 /* 哝 */,
0x8782 /* 噦 */, 0xDFDC /* 哕 */,
0x8786 /* 噯 */, 0xE0C8 /* 嗳 */,
0x8788 /* 噲 */, 0xDFE0 /* 哙 */,
0x878A /* 噴 */, 0xC5E7 /* 喷 */,
0x878D /* 噸 */, 0xB6D6 /* 吨 */,
0x878E /* 噹 */, 0xB5B1 /* 当 */,
0x8793 /* 嚀 */, 0xDFCC /* 咛 */,
0x8798 /* 嚇 */, 0xCFC5 /* 吓 */,
0x879D /* 嚌 */, 0xDFE2 /* 哜 */,
0x879F /* 嚐 */, 0xB3A2 /* 尝 */,
0x87A3 /* 嚕 */, 0xE0E0 /* 噜 */,
0x87A7 /* 嚙 */, 0xC4F6 /* 啮 */,
0x87B2 /* 嚥 */, 0xD1CA /* 咽 */,
0x87B3 /* 嚦 */, 0xDFBF /* 呖 */,
0x87B5 /* 嚨 */, 0xC1FC /* 咙 */,
0x87BB /* 嚮 */, 0xCFF2 /* 向 */,
0x87BF /* 嚳 */, 0xE0B7 /* 喾 */,
0x87C0 /* 嚴 */, 0xD1CF /* 严 */,
0x87C2 /* 嚶 */, 0xE0D3 /* 嘤 */,
0x87CA /* 囀 */, 0xDFF9 /* 啭 */,
0x87CB /* 囁 */, 0xE0BF /* 嗫 */,
0x87CC /* 囂 */, 0xCFF9 /* 嚣 */,
0x87CF /* 囅 */, 0xD9E6 /* 冁 */,
0x87D2 /* 囈 */, 0xDFBD /* 呓 */,
0x87D3 /* 囉 */, 0xC2DE /* 罗 */,
0x87D5 /* 囌 */, 0xCBD5 /* 苏 */,
0x87D6 /* 囍 */, 0xCFB2 /* 喜 */,
0x87DA /* 囑 */, 0xD6F6 /* 嘱 */,
0x87DC /* 囓 */, 0xC4F6 /* 啮 */,
0x87E8 /* 囪 */, 0xB4D1 /* 囱 */,
0x87F7 /* 圇 */, 0xE0F0 /* 囵 */,
0x87F8 /* 國 */, 0xB9FA /* 国 */,
0x87FA /* 圍 */, 0xCEA7 /* 围 */,
0x8840 /* 園 */, 0xD4B0 /* 园 */,
0x8841 /* 圓 */, 0xD4B2 /* 圆 */,
0x8844 /* 圖 */, 0xCDBC /* 图 */,
0x8846 /* 團 */, 0xCDC5 /* 团 */,
0x8873 /* 坰 */, 0xDBF0 /* 垧 */,
0x8877 /* 坵 */, 0xC7F0 /* 丘 */,
0x88B8 /* 埜 */, 0xD2B0 /* 野 */,
0x88BA /* 埡 */, 0xDBEB /* 垭 */,
0x88BF /* 埧 */, 0xB0D3 /* 坝 */,
0x88C6 /* 埰 */, 0xB2C9 /* 采 */,
0x88C9 /* 埳 */, 0xBFB2 /* 坎 */,
0x88CC /* 執 */, 0xD6B4 /* 执 */,
0x88D4 /* 堅 */, 0xBCE1 /* 坚 */,
0x88D7 /* 堊 */, 0xDBD1 /* 垩 */,
0x88E5 /* 堝 */, 0xDBF6 /* 埚 */,
0x88F2 /* 堯 */, 0xD2A2 /* 尧 */,
0x88F3 /* 報 */, 0xB1A8 /* 报 */,
0x88F6 /* 場 */, 0xB3A1 /* 场 */,
0x8941 /* 堿 */, 0xBCEE /* 碱 */,
0x894B /* 塊 */, 0xBFE9 /* 块 */,
0x894C /* 塋 */, 0xDCE3 /* 茔 */,
0x894E /* 塏 */, 0xDBEE /* 垲 */,
0x8950 /* 塒 */, 0xDBF5 /* 埘 */,
0x8954 /* 塗 */, 0xCDBF /* 涂 */,
0x8956 /* 塚 */, 0xDAA3 /* 冢 */,
0x895D /* 塢 */, 0xCEEB /* 坞 */,
0x895F /* 塤 */, 0xDBF7 /* 埙 */,
0x8969 /* 塱 */, 0xC0CA /* 朗 */,
0x896D /* 塵 */, 0xB3BE /* 尘 */,
0x8971 /* 塹 */, 0xC7B5 /* 堑 */,
0x8974 /* 塼 */, 0xD7A9 /* 砖 */,
0x897C /* 墊 */, 0xB5E6 /* 垫 */,
0x8984 /* 墑 */, 0xC9CA /* 墒 */,
0x898B /* 墜 */, 0xD7B9 /* 坠 */,
0x898C /* 墝 */, 0xEDCD /* 硗 */,
0x8999 /* 墮 */, 0xB6E9 /* 堕 */,
0x899E /* 墳 */, 0xB7D8 /* 坟 */,
0x89A8 /* 墾 */, 0xBFD1 /* 垦 */,
0x89AF /* 壇 */, 0xCCB3 /* 坛 */,
0x89B6 /* 壎 */, 0xDBF7 /* 埙 */,
0x89BA /* 壓 */, 0xD1B9 /* 压 */,
0x89BE /* 壘 */, 0xC0DD /* 垒 */,
0x89BF /* 壙 */, 0xDBDB /* 圹 */,
0x89C0 /* 壚 */, 0xDBE4 /* 垆 */,
0x89C4 /* 壞 */, 0xBBB5 /* 坏 */,
0x89C5 /* 壟 */, 0xC2A2 /* 垄 */,
0x89C8 /* 壢 */, 0xDBDE /* 坜 */,
0x89CE /* 壩 */, 0xB0D3 /* 坝 */,
0x89D1 /* 壯 */, 0xD7B3 /* 壮 */,
0x89D8 /* 壺 */, 0xBAF8 /* 壶 */,
0x89DB /* 壽 */, 0xCAD9 /* 寿 */,
0x89F2 /* 夠 */, 0xB9BB /* 够 */,
0x89F4 /* 夢 */, 0xC3CE /* 梦 */,
0xE2B7 /* 夥 */, 0xBBEF /* 伙 */,
0x8A41 /* 夾 */, 0xBCD0 /* 夹 */,
0x8A4A /* 奐 */, 0xDBBC /* 奂 */,
0x8A57 /* 奧 */, 0xB0C2 /* 奥 */,
0x8A59 /* 奩 */, 0xDEC6 /* 奁 */,
0x8A5A /* 奪 */, 0xB6E1 /* 夺 */,
0x8A5E /* 奮 */, 0xB7DC /* 奋 */,
0x8A79 /* 妝 */, 0xD7B1 /* 妆 */,
0x8A85 /* 妳 */, 0xC4E3 /* 你 */,
0x8A99 /* 姍 */, 0xE6A9 /* 姗 */,
0x8AA6 /* 姦 */, 0xBCE9 /* 奸 */,
0x8AA9 /* 姪 */, 0xD6B6 /* 侄 */,
0x8ACA /* 娛 */, 0xD3E9 /* 娱 */,
0x8AE4 /* 婁 */, 0xC2A6 /* 娄 */,
0x8AF0 /* 婐 */, 0xE6B9 /* 婀 */,
0x8B44 /* 婦 */, 0xB8BE /* 妇 */,
0x8B48 /* 婬 */, 0xD2F9 /* 淫 */,
0x8B49 /* 婭 */, 0xE6AB /* 娅 */,
0x8B53 /* 婼 */, 0xC8F4 /* 若 */,
0x8B7A /* 媧 */, 0xE6B4 /* 娲 */,
0x8B81 /* 媮 */, 0xCDB5 /* 偷 */,
0x8B82 /* 媯 */, 0xE6A3 /* 妫 */,
0x8B8B /* 媼 */, 0xE6C1 /* 媪 */,
0x8B8C /* 媽 */, 0xC2E8 /* 妈 */,
0x8B9E /* 嫗 */, 0xE5FD /* 妪 */,
0x8BB3 /* 嫵 */, 0xE5FC /* 妩 */,
0x8BB9 /* 嫻 */, 0xE6B5 /* 娴 */,
0x8BC6 /* 嬈 */, 0xE6AC /* 娆 */,
0x8BC8 /* 嬋 */, 0xE6BF /* 婵 */,
0x8BC9 /* 嬌 */, 0xBDBF /* 娇 */,
0x8BD4 /* 嬙 */, 0xE6CD /* 嫱 */,
0x8BD8 /* 嬝 */, 0xF4C1 /* 袅 */,
0x8BDC /* 嬡 */, 0xE6C8 /* 嫒 */,
0x8BDF /* 嬤 */, 0xE6D6 /* 嬷 */,
0x8BE5 /* 嬪 */, 0xE6C9 /* 嫔 */,
0x8BE8 /* 嬭 */, 0xC4CC /* 奶 */,
0x8BEB /* 嬰 */, 0xD3A4 /* 婴 */,
0x8BF0 /* 嬸 */, 0xC9F4 /* 婶 */,
0x8BF6 /* 嬾 */, 0xC0C1 /* 懒 */,
0x8BFA /* 孃 */, 0xC4EF /* 娘 */,
0x8C44 /* 孌 */, 0xE6AE /* 娈 */,
0x8C4F /* 孫 */, 0xCBEF /* 孙 */,
0x8C57 /* 學 */, 0xD1A7 /* 学 */,
0x8C5C /* 孿 */, 0xC2CF /* 孪 */,
0x8C6D /* 宮 */, 0xB9AC /* 宫 */,
0x8C75 /* 寀 */, 0xB2C9 /* 采 */,
0x8C80 /* 寑 */, 0xC7DE /* 寝 */,
0x8C81 /* 寔 */, 0xCAB5 /* 实 */,
0x8C85 /* 寘 */, 0xD6C3 /* 置 */,
0x8C8B /* 寢 */, 0xC7DE /* 寝 */,
0x8C8D /* 實 */, 0xCAB5 /* 实 */,
0x8C8E /* 寧 */, 0xC4FE /* 宁 */,
0x8C8F /* 審 */, 0xC9F3 /* 审 */,
0x8C91 /* 寫 */, 0xD0B4 /* 写 */,
0x8C92 /* 寬 */, 0xBFED /* 宽 */,
0x8C94 /* 寯 */, 0xBFA1 /* 俊 */,
0x8C99 /* 寵 */, 0xB3E8 /* 宠 */,
0x8C9A /* 寶 */, 0xB1A6 /* 宝 */,
0x8CA2 /* 將 */, 0xBDAB /* 将 */,
0x8CA3 /* 專 */, 0xD7A8 /* 专 */,
0x8CA4 /* 尋 */, 0xD1B0 /* 寻 */,
0x8CA6 /* 對 */, 0xB6D4 /* 对 */,
0x8CA7 /* 導 */, 0xB5BC /* 导 */,
0x8CA9 /* 尒 */, 0xB6FB /* 尔 */,
0x8CAF /* 尟 */, 0xCFCA /* 鲜 */,
0x8CC0 /* 尷 */, 0xDECF /* 尴 */,
0x8CC3 /* 屆 */, 0xBDEC /* 届 */,
0x8CC6 /* 屍 */, 0xCAAC /* 尸 */,
0x8CCF /* 屜 */, 0xCCEB /* 屉 */,
0x8CD0 /* 屝 */, 0xECE9 /* 扉 */,
0x8CD2 /* 屢 */, 0xC2C5 /* 屡 */,
0x8CD3 /* 層 */, 0xB2E3 /* 层 */,
0x8CD5 /* 屨 */, 0xE5F0 /* 屦 */,
0x8CD9 /* 屬 */, 0xCAF4 /* 属 */,
0x8CF9 /* 岡 */, 0xB8D4 /* 冈 */,
0x8CFD /* 岧 */, 0xCCF6 /* 迢 */,
0x8D73 /* 峴 */, 0xE1AD /* 岘 */,
0x8D75 /* 島 */, 0xB5BA /* 岛 */,
0x8D7B /* 峽 */, 0xCFBF /* 峡 */,
0x8D80 /* 崁 */, 0xBFB2 /* 坎 */,
0x8D88 /* 崍 */, 0xE1C1 /* 崃 */,
0x8D8B /* 崑 */, 0xC0A5 /* 昆 */,
0x8D8F /* 崗 */, 0xB8DA /* 岗 */,
0x8D91 /* 崙 */, 0xC2D8 /* 仑 */,
0x8D92 /* 崚 */, 0xC0E2 /* 棱 */,
0x8D96 /* 崠 */, 0xE1B4 /* 岽 */,
0x8D98 /* 崢 */, 0xE1BF /* 峥 */,
0x8DA3 /* 崳 */, 0xE1CE /* 嵛 */,
0x8DB9 /* 嵐 */, 0xE1B0 /* 岚 */,
0x8DBB /* 嵒 */, 0xD1D2 /* 岩 */,
0x8DC1 /* 嵙 */, 0xBFC6 /* 科 */,
0x8DE2 /* 嶁 */, 0xE1D0 /* 嵝 */,
0x8DE4 /* 嶄 */, 0xD5B8 /* 崭 */,
0x8DE7 /* 嶇 */, 0xE1AB /* 岖 */,
0x8DF7 /* 嶗 */, 0xE1C0 /* 崂 */,
0x8DFE /* 嶠 */, 0xE1BD /* 峤 */,
0x8E46 /* 嶧 */, 0xE1BB /* 峄 */,
0x8E56 /* 嶸 */, 0xE1C9 /* 嵘 */,
0x8E58 /* 嶺 */, 0xC1EB /* 岭 */,
0x8E5A /* 嶼 */, 0xD3EC /* 屿 */,
0x8E5B /* 嶽 */, 0xD4C0 /* 岳 */,
0x8E68 /* 巋 */, 0xBFF9 /* 岿 */,
0x8E6E /* 巒 */, 0xC2CD /* 峦 */,
0x8E70 /* 巔 */, 0xE1DB /* 巅 */,
0x8E72 /* 巖 */, 0xD1D2 /* 岩 */,
0x8E84 /* 巹 */, 0xDAE1 /* 卺 */,
0x8E9B /* 帥 */, 0xCBA7 /* 帅 */,
0x8E9F /* 師 */, 0xCAA6 /* 师 */,
0x8EA4 /* 帳 */, 0xD5CA /* 帐 */,
0x8EA7 /* 帶 */, 0xB4F8 /* 带 */,
0x8EAC /* 幀 */, 0xD6A1 /* 帧 */,
0x8EAE /* 幃 */, 0xE0F8 /* 帏 */,
0x8EBD /* 幗 */, 0xE0FE /* 帼 */,
0x8EBE /* 幘 */, 0xE0FD /* 帻 */,
0x8EC3 /* 幟 */, 0xD6C4 /* 帜 */,
0x8EC5 /* 幣 */, 0xB1D2 /* 币 */,
0x8ECD /* 幫 */, 0xB0EF /* 帮 */,
0x8ECE /* 幬 */, 0xE0FC /* 帱 */,
0x8ED6 /* 幹 */, 0xB8C9 /* 干 */,
0x8ED7 /* 幾 */, 0xBCB8 /* 几 */,
0x8ED9 /* 庂 */, 0xD8C6 /* 仄 */,
0x8EEC /* 庫 */, 0xBFE2 /* 库 */,
0x8EFA /* 廁 */, 0xB2DE /* 厕 */,
0x8EFB /* 廂 */, 0xCFE1 /* 厢 */,
0x8EFD /* 廄 */, 0xBEC7 /* 厩 */,
0x8F42 /* 廈 */, 0xCFC3 /* 厦 */,
0x8F4A /* 廕 */, 0xD2F1 /* 荫 */,
0x8F4E /* 廚 */, 0xB3F8 /* 厨 */,
0x8F50 /* 廝 */, 0xD8CB /* 厮 */,
0x8F52 /* 廟 */, 0xC3ED /* 庙 */,
0x8F53 /* 廠 */, 0xB3A7 /* 厂 */,
0x8F54 /* 廡 */, 0xE2D0 /* 庑 */,
0x8F55 /* 廢 */, 0xB7CF /* 废 */,
0x8F56 /* 廣 */, 0xB9E3 /* 广 */,
0x8F5B /* 廩 */, 0xE2DE /* 廪 */,
0x8F5D /* 廬 */, 0xC2AE /* 庐 */,
0x8F62 /* 廱 */, 0xD3B8 /* 痈 */,
0x8F64 /* 廳 */, 0xCCFC /* 厅 */,
0x8F73 /* 弒 */, 0xDFB1 /* 弑 */,
0x8F74 /* 弔 */, 0xB5F5 /* 吊 */,
0x8F86 /* 弳 */, 0xE5F2 /* 弪 */,
0x8F88 /* 張 */, 0xD5C5 /* 张 */,
0x8F8A /* 強 */, 0xC7BF /* 强 */,
0x8F95 /* 彆 */, 0xB1F0 /* 别 */,
0x8F97 /* 彈 */, 0xB5AF /* 弹 */,
0x8F99 /* 彊 */, 0xC7BF /* 强 */,
0x8F9B /* 彌 */, 0xC3D6 /* 弥 */,
0x8F9D /* 彎 */, 0xCDE4 /* 弯 */,
0x8FA0 /* 彔 */, 0xC2BC /* 录 */,
0x8FA1 /* 彙 */, 0xBBE3 /* 汇 */,
0x8FA9 /* 彥 */, 0xD1E5 /* 彦 */,
0x8FAC /* 彫 */, 0xB5F1 /* 雕 */,
0x8FB7 /* 彿 */, 0xB7F0 /* 佛 */,
0xE1E1 /* 後 */, 0xBAF3 /* 后 */,
0x8FBD /* 徑 */, 0xBEB6 /* 径 */,
0x8FC4 /* 從 */, 0xB4D3 /* 从 */,
0x8FC6 /* 徠 */, 0xE1E2 /* 徕 */,
0x8FCD /* 復 */, 0xB8B4 /* 复 */,
0x8FCF /* 徬 */, 0xC5D4 /* 旁 */,
0xE1E7 /* 徵 */, 0xD5F7 /* 征 */,
0x8FD8 /* 徹 */, 0xB3B9 /* 彻 */,
0x9055 /* 怳 */, 0xBBD0 /* 恍 */,
0x9061 /* 恆 */, 0xBAE3 /* 恒 */,
0x9075 /* 恥 */, 0xB3DC /* 耻 */,
0x9082 /* 悅 */, 0xD4C3 /* 悦 */,
0x909D /* 悵 */, 0xE2EA /* 怅 */,
0x909E /* 悶 */, 0xC3C6 /* 闷 */,
0x90A2 /* 悽 */, 0xC6E0 /* 凄 */,
0x90B0 /* 惏 */, 0xC0B7 /* 婪 */,
0x90BA /* 惡 */, 0xB6F1 /* 恶 */,
0x90C0 /* 惱 */, 0xC4D5 /* 恼 */,
0x90C1 /* 惲 */, 0xE3A2 /* 恽 */,
0x90C5 /* 惻 */, 0xE2FC /* 恻 */,
0x90DB /* 愛 */, 0xB0AE /* 爱 */,
0x90DC /* 愜 */, 0xE3AB /* 惬 */,
0x90E2 /* 愨 */, 0xEDA8 /* 悫 */,
0x90ED /* 愴 */, 0xE2EB /* 怆 */,
0x90F0 /* 愷 */, 0xE2FD /* 恺 */,
0x90F7 /* 愾 */, 0xE2E9 /* 忾 */,
0x90FC /* 慄 */, 0xC0F5 /* 栗 */,
0x9140 /* 慇 */, 0xD2F3 /* 殷 */,
0x9142 /* 態 */, 0xCCAC /* 态 */,
0x9143 /* 慍 */, 0xE3B3 /* 愠 */,
0x914B /* 慘 */, 0xB2D2 /* 惨 */,
0x914D /* 慚 */, 0xB2D1 /* 惭 */,
0x9151 /* 慟 */, 0xE2FA /* 恸 */,
0x9154 /* 慣 */, 0xB9DF /* 惯 */,
0x9159 /* 慪 */, 0xE2E6 /* 怄 */,
0x915A /* 慫 */, 0xCBCB /* 怂 */,
0x915D /* 慮 */, 0xC2C7 /* 虑 */,
0x9161 /* 慳 */, 0xE3A5 /* 悭 */,
0x9162 /* 慴 */, 0xC9E5 /* 慑 */,
0x9163 /* 慶 */, 0xC7EC /* 庆 */,
0x9168 /* 慼 */, 0xC6DD /* 戚 */,
0x916A /* 慾 */, 0xD3FB /* 欲 */,
0x916E /* 憂 */, 0xD3C7 /* 忧 */,
0x9176 /* 憊 */, 0xB1B9 /* 惫 */,
0x917A /* 憐 */, 0xC1AF /* 怜 */,
0x917B /* 憑 */, 0xC6BE /* 凭 */,
0x917C /* 憒 */, 0xE3B4 /* 愦 */,
0x9184 /* 憚 */, 0xB5AC /* 惮 */,
0x918D /* 憤 */, 0xB7DF /* 愤 */,
0x9191 /* 憫 */, 0xC3F5 /* 悯 */,
0x9193 /* 憮 */, 0xE2E4 /* 怃 */,
0x9197 /* 憲 */, 0xCFDC /* 宪 */,
0x919B /* 憶 */, 0xD2E4 /* 忆 */,
0x91A5 /* 懃 */, 0xC7DA /* 勤 */,
0x91A9 /* 懇 */, 0xBFD2 /* 恳 */,
0x91AA /* 應 */, 0xD3A6 /* 应 */,
0x91AB /* 懌 */, 0xE2F8 /* 怿 */,
0x91AC /* 懍 */, 0xE9DD /* 檩 */,
0x91BA /* 懞 */, 0xC3C9 /* 蒙 */,
0x91BB /* 懟 */, 0xEDA1 /* 怼 */,
0x91BF /* 懣 */, 0xEDAF /* 懑 */,
0x91C3 /* 懨 */, 0xE2FB /* 恹 */,
0x91CD /* 懲 */, 0xB3CD /* 惩 */,
0x91D0 /* 懶 */, 0xC0C1 /* 懒 */,
0x91D1 /* 懷 */, 0xBBB3 /* 怀 */,
0x91D2 /* 懸 */, 0xD0FC /* 悬 */,
0x91D4 /* 懺 */, 0xE2E3 /* 忏 */,
0x91D6 /* 懼 */, 0xBEE5 /* 惧 */,
0x91D7 /* 懽 */, 0xBBB6 /* 欢 */,
0x91D8 /* 懾 */, 0xC9E5 /* 慑 */,
0x91D9 /* 戀 */, 0xC1B5 /* 恋 */,
0x91DF /* 戇 */, 0xEDB0 /* 戆 */,
0x91E0 /* 戉 */, 0xEEE1 /* 钺 */,
0x91E2 /* 戔 */, 0xEAA7 /* 戋 */,
0x91EA /* 戧 */, 0xEAA8 /* 戗 */,
0x91EC /* 戩 */, 0xEAAF /* 戬 */,
0x91F0 /* 戰 */, 0xD5BD /* 战 */,
0x91F2 /* 戲 */, 0xCFB7 /* 戏 */,
0x91F4 /* 戶 */, 0xBBA7 /* 户 */,
0x9241 /* 扐 */, 0xD8EC /* 仂 */,
0x9249 /* 扞 */, 0xBAB4 /* 捍 */,
0x924B /* 扠 */, 0xB2E6 /* 叉 */,
0x9257 /* 扺 */, 0xB5D6 /* 抵 */,
0x925C /* 抃 */, 0xDED5 /* 拚 */,
0x925E /* 抆 */, 0xB2C1 /* 擦 */,
0x9264 /* 抎 */, 0xE9E6 /* 殒 */,
0x9277 /* 抴 */, 0xD2B7 /* 曳 */,
0x9281 /* 拋 */, 0xC5D7 /* 抛 */,
0x9282 /* 拏 */, 0xC4C3 /* 拿 */,
0x9283 /* 拑 */, 0xC7AF /* 钳 */,
0x929D /* 挐 */, 0xC4C3 /* 拿 */,
0x92B1 /* 挶 */, 0xBED6 /* 局 */,
0x92B6 /* 挾 */, 0xD0AE /* 挟 */,
0x92BA /* 捄 */, 0xBEC8 /* 救 */,
0x92CE /* 捨 */, 0xC9E1 /* 舍 */,
0x92D0 /* 捫 */, 0xDED1 /* 扪 */,
0x92D4 /* 捲 */, 0xBEED /* 卷 */,
0x92DF /* 掃 */, 0xC9A8 /* 扫 */,
0x92E0 /* 掄 */, 0xC2D5 /* 抡 */,
0x92EA /* 掙 */, 0xD5F5 /* 挣 */,
0x92EC /* 掛 */, 0xB9D2 /* 挂 */,
0x92F1 /* 採 */, 0xB2C9 /* 采 */,
0x92F6 /* 掱 */, 0xB0C7 /* 扒 */,
0x92FC /* 掽 */, 0xC5F6 /* 碰 */,
0x92FE /* 揀 */, 0xBCF0 /* 拣 */,
0x9348 /* 揌 */, 0xC8FB /* 塞 */,
0x9350 /* 揚 */, 0xD1EF /* 扬 */,
0x9351 /* 換 */, 0xBBBB /* 换 */,
0x9352 /* 揜 */, 0xD1DA /* 掩 */,
0x935B /* 揫 */, 0xBEBE /* 揪 */,
0x935D /* 揮 */, 0xBBD3 /* 挥 */,
0x9364 /* 揹 */, 0xB1B3 /* 背 */,
0x936B /* 搆 */, 0xB9B9 /* 构 */,
0x936E /* 搉 */, 0xC8B6 /* 榷 */,
0x9370 /* 損 */, 0xCBF0 /* 损 */,
0x9375 /* 搖 */, 0xD2A1 /* 摇 */,
0x9376 /* 搗 */, 0xB5B7 /* 捣 */,
0x937B /* 搟 */, 0xDFA6 /* 擀 */,
0x9380 /* 搥 */, 0xB4B7 /* 捶 */,
0x9381 /* 搧 */, 0xC9BF /* 煽 */,
0x9382 /* 搨 */, 0xCDD8 /* 拓 */,
0x938C /* 搶 */, 0xC7C0 /* 抢 */,
0x9392 /* 搾 */, 0xD5A5 /* 榨 */,
0x9393 /* 摀 */, 0xCEE6 /* 捂 */,
0x9395 /* 摃 */, 0xBFB8 /* 扛 */,
0x939D /* 摑 */, 0xDEE2 /* 掴 */,
0x93A5 /* 摜 */, 0xDEE8 /* 掼 */,
0x93A7 /* 摟 */, 0xC2A7 /* 搂 */,
0x93B4 /* 摯 */, 0xD6BF /* 挚 */,
0x93B8 /* 摳 */, 0xBFD9 /* 抠 */,
0x93BB /* 摶 */, 0xDED2 /* 抟 */,
0x93BD /* 摻 */, 0xB2F4 /* 掺 */,
0x93C6 /* 撈 */, 0xC0CC /* 捞 */,
0x93CE /* 撐 */, 0xB3C5 /* 撑 */,
0x93CF /* 撓 */, 0xC4D3 /* 挠 */,
0x93D3 /* 撚 */, 0xC4ED /* 捻 */,
0x93D7 /* 撟 */, 0xDED8 /* 挢 */,
0x93DA /* 撢 */, 0xB5A7 /* 掸 */,
0x93DB /* 撣 */, 0xB5A7 /* 掸 */,
0x93DC /* 撥 */, 0xB2A6 /* 拨 */,
0x93DD /* 撦 */, 0xB3B6 /* 扯 */,
0x93E1 /* 撫 */, 0xB8A7 /* 抚 */,
0x93E4 /* 撲 */, 0xC6CB /* 扑 */,
0x93E5 /* 撳 */, 0xDEEC /* 揿 */,
0x93E9 /* 撻 */, 0xCCA2 /* 挞 */,
0x93EB /* 撾 */, 0xCECE /* 挝 */,
0x93EC /* 撿 */, 0xBCF1 /* 捡 */,
0x93ED /* 擁 */, 0xD3B5 /* 拥 */,
0x93EF /* 擄 */, 0xC2B0 /* 掳 */,
0x93F1 /* 擇 */, 0xD4F1 /* 择 */,
0x93F4 /* 擊 */, 0xBBF7 /* 击 */,
0x93F5 /* 擋 */, 0xB5B2 /* 挡 */,
0x93FA /* 擔 */, 0xB5A3 /* 担 */,
0x93FE /* 據 */, 0xBEDD /* 据 */,
0x9444 /* 擠 */, 0xBCB7 /* 挤 */,
0x9446 /* 擣 */, 0xB5B7 /* 捣 */,
0x944D /* 擬 */, 0xC4E2 /* 拟 */,
0x944E /* 擭 */, 0xBBA4 /* 护 */,
0x9450 /* 擯 */, 0xB1F7 /* 摈 */,
0x9451 /* 擰 */, 0xC5A1 /* 拧 */,
0x9452 /* 擱 */, 0xB8E9 /* 搁 */,
0x9453 /* 擲 */, 0xD6C0 /* 掷 */,
0x9455 /* 擴 */, 0xC0A9 /* 扩 */,
0x9458 /* 擷 */, 0xDFA2 /* 撷 */,
0x945B /* 擺 */, 0xB0DA /* 摆 */,
0x945C /* 擻 */, 0xCBD3 /* 擞 */,
0x945D /* 擼 */, 0xDFA3 /* 撸 */,
0x945F /* 擾 */, 0xC8C5 /* 扰 */,
0x9464 /* 攄 */, 0xDEF3 /* 摅 */,
0x9466 /* 攆 */, 0xC4EC /* 撵 */,
0x946E /* 攏 */, 0xC2A3 /* 拢 */,
0x9472 /* 攔 */, 0xC0B9 /* 拦 */,
0x9473 /* 攕 */, 0xCFCB /* 纤 */,
0x9474 /* 攖 */, 0xDEFC /* 撄 */,
0x9476 /* 攙 */, 0xB2F3 /* 搀 */,
0x9478 /* 攛 */, 0xDFA5 /* 撺 */,
0x9479 /* 攜 */, 0xD0AF /* 携 */,
0x947A /* 攝 */, 0xC9E3 /* 摄 */,
0x9480 /* 攢 */, 0xD4DC /* 攒 */,
0x9481 /* 攣 */, 0xC2CE /* 挛 */,
0x9482 /* 攤 */, 0xCCAF /* 摊 */,
0x9487 /* 攪 */, 0xBDC1 /* 搅 */,
0x9488 /* 攬 */, 0xC0BF /* 揽 */,
0x948E /* 攷 */, 0xBFBC /* 考 */,
0x9493 /* 敁 */, 0xB5E0 /* 掂 */,
0x94A1 /* 敗 */, 0xB0DC /* 败 */,
0x94A2 /* 敘 */, 0xD0F0 /* 叙 */,
0x94AD /* 敪 */, 0xB6DE /* 掇 */,
0x94B3 /* 敵 */, 0xB5D0 /* 敌 */,
0x94B5 /* 數 */, 0xCAFD /* 数 */,
0x94B7 /* 敺 */, 0xC7FD /* 驱 */,
0x94BF /* 斂 */, 0xC1B2 /* 敛 */,
0x94C0 /* 斃 */, 0xB1D0 /* 毙 */,
0x94CC /* 斕 */, 0xECB5 /* 斓 */,
0x94D8 /* 斬 */, 0xD5B6 /* 斩 */,
0x94D9 /* 斮 */, 0xEDBD /* 斫 */,
0x94DB /* 斲 */, 0xEDBD /* 斫 */,
0x94E0 /* 斷 */, 0xB6CF /* 断 */,
0xECB6 /* 於 */, 0xD3DA /* 于 */,
0x94E7 /* 旂 */, 0xC6EC /* 旗 */,
0x94F5 /* 旛 */, 0xE1A6 /* 幡 */,
0x954E /* 昇 */, 0xC9FD /* 升 */,
0x9572 /* 時 */, 0xCAB1 /* 时 */,
0x9578 /* 晉 */, 0xBDFA /* 晋 */,
0x9583 /* 晝 */, 0xD6E7 /* 昼 */,
0x9584 /* 晞 */, 0xEAD8 /* 曦 */,
0x959E /* 暈 */, 0xD4CE /* 晕 */,
0x959F /* 暉 */, 0xEACD /* 晖 */,
0x95AA /* 暘 */, 0xD1F4 /* 阳 */,
0x95B1 /* 暠 */, 0xF0A9 /* 皓 */,
0x95B3 /* 暢 */, 0xB3A9 /* 畅 */,
0x95BA /* 暫 */, 0xD4DD /* 暂 */,
0x95BF /* 暱 */, 0xEAC7 /* 昵 */,
0x95C5 /* 暸 */, 0xC1CB /* 了 */,
0x95CF /* 曄 */, 0xEACA /* 晔 */,
0x95D1 /* 曆 */, 0xC0FA /* 历 */,
0x95D2 /* 曇 */, 0xEABC /* 昙 */,
0x95D4 /* 曉 */, 0xCFFE /* 晓 */,
0x95DA /* 曏 */, 0xCFF2 /* 向 */,
0x95E1 /* 曖 */, 0xEAD3 /* 暧 */,
0x95E7 /* 曠 */, 0xBFF5 /* 旷 */,
0x95F1 /* 曬 */, 0xC9B9 /* 晒 */,
0x95F8 /* 書 */, 0xCAE9 /* 书 */,
0x95FE /* 會 */, 0xBBE1 /* 会 */,
0x9652 /* 朢 */, 0xCDFB /* 望 */,
0x9656 /* 朧 */, 0xEBCA /* 胧 */,
0x9658 /* 朮 */, 0xCAF5 /* 术 */,
0x9667 /* 杇 */, 0xDBD8 /* 圬 */,
0x967C /* 東 */, 0xB6AB /* 东 */,
0x9691 /* 枒 */, 0xE8E2 /* 桠 */,
0x9695 /* 枙 */, 0xE8D9 /* 栀 */,
0x96A1 /* 枴 */, 0xB9D5 /* 拐 */,
0x96B9 /* 柟 */, 0xE9AA /* 楠 */,
0x96C5 /* 柵 */, 0xD5A4 /* 栅 */,
0x96CA /* 柺 */, 0xB9D5 /* 拐 */,
0x96D5 /* 栒 */, 0xD1AE /* 旬 */,
0x96D6 /* 栔 */, 0xC6F5 /* 契 */,
0x9747 /* 桮 */, 0xB1AD /* 杯 */,
0x9755 /* 桿 */, 0xB8CB /* 杆 */,
0x975B /* 梉 */, 0xD7AE /* 桩 */,
0x9764 /* 梔 */, 0xE8D9 /* 栀 */,
0x976B /* 梜 */, 0xB2DF /* 策 */,
0x976C /* 條 */, 0xCCF5 /* 条 */,
0x976E /* 梟 */, 0xE8C9 /* 枭 */,
0x9779 /* 梱 */, 0xC0A6 /* 捆 */,
0x9789 /* 棄 */, 0xC6FA /* 弃 */,
0x9793 /* 棑 */, 0xC5C5 /* 排 */,
0x9796 /* 棖 */, 0xE8C7 /* 枨 */,
0x9797 /* 棗 */, 0xD4E6 /* 枣 */,
0x979D /* 棟 */, 0xB6B0 /* 栋 */,
0x97A3 /* 棧 */, 0xD5BB /* 栈 */,
0x97AB /* 棲 */, 0xC6DC /* 栖 */,
0x97BF /* 椏 */, 0xE8E2 /* 桠 */,
0x97C5 /* 椗 */, 0xEDD6 /* 碇 */,
0x97DF /* 椷 */, 0xBCEA /* 缄 */,
0x97EE /* 楊 */, 0xD1EE /* 杨 */,
0x97F7 /* 楓 */, 0xB7E3 /* 枫 */,
0x9845 /* 楨 */, 0xE8E5 /* 桢 */,
0x9849 /* 業 */, 0xD2B5 /* 业 */,
0x984F /* 極 */, 0xBCAB /* 极 */,
0x985E /* 榐 */, 0xDEF8 /* 搌 */,
0x986C /* 榣 */, 0xD2A1 /* 摇 */,
0x986F /* 榦 */, 0xB8C9 /* 干 */,
0x9871 /* 榪 */, 0xE8BF /* 杩 */,
0x9873 /* 榮 */, 0xC8D9 /* 荣 */,
0x9881 /* 榿 */, 0xE8E7 /* 桤 */,
0x9884 /* 槃 */, 0xC5CC /* 盘 */,
0x988B /* 構 */, 0xB9B9 /* 构 */,
0x988C /* 槍 */, 0xC7B9 /* 枪 */,
0x9890 /* 槓 */, 0xB8DC /* 杠 */,
0x98A0 /* 槧 */, 0xE8FD /* 椠 */,
0x98A1 /* 槨 */, 0xE9A4 /* 椁 */,
0x98AA /* 槳 */, 0xBDB0 /* 桨 */,
0x98B3 /* 槼 */, 0xB9E6 /* 规 */,
0x98B6 /* 樁 */, 0xD7AE /* 桩 */,
0x98B7 /* 樂 */, 0xC0D6 /* 乐 */,
0x98BA /* 樅 */, 0xE8C8 /* 枞 */,
0x98C5 /* 樑 */, 0xC1BA /* 梁 */,
0x98C7 /* 樓 */, 0xC2A5 /* 楼 */,
0x98CB /* 標 */, 0xB1EA /* 标 */,
0x98D0 /* 樞 */, 0xCAE0 /* 枢 */,
0x98D3 /* 樣 */, 0xD1F9 /* 样 */,
0x98E3 /* 樸 */, 0xC6D3 /* 朴 */,
0x98E4 /* 樹 */, 0xCAF7 /* 树 */,
0x98E5 /* 樺 */, 0xE8EB /* 桦 */,
0x98EF /* 橈 */, 0xE8E3 /* 桡 */,
0x98F2 /* 橋 */, 0xC7C5 /* 桥 */,
0x9943 /* 機 */, 0xBBFA /* 机 */,
0x9945 /* 橢 */, 0xCDD6 /* 椭 */,
0x9947 /* 橤 */, 0xC8EF /* 蕊 */,
0x994D /* 橫 */, 0xBAE1 /* 横 */,
0x995F /* 檁 */, 0xE9DD /* 檩 */,
0x9966 /* 檉 */, 0xE8DF /* 柽 */,
0x996E /* 檔 */, 0xB5B5 /* 档 */,
0x9975 /* 檜 */, 0xE8ED /* 桧 */,
0x997A /* 檢 */, 0xBCEC /* 检 */,
0x997B /* 檣 */, 0xE9C9 /* 樯 */,
0x9985 /* 檯 */, 0xCCA8 /* 台 */,
0x9989 /* 檳 */, 0xE9C4 /* 槟 */,
0x998D /* 檷 */, 0xECF2 /* 祢 */,
0x998E /* 檸 */, 0xC4FB /* 柠 */,
0x9991 /* 檻 */, 0xBCF7 /* 槛 */,
0x9998 /* 櫂 */, 0xE8FE /* 棹 */,
0x9999 /* 櫃 */, 0xB9F1 /* 柜 */,
0x99A9 /* 櫓 */, 0xE9D6 /* 橹 */,
0x99B0 /* 櫚 */, 0xE9B5 /* 榈 */,
0x99B1 /* 櫛 */, 0xE8CE /* 栉 */,
0x99B3 /* 櫝 */, 0xE8FC /* 椟 */,
0x99B4 /* 櫞 */, 0xE9DA /* 橼 */,
0x99B5 /* 櫟 */, 0xE8DD /* 栎 */,
0x99BB /* 櫥 */, 0xB3F7 /* 橱 */,
0x99BD /* 櫧 */, 0xE9C6 /* 槠 */,
0x99BE /* 櫨 */, 0xE8D3 /* 栌 */,
0x99C0 /* 櫪 */, 0xE8C0 /* 枥 */,
0x99C2 /* 櫬 */, 0xE9B4 /* 榇 */,
0x99C9 /* 櫳 */, 0xE8D0 /* 栊 */,
0x99CE /* 櫸 */, 0xE9B7 /* 榉 */,
0x99D0 /* 櫺 */, 0xE8F9 /* 棂 */,
0x99D1 /* 櫻 */, 0xD3A3 /* 樱 */,
0x99DA /* 欄 */, 0xC0B8 /* 栏 */,
0x99E0 /* 權 */, 0xC8A8 /* 权 */,
0x99E5 /* 欏 */, 0xE9A1 /* 椤 */,
0x99E8 /* 欒 */, 0xE8EF /* 栾 */,
0x99EC /* 欖 */, 0xE9AD /* 榄 */,
0x99F4 /* 欞 */, 0xE8F9 /* 棂 */,
0x9A42 /* 欱 */, 0xBAC8 /* 喝 */,
0x9A47 /* 欸 */, 0xB0A6 /* 唉 */,
0x9A4A /* 欽 */, 0xC7D5 /* 钦 */,
0x9A55 /* 歎 */, 0xCCBE /* 叹 */,
0x9A57 /* 歐 */, 0xC5B7 /* 欧 */,
0x9A61 /* 歛 */, 0xC1B2 /* 敛 */,
0x9A65 /* 歟 */, 0xECA3 /* 欤 */,
0x9A67 /* 歡 */, 0xBBB6 /* 欢 */,
0x9A71 /* 歲 */, 0xCBEA /* 岁 */,
0x9A76 /* 歷 */, 0xC0FA /* 历 */,
0x9A77 /* 歸 */, 0xB9E9 /* 归 */,
0x9A7B /* 歿 */, 0xE9E2 /* 殁 */,
0x9A7C /* 殀 */, 0xD8B2 /* 夭 */,
0x9A88 /* 殘 */, 0xB2D0 /* 残 */,
0x9A8C /* 殞 */, 0xE9E6 /* 殒 */,
0x9A91 /* 殤 */, 0xE9E4 /* 殇 */,
0x9A97 /* 殫 */, 0xE9E9 /* 殚 */,
0x9A99 /* 殭 */, 0xBDA9 /* 僵 */,
0x9A9A /* 殮 */, 0xE9E7 /* 殓 */,
0x9A9B /* 殯 */, 0xE9EB /* 殡 */,
0x9A9E /* 殲 */, 0xBCDF /* 歼 */,
0x9AA2 /* 殺 */, 0xC9B1 /* 杀 */,
0x9AA4 /* 殼 */, 0xBFC7 /* 壳 */,
0x9AA5 /* 殽 */, 0xCFFD /* 淆 */,
0x9AA7 /* 毀 */, 0xBBD9 /* 毁 */,
0x9AAA /* 毆 */, 0xC5B9 /* 殴 */,
0x9AAF /* 毌 */, 0xCEE3 /* 毋 */,
0x9AB3 /* 毘 */, 0xC5FE /* 毗 */,
0x9AC2 /* 毬 */, 0xC7F2 /* 球 */,
0x9AD0 /* 毿 */, 0xEBA7 /* 毵 */,
0x9AD3 /* 氂 */, 0xEAF3 /* 牦 */,
0x9AD6 /* 氈 */, 0xD5B1 /* 毡 */,
0x9ADA /* 氌 */, 0xEBAA /* 氇 */,
0x9AE2 /* 氣 */, 0xC6F8 /* 气 */,
0x9AE4 /* 氫 */, 0xC7E2 /* 氢 */,
0x9AE5 /* 氬 */, 0xEBB2 /* 氩 */,
0x9AE8 /* 氳 */, 0xEBB5 /* 氲 */,
0x9AEF /* 氾 */, 0xB7BA /* 泛 */,
0x9AF7 /* 汍 */, 0xCDE8 /* 丸 */,
0x9AF8 /* 汎 */, 0xB7BA /* 泛 */,
0x9B40 /* 汙 */, 0xCEDB /* 污 */,
0x9B51 /* 決 */, 0xBEF6 /* 决 */,
0x9B5A /* 沍 */, 0xD9FC /* 冱 */,
0x9B5D /* 沒 */, 0xC3BB /* 没 */,
0x9B5F /* 沖 */, 0xB3E5 /* 冲 */,
0x9B72 /* 況 */, 0xBFF6 /* 况 */,
0x9B83 /* 泝 */, 0xCBDD /* 溯 */,
0x9BAA /* 洩 */, 0xD0B9 /* 泄 */,
0x9BB0 /* 洶 */, 0xD0DA /* 汹 */,
0x9BC9 /* 浬 */, 0xC0EF /* 里 */,
0x9BD1 /* 浹 */, 0xE4A4 /* 浃 */,
0x9BDC /* 涇 */, 0xE3FE /* 泾 */,
0x9BF2 /* 涷 */, 0xB6B3 /* 冻 */,
0x9BF6 /* 涼 */, 0xC1B9 /* 凉 */,
0x9C44 /* 淒 */, 0xC6E0 /* 凄 */,
0x9C49 /* 淚 */, 0xC0E1 /* 泪 */,
0x9C4A /* 淛 */, 0xD5E3 /* 浙 */,
0x9C4F /* 淥 */, 0xE4CB /* 渌 */,
0x9C51 /* 淨 */, 0xBEBB /* 净 */,
0x9C52 /* 淩 */, 0xC1E8 /* 凌 */,
0x9C53 /* 淪 */, 0xC2D9 /* 沦 */,
0x9C59 /* 淵 */, 0xD4A8 /* 渊 */,
0x9C5A /* 淶 */, 0xE4B5 /* 涞 */,
0x9C5C /* 淺 */, 0xC7B3 /* 浅 */,
0x9C6F /* 渙 */, 0xBBC1 /* 涣 */,
0x9C70 /* 減 */, 0xBCF5 /* 减 */,
0x9C75 /* 渦 */, 0xCED0 /* 涡 */,
0x9C79 /* 測 */, 0xB2E2 /* 测 */,
0x9C86 /* 渾 */, 0xBBEB /* 浑 */,
0x9C90 /* 湊 */, 0xB4D5 /* 凑 */,
0x9C9D /* 湞 */, 0xE4A5 /* 浈 */,
0x9CA5 /* 湧 */, 0xD3BF /* 涌 */,
0x9CAB /* 湯 */, 0xCCC0 /* 汤 */,
0x9CBF /* 溈 */, 0xE3ED /* 沩 */,
0x9CCA /* 準 */, 0xD7BC /* 准 */,
0x9CCF /* 溝 */, 0xB9B5 /* 沟 */,
0x9CD8 /* 溫 */, 0xCEC2 /* 温 */,
0x9CE1 /* 溼 */, 0xCAAA /* 湿 */,
0x9CE6 /* 滄 */, 0xB2D7 /* 沧 */,
0x9CE7 /* 滅 */, 0xC3F0 /* 灭 */,
0x9CEC /* 滌 */, 0xB5D3 /* 涤 */,
0x9CEE /* 滎 */, 0xDCFE /* 荥 */,
0x9CFB /* 滬 */, 0xBBA6 /* 沪 */,
0x9CFE /* 滯 */, 0xD6CD /* 滞 */,
0x9D42 /* 滲 */, 0xC9F8 /* 渗 */,
0x9D46 /* 滷 */, 0xC2B1 /* 卤 */,
0x9D47 /* 滸 */, 0xE4B0 /* 浒 */,
0x9D4C /* 滾 */, 0xB9F6 /* 滚 */,
0x9D4D /* 滿 */, 0xC2FA /* 满 */,
0x9D4F /* 漁 */, 0xD3E6 /* 渔 */,
0x9D61 /* 漚 */, 0xC5BD /* 沤 */,
0x9D68 /* 漢 */, 0xBABA /* 汉 */,
0x9D69 /* 漣 */, 0xC1B0 /* 涟 */,
0x9D6A /* 漥 */, 0xCDDD /* 洼 */,
0x9D6E /* 漬 */, 0xD7D5 /* 渍 */,
0x9D71 /* 漲 */, 0xD5C7 /* 涨 */,
0x9D75 /* 漸 */, 0xBDA5 /* 渐 */,
0x9D7B /* 漿 */, 0xBDAC /* 浆 */,
0x9D7D /* 潁 */, 0xF2A3 /* 颍 */,
0x9D8A /* 潑 */, 0xC6C3 /* 泼 */,
0x9D8D /* 潔 */, 0xBDE0 /* 洁 */,
0x9D93 /* 潛 */, 0xC7B1 /* 潜 */,
0x9D95 /* 潟 */, 0xD0BA /* 泻 */,
0x9D99 /* 潤 */, 0xC8F3 /* 润 */,
0x9DA1 /* 潯 */, 0xE4B1 /* 浔 */,
0x9DA2 /* 潰 */, 0xC0A3 /* 溃 */,
0x9DA7 /* 潷 */, 0xE4E4 /* 滗 */,
0x9DAC /* 潿 */, 0xE4B6 /* 涠 */,
0x9DAD /* 澀 */, 0xC9AC /* 涩 */,
0x9DB2 /* 澆 */, 0xBDBD /* 浇 */,
0x9DB3 /* 澇 */, 0xC0D4 /* 涝 */,
0x9DBE /* 澗 */, 0xBDA7 /* 涧 */,
0x9DC6 /* 澠 */, 0xE4C5 /* 渑 */,
0x9DC8 /* 澣 */, 0xE4BD /* 浣 */,
0x9DC9 /* 澤 */, 0xD4F3 /* 泽 */,
0x9DCD /* 澩 */, 0xEDB4 /* 泶 */,
0x9DD2 /* 澮 */, 0xE4AB /* 浍 */,
0x9DD5 /* 澱 */, 0xB5ED /* 淀 */,
0x9DE1 /* 濁 */, 0xD7C7 /* 浊 */,
0x9DE2 /* 濃 */, 0xC5A8 /* 浓 */,
0x9DE6 /* 濇 */, 0xC9AC /* 涩 */,
0x9DF1 /* 濕 */, 0xCAAA /* 湿 */,
0x9DF4 /* 濘 */, 0xC5A2 /* 泞 */,
0x9DF7 /* 濛 */, 0xC3C9 /* 蒙 */,
0x9DFA /* 濟 */, 0xBCC3 /* 济 */,
0x9DFD /* 濤 */, 0xCCCE /* 涛 */,
0x9E45 /* 濫 */, 0xC0C4 /* 滥 */,
0x9E46 /* 濬 */, 0xBFA3 /* 浚 */,
0x9E48 /* 濰 */, 0xCEAB /* 潍 */,
0x9E49 /* 濱 */, 0xB1F5 /* 滨 */,
0x9E52 /* 濺 */, 0xBDA6 /* 溅 */,
0x9E54 /* 濼 */, 0xE3F8 /* 泺 */,
0x9E56 /* 濾 */, 0xC2CB /* 滤 */,
0x9E5D /* 瀅 */, 0xE4DE /* 滢 */,
0x9E5E /* 瀆 */, 0xE4C2 /* 渎 */,
0x9E61 /* 瀉 */, 0xD0BA /* 泻 */,
0x9E63 /* 瀋 */, 0xC9F2 /* 沈 */,
0x9E67 /* 瀏 */, 0xE4AF /* 浏 */,
0x9E6C /* 瀕 */, 0xB1F4 /* 濒 */,
0x9E6F /* 瀘 */, 0xE3F2 /* 泸 */,
0x9E72 /* 瀝 */, 0xC1A4 /* 沥 */,
0x9E74 /* 瀟 */, 0xE4EC /* 潇 */,
0x9E75 /* 瀠 */, 0xE4EB /* 潆 */,
0x9E7B /* 瀧 */, 0xE3F1 /* 泷 */,
0x9E7C /* 瀨 */, 0xE4FE /* 濑 */,
0x9E85 /* 瀰 */, 0xC3D6 /* 弥 */,
0x9E87 /* 瀲 */, 0xE4F2 /* 潋 */,
0x9E91 /* 瀾 */, 0xC0BD /* 澜 */,
0x9E96 /* 灃 */, 0xE3E3 /* 沣 */,
0x9E97 /* 灄 */, 0xE4DC /* 滠 */,
0x9EA2 /* 灑 */, 0xC8F7 /* 洒 */,
0x9EA6 /* 灕 */, 0xC0EC /* 漓 */,
0x9EA9 /* 灘 */, 0xCCB2 /* 滩 */,
0x9EAE /* 灝 */, 0xE5B0 /* 灏 */,
0x9EB0 /* 灠 */, 0xE4ED /* 漤 */,
0x9EB3 /* 灣 */, 0xCDE5 /* 湾 */,
0x9EB4 /* 灤 */, 0xC2D0 /* 滦 */,
0x9EB8 /* 灨 */, 0xB8D3 /* 赣 */,
0x9EB9 /* 灩 */, 0xD1DE /* 艳 */,
0x9EC4 /* 災 */, 0xD4D6 /* 灾 */,
0x9EDD /* 炤 */, 0xD5D5 /* 照 */,
0x9EE9 /* 為 */, 0xCEAA /* 为 */,
0x9EF5 /* 烏 */, 0xCEDA /* 乌 */,
0x9F4E /* 烴 */, 0xCCFE /* 烃 */,
0x9F6A /* 焜 */, 0xC0A5 /* 昆 */,
0x9F6E /* 焠 */, 0xB4E3 /* 淬 */,
0x9F6F /* 無 */, 0xCEDE /* 无 */,
0x9F90 /* 煇 */, 0xBBD4 /* 辉 */,
0x9F92 /* 煉 */, 0xC1B6 /* 炼 */,
0x9F98 /* 煒 */, 0xECBF /* 炜 */,
0x9F9C /* 煖 */, 0xC5AF /* 暖 */,
0x9F9F /* 煙 */, 0xD1CC /* 烟 */,
0x9FA4 /* 煠 */, 0xD5A8 /* 炸 */,
0x9FA6 /* 煢 */, 0xDCE4 /* 茕 */,
0x9FA8 /* 煥 */, 0xBBC0 /* 焕 */,
0x9FA9 /* 煩 */, 0xB7B3 /* 烦 */,
0x9FAC /* 煬 */, 0xECBE /* 炀 */,
0x9FC9 /* 熒 */, 0xD3AB /* 荧 */,
0x9FCD /* 熗 */, 0xECC1 /* 炝 */,
0x9FE1 /* 熱 */, 0xC8C8 /* 热 */,
0x9FEB /* 熾 */, 0xB3E3 /* 炽 */,
0x9FEE /* 燁 */, 0xECC7 /* 烨 */,
0x9FF0 /* 燄 */, 0xD1E6 /* 焰 */,
0x9FF4 /* 燈 */, 0xB5C6 /* 灯 */,
0x9FF5 /* 燉 */, 0xECC0 /* 炖 */,
0x9FFB /* 燐 */, 0xC1D7 /* 磷 */,
0x9FFD /* 燒 */, 0xC9D5 /* 烧 */,
0xA043 /* 燙 */, 0xCCCC /* 烫 */,
0xA046 /* 燜 */, 0xECCB /* 焖 */,
0xA049 /* 營 */, 0xD3AA /* 营 */,
0xA04E /* 燦 */, 0xB2D3 /* 灿 */,
0xA053 /* 燬 */, 0xBBD9 /* 毁 */,
0xA054 /* 燭 */, 0xD6F2 /* 烛 */,
0xA05A /* 燴 */, 0xBBE2 /* 烩 */,
0xA060 /* 燻 */, 0xD1AC /* 熏 */,
0xA061 /* 燼 */, 0xBDFD /* 烬 */,
0xA063 /* 燾 */, 0xECE2 /* 焘 */,
0xA071 /* 爍 */, 0xCBB8 /* 烁 */,
0xA074 /* 爐 */, 0xC2AF /* 炉 */,
0xA080 /* 爛 */, 0xC0C3 /* 烂 */,
0xA08E /* 爭 */, 0xD5F9 /* 争 */,
0xA094 /* 爺 */, 0xD2AF /* 爷 */,
0xA096 /* 爾 */, 0xB6FB /* 尔 */,
0xA09D /* 牆 */, 0xC7BD /* 墙 */,
0xA0A9 /* 牘 */, 0xEBB9 /* 牍 */,
0xA0AD /* 牠 */, 0xCBFC /* 它 */,
0xA0B9 /* 牴 */, 0xB5D6 /* 抵 */,
0xA0BF /* 牽 */, 0xC7A3 /* 牵 */,
0xA0CE /* 犖 */, 0xDCFD /* 荦 */,
0xA0D3 /* 犛 */, 0xC0E7 /* 犁 */,
0xA0D9 /* 犢 */, 0xB6BF /* 犊 */,
0xA0DE /* 犧 */, 0xCEFE /* 牺 */,
0xA0EE /* 狀 */, 0xD7B4 /* 状 */,
0xAA4D /* 狹 */, 0xCFC1 /* 狭 */,
0xAA4E /* 狽 */, 0xB1B7 /* 狈 */,
0xAA62 /* 猙 */, 0xD5F8 /* 狰 */,
0xAA71 /* 猶 */, 0xD3CC /* 犹 */,
0xAA72 /* 猺 */, 0xD1FE /* 瑶 */,
0xAA73 /* 猻 */, 0xE1F8 /* 狲 */,
0xAA79 /* 獃 */, 0xB4F4 /* 呆 */,
0xAA7A /* 獄 */, 0xD3FC /* 狱 */,
0xAA7B /* 獅 */, 0xCAA8 /* 狮 */,
0xAA84 /* 獎 */, 0xBDB1 /* 奖 */,
0xAA9A /* 獨 */, 0xB6C0 /* 独 */,
0xAA9C /* 獪 */, 0xE1F6 /* 狯 */,
0xAA9D /* 獫 */, 0xE1FD /* 猃 */,
0xAA9E /* 獮 */, 0xE2A8 /* 猕 */,
0xAA9F /* 獰 */, 0xC4FC /* 狞 */,
0xAB40 /* 獲 */, 0xBBF1 /* 获 */,
0xAB43 /* 獵 */, 0xC1D4 /* 猎 */,
0xAB45 /* 獷 */, 0xE1EE /* 犷 */,
0xAB46 /* 獸 */, 0xCADE /* 兽 */,
0xAB48 /* 獺 */, 0xCCA1 /* 獭 */,
0xAB49 /* 獻 */, 0xCFD7 /* 献 */,
0xAB4A /* 獼 */, 0xE2A8 /* 猕 */,
0xAB4D /* 玀 */, 0xE2A4 /* 猡 */,
0xAB51 /* 玅 */, 0xC3EE /* 妙 */,
0xAB52 /* 玆 */, 0xD7C8 /* 兹 */,
0xAB65 /* 玡 */, 0xE7F0 /* 琊 */,
0xAB6B /* 玨 */, 0xE7E5 /* 珏 */,
0xAB98 /* 珮 */, 0xC5E5 /* 佩 */,
0xAC46 /* 現 */, 0xCFD6 /* 现 */,
0xAC50 /* 琍 */, 0xC1A7 /* 璃 */,
0xAC57 /* 琖 */, 0xD5B5 /* 盏 */,
0xAC68 /* 琱 */, 0xB5F1 /* 雕 */,
0xAC6D /* 琺 */, 0xB7A9 /* 珐 */,
0xAC71 /* 琿 */, 0xE7F5 /* 珲 */,
0xAC7C /* 瑋 */, 0xE7E2 /* 玮 */,
0xAC8D /* 瑣 */, 0xCBF6 /* 琐 */,
0xAC8E /* 瑤 */, 0xD1FE /* 瑶 */,
0xAC93 /* 瑩 */, 0xD3A8 /* 莹 */,
0xAC94 /* 瑪 */, 0xC2EA /* 玛 */,
0xAC98 /* 瑯 */, 0xC0C5 /* 琅 */,
0xAD49 /* 璉 */, 0xE7F6 /* 琏 */,
0xAD5E /* 璣 */, 0xE7E1 /* 玑 */,
0xAD61 /* 璦 */, 0xE8A8 /* 瑷 */,
0xAD68 /* 環 */, 0xBBB7 /* 环 */,
0xAD74 /* 璽 */, 0xE7F4 /* 玺 */,
0xAD76 /* 璿 */, 0xE8AF /* 璇 */,
0xAD82 /* 瓊 */, 0xC7ED /* 琼 */,
0xAD87 /* 瓏 */, 0xE7E7 /* 珑 */,
0xAD8B /* 瓔 */, 0xE8AC /* 璎 */,
0xAD8D /* 瓖 */, 0xCFE2 /* 镶 */,
0xAD91 /* 瓚 */, 0xE8B6 /* 瓒 */,
0xAE54 /* 甌 */, 0xEAB1 /* 瓯 */,
0xAE59 /* 甕 */, 0xCECD /* 瓮 */,
0xAE61 /* 產 */, 0xB2FA /* 产 */,
0xAE64 /* 甦 */, 0xCBD5 /* 苏 */,
0xAE6C /* 甽 */, 0xDBDA /* 圳 */,
0xAE80 /* 畝 */, 0xC4B6 /* 亩 */,
0xAE85 /* 畢 */, 0xB1CF /* 毕 */,
0xAE8B /* 畫 */, 0xBBAD /* 画 */,
0xAE8C /* 畬 */, 0xEEB4 /* 畲 */,
0xAE90 /* 異 */, 0xD2EC /* 异 */,
0xAE94 /* 當 */, 0xB5B1 /* 当 */,
0xAEA0 /* 疇 */, 0xB3EB /* 畴 */,
0xAF42 /* 疊 */, 0xB5FE /* 叠 */,
0xAF49 /* 疘 */, 0xB8D8 /* 肛 */,
0xAF58 /* 疿 */, 0xF0F2 /* 痱 */,
0xAF5D /* 痌 */, 0xB6B2 /* 恫 */,
0xAF64 /* 痙 */, 0xBEB7 /* 痉 */,
0xAF69 /* 痠 */, 0xCBE1 /* 酸 */,
0xAF71 /* 痲 */, 0xC2E9 /* 麻 */,
0xAF72 /* 痳 */, 0xC2E9 /* 麻 */,
0xAF77 /* 痺 */, 0xB1D4 /* 痹 */,
0xAF80 /* 瘈 */, 0xF1A1 /* 瘛 */,
0xAF81 /* 瘉 */, 0xD3FA /* 愈 */,
0xAF82 /* 瘋 */, 0xB7E8 /* 疯 */,
0xAF83 /* 瘍 */, 0xD1F1 /* 疡 */,
0xAF88 /* 瘓 */, 0xBBBE /* 痪 */,
0xAF8A /* 瘖 */, 0xE0B3 /* 喑 */,
0xAF8E /* 瘞 */, 0xF0F9 /* 瘗 */,
0xAF8F /* 瘡 */, 0xB4AF /* 疮 */,
0xAF91 /* 瘧 */, 0xC5B1 /* 疟 */,
0xAF9B /* 瘺 */, 0xF0FC /* 瘘 */,
0xAF9F /* 療 */, 0xC1C6 /* 疗 */,
0xB041 /* 癆 */, 0xF0EC /* 痨 */,
0xB042 /* 癇 */, 0xF0EF /* 痫 */,
0xB043 /* 癈 */, 0xB7CF /* 废 */,
0xB044 /* 癉 */, 0xF0F7 /* 瘅 */,
0xB04B /* 癒 */, 0xD3FA /* 愈 */,
0xB04F /* 癘 */, 0xF0DD /* 疠 */,
0xB054 /* 癟 */, 0xB1F1 /* 瘪 */,
0xB056 /* 癡 */, 0xB3D5 /* 痴 */,
0xB057 /* 癢 */, 0xD1F7 /* 痒 */,
0xB058 /* 癤 */, 0xF0DC /* 疖 */,
0xB059 /* 癥 */, 0xD6A2 /* 症 */,
0xB05D /* 癩 */, 0xF1AE /* 癞 */,
0xB05F /* 癬 */, 0xD1A2 /* 癣 */,
0xB060 /* 癭 */, 0xF1A8 /* 瘿 */,
0xB061 /* 癮 */, 0xF1AB /* 瘾 */,
0xB062 /* 癰 */, 0xD3B8 /* 痈 */,
0xB063 /* 癱 */, 0xCCB1 /* 瘫 */,
0xB064 /* 癲 */, 0xF1B2 /* 癫 */,
0xB06C /* 發 */, 0xB7A2 /* 发 */,
0xB06F /* 皁 */, 0xD4ED /* 皂 */,
0xB07D /* 皚 */, 0xB0A8 /* 皑 */,
0xB080 /* 皜 */, 0xF0A9 /* 皓 */,
0xB092 /* 皰 */, 0xF0E5 /* 疱 */,
0xB097 /* 皸 */, 0xF1E4 /* 皲 */,
0xB099 /* 皺 */, 0xD6E5 /* 皱 */,
0xB0A0 /* 盃 */, 0xB1AD /* 杯 */,
0xB149 /* 盜 */, 0xB5C1 /* 盗 */,
0xB14B /* 盞 */, 0xD5B5 /* 盏 */,
0xB14D /* 盡 */, 0xBEA1 /* 尽 */,
0xB14F /* 監 */, 0xBCE0 /* 监 */,
0xB150 /* 盤 */, 0xC5CC /* 盘 */,
0xB152 /* 盧 */, 0xC2AC /* 卢 */,
0xB155 /* 盪 */, 0xB5B4 /* 荡 */,
0xB17B /* 眥 */, 0xEDF6 /* 眦 */,
0xB18A /* 眾 */, 0xD6DA /* 众 */,
0xB197 /* 睏 */, 0xC0A7 /* 困 */,
0xB1A0 /* 睜 */, 0xD5F6 /* 睁 */,
0xB241 /* 睞 */, 0xEDF9 /* 睐 */,
0xB243 /* 睠 */, 0xBEEC /* 眷 */,
0xB247 /* 睪 */, 0xD8BA /* 睾 */,
0xB25B /* 瞇 */, 0xC3D0 /* 眯 */,
0xB25F /* 瞋 */, 0xEEAA /* 瞠 */,
0xB26D /* 瞞 */, 0xC2F7 /* 瞒 */,
0xB274 /* 瞭 */, 0xC1CB /* 了 */,
0xB280 /* 瞼 */, 0xEDFA /* 睑 */,
0xB289 /* 矇 */, 0xC3C9 /* 蒙 */,
0xB294 /* 矓 */, 0xEBCA /* 胧 */,
0xB299 /* 矙 */, 0xEEAB /* 瞰 */,
0xB29A /* 矚 */, 0xD6F5 /* 瞩 */,
0xB343 /* 矯 */, 0xBDC3 /* 矫 */,
0xB368 /* 砲 */, 0xC5DA /* 炮 */,
0xB370 /* 硃 */, 0xD6EC /* 朱 */,
0xB388 /* 硤 */, 0xEDCC /* 硖 */,
0xB38C /* 硨 */, 0xEDBA /* 砗 */,
0xB38E /* 硯 */, 0xD1E2 /* 砚 */,
0xB454 /* 碩 */, 0xCBB6 /* 硕 */,
0xB455 /* 碪 */, 0xD5E8 /* 砧 */,
0xB458 /* 碭 */, 0xEDB8 /* 砀 */,
0xB45F /* 確 */, 0xC8B7 /* 确 */,
0xB460 /* 碻 */, 0xC8B7 /* 确 */,
0xB461 /* 碼 */, 0xC2EB /* 码 */,
0xB475 /* 磚 */, 0xD7A9 /* 砖 */,
0xB47E /* 磣 */, 0xEDD7 /* 碜 */,
0xB483 /* 磧 */, 0xEDD3 /* 碛 */,
0xB489 /* 磯 */, 0xEDB6 /* 矶 */,
0xB493 /* 磽 */, 0xEDCD /* 硗 */,
0xB541 /* 礎 */, 0xB4A1 /* 础 */,
0xB54B /* 礙 */, 0xB0AD /* 碍 */,
0xB556 /* 礦 */, 0xBFF3 /* 矿 */,
0xB559 /* 礩 */, 0xF5D9 /* 踬 */,
0xB55A /* 礪 */, 0xEDC2 /* 砺 */,
0xB55B /* 礫 */, 0xC0F9 /* 砾 */,
0xB55C /* 礬 */, 0xB7AF /* 矾 */,
0xB561 /* 礱 */, 0xEDC3 /* 砻 */,
0xB56B /* 祂 */, 0xCBFB /* 他 */,
0xB56E /* 祅 */, 0xECEC /* 祆 */,
0xB56F /* 祇 */, 0xD6BB /* 只 */,
0xB576 /* 祐 */, 0xD3D3 /* 佑 */,
0xB57A /* 祕 */, 0xC3D8 /* 秘 */,
0xB593 /* 祿 */, 0xC2BB /* 禄 */,
0xB59C /* 禍 */, 0xBBF6 /* 祸 */,
0xB59D /* 禎 */, 0xECF5 /* 祯 */,
0xB652 /* 禦 */, 0xD3F9 /* 御 */,
0xB655 /* 禪 */, 0xECF8 /* 禅 */,
0xB659 /* 禮 */, 0xC0F1 /* 礼 */,
0xB65B /* 禰 */, 0xECF2 /* 祢 */,
0xB65C /* 禱 */, 0xB5BB /* 祷 */,
0xB664 /* 禿 */, 0xCDBA /* 秃 */,
0xB669 /* 秈 */, 0xF4CC /* 籼 */,
0xB690 /* 稅 */, 0xCBB0 /* 税 */,
0xB692 /* 稈 */, 0xB8D1 /* 秆 */,
0xB6A0 /* 稜 */, 0xC0E2 /* 棱 */,
0xB741 /* 稟 */, 0xD9F7 /* 禀 */,
0xB74E /* 種 */, 0xD6D6 /* 种 */,
0xB751 /* 稱 */, 0xB3C6 /* 称 */,
0xB759 /* 穀 */, 0xB9C8 /* 谷 */,
0xB760 /* 穈 */, 0xC3D3 /* 糜 */,
0xB764 /* 穌 */, 0xF6D5 /* 稣 */,
0xB765 /* 積 */, 0xBBFD /* 积 */,
0xB766 /* 穎 */, 0xD3B1 /* 颖 */,
0xB777 /* 穡 */, 0xF0A3 /* 穑 */,
0xB778 /* 穢 */, 0xBBE0 /* 秽 */,
0xB77E /* 穨 */, 0xCDC7 /* 颓 */,
0xB780 /* 穩 */, 0xCEC8 /* 稳 */,
0xB782 /* 穫 */, 0xBBF1 /* 获 */,
0xB784 /* 穭 */, 0xEFF9 /* 稆 */,
0xB78A /* 穵 */, 0xCDDA /* 挖 */,
0xB798 /* 窐 */, 0xCDDD /* 洼 */,
0xB843 /* 窩 */, 0xCED1 /* 窝 */,
0xB844 /* 窪 */, 0xCDDD /* 洼 */,
0xB846 /* 窮 */, 0xC7EE /* 穷 */,
0xB847 /* 窯 */, 0xD2A4 /* 窑 */,
0xB84D /* 窶 */, 0xF1C0 /* 窭 */,
0xB851 /* 窺 */, 0xBFFA /* 窥 */,
0xB85A /* 竄 */, 0xB4DC /* 窜 */,
0xB85B /* 竅 */, 0xC7CF /* 窍 */,
0xB85D /* 竇 */, 0xF1BC /* 窦 */,
0xB860 /* 竊 */, 0xC7D4 /* 窃 */,
0xB882 /* 競 */, 0xBEBA /* 竞 */,
0xB948 /* 笻 */, 0xF3CC /* 筇 */,
0xB950 /* 筆 */, 0xB1CA /* 笔 */,
0xB953 /* 筍 */, 0xCBF1 /* 笋 */,
0xB960 /* 筦 */, 0xB9DC /* 管 */,
0xB961 /* 筧 */, 0xF3C8 /* 笕 */,
0xB963 /* 筩 */, 0xCDB2 /* 筒 */,
0xB969 /* 筰 */, 0xF3D0 /* 笮 */,
0xB96B /* 筴 */, 0xB2DF /* 策 */,
0xB975 /* 箄 */, 0xF3EB /* 箅 */,
0xB977 /* 箇 */, 0xB8F6 /* 个 */,
0xB97B /* 箋 */, 0xBCE3 /* 笺 */,
0xB97D /* 箎 */, 0xF3F8 /* 篪 */,
0xB97E /* 箏 */, 0xF3DD /* 筝 */,
0xB98A /* 箠 */, 0xE9A2 /* 棰 */,
0xB99D /* 節 */, 0xBDDA /* 节 */,
0xB9A0 /* 範 */, 0xB7B6 /* 范 */,
0xBA42 /* 築 */, 0xD6FE /* 筑 */,
0xBA44 /* 篋 */, 0xF3E6 /* 箧 */,
0xBA4F /* 篛 */, 0xF3E8 /* 箬 */,
0xBA53 /* 篠 */, 0xF3E3 /* 筱 */,
0xBA56 /* 篤 */, 0xF3C6 /* 笃 */,
0xBA59 /* 篩 */, 0xC9B8 /* 筛 */,
0xBA5F /* 篲 */, 0xE5E7 /* 彗 */,
0xBA60 /* 篳 */, 0xF3D9 /* 筚 */,
0xBA6A /* 簀 */, 0xF3E5 /* 箦 */,
0xBA70 /* 簆 */, 0xBFDC /* 寇 */,
0xBA74 /* 簍 */, 0xC2A8 /* 篓 */,
0xBA77 /* 簑 */, 0xCBF2 /* 蓑 */,
0xBA84 /* 簞 */, 0xF3EC /* 箪 */,
0xBA86 /* 簡 */, 0xBCF2 /* 简 */,
0xBA88 /* 簣 */, 0xF3F1 /* 篑 */,
0xBA8D /* 簫 */, 0xF3EF /* 箫 */,
0xBA99 /* 簷 */, 0xE9DC /* 檐 */,
0xBA9E /* 簽 */, 0xC7A9 /* 签 */,
0xBA9F /* 簾 */, 0xC1B1 /* 帘 */,
0xBB40 /* 籃 */, 0xC0BA /* 篮 */,
0xBB49 /* 籌 */, 0xB3EF /* 筹 */,
0xBB4C /* 籐 */, 0xCCD9 /* 藤 */,
0xBB58 /* 籜 */, 0xF3EA /* 箨 */,
0xBB5B /* 籟 */, 0xF4A5 /* 籁 */,
0xBB5C /* 籠 */, 0xC1FD /* 笼 */,
0xBB60 /* 籤 */, 0xC7A9 /* 签 */,
0xBB61 /* 籥 */, 0xD9DF /* 龠 */,
0xBB65 /* 籩 */, 0xF3D6 /* 笾 */,
0xBB66 /* 籪 */, 0xF3FD /* 簖 */,
0xBB68 /* 籬 */, 0xC0E9 /* 篱 */,
0xBB6A /* 籮 */, 0xC2E1 /* 箩 */,
0xBB6E /* 籲 */, 0xD3F5 /* 吁 */,
0xBB72 /* 籸 */, 0xF4D6 /* 糁 */,
0xBB7B /* 粄 */, 0xB0E5 /* 板 */,
0xBB9B /* 粵 */, 0xD4C1 /* 粤 */,
0xBB9F /* 粺 */, 0xB0DE /* 稗 */,
0xBC52 /* 糝 */, 0xF4D6 /* 糁 */,
0xBC53 /* 糞 */, 0xB7E0 /* 粪 */,
0xBC55 /* 糢 */, 0xE2C9 /* 馍 */,
0xBC5A /* 糧 */, 0xC1B8 /* 粮 */,
0xBC61 /* 糰 */, 0xCDC5 /* 团 */,
0xBC63 /* 糲 */, 0xF4CF /* 粝 */,
0xBC65 /* 糴 */, 0xD9E1 /* 籴 */,
0xBC67 /* 糶 */, 0xF4D0 /* 粜 */,
0xBC6D /* 糾 */, 0xBEC0 /* 纠 */,
0xBC6F /* 紀 */, 0xBCCD /* 纪 */,
0xBC71 /* 紂 */, 0xE6FB /* 纣 */,
0xBC73 /* 約 */, 0xD4BC /* 约 */,
0xBC74 /* 紅 */, 0xBAEC /* 红 */,
0xBC75 /* 紆 */, 0xE6FA /* 纡 */,
0xBC76 /* 紇 */, 0xE6FC /* 纥 */,
0xBC77 /* 紈 */, 0xE6FD /* 纨 */,
0xBC78 /* 紉 */, 0xC8D2 /* 纫 */,
0xBC79 /* 紋 */, 0xCEC6 /* 纹 */,
0xBC7B /* 納 */, 0xC4C9 /* 纳 */,
0xBC7E /* 紐 */, 0xC5A6 /* 纽 */,
0xBC82 /* 紓 */, 0xE7A3 /* 纾 */,
0xBC83 /* 純 */, 0xB4BF /* 纯 */,
0xBC84 /* 紕 */, 0xE7A2 /* 纰 */,
0xBC86 /* 紗 */, 0xC9B4 /* 纱 */,
0xBC88 /* 紙 */, 0xD6BD /* 纸 */,
0xBC89 /* 級 */, 0xBCB6 /* 级 */,
0xBC8A /* 紛 */, 0xB7D7 /* 纷 */,
0xBC8B /* 紜 */, 0xE7A1 /* 纭 */,
0xBC8F /* 紡 */, 0xB7C4 /* 纺 */,
0xBC99 /* 紮 */, 0xD4FA /* 扎 */,
0xBC9A /* 細 */, 0xCFB8 /* 细 */,
0xBC9B /* 紱 */, 0xE7A6 /* 绂 */,
0xBC9C /* 紲 */, 0xE7A5 /* 绁 */,
0xBC9D /* 紳 */, 0xC9F0 /* 绅 */,
0xBD42 /* 紹 */, 0xC9DC /* 绍 */,
0xBD43 /* 紺 */, 0xE7A4 /* 绀 */,
0xBD45 /* 紼 */, 0xE7A8 /* 绋 */,
0xBD48 /* 紿 */, 0xE7AA /* 绐 */,
0xBD49 /* 絀 */, 0xE7A9 /* 绌 */,
0xBD4B /* 終 */, 0xD6D5 /* 终 */,
0xBD4C /* 絃 */, 0xCFD2 /* 弦 */,
0xBD4D /* 組 */, 0xD7E9 /* 组 */,
0xBD4F /* 絆 */, 0xB0ED /* 绊 */,
0xBD57 /* 絎 */, 0xE7AC /* 绗 */,
0xBD58 /* 絏 */, 0xE7A5 /* 绁 */,
0xBD59 /* 結 */, 0xBDE1 /* 结 */,
0xBD5E /* 絕 */, 0xBEF8 /* 绝 */,
0xBD64 /* 絛 */, 0xCCD0 /* 绦 */,
0xBD65 /* 絜 */, 0xBDE0 /* 洁 */,
0xBD67 /* 絞 */, 0xBDCA /* 绞 */,
0xBD6A /* 絡 */, 0xC2E7 /* 络 */,
0xBD6B /* 絢 */, 0xD1A4 /* 绚 */,
0xBD6F /* 給 */, 0xB8F8 /* 给 */,
0xBD71 /* 絨 */, 0xC8DE /* 绒 */,
0xBD78 /* 絰 */, 0xD6C2 /* 致 */,
0xBD79 /* 統 */, 0xCDB3 /* 统 */,
0xBD7A /* 絲 */, 0xCBBF /* 丝 */,
0xBD7B /* 絳 */, 0xE7AD /* 绛 */,
0xBD81 /* 絹 */, 0xBEEE /* 绢 */,
0xBD89 /* 綁 */, 0xB0F3 /* 绑 */,
0xBD8B /* 綃 */, 0xE7AF /* 绡 */,
0xBD8E /* 綆 */, 0xE7AE /* 绠 */,
0xBD90 /* 綈 */, 0xE7B0 /* 绨 */,
0xBD97 /* 綏 */, 0xCBE7 /* 绥 */,
0xBD99 /* 綑 */, 0xC0A6 /* 捆 */,
0xBD9B /* 經 */, 0xBEAD /* 经 */,
0xBE43 /* 綜 */, 0xD7DB /* 综 */,
0xBE45 /* 綞 */, 0xE7B6 /* 缍 */,
0xBE47 /* 綠 */, 0xC2CC /* 绿 */,
0xBE49 /* 綢 */, 0xB3F1 /* 绸 */,
0xBE4A /* 綣 */, 0xE7B9 /* 绻 */,
0xBE52 /* 綬 */, 0xE7B7 /* 绶 */,
0xBE53 /* 維 */, 0xCEAC /* 维 */,
0xBE55 /* 綰 */, 0xE7BA /* 绾 */,
0xBE56 /* 綱 */, 0xB8D9 /* 纲 */,
0xBE57 /* 網 */, 0xCDF8 /* 网 */,
0xBE59 /* 綴 */, 0xD7BA /* 缀 */,
0xBE5A /* 綵 */, 0xB2CA /* 彩 */,
0xBE5D /* 綸 */, 0xC2DA /* 纶 */,
0xBE5E /* 綹 */, 0xE7B8 /* 绺 */,
0xBE5F /* 綺 */, 0xE7B2 /* 绮 */,
0xBE60 /* 綻 */, 0xD5C0 /* 绽 */,
0xBE62 /* 綽 */, 0xB4C2 /* 绰 */,
0xBE63 /* 綾 */, 0xE7B1 /* 绫 */,
0xBE64 /* 綿 */, 0xC3E0 /* 绵 */,
0xBE69 /* 緄 */, 0xE7B5 /* 绲 */,
0xBE6C /* 緇 */, 0xE7BB /* 缁 */,
0xBE6F /* 緊 */, 0xBDF4 /* 紧 */,
0xBE70 /* 緋 */, 0xE7B3 /* 绯 */,
0xBE77 /* 緒 */, 0xD0F7 /* 绪 */,
0xBE7C /* 緗 */, 0xE7BD /* 缃 */,
0xBE7D /* 緘 */, 0xBCEA /* 缄 */,
0xBE7E /* 緙 */, 0xE7BC /* 缂 */,
0xBE80 /* 線 */, 0xCFDF /* 线 */,
0xBE83 /* 緝 */, 0xBCA9 /* 缉 */,
0xBE84 /* 緞 */, 0xB6D0 /* 缎 */,
0xBE86 /* 締 */, 0xB5DE /* 缔 */,
0xBE87 /* 緡 */, 0xE7C5 /* 缗 */,
0xBE89 /* 緣 */, 0xD4B5 /* 缘 */,
0xBE8C /* 緦 */, 0xE7C1 /* 缌 */,
0xBE8E /* 編 */, 0xB1E0 /* 编 */,
0xBE8F /* 緩 */, 0xBBBA /* 缓 */,
0xBE92 /* 緬 */, 0xC3E5 /* 缅 */,
0xBE95 /* 緯 */, 0xCEB3 /* 纬 */,
0xBE97 /* 緱 */, 0xE7C3 /* 缑 */,
0xBE98 /* 緲 */, 0xE7BF /* 缈 */,
0xBE9A /* 練 */, 0xC1B7 /* 练 */,
0xBE9C /* 緶 */, 0xE7C2 /* 缏 */,
0xBE9F /* 緹 */, 0xE7BE /* 缇 */,
0xBF40 /* 緻 */, 0xD6C2 /* 致 */,
0xBF4D /* 縈 */, 0xDDD3 /* 萦 */,
0xBF4E /* 縉 */, 0xE7C6 /* 缙 */,
0xBF4F /* 縊 */, 0xE7CB /* 缢 */,
0xBF50 /* 縋 */, 0xE7C4 /* 缒 */,
0xBF55 /* 縐 */, 0xE7A7 /* 绉 */,
0xBF56 /* 縑 */, 0xE7CC /* 缣 */,
0xBF5F /* 縚 */, 0xCCD0 /* 绦 */,
0xBF60 /* 縛 */, 0xB8BF /* 缚 */,
0xBF62 /* 縝 */, 0xE7C7 /* 缜 */,
0xBF63 /* 縞 */, 0xE7C9 /* 缟 */,
0xBF64 /* 縟 */, 0xE7C8 /* 缛 */,
0xBF68 /* 縣 */, 0xCFD8 /* 县 */,
0xBF70 /* 縫 */, 0xB7EC /* 缝 */,
0xBF72 /* 縭 */, 0xE7CA /* 缡 */,
0xBF73 /* 縮 */, 0xCBF5 /* 缩 */,
0xBF74 /* 縯 */, 0xD1DD /* 演 */,
0xBF76 /* 縱 */, 0xD7DD /* 纵 */,
0xBF77 /* 縲 */, 0xE7D0 /* 缧 */,
0xBF78 /* 縳 */, 0xB8BF /* 缚 */,
0xBF79 /* 縴 */, 0xCFCB /* 纤 */,
0xBF7A /* 縵 */, 0xE7CF /* 缦 */,
0xBF7B /* 縶 */, 0xF4EA /* 絷 */,
0xBF7C /* 縷 */, 0xC2C6 /* 缕 */,
0xBF7E /* 縹 */, 0xE7CE /* 缥 */,
0xBF82 /* 總 */, 0xD7DC /* 总 */,
0xBF83 /* 績 */, 0xBCA8 /* 绩 */,
0xBF87 /* 繃 */, 0xB1C1 /* 绷 */,
0xBF89 /* 繅 */, 0xE7D2 /* 缫 */,
0xBF8A /* 繆 */, 0xE7D1 /* 缪 */,
0xBF8B /* 繈 */, 0xF1DF /* 襁 */,
0xBF93 /* 繐 */, 0xCBEB /* 穗 */,
0xBF95 /* 繒 */, 0xE7D5 /* 缯 */,
0xBF97 /* 織 */, 0xD6AF /* 织 */,
0xBF98 /* 繕 */, 0xC9C9 /* 缮 */,
0xBF99 /* 繖 */, 0xC9A1 /* 伞 */,
0xBF9C /* 繙 */, 0xB7AD /* 翻 */,
0xBF9D /* 繚 */, 0xE7D4 /* 缭 */,
0xC040 /* 繞 */, 0xC8C6 /* 绕 */,
0xC043 /* 繡 */, 0xD0E5 /* 绣 */,
0xC044 /* 繢 */, 0xE7C0 /* 缋 */,
0xC04B /* 繩 */, 0xC9FE /* 绳 */,
0xC04C /* 繪 */, 0xBBE6 /* 绘 */,
0xC04D /* 繫 */, 0xCFB5 /* 系 */,
0xC04F /* 繭 */, 0xBCEB /* 茧 */,
0xC051 /* 繯 */, 0xE7D9 /* 缳 */,
0xC052 /* 繰 */, 0xE7D8 /* 缲 */,
0xC055 /* 繳 */, 0xBDC9 /* 缴 */,
0xC05B /* 繹 */, 0xD2EF /* 绎 */,
0xC05E /* 繼 */, 0xBCCC /* 继 */,
0xC05F /* 繽 */, 0xE7CD /* 缤 */,
0xC060 /* 繾 */, 0xE7D7 /* 缱 */,
0xC069 /* 纈 */, 0xE7D3 /* 缬 */,
0xC06B /* 纊 */, 0xE6FE /* 纩 */,
0xC06D /* 續 */, 0xD0F8 /* 续 */,
0xC06E /* 纍 */, 0xC0DB /* 累 */,
0xC070 /* 纏 */, 0xB2F8 /* 缠 */,
0xC074 /* 纓 */, 0xD3A7 /* 缨 */,
0xC075 /* 纔 */, 0xB2C5 /* 才 */,
0xC077 /* 纖 */, 0xCFCB /* 纤 */,
0xC079 /* 纘 */, 0xE7DA /* 缵 */,
0xC07C /* 纜 */, 0xC0C2 /* 缆 */,
0xC08F /* 缽 */, 0xB2A7 /* 钵 */,
0xC097 /* 罈 */, 0xCCB3 /* 坛 */,
0xC09A /* 罋 */, 0xCECD /* 瓮 */,
0xC09B /* 罌 */, 0xF3BF /* 罂 */,
0xC09E /* 罏 */, 0xDBE4 /* 垆 */,
0xC147 /* 罣 */, 0xB9D2 /* 挂 */,
0xC150 /* 罰 */, 0xB7A3 /* 罚 */,
0xC152 /* 罵 */, 0xC2EE /* 骂 */,
0xC154 /* 罷 */, 0xB0D5 /* 罢 */,
0xC15F /* 羅 */, 0xC2DE /* 罗 */,
0xC160 /* 羆 */, 0xEEBC /* 罴 */,
0xC162 /* 羈 */, 0xEEBF /* 羁 */,
0xC164 /* 羋 */, 0xD8C2 /* 芈 */,
0xC173 /* 羢 */, 0xC8DE /* 绒 */,
0xC175 /* 羥 */, 0xF4C7 /* 羟 */,
0xC177 /* 羨 */, 0xCFDB /* 羡 */,
0xC178 /* 義 */, 0xD2E5 /* 义 */,
0xC183 /* 羶 */, 0xEBFE /* 膻 */,
0xC195 /* 習 */, 0xCFB0 /* 习 */,
0xC244 /* 翫 */, 0xCDE6 /* 玩 */,
0xC24E /* 翹 */, 0xC7CC /* 翘 */,
0xC25A /* 耑 */, 0xD7A8 /* 专 */,
0xC265 /* 耬 */, 0xF1EF /* 耧 */,
0xC27D /* 聖 */, 0xCAA5 /* 圣 */,
0xC284 /* 聞 */, 0xCEC5 /* 闻 */,
0xC293 /* 聯 */, 0xC1AA /* 联 */,
0xC294 /* 聰 */, 0xB4CF /* 聪 */,
0xC295 /* 聲 */, 0xC9F9 /* 声 */,
0xC296 /* 聳 */, 0xCBCA /* 耸 */,
0xC298 /* 聵 */, 0xF1F9 /* 聩 */,
0xC299 /* 聶 */, 0xC4F4 /* 聂 */,
0xC29A /* 職 */, 0xD6B0 /* 职 */,
0xC29C /* 聹 */, 0xF1F7 /* 聍 */,
0xC2A0 /* 聽 */, 0xCCFD /* 听 */,
0xC340 /* 聾 */, 0xC1FB /* 聋 */,
0xC343 /* 肅 */, 0xCBE0 /* 肃 */,
0xC345 /* 肊 */, 0xD2DC /* 臆 */,
0xC349 /* 肐 */, 0xB8EC /* 胳 */,
0xC37B /* 脅 */, 0xD0B2 /* 胁 */,
0xC37D /* 脈 */, 0xC2F6 /* 脉 */,
0xC384 /* 脛 */, 0xEBD6 /* 胫 */,
0xC38B /* 脣 */, 0xB4BD /* 唇 */,
0xC38F /* 脧 */, 0xEDFC /* 睃 */,
0xC391 /* 脩 */, 0xD0DE /* 修 */,
0xC393 /* 脫 */, 0xCDD1 /* 脱 */,
0xC39B /* 脹 */, 0xD5CD /* 胀 */,
0xC39C /* 脺 */, 0xD2C8 /* 胰 */,
0xC449 /* 腎 */, 0xC9F6 /* 肾 */,
0xC454 /* 腡 */, 0xEBE1 /* 脶 */,
0xC458 /* 腦 */, 0xC4D4 /* 脑 */,
0xC45B /* 腫 */, 0xD6D7 /* 肿 */,
0xC45F /* 腳 */, 0xBDC5 /* 脚 */,
0xC463 /* 腸 */, 0xB3A6 /* 肠 */,
0xC465 /* 膃 */, 0xEBF0 /* 腽 */,
0xC468 /* 膆 */, 0xE0BC /* 嗉 */,
0xC477 /* 膚 */, 0xB7F4 /* 肤 */,
0xC47A /* 膠 */, 0xBDBA /* 胶 */,
0xC481 /* 膩 */, 0xC4E5 /* 腻 */,
0xC48B /* 膵 */, 0xD2C8 /* 胰 */,
0xC491 /* 膽 */, 0xB5A8 /* 胆 */,
0xC492 /* 膾 */, 0xEBDA /* 脍 */,
0xC493 /* 膿 */, 0xC5A7 /* 脓 */,
0xC498 /* 臉 */, 0xC1B3 /* 脸 */,
0xC49A /* 臍 */, 0xC6EA /* 脐 */,
0xC49C /* 臏 */, 0xEBF7 /* 膑 */,
0xC544 /* 臘 */, 0xC0B0 /* 腊 */,
0xC546 /* 臚 */, 0xEBCD /* 胪 */,
0xC549 /* 臝 */, 0xC2E3 /* 裸 */,
0xC54B /* 臟 */, 0xD4E0 /* 脏 */,
0xC54C /* 臠 */, 0xD9F5 /* 脔 */,
0xC550 /* 臥 */, 0xCED4 /* 卧 */,
0xC552 /* 臨 */, 0xC1D9 /* 临 */,
0xC55F /* 臺 */, 0xCCA8 /* 台 */,
0xC563 /* 與 */, 0xD3EB /* 与 */,
0xC564 /* 興 */, 0xD0CB /* 兴 */,
0xC565 /* 舉 */, 0xBED9 /* 举 */,
0xC566 /* 舊 */, 0xBEC9 /* 旧 */,
0xC567 /* 舋 */, 0xD0C6 /* 衅 */,
0xC56D /* 舖 */, 0xC6CC /* 铺 */,
0xC593 /* 艙 */, 0xB2D5 /* 舱 */,
0xC59B /* 艣 */, 0xE9D6 /* 橹 */,
0xC59C /* 艤 */, 0xF4AF /* 舣 */,
0xC59E /* 艦 */, 0xBDA2 /* 舰 */,
0xC641 /* 艫 */, 0xF4B5 /* 舻 */,
0xC644 /* 艱 */, 0xBCE8 /* 艰 */,
0xC647 /* 艷 */, 0xD1DE /* 艳 */,
0xC648 /* 艸 */, 0xDCB3 /* 艹 */,
0xC653 /* 芐 */, 0xDCD0 /* 苄 */,
0xC663 /* 芻 */, 0xDBBB /* 刍 */,
0xC672 /* 苧 */, 0xDCD1 /* 苎 */,
0xC688 /* 茍 */, 0xB9B6 /* 苟 */,
0xC69D /* 茲 */, 0xD7C8 /* 兹 */,
0xC745 /* 荅 */, 0xB4F0 /* 答 */,
0xC747 /* 荊 */, 0xBEA3 /* 荆 */,
0xC74A /* 荍 */, 0xDCF1 /* 荞 */,
0xC757 /* 荳 */, 0xB6B9 /* 豆 */,
0xC766 /* 莊 */, 0xD7AF /* 庄 */,
0xC76E /* 莕 */, 0xDCF4 /* 荇 */,
0xC76F /* 莖 */, 0xBEA5 /* 茎 */,
0xC776 /* 莢 */, 0xBCD4 /* 荚 */,
0xC77B /* 莧 */, 0xDCC8 /* 苋 */,
0xC78A /* 菉 */, 0xC2CC /* 绿 */,
0xC78F /* 菑 */, 0xD4D6 /* 灾 */,
0xC841 /* 華 */, 0xBBAA /* 华 */,
0xC843 /* 菴 */, 0xE2D6 /* 庵 */,
0xC84F /* 萇 */, 0xDCC9 /* 苌 */,
0xC852 /* 萊 */, 0xC0B3 /* 莱 */,
0xC866 /* 萬 */, 0xCDF2 /* 万 */,
0xC86B /* 萲 */, 0xDDE6 /* 萱 */,
0xC86E /* 萵 */, 0xDDAB /* 莴 */,
0xC87B /* 葅 */, 0xDDCF /* 菹 */,
0xC87E /* 葉 */, 0xD2B6 /* 叶 */,
0xC887 /* 葒 */, 0xDDA6 /* 荭 */,
0xD6F8 /* 著 */, 0xD7C5 /* 着 */,
0xC890 /* 葠 */, 0xB2CE /* 参 */,
0xC894 /* 葦 */, 0xCEAD /* 苇 */,
0xC899 /* 葯 */, 0xD2A9 /* 药 */,
0xC89D /* 葷 */, 0xBBE7 /* 荤 */,
0xC94C /* 蒐 */, 0xCBD1 /* 搜 */,
0xC950 /* 蒔 */, 0xDDAA /* 莳 */,
0xC957 /* 蒞 */, 0xDDB0 /* 莅 */,
0xC960 /* 蒨 */, 0xDCE7 /* 茜 */,
0xC962 /* 蒪 */, 0xDDBB /* 莼 */,
0xC96E /* 蒼 */, 0xB2D4 /* 苍 */,
0xC970 /* 蓀 */, 0xDDA5 /* 荪 */,
0xC974 /* 蓆 */, 0xCFAF /* 席 */,
0xC977 /* 蓋 */, 0xB8C7 /* 盖 */,
0xC98F /* 蓮 */, 0xC1AB /* 莲 */,
0xC990 /* 蓯 */, 0xDCCA /* 苁 */,
0xC99C /* 蓽 */, 0xDCEA /* 荜 */,
0xCA43 /* 蔆 */, 0xC1E2 /* 菱 */,
0xCA4E /* 蔔 */, 0xB2B7 /* 卜 */,
0xCA4F /* 蔕 */, 0xB5D9 /* 蒂 */,
0xCA56 /* 蔞 */, 0xDDE4 /* 蒌 */,
0xCA59 /* 蔣 */, 0xBDAF /* 蒋 */,
0xCA5B /* 蔥 */, 0xB4D0 /* 葱 */,
0xCA5C /* 蔦 */, 0xDCE0 /* 茑 */,
0xCA61 /* 蔭 */, 0xD2F1 /* 荫 */,
0xCA6B /* 蔾 */, 0xDEBC /* 藜 */,
0xCA6E /* 蕁 */, 0xDDA1 /* 荨 */,
0xCA72 /* 蕆 */, 0xDDDB /* 蒇 */,
0xCA77 /* 蕎 */, 0xDCF1 /* 荞 */,
0xCA7C /* 蕓 */, 0xDCBF /* 芸 */,
0xCA7E /* 蕕 */, 0xDDB5 /* 莸 */,
0xCA81 /* 蕘 */, 0xDCE9 /* 荛 */,
0xCA89 /* 蕢 */, 0xDDDE /* 蒉 */,
0xCA8E /* 蕩 */, 0xB5B4 /* 荡 */,
0xCA8F /* 蕪 */, 0xCEDF /* 芜 */,
0xCA92 /* 蕭 */, 0xCFF4 /* 萧 */,
0xCA9A /* 蕷 */, 0xDDF7 /* 蓣 */,
0xCB43 /* 薈 */, 0xDCF6 /* 荟 */,
0xCB45 /* 薊 */, 0xBCBB /* 蓟 */,
0xCB47 /* 薌 */, 0xDCBC /* 芗 */,
0xCB4B /* 薑 */, 0xBDAA /* 姜 */,
0xCB4E /* 薔 */, 0xC7BE /* 蔷 */,
0xCB53 /* 薙 */, 0xCCEA /* 剃 */,
0xCB57 /* 薟 */, 0xDDB2 /* 莶 */,
0xCB5D /* 薦 */, 0xBCF6 /* 荐 */,
0xCB5E /* 薧 */, 0xE9C2 /* 槁 */,
0xCB5F /* 薩 */, 0xC8F8 /* 萨 */,
0xCB6A /* 薺 */, 0xDCF9 /* 荠 */,
0xBDE5 /* 藉 */, 0xBDE8 /* 借 */,
0xCB7B /* 藍 */, 0xC0B6 /* 蓝 */,
0xCB7C /* 藎 */, 0xDDA3 /* 荩 */,
0xCB87 /* 藝 */, 0xD2D5 /* 艺 */,
0xCB8E /* 藥 */, 0xD2A9 /* 药 */,
0xCB92 /* 藪 */, 0xDEB4 /* 薮 */,
0xCB9E /* 藶 */, 0xDCC2 /* 苈 */,
0xCB9F /* 藷 */, 0xCAED /* 薯 */,
0xCC40 /* 藹 */, 0xB0AA /* 蔼 */,
0xCC41 /* 藺 */, 0xDDFE /* 蔺 */,
0xCC49 /* 蘄 */, 0xDEAD /* 蕲 */,
0xCC4A /* 蘆 */, 0xC2AB /* 芦 */,
0xCC4B /* 蘇 */, 0xCBD5 /* 苏 */,
0xCC4E /* 蘊 */, 0xD4CC /* 蕴 */,
0xCC4F /* 蘋 */, 0xC6BB /* 苹 */,
0xCC59 /* 蘗 */, 0xDEC1 /* 蘖 */,
0xCC5C /* 蘚 */, 0xDEBA /* 藓 */,
0xCC60 /* 蘞 */, 0xDDFC /* 蔹 */,
0xCC64 /* 蘢 */, 0xDCD7 /* 茏 */,
0xCC6D /* 蘭 */, 0xC0BC /* 兰 */,
0xCC79 /* 蘺 */, 0xDDF1 /* 蓠 */,
0xCC7D /* 蘿 */, 0xC2DC /* 萝 */,
0xCC8E /* 處 */, 0xB4A6 /* 处 */,
0xCC8F /* 虖 */, 0xBAF4 /* 呼 */,
0xCC93 /* 虛 */, 0xD0E9 /* 虚 */,
0xCC94 /* 虜 */, 0xC2B2 /* 虏 */,
0xCC96 /* 號 */, 0xBAC5 /* 号 */,
0xCC9D /* 虧 */, 0xBFF7 /* 亏 */,
0xCD90 /* 蛺 */, 0xF2CC /* 蛱 */,
0xCD91 /* 蛻 */, 0xCDC9 /* 蜕 */,
0xCD98 /* 蜆 */, 0xF2B9 /* 蚬 */,
0xCE48 /* 蜨 */, 0xB5FB /* 蝶 */,
0xCE55 /* 蜺 */, 0xC4DE /* 霓 */,
0xCE67 /* 蝕 */, 0xCAB4 /* 蚀 */,
0xCE6F /* 蝟 */, 0xE2AC /* 猬 */,
0xCE72 /* 蝦 */, 0xCFBA /* 虾 */,
0xCE74 /* 蝨 */, 0xCAAD /* 虱 */,
0xCE7A /* 蝯 */, 0xD4B3 /* 猿 */,
0xCE81 /* 蝸 */, 0xCECF /* 蜗 */,
0xCE87 /* 螄 */, 0xF2CF /* 蛳 */,
0xCE9B /* 螞 */, 0xC2EC /* 蚂 */,
0xCE9E /* 螢 */, 0xD3A9 /* 萤 */,
0xCF4E /* 螻 */, 0xF2F7 /* 蝼 */,
0xCF55 /* 蟄 */, 0xD5DD /* 蛰 */,
0xCF58 /* 蟈 */, 0xF2E5 /* 蝈 */,
0xCF6C /* 蟣 */, 0xF2B1 /* 虮 */,
0xCF73 /* 蟬 */, 0xB2F5 /* 蝉 */,
0xCF75 /* 蟯 */, 0xF2CD /* 蛲 */,
0xCF78 /* 蟲 */, 0xB3E6 /* 虫 */,
0xCF7C /* 蟶 */, 0xF2C9 /* 蛏 */,
0xCF81 /* 蟻 */, 0xD2CF /* 蚁 */,
0xCF89 /* 蠅 */, 0xD3AC /* 蝇 */,
0xCF8A /* 蠆 */, 0xF2B2 /* 虿 */,
0xCF90 /* 蠍 */, 0xD0AB /* 蝎 */,
0xCF93 /* 蠐 */, 0xF2D3 /* 蛴 */,
0xCF94 /* 蠑 */, 0xF2EE /* 蝾 */,
0xCF96 /* 蠔 */, 0xF2BA /* 蚝 */,
0xCF9E /* 蠟 */, 0xC0AF /* 蜡 */,
0xCFA0 /* 蠣 */, 0xF2C3 /* 蛎 */,
0xD04D /* 蠱 */, 0xB9C6 /* 蛊 */,
0xD051 /* 蠶 */, 0xB2CF /* 蚕 */,
0xD052 /* 蠷 */, 0xF3BD /* 蠼 */,
0xD055 /* 蠻 */, 0xC2F9 /* 蛮 */,
0xD060 /* 衊 */, 0xC3EF /* 蔑 */,
0xD066 /* 衒 */, 0xECC5 /* 炫 */,
0xD067 /* 術 */, 0xCAF5 /* 术 */,
0xD068 /* 衕 */, 0xCDAC /* 同 */,
0xD069 /* 衖 */, 0xC5AA /* 弄 */,
0xD06B /* 衚 */, 0xBAFA /* 胡 */,
0xD06C /* 衛 */, 0xCEC0 /* 卫 */,
0xD06E /* 衝 */, 0xB3E5 /* 冲 */,
0xD07D /* 衹 */, 0xD6BB /* 只 */,
0xD096 /* 袞 */, 0xD9F2 /* 衮 */,
0xD155 /* 裊 */, 0xF4C1 /* 袅 */,
0xD157 /* 裌 */, 0xBCD0 /* 夹 */,
0xD161 /* 補 */, 0xB2B9 /* 补 */,
0xD162 /* 裝 */, 0xD7B0 /* 装 */,
0xD165 /* 裡 */, 0xC0EF /* 里 */,
0xD175 /* 製 */, 0xD6C6 /* 制 */,
0xD17D /* 複 */, 0xB8B4 /* 复 */,
0xD184 /* 褎 */, 0xD0E4 /* 袖 */,
0xD19D /* 褲 */, 0xBFE3 /* 裤 */,
0xD19E /* 褳 */, 0xF1CD /* 裢 */,
0xD240 /* 褸 */, 0xF1DA /* 褛 */,
0xD243 /* 褻 */, 0xD9F4 /* 亵 */,
0xD24F /* 襉 */, 0xF1D0 /* 裥 */,
0xD25C /* 襖 */, 0xB0C0 /* 袄 */,
0xD263 /* 襝 */, 0xF1CF /* 裣 */,
0xD264 /* 襠 */, 0xF1C9 /* 裆 */,
0xD266 /* 襢 */, 0xCCBB /* 袒 */,
0xD268 /* 襤 */, 0xF1DC /* 褴 */,
0xD26D /* 襪 */, 0xCDE0 /* 袜 */,
0xD26F /* 襬 */, 0xB0DA /* 摆 */,
0xD272 /* 襯 */, 0xB3C4 /* 衬 */,
0xD275 /* 襲 */, 0xCFAE /* 袭 */,
0xD287 /* 覈 */, 0xBACB /* 核 */,
0xD28A /* 見 */, 0xBCFB /* 见 */,
0xD28E /* 規 */, 0xB9E6 /* 规 */,
0xD292 /* 覓 */, 0xC3D9 /* 觅 */,
0xD295 /* 視 */, 0xCAD3 /* 视 */,
0xD297 /* 覘 */, 0xEAE8 /* 觇 */,
0xD29B /* 覜 */, 0xCCF7 /* 眺 */,
0xD2A0 /* 覡 */, 0xEAEA /* 觋 */,
0xD344 /* 覦 */, 0xEAEC /* 觎 */,
0xD348 /* 親 */, 0xC7D7 /* 亲 */,
0xD34A /* 覬 */, 0xEAE9 /* 觊 */,
0xD34D /* 覯 */, 0xEAED /* 觏 */,
0xD350 /* 覲 */, 0xEAEE /* 觐 */,
0xD355 /* 覷 */, 0xEAEF /* 觑 */,
0xD358 /* 覺 */, 0xBEF5 /* 觉 */,
0xD35B /* 覽 */, 0xC0C0 /* 览 */,
0xD35D /* 覿 */, 0xEAEB /* 觌 */,
0xD35E /* 觀 */, 0xB9DB /* 观 */,
0xD362 /* 觔 */, 0xBDEE /* 筋 */,
0xD363 /* 觕 */, 0xB4D6 /* 粗 */,
0xD378 /* 觴 */, 0xF5FC /* 觞 */,
0xD37A /* 觶 */, 0xF6A3 /* 觯 */,
0xD37C /* 觸 */, 0xB4A5 /* 触 */,
0xD386 /* 訂 */, 0xB6A9 /* 订 */,
0xD387 /* 訃 */, 0xB8BC /* 讣 */,
0xD38B /* 計 */, 0xBCC6 /* 计 */,
0xD38D /* 訊 */, 0xD1B6 /* 讯 */,
0xD38F /* 訌 */, 0xDAA7 /* 讧 */,
0xD391 /* 討 */, 0xCCD6 /* 讨 */,
0xD393 /* 訐 */, 0xDAA6 /* 讦 */,
0xD396 /* 訓 */, 0xD1B5 /* 训 */,
0xD398 /* 訕 */, 0xDAA8 /* 讪 */,
0xD399 /* 訖 */, 0xC6FD /* 讫 */,
0xD39A /* 託 */, 0xCDD0 /* 托 */,
0xD39B /* 記 */, 0xBCC7 /* 记 */,
0xD39E /* 訛 */, 0xB6EF /* 讹 */,
0xD3A0 /* 訝 */, 0xD1C8 /* 讶 */,
0xD441 /* 訟 */, 0xCBCF /* 讼 */,
0xD445 /* 訣 */, 0xBEF7 /* 诀 */,
0xD447 /* 訥 */, 0xDAAB /* 讷 */,
0xD44C /* 訪 */, 0xB7C3 /* 访 */,
0xD44F /* 設 */, 0xC9E8 /* 设 */,
0xD453 /* 許 */, 0xD0ED /* 许 */,
0xD456 /* 訴 */, 0xCBDF /* 诉 */,
0xD458 /* 訶 */, 0xDAAD /* 诃 */,
0xD45C /* 診 */, 0xD5EF /* 诊 */,
0xD45D /* 註 */, 0xD7A2 /* 注 */,
0xD45E /* 証 */, 0xD6A4 /* 证 */,
0xD462 /* 詁 */, 0xDAAC /* 诂 */,
0xD467 /* 詆 */, 0xDAAE /* 诋 */,
0xD46E /* 詎 */, 0xDAAA /* 讵 */,
0xD470 /* 詐 */, 0xD5A9 /* 诈 */,
0xD472 /* 詒 */, 0xDAB1 /* 诒 */,
0xD474 /* 詔 */, 0xDAAF /* 诏 */,
0xD475 /* 評 */, 0xC6C0 /* 评 */,
0xD478 /* 詘 */, 0xDAB0 /* 诎 */,
0xD47B /* 詛 */, 0xD7E7 /* 诅 */,
0xD47E /* 詞 */, 0xB4CA /* 词 */,
0xD481 /* 詠 */, 0xD3BD /* 咏 */,
0xD482 /* 詡 */, 0xDABC /* 诩 */,
0xD483 /* 詢 */, 0xD1AF /* 询 */,
0xD484 /* 詣 */, 0xD2E8 /* 诣 */,
0xD487 /* 試 */, 0xCAD4 /* 试 */,
0xD48A /* 詩 */, 0xCAAB /* 诗 */,
0xD48C /* 詫 */, 0xB2EF /* 诧 */,
0xD48D /* 詬 */, 0xDAB8 /* 诟 */,
0xD48E /* 詭 */, 0xB9EE /* 诡 */,
0xD48F /* 詮 */, 0xDAB9 /* 诠 */,
0xD491 /* 詰 */, 0xDAB5 /* 诘 */,
0xD492 /* 話 */, 0xBBB0 /* 话 */,
0xD493 /* 該 */, 0xB8C3 /* 该 */,
0xD494 /* 詳 */, 0xCFEA /* 详 */,
0xD496 /* 詵 */, 0xDAB7 /* 诜 */,
0xD49C /* 詼 */, 0xDAB6 /* 诙 */,
0xD49F /* 詿 */, 0xDAB4 /* 诖 */,
0xD543 /* 誄 */, 0xDAB3 /* 诔 */,
0xD544 /* 誅 */, 0xD6EF /* 诛 */,
0xD545 /* 誆 */, 0xDAB2 /* 诓 */,
0xD546 /* 誇 */, 0xBFE4 /* 夸 */,
0xD549 /* 誌 */, 0xD6BE /* 志 */,
0xD54A /* 認 */, 0xC8CF /* 认 */,
0xD54E /* 誑 */, 0xDABF /* 诳 */,
0xD54F /* 誒 */, 0xDAC0 /* 诶 */,
0xD551 /* 誕 */, 0xB5AE /* 诞 */,
0xD552 /* 誖 */, 0xE3A3 /* 悖 */,
0xD554 /* 誘 */, 0xD3D5 /* 诱 */,
0xD556 /* 誚 */, 0xDABD /* 诮 */,
0xD55A /* 語 */, 0xD3EF /* 语 */,
0xD55C /* 誠 */, 0xB3CF /* 诚 */,
0xD55D /* 誡 */, 0xBDEB /* 诫 */,
0xD55F /* 誣 */, 0xCEDC /* 诬 */,
0xD560 /* 誤 */, 0xCEF3 /* 误 */,
0xD561 /* 誥 */, 0xDABE /* 诰 */,
0xD562 /* 誦 */, 0xCBD0 /* 诵 */,
0xD564 /* 誨 */, 0xBBE5 /* 诲 */,
0xD566 /* 說 */, 0xCBB5 /* 说 */,
0xD56C /* 誰 */, 0xCBAD /* 谁 */,
0xD56E /* 課 */, 0xBFCE /* 课 */,
0xD572 /* 誶 */, 0xDAC7 /* 谇 */,
0xD575 /* 誹 */, 0xB7CC /* 诽 */,
0xD578 /* 誼 */, 0xD2EA /* 谊 */,
0xD57B /* 調 */, 0xB5F7 /* 调 */,
0xD57E /* 諂 */, 0xDAC6 /* 谄 */,
0xD581 /* 諄 */, 0xD7BB /* 谆 */,
0xD584 /* 談 */, 0xCCB8 /* 谈 */,
0xD586 /* 諉 */, 0xDAC3 /* 诿 */,
0xD588 /* 請 */, 0xC7EB /* 请 */,
0xD58A /* 諍 */, 0xDABA /* 诤 */,
0xD58C /* 諏 */, 0xDAC1 /* 诹 */,
0xD58E /* 諑 */, 0xDAC2 /* 诼 */,
0xD58F /* 諒 */, 0xC1C2 /* 谅 */,
0xD593 /* 論 */, 0xC2DB /* 论 */,
0xD594 /* 諗 */, 0xDAC5 /* 谂 */,
0xD598 /* 諛 */, 0xDAC4 /* 谀 */,
0xD599 /* 諜 */, 0xB5FD /* 谍 */,
0xD59B /* 諞 */, 0xDAD2 /* 谝 */,
0xD59D /* 諠 */, 0xD0FA /* 喧 */,
0xD59E /* 諡 */, 0xDAD6 /* 谥 */,
0xD59F /* 諢 */, 0xDABB /* 诨 */,
0xD640 /* 諤 */, 0xDACC /* 谔 */,
0xD642 /* 諦 */, 0xDAD0 /* 谛 */,
0xD643 /* 諧 */, 0xD0B3 /* 谐 */,
0xD647 /* 諫 */, 0xDAC9 /* 谏 */,
0xD649 /* 諭 */, 0xDACD /* 谕 */,
0xD64A /* 諮 */, 0xDAD1 /* 谘 */,
0xD64D /* 諱 */, 0xBBE4 /* 讳 */,
0xD64F /* 諳 */, 0xDACF /* 谙 */,
0xD652 /* 諶 */, 0xDAC8 /* 谌 */,
0xD653 /* 諷 */, 0xB7ED /* 讽 */,
0xD654 /* 諸 */, 0xD6EE /* 诸 */,
0xD656 /* 諺 */, 0xD1E8 /* 谚 */,
0xD658 /* 諼 */, 0xDACE /* 谖 */,
0xD65A /* 諾 */, 0xC5B5 /* 诺 */,
0xD65C /* 謀 */, 0xC4B1 /* 谋 */,
0xD65D /* 謁 */, 0xDACB /* 谒 */,
0xD65E /* 謂 */, 0xCEBD /* 谓 */,
0xD660 /* 謄 */, 0xCCDC /* 誊 */,
0xD661 /* 謅 */, 0xD6DF /* 诌 */,
0xD665 /* 謊 */, 0xBBD1 /* 谎 */,
0xD669 /* 謎 */, 0xC3D5 /* 谜 */,
0xD66B /* 謐 */, 0xDAD7 /* 谧 */,
0xD66F /* 謔 */, 0xDACA /* 谑 */,
0xD671 /* 謖 */, 0xDAD5 /* 谡 */,
0xD672 /* 謗 */, 0xB0F9 /* 谤 */,
0xD674 /* 謙 */, 0xC7AB /* 谦 */,
0xD675 /* 謚 */, 0xDAD6 /* 谥 */,
0xD676 /* 講 */, 0xBDB2 /* 讲 */,
0xD678 /* 謝 */, 0xD0BB /* 谢 */,
0xD67B /* 謠 */, 0xD2A5 /* 谣 */,
0xD683 /* 謨 */, 0xDAD3 /* 谟 */,
0xD686 /* 謫 */, 0xDAD8 /* 谪 */,
0xD687 /* 謬 */, 0xC3FD /* 谬 */,
0xD68E /* 謳 */, 0xDAA9 /* 讴 */,
0xD694 /* 謹 */, 0xBDF7 /* 谨 */,
0xD697 /* 謼 */, 0xBAF4 /* 呼 */,
0xD698 /* 謽 */, 0xEAF1 /* 犟 */,
0xD699 /* 謾 */, 0xC3A1 /* 谩 */,
0xD69C /* 譁 */, 0xBBA9 /* 哗 */,
0xD740 /* 譆 */, 0xCEFB /* 嘻 */,
0xD743 /* 證 */, 0xD6A4 /* 证 */,
0xD748 /* 譎 */, 0xDADC /* 谲 */,
0xD749 /* 譏 */, 0xBCA5 /* 讥 */,
0xD750 /* 譖 */, 0xDADA /* 谮 */,
0xD752 /* 識 */, 0xCAB6 /* 识 */,
0xD753 /* 譙 */, 0xDADB /* 谯 */,
0xD754 /* 譚 */, 0xCCB7 /* 谭 */,
0xD756 /* 譜 */, 0xC6D7 /* 谱 */,
0xD759 /* 譟 */, 0xD4EB /* 噪 */,
0xD764 /* 譫 */, 0xDADE /* 谵 */,
0xD765 /* 譭 */, 0xBBD9 /* 毁 */,
0xD767 /* 譯 */, 0xD2EB /* 译 */,
0xD768 /* 議 */, 0xD2E9 /* 议 */,
0xD76C /* 譴 */, 0xC7B4 /* 谴 */,
0xD76F /* 護 */, 0xBBA4 /* 护 */,
0xD775 /* 譽 */, 0xD3FE /* 誉 */,
0xD778 /* 讀 */, 0xB6C1 /* 读 */,
0xD783 /* 變 */, 0xB1E4 /* 变 */,
0xD785 /* 讌 */, 0xD1E0 /* 燕 */,
0xD787 /* 讎 */, 0xF6C5 /* 雠 */,
0xD78B /* 讒 */, 0xB2F7 /* 谗 */,
0xD78C /* 讓 */, 0xC8C3 /* 让 */,
0xD78E /* 讕 */, 0xC0BE /* 谰 */,
0xD78F /* 讖 */, 0xDADF /* 谶 */,
0xD792 /* 讙 */, 0xBBB6 /* 欢 */,
0xD793 /* 讚 */, 0xD4DE /* 赞 */,
0xD795 /* 讜 */, 0xDAD4 /* 谠 */,
0xD797 /* 讞 */, 0xDADD /* 谳 */,
0xD847 /* 谿 */, 0xCFAA /* 溪 */,
0xD84D /* 豈 */, 0xC6F1 /* 岂 */,
0xD851 /* 豎 */, 0xCAFA /* 竖 */,
0xD853 /* 豐 */, 0xB7E1 /* 丰 */,
0xD857 /* 豔 */, 0xD1DE /* 艳 */,
0xD869 /* 豬 */, 0xD6ED /* 猪 */,
0xD882 /* 貍 */, 0xC0EA /* 狸 */,
0xD888 /* 貓 */, 0xC3A8 /* 猫 */,
0xD890 /* 貝 */, 0xB1B4 /* 贝 */,
0xD891 /* 貞 */, 0xD5EA /* 贞 */,
0xD893 /* 負 */, 0xB8BA /* 负 */,
0xD894 /* 財 */, 0xB2C6 /* 财 */,
0xD895 /* 貢 */, 0xB9B1 /* 贡 */,
0xD89A /* 貧 */, 0xC6B6 /* 贫 */,
0xD89B /* 貨 */, 0xBBF5 /* 货 */,
0xD89C /* 販 */, 0xB7B7 /* 贩 */,
0xD89D /* 貪 */, 0xCCB0 /* 贪 */,
0xD89E /* 貫 */, 0xB9E1 /* 贯 */,
0xD89F /* 責 */, 0xD4F0 /* 责 */,
0xD941 /* 貯 */, 0xD6FC /* 贮 */,
0xD942 /* 貰 */, 0xEADB /* 贳 */,
0xD944 /* 貲 */, 0xEADF /* 赀 */,
0xD945 /* 貳 */, 0xB7A1 /* 贰 */,
0xD946 /* 貴 */, 0xB9F3 /* 贵 */,
0xD948 /* 貶 */, 0xB1E1 /* 贬 */,
0xD949 /* 買 */, 0xC2F2 /* 买 */,
0xD94A /* 貸 */, 0xB4FB /* 贷 */,
0xD94C /* 貺 */, 0xEADC /* 贶 */,
0xD94D /* 費 */, 0xB7D1 /* 费 */,
0xD94E /* 貼 */, 0xCCF9 /* 贴 */,
0xD94F /* 貽 */, 0xEADD /* 贻 */,
0xD951 /* 貿 */, 0xC3B3 /* 贸 */,
0xD952 /* 賀 */, 0xBAD8 /* 贺 */,
0xD953 /* 賁 */, 0xEADA /* 贲 */,
0xD954 /* 賂 */, 0xC2B8 /* 赂 */,
0xD955 /* 賃 */, 0xC1DE /* 赁 */,
0xD956 /* 賄 */, 0xBBDF /* 贿 */,
0xD957 /* 賅 */, 0xEAE0 /* 赅 */,
0xD959 /* 資 */, 0xD7CA /* 资 */,
0xD95A /* 賈 */, 0xBCD6 /* 贾 */,
0xD95C /* 賊 */, 0xD4F4 /* 贼 */,
0xD963 /* 賑 */, 0xEAE2 /* 赈 */,
0xD964 /* 賒 */, 0xC9DE /* 赊 */,
0xD965 /* 賓 */, 0xB1F6 /* 宾 */,
0xD967 /* 賕 */, 0xEAE4 /* 赇 */,
0xD96C /* 賚 */, 0xEAE3 /* 赉 */,
0xD96E /* 賜 */, 0xB4CD /* 赐 */,
0xD970 /* 賞 */, 0xC9CD /* 赏 */,
0xD972 /* 賠 */, 0xC5E2 /* 赔 */,
0xD973 /* 賡 */, 0xE2D9 /* 赓 */,
0xD974 /* 賢 */, 0xCFCD /* 贤 */,
0xD975 /* 賣 */, 0xC2F4 /* 卖 */,
0xD976 /* 賤 */, 0xBCFA /* 贱 */,
0xD978 /* 賦 */, 0xB8B3 /* 赋 */,
0xD979 /* 賧 */, 0xEAE6 /* 赕 */,
0xD97C /* 質 */, 0xD6CA /* 质 */,
0xD97E /* 賬 */, 0xD5CB /* 账 */,
0xD980 /* 賭 */, 0xB6C4 /* 赌 */,
0xD981 /* 賮 */, 0xEAE1 /* 赆 */,
0xD987 /* 賴 */, 0xC0B5 /* 赖 */,
0xD98B /* 賸 */, 0xCAA3 /* 剩 */,
0xD98D /* 賺 */, 0xD7AC /* 赚 */,
0xD98E /* 賻 */, 0xEAE7 /* 赙 */,
0xD98F /* 購 */, 0xB9BA /* 购 */,
0xD990 /* 賽 */, 0xC8FC /* 赛 */,
0xD991 /* 賾 */, 0xD8D3 /* 赜 */,
0xD997 /* 贄 */, 0xEADE /* 贽 */,
0xD998 /* 贅 */, 0xD7B8 /* 赘 */,
0xD99B /* 贈 */, 0xD4F9 /* 赠 */,
0xD99D /* 贊 */, 0xD4DE /* 赞 */,
0xD9A0 /* 贍 */, 0xC9C4 /* 赡 */,
0xDA41 /* 贏 */, 0xD3AE /* 赢 */,
0xDA42 /* 贐 */, 0xEAE1 /* 赆 */,
0xDA45 /* 贓 */, 0xD4DF /* 赃 */,
0xDA48 /* 贖 */, 0xCAEA /* 赎 */,
0xDA49 /* 贗 */, 0xD8CD /* 赝 */,
0xDA4D /* 贛 */, 0xB8D3 /* 赣 */,
0xDA73 /* 趕 */, 0xB8CF /* 赶 */,
0xDA77 /* 趙 */, 0xD5D4 /* 赵 */,
0xDA85 /* 趨 */, 0xC7F7 /* 趋 */,
0xDA8E /* 趲 */, 0xF4F5 /* 趱 */,
0xDB45 /* 跡 */, 0xBCA3 /* 迹 */,
0xDB50 /* 跴 */, 0xB2C8 /* 踩 */,
0xDB52 /* 跼 */, 0xBED6 /* 局 */,
0xDB60 /* 踐 */, 0xBCF9 /* 践 */,
0xDB6D /* 踡 */, 0xF2E9 /* 蜷 */,
0xDB73 /* 踫 */, 0xC5F6 /* 碰 */,
0xDB75 /* 踰 */, 0xD3E2 /* 逾 */,
0xDB78 /* 踴 */, 0xD3BB /* 踊 */,
0xDB7D /* 踼 */, 0xCCDF /* 踢 */,
0xDB84 /* 蹌 */, 0xF5C4 /* 跄 */,
0xDB8B /* 蹕 */, 0xF5CF /* 跸 */,
0xDB8F /* 蹚 */, 0xCCCB /* 趟 */,
0xDB94 /* 蹟 */, 0xBCA3 /* 迹 */,
0xDB95 /* 蹠 */, 0xF5C5 /* 跖 */,
0xDB98 /* 蹣 */, 0xF5E7 /* 蹒 */,
0xDB99 /* 蹤 */, 0xD7D9 /* 踪 */,
0xDB9B /* 蹧 */, 0xD4E3 /* 糟 */,
0xDC45 /* 蹺 */, 0xF5CE /* 跷 */,
0xDC46 /* 蹻 */, 0xF5CE /* 跷 */,
0xDC4A /* 躂 */, 0xCCA4 /* 踏 */,
0xDC4F /* 躉 */, 0xF5BB /* 趸 */,
0xDC50 /* 躊 */, 0xB3EC /* 踌 */,
0xDC51 /* 躋 */, 0xF5D2 /* 跻 */,
0xDC53 /* 躍 */, 0xD4BE /* 跃 */,
0xDC55 /* 躑 */, 0xF5DC /* 踯 */,
0xDC56 /* 躒 */, 0xF5C8 /* 跞 */,
0xDC57 /* 躓 */, 0xF5D9 /* 踬 */,
0xDC58 /* 躕 */, 0xF5E9 /* 蹰 */,
0xDC5D /* 躚 */, 0xF5D1 /* 跹 */,
0xDC62 /* 躡 */, 0xF5E6 /* 蹑 */,
0xDC66 /* 躥 */, 0xB4DA /* 蹿 */,
0xDC67 /* 躦 */, 0xF5F2 /* 躜 */,
0xDC6B /* 躪 */, 0xF5EF /* 躏 */,
0xDC7C /* 軀 */, 0xC7FB /* 躯 */,
0xDC87 /* 車 */, 0xB3B5 /* 车 */,
0xDC88 /* 軋 */, 0xD4FE /* 轧 */,
0xDC89 /* 軌 */, 0xB9EC /* 轨 */,
0xDC8A /* 軍 */, 0xBEFC /* 军 */,
0xDC8E /* 軒 */, 0xD0F9 /* 轩 */,
0xDC90 /* 軔 */, 0xE9ED /* 轫 */,
0xDC97 /* 軛 */, 0xE9EE /* 轭 */,
0xDC9B /* 軟 */, 0xC8ED /* 软 */,
0xDD46 /* 軫 */, 0xE9F4 /* 轸 */,
0xDD53 /* 軸 */, 0xD6E1 /* 轴 */,
0xDD54 /* 軹 */, 0xE9F2 /* 轵 */,
0xDD55 /* 軺 */, 0xE9F7 /* 轺 */,
0xDD56 /* 軻 */, 0xE9F0 /* 轲 */,
0xDD57 /* 軼 */, 0xE9F3 /* 轶 */,
0xDD59 /* 軾 */, 0xE9F8 /* 轼 */,
0xDD5E /* 較 */, 0xBDCF /* 较 */,
0xDD60 /* 輅 */, 0xE9FB /* 辂 */,
0xDD62 /* 輇 */, 0xE9FA /* 辁 */,
0xDD64 /* 載 */, 0xD4D8 /* 载 */,
0xDD65 /* 輊 */, 0xE9F9 /* 轾 */,
0xDD6D /* 輒 */, 0xE9FC /* 辄 */,
0xDD6E /* 輓 */, 0xCDEC /* 挽 */,
0xDD6F /* 輔 */, 0xB8A8 /* 辅 */,
0xDD70 /* 輕 */, 0xC7E1 /* 轻 */,
0xDD76 /* 輛 */, 0xC1BE /* 辆 */,
0xDD77 /* 輜 */, 0xEAA2 /* 辎 */,
0xDD78 /* 輝 */, 0xBBD4 /* 辉 */,
0xDD79 /* 輞 */, 0xE9FE /* 辋 */,
0xDD7A /* 輟 */, 0xEAA1 /* 辍 */,
0xDD81 /* 輥 */, 0xB9F5 /* 辊 */,
0xDD82 /* 輦 */, 0xE9FD /* 辇 */,
0xDD85 /* 輩 */, 0xB1B2 /* 辈 */,
0xDD86 /* 輪 */, 0xC2D6 /* 轮 */,
0xDD8B /* 輯 */, 0xBCAD /* 辑 */,
0xDD8F /* 輳 */, 0xEAA3 /* 辏 */,
0xDD94 /* 輸 */, 0xCAE4 /* 输 */,
0xDD97 /* 輻 */, 0xB7F8 /* 辐 */,
0xDD9A /* 輾 */, 0xD5B7 /* 辗 */,
0xDD9B /* 輿 */, 0xD3DF /* 舆 */,
0xDD9E /* 轂 */, 0xECB1 /* 毂 */,
0xDDA0 /* 轄 */, 0xCFBD /* 辖 */,
0xDE40 /* 轅 */, 0xD4AF /* 辕 */,
0xDE41 /* 轆 */, 0xEAA4 /* 辘 */,
0xDE44 /* 轉 */, 0xD7AA /* 转 */,
0xDE48 /* 轍 */, 0xD5DE /* 辙 */,
0xDE49 /* 轎 */, 0xBDCE /* 轿 */,
0xDE4F /* 轔 */, 0xEAA5 /* 辚 */,
0xDE5A /* 轟 */, 0xBAE4 /* 轰 */,
0xDE5C /* 轡 */, 0xE0CE /* 辔 */,
0xDE5D /* 轢 */, 0xE9F6 /* 轹 */,
0xDE5F /* 轤 */, 0xE9F1 /* 轳 */,
0xDE6B /* 辦 */, 0xB0EC /* 办 */,
0xDE6F /* 辭 */, 0xB4C7 /* 辞 */,
0xDE70 /* 辮 */, 0xB1E8 /* 辫 */,
0xDE71 /* 辯 */, 0xB1E7 /* 辩 */,
0xDE72 /* 農 */, 0xC5A9 /* 农 */,
0xDE7E /* 迆 */, 0xE5C6 /* 迤 */,
0xDE92 /* 迴 */, 0xBBD8 /* 回 */,
0xDE95 /* 迺 */, 0xC4CB /* 乃 */,
0xDE96 /* 迻 */, 0xD2C6 /* 移 */,
0xDE9F /* 逕 */, 0xE5C9 /* 迳 */,
0xDF40 /* 這 */, 0xD5E2 /* 这 */,
0xDF42 /* 連 */, 0xC1AC /* 连 */,
0xDF4C /* 週 */, 0xD6DC /* 周 */,
0xDF4D /* 進 */, 0xBDF8 /* 进 */,
0xDF5A /* 遉 */, 0xD5EC /* 侦 */,
0xDF5B /* 遊 */, 0xD3CE /* 游 */,
0xDF5C /* 運 */, 0xD4CB /* 运 */,
0xDF5E /* 過 */, 0xB9FD /* 过 */,
0xDF5F /* 達 */, 0xB4EF /* 达 */,
0xDF60 /* 違 */, 0xCEA5 /* 违 */,
0xDF62 /* 遙 */, 0xD2A3 /* 遥 */,
0xDF64 /* 遜 */, 0xD1B7 /* 逊 */,
0xDF66 /* 遞 */, 0xB5DD /* 递 */,
0xDF68 /* 遠 */, 0xD4B6 /* 远 */,
0xDF6D /* 適 */, 0xCACA /* 适 */,
0xDF74 /* 遲 */, 0xB3D9 /* 迟 */,
0xDF76 /* 遶 */, 0xC8C6 /* 绕 */,
0xDF77 /* 遷 */, 0xC7A8 /* 迁 */,
0xDF78 /* 選 */, 0xD1A1 /* 选 */,
0xDF7A /* 遺 */, 0xD2C5 /* 遗 */,
0xDF7C /* 遼 */, 0xC1C9 /* 辽 */,
0xDF7E /* 邁 */, 0xC2F5 /* 迈 */,
0xDF80 /* 還 */, 0xBBB9 /* 还 */,
0xDF83 /* 邇 */, 0xE5C7 /* 迩 */,
0xDF85 /* 邊 */, 0xB1DF /* 边 */,
0xDF89 /* 邏 */, 0xC2DF /* 逻 */,
0xDF8A /* 邐 */, 0xE5CE /* 逦 */,
0xE041 /* 郃 */, 0xBACF /* 合 */,
0xE050 /* 郟 */, 0xDBA3 /* 郏 */,
0xE05D /* 郵 */, 0xD3CA /* 邮 */,
0xE069 /* 鄆 */, 0xDBA9 /* 郓 */,
0xE06C /* 鄉 */, 0xCFE7 /* 乡 */,
0xE075 /* 鄒 */, 0xD7DE /* 邹 */,
0xE077 /* 鄔 */, 0xDAF9 /* 邬 */,
0xE079 /* 鄖 */, 0xD4C7 /* 郧 */,
0xE087 /* 鄧 */, 0xB5CB /* 邓 */,
0xE08D /* 鄭 */, 0xD6A3 /* 郑 */,
0xE08F /* 鄰 */, 0xC1DA /* 邻 */,
0xE090 /* 鄲 */, 0xB5A6 /* 郸 */,
0xE092 /* 鄴 */, 0xDAFE /* 邺 */,
0xE094 /* 鄶 */, 0xDBA6 /* 郐 */,
0xE097 /* 鄺 */, 0xDAF7 /* 邝 */,
0xE142 /* 酈 */, 0xDBAA /* 郦 */,
0xE147 /* 酖 */, 0xF0B2 /* 鸩 */,
0xE15A /* 醃 */, 0xEBE7 /* 腌 */,
0xE168 /* 醜 */, 0xB3F3 /* 丑 */,
0xE16A /* 醞 */, 0xD4CD /* 酝 */,
0xE174 /* 醫 */, 0xD2BD /* 医 */,
0xE175 /* 醬 */, 0xBDB4 /* 酱 */,
0xE177 /* 醱 */, 0xB2A6 /* 拨 */,
0xE180 /* 醼 */, 0xD1E0 /* 燕 */,
0xE184 /* 釀 */, 0xC4F0 /* 酿 */,
0xE185 /* 釁 */, 0xD0C6 /* 衅 */,
0xE187 /* 釃 */, 0xF5A7 /* 酾 */,
0xE189 /* 釅 */, 0xF5A6 /* 酽 */,
0xE18C /* 釋 */, 0xCACD /* 释 */,
0xE18D /* 釐 */, 0xC0E5 /* 厘 */,
0xE18F /* 釓 */, 0xEEC5 /* 钆 */,
0xE190 /* 釔 */, 0xEEC6 /* 钇 */,
0xE191 /* 釕 */, 0xEEC9 /* 钌 */,
0xE193 /* 釗 */, 0xEEC8 /* 钊 */,
0xE194 /* 釘 */, 0xB6A4 /* 钉 */,
0xE195 /* 釙 */, 0xEEC7 /* 钋 */,
0xE198 /* 針 */, 0xD5EB /* 针 */,
0xE19E /* 釣 */, 0xB5F6 /* 钓 */,
0xE19F /* 釤 */, 0xEECC /* 钐 */,
0xE240 /* 釦 */, 0xBFDB /* 扣 */,
0xE241 /* 釧 */, 0xEECB /* 钏 */,
0xE243 /* 釩 */, 0xB7B0 /* 钒 */,
0xE246 /* 釬 */, 0xC7A5 /* 钎 */,
0xE24F /* 釵 */, 0xEECE /* 钗 */,
0xE251 /* 釷 */, 0xEECA /* 钍 */,
0xE253 /* 釹 */, 0xEECF /* 钕 */,
0xE25A /* 鈀 */, 0xEED9 /* 钯 */,
0xE25B /* 鈁 */, 0xEED5 /* 钫 */,
0xE25E /* 鈄 */, 0xEED7 /* 钭 */,
0xE263 /* 鈉 */, 0xC4C6 /* 钠 */,
0xE267 /* 鈍 */, 0xB6DB /* 钝 */,
0xE26A /* 鈐 */, 0xEED4 /* 钤 */,
0xE26B /* 鈑 */, 0xEED3 /* 钣 */,
0xE26E /* 鈔 */, 0xB3AE /* 钞 */,
0xE26F /* 鈕 */, 0xC5A5 /* 钮 */,
0xE278 /* 鈞 */, 0xBEFB /* 钧 */,
0xE27D /* 鈣 */, 0xB8C6 /* 钙 */,
0xE280 /* 鈥 */, 0xEED8 /* 钬 */,
0xE281 /* 鈦 */, 0xEED1 /* 钛 */,
0xE282 /* 鈧 */, 0xEED6 /* 钪 */,
0xE289 /* 鈮 */, 0xEEEA /* 铌 */,
0xE28B /* 鈰 */, 0xEEE6 /* 铈 */,
0xE28E /* 鈳 */, 0xEEDD /* 钶 */,
0xE28F /* 鈴 */, 0xC1E5 /* 铃 */,
0xE292 /* 鈷 */, 0xEEDC /* 钴 */,
0xE293 /* 鈸 */, 0xEEE0 /* 钹 */,
0xE294 /* 鈹 */, 0xEEEB /* 铍 */,
0xE295 /* 鈺 */, 0xEEDA /* 钰 */,
0xE298 /* 鈽 */, 0xEEDF /* 钸 */,
0xE299 /* 鈾 */, 0xD3CB /* 铀 */,
0xE29A /* 鈿 */, 0xEEE4 /* 钿 */,
0xE29B /* 鉀 */, 0xBCD8 /* 钾 */,
0xE2A0 /* 鉅 */, 0xEED2 /* 钜 */,
0xE340 /* 鉆 */, 0xD7EA /* 钻 */,
0xE342 /* 鉈 */, 0xEEE8 /* 铊 */,
0xE343 /* 鉉 */, 0xEEE7 /* 铉 */,
0xE345 /* 鉋 */, 0xC5D9 /* 刨 */,
0xE347 /* 鉍 */, 0xEEE9 /* 铋 */,
0xE34B /* 鉑 */, 0xB2AC /* 铂 */,
0xE351 /* 鉗 */, 0xC7AF /* 钳 */,
0xE354 /* 鉚 */, 0xC3AD /* 铆 */,
0xE355 /* 鉛 */, 0xC7A6 /* 铅 */,
0xE358 /* 鉞 */, 0xEEE1 /* 钺 */,
0xE35E /* 鉤 */, 0xB9B3 /* 钩 */,
0xE360 /* 鉦 */, 0xEEDB /* 钲 */,
0xE366 /* 鉬 */, 0xEEE2 /* 钼 */,
0xE367 /* 鉭 */, 0xEEE3 /* 钽 */,
0xE371 /* 鉸 */, 0xBDC2 /* 铰 */,
0xE373 /* 鉺 */, 0xEEEF /* 铒 */,
0xE374 /* 鉻 */, 0xB8F5 /* 铬 */,
0xE378 /* 鉿 */, 0xEEFE /* 铪 */,
0xE379 /* 銀 */, 0xD2F8 /* 银 */,
0xE37C /* 銃 */, 0xEFA5 /* 铳 */,
0xE37E /* 銅 */, 0xCDAD /* 铜 */,
0xE38A /* 銑 */, 0xCFB3 /* 铣 */,
0xE38C /* 銓 */, 0xEEFD /* 铨 */,
0xE38E /* 銕 */, 0xCCFA /* 铁 */,
0xE38F /* 銖 */, 0xEEF9 /* 铢 */,
0xE391 /* 銘 */, 0xC3FA /* 铭 */,
0xE393 /* 銚 */, 0xEFA2 /* 铫 */,
0xE395 /* 銜 */, 0xCFCE /* 衔 */,
0xE399 /* 銠 */, 0xEEEE /* 铑 */,
0xE39C /* 銣 */, 0xEFA8 /* 铷 */,
0xE39E /* 銥 */, 0xD2BF /* 铱 */,
0xE39F /* 銦 */, 0xEEF7 /* 铟 */,
0xE440 /* 銨 */, 0xEFA7 /* 铵 */,
0xE441 /* 銩 */, 0xEEFB /* 铥 */,
0xE442 /* 銪 */, 0xEEF0 /* 铕 */,
0xE443 /* 銫 */, 0xEFA4 /* 铯 */,
0xE444 /* 銬 */, 0xEEED /* 铐 */,
0xE449 /* 銲 */, 0xBAB8 /* 焊 */,
0xE44A /* 銳 */, 0xC8F1 /* 锐 */,
0xE44E /* 銷 */, 0xCFFA /* 销 */,
0xE452 /* 銻 */, 0xCCE0 /* 锑 */,
0xE453 /* 銼 */, 0xEFB1 /* 锉 */,
0xE458 /* 鋁 */, 0xC2C1 /* 铝 */,
0xE45A /* 鋃 */, 0xEFB6 /* 锒 */,
0xE45C /* 鋅 */, 0xD0BF /* 锌 */,
0xE45E /* 鋇 */, 0xB1B5 /* 钡 */,
0xE462 /* 鋌 */, 0xEEFA /* 铤 */,
0xE465 /* 鋏 */, 0xEEF2 /* 铗 */,
0xE468 /* 鋒 */, 0xB7E6 /* 锋 */,
0xE473 /* 鋝 */, 0xEFB2 /* 锊 */,
0xE475 /* 鋟 */, 0xEFB7 /* 锓 */,
0xE47A /* 鋤 */, 0xB3FA /* 锄 */,
0xE47C /* 鋦 */, 0xEFB8 /* 锔 */,
0xE47E /* 鋨 */, 0xEFB0 /* 锇 */,
0xE481 /* 鋪 */, 0xC6CC /* 铺 */,
0xE485 /* 鋮 */, 0xEEF1 /* 铖 */,
0xE486 /* 鋯 */, 0xEFAF /* 锆 */,
0xE487 /* 鋰 */, 0xEFAE /* 锂 */,
0xE488 /* 鋱 */, 0xEFAB /* 铽 */,
0xE48F /* 鋸 */, 0xBEE2 /* 锯 */,
0xE493 /* 鋼 */, 0xB8D6 /* 钢 */,
0xE498 /* 錁 */, 0xEFBE /* 锞 */,
0xE49B /* 錄 */, 0xC2BC /* 录 */,
0xE49D /* 錆 */, 0xEFBA /* 锖 */,
0xE49F /* 錈 */, 0xEFC3 /* 锩 */,
0xE546 /* 錐 */, 0xD7B6 /* 锥 */,
0xE548 /* 錒 */, 0xEFB9 /* 锕 */,
0xE54B /* 錕 */, 0xEFBF /* 锟 */,
0xE54E /* 錘 */, 0xB4B8 /* 锤 */,
0xE54F /* 錙 */, 0xEFC5 /* 锱 */,
0xE550 /* 錚 */, 0xEFA3 /* 铮 */,
0xE551 /* 錛 */, 0xEFBC /* 锛 */,
0xE555 /* 錟 */, 0xEFC4 /* 锬 */,
0xE556 /* 錠 */, 0xB6A7 /* 锭 */,
0xE558 /* 錢 */, 0xC7AE /* 钱 */,
0xE55C /* 錦 */, 0xBDF5 /* 锦 */,
0xE55E /* 錨 */, 0xC3AA /* 锚 */,
0xE561 /* 錫 */, 0xCEFD /* 锡 */,
0xE564 /* 錮 */, 0xEFC0 /* 锢 */,
0xE565 /* 錯 */, 0xB4ED /* 错 */,
0xE569 /* 錳 */, 0xC3CC /* 锰 */,
0xE56C /* 錶 */, 0xB1ED /* 表 */,
0xE56E /* 錸 */, 0xEFAA /* 铼 */,
0xE57B /* 鍆 */, 0xEECD /* 钔 */,
0xE57C /* 鍇 */, 0xEFC7 /* 锴 */,
0xE580 /* 鍊 */, 0xC1B4 /* 链 */,
0xE581 /* 鍋 */, 0xB9F8 /* 锅 */,
0xE583 /* 鍍 */, 0xB6C6 /* 镀 */,
0xE58A /* 鍔 */, 0xEFC9 /* 锷 */,
0xE58E /* 鍘 */, 0xD5A1 /* 铡 */,
0xE590 /* 鍚 */, 0xCEFD /* 锡 */,
0xE591 /* 鍛 */, 0xB6CD /* 锻 */,
0xE59A /* 鍤 */, 0xEFCA /* 锸 */,
0xE59B /* 鍥 */, 0xEFC6 /* 锲 */,
0xE640 /* 鍬 */, 0xC7C2 /* 锹 */,
0xE644 /* 鍰 */, 0xEFCC /* 锾 */,
0xE649 /* 鍵 */, 0xBCFC /* 键 */,
0xE64A /* 鍶 */, 0xEFC8 /* 锶 */,
0xE64E /* 鍺 */, 0xD5E0 /* 锗 */,
0xE650 /* 鍼 */, 0xD5EB /* 针 */,
0xE652 /* 鍾 */, 0xD6D3 /* 钟 */,
0xE656 /* 鎂 */, 0xC3BE /* 镁 */,
0xE65E /* 鎊 */, 0xB0F7 /* 镑 */,
0xE667 /* 鎔 */, 0xC8DB /* 熔 */,
0xE669 /* 鎖 */, 0xCBF8 /* 锁 */,
0xE66A /* 鎗 */, 0xC7B9 /* 枪 */,
0xE66B /* 鎘 */, 0xEFD3 /* 镉 */,
0xE66D /* 鎚 */, 0xB4B8 /* 锤 */,
0xE675 /* 鎢 */, 0xCED9 /* 钨 */,
0xE676 /* 鎣 */, 0xDDF6 /* 蓥 */,
0xE679 /* 鎦 */, 0xEFD6 /* 镏 */,
0xE67A /* 鎧 */, 0xEEF8 /* 铠 */,
0xE67C /* 鎩 */, 0xEFA1 /* 铩 */,
0xE67D /* 鎪 */, 0xEFCB /* 锼 */,
0xE680 /* 鎬 */, 0xB8E4 /* 镐 */,
0xE682 /* 鎮 */, 0xD5F2 /* 镇 */,
0xE683 /* 鎯 */, 0xC0C6 /* 榔 */,
0xE684 /* 鎰 */, 0xEFD7 /* 镒 */,
0xE687 /* 鎳 */, 0xC4F8 /* 镍 */,
0xE689 /* 鎵 */, 0xEFD8 /* 镓 */,
0xE697 /* 鏃 */, 0xEFDF /* 镞 */,
0xE69B /* 鏇 */, 0xEFE0 /* 镟 */,
0xE69C /* 鏈 */, 0xC1B4 /* 链 */,
0xE69F /* 鏌 */, 0xEFD2 /* 镆 */,
0xE6A0 /* 鏍 */, 0xEFDD /* 镙 */,
0xE743 /* 鏑 */, 0xEFE1 /* 镝 */,
0xE748 /* 鏗 */, 0xEFAC /* 铿 */,
0xE749 /* 鏘 */, 0xEFCF /* 锵 */,
0xE74B /* 鏚 */, 0xC6DD /* 戚 */,
0xE74D /* 鏜 */, 0xEFDB /* 镗 */,
0xE74E /* 鏝 */, 0xEFDC /* 镘 */,
0xE74F /* 鏞 */, 0xEFDE /* 镛 */,
0xE750 /* 鏟 */, 0xB2F9 /* 铲 */,
0xE752 /* 鏡 */, 0xBEB5 /* 镜 */,
0xE753 /* 鏢 */, 0xEFDA /* 镖 */,
0xE755 /* 鏤 */, 0xEFCE /* 镂 */,
0xE759 /* 鏨 */, 0xF6C9 /* 錾 */,
0xE766 /* 鏵 */, 0xEEFC /* 铧 */,
0xE768 /* 鏷 */, 0xEFE4 /* 镤 */,
0xE76A /* 鏹 */, 0xEFEA /* 镪 */,
0xE76E /* 鏽 */, 0xD0E2 /* 锈 */,
0xE774 /* 鐃 */, 0xEEF3 /* 铙 */,
0xE77A /* 鐉 */, 0xCFB3 /* 铣 */,
0xE77C /* 鐋 */, 0xEFA6 /* 铴 */,
0xE782 /* 鐐 */, 0xC1CD /* 镣 */,
0xE784 /* 鐒 */, 0xEFA9 /* 铹 */,
0xE785 /* 鐓 */, 0xEFE6 /* 镦 */,
0xE786 /* 鐔 */, 0xEFE2 /* 镡 */,
0xE78A /* 鐘 */, 0xD6D3 /* 钟 */,
0xE78B /* 鐙 */, 0xEFEB /* 镫 */,
0xE792 /* 鐠 */, 0xEFE8 /* 镨 */,
0xE79A /* 鐨 */, 0xEFD0 /* 镄 */,
0xE79D /* 鐫 */, 0xEFD4 /* 镌 */,
0xE7A0 /* 鐮 */, 0xC1AD /* 镰 */,
0xE843 /* 鐲 */, 0xEFED /* 镯 */,
0xE844 /* 鐳 */, 0xC0D8 /* 镭 */,
0xE846 /* 鐵 */, 0xCCFA /* 铁 */,
0xE849 /* 鐸 */, 0xEEEC /* 铎 */,
0xE84B /* 鐺 */, 0xEEF5 /* 铛 */,
0xE84E /* 鐽 */, 0xEEE3 /* 钽 */,
0xE84F /* 鐿 */, 0xEFEE /* 镱 */,
0xE854 /* 鑄 */, 0xD6FD /* 铸 */,
0xE85A /* 鑊 */, 0xEFEC /* 镬 */,
0xE85C /* 鑌 */, 0xEFD9 /* 镔 */,
0xE861 /* 鑑 */, 0xBCF8 /* 鉴 */,
0xE862 /* 鑒 */, 0xBCF8 /* 鉴 */,
0xE870 /* 鑠 */, 0xEEE5 /* 铄 */,
0xE873 /* 鑣 */, 0xEFF0 /* 镳 */,
0xE874 /* 鑤 */, 0xC5D9 /* 刨 */,
0xE87A /* 鑪 */, 0xC2AF /* 炉 */,
0xE87C /* 鑭 */, 0xEFE7 /* 镧 */,
0xE880 /* 鑰 */, 0xD4BF /* 钥 */,
0xE882 /* 鑲 */, 0xCFE2 /* 镶 */,
0xE887 /* 鑷 */, 0xC4F7 /* 镊 */,
0xE88C /* 鑼 */, 0xC2E0 /* 锣 */,
0xE88D /* 鑽 */, 0xD7EA /* 钻 */,
0xE88E /* 鑾 */, 0xF6C7 /* 銮 */,
0xE88F /* 鑿 */, 0xD4E4 /* 凿 */,
0xE893 /* 钃 */, 0xEFED /* 镯 */,
0xE94C /* 長 */, 0xB3A4 /* 长 */,
0xE954 /* 門 */, 0xC3C5 /* 门 */,
0xE956 /* 閂 */, 0xE3C5 /* 闩 */,
0xE957 /* 閃 */, 0xC9C1 /* 闪 */,
0xE95A /* 閆 */, 0xE3C6 /* 闫 */,
0xE95D /* 閉 */, 0xB1D5 /* 闭 */,
0xE95F /* 開 */, 0xBFAA /* 开 */,
0xE960 /* 閌 */, 0xE3CA /* 闶 */,
0xE962 /* 閎 */, 0xE3C8 /* 闳 */,
0xE963 /* 閏 */, 0xC8F2 /* 闰 */,
0xE965 /* 閑 */, 0xCFD0 /* 闲 */,
0xE966 /* 閒 */, 0xCFD0 /* 闲 */,
0xE967 /* 間 */, 0xBCE4 /* 间 */,
0xE968 /* 閔 */, 0xE3C9 /* 闵 */,
0xE96C /* 閘 */, 0xD5A2 /* 闸 */,
0xE975 /* 閡 */, 0xBAD2 /* 阂 */,
0xE977 /* 閣 */, 0xB8F3 /* 阁 */,
0xE978 /* 閤 */, 0xBACF /* 合 */,
0xE979 /* 閥 */, 0xB7A7 /* 阀 */,
0xE97C /* 閨 */, 0xB9EB /* 闺 */,
0xE97D /* 閩 */, 0xC3F6 /* 闽 */,
0xE980 /* 閫 */, 0xE3CD /* 阃 */,
0xE981 /* 閬 */, 0xE3CF /* 阆 */,
0xE982 /* 閭 */, 0xE3CC /* 闾 */,
0xE986 /* 閱 */, 0xD4C4 /* 阅 */,
0xE98B /* 閶 */, 0xE3D1 /* 阊 */,
0xE98E /* 閹 */, 0xD1CB /* 阉 */,
0xE990 /* 閻 */, 0xD1D6 /* 阎 */,
0xE991 /* 閼 */, 0xE3D5 /* 阏 */,
0xE992 /* 閽 */, 0xE3D4 /* 阍 */,
0xE993 /* 閾 */, 0xE3D0 /* 阈 */,
0xE994 /* 閿 */, 0xE3D3 /* 阌 */,
0xE998 /* 闃 */, 0xE3D6 /* 阒 */,
0xE99B /* 闆 */, 0xB0E5 /* 板 */,
0xE99C /* 闇 */, 0xB0B5 /* 暗 */,
0xE99D /* 闈 */, 0xE3C7 /* 闱 */,
0xE99F /* 闊 */, 0xC0AB /* 阔 */,
0xE9A0 /* 闋 */, 0xE3D7 /* 阕 */,
0xEA40 /* 闌 */, 0xC0BB /* 阑 */,
0xEA44 /* 闐 */, 0xE3D9 /* 阗 */,
0xEA48 /* 闔 */, 0xE3D8 /* 阖 */,
0xEA49 /* 闕 */, 0xE3DA /* 阙 */,
0xEA4A /* 闖 */, 0xB4B3 /* 闯 */,
0xEA50 /* 關 */, 0xB9D8 /* 关 */,
0xEA52 /* 闞 */, 0xE3DB /* 阚 */,
0xEA55 /* 闡 */, 0xB2FB /* 阐 */,
0xEA56 /* 闢 */, 0xB1D9 /* 辟 */,
0xEA59 /* 闥 */, 0xE3CB /* 闼 */,
0xEA69 /* 阨 */, 0xB6F2 /* 厄 */,
0xEA6C /* 阬 */, 0xBFD3 /* 坑 */,
0xEA6E /* 阯 */, 0xD6B7 /* 址 */,
0xEA80 /* 陘 */, 0xDAEA /* 陉 */,
0xEA83 /* 陜 */, 0xC9C2 /* 陕 */,
0xEA84 /* 陝 */, 0xC9C2 /* 陕 */,
0xEA85 /* 陞 */, 0xC9FD /* 升 */,
0xEA87 /* 陣 */, 0xD5F3 /* 阵 */,
0xEA8E /* 陰 */, 0xD2F5 /* 阴 */,
0xEA90 /* 陳 */, 0xB3C2 /* 陈 */,
0xEA91 /* 陸 */, 0xC2BD /* 陆 */,
0xEA96 /* 陽 */, 0xD1F4 /* 阳 */,
0xEA9D /* 隄 */, 0xB5CC /* 堤 */,
0xEA9F /* 隉 */, 0xDAED /* 陧 */,
0xEAA0 /* 隊 */, 0xB6D3 /* 队 */,
0xEB41 /* 階 */, 0xBDD7 /* 阶 */,
0xEB45 /* 隕 */, 0xD4C9 /* 陨 */,
0xEB48 /* 際 */, 0xBCCA /* 际 */,
0xEB53 /* 隨 */, 0xCBE6 /* 随 */,
0xEB55 /* 險 */, 0xCFD5 /* 险 */,
0xEB5B /* 隱 */, 0xD2FE /* 隐 */,
0xEB5D /* 隴 */, 0xC2A4 /* 陇 */,
0xEB60 /* 隸 */, 0xC1A5 /* 隶 */,
0xEB62 /* 隻 */, 0xD6BB /* 只 */,
0xEB68 /* 雋 */, 0xF6C1 /* 隽 */,
0xEB6D /* 雖 */, 0xCBE4 /* 虽 */,
0xEB70 /* 雙 */, 0xCBAB /* 双 */,
0xEB72 /* 雛 */, 0xB3FB /* 雏 */,
0xEB73 /* 雜 */, 0xD4D3 /* 杂 */,
0xEB74 /* 雝 */, 0xD3BA /* 雍 */,
0xEB75 /* 雞 */, 0xBCA6 /* 鸡 */,
0xEB78 /* 離 */, 0xC0EB /* 离 */,
0xEB79 /* 難 */, 0xC4D1 /* 难 */,
0xEB83 /* 雰 */, 0xB7D5 /* 氛 */,
0xEB85 /* 雲 */, 0xD4C6 /* 云 */,
0xEB8A /* 電 */, 0xB5E7 /* 电 */,
0xEB95 /* 霑 */, 0xD5B4 /* 沾 */,
0xEC43 /* 霤 */, 0xC1EF /* 溜 */,
0xEC46 /* 霧 */, 0xCEED /* 雾 */,
0xEC56 /* 霽 */, 0xF6AB /* 霁 */,
0xEC5A /* 靂 */, 0xF6A8 /* 雳 */,
0xEC5C /* 靄 */, 0xF6B0 /* 霭 */,
0xEC60 /* 靈 */, 0xC1E9 /* 灵 */,
0xEC6E /* 靚 */, 0xF6A6 /* 靓 */,
0xEC6F /* 靜 */, 0xBEB2 /* 静 */,
0xEC74 /* 靦 */, 0xEBEF /* 腼 */,
0xEC76 /* 靨 */, 0xD8CC /* 靥 */,
0xEC8A /* 鞀 */, 0xD8BB /* 鼗 */,
0xEC96 /* 鞏 */, 0xB9AE /* 巩 */,
0xECA0 /* 鞝 */, 0xE7B4 /* 绱 */,
0xED46 /* 鞦 */, 0xC7EF /* 秋 */,
0xED5C /* 韁 */, 0xE7D6 /* 缰 */,
0xED5E /* 韃 */, 0xF7B2 /* 鞑 */,
0xED61 /* 韆 */, 0xC7A7 /* 千 */,
0xED64 /* 韉 */, 0xF7B5 /* 鞯 */,
0xED66 /* 韋 */, 0xCEA4 /* 韦 */,
0xED67 /* 韌 */, 0xC8CD /* 韧 */,
0xED6E /* 韓 */, 0xBAAB /* 韩 */,
0xED74 /* 韙 */, 0xE8B8 /* 韪 */,
0xED77 /* 韜 */, 0xE8BA /* 韬 */,
0xED79 /* 韞 */, 0xE8B9 /* 韫 */,
0xED8D /* 韻 */, 0xD4CF /* 韵 */,
0xED91 /* 響 */, 0xCFEC /* 响 */,
0xED93 /* 頁 */, 0xD2B3 /* 页 */,
0xED94 /* 頂 */, 0xB6A5 /* 顶 */,
0xED95 /* 頃 */, 0xC7EA /* 顷 */,
0xED97 /* 項 */, 0xCFEE /* 项 */,
0xED98 /* 順 */, 0xCBB3 /* 顺 */,
0xED99 /* 頇 */, 0xF1FC /* 顸 */,
0xED9A /* 須 */, 0xD0EB /* 须 */,
0xED9C /* 頊 */, 0xE7EF /* 顼 */,
0xED9E /* 頌 */, 0xCBCC /* 颂 */,
0xEDA0 /* 頎 */, 0xF1FD /* 颀 */,
0xEE40 /* 頏 */, 0xF1FE /* 颃 */,
0xEE41 /* 預 */, 0xD4A4 /* 预 */,
0xEE42 /* 頑 */, 0xCDE7 /* 顽 */,
0xEE43 /* 頒 */, 0xB0E4 /* 颁 */,
0xEE44 /* 頓 */, 0xB6D9 /* 顿 */,
0xEE48 /* 頗 */, 0xC6C4 /* 颇 */,
0xEE49 /* 領 */, 0xC1EC /* 领 */,
0xEE4D /* 頜 */, 0xF2A2 /* 颌 */,
0xEE52 /* 頡 */, 0xF2A1 /* 颉 */,
0xEE55 /* 頤 */, 0xD2C3 /* 颐 */,
0xEE57 /* 頦 */, 0xF2A4 /* 颏 */,
0xEE5C /* 頫 */, 0xB8A9 /* 俯 */,
0xEE5E /* 頭 */, 0xCDB7 /* 头 */,
0xEE61 /* 頰 */, 0xBCD5 /* 颊 */,
0xEE68 /* 頷 */, 0xF2A5 /* 颔 */,
0xEE69 /* 頸 */, 0xBEB1 /* 颈 */,
0xEE6A /* 頹 */, 0xCDC7 /* 颓 */,
0xEE6C /* 頻 */, 0xC6B5 /* 频 */,
0xEE77 /* 顆 */, 0xBFC5 /* 颗 */,
0xEE7D /* 題 */, 0xCCE2 /* 题 */,
0xEE7E /* 額 */, 0xB6EE /* 额 */,
0xEE80 /* 顎 */, 0xF2A6 /* 颚 */,
0xEE81 /* 顏 */, 0xD1D5 /* 颜 */,
0xEE85 /* 顓 */, 0xF2A7 /* 颛 */,
0xEE8A /* 願 */, 0xD4B8 /* 愿 */,
0xEE8B /* 顙 */, 0xF2AA /* 颡 */,
0xEE8D /* 顛 */, 0xB5DF /* 颠 */,
0xEE90 /* 類 */, 0xC0E0 /* 类 */,
0xEE94 /* 顢 */, 0xF2A9 /* 颟 */,
0xEE97 /* 顥 */, 0xF2AB /* 颢 */,
0xEE99 /* 顧 */, 0xB9CB /* 顾 */,
0xEE9D /* 顫 */, 0xB2FC /* 颤 */,
0xEF40 /* 顯 */, 0xCFD4 /* 显 */,
0xEF41 /* 顰 */, 0xF2AD /* 颦 */,
0xEF42 /* 顱 */, 0xC2AD /* 颅 */,
0xEF44 /* 顳 */, 0xF2A8 /* 颞 */,
0xEF45 /* 顴 */, 0xC8A7 /* 颧 */,
0xEF4C /* 風 */, 0xB7E7 /* 风 */,
0xEF52 /* 颮 */, 0xECA9 /* 飑 */,
0xEF53 /* 颯 */, 0xECAA /* 飒 */,
0xEF55 /* 颱 */, 0xCCA8 /* 台 */,
0xEF57 /* 颳 */, 0xB9CE /* 刮 */,
0xEF5A /* 颶 */, 0xECAB /* 飓 */,
0xEF5E /* 颺 */, 0xD1EF /* 扬 */,
0xEF60 /* 颼 */, 0xECAC /* 飕 */,
0xEF63 /* 颿 */, 0xB7AB /* 帆 */,
0xEF64 /* 飀 */, 0xE5DE /* 遛 */,
0xEF68 /* 飄 */, 0xC6AE /* 飘 */,
0xEF6A /* 飆 */, 0xECAD /* 飙 */,
0xEF77 /* 飛 */, 0xB7C9 /* 飞 */,
0xEF7C /* 飢 */, 0xBCA2 /* 饥 */,
0xEF82 /* 飩 */, 0xE2BD /* 饨 */,
0xEF83 /* 飪 */, 0xE2BF /* 饪 */,
0xEF84 /* 飫 */, 0xE2C0 /* 饫 */,
0xEF86 /* 飭 */, 0xE2C1 /* 饬 */,
0xEF88 /* 飯 */, 0xB7B9 /* 饭 */,
0xEF8B /* 飲 */, 0xD2FB /* 饮 */,
0xEF8D /* 飴 */, 0xE2C2 /* 饴 */,
0xEF95 /* 飼 */, 0xCBC7 /* 饲 */,
0xEF96 /* 飽 */, 0xB1A5 /* 饱 */,
0xEF97 /* 飾 */, 0xCACE /* 饰 */,
0xEF9C /* 餃 */, 0xBDC8 /* 饺 */,
0xEF9E /* 餅 */, 0xB1FD /* 饼 */,
0xF041 /* 餉 */, 0xE2C3 /* 饷 */,
0xF042 /* 養 */, 0xD1F8 /* 养 */,
0xF044 /* 餌 */, 0xB6FC /* 饵 */,
0xF047 /* 餑 */, 0xE2C4 /* 饽 */,
0xF048 /* 餒 */, 0xC4D9 /* 馁 */,
0xF049 /* 餓 */, 0xB6F6 /* 饿 */,
0xF04E /* 餘 */, 0xD3E0 /* 余 */,
0xF050 /* 餚 */, 0xEBC8 /* 肴 */,
0xF051 /* 餛 */, 0xE2C6 /* 馄 */,
0xF054 /* 餞 */, 0xBDA4 /* 饯 */,
0xF057 /* 餡 */, 0xCFDA /* 馅 */,
0xF05D /* 餧 */, 0xCEB9 /* 喂 */,
0xF05E /* 館 */, 0xB9DD /* 馆 */,
0xF062 /* 餬 */, 0xBAFD /* 糊 */,
0xF068 /* 餳 */, 0xE2BC /* 饧 */,
0xF06A /* 餵 */, 0xCEB9 /* 喂 */,
0xF071 /* 餼 */, 0xE2BE /* 饩 */,
0xF072 /* 餽 */, 0xC0A1 /* 馈 */,
0xF073 /* 餾 */, 0xC1F3 /* 馏 */,
0xF074 /* 餿 */, 0xE2C8 /* 馊 */,
0xF078 /* 饃 */, 0xE2C9 /* 馍 */,
0xF07A /* 饅 */, 0xC2F8 /* 馒 */,
0xF07D /* 饈 */, 0xE2CA /* 馐 */,
0xF07E /* 饉 */, 0xE2CB /* 馑 */,
0xF081 /* 饋 */, 0xC0A1 /* 馈 */,
0xF082 /* 饌 */, 0xE2CD /* 馔 */,
0xF087 /* 饑 */, 0xBCA2 /* 饥 */,
0xF088 /* 饒 */, 0xC8C4 /* 饶 */,
0xF08B /* 饗 */, 0xF7CF /* 飨 */,
0xF090 /* 饜 */, 0xF7D0 /* 餍 */,
0xF092 /* 饞 */, 0xB2F6 /* 馋 */,
0xF152 /* 馬 */, 0xC2ED /* 马 */,
0xF153 /* 馭 */, 0xD4A6 /* 驭 */,
0xF154 /* 馮 */, 0xB7EB /* 冯 */,
0xF157 /* 馱 */, 0xCDD4 /* 驮 */,
0xF159 /* 馳 */, 0xB3DB /* 驰 */,
0xF15A /* 馴 */, 0xD1B1 /* 驯 */,
0xF167 /* 駁 */, 0xB2B5 /* 驳 */,
0xF176 /* 駐 */, 0xD7A4 /* 驻 */,
0xF177 /* 駑 */, 0xE6E5 /* 驽 */,
0xF178 /* 駒 */, 0xBED4 /* 驹 */,
0xF17A /* 駔 */, 0xE6E0 /* 驵 */,
0xF17B /* 駕 */, 0xBCDD /* 驾 */,
0xF17E /* 駘 */, 0xE6E6 /* 骀 */,
0xF180 /* 駙 */, 0xE6E2 /* 驸 */,
0xF182 /* 駛 */, 0xCABB /* 驶 */,
0xF184 /* 駝 */, 0xCDD5 /* 驼 */,
0xF186 /* 駟 */, 0xE6E1 /* 驷 */,
0xF189 /* 駢 */, 0xE6E9 /* 骈 */,
0xF194 /* 駭 */, 0xBAA7 /* 骇 */,
0xF198 /* 駱 */, 0xC2E6 /* 骆 */,
0xF245 /* 駿 */, 0xBFA5 /* 骏 */,
0xF247 /* 騁 */, 0xB3D2 /* 骋 */,
0xF249 /* 騃 */, 0xB4F4 /* 呆 */,
0xF24B /* 騅 */, 0xE6ED /* 骓 */,
0xF253 /* 騍 */, 0xE6EC /* 骒 */,
0xF254 /* 騎 */, 0xC6EF /* 骑 */,
0xF255 /* 騏 */, 0xE6EB /* 骐 */,
0xF25C /* 騖 */, 0xE6F0 /* 骛 */,
0xF25F /* 騙 */, 0xC6AD /* 骗 */,
0xF269 /* 騣 */, 0xD7D7 /* 鬃 */,
0xF271 /* 騫 */, 0xE5B9 /* 骞 */,
0xF273 /* 騭 */, 0xE6EF /* 骘 */,
0xF274 /* 騮 */, 0xE6F2 /* 骝 */,
0xF276 /* 騰 */, 0xCCDA /* 腾 */,
0xF27C /* 騶 */, 0xE6E3 /* 驺 */,
0xF27D /* 騷 */, 0xC9A7 /* 骚 */,
0xF27E /* 騸 */, 0xE6F3 /* 骟 */,
0xF285 /* 騾 */, 0xC2E2 /* 骡 */,
0xF287 /* 驀 */, 0xDDEB /* 蓦 */,
0xF288 /* 驁 */, 0xE6F1 /* 骜 */,
0xF289 /* 驂 */, 0xE6EE /* 骖 */,
0xF28A /* 驃 */, 0xE6F4 /* 骠 */,
0xF28B /* 驄 */, 0xE6F5 /* 骢 */,
0xF28C /* 驅 */, 0xC7FD /* 驱 */,
0xF291 /* 驊 */, 0xE6E8 /* 骅 */,
0xF294 /* 驍 */, 0xE6E7 /* 骁 */,
0xF296 /* 驏 */, 0xE6F6 /* 骣 */,
0xF29C /* 驕 */, 0xBDBE /* 骄 */,
0xF29E /* 驗 */, 0xD1E9 /* 验 */,
0xF340 /* 驚 */, 0xBEAA /* 惊 */,
0xF341 /* 驛 */, 0xE6E4 /* 驿 */,
0xF345 /* 驟 */, 0xD6E8 /* 骤 */,
0xF348 /* 驢 */, 0xC2BF /* 驴 */,
0xF34A /* 驤 */, 0xE6F8 /* 骧 */,
0xF34B /* 驥 */, 0xE6F7 /* 骥 */,
0xF350 /* 驪 */, 0xE6EA /* 骊 */,
0xF361 /* 骯 */, 0xB0B9 /* 肮 */,
0xF369 /* 骾 */, 0xF6E1 /* 鲠 */,
0xF374 /* 髏 */, 0xF7C3 /* 髅 */,
0xF376 /* 髒 */, 0xD4E0 /* 脏 */,
0xF377 /* 體 */, 0xCCE5 /* 体 */,
0xF378 /* 髕 */, 0xF7C6 /* 髌 */,
0xF379 /* 髖 */, 0xF7C5 /* 髋 */,
0xF38C /* 髮 */, 0xB7A2 /* 发 */,
0xF3A0 /* 鬆 */, 0xCBC9 /* 松 */,
0xF445 /* 鬍 */, 0xBAFA /* 胡 */,
0xF450 /* 鬚 */, 0xD0EB /* 须 */,
0xF457 /* 鬢 */, 0xF7DE /* 鬓 */,
0xF459 /* 鬥 */, 0xB6B7 /* 斗 */,
0xF45B /* 鬧 */, 0xC4D6 /* 闹 */,
0xF45C /* 鬨 */, 0xBAE5 /* 哄 */,
0xF45D /* 鬩 */, 0xE3D2 /* 阋 */,
0xF462 /* 鬮 */, 0xE3CE /* 阄 */,
0xF464 /* 鬱 */, 0xD3F4 /* 郁 */,
0xF475 /* 魎 */, 0xF7CB /* 魉 */,
0xF47C /* 魘 */, 0xF7CA /* 魇 */,
0xF47E /* 魚 */, 0xD3E3 /* 鱼 */,
0xF494 /* 魯 */, 0xC2B3 /* 鲁 */,
0xF499 /* 魴 */, 0xF6D0 /* 鲂 */,
0xF49C /* 魷 */, 0xF6CF /* 鱿 */,
0xF554 /* 鮐 */, 0xF6D8 /* 鲐 */,
0xF555 /* 鮑 */, 0xB1AB /* 鲍 */,
0xF556 /* 鮒 */, 0xF6D6 /* 鲋 */,
0xF55E /* 鮚 */, 0xF6DA /* 鲒 */,
0xF562 /* 鮞 */, 0xF6DC /* 鲕 */,
0xF56E /* 鮪 */, 0xF6DB /* 鲔 */,
0xF56F /* 鮫 */, 0xF6DE /* 鲛 */,
0xF571 /* 鮭 */, 0xF6D9 /* 鲑 */,
0xF572 /* 鮮 */, 0xCFCA /* 鲜 */,
0xF585 /* 鯀 */, 0xF6E7 /* 鲧 */,
0xF586 /* 鯁 */, 0xF6E1 /* 鲠 */,
0xF58C /* 鯇 */, 0xF6E9 /* 鲩 */,
0xF58D /* 鯈 */, 0xF6E6 /* 鲦 */,
0xF58E /* 鯉 */, 0xC0F0 /* 鲤 */,
0xF58F /* 鯊 */, 0xF6E8 /* 鲨 */,
0xF599 /* 鯔 */, 0xF6F6 /* 鲻 */,
0xF59B /* 鯖 */, 0xF6EB /* 鲭 */,
0xF5A0 /* 鯛 */, 0xF6F4 /* 鲷 */,
0xF645 /* 鯡 */, 0xF6EE /* 鲱 */,
0xF646 /* 鯢 */, 0xF6F2 /* 鲵 */,
0xF648 /* 鯤 */, 0xF6EF /* 鲲 */,
0xF64B /* 鯧 */, 0xF6F0 /* 鲳 */,
0xF64C /* 鯨 */, 0xBEA8 /* 鲸 */,
0xF64E /* 鯪 */, 0xF6EC /* 鲮 */,
0xF64F /* 鯫 */, 0xF6ED /* 鲰 */,
0xF654 /* 鯰 */, 0xF6F3 /* 鲶 */,
0xF661 /* 鯽 */, 0xF6EA /* 鲫 */,
0xF66C /* 鰈 */, 0xF6F8 /* 鲽 */,
0xF66D /* 鰉 */, 0xF6FC /* 鳇 */,
0xF671 /* 鰍 */, 0xF6FA /* 鳅 */,
0xF676 /* 鰒 */, 0xF6FB /* 鳆 */,
0xF677 /* 鰓 */, 0xC8FA /* 鳃 */,
0xF688 /* 鰣 */, 0xF6E5 /* 鲥 */,
0xF68A /* 鰥 */, 0xF7A4 /* 鳏 */,
0xF68D /* 鰨 */, 0xF7A3 /* 鳎 */,
0xF68E /* 鰩 */, 0xF7A5 /* 鳐 */,
0xF692 /* 鰭 */, 0xF7A2 /* 鳍 */,
0xF696 /* 鰱 */, 0xF6E3 /* 鲢 */,
0xF697 /* 鰲 */, 0xF7A1 /* 鳌 */,
0xF698 /* 鰳 */, 0xF7A6 /* 鳓 */,
0xF69C /* 鰷 */, 0xF6E6 /* 鲦 */,
0xF69E /* 鰹 */, 0xF6E4 /* 鲣 */,
0xF6A0 /* 鰻 */, 0xF7A9 /* 鳗 */,
0xF742 /* 鰾 */, 0xF7A7 /* 鳔 */,
0xF74C /* 鱈 */, 0xF7A8 /* 鳕 */,
0xF74D /* 鱉 */, 0xB1EE /* 鳖 */,
0xF756 /* 鱒 */, 0xF7AE /* 鳟 */,
0xF758 /* 鱔 */, 0xF7AD /* 鳝 */,
0xF75A /* 鱖 */, 0xF7AC /* 鳜 */,
0xF75B /* 鱗 */, 0xC1DB /* 鳞 */,
0xF75C /* 鱘 */, 0xF6E0 /* 鲟 */,
0xF763 /* 鱟 */, 0xF6D7 /* 鲎 */,
0xF76B /* 鱧 */, 0xF7AF /* 鳢 */,
0xF771 /* 鱭 */, 0xF6DD /* 鲚 */,
0xF77B /* 鱷 */, 0xF6F9 /* 鳄 */,
0xF77C /* 鱸 */, 0xF6D4 /* 鲈 */,
0xF77E /* 鱺 */, 0xF6E2 /* 鲡 */,
0xF842 /* 鳥 */, 0xC4F1 /* 鸟 */,
0xF844 /* 鳧 */, 0xD9EC /* 凫 */,
0xF846 /* 鳩 */, 0xF0AF /* 鸠 */,
0xF850 /* 鳳 */, 0xB7EF /* 凤 */,
0xF851 /* 鳴 */, 0xC3F9 /* 鸣 */,
0xF853 /* 鳶 */, 0xF0B0 /* 鸢 */,
0xF863 /* 鴆 */, 0xF0B2 /* 鸩 */,
0xF864 /* 鴇 */, 0xF0B1 /* 鸨 */,
0xF865 /* 鴈 */, 0xD1E3 /* 雁 */,
0xF866 /* 鴉 */, 0xD1BB /* 鸦 */,
0xF872 /* 鴕 */, 0xCDD2 /* 鸵 */,
0xF878 /* 鴛 */, 0xD4A7 /* 鸳 */,
0xF87A /* 鴝 */, 0xF0B6 /* 鸲 */,
0xF87C /* 鴟 */, 0xF0B7 /* 鸱 */,
0xF881 /* 鴣 */, 0xF0B3 /* 鸪 */,
0xF884 /* 鴦 */, 0xD1EC /* 鸯 */,
0xF886 /* 鴨 */, 0xD1BC /* 鸭 */,
0xF88D /* 鴯 */, 0xF0B9 /* 鸸 */,
0xF88E /* 鴰 */, 0xF0BB /* 鸹 */,
0xF899 /* 鴻 */, 0xBAE8 /* 鸿 */,
0xF89D /* 鴿 */, 0xB8EB /* 鸽 */,
0xF8A0 /* 鵂 */, 0xF0BC /* 鸺 */,
0xF94E /* 鵑 */, 0xBEE9 /* 鹃 */,
0xF94F /* 鵒 */, 0xF0C1 /* 鹆 */,
0xF950 /* 鵓 */, 0xF0BE /* 鹁 */,
0xF959 /* 鵜 */, 0xF0C3 /* 鹈 */,
0xF95A /* 鵝 */, 0xB6EC /* 鹅 */,
0xF95D /* 鵠 */, 0xF0C0 /* 鹄 */,
0xF95E /* 鵡 */, 0xF0C4 /* 鹉 */,
0xF967 /* 鵪 */, 0xF0C6 /* 鹌 */,
0xF969 /* 鵬 */, 0xC5F4 /* 鹏 */,
0xF96C /* 鵯 */, 0xF0C7 /* 鹎 */,
0xF96D /* 鵰 */, 0xB5F1 /* 雕 */,
0xF96F /* 鵲 */, 0xC8B5 /* 鹊 */,
0xF985 /* 鶇 */, 0xF0B4 /* 鸫 */,
0xF987 /* 鶉 */, 0xF0C8 /* 鹑 */,
0xF996 /* 鶘 */, 0xF0C9 /* 鹕 */,
0xF998 /* 鶚 */, 0xF0CA /* 鹗 */,
0xFA46 /* 鶩 */, 0xF0CD /* 鹜 */,
0xFA4C /* 鶯 */, 0xDDBA /* 莺 */,
0xFA4E /* 鶱 */, 0xE5B9 /* 骞 */,
0xFA51 /* 鶴 */, 0xBAD7 /* 鹤 */,
0xFA58 /* 鶻 */, 0xF7BD /* 鹘 */,
0xFA59 /* 鶼 */, 0xF0CF /* 鹣 */,
0xFA5C /* 鶿 */, 0xF0CB /* 鹚 */,
0xFA5F /* 鷂 */, 0xF0CE /* 鹞 */,
0xFA70 /* 鷓 */, 0xF0D1 /* 鹧 */,
0xFA74 /* 鷗 */, 0xC5B8 /* 鸥 */,
0xFA76 /* 鷙 */, 0xF0BA /* 鸷 */,
0xFA77 /* 鷚 */, 0xF0D2 /* 鹨 */,
0xFA83 /* 鷥 */, 0xF0B8 /* 鸶 */,
0xFA84 /* 鷦 */, 0xF0D4 /* 鹪 */,
0xFA8D /* 鷯 */, 0xF0D3 /* 鹩 */,
0xFA90 /* 鷲 */, 0xF0D5 /* 鹫 */,
0xFA91 /* 鷳 */, 0xF0C2 /* 鹇 */,
0xFA92 /* 鷴 */, 0xF0C2 /* 鹇 */,
0xFA96 /* 鷸 */, 0xF0D6 /* 鹬 */,
0xFA97 /* 鷹 */, 0xD3A5 /* 鹰 */,
0xFA98 /* 鷺 */, 0xF0D8 /* 鹭 */,
0xFB52 /* 鸕 */, 0xF0B5 /* 鸬 */,
0xFB57 /* 鸚 */, 0xF0D0 /* 鹦 */,
0xFB58 /* 鸛 */, 0xF0D9 /* 鹳 */,
0xFB5A /* 鸝 */, 0xF0BF /* 鹂 */,
0xFB5B /* 鸞 */, 0xF0BD /* 鸾 */,
0xFB75 /* 鹵 */, 0xC2B1 /* 卤 */,
0xFB79 /* 鹹 */, 0xCFCC /* 咸 */,
0xFB7A /* 鹺 */, 0xF5BA /* 鹾 */,
0xFB7C /* 鹼 */, 0xBCEE /* 碱 */,
0xFB7D /* 鹽 */, 0xD1CE /* 盐 */,
0xFB90 /* 麗 */, 0xC0F6 /* 丽 */,
0xFB9B /* 麤 */, 0xB4D6 /* 粗 */,
0xFB9C /* 麥 */, 0xC2F3 /* 麦 */,
0xFB9F /* 麩 */, 0xF4EF /* 麸 */,
0xFC49 /* 麵 */, 0xC3E6 /* 面 */,
0xFC4E /* 麼 */, 0xC3B4 /* 么 */,
0xFC53 /* 黃 */, 0xBBC6 /* 黄 */,
0xFC5A /* 黌 */, 0xD9E4 /* 黉 */,
0xFC63 /* 點 */, 0xB5E3 /* 点 */,
0xFC68 /* 黨 */, 0xB5B3 /* 党 */,
0xFC6F /* 黲 */, 0xF7F5 /* 黪 */,
0xFC71 /* 黴 */, 0xC3B9 /* 霉 */,
0xFC74 /* 黷 */, 0xF7F2 /* 黩 */,
0xFC77 /* 黽 */, 0xF6BC /* 黾 */,
0xFC78 /* 黿 */, 0xF6BD /* 鼋 */,
0xFC81 /* 鼇 */, 0xF7A1 /* 鳌 */,
0xFC83 /* 鼉 */, 0xF6BE /* 鼍 */,
0xFC8A /* 鼕 */, 0xB6AC /* 冬 */,
0xFD42 /* 鼴 */, 0xF7FA /* 鼹 */,
0xFD52 /* 齊 */, 0xC6EB /* 齐 */,
0xFD53 /* 齋 */, 0xD5AB /* 斋 */,
0xFD57 /* 齏 */, 0xECB4 /* 齑 */,
0xFD58 /* 齒 */, 0xB3DD /* 齿 */,
0xFD5A /* 齔 */, 0xF6B3 /* 龀 */,
0xFD5F /* 齙 */, 0xF6B5 /* 龅 */,
0xFD62 /* 齜 */, 0xF6B7 /* 龇 */,
0xFD65 /* 齟 */, 0xF6B4 /* 龃 */,
0xFD66 /* 齠 */, 0xF6B6 /* 龆 */,
0xFD67 /* 齡 */, 0xC1E4 /* 龄 */,
0xFD69 /* 齣 */, 0xB3F6 /* 出 */,
0xFD6C /* 齦 */, 0xF6B8 /* 龈 */,
0xFD6D /* 齧 */, 0xC4F6 /* 啮 */,
0xFD70 /* 齪 */, 0xF6BA /* 龊 */,
0xFD72 /* 齬 */, 0xF6B9 /* 龉 */,
0xFD78 /* 齲 */, 0xC8A3 /* 龋 */,
0xFD7C /* 齶 */, 0xEBF1 /* 腭 */,
0xFD7D /* 齷 */, 0xF6BB /* 龌 */,
0xFD88 /* 龍 */, 0xC1FA /* 龙 */,
0xFD8B /* 龐 */, 0xC5D3 /* 庞 */,
0xFD8F /* 龔 */, 0xB9A8 /* 龚 */,
0xFD90 /* 龕 */, 0xEDE8 /* 龛 */,
0xFD94 /* 龜 */, 0xB9EA /* 龟 */,
0xFD98 /* 龢 */, 0xBACD /* 和 */, // }}}
};
static const unsigned short _gbk2utf16_2[] =
{
0x8140, 0x4E02, // {{{
0x8144, 0x4E0F,
0x8145, 0x4E12,
0x8146, 0x4E17,
0x814A, 0x4E23,
0x814B, 0x4E26,
0x814C, 0x4E29,
0x814F, 0x4E31,
0x8150, 0x4E33,
0x8151, 0x4E35,
0x8152, 0x4E37,
0x8153, 0x4E3C,
0x8157, 0x4E44,
0x8158, 0x4E46,
0x8159, 0x4E4A,
0x815A, 0x4E51,
0x815B, 0x4E55,
0x815C, 0x4E57,
0x816B, 0x4E72,
0x817D, 0x4E87,
0x817E, 0x4E8A,
0x8180, 0x4E90,
0x8183, 0x4E99,
0x8187, 0x4EA3,
0x8188, 0x4EAA,
0x818C, 0x4EB4,
0x8194, 0x4EC8,
0x8195, 0x4ECC,
0x8198, 0x4ED2,
0x819C, 0x4EE0,
0x819D, 0x4EE2,
0x81A0, 0x4EE9,
0x81A4, 0x4EF1,
0x81A5, 0x4EF4,
0x81A9, 0x4EFC,
0x81AA, 0x4EFE,
0x81AB, 0x4F00,
0x81BC, 0x4F21,
0x81BD, 0x4F23,
0x81C3, 0x4F31,
0x81C4, 0x4F33,
0x81C5, 0x4F35,
0x81C6, 0x4F37,
0x81C7, 0x4F39,
0x81C8, 0x4F3B,
0x81D6, 0x4F52,
0x81D7, 0x4F54,
0x81D8, 0x4F56,
0x81DB, 0x4F66,
0x81DC, 0x4F68,
0x81E3, 0x4F75,
0x81E8, 0x4F7D,
0x81EF, 0x4F8A,
0x81F0, 0x4F8C,
0x81F1, 0x4F8E,
0x81F2, 0x4F90,
0x81FA, 0x4F9C,
0x8240, 0x4FA4,
0x8241, 0x4FAB,
0x8242, 0x4FAD,
0x8260, 0x4FD9,
0x8261, 0x4FDB,
0x8262, 0x4FE0,
0x8263, 0x4FE2,
0x8266, 0x4FE7,
0x8269, 0x4FF0,
0x826A, 0x4FF2,
0x826F, 0x4FF9,
0x8280, 0x500B,
0x8281, 0x500E,
0x8284, 0x5013,
0x8288, 0x501B,
0x828B, 0x5020,
0x828F, 0x5027,
0x8290, 0x502B,
0x829C, 0x503B,
0x829D, 0x503D,
0x82A8, 0x504D,
0x82B2, 0x505B,
0x82EE, 0x50A4,
0x82EF, 0x50A6,
0x82FE, 0x50BC,
0x836E, 0x50F4,
0x837E, 0x5108,
0x83B3, 0x5142,
0x83B4, 0x5147,
0x83B5, 0x514A,
0x83B6, 0x514C,
0x83BF, 0x515B,
0x83CB, 0x516F,
0x83CC, 0x5172,
0x83CD, 0x517A,
0x83DC, 0x5198,
0x83DD, 0x519A,
0x83E1, 0x51A1,
0x83E2, 0x51A3,
0x83EA, 0x51B4,
0x83F3, 0x51C5,
0x83F4, 0x51C8,
0x83F5, 0x51CA,
0x83F8, 0x51D0,
0x8443, 0x51DC,
0x844E, 0x51EC,
0x844F, 0x51EE,
0x8452, 0x51F4,
0x8453, 0x51F7,
0x8454, 0x51FE,
0x8457, 0x5209,
0x845F, 0x521C,
0x8468, 0x522A,
0x8469, 0x522C,
0x846A, 0x522F,
0x846F, 0x523C,
0x8470, 0x523E,
0x8477, 0x524B,
0x847C, 0x5255,
0x8483, 0x525D,
0x8489, 0x5266,
0x848A, 0x5268,
0x849B, 0x527E,
0x849C, 0x5280,
0x84B2, 0x529C,
0x84CA, 0x52C8,
0x84CB, 0x52CA,
0x84D0, 0x52D1,
0x84D4, 0x52D7,
0x84F9, 0x5307,
0x84FE, 0x530E,
0x8544, 0x5318,
0x8549, 0x5322,
0x855E, 0x5340,
0x855F, 0x5342,
0x8560, 0x5344,
0x8561, 0x5346,
0x8565, 0x5350,
0x8566, 0x5354,
0x8569, 0x535B,
0x856A, 0x535D,
0x856B, 0x5365,
0x856C, 0x5368,
0x856D, 0x536A,
0x8570, 0x5372,
0x8571, 0x5376,
0x8572, 0x5379,
0x8579, 0x5383,
0x857C, 0x538A,
0x8587, 0x5399,
0x858A, 0x539E,
0x858D, 0x53A4,
0x858E, 0x53A7,
0x85A1, 0x53C0,
0x85AC, 0x53D5,
0x85AD, 0x53DA,
0x85B3, 0x53E7,
0x85B4, 0x53F4,
0x85B5, 0x53FA,
0x85B9, 0x5402,
0x85BA, 0x5405,
0x85BB, 0x5407,
0x85BC, 0x540B,
0x85BD, 0x5414,
0x85C1, 0x541C,
0x85C2, 0x5422,
0x85C5, 0x542A,
0x85C6, 0x5430,
0x85C7, 0x5433,
0x85CA, 0x543A,
0x85CB, 0x543D,
0x85CC, 0x543F,
0x85D1, 0x5447,
0x85D2, 0x5449,
0x85D7, 0x5451,
0x85D8, 0x545A,
0x85DE, 0x5463,
0x85DF, 0x5465,
0x85E0, 0x5467,
0x85E9, 0x5474,
0x85EE, 0x5481,
0x85EF, 0x5483,
0x85F0, 0x5485,
0x85F5, 0x548D,
0x85F6, 0x5491,
0x85F7, 0x5493,
0x85FA, 0x549C,
0x8640, 0x54A2,
0x8641, 0x54A5,
0x8642, 0x54AE,
0x8643, 0x54B0,
0x8644, 0x54B2,
0x864A, 0x54BC,
0x864B, 0x54BE,
0x864C, 0x54C3,
0x864D, 0x54C5,
0x8650, 0x54D6,
0x8651, 0x54D8,
0x8652, 0x54DB,
0x8663, 0x54FB,
0x8664, 0x54FE,
0x8665, 0x5500,
0x866A, 0x5508,
0x867C, 0x5521,
0x8682, 0x552B,
0x8683, 0x552D,
0x8684, 0x5532,
0x868C, 0x553D,
0x868D, 0x5540,
0x868E, 0x5542,
0x868F, 0x5545,
0x86A8, 0x556B,
0x86B1, 0x557D,
0x86B2, 0x557F,
0x86B8, 0x5590,
0x86C0, 0x559E,
0x86D1, 0x55B2,
0x86D2, 0x55B4,
0x86D3, 0x55B6,
0x86D4, 0x55B8,
0x86D5, 0x55BA,
0x86D6, 0x55BC,
0x86E4, 0x55D5,
0x86EA, 0x55DE,
0x86EB, 0x55E0,
0x86EC, 0x55E2,
0x86ED, 0x55E7,
0x86EE, 0x55E9,
0x86F3, 0x55F4,
0x86F4, 0x55F6,
0x86FA, 0x55FF,
0x8744, 0x560D,
0x875D, 0x5633,
0x875E, 0x5635,
0x8761, 0x563A,
0x8780, 0x5663,
0x87E1, 0x56DC,
0x87E2, 0x56E3,
0x87E9, 0x56EC,
0x87F6, 0x5705,
0x87F7, 0x5707,
0x8853, 0x572B,
0x885D, 0x573F,
0x885E, 0x5741,
0x8865, 0x574B,
0x886F, 0x5765,
0x8870, 0x5767,
0x8871, 0x576C,
0x8872, 0x576E,
0x8880, 0x5781,
0x8895, 0x57A5,
0x8896, 0x57A8,
0x8897, 0x57AA,
0x8898, 0x57AC,
0x889C, 0x57B3,
0x88B4, 0x57D3,
0x88B9, 0x57DE,
0x88C5, 0x57EE,
0x88D1, 0x5801,
0x88D8, 0x580C,
0x88E6, 0x581F,
0x8976, 0x587F,
0x8977, 0x5882,
0x8978, 0x5884,
0x89D0, 0x58ED,
0x89D1, 0x58EF,
0x89E0, 0x5903,
0x89E8, 0x590E,
0x89EF, 0x591B,
0x89F6, 0x5926,
0x89F7, 0x5928,
0x89F8, 0x592C,
0x89F9, 0x5930,
0x89FE, 0x593B,
0x8A44, 0x5943,
0x8A47, 0x594A,
0x8A4A, 0x5950,
0x8A4D, 0x5959,
0x8A53, 0x5961,
0x8A63, 0x5975,
0x8A64, 0x5977,
0x8A6B, 0x5985,
0x8A6C, 0x5989,
0x8A75, 0x5998,
0x8A7E, 0x59A6,
0x8A80, 0x59A7,
0x8A8B, 0x59BA,
0x8A9E, 0x59D9,
0x8A9F, 0x59DB,
0x8AA5, 0x59E4,
0x8AB7, 0x59FA,
0x8ABB, 0x5A00,
0x8ABC, 0x5A02,
0x8AC3, 0x5A12,
0x8ACF, 0x5A24,
0x8ADA, 0x5A33,
0x8ADB, 0x5A35,
0x8B40, 0x5A61,
0x8B85, 0x5AB4,
0x8B9C, 0x5AD3,
0x8B9D, 0x5AD5,
0x8B9E, 0x5AD7,
0x8BA5, 0x5AE2,
0x8BAA, 0x5AEA,
0x8BED, 0x5B33,
0x8C48, 0x5B52,
0x8C49, 0x5B56,
0x8C4A, 0x5B5E,
0x8C4F, 0x5B6B,
0x8C53, 0x5B72,
0x8C54, 0x5B74,
0x8C5D, 0x5B82,
0x8C5E, 0x5B86,
0x8C5F, 0x5B8A,
0x8C65, 0x5B94,
0x8C66, 0x5B96,
0x8C67, 0x5B9F,
0x8C71, 0x5BB7,
0x8C77, 0x5BC3,
0x8C80, 0x5BD1,
0x8C8A, 0x5BE0,
0x8C94, 0x5BEF,
0x8C9E, 0x5C00,
0x8CA1, 0x5C05,
0x8CA8, 0x5C10,
0x8CAB, 0x5C17,
0x8CAC, 0x5C19,
0x8CAD, 0x5C1B,
0x8CB2, 0x5C23,
0x8CB3, 0x5C26,
0x8CD1, 0x5C5F,
0x8CD2, 0x5C62,
0x8CD3, 0x5C64,
0x8CDB, 0x5C70,
0x8CE7, 0x5C80,
0x8CF4, 0x5C95,
0x8D40, 0x5CAA,
0x8D44, 0x5CB2,
0x8D45, 0x5CB4,
0x8D46, 0x5CB6,
0x8D4B, 0x5CBE,
0x8D4C, 0x5CC0,
0x8D6A, 0x5CE7,
0x8D6B, 0x5CE9,
0x8D80, 0x5D01,
0x8D8E, 0x5D15,
0x8D9A, 0x5D25,
0x8D9B, 0x5D28,
0x8DC3, 0x5D5C,
0x8DCF, 0x5D6A,
0x8E77, 0x5DDC,
0x8E7C, 0x5DEA,
0x8E80, 0x5DF0,
0x8E8A, 0x5E04,
0x8E8B, 0x5E07,
0x8E93, 0x5E17,
0x8EAE, 0x5E43,
0x8ED4, 0x5E75,
0x8ED5, 0x5E77,
0x8ED6, 0x5E79,
0x8ED7, 0x5E7E,
0x8EDB, 0x5E85,
0x8EE1, 0x5E92,
0x8EE2, 0x5E98,
0x8EE3, 0x5E9B,
0x8EE4, 0x5E9D,
0x8EF3, 0x5EB4,
0x8F5B, 0x5EE9,
0x8F65, 0x5EF5,
0x8F6E, 0x5F09,
0x8F72, 0x5F10,
0x8F73, 0x5F12,
0x8F74, 0x5F14,
0x8F75, 0x5F16,
0x8F80, 0x5F28,
0x8F83, 0x5F2E,
0x8F84, 0x5F30,
0x8F8C, 0x5F3B,
0x8F9F, 0x5F51,
0x8FA0, 0x5F54,
0x8FA8, 0x5F63,
0x8FA9, 0x5F65,
0x8FAC, 0x5F6B,
0x8FAF, 0x5F72,
0x8FB3, 0x5F78,
0x8FB4, 0x5F7A,
0x8FB8, 0x5F83,
0x8FB9, 0x5F86,
0x8FBD, 0x5F91,
0x8FC0, 0x5F96,
0x8FCD, 0x5FA9,
0x8FD6, 0x5FB6,
0x8FE4, 0x5FCE,
0x8FF3, 0x5FEC,
0x8FFD, 0x5FFC,
0x8FFE, 0x6007,
0x9046, 0x6013,
0x9049, 0x601A,
0x905E, 0x6040,
0x9066, 0x604C,
0x9069, 0x6051,
0x9077, 0x606E,
0x907C, 0x6077,
0x907D, 0x607E,
0x907E, 0x6080,
0x908C, 0x6093,
0x908D, 0x6095,
0x9091, 0x609C,
0x9092, 0x609E,
0x9097, 0x60A7,
0x909A, 0x60AE,
0x909B, 0x60B0,
0x909C, 0x60B3,
0x90B7, 0x60D9,
0x90B8, 0x60DB,
0x90B9, 0x60DE,
0x90BF, 0x60EA,
0x90C2, 0x60F5,
0x90CE, 0x6107,
0x90E1, 0x6125,
0x9140, 0x6147,
0x9141, 0x6149,
0x9142, 0x614B,
0x9143, 0x614D,
0x9163, 0x6176,
0x917E, 0x6195,
0x91AA, 0x61C9,
0x91B0, 0x61D3,
0x91DF, 0x6207,
0x91E0, 0x6209,
0x91E3, 0x6219,
0x91E7, 0x6220,
0x91E8, 0x6223,
0x91ED, 0x622B,
0x91EE, 0x622D,
0x91FA, 0x6242,
0x91FE, 0x624A,
0x9250, 0x6268,
0x9259, 0x627D,
0x9267, 0x6294,
0x9268, 0x6299,
0x926C, 0x62A3,
0x927B, 0x62BA,
0x927C, 0x62BE,
0x9280, 0x62C3,
0x9281, 0x62CB,
0x9282, 0x62CF,
0x9283, 0x62D1,
0x9284, 0x62D5,
0x9289, 0x62E4,
0x928C, 0x62F0,
0x928D, 0x62F2,
0x928E, 0x62F5,
0x9293, 0x6300,
0x92A5, 0x631C,
0x92A8, 0x6329,
0x92BA, 0x6344,
0x92BD, 0x634A,
0x92CA, 0x6360,
0x92CE, 0x6368,
0x92DE, 0x6381,
0x92E3, 0x638B,
0x92E4, 0x638D,
0x92E5, 0x6391,
0x92E9, 0x6397,
0x92F1, 0x63A1,
0x92F2, 0x63A4,
0x92F3, 0x63A6,
0x92F4, 0x63AB,
0x92F5, 0x63AF,
0x92FA, 0x63B9,
0x92FB, 0x63BB,
0x92FC, 0x63BD,
0x9343, 0x63C5,
0x9349, 0x63D1,
0x9354, 0x63DF,
0x9355, 0x63E2,
0x9361, 0x63F3,
0x9362, 0x63F5,
0x9363, 0x63F7,
0x9368, 0x63FE,
0x937A, 0x641D,
0x937B, 0x641F,
0x9380, 0x6425,
0x9384, 0x642B,
0x9392, 0x643E,
0x9393, 0x6440,
0x9396, 0x6449,
0x939E, 0x6453,
0x93AF, 0x6468,
0x93C4, 0x6483,
0x93C5, 0x6486,
0x93E2, 0x64AF,
0x93E7, 0x64B6,
0x93E8, 0x64B9,
0x93E9, 0x64BB,
0x93ED, 0x64C1,
0x93F7, 0x64CF,
0x93F8, 0x64D1,
0x9446, 0x64E3,
0x9447, 0x64E5,
0x948E, 0x6537,
0x948F, 0x653A,
0x949D, 0x6550,
0x94A3, 0x655A,
0x94A4, 0x655C,
0x94B1, 0x6571,
0x94B2, 0x6573,
0x94CA, 0x6592,
0x94CE, 0x6598,
0x94CF, 0x659A,
0x94D2, 0x65A0,
0x94D5, 0x65A6,
0x94D6, 0x65A8,
0x94D7, 0x65AA,
0x94D8, 0x65AC,
0x94D9, 0x65AE,
0x94E7, 0x65C2,
0x94EC, 0x65CD,
0x94FA, 0x65E1,
0x954B, 0x6601,
0x9551, 0x660B,
0x9552, 0x660D,
0x955C, 0x661E,
0x9561, 0x6626,
0x9566, 0x662E,
0x9567, 0x6630,
0x956F, 0x663D,
0x9572, 0x6642,
0x957E, 0x6658,
0x9580, 0x6659,
0x9585, 0x6660,
0x9588, 0x6665,
0x9589, 0x6667,
0x9592, 0x6675,
0x959B, 0x6683,
0x95E4, 0x66DA,
0x95F5, 0x66F1,
0x95F8, 0x66F8,
0x95FB, 0x66FD,
0x9644, 0x670C,
0x964A, 0x6716,
0x964E, 0x671C,
0x964F, 0x671E,
0x9656, 0x6727,
0x9657, 0x6729,
0x9658, 0x672E,
0x9659, 0x6730,
0x9664, 0x6741,
0x9667, 0x6747,
0x966A, 0x674D,
0x966B, 0x6752,
0x9673, 0x675D,
0x967B, 0x676E,
0x967C, 0x6771,
0x967D, 0x6774,
0x967E, 0x6776,
0x9684, 0x677D,
0x9685, 0x6780,
0x968A, 0x6788,
0x968B, 0x678A,
0x9694, 0x6796,
0x9695, 0x6799,
0x9696, 0x679B,
0x969A, 0x67A4,
0x969B, 0x67A6,
0x969C, 0x67A9,
0x969D, 0x67AC,
0x969E, 0x67AE,
0x96A1, 0x67B4,
0x96AA, 0x67C2,
0x96B8, 0x67DB,
0x96B9, 0x67DF,
0x96BA, 0x67E1,
0x96C4, 0x67F2,
0x96CD, 0x67FE,
0x96D2, 0x6806,
0x96D3, 0x680D,
0x96D4, 0x6810,
0x96D5, 0x6812,
0x96F3, 0x683F,
0x96F4, 0x6847,
0x96F5, 0x684B,
0x96F6, 0x684D,
0x96F7, 0x684F,
0x96F8, 0x6852,
0x9744, 0x686A,
0x974D, 0x6875,
0x9757, 0x6882,
0x9758, 0x6884,
0x9778, 0x68AE,
0x977B, 0x68B4,
0x9787, 0x68C1,
0x978E, 0x68CA,
0x978F, 0x68CC,
0x9798, 0x68D9,
0x97AA, 0x68EF,
0x97B1, 0x68FB,
0x97BE, 0x690C,
0x97BF, 0x690F,
0x97C0, 0x6911,
0x97E4, 0x693E,
0x97FE, 0x695F,
0x9856, 0x6981,
0x9857, 0x6983,
0x9858, 0x6985,
0x9872, 0x69AC,
0x988B, 0x69CB,
0x988C, 0x69CD,
0x988D, 0x69CF,
0x98B4, 0x69FE,
0x98D1, 0x6A20,
0x98D8, 0x6A29,
0x98DD, 0x6A30,
0x98FE, 0x6A5A,
0x996B, 0x6A8F,
0x9982, 0x6AAA,
0x9A47, 0x6B38,
0x9A51, 0x6B48,
0x9A78, 0x6B7A,
0x9A7D, 0x6B85,
0x9A7E, 0x6B88,
0x9A80, 0x6B8C,
0x9A9F, 0x6BB6,
0x9AA7, 0x6BC0,
0x9AAF, 0x6BCC,
0x9AB0, 0x6BCE,
0x9AB3, 0x6BD8,
0x9AB4, 0x6BDA,
0x9AC8, 0x6BF4,
0x9ADB, 0x6C0E,
0x9ADC, 0x6C12,
0x9ADD, 0x6C17,
0x9AE1, 0x6C20,
0x9AE2, 0x6C23,
0x9AE3, 0x6C25,
0x9AE7, 0x6C31,
0x9AE8, 0x6C33,
0x9AF4, 0x6C48,
0x9AFD, 0x6C56,
0x9AFE, 0x6C58,
0x9B4C, 0x6C71,
0x9B4D, 0x6C73,
0x9B4E, 0x6C75,
0x9B56, 0x6C84,
0x9B57, 0x6C87,
0x9B62, 0x6C9A,
0x9B66, 0x6CA0,
0x9B67, 0x6CA2,
0x9B68, 0x6CA8,
0x9B69, 0x6CAC,
0x9B70, 0x6CBA,
0x9B78, 0x6CCB,
0x9B7E, 0x6CD8,
0x9B84, 0x6CDF,
0x9B85, 0x6CE4,
0x9B88, 0x6CE9,
0x9B8B, 0x6CF2,
0x9B8C, 0x6CF4,
0x9B8D, 0x6CF9,
0x9B97, 0x6D0D,
0x9B9F, 0x6D18,
0x9BA8, 0x6D26,
0x9BAF, 0x6D34,
0x9BB3, 0x6D3A,
0x9BB6, 0x6D42,
0x9BB7, 0x6D44,
0x9BB8, 0x6D49,
0x9BB9, 0x6D4C,
0x9BBA, 0x6D50,
0x9BBF, 0x6D5B,
0x9BC0, 0x6D5D,
0x9BC1, 0x6D5F,
0x9BDF, 0x6D8D,
0x9BE2, 0x6D92,
0x9BE8, 0x6D9C,
0x9BE9, 0x6DA2,
0x9BEA, 0x6DA5,
0x9C48, 0x6DD7,
0x9C4C, 0x6DDF,
0x9C4F, 0x6DE5,
0x9C54, 0x6DED,
0x9C57, 0x6DF2,
0x9C5B, 0x6DF8,
0x9C5C, 0x6DFA,
0x9C69, 0x6E0B,
0x9C6A, 0x6E0F,
0x9C6D, 0x6E15,
0x9C74, 0x6E22,
0x9C78, 0x6E2A,
0x9C79, 0x6E2C,
0x9C7A, 0x6E2E,
0x9C7D, 0x6E33,
0x9C7E, 0x6E35,
0x9C82, 0x6E39,
0x9C97, 0x6E55,
0x9C98, 0x6E57,
0x9CBD, 0x6E84,
0x9CD5, 0x6EA6,
0x9CDC, 0x6EB0,
0x9CDD, 0x6EB3,
0x9CDE, 0x6EB5,
0x9CE1, 0x6EBC,
0x9CEF, 0x6ED0,
0x9CF0, 0x6ED2,
0x9CF1, 0x6ED6,
0x9CF7, 0x6EE3,
0x9CF8, 0x6EE7,
0x9D6E, 0x6F2C,
0x9D6F, 0x6F2E,
0x9D70, 0x6F30,
0x9D71, 0x6F32,
0x9D86, 0x6F4C,
0x9D94, 0x6F5D,
0x9DA4, 0x6F73,
0x9DA8, 0x6F79,
0x9DA9, 0x6F7B,
0x9DE1, 0x6FC1,
0x9DFA, 0x6FDF,
0x9EBB, 0x706E,
0x9EC0, 0x7077,
0x9EC4, 0x707D,
0x9ED2, 0x7093,
0x9EE4, 0x70B0,
0x9EE5, 0x70B2,
0x9EE9, 0x70BA,
0x9EF0, 0x70C9,
0x9EFE, 0x70DA,
0x9F47, 0x70E5,
0x9F48, 0x70EA,
0x9F49, 0x70EE,
0x9F51, 0x70F8,
0x9F67, 0x7114,
0x9F68, 0x7117,
0x9F80, 0x7135,
0x9F93, 0x714B,
0x9F94, 0x714D,
0x9FA2, 0x715D,
0x9FA8, 0x7165,
0x9FB5, 0x7179,
0x9FE3, 0x71B4,
0xA04E, 0x71E6,
0xA08C, 0x7229,
0xA08D, 0x722B,
0xA094, 0x723A,
0xA095, 0x723C,
0xA096, 0x723E,
0xA0AA, 0x725A,
0xA0AB, 0x725C,
0xA0AC, 0x725E,
0xA0AD, 0x7260,
0xA0B1, 0x7268,
0xA0C7, 0x728C,
0xA0C8, 0x728E,
0xA0E3, 0x72AE,
0xA0E7, 0x72B5,
0xA0F6, 0x72CF,
0xA0F7, 0x72D1,
0xA0FC, 0x72D8,
0xA1A4, 0x00B7,
0xA1A5, 0x02C9,
0xA1A6, 0x02C7,
0xA1A7, 0x00A8,
0xA1A8, 0x3003,
0xA1A9, 0x3005,
0xA1AA, 0x2014,
0xA1AB, 0xFF5E,
0xA1AC, 0x2016,
0xA1AD, 0x2026,
0xA1C0, 0x00B1,
0xA1C1, 0x00D7,
0xA1C2, 0x00F7,
0xA1C3, 0x2236,
0xA1C6, 0x2211,
0xA1C7, 0x220F,
0xA1C8, 0x222A,
0xA1C9, 0x2229,
0xA1CA, 0x2208,
0xA1CB, 0x2237,
0xA1CC, 0x221A,
0xA1CD, 0x22A5,
0xA1CE, 0x2225,
0xA1CF, 0x2220,
0xA1D0, 0x2312,
0xA1D1, 0x2299,
0xA1D2, 0x222B,
0xA1D3, 0x222E,
0xA1D4, 0x2261,
0xA1D5, 0x224C,
0xA1D6, 0x2248,
0xA1D7, 0x223D,
0xA1D8, 0x221D,
0xA1D9, 0x2260,
0xA1DE, 0x221E,
0xA1DF, 0x2235,
0xA1E0, 0x2234,
0xA1E1, 0x2642,
0xA1E2, 0x2640,
0xA1E3, 0x00B0,
0xA1E6, 0x2103,
0xA1E7, 0xFF04,
0xA1E8, 0x00A4,
0xA1EB, 0x2030,
0xA1EC, 0x00A7,
0xA1ED, 0x2116,
0xA1EE, 0x2606,
0xA1EF, 0x2605,
0xA1F0, 0x25CB,
0xA1F1, 0x25CF,
0xA1F2, 0x25CE,
0xA1F3, 0x25C7,
0xA1F4, 0x25C6,
0xA1F5, 0x25A1,
0xA1F6, 0x25A0,
0xA1F7, 0x25B3,
0xA1F8, 0x25B2,
0xA1F9, 0x203B,
0xA1FA, 0x2192,
0xA1FD, 0x2193,
0xA1FE, 0x3013,
0xA3A4, 0xFFE5,
0xA3FE, 0xFFE3,
0xA6F2, 0xFE31,
0xA7A7, 0x0401,
0xA7D7, 0x0451,
0xA842, 0x02D9,
0xA843, 0x2013,
0xA844, 0x2015,
0xA845, 0x2025,
0xA846, 0x2035,
0xA847, 0x2105,
0xA848, 0x2109,
0xA84D, 0x2215,
0xA84E, 0x221F,
0xA84F, 0x2223,
0xA850, 0x2252,
0xA853, 0x22BF,
0xA891, 0x2609,
0xA892, 0x2295,
0xA893, 0x3012,
0xA8A1, 0x0101,
0xA8A2, 0x00E1,
0xA8A3, 0x01CE,
0xA8A4, 0x00E0,
0xA8A5, 0x0113,
0xA8A6, 0x00E9,
0xA8A7, 0x011B,
0xA8A8, 0x00E8,
0xA8A9, 0x012B,
0xA8AA, 0x00ED,
0xA8AB, 0x01D0,
0xA8AC, 0x00EC,
0xA8AD, 0x014D,
0xA8AE, 0x00F3,
0xA8AF, 0x01D2,
0xA8B0, 0x00F2,
0xA8B1, 0x016B,
0xA8B2, 0x00FA,
0xA8B3, 0x01D4,
0xA8B4, 0x00F9,
0xA8B5, 0x01D6,
0xA8B6, 0x01D8,
0xA8B7, 0x01DA,
0xA8B8, 0x01DC,
0xA8B9, 0x00FC,
0xA8BA, 0x00EA,
0xA8BB, 0x0251,
0xA8BC, 0xE7C7,
0xA8BD, 0x0144,
0xA8BE, 0x0148,
0xA8BF, 0xE7C8,
0xA8C0, 0x0261,
0xA949, 0x32A3,
0xA94F, 0x33A1,
0xA950, 0x33C4,
0xA951, 0x33CE,
0xA954, 0x33D5,
0xA955, 0xFE30,
0xA956, 0xFFE2,
0xA957, 0xFFE4,
0xA959, 0x2121,
0xA95A, 0x3231,
0xA95C, 0x2010,
0xA960, 0x30FC,
0xA965, 0x3006,
0xA996, 0x3007,
0xAA42, 0x72DF,
0xAA4D, 0x72F9,
0xAA52, 0x7302,
0xAA60, 0x7314,
0xAA6B, 0x732D,
0xAA86, 0x7351,
0xAA9E, 0x736E,
0xAB53, 0x7388,
0xAB54, 0x738A,
0xAB6C, 0x73AA,
0xAB6F, 0x73B1,
0xAB79, 0x73C1,
0xAB82, 0x73CE,
0xAB8E, 0x73DF,
0xAB93, 0x73E6,
0xAB94, 0x73E8,
0xAC4B, 0x7404,
0xAC63, 0x7427,
0xAC64, 0x7429,
0xAC65, 0x742B,
0xAC66, 0x742D,
0xAC67, 0x742F,
0xAC87, 0x7456,
0xAC88, 0x7458,
0xAC89, 0x745D,
0xAD43, 0x747F,
0xAD44, 0x7482,
0xAD4D, 0x748F,
0xAD59, 0x749D,
0xAD93, 0x74DD,
0xAD94, 0x74DF,
0xAD95, 0x74E1,
0xAD96, 0x74E5,
0xAE40, 0x74F3,
0xAE41, 0x74F5,
0xAE55, 0x750E,
0xAE56, 0x7510,
0xAE57, 0x7512,
0xAE5C, 0x751B,
0xAE66, 0x752A,
0xAE67, 0x752E,
0xAE68, 0x7534,
0xAE69, 0x7536,
0xAE6A, 0x7539,
0xAE6D, 0x753F,
0xAE76, 0x754D,
0xAE92, 0x7573,
0xAEA0, 0x7587,
0xAF46, 0x7590,
0xAF47, 0x7593,
0xAF48, 0x7595,
0xAF49, 0x7598,
0xAF4C, 0x759E,
0xAF4D, 0x75A2,
0xAF53, 0x75AD,
0xAF5B, 0x75C6,
0xAF62, 0x75D3,
0xAF63, 0x75D7,
0xAF6B, 0x75E5,
0xAF6C, 0x75E9,
0xAF7B, 0x7602,
0xAF7C, 0x7604,
0xAF82, 0x760B,
0xAF8A, 0x7616,
0xAF8B, 0x761A,
0xAF8F, 0x7621,
0xAF90, 0x7623,
0xAF93, 0x762C,
0xAF9D, 0x763D,
0xAFA0, 0x7644,
0xB04D, 0x7655,
0xB053, 0x765D,
0xB06C, 0x767C,
0xB070, 0x7683,
0xB071, 0x7685,
0xB078, 0x7692,
0xB093, 0x76B3,
0xB0A0, 0x76C3,
0xB0A1, 0x554A,
0xB0A2, 0x963F,
0xB0A3, 0x57C3,
0xB0A4, 0x6328,
0xB0A5, 0x54CE,
0xB0A6, 0x5509,
0xB0A7, 0x54C0,
0xB0A8, 0x7691,
0xB0A9, 0x764C,
0xB0AA, 0x853C,
0xB0AB, 0x77EE,
0xB0AC, 0x827E,
0xB0AD, 0x788D,
0xB0AE, 0x7231,
0xB0AF, 0x9698,
0xB0B0, 0x978D,
0xB0B1, 0x6C28,
0xB0B2, 0x5B89,
0xB0B3, 0x4FFA,
0xB0B4, 0x6309,
0xB0B5, 0x6697,
0xB0B6, 0x5CB8,
0xB0B7, 0x80FA,
0xB0B8, 0x6848,
0xB0B9, 0x80AE,
0xB0BA, 0x6602,
0xB0BB, 0x76CE,
0xB0BC, 0x51F9,
0xB0BD, 0x6556,
0xB0BE, 0x71AC,
0xB0BF, 0x7FF1,
0xB0C0, 0x8884,
0xB0C1, 0x50B2,
0xB0C2, 0x5965,
0xB0C3, 0x61CA,
0xB0C4, 0x6FB3,
0xB0C5, 0x82AD,
0xB0C6, 0x634C,
0xB0C7, 0x6252,
0xB0C8, 0x53ED,
0xB0C9, 0x5427,
0xB0CA, 0x7B06,
0xB0CB, 0x516B,
0xB0CC, 0x75A4,
0xB0CD, 0x5DF4,
0xB0CE, 0x62D4,
0xB0CF, 0x8DCB,
0xB0D0, 0x9776,
0xB0D1, 0x628A,
0xB0D2, 0x8019,
0xB0D3, 0x575D,
0xB0D4, 0x9738,
0xB0D5, 0x7F62,
0xB0D6, 0x7238,
0xB0D7, 0x767D,
0xB0D8, 0x67CF,
0xB0D9, 0x767E,
0xB0DA, 0x6446,
0xB0DB, 0x4F70,
0xB0DC, 0x8D25,
0xB0DD, 0x62DC,
0xB0DE, 0x7A17,
0xB0DF, 0x6591,
0xB0E0, 0x73ED,
0xB0E1, 0x642C,
0xB0E2, 0x6273,
0xB0E3, 0x822C,
0xB0E4, 0x9881,
0xB0E5, 0x677F,
0xB0E6, 0x7248,
0xB0E7, 0x626E,
0xB0E8, 0x62CC,
0xB0E9, 0x4F34,
0xB0EA, 0x74E3,
0xB0EB, 0x534A,
0xB0EC, 0x529E,
0xB0ED, 0x7ECA,
0xB0EE, 0x90A6,
0xB0EF, 0x5E2E,
0xB0F0, 0x6886,
0xB0F1, 0x699C,
0xB0F2, 0x8180,
0xB0F3, 0x7ED1,
0xB0F4, 0x68D2,
0xB0F5, 0x78C5,
0xB0F6, 0x868C,
0xB0F7, 0x9551,
0xB0F8, 0x508D,
0xB0F9, 0x8C24,
0xB0FA, 0x82DE,
0xB0FB, 0x80DE,
0xB0FC, 0x5305,
0xB0FD, 0x8912,
0xB0FE, 0x5265,
0xB140, 0x76C4,
0xB141, 0x76C7,
0xB142, 0x76C9,
0xB145, 0x76D3,
0xB146, 0x76D5,
0xB159, 0x76F0,
0xB15A, 0x76F3,
0xB160, 0x76FD,
0xB167, 0x770A,
0xB168, 0x770C,
0xB178, 0x7721,
0xB17C, 0x7727,
0xB180, 0x772C,
0xB181, 0x772E,
0xB187, 0x7739,
0xB188, 0x773B,
0xB18C, 0x7742,
0xB1A0, 0x775C,
0xB1A1, 0x8584,
0xB1A2, 0x96F9,
0xB1A3, 0x4FDD,
0xB1A4, 0x5821,
0xB1A5, 0x9971,
0xB1A6, 0x5B9D,
0xB1A7, 0x62B1,
0xB1A8, 0x62A5,
0xB1A9, 0x66B4,
0xB1AA, 0x8C79,
0xB1AB, 0x9C8D,
0xB1AC, 0x7206,
0xB1AD, 0x676F,
0xB1AE, 0x7891,
0xB1AF, 0x60B2,
0xB1B0, 0x5351,
0xB1B1, 0x5317,
0xB1B2, 0x8F88,
0xB1B3, 0x80CC,
0xB1B4, 0x8D1D,
0xB1B5, 0x94A1,
0xB1B6, 0x500D,
0xB1B7, 0x72C8,
0xB1B8, 0x5907,
0xB1B9, 0x60EB,
0xB1BA, 0x7119,
0xB1BB, 0x88AB,
0xB1BC, 0x5954,
0xB1BD, 0x82EF,
0xB1BE, 0x672C,
0xB1BF, 0x7B28,
0xB1C0, 0x5D29,
0xB1C1, 0x7EF7,
0xB1C2, 0x752D,
0xB1C3, 0x6CF5,
0xB1C4, 0x8E66,
0xB1C5, 0x8FF8,
0xB1C6, 0x903C,
0xB1C7, 0x9F3B,
0xB1C8, 0x6BD4,
0xB1C9, 0x9119,
0xB1CA, 0x7B14,
0xB1CB, 0x5F7C,
0xB1CC, 0x78A7,
0xB1CD, 0x84D6,
0xB1CE, 0x853D,
0xB1CF, 0x6BD5,
0xB1D0, 0x6BD9,
0xB1D1, 0x6BD6,
0xB1D2, 0x5E01,
0xB1D3, 0x5E87,
0xB1D4, 0x75F9,
0xB1D5, 0x95ED,
0xB1D6, 0x655D,
0xB1D7, 0x5F0A,
0xB1D8, 0x5FC5,
0xB1D9, 0x8F9F,
0xB1DA, 0x58C1,
0xB1DB, 0x81C2,
0xB1DC, 0x907F,
0xB1DD, 0x965B,
0xB1DE, 0x97AD,
0xB1DF, 0x8FB9,
0xB1E0, 0x7F16,
0xB1E1, 0x8D2C,
0xB1E2, 0x6241,
0xB1E3, 0x4FBF,
0xB1E4, 0x53D8,
0xB1E5, 0x535E,
0xB1E8, 0x8FAB,
0xB1E9, 0x904D,
0xB1EA, 0x6807,
0xB1EB, 0x5F6A,
0xB1EC, 0x8198,
0xB1ED, 0x8868,
0xB1EE, 0x9CD6,
0xB1EF, 0x618B,
0xB1F0, 0x522B,
0xB1F1, 0x762A,
0xB1F2, 0x5F6C,
0xB1F3, 0x658C,
0xB1F4, 0x6FD2,
0xB1F5, 0x6EE8,
0xB1F6, 0x5BBE,
0xB1F7, 0x6448,
0xB1F8, 0x5175,
0xB1F9, 0x51B0,
0xB1FA, 0x67C4,
0xB1FB, 0x4E19,
0xB1FC, 0x79C9,
0xB1FD, 0x997C,
0xB1FE, 0x70B3,
0xB244, 0x7764,
0xB245, 0x7767,
0xB26E, 0x77A1,
0xB271, 0x77A6,
0xB272, 0x77A8,
0xB273, 0x77AB,
0xB279, 0x77B4,
0xB280, 0x77BC,
0xB281, 0x77BE,
0xB2A0, 0x77E4,
0xB2A1, 0x75C5,
0xB2A2, 0x5E76,
0xB2A3, 0x73BB,
0xB2A4, 0x83E0,
0xB2A5, 0x64AD,
0xB2A6, 0x62E8,
0xB2A7, 0x94B5,
0xB2A8, 0x6CE2,
0xB2A9, 0x535A,
0xB2AA, 0x52C3,
0xB2AB, 0x640F,
0xB2AC, 0x94C2,
0xB2AD, 0x7B94,
0xB2AE, 0x4F2F,
0xB2AF, 0x5E1B,
0xB2B0, 0x8236,
0xB2B1, 0x8116,
0xB2B2, 0x818A,
0xB2B3, 0x6E24,
0xB2B4, 0x6CCA,
0xB2B5, 0x9A73,
0xB2B6, 0x6355,
0xB2B7, 0x535C,
0xB2B8, 0x54FA,
0xB2B9, 0x8865,
0xB2BA, 0x57E0,
0xB2BB, 0x4E0D,
0xB2BC, 0x5E03,
0xB2BD, 0x6B65,
0xB2BE, 0x7C3F,
0xB2BF, 0x90E8,
0xB2C0, 0x6016,
0xB2C1, 0x64E6,
0xB2C2, 0x731C,
0xB2C3, 0x88C1,
0xB2C4, 0x6750,
0xB2C5, 0x624D,
0xB2C6, 0x8D22,
0xB2C7, 0x776C,
0xB2C8, 0x8E29,
0xB2C9, 0x91C7,
0xB2CA, 0x5F69,
0xB2CB, 0x83DC,
0xB2CC, 0x8521,
0xB2CD, 0x9910,
0xB2CE, 0x53C2,
0xB2CF, 0x8695,
0xB2D0, 0x6B8B,
0xB2D1, 0x60ED,
0xB2D2, 0x60E8,
0xB2D3, 0x707F,
0xB2D4, 0x82CD,
0xB2D5, 0x8231,
0xB2D6, 0x4ED3,
0xB2D7, 0x6CA7,
0xB2D8, 0x85CF,
0xB2D9, 0x64CD,
0xB2DA, 0x7CD9,
0xB2DB, 0x69FD,
0xB2DC, 0x66F9,
0xB2DD, 0x8349,
0xB2DE, 0x5395,
0xB2DF, 0x7B56,
0xB2E0, 0x4FA7,
0xB2E1, 0x518C,
0xB2E2, 0x6D4B,
0xB2E3, 0x5C42,
0xB2E4, 0x8E6D,
0xB2E5, 0x63D2,
0xB2E6, 0x53C9,
0xB2E7, 0x832C,
0xB2E8, 0x8336,
0xB2E9, 0x67E5,
0xB2EA, 0x78B4,
0xB2EB, 0x643D,
0xB2EC, 0x5BDF,
0xB2ED, 0x5C94,
0xB2EE, 0x5DEE,
0xB2EF, 0x8BE7,
0xB2F0, 0x62C6,
0xB2F1, 0x67F4,
0xB2F2, 0x8C7A,
0xB2F3, 0x6400,
0xB2F4, 0x63BA,
0xB2F5, 0x8749,
0xB2F6, 0x998B,
0xB2F7, 0x8C17,
0xB2F8, 0x7F20,
0xB2F9, 0x94F2,
0xB2FA, 0x4EA7,
0xB2FB, 0x9610,
0xB2FC, 0x98A4,
0xB2FD, 0x660C,
0xB2FE, 0x7316,
0xB340, 0x77E6,
0xB341, 0x77E8,
0xB342, 0x77EA,
0xB349, 0x77F7,
0xB359, 0x7813,
0xB35A, 0x7815,
0xB35B, 0x7819,
0xB35C, 0x781B,
0xB35D, 0x781E,
0xB361, 0x7824,
0xB362, 0x7828,
0xB36C, 0x783D,
0xB36D, 0x783F,
0xB372, 0x7846,
0xB377, 0x784D,
0xB378, 0x784F,
0xB379, 0x7851,
0xB3A1, 0x573A,
0xB3A2, 0x5C1D,
0xB3A3, 0x5E38,
0xB3A4, 0x957F,
0xB3A5, 0x507F,
0xB3A6, 0x80A0,
0xB3A7, 0x5382,
0xB3A8, 0x655E,
0xB3A9, 0x7545,
0xB3AA, 0x5531,
0xB3AB, 0x5021,
0xB3AC, 0x8D85,
0xB3AD, 0x6284,
0xB3AE, 0x949E,
0xB3AF, 0x671D,
0xB3B0, 0x5632,
0xB3B1, 0x6F6E,
0xB3B2, 0x5DE2,
0xB3B3, 0x5435,
0xB3B4, 0x7092,
0xB3B5, 0x8F66,
0xB3B6, 0x626F,
0xB3B7, 0x64A4,
0xB3B8, 0x63A3,
0xB3B9, 0x5F7B,
0xB3BA, 0x6F88,
0xB3BB, 0x90F4,
0xB3BC, 0x81E3,
0xB3BD, 0x8FB0,
0xB3BE, 0x5C18,
0xB3BF, 0x6668,
0xB3C0, 0x5FF1,
0xB3C1, 0x6C89,
0xB3C2, 0x9648,
0xB3C3, 0x8D81,
0xB3C4, 0x886C,
0xB3C5, 0x6491,
0xB3C6, 0x79F0,
0xB3C7, 0x57CE,
0xB3C8, 0x6A59,
0xB3C9, 0x6210,
0xB3CA, 0x5448,
0xB3CB, 0x4E58,
0xB3CC, 0x7A0B,
0xB3CD, 0x60E9,
0xB3CE, 0x6F84,
0xB3CF, 0x8BDA,
0xB3D0, 0x627F,
0xB3D1, 0x901E,
0xB3D2, 0x9A8B,
0xB3D3, 0x79E4,
0xB3D4, 0x5403,
0xB3D5, 0x75F4,
0xB3D6, 0x6301,
0xB3D7, 0x5319,
0xB3D8, 0x6C60,
0xB3D9, 0x8FDF,
0xB3DA, 0x5F1B,
0xB3DB, 0x9A70,
0xB3DC, 0x803B,
0xB3DD, 0x9F7F,
0xB3DE, 0x4F88,
0xB3DF, 0x5C3A,
0xB3E0, 0x8D64,
0xB3E1, 0x7FC5,
0xB3E2, 0x65A5,
0xB3E3, 0x70BD,
0xB3E4, 0x5145,
0xB3E5, 0x51B2,
0xB3E6, 0x866B,
0xB3E7, 0x5D07,
0xB3E8, 0x5BA0,
0xB3E9, 0x62BD,
0xB3EA, 0x916C,
0xB3EB, 0x7574,
0xB3EC, 0x8E0C,
0xB3ED, 0x7A20,
0xB3EE, 0x6101,
0xB3EF, 0x7B79,
0xB3F0, 0x4EC7,
0xB3F1, 0x7EF8,
0xB3F2, 0x7785,
0xB3F3, 0x4E11,
0xB3F4, 0x81ED,
0xB3F5, 0x521D,
0xB3F6, 0x51FA,
0xB3F7, 0x6A71,
0xB3F8, 0x53A8,
0xB3F9, 0x8E87,
0xB3FA, 0x9504,
0xB3FB, 0x96CF,
0xB3FC, 0x6EC1,
0xB3FD, 0x9664,
0xB3FE, 0x695A,
0xB443, 0x7888,
0xB448, 0x7892,
0xB44C, 0x7899,
0xB44F, 0x78A0,
0xB450, 0x78A2,
0xB451, 0x78A4,
0xB452, 0x78A6,
0xB48C, 0x78F3,
0xB4A1, 0x7840,
0xB4A2, 0x50A8,
0xB4A3, 0x77D7,
0xB4A4, 0x6410,
0xB4A5, 0x89E6,
0xB4A6, 0x5904,
0xB4A7, 0x63E3,
0xB4A8, 0x5DDD,
0xB4A9, 0x7A7F,
0xB4AA, 0x693D,
0xB4AB, 0x4F20,
0xB4AC, 0x8239,
0xB4AD, 0x5598,
0xB4AE, 0x4E32,
0xB4AF, 0x75AE,
0xB4B0, 0x7A97,
0xB4B1, 0x5E62,
0xB4B2, 0x5E8A,
0xB4B3, 0x95EF,
0xB4B4, 0x521B,
0xB4B5, 0x5439,
0xB4B6, 0x708A,
0xB4B7, 0x6376,
0xB4B8, 0x9524,
0xB4B9, 0x5782,
0xB4BA, 0x6625,
0xB4BB, 0x693F,
0xB4BC, 0x9187,
0xB4BD, 0x5507,
0xB4BE, 0x6DF3,
0xB4BF, 0x7EAF,
0xB4C0, 0x8822,
0xB4C1, 0x6233,
0xB4C2, 0x7EF0,
0xB4C3, 0x75B5,
0xB4C4, 0x8328,
0xB4C5, 0x78C1,
0xB4C6, 0x96CC,
0xB4C7, 0x8F9E,
0xB4C8, 0x6148,
0xB4C9, 0x74F7,
0xB4CA, 0x8BCD,
0xB4CB, 0x6B64,
0xB4CC, 0x523A,
0xB4CD, 0x8D50,
0xB4CE, 0x6B21,
0xB4CF, 0x806A,
0xB4D0, 0x8471,
0xB4D1, 0x56F1,
0xB4D2, 0x5306,
0xB4D3, 0x4ECE,
0xB4D4, 0x4E1B,
0xB4D5, 0x51D1,
0xB4D6, 0x7C97,
0xB4D7, 0x918B,
0xB4D8, 0x7C07,
0xB4D9, 0x4FC3,
0xB4DA, 0x8E7F,
0xB4DB, 0x7BE1,
0xB4DC, 0x7A9C,
0xB4DD, 0x6467,
0xB4DE, 0x5D14,
0xB4DF, 0x50AC,
0xB4E0, 0x8106,
0xB4E1, 0x7601,
0xB4E2, 0x7CB9,
0xB4E3, 0x6DEC,
0xB4E4, 0x7FE0,
0xB4E5, 0x6751,
0xB4E6, 0x5B58,
0xB4E7, 0x5BF8,
0xB4E8, 0x78CB,
0xB4E9, 0x64AE,
0xB4EA, 0x6413,
0xB4EB, 0x63AA,
0xB4EC, 0x632B,
0xB4ED, 0x9519,
0xB4EE, 0x642D,
0xB4EF, 0x8FBE,
0xB4F0, 0x7B54,
0xB4F1, 0x7629,
0xB4F2, 0x6253,
0xB4F3, 0x5927,
0xB4F4, 0x5446,
0xB4F5, 0x6B79,
0xB4F6, 0x50A3,
0xB4F7, 0x6234,
0xB4F8, 0x5E26,
0xB4F9, 0x6B86,
0xB4FA, 0x4EE3,
0xB4FB, 0x8D37,
0xB4FC, 0x888B,
0xB4FD, 0x5F85,
0xB4FE, 0x902E,
0xB569, 0x793D,
0xB56A, 0x793F,
0xB56F, 0x7947,
0xB57D, 0x7961,
0xB57E, 0x7963,
0xB580, 0x7964,
0xB581, 0x7966,
0xB586, 0x796E,
0xB58E, 0x7979,
0xB5A1, 0x6020,
0xB5A2, 0x803D,
0xB5A3, 0x62C5,
0xB5A4, 0x4E39,
0xB5A5, 0x5355,
0xB5A6, 0x90F8,
0xB5A7, 0x63B8,
0xB5A8, 0x80C6,
0xB5A9, 0x65E6,
0xB5AA, 0x6C2E,
0xB5AB, 0x4F46,
0xB5AC, 0x60EE,
0xB5AD, 0x6DE1,
0xB5AE, 0x8BDE,
0xB5AF, 0x5F39,
0xB5B0, 0x86CB,
0xB5B1, 0x5F53,
0xB5B2, 0x6321,
0xB5B3, 0x515A,
0xB5B4, 0x8361,
0xB5B5, 0x6863,
0xB5B6, 0x5200,
0xB5B7, 0x6363,
0xB5B8, 0x8E48,
0xB5B9, 0x5012,
0xB5BA, 0x5C9B,
0xB5BB, 0x7977,
0xB5BC, 0x5BFC,
0xB5BD, 0x5230,
0xB5BE, 0x7A3B,
0xB5BF, 0x60BC,
0xB5C0, 0x9053,
0xB5C1, 0x76D7,
0xB5C2, 0x5FB7,
0xB5C3, 0x5F97,
0xB5C4, 0x7684,
0xB5C5, 0x8E6C,
0xB5C6, 0x706F,
0xB5C7, 0x767B,
0xB5C8, 0x7B49,
0xB5C9, 0x77AA,
0xB5CA, 0x51F3,
0xB5CB, 0x9093,
0xB5CC, 0x5824,
0xB5CD, 0x4F4E,
0xB5CE, 0x6EF4,
0xB5CF, 0x8FEA,
0xB5D0, 0x654C,
0xB5D1, 0x7B1B,
0xB5D2, 0x72C4,
0xB5D3, 0x6DA4,
0xB5D4, 0x7FDF,
0xB5D5, 0x5AE1,
0xB5D6, 0x62B5,
0xB5D7, 0x5E95,
0xB5D8, 0x5730,
0xB5D9, 0x8482,
0xB5DA, 0x7B2C,
0xB5DB, 0x5E1D,
0xB5DC, 0x5F1F,
0xB5DD, 0x9012,
0xB5DE, 0x7F14,
0xB5DF, 0x98A0,
0xB5E0, 0x6382,
0xB5E1, 0x6EC7,
0xB5E2, 0x7898,
0xB5E3, 0x70B9,
0xB5E4, 0x5178,
0xB5E5, 0x975B,
0xB5E6, 0x57AB,
0xB5E7, 0x7535,
0xB5E8, 0x4F43,
0xB5E9, 0x7538,
0xB5EA, 0x5E97,
0xB5EB, 0x60E6,
0xB5EC, 0x5960,
0xB5ED, 0x6DC0,
0xB5EE, 0x6BBF,
0xB5EF, 0x7889,
0xB5F0, 0x53FC,
0xB5F1, 0x96D5,
0xB5F2, 0x51CB,
0xB5F3, 0x5201,
0xB5F4, 0x6389,
0xB5F5, 0x540A,
0xB5F6, 0x9493,
0xB5F7, 0x8C03,
0xB5F8, 0x8DCC,
0xB5F9, 0x7239,
0xB5FA, 0x789F,
0xB5FB, 0x8776,
0xB5FC, 0x8FED,
0xB5FD, 0x8C0D,
0xB5FE, 0x53E0,
0xB663, 0x79BC,
0xB664, 0x79BF,
0xB665, 0x79C2,
0xB66A, 0x79CA,
0xB66B, 0x79CC,
0xB67C, 0x79E5,
0xB67D, 0x79E8,
0xB67E, 0x79EA,
0xB680, 0x79EC,
0xB681, 0x79EE,
0xB68B, 0x79FC,
0xB68E, 0x7A01,
0xB695, 0x7A0C,
0xB6A1, 0x4E01,
0xB6A2, 0x76EF,
0xB6A3, 0x53EE,
0xB6A4, 0x9489,
0xB6A5, 0x9876,
0xB6A6, 0x9F0E,
0xB6A7, 0x952D,
0xB6A8, 0x5B9A,
0xB6A9, 0x8BA2,
0xB6AA, 0x4E22,
0xB6AB, 0x4E1C,
0xB6AC, 0x51AC,
0xB6AD, 0x8463,
0xB6AE, 0x61C2,
0xB6AF, 0x52A8,
0xB6B0, 0x680B,
0xB6B1, 0x4F97,
0xB6B2, 0x606B,
0xB6B3, 0x51BB,
0xB6B4, 0x6D1E,
0xB6B5, 0x515C,
0xB6B6, 0x6296,
0xB6B7, 0x6597,
0xB6B8, 0x9661,
0xB6B9, 0x8C46,
0xB6BA, 0x9017,
0xB6BB, 0x75D8,
0xB6BC, 0x90FD,
0xB6BD, 0x7763,
0xB6BE, 0x6BD2,
0xB6BF, 0x728A,
0xB6C0, 0x72EC,
0xB6C1, 0x8BFB,
0xB6C2, 0x5835,
0xB6C3, 0x7779,
0xB6C4, 0x8D4C,
0xB6C5, 0x675C,
0xB6C6, 0x9540,
0xB6C7, 0x809A,
0xB6C8, 0x5EA6,
0xB6C9, 0x6E21,
0xB6CA, 0x5992,
0xB6CB, 0x7AEF,
0xB6CC, 0x77ED,
0xB6CD, 0x953B,
0xB6CE, 0x6BB5,
0xB6CF, 0x65AD,
0xB6D0, 0x7F0E,
0xB6D1, 0x5806,
0xB6D2, 0x5151,
0xB6D3, 0x961F,
0xB6D4, 0x5BF9,
0xB6D5, 0x58A9,
0xB6D6, 0x5428,
0xB6D7, 0x8E72,
0xB6D8, 0x6566,
0xB6D9, 0x987F,
0xB6DA, 0x56E4,
0xB6DB, 0x949D,
0xB6DC, 0x76FE,
0xB6DD, 0x9041,
0xB6DE, 0x6387,
0xB6DF, 0x54C6,
0xB6E0, 0x591A,
0xB6E1, 0x593A,
0xB6E2, 0x579B,
0xB6E3, 0x8EB2,
0xB6E4, 0x6735,
0xB6E5, 0x8DFA,
0xB6E6, 0x8235,
0xB6E7, 0x5241,
0xB6E8, 0x60F0,
0xB6E9, 0x5815,
0xB6EA, 0x86FE,
0xB6EB, 0x5CE8,
0xB6EC, 0x9E45,
0xB6ED, 0x4FC4,
0xB6EE, 0x989D,
0xB6EF, 0x8BB9,
0xB6F0, 0x5A25,
0xB6F1, 0x6076,
0xB6F2, 0x5384,
0xB6F3, 0x627C,
0xB6F4, 0x904F,
0xB6F5, 0x9102,
0xB6F6, 0x997F,
0xB6F7, 0x6069,
0xB6F8, 0x800C,
0xB6F9, 0x513F,
0xB6FA, 0x8033,
0xB6FB, 0x5C14,
0xB6FC, 0x9975,
0xB6FD, 0x6D31,
0xB6FE, 0x4E8C,
0xB740, 0x7A1D,
0xB741, 0x7A1F,
0xB756, 0x7A38,
0xB757, 0x7A3A,
0xB758, 0x7A3E,
0xB78A, 0x7A75,
0xB78F, 0x7A82,
0xB790, 0x7A85,
0xB791, 0x7A87,
0xB79E, 0x7A9E,
0xB7A1, 0x8D30,
0xB7A2, 0x53D1,
0xB7A3, 0x7F5A,
0xB7A4, 0x7B4F,
0xB7A5, 0x4F10,
0xB7A6, 0x4E4F,
0xB7A7, 0x9600,
0xB7A8, 0x6CD5,
0xB7A9, 0x73D0,
0xB7AA, 0x85E9,
0xB7AB, 0x5E06,
0xB7AC, 0x756A,
0xB7AD, 0x7FFB,
0xB7AE, 0x6A0A,
0xB7AF, 0x77FE,
0xB7B0, 0x9492,
0xB7B1, 0x7E41,
0xB7B2, 0x51E1,
0xB7B3, 0x70E6,
0xB7B4, 0x53CD,
0xB7B5, 0x8FD4,
0xB7B6, 0x8303,
0xB7B7, 0x8D29,
0xB7B8, 0x72AF,
0xB7B9, 0x996D,
0xB7BA, 0x6CDB,
0xB7BB, 0x574A,
0xB7BC, 0x82B3,
0xB7BD, 0x65B9,
0xB7BE, 0x80AA,
0xB7BF, 0x623F,
0xB7C0, 0x9632,
0xB7C1, 0x59A8,
0xB7C2, 0x4EFF,
0xB7C3, 0x8BBF,
0xB7C4, 0x7EBA,
0xB7C5, 0x653E,
0xB7C6, 0x83F2,
0xB7C7, 0x975E,
0xB7C8, 0x5561,
0xB7C9, 0x98DE,
0xB7CA, 0x80A5,
0xB7CB, 0x532A,
0xB7CC, 0x8BFD,
0xB7CD, 0x5420,
0xB7CE, 0x80BA,
0xB7CF, 0x5E9F,
0xB7D0, 0x6CB8,
0xB7D1, 0x8D39,
0xB7D2, 0x82AC,
0xB7D3, 0x915A,
0xB7D4, 0x5429,
0xB7D5, 0x6C1B,
0xB7D6, 0x5206,
0xB7D7, 0x7EB7,
0xB7D8, 0x575F,
0xB7D9, 0x711A,
0xB7DA, 0x6C7E,
0xB7DB, 0x7C89,
0xB7DC, 0x594B,
0xB7DD, 0x4EFD,
0xB7DE, 0x5FFF,
0xB7DF, 0x6124,
0xB7E0, 0x7CAA,
0xB7E1, 0x4E30,
0xB7E2, 0x5C01,
0xB7E3, 0x67AB,
0xB7E4, 0x8702,
0xB7E5, 0x5CF0,
0xB7E6, 0x950B,
0xB7E7, 0x98CE,
0xB7E8, 0x75AF,
0xB7E9, 0x70FD,
0xB7EA, 0x9022,
0xB7EB, 0x51AF,
0xB7EC, 0x7F1D,
0xB7ED, 0x8BBD,
0xB7EE, 0x5949,
0xB7EF, 0x51E4,
0xB7F0, 0x4F5B,
0xB7F1, 0x5426,
0xB7F2, 0x592B,
0xB7F3, 0x6577,
0xB7F4, 0x80A4,
0xB7F5, 0x5B75,
0xB7F6, 0x6276,
0xB7F7, 0x62C2,
0xB7F8, 0x8F90,
0xB7F9, 0x5E45,
0xB7FA, 0x6C1F,
0xB7FB, 0x7B26,
0xB7FC, 0x4F0F,
0xB7FD, 0x4FD8,
0xB7FE, 0x670D,
0xB842, 0x7AA7,
0xB873, 0x7AE4,
0xB87A, 0x7AEE,
0xB887, 0x7AFE,
0xB88B, 0x7B05,
0xB88C, 0x7B07,
0xB88D, 0x7B09,
0xB891, 0x7B10,
0xB897, 0x7B1A,
0xB89A, 0x7B1F,
0xB89E, 0x7B27,
0xB89F, 0x7B29,
0xB8A0, 0x7B2D,
0xB8A1, 0x6D6E,
0xB8A2, 0x6DAA,
0xB8A3, 0x798F,
0xB8A4, 0x88B1,
0xB8A5, 0x5F17,
0xB8A6, 0x752B,
0xB8A7, 0x629A,
0xB8A8, 0x8F85,
0xB8A9, 0x4FEF,
0xB8AA, 0x91DC,
0xB8AB, 0x65A7,
0xB8AC, 0x812F,
0xB8AD, 0x8151,
0xB8AE, 0x5E9C,
0xB8AF, 0x8150,
0xB8B0, 0x8D74,
0xB8B1, 0x526F,
0xB8B2, 0x8986,
0xB8B3, 0x8D4B,
0xB8B4, 0x590D,
0xB8B5, 0x5085,
0xB8B6, 0x4ED8,
0xB8B7, 0x961C,
0xB8B8, 0x7236,
0xB8B9, 0x8179,
0xB8BA, 0x8D1F,
0xB8BB, 0x5BCC,
0xB8BC, 0x8BA3,
0xB8BD, 0x9644,
0xB8BE, 0x5987,
0xB8BF, 0x7F1A,
0xB8C0, 0x5490,
0xB8C1, 0x5676,
0xB8C2, 0x560E,
0xB8C3, 0x8BE5,
0xB8C4, 0x6539,
0xB8C5, 0x6982,
0xB8C6, 0x9499,
0xB8C7, 0x76D6,
0xB8C8, 0x6E89,
0xB8C9, 0x5E72,
0xB8CA, 0x7518,
0xB8CB, 0x6746,
0xB8CC, 0x67D1,
0xB8CD, 0x7AFF,
0xB8CE, 0x809D,
0xB8CF, 0x8D76,
0xB8D0, 0x611F,
0xB8D1, 0x79C6,
0xB8D2, 0x6562,
0xB8D3, 0x8D63,
0xB8D4, 0x5188,
0xB8D5, 0x521A,
0xB8D6, 0x94A2,
0xB8D7, 0x7F38,
0xB8D8, 0x809B,
0xB8D9, 0x7EB2,
0xB8DA, 0x5C97,
0xB8DB, 0x6E2F,
0xB8DC, 0x6760,
0xB8DD, 0x7BD9,
0xB8DE, 0x768B,
0xB8DF, 0x9AD8,
0xB8E0, 0x818F,
0xB8E1, 0x7F94,
0xB8E2, 0x7CD5,
0xB8E3, 0x641E,
0xB8E4, 0x9550,
0xB8E5, 0x7A3F,
0xB8E6, 0x544A,
0xB8E7, 0x54E5,
0xB8E8, 0x6B4C,
0xB8E9, 0x6401,
0xB8EA, 0x6208,
0xB8EB, 0x9E3D,
0xB8EC, 0x80F3,
0xB8ED, 0x7599,
0xB8EE, 0x5272,
0xB8EF, 0x9769,
0xB8F0, 0x845B,
0xB8F1, 0x683C,
0xB8F2, 0x86E4,
0xB8F3, 0x9601,
0xB8F4, 0x9694,
0xB8F5, 0x94EC,
0xB8F6, 0x4E2A,
0xB8F7, 0x5404,
0xB8F8, 0x7ED9,
0xB8F9, 0x6839,
0xB8FA, 0x8DDF,
0xB8FB, 0x8015,
0xB8FC, 0x66F4,
0xB8FD, 0x5E9A,
0xB8FE, 0x7FB9,
0xB942, 0x7B32,
0xB947, 0x7B39,
0xB948, 0x7B3B,
0xB949, 0x7B3D,
0xB950, 0x7B46,
0xB951, 0x7B48,
0xB952, 0x7B4A,
0xB955, 0x7B53,
0xB956, 0x7B55,
0xB957, 0x7B57,
0xB958, 0x7B59,
0xB959, 0x7B5C,
0xB95C, 0x7B61,
0xB96C, 0x7B76,
0xB96D, 0x7B78,
0xB96E, 0x7B7A,
0xB971, 0x7B7F,
0xB983, 0x7B96,
0xB9A1, 0x57C2,
0xB9A2, 0x803F,
0xB9A3, 0x6897,
0xB9A4, 0x5DE5,
0xB9A5, 0x653B,
0xB9A6, 0x529F,
0xB9A7, 0x606D,
0xB9A8, 0x9F9A,
0xB9A9, 0x4F9B,
0xB9AA, 0x8EAC,
0xB9AB, 0x516C,
0xB9AC, 0x5BAB,
0xB9AD, 0x5F13,
0xB9AE, 0x5DE9,
0xB9AF, 0x6C5E,
0xB9B0, 0x62F1,
0xB9B1, 0x8D21,
0xB9B2, 0x5171,
0xB9B3, 0x94A9,
0xB9B4, 0x52FE,
0xB9B5, 0x6C9F,
0xB9B6, 0x82DF,
0xB9B7, 0x72D7,
0xB9B8, 0x57A2,
0xB9B9, 0x6784,
0xB9BA, 0x8D2D,
0xB9BB, 0x591F,
0xB9BC, 0x8F9C,
0xB9BD, 0x83C7,
0xB9BE, 0x5495,
0xB9BF, 0x7B8D,
0xB9C0, 0x4F30,
0xB9C1, 0x6CBD,
0xB9C2, 0x5B64,
0xB9C3, 0x59D1,
0xB9C4, 0x9F13,
0xB9C5, 0x53E4,
0xB9C6, 0x86CA,
0xB9C7, 0x9AA8,
0xB9C8, 0x8C37,
0xB9C9, 0x80A1,
0xB9CA, 0x6545,
0xB9CB, 0x987E,
0xB9CC, 0x56FA,
0xB9CD, 0x96C7,
0xB9CE, 0x522E,
0xB9CF, 0x74DC,
0xB9D0, 0x5250,
0xB9D1, 0x5BE1,
0xB9D2, 0x6302,
0xB9D3, 0x8902,
0xB9D4, 0x4E56,
0xB9D5, 0x62D0,
0xB9D6, 0x602A,
0xB9D7, 0x68FA,
0xB9D8, 0x5173,
0xB9D9, 0x5B98,
0xB9DA, 0x51A0,
0xB9DB, 0x89C2,
0xB9DC, 0x7BA1,
0xB9DD, 0x9986,
0xB9DE, 0x7F50,
0xB9DF, 0x60EF,
0xB9E0, 0x704C,
0xB9E1, 0x8D2F,
0xB9E2, 0x5149,
0xB9E3, 0x5E7F,
0xB9E4, 0x901B,
0xB9E5, 0x7470,
0xB9E6, 0x89C4,
0xB9E7, 0x572D,
0xB9E8, 0x7845,
0xB9E9, 0x5F52,
0xB9EA, 0x9F9F,
0xB9EB, 0x95FA,
0xB9EC, 0x8F68,
0xB9ED, 0x9B3C,
0xB9EE, 0x8BE1,
0xB9EF, 0x7678,
0xB9F0, 0x6842,
0xB9F1, 0x67DC,
0xB9F2, 0x8DEA,
0xB9F3, 0x8D35,
0xB9F4, 0x523D,
0xB9F5, 0x8F8A,
0xB9F6, 0x6EDA,
0xB9F7, 0x68CD,
0xB9F8, 0x9505,
0xB9F9, 0x90ED,
0xB9FA, 0x56FD,
0xB9FB, 0x679C,
0xB9FC, 0x88F9,
0xB9FD, 0x8FC7,
0xB9FE, 0x54C8,
0xBA40, 0x7BC5,
0xBA49, 0x7BD2,
0xBA68, 0x7BFD,
0xBAA0, 0x7C42,
0xBAA1, 0x9AB8,
0xBAA2, 0x5B69,
0xBAA3, 0x6D77,
0xBAA4, 0x6C26,
0xBAA5, 0x4EA5,
0xBAA6, 0x5BB3,
0xBAA7, 0x9A87,
0xBAA8, 0x9163,
0xBAA9, 0x61A8,
0xBAAA, 0x90AF,
0xBAAB, 0x97E9,
0xBAAC, 0x542B,
0xBAAD, 0x6DB5,
0xBAAE, 0x5BD2,
0xBAAF, 0x51FD,
0xBAB0, 0x558A,
0xBAB1, 0x7F55,
0xBAB2, 0x7FF0,
0xBAB3, 0x64BC,
0xBAB4, 0x634D,
0xBAB5, 0x65F1,
0xBAB6, 0x61BE,
0xBAB7, 0x608D,
0xBAB8, 0x710A,
0xBAB9, 0x6C57,
0xBABA, 0x6C49,
0xBABB, 0x592F,
0xBABC, 0x676D,
0xBABD, 0x822A,
0xBABE, 0x58D5,
0xBABF, 0x568E,
0xBAC0, 0x8C6A,
0xBAC1, 0x6BEB,
0xBAC2, 0x90DD,
0xBAC3, 0x597D,
0xBAC4, 0x8017,
0xBAC5, 0x53F7,
0xBAC6, 0x6D69,
0xBAC7, 0x5475,
0xBAC8, 0x559D,
0xBAC9, 0x8377,
0xBACA, 0x83CF,
0xBACB, 0x6838,
0xBACC, 0x79BE,
0xBACD, 0x548C,
0xBACE, 0x4F55,
0xBACF, 0x5408,
0xBAD0, 0x76D2,
0xBAD1, 0x8C89,
0xBAD2, 0x9602,
0xBAD3, 0x6CB3,
0xBAD4, 0x6DB8,
0xBAD5, 0x8D6B,
0xBAD6, 0x8910,
0xBAD7, 0x9E64,
0xBAD8, 0x8D3A,
0xBAD9, 0x563F,
0xBADA, 0x9ED1,
0xBADB, 0x75D5,
0xBADC, 0x5F88,
0xBADD, 0x72E0,
0xBADE, 0x6068,
0xBADF, 0x54FC,
0xBAE0, 0x4EA8,
0xBAE1, 0x6A2A,
0xBAE2, 0x8861,
0xBAE3, 0x6052,
0xBAE4, 0x8F70,
0xBAE5, 0x54C4,
0xBAE6, 0x70D8,
0xBAE7, 0x8679,
0xBAE8, 0x9E3F,
0xBAE9, 0x6D2A,
0xBAEA, 0x5B8F,
0xBAEB, 0x5F18,
0xBAEC, 0x7EA2,
0xBAED, 0x5589,
0xBAEE, 0x4FAF,
0xBAEF, 0x7334,
0xBAF0, 0x543C,
0xBAF1, 0x539A,
0xBAF2, 0x5019,
0xBAF3, 0x540E,
0xBAF4, 0x547C,
0xBAF5, 0x4E4E,
0xBAF6, 0x5FFD,
0xBAF7, 0x745A,
0xBAF8, 0x58F6,
0xBAF9, 0x846B,
0xBAFA, 0x80E1,
0xBAFB, 0x8774,
0xBAFC, 0x72D0,
0xBAFD, 0x7CCA,
0xBAFE, 0x6E56,
0xBB80, 0x7C88,
0xBB8A, 0x7C96,
0xBB90, 0x7CA3,
0xBBA1, 0x5F27,
0xBBA2, 0x864E,
0xBBA3, 0x552C,
0xBBA4, 0x62A4,
0xBBA5, 0x4E92,
0xBBA6, 0x6CAA,
0xBBA7, 0x6237,
0xBBA8, 0x82B1,
0xBBA9, 0x54D7,
0xBBAA, 0x534E,
0xBBAB, 0x733E,
0xBBAC, 0x6ED1,
0xBBAD, 0x753B,
0xBBAE, 0x5212,
0xBBAF, 0x5316,
0xBBB0, 0x8BDD,
0xBBB1, 0x69D0,
0xBBB2, 0x5F8A,
0xBBB3, 0x6000,
0xBBB4, 0x6DEE,
0xBBB5, 0x574F,
0xBBB6, 0x6B22,
0xBBB7, 0x73AF,
0xBBB8, 0x6853,
0xBBB9, 0x8FD8,
0xBBBA, 0x7F13,
0xBBBB, 0x6362,
0xBBBC, 0x60A3,
0xBBBD, 0x5524,
0xBBBE, 0x75EA,
0xBBBF, 0x8C62,
0xBBC0, 0x7115,
0xBBC1, 0x6DA3,
0xBBC2, 0x5BA6,
0xBBC3, 0x5E7B,
0xBBC4, 0x8352,
0xBBC5, 0x614C,
0xBBC6, 0x9EC4,
0xBBC7, 0x78FA,
0xBBC8, 0x8757,
0xBBC9, 0x7C27,
0xBBCA, 0x7687,
0xBBCB, 0x51F0,
0xBBCC, 0x60F6,
0xBBCD, 0x714C,
0xBBCE, 0x6643,
0xBBCF, 0x5E4C,
0xBBD0, 0x604D,
0xBBD1, 0x8C0E,
0xBBD2, 0x7070,
0xBBD3, 0x6325,
0xBBD4, 0x8F89,
0xBBD5, 0x5FBD,
0xBBD6, 0x6062,
0xBBD7, 0x86D4,
0xBBD8, 0x56DE,
0xBBD9, 0x6BC1,
0xBBDA, 0x6094,
0xBBDB, 0x6167,
0xBBDC, 0x5349,
0xBBDD, 0x60E0,
0xBBDE, 0x6666,
0xBBDF, 0x8D3F,
0xBBE0, 0x79FD,
0xBBE1, 0x4F1A,
0xBBE2, 0x70E9,
0xBBE3, 0x6C47,
0xBBE4, 0x8BB3,
0xBBE5, 0x8BF2,
0xBBE6, 0x7ED8,
0xBBE7, 0x8364,
0xBBE8, 0x660F,
0xBBE9, 0x5A5A,
0xBBEA, 0x9B42,
0xBBEB, 0x6D51,
0xBBEC, 0x6DF7,
0xBBED, 0x8C41,
0xBBEE, 0x6D3B,
0xBBEF, 0x4F19,
0xBBF0, 0x706B,
0xBBF1, 0x83B7,
0xBBF2, 0x6216,
0xBBF3, 0x60D1,
0xBBF4, 0x970D,
0xBBF5, 0x8D27,
0xBBF6, 0x7978,
0xBBF7, 0x51FB,
0xBBF8, 0x573E,
0xBBF9, 0x57FA,
0xBBFA, 0x673A,
0xBBFB, 0x7578,
0xBBFC, 0x7A3D,
0xBBFD, 0x79EF,
0xBBFE, 0x7B95,
0xBC45, 0x7CC6,
0xBC46, 0x7CC9,
0xBC47, 0x7CCB,
0xBC4F, 0x7CD8,
0xBC8F, 0x7D21,
0xBCA1, 0x808C,
0xBCA2, 0x9965,
0xBCA3, 0x8FF9,
0xBCA4, 0x6FC0,
0xBCA5, 0x8BA5,
0xBCA6, 0x9E21,
0xBCA7, 0x59EC,
0xBCA8, 0x7EE9,
0xBCA9, 0x7F09,
0xBCAA, 0x5409,
0xBCAB, 0x6781,
0xBCAC, 0x68D8,
0xBCAD, 0x8F91,
0xBCAE, 0x7C4D,
0xBCAF, 0x96C6,
0xBCB0, 0x53CA,
0xBCB1, 0x6025,
0xBCB2, 0x75BE,
0xBCB3, 0x6C72,
0xBCB4, 0x5373,
0xBCB5, 0x5AC9,
0xBCB6, 0x7EA7,
0xBCB7, 0x6324,
0xBCB8, 0x51E0,
0xBCB9, 0x810A,
0xBCBA, 0x5DF1,
0xBCBB, 0x84DF,
0xBCBC, 0x6280,
0xBCBD, 0x5180,
0xBCBE, 0x5B63,
0xBCBF, 0x4F0E,
0xBCC0, 0x796D,
0xBCC1, 0x5242,
0xBCC2, 0x60B8,
0xBCC3, 0x6D4E,
0xBCC4, 0x5BC4,
0xBCC5, 0x5BC2,
0xBCC6, 0x8BA1,
0xBCC7, 0x8BB0,
0xBCC8, 0x65E2,
0xBCC9, 0x5FCC,
0xBCCA, 0x9645,
0xBCCB, 0x5993,
0xBCCC, 0x7EE7,
0xBCCD, 0x7EAA,
0xBCCE, 0x5609,
0xBCCF, 0x67B7,
0xBCD0, 0x5939,
0xBCD1, 0x4F73,
0xBCD2, 0x5BB6,
0xBCD3, 0x52A0,
0xBCD4, 0x835A,
0xBCD5, 0x988A,
0xBCD6, 0x8D3E,
0xBCD7, 0x7532,
0xBCD8, 0x94BE,
0xBCD9, 0x5047,
0xBCDA, 0x7A3C,
0xBCDB, 0x4EF7,
0xBCDC, 0x67B6,
0xBCDD, 0x9A7E,
0xBCDE, 0x5AC1,
0xBCDF, 0x6B7C,
0xBCE0, 0x76D1,
0xBCE1, 0x575A,
0xBCE2, 0x5C16,
0xBCE3, 0x7B3A,
0xBCE4, 0x95F4,
0xBCE5, 0x714E,
0xBCE6, 0x517C,
0xBCE7, 0x80A9,
0xBCE8, 0x8270,
0xBCE9, 0x5978,
0xBCEA, 0x7F04,
0xBCEB, 0x8327,
0xBCEC, 0x68C0,
0xBCED, 0x67EC,
0xBCEE, 0x78B1,
0xBCEF, 0x7877,
0xBCF0, 0x62E3,
0xBCF1, 0x6361,
0xBCF2, 0x7B80,
0xBCF3, 0x4FED,
0xBCF4, 0x526A,
0xBCF5, 0x51CF,
0xBCF6, 0x8350,
0xBCF7, 0x69DB,
0xBCF8, 0x9274,
0xBCF9, 0x8DF5,
0xBCFA, 0x8D31,
0xBCFB, 0x89C1,
0xBCFC, 0x952E,
0xBCFD, 0x7BAD,
0xBCFE, 0x4EF6,
0xBDA1, 0x5065,
0xBDA2, 0x8230,
0xBDA3, 0x5251,
0xBDA4, 0x996F,
0xBDA5, 0x6E10,
0xBDA6, 0x6E85,
0xBDA7, 0x6DA7,
0xBDA8, 0x5EFA,
0xBDA9, 0x50F5,
0xBDAA, 0x59DC,
0xBDAB, 0x5C06,
0xBDAC, 0x6D46,
0xBDAD, 0x6C5F,
0xBDAE, 0x7586,
0xBDAF, 0x848B,
0xBDB0, 0x6868,
0xBDB1, 0x5956,
0xBDB2, 0x8BB2,
0xBDB3, 0x5320,
0xBDB4, 0x9171,
0xBDB5, 0x964D,
0xBDB6, 0x8549,
0xBDB7, 0x6912,
0xBDB8, 0x7901,
0xBDB9, 0x7126,
0xBDBA, 0x80F6,
0xBDBB, 0x4EA4,
0xBDBC, 0x90CA,
0xBDBD, 0x6D47,
0xBDBE, 0x9A84,
0xBDBF, 0x5A07,
0xBDC0, 0x56BC,
0xBDC1, 0x6405,
0xBDC2, 0x94F0,
0xBDC3, 0x77EB,
0xBDC4, 0x4FA5,
0xBDC5, 0x811A,
0xBDC6, 0x72E1,
0xBDC7, 0x89D2,
0xBDC8, 0x997A,
0xBDC9, 0x7F34,
0xBDCA, 0x7EDE,
0xBDCB, 0x527F,
0xBDCC, 0x6559,
0xBDCD, 0x9175,
0xBDCE, 0x8F7F,
0xBDCF, 0x8F83,
0xBDD0, 0x53EB,
0xBDD1, 0x7A96,
0xBDD2, 0x63ED,
0xBDD3, 0x63A5,
0xBDD4, 0x7686,
0xBDD5, 0x79F8,
0xBDD6, 0x8857,
0xBDD7, 0x9636,
0xBDD8, 0x622A,
0xBDD9, 0x52AB,
0xBDDA, 0x8282,
0xBDDB, 0x6854,
0xBDDC, 0x6770,
0xBDDD, 0x6377,
0xBDDE, 0x776B,
0xBDDF, 0x7AED,
0xBDE0, 0x6D01,
0xBDE1, 0x7ED3,
0xBDE2, 0x89E3,
0xBDE3, 0x59D0,
0xBDE4, 0x6212,
0xBDE5, 0x85C9,
0xBDE6, 0x82A5,
0xBDE7, 0x754C,
0xBDE8, 0x501F,
0xBDE9, 0x4ECB,
0xBDEA, 0x75A5,
0xBDEB, 0x8BEB,
0xBDEC, 0x5C4A,
0xBDED, 0x5DFE,
0xBDEE, 0x7B4B,
0xBDEF, 0x65A4,
0xBDF0, 0x91D1,
0xBDF1, 0x4ECA,
0xBDF2, 0x6D25,
0xBDF3, 0x895F,
0xBDF4, 0x7D27,
0xBDF5, 0x9526,
0xBDF6, 0x4EC5,
0xBDF7, 0x8C28,
0xBDF8, 0x8FDB,
0xBDF9, 0x9773,
0xBDFA, 0x664B,
0xBDFB, 0x7981,
0xBDFC, 0x8FD1,
0xBDFD, 0x70EC,
0xBDFE, 0x6D78,
0xBEA1, 0x5C3D,
0xBEA2, 0x52B2,
0xBEA3, 0x8346,
0xBEA4, 0x5162,
0xBEA5, 0x830E,
0xBEA6, 0x775B,
0xBEA7, 0x6676,
0xBEA8, 0x9CB8,
0xBEA9, 0x4EAC,
0xBEAA, 0x60CA,
0xBEAB, 0x7CBE,
0xBEAC, 0x7CB3,
0xBEAD, 0x7ECF,
0xBEAE, 0x4E95,
0xBEAF, 0x8B66,
0xBEB0, 0x666F,
0xBEB1, 0x9888,
0xBEB2, 0x9759,
0xBEB3, 0x5883,
0xBEB4, 0x656C,
0xBEB5, 0x955C,
0xBEB6, 0x5F84,
0xBEB7, 0x75C9,
0xBEB8, 0x9756,
0xBEB9, 0x7ADF,
0xBEBA, 0x7ADE,
0xBEBB, 0x51C0,
0xBEBC, 0x70AF,
0xBEBD, 0x7A98,
0xBEBE, 0x63EA,
0xBEBF, 0x7A76,
0xBEC0, 0x7EA0,
0xBEC1, 0x7396,
0xBEC2, 0x97ED,
0xBEC3, 0x4E45,
0xBEC4, 0x7078,
0xBEC5, 0x4E5D,
0xBEC6, 0x9152,
0xBEC7, 0x53A9,
0xBEC8, 0x6551,
0xBEC9, 0x65E7,
0xBECA, 0x81FC,
0xBECB, 0x8205,
0xBECC, 0x548E,
0xBECD, 0x5C31,
0xBECE, 0x759A,
0xBECF, 0x97A0,
0xBED0, 0x62D8,
0xBED1, 0x72D9,
0xBED2, 0x75BD,
0xBED3, 0x5C45,
0xBED4, 0x9A79,
0xBED5, 0x83CA,
0xBED6, 0x5C40,
0xBED7, 0x5480,
0xBED8, 0x77E9,
0xBED9, 0x4E3E,
0xBEDA, 0x6CAE,
0xBEDB, 0x805A,
0xBEDC, 0x62D2,
0xBEDD, 0x636E,
0xBEDE, 0x5DE8,
0xBEDF, 0x5177,
0xBEE0, 0x8DDD,
0xBEE1, 0x8E1E,
0xBEE2, 0x952F,
0xBEE3, 0x4FF1,
0xBEE4, 0x53E5,
0xBEE5, 0x60E7,
0xBEE6, 0x70AC,
0xBEE7, 0x5267,
0xBEE8, 0x6350,
0xBEE9, 0x9E43,
0xBEEA, 0x5A1F,
0xBEEB, 0x5026,
0xBEEC, 0x7737,
0xBEED, 0x5377,
0xBEEE, 0x7EE2,
0xBEEF, 0x6485,
0xBEF0, 0x652B,
0xBEF1, 0x6289,
0xBEF2, 0x6398,
0xBEF3, 0x5014,
0xBEF4, 0x7235,
0xBEF5, 0x89C9,
0xBEF6, 0x51B3,
0xBEF7, 0x8BC0,
0xBEF8, 0x7EDD,
0xBEF9, 0x5747,
0xBEFA, 0x83CC,
0xBEFB, 0x94A7,
0xBEFC, 0x519B,
0xBEFD, 0x541B,
0xBEFE, 0x5CFB,
0xBF80, 0x7E3A,
0xBFA1, 0x4FCA,
0xBFA2, 0x7AE3,
0xBFA3, 0x6D5A,
0xBFA4, 0x90E1,
0xBFA5, 0x9A8F,
0xBFA6, 0x5580,
0xBFA7, 0x5496,
0xBFA8, 0x5361,
0xBFA9, 0x54AF,
0xBFAA, 0x5F00,
0xBFAB, 0x63E9,
0xBFAC, 0x6977,
0xBFAD, 0x51EF,
0xBFAE, 0x6168,
0xBFAF, 0x520A,
0xBFB0, 0x582A,
0xBFB1, 0x52D8,
0xBFB2, 0x574E,
0xBFB3, 0x780D,
0xBFB4, 0x770B,
0xBFB5, 0x5EB7,
0xBFB6, 0x6177,
0xBFB7, 0x7CE0,
0xBFB8, 0x625B,
0xBFB9, 0x6297,
0xBFBA, 0x4EA2,
0xBFBB, 0x7095,
0xBFBC, 0x8003,
0xBFBD, 0x62F7,
0xBFBE, 0x70E4,
0xBFBF, 0x9760,
0xBFC0, 0x5777,
0xBFC1, 0x82DB,
0xBFC2, 0x67EF,
0xBFC3, 0x68F5,
0xBFC4, 0x78D5,
0xBFC5, 0x9897,
0xBFC6, 0x79D1,
0xBFC7, 0x58F3,
0xBFC8, 0x54B3,
0xBFC9, 0x53EF,
0xBFCA, 0x6E34,
0xBFCB, 0x514B,
0xBFCC, 0x523B,
0xBFCD, 0x5BA2,
0xBFCE, 0x8BFE,
0xBFCF, 0x80AF,
0xBFD0, 0x5543,
0xBFD1, 0x57A6,
0xBFD2, 0x6073,
0xBFD3, 0x5751,
0xBFD4, 0x542D,
0xBFD5, 0x7A7A,
0xBFD6, 0x6050,
0xBFD7, 0x5B54,
0xBFD8, 0x63A7,
0xBFD9, 0x62A0,
0xBFDA, 0x53E3,
0xBFDB, 0x6263,
0xBFDC, 0x5BC7,
0xBFDD, 0x67AF,
0xBFDE, 0x54ED,
0xBFDF, 0x7A9F,
0xBFE0, 0x82E6,
0xBFE1, 0x9177,
0xBFE2, 0x5E93,
0xBFE3, 0x88E4,
0xBFE4, 0x5938,
0xBFE5, 0x57AE,
0xBFE6, 0x630E,
0xBFE7, 0x8DE8,
0xBFE8, 0x80EF,
0xBFE9, 0x5757,
0xBFEA, 0x7B77,
0xBFEB, 0x4FA9,
0xBFEC, 0x5FEB,
0xBFED, 0x5BBD,
0xBFEE, 0x6B3E,
0xBFEF, 0x5321,
0xBFF0, 0x7B50,
0xBFF1, 0x72C2,
0xBFF2, 0x6846,
0xBFF3, 0x77FF,
0xBFF4, 0x7736,
0xBFF5, 0x65F7,
0xBFF6, 0x51B5,
0xBFF7, 0x4E8F,
0xBFF8, 0x76D4,
0xBFF9, 0x5CBF,
0xBFFA, 0x7AA5,
0xBFFB, 0x8475,
0xBFFC, 0x594E,
0xBFFD, 0x9B41,
0xBFFE, 0x5080,
0xC080, 0x7EAE,
0xC081, 0x7EB4,
0xC084, 0x7ED6,
0xC085, 0x7EE4,
0xC086, 0x7EEC,
0xC087, 0x7EF9,
0xC088, 0x7F0A,
0xC089, 0x7F10,
0xC08A, 0x7F1E,
0xC08B, 0x7F37,
0xC08C, 0x7F39,
0xC094, 0x7F43,
0xC0A1, 0x9988,
0xC0A2, 0x6127,
0xC0A3, 0x6E83,
0xC0A4, 0x5764,
0xC0A5, 0x6606,
0xC0A6, 0x6346,
0xC0A7, 0x56F0,
0xC0A8, 0x62EC,
0xC0A9, 0x6269,
0xC0AA, 0x5ED3,
0xC0AB, 0x9614,
0xC0AC, 0x5783,
0xC0AD, 0x62C9,
0xC0AE, 0x5587,
0xC0AF, 0x8721,
0xC0B0, 0x814A,
0xC0B1, 0x8FA3,
0xC0B2, 0x5566,
0xC0B3, 0x83B1,
0xC0B4, 0x6765,
0xC0B5, 0x8D56,
0xC0B6, 0x84DD,
0xC0B7, 0x5A6A,
0xC0B8, 0x680F,
0xC0B9, 0x62E6,
0xC0BA, 0x7BEE,
0xC0BB, 0x9611,
0xC0BC, 0x5170,
0xC0BD, 0x6F9C,
0xC0BE, 0x8C30,
0xC0BF, 0x63FD,
0xC0C0, 0x89C8,
0xC0C1, 0x61D2,
0xC0C2, 0x7F06,
0xC0C3, 0x70C2,
0xC0C4, 0x6EE5,
0xC0C5, 0x7405,
0xC0C6, 0x6994,
0xC0C7, 0x72FC,
0xC0C8, 0x5ECA,
0xC0C9, 0x90CE,
0xC0CA, 0x6717,
0xC0CB, 0x6D6A,
0xC0CC, 0x635E,
0xC0CD, 0x52B3,
0xC0CE, 0x7262,
0xC0CF, 0x8001,
0xC0D0, 0x4F6C,
0xC0D1, 0x59E5,
0xC0D2, 0x916A,
0xC0D3, 0x70D9,
0xC0D4, 0x6D9D,
0xC0D5, 0x52D2,
0xC0D6, 0x4E50,
0xC0D7, 0x96F7,
0xC0D8, 0x956D,
0xC0D9, 0x857E,
0xC0DA, 0x78CA,
0xC0DB, 0x7D2F,
0xC0DC, 0x5121,
0xC0DD, 0x5792,
0xC0DE, 0x64C2,
0xC0DF, 0x808B,
0xC0E0, 0x7C7B,
0xC0E1, 0x6CEA,
0xC0E2, 0x68F1,
0xC0E3, 0x695E,
0xC0E4, 0x51B7,
0xC0E5, 0x5398,
0xC0E6, 0x68A8,
0xC0E7, 0x7281,
0xC0E8, 0x9ECE,
0xC0E9, 0x7BF1,
0xC0EA, 0x72F8,
0xC0EB, 0x79BB,
0xC0EC, 0x6F13,
0xC0ED, 0x7406,
0xC0EE, 0x674E,
0xC0EF, 0x91CC,
0xC0F0, 0x9CA4,
0xC0F1, 0x793C,
0xC0F2, 0x8389,
0xC0F3, 0x8354,
0xC0F4, 0x540F,
0xC0F5, 0x6817,
0xC0F6, 0x4E3D,
0xC0F7, 0x5389,
0xC0F8, 0x52B1,
0xC0F9, 0x783E,
0xC0FA, 0x5386,
0xC0FB, 0x5229,
0xC0FC, 0x5088,
0xC0FD, 0x4F8B,
0xC0FE, 0x4FD0,
0xC140, 0x7F56,
0xC141, 0x7F59,
0xC146, 0x7F60,
0xC151, 0x7F73,
0xC164, 0x7F8B,
0xC165, 0x7F8D,
0xC172, 0x7FA0,
0xC17E, 0x7FB1,
0xC187, 0x7FBE,
0xC188, 0x7FC0,
0xC190, 0x7FCB,
0xC191, 0x7FCD,
0xC1A1, 0x75E2,
0xC1A2, 0x7ACB,
0xC1A3, 0x7C92,
0xC1A4, 0x6CA5,
0xC1A5, 0x96B6,
0xC1A6, 0x529B,
0xC1A7, 0x7483,
0xC1A8, 0x54E9,
0xC1A9, 0x4FE9,
0xC1AA, 0x8054,
0xC1AB, 0x83B2,
0xC1AC, 0x8FDE,
0xC1AD, 0x9570,
0xC1AE, 0x5EC9,
0xC1AF, 0x601C,
0xC1B0, 0x6D9F,
0xC1B1, 0x5E18,
0xC1B2, 0x655B,
0xC1B3, 0x8138,
0xC1B4, 0x94FE,
0xC1B5, 0x604B,
0xC1B6, 0x70BC,
0xC1B7, 0x7EC3,
0xC1B8, 0x7CAE,
0xC1B9, 0x51C9,
0xC1BA, 0x6881,
0xC1BB, 0x7CB1,
0xC1BC, 0x826F,
0xC1BD, 0x4E24,
0xC1BE, 0x8F86,
0xC1BF, 0x91CF,
0xC1C0, 0x667E,
0xC1C1, 0x4EAE,
0xC1C2, 0x8C05,
0xC1C3, 0x64A9,
0xC1C4, 0x804A,
0xC1C5, 0x50DA,
0xC1C6, 0x7597,
0xC1C7, 0x71CE,
0xC1C8, 0x5BE5,
0xC1C9, 0x8FBD,
0xC1CA, 0x6F66,
0xC1CB, 0x4E86,
0xC1CC, 0x6482,
0xC1CD, 0x9563,
0xC1CE, 0x5ED6,
0xC1CF, 0x6599,
0xC1D0, 0x5217,
0xC1D1, 0x88C2,
0xC1D2, 0x70C8,
0xC1D3, 0x52A3,
0xC1D4, 0x730E,
0xC1D5, 0x7433,
0xC1D6, 0x6797,
0xC1D7, 0x78F7,
0xC1D8, 0x9716,
0xC1D9, 0x4E34,
0xC1DA, 0x90BB,
0xC1DB, 0x9CDE,
0xC1DC, 0x6DCB,
0xC1DD, 0x51DB,
0xC1DE, 0x8D41,
0xC1DF, 0x541D,
0xC1E0, 0x62CE,
0xC1E1, 0x73B2,
0xC1E2, 0x83F1,
0xC1E3, 0x96F6,
0xC1E4, 0x9F84,
0xC1E5, 0x94C3,
0xC1E6, 0x4F36,
0xC1E7, 0x7F9A,
0xC1E8, 0x51CC,
0xC1E9, 0x7075,
0xC1EA, 0x9675,
0xC1EB, 0x5CAD,
0xC1EC, 0x9886,
0xC1ED, 0x53E6,
0xC1EE, 0x4EE4,
0xC1EF, 0x6E9C,
0xC1F0, 0x7409,
0xC1F1, 0x69B4,
0xC1F2, 0x786B,
0xC1F3, 0x998F,
0xC1F4, 0x7559,
0xC1F5, 0x5218,
0xC1F6, 0x7624,
0xC1F7, 0x6D41,
0xC1F8, 0x67F3,
0xC1F9, 0x516D,
0xC1FA, 0x9F99,
0xC1FB, 0x804B,
0xC1FC, 0x5499,
0xC1FD, 0x7B3C,
0xC1FE, 0x7ABF,
0xC240, 0x7FE4,
0xC247, 0x7FEF,
0xC248, 0x7FF2,
0xC253, 0x8002,
0xC25A, 0x8011,
0xC25B, 0x8013,
0xC261, 0x8021,
0xC26A, 0x8032,
0xC26B, 0x8034,
0xC26E, 0x803C,
0xC26F, 0x803E,
0xC27B, 0x8053,
0xC280, 0x8059,
0xC2A1, 0x9686,
0xC2A2, 0x5784,
0xC2A3, 0x62E2,
0xC2A4, 0x9647,
0xC2A5, 0x697C,
0xC2A6, 0x5A04,
0xC2A7, 0x6402,
0xC2A8, 0x7BD3,
0xC2A9, 0x6F0F,
0xC2AA, 0x964B,
0xC2AB, 0x82A6,
0xC2AC, 0x5362,
0xC2AD, 0x9885,
0xC2AE, 0x5E90,
0xC2AF, 0x7089,
0xC2B0, 0x63B3,
0xC2B1, 0x5364,
0xC2B2, 0x864F,
0xC2B3, 0x9C81,
0xC2B4, 0x9E93,
0xC2B5, 0x788C,
0xC2B6, 0x9732,
0xC2B7, 0x8DEF,
0xC2B8, 0x8D42,
0xC2B9, 0x9E7F,
0xC2BA, 0x6F5E,
0xC2BB, 0x7984,
0xC2BC, 0x5F55,
0xC2BD, 0x9646,
0xC2BE, 0x622E,
0xC2BF, 0x9A74,
0xC2C0, 0x5415,
0xC2C1, 0x94DD,
0xC2C2, 0x4FA3,
0xC2C3, 0x65C5,
0xC2C4, 0x5C65,
0xC2C5, 0x5C61,
0xC2C6, 0x7F15,
0xC2C7, 0x8651,
0xC2C8, 0x6C2F,
0xC2C9, 0x5F8B,
0xC2CA, 0x7387,
0xC2CB, 0x6EE4,
0xC2CC, 0x7EFF,
0xC2CD, 0x5CE6,
0xC2CE, 0x631B,
0xC2CF, 0x5B6A,
0xC2D0, 0x6EE6,
0xC2D1, 0x5375,
0xC2D2, 0x4E71,
0xC2D3, 0x63A0,
0xC2D4, 0x7565,
0xC2D5, 0x62A1,
0xC2D6, 0x8F6E,
0xC2D7, 0x4F26,
0xC2D8, 0x4ED1,
0xC2D9, 0x6CA6,
0xC2DA, 0x7EB6,
0xC2DB, 0x8BBA,
0xC2DC, 0x841D,
0xC2DD, 0x87BA,
0xC2DE, 0x7F57,
0xC2DF, 0x903B,
0xC2E0, 0x9523,
0xC2E1, 0x7BA9,
0xC2E2, 0x9AA1,
0xC2E3, 0x88F8,
0xC2E4, 0x843D,
0xC2E5, 0x6D1B,
0xC2E6, 0x9A86,
0xC2E7, 0x7EDC,
0xC2E8, 0x5988,
0xC2E9, 0x9EBB,
0xC2EA, 0x739B,
0xC2EB, 0x7801,
0xC2EC, 0x8682,
0xC2ED, 0x9A6C,
0xC2EE, 0x9A82,
0xC2EF, 0x561B,
0xC2F0, 0x5417,
0xC2F1, 0x57CB,
0xC2F2, 0x4E70,
0xC2F3, 0x9EA6,
0xC2F4, 0x5356,
0xC2F5, 0x8FC8,
0xC2F6, 0x8109,
0xC2F7, 0x7792,
0xC2F8, 0x9992,
0xC2F9, 0x86EE,
0xC2FA, 0x6EE1,
0xC2FB, 0x8513,
0xC2FC, 0x66FC,
0xC2FD, 0x6162,
0xC2FE, 0x6F2B,
0xC340, 0x807E,
0xC343, 0x8085,
0xC344, 0x8088,
0xC345, 0x808A,
0xC34E, 0x8097,
0xC34F, 0x8099,
0xC350, 0x809E,
0xC351, 0x80A3,
0xC355, 0x80AC,
0xC356, 0x80B0,
0xC357, 0x80B3,
0xC35C, 0x80BB,
0xC35D, 0x80C5,
0xC36A, 0x80D8,
0xC36F, 0x80E6,
0xC370, 0x80EE,
0xC371, 0x80F5,
0xC372, 0x80F7,
0xC373, 0x80F9,
0xC374, 0x80FB,
0xC37E, 0x810B,
0xC380, 0x810C,
0xC381, 0x8115,
0xC382, 0x8117,
0xC383, 0x8119,
0xC396, 0x8130,
0xC39A, 0x8137,
0xC3A0, 0x813F,
0xC3A1, 0x8C29,
0xC3A2, 0x8292,
0xC3A3, 0x832B,
0xC3A4, 0x76F2,
0xC3A5, 0x6C13,
0xC3A6, 0x5FD9,
0xC3A7, 0x83BD,
0xC3A8, 0x732B,
0xC3A9, 0x8305,
0xC3AA, 0x951A,
0xC3AB, 0x6BDB,
0xC3AC, 0x77DB,
0xC3AD, 0x94C6,
0xC3AE, 0x536F,
0xC3AF, 0x8302,
0xC3B0, 0x5192,
0xC3B1, 0x5E3D,
0xC3B2, 0x8C8C,
0xC3B3, 0x8D38,
0xC3B4, 0x4E48,
0xC3B5, 0x73AB,
0xC3B6, 0x679A,
0xC3B7, 0x6885,
0xC3B8, 0x9176,
0xC3B9, 0x9709,
0xC3BA, 0x7164,
0xC3BB, 0x6CA1,
0xC3BC, 0x7709,
0xC3BD, 0x5A92,
0xC3BE, 0x9541,
0xC3BF, 0x6BCF,
0xC3C0, 0x7F8E,
0xC3C1, 0x6627,
0xC3C2, 0x5BD0,
0xC3C3, 0x59B9,
0xC3C4, 0x5A9A,
0xC3C5, 0x95E8,
0xC3C6, 0x95F7,
0xC3C7, 0x4EEC,
0xC3C8, 0x840C,
0xC3C9, 0x8499,
0xC3CA, 0x6AAC,
0xC3CB, 0x76DF,
0xC3CC, 0x9530,
0xC3CD, 0x731B,
0xC3CE, 0x68A6,
0xC3CF, 0x5B5F,
0xC3D0, 0x772F,
0xC3D1, 0x919A,
0xC3D2, 0x9761,
0xC3D3, 0x7CDC,
0xC3D4, 0x8FF7,
0xC3D5, 0x8C1C,
0xC3D6, 0x5F25,
0xC3D7, 0x7C73,
0xC3D8, 0x79D8,
0xC3D9, 0x89C5,
0xC3DA, 0x6CCC,
0xC3DB, 0x871C,
0xC3DC, 0x5BC6,
0xC3DD, 0x5E42,
0xC3DE, 0x68C9,
0xC3DF, 0x7720,
0xC3E0, 0x7EF5,
0xC3E1, 0x5195,
0xC3E2, 0x514D,
0xC3E3, 0x52C9,
0xC3E4, 0x5A29,
0xC3E5, 0x7F05,
0xC3E6, 0x9762,
0xC3E7, 0x82D7,
0xC3E8, 0x63CF,
0xC3E9, 0x7784,
0xC3EA, 0x85D0,
0xC3EB, 0x79D2,
0xC3EC, 0x6E3A,
0xC3ED, 0x5E99,
0xC3EE, 0x5999,
0xC3EF, 0x8511,
0xC3F0, 0x706D,
0xC3F1, 0x6C11,
0xC3F2, 0x62BF,
0xC3F3, 0x76BF,
0xC3F4, 0x654F,
0xC3F5, 0x60AF,
0xC3F6, 0x95FD,
0xC3F7, 0x660E,
0xC3F8, 0x879F,
0xC3F9, 0x9E23,
0xC3FA, 0x94ED,
0xC3FB, 0x540D,
0xC3FC, 0x547D,
0xC3FD, 0x8C2C,
0xC3FE, 0x6478,
0xC446, 0x8147,
0xC447, 0x8149,
0xC44B, 0x8152,
0xC458, 0x8166,
0xC459, 0x8168,
0xC45D, 0x816F,
0xC464, 0x8181,
0xC46A, 0x8189,
0xC46F, 0x8190,
0xC480, 0x81A7,
0xC481, 0x81A9,
0xC499, 0x81CB,
0xC4A1, 0x6479,
0xC4A2, 0x8611,
0xC4A3, 0x6A21,
0xC4A4, 0x819C,
0xC4A5, 0x78E8,
0xC4A6, 0x6469,
0xC4A7, 0x9B54,
0xC4A8, 0x62B9,
0xC4A9, 0x672B,
0xC4AA, 0x83AB,
0xC4AB, 0x58A8,
0xC4AC, 0x9ED8,
0xC4AD, 0x6CAB,
0xC4AE, 0x6F20,
0xC4AF, 0x5BDE,
0xC4B0, 0x964C,
0xC4B1, 0x8C0B,
0xC4B2, 0x725F,
0xC4B3, 0x67D0,
0xC4B4, 0x62C7,
0xC4B5, 0x7261,
0xC4B6, 0x4EA9,
0xC4B7, 0x59C6,
0xC4B8, 0x6BCD,
0xC4B9, 0x5893,
0xC4BA, 0x66AE,
0xC4BB, 0x5E55,
0xC4BC, 0x52DF,
0xC4BD, 0x6155,
0xC4BE, 0x6728,
0xC4BF, 0x76EE,
0xC4C0, 0x7766,
0xC4C1, 0x7267,
0xC4C2, 0x7A46,
0xC4C3, 0x62FF,
0xC4C4, 0x54EA,
0xC4C5, 0x5450,
0xC4C6, 0x94A0,
0xC4C7, 0x90A3,
0xC4C8, 0x5A1C,
0xC4C9, 0x7EB3,
0xC4CA, 0x6C16,
0xC4CB, 0x4E43,
0xC4CC, 0x5976,
0xC4CD, 0x8010,
0xC4CE, 0x5948,
0xC4CF, 0x5357,
0xC4D0, 0x7537,
0xC4D1, 0x96BE,
0xC4D2, 0x56CA,
0xC4D3, 0x6320,
0xC4D4, 0x8111,
0xC4D5, 0x607C,
0xC4D6, 0x95F9,
0xC4D7, 0x6DD6,
0xC4D8, 0x5462,
0xC4D9, 0x9981,
0xC4DA, 0x5185,
0xC4DB, 0x5AE9,
0xC4DC, 0x80FD,
0xC4DD, 0x59AE,
0xC4DE, 0x9713,
0xC4DF, 0x502A,
0xC4E0, 0x6CE5,
0xC4E1, 0x5C3C,
0xC4E2, 0x62DF,
0xC4E3, 0x4F60,
0xC4E4, 0x533F,
0xC4E5, 0x817B,
0xC4E6, 0x9006,
0xC4E7, 0x6EBA,
0xC4E8, 0x852B,
0xC4E9, 0x62C8,
0xC4EA, 0x5E74,
0xC4EB, 0x78BE,
0xC4EC, 0x64B5,
0xC4ED, 0x637B,
0xC4EE, 0x5FF5,
0xC4EF, 0x5A18,
0xC4F0, 0x917F,
0xC4F1, 0x9E1F,
0xC4F2, 0x5C3F,
0xC4F3, 0x634F,
0xC4F4, 0x8042,
0xC4F5, 0x5B7D,
0xC4F6, 0x556E,
0xC4F7, 0x954A,
0xC4F8, 0x954D,
0xC4F9, 0x6D85,
0xC4FA, 0x60A8,
0xC4FB, 0x67E0,
0xC4FC, 0x72DE,
0xC4FD, 0x51DD,
0xC4FE, 0x5B81,
0xC554, 0x81EB,
0xC560, 0x81FD,
0xC561, 0x81FF,
0xC562, 0x8203,
0xC56A, 0x8211,
0xC56B, 0x8213,
0xC572, 0x821D,
0xC573, 0x8220,
0xC578, 0x8229,
0xC579, 0x822E,
0xC57A, 0x8232,
0xC57B, 0x823A,
0xC57E, 0x823F,
0xC586, 0x8248,
0xC587, 0x824A,
0xC593, 0x8259,
0xC5A0, 0x8269,
0xC5A1, 0x62E7,
0xC5A2, 0x6CDE,
0xC5A3, 0x725B,
0xC5A4, 0x626D,
0xC5A5, 0x94AE,
0xC5A6, 0x7EBD,
0xC5A7, 0x8113,
0xC5A8, 0x6D53,
0xC5A9, 0x519C,
0xC5AA, 0x5F04,
0xC5AB, 0x5974,
0xC5AC, 0x52AA,
0xC5AD, 0x6012,
0xC5AE, 0x5973,
0xC5AF, 0x6696,
0xC5B0, 0x8650,
0xC5B1, 0x759F,
0xC5B2, 0x632A,
0xC5B3, 0x61E6,
0xC5B4, 0x7CEF,
0xC5B5, 0x8BFA,
0xC5B6, 0x54E6,
0xC5B7, 0x6B27,
0xC5B8, 0x9E25,
0xC5B9, 0x6BB4,
0xC5BA, 0x85D5,
0xC5BB, 0x5455,
0xC5BC, 0x5076,
0xC5BD, 0x6CA4,
0xC5BE, 0x556A,
0xC5BF, 0x8DB4,
0xC5C0, 0x722C,
0xC5C1, 0x5E15,
0xC5C2, 0x6015,
0xC5C3, 0x7436,
0xC5C4, 0x62CD,
0xC5C5, 0x6392,
0xC5C6, 0x724C,
0xC5C7, 0x5F98,
0xC5C8, 0x6E43,
0xC5C9, 0x6D3E,
0xC5CA, 0x6500,
0xC5CB, 0x6F58,
0xC5CC, 0x76D8,
0xC5CD, 0x78D0,
0xC5CE, 0x76FC,
0xC5CF, 0x7554,
0xC5D0, 0x5224,
0xC5D1, 0x53DB,
0xC5D2, 0x4E53,
0xC5D3, 0x5E9E,
0xC5D4, 0x65C1,
0xC5D5, 0x802A,
0xC5D6, 0x80D6,
0xC5D7, 0x629B,
0xC5D8, 0x5486,
0xC5D9, 0x5228,
0xC5DA, 0x70AE,
0xC5DB, 0x888D,
0xC5DC, 0x8DD1,
0xC5DD, 0x6CE1,
0xC5DE, 0x5478,
0xC5DF, 0x80DA,
0xC5E0, 0x57F9,
0xC5E1, 0x88F4,
0xC5E2, 0x8D54,
0xC5E3, 0x966A,
0xC5E4, 0x914D,
0xC5E5, 0x4F69,
0xC5E6, 0x6C9B,
0xC5E7, 0x55B7,
0xC5E8, 0x76C6,
0xC5E9, 0x7830,
0xC5EA, 0x62A8,
0xC5EB, 0x70F9,
0xC5EC, 0x6F8E,
0xC5ED, 0x5F6D,
0xC5EE, 0x84EC,
0xC5EF, 0x68DA,
0xC5F0, 0x787C,
0xC5F1, 0x7BF7,
0xC5F2, 0x81A8,
0xC5F3, 0x670B,
0xC5F4, 0x9E4F,
0xC5F5, 0x6367,
0xC5F6, 0x78B0,
0xC5F7, 0x576F,
0xC5F8, 0x7812,
0xC5F9, 0x9739,
0xC5FA, 0x6279,
0xC5FB, 0x62AB,
0xC5FC, 0x5288,
0xC5FD, 0x7435,
0xC5FE, 0x6BD7,
0xC644, 0x8271,
0xC64D, 0x8283,
0xC651, 0x8289,
0xC652, 0x828C,
0xC653, 0x8290,
0xC65A, 0x829E,
0xC65B, 0x82A0,
0xC65E, 0x82A7,
0xC65F, 0x82B2,
0xC66B, 0x82C9,
0xC66C, 0x82D0,
0xC66D, 0x82D6,
0xC670, 0x82DD,
0xC671, 0x82E2,
0xC679, 0x82F0,
0xC67E, 0x82F8,
0xC680, 0x82FA,
0xC688, 0x830D,
0xC689, 0x8310,
0xC68C, 0x8316,
0xC69B, 0x832E,
0xC69C, 0x8330,
0xC69D, 0x8332,
0xC69E, 0x8337,
0xC69F, 0x833B,
0xC6A0, 0x833D,
0xC6A1, 0x5564,
0xC6A2, 0x813E,
0xC6A3, 0x75B2,
0xC6A4, 0x76AE,
0xC6A5, 0x5339,
0xC6A6, 0x75DE,
0xC6A7, 0x50FB,
0xC6A8, 0x5C41,
0xC6A9, 0x8B6C,
0xC6AA, 0x7BC7,
0xC6AB, 0x504F,
0xC6AC, 0x7247,
0xC6AD, 0x9A97,
0xC6AE, 0x98D8,
0xC6AF, 0x6F02,
0xC6B0, 0x74E2,
0xC6B1, 0x7968,
0xC6B2, 0x6487,
0xC6B3, 0x77A5,
0xC6B4, 0x62FC,
0xC6B5, 0x9891,
0xC6B6, 0x8D2B,
0xC6B7, 0x54C1,
0xC6B8, 0x8058,
0xC6B9, 0x4E52,
0xC6BA, 0x576A,
0xC6BB, 0x82F9,
0xC6BC, 0x840D,
0xC6BD, 0x5E73,
0xC6BE, 0x51ED,
0xC6BF, 0x74F6,
0xC6C0, 0x8BC4,
0xC6C1, 0x5C4F,
0xC6C2, 0x5761,
0xC6C3, 0x6CFC,
0xC6C4, 0x9887,
0xC6C5, 0x5A46,
0xC6C6, 0x7834,
0xC6C7, 0x9B44,
0xC6C8, 0x8FEB,
0xC6C9, 0x7C95,
0xC6CA, 0x5256,
0xC6CB, 0x6251,
0xC6CC, 0x94FA,
0xC6CD, 0x4EC6,
0xC6CE, 0x8386,
0xC6CF, 0x8461,
0xC6D0, 0x83E9,
0xC6D1, 0x84B2,
0xC6D2, 0x57D4,
0xC6D3, 0x6734,
0xC6D4, 0x5703,
0xC6D5, 0x666E,
0xC6D6, 0x6D66,
0xC6D7, 0x8C31,
0xC6D8, 0x66DD,
0xC6D9, 0x7011,
0xC6DA, 0x671F,
0xC6DB, 0x6B3A,
0xC6DC, 0x6816,
0xC6DD, 0x621A,
0xC6DE, 0x59BB,
0xC6DF, 0x4E03,
0xC6E0, 0x51C4,
0xC6E1, 0x6F06,
0xC6E2, 0x67D2,
0xC6E3, 0x6C8F,
0xC6E4, 0x5176,
0xC6E5, 0x68CB,
0xC6E6, 0x5947,
0xC6E7, 0x6B67,
0xC6E8, 0x7566,
0xC6E9, 0x5D0E,
0xC6EA, 0x8110,
0xC6EB, 0x9F50,
0xC6EC, 0x65D7,
0xC6ED, 0x7948,
0xC6EE, 0x7941,
0xC6EF, 0x9A91,
0xC6F0, 0x8D77,
0xC6F1, 0x5C82,
0xC6F2, 0x4E5E,
0xC6F3, 0x4F01,
0xC6F4, 0x542F,
0xC6F5, 0x5951,
0xC6F6, 0x780C,
0xC6F7, 0x5668,
0xC6F8, 0x6C14,
0xC6F9, 0x8FC4,
0xC6FA, 0x5F03,
0xC6FB, 0x6C7D,
0xC6FC, 0x6CE3,
0xC6FD, 0x8BAB,
0xC6FE, 0x6390,
0xC746, 0x8348,
0xC74C, 0x8353,
0xC752, 0x835D,
0xC753, 0x8362,
0xC773, 0x839D,
0xC774, 0x839F,
0xC780, 0x83AF,
0xC781, 0x83B5,
0xC782, 0x83BB,
0xC788, 0x83C6,
0xC78B, 0x83CB,
0xC792, 0x83D5,
0xC793, 0x83D7,
0xC797, 0x83DE,
0xC7A1, 0x6070,
0xC7A2, 0x6D3D,
0xC7A3, 0x7275,
0xC7A4, 0x6266,
0xC7A5, 0x948E,
0xC7A6, 0x94C5,
0xC7A7, 0x5343,
0xC7A8, 0x8FC1,
0xC7A9, 0x7B7E,
0xC7AA, 0x4EDF,
0xC7AB, 0x8C26,
0xC7AC, 0x4E7E,
0xC7AD, 0x9ED4,
0xC7AE, 0x94B1,
0xC7AF, 0x94B3,
0xC7B0, 0x524D,
0xC7B1, 0x6F5C,
0xC7B2, 0x9063,
0xC7B3, 0x6D45,
0xC7B4, 0x8C34,
0xC7B5, 0x5811,
0xC7B6, 0x5D4C,
0xC7B7, 0x6B20,
0xC7B8, 0x6B49,
0xC7B9, 0x67AA,
0xC7BA, 0x545B,
0xC7BB, 0x8154,
0xC7BC, 0x7F8C,
0xC7BD, 0x5899,
0xC7BE, 0x8537,
0xC7BF, 0x5F3A,
0xC7C0, 0x62A2,
0xC7C1, 0x6A47,
0xC7C2, 0x9539,
0xC7C3, 0x6572,
0xC7C4, 0x6084,
0xC7C5, 0x6865,
0xC7C6, 0x77A7,
0xC7C7, 0x4E54,
0xC7C8, 0x4FA8,
0xC7C9, 0x5DE7,
0xC7CA, 0x9798,
0xC7CB, 0x64AC,
0xC7CC, 0x7FD8,
0xC7CD, 0x5CED,
0xC7CE, 0x4FCF,
0xC7CF, 0x7A8D,
0xC7D0, 0x5207,
0xC7D1, 0x8304,
0xC7D2, 0x4E14,
0xC7D3, 0x602F,
0xC7D4, 0x7A83,
0xC7D5, 0x94A6,
0xC7D6, 0x4FB5,
0xC7D7, 0x4EB2,
0xC7D8, 0x79E6,
0xC7D9, 0x7434,
0xC7DA, 0x52E4,
0xC7DB, 0x82B9,
0xC7DC, 0x64D2,
0xC7DD, 0x79BD,
0xC7DE, 0x5BDD,
0xC7DF, 0x6C81,
0xC7E0, 0x9752,
0xC7E1, 0x8F7B,
0xC7E2, 0x6C22,
0xC7E3, 0x503E,
0xC7E4, 0x537F,
0xC7E5, 0x6E05,
0xC7E6, 0x64CE,
0xC7E7, 0x6674,
0xC7E8, 0x6C30,
0xC7E9, 0x60C5,
0xC7EA, 0x9877,
0xC7EB, 0x8BF7,
0xC7EC, 0x5E86,
0xC7ED, 0x743C,
0xC7EE, 0x7A77,
0xC7EF, 0x79CB,
0xC7F0, 0x4E18,
0xC7F1, 0x90B1,
0xC7F2, 0x7403,
0xC7F3, 0x6C42,
0xC7F4, 0x56DA,
0xC7F5, 0x914B,
0xC7F6, 0x6CC5,
0xC7F7, 0x8D8B,
0xC7F8, 0x533A,
0xC7F9, 0x86C6,
0xC7FA, 0x66F2,
0xC7FB, 0x8EAF,
0xC7FC, 0x5C48,
0xC7FD, 0x9A71,
0xC7FE, 0x6E20,
0xC84D, 0x8402,
0xC84E, 0x8405,
0xC853, 0x8410,
0xC88C, 0x8458,
0xC891, 0x8462,
0xC897, 0x846A,
0xC89B, 0x8472,
0xC89C, 0x8474,
0xC89D, 0x8477,
0xC89E, 0x8479,
0xC8A1, 0x53D6,
0xC8A2, 0x5A36,
0xC8A3, 0x9F8B,
0xC8A4, 0x8DA3,
0xC8A5, 0x53BB,
0xC8A6, 0x5708,
0xC8A7, 0x98A7,
0xC8A8, 0x6743,
0xC8A9, 0x919B,
0xC8AA, 0x6CC9,
0xC8AB, 0x5168,
0xC8AC, 0x75CA,
0xC8AD, 0x62F3,
0xC8AE, 0x72AC,
0xC8AF, 0x5238,
0xC8B0, 0x529D,
0xC8B1, 0x7F3A,
0xC8B2, 0x7094,
0xC8B3, 0x7638,
0xC8B4, 0x5374,
0xC8B5, 0x9E4A,
0xC8B6, 0x69B7,
0xC8B7, 0x786E,
0xC8B8, 0x96C0,
0xC8B9, 0x88D9,
0xC8BA, 0x7FA4,
0xC8BB, 0x7136,
0xC8BC, 0x71C3,
0xC8BD, 0x5189,
0xC8BE, 0x67D3,
0xC8BF, 0x74E4,
0xC8C0, 0x58E4,
0xC8C1, 0x6518,
0xC8C2, 0x56B7,
0xC8C3, 0x8BA9,
0xC8C4, 0x9976,
0xC8C5, 0x6270,
0xC8C6, 0x7ED5,
0xC8C7, 0x60F9,
0xC8C8, 0x70ED,
0xC8C9, 0x58EC,
0xC8CA, 0x4EC1,
0xC8CB, 0x4EBA,
0xC8CC, 0x5FCD,
0xC8CD, 0x97E7,
0xC8CE, 0x4EFB,
0xC8CF, 0x8BA4,
0xC8D0, 0x5203,
0xC8D1, 0x598A,
0xC8D2, 0x7EAB,
0xC8D3, 0x6254,
0xC8D4, 0x4ECD,
0xC8D5, 0x65E5,
0xC8D6, 0x620E,
0xC8D7, 0x8338,
0xC8D8, 0x84C9,
0xC8D9, 0x8363,
0xC8DA, 0x878D,
0xC8DB, 0x7194,
0xC8DC, 0x6EB6,
0xC8DD, 0x5BB9,
0xC8DE, 0x7ED2,
0xC8DF, 0x5197,
0xC8E0, 0x63C9,
0xC8E1, 0x67D4,
0xC8E2, 0x8089,
0xC8E3, 0x8339,
0xC8E4, 0x8815,
0xC8E5, 0x5112,
0xC8E6, 0x5B7A,
0xC8E7, 0x5982,
0xC8E8, 0x8FB1,
0xC8E9, 0x4E73,
0xC8EA, 0x6C5D,
0xC8EB, 0x5165,
0xC8EC, 0x8925,
0xC8ED, 0x8F6F,
0xC8EE, 0x962E,
0xC8EF, 0x854A,
0xC8F0, 0x745E,
0xC8F1, 0x9510,
0xC8F2, 0x95F0,
0xC8F3, 0x6DA6,
0xC8F4, 0x82E5,
0xC8F5, 0x5F31,
0xC8F6, 0x6492,
0xC8F7, 0x6D12,
0xC8F8, 0x8428,
0xC8F9, 0x816E,
0xC8FA, 0x9CC3,
0xC8FB, 0x585E,
0xC8FC, 0x8D5B,
0xC8FD, 0x4E09,
0xC8FE, 0x53C1,
0xC949, 0x848A,
0xC94A, 0x848D,
0xC953, 0x8498,
0xC969, 0x84B3,
0xC96F, 0x84BE,
0xC970, 0x84C0,
0xC97B, 0x84D2,
0xC97E, 0x84D7,
0xC985, 0x84DE,
0xC988, 0x84E4,
0xC9A1, 0x4F1E,
0xC9A2, 0x6563,
0xC9A3, 0x6851,
0xC9A4, 0x55D3,
0xC9A5, 0x4E27,
0xC9A6, 0x6414,
0xC9A7, 0x9A9A,
0xC9A8, 0x626B,
0xC9A9, 0x5AC2,
0xC9AA, 0x745F,
0xC9AB, 0x8272,
0xC9AC, 0x6DA9,
0xC9AD, 0x68EE,
0xC9AE, 0x50E7,
0xC9AF, 0x838E,
0xC9B0, 0x7802,
0xC9B1, 0x6740,
0xC9B2, 0x5239,
0xC9B3, 0x6C99,
0xC9B4, 0x7EB1,
0xC9B5, 0x50BB,
0xC9B6, 0x5565,
0xC9B7, 0x715E,
0xC9B8, 0x7B5B,
0xC9B9, 0x6652,
0xC9BA, 0x73CA,
0xC9BB, 0x82EB,
0xC9BC, 0x6749,
0xC9BD, 0x5C71,
0xC9BE, 0x5220,
0xC9BF, 0x717D,
0xC9C0, 0x886B,
0xC9C1, 0x95EA,
0xC9C2, 0x9655,
0xC9C3, 0x64C5,
0xC9C4, 0x8D61,
0xC9C5, 0x81B3,
0xC9C6, 0x5584,
0xC9C7, 0x6C55,
0xC9C8, 0x6247,
0xC9C9, 0x7F2E,
0xC9CA, 0x5892,
0xC9CB, 0x4F24,
0xC9CC, 0x5546,
0xC9CD, 0x8D4F,
0xC9CE, 0x664C,
0xC9CF, 0x4E0A,
0xC9D0, 0x5C1A,
0xC9D1, 0x88F3,
0xC9D2, 0x68A2,
0xC9D3, 0x634E,
0xC9D4, 0x7A0D,
0xC9D5, 0x70E7,
0xC9D6, 0x828D,
0xC9D7, 0x52FA,
0xC9D8, 0x97F6,
0xC9D9, 0x5C11,
0xC9DA, 0x54E8,
0xC9DB, 0x90B5,
0xC9DC, 0x7ECD,
0xC9DD, 0x5962,
0xC9DE, 0x8D4A,
0xC9DF, 0x86C7,
0xC9E2, 0x8D66,
0xC9E3, 0x6444,
0xC9E4, 0x5C04,
0xC9E5, 0x6151,
0xC9E6, 0x6D89,
0xC9E7, 0x793E,
0xC9E8, 0x8BBE,
0xC9E9, 0x7837,
0xC9EA, 0x7533,
0xC9EB, 0x547B,
0xC9EC, 0x4F38,
0xC9ED, 0x8EAB,
0xC9EE, 0x6DF1,
0xC9EF, 0x5A20,
0xC9F0, 0x7EC5,
0xC9F1, 0x795E,
0xC9F2, 0x6C88,
0xC9F3, 0x5BA1,
0xC9F4, 0x5A76,
0xC9F5, 0x751A,
0xC9F6, 0x80BE,
0xC9F7, 0x614E,
0xC9F8, 0x6E17,
0xC9F9, 0x58F0,
0xC9FA, 0x751F,
0xC9FB, 0x7525,
0xC9FC, 0x7272,
0xC9FD, 0x5347,
0xC9FE, 0x7EF3,
0xCA4D, 0x8512,
0xCA57, 0x8520,
0xCA97, 0x8573,
0xCAA1, 0x7701,
0xCAA2, 0x76DB,
0xCAA3, 0x5269,
0xCAA4, 0x80DC,
0xCAA5, 0x5723,
0xCAA6, 0x5E08,
0xCAA7, 0x5931,
0xCAA8, 0x72EE,
0xCAA9, 0x65BD,
0xCAAA, 0x6E7F,
0xCAAB, 0x8BD7,
0xCAAC, 0x5C38,
0xCAAD, 0x8671,
0xCAAE, 0x5341,
0xCAAF, 0x77F3,
0xCAB0, 0x62FE,
0xCAB1, 0x65F6,
0xCAB2, 0x4EC0,
0xCAB3, 0x98DF,
0xCAB4, 0x8680,
0xCAB5, 0x5B9E,
0xCAB6, 0x8BC6,
0xCAB7, 0x53F2,
0xCAB8, 0x77E2,
0xCAB9, 0x4F7F,
0xCABA, 0x5C4E,
0xCABB, 0x9A76,
0xCABC, 0x59CB,
0xCABD, 0x5F0F,
0xCABE, 0x793A,
0xCABF, 0x58EB,
0xCAC0, 0x4E16,
0xCAC1, 0x67FF,
0xCAC2, 0x4E8B,
0xCAC3, 0x62ED,
0xCAC4, 0x8A93,
0xCAC5, 0x901D,
0xCAC6, 0x52BF,
0xCAC7, 0x662F,
0xCAC8, 0x55DC,
0xCAC9, 0x566C,
0xCACA, 0x9002,
0xCACB, 0x4ED5,
0xCACC, 0x4F8D,
0xCACD, 0x91CA,
0xCACE, 0x9970,
0xCACF, 0x6C0F,
0xCAD0, 0x5E02,
0xCAD1, 0x6043,
0xCAD2, 0x5BA4,
0xCAD3, 0x89C6,
0xCAD4, 0x8BD5,
0xCAD5, 0x6536,
0xCAD6, 0x624B,
0xCAD7, 0x9996,
0xCAD8, 0x5B88,
0xCAD9, 0x5BFF,
0xCADA, 0x6388,
0xCADB, 0x552E,
0xCADC, 0x53D7,
0xCADD, 0x7626,
0xCADE, 0x517D,
0xCADF, 0x852C,
0xCAE0, 0x67A2,
0xCAE1, 0x68B3,
0xCAE2, 0x6B8A,
0xCAE3, 0x6292,
0xCAE4, 0x8F93,
0xCAE5, 0x53D4,
0xCAE6, 0x8212,
0xCAE7, 0x6DD1,
0xCAE8, 0x758F,
0xCAE9, 0x4E66,
0xCAEA, 0x8D4E,
0xCAEB, 0x5B70,
0xCAEC, 0x719F,
0xCAED, 0x85AF,
0xCAEE, 0x6691,
0xCAEF, 0x66D9,
0xCAF0, 0x7F72,
0xCAF1, 0x8700,
0xCAF2, 0x9ECD,
0xCAF3, 0x9F20,
0xCAF4, 0x5C5E,
0xCAF5, 0x672F,
0xCAF6, 0x8FF0,
0xCAF7, 0x6811,
0xCAF8, 0x675F,
0xCAF9, 0x620D,
0xCAFA, 0x7AD6,
0xCAFB, 0x5885,
0xCAFC, 0x5EB6,
0xCAFD, 0x6570,
0xCAFE, 0x6F31,
0xCB42, 0x8586,
0xCB5F, 0x85A9,
0xCB69, 0x85B8,
0xCB80, 0x85D4,
0xCBA1, 0x6055,
0xCBA2, 0x5237,
0xCBA3, 0x800D,
0xCBA4, 0x6454,
0xCBA5, 0x8870,
0xCBA6, 0x7529,
0xCBA7, 0x5E05,
0xCBA8, 0x6813,
0xCBA9, 0x62F4,
0xCBAA, 0x971C,
0xCBAB, 0x53CC,
0xCBAC, 0x723D,
0xCBAD, 0x8C01,
0xCBAE, 0x6C34,
0xCBAF, 0x7761,
0xCBB0, 0x7A0E,
0xCBB1, 0x542E,
0xCBB2, 0x77AC,
0xCBB3, 0x987A,
0xCBB4, 0x821C,
0xCBB5, 0x8BF4,
0xCBB6, 0x7855,
0xCBB7, 0x6714,
0xCBB8, 0x70C1,
0xCBB9, 0x65AF,
0xCBBA, 0x6495,
0xCBBB, 0x5636,
0xCBBC, 0x601D,
0xCBBD, 0x79C1,
0xCBBE, 0x53F8,
0xCBBF, 0x4E1D,
0xCBC0, 0x6B7B,
0xCBC1, 0x8086,
0xCBC2, 0x5BFA,
0xCBC3, 0x55E3,
0xCBC4, 0x56DB,
0xCBC5, 0x4F3A,
0xCBC6, 0x4F3C,
0xCBC7, 0x9972,
0xCBC8, 0x5DF3,
0xCBC9, 0x677E,
0xCBCA, 0x8038,
0xCBCB, 0x6002,
0xCBCC, 0x9882,
0xCBCD, 0x9001,
0xCBCE, 0x5B8B,
0xCBCF, 0x8BBC,
0xCBD0, 0x8BF5,
0xCBD1, 0x641C,
0xCBD2, 0x8258,
0xCBD3, 0x64DE,
0xCBD4, 0x55FD,
0xCBD5, 0x82CF,
0xCBD6, 0x9165,
0xCBD7, 0x4FD7,
0xCBD8, 0x7D20,
0xCBD9, 0x901F,
0xCBDA, 0x7C9F,
0xCBDB, 0x50F3,
0xCBDC, 0x5851,
0xCBDD, 0x6EAF,
0xCBDE, 0x5BBF,
0xCBDF, 0x8BC9,
0xCBE0, 0x8083,
0xCBE1, 0x9178,
0xCBE2, 0x849C,
0xCBE3, 0x7B97,
0xCBE4, 0x867D,
0xCBE5, 0x968B,
0xCBE6, 0x968F,
0xCBE7, 0x7EE5,
0xCBE8, 0x9AD3,
0xCBE9, 0x788E,
0xCBEA, 0x5C81,
0xCBEB, 0x7A57,
0xCBEC, 0x9042,
0xCBED, 0x96A7,
0xCBEE, 0x795F,
0xCBEF, 0x5B59,
0xCBF0, 0x635F,
0xCBF1, 0x7B0B,
0xCBF2, 0x84D1,
0xCBF3, 0x68AD,
0xCBF4, 0x5506,
0xCBF5, 0x7F29,
0xCBF6, 0x7410,
0xCBF7, 0x7D22,
0xCBF8, 0x9501,
0xCBF9, 0x6240,
0xCBFA, 0x584C,
0xCBFB, 0x4ED6,
0xCBFC, 0x5B83,
0xCBFD, 0x5979,
0xCBFE, 0x5854,
0xCC69, 0x8628,
0xCCA1, 0x736D,
0xCCA2, 0x631E,
0xCCA3, 0x8E4B,
0xCCA4, 0x8E0F,
0xCCA5, 0x80CE,
0xCCA6, 0x82D4,
0xCCA7, 0x62AC,
0xCCA8, 0x53F0,
0xCCA9, 0x6CF0,
0xCCAA, 0x915E,
0xCCAB, 0x592A,
0xCCAC, 0x6001,
0xCCAD, 0x6C70,
0xCCAE, 0x574D,
0xCCAF, 0x644A,
0xCCB0, 0x8D2A,
0xCCB1, 0x762B,
0xCCB2, 0x6EE9,
0xCCB3, 0x575B,
0xCCB4, 0x6A80,
0xCCB5, 0x75F0,
0xCCB6, 0x6F6D,
0xCCB7, 0x8C2D,
0xCCB8, 0x8C08,
0xCCB9, 0x5766,
0xCCBA, 0x6BEF,
0xCCBB, 0x8892,
0xCCBC, 0x78B3,
0xCCBD, 0x63A2,
0xCCBE, 0x53F9,
0xCCBF, 0x70AD,
0xCCC0, 0x6C64,
0xCCC1, 0x5858,
0xCCC2, 0x642A,
0xCCC3, 0x5802,
0xCCC4, 0x68E0,
0xCCC5, 0x819B,
0xCCC6, 0x5510,
0xCCC7, 0x7CD6,
0xCCC8, 0x5018,
0xCCC9, 0x8EBA,
0xCCCA, 0x6DCC,
0xCCCB, 0x8D9F,
0xCCCC, 0x70EB,
0xCCCD, 0x638F,
0xCCCE, 0x6D9B,
0xCCCF, 0x6ED4,
0xCCD0, 0x7EE6,
0xCCD1, 0x8404,
0xCCD2, 0x6843,
0xCCD3, 0x9003,
0xCCD4, 0x6DD8,
0xCCD5, 0x9676,
0xCCD6, 0x8BA8,
0xCCD7, 0x5957,
0xCCD8, 0x7279,
0xCCD9, 0x85E4,
0xCCDA, 0x817E,
0xCCDB, 0x75BC,
0xCCDC, 0x8A8A,
0xCCDD, 0x68AF,
0xCCDE, 0x5254,
0xCCDF, 0x8E22,
0xCCE0, 0x9511,
0xCCE1, 0x63D0,
0xCCE2, 0x9898,
0xCCE3, 0x8E44,
0xCCE4, 0x557C,
0xCCE5, 0x4F53,
0xCCE6, 0x66FF,
0xCCE7, 0x568F,
0xCCE8, 0x60D5,
0xCCE9, 0x6D95,
0xCCEA, 0x5243,
0xCCEB, 0x5C49,
0xCCEC, 0x5929,
0xCCED, 0x6DFB,
0xCCEE, 0x586B,
0xCCEF, 0x7530,
0xCCF0, 0x751C,
0xCCF1, 0x606C,
0xCCF2, 0x8214,
0xCCF3, 0x8146,
0xCCF4, 0x6311,
0xCCF5, 0x6761,
0xCCF6, 0x8FE2,
0xCCF7, 0x773A,
0xCCF8, 0x8DF3,
0xCCF9, 0x8D34,
0xCCFA, 0x94C1,
0xCCFB, 0x5E16,
0xCCFC, 0x5385,
0xCCFD, 0x542C,
0xCCFE, 0x70C3,
0xCD40, 0x866D,
0xCD56, 0x8694,
0xCD64, 0x86AB,
0xCD74, 0x86C5,
0xCD75, 0x86C8,
0xCD7D, 0x86DA,
0xCD7E, 0x86DC,
0xCD80, 0x86DD,
0xCD8C, 0x86EF,
0xCD94, 0x86FF,
0xCD95, 0x8701,
0xCD9F, 0x8714,
0xCDA0, 0x8716,
0xCDA1, 0x6C40,
0xCDA2, 0x5EF7,
0xCDA3, 0x505C,
0xCDA4, 0x4EAD,
0xCDA5, 0x5EAD,
0xCDA6, 0x633A,
0xCDA7, 0x8247,
0xCDA8, 0x901A,
0xCDA9, 0x6850,
0xCDAA, 0x916E,
0xCDAB, 0x77B3,
0xCDAC, 0x540C,
0xCDAD, 0x94DC,
0xCDAE, 0x5F64,
0xCDAF, 0x7AE5,
0xCDB0, 0x6876,
0xCDB1, 0x6345,
0xCDB2, 0x7B52,
0xCDB3, 0x7EDF,
0xCDB4, 0x75DB,
0xCDB5, 0x5077,
0xCDB6, 0x6295,
0xCDB7, 0x5934,
0xCDB8, 0x900F,
0xCDB9, 0x51F8,
0xCDBA, 0x79C3,
0xCDBB, 0x7A81,
0xCDBC, 0x56FE,
0xCDBD, 0x5F92,
0xCDBE, 0x9014,
0xCDBF, 0x6D82,
0xCDC0, 0x5C60,
0xCDC1, 0x571F,
0xCDC2, 0x5410,
0xCDC3, 0x5154,
0xCDC4, 0x6E4D,
0xCDC5, 0x56E2,
0xCDC6, 0x63A8,
0xCDC7, 0x9893,
0xCDC8, 0x817F,
0xCDC9, 0x8715,
0xCDCA, 0x892A,
0xCDCB, 0x9000,
0xCDCC, 0x541E,
0xCDCD, 0x5C6F,
0xCDCE, 0x81C0,
0xCDCF, 0x62D6,
0xCDD0, 0x6258,
0xCDD1, 0x8131,
0xCDD2, 0x9E35,
0xCDD3, 0x9640,
0xCDD4, 0x9A6E,
0xCDD5, 0x9A7C,
0xCDD6, 0x692D,
0xCDD7, 0x59A5,
0xCDD8, 0x62D3,
0xCDD9, 0x553E,
0xCDDA, 0x6316,
0xCDDB, 0x54C7,
0xCDDC, 0x86D9,
0xCDDD, 0x6D3C,
0xCDDE, 0x5A03,
0xCDDF, 0x74E6,
0xCDE0, 0x889C,
0xCDE1, 0x6B6A,
0xCDE2, 0x5916,
0xCDE3, 0x8C4C,
0xCDE4, 0x5F2F,
0xCDE5, 0x6E7E,
0xCDE6, 0x73A9,
0xCDE7, 0x987D,
0xCDE8, 0x4E38,
0xCDE9, 0x70F7,
0xCDEA, 0x5B8C,
0xCDEB, 0x7897,
0xCDEC, 0x633D,
0xCDED, 0x665A,
0xCDEE, 0x7696,
0xCDEF, 0x60CB,
0xCDF0, 0x5B9B,
0xCDF1, 0x5A49,
0xCDF2, 0x4E07,
0xCDF3, 0x8155,
0xCDF4, 0x6C6A,
0xCDF5, 0x738B,
0xCDF6, 0x4EA1,
0xCDF7, 0x6789,
0xCDF8, 0x7F51,
0xCDF9, 0x5F80,
0xCDFA, 0x65FA,
0xCDFB, 0x671B,
0xCDFC, 0x5FD8,
0xCDFD, 0x5984,
0xCDFE, 0x5A01,
0xCE40, 0x8719,
0xCE41, 0x871B,
0xCE42, 0x871D,
0xCE45, 0x8724,
0xCE61, 0x874D,
0xCE69, 0x8758,
0xCE7A, 0x876F,
0xCE7E, 0x8775,
0xCE87, 0x8784,
0xCE8C, 0x878C,
0xCEA1, 0x5DCD,
0xCEA2, 0x5FAE,
0xCEA3, 0x5371,
0xCEA4, 0x97E6,
0xCEA5, 0x8FDD,
0xCEA6, 0x6845,
0xCEA7, 0x56F4,
0xCEA8, 0x552F,
0xCEA9, 0x60DF,
0xCEAA, 0x4E3A,
0xCEAB, 0x6F4D,
0xCEAC, 0x7EF4,
0xCEAD, 0x82C7,
0xCEAE, 0x840E,
0xCEAF, 0x59D4,
0xCEB0, 0x4F1F,
0xCEB1, 0x4F2A,
0xCEB2, 0x5C3E,
0xCEB3, 0x7EAC,
0xCEB4, 0x672A,
0xCEB5, 0x851A,
0xCEB6, 0x5473,
0xCEB7, 0x754F,
0xCEB8, 0x80C3,
0xCEB9, 0x5582,
0xCEBA, 0x9B4F,
0xCEBB, 0x4F4D,
0xCEBC, 0x6E2D,
0xCEBD, 0x8C13,
0xCEBE, 0x5C09,
0xCEBF, 0x6170,
0xCEC0, 0x536B,
0xCEC1, 0x761F,
0xCEC2, 0x6E29,
0xCEC3, 0x868A,
0xCEC4, 0x6587,
0xCEC5, 0x95FB,
0xCEC6, 0x7EB9,
0xCEC7, 0x543B,
0xCEC8, 0x7A33,
0xCEC9, 0x7D0A,
0xCECA, 0x95EE,
0xCECB, 0x55E1,
0xCECC, 0x7FC1,
0xCECD, 0x74EE,
0xCECE, 0x631D,
0xCECF, 0x8717,
0xCED0, 0x6DA1,
0xCED1, 0x7A9D,
0xCED2, 0x6211,
0xCED3, 0x65A1,
0xCED4, 0x5367,
0xCED5, 0x63E1,
0xCED6, 0x6C83,
0xCED7, 0x5DEB,
0xCED8, 0x545C,
0xCED9, 0x94A8,
0xCEDA, 0x4E4C,
0xCEDB, 0x6C61,
0xCEDC, 0x8BEC,
0xCEDD, 0x5C4B,
0xCEDE, 0x65E0,
0xCEDF, 0x829C,
0xCEE0, 0x68A7,
0xCEE1, 0x543E,
0xCEE2, 0x5434,
0xCEE3, 0x6BCB,
0xCEE4, 0x6B66,
0xCEE5, 0x4E94,
0xCEE6, 0x6342,
0xCEE7, 0x5348,
0xCEE8, 0x821E,
0xCEE9, 0x4F0D,
0xCEEA, 0x4FAE,
0xCEEB, 0x575E,
0xCEEC, 0x620A,
0xCEED, 0x96FE,
0xCEEE, 0x6664,
0xCEEF, 0x7269,
0xCEF0, 0x52FF,
0xCEF1, 0x52A1,
0xCEF2, 0x609F,
0xCEF3, 0x8BEF,
0xCEF4, 0x6614,
0xCEF5, 0x7199,
0xCEF6, 0x6790,
0xCEF7, 0x897F,
0xCEF8, 0x7852,
0xCEF9, 0x77FD,
0xCEFA, 0x6670,
0xCEFB, 0x563B,
0xCEFC, 0x5438,
0xCEFD, 0x9521,
0xCEFE, 0x727A,
0xCF45, 0x87AE,
0xCF49, 0x87B4,
0xCF96, 0x8814,
0xCFA0, 0x8823,
0xCFA1, 0x7A00,
0xCFA2, 0x606F,
0xCFA3, 0x5E0C,
0xCFA4, 0x6089,
0xCFA5, 0x819D,
0xCFA6, 0x5915,
0xCFA7, 0x60DC,
0xCFA8, 0x7184,
0xCFA9, 0x70EF,
0xCFAA, 0x6EAA,
0xCFAB, 0x6C50,
0xCFAC, 0x7280,
0xCFAD, 0x6A84,
0xCFAE, 0x88AD,
0xCFAF, 0x5E2D,
0xCFB0, 0x4E60,
0xCFB1, 0x5AB3,
0xCFB2, 0x559C,
0xCFB3, 0x94E3,
0xCFB4, 0x6D17,
0xCFB5, 0x7CFB,
0xCFB6, 0x9699,
0xCFB7, 0x620F,
0xCFB8, 0x7EC6,
0xCFB9, 0x778E,
0xCFBA, 0x867E,
0xCFBB, 0x5323,
0xCFBC, 0x971E,
0xCFBD, 0x8F96,
0xCFBE, 0x6687,
0xCFBF, 0x5CE1,
0xCFC0, 0x4FA0,
0xCFC1, 0x72ED,
0xCFC2, 0x4E0B,
0xCFC3, 0x53A6,
0xCFC4, 0x590F,
0xCFC5, 0x5413,
0xCFC6, 0x6380,
0xCFC7, 0x9528,
0xCFC8, 0x5148,
0xCFC9, 0x4ED9,
0xCFCA, 0x9C9C,
0xCFCB, 0x7EA4,
0xCFCC, 0x54B8,
0xCFCD, 0x8D24,
0xCFCE, 0x8854,
0xCFCF, 0x8237,
0xCFD0, 0x95F2,
0xCFD1, 0x6D8E,
0xCFD2, 0x5F26,
0xCFD3, 0x5ACC,
0xCFD4, 0x663E,
0xCFD5, 0x9669,
0xCFD6, 0x73B0,
0xCFD7, 0x732E,
0xCFD8, 0x53BF,
0xCFD9, 0x817A,
0xCFDA, 0x9985,
0xCFDB, 0x7FA1,
0xCFDC, 0x5BAA,
0xCFDD, 0x9677,
0xCFDE, 0x9650,
0xCFDF, 0x7EBF,
0xCFE0, 0x76F8,
0xCFE1, 0x53A2,
0xCFE2, 0x9576,
0xCFE3, 0x9999,
0xCFE4, 0x7BB1,
0xCFE5, 0x8944,
0xCFE6, 0x6E58,
0xCFE7, 0x4E61,
0xCFE8, 0x7FD4,
0xCFE9, 0x7965,
0xCFEA, 0x8BE6,
0xCFEB, 0x60F3,
0xCFEC, 0x54CD,
0xCFED, 0x4EAB,
0xCFEE, 0x9879,
0xCFEF, 0x5DF7,
0xCFF0, 0x6A61,
0xCFF1, 0x50CF,
0xCFF2, 0x5411,
0xCFF3, 0x8C61,
0xCFF4, 0x8427,
0xCFF5, 0x785D,
0xCFF6, 0x9704,
0xCFF7, 0x524A,
0xCFF8, 0x54EE,
0xCFF9, 0x56A3,
0xCFFA, 0x9500,
0xCFFB, 0x6D88,
0xCFFC, 0x5BB5,
0xCFFD, 0x6DC6,
0xCFFE, 0x6653,
0xD06A, 0x8858,
0xD074, 0x886A,
0xD075, 0x886D,
0xD076, 0x886F,
0xD077, 0x8871,
0xD082, 0x8880,
0xD083, 0x8883,
0xD088, 0x888C,
0xD09A, 0x88A3,
0xD0A1, 0x5C0F,
0xD0A2, 0x5B5D,
0xD0A3, 0x6821,
0xD0A4, 0x8096,
0xD0A5, 0x5578,
0xD0A6, 0x7B11,
0xD0A7, 0x6548,
0xD0A8, 0x6954,
0xD0A9, 0x4E9B,
0xD0AA, 0x6B47,
0xD0AB, 0x874E,
0xD0AC, 0x978B,
0xD0AD, 0x534F,
0xD0AE, 0x631F,
0xD0AF, 0x643A,
0xD0B0, 0x90AA,
0xD0B1, 0x659C,
0xD0B2, 0x80C1,
0xD0B3, 0x8C10,
0xD0B4, 0x5199,
0xD0B5, 0x68B0,
0xD0B6, 0x5378,
0xD0B7, 0x87F9,
0xD0B8, 0x61C8,
0xD0B9, 0x6CC4,
0xD0BA, 0x6CFB,
0xD0BB, 0x8C22,
0xD0BC, 0x5C51,
0xD0BD, 0x85AA,
0xD0BE, 0x82AF,
0xD0BF, 0x950C,
0xD0C0, 0x6B23,
0xD0C1, 0x8F9B,
0xD0C2, 0x65B0,
0xD0C3, 0x5FFB,
0xD0C4, 0x5FC3,
0xD0C5, 0x4FE1,
0xD0C6, 0x8845,
0xD0C7, 0x661F,
0xD0C8, 0x8165,
0xD0C9, 0x7329,
0xD0CA, 0x60FA,
0xD0CB, 0x5174,
0xD0CC, 0x5211,
0xD0CD, 0x578B,
0xD0CE, 0x5F62,
0xD0CF, 0x90A2,
0xD0D0, 0x884C,
0xD0D1, 0x9192,
0xD0D2, 0x5E78,
0xD0D3, 0x674F,
0xD0D4, 0x6027,
0xD0D5, 0x59D3,
0xD0D6, 0x5144,
0xD0D7, 0x51F6,
0xD0D8, 0x80F8,
0xD0D9, 0x5308,
0xD0DA, 0x6C79,
0xD0DB, 0x96C4,
0xD0DC, 0x718A,
0xD0DD, 0x4F11,
0xD0DE, 0x4FEE,
0xD0DF, 0x7F9E,
0xD0E0, 0x673D,
0xD0E1, 0x55C5,
0xD0E2, 0x9508,
0xD0E3, 0x79C0,
0xD0E4, 0x8896,
0xD0E5, 0x7EE3,
0xD0E6, 0x589F,
0xD0E7, 0x620C,
0xD0E8, 0x9700,
0xD0E9, 0x865A,
0xD0EA, 0x5618,
0xD0EB, 0x987B,
0xD0EC, 0x5F90,
0xD0ED, 0x8BB8,
0xD0EE, 0x84C4,
0xD0EF, 0x9157,
0xD0F0, 0x53D9,
0xD0F1, 0x65ED,
0xD0F2, 0x5E8F,
0xD0F3, 0x755C,
0xD0F4, 0x6064,
0xD0F5, 0x7D6E,
0xD0F6, 0x5A7F,
0xD0F7, 0x7EEA,
0xD0F8, 0x7EED,
0xD0F9, 0x8F69,
0xD0FA, 0x55A7,
0xD0FB, 0x5BA3,
0xD0FC, 0x60AC,
0xD0FD, 0x65CB,
0xD0FE, 0x7384,
0xD140, 0x88AC,
0xD15C, 0x88D3,
0xD16F, 0x88F2,
0xD175, 0x88FD,
0xD180, 0x8909,
0xD186, 0x8911,
0xD19F, 0x8935,
0xD1A0, 0x8937,
0xD1A1, 0x9009,
0xD1A2, 0x7663,
0xD1A3, 0x7729,
0xD1A4, 0x7EDA,
0xD1A5, 0x9774,
0xD1A6, 0x859B,
0xD1A7, 0x5B66,
0xD1A8, 0x7A74,
0xD1A9, 0x96EA,
0xD1AA, 0x8840,
0xD1AB, 0x52CB,
0xD1AC, 0x718F,
0xD1AD, 0x5FAA,
0xD1AE, 0x65EC,
0xD1AF, 0x8BE2,
0xD1B0, 0x5BFB,
0xD1B1, 0x9A6F,
0xD1B2, 0x5DE1,
0xD1B3, 0x6B89,
0xD1B4, 0x6C5B,
0xD1B5, 0x8BAD,
0xD1B6, 0x8BAF,
0xD1B7, 0x900A,
0xD1B8, 0x8FC5,
0xD1B9, 0x538B,
0xD1BA, 0x62BC,
0xD1BB, 0x9E26,
0xD1BC, 0x9E2D,
0xD1BD, 0x5440,
0xD1BE, 0x4E2B,
0xD1BF, 0x82BD,
0xD1C0, 0x7259,
0xD1C1, 0x869C,
0xD1C2, 0x5D16,
0xD1C3, 0x8859,
0xD1C4, 0x6DAF,
0xD1C5, 0x96C5,
0xD1C6, 0x54D1,
0xD1C7, 0x4E9A,
0xD1C8, 0x8BB6,
0xD1C9, 0x7109,
0xD1CA, 0x54BD,
0xD1CB, 0x9609,
0xD1CC, 0x70DF,
0xD1CD, 0x6DF9,
0xD1CE, 0x76D0,
0xD1CF, 0x4E25,
0xD1D0, 0x7814,
0xD1D1, 0x8712,
0xD1D2, 0x5CA9,
0xD1D3, 0x5EF6,
0xD1D4, 0x8A00,
0xD1D5, 0x989C,
0xD1D6, 0x960E,
0xD1D7, 0x708E,
0xD1D8, 0x6CBF,
0xD1D9, 0x5944,
0xD1DA, 0x63A9,
0xD1DB, 0x773C,
0xD1DC, 0x884D,
0xD1DD, 0x6F14,
0xD1DE, 0x8273,
0xD1DF, 0x5830,
0xD1E0, 0x71D5,
0xD1E1, 0x538C,
0xD1E2, 0x781A,
0xD1E3, 0x96C1,
0xD1E4, 0x5501,
0xD1E5, 0x5F66,
0xD1E6, 0x7130,
0xD1E7, 0x5BB4,
0xD1E8, 0x8C1A,
0xD1E9, 0x9A8C,
0xD1EA, 0x6B83,
0xD1EB, 0x592E,
0xD1EC, 0x9E2F,
0xD1ED, 0x79E7,
0xD1EE, 0x6768,
0xD1EF, 0x626C,
0xD1F0, 0x4F6F,
0xD1F1, 0x75A1,
0xD1F2, 0x7F8A,
0xD1F3, 0x6D0B,
0xD1F4, 0x9633,
0xD1F5, 0x6C27,
0xD1F6, 0x4EF0,
0xD1F7, 0x75D2,
0xD1F8, 0x517B,
0xD1F9, 0x6837,
0xD1FA, 0x6F3E,
0xD1FB, 0x9080,
0xD1FC, 0x8170,
0xD1FD, 0x5996,
0xD1FE, 0x7476,
0xD27E, 0x897C,
0xD282, 0x8980,
0xD283, 0x8982,
0xD2A1, 0x6447,
0xD2A2, 0x5C27,
0xD2A3, 0x9065,
0xD2A4, 0x7A91,
0xD2A5, 0x8C23,
0xD2A6, 0x59DA,
0xD2A7, 0x54AC,
0xD2A8, 0x8200,
0xD2A9, 0x836F,
0xD2AA, 0x8981,
0xD2AB, 0x8000,
0xD2AC, 0x6930,
0xD2AD, 0x564E,
0xD2AE, 0x8036,
0xD2AF, 0x7237,
0xD2B0, 0x91CE,
0xD2B1, 0x51B6,
0xD2B2, 0x4E5F,
0xD2B3, 0x9875,
0xD2B4, 0x6396,
0xD2B5, 0x4E1A,
0xD2B6, 0x53F6,
0xD2B7, 0x66F3,
0xD2B8, 0x814B,
0xD2B9, 0x591C,
0xD2BA, 0x6DB2,
0xD2BB, 0x4E00,
0xD2BC, 0x58F9,
0xD2BD, 0x533B,
0xD2BE, 0x63D6,
0xD2BF, 0x94F1,
0xD2C0, 0x4F9D,
0xD2C1, 0x4F0A,
0xD2C2, 0x8863,
0xD2C3, 0x9890,
0xD2C4, 0x5937,
0xD2C5, 0x9057,
0xD2C6, 0x79FB,
0xD2C7, 0x4EEA,
0xD2C8, 0x80F0,
0xD2C9, 0x7591,
0xD2CA, 0x6C82,
0xD2CB, 0x5B9C,
0xD2CC, 0x59E8,
0xD2CD, 0x5F5D,
0xD2CE, 0x6905,
0xD2CF, 0x8681,
0xD2D0, 0x501A,
0xD2D1, 0x5DF2,
0xD2D2, 0x4E59,
0xD2D3, 0x77E3,
0xD2D4, 0x4EE5,
0xD2D5, 0x827A,
0xD2D6, 0x6291,
0xD2D7, 0x6613,
0xD2D8, 0x9091,
0xD2D9, 0x5C79,
0xD2DA, 0x4EBF,
0xD2DB, 0x5F79,
0xD2DC, 0x81C6,
0xD2DD, 0x9038,
0xD2DE, 0x8084,
0xD2DF, 0x75AB,
0xD2E0, 0x4EA6,
0xD2E1, 0x88D4,
0xD2E2, 0x610F,
0xD2E3, 0x6BC5,
0xD2E4, 0x5FC6,
0xD2E5, 0x4E49,
0xD2E6, 0x76CA,
0xD2E7, 0x6EA2,
0xD2E8, 0x8BE3,
0xD2E9, 0x8BAE,
0xD2EA, 0x8C0A,
0xD2EB, 0x8BD1,
0xD2EC, 0x5F02,
0xD2ED, 0x7FFC,
0xD2EE, 0x7FCC,
0xD2EF, 0x7ECE,
0xD2F0, 0x8335,
0xD2F1, 0x836B,
0xD2F2, 0x56E0,
0xD2F3, 0x6BB7,
0xD2F4, 0x97F3,
0xD2F5, 0x9634,
0xD2F6, 0x59FB,
0xD2F7, 0x541F,
0xD2F8, 0x94F6,
0xD2F9, 0x6DEB,
0xD2FA, 0x5BC5,
0xD2FB, 0x996E,
0xD2FC, 0x5C39,
0xD2FD, 0x5F15,
0xD2FE, 0x9690,
0xD35F, 0x89C3,
0xD360, 0x89CD,
0xD367, 0x89DB,
0xD368, 0x89DD,
0xD36D, 0x89E4,
0xD3A1, 0x5370,
0xD3A2, 0x82F1,
0xD3A3, 0x6A31,
0xD3A4, 0x5A74,
0xD3A5, 0x9E70,
0xD3A6, 0x5E94,
0xD3A7, 0x7F28,
0xD3A8, 0x83B9,
0xD3AB, 0x8367,
0xD3AC, 0x8747,
0xD3AD, 0x8FCE,
0xD3AE, 0x8D62,
0xD3AF, 0x76C8,
0xD3B0, 0x5F71,
0xD3B1, 0x9896,
0xD3B2, 0x786C,
0xD3B3, 0x6620,
0xD3B4, 0x54DF,
0xD3B5, 0x62E5,
0xD3B6, 0x4F63,
0xD3B7, 0x81C3,
0xD3B8, 0x75C8,
0xD3B9, 0x5EB8,
0xD3BA, 0x96CD,
0xD3BB, 0x8E0A,
0xD3BC, 0x86F9,
0xD3BD, 0x548F,
0xD3BE, 0x6CF3,
0xD3BF, 0x6D8C,
0xD3C0, 0x6C38,
0xD3C1, 0x607F,
0xD3C2, 0x52C7,
0xD3C3, 0x7528,
0xD3C4, 0x5E7D,
0xD3C5, 0x4F18,
0xD3C6, 0x60A0,
0xD3C7, 0x5FE7,
0xD3C8, 0x5C24,
0xD3C9, 0x7531,
0xD3CA, 0x90AE,
0xD3CB, 0x94C0,
0xD3CC, 0x72B9,
0xD3CD, 0x6CB9,
0xD3CE, 0x6E38,
0xD3CF, 0x9149,
0xD3D0, 0x6709,
0xD3D1, 0x53CB,
0xD3D2, 0x53F3,
0xD3D3, 0x4F51,
0xD3D4, 0x91C9,
0xD3D5, 0x8BF1,
0xD3D6, 0x53C8,
0xD3D7, 0x5E7C,
0xD3D8, 0x8FC2,
0xD3D9, 0x6DE4,
0xD3DA, 0x4E8E,
0xD3DB, 0x76C2,
0xD3DC, 0x6986,
0xD3DD, 0x865E,
0xD3DE, 0x611A,
0xD3DF, 0x8206,
0xD3E0, 0x4F59,
0xD3E1, 0x4FDE,
0xD3E2, 0x903E,
0xD3E3, 0x9C7C,
0xD3E4, 0x6109,
0xD3E5, 0x6E1D,
0xD3E6, 0x6E14,
0xD3E7, 0x9685,
0xD3E8, 0x4E88,
0xD3E9, 0x5A31,
0xD3EA, 0x96E8,
0xD3EB, 0x4E0E,
0xD3EC, 0x5C7F,
0xD3ED, 0x79B9,
0xD3EE, 0x5B87,
0xD3EF, 0x8BED,
0xD3F0, 0x7FBD,
0xD3F1, 0x7389,
0xD3F2, 0x57DF,
0xD3F3, 0x828B,
0xD3F4, 0x90C1,
0xD3F5, 0x5401,
0xD3F6, 0x9047,
0xD3F7, 0x55BB,
0xD3F8, 0x5CEA,
0xD3F9, 0x5FA1,
0xD3FA, 0x6108,
0xD3FB, 0x6B32,
0xD3FC, 0x72F1,
0xD3FD, 0x80B2,
0xD3FE, 0x8A89,
0xD4A1, 0x6D74,
0xD4A2, 0x5BD3,
0xD4A3, 0x88D5,
0xD4A4, 0x9884,
0xD4A5, 0x8C6B,
0xD4A6, 0x9A6D,
0xD4A7, 0x9E33,
0xD4A8, 0x6E0A,
0xD4A9, 0x51A4,
0xD4AA, 0x5143,
0xD4AB, 0x57A3,
0xD4AC, 0x8881,
0xD4AD, 0x539F,
0xD4AE, 0x63F4,
0xD4AF, 0x8F95,
0xD4B0, 0x56ED,
0xD4B1, 0x5458,
0xD4B2, 0x5706,
0xD4B3, 0x733F,
0xD4B4, 0x6E90,
0xD4B5, 0x7F18,
0xD4B6, 0x8FDC,
0xD4B7, 0x82D1,
0xD4B8, 0x613F,
0xD4B9, 0x6028,
0xD4BA, 0x9662,
0xD4BB, 0x66F0,
0xD4BC, 0x7EA6,
0xD4BD, 0x8D8A,
0xD4BE, 0x8DC3,
0xD4BF, 0x94A5,
0xD4C0, 0x5CB3,
0xD4C1, 0x7CA4,
0xD4C2, 0x6708,
0xD4C3, 0x60A6,
0xD4C4, 0x9605,
0xD4C5, 0x8018,
0xD4C6, 0x4E91,
0xD4C7, 0x90E7,
0xD4C8, 0x5300,
0xD4C9, 0x9668,
0xD4CA, 0x5141,
0xD4CB, 0x8FD0,
0xD4CC, 0x8574,
0xD4CD, 0x915D,
0xD4CE, 0x6655,
0xD4CF, 0x97F5,
0xD4D0, 0x5B55,
0xD4D1, 0x531D,
0xD4D2, 0x7838,
0xD4D3, 0x6742,
0xD4D4, 0x683D,
0xD4D5, 0x54C9,
0xD4D6, 0x707E,
0xD4D7, 0x5BB0,
0xD4D8, 0x8F7D,
0xD4D9, 0x518D,
0xD4DA, 0x5728,
0xD4DB, 0x54B1,
0xD4DC, 0x6512,
0xD4DD, 0x6682,
0xD4DE, 0x8D5E,
0xD4DF, 0x8D43,
0xD4E0, 0x810F,
0xD4E1, 0x846C,
0xD4E2, 0x906D,
0xD4E3, 0x7CDF,
0xD4E4, 0x51FF,
0xD4E5, 0x85FB,
0xD4E6, 0x67A3,
0xD4E7, 0x65E9,
0xD4E8, 0x6FA1,
0xD4E9, 0x86A4,
0xD4EA, 0x8E81,
0xD4EB, 0x566A,
0xD4EC, 0x9020,
0xD4ED, 0x7682,
0xD4EE, 0x7076,
0xD4EF, 0x71E5,
0xD4F0, 0x8D23,
0xD4F1, 0x62E9,
0xD4F2, 0x5219,
0xD4F3, 0x6CFD,
0xD4F4, 0x8D3C,
0xD4F5, 0x600E,
0xD4F6, 0x589E,
0xD4F7, 0x618E,
0xD4F8, 0x66FE,
0xD4F9, 0x8D60,
0xD4FA, 0x624E,
0xD4FB, 0x55B3,
0xD4FC, 0x6E23,
0xD4FD, 0x672D,
0xD4FE, 0x8F67,
0xD5A1, 0x94E1,
0xD5A2, 0x95F8,
0xD5A3, 0x7728,
0xD5A4, 0x6805,
0xD5A5, 0x69A8,
0xD5A6, 0x548B,
0xD5A7, 0x4E4D,
0xD5A8, 0x70B8,
0xD5A9, 0x8BC8,
0xD5AA, 0x6458,
0xD5AB, 0x658B,
0xD5AC, 0x5B85,
0xD5AD, 0x7A84,
0xD5AE, 0x503A,
0xD5AF, 0x5BE8,
0xD5B0, 0x77BB,
0xD5B1, 0x6BE1,
0xD5B2, 0x8A79,
0xD5B3, 0x7C98,
0xD5B4, 0x6CBE,
0xD5B5, 0x76CF,
0xD5B6, 0x65A9,
0xD5B7, 0x8F97,
0xD5B8, 0x5D2D,
0xD5B9, 0x5C55,
0xD5BA, 0x8638,
0xD5BB, 0x6808,
0xD5BC, 0x5360,
0xD5BD, 0x6218,
0xD5BE, 0x7AD9,
0xD5BF, 0x6E5B,
0xD5C0, 0x7EFD,
0xD5C1, 0x6A1F,
0xD5C2, 0x7AE0,
0xD5C3, 0x5F70,
0xD5C4, 0x6F33,
0xD5C5, 0x5F20,
0xD5C6, 0x638C,
0xD5C7, 0x6DA8,
0xD5C8, 0x6756,
0xD5C9, 0x4E08,
0xD5CA, 0x5E10,
0xD5CB, 0x8D26,
0xD5CC, 0x4ED7,
0xD5CD, 0x80C0,
0xD5CE, 0x7634,
0xD5CF, 0x969C,
0xD5D0, 0x62DB,
0xD5D1, 0x662D,
0xD5D2, 0x627E,
0xD5D3, 0x6CBC,
0xD5D4, 0x8D75,
0xD5D5, 0x7167,
0xD5D6, 0x7F69,
0xD5D7, 0x5146,
0xD5D8, 0x8087,
0xD5D9, 0x53EC,
0xD5DA, 0x906E,
0xD5DB, 0x6298,
0xD5DC, 0x54F2,
0xD5DD, 0x86F0,
0xD5DE, 0x8F99,
0xD5DF, 0x8005,
0xD5E0, 0x9517,
0xD5E1, 0x8517,
0xD5E2, 0x8FD9,
0xD5E3, 0x6D59,
0xD5E4, 0x73CD,
0xD5E5, 0x659F,
0xD5E6, 0x771F,
0xD5E7, 0x7504,
0xD5E8, 0x7827,
0xD5E9, 0x81FB,
0xD5EA, 0x8D1E,
0xD5EB, 0x9488,
0xD5EC, 0x4FA6,
0xD5ED, 0x6795,
0xD5EE, 0x75B9,
0xD5EF, 0x8BCA,
0xD5F0, 0x9707,
0xD5F1, 0x632F,
0xD5F2, 0x9547,
0xD5F3, 0x9635,
0xD5F4, 0x84B8,
0xD5F5, 0x6323,
0xD5F6, 0x7741,
0xD5F7, 0x5F81,
0xD5F8, 0x72F0,
0xD5F9, 0x4E89,
0xD5FA, 0x6014,
0xD5FB, 0x6574,
0xD5FC, 0x62EF,
0xD5FD, 0x6B63,
0xD5FE, 0x653F,
0xD6A1, 0x5E27,
0xD6A2, 0x75C7,
0xD6A3, 0x90D1,
0xD6A4, 0x8BC1,
0xD6A5, 0x829D,
0xD6A6, 0x679D,
0xD6A7, 0x652F,
0xD6A8, 0x5431,
0xD6A9, 0x8718,
0xD6AA, 0x77E5,
0xD6AB, 0x80A2,
0xD6AC, 0x8102,
0xD6AD, 0x6C41,
0xD6AE, 0x4E4B,
0xD6AF, 0x7EC7,
0xD6B0, 0x804C,
0xD6B1, 0x76F4,
0xD6B2, 0x690D,
0xD6B3, 0x6B96,
0xD6B4, 0x6267,
0xD6B5, 0x503C,
0xD6B6, 0x4F84,
0xD6B7, 0x5740,
0xD6B8, 0x6307,
0xD6B9, 0x6B62,
0xD6BA, 0x8DBE,
0xD6BB, 0x53EA,
0xD6BC, 0x65E8,
0xD6BD, 0x7EB8,
0xD6BE, 0x5FD7,
0xD6BF, 0x631A,
0xD6C0, 0x63B7,
0xD6C3, 0x7F6E,
0xD6C4, 0x5E1C,
0xD6C5, 0x5CD9,
0xD6C6, 0x5236,
0xD6C7, 0x667A,
0xD6C8, 0x79E9,
0xD6C9, 0x7A1A,
0xD6CA, 0x8D28,
0xD6CB, 0x7099,
0xD6CC, 0x75D4,
0xD6CD, 0x6EDE,
0xD6CE, 0x6CBB,
0xD6CF, 0x7A92,
0xD6D0, 0x4E2D,
0xD6D1, 0x76C5,
0xD6D2, 0x5FE0,
0xD6D3, 0x949F,
0xD6D4, 0x8877,
0xD6D5, 0x7EC8,
0xD6D6, 0x79CD,
0xD6D7, 0x80BF,
0xD6D8, 0x91CD,
0xD6D9, 0x4EF2,
0xD6DA, 0x4F17,
0xD6DB, 0x821F,
0xD6DC, 0x5468,
0xD6DD, 0x5DDE,
0xD6DE, 0x6D32,
0xD6DF, 0x8BCC,
0xD6E0, 0x7CA5,
0xD6E1, 0x8F74,
0xD6E2, 0x8098,
0xD6E3, 0x5E1A,
0xD6E4, 0x5492,
0xD6E5, 0x76B1,
0xD6E6, 0x5B99,
0xD6E7, 0x663C,
0xD6E8, 0x9AA4,
0xD6E9, 0x73E0,
0xD6EA, 0x682A,
0xD6EB, 0x86DB,
0xD6EC, 0x6731,
0xD6ED, 0x732A,
0xD6EE, 0x8BF8,
0xD6EF, 0x8BDB,
0xD6F0, 0x9010,
0xD6F1, 0x7AF9,
0xD6F2, 0x70DB,
0xD6F3, 0x716E,
0xD6F4, 0x62C4,
0xD6F5, 0x77A9,
0xD6F6, 0x5631,
0xD6F7, 0x4E3B,
0xD6F8, 0x8457,
0xD6F9, 0x67F1,
0xD6FA, 0x52A9,
0xD6FB, 0x86C0,
0xD6FC, 0x8D2E,
0xD6FD, 0x94F8,
0xD6FE, 0x7B51,
0xD799, 0x8BAC,
0xD79A, 0x8BB1,
0xD79B, 0x8BBB,
0xD79C, 0x8BC7,
0xD79D, 0x8BD0,
0xD79E, 0x8BEA,
0xD79F, 0x8C09,
0xD7A0, 0x8C1E,
0xD7A1, 0x4F4F,
0xD7A2, 0x6CE8,
0xD7A3, 0x795D,
0xD7A4, 0x9A7B,
0xD7A5, 0x6293,
0xD7A6, 0x722A,
0xD7A7, 0x62FD,
0xD7A8, 0x4E13,
0xD7A9, 0x7816,
0xD7AA, 0x8F6C,
0xD7AB, 0x64B0,
0xD7AC, 0x8D5A,
0xD7AD, 0x7BC6,
0xD7AE, 0x6869,
0xD7AF, 0x5E84,
0xD7B0, 0x88C5,
0xD7B1, 0x5986,
0xD7B2, 0x649E,
0xD7B3, 0x58EE,
0xD7B4, 0x72B6,
0xD7B5, 0x690E,
0xD7B6, 0x9525,
0xD7B7, 0x8FFD,
0xD7B8, 0x8D58,
0xD7B9, 0x5760,
0xD7BA, 0x7F00,
0xD7BB, 0x8C06,
0xD7BC, 0x51C6,
0xD7BD, 0x6349,
0xD7BE, 0x62D9,
0xD7BF, 0x5353,
0xD7C0, 0x684C,
0xD7C1, 0x7422,
0xD7C2, 0x8301,
0xD7C3, 0x914C,
0xD7C4, 0x5544,
0xD7C5, 0x7740,
0xD7C6, 0x707C,
0xD7C7, 0x6D4A,
0xD7C8, 0x5179,
0xD7C9, 0x54A8,
0xD7CA, 0x8D44,
0xD7CB, 0x59FF,
0xD7CC, 0x6ECB,
0xD7CD, 0x6DC4,
0xD7CE, 0x5B5C,
0xD7CF, 0x7D2B,
0xD7D0, 0x4ED4,
0xD7D1, 0x7C7D,
0xD7D2, 0x6ED3,
0xD7D3, 0x5B50,
0xD7D4, 0x81EA,
0xD7D5, 0x6E0D,
0xD7D6, 0x5B57,
0xD7D7, 0x9B03,
0xD7D8, 0x68D5,
0xD7D9, 0x8E2A,
0xD7DA, 0x5B97,
0xD7DB, 0x7EFC,
0xD7DC, 0x603B,
0xD7DD, 0x7EB5,
0xD7DE, 0x90B9,
0xD7DF, 0x8D70,
0xD7E0, 0x594F,
0xD7E1, 0x63CD,
0xD7E2, 0x79DF,
0xD7E3, 0x8DB3,
0xD7E4, 0x5352,
0xD7E5, 0x65CF,
0xD7E6, 0x7956,
0xD7E7, 0x8BC5,
0xD7E8, 0x963B,
0xD7E9, 0x7EC4,
0xD7EA, 0x94BB,
0xD7EB, 0x7E82,
0xD7EC, 0x5634,
0xD7ED, 0x9189,
0xD7EE, 0x6700,
0xD7EF, 0x7F6A,
0xD7F0, 0x5C0A,
0xD7F1, 0x9075,
0xD7F2, 0x6628,
0xD7F3, 0x5DE6,
0xD7F4, 0x4F50,
0xD7F5, 0x67DE,
0xD7F6, 0x505A,
0xD7F7, 0x4F5C,
0xD7F8, 0x5750,
0xD7F9, 0x5EA7,
0xD84D, 0x8C48,
0xD880, 0x8C88,
0xD881, 0x8C8B,
0xD8A1, 0x4E8D,
0xD8A2, 0x4E0C,
0xD8A3, 0x5140,
0xD8A4, 0x4E10,
0xD8A5, 0x5EFF,
0xD8A6, 0x5345,
0xD8A7, 0x4E15,
0xD8A8, 0x4E98,
0xD8A9, 0x4E1E,
0xD8AA, 0x9B32,
0xD8AB, 0x5B6C,
0xD8AC, 0x5669,
0xD8AD, 0x4E28,
0xD8AE, 0x79BA,
0xD8AF, 0x4E3F,
0xD8B0, 0x5315,
0xD8B1, 0x4E47,
0xD8B2, 0x592D,
0xD8B3, 0x723B,
0xD8B4, 0x536E,
0xD8B5, 0x6C10,
0xD8B6, 0x56DF,
0xD8B7, 0x80E4,
0xD8B8, 0x9997,
0xD8B9, 0x6BD3,
0xD8BA, 0x777E,
0xD8BB, 0x9F17,
0xD8BC, 0x4E36,
0xD8BD, 0x4E9F,
0xD8BE, 0x9F10,
0xD8BF, 0x4E5C,
0xD8C0, 0x4E69,
0xD8C1, 0x4E93,
0xD8C2, 0x8288,
0xD8C3, 0x5B5B,
0xD8C4, 0x556C,
0xD8C5, 0x560F,
0xD8C6, 0x4EC4,
0xD8C7, 0x538D,
0xD8C8, 0x539D,
0xD8C9, 0x53A3,
0xD8CA, 0x53A5,
0xD8CB, 0x53AE,
0xD8CC, 0x9765,
0xD8CD, 0x8D5D,
0xD8CE, 0x531A,
0xD8CF, 0x53F5,
0xD8D0, 0x5326,
0xD8D1, 0x532E,
0xD8D2, 0x533E,
0xD8D3, 0x8D5C,
0xD8D4, 0x5366,
0xD8D5, 0x5363,
0xD8D6, 0x5202,
0xD8D7, 0x5208,
0xD8D8, 0x520E,
0xD8D9, 0x522D,
0xD8DA, 0x5233,
0xD8DD, 0x524C,
0xD8DE, 0x525E,
0xD8DF, 0x5261,
0xD8E0, 0x525C,
0xD8E1, 0x84AF,
0xD8E2, 0x527D,
0xD8E3, 0x5282,
0xD8E4, 0x5281,
0xD8E5, 0x5290,
0xD8E6, 0x5293,
0xD8E7, 0x5182,
0xD8E8, 0x7F54,
0xD8E9, 0x4EBB,
0xD8EA, 0x4EC3,
0xD8EB, 0x4EC9,
0xD8EC, 0x4EC2,
0xD8ED, 0x4EE8,
0xD8EE, 0x4EE1,
0xD8EF, 0x4EEB,
0xD8F0, 0x4EDE,
0xD8F1, 0x4F1B,
0xD8F2, 0x4EF3,
0xD8F3, 0x4F22,
0xD8F4, 0x4F64,
0xD8F5, 0x4EF5,
0xD8F6, 0x4F25,
0xD8F7, 0x4F27,
0xD8F8, 0x4F09,
0xD8F9, 0x4F2B,
0xD8FA, 0x4F5E,
0xD8FB, 0x4F67,
0xD8FC, 0x6538,
0xD8FD, 0x4F5A,
0xD8FE, 0x4F5D,
0xD9A1, 0x4F5F,
0xD9A2, 0x4F57,
0xD9A3, 0x4F32,
0xD9A4, 0x4F3D,
0xD9A5, 0x4F76,
0xD9A6, 0x4F74,
0xD9A7, 0x4F91,
0xD9A8, 0x4F89,
0xD9A9, 0x4F83,
0xD9AA, 0x4F8F,
0xD9AB, 0x4F7E,
0xD9AC, 0x4F7B,
0xD9AD, 0x4FAA,
0xD9AE, 0x4F7C,
0xD9AF, 0x4FAC,
0xD9B0, 0x4F94,
0xD9B1, 0x4FE6,
0xD9B2, 0x4FE8,
0xD9B3, 0x4FEA,
0xD9B4, 0x4FC5,
0xD9B5, 0x4FDA,
0xD9B6, 0x4FE3,
0xD9B7, 0x4FDC,
0xD9B8, 0x4FD1,
0xD9B9, 0x4FDF,
0xD9BA, 0x4FF8,
0xD9BB, 0x5029,
0xD9BC, 0x504C,
0xD9BD, 0x4FF3,
0xD9BE, 0x502C,
0xD9BF, 0x500F,
0xD9C0, 0x502E,
0xD9C1, 0x502D,
0xD9C2, 0x4FFE,
0xD9C3, 0x501C,
0xD9C4, 0x500C,
0xD9C5, 0x5025,
0xD9C6, 0x5028,
0xD9C7, 0x507E,
0xD9C8, 0x5043,
0xD9C9, 0x5055,
0xD9CA, 0x5048,
0xD9CB, 0x504E,
0xD9CC, 0x506C,
0xD9CD, 0x507B,
0xD9CE, 0x50A5,
0xD9CF, 0x50A7,
0xD9D0, 0x50A9,
0xD9D1, 0x50BA,
0xD9D2, 0x50D6,
0xD9D3, 0x5106,
0xD9D4, 0x50ED,
0xD9D5, 0x50EC,
0xD9D6, 0x50E6,
0xD9D7, 0x50EE,
0xD9D8, 0x5107,
0xD9D9, 0x510B,
0xD9DA, 0x4EDD,
0xD9DB, 0x6C3D,
0xD9DC, 0x4F58,
0xD9DD, 0x4F65,
0xD9DE, 0x4FCE,
0xD9DF, 0x9FA0,
0xD9E0, 0x6C46,
0xD9E1, 0x7C74,
0xD9E2, 0x516E,
0xD9E3, 0x5DFD,
0xD9E4, 0x9EC9,
0xD9E5, 0x9998,
0xD9E6, 0x5181,
0xD9E7, 0x5914,
0xD9E8, 0x52F9,
0xD9E9, 0x530D,
0xD9EA, 0x8A07,
0xD9EB, 0x5310,
0xD9EC, 0x51EB,
0xD9ED, 0x5919,
0xD9EE, 0x5155,
0xD9EF, 0x4EA0,
0xD9F0, 0x5156,
0xD9F1, 0x4EB3,
0xD9F2, 0x886E,
0xD9F3, 0x88A4,
0xD9F4, 0x4EB5,
0xD9F5, 0x8114,
0xD9F6, 0x88D2,
0xD9F7, 0x7980,
0xD9F8, 0x5B34,
0xD9F9, 0x8803,
0xD9FA, 0x7FB8,
0xD9FB, 0x51AB,
0xD9FC, 0x51B1,
0xD9FD, 0x51BD,
0xD9FE, 0x51BC,
0xDA4F, 0x8D20,
0xDA52, 0x8D57,
0xDA53, 0x8D5F,
0xDA54, 0x8D65,
0xDA58, 0x8D6C,
0xDA80, 0x8DA2,
0xDA8E, 0x8DB2,
0xDA91, 0x8DB9,
0xDA92, 0x8DBB,
0xDA93, 0x8DBD,
0xDA97, 0x8DC5,
0xDA9C, 0x8DCD,
0xDA9D, 0x8DD0,
0xDAA1, 0x51C7,
0xDAA2, 0x5196,
0xDAA3, 0x51A2,
0xDAA4, 0x51A5,
0xDAA5, 0x8BA0,
0xDAA8, 0x8BAA,
0xDAAB, 0x8BB7,
0xDAAE, 0x8BCB,
0xDAAF, 0x8BCF,
0xDAB0, 0x8BCE,
0xDAB4, 0x8BD6,
0xDAB7, 0x8BDC,
0xDABA, 0x8BE4,
0xDABD, 0x8BEE,
0xDABE, 0x8BF0,
0xDABF, 0x8BF3,
0xDAC0, 0x8BF6,
0xDAC1, 0x8BF9,
0xDAC2, 0x8BFC,
0xDAC5, 0x8C02,
0xDAC6, 0x8C04,
0xDAC7, 0x8C07,
0xDAC8, 0x8C0C,
0xDAC9, 0x8C0F,
0xDACF, 0x8C19,
0xDAD0, 0x8C1B,
0xDAD1, 0x8C18,
0xDAD2, 0x8C1D,
0xDAD6, 0x8C25,
0xDAD7, 0x8C27,
0xDAE0, 0x5369,
0xDAE1, 0x537A,
0xDAE2, 0x961D,
0xDAE3, 0x9622,
0xDAE4, 0x9621,
0xDAE5, 0x9631,
0xDAE6, 0x962A,
0xDAE7, 0x963D,
0xDAE8, 0x963C,
0xDAE9, 0x9642,
0xDAEA, 0x9649,
0xDAEB, 0x9654,
0xDAEC, 0x965F,
0xDAED, 0x9667,
0xDAEE, 0x966C,
0xDAEF, 0x9672,
0xDAF0, 0x9674,
0xDAF1, 0x9688,
0xDAF2, 0x968D,
0xDAF3, 0x9697,
0xDAF4, 0x96B0,
0xDAF5, 0x9097,
0xDAF6, 0x909B,
0xDAF7, 0x909D,
0xDAF8, 0x9099,
0xDAF9, 0x90AC,
0xDAFA, 0x90A1,
0xDAFB, 0x90B4,
0xDAFC, 0x90B3,
0xDAFD, 0x90B6,
0xDAFE, 0x90BA,
0xDB40, 0x8DD5,
0xDB43, 0x8DDC,
0xDB4A, 0x8DE9,
0xDB50, 0x8DF4,
0xDB51, 0x8DF6,
0xDB52, 0x8DFC,
0xDB5D, 0x8E0B,
0xDB73, 0x8E2B,
0xDB74, 0x8E2D,
0xDB75, 0x8E30,
0xDB7E, 0x8E3E,
0xDB80, 0x8E3F,
0xDB81, 0x8E43,
0xDB9F, 0x8E6E,
0xDBA0, 0x8E71,
0xDBA1, 0x90B8,
0xDBA2, 0x90B0,
0xDBA3, 0x90CF,
0xDBA4, 0x90C5,
0xDBA5, 0x90BE,
0xDBA6, 0x90D0,
0xDBA7, 0x90C4,
0xDBA8, 0x90C7,
0xDBA9, 0x90D3,
0xDBAA, 0x90E6,
0xDBAB, 0x90E2,
0xDBAC, 0x90DC,
0xDBAD, 0x90D7,
0xDBAE, 0x90DB,
0xDBAF, 0x90EB,
0xDBB0, 0x90EF,
0xDBB1, 0x90FE,
0xDBB2, 0x9104,
0xDBB3, 0x9122,
0xDBB4, 0x911E,
0xDBB5, 0x9123,
0xDBB6, 0x9131,
0xDBB7, 0x912F,
0xDBB8, 0x9139,
0xDBB9, 0x9143,
0xDBBA, 0x9146,
0xDBBB, 0x520D,
0xDBBC, 0x5942,
0xDBBD, 0x52A2,
0xDBC0, 0x52BE,
0xDBC1, 0x54FF,
0xDBC2, 0x52D0,
0xDBC3, 0x52D6,
0xDBC4, 0x52F0,
0xDBC5, 0x53DF,
0xDBC6, 0x71EE,
0xDBC7, 0x77CD,
0xDBC8, 0x5EF4,
0xDBC9, 0x51F5,
0xDBCA, 0x51FC,
0xDBCB, 0x9B2F,
0xDBCC, 0x53B6,
0xDBCD, 0x5F01,
0xDBCE, 0x755A,
0xDBCF, 0x5DEF,
0xDBD0, 0x574C,
0xDBD1, 0x57A9,
0xDBD2, 0x57A1,
0xDBD3, 0x587E,
0xDBD4, 0x58BC,
0xDBD5, 0x58C5,
0xDBD6, 0x58D1,
0xDBD7, 0x5729,
0xDBD8, 0x572C,
0xDBD9, 0x572A,
0xDBDA, 0x5733,
0xDBDB, 0x5739,
0xDBDE, 0x575C,
0xDBDF, 0x573B,
0xDBE0, 0x5742,
0xDBE1, 0x5769,
0xDBE2, 0x5785,
0xDBE3, 0x576B,
0xDBE4, 0x5786,
0xDBE5, 0x577C,
0xDBE6, 0x577B,
0xDBE7, 0x5768,
0xDBE8, 0x576D,
0xDBE9, 0x5776,
0xDBEA, 0x5773,
0xDBEB, 0x57AD,
0xDBEC, 0x57A4,
0xDBED, 0x578C,
0xDBEE, 0x57B2,
0xDBEF, 0x57CF,
0xDBF0, 0x57A7,
0xDBF1, 0x57B4,
0xDBF2, 0x5793,
0xDBF3, 0x57A0,
0xDBF4, 0x57D5,
0xDBF5, 0x57D8,
0xDBF6, 0x57DA,
0xDBF7, 0x57D9,
0xDBF8, 0x57D2,
0xDBF9, 0x57B8,
0xDBFA, 0x57F4,
0xDBFB, 0x57EF,
0xDBFC, 0x57F8,
0xDBFD, 0x57E4,
0xDBFE, 0x57DD,
0xDC40, 0x8E73,
0xDC41, 0x8E75,
0xDC49, 0x8E80,
0xDC4D, 0x8E86,
0xDC5F, 0x8E9D,
0xDCA1, 0x580B,
0xDCA2, 0x580D,
0xDCA3, 0x57FD,
0xDCA4, 0x57ED,
0xDCA5, 0x5800,
0xDCA6, 0x581E,
0xDCA7, 0x5819,
0xDCA8, 0x5844,
0xDCA9, 0x5820,
0xDCAA, 0x5865,
0xDCAB, 0x586C,
0xDCAC, 0x5881,
0xDCAD, 0x5889,
0xDCAE, 0x589A,
0xDCAF, 0x5880,
0xDCB0, 0x99A8,
0xDCB1, 0x9F19,
0xDCB2, 0x61FF,
0xDCB3, 0x8279,
0xDCB4, 0x827D,
0xDCB5, 0x827F,
0xDCB6, 0x828F,
0xDCB7, 0x828A,
0xDCB8, 0x82A8,
0xDCB9, 0x8284,
0xDCBA, 0x828E,
0xDCBB, 0x8291,
0xDCBC, 0x8297,
0xDCBD, 0x8299,
0xDCBE, 0x82AB,
0xDCBF, 0x82B8,
0xDCC0, 0x82BE,
0xDCC1, 0x82B0,
0xDCC2, 0x82C8,
0xDCC3, 0x82CA,
0xDCC4, 0x82E3,
0xDCC5, 0x8298,
0xDCC6, 0x82B7,
0xDCC7, 0x82AE,
0xDCCA, 0x82C1,
0xDCCB, 0x82A9,
0xDCCC, 0x82B4,
0xDCCD, 0x82A1,
0xDCCE, 0x82AA,
0xDCCF, 0x829F,
0xDCD0, 0x82C4,
0xDCD1, 0x82CE,
0xDCD2, 0x82A4,
0xDCD3, 0x82E1,
0xDCD4, 0x8309,
0xDCD5, 0x82F7,
0xDCD6, 0x82E4,
0xDCD7, 0x830F,
0xDCD8, 0x8307,
0xDCD9, 0x82DC,
0xDCDA, 0x82F4,
0xDCDB, 0x82D2,
0xDCDC, 0x82D8,
0xDCDD, 0x830C,
0xDCDE, 0x82FB,
0xDCDF, 0x82D3,
0xDCE0, 0x8311,
0xDCE1, 0x831A,
0xDCE2, 0x8306,
0xDCE5, 0x82E0,
0xDCE6, 0x82D5,
0xDCE7, 0x831C,
0xDCE8, 0x8351,
0xDCEB, 0x8308,
0xDCEC, 0x8392,
0xDCED, 0x833C,
0xDCEE, 0x8334,
0xDCEF, 0x8331,
0xDCF0, 0x839B,
0xDCF1, 0x835E,
0xDCF2, 0x832F,
0xDCF3, 0x834F,
0xDCF4, 0x8347,
0xDCF5, 0x8343,
0xDCF6, 0x835F,
0xDCF7, 0x8340,
0xDCF8, 0x8317,
0xDCF9, 0x8360,
0xDCFA, 0x832D,
0xDCFB, 0x833A,
0xDCFC, 0x8333,
0xDCFD, 0x8366,
0xDCFE, 0x8365,
0xDDA1, 0x8368,
0xDDA2, 0x831B,
0xDDA3, 0x8369,
0xDDA4, 0x836C,
0xDDA5, 0x836A,
0xDDA8, 0x83B0,
0xDDA9, 0x8378,
0xDDAC, 0x83A0,
0xDDAD, 0x83AA,
0xDDAE, 0x8393,
0xDDAF, 0x839C,
0xDDB0, 0x8385,
0xDDB1, 0x837C,
0xDDB2, 0x83B6,
0xDDB3, 0x83A9,
0xDDB4, 0x837D,
0xDDB5, 0x83B8,
0xDDB6, 0x837B,
0xDDB7, 0x8398,
0xDDB8, 0x839E,
0xDDB9, 0x83A8,
0xDDBA, 0x83BA,
0xDDBB, 0x83BC,
0xDDBC, 0x83C1,
0xDDBD, 0x8401,
0xDDBE, 0x83E5,
0xDDBF, 0x83D8,
0xDDC0, 0x5807,
0xDDC1, 0x8418,
0xDDC2, 0x840B,
0xDDC3, 0x83DD,
0xDDC4, 0x83FD,
0xDDC5, 0x83D6,
0xDDC6, 0x841C,
0xDDC7, 0x8438,
0xDDC8, 0x8411,
0xDDC9, 0x8406,
0xDDCA, 0x83D4,
0xDDCB, 0x83DF,
0xDDCC, 0x840F,
0xDDCD, 0x8403,
0xDDD0, 0x83EA,
0xDDD1, 0x83C5,
0xDDD2, 0x83C0,
0xDDD3, 0x8426,
0xDDD4, 0x83F0,
0xDDD5, 0x83E1,
0xDDD6, 0x845C,
0xDDD7, 0x8451,
0xDDD8, 0x845A,
0xDDD9, 0x8459,
0xDDDA, 0x8473,
0xDDDD, 0x847A,
0xDDDE, 0x8489,
0xDDDF, 0x8478,
0xDDE0, 0x843C,
0xDDE1, 0x8446,
0xDDE2, 0x8469,
0xDDE3, 0x8476,
0xDDE4, 0x848C,
0xDDE5, 0x848E,
0xDDE6, 0x8431,
0xDDE7, 0x846D,
0xDDE8, 0x84C1,
0xDDE9, 0x84CD,
0xDDEA, 0x84D0,
0xDDEB, 0x84E6,
0xDDEC, 0x84BD,
0xDDED, 0x84D3,
0xDDEE, 0x84CA,
0xDDEF, 0x84BF,
0xDDF0, 0x84BA,
0xDDF1, 0x84E0,
0xDDF2, 0x84A1,
0xDDF3, 0x84B9,
0xDDF4, 0x84B4,
0xDDF5, 0x8497,
0xDDF6, 0x84E5,
0xDDF7, 0x84E3,
0xDDF8, 0x850C,
0xDDF9, 0x750D,
0xDDFA, 0x8538,
0xDDFB, 0x84F0,
0xDDFC, 0x8539,
0xDDFD, 0x851F,
0xDDFE, 0x853A,
0xDE61, 0x8F6A,
0xDE62, 0x8F80,
0xDE63, 0x8F8C,
0xDE64, 0x8F92,
0xDE65, 0x8F9D,
0xDE6D, 0x8FAA,
0xDE7D, 0x8FC3,
0xDE7E, 0x8FC6,
0xDE85, 0x8FCF,
0xDE86, 0x8FD2,
0xDE89, 0x8FDA,
0xDE8C, 0x8FE3,
0xDE8D, 0x8FE7,
0xDE8E, 0x8FEC,
0xDE8F, 0x8FEF,
0xDE9C, 0x900C,
0xDE9D, 0x900E,
0xDE9E, 0x9013,
0xDE9F, 0x9015,
0xDEA0, 0x9018,
0xDEA1, 0x8556,
0xDEA2, 0x853B,
0xDEA3, 0x84FF,
0xDEA4, 0x84FC,
0xDEA5, 0x8559,
0xDEA6, 0x8548,
0xDEA7, 0x8568,
0xDEA8, 0x8564,
0xDEA9, 0x855E,
0xDEAA, 0x857A,
0xDEAB, 0x77A2,
0xDEAC, 0x8543,
0xDEAD, 0x8572,
0xDEAE, 0x857B,
0xDEAF, 0x85A4,
0xDEB0, 0x85A8,
0xDEB1, 0x8587,
0xDEB2, 0x858F,
0xDEB3, 0x8579,
0xDEB4, 0x85AE,
0xDEB5, 0x859C,
0xDEB6, 0x8585,
0xDEB7, 0x85B9,
0xDEB8, 0x85B7,
0xDEB9, 0x85B0,
0xDEBA, 0x85D3,
0xDEBB, 0x85C1,
0xDEBC, 0x85DC,
0xDEBD, 0x85FF,
0xDEBE, 0x8627,
0xDEBF, 0x8605,
0xDEC0, 0x8629,
0xDEC1, 0x8616,
0xDEC2, 0x863C,
0xDEC3, 0x5EFE,
0xDEC4, 0x5F08,
0xDEC5, 0x593C,
0xDEC6, 0x5941,
0xDEC7, 0x8037,
0xDEC8, 0x5955,
0xDEC9, 0x595A,
0xDECA, 0x5958,
0xDECB, 0x530F,
0xDECC, 0x5C22,
0xDECD, 0x5C25,
0xDECE, 0x5C2C,
0xDECF, 0x5C34,
0xDED0, 0x624C,
0xDED1, 0x626A,
0xDED2, 0x629F,
0xDED3, 0x62BB,
0xDED4, 0x62CA,
0xDED5, 0x62DA,
0xDED6, 0x62D7,
0xDED7, 0x62EE,
0xDED8, 0x6322,
0xDED9, 0x62F6,
0xDEDA, 0x6339,
0xDEDB, 0x634B,
0xDEDC, 0x6343,
0xDEDD, 0x63AD,
0xDEDE, 0x63F6,
0xDEDF, 0x6371,
0xDEE0, 0x637A,
0xDEE1, 0x638E,
0xDEE2, 0x63B4,
0xDEE3, 0x636D,
0xDEE4, 0x63AC,
0xDEE5, 0x638A,
0xDEE6, 0x6369,
0xDEE7, 0x63AE,
0xDEE8, 0x63BC,
0xDEE9, 0x63F2,
0xDEEA, 0x63F8,
0xDEEB, 0x63E0,
0xDEEC, 0x63FF,
0xDEED, 0x63C4,
0xDEEE, 0x63DE,
0xDEEF, 0x63CE,
0xDEF0, 0x6452,
0xDEF1, 0x63C6,
0xDEF2, 0x63BE,
0xDEF3, 0x6445,
0xDEF4, 0x6441,
0xDEF5, 0x640B,
0xDEF6, 0x641B,
0xDEF7, 0x6420,
0xDEF8, 0x640C,
0xDEF9, 0x6426,
0xDEFA, 0x6421,
0xDEFB, 0x645E,
0xDEFC, 0x6484,
0xDEFD, 0x646D,
0xDEFE, 0x6496,
0xDF40, 0x9019,
0xDF41, 0x901C,
0xDF50, 0x9037,
0xDF53, 0x903D,
0xDF56, 0x9043,
0xDF5E, 0x904E,
0xDF6A, 0x9064,
0xDF7D, 0x907E,
0xDF7E, 0x9081,
0xDF8B, 0x9092,
0xDF8C, 0x9094,
0xDF8D, 0x9096,
0xDF8E, 0x9098,
0xDF8F, 0x909A,
0xDF90, 0x909C,
0xDF99, 0x90AB,
0xDF9A, 0x90AD,
0xDF9B, 0x90B2,
0xDF9C, 0x90B7,
0xDFA1, 0x647A,
0xDFA4, 0x6499,
0xDFA5, 0x64BA,
0xDFA6, 0x64C0,
0xDFA7, 0x64D0,
0xDFA8, 0x64D7,
0xDFA9, 0x64E4,
0xDFAA, 0x64E2,
0xDFAB, 0x6509,
0xDFAC, 0x6525,
0xDFAD, 0x652E,
0xDFAE, 0x5F0B,
0xDFAF, 0x5FD2,
0xDFB0, 0x7519,
0xDFB1, 0x5F11,
0xDFB2, 0x535F,
0xDFB3, 0x53F1,
0xDFB4, 0x53FD,
0xDFB5, 0x53E9,
0xDFB6, 0x53E8,
0xDFB7, 0x53FB,
0xDFB8, 0x5412,
0xDFB9, 0x5416,
0xDFBA, 0x5406,
0xDFBB, 0x544B,
0xDFBF, 0x5456,
0xDFC0, 0x5443,
0xDFC1, 0x5421,
0xDFC2, 0x5457,
0xDFC3, 0x5459,
0xDFC4, 0x5423,
0xDFC5, 0x5432,
0xDFC6, 0x5482,
0xDFC7, 0x5494,
0xDFC8, 0x5477,
0xDFC9, 0x5471,
0xDFCA, 0x5464,
0xDFCD, 0x5484,
0xDFCE, 0x5476,
0xDFCF, 0x5466,
0xDFD0, 0x549D,
0xDFD1, 0x54D0,
0xDFD2, 0x54AD,
0xDFD3, 0x54C2,
0xDFD4, 0x54B4,
0xDFD5, 0x54D2,
0xDFD6, 0x54A7,
0xDFD7, 0x54A6,
0xDFDA, 0x5472,
0xDFDB, 0x54A3,
0xDFDC, 0x54D5,
0xDFDD, 0x54BB,
0xDFDE, 0x54BF,
0xDFDF, 0x54CC,
0xDFE2, 0x54DC,
0xDFE5, 0x54A4,
0xDFE6, 0x54DD,
0xDFE7, 0x54CF,
0xDFE8, 0x54DE,
0xDFE9, 0x551B,
0xDFEA, 0x54E7,
0xDFEB, 0x5520,
0xDFEC, 0x54FD,
0xDFED, 0x5514,
0xDFEE, 0x54F3,
0xDFF1, 0x550F,
0xDFF2, 0x5511,
0xDFF3, 0x5527,
0xDFF4, 0x552A,
0xDFF5, 0x5567,
0xDFF6, 0x558F,
0xDFF7, 0x55B5,
0xDFF8, 0x5549,
0xDFF9, 0x556D,
0xDFFA, 0x5541,
0xDFFB, 0x5555,
0xDFFC, 0x553F,
0xDFFD, 0x5550,
0xDFFE, 0x553C,
0xE042, 0x90C6,
0xE048, 0x90D2,
0xE057, 0x90EC,
0xE058, 0x90EE,
0xE067, 0x9103,
0xE080, 0x911D,
0xE08F, 0x9130,
0xE0A0, 0x9144,
0xE0A1, 0x5537,
0xE0A2, 0x5556,
0xE0A6, 0x5533,
0xE0A7, 0x5530,
0xE0A8, 0x555C,
0xE0A9, 0x558B,
0xE0AA, 0x55D2,
0xE0AB, 0x5583,
0xE0AC, 0x55B1,
0xE0AD, 0x55B9,
0xE0AE, 0x5588,
0xE0AF, 0x5581,
0xE0B0, 0x559F,
0xE0B1, 0x557E,
0xE0B2, 0x55D6,
0xE0B3, 0x5591,
0xE0B4, 0x557B,
0xE0B5, 0x55DF,
0xE0B8, 0x5594,
0xE0B9, 0x5599,
0xE0BA, 0x55EA,
0xE0BB, 0x55F7,
0xE0BC, 0x55C9,
0xE0BD, 0x561F,
0xE0BE, 0x55D1,
0xE0C1, 0x55D4,
0xE0C2, 0x55E6,
0xE0C3, 0x55DD,
0xE0C4, 0x55C4,
0xE0C5, 0x55EF,
0xE0C6, 0x55E5,
0xE0CB, 0x55E8,
0xE0CC, 0x55F5,
0xE0CD, 0x55E4,
0xE0CE, 0x8F94,
0xE0CF, 0x561E,
0xE0D0, 0x5608,
0xE0D1, 0x560C,
0xE0D2, 0x5601,
0xE0D3, 0x5624,
0xE0D4, 0x5623,
0xE0D5, 0x55FE,
0xE0D6, 0x5600,
0xE0D7, 0x5627,
0xE0D8, 0x562D,
0xE0D9, 0x5658,
0xE0DA, 0x5639,
0xE0DB, 0x5657,
0xE0DC, 0x562C,
0xE0DD, 0x564D,
0xE0DE, 0x5662,
0xE0DF, 0x5659,
0xE0E0, 0x565C,
0xE0E1, 0x564C,
0xE0E2, 0x5654,
0xE0E3, 0x5686,
0xE0E4, 0x5664,
0xE0E5, 0x5671,
0xE0E6, 0x566B,
0xE0E9, 0x5685,
0xE0EA, 0x5693,
0xE0EB, 0x56AF,
0xE0EC, 0x56D4,
0xE0ED, 0x56D7,
0xE0EE, 0x56DD,
0xE0EF, 0x56E1,
0xE0F0, 0x56F5,
0xE0F1, 0x56EB,
0xE0F2, 0x56F9,
0xE0F3, 0x56FF,
0xE0F4, 0x5704,
0xE0F5, 0x570A,
0xE0F6, 0x5709,
0xE0F7, 0x571C,
0xE0F8, 0x5E0F,
0xE0F9, 0x5E19,
0xE0FA, 0x5E14,
0xE0FB, 0x5E11,
0xE0FC, 0x5E31,
0xE140, 0x9145,
0xE143, 0x9151,
0xE151, 0x916B,
0xE152, 0x916D,
0xE153, 0x9173,
0xE15C, 0x9186,
0xE15D, 0x9188,
0xE15E, 0x918A,
0xE17E, 0x91BB,
0xE18B, 0x91C8,
0xE18C, 0x91CB,
0xE18D, 0x91D0,
0xE1A1, 0x5E37,
0xE1A2, 0x5E44,
0xE1A3, 0x5E54,
0xE1A4, 0x5E5B,
0xE1A5, 0x5E5E,
0xE1A6, 0x5E61,
0xE1A7, 0x5C8C,
0xE1A8, 0x5C7A,
0xE1A9, 0x5C8D,
0xE1AA, 0x5C90,
0xE1AB, 0x5C96,
0xE1AC, 0x5C88,
0xE1AF, 0x5C91,
0xE1B0, 0x5C9A,
0xE1B1, 0x5C9C,
0xE1B2, 0x5CB5,
0xE1B3, 0x5CA2,
0xE1B4, 0x5CBD,
0xE1B5, 0x5CAC,
0xE1B6, 0x5CAB,
0xE1B7, 0x5CB1,
0xE1B8, 0x5CA3,
0xE1B9, 0x5CC1,
0xE1BA, 0x5CB7,
0xE1BB, 0x5CC4,
0xE1BC, 0x5CD2,
0xE1BD, 0x5CE4,
0xE1BE, 0x5CCB,
0xE1BF, 0x5CE5,
0xE1C2, 0x5D27,
0xE1C3, 0x5D26,
0xE1C4, 0x5D2E,
0xE1C5, 0x5D24,
0xE1C6, 0x5D1E,
0xE1C7, 0x5D06,
0xE1C8, 0x5D1B,
0xE1C9, 0x5D58,
0xE1CA, 0x5D3E,
0xE1CB, 0x5D34,
0xE1CC, 0x5D3D,
0xE1CD, 0x5D6C,
0xE1CE, 0x5D5B,
0xE1CF, 0x5D6F,
0xE1D0, 0x5D5D,
0xE1D1, 0x5D6B,
0xE1D2, 0x5D4B,
0xE1D3, 0x5D4A,
0xE1D4, 0x5D69,
0xE1D5, 0x5D74,
0xE1D6, 0x5D82,
0xE1D7, 0x5D99,
0xE1D8, 0x5D9D,
0xE1D9, 0x8C73,
0xE1DA, 0x5DB7,
0xE1DB, 0x5DC5,
0xE1DC, 0x5F73,
0xE1DD, 0x5F77,
0xE1DE, 0x5F82,
0xE1DF, 0x5F87,
0xE1E0, 0x5F89,
0xE1E1, 0x5F8C,
0xE1E2, 0x5F95,
0xE1E3, 0x5F99,
0xE1E4, 0x5F9C,
0xE1E5, 0x5FA8,
0xE1E6, 0x5FAD,
0xE1E7, 0x5FB5,
0xE1E8, 0x5FBC,
0xE1E9, 0x8862,
0xE1EA, 0x5F61,
0xE1EB, 0x72AD,
0xE1EC, 0x72B0,
0xE1ED, 0x72B4,
0xE1F0, 0x72C3,
0xE1F1, 0x72C1,
0xE1F2, 0x72CE,
0xE1F3, 0x72CD,
0xE1F4, 0x72D2,
0xE1F5, 0x72E8,
0xE1F6, 0x72EF,
0xE1F7, 0x72E9,
0xE1F8, 0x72F2,
0xE1F9, 0x72F4,
0xE1FA, 0x72F7,
0xE1FB, 0x7301,
0xE1FC, 0x72F3,
0xE1FD, 0x7303,
0xE1FE, 0x72FA,
0xE2A1, 0x72FB,
0xE2A2, 0x7317,
0xE2A3, 0x7313,
0xE2A4, 0x7321,
0xE2A5, 0x730A,
0xE2A6, 0x731E,
0xE2A7, 0x731D,
0xE2A8, 0x7315,
0xE2A9, 0x7322,
0xE2AA, 0x7339,
0xE2AB, 0x7325,
0xE2AC, 0x732C,
0xE2AD, 0x7338,
0xE2AE, 0x7331,
0xE2AF, 0x7350,
0xE2B0, 0x734D,
0xE2B1, 0x7357,
0xE2B2, 0x7360,
0xE2B3, 0x736C,
0xE2B4, 0x736F,
0xE2B5, 0x737E,
0xE2B6, 0x821B,
0xE2B7, 0x5925,
0xE2B8, 0x98E7,
0xE2B9, 0x5924,
0xE2BA, 0x5902,
0xE2BB, 0x9963,
0xE2C2, 0x9974,
0xE2C3, 0x9977,
0xE2C4, 0x997D,
0xE2C5, 0x9980,
0xE2C6, 0x9984,
0xE2C7, 0x9987,
0xE2C8, 0x998A,
0xE2C9, 0x998D,
0xE2CF, 0x5E80,
0xE2D0, 0x5E91,
0xE2D1, 0x5E8B,
0xE2D2, 0x5E96,
0xE2D3, 0x5EA5,
0xE2D4, 0x5EA0,
0xE2D5, 0x5EB9,
0xE2D6, 0x5EB5,
0xE2D7, 0x5EBE,
0xE2D8, 0x5EB3,
0xE2D9, 0x8D53,
0xE2DA, 0x5ED2,
0xE2DB, 0x5ED1,
0xE2DC, 0x5EDB,
0xE2DD, 0x5EE8,
0xE2DE, 0x5EEA,
0xE2DF, 0x81BA,
0xE2E0, 0x5FC4,
0xE2E1, 0x5FC9,
0xE2E2, 0x5FD6,
0xE2E3, 0x5FCF,
0xE2E4, 0x6003,
0xE2E5, 0x5FEE,
0xE2E6, 0x6004,
0xE2E7, 0x5FE1,
0xE2E8, 0x5FE4,
0xE2E9, 0x5FFE,
0xE2EC, 0x5FEA,
0xE2ED, 0x5FED,
0xE2EE, 0x5FF8,
0xE2EF, 0x6019,
0xE2F0, 0x6035,
0xE2F1, 0x6026,
0xE2F2, 0x601B,
0xE2F3, 0x600F,
0xE2F4, 0x600D,
0xE2F5, 0x6029,
0xE2F6, 0x602B,
0xE2F7, 0x600A,
0xE2F8, 0x603F,
0xE2F9, 0x6021,
0xE2FC, 0x607B,
0xE2FD, 0x607A,
0xE2FE, 0x6042,
0xE3A1, 0x606A,
0xE3A2, 0x607D,
0xE3A3, 0x6096,
0xE3A4, 0x609A,
0xE3A5, 0x60AD,
0xE3A6, 0x609D,
0xE3A7, 0x6083,
0xE3A8, 0x6092,
0xE3A9, 0x608C,
0xE3AA, 0x609B,
0xE3AB, 0x60EC,
0xE3AC, 0x60BB,
0xE3AD, 0x60B1,
0xE3AE, 0x60DD,
0xE3AF, 0x60D8,
0xE3B0, 0x60C6,
0xE3B1, 0x60DA,
0xE3B2, 0x60B4,
0xE3B3, 0x6120,
0xE3B4, 0x6126,
0xE3B5, 0x6115,
0xE3B6, 0x6123,
0xE3B7, 0x60F4,
0xE3B8, 0x6100,
0xE3B9, 0x610E,
0xE3BA, 0x612B,
0xE3BB, 0x614A,
0xE3BC, 0x6175,
0xE3BD, 0x61AC,
0xE3BE, 0x6194,
0xE3BF, 0x61A7,
0xE3C0, 0x61B7,
0xE3C1, 0x61D4,
0xE3C2, 0x61F5,
0xE3C3, 0x5FDD,
0xE3C4, 0x96B3,
0xE3C5, 0x95E9,
0xE3C6, 0x95EB,
0xE3C7, 0x95F1,
0xE3C8, 0x95F3,
0xE3CB, 0x95FC,
0xE3CC, 0x95FE,
0xE3CF, 0x9606,
0xE3D0, 0x9608,
0xE3D5, 0x960F,
0xE3D6, 0x9612,
0xE3DC, 0x4E2C,
0xE3DD, 0x723F,
0xE3DE, 0x6215,
0xE3DF, 0x6C35,
0xE3E0, 0x6C54,
0xE3E1, 0x6C5C,
0xE3E2, 0x6C4A,
0xE3E3, 0x6CA3,
0xE3E4, 0x6C85,
0xE3E5, 0x6C90,
0xE3E6, 0x6C94,
0xE3E7, 0x6C8C,
0xE3EA, 0x6C74,
0xE3EB, 0x6C76,
0xE3EC, 0x6C86,
0xE3ED, 0x6CA9,
0xE3EE, 0x6CD0,
0xE3EF, 0x6CD4,
0xE3F0, 0x6CAD,
0xE3F3, 0x6CF1,
0xE3F4, 0x6CD7,
0xE3F5, 0x6CB2,
0xE3F6, 0x6CE0,
0xE3F7, 0x6CD6,
0xE3F8, 0x6CFA,
0xE3F9, 0x6CEB,
0xE3FA, 0x6CEE,
0xE3FB, 0x6CB1,
0xE3FC, 0x6CD3,
0xE3FD, 0x6CEF,
0xE3FE, 0x6CFE,
0xE4A1, 0x6D39,
0xE4A2, 0x6D27,
0xE4A3, 0x6D0C,
0xE4A4, 0x6D43,
0xE4A5, 0x6D48,
0xE4A6, 0x6D07,
0xE4A7, 0x6D04,
0xE4A8, 0x6D19,
0xE4A9, 0x6D0E,
0xE4AA, 0x6D2B,
0xE4AB, 0x6D4D,
0xE4AC, 0x6D2E,
0xE4AD, 0x6D35,
0xE4AE, 0x6D1A,
0xE4AF, 0x6D4F,
0xE4B0, 0x6D52,
0xE4B1, 0x6D54,
0xE4B2, 0x6D33,
0xE4B3, 0x6D91,
0xE4B4, 0x6D6F,
0xE4B5, 0x6D9E,
0xE4B6, 0x6DA0,
0xE4B7, 0x6D5E,
0xE4BA, 0x6D5C,
0xE4BB, 0x6D60,
0xE4BC, 0x6D7C,
0xE4BD, 0x6D63,
0xE4BE, 0x6E1A,
0xE4BF, 0x6DC7,
0xE4C0, 0x6DC5,
0xE4C1, 0x6DDE,
0xE4C2, 0x6E0E,
0xE4C3, 0x6DBF,
0xE4C4, 0x6DE0,
0xE4C5, 0x6E11,
0xE4C6, 0x6DE6,
0xE4C7, 0x6DDD,
0xE4C8, 0x6DD9,
0xE4C9, 0x6E16,
0xE4CA, 0x6DAB,
0xE4CB, 0x6E0C,
0xE4CC, 0x6DAE,
0xE4CD, 0x6E2B,
0xE4CE, 0x6E6E,
0xE4CF, 0x6E4E,
0xE4D0, 0x6E6B,
0xE4D1, 0x6EB2,
0xE4D2, 0x6E5F,
0xE4D3, 0x6E86,
0xE4D6, 0x6E32,
0xE4D7, 0x6E25,
0xE4D8, 0x6E44,
0xE4D9, 0x6EDF,
0xE4DA, 0x6EB1,
0xE4DB, 0x6E98,
0xE4DC, 0x6EE0,
0xE4DD, 0x6F2D,
0xE4DE, 0x6EE2,
0xE4DF, 0x6EA5,
0xE4E0, 0x6EA7,
0xE4E1, 0x6EBD,
0xE4E2, 0x6EBB,
0xE4E3, 0x6EB7,
0xE4E4, 0x6ED7,
0xE4E5, 0x6EB4,
0xE4E6, 0x6ECF,
0xE4E7, 0x6E8F,
0xE4E8, 0x6EC2,
0xE4E9, 0x6E9F,
0xE4EA, 0x6F62,
0xE4ED, 0x6F24,
0xE4EE, 0x6F15,
0xE4EF, 0x6EF9,
0xE4F0, 0x6F2F,
0xE4F1, 0x6F36,
0xE4F2, 0x6F4B,
0xE4F3, 0x6F74,
0xE4F4, 0x6F2A,
0xE4F5, 0x6F09,
0xE4F6, 0x6F29,
0xE4F7, 0x6F89,
0xE4F8, 0x6F8D,
0xE4F9, 0x6F8C,
0xE4FA, 0x6F78,
0xE4FB, 0x6F72,
0xE4FC, 0x6F7C,
0xE4FD, 0x6F7A,
0xE4FE, 0x6FD1,
0xE5A0, 0x936B,
0xE5A1, 0x6FC9,
0xE5A2, 0x6FA7,
0xE5A3, 0x6FB9,
0xE5A4, 0x6FB6,
0xE5A5, 0x6FC2,
0xE5A6, 0x6FE1,
0xE5A7, 0x6FEE,
0xE5A8, 0x6FDE,
0xE5A9, 0x6FE0,
0xE5AA, 0x6FEF,
0xE5AB, 0x701A,
0xE5AC, 0x7023,
0xE5AD, 0x701B,
0xE5AE, 0x7039,
0xE5AF, 0x7035,
0xE5B0, 0x704F,
0xE5B1, 0x705E,
0xE5B2, 0x5B80,
0xE5B3, 0x5B84,
0xE5B4, 0x5B95,
0xE5B5, 0x5B93,
0xE5B6, 0x5BA5,
0xE5B7, 0x5BB8,
0xE5B8, 0x752F,
0xE5B9, 0x9A9E,
0xE5BA, 0x6434,
0xE5BB, 0x5BE4,
0xE5BC, 0x5BEE,
0xE5BD, 0x8930,
0xE5BE, 0x5BF0,
0xE5BF, 0x8E47,
0xE5C0, 0x8B07,
0xE5C1, 0x8FB6,
0xE5C2, 0x8FD3,
0xE5C3, 0x8FD5,
0xE5C4, 0x8FE5,
0xE5C5, 0x8FEE,
0xE5C6, 0x8FE4,
0xE5C7, 0x8FE9,
0xE5C8, 0x8FE6,
0xE5C9, 0x8FF3,
0xE5CA, 0x8FE8,
0xE5CB, 0x9005,
0xE5CC, 0x9004,
0xE5CD, 0x900B,
0xE5CE, 0x9026,
0xE5CF, 0x9011,
0xE5D0, 0x900D,
0xE5D1, 0x9016,
0xE5D2, 0x9021,
0xE5D5, 0x902D,
0xE5D6, 0x902F,
0xE5D7, 0x9044,
0xE5DA, 0x9050,
0xE5DB, 0x9068,
0xE5DC, 0x9058,
0xE5DD, 0x9062,
0xE5DE, 0x905B,
0xE5DF, 0x66B9,
0xE5E0, 0x9074,
0xE5E1, 0x907D,
0xE5E2, 0x9082,
0xE5E3, 0x9088,
0xE5E4, 0x9083,
0xE5E5, 0x908B,
0xE5E6, 0x5F50,
0xE5E7, 0x5F57,
0xE5E8, 0x5F56,
0xE5E9, 0x5F58,
0xE5EA, 0x5C3B,
0xE5EB, 0x54AB,
0xE5EC, 0x5C50,
0xE5ED, 0x5C59,
0xE5EE, 0x5B71,
0xE5EF, 0x5C63,
0xE5F0, 0x5C66,
0xE5F1, 0x7FBC,
0xE5F2, 0x5F2A,
0xE5F3, 0x5F29,
0xE5F4, 0x5F2D,
0xE5F5, 0x8274,
0xE5F6, 0x5F3C,
0xE5F7, 0x9B3B,
0xE5F8, 0x5C6E,
0xE5F9, 0x5981,
0xE5FA, 0x5983,
0xE5FB, 0x598D,
0xE5FE, 0x59A3,
0xE6A1, 0x5997,
0xE6A2, 0x59CA,
0xE6A3, 0x59AB,
0xE6A4, 0x599E,
0xE6A5, 0x59A4,
0xE6A6, 0x59D2,
0xE6A7, 0x59B2,
0xE6A8, 0x59AF,
0xE6A9, 0x59D7,
0xE6AA, 0x59BE,
0xE6AD, 0x59DD,
0xE6AE, 0x5A08,
0xE6AF, 0x59E3,
0xE6B0, 0x59D8,
0xE6B1, 0x59F9,
0xE6B2, 0x5A0C,
0xE6B3, 0x5A09,
0xE6B4, 0x5A32,
0xE6B5, 0x5A34,
0xE6B6, 0x5A11,
0xE6B7, 0x5A23,
0xE6B8, 0x5A13,
0xE6B9, 0x5A40,
0xE6BA, 0x5A67,
0xE6BB, 0x5A4A,
0xE6BC, 0x5A55,
0xE6BD, 0x5A3C,
0xE6BE, 0x5A62,
0xE6BF, 0x5A75,
0xE6C0, 0x80EC,
0xE6C1, 0x5AAA,
0xE6C2, 0x5A9B,
0xE6C3, 0x5A77,
0xE6C4, 0x5A7A,
0xE6C5, 0x5ABE,
0xE6C6, 0x5AEB,
0xE6C7, 0x5AB2,
0xE6C8, 0x5AD2,
0xE6C9, 0x5AD4,
0xE6CA, 0x5AB8,
0xE6CB, 0x5AE0,
0xE6CC, 0x5AE3,
0xE6CD, 0x5AF1,
0xE6CE, 0x5AD6,
0xE6CF, 0x5AE6,
0xE6D0, 0x5AD8,
0xE6D1, 0x5ADC,
0xE6D2, 0x5B09,
0xE6D3, 0x5B17,
0xE6D4, 0x5B16,
0xE6D5, 0x5B32,
0xE6D6, 0x5B37,
0xE6D7, 0x5B40,
0xE6D8, 0x5C15,
0xE6D9, 0x5C1C,
0xE6DA, 0x5B5A,
0xE6DB, 0x5B65,
0xE6DC, 0x5B73,
0xE6DD, 0x5B51,
0xE6DE, 0x5B53,
0xE6DF, 0x5B62,
0xE6E0, 0x9A75,
0xE6E3, 0x9A7A,
0xE6E4, 0x9A7F,
0xE6E5, 0x9A7D,
0xE6E8, 0x9A85,
0xE6E9, 0x9A88,
0xE6EA, 0x9A8A,
0xE6EB, 0x9A90,
0xE6EE, 0x9A96,
0xE6EF, 0x9A98,
0xE6F7, 0x9AA5,
0xE6F8, 0x9AA7,
0xE6F9, 0x7E9F,
0xE6FA, 0x7EA1,
0xE6FB, 0x7EA3,
0xE6FC, 0x7EA5,
0xE7A1, 0x7EAD,
0xE7A2, 0x7EB0,
0xE7A3, 0x7EBE,
0xE7A7, 0x7EC9,
0xE7AA, 0x7ED0,
0xE7AB, 0x7ED4,
0xE7AC, 0x7ED7,
0xE7AD, 0x7EDB,
0xE7B0, 0x7EE8,
0xE7B1, 0x7EEB,
0xE7B6, 0x7F0D,
0xE7B7, 0x7EF6,
0xE7BA, 0x7EFE,
0xE7C2, 0x7F0F,
0xE7C5, 0x7F17,
0xE7C6, 0x7F19,
0xE7C7, 0x7F1C,
0xE7C8, 0x7F1B,
0xE7C9, 0x7F1F,
0xE7DA, 0x7F35,
0xE7DB, 0x5E7A,
0xE7DC, 0x757F,
0xE7DD, 0x5DDB,
0xE7DE, 0x753E,
0xE7DF, 0x9095,
0xE7E0, 0x738E,
0xE7E1, 0x7391,
0xE7E2, 0x73AE,
0xE7E3, 0x73A2,
0xE7E4, 0x739F,
0xE7E5, 0x73CF,
0xE7E6, 0x73C2,
0xE7E7, 0x73D1,
0xE7E8, 0x73B7,
0xE7E9, 0x73B3,
0xE7EA, 0x73C0,
0xE7EB, 0x73C9,
0xE7EC, 0x73C8,
0xE7ED, 0x73E5,
0xE7EE, 0x73D9,
0xE7EF, 0x987C,
0xE7F0, 0x740A,
0xE7F1, 0x73E9,
0xE7F2, 0x73E7,
0xE7F3, 0x73DE,
0xE7F4, 0x73BA,
0xE7F5, 0x73F2,
0xE7F6, 0x740F,
0xE7F7, 0x742A,
0xE7F8, 0x745B,
0xE7F9, 0x7426,
0xE7FA, 0x7425,
0xE7FB, 0x7428,
0xE7FC, 0x7430,
0xE7FD, 0x742E,
0xE7FE, 0x742C,
0xE895, 0x9491,
0xE896, 0x9496,
0xE897, 0x9498,
0xE898, 0x94C7,
0xE899, 0x94CF,
0xE89C, 0x94DA,
0xE89D, 0x94E6,
0xE89E, 0x94FB,
0xE89F, 0x951C,
0xE8A0, 0x9520,
0xE8A1, 0x741B,
0xE8A2, 0x741A,
0xE8A3, 0x7441,
0xE8A4, 0x745C,
0xE8A5, 0x7457,
0xE8A6, 0x7455,
0xE8A7, 0x7459,
0xE8A8, 0x7477,
0xE8A9, 0x746D,
0xE8AA, 0x747E,
0xE8AB, 0x749C,
0xE8AC, 0x748E,
0xE8AF, 0x7487,
0xE8B0, 0x748B,
0xE8B1, 0x749E,
0xE8B4, 0x7490,
0xE8B5, 0x74A7,
0xE8B6, 0x74D2,
0xE8B7, 0x74BA,
0xE8BB, 0x674C,
0xE8BC, 0x6753,
0xE8BD, 0x675E,
0xE8BE, 0x6748,
0xE8BF, 0x6769,
0xE8C0, 0x67A5,
0xE8C1, 0x6787,
0xE8C2, 0x676A,
0xE8C3, 0x6773,
0xE8C4, 0x6798,
0xE8C5, 0x67A7,
0xE8C6, 0x6775,
0xE8C7, 0x67A8,
0xE8C8, 0x679E,
0xE8C9, 0x67AD,
0xE8CA, 0x678B,
0xE8CB, 0x6777,
0xE8CC, 0x677C,
0xE8CD, 0x67F0,
0xE8CE, 0x6809,
0xE8CF, 0x67D8,
0xE8D0, 0x680A,
0xE8D1, 0x67E9,
0xE8D2, 0x67B0,
0xE8D3, 0x680C,
0xE8D4, 0x67D9,
0xE8D5, 0x67B5,
0xE8D6, 0x67DA,
0xE8D7, 0x67B3,
0xE8D8, 0x67DD,
0xE8D9, 0x6800,
0xE8DA, 0x67C3,
0xE8DB, 0x67B8,
0xE8DC, 0x67E2,
0xE8DD, 0x680E,
0xE8DE, 0x67C1,
0xE8DF, 0x67FD,
0xE8E4, 0x684E,
0xE8E5, 0x6862,
0xE8E6, 0x6844,
0xE8E7, 0x6864,
0xE8E8, 0x6883,
0xE8E9, 0x681D,
0xE8EA, 0x6855,
0xE8EB, 0x6866,
0xE8EC, 0x6841,
0xE8ED, 0x6867,
0xE8EE, 0x6840,
0xE8EF, 0x683E,
0xE8F0, 0x684A,
0xE8F1, 0x6849,
0xE8F2, 0x6829,
0xE8F3, 0x68B5,
0xE8F4, 0x688F,
0xE8F5, 0x6874,
0xE8F6, 0x6877,
0xE8F7, 0x6893,
0xE8F8, 0x686B,
0xE8F9, 0x68C2,
0xE8FA, 0x696E,
0xE8FB, 0x68FC,
0xE8FE, 0x68F9,
0xE940, 0x9527,
0xE941, 0x9533,
0xE942, 0x953D,
0xE943, 0x9543,
0xE944, 0x9548,
0xE945, 0x954B,
0xE946, 0x9555,
0xE947, 0x955A,
0xE948, 0x9560,
0xE949, 0x956E,
0xE9A1, 0x6924,
0xE9A2, 0x68F0,
0xE9A3, 0x690B,
0xE9A4, 0x6901,
0xE9A5, 0x6957,
0xE9A6, 0x68E3,
0xE9A7, 0x6910,
0xE9A8, 0x6971,
0xE9A9, 0x6939,
0xE9AA, 0x6960,
0xE9AB, 0x6942,
0xE9AC, 0x695D,
0xE9AD, 0x6984,
0xE9AE, 0x696B,
0xE9AF, 0x6980,
0xE9B0, 0x6998,
0xE9B1, 0x6978,
0xE9B2, 0x6934,
0xE9B3, 0x69CC,
0xE9B6, 0x69CE,
0xE9B7, 0x6989,
0xE9B8, 0x6966,
0xE9B9, 0x6963,
0xE9BA, 0x6979,
0xE9BB, 0x699B,
0xE9BC, 0x69A7,
0xE9BD, 0x69BB,
0xE9BE, 0x69AB,
0xE9BF, 0x69AD,
0xE9C0, 0x69D4,
0xE9C1, 0x69B1,
0xE9C2, 0x69C1,
0xE9C3, 0x69CA,
0xE9C4, 0x69DF,
0xE9C5, 0x6995,
0xE9C6, 0x69E0,
0xE9C7, 0x698D,
0xE9C8, 0x69FF,
0xE9C9, 0x6A2F,
0xE9CA, 0x69ED,
0xE9CD, 0x6A65,
0xE9CE, 0x69F2,
0xE9CF, 0x6A44,
0xE9D0, 0x6A3E,
0xE9D1, 0x6AA0,
0xE9D2, 0x6A50,
0xE9D3, 0x6A5B,
0xE9D4, 0x6A35,
0xE9D5, 0x6A8E,
0xE9D6, 0x6A79,
0xE9D7, 0x6A3D,
0xE9D8, 0x6A28,
0xE9D9, 0x6A58,
0xE9DA, 0x6A7C,
0xE9DB, 0x6A91,
0xE9DC, 0x6A90,
0xE9DD, 0x6AA9,
0xE9DE, 0x6A97,
0xE9DF, 0x6AAB,
0xE9E0, 0x7337,
0xE9E1, 0x7352,
0xE9E4, 0x6B87,
0xE9E5, 0x6B84,
0xE9E8, 0x6B8D,
0xE9EB, 0x6BA1,
0xE9EC, 0x6BAA,
0xE9ED, 0x8F6B,
0xE9EE, 0x8F6D,
0xE9F4, 0x8F78,
0xE9F5, 0x8F77,
0xE9F8, 0x8F7C,
0xE9F9, 0x8F7E,
0xE9FC, 0x8F84,
0xE9FD, 0x8F87,
0xE9FE, 0x8F8B,
0xEA5C, 0x95EC,
0xEA5D, 0x95FF,
0xEA5E, 0x9607,
0xEA5F, 0x9613,
0xEA60, 0x9618,
0xEA61, 0x961B,
0xEA62, 0x961E,
0xEA63, 0x9620,
0xEA74, 0x963E,
0xEA75, 0x9641,
0xEA76, 0x9643,
0xEA77, 0x964A,
0xEA86, 0x9660,
0xEA87, 0x9663,
0xEA8A, 0x966B,
0xEA90, 0x9673,
0xEA9E, 0x9687,
0xEAA4, 0x8F98,
0xEAA5, 0x8F9A,
0xEAA6, 0x8ECE,
0xEAA7, 0x620B,
0xEAA8, 0x6217,
0xEAA9, 0x621B,
0xEAAA, 0x621F,
0xEAAB, 0x6222,
0xEAAC, 0x6221,
0xEAAD, 0x6225,
0xEAAE, 0x6224,
0xEAAF, 0x622C,
0xEAB0, 0x81E7,
0xEAB1, 0x74EF,
0xEAB2, 0x74F4,
0xEAB3, 0x74FF,
0xEAB4, 0x750F,
0xEAB5, 0x7511,
0xEAB6, 0x7513,
0xEAB7, 0x6534,
0xEABB, 0x660A,
0xEABC, 0x6619,
0xEABD, 0x6772,
0xEABE, 0x6603,
0xEABF, 0x6615,
0xEAC0, 0x6600,
0xEAC1, 0x7085,
0xEAC2, 0x66F7,
0xEAC3, 0x661D,
0xEAC4, 0x6634,
0xEAC5, 0x6631,
0xEAC6, 0x6636,
0xEAC7, 0x6635,
0xEAC8, 0x8006,
0xEAC9, 0x665F,
0xEACA, 0x6654,
0xEACB, 0x6641,
0xEACC, 0x664F,
0xEACD, 0x6656,
0xEACE, 0x6661,
0xEACF, 0x6657,
0xEAD0, 0x6677,
0xEAD1, 0x6684,
0xEAD2, 0x668C,
0xEAD3, 0x66A7,
0xEAD4, 0x669D,
0xEAD5, 0x66BE,
0xEAD8, 0x66E6,
0xEAD9, 0x66E9,
0xEADC, 0x8D36,
0xEADD, 0x8D3B,
0xEADE, 0x8D3D,
0xEADF, 0x8D40,
0xEAE4, 0x8D47,
0xEAE5, 0x8D4D,
0xEAE6, 0x8D55,
0xEAE7, 0x8D59,
0xEAE8, 0x89C7,
0xEAF0, 0x726E,
0xEAF1, 0x729F,
0xEAF2, 0x725D,
0xEAF3, 0x7266,
0xEAF4, 0x726F,
0xEAF7, 0x7284,
0xEAF8, 0x728B,
0xEAF9, 0x728D,
0xEAFA, 0x728F,
0xEAFB, 0x7292,
0xEAFC, 0x6308,
0xEAFD, 0x6332,
0xEAFE, 0x63B0,
0xEB40, 0x968C,
0xEB41, 0x968E,
0xEB63, 0x96BF,
0xEB66, 0x96C8,
0xEB7E, 0x96EB,
0xEB88, 0x96F8,
0xEB8D, 0x96FF,
0xEB90, 0x9705,
0xEB9E, 0x971D,
0xEBA1, 0x643F,
0xEBA2, 0x64D8,
0xEBA3, 0x8004,
0xEBA4, 0x6BEA,
0xEBA5, 0x6BF3,
0xEBA6, 0x6BFD,
0xEBA7, 0x6BF5,
0xEBA8, 0x6BF9,
0xEBA9, 0x6C05,
0xEBAA, 0x6C07,
0xEBAB, 0x6C06,
0xEBAC, 0x6C0D,
0xEBAD, 0x6C15,
0xEBB1, 0x6C21,
0xEBB2, 0x6C29,
0xEBB3, 0x6C24,
0xEBB4, 0x6C2A,
0xEBB5, 0x6C32,
0xEBB6, 0x6535,
0xEBB7, 0x6555,
0xEBB8, 0x656B,
0xEBB9, 0x724D,
0xEBBA, 0x7252,
0xEBBB, 0x7256,
0xEBBC, 0x7230,
0xEBBD, 0x8662,
0xEBBE, 0x5216,
0xEBBF, 0x809F,
0xEBC0, 0x809C,
0xEBC1, 0x8093,
0xEBC2, 0x80BC,
0xEBC3, 0x670A,
0xEBC4, 0x80BD,
0xEBC5, 0x80B1,
0xEBC6, 0x80AB,
0xEBC7, 0x80AD,
0xEBC8, 0x80B4,
0xEBC9, 0x80B7,
0xEBCE, 0x80DB,
0xEBCF, 0x80C2,
0xEBD0, 0x80C4,
0xEBD1, 0x80D9,
0xEBD2, 0x80CD,
0xEBD3, 0x80D7,
0xEBD4, 0x6710,
0xEBD5, 0x80DD,
0xEBD6, 0x80EB,
0xEBD7, 0x80F1,
0xEBD8, 0x80F4,
0xEBD9, 0x80ED,
0xEBDC, 0x80F2,
0xEBDD, 0x80FC,
0xEBDE, 0x6715,
0xEBDF, 0x8112,
0xEBE0, 0x8C5A,
0xEBE1, 0x8136,
0xEBE2, 0x811E,
0xEBE3, 0x812C,
0xEBE4, 0x8118,
0xEBE5, 0x8132,
0xEBE6, 0x8148,
0xEBE7, 0x814C,
0xEBE8, 0x8153,
0xEBE9, 0x8174,
0xEBEC, 0x8171,
0xEBED, 0x8160,
0xEBEE, 0x8169,
0xEBF1, 0x816D,
0xEBF2, 0x8167,
0xEBF3, 0x584D,
0xEBF4, 0x5AB5,
0xEBF5, 0x8188,
0xEBF6, 0x8182,
0xEBF7, 0x8191,
0xEBF8, 0x6ED5,
0xEBF9, 0x81A3,
0xEBFA, 0x81AA,
0xEBFB, 0x81CC,
0xEBFC, 0x6726,
0xEBFD, 0x81CA,
0xEBFE, 0x81BB,
0xEC4D, 0x9731,
0xEC6E, 0x975A,
0xEC71, 0x975F,
0xEC80, 0x9772,
0xEC81, 0x9775,
0xEC94, 0x978C,
0xEC98, 0x9793,
0xECA1, 0x81C1,
0xECA2, 0x81A6,
0xECA3, 0x6B24,
0xECA4, 0x6B37,
0xECA5, 0x6B39,
0xECA6, 0x6B43,
0xECA7, 0x6B46,
0xECA8, 0x6B59,
0xECAC, 0x98D5,
0xECAF, 0x6BB3,
0xECB0, 0x5F40,
0xECB1, 0x6BC2,
0xECB2, 0x89F3,
0xECB3, 0x6590,
0xECB4, 0x9F51,
0xECB5, 0x6593,
0xECB6, 0x65BC,
0xECB7, 0x65C6,
0xECB8, 0x65C4,
0xECB9, 0x65C3,
0xECBA, 0x65CC,
0xECBB, 0x65CE,
0xECBC, 0x65D2,
0xECBD, 0x65D6,
0xECBE, 0x7080,
0xECBF, 0x709C,
0xECC0, 0x7096,
0xECC1, 0x709D,
0xECC2, 0x70BB,
0xECC3, 0x70C0,
0xECC4, 0x70B7,
0xECC5, 0x70AB,
0xECC6, 0x70B1,
0xECC7, 0x70E8,
0xECC8, 0x70CA,
0xECC9, 0x7110,
0xECCA, 0x7113,
0xECCB, 0x7116,
0xECCC, 0x712F,
0xECCD, 0x7131,
0xECCE, 0x7173,
0xECCF, 0x715C,
0xECD0, 0x7168,
0xECD1, 0x7145,
0xECD2, 0x7172,
0xECD3, 0x714A,
0xECD4, 0x7178,
0xECD5, 0x717A,
0xECD6, 0x7198,
0xECD7, 0x71B3,
0xECD8, 0x71B5,
0xECD9, 0x71A8,
0xECDA, 0x71A0,
0xECDB, 0x71E0,
0xECDC, 0x71D4,
0xECDD, 0x71E7,
0xECDE, 0x71F9,
0xECDF, 0x721D,
0xECE0, 0x7228,
0xECE1, 0x706C,
0xECE2, 0x7118,
0xECE3, 0x7166,
0xECE4, 0x71B9,
0xECE5, 0x623E,
0xECE6, 0x623D,
0xECE7, 0x6243,
0xECEA, 0x793B,
0xECEB, 0x7940,
0xECEC, 0x7946,
0xECED, 0x7949,
0xECF0, 0x7953,
0xECF1, 0x795A,
0xECF2, 0x7962,
0xECF3, 0x7957,
0xECF4, 0x7960,
0xECF5, 0x796F,
0xECF6, 0x7967,
0xECF7, 0x797A,
0xECF8, 0x7985,
0xECF9, 0x798A,
0xECFA, 0x799A,
0xECFB, 0x79A7,
0xECFC, 0x79B3,
0xECFD, 0x5FD1,
0xECFE, 0x5FD0,
0xED4B, 0x97AC,
0xED4C, 0x97AE,
0xED4F, 0x97B3,
0xED82, 0x97E8,
0xED88, 0x97F4,
0xEDA1, 0x603C,
0xEDA2, 0x605D,
0xEDA3, 0x605A,
0xEDA4, 0x6067,
0xEDA5, 0x6041,
0xEDA6, 0x6059,
0xEDA7, 0x6063,
0xEDA8, 0x60AB,
0xEDA9, 0x6106,
0xEDAA, 0x610D,
0xEDAB, 0x615D,
0xEDAC, 0x61A9,
0xEDAD, 0x619D,
0xEDAE, 0x61CB,
0xEDAF, 0x61D1,
0xEDB0, 0x6206,
0xEDB1, 0x8080,
0xEDB2, 0x807F,
0xEDB3, 0x6C93,
0xEDB4, 0x6CF6,
0xEDB5, 0x6DFC,
0xEDB6, 0x77F6,
0xEDB7, 0x77F8,
0xEDB8, 0x7800,
0xEDB9, 0x7809,
0xEDBC, 0x7811,
0xEDBD, 0x65AB,
0xEDBE, 0x782D,
0xEDC4, 0x781F,
0xEDC5, 0x783C,
0xEDC6, 0x7825,
0xEDC7, 0x782C,
0xEDC8, 0x7823,
0xEDC9, 0x7829,
0xEDCA, 0x784E,
0xEDCB, 0x786D,
0xEDCE, 0x7826,
0xEDCF, 0x7850,
0xEDD0, 0x7847,
0xEDD1, 0x784C,
0xEDD2, 0x786A,
0xEDD3, 0x789B,
0xEDD4, 0x7893,
0xEDD5, 0x789A,
0xEDD6, 0x7887,
0xEDD7, 0x789C,
0xEDD8, 0x78A1,
0xEDD9, 0x78A3,
0xEDDA, 0x78B2,
0xEDDB, 0x78B9,
0xEDDC, 0x78A5,
0xEDDD, 0x78D4,
0xEDDE, 0x78D9,
0xEDDF, 0x78C9,
0xEDE0, 0x78EC,
0xEDE1, 0x78F2,
0xEDE2, 0x7905,
0xEDE3, 0x78F4,
0xEDE4, 0x7913,
0xEDE5, 0x7924,
0xEDE6, 0x791E,
0xEDE7, 0x7934,
0xEDE8, 0x9F9B,
0xEDE9, 0x9EF9,
0xEDEC, 0x76F1,
0xEDED, 0x7704,
0xEDEE, 0x770D,
0xEDEF, 0x76F9,
0xEDF2, 0x771A,
0xEDF3, 0x7722,
0xEDF4, 0x7719,
0xEDF5, 0x772D,
0xEDF6, 0x7726,
0xEDF7, 0x7735,
0xEDF8, 0x7738,
0xEDFB, 0x7747,
0xEDFC, 0x7743,
0xEDFD, 0x775A,
0xEDFE, 0x7768,
0xEEA1, 0x7762,
0xEEA2, 0x7765,
0xEEA3, 0x777F,
0xEEA4, 0x778D,
0xEEA5, 0x777D,
0xEEA6, 0x7780,
0xEEA7, 0x778C,
0xEEA8, 0x7791,
0xEEAB, 0x77B0,
0xEEAC, 0x77B5,
0xEEAD, 0x77BD,
0xEEAE, 0x753A,
0xEEAF, 0x7540,
0xEEB0, 0x754E,
0xEEB1, 0x754B,
0xEEB2, 0x7548,
0xEEB3, 0x755B,
0xEEB4, 0x7572,
0xEEB5, 0x7579,
0xEEB6, 0x7583,
0xEEB7, 0x7F58,
0xEEB8, 0x7F61,
0xEEB9, 0x7F5F,
0xEEBA, 0x8A48,
0xEEBB, 0x7F68,
0xEEBC, 0x7F74,
0xEEBD, 0x7F71,
0xEEBE, 0x7F79,
0xEEBF, 0x7F81,
0xEEC0, 0x7F7E,
0xEEC1, 0x76CD,
0xEEC2, 0x76E5,
0xEEC3, 0x8832,
0xEEC7, 0x948B,
0xEEC8, 0x948A,
0xEECD, 0x9494,
0xEECE, 0x9497,
0xEECF, 0x9495,
0xEED5, 0x94AB,
0xEED6, 0x94AA,
0xEED7, 0x94AD,
0xEED8, 0x94AC,
0xEEDB, 0x94B2,
0xEEDC, 0x94B4,
0xEEE4, 0x94BF,
0xEEE5, 0x94C4,
0xEEF3, 0x94D9,
0xEEF4, 0x94D8,
0xEEF5, 0x94DB,
0xEEF9, 0x94E2,
0xEEFE, 0x94EA,
0xEF46, 0x988B,
0xEF47, 0x988E,
0xEF48, 0x9892,
0xEF49, 0x9895,
0xEF4A, 0x9899,
0xEF4B, 0x98A3,
0xEF74, 0x98D4,
0xEFA1, 0x94E9,
0xEFA2, 0x94EB,
0xEFA8, 0x94F7,
0xEFA9, 0x94F9,
0xEFAC, 0x94FF,
0xEFAD, 0x9503,
0xEFAE, 0x9502,
0xEFBB, 0x9518,
0xEFBC, 0x951B,
0xEFC0, 0x9522,
0xEFC3, 0x9529,
0xEFC4, 0x952C,
0xEFC7, 0x9534,
0xEFCB, 0x953C,
0xEFCE, 0x9542,
0xEFCF, 0x9535,
0xEFD3, 0x9549,
0xEFD4, 0x954C,
0xEFDE, 0x955B,
0xEFE1, 0x955D,
0xEFED, 0x956F,
0xEFF1, 0x953A,
0xEFF2, 0x77E7,
0xEFF3, 0x77EC,
0xEFF4, 0x96C9,
0xEFF5, 0x79D5,
0xEFF6, 0x79ED,
0xEFF7, 0x79E3,
0xEFF8, 0x79EB,
0xEFF9, 0x7A06,
0xEFFA, 0x5D47,
0xEFFB, 0x7A03,
0xEFFC, 0x7A02,
0xEFFD, 0x7A1E,
0xEFFE, 0x7A14,
0xF097, 0x9964,
0xF098, 0x9966,
0xF099, 0x9973,
0xF09C, 0x997B,
0xF09D, 0x997E,
0xF0A0, 0x9989,
0xF0A1, 0x7A39,
0xF0A2, 0x7A37,
0xF0A3, 0x7A51,
0xF0A4, 0x9ECF,
0xF0A5, 0x99A5,
0xF0A6, 0x7A70,
0xF0A7, 0x7688,
0xF0A8, 0x768E,
0xF0A9, 0x7693,
0xF0AA, 0x7699,
0xF0AB, 0x76A4,
0xF0AC, 0x74DE,
0xF0AD, 0x74E0,
0xF0AE, 0x752C,
0xF0AF, 0x9E20,
0xF0B0, 0x9E22,
0xF0B6, 0x9E32,
0xF0B7, 0x9E31,
0xF0B8, 0x9E36,
0xF0B9, 0x9E38,
0xF0BA, 0x9E37,
0xF0BD, 0x9E3E,
0xF0C0, 0x9E44,
0xF0C7, 0x9E4E,
0xF0C8, 0x9E51,
0xF0C9, 0x9E55,
0xF0CA, 0x9E57,
0xF0CE, 0x9E5E,
0xF0CF, 0x9E63,
0xF0D7, 0x9E71,
0xF0D8, 0x9E6D,
0xF0D9, 0x9E73,
0xF0DA, 0x7592,
0xF0DB, 0x7594,
0xF0DC, 0x7596,
0xF0DD, 0x75A0,
0xF0DE, 0x759D,
0xF0DF, 0x75AC,
0xF0E0, 0x75A3,
0xF0E3, 0x75B8,
0xF0E4, 0x75C4,
0xF0E5, 0x75B1,
0xF0E6, 0x75B0,
0xF0E7, 0x75C3,
0xF0E8, 0x75C2,
0xF0E9, 0x75D6,
0xF0EA, 0x75CD,
0xF0EB, 0x75E3,
0xF0EC, 0x75E8,
0xF0ED, 0x75E6,
0xF0EE, 0x75E4,
0xF0EF, 0x75EB,
0xF0F0, 0x75E7,
0xF0F1, 0x7603,
0xF0F2, 0x75F1,
0xF0F3, 0x75FC,
0xF0F4, 0x75FF,
0xF0F5, 0x7610,
0xF0F6, 0x7600,
0xF0F7, 0x7605,
0xF0F8, 0x760C,
0xF0F9, 0x7617,
0xF0FA, 0x760A,
0xF0FB, 0x7625,
0xF0FC, 0x7618,
0xF0FD, 0x7615,
0xF0FE, 0x7619,
0xF140, 0x998C,
0xF141, 0x998E,
0xF1A1, 0x761B,
0xF1A2, 0x763C,
0xF1A3, 0x7622,
0xF1A4, 0x7620,
0xF1A5, 0x7640,
0xF1A6, 0x762D,
0xF1A7, 0x7630,
0xF1A8, 0x763F,
0xF1A9, 0x7635,
0xF1AA, 0x7643,
0xF1AB, 0x763E,
0xF1AC, 0x7633,
0xF1AD, 0x764D,
0xF1AE, 0x765E,
0xF1AF, 0x7654,
0xF1B0, 0x765C,
0xF1B1, 0x7656,
0xF1B2, 0x766B,
0xF1B3, 0x766F,
0xF1B4, 0x7FCA,
0xF1B5, 0x7AE6,
0xF1B8, 0x7A80,
0xF1B9, 0x7A86,
0xF1BA, 0x7A88,
0xF1BB, 0x7A95,
0xF1BC, 0x7AA6,
0xF1BD, 0x7AA0,
0xF1BE, 0x7AAC,
0xF1BF, 0x7AA8,
0xF1C0, 0x7AAD,
0xF1C1, 0x7AB3,
0xF1C2, 0x8864,
0xF1C3, 0x8869,
0xF1C4, 0x8872,
0xF1C5, 0x887D,
0xF1C6, 0x887F,
0xF1C7, 0x8882,
0xF1C8, 0x88A2,
0xF1C9, 0x88C6,
0xF1CA, 0x88B7,
0xF1CB, 0x88BC,
0xF1CC, 0x88C9,
0xF1CD, 0x88E2,
0xF1CE, 0x88CE,
0xF1CF, 0x88E3,
0xF1D0, 0x88E5,
0xF1D1, 0x88F1,
0xF1D2, 0x891A,
0xF1D3, 0x88FC,
0xF1D4, 0x88E8,
0xF1D5, 0x88FE,
0xF1D6, 0x88F0,
0xF1D7, 0x8921,
0xF1D8, 0x8919,
0xF1D9, 0x8913,
0xF1DA, 0x891B,
0xF1DB, 0x890A,
0xF1DC, 0x8934,
0xF1DD, 0x892B,
0xF1DE, 0x8936,
0xF1DF, 0x8941,
0xF1E0, 0x8966,
0xF1E1, 0x897B,
0xF1E2, 0x758B,
0xF1E3, 0x80E5,
0xF1E4, 0x76B2,
0xF1E5, 0x76B4,
0xF1E6, 0x77DC,
0xF1E7, 0x8012,
0xF1E8, 0x8014,
0xF1E9, 0x8016,
0xF1EA, 0x801C,
0xF1EB, 0x8020,
0xF1EC, 0x8022,
0xF1F0, 0x8029,
0xF1F1, 0x8028,
0xF1F2, 0x8031,
0xF1F3, 0x800B,
0xF1F4, 0x8035,
0xF1F5, 0x8043,
0xF1F6, 0x8046,
0xF1F7, 0x804D,
0xF1F8, 0x8052,
0xF1F9, 0x8069,
0xF1FA, 0x8071,
0xF1FB, 0x8983,
0xF1FC, 0x9878,
0xF1FD, 0x9880,
0xF1FE, 0x9883,
0xF2A1, 0x9889,
0xF2A4, 0x988F,
0xF2A5, 0x9894,
0xF2AE, 0x864D,
0xF2AF, 0x8654,
0xF2B0, 0x866C,
0xF2B1, 0x866E,
0xF2B2, 0x867F,
0xF2B3, 0x867A,
0xF2B4, 0x867C,
0xF2B5, 0x867B,
0xF2B6, 0x86A8,
0xF2B7, 0x868D,
0xF2B8, 0x868B,
0xF2B9, 0x86AC,
0xF2BA, 0x869D,
0xF2BB, 0x86A7,
0xF2BC, 0x86A3,
0xF2BD, 0x86AA,
0xF2BE, 0x8693,
0xF2BF, 0x86A9,
0xF2C0, 0x86B6,
0xF2C1, 0x86C4,
0xF2C2, 0x86B5,
0xF2C3, 0x86CE,
0xF2C4, 0x86B0,
0xF2C5, 0x86BA,
0xF2C6, 0x86B1,
0xF2C7, 0x86AF,
0xF2C8, 0x86C9,
0xF2C9, 0x86CF,
0xF2CA, 0x86B4,
0xF2CB, 0x86E9,
0xF2CE, 0x86ED,
0xF2CF, 0x86F3,
0xF2D0, 0x86D0,
0xF2D1, 0x8713,
0xF2D2, 0x86DE,
0xF2D3, 0x86F4,
0xF2D4, 0x86DF,
0xF2D5, 0x86D8,
0xF2D6, 0x86D1,
0xF2D7, 0x8703,
0xF2D8, 0x8707,
0xF2D9, 0x86F8,
0xF2DA, 0x8708,
0xF2DB, 0x870A,
0xF2DC, 0x870D,
0xF2DD, 0x8709,
0xF2DE, 0x8723,
0xF2DF, 0x873B,
0xF2E0, 0x871E,
0xF2E1, 0x8725,
0xF2E2, 0x872E,
0xF2E3, 0x871A,
0xF2E4, 0x873E,
0xF2E5, 0x8748,
0xF2E6, 0x8734,
0xF2E7, 0x8731,
0xF2E8, 0x8729,
0xF2E9, 0x8737,
0xF2EA, 0x873F,
0xF2EB, 0x8782,
0xF2EC, 0x8722,
0xF2EF, 0x877B,
0xF2F0, 0x8760,
0xF2F1, 0x8770,
0xF2F2, 0x874C,
0xF2F3, 0x876E,
0xF2F4, 0x878B,
0xF2F5, 0x8753,
0xF2F6, 0x8763,
0xF2F7, 0x877C,
0xF2F8, 0x8764,
0xF2F9, 0x8759,
0xF2FA, 0x8765,
0xF2FB, 0x8793,
0xF2FC, 0x87AF,
0xF2FD, 0x87A8,
0xF2FE, 0x87D2,
0xF352, 0x9A72,
0xF353, 0x9A83,
0xF354, 0x9A89,
0xF359, 0x9A99,
0xF35A, 0x9AA6,
0xF366, 0x9AB9,
0xF367, 0x9ABB,
0xF376, 0x9AD2,
0xF382, 0x9AE0,
0xF38B, 0x9AEC,
0xF38C, 0x9AEE,
0xF396, 0x9AFA,
0xF3A1, 0x87C6,
0xF3A2, 0x8788,
0xF3A3, 0x8785,
0xF3A4, 0x87AD,
0xF3A5, 0x8797,
0xF3A6, 0x8783,
0xF3A7, 0x87AB,
0xF3A8, 0x87E5,
0xF3A9, 0x87AC,
0xF3AA, 0x87B5,
0xF3AB, 0x87B3,
0xF3AC, 0x87CB,
0xF3AD, 0x87D3,
0xF3AE, 0x87BD,
0xF3AF, 0x87D1,
0xF3B0, 0x87C0,
0xF3B1, 0x87CA,
0xF3B2, 0x87DB,
0xF3B3, 0x87EA,
0xF3B4, 0x87E0,
0xF3B5, 0x87EE,
0xF3B6, 0x8816,
0xF3B7, 0x8813,
0xF3B8, 0x87FE,
0xF3B9, 0x880A,
0xF3BA, 0x881B,
0xF3BB, 0x8821,
0xF3BC, 0x8839,
0xF3BD, 0x883C,
0xF3BE, 0x7F36,
0xF3BF, 0x7F42,
0xF3C2, 0x8210,
0xF3C3, 0x7AFA,
0xF3C4, 0x7AFD,
0xF3C5, 0x7B08,
0xF3C8, 0x7B15,
0xF3C9, 0x7B0A,
0xF3CA, 0x7B2B,
0xF3CB, 0x7B0F,
0xF3CC, 0x7B47,
0xF3CD, 0x7B38,
0xF3CE, 0x7B2A,
0xF3CF, 0x7B19,
0xF3D0, 0x7B2E,
0xF3D1, 0x7B31,
0xF3D2, 0x7B20,
0xF3D3, 0x7B25,
0xF3D4, 0x7B24,
0xF3D5, 0x7B33,
0xF3D6, 0x7B3E,
0xF3D7, 0x7B1E,
0xF3D8, 0x7B58,
0xF3D9, 0x7B5A,
0xF3DA, 0x7B45,
0xF3DB, 0x7B75,
0xF3DC, 0x7B4C,
0xF3DD, 0x7B5D,
0xF3DE, 0x7B60,
0xF3DF, 0x7B6E,
0xF3E0, 0x7B7B,
0xF3E1, 0x7B62,
0xF3E2, 0x7B72,
0xF3E3, 0x7B71,
0xF3E4, 0x7B90,
0xF3E7, 0x7BB8,
0xF3E8, 0x7BAC,
0xF3E9, 0x7B9D,
0xF3EA, 0x7BA8,
0xF3EB, 0x7B85,
0xF3EC, 0x7BAA,
0xF3ED, 0x7B9C,
0xF3EE, 0x7BA2,
0xF3EF, 0x7BAB,
0xF3F0, 0x7BB4,
0xF3F1, 0x7BD1,
0xF3F2, 0x7BC1,
0xF3F3, 0x7BCC,
0xF3F4, 0x7BDD,
0xF3F5, 0x7BDA,
0xF3F8, 0x7BEA,
0xF3F9, 0x7C0C,
0xF3FA, 0x7BFE,
0xF3FB, 0x7BFC,
0xF3FC, 0x7C0F,
0xF3FD, 0x7C16,
0xF3FE, 0x7C0B,
0xF440, 0x9B07,
0xF471, 0x9B46,
0xF475, 0x9B4E,
0xF476, 0x9B50,
0xF4A1, 0x7C1F,
0xF4A2, 0x7C2A,
0xF4A3, 0x7C26,
0xF4A4, 0x7C38,
0xF4A5, 0x7C41,
0xF4A6, 0x7C40,
0xF4A7, 0x81FE,
0xF4AA, 0x8204,
0xF4AB, 0x81EC,
0xF4AC, 0x8844,
0xF4B0, 0x822D,
0xF4B1, 0x822F,
0xF4B2, 0x8228,
0xF4B3, 0x822B,
0xF4B4, 0x8238,
0xF4B5, 0x823B,
0xF4B8, 0x823E,
0xF4B9, 0x8244,
0xF4BA, 0x8249,
0xF4BB, 0x824B,
0xF4BC, 0x824F,
0xF4BD, 0x825A,
0xF4BE, 0x825F,
0xF4BF, 0x8268,
0xF4C0, 0x887E,
0xF4C1, 0x8885,
0xF4C2, 0x8888,
0xF4C3, 0x88D8,
0xF4C4, 0x88DF,
0xF4C5, 0x895E,
0xF4C6, 0x7F9D,
0xF4C7, 0x7F9F,
0xF4C8, 0x7FA7,
0xF4CB, 0x7FB2,
0xF4CC, 0x7C7C,
0xF4CD, 0x6549,
0xF4CE, 0x7C91,
0xF4CF, 0x7C9D,
0xF4D0, 0x7C9C,
0xF4D1, 0x7C9E,
0xF4D2, 0x7CA2,
0xF4D3, 0x7CB2,
0xF4D6, 0x7CC1,
0xF4D7, 0x7CC7,
0xF4DA, 0x7CC8,
0xF4DB, 0x7CC5,
0xF4DC, 0x7CD7,
0xF4DD, 0x7CE8,
0xF4DE, 0x826E,
0xF4DF, 0x66A8,
0xF4E0, 0x7FBF,
0xF4E1, 0x7FCE,
0xF4E2, 0x7FD5,
0xF4E3, 0x7FE5,
0xF4E4, 0x7FE1,
0xF4E5, 0x7FE6,
0xF4E6, 0x7FE9,
0xF4E7, 0x7FEE,
0xF4E8, 0x7FF3,
0xF4E9, 0x7CF8,
0xF4EA, 0x7D77,
0xF4EB, 0x7DA6,
0xF4EC, 0x7DAE,
0xF4ED, 0x7E47,
0xF4EE, 0x7E9B,
0xF4EF, 0x9EB8,
0xF4F0, 0x9EB4,
0xF4F1, 0x8D73,
0xF4F2, 0x8D84,
0xF4F3, 0x8D94,
0xF4F4, 0x8D91,
0xF4F5, 0x8DB1,
0xF4F6, 0x8D67,
0xF4F7, 0x8D6D,
0xF4F8, 0x8C47,
0xF4F9, 0x8C49,
0xF4FA, 0x914A,
0xF4FB, 0x9150,
0xF4FE, 0x9164,
0xF5A1, 0x9162,
0xF5A2, 0x9161,
0xF5A3, 0x9170,
0xF5A4, 0x9169,
0xF5A5, 0x916F,
0xF5A8, 0x9172,
0xF5A9, 0x9174,
0xF5AA, 0x9179,
0xF5AB, 0x918C,
0xF5AC, 0x9185,
0xF5AD, 0x9190,
0xF5AE, 0x918D,
0xF5AF, 0x9191,
0xF5B2, 0x91AA,
0xF5B6, 0x91B5,
0xF5B7, 0x91B4,
0xF5B8, 0x91BA,
0xF5B9, 0x8C55,
0xF5BA, 0x9E7E,
0xF5BB, 0x8DB8,
0xF5BC, 0x8DEB,
0xF5BD, 0x8E05,
0xF5BE, 0x8E59,
0xF5BF, 0x8E69,
0xF5C0, 0x8DB5,
0xF5C1, 0x8DBF,
0xF5C2, 0x8DBC,
0xF5C3, 0x8DBA,
0xF5C4, 0x8DC4,
0xF5C7, 0x8DDA,
0xF5C8, 0x8DDE,
0xF5CB, 0x8DDB,
0xF5CC, 0x8DC6,
0xF5CD, 0x8DEC,
0xF5D0, 0x8DE3,
0xF5D1, 0x8DF9,
0xF5D2, 0x8DFB,
0xF5D3, 0x8DE4,
0xF5D4, 0x8E09,
0xF5D5, 0x8DFD,
0xF5D6, 0x8E14,
0xF5D7, 0x8E1D,
0xF5D8, 0x8E1F,
0xF5D9, 0x8E2C,
0xF5DA, 0x8E2E,
0xF5DB, 0x8E23,
0xF5DC, 0x8E2F,
0xF5DD, 0x8E3A,
0xF5DE, 0x8E40,
0xF5DF, 0x8E39,
0xF5E0, 0x8E35,
0xF5E1, 0x8E3D,
0xF5E2, 0x8E31,
0xF5E3, 0x8E49,
0xF5E8, 0x8E4A,
0xF5E9, 0x8E70,
0xF5EA, 0x8E76,
0xF5EB, 0x8E7C,
0xF5EC, 0x8E6F,
0xF5ED, 0x8E74,
0xF5EE, 0x8E85,
0xF5EF, 0x8E8F,
0xF5F0, 0x8E94,
0xF5F1, 0x8E90,
0xF5F2, 0x8E9C,
0xF5F3, 0x8E9E,
0xF5F4, 0x8C78,
0xF5F5, 0x8C82,
0xF5F6, 0x8C8A,
0xF5F7, 0x8C85,
0xF5F8, 0x8C98,
0xF5F9, 0x8C94,
0xF5FA, 0x659B,
0xF5FB, 0x89D6,
0xF5FC, 0x89DE,
0xF5FD, 0x89DA,
0xF5FE, 0x89DC,
0xF6A1, 0x89E5,
0xF6A2, 0x89EB,
0xF6A3, 0x89EF,
0xF6A4, 0x8A3E,
0xF6A5, 0x8B26,
0xF6A6, 0x9753,
0xF6A7, 0x96E9,
0xF6A8, 0x96F3,
0xF6A9, 0x96EF,
0xF6AA, 0x9706,
0xF6AB, 0x9701,
0xF6AC, 0x9708,
0xF6AD, 0x970F,
0xF6AE, 0x970E,
0xF6AF, 0x972A,
0xF6B0, 0x972D,
0xF6B1, 0x9730,
0xF6B2, 0x973E,
0xF6B3, 0x9F80,
0xF6B4, 0x9F83,
0xF6BB, 0x9F8C,
0xF6BC, 0x9EFE,
0xF6BD, 0x9F0B,
0xF6BE, 0x9F0D,
0xF6BF, 0x96B9,
0xF6C2, 0x96CE,
0xF6C3, 0x96D2,
0xF6C4, 0x77BF,
0xF6C5, 0x96E0,
0xF6C6, 0x928E,
0xF6C7, 0x92AE,
0xF6C8, 0x92C8,
0xF6C9, 0x933E,
0xF6CA, 0x936A,
0xF6CB, 0x93CA,
0xF6CC, 0x938F,
0xF6CD, 0x943E,
0xF6CE, 0x946B,
0xF6CF, 0x9C7F,
0xF6D0, 0x9C82,
0xF6D5, 0x7A23,
0xF6D6, 0x9C8B,
0xF6D7, 0x9C8E,
0xF6EA, 0x9CAB,
0xF780, 0x9C7B,
0xF783, 0x9C80,
0xF788, 0x9C8C,
0xF789, 0x9C8F,
0xF78A, 0x9C93,
0xF78F, 0x9C9D,
0xF790, 0x9CAA,
0xF791, 0x9CAC,
0xF792, 0x9CAF,
0xF793, 0x9CB9,
0xF7AE, 0x9CDF,
0xF7AF, 0x9CE2,
0xF7B0, 0x977C,
0xF7B1, 0x9785,
0xF7B4, 0x9794,
0xF7B5, 0x97AF,
0xF7B6, 0x97AB,
0xF7B7, 0x97A3,
0xF7B8, 0x97B2,
0xF7B9, 0x97B4,
0xF7BA, 0x9AB1,
0xF7BB, 0x9AB0,
0xF7BC, 0x9AB7,
0xF7BD, 0x9E58,
0xF7BE, 0x9AB6,
0xF7BF, 0x9ABA,
0xF7C0, 0x9ABC,
0xF7C1, 0x9AC1,
0xF7C2, 0x9AC0,
0xF7C3, 0x9AC5,
0xF7C4, 0x9AC2,
0xF7C7, 0x9AD1,
0xF7C8, 0x9B45,
0xF7C9, 0x9B43,
0xF7CA, 0x9B47,
0xF7CB, 0x9B49,
0xF7CC, 0x9B48,
0xF7CD, 0x9B4D,
0xF7CE, 0x9B51,
0xF7CF, 0x98E8,
0xF7D0, 0x990D,
0xF7D1, 0x992E,
0xF7D2, 0x9955,
0xF7D3, 0x9954,
0xF7D4, 0x9ADF,
0xF7D5, 0x9AE1,
0xF7D6, 0x9AE6,
0xF7D7, 0x9AEF,
0xF7D8, 0x9AEB,
0xF7D9, 0x9AFB,
0xF7DA, 0x9AED,
0xF7DB, 0x9AF9,
0xF7DC, 0x9B08,
0xF7DD, 0x9B0F,
0xF7DE, 0x9B13,
0xF7DF, 0x9B1F,
0xF7E0, 0x9B23,
0xF7E3, 0x7E3B,
0xF7E4, 0x9E82,
0xF7E7, 0x9E8B,
0xF7E8, 0x9E92,
0xF7E9, 0x93D6,
0xF7EA, 0x9E9D,
0xF7EB, 0x9E9F,
0xF7EF, 0x9EE0,
0xF7F0, 0x9EDF,
0xF7F1, 0x9EE2,
0xF7F2, 0x9EE9,
0xF7F3, 0x9EE7,
0xF7F4, 0x9EE5,
0xF7F5, 0x9EEA,
0xF7F6, 0x9EEF,
0xF7F7, 0x9F22,
0xF7F8, 0x9F2C,
0xF7F9, 0x9F2F,
0xF7FA, 0x9F39,
0xF7FB, 0x9F37,
0xF7FE, 0x9F44,
0xFB5C, 0x9E24,
0xFB5D, 0x9E27,
0xFB5E, 0x9E2E,
0xFB5F, 0x9E30,
0xFB60, 0x9E34,
0xFB63, 0x9E40,
0xFB64, 0x9E4D,
0xFB65, 0x9E50,
0xFB69, 0x9E56,
0xFB6A, 0x9E59,
0xFB6B, 0x9E5D,
0xFB70, 0x9E65,
0xFB73, 0x9E72,
0xFB7E, 0x9E80,
0xFB80, 0x9E81,
0xFB96, 0x9E9E,
0xFC4E, 0x9EBC,
0xFC5B, 0x9ED0,
0xFC63, 0x9EDE,
0xFC64, 0x9EE1,
0xFC67, 0x9EE6,
0xFC68, 0x9EE8,
0xFC76, 0x9EFA,
0xFC77, 0x9EFD,
0xFC85, 0x9F0C,
0xFC86, 0x9F0F,
0xFC8C, 0x9F18,
0xFC93, 0x9F21,
0xFD45, 0x9F38,
0xFD46, 0x9F3A,
0xFD47, 0x9F3C,
0xFD9C, 0xF92C,
0xFD9D, 0xF979,
0xFD9E, 0xF995,
0xFD9F, 0xF9E7,
0xFDA0, 0xF9F1,
0xFE44, 0xFA11,
0xFE47, 0xFA18, // }}}
};
static const unsigned short _gbk2utf16_3[] =
{
0x8141, 0x8143, 0x4E04, // {{{
0x8147, 0x8149, 0x4E1F,
0x814D, 0x814E, 0x4E2E,
0x8154, 0x8156, 0x4E40,
0x815D, 0x815E, 0x4E5A,
0x815F, 0x8162, 0x4E62,
0x8163, 0x8164, 0x4E67,
0x8165, 0x816A, 0x4E6A,
0x816C, 0x8175, 0x4E74,
0x8176, 0x817C, 0x4E7F,
0x8181, 0x8182, 0x4E96,
0x8184, 0x8186, 0x4E9C,
0x8189, 0x818B, 0x4EAF,
0x818D, 0x8190, 0x4EB6,
0x8191, 0x8193, 0x4EBC,
0x8196, 0x8197, 0x4ECF,
0x8199, 0x819B, 0x4EDA,
0x819E, 0x819F, 0x4EE6,
0x81A1, 0x81A3, 0x4EED,
0x81A6, 0x81A8, 0x4EF8,
0x81AC, 0x81B2, 0x4F02,
0x81B3, 0x81B4, 0x4F0B,
0x81B5, 0x81B9, 0x4F12,
0x81BA, 0x81BB, 0x4F1C,
0x81BE, 0x81BF, 0x4F28,
0x81C0, 0x81C2, 0x4F2C,
0x81C9, 0x81CD, 0x4F3E,
0x81CE, 0x81CF, 0x4F44,
0x81D0, 0x81D5, 0x4F47,
0x81D9, 0x81DA, 0x4F61,
0x81DD, 0x81DE, 0x4F6A,
0x81DF, 0x81E0, 0x4F6D,
0x81E1, 0x81E2, 0x4F71,
0x81E4, 0x81E7, 0x4F77,
0x81E9, 0x81EB, 0x4F80,
0x81EC, 0x81EE, 0x4F85,
0x81F3, 0x81F4, 0x4F92,
0x81F5, 0x81F6, 0x4F95,
0x81F7, 0x81F9, 0x4F98,
0x81FB, 0x81FC, 0x4F9E,
0x81FD, 0x81FE, 0x4FA1,
0x8243, 0x8247, 0x4FB0,
0x8248, 0x8250, 0x4FB6,
0x8251, 0x8253, 0x4FC0,
0x8254, 0x8257, 0x4FC6,
0x8258, 0x825A, 0x4FCB,
0x825B, 0x825F, 0x4FD2,
0x8264, 0x8265, 0x4FE4,
0x8267, 0x8268, 0x4FEB,
0x826B, 0x826E, 0x4FF4,
0x8270, 0x8272, 0x4FFB,
0x8273, 0x827E, 0x4FFF,
0x8282, 0x8283, 0x5010,
0x8285, 0x8287, 0x5015,
0x8289, 0x828A, 0x501D,
0x828C, 0x828E, 0x5022,
0x8291, 0x829B, 0x502F,
0x829E, 0x82A1, 0x503F,
0x82A2, 0x82A4, 0x5044,
0x82A5, 0x82A7, 0x5049,
0x82A9, 0x82AD, 0x5050,
0x82AE, 0x82B1, 0x5056,
0x82B3, 0x82BA, 0x505D,
0x82BB, 0x82C0, 0x5066,
0x82C1, 0x82C9, 0x506D,
0x82CA, 0x82CC, 0x5078,
0x82CD, 0x82CE, 0x507C,
0x82CF, 0x82D2, 0x5081,
0x82D3, 0x82D4, 0x5086,
0x82D5, 0x82D8, 0x5089,
0x82D9, 0x82ED, 0x508E,
0x82F0, 0x82F1, 0x50AA,
0x82F2, 0x82F6, 0x50AD,
0x82F7, 0x82FD, 0x50B3,
0x8340, 0x8351, 0x50BD,
0x8352, 0x8357, 0x50D0,
0x8358, 0x835A, 0x50D7,
0x835B, 0x8365, 0x50DB,
0x8366, 0x8369, 0x50E8,
0x836A, 0x836D, 0x50EF,
0x836F, 0x8373, 0x50F6,
0x8374, 0x837D, 0x50FC,
0x8380, 0x8381, 0x5109,
0x8382, 0x8387, 0x510C,
0x8388, 0x8395, 0x5113,
0x8396, 0x83B2, 0x5122,
0x83B7, 0x83B9, 0x514E,
0x83BA, 0x83BB, 0x5152,
0x83BC, 0x83BE, 0x5157,
0x83C0, 0x83C4, 0x515D,
0x83C5, 0x83C6, 0x5163,
0x83C7, 0x83C8, 0x5166,
0x83C9, 0x83CA, 0x5169,
0x83CE, 0x83CF, 0x517E,
0x83D0, 0x83D1, 0x5183,
0x83D2, 0x83D3, 0x5186,
0x83D4, 0x83D5, 0x518A,
0x83D6, 0x83D9, 0x518E,
0x83DA, 0x83DB, 0x5193,
0x83DE, 0x83E0, 0x519D,
0x83E3, 0x83E7, 0x51A6,
0x83E8, 0x83E9, 0x51AD,
0x83EB, 0x83ED, 0x51B8,
0x83EE, 0x83EF, 0x51BE,
0x83F0, 0x83F2, 0x51C1,
0x83F6, 0x83F7, 0x51CD,
0x83F9, 0x83FE, 0x51D2,
0x8440, 0x8442, 0x51D8,
0x8444, 0x8445, 0x51DE,
0x8446, 0x8447, 0x51E2,
0x8448, 0x844D, 0x51E5,
0x8450, 0x8451, 0x51F1,
0x8455, 0x8456, 0x5204,
0x8458, 0x8459, 0x520B,
0x845A, 0x845B, 0x520F,
0x845C, 0x845E, 0x5213,
0x8460, 0x8461, 0x521E,
0x8462, 0x8464, 0x5221,
0x8465, 0x8467, 0x5225,
0x846B, 0x846C, 0x5231,
0x846D, 0x846E, 0x5234,
0x8471, 0x8476, 0x5244,
0x8478, 0x8479, 0x524E,
0x847A, 0x847B, 0x5252,
0x847D, 0x847E, 0x5257,
0x8480, 0x8482, 0x5259,
0x8484, 0x8485, 0x525F,
0x8486, 0x8488, 0x5262,
0x848B, 0x848E, 0x526B,
0x848F, 0x8490, 0x5270,
0x8491, 0x849A, 0x5273,
0x849D, 0x84A1, 0x5283,
0x84A2, 0x84A8, 0x5289,
0x84A9, 0x84AA, 0x5291,
0x84AB, 0x84B1, 0x5294,
0x84B3, 0x84B6, 0x52A4,
0x84B7, 0x84B9, 0x52AE,
0x84BA, 0x84C3, 0x52B4,
0x84C4, 0x84C6, 0x52C0,
0x84C7, 0x84C9, 0x52C4,
0x84CC, 0x84CF, 0x52CC,
0x84D1, 0x84D3, 0x52D3,
0x84D5, 0x84DA, 0x52D9,
0x84DB, 0x84DE, 0x52E0,
0x84DF, 0x84E9, 0x52E5,
0x84EA, 0x84F1, 0x52F1,
0x84F2, 0x84F4, 0x52FB,
0x84F5, 0x84F8, 0x5301,
0x84FA, 0x84FD, 0x5309,
0x8540, 0x8543, 0x5311,
0x8545, 0x8546, 0x531B,
0x8547, 0x8548, 0x531E,
0x854A, 0x854B, 0x5324,
0x854C, 0x854E, 0x5327,
0x854F, 0x8551, 0x532B,
0x8552, 0x855B, 0x532F,
0x855C, 0x855D, 0x533C,
0x8562, 0x8564, 0x534B,
0x8567, 0x8568, 0x5358,
0x856E, 0x856F, 0x536C,
0x8573, 0x8576, 0x537B,
0x8577, 0x8578, 0x5380,
0x857A, 0x857B, 0x5387,
0x857D, 0x857E, 0x538E,
0x8580, 0x8584, 0x5390,
0x8585, 0x8586, 0x5396,
0x8588, 0x8589, 0x539B,
0x858B, 0x858C, 0x53A0,
0x858F, 0x8592, 0x53AA,
0x8593, 0x8599, 0x53AF,
0x859A, 0x859D, 0x53B7,
0x859E, 0x85A0, 0x53BC,
0x85A2, 0x85A6, 0x53C3,
0x85A7, 0x85A9, 0x53CE,
0x85AA, 0x85AB, 0x53D2,
0x85AE, 0x85B0, 0x53DC,
0x85B1, 0x85B2, 0x53E1,
0x85B6, 0x85B8, 0x53FE,
0x85BE, 0x85C0, 0x5418,
0x85C3, 0x85C4, 0x5424,
0x85C8, 0x85C9, 0x5436,
0x85CD, 0x85CE, 0x5441,
0x85CF, 0x85D0, 0x5444,
0x85D3, 0x85D6, 0x544C,
0x85D9, 0x85DD, 0x545D,
0x85E1, 0x85E8, 0x5469,
0x85EA, 0x85EB, 0x5479,
0x85EC, 0x85ED, 0x547E,
0x85F1, 0x85F4, 0x5487,
0x85F8, 0x85F9, 0x5497,
0x85FB, 0x85FE, 0x549E,
0x8645, 0x8647, 0x54B5,
0x8648, 0x8649, 0x54B9,
0x864E, 0x864F, 0x54CA,
0x8653, 0x8657, 0x54E0,
0x8658, 0x8659, 0x54EB,
0x865A, 0x865C, 0x54EF,
0x865D, 0x8662, 0x54F4,
0x8666, 0x8669, 0x5502,
0x866B, 0x866F, 0x550A,
0x8670, 0x8671, 0x5512,
0x8672, 0x8677, 0x5515,
0x8678, 0x867B, 0x551C,
0x867D, 0x867E, 0x5525,
0x8680, 0x8681, 0x5528,
0x8685, 0x8687, 0x5534,
0x8688, 0x868B, 0x5538,
0x8690, 0x8691, 0x5547,
0x8692, 0x8696, 0x554B,
0x8697, 0x869A, 0x5551,
0x869B, 0x869F, 0x5557,
0x86A0, 0x86A3, 0x555D,
0x86A4, 0x86A5, 0x5562,
0x86A6, 0x86A7, 0x5568,
0x86A9, 0x86AE, 0x556F,
0x86AF, 0x86B0, 0x5579,
0x86B3, 0x86B4, 0x5585,
0x86B5, 0x86B7, 0x558C,
0x86B9, 0x86BA, 0x5592,
0x86BB, 0x86BD, 0x5595,
0x86BE, 0x86BF, 0x559A,
0x86C1, 0x86C7, 0x55A0,
0x86C8, 0x86D0, 0x55A8,
0x86D7, 0x86DB, 0x55BF,
0x86DC, 0x86DE, 0x55C6,
0x86DF, 0x86E0, 0x55CA,
0x86E1, 0x86E3, 0x55CE,
0x86E5, 0x86E9, 0x55D7,
0x86EF, 0x86F0, 0x55ED,
0x86F1, 0x86F2, 0x55F0,
0x86F5, 0x86F9, 0x55F8,
0x86FB, 0x86FE, 0x5602,
0x8740, 0x8741, 0x5606,
0x8742, 0x8743, 0x560A,
0x8745, 0x874C, 0x5610,
0x874D, 0x874E, 0x5619,
0x874F, 0x8750, 0x561C,
0x8751, 0x8753, 0x5620,
0x8754, 0x8755, 0x5625,
0x8756, 0x8759, 0x5628,
0x875A, 0x875C, 0x562E,
0x875F, 0x8760, 0x5637,
0x8762, 0x8764, 0x563C,
0x8765, 0x8770, 0x5640,
0x8771, 0x8775, 0x564F,
0x8776, 0x8777, 0x5655,
0x8778, 0x8779, 0x565A,
0x877A, 0x877E, 0x565D,
0x8781, 0x8783, 0x5665,
0x8784, 0x8787, 0x566D,
0x8788, 0x878B, 0x5672,
0x878C, 0x878F, 0x5677,
0x8790, 0x8797, 0x567D,
0x8798, 0x879E, 0x5687,
0x879F, 0x87A1, 0x5690,
0x87A2, 0x87B0, 0x5694,
0x87B1, 0x87BB, 0x56A4,
0x87BC, 0x87C2, 0x56B0,
0x87C3, 0x87C6, 0x56B8,
0x87C7, 0x87D3, 0x56BD,
0x87D4, 0x87DC, 0x56CB,
0x87DD, 0x87DE, 0x56D5,
0x87DF, 0x87E0, 0x56D8,
0x87E3, 0x87E8, 0x56E5,
0x87EA, 0x87EB, 0x56EE,
0x87EC, 0x87ED, 0x56F2,
0x87EE, 0x87F0, 0x56F6,
0x87F1, 0x87F2, 0x56FB,
0x87F3, 0x87F5, 0x5700,
0x87F8, 0x87FE, 0x570B,
0x8840, 0x8849, 0x5712,
0x884A, 0x884B, 0x571D,
0x884C, 0x884E, 0x5720,
0x884F, 0x8852, 0x5724,
0x8854, 0x8855, 0x5731,
0x8856, 0x885A, 0x5734,
0x885B, 0x885C, 0x573C,
0x885F, 0x8862, 0x5743,
0x8863, 0x8864, 0x5748,
0x8866, 0x886A, 0x5752,
0x886B, 0x886C, 0x5758,
0x886D, 0x886E, 0x5762,
0x8873, 0x8875, 0x5770,
0x8876, 0x8877, 0x5774,
0x8878, 0x887A, 0x5778,
0x887B, 0x887E, 0x577D,
0x8881, 0x8884, 0x5787,
0x8885, 0x8889, 0x578D,
0x888A, 0x8890, 0x5794,
0x8891, 0x8894, 0x579C,
0x8899, 0x889B, 0x57AF,
0x889D, 0x889F, 0x57B5,
0x88A0, 0x88A8, 0x57B9,
0x88A9, 0x88AF, 0x57C4,
0x88B0, 0x88B1, 0x57CC,
0x88B2, 0x88B3, 0x57D0,
0x88B5, 0x88B6, 0x57D6,
0x88B7, 0x88B8, 0x57DB,
0x88BA, 0x88BC, 0x57E1,
0x88BD, 0x88C4, 0x57E5,
0x88C6, 0x88C9, 0x57F0,
0x88CA, 0x88CC, 0x57F5,
0x88CD, 0x88CE, 0x57FB,
0x88CF, 0x88D0, 0x57FE,
0x88D2, 0x88D4, 0x5803,
0x88D5, 0x88D7, 0x5808,
0x88D9, 0x88DB, 0x580E,
0x88DC, 0x88DE, 0x5812,
0x88DF, 0x88E1, 0x5816,
0x88E2, 0x88E5, 0x581A,
0x88E7, 0x88E8, 0x5822,
0x88E9, 0x88ED, 0x5825,
0x88EE, 0x88F2, 0x582B,
0x88F3, 0x88F6, 0x5831,
0x88F7, 0x88FE, 0x5836,
0x8940, 0x8945, 0x583E,
0x8946, 0x894C, 0x5845,
0x894D, 0x894F, 0x584E,
0x8950, 0x8951, 0x5852,
0x8952, 0x8954, 0x5855,
0x8955, 0x8959, 0x5859,
0x895A, 0x895F, 0x585F,
0x8960, 0x8964, 0x5866,
0x8965, 0x8975, 0x586D,
0x8979, 0x897B, 0x5886,
0x897C, 0x897E, 0x588A,
0x8980, 0x8984, 0x588D,
0x8985, 0x8989, 0x5894,
0x898A, 0x898C, 0x589B,
0x898D, 0x8994, 0x58A0,
0x8995, 0x89A6, 0x58AA,
0x89A7, 0x89AA, 0x58BD,
0x89AB, 0x89AD, 0x58C2,
0x89AE, 0x89B8, 0x58C6,
0x89B9, 0x89BB, 0x58D2,
0x89BC, 0x89C9, 0x58D6,
0x89CA, 0x89CF, 0x58E5,
0x89D2, 0x89D3, 0x58F1,
0x89D4, 0x89D5, 0x58F4,
0x89D6, 0x89D7, 0x58F7,
0x89D8, 0x89DF, 0x58FA,
0x89E1, 0x89E2, 0x5905,
0x89E3, 0x89E7, 0x5908,
0x89E9, 0x89EC, 0x5910,
0x89ED, 0x89EE, 0x5917,
0x89F0, 0x89F1, 0x591D,
0x89F2, 0x89F5, 0x5920,
0x89FA, 0x89FB, 0x5932,
0x89FC, 0x89FD, 0x5935,
0x8A40, 0x8A43, 0x593D,
0x8A45, 0x8A46, 0x5945,
0x8A48, 0x8A49, 0x594C,
0x8A4B, 0x8A4C, 0x5952,
0x8A4E, 0x8A52, 0x595B,
0x8A54, 0x8A55, 0x5963,
0x8A56, 0x8A62, 0x5966,
0x8A65, 0x8A67, 0x597A,
0x8A68, 0x8A6A, 0x597E,
0x8A6D, 0x8A6E, 0x598B,
0x8A6F, 0x8A72, 0x598E,
0x8A73, 0x8A74, 0x5994,
0x8A76, 0x8A79, 0x599A,
0x8A7A, 0x8A7D, 0x599F,
0x8A81, 0x8A82, 0x59AC,
0x8A83, 0x8A84, 0x59B0,
0x8A85, 0x8A8A, 0x59B3,
0x8A8C, 0x8A8D, 0x59BC,
0x8A8E, 0x8A94, 0x59BF,
0x8A95, 0x8A97, 0x59C7,
0x8A98, 0x8A9B, 0x59CC,
0x8A9C, 0x8A9D, 0x59D5,
0x8AA0, 0x8AA4, 0x59DE,
0x8AA6, 0x8AA7, 0x59E6,
0x8AA8, 0x8AAA, 0x59E9,
0x8AAB, 0x8AB6, 0x59ED,
0x8AB8, 0x8ABA, 0x59FC,
0x8ABD, 0x8ABE, 0x5A0A,
0x8ABF, 0x8AC2, 0x5A0D,
0x8AC4, 0x8AC7, 0x5A14,
0x8AC8, 0x8ACA, 0x5A19,
0x8ACB, 0x8ACC, 0x5A1D,
0x8ACD, 0x8ACE, 0x5A21,
0x8AD0, 0x8AD2, 0x5A26,
0x8AD3, 0x8AD9, 0x5A2A,
0x8ADC, 0x8AE0, 0x5A37,
0x8AE1, 0x8AE3, 0x5A3D,
0x8AE4, 0x8AE8, 0x5A41,
0x8AE9, 0x8AEA, 0x5A47,
0x8AEB, 0x8AF4, 0x5A4B,
0x8AF5, 0x8AF8, 0x5A56,
0x8AF9, 0x8AFE, 0x5A5B,
0x8B41, 0x8B44, 0x5A63,
0x8B45, 0x8B46, 0x5A68,
0x8B47, 0x8B4F, 0x5A6B,
0x8B50, 0x8B51, 0x5A78,
0x8B52, 0x8B55, 0x5A7B,
0x8B56, 0x8B67, 0x5A80,
0x8B68, 0x8B6E, 0x5A93,
0x8B6F, 0x8B7C, 0x5A9C,
0x8B7D, 0x8B7E, 0x5AAB,
0x8B80, 0x8B84, 0x5AAD,
0x8B86, 0x8B87, 0x5AB6,
0x8B88, 0x8B8C, 0x5AB9,
0x8B8D, 0x8B8E, 0x5ABF,
0x8B8F, 0x8B94, 0x5AC3,
0x8B95, 0x8B96, 0x5ACA,
0x8B97, 0x8B9B, 0x5ACD,
0x8B9F, 0x8BA1, 0x5AD9,
0x8BA2, 0x8BA4, 0x5ADD,
0x8BA6, 0x8BA7, 0x5AE4,
0x8BA8, 0x8BA9, 0x5AE7,
0x8BAB, 0x8BAF, 0x5AEC,
0x8BB0, 0x8BC6, 0x5AF2,
0x8BC7, 0x8BD2, 0x5B0A,
0x8BD3, 0x8BEC, 0x5B18,
0x8BEE, 0x8BEF, 0x5B35,
0x8BF0, 0x8BF7, 0x5B38,
0x8BF8, 0x8BFE, 0x5B41,
0x8C40, 0x8C47, 0x5B48,
0x8C4B, 0x8C4C, 0x5B60,
0x8C4D, 0x8C4E, 0x5B67,
0x8C50, 0x8C52, 0x5B6D,
0x8C55, 0x8C58, 0x5B76,
0x8C59, 0x8C5A, 0x5B7B,
0x8C5B, 0x8C5C, 0x5B7E,
0x8C60, 0x8C61, 0x5B8D,
0x8C62, 0x8C64, 0x5B90,
0x8C68, 0x8C6A, 0x5BA7,
0x8C6B, 0x8C6E, 0x5BAC,
0x8C6F, 0x8C70, 0x5BB1,
0x8C72, 0x8C74, 0x5BBA,
0x8C75, 0x8C76, 0x5BC0,
0x8C78, 0x8C7B, 0x5BC8,
0x8C7C, 0x8C7E, 0x5BCD,
0x8C81, 0x8C89, 0x5BD4,
0x8C8B, 0x8C8C, 0x5BE2,
0x8C8D, 0x8C8E, 0x5BE6,
0x8C8F, 0x8C93, 0x5BE9,
0x8C95, 0x8C9B, 0x5BF1,
0x8C9C, 0x8C9D, 0x5BFD,
0x8C9F, 0x8CA0, 0x5C02,
0x8CA2, 0x8CA3, 0x5C07,
0x8CA4, 0x8CA7, 0x5C0B,
0x8CA9, 0x8CAA, 0x5C12,
0x8CAE, 0x8CB1, 0x5C1E,
0x8CB4, 0x8CB7, 0x5C28,
0x8CB8, 0x8CBB, 0x5C2D,
0x8CBC, 0x8CBD, 0x5C32,
0x8CBE, 0x8CC0, 0x5C35,
0x8CC1, 0x8CC2, 0x5C43,
0x8CC3, 0x8CC4, 0x5C46,
0x8CC5, 0x8CC6, 0x5C4C,
0x8CC7, 0x8CC9, 0x5C52,
0x8CCA, 0x8CCC, 0x5C56,
0x8CCD, 0x8CD0, 0x5C5A,
0x8CD4, 0x8CDA, 0x5C67,
0x8CDC, 0x8CE2, 0x5C72,
0x8CE3, 0x8CE6, 0x5C7B,
0x8CE8, 0x8CEC, 0x5C83,
0x8CED, 0x8CEF, 0x5C89,
0x8CF0, 0x8CF1, 0x5C8E,
0x8CF2, 0x8CF3, 0x5C92,
0x8CF5, 0x8CF9, 0x5C9D,
0x8CFA, 0x8CFE, 0x5CA4,
0x8D41, 0x8D43, 0x5CAE,
0x8D47, 0x8D4A, 0x5CB9,
0x8D4D, 0x8D4E, 0x5CC2,
0x8D4F, 0x8D54, 0x5CC5,
0x8D55, 0x8D5A, 0x5CCC,
0x8D5B, 0x8D60, 0x5CD3,
0x8D61, 0x8D67, 0x5CDA,
0x8D68, 0x8D69, 0x5CE2,
0x8D6C, 0x8D6D, 0x5CEB,
0x8D6E, 0x8D6F, 0x5CEE,
0x8D70, 0x8D79, 0x5CF1,
0x8D7A, 0x8D7E, 0x5CFC,
0x8D81, 0x8D82, 0x5D04,
0x8D83, 0x8D88, 0x5D08,
0x8D89, 0x8D8D, 0x5D0F,
0x8D8F, 0x8D92, 0x5D17,
0x8D93, 0x8D94, 0x5D1C,
0x8D95, 0x8D99, 0x5D1F,
0x8D9C, 0x8D9E, 0x5D2A,
0x8D9F, 0x8DA3, 0x5D2F,
0x8DA4, 0x8DAB, 0x5D35,
0x8DAC, 0x8DB3, 0x5D3F,
0x8DB4, 0x8DB5, 0x5D48,
0x8DB6, 0x8DC0, 0x5D4D,
0x8DC1, 0x8DC2, 0x5D59,
0x8DC4, 0x8DCE, 0x5D5E,
0x8DD0, 0x8DD1, 0x5D6D,
0x8DD2, 0x8DD5, 0x5D70,
0x8DD6, 0x8DE2, 0x5D75,
0x8DE3, 0x8DF8, 0x5D83,
0x8DF9, 0x8DFB, 0x5D9A,
0x8DFC, 0x8DFE, 0x5D9E,
0x8E40, 0x8E55, 0x5DA1,
0x8E56, 0x8E62, 0x5DB8,
0x8E63, 0x8E69, 0x5DC6,
0x8E6A, 0x8E76, 0x5DCE,
0x8E78, 0x8E79, 0x5DDF,
0x8E7A, 0x8E7B, 0x5DE3,
0x8E7D, 0x8E7E, 0x5DEC,
0x8E81, 0x8E82, 0x5DF5,
0x8E83, 0x8E87, 0x5DF8,
0x8E88, 0x8E89, 0x5DFF,
0x8E8C, 0x8E8E, 0x5E09,
0x8E8F, 0x8E90, 0x5E0D,
0x8E91, 0x8E92, 0x5E12,
0x8E94, 0x8E9B, 0x5E1E,
0x8E9C, 0x8EA0, 0x5E28,
0x8EA1, 0x8EA2, 0x5E2F,
0x8EA3, 0x8EA7, 0x5E32,
0x8EA8, 0x8EA9, 0x5E39,
0x8EAA, 0x8EAD, 0x5E3E,
0x8EAF, 0x8EB4, 0x5E46,
0x8EB5, 0x8EBB, 0x5E4D,
0x8EBC, 0x8EC0, 0x5E56,
0x8EC1, 0x8EC2, 0x5E5C,
0x8EC3, 0x8EC4, 0x5E5F,
0x8EC5, 0x8ED3, 0x5E63,
0x8ED8, 0x8EDA, 0x5E81,
0x8EDC, 0x8EDD, 0x5E88,
0x8EDE, 0x8EE0, 0x5E8C,
0x8EE5, 0x8EE8, 0x5EA1,
0x8EE9, 0x8EED, 0x5EA8,
0x8EEE, 0x8EF2, 0x5EAE,
0x8EF4, 0x8EF7, 0x5EBA,
0x8EF8, 0x8EFE, 0x5EBF,
0x8F40, 0x8F42, 0x5EC6,
0x8F43, 0x8F48, 0x5ECB,
0x8F49, 0x8F4A, 0x5ED4,
0x8F4B, 0x8F4E, 0x5ED7,
0x8F4F, 0x8F5A, 0x5EDC,
0x8F5C, 0x8F64, 0x5EEB,
0x8F66, 0x8F67, 0x5EF8,
0x8F68, 0x8F6A, 0x5EFB,
0x8F6B, 0x8F6D, 0x5F05,
0x8F6F, 0x8F71, 0x5F0C,
0x8F76, 0x8F77, 0x5F19,
0x8F78, 0x8F7A, 0x5F1C,
0x8F7B, 0x8F7E, 0x5F21,
0x8F81, 0x8F82, 0x5F2B,
0x8F85, 0x8F8B, 0x5F32,
0x8F8D, 0x8F8F, 0x5F3D,
0x8F90, 0x8F9E, 0x5F41,
0x8FA1, 0x8FA4, 0x5F59,
0x8FA5, 0x8FA7, 0x5F5E,
0x8FAA, 0x8FAB, 0x5F67,
0x8FAD, 0x8FAE, 0x5F6E,
0x8FB0, 0x8FB2, 0x5F74,
0x8FB5, 0x8FB7, 0x5F7D,
0x8FBA, 0x8FBC, 0x5F8D,
0x8FBE, 0x8FBF, 0x5F93,
0x8FC1, 0x8FC2, 0x5F9A,
0x8FC3, 0x8FC6, 0x5F9D,
0x8FC7, 0x8FCC, 0x5FA2,
0x8FCE, 0x8FCF, 0x5FAB,
0x8FD0, 0x8FD5, 0x5FAF,
0x8FD7, 0x8FDA, 0x5FB8,
0x8FDB, 0x8FDF, 0x5FBE,
0x8FE0, 0x8FE1, 0x5FC7,
0x8FE2, 0x8FE3, 0x5FCA,
0x8FE5, 0x8FE7, 0x5FD3,
0x8FE8, 0x8FEA, 0x5FDA,
0x8FEB, 0x8FEC, 0x5FDE,
0x8FED, 0x8FEE, 0x5FE2,
0x8FEF, 0x8FF0, 0x5FE5,
0x8FF1, 0x8FF2, 0x5FE8,
0x8FF4, 0x8FF5, 0x5FEF,
0x8FF6, 0x8FF8, 0x5FF2,
0x8FF9, 0x8FFA, 0x5FF6,
0x8FFB, 0x8FFC, 0x5FF9,
0x9040, 0x9041, 0x6008,
0x9042, 0x9043, 0x600B,
0x9044, 0x9045, 0x6010,
0x9047, 0x9048, 0x6017,
0x904A, 0x904B, 0x601E,
0x904C, 0x904E, 0x6022,
0x904F, 0x9051, 0x602C,
0x9052, 0x9056, 0x6030,
0x9057, 0x905B, 0x6036,
0x905C, 0x905D, 0x603D,
0x905F, 0x9065, 0x6044,
0x9067, 0x9068, 0x604E,
0x906A, 0x906B, 0x6053,
0x906C, 0x906E, 0x6056,
0x906F, 0x9070, 0x605B,
0x9071, 0x9074, 0x605E,
0x9075, 0x9076, 0x6065,
0x9078, 0x9079, 0x6071,
0x907A, 0x907B, 0x6074,
0x9080, 0x9081, 0x6081,
0x9082, 0x9085, 0x6085,
0x9086, 0x9087, 0x608A,
0x9088, 0x908B, 0x608E,
0x908E, 0x9090, 0x6097,
0x9093, 0x9094, 0x60A1,
0x9095, 0x9096, 0x60A4,
0x9098, 0x9099, 0x60A9,
0x909D, 0x909F, 0x60B5,
0x90A0, 0x90A1, 0x60B9,
0x90A2, 0x90A9, 0x60BD,
0x90AA, 0x90AC, 0x60C7,
0x90AD, 0x90B1, 0x60CC,
0x90B2, 0x90B4, 0x60D2,
0x90B5, 0x90B6, 0x60D6,
0x90BA, 0x90BE, 0x60E1,
0x90C0, 0x90C1, 0x60F1,
0x90C3, 0x90C4, 0x60F7,
0x90C5, 0x90C9, 0x60FB,
0x90CA, 0x90CD, 0x6102,
0x90CF, 0x90D1, 0x610A,
0x90D2, 0x90D6, 0x6110,
0x90D7, 0x90DA, 0x6116,
0x90DB, 0x90DE, 0x611B,
0x90DF, 0x90E0, 0x6121,
0x90E2, 0x90E4, 0x6128,
0x90E5, 0x90F7, 0x612C,
0x90F8, 0x90FE, 0x6140,
0x9144, 0x9145, 0x614F,
0x9146, 0x9148, 0x6152,
0x9149, 0x914F, 0x6156,
0x9150, 0x9153, 0x615E,
0x9154, 0x9157, 0x6163,
0x9158, 0x915E, 0x6169,
0x915F, 0x9162, 0x6171,
0x9164, 0x9176, 0x6178,
0x9177, 0x9178, 0x618C,
0x9179, 0x917D, 0x618F,
0x9180, 0x9186, 0x6196,
0x9187, 0x918F, 0x619E,
0x9190, 0x9191, 0x61AA,
0x9192, 0x919B, 0x61AD,
0x919C, 0x91A1, 0x61B8,
0x91A2, 0x91A4, 0x61BF,
0x91A5, 0x91A9, 0x61C3,
0x91AB, 0x91AF, 0x61CC,
0x91B1, 0x91C1, 0x61D5,
0x91C2, 0x91CF, 0x61E7,
0x91D0, 0x91D8, 0x61F6,
0x91D9, 0x91DE, 0x6200,
0x91E1, 0x91E2, 0x6213,
0x91E4, 0x91E6, 0x621C,
0x91E9, 0x91EC, 0x6226,
0x91EF, 0x91F2, 0x622F,
0x91F3, 0x91F4, 0x6235,
0x91F5, 0x91F9, 0x6238,
0x91FB, 0x91FD, 0x6244,
0x9240, 0x9241, 0x624F,
0x9242, 0x9244, 0x6255,
0x9245, 0x9246, 0x6259,
0x9247, 0x924D, 0x625C,
0x924E, 0x924F, 0x6264,
0x9251, 0x9252, 0x6271,
0x9253, 0x9254, 0x6274,
0x9255, 0x9256, 0x6277,
0x9257, 0x9258, 0x627A,
0x925A, 0x925C, 0x6281,
0x925D, 0x9260, 0x6285,
0x9261, 0x9266, 0x628B,
0x9269, 0x926B, 0x629C,
0x926D, 0x926E, 0x62A6,
0x926F, 0x9270, 0x62A9,
0x9271, 0x9274, 0x62AD,
0x9275, 0x9277, 0x62B2,
0x9278, 0x927A, 0x62B6,
0x927D, 0x927E, 0x62C0,
0x9285, 0x9286, 0x62DD,
0x9287, 0x9288, 0x62E0,
0x928A, 0x928B, 0x62EA,
0x928F, 0x9292, 0x62F8,
0x9294, 0x9297, 0x6303,
0x9298, 0x929B, 0x630A,
0x929C, 0x929D, 0x630F,
0x929E, 0x92A1, 0x6312,
0x92A2, 0x92A4, 0x6317,
0x92A6, 0x92A7, 0x6326,
0x92A9, 0x92AB, 0x632C,
0x92AC, 0x92AD, 0x6330,
0x92AE, 0x92B3, 0x6333,
0x92B4, 0x92B5, 0x633B,
0x92B6, 0x92B9, 0x633E,
0x92BB, 0x92BC, 0x6347,
0x92BE, 0x92C1, 0x6351,
0x92C2, 0x92C9, 0x6356,
0x92CB, 0x92CD, 0x6364,
0x92CF, 0x92D1, 0x636A,
0x92D2, 0x92D3, 0x636F,
0x92D4, 0x92D7, 0x6372,
0x92D8, 0x92D9, 0x6378,
0x92DA, 0x92DD, 0x637C,
0x92DF, 0x92E2, 0x6383,
0x92E6, 0x92E8, 0x6393,
0x92EA, 0x92F0, 0x6399,
0x92F6, 0x92F7, 0x63B1,
0x92F8, 0x92F9, 0x63B5,
0x92FD, 0x92FE, 0x63BF,
0x9340, 0x9342, 0x63C1,
0x9344, 0x9345, 0x63C7,
0x9346, 0x9348, 0x63CA,
0x934A, 0x934C, 0x63D3,
0x934D, 0x9353, 0x63D7,
0x9356, 0x935A, 0x63E4,
0x935B, 0x935C, 0x63EB,
0x935D, 0x9360, 0x63EE,
0x9364, 0x9367, 0x63F9,
0x9369, 0x936A, 0x6403,
0x936B, 0x936F, 0x6406,
0x9370, 0x9371, 0x640D,
0x9372, 0x9373, 0x6411,
0x9374, 0x9379, 0x6415,
0x937C, 0x937E, 0x6422,
0x9381, 0x9383, 0x6427,
0x9385, 0x938A, 0x642E,
0x938B, 0x938F, 0x6435,
0x9390, 0x9391, 0x643B,
0x9394, 0x9395, 0x6442,
0x9397, 0x939D, 0x644B,
0x939F, 0x93A1, 0x6455,
0x93A2, 0x93A6, 0x6459,
0x93A7, 0x93AE, 0x645F,
0x93B0, 0x93B2, 0x646A,
0x93B3, 0x93BC, 0x646E,
0x93BD, 0x93C3, 0x647B,
0x93C6, 0x93CE, 0x6488,
0x93CF, 0x93D0, 0x6493,
0x93D1, 0x93D2, 0x6497,
0x93D3, 0x93D6, 0x649A,
0x93D7, 0x93DB, 0x649F,
0x93DC, 0x93DF, 0x64A5,
0x93E0, 0x93E1, 0x64AA,
0x93E3, 0x93E6, 0x64B1,
0x93EA, 0x93EC, 0x64BD,
0x93EE, 0x93EF, 0x64C3,
0x93F0, 0x93F6, 0x64C6,
0x93F9, 0x93FC, 0x64D3,
0x93FD, 0x93FE, 0x64D9,
0x9440, 0x9442, 0x64DB,
0x9443, 0x9445, 0x64DF,
0x9448, 0x9460, 0x64E7,
0x9461, 0x9468, 0x6501,
0x9469, 0x9470, 0x650A,
0x9471, 0x9475, 0x6513,
0x9476, 0x947E, 0x6519,
0x9480, 0x9482, 0x6522,
0x9483, 0x9487, 0x6526,
0x9488, 0x9489, 0x652C,
0x948A, 0x948D, 0x6530,
0x9490, 0x9491, 0x653C,
0x9492, 0x9496, 0x6540,
0x9497, 0x9498, 0x6546,
0x9499, 0x949A, 0x654A,
0x949B, 0x949C, 0x654D,
0x949E, 0x94A0, 0x6552,
0x94A1, 0x94A2, 0x6557,
0x94A5, 0x94A7, 0x655F,
0x94A8, 0x94A9, 0x6564,
0x94AA, 0x94AD, 0x6567,
0x94AE, 0x94B0, 0x656D,
0x94B3, 0x94B4, 0x6575,
0x94B5, 0x94C3, 0x6578,
0x94C4, 0x94C6, 0x6588,
0x94C7, 0x94C9, 0x658D,
0x94CB, 0x94CD, 0x6594,
0x94D0, 0x94D1, 0x659D,
0x94D3, 0x94D4, 0x65A2,
0x94DA, 0x94E1, 0x65B1,
0x94E2, 0x94E3, 0x65BA,
0x94E4, 0x94E6, 0x65BE,
0x94E8, 0x94EB, 0x65C7,
0x94ED, 0x94EE, 0x65D0,
0x94EF, 0x94F1, 0x65D3,
0x94F2, 0x94F9, 0x65D8,
0x94FB, 0x94FC, 0x65E3,
0x94FD, 0x94FE, 0x65EA,
0x9540, 0x9543, 0x65F2,
0x9544, 0x9545, 0x65F8,
0x9546, 0x954A, 0x65FB,
0x954C, 0x954D, 0x6604,
0x954E, 0x9550, 0x6607,
0x9553, 0x9555, 0x6610,
0x9556, 0x9558, 0x6616,
0x9559, 0x955B, 0x661A,
0x955D, 0x9560, 0x6621,
0x9562, 0x9565, 0x6629,
0x9568, 0x9569, 0x6632,
0x956A, 0x956E, 0x6637,
0x9570, 0x9571, 0x663F,
0x9573, 0x9579, 0x6644,
0x957A, 0x957B, 0x664D,
0x957C, 0x957D, 0x6650,
0x9581, 0x9584, 0x665B,
0x9586, 0x9587, 0x6662,
0x958A, 0x958E, 0x6669,
0x958F, 0x9591, 0x6671,
0x9593, 0x9594, 0x6678,
0x9595, 0x9597, 0x667B,
0x9598, 0x959A, 0x667F,
0x959C, 0x959D, 0x6685,
0x959E, 0x95A1, 0x6688,
0x95A2, 0x95A5, 0x668D,
0x95A6, 0x95A9, 0x6692,
0x95AA, 0x95AE, 0x6698,
0x95AF, 0x95B7, 0x669E,
0x95B8, 0x95BC, 0x66A9,
0x95BD, 0x95C1, 0x66AF,
0x95C2, 0x95C5, 0x66B5,
0x95C6, 0x95C9, 0x66BA,
0x95CA, 0x95E3, 0x66BF,
0x95E5, 0x95EC, 0x66DE,
0x95ED, 0x95EE, 0x66E7,
0x95EF, 0x95F4, 0x66EA,
0x95F6, 0x95F7, 0x66F5,
0x95F9, 0x95FA, 0x66FA,
0x95FC, 0x95FE, 0x6701,
0x9640, 0x9643, 0x6704,
0x9645, 0x9646, 0x670E,
0x9647, 0x9649, 0x6711,
0x964B, 0x964D, 0x6718,
0x9650, 0x9655, 0x6720,
0x965A, 0x965B, 0x6732,
0x965C, 0x965F, 0x6736,
0x9660, 0x9661, 0x673B,
0x9662, 0x9663, 0x673E,
0x9665, 0x9666, 0x6744,
0x9668, 0x9669, 0x674A,
0x966C, 0x966D, 0x6754,
0x966E, 0x9672, 0x6757,
0x9674, 0x9676, 0x6762,
0x9677, 0x9678, 0x6766,
0x9679, 0x967A, 0x676B,
0x9680, 0x9683, 0x6778,
0x9686, 0x9687, 0x6782,
0x9688, 0x9689, 0x6785,
0x968C, 0x968F, 0x678C,
0x9690, 0x9693, 0x6791,
0x9697, 0x9699, 0x679F,
0x969F, 0x96A0, 0x67B1,
0x96A2, 0x96A9, 0x67B9,
0x96AB, 0x96B4, 0x67C5,
0x96B5, 0x96B7, 0x67D5,
0x96BB, 0x96BC, 0x67E3,
0x96BD, 0x96BF, 0x67E6,
0x96C0, 0x96C1, 0x67EA,
0x96C2, 0x96C3, 0x67ED,
0x96C5, 0x96CC, 0x67F5,
0x96CE, 0x96D1, 0x6801,
0x96D6, 0x96D7, 0x6814,
0x96D8, 0x96DC, 0x6818,
0x96DD, 0x96DF, 0x681E,
0x96E0, 0x96E6, 0x6822,
0x96E7, 0x96ED, 0x682B,
0x96EE, 0x96F0, 0x6834,
0x96F1, 0x96F2, 0x683A,
0x96F9, 0x96FE, 0x6856,
0x9740, 0x9743, 0x685C,
0x9745, 0x974C, 0x686C,
0x974E, 0x9756, 0x6878,
0x9759, 0x9760, 0x6887,
0x9761, 0x9763, 0x6890,
0x9764, 0x9766, 0x6894,
0x9767, 0x9770, 0x6898,
0x9771, 0x9773, 0x68A3,
0x9774, 0x9777, 0x68A9,
0x9779, 0x977A, 0x68B1,
0x977C, 0x977E, 0x68B6,
0x9780, 0x9786, 0x68B9,
0x9788, 0x978D, 0x68C3,
0x9790, 0x9793, 0x68CE,
0x9794, 0x9795, 0x68D3,
0x9796, 0x9797, 0x68D6,
0x9799, 0x979D, 0x68DB,
0x979E, 0x979F, 0x68E1,
0x97A0, 0x97A9, 0x68E4,
0x97AB, 0x97AD, 0x68F2,
0x97AE, 0x97B0, 0x68F6,
0x97B2, 0x97B5, 0x68FD,
0x97B6, 0x97B8, 0x6902,
0x97B9, 0x97BD, 0x6906,
0x97C1, 0x97CC, 0x6913,
0x97CD, 0x97CF, 0x6921,
0x97D0, 0x97D7, 0x6925,
0x97D8, 0x97D9, 0x692E,
0x97DA, 0x97DC, 0x6931,
0x97DD, 0x97E0, 0x6935,
0x97E1, 0x97E3, 0x693A,
0x97E5, 0x97E6, 0x6940,
0x97E7, 0x97F7, 0x6943,
0x97F8, 0x97F9, 0x6955,
0x97FA, 0x97FB, 0x6958,
0x97FC, 0x97FD, 0x695B,
0x9840, 0x9841, 0x6961,
0x9842, 0x9843, 0x6964,
0x9844, 0x9847, 0x6967,
0x9848, 0x9849, 0x696C,
0x984A, 0x984B, 0x696F,
0x984C, 0x9850, 0x6972,
0x9851, 0x9852, 0x697A,
0x9853, 0x9855, 0x697D,
0x9859, 0x985B, 0x698A,
0x985C, 0x9861, 0x698E,
0x9862, 0x9863, 0x6996,
0x9864, 0x9865, 0x6999,
0x9866, 0x986F, 0x699D,
0x9870, 0x9871, 0x69A9,
0x9873, 0x9875, 0x69AE,
0x9876, 0x9877, 0x69B2,
0x9878, 0x9879, 0x69B5,
0x987A, 0x987C, 0x69B8,
0x987D, 0x987E, 0x69BC,
0x9880, 0x9882, 0x69BE,
0x9883, 0x988A, 0x69C2,
0x988E, 0x9890, 0x69D1,
0x9891, 0x9896, 0x69D5,
0x9897, 0x9899, 0x69DC,
0x989A, 0x98A5, 0x69E1,
0x98A6, 0x98A9, 0x69EE,
0x98AA, 0x98B3, 0x69F3,
0x98B5, 0x98BE, 0x6A00,
0x98BF, 0x98CA, 0x6A0B,
0x98CB, 0x98D0, 0x6A19,
0x98D2, 0x98D7, 0x6A22,
0x98D9, 0x98DC, 0x6A2B,
0x98DE, 0x98E0, 0x6A32,
0x98E1, 0x98E7, 0x6A36,
0x98E8, 0x98EC, 0x6A3F,
0x98ED, 0x98EE, 0x6A45,
0x98EF, 0x98F6, 0x6A48,
0x98F7, 0x98FD, 0x6A51,
0x9940, 0x9944, 0x6A5C,
0x9945, 0x9947, 0x6A62,
0x9948, 0x9952, 0x6A66,
0x9953, 0x9959, 0x6A72,
0x995A, 0x995B, 0x6A7A,
0x995C, 0x995E, 0x6A7D,
0x995F, 0x9961, 0x6A81,
0x9962, 0x996A, 0x6A85,
0x996C, 0x9970, 0x6A92,
0x9971, 0x9978, 0x6A98,
0x9979, 0x997E, 0x6AA1,
0x9980, 0x9981, 0x6AA7,
0x9983, 0x99F5, 0x6AAD,
0x99F6, 0x99F7, 0x6B25,
0x99F8, 0x99FE, 0x6B28,
0x9A40, 0x9A42, 0x6B2F,
0x9A43, 0x9A46, 0x6B33,
0x9A48, 0x9A4A, 0x6B3B,
0x9A4B, 0x9A4E, 0x6B3F,
0x9A4F, 0x9A50, 0x6B44,
0x9A52, 0x9A53, 0x6B4A,
0x9A54, 0x9A5F, 0x6B4D,
0x9A60, 0x9A67, 0x6B5A,
0x9A68, 0x9A69, 0x6B68,
0x9A6A, 0x9A77, 0x6B6B,
0x9A79, 0x9A7C, 0x6B7D,
0x9A81, 0x9A84, 0x6B8E,
0x9A85, 0x9A86, 0x6B94,
0x9A87, 0x9A89, 0x6B97,
0x9A8A, 0x9A8E, 0x6B9C,
0x9A8F, 0x9A96, 0x6BA2,
0x9A97, 0x9A9E, 0x6BAB,
0x9AA0, 0x9AA6, 0x6BB8,
0x9AA8, 0x9AA9, 0x6BC3,
0x9AAA, 0x9AAE, 0x6BC6,
0x9AB1, 0x9AB2, 0x6BD0,
0x9AB5, 0x9AB9, 0x6BDC,
0x9ABA, 0x9AC1, 0x6BE2,
0x9AC2, 0x9AC4, 0x6BEC,
0x9AC5, 0x9AC7, 0x6BF0,
0x9AC9, 0x9ACB, 0x6BF6,
0x9ACC, 0x9ACE, 0x6BFA,
0x9ACF, 0x9AD5, 0x6BFE,
0x9AD6, 0x9ADA, 0x6C08,
0x9ADE, 0x9AE0, 0x6C1C,
0x9AE4, 0x9AE6, 0x6C2B,
0x9AE9, 0x9AEA, 0x6C36,
0x9AEB, 0x9AEE, 0x6C39,
0x9AEF, 0x9AF0, 0x6C3E,
0x9AF1, 0x9AF3, 0x6C43,
0x9AF5, 0x9AF9, 0x6C4B,
0x9AFA, 0x9AFC, 0x6C51,
0x9B40, 0x9B41, 0x6C59,
0x9B42, 0x9B43, 0x6C62,
0x9B44, 0x9B46, 0x6C65,
0x9B47, 0x9B4B, 0x6C6B,
0x9B4F, 0x9B50, 0x6C77,
0x9B51, 0x9B53, 0x6C7A,
0x9B54, 0x9B55, 0x6C7F,
0x9B58, 0x9B59, 0x6C8A,
0x9B5A, 0x9B5B, 0x6C8D,
0x9B5C, 0x9B5D, 0x6C91,
0x9B5E, 0x9B61, 0x6C95,
0x9B63, 0x9B65, 0x6C9C,
0x9B6A, 0x9B6B, 0x6CAF,
0x9B6C, 0x9B6F, 0x6CB4,
0x9B71, 0x9B74, 0x6CC0,
0x9B75, 0x9B77, 0x6CC6,
0x9B79, 0x9B7B, 0x6CCD,
0x9B7C, 0x9B7D, 0x6CD1,
0x9B80, 0x9B81, 0x6CD9,
0x9B82, 0x9B83, 0x6CDC,
0x9B86, 0x9B87, 0x6CE6,
0x9B89, 0x9B8A, 0x6CEC,
0x9B8E, 0x9B8F, 0x6CFF,
0x9B90, 0x9B91, 0x6D02,
0x9B92, 0x9B93, 0x6D05,
0x9B94, 0x9B96, 0x6D08,
0x9B98, 0x9B9A, 0x6D0F,
0x9B9B, 0x9B9E, 0x6D13,
0x9BA0, 0x9BA1, 0x6D1C,
0x9BA2, 0x9BA7, 0x6D1F,
0x9BA9, 0x9BAA, 0x6D28,
0x9BAB, 0x9BAC, 0x6D2C,
0x9BAD, 0x9BAE, 0x6D2F,
0x9BB0, 0x9BB2, 0x6D36,
0x9BB4, 0x9BB5, 0x6D3F,
0x9BBB, 0x9BBE, 0x6D55,
0x9BC2, 0x9BC3, 0x6D61,
0x9BC4, 0x9BC5, 0x6D64,
0x9BC6, 0x9BC7, 0x6D67,
0x9BC8, 0x9BCA, 0x6D6B,
0x9BCB, 0x9BCE, 0x6D70,
0x9BCF, 0x9BD0, 0x6D75,
0x9BD1, 0x9BD3, 0x6D79,
0x9BD4, 0x9BD8, 0x6D7D,
0x9BD9, 0x9BDA, 0x6D83,
0x9BDB, 0x9BDC, 0x6D86,
0x9BDD, 0x9BDE, 0x6D8A,
0x9BE0, 0x9BE1, 0x6D8F,
0x9BE3, 0x9BE7, 0x6D96,
0x9BEB, 0x9BEC, 0x6DAC,
0x9BED, 0x9BEE, 0x6DB0,
0x9BEF, 0x9BF0, 0x6DB3,
0x9BF1, 0x9BF2, 0x6DB6,
0x9BF3, 0x9BF8, 0x6DB9,
0x9BF9, 0x9BFB, 0x6DC1,
0x9BFC, 0x9BFE, 0x6DC8,
0x9C40, 0x9C43, 0x6DCD,
0x9C44, 0x9C47, 0x6DD2,
0x9C49, 0x9C4B, 0x6DDA,
0x9C4D, 0x9C4E, 0x6DE2,
0x9C50, 0x9C53, 0x6DE7,
0x9C55, 0x9C56, 0x6DEF,
0x9C58, 0x9C5A, 0x6DF4,
0x9C5D, 0x9C64, 0x6DFD,
0x9C65, 0x9C68, 0x6E06,
0x9C6B, 0x9C6C, 0x6E12,
0x9C6E, 0x9C6F, 0x6E18,
0x9C70, 0x9C71, 0x6E1B,
0x9C72, 0x9C73, 0x6E1E,
0x9C75, 0x9C77, 0x6E26,
0x9C7B, 0x9C7C, 0x6E30,
0x9C80, 0x9C81, 0x6E36,
0x9C83, 0x9C8A, 0x6E3B,
0x9C8B, 0x9C92, 0x6E45,
0x9C93, 0x9C96, 0x6E4F,
0x9C99, 0x9C9A, 0x6E59,
0x9C9B, 0x9C9D, 0x6E5C,
0x9C9E, 0x9CA8, 0x6E60,
0x9CA9, 0x9CAA, 0x6E6C,
0x9CAB, 0x9CB9, 0x6E6F,
0x9CBA, 0x9CBC, 0x6E80,
0x9CBE, 0x9CBF, 0x6E87,
0x9CC0, 0x9CC4, 0x6E8A,
0x9CC5, 0x9CCB, 0x6E91,
0x9CCC, 0x9CCE, 0x6E99,
0x9CCF, 0x9CD0, 0x6E9D,
0x9CD1, 0x9CD2, 0x6EA0,
0x9CD3, 0x9CD4, 0x6EA3,
0x9CD6, 0x9CD7, 0x6EA8,
0x9CD8, 0x9CDB, 0x6EAB,
0x9CDF, 0x9CE0, 0x6EB8,
0x9CE2, 0x9CE4, 0x6EBE,
0x9CE5, 0x9CE8, 0x6EC3,
0x9CE9, 0x9CEB, 0x6EC8,
0x9CEC, 0x9CEE, 0x6ECC,
0x9CF2, 0x9CF3, 0x6ED8,
0x9CF4, 0x9CF6, 0x6EDB,
0x9CF9, 0x9CFE, 0x6EEA,
0x9D40, 0x9D43, 0x6EF0,
0x9D44, 0x9D47, 0x6EF5,
0x9D48, 0x9D4F, 0x6EFA,
0x9D50, 0x9D52, 0x6F03,
0x9D53, 0x9D54, 0x6F07,
0x9D55, 0x9D59, 0x6F0A,
0x9D5A, 0x9D5C, 0x6F10,
0x9D5D, 0x9D66, 0x6F16,
0x9D67, 0x9D69, 0x6F21,
0x9D6A, 0x9D6D, 0x6F25,
0x9D72, 0x9D73, 0x6F34,
0x9D74, 0x9D7A, 0x6F37,
0x9D7B, 0x9D7E, 0x6F3F,
0x9D80, 0x9D82, 0x6F43,
0x9D83, 0x9D85, 0x6F48,
0x9D87, 0x9D90, 0x6F4E,
0x9D91, 0x9D93, 0x6F59,
0x9D95, 0x9D97, 0x6F5F,
0x9D98, 0x9D9A, 0x6F63,
0x9D9B, 0x9DA0, 0x6F67,
0x9DA1, 0x9DA3, 0x6F6F,
0x9DA5, 0x9DA7, 0x6F75,
0x9DAA, 0x9DB0, 0x6F7D,
0x9DB1, 0x9DB3, 0x6F85,
0x9DB4, 0x9DB5, 0x6F8A,
0x9DB6, 0x9DC2, 0x6F8F,
0x9DC3, 0x9DC6, 0x6F9D,
0x9DC7, 0x9DCB, 0x6FA2,
0x9DCC, 0x9DD6, 0x6FA8,
0x9DD7, 0x9DD8, 0x6FB4,
0x9DD9, 0x9DDA, 0x6FB7,
0x9DDB, 0x9DE0, 0x6FBA,
0x9DE2, 0x9DE7, 0x6FC3,
0x9DE8, 0x9DEE, 0x6FCA,
0x9DEF, 0x9DF9, 0x6FD3,
0x9DFB, 0x9DFE, 0x6FE2,
0x9E40, 0x9E47, 0x6FE6,
0x9E48, 0x9E68, 0x6FF0,
0x9E69, 0x9E70, 0x7012,
0x9E71, 0x9E77, 0x701C,
0x9E78, 0x9E7E, 0x7024,
0x9E80, 0x9E89, 0x702B,
0x9E8A, 0x9E8C, 0x7036,
0x9E8D, 0x9E9E, 0x703A,
0x9E9F, 0x9EA0, 0x704D,
0x9EA1, 0x9EAE, 0x7050,
0x9EAF, 0x9EBA, 0x705F,
0x9EBC, 0x9EBF, 0x7071,
0x9EC1, 0x9EC3, 0x7079,
0x9EC5, 0x9EC8, 0x7081,
0x9EC9, 0x9ECB, 0x7086,
0x9ECC, 0x9ECE, 0x708B,
0x9ECF, 0x9ED1, 0x708F,
0x9ED3, 0x9ED4, 0x7097,
0x9ED5, 0x9ED6, 0x709A,
0x9ED7, 0x9EE3, 0x709E,
0x9EE6, 0x9EE8, 0x70B4,
0x9EEA, 0x9EEB, 0x70BE,
0x9EEC, 0x9EEF, 0x70C4,
0x9EF1, 0x9EFD, 0x70CB,
0x9F40, 0x9F42, 0x70DC,
0x9F43, 0x9F46, 0x70E0,
0x9F4A, 0x9F50, 0x70F0,
0x9F52, 0x9F54, 0x70FA,
0x9F55, 0x9F5F, 0x70FE,
0x9F60, 0x9F64, 0x710B,
0x9F65, 0x9F66, 0x7111,
0x9F69, 0x9F73, 0x711B,
0x9F74, 0x9F7B, 0x7127,
0x9F7C, 0x9F7E, 0x7132,
0x9F81, 0x9F8E, 0x7137,
0x9F8F, 0x9F92, 0x7146,
0x9F95, 0x9FA1, 0x714F,
0x9FA3, 0x9FA7, 0x715F,
0x9FA9, 0x9FAD, 0x7169,
0x9FAE, 0x9FB0, 0x716F,
0x9FB1, 0x9FB4, 0x7174,
0x9FB6, 0x9FB7, 0x717B,
0x9FB8, 0x9FBD, 0x717E,
0x9FBE, 0x9FC2, 0x7185,
0x9FC3, 0x9FC6, 0x718B,
0x9FC7, 0x9FCA, 0x7190,
0x9FCB, 0x9FCD, 0x7195,
0x9FCE, 0x9FD2, 0x719A,
0x9FD3, 0x9FD9, 0x71A1,
0x9FDA, 0x9FDC, 0x71A9,
0x9FDD, 0x9FE2, 0x71AD,
0x9FE4, 0x9FE6, 0x71B6,
0x9FE7, 0x9FEF, 0x71BA,
0x9FF0, 0x9FF9, 0x71C4,
0x9FFA, 0x9FFE, 0x71CF,
0xA040, 0xA049, 0x71D6,
0xA04A, 0xA04D, 0x71E1,
0xA04F, 0xA054, 0x71E8,
0xA055, 0xA05E, 0x71EF,
0xA05F, 0xA06A, 0x71FA,
0xA06B, 0xA07E, 0x7207,
0xA080, 0xA081, 0x721B,
0xA082, 0xA08B, 0x721E,
0xA08E, 0xA090, 0x722D,
0xA091, 0xA093, 0x7232,
0xA097, 0xA09D, 0x7240,
0xA09E, 0xA0A0, 0x7249,
0xA0A1, 0xA0A4, 0x724E,
0xA0A5, 0xA0A7, 0x7253,
0xA0A8, 0xA0A9, 0x7257,
0xA0AE, 0xA0B0, 0x7263,
0xA0B2, 0xA0B5, 0x726A,
0xA0B6, 0xA0B7, 0x7270,
0xA0B8, 0xA0B9, 0x7273,
0xA0BA, 0xA0BC, 0x7276,
0xA0BD, 0xA0BF, 0x727B,
0xA0C0, 0xA0C1, 0x7282,
0xA0C2, 0xA0C6, 0x7285,
0xA0C9, 0xA0CA, 0x7290,
0xA0CB, 0xA0D6, 0x7293,
0xA0D7, 0xA0E2, 0x72A0,
0xA0E4, 0xA0E6, 0x72B1,
0xA0E8, 0xA0EE, 0x72BA,
0xA0EF, 0xA0F1, 0x72C5,
0xA0F2, 0xA0F5, 0x72C9,
0xA0F8, 0xA0FB, 0x72D3,
0xA0FD, 0xA0FE, 0x72DA,
0xA1A1, 0xA1A3, 0x3000,
0xA1AE, 0xA1AF, 0x2018,
0xA1B0, 0xA1B1, 0x201C,
0xA1B2, 0xA1B3, 0x3014,
0xA1B4, 0xA1BB, 0x3008,
0xA1BC, 0xA1BD, 0x3016,
0xA1BE, 0xA1BF, 0x3010,
0xA1C4, 0xA1C5, 0x2227,
0xA1DA, 0xA1DB, 0x226E,
0xA1DC, 0xA1DD, 0x2264,
0xA1E4, 0xA1E5, 0x2032,
0xA1E9, 0xA1EA, 0xFFE0,
0xA1FB, 0xA1FC, 0x2190,
0xA2A1, 0xA2AA, 0x2170,
0xA2B1, 0xA2C4, 0x2488,
0xA2C5, 0xA2D8, 0x2474,
0xA2D9, 0xA2E2, 0x2460,
0xA2E5, 0xA2EE, 0x3220,
0xA2F1, 0xA2FC, 0x2160,
0xA3A1, 0xA3A3, 0xFF01,
0xA3A5, 0xA3FD, 0xFF05,
0xA4A1, 0xA4F3, 0x3041,
0xA5A1, 0xA5F6, 0x30A1,
0xA6A1, 0xA6B1, 0x0391,
0xA6B2, 0xA6B8, 0x03A3,
0xA6C1, 0xA6D1, 0x03B1,
0xA6D2, 0xA6D8, 0x03C3,
0xA6E0, 0xA6E1, 0xFE35,
0xA6E2, 0xA6E3, 0xFE39,
0xA6E4, 0xA6E5, 0xFE3F,
0xA6E6, 0xA6E7, 0xFE3D,
0xA6E8, 0xA6EB, 0xFE41,
0xA6EE, 0xA6EF, 0xFE3B,
0xA6F0, 0xA6F1, 0xFE37,
0xA6F4, 0xA6F5, 0xFE33,
0xA7A1, 0xA7A6, 0x0410,
0xA7A8, 0xA7C1, 0x0416,
0xA7D1, 0xA7D6, 0x0430,
0xA7D8, 0xA7F1, 0x0436,
0xA840, 0xA841, 0x02CA,
0xA849, 0xA84C, 0x2196,
0xA851, 0xA852, 0x2266,
0xA854, 0xA877, 0x2550,
0xA878, 0xA87E, 0x2581,
0xA880, 0xA887, 0x2588,
0xA888, 0xA88A, 0x2593,
0xA88B, 0xA88C, 0x25BC,
0xA88D, 0xA890, 0x25E2,
0xA894, 0xA895, 0x301D,
0xA8C5, 0xA8E9, 0x3105,
0xA940, 0xA948, 0x3021,
0xA94A, 0xA94B, 0x338E,
0xA94C, 0xA94E, 0x339C,
0xA952, 0xA953, 0x33D1,
0xA961, 0xA962, 0x309B,
0xA963, 0xA964, 0x30FD,
0xA966, 0xA967, 0x309D,
0xA968, 0xA971, 0xFE49,
0xA972, 0xA975, 0xFE54,
0xA976, 0xA97E, 0xFE59,
0xA980, 0xA984, 0xFE62,
0xA985, 0xA988, 0xFE68,
0xA9A4, 0xA9EF, 0x2500,
0xAA40, 0xAA41, 0x72DC,
0xAA43, 0xAA48, 0x72E2,
0xAA49, 0xAA4A, 0x72EA,
0xAA4B, 0xAA4C, 0x72F5,
0xAA4E, 0xAA51, 0x72FD,
0xAA53, 0xAA58, 0x7304,
0xAA59, 0xAA5B, 0x730B,
0xAA5C, 0xAA5F, 0x730F,
0xAA61, 0xAA63, 0x7318,
0xAA64, 0xAA65, 0x731F,
0xAA66, 0xAA67, 0x7323,
0xAA68, 0xAA6A, 0x7326,
0xAA6C, 0xAA6D, 0x732F,
0xAA6E, 0xAA6F, 0x7332,
0xAA70, 0xAA71, 0x7335,
0xAA72, 0xAA75, 0x733A,
0xAA76, 0xAA7E, 0x7340,
0xAA80, 0xAA83, 0x7349,
0xAA84, 0xAA85, 0x734E,
0xAA87, 0xAA8A, 0x7353,
0xAA8B, 0xAA92, 0x7358,
0xAA93, 0xAA9D, 0x7361,
0xAA9F, 0xAAA0, 0x7370,
0xAB40, 0xAB4B, 0x7372,
0xAB4C, 0xAB50, 0x737F,
0xAB51, 0xAB52, 0x7385,
0xAB55, 0xAB56, 0x738C,
0xAB57, 0xAB58, 0x738F,
0xAB59, 0xAB5C, 0x7392,
0xAB5D, 0xAB60, 0x7397,
0xAB61, 0xAB63, 0x739C,
0xAB64, 0xAB65, 0x73A0,
0xAB66, 0xAB6B, 0x73A3,
0xAB6D, 0xAB6E, 0x73AC,
0xAB70, 0xAB72, 0x73B4,
0xAB73, 0xAB74, 0x73B8,
0xAB75, 0xAB78, 0x73BC,
0xAB7A, 0xAB7E, 0x73C3,
0xAB80, 0xAB81, 0x73CB,
0xAB83, 0xAB89, 0x73D2,
0xAB8A, 0xAB8D, 0x73DA,
0xAB8F, 0xAB92, 0x73E1,
0xAB95, 0xAB97, 0x73EA,
0xAB98, 0xAB9B, 0x73EE,
0xAB9C, 0xABA0, 0x73F3,
0xAC40, 0xAC4A, 0x73F8,
0xAC4C, 0xAC4D, 0x7407,
0xAC4E, 0xAC51, 0x740B,
0xAC52, 0xAC5A, 0x7411,
0xAC5B, 0xAC60, 0x741C,
0xAC61, 0xAC62, 0x7423,
0xAC68, 0xAC69, 0x7431,
0xAC6A, 0xAC6E, 0x7437,
0xAC6F, 0xAC72, 0x743D,
0xAC73, 0xAC7E, 0x7442,
0xAC80, 0xAC86, 0x744E,
0xAC8A, 0xAC96, 0x7460,
0xAC97, 0xAC98, 0x746E,
0xAC99, 0xAC9D, 0x7471,
0xAC9E, 0xACA0, 0x7478,
0xAD40, 0xAD42, 0x747B,
0xAD45, 0xAD47, 0x7484,
0xAD48, 0xAD4A, 0x7488,
0xAD4B, 0xAD4C, 0x748C,
0xAD4E, 0xAD58, 0x7491,
0xAD5A, 0xAD61, 0x749F,
0xAD62, 0xAD71, 0x74AA,
0xAD72, 0xAD7E, 0x74BB,
0xAD80, 0xAD89, 0x74C8,
0xAD8A, 0xAD92, 0x74D3,
0xAD97, 0xAD9D, 0x74E7,
0xAD9E, 0xADA0, 0x74F0,
0xAE42, 0xAE48, 0x74F8,
0xAE49, 0xAE4C, 0x7500,
0xAE4D, 0xAE54, 0x7505,
0xAE58, 0xAE5B, 0x7514,
0xAE5D, 0xAE5E, 0x751D,
0xAE5F, 0xAE63, 0x7520,
0xAE64, 0xAE65, 0x7526,
0xAE6B, 0xAE6C, 0x753C,
0xAE6E, 0xAE71, 0x7541,
0xAE72, 0xAE73, 0x7546,
0xAE74, 0xAE75, 0x7549,
0xAE77, 0xAE7A, 0x7550,
0xAE7B, 0xAE7E, 0x7555,
0xAE80, 0xAE87, 0x755D,
0xAE88, 0xAE8A, 0x7567,
0xAE8B, 0xAE91, 0x756B,
0xAE93, 0xAE95, 0x7575,
0xAE96, 0xAE9A, 0x757A,
0xAE9B, 0xAE9D, 0x7580,
0xAE9E, 0xAE9F, 0x7584,
0xAF40, 0xAF42, 0x7588,
0xAF43, 0xAF45, 0x758C,
0xAF4A, 0xAF4B, 0x759B,
0xAF4E, 0xAF52, 0x75A6,
0xAF54, 0xAF55, 0x75B6,
0xAF56, 0xAF57, 0x75BA,
0xAF58, 0xAF5A, 0x75BF,
0xAF5C, 0xAF5D, 0x75CB,
0xAF5E, 0xAF61, 0x75CE,
0xAF64, 0xAF65, 0x75D9,
0xAF66, 0xAF67, 0x75DC,
0xAF68, 0xAF6A, 0x75DF,
0xAF6D, 0xAF70, 0x75EC,
0xAF71, 0xAF72, 0x75F2,
0xAF73, 0xAF76, 0x75F5,
0xAF77, 0xAF78, 0x75FA,
0xAF79, 0xAF7A, 0x75FD,
0xAF7D, 0xAF7E, 0x7606,
0xAF80, 0xAF81, 0x7608,
0xAF83, 0xAF85, 0x760D,
0xAF86, 0xAF89, 0x7611,
0xAF8C, 0xAF8E, 0x761C,
0xAF91, 0xAF92, 0x7627,
0xAF94, 0xAF95, 0x762E,
0xAF96, 0xAF97, 0x7631,
0xAF98, 0xAF99, 0x7636,
0xAF9A, 0xAF9C, 0x7639,
0xAF9E, 0xAF9F, 0x7641,
0xB040, 0xB046, 0x7645,
0xB047, 0xB04C, 0x764E,
0xB04E, 0xB052, 0x7657,
0xB054, 0xB057, 0x765F,
0xB058, 0xB05E, 0x7664,
0xB05F, 0xB061, 0x766C,
0xB062, 0xB069, 0x7670,
0xB06A, 0xB06B, 0x7679,
0xB06D, 0xB06F, 0x767F,
0xB072, 0xB073, 0x7689,
0xB074, 0xB075, 0x768C,
0xB076, 0xB077, 0x768F,
0xB079, 0xB07A, 0x7694,
0xB07B, 0xB07C, 0x7697,
0xB07D, 0xB07E, 0x769A,
0xB080, 0xB087, 0x769C,
0xB088, 0xB090, 0x76A5,
0xB091, 0xB092, 0x76AF,
0xB094, 0xB09D, 0x76B5,
0xB09E, 0xB09F, 0x76C0,
0xB143, 0xB144, 0x76CB,
0xB147, 0xB148, 0x76D9,
0xB149, 0xB14B, 0x76DC,
0xB14C, 0xB150, 0x76E0,
0xB151, 0xB158, 0x76E6,
0xB15B, 0xB15D, 0x76F5,
0xB15E, 0xB15F, 0x76FA,
0xB161, 0xB162, 0x76FF,
0xB163, 0xB164, 0x7702,
0xB165, 0xB166, 0x7705,
0xB169, 0xB173, 0x770E,
0xB174, 0xB177, 0x771B,
0xB179, 0xB17B, 0x7723,
0xB17D, 0xB17E, 0x772A,
0xB182, 0xB186, 0x7730,
0xB189, 0xB18B, 0x773D,
0xB18D, 0xB18F, 0x7744,
0xB190, 0xB197, 0x7748,
0xB198, 0xB19F, 0x7752,
0xB1E6, 0xB1E7, 0x8FA8,
0xB240, 0xB243, 0x775D,
0xB246, 0xB247, 0x7769,
0xB248, 0xB253, 0x776D,
0xB254, 0xB256, 0x777A,
0xB257, 0xB259, 0x7781,
0xB25A, 0xB25F, 0x7786,
0xB260, 0xB261, 0x778F,
0xB262, 0xB26D, 0x7793,
0xB26F, 0xB270, 0x77A3,
0xB274, 0xB276, 0x77AD,
0xB277, 0xB278, 0x77B1,
0xB27A, 0xB27E, 0x77B6,
0xB282, 0xB28E, 0x77C0,
0xB28F, 0xB297, 0x77CE,
0xB298, 0xB29A, 0x77D8,
0xB29B, 0xB29F, 0x77DD,
0xB343, 0xB346, 0x77EF,
0xB347, 0xB348, 0x77F4,
0xB34A, 0xB34D, 0x77F9,
0xB34E, 0xB353, 0x7803,
0xB354, 0xB355, 0x780A,
0xB356, 0xB358, 0x780E,
0xB35E, 0xB360, 0x7820,
0xB363, 0xB364, 0x782A,
0xB365, 0xB366, 0x782E,
0xB367, 0xB369, 0x7831,
0xB36A, 0xB36B, 0x7835,
0xB36E, 0xB371, 0x7841,
0xB373, 0xB376, 0x7848,
0xB37A, 0xB37B, 0x7853,
0xB37C, 0xB37E, 0x7858,
0xB380, 0xB381, 0x785B,
0xB382, 0xB38D, 0x785E,
0xB38E, 0xB395, 0x786F,
0xB396, 0xB399, 0x7878,
0xB39A, 0xB3A0, 0x787D,
0xB440, 0xB442, 0x7884,
0xB444, 0xB445, 0x788A,
0xB446, 0xB447, 0x788F,
0xB449, 0xB44B, 0x7894,
0xB44D, 0xB44E, 0x789D,
0xB453, 0xB45A, 0x78A8,
0xB45B, 0xB45E, 0x78B5,
0xB45F, 0xB462, 0x78BA,
0xB463, 0xB464, 0x78BF,
0xB465, 0xB467, 0x78C2,
0xB468, 0xB46A, 0x78C6,
0xB46B, 0xB46E, 0x78CC,
0xB46F, 0xB471, 0x78D1,
0xB472, 0xB474, 0x78D6,
0xB475, 0xB47E, 0x78DA,
0xB480, 0xB483, 0x78E4,
0xB484, 0xB486, 0x78E9,
0xB487, 0xB48B, 0x78ED,
0xB48D, 0xB48E, 0x78F5,
0xB48F, 0xB490, 0x78F8,
0xB491, 0xB496, 0x78FB,
0xB497, 0xB499, 0x7902,
0xB49A, 0xB4A0, 0x7906,
0xB540, 0xB545, 0x790D,
0xB546, 0xB54F, 0x7914,
0xB550, 0xB554, 0x791F,
0xB555, 0xB563, 0x7925,
0xB564, 0xB568, 0x7935,
0xB56B, 0xB56E, 0x7942,
0xB570, 0xB578, 0x794A,
0xB579, 0xB57A, 0x7954,
0xB57B, 0xB57C, 0x7958,
0xB582, 0xB585, 0x7969,
0xB587, 0xB58D, 0x7970,
0xB58F, 0xB593, 0x797B,
0xB594, 0xB595, 0x7982,
0xB596, 0xB599, 0x7986,
0xB59A, 0xB59D, 0x798B,
0xB59E, 0xB5A0, 0x7990,
0xB640, 0xB646, 0x7993,
0xB647, 0xB652, 0x799B,
0xB653, 0xB65D, 0x79A8,
0xB65E, 0xB662, 0x79B4,
0xB666, 0xB667, 0x79C4,
0xB668, 0xB669, 0x79C7,
0xB66C, 0xB66E, 0x79CE,
0xB66F, 0xB670, 0x79D3,
0xB671, 0xB672, 0x79D6,
0xB673, 0xB678, 0x79D9,
0xB679, 0xB67B, 0x79E0,
0xB682, 0xB688, 0x79F1,
0xB689, 0xB68A, 0x79F9,
0xB68C, 0xB68D, 0x79FE,
0xB68F, 0xB690, 0x7A04,
0xB691, 0xB694, 0x7A07,
0xB696, 0xB69A, 0x7A0F,
0xB69B, 0xB69C, 0x7A15,
0xB69D, 0xB69E, 0x7A18,
0xB69F, 0xB6A0, 0x7A1B,
0xB742, 0xB743, 0x7A21,
0xB744, 0xB752, 0x7A24,
0xB753, 0xB755, 0x7A34,
0xB759, 0xB75E, 0x7A40,
0xB75F, 0xB768, 0x7A47,
0xB769, 0xB76D, 0x7A52,
0xB76E, 0xB77E, 0x7A58,
0xB780, 0xB786, 0x7A69,
0xB787, 0xB789, 0x7A71,
0xB78B, 0xB78E, 0x7A7B,
0xB792, 0xB795, 0x7A89,
0xB796, 0xB798, 0x7A8E,
0xB799, 0xB79A, 0x7A93,
0xB79B, 0xB79D, 0x7A99,
0xB79F, 0xB7A0, 0x7AA1,
0xB840, 0xB841, 0x7AA3,
0xB843, 0xB845, 0x7AA9,
0xB846, 0xB84A, 0x7AAE,
0xB84B, 0xB855, 0x7AB4,
0xB856, 0xB860, 0x7AC0,
0xB861, 0xB86A, 0x7ACC,
0xB86B, 0xB86C, 0x7AD7,
0xB86D, 0xB870, 0x7ADA,
0xB871, 0xB872, 0x7AE1,
0xB874, 0xB879, 0x7AE7,
0xB87B, 0xB87E, 0x7AF0,
0xB880, 0xB884, 0x7AF4,
0xB885, 0xB886, 0x7AFB,
0xB888, 0xB88A, 0x7B00,
0xB88E, 0xB890, 0x7B0C,
0xB892, 0xB893, 0x7B12,
0xB894, 0xB896, 0x7B16,
0xB898, 0xB899, 0x7B1C,
0xB89B, 0xB89D, 0x7B21,
0xB940, 0xB941, 0x7B2F,
0xB943, 0xB946, 0x7B34,
0xB94A, 0xB94F, 0x7B3F,
0xB953, 0xB954, 0x7B4D,
0xB95A, 0xB95B, 0x7B5E,
0xB95D, 0xB967, 0x7B63,
0xB968, 0xB969, 0x7B6F,
0xB96A, 0xB96B, 0x7B73,
0xB96F, 0xB970, 0x7B7C,
0xB972, 0xB975, 0x7B81,
0xB976, 0xB97C, 0x7B86,
0xB97D, 0xB97E, 0x7B8E,
0xB980, 0xB982, 0x7B91,
0xB984, 0xB987, 0x7B98,
0xB988, 0xB98A, 0x7B9E,
0xB98B, 0xB98D, 0x7BA3,
0xB98E, 0xB990, 0x7BAE,
0xB991, 0xB992, 0x7BB2,
0xB993, 0xB995, 0x7BB5,
0xB996, 0xB99D, 0x7BB9,
0xB99E, 0xB9A0, 0x7BC2,
0xBA41, 0xBA44, 0x7BC8,
0xBA45, 0xBA48, 0x7BCD,
0xBA4A, 0xBA4E, 0x7BD4,
0xBA4F, 0xBA50, 0x7BDB,
0xBA51, 0xBA53, 0x7BDE,
0xBA54, 0xBA56, 0x7BE2,
0xBA57, 0xBA59, 0x7BE7,
0xBA5A, 0xBA5C, 0x7BEB,
0xBA5D, 0xBA5E, 0x7BEF,
0xBA5F, 0xBA63, 0x7BF2,
0xBA64, 0xBA67, 0x7BF8,
0xBA69, 0xBA70, 0x7BFF,
0xBA71, 0xBA73, 0x7C08,
0xBA74, 0xBA75, 0x7C0D,
0xBA76, 0xBA7B, 0x7C10,
0xBA7C, 0xBA7E, 0x7C17,
0xBA80, 0xBA84, 0x7C1A,
0xBA85, 0xBA8A, 0x7C20,
0xBA8B, 0xBA8C, 0x7C28,
0xBA8D, 0xBA99, 0x7C2B,
0xBA9A, 0xBA9F, 0x7C39,
0xBB40, 0xBB49, 0x7C43,
0xBB4A, 0xBB6E, 0x7C4E,
0xBB6F, 0xBB74, 0x7C75,
0xBB75, 0xBB7E, 0x7C7E,
0xBB81, 0xBB87, 0x7C8A,
0xBB88, 0xBB89, 0x7C93,
0xBB8B, 0xBB8D, 0x7C99,
0xBB8E, 0xBB8F, 0x7CA0,
0xBB91, 0xBB94, 0x7CA6,
0xBB95, 0xBB97, 0x7CAB,
0xBB98, 0xBB99, 0x7CAF,
0xBB9A, 0xBB9E, 0x7CB4,
0xBB9F, 0xBBA0, 0x7CBA,
0xBC40, 0xBC41, 0x7CBF,
0xBC42, 0xBC44, 0x7CC2,
0xBC48, 0xBC4E, 0x7CCE,
0xBC50, 0xBC51, 0x7CDA,
0xBC52, 0xBC53, 0x7CDD,
0xBC54, 0xBC5A, 0x7CE1,
0xBC5B, 0xBC60, 0x7CE9,
0xBC61, 0xBC68, 0x7CF0,
0xBC69, 0xBC6A, 0x7CF9,
0xBC6B, 0xBC78, 0x7CFC,
0xBC79, 0xBC7E, 0x7D0B,
0xBC80, 0xBC8E, 0x7D11,
0xBC90, 0xBC93, 0x7D23,
0xBC94, 0xBC96, 0x7D28,
0xBC97, 0xBC99, 0x7D2C,
0xBC9A, 0xBCA0, 0x7D30,
0xBD40, 0xBD76, 0x7D37,
0xBD77, 0xBD7E, 0x7D6F,
0xBD80, 0xBDA0, 0x7D78,
0xBE40, 0xBE4C, 0x7D99,
0xBE4D, 0xBE53, 0x7DA7,
0xBE54, 0xBE7E, 0x7DAF,
0xBE80, 0xBEA0, 0x7DDA,
0xBF40, 0xBF7E, 0x7DFB,
0xBF81, 0xBF85, 0x7E3C,
0xBF86, 0xBF8A, 0x7E42,
0xBF8B, 0xBFA0, 0x7E48,
0xC040, 0xC063, 0x7E5E,
0xC064, 0xC07B, 0x7E83,
0xC07C, 0xC07E, 0x7E9C,
0xC082, 0xC083, 0x7EBB,
0xC08D, 0xC093, 0x7F3B,
0xC095, 0xC09E, 0x7F46,
0xC09F, 0xC0A0, 0x7F52,
0xC142, 0xC145, 0x7F5B,
0xC147, 0xC14B, 0x7F63,
0xC14C, 0xC14E, 0x7F6B,
0xC14F, 0xC150, 0x7F6F,
0xC152, 0xC155, 0x7F75,
0xC156, 0xC159, 0x7F7A,
0xC15A, 0xC15B, 0x7F7F,
0xC15C, 0xC163, 0x7F82,
0xC166, 0xC16A, 0x7F8F,
0xC16B, 0xC16F, 0x7F95,
0xC170, 0xC171, 0x7F9B,
0xC173, 0xC174, 0x7FA2,
0xC175, 0xC176, 0x7FA5,
0xC177, 0xC17D, 0x7FA8,
0xC180, 0xC184, 0x7FB3,
0xC185, 0xC186, 0x7FBA,
0xC189, 0xC18B, 0x7FC2,
0xC18C, 0xC18F, 0x7FC6,
0xC192, 0xC196, 0x7FCF,
0xC197, 0xC198, 0x7FD6,
0xC199, 0xC19E, 0x7FD9,
0xC19F, 0xC1A0, 0x7FE2,
0xC241, 0xC242, 0x7FE7,
0xC243, 0xC246, 0x7FEA,
0xC249, 0xC24F, 0x7FF4,
0xC250, 0xC252, 0x7FFD,
0xC254, 0xC257, 0x8007,
0xC258, 0xC259, 0x800E,
0xC25C, 0xC25D, 0x801A,
0xC25E, 0xC260, 0x801D,
0xC262, 0xC263, 0x8023,
0xC264, 0xC269, 0x802B,
0xC26C, 0xC26D, 0x8039,
0xC270, 0xC271, 0x8040,
0xC272, 0xC273, 0x8044,
0xC274, 0xC276, 0x8047,
0xC277, 0xC27A, 0x804E,
0xC27C, 0xC27E, 0x8055,
0xC281, 0xC28E, 0x805B,
0xC28F, 0xC294, 0x806B,
0xC295, 0xC2A0, 0x8072,
0xC341, 0xC342, 0x8081,
0xC346, 0xC34B, 0x808D,
0xC34C, 0xC34D, 0x8094,
0xC352, 0xC354, 0x80A6,
0xC358, 0xC359, 0x80B5,
0xC35A, 0xC35B, 0x80B8,
0xC35E, 0xC362, 0x80C7,
0xC363, 0xC369, 0x80CF,
0xC36B, 0xC36C, 0x80DF,
0xC36D, 0xC36E, 0x80E2,
0xC375, 0xC378, 0x80FE,
0xC379, 0xC37B, 0x8103,
0xC37C, 0xC37D, 0x8107,
0xC384, 0xC386, 0x811B,
0xC387, 0xC393, 0x811F,
0xC394, 0xC395, 0x812D,
0xC397, 0xC399, 0x8133,
0xC39B, 0xC39F, 0x8139,
0xC440, 0xC445, 0x8140,
0xC448, 0xC44A, 0x814D,
0xC44C, 0xC44E, 0x8156,
0xC44F, 0xC453, 0x815B,
0xC454, 0xC457, 0x8161,
0xC45A, 0xC45C, 0x816A,
0xC45E, 0xC45F, 0x8172,
0xC460, 0xC463, 0x8175,
0xC465, 0xC469, 0x8183,
0xC46B, 0xC46E, 0x818B,
0xC470, 0xC475, 0x8192,
0xC476, 0xC477, 0x8199,
0xC478, 0xC47C, 0x819E,
0xC47D, 0xC47E, 0x81A4,
0xC482, 0xC489, 0x81AB,
0xC48A, 0xC48F, 0x81B4,
0xC490, 0xC493, 0x81BC,
0xC494, 0xC495, 0x81C4,
0xC496, 0xC498, 0x81C7,
0xC49A, 0xC4A0, 0x81CD,
0xC540, 0xC54E, 0x81D4,
0xC54F, 0xC551, 0x81E4,
0xC552, 0xC553, 0x81E8,
0xC555, 0xC559, 0x81EE,
0xC55A, 0xC55F, 0x81F5,
0xC563, 0xC567, 0x8207,
0xC568, 0xC569, 0x820E,
0xC56C, 0xC571, 0x8215,
0xC574, 0xC577, 0x8224,
0xC57C, 0xC57D, 0x823C,
0xC580, 0xC583, 0x8240,
0xC584, 0xC585, 0x8245,
0xC588, 0xC58A, 0x824C,
0xC58B, 0xC592, 0x8250,
0xC594, 0xC597, 0x825B,
0xC598, 0xC59F, 0x8260,
0xC640, 0xC643, 0x826A,
0xC645, 0xC648, 0x8275,
0xC649, 0xC64A, 0x827B,
0xC64B, 0xC64C, 0x8280,
0xC64E, 0xC650, 0x8285,
0xC654, 0xC657, 0x8293,
0xC658, 0xC659, 0x829A,
0xC65C, 0xC65D, 0x82A2,
0xC660, 0xC661, 0x82B5,
0xC662, 0xC664, 0x82BA,
0xC665, 0xC666, 0x82BF,
0xC667, 0xC668, 0x82C2,
0xC669, 0xC66A, 0x82C5,
0xC66E, 0xC66F, 0x82D9,
0xC672, 0xC675, 0x82E7,
0xC676, 0xC678, 0x82EC,
0xC67A, 0xC67B, 0x82F2,
0xC67C, 0xC67D, 0x82F5,
0xC681, 0xC685, 0x82FC,
0xC686, 0xC687, 0x830A,
0xC68A, 0xC68B, 0x8312,
0xC68D, 0xC68E, 0x8318,
0xC68F, 0xC698, 0x831D,
0xC699, 0xC69A, 0x8329,
0xC740, 0xC741, 0x833E,
0xC742, 0xC743, 0x8341,
0xC744, 0xC745, 0x8344,
0xC747, 0xC74B, 0x834A,
0xC74D, 0xC751, 0x8355,
0xC754, 0xC75A, 0x8370,
0xC75B, 0xC75C, 0x8379,
0xC75D, 0xC763, 0x837E,
0xC764, 0xC765, 0x8387,
0xC766, 0xC769, 0x838A,
0xC76A, 0xC76C, 0x838F,
0xC76D, 0xC770, 0x8394,
0xC771, 0xC772, 0x8399,
0xC775, 0xC77B, 0x83A1,
0xC77C, 0xC77E, 0x83AC,
0xC783, 0xC784, 0x83BE,
0xC785, 0xC787, 0x83C2,
0xC789, 0xC78A, 0x83C8,
0xC78C, 0xC78D, 0x83CD,
0xC78E, 0xC791, 0x83D0,
0xC794, 0xC796, 0x83D9,
0xC798, 0xC79A, 0x83E2,
0xC79B, 0xC79D, 0x83E6,
0xC79E, 0xC7A0, 0x83EB,
0xC840, 0xC841, 0x83EE,
0xC842, 0xC846, 0x83F3,
0xC847, 0xC849, 0x83FA,
0xC84A, 0xC84C, 0x83FE,
0xC84F, 0xC852, 0x8407,
0xC854, 0xC859, 0x8412,
0xC85A, 0xC85C, 0x8419,
0xC85D, 0xC862, 0x841E,
0xC863, 0xC86A, 0x8429,
0xC86B, 0xC870, 0x8432,
0xC871, 0xC873, 0x8439,
0xC874, 0xC87B, 0x843E,
0xC87C, 0xC87E, 0x8447,
0xC880, 0xC886, 0x844A,
0xC887, 0xC88B, 0x8452,
0xC88D, 0xC890, 0x845D,
0xC892, 0xC896, 0x8464,
0xC898, 0xC89A, 0x846E,
0xC89F, 0xC8A0, 0x847B,
0xC940, 0xC944, 0x847D,
0xC945, 0xC948, 0x8483,
0xC94B, 0xC952, 0x848F,
0xC954, 0xC955, 0x849A,
0xC956, 0xC959, 0x849D,
0xC95A, 0xC966, 0x84A2,
0xC967, 0xC968, 0x84B0,
0xC96A, 0xC96C, 0x84B5,
0xC96D, 0xC96E, 0x84BB,
0xC971, 0xC972, 0x84C2,
0xC973, 0xC976, 0x84C5,
0xC977, 0xC978, 0x84CB,
0xC979, 0xC97A, 0x84CE,
0xC97C, 0xC97D, 0x84D4,
0xC980, 0xC984, 0x84D8,
0xC986, 0xC987, 0x84E1,
0xC989, 0xC98D, 0x84E7,
0xC98E, 0xC990, 0x84ED,
0xC991, 0xC99B, 0x84F1,
0xC99C, 0xC99D, 0x84FD,
0xC99E, 0xC9A0, 0x8500,
0xC9E0, 0xC9E1, 0x820C,
0xCA40, 0xCA48, 0x8503,
0xCA49, 0xCA4C, 0x850D,
0xCA4E, 0xCA50, 0x8514,
0xCA51, 0xCA52, 0x8518,
0xCA53, 0xCA56, 0x851B,
0xCA58, 0xCA60, 0x8522,
0xCA61, 0xCA6A, 0x852D,
0xCA6B, 0xCA6F, 0x853E,
0xCA70, 0xCA73, 0x8544,
0xCA74, 0xCA7E, 0x854B,
0xCA80, 0xCA81, 0x8557,
0xCA82, 0xCA85, 0x855A,
0xCA86, 0xCA8A, 0x855F,
0xCA8B, 0xCA8D, 0x8565,
0xCA8E, 0xCA96, 0x8569,
0xCA98, 0xCA9B, 0x8575,
0xCA9C, 0xCA9D, 0x857C,
0xCA9E, 0xCAA0, 0x857F,
0xCB40, 0xCB41, 0x8582,
0xCB43, 0xCB49, 0x8588,
0xCB4A, 0xCB54, 0x8590,
0xCB55, 0xCB5B, 0x859D,
0xCB5C, 0xCB5E, 0x85A5,
0xCB60, 0xCB62, 0x85AB,
0xCB63, 0xCB68, 0x85B1,
0xCB6A, 0xCB70, 0x85BA,
0xCB71, 0xCB77, 0x85C2,
0xCB78, 0xCB7C, 0x85CA,
0xCB7D, 0xCB7E, 0x85D1,
0xCB81, 0xCB86, 0x85D6,
0xCB87, 0xCB8D, 0x85DD,
0xCB8E, 0xCB91, 0x85E5,
0xCB92, 0xCBA0, 0x85EA,
0xCC40, 0xCC41, 0x85F9,
0xCC42, 0xCC44, 0x85FC,
0xCC45, 0xCC49, 0x8600,
0xCC4A, 0xCC54, 0x8606,
0xCC55, 0xCC58, 0x8612,
0xCC59, 0xCC68, 0x8617,
0xCC6A, 0xCC77, 0x862A,
0xCC78, 0xCC7A, 0x8639,
0xCC7B, 0xCC7E, 0x863D,
0xCC80, 0xCC8B, 0x8641,
0xCC8C, 0xCC8D, 0x8652,
0xCC8E, 0xCC92, 0x8655,
0xCC93, 0xCC95, 0x865B,
0xCC96, 0xCC98, 0x865F,
0xCC99, 0xCCA0, 0x8663,
0xCD41, 0xCD42, 0x866F,
0xCD43, 0xCD49, 0x8672,
0xCD4A, 0xCD50, 0x8683,
0xCD51, 0xCD55, 0x868E,
0xCD57, 0xCD5C, 0x8696,
0xCD5D, 0xCD61, 0x869E,
0xCD62, 0xCD63, 0x86A5,
0xCD65, 0xCD66, 0x86AD,
0xCD67, 0xCD68, 0x86B2,
0xCD69, 0xCD6B, 0x86B7,
0xCD6C, 0xCD70, 0x86BB,
0xCD71, 0xCD73, 0x86C1,
0xCD76, 0xCD77, 0x86CC,
0xCD78, 0xCD79, 0x86D2,
0xCD7A, 0xCD7C, 0x86D5,
0xCD81, 0xCD84, 0x86E0,
0xCD85, 0xCD88, 0x86E5,
0xCD89, 0xCD8B, 0x86EA,
0xCD8D, 0xCD8F, 0x86F5,
0xCD90, 0xCD93, 0x86FA,
0xCD96, 0xCD98, 0x8704,
0xCD99, 0xCD9A, 0x870B,
0xCD9B, 0xCD9E, 0x870E,
0xCE43, 0xCE44, 0x871F,
0xCE46, 0xCE48, 0x8726,
0xCE49, 0xCE4C, 0x872A,
0xCE4D, 0xCE4E, 0x872F,
0xCE4F, 0xCE50, 0x8732,
0xCE51, 0xCE52, 0x8735,
0xCE53, 0xCE55, 0x8738,
0xCE56, 0xCE57, 0x873C,
0xCE58, 0xCE5E, 0x8740,
0xCE5F, 0xCE60, 0x874A,
0xCE62, 0xCE65, 0x874F,
0xCE66, 0xCE68, 0x8754,
0xCE6A, 0xCE6F, 0x875A,
0xCE70, 0xCE71, 0x8761,
0xCE72, 0xCE79, 0x8766,
0xCE7B, 0xCE7D, 0x8771,
0xCE80, 0xCE83, 0x8777,
0xCE84, 0xCE86, 0x877F,
0xCE88, 0xCE89, 0x8786,
0xCE8A, 0xCE8B, 0x8789,
0xCE8D, 0xCE91, 0x878E,
0xCE92, 0xCE94, 0x8794,
0xCE95, 0xCE9B, 0x8798,
0xCE9C, 0xCEA0, 0x87A0,
0xCF40, 0xCF42, 0x87A5,
0xCF43, 0xCF44, 0x87A9,
0xCF46, 0xCF48, 0x87B0,
0xCF4A, 0xCF4D, 0x87B6,
0xCF4E, 0xCF4F, 0x87BB,
0xCF50, 0xCF51, 0x87BE,
0xCF52, 0xCF56, 0x87C1,
0xCF57, 0xCF59, 0x87C7,
0xCF5A, 0xCF5E, 0x87CC,
0xCF5F, 0xCF65, 0x87D4,
0xCF66, 0xCF69, 0x87DC,
0xCF6A, 0xCF6D, 0x87E1,
0xCF6E, 0xCF71, 0x87E6,
0xCF72, 0xCF74, 0x87EB,
0xCF75, 0xCF7E, 0x87EF,
0xCF80, 0xCF83, 0x87FA,
0xCF84, 0xCF87, 0x87FF,
0xCF88, 0xCF8D, 0x8804,
0xCF8E, 0xCF95, 0x880B,
0xCF97, 0xCF9A, 0x8817,
0xCF9B, 0xCF9F, 0x881C,
0xD040, 0xD04D, 0x8824,
0xD04E, 0xD053, 0x8833,
0xD054, 0xD055, 0x883A,
0xD056, 0xD058, 0x883D,
0xD059, 0xD05B, 0x8841,
0xD05C, 0xD061, 0x8846,
0xD062, 0xD067, 0x884E,
0xD068, 0xD069, 0x8855,
0xD06B, 0xD071, 0x885A,
0xD072, 0xD073, 0x8866,
0xD078, 0xD07B, 0x8873,
0xD07C, 0xD07E, 0x8878,
0xD080, 0xD081, 0x887B,
0xD084, 0xD085, 0x8886,
0xD086, 0xD087, 0x8889,
0xD089, 0xD08C, 0x888E,
0xD08D, 0xD08F, 0x8893,
0xD090, 0xD094, 0x8897,
0xD095, 0xD099, 0x889D,
0xD09B, 0xD0A0, 0x88A5,
0xD141, 0xD143, 0x88AE,
0xD144, 0xD148, 0x88B2,
0xD149, 0xD14C, 0x88B8,
0xD14D, 0xD150, 0x88BD,
0xD151, 0xD152, 0x88C3,
0xD153, 0xD154, 0x88C7,
0xD155, 0xD158, 0x88CA,
0xD159, 0xD15B, 0x88CF,
0xD15D, 0xD15E, 0x88D6,
0xD15F, 0xD163, 0x88DA,
0xD164, 0xD165, 0x88E0,
0xD166, 0xD167, 0x88E6,
0xD168, 0xD16E, 0x88E9,
0xD170, 0xD172, 0x88F5,
0xD173, 0xD174, 0x88FA,
0xD176, 0xD178, 0x88FF,
0xD179, 0xD17E, 0x8903,
0xD181, 0xD185, 0x890B,
0xD187, 0xD18B, 0x8914,
0xD18C, 0xD190, 0x891C,
0xD191, 0xD193, 0x8922,
0xD194, 0xD197, 0x8926,
0xD198, 0xD19B, 0x892C,
0xD19C, 0xD19E, 0x8931,
0xD240, 0xD248, 0x8938,
0xD249, 0xD24A, 0x8942,
0xD24B, 0xD263, 0x8945,
0xD264, 0xD269, 0x8960,
0xD26A, 0xD27D, 0x8967,
0xD280, 0xD281, 0x897D,
0xD284, 0xD285, 0x8984,
0xD286, 0xD2A0, 0x8987,
0xD340, 0xD35E, 0x89A2,
0xD361, 0xD363, 0x89D3,
0xD364, 0xD366, 0x89D7,
0xD369, 0xD36C, 0x89DF,
0xD36E, 0xD371, 0x89E7,
0xD372, 0xD374, 0x89EC,
0xD375, 0xD377, 0x89F0,
0xD378, 0xD37E, 0x89F4,
0xD380, 0xD384, 0x89FB,
0xD385, 0xD38A, 0x8A01,
0xD38B, 0xD3A0, 0x8A08,
0xD3A9, 0xD3AA, 0x8424,
0xD440, 0xD45F, 0x8A1E,
0xD460, 0xD468, 0x8A3F,
0xD469, 0xD47E, 0x8A49,
0xD480, 0xD499, 0x8A5F,
0xD49A, 0xD4A0, 0x8A7A,
0xD540, 0xD547, 0x8A81,
0xD548, 0xD54F, 0x8A8B,
0xD550, 0xD57E, 0x8A94,
0xD580, 0xD5A0, 0x8AC3,
0xD640, 0xD662, 0x8AE4,
0xD663, 0xD67E, 0x8B08,
0xD680, 0xD681, 0x8B24,
0xD682, 0xD6A0, 0x8B27,
0xD6C1, 0xD6C2, 0x81F3,
0xD740, 0xD75F, 0x8B46,
0xD760, 0xD764, 0x8B67,
0xD765, 0xD77E, 0x8B6D,
0xD780, 0xD798, 0x8B87,
0xD840, 0xD848, 0x8C38,
0xD849, 0xD84C, 0x8C42,
0xD84E, 0xD84F, 0x8C4A,
0xD850, 0xD857, 0x8C4D,
0xD858, 0xD85B, 0x8C56,
0xD85C, 0xD861, 0x8C5B,
0xD862, 0xD868, 0x8C63,
0xD869, 0xD86F, 0x8C6C,
0xD870, 0xD873, 0x8C74,
0xD874, 0xD87A, 0x8C7B,
0xD87B, 0xD87C, 0x8C83,
0xD87D, 0xD87E, 0x8C86,
0xD882, 0xD888, 0x8C8D,
0xD889, 0xD88B, 0x8C95,
0xD88C, 0xD8A0, 0x8C99,
0xD8DB, 0xD8DC, 0x523F,
0xD940, 0xD97E, 0x8CAE,
0xD980, 0xD9A0, 0x8CED,
0xDA40, 0xDA4E, 0x8D0E,
0xDA50, 0xDA51, 0x8D51,
0xDA55, 0xDA57, 0x8D68,
0xDA59, 0xDA5A, 0x8D6E,
0xDA5B, 0xDA5C, 0x8D71,
0xDA5D, 0xDA65, 0x8D78,
0xDA66, 0xDA67, 0x8D82,
0xDA68, 0xDA6B, 0x8D86,
0xDA6C, 0xDA70, 0x8D8C,
0xDA71, 0xDA72, 0x8D92,
0xDA73, 0xDA7C, 0x8D95,
0xDA7D, 0xDA7E, 0x8DA0,
0xDA81, 0xDA8D, 0x8DA4,
0xDA8F, 0xDA90, 0x8DB6,
0xDA94, 0xDA96, 0x8DC0,
0xDA98, 0xDA9B, 0x8DC7,
0xDA9E, 0xDAA0, 0x8DD2,
0xDAA6, 0xDAA7, 0x8BA6,
0xDAA9, 0xDAAA, 0x8BB4,
0xDAAC, 0xDAAD, 0x8BC2,
0xDAB1, 0xDAB3, 0x8BD2,
0xDAB5, 0xDAB6, 0x8BD8,
0xDAB8, 0xDAB9, 0x8BDF,
0xDABB, 0xDABC, 0x8BE8,
0xDAC3, 0xDAC4, 0x8BFF,
0xDACA, 0xDACB, 0x8C11,
0xDACC, 0xDACE, 0x8C14,
0xDAD3, 0xDAD5, 0x8C1F,
0xDAD8, 0xDAD9, 0x8C2A,
0xDADA, 0xDADB, 0x8C2E,
0xDADC, 0xDADD, 0x8C32,
0xDADE, 0xDADF, 0x8C35,
0xDB41, 0xDB42, 0x8DD8,
0xDB44, 0xDB46, 0x8DE0,
0xDB47, 0xDB49, 0x8DE5,
0xDB4B, 0xDB4C, 0x8DED,
0xDB4D, 0xDB4F, 0x8DF0,
0xDB53, 0xDB59, 0x8DFE,
0xDB5A, 0xDB5C, 0x8E06,
0xDB5E, 0xDB5F, 0x8E0D,
0xDB60, 0xDB63, 0x8E10,
0xDB64, 0xDB6B, 0x8E15,
0xDB6C, 0xDB6D, 0x8E20,
0xDB6E, 0xDB72, 0x8E24,
0xDB76, 0xDB78, 0x8E32,
0xDB79, 0xDB7B, 0x8E36,
0xDB7C, 0xDB7D, 0x8E3B,
0xDB82, 0xDB83, 0x8E45,
0xDB84, 0xDB88, 0x8E4C,
0xDB89, 0xDB8E, 0x8E53,
0xDB8F, 0xDB9A, 0x8E5A,
0xDB9B, 0xDB9C, 0x8E67,
0xDB9D, 0xDB9E, 0x8E6A,
0xDBBE, 0xDBBF, 0x52AC,
0xDBDC, 0xDBDD, 0x572E,
0xDC42, 0xDC46, 0x8E77,
0xDC47, 0xDC48, 0x8E7D,
0xDC4A, 0xDC4C, 0x8E82,
0xDC4E, 0xDC54, 0x8E88,
0xDC55, 0xDC57, 0x8E91,
0xDC58, 0xDC5E, 0x8E95,
0xDC60, 0xDC6B, 0x8E9F,
0xDC6C, 0xDC6D, 0x8EAD,
0xDC6E, 0xDC6F, 0x8EB0,
0xDC70, 0xDC76, 0x8EB3,
0xDC77, 0xDC7E, 0x8EBB,
0xDC80, 0xDC8A, 0x8EC3,
0xDC8B, 0xDCA0, 0x8ECF,
0xDCC8, 0xDCC9, 0x82CB,
0xDCE3, 0xDCE4, 0x8314,
0xDCE9, 0xDCEA, 0x835B,
0xDD40, 0xDD7E, 0x8EE5,
0xDD80, 0xDDA0, 0x8F24,
0xDDA6, 0xDDA7, 0x836D,
0xDDAA, 0xDDAB, 0x83B3,
0xDDCE, 0xDDCF, 0x83F8,
0xDDDB, 0xDDDC, 0x8487,
0xDE40, 0xDE60, 0x8F45,
0xDE66, 0xDE68, 0x8FA0,
0xDE69, 0xDE6C, 0x8FA4,
0xDE6E, 0xDE71, 0x8FAC,
0xDE72, 0xDE75, 0x8FB2,
0xDE76, 0xDE77, 0x8FB7,
0xDE78, 0xDE7A, 0x8FBA,
0xDE7B, 0xDE7C, 0x8FBF,
0xDE80, 0xDE84, 0x8FC9,
0xDE87, 0xDE88, 0x8FD6,
0xDE8A, 0xDE8B, 0x8FE0,
0xDE90, 0xDE91, 0x8FF1,
0xDE92, 0xDE94, 0x8FF4,
0xDE95, 0xDE97, 0x8FFA,
0xDE98, 0xDE99, 0x8FFE,
0xDE9A, 0xDE9B, 0x9007,
0xDF42, 0xDF44, 0x9023,
0xDF45, 0xDF4A, 0x9027,
0xDF4B, 0xDF4F, 0x9030,
0xDF51, 0xDF52, 0x9039,
0xDF54, 0xDF55, 0x903F,
0xDF57, 0xDF58, 0x9045,
0xDF59, 0xDF5D, 0x9048,
0xDF5F, 0xDF61, 0x9054,
0xDF62, 0xDF63, 0x9059,
0xDF64, 0xDF69, 0x905C,
0xDF6B, 0xDF6C, 0x9066,
0xDF6D, 0xDF70, 0x9069,
0xDF71, 0xDF75, 0x906F,
0xDF76, 0xDF7C, 0x9076,
0xDF80, 0xDF83, 0x9084,
0xDF84, 0xDF85, 0x9089,
0xDF86, 0xDF8A, 0x908C,
0xDF91, 0xDF93, 0x909E,
0xDF94, 0xDF95, 0x90A4,
0xDF96, 0xDF98, 0x90A7,
0xDF9D, 0xDF9E, 0x90BC,
0xDF9F, 0xDFA0, 0x90BF,
0xDFA2, 0xDFA3, 0x64B7,
0xDFBC, 0xDFBE, 0x5452,
0xDFCB, 0xDFCC, 0x549A,
0xDFD8, 0xDFD9, 0x54D3,
0xDFE0, 0xDFE1, 0x54D9,
0xDFE3, 0xDFE4, 0x54A9,
0xDFEF, 0xDFF0, 0x5522,
0xE040, 0xE041, 0x90C2,
0xE043, 0xE044, 0x90C8,
0xE045, 0xE047, 0x90CB,
0xE049, 0xE04B, 0x90D4,
0xE04C, 0xE04E, 0x90D8,
0xE04F, 0xE051, 0x90DE,
0xE052, 0xE054, 0x90E3,
0xE055, 0xE056, 0x90E9,
0xE059, 0xE05C, 0x90F0,
0xE05D, 0xE05F, 0x90F5,
0xE060, 0xE063, 0x90F9,
0xE064, 0xE066, 0x90FF,
0xE068, 0xE07B, 0x9105,
0xE07C, 0xE07E, 0x911A,
0xE081, 0xE083, 0x911F,
0xE084, 0xE08E, 0x9124,
0xE090, 0xE096, 0x9132,
0xE097, 0xE09F, 0x913A,
0xE0A3, 0xE0A5, 0x5575,
0xE0B6, 0xE0B7, 0x55BD,
0xE0BF, 0xE0C0, 0x55EB,
0xE0C7, 0xE0C8, 0x55F2,
0xE0C9, 0xE0CA, 0x55CC,
0xE0E7, 0xE0E8, 0x567B,
0xE0FD, 0xE0FE, 0x5E3B,
0xE141, 0xE142, 0x9147,
0xE144, 0xE147, 0x9153,
0xE148, 0xE149, 0x9158,
0xE14A, 0xE14B, 0x915B,
0xE14C, 0xE14D, 0x915F,
0xE14E, 0xE150, 0x9166,
0xE154, 0xE156, 0x917A,
0xE157, 0xE15B, 0x9180,
0xE15F, 0xE160, 0x918E,
0xE161, 0xE167, 0x9193,
0xE168, 0xE16D, 0x919C,
0xE16E, 0xE173, 0x91A4,
0xE174, 0xE175, 0x91AB,
0xE176, 0xE179, 0x91B0,
0xE17A, 0xE17D, 0x91B6,
0xE180, 0xE18A, 0x91BC,
0xE18E, 0xE197, 0x91D2,
0xE198, 0xE1A0, 0x91DD,
0xE1AD, 0xE1AE, 0x5C98,
0xE1C0, 0xE1C1, 0x5D02,
0xE1EE, 0xE1EF, 0x72B7,
0xE240, 0xE27E, 0x91E6,
0xE280, 0xE2A0, 0x9225,
0xE2BC, 0xE2C1, 0x9967,
0xE2CA, 0xE2CB, 0x9990,
0xE2CC, 0xE2CE, 0x9993,
0xE2EA, 0xE2EB, 0x6005,
0xE2FA, 0xE2FB, 0x6078,
0xE340, 0xE36D, 0x9246,
0xE36E, 0xE37E, 0x9275,
0xE380, 0xE387, 0x9286,
0xE388, 0xE3A0, 0x928F,
0xE3C9, 0xE3CA, 0x95F5,
0xE3CD, 0xE3CE, 0x9603,
0xE3D1, 0xE3D4, 0x960A,
0xE3D7, 0xE3D9, 0x9615,
0xE3DA, 0xE3DB, 0x9619,
0xE3E8, 0xE3E9, 0x6C68,
0xE3F1, 0xE3F2, 0x6CF7,
0xE440, 0xE445, 0x92A8,
0xE446, 0xE45E, 0x92AF,
0xE45F, 0xE47E, 0x92C9,
0xE480, 0xE4A0, 0x92E9,
0xE4B8, 0xE4B9, 0x6D93,
0xE4D4, 0xE4D5, 0x6E53,
0xE4EB, 0xE4EC, 0x6F46,
0xE540, 0xE573, 0x930A,
0xE574, 0xE57E, 0x933F,
0xE580, 0xE59F, 0x934A,
0xE5D3, 0xE5D4, 0x9035,
0xE5D8, 0xE5D9, 0x9051,
0xE5FC, 0xE5FD, 0x59A9,
0xE640, 0xE662, 0x936C,
0xE663, 0xE67E, 0x9390,
0xE680, 0xE69D, 0x93AC,
0xE69E, 0xE6A0, 0x93CB,
0xE6AB, 0xE6AC, 0x5A05,
0xE6E1, 0xE6E2, 0x9A77,
0xE6E6, 0xE6E7, 0x9A80,
0xE6EC, 0xE6ED, 0x9A92,
0xE6F0, 0xE6F2, 0x9A9B,
0xE6F3, 0xE6F4, 0x9A9F,
0xE6F5, 0xE6F6, 0x9AA2,
0xE6FD, 0xE6FE, 0x7EA8,
0xE740, 0xE747, 0x93CE,
0xE748, 0xE77E, 0x93D7,
0xE780, 0xE7A0, 0x940E,
0xE7A4, 0xE7A6, 0x7EC0,
0xE7A8, 0xE7A9, 0x7ECB,
0xE7AE, 0xE7AF, 0x7EE0,
0xE7B2, 0xE7B3, 0x7EEE,
0xE7B4, 0xE7B5, 0x7EF1,
0xE7B8, 0xE7B9, 0x7EFA,
0xE7BB, 0xE7BD, 0x7F01,
0xE7BE, 0xE7BF, 0x7F07,
0xE7C0, 0xE7C1, 0x7F0B,
0xE7C3, 0xE7C4, 0x7F11,
0xE7CA, 0xE7D0, 0x7F21,
0xE7D1, 0xE7D4, 0x7F2A,
0xE7D5, 0xE7D9, 0x7F2F,
0xE840, 0xE84E, 0x942F,
0xE84F, 0xE87A, 0x943F,
0xE87B, 0xE87E, 0x946C,
0xE880, 0xE894, 0x9470,
0xE89A, 0xE89B, 0x94D3,
0xE8AD, 0xE8AE, 0x7480,
0xE8B2, 0xE8B3, 0x74A8,
0xE8B8, 0xE8BA, 0x97EA,
0xE8E0, 0xE8E1, 0x6832,
0xE8E2, 0xE8E3, 0x6860,
0xE8FC, 0xE8FD, 0x691F,
0xE94A, 0xE94B, 0x9574,
0xE94C, 0xE953, 0x9577,
0xE954, 0xE97E, 0x9580,
0xE980, 0xE9A0, 0x95AB,
0xE9B4, 0xE9B5, 0x6987,
0xE9CB, 0xE9CC, 0x6A17,
0xE9E2, 0xE9E3, 0x6B81,
0xE9E6, 0xE9E7, 0x6B92,
0xE9E9, 0xE9EA, 0x6B9A,
0xE9EF, 0xE9F1, 0x8F71,
0xE9F2, 0xE9F3, 0x8F75,
0xE9F6, 0xE9F7, 0x8F79,
0xE9FA, 0xE9FB, 0x8F81,
0xEA40, 0xEA5B, 0x95CC,
0xEA64, 0xEA6A, 0x9623,
0xEA6B, 0xEA6D, 0x962B,
0xEA6E, 0xEA6F, 0x962F,
0xEA70, 0xEA73, 0x9637,
0xEA78, 0xEA79, 0x964E,
0xEA7A, 0xEA7C, 0x9651,
0xEA7D, 0xEA7E, 0x9656,
0xEA80, 0xEA82, 0x9658,
0xEA83, 0xEA85, 0x965C,
0xEA88, 0xEA89, 0x9665,
0xEA8B, 0xEA8F, 0x966D,
0xEA91, 0xEA9D, 0x9678,
0xEA9F, 0xEAA0, 0x9689,
0xEAA1, 0xEAA3, 0x8F8D,
0xEAB8, 0xEABA, 0x65EE,
0xEAD6, 0xEAD7, 0x66DB,
0xEADA, 0xEADB, 0x8D32,
0xEAE0, 0xEAE1, 0x8D45,
0xEAE2, 0xEAE3, 0x8D48,
0xEAE9, 0xEAEB, 0x89CA,
0xEAEC, 0xEAEF, 0x89CE,
0xEAF5, 0xEAF6, 0x727E,
0xEB42, 0xEB44, 0x9691,
0xEB45, 0xEB46, 0x9695,
0xEB47, 0xEB48, 0x969A,
0xEB49, 0xEB52, 0x969D,
0xEB53, 0xEB5A, 0x96A8,
0xEB5B, 0xEB5C, 0x96B1,
0xEB5D, 0xEB5E, 0x96B4,
0xEB5F, 0xEB60, 0x96B7,
0xEB61, 0xEB62, 0x96BA,
0xEB64, 0xEB65, 0x96C2,
0xEB67, 0xEB68, 0x96CA,
0xEB69, 0xEB6A, 0x96D0,
0xEB6B, 0xEB6C, 0x96D3,
0xEB6D, 0xEB76, 0x96D6,
0xEB77, 0xEB7D, 0x96E1,
0xEB80, 0xEB82, 0x96EC,
0xEB83, 0xEB85, 0x96F0,
0xEB86, 0xEB87, 0x96F4,
0xEB89, 0xEB8C, 0x96FA,
0xEB8E, 0xEB8F, 0x9702,
0xEB91, 0xEB93, 0x970A,
0xEB94, 0xEB96, 0x9710,
0xEB97, 0xEB98, 0x9714,
0xEB99, 0xEB9D, 0x9717,
0xEB9F, 0xEBA0, 0x971F,
0xEBAE, 0xEBB0, 0x6C18,
0xEBCA, 0xEBCD, 0x80E7,
0xEBDA, 0xEBDB, 0x810D,
0xEBEA, 0xEBEB, 0x8159,
0xEBEF, 0xEBF0, 0x817C,
0xEC40, 0xEC48, 0x9721,
0xEC49, 0xEC4A, 0x972B,
0xEC4B, 0xEC4C, 0x972E,
0xEC4E, 0xEC52, 0x9733,
0xEC53, 0xEC56, 0x973A,
0xEC57, 0xEC69, 0x973F,
0xEC6A, 0xEC6B, 0x9754,
0xEC6C, 0xEC6D, 0x9757,
0xEC6F, 0xEC70, 0x975C,
0xEC72, 0xEC73, 0x9763,
0xEC74, 0xEC76, 0x9766,
0xEC77, 0xEC7E, 0x976A,
0xEC82, 0xEC86, 0x9777,
0xEC87, 0xEC8E, 0x977D,
0xEC8F, 0xEC93, 0x9786,
0xEC95, 0xEC97, 0x978E,
0xEC99, 0xEC9B, 0x9795,
0xEC9C, 0xECA0, 0x9799,
0xECA9, 0xECAB, 0x98D1,
0xECAD, 0xECAE, 0x98D9,
0xECE8, 0xECE9, 0x6248,
0xECEE, 0xECEF, 0x795B,
0xED40, 0xED41, 0x979E,
0xED42, 0xED43, 0x97A1,
0xED44, 0xED4A, 0x97A4,
0xED4D, 0xED4E, 0x97B0,
0xED50, 0xED7E, 0x97B5,
0xED80, 0xED81, 0x97E4,
0xED83, 0xED87, 0x97EE,
0xED89, 0xEDA0, 0x97F7,
0xEDBA, 0xEDBB, 0x7817,
0xEDBF, 0xEDC0, 0x781C,
0xEDC1, 0xEDC3, 0x7839,
0xEDCC, 0xEDCD, 0x7856,
0xEDEA, 0xEDEB, 0x9EFB,
0xEDF0, 0xEDF1, 0x7707,
0xEDF9, 0xEDFA, 0x7750,
0xEE40, 0xEE7E, 0x980F,
0xEE80, 0xEEA0, 0x984E,
0xEEA9, 0xEEAA, 0x779F,
0xEEC4, 0xEEC6, 0x9485,
0xEEC9, 0xEECA, 0x948C,
0xEECB, 0xEECC, 0x948F,
0xEED0, 0xEED2, 0x949A,
0xEED3, 0xEED4, 0x94A3,
0xEED9, 0xEEDA, 0x94AF,
0xEEDD, 0xEEE1, 0x94B6,
0xEEE2, 0xEEE3, 0x94BC,
0xEEE6, 0xEEEC, 0x94C8,
0xEEED, 0xEEEF, 0x94D0,
0xEEF0, 0xEEF2, 0x94D5,
0xEEF6, 0xEEF8, 0x94DE,
0xEEFA, 0xEEFB, 0x94E4,
0xEEFC, 0xEEFD, 0x94E7,
0xEF40, 0xEF45, 0x986F,
0xEF4C, 0xEF71, 0x98A8,
0xEF72, 0xEF73, 0x98CF,
0xEF75, 0xEF76, 0x98D6,
0xEF77, 0xEF79, 0x98DB,
0xEF7A, 0xEF7E, 0x98E0,
0xEF80, 0xEF81, 0x98E5,
0xEF82, 0xEFA0, 0x98E9,
0xEFA3, 0xEFA4, 0x94EE,
0xEFA5, 0xEFA7, 0x94F3,
0xEFAA, 0xEFAB, 0x94FC,
0xEFAF, 0xEFB0, 0x9506,
0xEFB1, 0xEFB2, 0x9509,
0xEFB3, 0xEFB5, 0x950D,
0xEFB6, 0xEFBA, 0x9512,
0xEFBD, 0xEFBF, 0x951D,
0xEFC1, 0xEFC2, 0x952A,
0xEFC5, 0xEFC6, 0x9531,
0xEFC8, 0xEFCA, 0x9536,
0xEFCC, 0xEFCD, 0x953E,
0xEFD0, 0xEFD2, 0x9544,
0xEFD5, 0xEFD6, 0x954E,
0xEFD7, 0xEFD9, 0x9552,
0xEFDA, 0xEFDD, 0x9556,
0xEFDF, 0xEFE0, 0x955E,
0xEFE2, 0xEFE3, 0x9561,
0xEFE4, 0xEFEC, 0x9564,
0xEFEE, 0xEFF0, 0x9571,
0xF040, 0xF044, 0x9908,
0xF045, 0xF046, 0x990E,
0xF047, 0xF063, 0x9911,
0xF064, 0xF07E, 0x992F,
0xF080, 0xF089, 0x994A,
0xF08A, 0xF096, 0x9956,
0xF09A, 0xF09B, 0x9978,
0xF09E, 0xF09F, 0x9982,
0xF0B1, 0xF0B5, 0x9E28,
0xF0BB, 0xF0BC, 0x9E39,
0xF0BE, 0xF0BF, 0x9E41,
0xF0C1, 0xF0C4, 0x9E46,
0xF0C5, 0xF0C6, 0x9E4B,
0xF0CB, 0xF0CD, 0x9E5A,
0xF0D0, 0xF0D6, 0x9E66,
0xF0E1, 0xF0E2, 0x75B3,
0xF142, 0xF14C, 0x999A,
0xF14D, 0xF14E, 0x99A6,
0xF14F, 0xF17E, 0x99A9,
0xF180, 0xF1A0, 0x99D9,
0xF1B6, 0xF1B7, 0x7A78,
0xF1ED, 0xF1EF, 0x8025,
0xF240, 0xF27E, 0x99FA,
0xF280, 0xF2A0, 0x9A39,
0xF2A2, 0xF2A3, 0x988C,
0xF2A6, 0xF2A7, 0x989A,
0xF2A8, 0xF2A9, 0x989E,
0xF2AA, 0xF2AB, 0x98A1,
0xF2AC, 0xF2AD, 0x98A5,
0xF2CC, 0xF2CD, 0x86F1,
0xF2ED, 0xF2EE, 0x877D,
0xF340, 0xF351, 0x9A5A,
0xF355, 0xF356, 0x9A8D,
0xF357, 0xF358, 0x9A94,
0xF35B, 0xF361, 0x9AA9,
0xF362, 0xF365, 0x9AB2,
0xF368, 0xF36A, 0x9ABD,
0xF36B, 0xF36C, 0x9AC3,
0xF36D, 0xF371, 0x9AC6,
0xF372, 0xF375, 0x9ACD,
0xF377, 0xF37A, 0x9AD4,
0xF37B, 0xF37E, 0x9AD9,
0xF380, 0xF381, 0x9ADD,
0xF383, 0xF386, 0x9AE2,
0xF387, 0xF38A, 0x9AE7,
0xF38D, 0xF395, 0x9AF0,
0xF397, 0xF39D, 0x9AFC,
0xF39E, 0xF3A0, 0x9B04,
0xF3C0, 0xF3C1, 0x7F44,
0xF3C6, 0xF3C7, 0x7B03,
0xF3E5, 0xF3E6, 0x7BA6,
0xF3F6, 0xF3F7, 0x7BE5,
0xF441, 0xF446, 0x9B09,
0xF447, 0xF449, 0x9B10,
0xF44A, 0xF454, 0x9B14,
0xF455, 0xF457, 0x9B20,
0xF458, 0xF462, 0x9B24,
0xF463, 0xF464, 0x9B30,
0xF465, 0xF46C, 0x9B33,
0xF46D, 0xF470, 0x9B3D,
0xF472, 0xF474, 0x9B4A,
0xF477, 0xF478, 0x9B52,
0xF479, 0xF47E, 0x9B55,
0xF480, 0xF4A0, 0x9B5B,
0xF4A8, 0xF4A9, 0x8201,
0xF4AD, 0xF4AF, 0x8221,
0xF4B6, 0xF4B7, 0x8233,
0xF4C9, 0xF4CA, 0x7FAF,
0xF4D4, 0xF4D5, 0x7CBC,
0xF4D8, 0xF4D9, 0x7CCC,
0xF4FC, 0xF4FD, 0x914E,
0xF540, 0xF57E, 0x9B7C,
0xF580, 0xF5A0, 0x9BBB,
0xF5A6, 0xF5A7, 0x917D,
0xF5B0, 0xF5B1, 0x91A2,
0xF5B3, 0xF5B5, 0x91AD,
0xF5C5, 0xF5C6, 0x8DD6,
0xF5C9, 0xF5CA, 0x8DCE,
0xF5CE, 0xF5CF, 0x8DF7,
0xF5E4, 0xF5E5, 0x8E41,
0xF5E6, 0xF5E7, 0x8E51,
0xF640, 0xF67E, 0x9BDC,
0xF680, 0xF6A0, 0x9C1B,
0xF6B5, 0xF6BA, 0x9F85,
0xF6C0, 0xF6C1, 0x96BC,
0xF6D1, 0xF6D4, 0x9C85,
0xF6D8, 0xF6DA, 0x9C90,
0xF6DB, 0xF6DC, 0x9C94,
0xF6DD, 0xF6DE, 0x9C9A,
0xF6DF, 0xF6E4, 0x9C9E,
0xF6E5, 0xF6E9, 0x9CA5,
0xF6EB, 0xF6EC, 0x9CAD,
0xF6ED, 0xF6F4, 0x9CB0,
0xF6F5, 0xF6F8, 0x9CBA,
0xF6F9, 0xF6FC, 0x9CC4,
0xF6FD, 0xF6FE, 0x9CCA,
0xF740, 0xF77E, 0x9C3C,
0xF781, 0xF782, 0x9C7D,
0xF784, 0xF785, 0x9C83,
0xF786, 0xF787, 0x9C89,
0xF78B, 0xF78E, 0x9C96,
0xF794, 0xF798, 0x9CBE,
0xF799, 0xF79A, 0x9CC8,
0xF79B, 0xF79C, 0x9CD1,
0xF79D, 0xF79E, 0x9CDA,
0xF79F, 0xF7A0, 0x9CE0,
0xF7A1, 0xF7A5, 0x9CCC,
0xF7A6, 0xF7A8, 0x9CD3,
0xF7A9, 0xF7AB, 0x9CD7,
0xF7AC, 0xF7AD, 0x9CDC,
0xF7B2, 0xF7B3, 0x9791,
0xF7C5, 0xF7C6, 0x9ACB,
0xF7E1, 0xF7E2, 0x9EBD,
0xF7E5, 0xF7E6, 0x9E87,
0xF7EC, 0xF7EE, 0x9EDB,
0xF7FC, 0xF7FD, 0x9F3D,
0xF840, 0xF87E, 0x9CE3,
0xF880, 0xF8A0, 0x9D22,
0xF940, 0xF97E, 0x9D43,
0xF980, 0xF9A0, 0x9D82,
0xFA40, 0xFA7E, 0x9DA3,
0xFA80, 0xFAA0, 0x9DE2,
0xFB40, 0xFB5B, 0x9E03,
0xFB61, 0xFB62, 0x9E3B,
0xFB66, 0xFB68, 0x9E52,
0xFB6C, 0xFB6F, 0x9E5F,
0xFB71, 0xFB72, 0x9E6E,
0xFB74, 0xFB7D, 0x9E74,
0xFB81, 0xFB84, 0x9E83,
0xFB85, 0xFB86, 0x9E89,
0xFB87, 0xFB8C, 0x9E8C,
0xFB8D, 0xFB95, 0x9E94,
0xFB97, 0xFB9C, 0x9EA0,
0xFB9D, 0xFBA0, 0x9EA7,
0xFC40, 0xFC48, 0x9EAB,
0xFC49, 0xFC4B, 0x9EB5,
0xFC4C, 0xFC4D, 0x9EB9,
0xFC4F, 0xFC53, 0x9EBF,
0xFC54, 0xFC57, 0x9EC5,
0xFC58, 0xFC5A, 0x9ECA,
0xFC5C, 0xFC5D, 0x9ED2,
0xFC5E, 0xFC60, 0x9ED5,
0xFC61, 0xFC62, 0x9ED9,
0xFC65, 0xFC66, 0x9EE3,
0xFC69, 0xFC6C, 0x9EEB,
0xFC6D, 0xFC75, 0x9EF0,
0xFC78, 0xFC7E, 0x9EFF,
0xFC80, 0xFC84, 0x9F06,
0xFC87, 0xFC88, 0x9F11,
0xFC89, 0xFC8B, 0x9F14,
0xFC8D, 0xFC92, 0x9F1A,
0xFC94, 0xFC9C, 0x9F23,
0xFC9D, 0xFC9E, 0x9F2D,
0xFC9F, 0xFCA0, 0x9F30,
0xFD40, 0xFD44, 0x9F32,
0xFD48, 0xFD4C, 0x9F3F,
0xFD4D, 0xFD57, 0x9F45,
0xFD58, 0xFD7E, 0x9F52,
0xFD80, 0xFD85, 0x9F79,
0xFD86, 0xFD87, 0x9F81,
0xFD88, 0xFD93, 0x9F8D,
0xFD94, 0xFD96, 0x9F9C,
0xFD97, 0xFD9B, 0x9FA1,
0xFE40, 0xFE43, 0xFA0C,
0xFE45, 0xFE46, 0xFA13,
0xFE48, 0xFE4A, 0xFA1F,
0xFE4B, 0xFE4C, 0xFA23,
0xFE4D, 0xFE4F, 0xFA27,
0xFE50, 0xFEA0, 0xE815, // }}}
};
static const unsigned short * _initTrad2Simp_utf16()
{
unsigned short *gbk2utf16 = new unsigned short[0x8000];
for (unsigned short c = 0; c < sizeof(_gbk2utf16_2) / sizeof(short); c += 2)
gbk2utf16[_gbk2utf16_2[c] - 0x8000] = _gbk2utf16_2[c + 1];
for (unsigned short c = 0; c < sizeof(_gbk2utf16_3) / sizeof(short); c += 3)
for (unsigned short d = _gbk2utf16_3[c]; d <= _gbk2utf16_3[c + 1]; d ++)
gbk2utf16[d - 0x8000] = _gbk2utf16_3[c + 2] + d - _gbk2utf16_3[c];
static unsigned short t2s[0x10000];
for (unsigned short c = 1; c; c ++)
t2s[c] = c;
t2s[0] = 0;
for (unsigned short c = 0; c < sizeof(_tns) / sizeof(short); c += 2)
// do not convert GB2312 (Simplified Chinese)
if (!((_tns[c] >> 8) >= 0xA1 && (_tns[c] >> 8) < 0xF8
&& (_tns[c] & 0xFF) >= 0xA1))
t2s[gbk2utf16[_tns[c] - 0x8000]] = gbk2utf16[_tns[c + 1] - 0x8000];
delete []gbk2utf16;
return t2s;
}
static const unsigned short * _initTrad2Simp_gbk()
{
static unsigned short t2s[0x8000];
for (unsigned short c = 0; c < 0x8000; c ++)
t2s[c] = SWAPBYTE(c | 0x8000);
for (unsigned short c = 0; c < sizeof(_tns) / sizeof(short); c += 2)
// do not convert GB2312 (Simplified Chinese)
if (!((_tns[c] >> 8) >= 0xA1 && (_tns[c] >> 8) < 0xF8
&& (_tns[c] & 0xFF) >= 0xA1))
t2s[_tns[c] - 0x8000] = SWAPBYTE(_tns[c + 1]);
return t2s;
}
static const unsigned short * _initPlain_utf16()
{
static unsigned short plain[0x10000];
for (unsigned short c = 1; c; c ++)
plain[c] = c;
plain[0] = 0;
return plain;
}
static const unsigned short * _initPlain_gbk()
{
static unsigned short plain[0x8000];
for (unsigned short c = 0; c < 0x8000; c ++)
plain[c] = SWAPBYTE(c | 0x8000);
return plain;
}
static const char * _initUpper2Lower()
{
static char u2l[0x80];
for (unsigned short c = 0; c < 0x80; c ++)
if (c >= 'A' && c <= 'Z') u2l[c] = c + 'a' - 'A';
else u2l[c] = c;
return u2l;
}
static const char * _initLower2Upper()
{
static char l2u[0x80];
for (unsigned short c = 0; c < 0x80; c ++)
if (c >= 'a' && c <= 'z') l2u[c] = c + 'A' - 'a';
else l2u[c] = c;
return l2u;
}
static const char * _initPlain()
{
static char plain[0x80];
for (unsigned short c = 0; c < 0x80; c ++)
plain[c] = c;
return plain;
}
static const unsigned short * _initGbk2Utf16()
{
static unsigned short gbk2utf16[0x8000] = { 0 };
for (unsigned short c = 0; c < sizeof(_gbk2utf16_2) / sizeof(short); c += 2)
gbk2utf16[_gbk2utf16_2[c] - 0x8000] = _gbk2utf16_2[c + 1];
for (unsigned short c = 0; c < sizeof(_gbk2utf16_3) / sizeof(short); c += 3)
for (unsigned short d = _gbk2utf16_3[c]; d <= _gbk2utf16_3[c + 1]; d ++)
gbk2utf16[d - 0x8000] = _gbk2utf16_3[c + 2] + d - _gbk2utf16_3[c];
return gbk2utf16;
}
static const unsigned short * _initUtf162Gbk()
{
static unsigned short utf162gbk[0x10000] = { 0 };
for (unsigned short c = 0; c < sizeof(_gbk2utf16_2) / sizeof(short); c += 2)
utf162gbk[_gbk2utf16_2[c + 1]] = _gbk2utf16_2[c];
for (unsigned short c = 0; c < sizeof(_gbk2utf16_3) / sizeof(short); c += 3)
for (unsigned short d = _gbk2utf16_3[c]; d <= _gbk2utf16_3[c + 1]; d ++)
utf162gbk[_gbk2utf16_3[c + 2] + d - _gbk2utf16_3[c]] = d;
return utf162gbk;
}
static const unsigned short *_pTrad2Simp_gbk = _initTrad2Simp_gbk();
static const unsigned short *_pTrad2Simp_utf16 = _initTrad2Simp_utf16();
static const unsigned short *_pPlain_gbk = _initPlain_gbk();
static const unsigned short *_pPlain_utf16 = _initPlain_utf16();
static const char *_pUpper2Lower = _initUpper2Lower();
static const char *_pLower2Upper = _initLower2Upper();
static const char *_pPlain = _initPlain();
static const unsigned short *_pGbk2Utf16 = _initGbk2Utf16();
static const unsigned short *_pUtf162Gbk = _initUtf162Gbk();
void strnormalize_utf8(char *text, unsigned options)
{
const char *pTransTable =
(options & SNO_TO_LOWER) ? _pUpper2Lower : (
(options & SNO_TO_UPPER) ? _pLower2Upper :
_pPlain);
const unsigned short *pTransTable_utf16 =
(options & SNO_TO_SIMPLIFIED) ? _pTrad2Simp_utf16 : _pPlain_utf16;
unsigned i_from = 0, i_to = 0;
while (text[i_from])
{
if ((text[i_from] & 0x80) == 0)
{
text[i_to ++] = pTransTable[text[i_from ++]];
}
else if ((text[i_from] & 0xF0) == 0xE0
&& (text[i_from + 1] & 0xC0) == 0x80
&& (text[i_from + 2] & 0xC0) == 0x80)
{
unsigned short utf16 = (unsigned short)(text[i_from] & 0x0F) << 12
| (unsigned short)(text[i_from + 1] & 0x3F) << 6
| (unsigned short)(text[i_from + 2] & 0x3F);
if (options & SNO_TO_HALF)
{
if (utf16 == 0x3000)
utf16 = ' ';
else if (utf16 > 0xFF00 && utf16 < 0xFF60)
utf16 = ' ' + (utf16 & 0xFF);
}
if (utf16 < 0x80)
{
utf16 = pTransTable[utf16];
text[i_to ++] = utf16;
}
else
{
utf16 = pTransTable_utf16[utf16];
text[i_to ++] = (utf16 & 0xF000) >> 12 | 0xE0;
text[i_to ++] = (utf16 & 0x0FC0) >> 6 | 0x80;
text[i_to ++] = (utf16 & 0x003F) | 0x80;
}
i_from += 3;
}
else if ((text[i_from] & 0xE0) == 0xC0
&& (text[i_from + 1] & 0xC0) == 0x80)
{
text[i_to ++] = text[i_from ++];
text[i_to ++] = text[i_from ++];
}
else
{
text[i_to ++] = text[i_from ++];
}
}
text[i_to] = 0;
}
void strnormalize_utf8(string &text, unsigned options)
{
const char *pTransTable =
(options & SNO_TO_LOWER) ? _pUpper2Lower : (
(options & SNO_TO_UPPER) ? _pLower2Upper :
_pPlain);
const unsigned short *pTransTable_utf16 =
(options & SNO_TO_SIMPLIFIED) ? _pTrad2Simp_utf16 : _pPlain_utf16;
unsigned i_from = 0, i_to = 0;
while (i_from < text.size())
{
if ((text[i_from] & 0x80) == 0)
{
text[i_to ++] = pTransTable[text[i_from ++]];
}
else if ((text[i_from] & 0xF0) == 0xE0
&& (text[i_from + 1] & 0xC0) == 0x80
&& (text[i_from + 2] & 0xC0) == 0x80)
{
unsigned short utf16 = (unsigned short)(text[i_from] & 0x0F) << 12
| (unsigned short)(text[i_from + 1] & 0x3F) << 6
| (unsigned short)(text[i_from + 2] & 0x3F);
if (options & SNO_TO_HALF)
{
if (utf16 == 0x3000)
utf16 = ' ';
else if (utf16 > 0xFF00 && utf16 < 0xFF60)
utf16 = ' ' + (utf16 & 0xFF);
}
if (utf16 < 0x80)
{
utf16 = pTransTable[utf16];
text[i_to ++] = utf16;
}
else
{
utf16 = pTransTable_utf16[utf16];
text[i_to ++] = (utf16 & 0xF000) >> 12 | 0xE0;
text[i_to ++] = (utf16 & 0x0FC0) >> 6 | 0x80;
text[i_to ++] = (utf16 & 0x003F) | 0x80;
}
i_from += 3;
}
else if ((text[i_from] & 0xE0) == 0xC0
&& (text[i_from + 1] & 0xC0) == 0x80)
{
text[i_to ++] = text[i_from ++];
text[i_to ++] = text[i_from ++];
}
else
{
text[i_to ++] = text[i_from ++];
}
}
text.resize(i_to);
}
void strnormalize_gbk(char *text, unsigned options)
{
const char *pTransTable =
(options & SNO_TO_LOWER) ? _pUpper2Lower : (
(options & SNO_TO_UPPER) ? _pLower2Upper :
_pPlain);
const unsigned short *pTransTable_gbk =
(options & SNO_TO_SIMPLIFIED) ? _pTrad2Simp_gbk : _pPlain_gbk;
unsigned i_from = 0, i_to = 0, flag = 0;
for (; text[i_from]; i_from ++)
{
if (flag && (options & SNO_TO_HALF))
{
if ((unsigned char)text[i_from - 1] == 0xA1
&& (unsigned char)text[i_from] == 0xA1)
{
flag = 0;
text[i_from] = ' ';
}
else if ((unsigned char)text[i_from - 1] == 0xA3
&& text[i_from] < 0 && text[i_from] > char(0xA0))
{
flag = 0;
text[i_from] &= ~0x80;
}
}
if (flag)
{
flag = 0;
unsigned short tmp =
pTransTable_gbk[COMPBYTE(text[i_from - 1], text[i_from]) & ~0x8000];
text[i_to ++] = tmp & 0xFF;
text[i_to ++] = tmp >> 8;
}
else if (text[i_from] < 0)
flag = 1;
else
text[i_to ++] = pTransTable[text[i_from]];
}
if (flag)
text[i_to ++] = text[i_from - 1];
text[i_to] = 0;
}
void strnormalize_gbk(string &text, unsigned options)
{
const char *pTransTable =
(options & SNO_TO_LOWER) ? _pUpper2Lower : (
(options & SNO_TO_UPPER) ? _pLower2Upper :
_pPlain);
const unsigned short *pTransTable_gbk =
(options & SNO_TO_SIMPLIFIED) ? _pTrad2Simp_gbk : _pPlain_gbk;
unsigned i_from = 0, i_to = 0, flag = 0;
for (; i_from < text.size(); i_from ++)
{
if (flag && (options & SNO_TO_HALF))
{
if ((unsigned char)text[i_from - 1] == 0xA1
&& (unsigned char)text[i_from] == 0xA1)
{
flag = 0;
text[i_from] = ' ';
}
else if ((unsigned char)text[i_from - 1] == 0xA3
&& text[i_from] < 0 && text[i_from] > char(0xA0))
{
flag = 0;
text[i_from] &= ~0x80;
}
}
if (flag)
{
flag = 0;
unsigned short tmp =
pTransTable_gbk[COMPBYTE(text[i_from - 1], text[i_from]) & ~0x8000];
text[i_to ++] = tmp & 0xFF;
text[i_to ++] = tmp >> 8;
}
else if (text[i_from] < 0)
flag = 1;
else
text[i_to ++] = pTransTable[text[i_from]];
}
if (flag)
text[i_to ++] = text[i_from - 1];
text.resize(i_to);
}
const string gbk_to_utf8(const std::string &text)
{
char result[text.size() * 3 + 1];
unsigned i_from = 0, i_to = 0, flag = 0;
for (; i_from < text.size(); i_from ++)
{
if (flag)
{
flag = 0;
unsigned short tmp =
_pGbk2Utf16[COMPBYTE(text[i_from - 1], text[i_from]) & ~0x8000];
if (tmp == 0)
continue;
else if (tmp >= 0x800)
{
result[i_to ++] = 0xE0 | (tmp >> 12);
result[i_to ++] = 0x80 | ((tmp >> 6) & 0x3F);
result[i_to ++] = 0x80 | (tmp & 0x3F);
}
else if (tmp >= 0x80)
{
result[i_to ++] = 0xC0 | (tmp >> 6);
result[i_to ++] = 0x80 | (tmp & 0x3F);
}
else
{
result[i_to ++] = tmp;
}
}
else if (text[i_from] < 0)
flag = 1;
else
result[i_to ++] = text[i_from];
}
result[i_to] = 0;
return result;
}
const string utf8_to_gbk(const std::string &text)
{
char result[text.size() * 2 + 1];
unsigned i_from = 0, i_to = 0;
for (; i_from < text.size(); )
{
if ((unsigned char)text[i_from] < 0x80)
{
result[i_to ++] = text[i_from ++];
}
else if ((unsigned char)text[i_from] < 0xC2)
{
i_from ++;
}
else if ((unsigned char)text[i_from] < 0xE0)
{
if (i_from >= text.size() - 1) break;
unsigned short tmp = _pUtf162Gbk[
((text[i_from] & 0x1F) << 6) | text[i_from + 1] & 0x3F];
if (tmp)
{
result[i_to ++] = tmp >> 8;
result[i_to ++] = tmp & 0xFF;
}
i_from += 2;
}
else if ((unsigned char)text[i_from] < 0xF0)
{
if (i_from >= text.size() - 2) break;
unsigned short tmp = _pUtf162Gbk[((text[i_from] & 0x0F) << 12)
| ((text[i_from + 1] & 0x3F) << 6) | text[i_from + 2] & 0x3F];
if (tmp)
{
result[i_to ++] = tmp >> 8;
result[i_to ++] = tmp & 0xFF;
}
i_from += 3;
}
else
{
i_from += 4;
}
}
result[i_to] = 0;
return result;
}
bool is_gbk(unsigned short code)
{
return code >= 0x8000 && _pGbk2Utf16[code - 0x8000] != 0;
}
/*
#include <iostream>
int main(int argc, char **argv)
{
string line;
if (argc > 1 && argv[1] == string("-g"))
{
while (getline(cin, line))
cout << utf8_to_gbk(gbk_to_utf8(line)) << endl;
}
else if (argc > 1 && argv[1] == string("-u"))
{
while (getline(cin, line))
cout << gbk_to_utf8(utf8_to_gbk(line)) << endl;
}
else
{
unsigned options = SNO_TO_LOWER | SNO_TO_HALF;
if (argc > 1) options = atoi(argv[1]);
while (getline(cin, line))
{
strnormalize_utf8(line, options);
cout << line << endl;
}
}
return 0;
}
*/
// vim: foldmethod=marker
}
| [
"luoyan5@163.com"
] | luoyan5@163.com |
831389ec89dc067b17f4aeea25c0657de08ae3c7 | 6dabadec787db7e84d61892a3222b3fdb7734ec8 | /libnoise-helpers/planetmaps/granite.cpp | 8ee11f0819206e1fc59b3164dedb504ede4ce791 | [] | no_license | maxlambertini/Warp2010 | da378062eb1192ba59e14b91859d15513cab0225 | db76ddedd7a9180ad964bca65a9860bdcf1fc475 | refs/heads/master | 2021-01-06T20:46:29.252571 | 2019-08-25T22:05:30 | 2019-08-25T22:05:30 | 4,446,271 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,781 | cpp | #include "granite.h"
using namespace maps;
Granite::Granite()
{
}
void Granite::generate() {
module::Billow primaryGranite;
primaryGranite.SetSeed (_seed);
primaryGranite.SetFrequency (7.0 * ( 0.8 + SSGX::floatRand()*0.4));
primaryGranite.SetPersistence (0.625 * ( 0.8 + SSGX::floatRand()*0.4));
primaryGranite.SetLacunarity (2.18359375 * ( 0.8 + SSGX::floatRand()*0.4));
primaryGranite.SetOctaveCount (6);
primaryGranite.SetNoiseQuality (QUALITY_STD);
// Use Voronoi polygons to produce the small grains for the granite texture.
module::Voronoi baseGrains;
baseGrains.SetSeed (1);
baseGrains.SetFrequency (16.0 * ( 0.8 + SSGX::floatRand()*0.4));
baseGrains.EnableDistance (true);
// Scale the small grain values so that they may be added to the base
// granite texture. Voronoi polygons normally generate pits, so apply a
// negative scaling factor to produce bumps instead.
module::ScaleBias scaledGrains;
scaledGrains.SetSourceModule (0, baseGrains);
scaledGrains.SetScale (-0.5);
scaledGrains.SetBias (0.0);
// Combine the primary granite texture with the small grain texture.
module::Add combinedGranite;
combinedGranite.SetSourceModule (0, primaryGranite);
combinedGranite.SetSourceModule (1, scaledGrains);
// Finally, perturb the granite texture to add realism.
module::Turbulence finalGranite;
finalGranite.SetSourceModule (0, combinedGranite);
finalGranite.SetSeed (_seed/2);
finalGranite.SetFrequency (4.0 * ( 0.8 + SSGX::floatRand()*0.4));
finalGranite.SetPower (1.0 / 8.0);
finalGranite.SetRoughness (6);
utils::NoiseMapBuilderSphere sphere;
utils::NoiseMap noiseMap;
sphere.SetBounds (-90.0, 90.0, -180.0, 180.0); // degrees
sphere.SetDestSize (_sizeX, _sizeY);
sphere.SetSourceModule(finalGranite);
sphere.SetDestNoiseMap (noiseMap);
sphere.Build ();
utils::RendererImage textureRenderer;
textureRenderer.ClearGradient ();
auto steps = 2 + SSGX::d6();
auto colorMap = ColorOps::randomGradient(steps,13);
QMapIterator<double, QColor> i(colorMap);
while (i.hasNext()) {
i.next();
textureRenderer.AddGradientPoint(i.key(), QColorToColor(i.value()));
}
textureRenderer.AddGradientPoint(1.00,QColorToColor(ColorOps::randomColor()));
// Set up us the texture renderer and pass the noise map to it.
textureRenderer.SetSourceNoiseMap (noiseMap);
textureRenderer.SetDestImage (m_image);
textureRenderer.EnableLight (true);
textureRenderer.SetLightElev (45);
textureRenderer.SetLightContrast (0.15);
textureRenderer.SetLightBrightness (3.0);
// Render the texture.
textureRenderer.Render ();
emit imageCreated("Granite");
}
| [
"maxl@mr-finch.lamboz.priv"
] | maxl@mr-finch.lamboz.priv |
9e98b2511c5000df58b6a580b73e890f83fb65d1 | fa8d6d7d2c30de360c4f0bbcaa59167fcd582a03 | /THACO/thaco_translator.cpp | c31f76dc2f787a45e8062723699e51743a0f0595 | [] | no_license | JodsintZ/roadtotoi | 0a699b5cbafa577696d0d20b3f7c977914c6b751 | e336227d34392af379632cb40d449727539976d5 | refs/heads/master | 2023-07-16T12:23:06.194672 | 2021-08-31T11:35:16 | 2021-08-31T11:35:16 | 212,324,761 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 668 | cpp | #include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 1e5 + 5;
int n, m, a[N], chk[N], tmp, ans;
vector<pii> b;
priority_queue<int> pr;
int main() {
scanf("%d %d", &n, &m);
for(int i = 0; i <n; i++) {
scanf("%d", a + i);
}
for(int i = 0; i < m; i++ ) {
scanf("%d", &tmp);
b.emplace_back(tmp, i);
}
for(int i = 0; i < n; i++) {
int cnt = 0;
if(chk[i]) continue;
chk[i] = true;
tmp = a[i];
while(69) {
t2 = a[a[i]];
cnt++;
if(t2 == tmp) break;
}
pr.emplace_back(cnt);
}
return 0;
} | [
"jodsint@gmail.com"
] | jodsint@gmail.com |
415ce6b9090bd248ba62c93b0c8ec30b63ad2b02 | 27c917a12edbfd2dba4f6ce3b09aa2e3664d3bb1 | /Misc/sort_test.cpp | 7788cad68043dea9165d0879962b577149737a27 | [] | no_license | Spetsnaz-Dev/CPP | 681ba9be0968400e00b5b2cb9b52713f947c66f8 | 88991e3b7164dd943c4c92784d6d98a3c9689653 | refs/heads/master | 2023-06-24T05:32:30.087866 | 2021-07-15T19:33:02 | 2021-07-15T19:33:02 | 193,662,717 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 829 | cpp | int Solution::solve(int A) {
int n = A;
int count = 0;
int index;
for (int i = 31; i >= 0; i--) {
int b = A & (1 << i);
if (b != 0) {
index = i;
break;
}
}
// cout<<index<<endl;
for (int i = 0; i <= index; i++) {
int b = n & (1 << i);
if (b == 0) {
int a = n / (1 << (i + 1));
a = ((a % mod)((1 << i) % mod)) % mod;
count = ((count % mod) + (a % mod)) % mod;
} else {
int a = n / (1 << (i + 1));
a = ((a % mod)((1 << i) % mod)) % mod;
count = ((count % mod) + (a % mod)) % mod;
int k = n % (1 << (i + 1)) - (1 << i) + 1;
count = ((count % mod) + (k % mod)) % mod;
}
}
// cout<<index<<endl;
return count % mod;
} | [
"ravindrafk@gmail.com"
] | ravindrafk@gmail.com |
538cd1f90851aa623fc19a082773f8596f771088 | 145bfed5c44000d0c443752ee6123ecbff0ac089 | /src/timedata.cpp | 392acbd85336f93df569b8d80b04445fdad09eea | [
"MIT"
] | permissive | gitBullcoin/bullcoin | e49f80638d16e09aaa890de7c123be9a1cde590f | 02399ccb6bf7eb9ce20db54feda02c03bfee86dc | refs/heads/master | 2021-01-13T01:44:25.834030 | 2015-07-21T18:09:13 | 2015-07-21T18:09:13 | 39,459,931 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,562 | cpp | // Copyright (c) 2014 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "timedata.h"
#include "netbase.h"
#include "sync.h"
#include "ui_interface.h"
#include "util.h"
#include <boost/foreach.hpp>
using namespace std;
static CCriticalSection cs_nTimeOffset;
static int64_t nTimeOffset = 0;
//
// "Never go to sea with two chronometers; take one or three."
// Our three time sources are:
// - System clock
// - Median of other nodes clocks
// - The user (asking the user to fix the system clock if the first two disagree)
//
//
int64_t GetTimeOffset()
{
LOCK(cs_nTimeOffset);
return nTimeOffset;
}
int64_t GetAdjustedTime()
{
return GetTime() + GetTimeOffset();
}
void AddTimeData(const CNetAddr& ip, int64_t nTime)
{
int64_t nOffsetSample = nTime - GetTime();
LOCK(cs_nTimeOffset);
// Ignore duplicates
static set<CNetAddr> setKnown;
if (!setKnown.insert(ip).second)
return;
// Add data
static CMedianFilter<int64_t> vTimeOffsets(200,0);
vTimeOffsets.input(nOffsetSample);
LogPrintf("Added time data, samples %d, offset %+d (%+d minutes)\n", vTimeOffsets.size(), nOffsetSample, nOffsetSample/60);
// There is a known issue here (see issue #4521):
//
// - The structure vTimeOffsets contains up to 200 elements, after which
// any new element added to it will not increase its size, replacing the
// oldest element.
//
// - The condition to update nTimeOffset includes checking whether the
// number of elements in vTimeOffsets is odd, which will never happen after
// there are 200 elements.
//
// But in this case the 'bug' is protective against some attacks, and may
// actually explain why we've never seen attacks which manipulate the
// clock offset.
//
// So we should hold off on fixing this and clean it up as part of
// a timing cleanup that strengthens it in a number of other ways.
//
if (vTimeOffsets.size() >= 5 && vTimeOffsets.size() % 2 == 1)
{
int64_t nMedian = vTimeOffsets.median();
std::vector<int64_t> vSorted = vTimeOffsets.sorted();
// Only let other nodes change our time by so much
if (abs64(nMedian) < 70 * 60)
{
nTimeOffset = nMedian;
}
else
{
nTimeOffset = 0;
static bool fDone;
if (!fDone)
{
// If nobody has a time different than ours but within 5 minutes of ours, give a warning
bool fMatch = false;
BOOST_FOREACH(int64_t nOffset, vSorted)
if (nOffset != 0 && abs64(nOffset) < 5 * 60)
fMatch = true;
if (!fMatch)
{
fDone = true;
string strMessage = _("Warning: Please check that your computer's date and time are correct! If your clock is wrong Bullcoin will not work properly.");
strMiscWarning = strMessage;
LogPrintf("*** %s\n", strMessage);
uiInterface.ThreadSafeMessageBox(strMessage, "", CClientUIInterface::MSG_WARNING);
}
}
}
if (fDebug) {
BOOST_FOREACH(int64_t n, vSorted)
LogPrintf("%+d ", n);
LogPrintf("| ");
}
LogPrintf("nTimeOffset = %+d (%+d minutes)\n", nTimeOffset, nTimeOffset/60);
}
}
| [
"gitBullcoin@users.noreply.github.com"
] | gitBullcoin@users.noreply.github.com |
304036705a7b0accfa4b29c93d6c1b75dc5d0aa1 | 1435e3531731d27cb1e82888dace27a1edfbcaa1 | /ezEngine-rev858/Code/Engine/Foundation/Reflection/Implementation/DynamicRTTI.h | 39f0940a9b6eebf7fcaba23c4dbfd47c04b20982 | [] | no_license | lab132/toolbox | cf7ec9b3e6076169d8b1e12c24d0e2a273ee90be | 30f85d07fbbdde461f9027e651fc6cbbfe2f15c5 | refs/heads/master | 2020-04-26T19:40:38.059086 | 2015-11-08T14:35:09 | 2015-11-08T14:35:09 | 42,679,912 | 0 | 0 | null | 2015-10-28T13:57:32 | 2015-09-17T20:21:41 | C | UTF-8 | C++ | false | false | 5,663 | h | #pragma once
/// \file
#include <Foundation/Reflection/Implementation/StaticRTTI.h>
#include <Foundation/IO/SerializationContext.h>
#include <Foundation/Containers/Set.h>
#include <Foundation/Containers/Map.h>
/// \brief This needs to be put into the class declaration of EVERY dynamically reflectable class.
///
/// This macro extends a class, such that it is now able to return its own type information via GetDynamicRTTI(),
/// which is a virtual function, that is reimplemented on each type. A class needs to be derived from ezReflectedClass
/// (at least indirectly) for this.
#define EZ_ADD_DYNAMIC_REFLECTION(SELF) \
EZ_ALLOW_PRIVATE_PROPERTIES(SELF); \
public: \
EZ_FORCE_INLINE static const ezRTTI* GetStaticRTTI() \
{ \
return &SELF::s_RTTI; \
} \
virtual const ezRTTI* GetDynamicRTTI() const \
{ \
return &SELF::s_RTTI; \
} \
private: \
static ezRTTI s_RTTI;
/// \brief Implements the necessary functionality for a type to be dynamically reflectable.
///
/// \param Type
/// The type for which the reflection functionality should be implemented.
/// \param BaseType
/// The base class type of \a Type. If it has no base class, pass ezNoBase
/// \param AllocatorType
/// The type of an ezRTTIAllocator that can be used to create and destroy instances
/// of \a Type. Pass ezRTTINoAllocator for types that should not be created dynamically.
/// Pass ezRTTIDefaultAllocator<Type> for types that should be created on the default heap.
/// Pass a custom ezRTTIAllocator type to handle allocation differently.
#define EZ_BEGIN_DYNAMIC_REFLECTED_TYPE(Type, BaseType, Version, AllocatorType) \
EZ_RTTIINFO_DECL(Type, BaseType, Version) \
ezRTTI Type::s_RTTI = ezRTTInfo_##Type::GetRTTI(); \
EZ_RTTIINFO_GETRTTI_IMPL_BEGIN(Type, AllocatorType)
/// \brief Ends the reflection code block that was opened with EZ_BEGIN_DYNAMIC_REFLECTED_TYPE.
#define EZ_END_DYNAMIC_REFLECTED_TYPE() \
return ezRTTI(GetTypeName(), \
ezGetStaticRTTI<OwnBaseType>(), \
sizeof(OwnType), \
GetTypeVersion(), \
ezVariant::TypeDeduction<ezReflectedClass*>::value, \
&Allocator, Properties, MessageHandlers); \
}
class ezArchiveWriter;
class ezArchiveReader;
/// \brief All classes that should be dynamically reflectable, need to be derived from this base class.
///
/// The only functionality that this class provides is the GetDynamicRTTI() function.
class EZ_FOUNDATION_DLL ezReflectedClass
{
EZ_ADD_DYNAMIC_REFLECTION(ezReflectedClass);
public:
EZ_FORCE_INLINE ezReflectedClass()
{
}
virtual ~ezReflectedClass() {}
/// \brief Returns whether the type of this instance is of the given type or derived from it.
EZ_FORCE_INLINE bool IsInstanceOf(const ezRTTI* pType) const
{
return GetDynamicRTTI()->IsDerivedFrom(pType);
}
/// \brief Returns whether the type of this instance is of the given type or derived from it.
template<typename T>
EZ_FORCE_INLINE bool IsInstanceOf() const
{
return GetDynamicRTTI()->IsDerivedFrom<T>();
}
/// \brief This function is called to serialize the instance.
///
/// It should be overridden by deriving classes. In general each overridden version should always call the
/// function of the base class. Only classes directly derived from ezReflectedClass must not do this, due to the assert in the
/// base implementation.
virtual void Serialize(ezArchiveWriter& stream) const
{
EZ_REPORT_FAILURE("Serialize is not overridden by deriving class.");
}
/// \brief This function is called to deserialize the instance.
///
/// During deserialization only data should be read from the stream. References to other objects will not be valid,
/// thus no setup should take place. Leave this to the OnDeserialized() function.
///
/// It should be overridden by deriving classes. In general each overridden version should always call the
/// function of the base class. Only classes directly derived from ezReflectedClass must not do this, due to the assert in the
/// base implementation.
virtual void Deserialize(ezArchiveReader& stream)
{
EZ_REPORT_FAILURE("Deserialize is not overridden by deriving class.");
}
/// \brief This function is called after all objects are deserialized and thus all references to other objects are valid.
///
/// This functions should do any object setup that might depend on other objects being available.
///
/// It should be overridden by deriving classes. In general each overridden version should always call the
/// function of the base class. Only classes directly derived from ezReflectedClass must not do this, due to the assert in the
/// base implementation.
virtual void OnDeserialized()
{
EZ_REPORT_FAILURE("OnDeserialized is not overridden by deriving class.");
}
};
| [
"mjmaier@gmx.de"
] | mjmaier@gmx.de |
6929ab2ce015d8087bd1e6a8b18d15dd25dcdb5f | fac8de123987842827a68da1b580f1361926ab67 | /inc/physics/Physics/Collide/Query/Collector/PointCollector/hkpSimpleClosestContactCollector.inl | e5b9288656aa310cae9ee885add001b95c22fb69 | [] | no_license | blockspacer/transporter-game | 23496e1651b3c19f6727712a5652f8e49c45c076 | 083ae2ee48fcab2c7d8a68670a71be4d09954428 | refs/heads/master | 2021-05-31T04:06:07.101459 | 2009-02-19T20:59:59 | 2009-02-19T20:59:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,687 | inl | /*
*
* Confidential Information of Telekinesys Research Limited (t/a Havok). Not for disclosure or distribution without Havok's
* prior written consent.This software contains code, techniques and know-how which is confidential and proprietary to Havok.
* Level 2 and Level 3 source code contains trade secrets of Havok. Havok Software (C) Copyright 1999-2008 Telekinesys Research Limited t/a Havok. All Rights Reserved. Use of this software is subject to the terms of an end user license agreement.
*
*/
void hkpSimpleClosestContactCollector::reset()
{
m_hasHit = false;
m_hitPoint.setDistance( HK_REAL_MAX );
hkpCdPointCollector::reset();
}
hkpSimpleClosestContactCollector::hkpSimpleClosestContactCollector()
{
reset();
}
hkpSimpleClosestContactCollector::~hkpSimpleClosestContactCollector()
{
}
hkBool hkpSimpleClosestContactCollector::hasHit( ) const
{
return m_hasHit;
}
const hkContactPoint& hkpSimpleClosestContactCollector::getHitContact() const
{
return m_hitPoint;
}
/*
* Havok SDK - NO SOURCE PC DOWNLOAD, BUILD(#20080529)
*
* Confidential Information of Havok. (C) Copyright 1999-2008
* Telekinesys Research Limited t/a Havok. All Rights Reserved. The Havok
* Logo, and the Havok buzzsaw logo are trademarks of Havok. Title, ownership
* rights, and intellectual property rights in the Havok software remain in
* Havok and/or its suppliers.
*
* Use of this software for evaluation purposes is subject to and indicates
* acceptance of the End User licence Agreement for this product. A copy of
* the license is included with this software and is also available at
* www.havok.com/tryhavok
*
*/
| [
"uraymeiviar@bb790a93-564d-0410-8b31-212e73dc95e4"
] | uraymeiviar@bb790a93-564d-0410-8b31-212e73dc95e4 |
5bbd75b1c33c400e855b55eb63daf0ee6d213cfc | 753839345d394de155ce5d78877049f6bf16ce6f | /1232.缀点成线.cpp | 6978cfb81ca484408e3293cbdf224dc4af1ad837 | [] | no_license | WonderfulUnknown/LeetCode | 2df5a68b855f84787cee8fa5e553e70e9f62512d | c392622e567bf5551a92d7fc47d4477000b4d7ee | refs/heads/master | 2021-01-02T05:50:59.457795 | 2020-03-18T09:47:15 | 2020-03-18T09:47:15 | 239,516,921 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 488 | cpp | /*
* @lc app=leetcode.cn id=1232 lang=cpp
*
* [1232] 缀点成线
*/
// @lc code=start
class Solution {
public:
bool checkStraightLine(vector<vector<int>>& coordinates) {
for (int i = 2; i < coordinates.size(); i++)
{
if ((coordinates[i][1] - coordinates[0][1]) * (coordinates[1][0] - coordinates[0][0]) !=
(coordinates[1][1] - coordinates[0][1]) * (coordinates[i][0] - coordinates[0][0]))
return false;
}
return true;
}
};
// @lc code=end
| [
"389038968@qq.com"
] | 389038968@qq.com |
875617ff7308448ea385dfad87a03b000e07797d | e4ef4a361bfe540ffcbcc8029e9ac28f0d014339 | /dune/Hydrate-DG/Ex2/properties/H2O.hh | 95c5db1d500f094c911b2a19f24e96e960b94911 | [] | no_license | apminaei/Hydrate-DG | 48472f0e821a9c7757c7dc6dccdd57d25f7ef44e | 4b24626bc53ab92d32f4855d722f777d9f63adc4 | refs/heads/master | 2023-04-14T23:21:11.431945 | 2022-09-12T07:30:24 | 2022-09-12T07:30:24 | 309,623,539 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,211 | hh | /* ALL PARAMETERS ARE NONDIMENSIONAL */
template <typename PTree>
class Water
{
private:
CharacteristicValues characteristicValue;
const PTree &ptree;
Parameters<PTree> parameter;
public:
Water(const PTree &ptree_)
: ptree(ptree_),
parameter(ptree_)
{
}
double CriticalTemperature() const
{
return 647.096; /* [K] */
}
double CriticalPressure() const
{
return 22.064 * 1.0e6; /* [Pa] */
}
double MolarMass() const
{
/* unit -> kg/mol */
return 18.0 / 1000.;
}
double Density(double T, double Pw, double S) const
{
double rho;
/* rho: unit -> kg/m^3 */
/*
* averages values & expansion coefficients: ρ0=1027 kg/m^3, T0=10°C, S_0=35 g/kg
* Thermal expansion: \alpha_T=0.15 kg/(m^3 °C)
* Salinity contraction: \alpha_S=0.78 kg/(m^3 g/kg)
* Pressure compressibility: \alpha_P=0.0045 kg/(m^3 dbar)
* UNESCO EOS-80 : Equation of state for seawater
* We use a linear EOS (web ref:http://www.ccpo.odu.edu/~atkinson/OEAS405/Chapter2_Stratified_Ocean/Lec_04_DensityEOS.pdf)
*/
double rho_0 = 1027.0;
double T_0 = 10.;
double S_0 = 0.035;
double alpha_T = -0.15;
double alpha_S = 0.96706917808 * 1e2; // 0.78*1e3;//108.524;//
double alpha_P = 0.0045;
rho = rho_0 + (alpha_P * (Pw * 1.e-4) + alpha_T * ((T - 273.15) - T_0) + alpha_S * (S - S_0));
return rho / characteristicValue.density_c;
}
double MolarDensity(double T, double Pw, double S) const
{
return Density(T, Pw, S) * characteristicValue.density_c / MolarMass();
}
double DynamicViscosity(double T, double Pw, double S) const
{
double mu;
/* mu: unit -> Pa.s */
// REFERENCE:
double mu_0 = 0.001792; // kg/m/s
double a = -1.94;
double b = -4.80;
double c = 6.74;
double T0 = 273.15; // K
double Tr = T0 / T;
mu = mu_0 * exp(a + b * Tr + c * Tr * Tr);
return mu / characteristicValue.viscosity_c;
}
double ThermalConductivity(double T, double Pw, double S) const
{
double kth;
/* kth: unit -> W.m^-1 K^-1 */
kth = 0.57153 * (1 + 0.003 * (T - 273.15) - 1.025e-5 * (T - 273.15) * (T - 273.15) + 6.53e-10 * Pw - 0.29 * S); // 0.024565
return kth / characteristicValue.thermalconductivity_c;
}
double Cp(double T, double Pw, double S) const
{
double Cp;
/* Cp: unit -> J*kg^-1*K^-1 */
Cp = 3945.0;
return Cp / characteristicValue.specificheat_c;
}
double Cv(double T, double Pw, double S) const
{
double Cv;
/* mu: unit -> J*kg^-1*K^-1 */
Cv = Cp(T, Pw, S) * characteristicValue.specificheat_c;
return Cv / characteristicValue.volumetricheat_c;
}
double SaturatedVaporPressure(double T /*K*/, double S) const
{
double psat; /* [Pa] */
// REF: SUGAR TOOLBOX
double Pc = CriticalPressure(); // in Pa
double Tc = CriticalTemperature(); // in K
double Tr = T / Tc;
double c1 = -7.85951783;
double c2 = 1.84408259;
double c3 = -11.7866497;
double c4 = 22.6807411;
double c5 = -15.9618719;
double c6 = 1.80122502;
double lnppc = 1. / Tr * (c1 * (1 - Tr) + c2 * pow((1 - Tr), 1.5) + c3 * pow((1 - Tr), 3) + c4 * pow((1 - Tr), 3.5) + c5 * pow((1 - Tr), 4) + c6 * pow((1 - Tr), 7.5));
psat = Pc * exp(lnppc); /* [Pa] */
return psat / characteristicValue.P_c;
}
};
| [
"apminaei@gmail.com"
] | apminaei@gmail.com |
b09edcbaeaf0a59373496aaec687137164f77fcf | 6fe92277300b88d199a3cefc0f7de4a05fe91296 | /Set_Graph.h | 44bc2053443b4796db97118be5ea286dae1a61be | [] | no_license | FrankTrek/OOP- | 59c190b7d765bf096dc10c433302b727d33cf17f | b96438e1fb18788b6eaa77019f99192550f50475 | refs/heads/master | 2020-05-05T11:04:09.079524 | 2019-06-22T18:00:35 | 2019-06-22T18:00:35 | 179,973,530 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,053 | h |
/*
*4.13补充极小量eps
*4.20 I.PVC()实现
*4.20 processing Stage3 加入Reset
*4.20 加入 最终节点res 的记录
*4.23 修改Compute 使计算错误的点不输出
*/
#ifndef Set_Graph_h
#define Set_Graph_h
#include "Node.h"
#include <map>
#include <iomanip>
#include "Const.h"
#include "Operation.h"
#include "Operation2.h"
namespace Computational_Graph{
using std::cin;
class Set_Graph{
typedef Graph_Node<float> GNode;
std::map<string , int > map_for_name;
std::map<int, GNode> graph; //图
std::vector<string> info; //处理的信息
std::vector<float> Answer; //输出的信息
public:
int num=0;
Set_Graph() {}
/*
Set_Graph(std::vector<string> && a) //直接传入信息的构造函数
{
info = std::move(a);
}
void Input_info(std::vector<string> &&a) //传入信息
{
info = std::move(a);
}
*/
vector<string> incision() //对每一次字符串进行切割
{
vector<string> info;
string sentence;
std::getline(cin,sentence); //读一整行
std::stringstream s1(sentence); //建立string流
string temp; //存放每一次输入
while(s1>>temp)
{
if(temp!="=") info.push_back(temp); //压入vector(不存入=)
}
return info;
}
void processing_Stage3(); //对输入字符串的处理
template <class A>
void Jianli_1(const string& obj, const string& p1)
{
auto pt1 = map_for_name.find(p1);
if (pt1 == map_for_name.end()) //参数未定义
{
std::cerr<<"False Parameter defination\n";
}
else
{
graph[num].Mode = Operator; //注明类型
graph[num].Nodename = obj; //注明名称
graph[num].node = std::make_shared<A>(obj,graph[map_for_name[p1]].node); //建立节点
map_for_name[obj]=num; //更新对应关系
num++; //第num个节点建立完毕，num++
}
}
template <class A>
void Jianli_2(const string& obj, const string& p1, const string& p2)
{
auto pt1 = map_for_name.find(p1);
auto pt2 = map_for_name.find(p2);
if (pt2==map_for_name.end()||pt1 == map_for_name.end()) //参数未定义
{
std::cerr<<"False Parameter defination\n";
}
else
{
graph[num].Mode = Operator;
graph[num].Nodename = obj;
graph[num].node = std::make_shared<A>(obj,graph[map_for_name[p1]].node, graph[map_for_name[p2]].node);//建立节点
map_for_name[obj]=num; //更新对应关系
num++; //第num个节点建立完毕，num++
}
}
template <class A>
void Jianli_3(const string& obj, const string& p1, const string& p2,const string & p3)
{
//auto x = graph.find(obj);
auto pt1 = map_for_name.find(p1);
auto pt2 = map_for_name.find(p2);
auto pt3 = map_for_name.find(p3);
if (pt3==map_for_name.end()||pt2==map_for_name.end()||pt1 == map_for_name.end())
{
std::cerr<<"False Parameter defination\n";
}
else
{
graph[num].Mode = Operator;
graph[num].Nodename = obj;
graph[num].node = std::make_shared<A>(obj,graph[map_for_name[p1]].node, graph[map_for_name[p2]].node,graph[map_for_name[p3]].node);
map_for_name[obj]=num; //更新对应关系
num++; //第num个节点建立完毕，num++
}
}
void Compute(const string& a) //对于表达式进行计算
{
float b = graph[map_for_name[a]].node->Forward();
// cout.setf(std::ios_base::showpoint);
Answer.push_back(b);
if((b!=Minus_Max)) cout<<std::fixed<<std::setprecision(4)<<b<<std::endl;
}
void SetAnswer(const string& name, int n) //对Variable进行seranswer操作
{
if(Answer[n]<=Minus_Max+eps) std::cerr<<"Invalid Operation\n";
else if(graph[map_for_name[name]].Mode== Varible) graph[map_for_name[name]].node->Initalize(Answer[n]);
else std::cerr<<"Set_answer option only for Varible\n"; //如果不为Varible则报错
}
void Initalize_PVC(); //
void Initalize_Op(); //
void Initalize_Ph(const string& name); //对于Ph(n名字为name)进行初始化；
void Initalize_V(const string& name, float num); //对于V(n名字为name)进行初始化；
void Initalize_C(const string& name, float num); //对于C(n名字为name)进行初始化；
void Initalize_Input(const string& name, float num) //在第三阶段对于输入进行初始化;
{
if(graph[map_for_name[name]].Mode==Placehold)
graph[map_for_name[name]].node->Initalize(num);
else std::cerr<<"Invalid Operation\n";
}
void Stage1() //第一阶段的处理
{
string tmp;
getline(cin,tmp);
int times = std::stoi(tmp); //记录输入的次数
for(int i = 1; i<=times; i++) //进行第i次操作
{
info = incision(); //得到信息
Initalize_PVC(); //进行处理
}
}
void Stage2()
{
string tmp;
getline(cin,tmp);
int times = std::stoi(tmp); //记录输入的次数
for(int i = 1; i<=times; i++) //进行第i次操作
{
info = incision(); //得到信息
Initalize_Op(); //进行处理
}
}
void Stage3()
{
string tmp;
getline(cin,tmp);
int times = std::stoi(tmp); //记录输入的次数
for(int i = 1; i<=times; i++) //进行第i次操作
{
info = incision(); //得到信息
processing_Stage3(); //进行处理
}
}
};
}
#endif /* Set_Graph_h */
| [
"noreply@github.com"
] | FrankTrek.noreply@github.com |
8dae459296f8eabbb9724408ebb41b26134d9808 | 2ade54db80e23ab0acd59679e7c43fd08eb29170 | /AOCday7p2.cpp | 3cb408ed848e32fc1ca470466db9963f2c8a502a | [] | no_license | miguelraffoul/AdventOfCode17 | 5a0df1128525d9f68764bfba3e69b609fe145148 | 9ee6d81c78c74f97d3f4f3dd9e158f7e5ba58905 | refs/heads/master | 2020-03-31T19:33:12.884114 | 2019-01-09T00:35:37 | 2019-01-09T00:35:37 | 152,502,379 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,654 | cpp | #include <cstdlib>
#include <iostream>
#include <string>
#include <sstream>
#include <unordered_map>
#include <vector>
using namespace std;
struct Program {
string parent;
string name;
int weight;
vector<string> sub_programs;
};
vector<string> split( string& );
struct Program createProgram( const vector<string>& );
void constructTree( vector<struct Program>&, unordered_map<string, int>& );
int traverseTree( const string&, vector<struct Program>&, unordered_map<string, int>& );
int main( void ) {
vector<struct Program> program_list;
unordered_map<string, int> program_idex;
string input, root;
int index = 0;
while( getline( cin, input ) ) {
struct Program new_program = createProgram( split( input ) );
program_list.push_back( new_program );
program_idex.insert( make_pair<string, int>( new_program.name, index ) );
++index;
}
constructTree( program_list, program_idex );
for( unsigned int i = 0; i < program_list.size(); ++i ){
if( program_list[i].parent == "*" ) {
cout << program_list[i].name << endl;
root = program_list[i].name;
}
}
cout << "Total tree weight: " << traverseTree( root, program_list, program_idex) << endl;
return EXIT_SUCCESS;
}
vector<string> split( string& input ) {
for( unsigned int i = 0; i < input.size(); ++i ) {
if( input[i] == '(' || input[i] == ')' ||
input[i] == '-' || input[i] == '>' ||
input[i] == ',' ) {
input[i] = ' ';
}
}
istringstream iss( input );
vector<string> list;
string tmp;
while( iss >> tmp ) {
list.push_back( tmp );
}
return list;
}
struct Program createProgram( const vector<string>& list ) {
struct Program new_program;
new_program.parent = "*";
new_program.name = list[0];
new_program.weight = stoi( list[1] );
if( list.size() > 2 )
new_program.sub_programs.insert(
new_program.sub_programs.begin(),
list.begin() + 2,
list.end()
);
return new_program;
}
void constructTree( vector<struct Program>& program_list,
unordered_map<string, int>& program_idex ) {
for( unsigned int i = 0; i < program_list.size(); ++i ) {
for( unsigned int j = 0; j < program_list[i].sub_programs.size(); ++j ) {
int child_index = program_idex[program_list[i].sub_programs[j]];
program_list[child_index].parent = program_list[i].name;
}
}
}
int traverseTree( const string& name, vector<struct Program>& program_list,
unordered_map<string, int>& program_idex ) {
struct Program curr_program = program_list[program_idex[name]];
vector<int> sub_programs_weight;
int cummulative_wight, tmp;
cummulative_wight = 0;
for( unsigned int i = 0; i < curr_program.sub_programs.size(); ++i ) {
tmp = traverseTree( curr_program.sub_programs[i], program_list, program_idex );
if( i > 0 && sub_programs_weight.back() != tmp ) {
cout << "*****Weight difference found*****" << endl;
cout << "Current program: " << name << endl;
cout << "Weight in previous sub program (" << curr_program.sub_programs[i - 1];
cout << "): " << sub_programs_weight.back() << endl;
cout << "Weight in current sub program: (" << curr_program.sub_programs[i];
cout << "): " << tmp << endl;
}
cummulative_wight += tmp;
sub_programs_weight.push_back( tmp );
}
return cummulative_wight + curr_program.weight;
} | [
"oracle@bigdatalite.localdomain"
] | oracle@bigdatalite.localdomain |
c92e08276f118a7785a3258016932b93ef2ca6fd | 93c433ce85bde07817195df220c5f40dac4cde61 | /Game Engine/Game Engine/Header Files/Objects/oGeometry.h | fc6f390d45f35e0b6ff5c7396f70e0cbb02c75f9 | [] | no_license | JARD-GAMES/Engine_Project | 4894305e1a2bad3063d1ab0339b3f2d4fe687e1e | 76f32a46209172e1b368ae0292f718c6b7134dd1 | refs/heads/master | 2020-03-19T11:33:41.431686 | 2018-07-02T16:40:09 | 2018-07-02T16:40:09 | 136,461,566 | 0 | 3 | null | 2018-09-17T12:28:30 | 2018-06-07T10:31:59 | C | UTF-8 | C++ | false | false | 141 | h | #ifndef GEOMETRYOBJECT
#define GEOMETRYOBJECT
class oGeometry
{
private:
public:
oGeometry();
~oGeometry();
};
#endif // GEOMETRYOBJECT | [
"Jake.Scrivener55@gmail.com"
] | Jake.Scrivener55@gmail.com |
1a89b6b4760fae6c0d363632a0058cbdac441b13 | 91a286855887229c2603a049841ec1cb23a7495f | /getComment.cpp | 7fac168980bad961ce58f6336061c4c4414af1b4 | [] | no_license | iourigouz/LHCbCALOtb | e2c89d0c4d4228a225382035f81ca77e185f6e06 | cc00acfd9acf7bbc46c2686db3aabc861c577c58 | refs/heads/master | 2021-06-22T20:15:26.509656 | 2021-05-11T17:29:49 | 2021-05-11T17:29:49 | 213,742,670 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,112 | cpp | //
// Author: Ilka Antcheva 1/12/2006
// This macro gives an example of how to create a status bar
// related to an embedded canvas that shows the info of the selected object
// exactly as the status bar of any canvas window
// To run it do either:
// .x statusBar.C
// .x statusBar.C++
#include <math.h>
#include <iostream>
#include <map>
#include "TROOT.h"
#include "TSystem.h"
#include "TApplication.h"
#include "TGClient.h"
#include "TClass.h"
#include "TString.h"
#include "getComment.h"
ClassImp(getComment)
#define TOTWID 500
#define TOTHGT 500
getComment::getComment(const TGWindow *main, char* answer, char* comment)
{
Answer=answer;
Comment=comment;
fMain = new TGTransientFrame(gClient->GetRoot(), main, TOTWID, TOTHGT);
fMain->Connect("CloseWindow()", "getComment", this, "CloseWindow()");
fMain->DontCallClose(); // to avoid double deletions.
// use hierarchical cleaning
fMain->SetCleanup(kDeepCleanup);
TGHorizontalFrame *hframCom = new TGHorizontalFrame(fMain, TOTWID, 40);
TGLabel *tCom=new TGLabel(hframCom,"Enter a comment:");
hframCom->AddFrame(tCom, new TGLayoutHints(kLHintsLeft, 5, 1, 3, 4));
fMain->AddFrame(hframCom,new TGLayoutHints(kLHintsLeft, 5, 1, 3, 4));
fEdit = new TGTextEdit(fMain, TOTWID, 300, kSunkenFrame | kDoubleBorder);
fMain->AddFrame(fEdit, new TGLayoutHints(kLHintsExpandX | kLHintsExpandY, 3, 3, 3, 3));
fEdit->Connect("Closed()", "getComment", this, "DoCANCEL()");
// Create a horizontal frame for OK and CANCEL buttons
TGHorizontalFrame *hframButt = new TGHorizontalFrame(fMain, TOTWID, 50);
fOK = new TGTextButton(hframButt, " &OK ");
//fOK->SetToolTipText("YES, PLEASE add the comment to the logbook",200);
fOK->Connect("Released()", "getComment", this, "DoOK()");
hframButt->AddFrame(fOK, new TGLayoutHints(kLHintsLeft, 5, 1, 3, 4));
fCANCEL = new TGTextButton(hframButt, " &CANCEL ");
//fCANCEL->SetToolTipText("NO, DO NOT add the comment to the logbook",200);
fCANCEL->Connect("Released()", "getComment", this, "DoCANCEL()");
hframButt->AddFrame(fCANCEL, new TGLayoutHints(kLHintsLeft, 5, 1, 3, 4));
fMain->AddFrame(hframButt,new TGLayoutHints(kLHintsLeft, 5, 1, 3, 4));
SetTitle();
fMain->MapSubwindows();
fMain->Resize();
// editor covers right half of parent window
fMain->CenterOnParent(kTRUE, TGTransientFrame::kRight);
}
getComment::~getComment()
{
// Delete editor dialog.
fMain->DeleteWindow(); // deletes fMain
}
void getComment::Popup()
{
fMain->MapWindow();
gClient->WaitFor(fMain);
}
void getComment::SetTitle()
{
fMain->SetWindowName("getComment");
fMain->SetIconName("getComment");
}
void getComment::CloseWindow()
{
// Called when closed via window manager action.
delete this;
}
void getComment::DoOK()
{
// Handle ok button.
strcpy(Answer,"OK");
TString tstrcomm=(fEdit->GetText()->AsString());
const char* txtcomm=(const char*)tstrcomm;
strncpy(Comment, txtcomm, 10000); Comment[10000]=0;
CloseWindow();
}
void getComment::DoCANCEL()
{
// Handle ok button.
strcpy(Answer,"CANCEL");
CloseWindow();
}
| [
"yuri@pclbectb01.dyndns.cern.ch"
] | yuri@pclbectb01.dyndns.cern.ch |
48771d1cb98bb166f8930fe1efa78cbefa2255f7 | 41f5ce839be6d4c247bce5d5b5d687ad3bf60c45 | /C++ Programs/Timer.cpp | 6a156b50c94e37d6478636476e95bd4538f59c71 | [] | no_license | himanshusanecha/One-day-Before-Interview | 269bd617fdc71419460f7f487d66d7bb19f40ec6 | bf1dc77c009ae9ddf1920dde4f684248c54559ac | refs/heads/master | 2023-08-24T08:58:01.572847 | 2021-10-24T20:45:42 | 2021-10-24T20:45:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,476 | cpp | #include <iostream>
#include <utility>
#include <vector>
#include <numeric>
#include <queue>
#include <cmath>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <list>
#include <stack>
#define ll long long
#define dd double
#include <stack>
#include <chrono>
#include <thread>
using namespace std;
struct Timer{
chrono::time_point<chrono::system_clock> start,end;
chrono::duration<float> duration;
Timer(){
start = chrono::system_clock::now();
}
~Timer(){
end = chrono::system_clock::now();;
duration = end - start;
float ms = duration.count() * 1000.0f;
cout<<"\nFunction took: "<<ms<<"ms"<<endl;
}
};
void sorted(){
Timer timer;
vector<int> x={1,1,32,1,532,723,19,131,13223,15};
vector<int> sorted;
while(!x.empty()){
auto mine=min_element(x.begin(), x.end());
sorted.push_back(*mine);
x.erase(mine);
}
for(auto t: sorted){
cout<<t<<" ";
}
}
int main(){
sorted();
}
//int main()
//{
//
// std::chrono::time_point<std::chrono::system_clock> start, end;
//
// start = std::chrono::system_clock::now();
// sorted();
// end = std::chrono::system_clock::now();
//
// std::chrono::duration<double> elapsed_seconds = end - start;
//
// std::cout<< "\nElapsed time: " << elapsed_seconds.count() << "s\n";
//} | [
"iamvikrant1@gmail.com"
] | iamvikrant1@gmail.com |
f16342e0abd8c350091f0175c2fc472baa735b57 | bafae1c46014f4069fda40735b7a305616707c9b | /SaturdayNightEngine/NR_StepperBase.h | 2b7ab4ca9303cac9514e95b77e70fdb09621b06c | [] | no_license | Glimster/PhysicsAndGames | b9bd212436b8226617ecfde870640a30a96bd42e | 2bcbc9085889167c11b1adf89132f371cf65e898 | refs/heads/master | 2021-01-20T11:45:40.528735 | 2017-11-01T09:53:18 | 2017-11-01T09:53:18 | 101,686,173 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 697 | h | // More or less a copy of the Numerical Recipes ODE solver
#pragma once
#include< vector >
class NR_StepperBase
{
public:
NR_StepperBase( std::vector< double >& y,
std::vector< double >& dydx,
double& x,
const double absoluteTolerance,
const double relativeTolerance,
bool dense );
template<class T>
inline T SQR( const T a ) { return a*a; }
public:
double& x_;
double xOld_;
std::vector< double >& y_;
std::vector< double >& dydx_;
double absoluteTolerance_, relativeTolerance_;
bool dense_;
double hdid_;
double hnext_;
int n_, neqn_;
std::vector< double > yout_, yerr_;
};
| [
"Hemulen@DESKTOP-3ISETHD"
] | Hemulen@DESKTOP-3ISETHD |
323c0ba63bba6065b8a05108ab0f5952279529d0 | d8c56ab76e74824ecff46e2508db490e35ad6076 | /ZETLAB/ZETTools/ZETModbus/IZETModbus.h | 9ca453c798b4c69f869dbc2cc536a6bf875496f3 | [] | no_license | KqSMea8/UtilsDir | b717116d9112ec9f6ee41f4882ad3f52ebb2e84b | 14720766a2a60368495681d09676f860ea501df2 | refs/heads/master | 2020-04-25T17:21:39.538945 | 2019-02-27T14:36:32 | 2019-02-27T14:36:32 | null | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 2,342 | h | #pragma once
#include <objbase.h>
#define MAX_PDU_SIZE 253 //Максимальный размер пакета Modbus (PDU) в байтах
#define MIN_PDU_SIZE 1 //Минимальный размер пакета Modbus (PDU) в байтах
#define MAX_ADU_SIZE (MAX_PDU_SIZE + 3) //Максимальный размер пакета Modbus (ADU) в байтах
//Ошибки, возвращаемые в ответе устройством
#define MODBUS_ERR_UNKNOWN_ADDR 0x02 //Указан неизвестный адрес при доступе к регистрам устройства
#define MODBUS_ERR_DEV_BUSY 0x06 //Устройство в настоящий момент занято
interface IZETModbus
{
virtual BYTE ReadCoilStatus(BYTE dev_addr, WORD addr, WORD* pBuff, unsigned int flags_num) = 0; //Получить значения нескольких регистров флагов
virtual BYTE ReadDiscreteInputs(BYTE dev_addr, WORD addr, WORD* pBuff, unsigned int inputs_num) = 0; //Получить значения нескольких дискретных входов
virtual BYTE ReadHoldingRegisters(BYTE dev_addr, WORD addr, WORD* pBuff, unsigned int& regs_num) = 0; //Получить значения нескольких регистров хранения
virtual BYTE ReadInputRegisters(BYTE dev_addr, WORD addr, WORD* pBuff, unsigned int& regs_num) = 0; //Получить значения нескольких регистров ввода
virtual BYTE ForceSingleCoil(BYTE dev_addr, WORD addr, bool value) = 0; //Записать значение в регистр флага
virtual BYTE PresetSingleRegister(BYTE dev_addr, WORD addr, WORD value) = 0; //Записать значение в регистр ввода
virtual BYTE ForceMultipleCoils(BYTE dev_addr, WORD addr, WORD* pBuff, unsigned int flags_num) = 0; //Записать данные в несколько регистров флагов
virtual BYTE PresetMultipleRegisters(BYTE dev_addr, WORD addr, WORD* pBuff, unsigned int ®s_num) = 0;//Записать данные в несколько регистров ввода
};
#include <Exception/Exception.h>
class ModbusException : public Exception
{
public:
ModbusException(unsigned int err) : Exception(err) {};
}; | [
"s-kacnep@ya.ru"
] | s-kacnep@ya.ru |
21c13b03c6130933e5087ad75a2d954b75923158 | 21553f6afd6b81ae8403549467230cdc378f32c9 | /arm/cortex/Freescale/MK22F12810/include/arch/reg/mcm.hpp | ae9383ab204a2801d0f84221f5157c9f46428bb8 | [] | no_license | digint/openmptl-reg-arm-cortex | 3246b68dcb60d4f7c95a46423563cab68cb02b5e | 88e105766edc9299348ccc8d2ff7a9c34cddacd3 | refs/heads/master | 2021-07-18T19:56:42.569685 | 2017-10-26T11:11:35 | 2017-10-26T11:11:35 | 108,407,162 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,229 | hpp | /*
* OpenMPTL - C++ Microprocessor Template Library
*
* This program is a derivative representation of a CMSIS System View
* Description (SVD) file, and is subject to the corresponding license
* (see "Freescale CMSIS-SVD License Agreement.pdf" in the parent directory).
*
* 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.
*/
////////////////////////////////////////////////////////////////////////
//
// Import from CMSIS-SVD: "Freescale/MK22F12810.svd"
//
// vendor: Freescale Semiconductor, Inc.
// vendorID: Freescale
// name: MK22F12810
// series: Kinetis_K
// version: 1.6
// description: MK22F12810 Freescale Microcontroller
// --------------------------------------------------------------------
//
// C++ Header file, containing architecture specific register
// declarations for use in OpenMPTL. It has been converted directly
// from a CMSIS-SVD file.
//
// https://digint.ch/openmptl
// https://github.com/posborne/cmsis-svd
//
#ifndef ARCH_REG_MCM_HPP_INCLUDED
#define ARCH_REG_MCM_HPP_INCLUDED
#warning "using untested register declarations"
#include <register.hpp>
namespace mptl {
/**
* Core Platform Miscellaneous Control Module
*/
struct MCM
{
static constexpr reg_addr_t base_addr = 0xe0080000;
/**
* Crossbar Switch (AXBS) Slave Configuration
*/
struct PLASC
: public reg< uint16_t, base_addr + 0x8, ro, 0xF >
{
using type = reg< uint16_t, base_addr + 0x8, ro, 0xF >;
using ASC = regbits< type, 0, 8 >; /**< Each bit in the ASC field indicates whether there is a corresponding connection to the crossbar switch's slave input port. */
};
/**
* Crossbar Switch (AXBS) Master Configuration
*/
struct PLAMC
: public reg< uint16_t, base_addr + 0xa, ro, 0x17 >
{
using type = reg< uint16_t, base_addr + 0xa, ro, 0x17 >;
using AMC = regbits< type, 0, 8 >; /**< Each bit in the AMC field indicates whether there is a corresponding connection to the AXBS master input port. */
};
/**
* Crossbar Switch (AXBS) Control Register
*/
struct PLACR
: public reg< uint32_t, base_addr + 0xc, rw, 0 >
{
using type = reg< uint32_t, base_addr + 0xc, rw, 0 >;
using ARB = regbits< type, 9, 1 >; /**< Arbitration select */
};
/**
* Interrupt Status and Control Register
*/
struct ISCR
: public reg< uint32_t, base_addr + 0x10, rw, 0x20000 >
{
using type = reg< uint32_t, base_addr + 0x10, rw, 0x20000 >;
using FIOC = regbits< type, 8, 1 >; /**< FPU invalid operation interrupt status */
using FDZC = regbits< type, 9, 1 >; /**< FPU divide-by-zero interrupt status */
using FOFC = regbits< type, 10, 1 >; /**< FPU overflow interrupt status */
using FUFC = regbits< type, 11, 1 >; /**< FPU underflow interrupt status */
using FIXC = regbits< type, 12, 1 >; /**< FPU inexact interrupt status */
using FIDC = regbits< type, 15, 1 >; /**< FPU input denormal interrupt status */
using FIOCE = regbits< type, 24, 1 >; /**< FPU invalid operation interrupt enable */
using FDZCE = regbits< type, 25, 1 >; /**< FPU divide-by-zero interrupt enable */
using FOFCE = regbits< type, 26, 1 >; /**< FPU overflow interrupt enable */
using FUFCE = regbits< type, 27, 1 >; /**< FPU underflow interrupt enable */
using FIXCE = regbits< type, 28, 1 >; /**< FPU inexact interrupt enable */
using FIDCE = regbits< type, 31, 1 >; /**< FPU input denormal interrupt enable */
};
/**
* Compute Operation Control Register
*/
struct CPO
: public reg< uint32_t, base_addr + 0x40, rw, 0 >
{
using type = reg< uint32_t, base_addr + 0x40, rw, 0 >;
using CPOREQ = regbits< type, 0, 1 >; /**< Compute Operation request */
using CPOACK = regbits< type, 1, 1 >; /**< Compute Operation acknowledge */
using CPOWOI = regbits< type, 2, 1 >; /**< Compute Operation wakeup on interrupt */
};
};
} // namespace mptl
#endif // ARCH_REG_MCM_HPP_INCLUDED
| [
"axel@tty0.ch"
] | axel@tty0.ch |
71ab89c0b958fdb8badb1a3de401c327259958f2 | ea7777c7dcfa42d5b9d46871098f7e6eb68dd712 | /project 2/2. Simulation Module/Simulation Code/Simulation Module code/Path.h | aa83a1db313d8bdfd190c451e6b996b63ee361a7 | [] | no_license | cli402/CS6730-Project | 28187510bf4c5bcdf4eafa3ea3980f798d5f7e8e | 4574ea8f02973dee2a033cabe40441df0a69489c | refs/heads/master | 2021-01-10T13:07:24.023662 | 2016-02-24T22:25:03 | 2016-02-24T22:25:03 | 52,470,741 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 791 | h | #ifndef DISTANCE_H_INCLUDED
#define DISTANCE_H_INCLUDED
#include <vector>
#include <string>
#include <queue>
using namespace std;
static const int number=50;
class Dij{
public:
queue <int> shortestPath;
static const int numOfV = number;
int predecessor[numOfV], distance[numOfV];
int adjMatrix[number][number];
void trys(string);
int tree[numOfV][numOfV];
bool mark[numOfV];
int source;
int dest;
void initialize();
void calculateDistance();
void output();
void printPath(int);
int getClosestUnmarkedNode();
};
void Init_Graph(Dij*G);
queue<int> Shortest_Path(int, int , Dij&);
void Print_Path(queue<int> a);
void Clear_Path(queue<int> *a);
#endif // DISTANCE_H_INCLUDED
| [
"chengwei.li@careerbuilder.com"
] | chengwei.li@careerbuilder.com |
9a7796a82b6899abb220e6dc8e63f5214cab85d3 | d90cc5b23233e1a6f48bc2de2d8831370d953a9f | /HACKEDGame/Source/HACKED/InGame/Character/ESPER/HACKED_ESPER.h | e4b376d1204e0bc61a9a29eb7b007862eec708e2 | [] | no_license | LJH960101/JHNet_HACKED | d1389fd9303932eda57b9742d75fc82a5543035a | 13962fc4dc16ad4d852c09bec7a85be6a8b0f9a0 | refs/heads/main | 2023-06-15T00:43:43.398914 | 2021-07-04T08:22:38 | 2021-07-04T08:22:38 | 326,329,710 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 18,490 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "HACKED.h"
#include "InGame/Character/HACKEDCharacter.h"
#include "ESPER_StatComponent.h"
#include "InGame/Network/Component/NetworkBaseCP.h"
#include "HACKED_ESPER.generated.h"
UCLASS()
class HACKED_API AHACKED_ESPER : public AHACKEDCharacter
{
GENERATED_BODY()
public:
// Sets default values for this character's properties
AHACKED_ESPER();
virtual void Possessed(AController* NewController) override;
virtual void UnPossessed() override;
// Called every frame
virtual void Tick(float DeltaTime) override;
virtual void PostInitializeComponents() override;
// Called to bind functionality to input
virtual void SetupPlayerInputComponent(class UInputComponent* PlayerInputComponent) override;
UFUNCTION(BlueprintPure, Category = SkillSystem)
virtual int GetSkillRate(int skill);
UFUNCTION(BlueprintPure, Category = EsperPrimaryAttack)
bool GetOnPrimaryAttack() { return bOnPrimaryAttack; }
UFUNCTION(BlueprintImplementableEvent, Category = Aim)
void OnHitAim(bool IsCritical);
bool IsOnSelfHealing();
protected:
// Called when the game starts or when spawned
virtual void BeginPlay() override;
virtual float TakeDamage(float DamageAmount, struct FDamageEvent const& DamageEvent, AController* EventInstigator, AActor* DamageCauser) override;
public:
void InitEsperStat();
UPROPERTY(VisibleAnywhere, Category = Stat)
class UESPER_StatComponent* Esper_Stat;
public:
UFUNCTION(BlueprintImplementableEvent, Category = Sound)
void PlaySkill1Sound(FVector location);
UFUNCTION(BlueprintImplementableEvent, Category = Sound)
void PlaySkill2Sound(FVector location);
private:
//------------지스타 출품 및 스팀 출시 위한 최종 에스퍼 수치 데이터 테이블 적용을 위한 함수입니다. ----------------//
FHACKED_ESPER_Stat esperStat;
float GetMaxHp();
float GetprimaryAttackDamage();
float GetPASPDamage();
float GetPASPRange();
float GetPASpeed();
float GetPsychicForceDamage();
float GetPsychicForceRange();
float GetPsychicDropDamage();
float GetPsychicDropRange();
float GetPsychicWaveDamage();
float GetPsychicWaveRange();
// Aim 위젯을 없앱니다.
// 게임오버에서 사용합니다.
void DisableAimWidget();
// 모든 스킬은 BindAction에 할당된 스킬 고유의 네이밍의 함수에서 시작됩니다. (SetupPlayerInputComponent 참고)
// 모든 스킬은 헤더에 나열된 순서대로 호출되어 사용됩니다.
private:
//------------ Link Beam ------------//
public:
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = LinkBeam, Meta = (AllowPrivateAccess = true))
class UParticleSystemComponent* PC_LinkBeam = nullptr;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = VitalityShield, Meta = (AllowPrivateAccess = true))
class UParticleSystem* PS_LinkBeam;
public:
RPC_FUNCTION(AHACKED_ESPER, EsperIntroSkipStart)
UFUNCTION()
void EsperIntroSkipStart();
UFUNCTION()
void EsperIntroSkip();
RPC_FUNCTION(AHACKED_ESPER, EsperIntroSkipStop)
UFUNCTION()
void EsperIntroSkipStop();
UFUNCTION(BlueprintImplementableEvent)
void EsperTurnOffSkipUI();
private:
//------------ Esper Primary Attack ------------//
RPC_FUNCTION(AHACKED_ESPER, Esper_Attack)
void Esper_Attack();
RPC_FUNCTION(AHACKED_ESPER, Esper_AttackEnd)
void Esper_AttackEnd();
bool bOnPrimaryAttack; // 공격중인지를 알아내는 변수입니다.
// 공격을 발동합니다.
UFUNCTION()
void OnAttackCheck();
//------------ Skill(1). Psychic Force ------------//
// 스킬 설명 : 에스퍼 주변의 적을 염동력으로 강하게 밀어내며, 약간의 피해를 줍니다.
private:
RPC_FUNCTION(AHACKED_ESPER, PsychicForce)
UFUNCTION()
void PsychicForce(); // Psychic Force 스킬을 사용하기 위한 시작 함수입니다. <Delegate 호출>
UFUNCTION()
void PsychicForceDamaging(); // HACKED_AI에 만든 HACKEDLaunchCharacter함수를 통해 적을 밀어내며 피해를 주는 함수입니다. <Delegate 호출>
UFUNCTION()
void PsychicForceStun(); // 피해를 입은 AI에게 잠시동안 스턴을 넣어주는 함수입니다. <개별 호출>
UFUNCTION()
void OnPsychicForceEnd(); // 해당 스킬이 끝나 기본 State로 돌아가기 위한 엔드 함수입니다. <Delegate 호출>
TArray<class AHACKED_AI*> PsychicForceCheckAI;
public:
UFUNCTION()
void PsychicForceDamageChange(float plusDamage);
//------------ Skill(M). Psychic Drop ------------//
// 스킬 설명 : 에스퍼가 에이밍 상의 오브젝트에 에너지 구체를 붙인후 터뜨려 피해를 입히는 스킬입니다. (최대 사거리 15m)
private:
RPC_FUNCTION(AHACKED_ESPER, PsychicDrop)
UFUNCTION()
void PsychicDrop(); // Psychic Force 스킬을 사용하기 위한 시작 함수입니다.
UFUNCTION()
void PsychicDropSpawnEmitter(); // 플레이어가 지정한 목표에 이펙트를 소환하기 위한 함수 (해당 함수 뒤엔 AfterDamage를 위해 PsychicDropDamaging이 호출됩니다.)
RPC_FUNCTION(AHACKED_ESPER, RPCSpawnDropEmitter, FVector, FVector)
UFUNCTION()
void RPCSpawnDropEmitter(FVector targetPoint, FVector targetRotation);
UFUNCTION()
void OnPsychicDropDamaging(); // 생성된 이펙트에 범위 피해를 주기 위한 함수입니다.
UFUNCTION()
void OnPsychicDropEnd(); // 해당 스킬이 끝나 기본 State로 돌아가기 위한 엔드 함수입니다.
class AEsper_PsychicDrop* lastPhychicDrop;
UPROPERTY(VisibleAnywhere)
class UParticleSystem* PS_PsychicDropCharge;
public:
UFUNCTION()
void PsychicDropDamageChange(float plusDamage);
//------------ Skill(2). Psychic ShockWave ------------//
// 스킬 설명 : 에스퍼가 전방에 강력한 에너지빔을 발사합니다. 좌우 회전만으로 데미지를 입힐수 있습니다.
private:
RPC_FUNCTION(AHACKED_ESPER, PsychicShockWave)
UFUNCTION()
void PsychicShockWave(); // Psychic ShockWave 스킬을 사용하기 위한 시작 함수입니다.
UFUNCTION()
void ShockWaveSpawnEmitter(); // 싸이킥 쇼크웨이브 이펙트를 소환합니다.
UFUNCTION()
void ShockWaveDamagingStart(); // 싸이킥 쇼크 웨이브 데미징 스타트
UFUNCTION()
void ShockWaveDamaging(); // 전방의 복수의 적에게 도트 데미지를 입힙니다.
UFUNCTION()
void ShockWaveDamagingEnd(); // 싸이킥 쇼크웨이브 이펙트를 삭제하며, 데미징을 종료합니다.
UFUNCTION()
void ShockWaveSetTarget(); // Beam Data Type인 싸이킥 쇼크웨이브 이펙트의 방향을 맞춤과 동시에 이펙트와 캐릭터의 회전을 동기화합니다.
UFUNCTION()
void ShockWaveEnd(); // 해당 스킬이 끝나 기본 State로 돌아가기 위한 엔드 함수입니다.
UPROPERTY(VisibleAnywhere)
class UParticleSystemComponent* ShockWave = nullptr;
UPROPERTY(VisibleAnywhere)
class UParticleSystemComponent* ShockWaveHit = nullptr;
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Particle, Meta = (AllowPrivateAccess = "true"))
class UParticleSystem* PA_ShockWave;
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Particle, Meta = (AllowPrivateAccess = "true"))
class UParticleSystem* PA_ShockWaveHit;
public:
UFUNCTION()
void PsychicShockWaveDamageChange(float plusDamage);
//------------ Skill(3). Psychic Shield ------------//
// 스킬 설명 : 에스퍼가 실드를 생성합니다. 반경 7m 내에 크러셔가 있을경우 크러셔도 실드 효과를 같이 받습니다.
private:
RPC_FUNCTION(AHACKED_ESPER, PsychicShield)
UFUNCTION()
void PsychicShield();
RPC_FUNCTION(AHACKED_ESPER, RPCCreatePsychicShield, bool)
UFUNCTION()
void RPCCreatePsychicShield(bool isBoth);
UFUNCTION()
void PsychicShieldOn();
RPC_FUNCTION(AHACKED_ESPER, RPCDestroyShield)
UFUNCTION()
void RPCDestroyShield();
UFUNCTION()
void PsychicShieldAnimEnd();
public:
UFUNCTION()
void PsychicShieldDestroy();
UFUNCTION()
void PsychicShieldTimeChange(float plusTime);
//------------ Ultimate(U). Psychic OverDrive ------------//
// 스킬 설명 : 에스퍼 주변의 적을 제압해 들어올린후 강력한 염동력으로 적을 땅으로 꽂습니다.
private:
RPC_FUNCTION(AHACKED_ESPER, PsychicOverDrive)
UFUNCTION()
void PsychicOverDrive(); // 에스퍼 궁극기(Psychic OverDrive)의 처음 상태 설정 함수입니다.
UFUNCTION()
void PsychicOverDriveCamReturn();
UFUNCTION()
void PsychicOverDriveEndAction(); // 바인드함수와 Tick에서 들어올린 적을 땅으로 꽂습니다.
UFUNCTION()
void PsychicOverDriveDamaging(); // 땅으로 꽂힌 적에게 피해를 입힙니다.
UFUNCTION()
void PsychicOverDriveEnd(); // 해당 스킬이 끝나 기본 State로 돌아가기 위한 수치 조정함수입니다.
UPROPERTY()
class UMaterial* PrimaryPartsMaterial;
UPROPERTY()
class UMaterial* UltimatePartsMaterial;
UPROPERTY()
class UMaterialInstanceDynamic* PrimaryMaterialInst;
UPROPERTY()
class UMaterialInstanceDynamic* UltimateMaterialInst;
FTimerHandle UltimateDamagingTimer; // 궁극기가 끝난 뒤 내려 박힐때 피해를 직접 입히는 함수를 실행시키는 함수입니다.
TArray<class AHACKED_AI*> UltimateCheckedAI; // 꽂힌 적에게 피해를 입히기 위해 적을 저장하는 Array
public:
UFUNCTION(BlueprintImplementableEvent, Category = Ultimate)
void OnTranslucent(bool IsTranslucent);
UFUNCTION(BlueprintImplementableEvent, Category = Ultiamte)
void UltimateDecal();
UPROPERTY(VisibleAnywhere, BlueprintReadOnly)
class UMaterialInterface* DC_EsperUltimateDecal;
// SelfHealing ------------------------------------
private:
RPC_FUNCTION(AHACKED_ESPER, RPCSelfHealing)
UFUNCTION()
// 자가 치유 상태에 진입하는 함수입니다.
void RPCSelfHealing();
// 자가 치유가 끝났을때 진입하는 함수입니다.
UFUNCTION()
void SelfHealingEnd();
// 자가 치유 애니메이션후 복귀동작의 마지막에 진입하는 함수입니다.
UFUNCTION()
void SelfHealingAnimEnd();
UPROPERTY(VisibleAnywhere)
class UParticleSystemComponent* PC_EsperSelfHeal = nullptr;
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Particle, Meta = (AllowPrivateAccess = "true"))
class UParticleSystem* PS_EsperSelfHeal;
public:
RPC_FUNCTION(AHACKED_ESPER, RPCBothDieProcess)
UFUNCTION()
void RPCBothDieProcess();
private:
// Dash ------------------------------------
RPC_FUNCTION(AHACKED_ESPER, PsychicDash)
UFUNCTION()
void PsychicDash();
UFUNCTION()
void PsychicDashing();
RPC_FUNCTION(AHACKED_ESPER, PsychicDashFinish)
UFUNCTION()
void PsychicDashFinish();
// Camera ------------------------------------
void CameraBackToOrigin(); // 카메라를 기본 State 상태로 돌립니다.
public:
// Camera Shake Bp 연동
UPROPERTY(EditAnywhere)
TSubclassOf<UCameraShake> CS_EsperPrimary;
UPROPERTY(EditAnywhere)
TSubclassOf<UCameraShake> CS_PsychicOverDrive;
UPROPERTY(EditAnywhere)
TSubclassOf<UCameraShake> CS_PsychicOverDriveEnd;
UPROPERTY(EditAnywhere)
TSubclassOf<UCameraShake> CS_PsychicShockWave;
UPROPERTY(EditAnywhere)
TSubclassOf<UCameraShake> CS_PsychicForce;
UPROPERTY(EditAnywhere)
TSubclassOf<UCameraShake> CS_PsychicDrop;
private:
//------------------------------------------ Esper Stat ------------------------------------------//
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = EsperPrimaryStat, Meta = (AllowPrivateAccess = true))
float _esperMaxHp;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = EsperPrimaryStat, Meta = (AllowPrivateAccess = true))
float _esperMaxWalkSpeed;
private:
//------------------------------------------ Esper Primary Attack ------------------------------------------//
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
float _primaryAttackDamage;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
float _primaryAttackSPDamage;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
float _primaryAttackRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
float _primaryAttackSPRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
float _primaryAttackSpeed;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
float _primaryAttackLifeTime;
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = PrimaryAttack, Meta = (AllowPrivateAccess = true))
bool bIsPrimaryAttacking;
//------------------------------------------ Skill 1 PsychicForce ------------------------------------------//
private:
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Skill1_PsychicForce, Meta = (AllowPrivateAccess = true))
bool bIsPsychicForce;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill1_PsychicForce, Meta = (AllowPrivateAccess = true))
float _psychicForceRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill1_PsychicForce, Meta = (AllowPrivateAccess = true))
float _psychicForceDamage;
FTimerHandle PsychicForceStunDelay;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill1_PsychicForce, Meta = (AllowPrivateAccess = true))
float _stunDelayTime;
//------------------------------------------ Skill MouseRight PsychicDrop ------------------------------------------//
private:
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Skill2_PsychicDrop, Meta = (AllowPrivateAccess = true))
bool bIsPsychicDrop;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill2_PsychicDrop, Meta = (AllowPrivateAccess = true))
float _psychicDropSpeed;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill2_PsychicDrop, Meta = (AllowPrivateAccess = true))
float _psychicDropRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill2_PsychicDrop, Meta = (AllowPrivateAccess = true))
float _psychicDropDamageRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill2_PsychicDrop, Meta = (AllowPrivateAccess = true))
float _psychicDropDamage;
float PsychicDropDamageCount;
bool bActorHitCheck;
FVector PsychicDropSavePos;
FVector PsychicDropStartVec;
FVector PsychicDropEndVec;
FVector FollowCamVec;
FVector WorldCamVec;
FVector PsychicDropHitLocation;
//------------------------------------------ Skill 2 PsychicShockWave ------------------------------------------//
private:
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
bool bIsPsychicShockWave;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _shockWaveRadius;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _shockWaveRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _shockWaveDamage;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _shockWaveTime;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _shockWaveMaxTime;
FVector ShockWaveSpawnLocation;
FTimerHandle ShockWaveTimerHandle;
//------------------------------------------ Skill 3 PsychicShield ------------------------------------------//
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
bool bIsPsychicShield;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _psychicShieldDistance;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _psychicShieldAmount;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Skill3_PsychicShockWave, Meta = (AllowPrivateAccess = true))
float _psychicShieldTime;
FTimerHandle PsychicShieldTimerHandle;
//------------------------------------------ Shift PsychicDash ------------------------------------------//
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Dash_PsychicDash, Meta = (AllowPrivateAccess = true))
bool bIsPsychicDash;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Dash_PsychicDash, Meta = (AllowPrivateAccess = true))
float _psychicDashDistance = 700.0f;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Dash_PsychicDash, Meta = (AllowPrivateAccess = true))
float _psychicDashPower;
FVector DashStartPos;
FVector DashDirection;
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Particle, Meta = (AllowPrivateAccess = "true"))
class UParticleSystem* PS_PsychicDash;
//------------------------------------------ Ultimate PsychicOverDrive ------------------------------------------//
public:
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Ultimate_PsychicOverDrive, Meta = (AllowPrivateAccess = true))
bool bIsPsychicOverDrive = false;
private:
// 궁극기 띄우는 판정 발동 여부
bool bOnPsychicOverDriveHovering;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Ultimate_PsychicOverDrive, Meta = (AllowPrivateAccess = true))
float _psychicOverDriveRange;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Ultimate_PsychicOverDrive, Meta = (AllowPrivateAccess = true))
float _psychicOverDriveDamage;
UPROPERTY(EditAnywhere, BlueprintReadOnly, Category = Ultimate_PsychicOverDrive, Meta = (AllowPrivateAccess = true))
float _ultimateDropDelay;
FVector OverDriveSavePos;
FTimerHandle UltimateTimerHandle;
float OverDriveTimeCount;
private:
UPROPERTY(VisibleInstanceOnly, BlueprintReadOnly, Category = Particle, Meta = (AllowPrivateAccess = "true"))
class UParticleSystem* PA_PsychicDrop;
UPROPERTY()
TSubclassOf<class AEsper_PA_EnergyBall> EnergyBallClass;
UPROPERTY()
TSubclassOf<class AEsper_PsychicDrop> PsychicTrailClass;
UPROPERTY()
TSubclassOf<class UUserWidget> WG_Aim_Class;
UPROPERTY()
class UEsper_AnimInstance* Esper_Anim;
public:
UPROPERTY(BlueprintReadOnly, Category = "Widget")
class UUserWidget* WG_Aim = nullptr;
};
| [
"ljh960101@gmail.com"
] | ljh960101@gmail.com |
f053d6f0a41ab66d1dbebd2c3961a327b690d3de | f21294b3508c96643c7088f74e4b01c776fb95f0 | /wrapper/Examples/MotionControlTestWrappedCPP/MotionControlTestWrappedCPP.cpp | f6c668c2e1c71b964ce3fce96eaafb1cbf8aa122 | [] | no_license | Roel1l/wrapper | fac272907ea429bd3255b55c11cf765d313f12cc | efac82e14147175d195fcf8f7a5a597a14d794a7 | refs/heads/master | 2021-08-14T17:56:39.169987 | 2017-11-16T10:40:16 | 2017-11-16T10:40:16 | 110,958,843 | 0 | 0 | null | null | null | null | IBM852 | C++ | false | false | 2,230 | cpp | // MotionControlTestWrappedCPP.cpp : Defines the entry point for the console application.
//
#include <iostream>
#include "stdafx.h"
#include <Windows.h>
#include <string>
#include "mctl.h"
#include "mctlWrapper.h"
using namespace std;
typedef DWORD(*MCTLW_INIT)(char*);
typedef DWORD(*MCTLW_MOVEABS)(LPAXISPOS);
typedef DWORD(*MCTLW_EXIT)(void);
typedef DWORD(*MCTLW_RESET)(void);
typedef DWORD(*MCTLW_REFERENCE)(DWORD);
int main()
{
cout << "MotionControlTestWrappedCPP starting" << endl;
HINSTANCE hInstLibrary = LoadLibraryA("mctlWrapper.dll");
if (hInstLibrary)
{
cout << "canapi loaded successfully" << endl;
MCTLW_INIT _initialize = (MCTLW_INIT)GetProcAddress(hInstLibrary, "mctlw_Initialize");
MCTLW_MOVEABS _moveAbs = (MCTLW_MOVEABS)GetProcAddress(hInstLibrary, "mctlw_MoveAbs");
MCTLW_EXIT _xit = (MCTLW_EXIT)GetProcAddress(hInstLibrary, "mctlw_Exit");
MCTLW_RESET _reset = (MCTLW_RESET)GetProcAddress(hInstLibrary, "mctlw_Reset");
MCTLW_REFERENCE _reference = (MCTLW_REFERENCE)GetProcAddress(hInstLibrary, "mctlw_Reference");
unsigned int uiResult = 0;
uiResult = _initialize("c:\\CNCworkbench\\Control\\CAN\\CAN_PCI_3_Axis.ini");
if ((uiResult & 0xC000FFFF) == 0)
{
uiResult = _reset();
if ((uiResult & 0xC000FFFF) == 0)
{
uiResult = _reference(1);
if ((uiResult & 0xC000FFFF) == 0)
{
AXISPOS ax;
ax.X = 100000; // Ám
ax.Y = 120000; // Ám
//Correct init bug...
ax.Z = 0;
ax.A = 0;
ax.B = 0;
ax.C = 0;
ax.U = 0;
ax.V = 0;
ax.W = 0;
printf("Bewegung wird gestartet.\n");
uiResult = _moveAbs(&ax);
if ((uiResult & 0xC000FFFF) == 0)
{
string dump;
cout << "whack a key once movement stops" << endl;
getline(cin, dump);
uiResult = _xit();
}
else
{
printf("Fehler bei axctl_MoveAbs: %x", uiResult);
}
}
else
{
printf("Fehler bei axctl_Reference: %x", uiResult);
}
}
else
{
printf("Fehler bei axctl_Reset: %x", uiResult);
}
}
else
{
printf("Fehler bei mctl_Initialize: %x", uiResult);
}
FreeLibrary(hInstLibrary);
}
else
{
cout << "failed to load mctlWrapper" << endl;
}
return 0;
}
| [
"raa.guerand@student.avans.nl"
] | raa.guerand@student.avans.nl |
ee29cf1e06303de744f6832d609fcfbbc1f00d68 | fc66f7285c8f68f76cde450f130c334ebdbbaa84 | /src/liblogcabin/Event/SignalTest.cc | 4282c419fe5a40a14648a620ef55347459993670 | [
"ISC"
] | permissive | logcabin/liblogcabin | 231d30488fe7c9f5b13c27322ad26ca0007e9e7d | c41b10eec52b6062ec240b052acb855d3d72cbda | refs/heads/master | 2023-08-19T22:02:38.577581 | 2017-10-13T03:43:38 | 2017-10-13T03:43:38 | 61,775,291 | 39 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 3,989 | cc | /* Copyright (c) 2012 Stanford University
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR(S) DISCLAIM ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL AUTHORS BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <gtest/gtest.h>
#include <signal.h>
#include "liblogcabin/Core/Debug.h"
#include "liblogcabin/Event/Loop.h"
#include "liblogcabin/Event/Signal.h"
namespace LibLogCabin {
namespace Event {
namespace {
struct ExitOnSignal : public Event::Signal {
ExitOnSignal(Event::Loop& loop, int signal)
: Signal(signal)
, eventLoop(loop)
, triggerCount(0)
{
}
void handleSignalEvent() {
++triggerCount;
eventLoop.exit();
}
Event::Loop& eventLoop;
uint32_t triggerCount;
};
struct ExitOnTimer : public Event::Timer {
explicit ExitOnTimer(Event::Loop& loop)
: Timer()
, eventLoop(loop)
, triggerCount(0)
{
}
void handleTimerEvent() {
++triggerCount;
eventLoop.exit();
}
Event::Loop& eventLoop;
uint32_t triggerCount;
};
struct EventSignalTest : public ::testing::Test {
EventSignalTest()
: loop()
{
}
Event::Loop loop;
};
struct EventSignalBlockerTest : EventSignalTest {
};
TEST_F(EventSignalBlockerTest, constructor) {
Event::Signal::Blocker block(SIGTERM);
ExitOnSignal signal(loop, SIGTERM);
Event::Signal::Monitor monitor(loop, signal);
EXPECT_EQ(0, kill(getpid(), SIGTERM));
ExitOnTimer timer(loop);
Event::Timer::Monitor timerMonitor(loop, timer);
timer.schedule(1000*1000);
loop.runForever();
EXPECT_EQ(1U, signal.triggerCount);
}
TEST_F(EventSignalBlockerTest, destructor) {
ExitOnSignal signal(loop, SIGTERM);
Event::Signal::Monitor monitor(loop, signal);
{
Event::Signal::Blocker block(SIGTERM);
}
EXPECT_DEATH(kill(getpid(), SIGTERM),
"");
}
TEST_F(EventSignalBlockerTest, block) {
Event::Signal::Blocker block(SIGTERM);
ExitOnSignal signal(loop, SIGTERM);
Event::Signal::Monitor monitor(loop, signal);
block.unblock();
block.block();
block.block();
EXPECT_EQ(0, kill(getpid(), SIGTERM));
ExitOnTimer timer(loop);
Event::Timer::Monitor timerMonitor(loop, timer);
timer.schedule(1000*1000);
loop.runForever();
EXPECT_EQ(1U, signal.triggerCount);
}
TEST_F(EventSignalBlockerTest, unblock) {
Event::Signal::Blocker block(SIGTERM);
ExitOnSignal signal(loop, SIGTERM);
Event::Signal::Monitor monitor(loop, signal);
block.unblock();
block.unblock();
EXPECT_DEATH(kill(getpid(), SIGTERM),
"");
}
TEST_F(EventSignalTest, constructor) {
Event::Signal::Blocker block(SIGTERM);
ExitOnSignal signal(loop, SIGTERM);
Event::Signal::Monitor monitor(loop, signal);
}
TEST_F(EventSignalTest, destructor) {
// Nothing to test.
}
TEST_F(EventSignalTest, fires) {
Event::Signal::Blocker block(SIGTERM);
ExitOnSignal signal(loop, SIGTERM);
Event::Signal::Monitor monitor(loop, signal);
// Warning: if you run this in gdb, you'll need to pass the signal through
// to the application.
EXPECT_EQ(0, kill(getpid(), SIGTERM));
// must have been caught if we get this far
loop.runForever();
EXPECT_EQ(1U, signal.triggerCount);
}
} // namespace LibLogCabin::Event::<anonymous>
} // namespace LibLogCabin::Event
} // namespace LibLogCabin
| [
"tnachen@gmail.com"
] | tnachen@gmail.com |
36e068ba392377f6f22c399fa32ec93da6715e8c | 01bcef56ade123623725ca78d233ac8653a91ece | /materialsystem/stdshaders/fxctmp9_ps3/playstation_test_ps20b.inc | 2f8904855967a463478343e160236ecaf5784704 | [
"LicenseRef-scancode-public-domain",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | SwagSoftware/Kisak-Strike | 1085ba3c6003e622dac5ebc0c9424cb16ef58467 | 4c2fdc31432b4f5b911546c8c0d499a9cff68a85 | refs/heads/master | 2023-09-01T02:06:59.187775 | 2022-09-05T00:51:46 | 2022-09-05T00:51:46 | 266,676,410 | 921 | 123 | null | 2022-10-01T16:26:41 | 2020-05-25T03:41:35 | C++ | UTF-8 | C++ | false | false | 1,780 | inc | // ALL SKIP STATEMENTS THAT AFFECT THIS SHADER!!!
// defined $PIXELFOGTYPE && defined $WRITEWATERFOGTODESTALPHA && ( $PIXELFOGTYPE != 1 ) && $WRITEWATERFOGTODESTALPHA
// defined $LIGHTING_PREVIEW && defined $FASTPATHENVMAPTINT && $LIGHTING_PREVIEW && $FASTPATHENVMAPTINT
// defined $LIGHTING_PREVIEW && defined $FASTPATHENVMAPCONTRAST && $LIGHTING_PREVIEW && $FASTPATHENVMAPCONTRAST
// defined $LIGHTING_PREVIEW && defined $FASTPATH && $LIGHTING_PREVIEW && $FASTPATH
// ($FLASHLIGHT || $FLASHLIGHTSHADOWS) && $LIGHTING_PREVIEW
#include "shaderlib/cshader.h"
class playstation_test_ps20b_Static_Index
{
public:
// CONSTRUCTOR
playstation_test_ps20b_Static_Index( IShaderShadow *pShaderShadow, IMaterialVar **params )
{
}
int GetIndex()
{
// Asserts to make sure that we aren't using any skipped combinations.
// Asserts to make sure that we are setting all of the combination vars.
#ifdef _DEBUG
#endif // _DEBUG
return 0;
}
};
#define shaderStaticTest_playstation_test_ps20b 0
class playstation_test_ps20b_Dynamic_Index
{
public:
// CONSTRUCTOR
playstation_test_ps20b_Dynamic_Index( IShaderDynamicAPI *pShaderAPI )
{
}
int GetIndex()
{
// Asserts to make sure that we aren't using any skipped combinations.
// Asserts to make sure that we are setting all of the combination vars.
#ifdef _DEBUG
#endif // _DEBUG
return 0;
}
};
#define shaderDynamicTest_playstation_test_ps20b 0
static const ShaderComboSemantics_t playstation_test_ps20b_combos =
{
"playstation_test_ps20b", NULL, 0, NULL, 0
};
class ConstructMe_playstation_test_ps20b
{
public:
ConstructMe_playstation_test_ps20b()
{
GetShaderDLL()->AddShaderComboInformation( &playstation_test_ps20b_combos );
}
};
static ConstructMe_playstation_test_ps20b s_ConstructMe_playstation_test_ps20b;
| [
"bbchallenger100@gmail.com"
] | bbchallenger100@gmail.com |
a588d4a7f1be35ab0b794de288605f7cf38c4d5d | 51e245861cf33d14f73e772ebb74230e14d6a58c | /src/Core/Entities/Entity.cpp | 26253b34baa20926990c20fbab99deabeefcb158 | [] | no_license | ErickNK/BlastEngine | 83fbe82b84931be0880d0bfef7ce39268f3bc67f | 96bb7a8fb240d33188761f86afb3aac475d9eb17 | refs/heads/master | 2020-03-31T14:37:25.115378 | 2018-10-27T14:36:08 | 2018-10-27T14:36:08 | 152,302,765 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 59 | cpp | //
// Created by erick on 9/16/18.
//
#include "Entity.h"
| [
"eriknjiru73@gmail.com"
] | eriknjiru73@gmail.com |
2d2d34b35c631e97a158268d1e8810ccd73eb162 | f7f9c671dd998eeee5857d3042a22d27108c8d8b | /AesQtApp/Aes256.h | 983593878604254fe499036f67766bfebf6de106 | [] | no_license | wald3/Aes256App | f5315babc83b8ed625693edf0336c0c10e0aacf0 | 54a9cf8721ce60402ec1766eac922119144ed469 | refs/heads/master | 2020-12-01T22:01:41.372704 | 2019-12-29T17:47:54 | 2019-12-29T17:47:54 | 230,784,229 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,466 | h | #ifndef AES256_HPP
#define AES256_HPP
#include <vector>
typedef std::vector<unsigned char> ByteArray;
#define BLOCK_SIZE 16
class Aes256 {
public:
Aes256(const ByteArray& key);
~Aes256();
static ByteArray::size_type encrypt(const ByteArray& key, const ByteArray& plain, ByteArray& encrypted);
static ByteArray::size_type encrypt(const ByteArray& key, const unsigned char* plain, const ByteArray::size_type plain_length, ByteArray& encrypted);
static ByteArray::size_type decrypt(const ByteArray& key, const ByteArray& encrypted, ByteArray& plain);
static ByteArray::size_type decrypt(const ByteArray& key, const unsigned char* encrypted, const ByteArray::size_type encrypted_length, ByteArray& plain);
ByteArray::size_type encrypt_start(const ByteArray::size_type plain_length, ByteArray& encrypted);
ByteArray::size_type encrypt_continue(const ByteArray& plain, ByteArray& encrypted);
ByteArray::size_type encrypt_continue(const unsigned char* plain, const ByteArray::size_type plain_length, ByteArray& encrypted);
ByteArray::size_type encrypt_end(ByteArray& encrypted);
ByteArray::size_type decrypt_start(const ByteArray::size_type encrypted_length);
ByteArray::size_type decrypt_continue(const ByteArray& encrypted, ByteArray& plain);
ByteArray::size_type decrypt_continue(const unsigned char* encrypted, const ByteArray::size_type encrypted_length, ByteArray& plain);
ByteArray::size_type decrypt_end(ByteArray& plain);
private:
ByteArray m_key;
ByteArray m_salt;
ByteArray m_rkey;
unsigned char m_buffer[3 * BLOCK_SIZE];
unsigned char m_buffer_pos;
ByteArray::size_type m_remainingLength;
bool m_decryptInitialized;
void check_and_encrypt_buffer(ByteArray& encrypted);
void check_and_decrypt_buffer(ByteArray& plain);
void encrypt(unsigned char* buffer);
void decrypt(unsigned char* buffer);
void expand_enc_key(unsigned char* rc);
void expand_dec_key(unsigned char* rc);
void sub_bytes(unsigned char* buffer);
void sub_bytes_inv(unsigned char* buffer);
void copy_key();
void add_round_key(unsigned char* buffer, const unsigned char round);
void shift_rows(unsigned char* buffer);
void shift_rows_inv(unsigned char* buffer);
void mix_columns(unsigned char* buffer);
void mix_columns_inv(unsigned char* buffer);
};
#endif /* AES256_HPP */
| [
"onessse@gmail.com"
] | onessse@gmail.com |
fafe70f9d44fcc46c35fcdd477ec68d488915ffe | 360f3d117f1c0397cb118a45dec862f8132bc1ff | /data-access/src/preprocess/data_access_impl.h | 7bf257c28c8d74e2301b21a150f22659981650bb | [] | no_license | ldak47/logprocess | 0f64138cb7cadcc88343a490084084656cb755a5 | cee95e4c170e25df16f82a8bc30cab2f2a520172 | refs/heads/master | 2021-01-19T01:00:00.069489 | 2017-08-24T08:40:10 | 2017-08-24T08:40:10 | 95,614,645 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,925 | h | #ifndef DATAACCESS_ACCESS_IMPL_H
#define DATAACCESS_ACCESS_IMPL_H
#include "libconfig.h++"
#include "range_iterator.h"
#include "client_hook.h"
#include "data_access_pv.h"
#include "data_access_filter.h"
#include "data_preprocess_action.h"
#include <boost/lockfree/queue.hpp>
namespace dataaccess {
class Access_Impl {
PvStater &pvstater_;
DataFieldRuler &datafieldruler_;
AccessFilter &accessfilter_;
bool &switch_old_;
bool &switch_new_;
public:
Access_Impl(PvStater &pvstater,
DataFieldRuler &datafieldruler,
AccessFilter &accessfilter,
bool &switch_old,
bool &switch_new);
~Access_Impl(){}
bool Init(const libconfig::Setting &filter_cfg, const libconfig::Setting &field_cfg);
void SetLogFilterConfig(
const manage::SetLogFilterConfigRequest *request,
manage::SetLogFilterConfigResponse *response,
::google::protobuf::Closure *done
);
void GetLogFilterConfig(
const manage::GetLogFilterConfigRequest *request,
manage::GetLogFilterConfigResponse *response,
::google::protobuf::Closure *done
);
void SetLogFieldConfig(
const manage::SetLogFieldConfigRequest *request,
manage::SetLogFieldConfigResponse *response,
::google::protobuf::Closure *done
);
void GetLogFieldConfig(
const manage::GetLogFieldConfigRequest *request,
manage::GetLogFieldConfigResponse *response,
::google::protobuf::Closure *done
);
void GetLogTransmitStat(
const manage::GetLogTransmitStatRequest *request,
manage::GetLogTransmitStatResponse *response,
::google::protobuf::Closure *done
);
void AddLogTransmitStat(
const manage::AddLogTransmitStatRequest *request,
manage::AddLogTransmitStatResponse *response,
::google::protobuf::Closure *done
);
void PullSwitchConfig(
const manage::PullSwitchConfigRequest *request,
manage::PullSwitchConfigResponse *response,
::google::protobuf::Closure *done
);
void Retransmit(
const manage::RetransmitRequest *request,
manage::RetransmitResponse *response,
::google::protobuf::Closure *done
);
};
};
#endif
| [
"root@cp01-misheng-glb-test01.epc.baidu.com"
] | root@cp01-misheng-glb-test01.epc.baidu.com |
7933dfe264f7aa7a01e8e498a768c0e3af2033d2 | ce266b37e4e6feb144652df1ef8c3db0d92272f2 | /8. C++/Labs/Labs13/main.cpp | abb92a6ab4165b6235052ffceb282160da93cca9 | [] | no_license | Mitzury/ITMO | cfad27c62337d66dd7e4172206d1ee273ae9a6ed | b8ffd83e0ae14b3b18d879be0792331b334d077a | refs/heads/master | 2023-08-07T04:55:59.573717 | 2021-09-28T05:21:02 | 2021-09-28T05:21:02 | 347,992,641 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 387 | cpp | #include "includes.h"
#include <Windows.h>
int main()
{
//setlocale(LC_ALL, "Russian");
SetConsoleOutputCP(1251);
SetConsoleCP(1251);
Person* Student = new student;
cout << "Студент:" << "\n";
Student->setData();
Student->getData();
Person* Teacher = new teacher;
cout << "Преподаватель:" << "\n";
Teacher->setData();
Teacher->getData();
return 0;
} | [
"bogdanovsi@gmail.com"
] | bogdanovsi@gmail.com |
b050a7a11f803f768dfdd100baf5744e9e2a63dc | cccfb7be281ca89f8682c144eac0d5d5559b2deb | /chrome/browser/apps/app_service/metrics/app_platform_metrics.h | 75281ba7767d2665ceae0151afb77b0b1caaa51d | [
"BSD-3-Clause"
] | permissive | SREERAGI18/chromium | 172b23d07568a4e3873983bf49b37adc92453dd0 | fd8a8914ca0183f0add65ae55f04e287543c7d4a | refs/heads/master | 2023-08-27T17:45:48.928019 | 2021-11-11T22:24:28 | 2021-11-11T22:24:28 | 428,659,250 | 1 | 0 | BSD-3-Clause | 2021-11-16T13:08:14 | 2021-11-16T13:08:14 | null | UTF-8 | C++ | false | false | 9,483 | h | // Copyright 2021 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_APPS_APP_SERVICE_METRICS_APP_PLATFORM_METRICS_H_
#define CHROME_BROWSER_APPS_APP_SERVICE_METRICS_APP_PLATFORM_METRICS_H_
#include <map>
#include <set>
#include "base/time/time.h"
#include "chrome/browser/apps/app_service/metrics/app_platform_metrics_utils.h"
#include "components/services/app_service/public/cpp/app_registry_cache.h"
#include "components/services/app_service/public/cpp/instance_registry.h"
#include "components/services/app_service/public/mojom/types.mojom.h"
#include "services/metrics/public/cpp/ukm_source_id.h"
class Profile;
namespace aura {
class Window;
}
namespace apps {
class AppUpdate;
// This is used for logging, so do not remove or reorder existing entries.
enum class InstallTime {
kInit = 0,
kRunning = 1,
// Add any new values above this one, and update kMaxValue to the highest
// enumerator value.
kMaxValue = kRunning,
};
extern const char kAppRunningDuration[];
extern const char kAppActivatedCount[];
extern const char kAppLaunchPerAppTypeHistogramName[];
extern const char kAppLaunchPerAppTypeV2HistogramName[];
extern const char kArcHistogramName[];
extern const char kBuiltInHistogramName[];
extern const char kCrostiniHistogramName[];
extern const char kChromeAppHistogramName[];
extern const char kWebAppHistogramName[];
extern const char kMacOsHistogramName[];
extern const char kPluginVmHistogramName[];
extern const char kStandaloneBrowserHistogramName[];
extern const char kRemoteHistogramName[];
extern const char kBorealisHistogramName[];
extern const char kSystemWebAppHistogramName[];
extern const char kChromeBrowserHistogramName[];
extern const char kChromeAppTabHistogramName[];
extern const char kChromeAppWindowHistogramName[];
extern const char kWebAppTabHistogramName[];
extern const char kWebAppWindowHistogramName[];
std::string GetAppTypeHistogramName(apps::AppTypeName app_type_name);
std::string GetAppTypeHistogramNameV2(apps::AppTypeNameV2 app_type_name);
const std::set<apps::AppTypeName>& GetAppTypeNameSet();
// Records metrics when launching apps.
void RecordAppLaunchMetrics(Profile* profile,
apps::mojom::AppType app_type,
const std::string& app_id,
apps::mojom::LaunchSource launch_source,
apps::mojom::LaunchContainer container);
class AppPlatformMetrics : public apps::AppRegistryCache::Observer,
public apps::InstanceRegistry::Observer {
public:
explicit AppPlatformMetrics(Profile* profile,
apps::AppRegistryCache& app_registry_cache,
InstanceRegistry& instance_registry);
AppPlatformMetrics(const AppPlatformMetrics&) = delete;
AppPlatformMetrics& operator=(const AppPlatformMetrics&) = delete;
~AppPlatformMetrics() override;
// UMA metrics name for installed apps count in Chrome OS.
static std::string GetAppsCountHistogramNameForTest(
AppTypeName app_type_name);
// UMA metrics name for installed apps count per InstallReason in Chrome OS.
static std::string GetAppsCountPerInstallReasonHistogramNameForTest(
AppTypeName app_type_name,
apps::mojom::InstallReason install_reason);
// UMA metrics name for apps running duration in Chrome OS.
static std::string GetAppsRunningDurationHistogramNameForTest(
AppTypeName app_type_name);
// UMA metrics name for apps running percentage in Chrome OS.
static std::string GetAppsRunningPercentageHistogramNameForTest(
AppTypeName app_type_name);
// UMA metrics name for app window activated count in Chrome OS.
static std::string GetAppsActivatedCountHistogramNameForTest(
AppTypeName app_type_name);
// UMA metrics name for apps usage time in Chrome OS for AppTypeName.
static std::string GetAppsUsageTimeHistogramNameForTest(
AppTypeName app_type_name);
// UMA metrics name for apps usage time in Chrome OS for AppTypeNameV2.
static std::string GetAppsUsageTimeHistogramNameForTest(
AppTypeNameV2 app_type_name);
void OnNewDay();
void OnTenMinutes();
void OnFiveMinutes();
// Records UKM when launching an app.
void RecordAppLaunchUkm(apps::mojom::AppType app_type,
const std::string& app_id,
apps::mojom::LaunchSource launch_source,
apps::mojom::LaunchContainer container);
// Records UKM when uninstalling an app.
void RecordAppUninstallUkm(apps::mojom::AppType app_type,
const std::string& app_id,
apps::mojom::UninstallSource uninstall_source);
private:
struct RunningStartTime {
base::TimeTicks start_time;
AppTypeName app_type_name;
AppTypeNameV2 app_type_name_v2;
std::string app_id;
};
struct UsageTime {
base::TimeDelta running_time;
ukm::SourceId source_id = ukm::kInvalidSourceId;
AppTypeName app_type_name = AppTypeName::kUnknown;
bool window_is_closed = false;
};
struct BrowserToTab {
BrowserToTab(const Instance::InstanceKey& browser_key,
const Instance::InstanceKey& tab_key);
Instance::InstanceKey browser_key;
Instance::InstanceKey tab_key;
};
using BrowserToTabs = std::list<BrowserToTab>;
// AppRegistryCache::Observer:
void OnAppTypeInitialized(apps::mojom::AppType app_type) override;
void OnAppRegistryCacheWillBeDestroyed(
apps::AppRegistryCache* cache) override;
void OnAppUpdate(const apps::AppUpdate& update) override;
// apps::InstanceRegistry::Observer:
void OnInstanceUpdate(const apps::InstanceUpdate& update) override;
void OnInstanceRegistryWillBeDestroyed(
apps::InstanceRegistry* cache) override;
// Updates the browser window status when the web app tab of `tab_key` is
// inactivated.
void UpdateBrowserWindowStatus(const Instance::InstanceKey& tab_key);
// Returns true if the browser with `browser_key` has activated tabs.
// Otherwise, returns false.
bool HasActivatedTab(const Instance::InstanceKey& browser_key);
// Returns the browser window for `tab_key`.
aura::Window* GetBrowserWindow(const Instance::InstanceKey& tab_key) const;
// Adds an activated `browser_key` and `tab_key` to `active_browser_to_tabs_`.
void AddActivatedTab(const Instance::InstanceKey& browser_key,
const Instance::InstanceKey& tab_key);
// Removes `tab_key` from `active_browser_to_tabs_`.
void RemoveActivatedTab(const Instance::InstanceKey& tab_key);
void SetWindowActivated(apps::mojom::AppType app_type,
AppTypeName app_type_name,
AppTypeNameV2 app_type_name_v2,
const std::string& app_id,
const apps::Instance::InstanceKey& instance_key);
void SetWindowInActivated(const std::string& app_id,
const apps::Instance::InstanceKey& instance_key,
apps::InstanceState state);
void InitRunningDuration();
void ClearRunningDuration();
// Records the number of apps of the given `app_type` that the family user has
// recently used.
void RecordAppsCount(apps::mojom::AppType app_type);
// Records the app running duration.
void RecordAppsRunningDuration();
// Records the app usage time metrics (both UMA and UKM) in five minutes
// intervals.
void RecordAppsUsageTime();
// Records the app usage time UKM in five minutes intervals.
void RecordAppsUsageTimeUkm();
// Records the installed app in Chrome OS.
void RecordAppsInstallUkm(const apps::AppUpdate& update,
InstallTime install_time);
// Returns the SourceId of UKM for `app_id`.
ukm::SourceId GetSourceId(const std::string& app_id);
// Gets the source id for a Crostini app_id.
ukm::SourceId GetSourceIdForCrostini(const std::string& app_id);
Profile* const profile_ = nullptr;
AppRegistryCache& app_registry_cache_;
bool should_record_metrics_on_new_day_ = false;
bool should_refresh_duration_pref = false;
bool should_refresh_activated_count_pref = false;
int user_type_by_device_type_;
// Records the map from browsers to activated web apps tabs.
BrowserToTabs active_browsers_to_tabs_;
// |running_start_time_| and |running_duration_| are used for accumulating app
// running duration per each day interval.
std::map<apps::Instance::InstanceKey, RunningStartTime> running_start_time_;
std::map<AppTypeName, base::TimeDelta> running_duration_;
std::map<AppTypeName, int> activated_count_;
// |start_time_per_five_minutes_|, |app_type_running_time_per_five_minutes_|,
// |app_type_v2_running_time_per_five_minutes_|, and
// |usage_time_per_five_minutes_| are used for accumulating app
// running duration per 5 minutes interval.
std::map<apps::Instance::InstanceKey, RunningStartTime>
start_time_per_five_minutes_;
std::map<AppTypeName, base::TimeDelta>
app_type_running_time_per_five_minutes_;
std::map<AppTypeNameV2, base::TimeDelta>
app_type_v2_running_time_per_five_minutes_;
std::map<apps::Instance::InstanceKey, UsageTime> usage_time_per_five_minutes_;
};
} // namespace apps
#endif // CHROME_BROWSER_APPS_APP_SERVICE_METRICS_APP_PLATFORM_METRICS_H_
| [
"chromium-scoped@luci-project-accounts.iam.gserviceaccount.com"
] | chromium-scoped@luci-project-accounts.iam.gserviceaccount.com |
22de1b2777cf8bb56f1dcf2856a815e51f9e7234 | f84b6f345115f63cd78562030299ccdafd1fef54 | /src/platform/Zephyr/ThreadStackManagerImpl.cpp | 7718ce9c2a68eb7370d0acf76695a30dd98ad64b | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | JordanField/connectedhomeip | 436bde7b804ffbbaafd254e3d782cabf569a8186 | 8dcf5d70cd54209511be6b1180156a00dd8e0cf8 | refs/heads/master | 2023-09-04T02:30:33.821611 | 2021-10-30T14:14:43 | 2021-10-30T14:14:43 | 423,137,284 | 0 | 0 | Apache-2.0 | 2021-10-31T12:08:08 | 2021-10-31T12:08:08 | null | UTF-8 | C++ | false | false | 3,027 | cpp | /*
*
* Copyright (c) 2020 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.
*/
/**
* @file
* Provides an implementation of the ThreadStackManager object for
* Zephyr platforms.
*
*/
/* this file behaves like a config.h, comes first */
#include <platform/internal/CHIPDeviceLayerInternal.h>
#include <platform/OpenThread/GenericThreadStackManagerImpl_OpenThread.cpp>
#include <platform/Zephyr/ThreadStackManagerImpl.h>
#include <inet/UDPEndPoint.h>
#include <lib/support/CodeUtils.h>
#include <platform/OpenThread/OpenThreadUtils.h>
#include <platform/ThreadStackManager.h>
namespace chip {
namespace DeviceLayer {
using namespace ::chip::DeviceLayer::Internal;
using namespace ::chip::Inet;
ThreadStackManagerImpl ThreadStackManagerImpl::sInstance;
CHIP_ERROR ThreadStackManagerImpl::_InitThreadStack()
{
otInstance * const instance = openthread_get_default_instance();
ReturnErrorOnFailure(GenericThreadStackManagerImpl_OpenThread<ThreadStackManagerImpl>::DoInit(instance));
UDPEndPoint::SetJoinMulticastGroupHandler([](InterfaceId, const IPAddress & address) {
const otIp6Address otAddress = ToOpenThreadIP6Address(address);
const auto otError = otIp6SubscribeMulticastAddress(openthread_get_default_instance(), &otAddress);
return MapOpenThreadError(otError);
});
UDPEndPoint::SetLeaveMulticastGroupHandler([](InterfaceId, const IPAddress & address) {
const otIp6Address otAddress = ToOpenThreadIP6Address(address);
const auto otError = otIp6UnsubscribeMulticastAddress(openthread_get_default_instance(), &otAddress);
return MapOpenThreadError(otError);
});
return CHIP_NO_ERROR;
}
CHIP_ERROR ThreadStackManagerImpl::_StartThreadTask()
{
// Intentionally empty.
return CHIP_NO_ERROR;
}
void ThreadStackManagerImpl::_LockThreadStack()
{
openthread_api_mutex_lock(openthread_get_default_context());
}
bool ThreadStackManagerImpl::_TryLockThreadStack()
{
// There's no openthread_api_mutex_try_lock() in Zephyr, so until it's contributed we must use the low-level API
return k_mutex_lock(&openthread_get_default_context()->api_lock, K_NO_WAIT) == 0;
}
void ThreadStackManagerImpl::_UnlockThreadStack()
{
openthread_api_mutex_unlock(openthread_get_default_context());
}
void ThreadStackManagerImpl::_ProcessThreadActivity()
{
// Intentionally empty.
}
} // namespace DeviceLayer
} // namespace chip
| [
"noreply@github.com"
] | JordanField.noreply@github.com |
3b7747a2ddf0d206a3e162e3b718010e6fb6d544 | 68e41638675e7802ae6db2fc4f725da033cedea0 | /src/txdb.cpp | c9037c2e762b18dc13eb761974348636cf55b931 | [
"MIT"
] | permissive | colognecoin/colognecoin | 908da0358248301e1ee433d164d8089a92e01785 | 4d417da2bd7fba13913c84a4f37091a2ffaaf37b | refs/heads/master | 2021-01-01T05:35:08.738172 | 2014-06-16T11:46:50 | 2014-06-16T11:46:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,533 | cpp | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Copyright (c) 2013-2014 Colognecoin Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "txdb.h"
#include "main.h"
#include "hash.h"
using namespace std;
void static BatchWriteCoins(CLevelDBBatch &batch, const uint256 &hash, const CCoins &coins) {
if (coins.IsPruned())
batch.Erase(make_pair('c', hash));
else
batch.Write(make_pair('c', hash), coins);
}
void static BatchWriteHashBestChain(CLevelDBBatch &batch, const uint256 &hash) {
batch.Write('B', hash);
}
CCoinsViewDB::CCoinsViewDB(size_t nCacheSize, bool fMemory, bool fWipe) : db(GetDataDir() / "chainstate", nCacheSize, fMemory, fWipe) {
}
bool CCoinsViewDB::GetCoins(const uint256 &txid, CCoins &coins) {
return db.Read(make_pair('c', txid), coins);
}
bool CCoinsViewDB::SetCoins(const uint256 &txid, const CCoins &coins) {
CLevelDBBatch batch;
BatchWriteCoins(batch, txid, coins);
return db.WriteBatch(batch);
}
bool CCoinsViewDB::HaveCoins(const uint256 &txid) {
return db.Exists(make_pair('c', txid));
}
CBlockIndex *CCoinsViewDB::GetBestBlock() {
uint256 hashBestChain;
if (!db.Read('B', hashBestChain))
return NULL;
std::map<uint256, CBlockIndex*>::iterator it = mapBlockIndex.find(hashBestChain);
if (it == mapBlockIndex.end())
return NULL;
return it->second;
}
bool CCoinsViewDB::SetBestBlock(CBlockIndex *pindex) {
CLevelDBBatch batch;
BatchWriteHashBestChain(batch, pindex->GetBlockHash());
return db.WriteBatch(batch);
}
bool CCoinsViewDB::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) {
printf("Committing %u changed transactions to coin database...\n", (unsigned int)mapCoins.size());
CLevelDBBatch batch;
for (std::map<uint256, CCoins>::const_iterator it = mapCoins.begin(); it != mapCoins.end(); it++)
BatchWriteCoins(batch, it->first, it->second);
if (pindex)
BatchWriteHashBestChain(batch, pindex->GetBlockHash());
return db.WriteBatch(batch);
}
CBlockTreeDB::CBlockTreeDB(size_t nCacheSize, bool fMemory, bool fWipe) : CLevelDB(GetDataDir() / "blocks" / "index", nCacheSize, fMemory, fWipe) {
}
bool CBlockTreeDB::WriteBlockIndex(const CDiskBlockIndex& blockindex)
{
return Write(make_pair('b', blockindex.GetBlockHash()), blockindex);
}
bool CBlockTreeDB::ReadBestInvalidWork(CBigNum& bnBestInvalidWork)
{
return Read('I', bnBestInvalidWork);
}
bool CBlockTreeDB::WriteBestInvalidWork(const CBigNum& bnBestInvalidWork)
{
return Write('I', bnBestInvalidWork);
}
bool CBlockTreeDB::WriteBlockFileInfo(int nFile, const CBlockFileInfo &info) {
return Write(make_pair('f', nFile), info);
}
bool CBlockTreeDB::ReadBlockFileInfo(int nFile, CBlockFileInfo &info) {
return Read(make_pair('f', nFile), info);
}
bool CBlockTreeDB::WriteLastBlockFile(int nFile) {
return Write('l', nFile);
}
bool CBlockTreeDB::WriteReindexing(bool fReindexing) {
if (fReindexing)
return Write('R', '1');
else
return Erase('R');
}
bool CBlockTreeDB::ReadReindexing(bool &fReindexing) {
fReindexing = Exists('R');
return true;
}
bool CBlockTreeDB::ReadLastBlockFile(int &nFile) {
return Read('l', nFile);
}
bool CCoinsViewDB::GetStats(CCoinsStats &stats) {
leveldb::Iterator *pcursor = db.NewIterator();
pcursor->SeekToFirst();
CHashWriter ss(SER_GETHASH, PROTOCOL_VERSION);
stats.hashBlock = GetBestBlock()->GetBlockHash();
ss << stats.hashBlock;
int64 nTotalAmount = 0;
while (pcursor->Valid()) {
boost::this_thread::interruption_point();
try {
leveldb::Slice slKey = pcursor->key();
CDataStream ssKey(slKey.data(), slKey.data()+slKey.size(), SER_DISK, CLIENT_VERSION);
char chType;
ssKey >> chType;
if (chType == 'c') {
leveldb::Slice slValue = pcursor->value();
CDataStream ssValue(slValue.data(), slValue.data()+slValue.size(), SER_DISK, CLIENT_VERSION);
CCoins coins;
ssValue >> coins;
uint256 txhash;
ssKey >> txhash;
ss << txhash;
ss << VARINT(coins.nVersion);
ss << (coins.fCoinBase ? 'c' : 'n');
ss << VARINT(coins.nHeight);
stats.nTransactions++;
for (unsigned int i=0; i<coins.vout.size(); i++) {
const CTxOut &out = coins.vout[i];
if (!out.IsNull()) {
stats.nTransactionOutputs++;
ss << VARINT(i+1);
ss << out;
nTotalAmount += out.nValue;
}
}
stats.nSerializedSize += 32 + slValue.size();
ss << VARINT(0);
}
pcursor->Next();
} catch (std::exception &e) {
return error("%s() : deserialize error", __PRETTY_FUNCTION__);
}
}
delete pcursor;
stats.nHeight = GetBestBlock()->nHeight;
stats.hashSerialized = ss.GetHash();
stats.nTotalAmount = nTotalAmount;
return true;
}
bool CBlockTreeDB::ReadTxIndex(const uint256 &txid, CDiskTxPos &pos) {
return Read(make_pair('t', txid), pos);
}
bool CBlockTreeDB::WriteTxIndex(const std::vector<std::pair<uint256, CDiskTxPos> >&vect) {
CLevelDBBatch batch;
for (std::vector<std::pair<uint256,CDiskTxPos> >::const_iterator it=vect.begin(); it!=vect.end(); it++)
batch.Write(make_pair('t', it->first), it->second);
return WriteBatch(batch);
}
bool CBlockTreeDB::WriteFlag(const std::string &name, bool fValue) {
return Write(std::make_pair('F', name), fValue ? '1' : '0');
}
bool CBlockTreeDB::ReadFlag(const std::string &name, bool &fValue) {
char ch;
if (!Read(std::make_pair('F', name), ch))
return false;
fValue = ch == '1';
return true;
}
bool CBlockTreeDB::LoadBlockIndexGuts()
{
leveldb::Iterator *pcursor = NewIterator();
CDataStream ssKeySet(SER_DISK, CLIENT_VERSION);
ssKeySet << make_pair('b', uint256(0));
pcursor->Seek(ssKeySet.str());
// Load mapBlockIndex
while (pcursor->Valid()) {
boost::this_thread::interruption_point();
try {
leveldb::Slice slKey = pcursor->key();
CDataStream ssKey(slKey.data(), slKey.data()+slKey.size(), SER_DISK, CLIENT_VERSION);
char chType;
ssKey >> chType;
if (chType == 'b') {
leveldb::Slice slValue = pcursor->value();
CDataStream ssValue(slValue.data(), slValue.data()+slValue.size(), SER_DISK, CLIENT_VERSION);
CDiskBlockIndex diskindex;
ssValue >> diskindex;
// Construct block index object
CBlockIndex* pindexNew = InsertBlockIndex(diskindex.GetBlockHash());
pindexNew->pprev = InsertBlockIndex(diskindex.hashPrev);
pindexNew->nHeight = diskindex.nHeight;
pindexNew->nFile = diskindex.nFile;
pindexNew->nDataPos = diskindex.nDataPos;
pindexNew->nUndoPos = diskindex.nUndoPos;
pindexNew->nVersion = diskindex.nVersion;
pindexNew->hashMerkleRoot = diskindex.hashMerkleRoot;
pindexNew->nTime = diskindex.nTime;
pindexNew->nBits = diskindex.nBits;
pindexNew->nNonce = diskindex.nNonce;
pindexNew->nStatus = diskindex.nStatus;
pindexNew->nTx = diskindex.nTx;
// Watch for genesis block
if (pindexGenesisBlock == NULL && diskindex.GetBlockHash() == hashGenesisBlock)
pindexGenesisBlock = pindexNew;
if (!pindexNew->CheckIndex())
return error("LoadBlockIndex() : CheckIndex failed: %s", pindexNew->ToString().c_str());
pcursor->Next();
} else {
break; // if shutdown requested or finished loading block index
}
} catch (std::exception &e) {
return error("%s() : deserialize error", __PRETTY_FUNCTION__);
}
}
delete pcursor;
return true;
}
| [
"maxtobiasweber@gmail.com"
] | maxtobiasweber@gmail.com |
a7fe11ffcccd2d9c44a2540055e0dc1c1a8b9b06 | 645a1b4e81b56db37b58ee776aa21e0aac9bc7f9 | /Renderers/FullRenderer.h | 1dac5a13fce6ee85350e619b684da51c79f6edf5 | [] | no_license | wbach/GameEngine | 51783358bad9059d9343772fcf7d95ca2a402726 | b21b16472972e355a1b5a7c0108839829cfc1781 | refs/heads/master | 2021-01-11T12:07:21.437421 | 2017-04-26T14:48:46 | 2017-04-26T14:48:46 | 79,482,032 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 655 | h | #pragma once
#include "Renderer.h"
#include "Framebuffer/DeferedFrameBuffer/DeferedFrameBuffer.h"
class FullRenderer : public CRenderer
{
public:
FullRenderer(SProjection* projection_matrix);
// Loading lights itp to shader
virtual void Init() override;
virtual void PrepareFrame(CScene* scene) override;
virtual void Render(CScene* scene) override;
virtual void EndFrame(CScene* scene) override;
virtual void Subscribe(CGameObject* gameObject) override;
private:
SProjection* m_ProjectionMatrix;
//ShadowMap renderes, etc...
std::vector<std::unique_ptr<CRenderer>> m_Renderers;
std::shared_ptr<CDefferedFrameBuffer> m_DefferedFrameBuffer;
}; | [
"wbach.projects@gmail.com"
] | wbach.projects@gmail.com |
121e87d372a7d7b5436e613ff56b7dbfe629efe6 | aa650dcd632a4e50c83af9564ea973549f592017 | /src/leveldb/db/filename.h | 54b70043b71ba79276d0c5b1b7ba7529912d6cbd | [
"MIT",
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla"
] | permissive | Buenoscoin/Buenoscoin | 16815c26cfc630ab85a25fdb5b41b7e66b376802 | 8dae1d242a99fab55802d8958a831d83db6ac008 | refs/heads/master | 2020-03-17T10:11:42.422660 | 2018-09-26T02:03:53 | 2018-09-26T02:03:53 | 133,503,459 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,048 | h | // Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
//
// File names used by DB code
#ifndef STORAGE_LEVELDB_DB_FILENAME_H_
#define STORAGE_LEVELDB_DB_FILENAME_H_
#include <stdint.h>
#include <string>
#include "leveldb/slice.h"
#include "leveldb/status.h"
#include "port/port.h"
namespace leveldb {
class Env;
enum FileType {
kLogFile,
kDBLockFile,
kTableFile,
kDescriptorFile,
kCurrentFile,
kTempFile,
kInfoLogFile // Either the current one, or an old one
};
// Return the name of the log file with the specified number
// in the db named by "dbname". The result will be prefixed with
// "dbname".
extern std::string LogFileName(const std::string& dbname, uint64_t number);
// Return the name of the sstable with the specified number
// in the db named by "dbname". The result will be prefixed with
// "dbname".
extern std::string TableFileName(const std::string& dbname, uint64_t number);
// Return the legacy file name for an sstable with the specified number
// in the db named by "dbname". The result will be prefixed with
// "dbname".
extern std::string SSTTableFileName(const std::string& dbname, uint64_t number);
// Return the name of the descriptor file for the db named by
// "dbname" and the specified incarnation number. The result will be
// prefixed with "dbname".
extern std::string DescriptorFileName(const std::string& dbname,
uint64_t number);
// Return the name of the current file. This file contains the name
// of the current buenfest file. The result will be prefixed with
// "dbname".
extern std::string CurrentFileName(const std::string& dbname);
// Return the name of the lock file for the db named by
// "dbname". The result will be prefixed with "dbname".
extern std::string LockFileName(const std::string& dbname);
// Return the name of a temporary file owned by the db named "dbname".
// The result will be prefixed with "dbname".
extern std::string TempFileName(const std::string& dbname, uint64_t number);
// Return the name of the info log file for "dbname".
extern std::string InfoLogFileName(const std::string& dbname);
// Return the name of the old info log file for "dbname".
extern std::string OldInfoLogFileName(const std::string& dbname);
// If filename is a leveldb file, store the type of the file in *type.
// The number encoded in the filename is stored in *number. If the
// filename was successfully parsed, returns true. Else return false.
extern bool ParseFileName(const std::string& filename,
uint64_t* number,
FileType* type);
// Make the CURRENT file point to the descriptor file with the
// specified number.
extern Status SetCurrentFile(Env* env, const std::string& dbname,
uint64_t descriptor_number);
} // namespace leveldb
#endif // STORAGE_LEVELDB_DB_FILENAME_H_
| [
"barneychambers@hotmail.com"
] | barneychambers@hotmail.com |
59680167c979d17db4c197d18b84e2a359ffe016 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/git/gumtree/git_repos_function_4726_git-2.7.5.cpp | f0560c507605c748ce702b2ee6ba5f92e02c9f6a | [] | 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 | 8,221 | cpp | int cmd_branch(int argc, const char **argv, const char *prefix)
{
int delete = 0, rename = 0, force = 0, list = 0;
int reflog = 0, edit_description = 0;
int quiet = 0, unset_upstream = 0;
const char *new_upstream = NULL;
enum branch_track track;
struct ref_filter filter;
static struct ref_sorting *sorting = NULL, **sorting_tail = &sorting;
struct option options[] = {
OPT_GROUP(N_("Generic options")),
OPT__VERBOSE(&filter.verbose,
N_("show hash and subject, give twice for upstream branch")),
OPT__QUIET(&quiet, N_("suppress informational messages")),
OPT_SET_INT('t', "track", &track, N_("set up tracking mode (see git-pull(1))"),
BRANCH_TRACK_EXPLICIT),
OPT_SET_INT( 0, "set-upstream", &track, N_("change upstream info"),
BRANCH_TRACK_OVERRIDE),
OPT_STRING('u', "set-upstream-to", &new_upstream, "upstream", "change the upstream info"),
OPT_BOOL(0, "unset-upstream", &unset_upstream, "Unset the upstream info"),
OPT__COLOR(&branch_use_color, N_("use colored output")),
OPT_SET_INT('r', "remotes", &filter.kind, N_("act on remote-tracking branches"),
FILTER_REFS_REMOTES),
OPT_CONTAINS(&filter.with_commit, N_("print only branches that contain the commit")),
OPT_WITH(&filter.with_commit, N_("print only branches that contain the commit")),
OPT__ABBREV(&filter.abbrev),
OPT_GROUP(N_("Specific git-branch actions:")),
OPT_SET_INT('a', "all", &filter.kind, N_("list both remote-tracking and local branches"),
FILTER_REFS_REMOTES | FILTER_REFS_BRANCHES),
OPT_BIT('d', "delete", &delete, N_("delete fully merged branch"), 1),
OPT_BIT('D', NULL, &delete, N_("delete branch (even if not merged)"), 2),
OPT_BIT('m', "move", &rename, N_("move/rename a branch and its reflog"), 1),
OPT_BIT('M', NULL, &rename, N_("move/rename a branch, even if target exists"), 2),
OPT_BOOL(0, "list", &list, N_("list branch names")),
OPT_BOOL('l', "create-reflog", &reflog, N_("create the branch's reflog")),
OPT_BOOL(0, "edit-description", &edit_description,
N_("edit the description for the branch")),
OPT__FORCE(&force, N_("force creation, move/rename, deletion")),
OPT_MERGED(&filter, N_("print only branches that are merged")),
OPT_NO_MERGED(&filter, N_("print only branches that are not merged")),
OPT_COLUMN(0, "column", &colopts, N_("list branches in columns")),
OPT_CALLBACK(0 , "sort", sorting_tail, N_("key"),
N_("field name to sort on"), &parse_opt_ref_sorting),
{
OPTION_CALLBACK, 0, "points-at", &filter.points_at, N_("object"),
N_("print only branches of the object"), 0, parse_opt_object_name
},
OPT_END(),
};
memset(&filter, 0, sizeof(filter));
filter.kind = FILTER_REFS_BRANCHES;
filter.abbrev = -1;
if (argc == 2 && !strcmp(argv[1], "-h"))
usage_with_options(builtin_branch_usage, options);
git_config(git_branch_config, NULL);
track = git_branch_track;
head = resolve_refdup("HEAD", 0, head_sha1, NULL);
if (!head)
die(_("Failed to resolve HEAD as a valid ref."));
if (!strcmp(head, "HEAD"))
filter.detached = 1;
else if (!skip_prefix(head, "refs/heads/", &head))
die(_("HEAD not found below refs/heads!"));
argc = parse_options(argc, argv, prefix, options, builtin_branch_usage,
0);
if (!delete && !rename && !edit_description && !new_upstream && !unset_upstream && argc == 0)
list = 1;
if (filter.with_commit || filter.merge != REF_FILTER_MERGED_NONE || filter.points_at.nr)
list = 1;
if (!!delete + !!rename + !!new_upstream +
list + unset_upstream > 1)
usage_with_options(builtin_branch_usage, options);
if (filter.abbrev == -1)
filter.abbrev = DEFAULT_ABBREV;
finalize_colopts(&colopts, -1);
if (filter.verbose) {
if (explicitly_enable_column(colopts))
die(_("--column and --verbose are incompatible"));
colopts = 0;
}
if (force) {
delete *= 2;
rename *= 2;
}
if (delete) {
if (!argc)
die(_("branch name required"));
return delete_branches(argc, argv, delete > 1, filter.kind, quiet);
} else if (list) {
/* git branch --local also shows HEAD when it is detached */
if ((filter.kind & FILTER_REFS_BRANCHES) && filter.detached)
filter.kind |= FILTER_REFS_DETACHED_HEAD;
filter.name_patterns = argv;
print_ref_list(&filter, sorting);
print_columns(&output, colopts, NULL);
string_list_clear(&output, 0);
return 0;
}
else if (edit_description) {
const char *branch_name;
struct strbuf branch_ref = STRBUF_INIT;
if (!argc) {
if (filter.detached)
die(_("Cannot give description to detached HEAD"));
branch_name = head;
} else if (argc == 1)
branch_name = argv[0];
else
die(_("cannot edit description of more than one branch"));
strbuf_addf(&branch_ref, "refs/heads/%s", branch_name);
if (!ref_exists(branch_ref.buf)) {
strbuf_release(&branch_ref);
if (!argc)
return error(_("No commit on branch '%s' yet."),
branch_name);
else
return error(_("No branch named '%s'."),
branch_name);
}
strbuf_release(&branch_ref);
if (edit_branch_description(branch_name))
return 1;
} else if (rename) {
if (!argc)
die(_("branch name required"));
else if (argc == 1)
rename_branch(head, argv[0], rename > 1);
else if (argc == 2)
rename_branch(argv[0], argv[1], rename > 1);
else
die(_("too many branches for a rename operation"));
} else if (new_upstream) {
struct branch *branch = branch_get(argv[0]);
if (argc > 1)
die(_("too many branches to set new upstream"));
if (!branch) {
if (!argc || !strcmp(argv[0], "HEAD"))
die(_("could not set upstream of HEAD to %s when "
"it does not point to any branch."),
new_upstream);
die(_("no such branch '%s'"), argv[0]);
}
if (!ref_exists(branch->refname))
die(_("branch '%s' does not exist"), branch->name);
/*
* create_branch takes care of setting up the tracking
* info and making sure new_upstream is correct
*/
create_branch(head, branch->name, new_upstream, 0, 0, 0, quiet, BRANCH_TRACK_OVERRIDE);
} else if (unset_upstream) {
struct branch *branch = branch_get(argv[0]);
struct strbuf buf = STRBUF_INIT;
if (argc > 1)
die(_("too many branches to unset upstream"));
if (!branch) {
if (!argc || !strcmp(argv[0], "HEAD"))
die(_("could not unset upstream of HEAD when "
"it does not point to any branch."));
die(_("no such branch '%s'"), argv[0]);
}
if (!branch_has_merge_config(branch))
die(_("Branch '%s' has no upstream information"), branch->name);
strbuf_addf(&buf, "branch.%s.remote", branch->name);
git_config_set_multivar(buf.buf, NULL, NULL, 1);
strbuf_reset(&buf);
strbuf_addf(&buf, "branch.%s.merge", branch->name);
git_config_set_multivar(buf.buf, NULL, NULL, 1);
strbuf_release(&buf);
} else if (argc > 0 && argc <= 2) {
struct branch *branch = branch_get(argv[0]);
int branch_existed = 0, remote_tracking = 0;
struct strbuf buf = STRBUF_INIT;
if (!strcmp(argv[0], "HEAD"))
die(_("it does not make sense to create 'HEAD' manually"));
if (!branch)
die(_("no such branch '%s'"), argv[0]);
if (filter.kind != FILTER_REFS_BRANCHES)
die(_("-a and -r options to 'git branch' do not make sense with a branch name"));
if (track == BRANCH_TRACK_OVERRIDE)
fprintf(stderr, _("The --set-upstream flag is deprecated and will be removed. Consider using --track or --set-upstream-to\n"));
strbuf_addf(&buf, "refs/remotes/%s", branch->name);
remote_tracking = ref_exists(buf.buf);
strbuf_release(&buf);
branch_existed = ref_exists(branch->refname);
create_branch(head, argv[0], (argc == 2) ? argv[1] : head,
force, reflog, 0, quiet, track);
/*
* We only show the instructions if the user gave us
* one branch which doesn't exist locally, but is the
* name of a remote-tracking branch.
*/
if (argc == 1 && track == BRANCH_TRACK_OVERRIDE &&
!branch_existed && remote_tracking) {
fprintf(stderr, _("\nIf you wanted to make '%s' track '%s', do this:\n\n"), head, branch->name);
fprintf(stderr, _(" git branch -d %s\n"), branch->name);
fprintf(stderr, _(" git branch --set-upstream-to %s\n"), branch->name);
}
} else
usage_with_options(builtin_branch_usage, options);
return 0;
} | [
"993273596@qq.com"
] | 993273596@qq.com |
c2b89d0face9e627acb892cc126b90bc80fbe9b9 | 70a68b26754dea16f643ecb97ce06eeb6ab9f026 | /Multi Asteroids/States/MPState.h | 6c915c30cee938407a5d6d08070505a6b7c36556 | [] | no_license | Mesiow/Masteroids | 726c645206e846b722aa58e0dd8e7be291d6ab9f | 8fc6e4070b3445c21f46bdcd7b524194dead36db | refs/heads/main | 2023-03-03T07:25:58.801357 | 2021-02-10T00:10:31 | 2021-02-10T00:10:31 | 335,388,669 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 575 | h | #pragma once
#include <Game/State/State.h>
#include <Game/Utility/FPSCounter.h>
#include "../Net/Peer.h"
#include "../Entities/Starfield.h"
/*
Multiplayer state instance of the game
*/
class MPState : public State {
public:
MPState(Game* game, bool peerHost = true);
~MPState();
void handleEvents(sf::Event& ev, sf::RenderWindow& window)override;
void handleInput(float dt)override;
void update(float dt)override;
void render(sf::RenderWindow& window)override;
private:
Peer* _peer = nullptr; //multiplayer instance
Starfield _starfield;
FPSCounter _counter;
}; | [
"34993144+Mesiow@users.noreply.github.com"
] | 34993144+Mesiow@users.noreply.github.com |
0e006270e22a72eca287b0b31ab0f1c2e8bcb173 | 08b8cf38e1936e8cec27f84af0d3727321cec9c4 | /data/crawl/wget/new_hunk_3396.cpp | 1e08e6020f4cf4589c866f3ada777c63650a94e1 | [] | no_license | ccdxc/logSurvey | eaf28e9c2d6307140b17986d5c05106d1fd8e943 | 6b80226e1667c1e0760ab39160893ee19b0e9fb1 | refs/heads/master | 2022-01-07T21:31:55.446839 | 2018-04-21T14:12:43 | 2018-04-21T14:12:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 464 | cpp | {
if (!chain->permanent)
continue;
if (COOKIE_EXPIRED_P (chain))
continue;
fputs (domain, fp);
if (chain->port != PORT_ANY)
fprintf (fp, ":%d", chain->port);
fprintf (fp, "\t%s\t%s\t%s\t%.0f\t%s\t%s\n",
*domain == '.' ? "TRUE" : "FALSE",
chain->path, chain->secure ? "TRUE" : "FALSE",
(double)chain->expiry_time,
chain->attr, chain->value);
if (ferror (fp))
return 1; /* stop mapping */
| [
"993273596@qq.com"
] | 993273596@qq.com |
72d10785b1bc7d491792b0cc8651351817ae6564 | aec59736ecb6c6d4a3d37f1acaa0b033bd6fa6f8 | /QuickFindTheTank/TextBox.h | 368e0a0505e9119b201f6b0b23fbb4f39293eec0 | [] | no_license | lucas-b700/QuickFindTheTank | 1b62d1320767cc73eede3e9b85cf714896cf0b0f | d136423773ec816b2c9336570cc5d360fcaffd9b | refs/heads/master | 2023-05-30T05:08:17.966690 | 2021-06-11T11:59:39 | 2021-06-11T11:59:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,313 | h | #pragma once
#include <iostream>
#include <string>
#include <SFML/Graphics.hpp>
#include <sstream>
#define DELETE_KEY 8
#define ENTER_KEY 13
#define ESCAPE_KEY 27
class TextBox {
public:
TextBox()
{
}
~TextBox()
{
}
TextBox (int size, sf::Color color, bool sel)
{
textbox.setCharacterSize(size);
//textbox.setColor(color);
isSelected = sel;
if (sel)
{
textbox.setString("_");
}
else
{
textbox.setString("");
}
}
void setFont(sf::Font& font) //Font
{
textbox.setFont(font);
}
void setPosition(sf::Vector2f pos) //Position
{
textbox.setPosition(pos);
}
//Characters limit
void setLimit(bool ToF)
{
hasLimit = ToF;
}
void setLimit(bool ToF, int lim)
{
hasLimit = ToF;
limit = lim - 1;
}
void setSelected(bool sel)
{
isSelected = sel;
if (!sel)
{
std::string t = text.str();
std::string newT = "";
for (int i = 0; i < t.length() - 1; i++)
{
newT += t[i];
}
textbox.setString(newT);
}
}
std::string getText()
{
return text.str();
}
void drawTo(sf::RenderWindow& window) //Draw the textbox
{
window.draw(textbox);
}
void typedOn(sf::Event input) //Typed on textbox
{
if (isSelected)
{
int charTyped = input.text.unicode;
if (charTyped < 128)
{
if (hasLimit)
{
if (text.str().length() <= limit)
{
inputLogic(charTyped);
}
else if (text.str().length() > limit && charTyped == DELETE_KEY)
{
deleteLastChar();
}
}
else
{
inputLogic(charTyped);
}
}
}
}
private:
sf::Text textbox;
std::ostringstream text;
bool isSelected = false;
bool hasLimit = false;
int limit;
void inputLogic(int charTyped)
{
if (charTyped != DELETE_KEY && charTyped != ENTER_KEY && charTyped != ESCAPE_KEY)
{
text << static_cast<char>(charTyped);
}
else if (charTyped == DELETE_KEY)
{
if (text.str().length() > 0)
{
deleteLastChar();
}
}
if (text.str().length() == 0)
textbox.setString(text.str() + "Veuillez entrer un nom");
else
textbox.setString(text.str() + "_");
}
void deleteLastChar() //Delete
{
std::string t = text.str();
std::string newT = "";
for (int i = 0; i < t.length() - 1; i++)
{
newT += t[i];
}
text.str("");
text << newT;
textbox.setString(text.str());
}
}; | [
"lucas89.lucas89@gmail.com"
] | lucas89.lucas89@gmail.com |
75275d660a06d86047c23a2ae2d589a1d8fd209f | eb40a068cef3cabd7a0df37a0ec2bde3c1e4e5ae | /dnn/src/fallback/matrix_mul_helper.h | f43acc00d6c83541792e251e740e0dd99bed3e6e | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla"
] | permissive | tpoisonooo/MegEngine | ccb5c089a951e848344f136eaf10a5c66ae8eb6f | b8f7ad47419ef287a1ca17323fd6362c6c69445c | refs/heads/master | 2022-11-07T04:50:40.987573 | 2021-05-27T08:55:50 | 2021-05-27T08:55:50 | 249,964,363 | 1 | 0 | NOASSERTION | 2021-05-27T08:55:50 | 2020-03-25T11:48:35 | null | UTF-8 | C++ | false | false | 1,197 | h | /**
* \file dnn/src/fallback/matrix_mul_helper.h
* MegEngine is Licensed under the Apache License, Version 2.0 (the "License")
*
* Copyright (c) 2014-2021 Megvii Inc. All rights reserved.
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT ARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#pragma once
#include <cstddef>
#include <cstring>
namespace megdnn {
namespace fallback {
template <typename src_type, typename weight_type, typename dst_type>
void run_matrix_mul_tpl(const src_type * __restrict src,
const weight_type * __restrict weight,
dst_type * __restrict dst,
size_t batch_size, size_t nr_inputs, size_t nr_outputs)
{
for (size_t b = 0; b < batch_size; ++b) {
std::memset(dst, 0, sizeof(dst_type) * nr_outputs);
for (size_t i = 0; i < nr_inputs; ++i)
for (size_t o = 0; o < nr_outputs; ++o)
{
dst[o] += weight[i*nr_outputs + o] * src[i];
}
src += nr_inputs;
dst += nr_outputs;
}
}
} // namespace fallback
} // namespace megdnn
// vim: syntax=cpp.doxygen
| [
"megengine@megvii.com"
] | megengine@megvii.com |
1817939d42b67c3afd15995f963aee4f33e81e56 | 51c6f5f1ad140301e801b8944aada031b63c5d9c | /engine/gui/core/guiTypes.h | e0c7201a1e6d2960dcbdc6758d2b9e0c90f6a34e | [
"LicenseRef-scancode-other-permissive",
"MIT"
] | permissive | ClayHanson/B4v21-Launcher-Public-Repo | 916f1e47e7c1b9069b151751db9ee4d7df6420ed | c812aa7bf2ecb267e02969c85f0c9c2a29be0d28 | refs/heads/master | 2022-11-28T19:54:47.391592 | 2020-08-06T18:59:30 | 2020-08-06T18:59:30 | 285,645,055 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,950 | h | //-----------------------------------------------------------------------------
// Torque Game Engine
// Copyright (C) GarageGames.com, Inc.
//-----------------------------------------------------------------------------
#ifndef _GUITYPES_H_
#define _GUITYPES_H_
#ifndef _GFONT_H_
#include "dgl/gFont.h"
#endif
#ifndef _COLOR_H_
#include "core/color.h"
#endif
#ifndef _SIMBASE_H_
#include "console/simBase.h"
#endif
#ifndef _GTEXMANAGER_H_
#include "dgl/gTexManager.h"
#endif
#ifndef _PLATFORMAUDIO_H_
#include "platform/platformAudio.h"
#endif
#ifndef _AUDIODATABLOCK_H_
#include "audio/audioDataBlock.h"
#endif
class GBitmap;
/// Represents a single GUI event.
///
/// This is passed around to all the relevant controls so they know what's going on.
struct GuiEvent
{
U16 ascii; ///< ascii character code 'a', 'A', 'b', '*', etc (if device==keyboard) - possibly a uchar or something
U8 modifier; ///< SI_LSHIFT, etc
U8 keyCode; ///< for unprintables, 'tab', 'return', ...
Point2I mousePoint; ///< for mouse events
U8 mouseClickCount; ///< to determine double clicks, etc...
};
class GuiCursor : public SimObject
{
private:
typedef SimObject Parent;
StringTableEntry mBitmapName;
Point2I mHotSpot;
Point2F mRenderOffset;
Point2I mExtent;
TextureHandle mTextureHandle;
public:
Point2I getHotSpot() { return mHotSpot; }
Point2I getExtent() { return mExtent; }
DECLARE_CONOBJECT(GuiCursor);
GuiCursor(void);
~GuiCursor(void);
static void initPersistFields();
bool onAdd(void);
void onRemove();
void render(const Point2I &pos);
};
/// A GuiControlProfile is used by every GuiObject and is akin to a
/// datablock. It is used to control information that does not change
/// or is unlikely to change during execution of a program. It is also
/// a level of abstraction between script and GUI control so that you can
/// use the same control, say a button, and have it look completly different
/// just with a different profile.
class GuiControlProfile : public SimObject
{
private:
typedef SimObject Parent;
public:
S32 mRefCount; ///< Used to determine if any controls are using this profile
bool mTabable; ///< True if this object is accessable from using the tab key
static StringTableEntry sFontCacheDirectory;
bool mCanKeyFocus; ///< True if the object can be given keyboard focus (in other words, made a first responder @see GuiControl)
bool mModal; ///< True if this is a Modeless dialog meaning it will pass input through instead of taking it all
bool mOutlineFont; ///< True if the font rendered should be outlined
S32 mOutlineWidth; ///< Width of the font outline
ColorI mOutlineColor; ///< Outline color
ColorI mOutlineColorHL; ///< Outline color for when this object is highlighted
ColorI mOutlineColorNA; ///< Outline color for when this object is disabled
ColorI mOutlineColorSEL; ///< Outline color for when this object is selected
bool mOpaque; ///< True if this object is not translucent
ColorI mFillColor; ///< Fill color, this is used to fill the bounds of the control if it is opaque
ColorI mFillColorHL; ///< This is used insetead of mFillColor if the object is highlited
ColorI mFillColorNA; ///< This is used to instead of mFillColor if the object is not active or disabled
S32 mBorder; ///< For most controls, if mBorder is > 0 a border will be drawn, some controls use this to draw different types of borders however @see guiDefaultControlRender.cc
S32 mBorderThickness; ///< Border thickness
ColorI mBorderColor; ///< Border color, used to draw a border around the bounds if border is enabled
ColorI mBorderColorHL; ///< Used instead of mBorderColor when the object is highlited
ColorI mBorderColorNA; ///< Used instead of mBorderColor when the object is not active or disabled
ColorI mBevelColorHL; ///< Used for the high-light part of the bevel
ColorI mBevelColorLL; ///< Used for the low-light part of the bevel
// font members
StringTableEntry mFontType; ///< Font face name for the control
S32 mFontSize; ///< Font size for the control
enum {
BaseColor = 0,
ColorHL,
ColorNA,
ColorSEL,
ColorUser0,
ColorUser1,
ColorUser2,
ColorUser3,
ColorUser4,
ColorUser5,
};
ColorI mFontColors[10]; ///< Array of font colors used for drawText with escape characters for changing color mid-string
ColorI& mFontColor; ///< Main font color
ColorI& mFontColorHL; ///< Highlited font color
ColorI& mFontColorNA; ///< Font color when object is not active/disabled
ColorI& mFontColorSEL; ///< Font color when object/text is selected
FontCharset mFontCharset; ///< Font character set
Resource<GFont> mFont; ///< Font resource
enum AlignmentType
{
LeftJustify,
RightJustify,
CenterJustify
};
AlignmentType mAlignment; ///< Horizontal text alignment
bool mAutoSizeWidth; ///< Auto-size the width-bounds of the control to fit it's contents
bool mAutoSizeHeight; ///< Auto-size the height-bounds of the control to fit it's contents
bool mReturnTab; ///< Used in GuiTextEditCtrl to specify if a tab-event should be simulated when return is pressed.
bool mNumbersOnly; ///< For text controls, true if this should only accept numerical data
bool mMouseOverSelected; ///< True if this object should be "selected" while the mouse is over it
ColorI mCursorColor; ///< Color for the blinking cursor in text fields (for example)
Point2I mTextOffset; ///< Text offset for the control
// bitmap members
StringTableEntry mBitmapName; ///< Bitmap file name for the bitmap of the control
TextureHandle mTextureHandle; ///< Texture handle for the control
Vector<RectI> mBitmapArrayRects; ///< Used for controls which use an array of bitmaps such as checkboxes
// sound members
AudioProfile *mSoundButtonDown; ///< Sound played when the object is "down" ie a button is pushed
AudioProfile *mSoundButtonOver; ///< Sound played when the mouse is over the object
GuiControlProfile* mProfileForChildren; ///< Profile used with children controls (such as the scroll bar on a popup menu) when defined.
public:
DECLARE_CONOBJECT(GuiControlProfile);
GuiControlProfile();
~GuiControlProfile();
static void initPersistFields();
bool onAdd();
/// This method creates an array of bitmaps from one single bitmap with
/// seperator color. The seperator color is whatever color is in pixel 0,0
/// of the bitmap. For an example see darkWindow.png and some of the other
/// UI textures. It returns the number of bitmaps in the array it created
/// It also stores the sizes in the mBitmapArrayRects vector.
S32 constructBitmapArray();
void incRefCount();
void decRefCount();
};
DefineConsoleType( TypeGuiProfile)
#endif //_GUITYPES_H
| [
"11217112+ClayHanson@users.noreply.github.com"
] | 11217112+ClayHanson@users.noreply.github.com |
a0f457fcf015171530a6950522d6e617ecb2846b | ba99077bcefee6b45d392c18ec9b1c8764564128 | /刷题/洛谷刷题/数学/P1866 编号 .cpp | 5f93fbfa97ff277ade97976b89d3534782f32e87 | [] | no_license | Chicaogo/WinCode | 5f1c25b84f0714029a118d64509891f222a8e5b8 | b35b9a4137fa69f516d361826a0ac35844490a90 | refs/heads/master | 2021-06-30T19:06:41.067956 | 2019-06-04T13:51:13 | 2019-06-04T13:51:13 | 149,734,100 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 590 | cpp | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x = 0,t = 1; char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-') t = -1; ch = getchar();}
while(ch >= '0' && ch <= '9'){x = x*10+ch-'0'; ch = getchar();}
return x*t;
}
const int mod = 1000000007;
int n,i,num[51];
long long ans=1;
inline void init()
{
n = read();
for(int i = 1;i <= n;++i) num[i] = read();
std::sort(num+1,num+n+1);
for(int i = 1;i <= n;++i)
{
ans*=(num[i]-i+1);
ans%=mod;
}
}
int main(void)
{
ios_base::sync_with_stdio(false);
init();
cout << ans;
return 0;
}
| [
"chicago01@qq.com"
] | chicago01@qq.com |
6b38cd638ef1b62e9ae8b91a489950f5f2416b77 | 2ed1e3583f87c4b4d935c03dffcb9a1dc7482056 | /libavrlit/src/serial/hardware.cpp | 0f71235e752d43d3e8da26c212694bbfaa25c821 | [] | no_license | avr-llvm/avrlit | 57d0fc17e7ef5a8db3fc70ada090fc20a73b98bd | 5e90eff5551c7d39bcab520c587f0bfe67b0a993 | refs/heads/master | 2020-12-21T18:24:44.254778 | 2016-12-16T11:37:16 | 2016-12-16T11:37:16 | 60,456,481 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 713 | cpp | #include "hardware.h"
#include <avr/io.h>
using namespace avrlit;
#define USART_BAUDRATE 9600
#define BAUD_PRESCALE (((F_CPU/(USART_BAUDRATE*16UL)))-1)
HardwareSerial::HardwareSerial() {
UCSR0B |= (1<<RXEN0) | (1<<TXEN0);
UCSR0C |= (1<<UCSZ00) | (1<<UCSZ01);
UBRR0H = (BAUD_PRESCALE >> 8);
UBRR0L = BAUD_PRESCALE;
}
void HardwareSerial::send(uint8_t byte) {
// wait until the port is ready to be written to
while(( UCSR0A & ( 1 << UDRE0 )) == 0 ) {}
// write the byte to the serial port
UDR0 = byte;
}
uint8_t HardwareSerial::receive_byte() {
// wait until a byte is ready to read
while(( UCSR0A & ( 1 << RXC0 ) ) == 0 ) { }
// grab the byte from the serial port
return UDR0;
}
| [
"dylanmckay34@gmail.com"
] | dylanmckay34@gmail.com |
56796c211dfc31880658ee70cb5d6784ee30320c | 37ac2cf5e3cad7486f48b63792ddc7ec59b2ef7b | /c_classic_function/strcmp.cc | ed0011c796c10e96e1977ee7cd48711ab9cf8fa2 | [] | no_license | journeynight/algorithm-ds | d371bf6986943117d723b979a6444bdce818b921 | ebe2f4b148b17923ac7fcdf72543b0715b65b701 | refs/heads/master | 2020-04-07T19:28:42.591165 | 2019-05-15T12:03:22 | 2019-05-15T12:03:22 | 158,650,381 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 886 | cc | #include <bits/stdc++.h>
using namespace std;
int strcmp1(const char *s1,const char *s2){
assert(s1 && s2);
int ret = 0;
while(!(ret = *(unsigned char *)s1 - *(unsigned char *)s2) && *s1){
++s1;
++s2;
}
return ret;
}
int strcmp2(const char *s1,const char *s2){
assert(s1 && s2);
while(*s1 && *s1 == *s2){
++s1;
++s2;
}
return *(unsigned char*)s1 - *(unsigned char *)(s2);
}
int strcmp3(const char *s1,const char *s2){
assert(s1 && s2);
while(*s1 == *s2++){
if(*s1++ == '\0')
return 0;
}
return *(unsigned char*)s1 - *(unsigned char *)(--s2);
}
int main(){
string s1,s2;
while(cin >> s1 >> s2){
cout<<strcmp1(s1.c_str(),s2.c_str())<<endl;
cout<<strcmp2(s1.c_str(),s2.c_str())<<endl;
cout<<strcmp3(s1.c_str(),s2.c_str())<<endl;
}
return 0;
}
| [
"2268442202@qq.com"
] | 2268442202@qq.com |
b101d98de17620a26712ac7ebd60bccc3eec54c7 | 49f61551c5b37aa13db91b561bbdfd7ccdd8fe71 | /2020-11/452.cpp | 03d86686b75d204a14863dacc7b8bd0419643252 | [] | no_license | q545244819/leetcode | 232ee45f30058d436763b0ca832b1a8bdf77fb6f | 482c7785f7395d4838efa123c005611345e0e8b2 | refs/heads/master | 2023-02-21T21:58:47.581584 | 2021-01-16T14:10:45 | 2021-01-16T14:10:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 862 | cpp | class Solution {
public:
int findMinArrowShots(vector<vector<int>>& points) {
// 思路：排序+区间合并，合并后的区间数量为答案
int n = points.size();
if (n == 0)
return 0;
sort(points.begin(), points.end(), [](const auto& a, const auto& b) {
if (a[0] != b[0])
return a[0] < b[0];
else
return a[1] < b[1];
});
int ans = 1;
int xs = points[0][0], xe = points[0][1];
for (int i = 1; i < n; i++) {
if (points[i][0] <= xe) {
xs = max(xs, points[i][0]);
xe = min(xe, points[i][1]);
} else {
ans++;
xs = points[i][0];
xe = points[i][1];
}
}
return ans;
}
}; | [
"545244819@qq.com"
] | 545244819@qq.com |
1fa26783de0fc0d0aa54a62834cc4ec4919c0b8c | df6c3d7d95507bf452ce8eda24e779a82049fcad | /final-project/simulationNonInertial/51/p | 0f84751b66da32c98f7197ebd158253f179773f6 | [] | no_license | aeronau/CFD-course | 5c555e7869f0170f90e9d3532b06f7e78683b770 | e891eb94950cfa0992d6ff003dbe45315af377c5 | refs/heads/master | 2021-09-01T04:18:32.111694 | 2017-12-24T18:18:44 | 2017-12-24T18:18:44 | 104,058,197 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 58,484 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 4.1 |
| \\ / A nd | Web: www.OpenFOAM.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class volScalarField;
location "51";
object p;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [0 2 -2 0 0 0 0];
internalField nonuniform List<scalar>
4432
(
-3.78014e+10
-3.96506e+10
-4.05004e+10
-3.85791e+10
-3.82618e+10
-3.86723e+10
-3.85004e+10
-3.83435e+10
-3.82358e+10
-3.8178e+10
-3.81226e+10
-3.80453e+10
-3.79389e+10
-3.78129e+10
-3.76914e+10
-3.75747e+10
-3.74382e+10
-3.72788e+10
-3.71005e+10
-3.69068e+10
-3.6697e+10
-3.64745e+10
-3.62429e+10
-3.60062e+10
-3.57682e+10
-3.55327e+10
-3.53021e+10
-3.5078e+10
-3.4861e+10
-3.46515e+10
-3.44498e+10
-3.42583e+10
-3.40812e+10
-3.39241e+10
-3.37942e+10
-3.36993e+10
-3.36452e+10
-3.36328e+10
-3.36542e+10
-3.36917e+10
-3.37179e+10
-3.36993e+10
-3.36048e+10
-3.34247e+10
-3.31942e+10
-3.29932e+10
-3.28751e+10
-3.27447e+10
-3.24373e+10
-3.24631e+10
-3.51341e+10
-4.27265e+10
-4.82751e+10
-2.43298e+10
-3.8374e+10
-3.90538e+10
-3.95356e+10
-3.91448e+10
-3.83684e+10
-3.85445e+10
-3.84851e+10
-3.83167e+10
-3.82103e+10
-3.81719e+10
-3.81273e+10
-3.80459e+10
-3.79325e+10
-3.78072e+10
-3.76898e+10
-3.75742e+10
-3.74357e+10
-3.72744e+10
-3.70966e+10
-3.69027e+10
-3.6692e+10
-3.64685e+10
-3.62353e+10
-3.5997e+10
-3.57574e+10
-3.55202e+10
-3.52878e+10
-3.50623e+10
-3.48442e+10
-3.46338e+10
-3.44316e+10
-3.42395e+10
-3.40615e+10
-3.39034e+10
-3.37725e+10
-3.36761e+10
-3.36195e+10
-3.3603e+10
-3.36181e+10
-3.36465e+10
-3.36599e+10
-3.36242e+10
-3.35074e+10
-3.32987e+10
-3.3031e+10
-3.27793e+10
-3.25853e+10
-3.23264e+10
-3.178e+10
-3.13829e+10
-3.35284e+10
-4.14177e+10
-4.90935e+10
-2.84287e+10
-3.86975e+10
-3.88058e+10
-3.89753e+10
-3.92539e+10
-3.85406e+10
-3.83989e+10
-3.84827e+10
-3.83441e+10
-3.82355e+10
-3.81993e+10
-3.81556e+10
-3.80978e+10
-3.80064e+10
-3.788e+10
-3.77489e+10
-3.76326e+10
-3.75063e+10
-3.73509e+10
-3.71735e+10
-3.69764e+10
-3.67615e+10
-3.65318e+10
-3.62912e+10
-3.6045e+10
-3.57979e+10
-3.55545e+10
-3.53176e+10
-3.50897e+10
-3.48715e+10
-3.46634e+10
-3.44657e+10
-3.42805e+10
-3.41124e+10
-3.39656e+10
-3.38444e+10
-3.37561e+10
-3.37058e+10
-3.36936e+10
-3.37115e+10
-3.37415e+10
-3.3755e+10
-3.3718e+10
-3.35998e+10
-3.33892e+10
-3.3119e+10
-3.2865e+10
-3.26545e+10
-3.23248e+10
-3.16605e+10
-3.13437e+10
-3.42773e+10
-4.31566e+10
-5.05517e+10
-3.19934e+10
-3.87068e+10
-3.90113e+10
-3.91827e+10
-3.90051e+10
-3.85119e+10
-3.84102e+10
-3.84832e+10
-3.83226e+10
-3.823e+10
-3.81952e+10
-3.81595e+10
-3.81008e+10
-3.80035e+10
-3.78737e+10
-3.7746e+10
-3.76365e+10
-3.75093e+10
-3.73496e+10
-3.71725e+10
-3.69754e+10
-3.67602e+10
-3.65298e+10
-3.62883e+10
-3.60408e+10
-3.57921e+10
-3.55468e+10
-3.53078e+10
-3.50777e+10
-3.48573e+10
-3.46474e+10
-3.4448e+10
-3.42606e+10
-3.40885e+10
-3.39365e+10
-3.38109e+10
-3.37177e+10
-3.36611e+10
-3.36414e+10
-3.36504e+10
-3.36697e+10
-3.3671e+10
-3.36206e+10
-3.34881e+10
-3.32628e+10
-3.29775e+10
-3.27032e+10
-3.24617e+10
-3.2079e+10
-3.13182e+10
-3.09513e+10
-3.44274e+10
-4.49086e+10
-5.09988e+10
-2.53928e+10
-3.94285e+10
-3.913e+10
-3.8571e+10
-3.9106e+10
-3.87074e+10
-3.8398e+10
-3.83093e+10
-3.82348e+10
-3.8189e+10
-3.81678e+10
-3.81364e+10
-3.8097e+10
-3.80182e+10
-3.78981e+10
-3.77726e+10
-3.76575e+10
-3.75316e+10
-3.73799e+10
-3.72073e+10
-3.7012e+10
-3.67958e+10
-3.65614e+10
-3.63129e+10
-3.6056e+10
-3.57961e+10
-3.55387e+10
-3.52875e+10
-3.50459e+10
-3.48158e+10
-3.45991e+10
-3.43955e+10
-3.42043e+10
-3.40278e+10
-3.38741e+10
-3.37497e+10
-3.36588e+10
-3.36059e+10
-3.35895e+10
-3.36014e+10
-3.36231e+10
-3.36277e+10
-3.35853e+10
-3.34733e+10
-3.32922e+10
-3.30882e+10
-3.29437e+10
-3.28766e+10
-3.26868e+10
-3.20994e+10
-3.18067e+10
-3.47711e+10
-4.37396e+10
-5.02709e+10
-2.56375e+10
-3.91122e+10
-3.92554e+10
-3.90423e+10
-3.86866e+10
-3.85913e+10
-3.84705e+10
-3.83564e+10
-3.82328e+10
-3.81967e+10
-3.81689e+10
-3.81343e+10
-3.80873e+10
-3.80052e+10
-3.78854e+10
-3.7761e+10
-3.76516e+10
-3.75246e+10
-3.73705e+10
-3.71973e+10
-3.70023e+10
-3.67866e+10
-3.65526e+10
-3.63048e+10
-3.60484e+10
-3.57892e+10
-3.55324e+10
-3.52818e+10
-3.50406e+10
-3.48108e+10
-3.45941e+10
-3.43904e+10
-3.42e+10
-3.40255e+10
-3.38721e+10
-3.3746e+10
-3.36533e+10
-3.35975e+10
-3.35773e+10
-3.35845e+10
-3.36001e+10
-3.35964e+10
-3.35427e+10
-3.34141e+10
-3.32067e+10
-3.29585e+10
-3.27384e+10
-3.25451e+10
-3.21461e+10
-3.12313e+10
-3.05381e+10
-3.33048e+10
-4.27321e+10
-5.08231e+10
-2.9623e+10
-3.8919e+10
-3.9044e+10
-3.88396e+10
-3.86665e+10
-3.86778e+10
-3.85395e+10
-3.83922e+10
-3.82776e+10
-3.82274e+10
-3.82013e+10
-3.81724e+10
-3.81395e+10
-3.80742e+10
-3.79758e+10
-3.787e+10
-3.77642e+10
-3.76399e+10
-3.74907e+10
-3.73195e+10
-3.71234e+10
-3.69026e+10
-3.66586e+10
-3.63962e+10
-3.61222e+10
-3.58442e+10
-3.55691e+10
-3.53027e+10
-3.50494e+10
-3.48128e+10
-3.45952e+10
-3.43953e+10
-3.42083e+10
-3.40344e+10
-3.38893e+10
-3.37833e+10
-3.37073e+10
-3.36669e+10
-3.3663e+10
-3.36832e+10
-3.37076e+10
-3.37086e+10
-3.36583e+10
-3.35379e+10
-3.33542e+10
-3.31605e+10
-3.30425e+10
-3.30193e+10
-3.28912e+10
-3.23519e+10
-3.19733e+10
-3.46749e+10
-4.39398e+10
-5.27686e+10
-3.15512e+10
-3.89818e+10
-3.89269e+10
-3.8678e+10
-3.84591e+10
-3.86346e+10
-3.86251e+10
-3.84267e+10
-3.8277e+10
-3.823e+10
-3.81963e+10
-3.8166e+10
-3.81278e+10
-3.80605e+10
-3.79652e+10
-3.7864e+10
-3.77606e+10
-3.7635e+10
-3.74853e+10
-3.7314e+10
-3.71184e+10
-3.6898e+10
-3.66544e+10
-3.63925e+10
-3.61192e+10
-3.58421e+10
-3.55684e+10
-3.53036e+10
-3.50518e+10
-3.48158e+10
-3.45974e+10
-3.43967e+10
-3.42129e+10
-3.40476e+10
-3.39063e+10
-3.37952e+10
-3.37208e+10
-3.36841e+10
-3.36813e+10
-3.37037e+10
-3.37302e+10
-3.37319e+10
-3.36791e+10
-3.35505e+10
-3.33482e+10
-3.31166e+10
-3.29298e+10
-3.27892e+10
-3.24656e+10
-3.16535e+10
-3.11511e+10
-3.45414e+10
-4.52647e+10
-5.26593e+10
-2.66889e+10
-3.86059e+10
-3.86144e+10
-3.85946e+10
-3.84063e+10
-3.847e+10
-3.8433e+10
-3.83353e+10
-3.82417e+10
-3.82032e+10
-3.81958e+10
-3.81781e+10
-3.81347e+10
-3.80727e+10
-3.79927e+10
-3.7908e+10
-3.78126e+10
-3.76944e+10
-3.75512e+10
-3.73826e+10
-3.7186e+10
-3.69593e+10
-3.67026e+10
-3.64209e+10
-3.61222e+10
-3.58175e+10
-3.55166e+10
-3.52279e+10
-3.49568e+10
-3.47067e+10
-3.44787e+10
-3.42711e+10
-3.40803e+10
-3.39077e+10
-3.37639e+10
-3.36573e+10
-3.35874e+10
-3.3555e+10
-3.35575e+10
-3.35822e+10
-3.36078e+10
-3.36061e+10
-3.35477e+10
-3.34128e+10
-3.32082e+10
-3.29848e+10
-3.28242e+10
-3.27439e+10
-3.25412e+10
-3.18619e+10
-3.10924e+10
-3.30173e+10
-4.23762e+10
-5.57362e+10
-4.17357e+10
-3.8745e+10
-3.85942e+10
-3.83909e+10
-3.82831e+10
-3.84638e+10
-3.84772e+10
-3.83662e+10
-3.82622e+10
-3.82066e+10
-3.81839e+10
-3.81669e+10
-3.81313e+10
-3.80718e+10
-3.79952e+10
-3.79135e+10
-3.78195e+10
-3.77011e+10
-3.75576e+10
-3.73886e+10
-3.71914e+10
-3.69638e+10
-3.67061e+10
-3.64228e+10
-3.61229e+10
-3.5817e+10
-3.55156e+10
-3.52266e+10
-3.49547e+10
-3.47024e+10
-3.44706e+10
-3.42594e+10
-3.40678e+10
-3.38964e+10
-3.37504e+10
-3.36367e+10
-3.35602e+10
-3.35223e+10
-3.35187e+10
-3.35374e+10
-3.35571e+10
-3.35494e+10
-3.34843e+10
-3.33412e+10
-3.31263e+10
-3.28893e+10
-3.27101e+10
-3.26043e+10
-3.23642e+10
-3.16769e+10
-3.12438e+10
-3.45428e+10
-4.54753e+10
-5.45316e+10
-3.03088e+10
-3.85498e+10
-3.84544e+10
-3.83856e+10
-3.83223e+10
-3.837e+10
-3.83717e+10
-3.8317e+10
-3.82474e+10
-3.82114e+10
-3.82208e+10
-3.82345e+10
-3.82049e+10
-3.81537e+10
-3.80941e+10
-3.80266e+10
-3.79406e+10
-3.78294e+10
-3.76905e+10
-3.75227e+10
-3.73227e+10
-3.70855e+10
-3.68092e+10
-3.64974e+10
-3.61627e+10
-3.58214e+10
-3.54896e+10
-3.51786e+10
-3.48936e+10
-3.4636e+10
-3.44043e+10
-3.41956e+10
-3.40083e+10
-3.38449e+10
-3.37097e+10
-3.3606e+10
-3.35385e+10
-3.35089e+10
-3.35128e+10
-3.35375e+10
-3.35622e+10
-3.35591e+10
-3.34996e+10
-3.33647e+10
-3.31622e+10
-3.2943e+10
-3.27898e+10
-3.27324e+10
-3.25936e+10
-3.20492e+10
-3.15392e+10
-3.38789e+10
-4.30471e+10
-5.31715e+10
-3.17382e+10
-3.85755e+10
-3.84756e+10
-3.83638e+10
-3.82944e+10
-3.83829e+10
-3.83743e+10
-3.83163e+10
-3.82675e+10
-3.82361e+10
-3.82325e+10
-3.82305e+10
-3.82043e+10
-3.81572e+10
-3.80997e+10
-3.80325e+10
-3.79462e+10
-3.78338e+10
-3.7694e+10
-3.75255e+10
-3.73248e+10
-3.70874e+10
-3.68111e+10
-3.65e+10
-3.61663e+10
-3.58263e+10
-3.54956e+10
-3.51851e+10
-3.49002e+10
-3.46419e+10
-3.44084e+10
-3.41974e+10
-3.40077e+10
-3.38398e+10
-3.36974e+10
-3.35858e+10
-3.35092e+10
-3.34692e+10
-3.34618e+10
-3.34743e+10
-3.34856e+10
-3.34684e+10
-3.33934e+10
-3.32415e+10
-3.30211e+10
-3.27848e+10
-3.26179e+10
-3.25517e+10
-3.24091e+10
-3.18862e+10
-3.15437e+10
-3.4494e+10
-4.43842e+10
-5.25854e+10
-2.70252e+10
-3.83256e+10
-3.82542e+10
-3.82058e+10
-3.82286e+10
-3.82678e+10
-3.82885e+10
-3.8266e+10
-3.82229e+10
-3.82073e+10
-3.82326e+10
-3.82492e+10
-3.82364e+10
-3.8209e+10
-3.81724e+10
-3.812e+10
-3.80441e+10
-3.79389e+10
-3.78016e+10
-3.76316e+10
-3.74245e+10
-3.71725e+10
-3.6867e+10
-3.65096e+10
-3.6119e+10
-3.57213e+10
-3.53419e+10
-3.49964e+10
-3.46912e+10
-3.44249e+10
-3.41914e+10
-3.39845e+10
-3.38017e+10
-3.36437e+10
-3.35119e+10
-3.34076e+10
-3.33347e+10
-3.32949e+10
-3.32845e+10
-3.32923e+10
-3.32981e+10
-3.32756e+10
-3.31978e+10
-3.30479e+10
-3.28354e+10
-3.26121e+10
-3.24638e+10
-3.24305e+10
-3.23532e+10
-3.19307e+10
-3.16375e+10
-3.43849e+10
-4.36522e+10
-5.15354e+10
-2.6432e+10
-3.82842e+10
-3.82359e+10
-3.827e+10
-3.82688e+10
-3.82732e+10
-3.82558e+10
-3.82416e+10
-3.82286e+10
-3.82281e+10
-3.82402e+10
-3.82456e+10
-3.82341e+10
-3.82087e+10
-3.81721e+10
-3.8119e+10
-3.80413e+10
-3.79337e+10
-3.77941e+10
-3.7621e+10
-3.74106e+10
-3.71546e+10
-3.68447e+10
-3.64834e+10
-3.60885e+10
-3.56872e+10
-3.53039e+10
-3.49548e+10
-3.46465e+10
-3.43781e+10
-3.41438e+10
-3.39376e+10
-3.37554e+10
-3.35971e+10
-3.34642e+10
-3.33591e+10
-3.32849e+10
-3.32428e+10
-3.32288e+10
-3.32311e+10
-3.32291e+10
-3.31956e+10
-3.31025e+10
-3.29314e+10
-3.26904e+10
-3.24294e+10
-3.22311e+10
-3.21281e+10
-3.19499e+10
-3.13736e+10
-3.07894e+10
-3.29157e+10
-4.17587e+10
-5.15259e+10
-3.17147e+10
-3.81728e+10
-3.81096e+10
-3.81113e+10
-3.81867e+10
-3.82407e+10
-3.82403e+10
-3.82122e+10
-3.81874e+10
-3.82064e+10
-3.82559e+10
-3.82812e+10
-3.82867e+10
-3.82846e+10
-3.82723e+10
-3.82421e+10
-3.81855e+10
-3.80953e+10
-3.79686e+10
-3.78047e+10
-3.76014e+10
-3.73462e+10
-3.70192e+10
-3.66152e+10
-3.61575e+10
-3.56909e+10
-3.52533e+10
-3.48669e+10
-3.45384e+10
-3.42629e+10
-3.40294e+10
-3.3828e+10
-3.36527e+10
-3.34997e+10
-3.33683e+10
-3.32607e+10
-3.31797e+10
-3.31258e+10
-3.30943e+10
-3.3073e+10
-3.30419e+10
-3.29744e+10
-3.28432e+10
-3.26315e+10
-3.23482e+10
-3.20428e+10
-3.17966e+10
-3.16419e+10
-3.1409e+10
-3.07666e+10
-3.01034e+10
-3.22612e+10
-4.14449e+10
-5.16988e+10
-3.28871e+10
-3.81241e+10
-3.80698e+10
-3.81542e+10
-3.82416e+10
-3.82413e+10
-3.82034e+10
-3.81977e+10
-3.81992e+10
-3.82192e+10
-3.82532e+10
-3.82761e+10
-3.82859e+10
-3.82862e+10
-3.82754e+10
-3.82462e+10
-3.81905e+10
-3.81019e+10
-3.79768e+10
-3.78147e+10
-3.76127e+10
-3.73584e+10
-3.70328e+10
-3.66299e+10
-3.6174e+10
-3.57085e+10
-3.52712e+10
-3.48841e+10
-3.45541e+10
-3.42772e+10
-3.4044e+10
-3.38435e+10
-3.36688e+10
-3.35167e+10
-3.33873e+10
-3.32828e+10
-3.32068e+10
-3.316e+10
-3.31374e+10
-3.3127e+10
-3.31087e+10
-3.30557e+10
-3.2941e+10
-3.27473e+10
-3.24825e+10
-3.21945e+10
-3.19614e+10
-3.18089e+10
-3.15534e+10
-3.08285e+10
-2.99008e+10
-3.1359e+10
-3.97147e+10
-5.0791e+10
-3.38567e+10
-3.8068e+10
-3.79942e+10
-3.80016e+10
-3.80694e+10
-3.81433e+10
-3.81459e+10
-3.8129e+10
-3.81436e+10
-3.81993e+10
-3.82635e+10
-3.83141e+10
-3.8357e+10
-3.83938e+10
-3.8419e+10
-3.84243e+10
-3.83989e+10
-3.83332e+10
-3.82221e+10
-3.80665e+10
-3.78689e+10
-3.76135e+10
-3.72609e+10
-3.67825e+10
-3.62114e+10
-3.56318e+10
-3.511e+10
-3.46757e+10
-3.43313e+10
-3.40633e+10
-3.38523e+10
-3.36812e+10
-3.35394e+10
-3.34208e+10
-3.33236e+10
-3.32498e+10
-3.32021e+10
-3.31808e+10
-3.31811e+10
-3.31907e+10
-3.31893e+10
-3.31504e+10
-3.30474e+10
-3.2864e+10
-3.261e+10
-3.23355e+10
-3.21191e+10
-3.19853e+10
-3.17487e+10
-3.1049e+10
-3.02184e+10
-3.19658e+10
-4.03594e+10
-5.03004e+10
-3.08821e+10
-3.80441e+10
-3.79667e+10
-3.80025e+10
-3.80894e+10
-3.81206e+10
-3.81134e+10
-3.8132e+10
-3.81606e+10
-3.82006e+10
-3.82522e+10
-3.83025e+10
-3.83478e+10
-3.83852e+10
-3.84107e+10
-3.84158e+10
-3.83906e+10
-3.83259e+10
-3.82162e+10
-3.80625e+10
-3.78663e+10
-3.76127e+10
-3.7263e+10
-3.6789e+10
-3.62238e+10
-3.56481e+10
-3.51284e+10
-3.46937e+10
-3.43471e+10
-3.40768e+10
-3.38646e+10
-3.36926e+10
-3.35495e+10
-3.34294e+10
-3.3331e+10
-3.3257e+10
-3.32101e+10
-3.31916e+10
-3.31973e+10
-3.32156e+10
-3.32272e+10
-3.32073e+10
-3.31313e+10
-3.29853e+10
-3.27821e+10
-3.25755e+10
-3.24484e+10
-3.24295e+10
-3.23354e+10
-3.17947e+10
-3.11229e+10
-3.30975e+10
-4.17581e+10
-5.02345e+10
-2.66839e+10
-3.80433e+10
-3.79857e+10
-3.79438e+10
-3.79535e+10
-3.80222e+10
-3.80556e+10
-3.80818e+10
-3.81434e+10
-3.82248e+10
-3.83051e+10
-3.83901e+10
-3.84759e+10
-3.85566e+10
-3.86253e+10
-3.86722e+10
-3.86852e+10
-3.86523e+10
-3.85649e+10
-3.84259e+10
-3.82451e+10
-3.80111e+10
-3.76505e+10
-3.7072e+10
-3.63073e+10
-3.55269e+10
-3.48683e+10
-3.43677e+10
-3.40136e+10
-3.37699e+10
-3.36002e+10
-3.34769e+10
-3.33829e+10
-3.33098e+10
-3.32561e+10
-3.32252e+10
-3.32209e+10
-3.32446e+10
-3.32924e+10
-3.33521e+10
-3.3404e+10
-3.34224e+10
-3.33827e+10
-3.3272e+10
-3.31053e+10
-3.29393e+10
-3.28585e+10
-3.28872e+10
-3.2831e+10
-3.23309e+10
-3.18198e+10
-3.42517e+10
-4.32128e+10
-5.10556e+10
-2.69809e+10
-3.80437e+10
-3.79638e+10
-3.79238e+10
-3.79476e+10
-3.80056e+10
-3.80601e+10
-3.80973e+10
-3.81493e+10
-3.8217e+10
-3.82959e+10
-3.83806e+10
-3.84657e+10
-3.85455e+10
-3.86136e+10
-3.86601e+10
-3.86733e+10
-3.86415e+10
-3.85565e+10
-3.84206e+10
-3.82438e+10
-3.8015e+10
-3.76632e+10
-3.71e+10
-3.63534e+10
-3.55882e+10
-3.4938e+10
-3.444e+10
-3.40833e+10
-3.38344e+10
-3.36588e+10
-3.35289e+10
-3.34278e+10
-3.33472e+10
-3.32856e+10
-3.32468e+10
-3.32346e+10
-3.32504e+10
-3.329e+10
-3.33416e+10
-3.33854e+10
-3.33959e+10
-3.33485e+10
-3.32308e+10
-3.30587e+10
-3.28899e+10
-3.28091e+10
-3.28381e+10
-3.27737e+10
-3.22337e+10
-3.1576e+10
-3.36506e+10
-4.25366e+10
-5.19365e+10
-3.0754e+10
-3.79254e+10
-3.78847e+10
-3.78081e+10
-3.77935e+10
-3.78416e+10
-3.78986e+10
-3.79631e+10
-3.80456e+10
-3.81451e+10
-3.82584e+10
-3.83829e+10
-3.85136e+10
-3.86445e+10
-3.87672e+10
-3.88702e+10
-3.89402e+10
-3.89632e+10
-3.8926e+10
-3.88269e+10
-3.86876e+10
-3.85218e+10
-3.82317e+10
-3.75905e+10
-3.65544e+10
-3.54513e+10
-3.46078e+10
-3.40402e+10
-3.36888e+10
-3.34793e+10
-3.33534e+10
-3.32725e+10
-3.32138e+10
-3.31679e+10
-3.31345e+10
-3.31186e+10
-3.31253e+10
-3.31569e+10
-3.32096e+10
-3.32711e+10
-3.33208e+10
-3.33312e+10
-3.32765e+10
-3.31433e+10
-3.29469e+10
-3.27433e+10
-3.26121e+10
-3.25605e+10
-3.23672e+10
-3.16629e+10
-3.08975e+10
-3.31032e+10
-4.2582e+10
-5.32674e+10
-3.21111e+10
-3.79004e+10
-3.78361e+10
-3.77823e+10
-3.77829e+10
-3.78493e+10
-3.79121e+10
-3.79617e+10
-3.8041e+10
-3.81402e+10
-3.82527e+10
-3.83763e+10
-3.85066e+10
-3.8637e+10
-3.87591e+10
-3.88616e+10
-3.89315e+10
-3.89546e+10
-3.89177e+10
-3.88196e+10
-3.86825e+10
-3.85191e+10
-3.82297e+10
-3.75896e+10
-3.65592e+10
-3.54626e+10
-3.46245e+10
-3.40628e+10
-3.37189e+10
-3.35193e+10
-3.34043e+10
-3.33342e+10
-3.32857e+10
-3.32491e+10
-3.32238e+10
-3.32146e+10
-3.32264e+10
-3.32611e+10
-3.33141e+10
-3.33724e+10
-3.34137e+10
-3.34091e+10
-3.33304e+10
-3.31616e+10
-3.29149e+10
-3.26425e+10
-3.24195e+10
-3.22469e+10
-3.18929e+10
-3.09633e+10
-2.98088e+10
-3.12666e+10
-4.01597e+10
-5.34566e+10
-3.8733e+10
-3.78322e+10
-3.77927e+10
-3.77619e+10
-3.7773e+10
-3.78145e+10
-3.78804e+10
-3.79677e+10
-3.80745e+10
-3.82012e+10
-3.83472e+10
-3.85102e+10
-3.86869e+10
-3.8871e+10
-3.90519e+10
-3.92148e+10
-3.93428e+10
-3.9419e+10
-3.94255e+10
-3.93513e+10
-3.92276e+10
-3.91251e+10
-3.89725e+10
-3.83232e+10
-3.67997e+10
-3.50639e+10
-3.40002e+10
-3.34596e+10
-3.3202e+10
-3.31089e+10
-3.30881e+10
-3.3091e+10
-3.30943e+10
-3.30927e+10
-3.30906e+10
-3.30964e+10
-3.31182e+10
-3.31607e+10
-3.32214e+10
-3.32894e+10
-3.33441e+10
-3.33582e+10
-3.33047e+10
-3.31682e+10
-3.29598e+10
-3.27288e+10
-3.25431e+10
-3.23914e+10
-3.20394e+10
-3.11503e+10
-3.02631e+10
-3.23762e+10
-4.15387e+10
-5.27937e+10
-3.63209e+10
-3.77901e+10
-3.77612e+10
-3.77597e+10
-3.77841e+10
-3.78307e+10
-3.78844e+10
-3.79633e+10
-3.80685e+10
-3.81948e+10
-3.83398e+10
-3.8501e+10
-3.86755e+10
-3.8857e+10
-3.90352e+10
-3.91952e+10
-3.93198e+10
-3.93914e+10
-3.93929e+10
-3.93164e+10
-3.91943e+10
-3.9094e+10
-3.8943e+10
-3.83157e+10
-3.68423e+10
-3.51605e+10
-3.40919e+10
-3.35229e+10
-3.32428e+10
-3.31368e+10
-3.31111e+10
-3.31144e+10
-3.31215e+10
-3.31259e+10
-3.31311e+10
-3.31453e+10
-3.31763e+10
-3.32284e+10
-3.32996e+10
-3.33786e+10
-3.34449e+10
-3.34712e+10
-3.34303e+10
-3.33067e+10
-3.31116e+10
-3.28942e+10
-3.27211e+10
-3.25788e+10
-3.22273e+10
-3.13114e+10
-3.03165e+10
-3.21922e+10
-4.1265e+10
-5.23617e+10
-3.33229e+10
-3.76237e+10
-3.75578e+10
-3.75844e+10
-3.76133e+10
-3.76494e+10
-3.77048e+10
-3.77916e+10
-3.79085e+10
-3.80542e+10
-3.82281e+10
-3.84298e+10
-3.86591e+10
-3.89127e+10
-3.91797e+10
-3.94374e+10
-3.96537e+10
-3.98075e+10
-3.98884e+10
-3.9879e+10
-3.97964e+10
-3.97599e+10
-3.98814e+10
-3.95735e+10
-3.7394e+10
-3.43665e+10
-3.28822e+10
-3.23879e+10
-3.23049e+10
-3.2428e+10
-3.25827e+10
-3.27094e+10
-3.27935e+10
-3.28423e+10
-3.28694e+10
-3.28899e+10
-3.29167e+10
-3.29581e+10
-3.30154e+10
-3.30812e+10
-3.31389e+10
-3.3165e+10
-3.3136e+10
-3.30383e+10
-3.28843e+10
-3.27224e+10
-3.26158e+10
-3.25481e+10
-3.22934e+10
-3.15859e+10
-3.11794e+10
-3.42387e+10
-4.38869e+10
-5.09582e+10
-2.70978e+10
-3.75982e+10
-3.75755e+10
-3.76075e+10
-3.76405e+10
-3.76719e+10
-3.77208e+10
-3.78031e+10
-3.79157e+10
-3.80574e+10
-3.82264e+10
-3.84221e+10
-3.86442e+10
-3.88899e+10
-3.91482e+10
-3.93968e+10
-3.9607e+10
-3.97587e+10
-3.98367e+10
-3.98216e+10
-3.97305e+10
-3.97009e+10
-3.98614e+10
-3.9606e+10
-3.75358e+10
-3.46043e+10
-3.30887e+10
-3.25463e+10
-3.24291e+10
-3.25197e+10
-3.2648e+10
-3.27565e+10
-3.28289e+10
-3.28704e+10
-3.28934e+10
-3.29126e+10
-3.29406e+10
-3.29855e+10
-3.30487e+10
-3.31227e+10
-3.31914e+10
-3.32318e+10
-3.32211e+10
-3.31471e+10
-3.30234e+10
-3.28994e+10
-3.28382e+10
-3.28195e+10
-3.26031e+10
-3.18896e+10
-3.13667e+10
-3.41438e+10
-4.3304e+10
-5.01754e+10
-2.6584e+10
-3.7444e+10
-3.73951e+10
-3.74408e+10
-3.74706e+10
-3.75157e+10
-3.75824e+10
-3.7686e+10
-3.78314e+10
-3.80216e+10
-3.82569e+10
-3.85395e+10
-3.88726e+10
-3.92557e+10
-3.96739e+10
-4.00834e+10
-4.04178e+10
-4.06666e+10
-4.08656e+10
-4.09789e+10
-4.09715e+10
-4.09011e+10
-4.12085e+10
-4.20908e+10
-4.01366e+10
-3.53105e+10
-3.14523e+10
-3.12019e+10
-3.15718e+10
-3.19917e+10
-3.23094e+10
-3.2525e+10
-3.26582e+10
-3.27345e+10
-3.2776e+10
-3.28025e+10
-3.28297e+10
-3.28673e+10
-3.29174e+10
-3.29731e+10
-3.30192e+10
-3.3034e+10
-3.2996e+10
-3.28944e+10
-3.2744e+10
-3.25943e+10
-3.25098e+10
-3.24788e+10
-3.22892e+10
-3.16968e+10
-3.14062e+10
-3.42785e+10
-4.31414e+10
-5.04756e+10
-2.63399e+10
-3.74137e+10
-3.73933e+10
-3.74378e+10
-3.74672e+10
-3.75095e+10
-3.75756e+10
-3.7678e+10
-3.7822e+10
-3.80109e+10
-3.8245e+10
-3.85265e+10
-3.88586e+10
-3.92401e+10
-3.96541e+10
-4.00592e+10
-4.04029e+10
-4.06674e+10
-4.08516e+10
-4.09234e+10
-4.08619e+10
-4.08454e+10
-4.13942e+10
-4.23546e+10
-4.04561e+10
-3.56568e+10
-3.13352e+10
-3.11591e+10
-3.15817e+10
-3.20237e+10
-3.2348e+10
-3.25639e+10
-3.26955e+10
-3.27694e+10
-3.28082e+10
-3.28315e+10
-3.28546e+10
-3.28868e+10
-3.29299e+10
-3.29769e+10
-3.30121e+10
-3.30136e+10
-3.29592e+10
-3.28374e+10
-3.26617e+10
-3.24794e+10
-3.23504e+10
-3.22508e+10
-3.19383e+10
-3.1114e+10
-3.04339e+10
-3.28076e+10
-4.14822e+10
-5.02218e+10
-3.14388e+10
-3.73757e+10
-3.7385e+10
-3.73988e+10
-3.74191e+10
-3.74574e+10
-3.75259e+10
-3.76348e+10
-3.7791e+10
-3.79961e+10
-3.82487e+10
-3.85523e+10
-3.89129e+10
-3.9325e+10
-3.97689e+10
-4.01767e+10
-4.04861e+10
-4.0746e+10
-4.09659e+10
-4.10997e+10
-4.11252e+10
-4.10855e+10
-4.15168e+10
-4.29e+10
-4.40617e+10
-4.09411e+10
-2.6523e+10
-2.89974e+10
-3.06428e+10
-3.15779e+10
-3.21067e+10
-3.24254e+10
-3.26139e+10
-3.27243e+10
-3.27898e+10
-3.28349e+10
-3.28766e+10
-3.29247e+10
-3.29807e+10
-3.30366e+10
-3.30753e+10
-3.30738e+10
-3.30094e+10
-3.28704e+10
-3.26707e+10
-3.24597e+10
-3.2304e+10
-3.21989e+10
-3.19436e+10
-3.12798e+10
-3.08377e+10
-3.35176e+10
-4.27441e+10
-5.18977e+10
-3.16131e+10
-3.73724e+10
-3.73888e+10
-3.73955e+10
-3.74114e+10
-3.74455e+10
-3.7511e+10
-3.76168e+10
-3.77696e+10
-3.79714e+10
-3.82219e+10
-3.85236e+10
-3.88818e+10
-3.92932e+10
-3.97328e+10
-4.01498e+10
-4.04876e+10
-4.07446e+10
-4.09288e+10
-4.10228e+10
-4.10095e+10
-4.10421e+10
-4.18181e+10
-4.31607e+10
-4.414e+10
-4.13709e+10
-2.65481e+10
-2.89158e+10
-3.05766e+10
-3.15409e+10
-3.20873e+10
-3.24138e+10
-3.26045e+10
-3.2714e+10
-3.27765e+10
-3.28172e+10
-3.28534e+10
-3.28954e+10
-3.29444e+10
-3.29926e+10
-3.3023e+10
-3.30128e+10
-3.29395e+10
-3.27914e+10
-3.25819e+10
-3.23585e+10
-3.21836e+10
-3.20419e+10
-3.17024e+10
-3.08802e+10
-3.03926e+10
-3.3847e+10
-4.45811e+10
-5.15645e+10
-2.60137e+10
-3.73644e+10
-3.74109e+10
-3.74099e+10
-3.74316e+10
-3.7471e+10
-3.75423e+10
-3.76535e+10
-3.78115e+10
-3.80171e+10
-3.82687e+10
-3.85718e+10
-3.89347e+10
-3.93473e+10
-3.97845e+10
-4.01864e+10
-4.04972e+10
-4.07571e+10
-4.09692e+10
-4.10971e+10
-4.11411e+10
-4.1093e+10
-4.13931e+10
-4.34368e+10
-4.35807e+10
-2.1345e+10
-2.86736e+10
-3.04138e+10
-3.14127e+10
-3.19711e+10
-3.2299e+10
-3.24862e+10
-3.25909e+10
-3.26491e+10
-3.26867e+10
-3.27216e+10
-3.27637e+10
-3.28144e+10
-3.28657e+10
-3.29008e+10
-3.28971e+10
-3.28327e+10
-3.26968e+10
-3.25037e+10
-3.23046e+10
-3.21703e+10
-3.2104e+10
-3.19049e+10
-3.12668e+10
-3.06702e+10
-3.27983e+10
-4.13161e+10
-5.18314e+10
-3.60668e+10
-3.73767e+10
-3.74283e+10
-3.74217e+10
-3.74395e+10
-3.7475e+10
-3.75424e+10
-3.76487e+10
-3.78008e+10
-3.80005e+10
-3.82478e+10
-3.85464e+10
-3.89014e+10
-3.93071e+10
-3.97411e+10
-4.01547e+10
-4.04918e+10
-4.07484e+10
-4.09307e+10
-4.10184e+10
-4.10031e+10
-4.10183e+10
-4.17154e+10
-4.3487e+10
-4.36449e+10
-2.23372e+10
-2.86593e+10
-3.03585e+10
-3.13614e+10
-3.19308e+10
-3.22645e+10
-3.24532e+10
-3.25559e+10
-3.26098e+10
-3.26418e+10
-3.26705e+10
-3.27069e+10
-3.27535e+10
-3.28032e+10
-3.28404e+10
-3.28435e+10
-3.27917e+10
-3.2675e+10
-3.25079e+10
-3.23403e+10
-3.22403e+10
-3.22042e+10
-3.20179e+10
-3.13876e+10
-3.10085e+10
-3.41221e+10
-4.40029e+10
-5.15039e+10
-2.72051e+10
-3.74406e+10
-3.74572e+10
-3.74664e+10
-3.74892e+10
-3.75314e+10
-3.76022e+10
-3.77091e+10
-3.78575e+10
-3.80487e+10
-3.82827e+10
-3.85631e+10
-3.88959e+10
-3.92732e+10
-3.96707e+10
-4.00425e+10
-4.03502e+10
-4.05923e+10
-4.07823e+10
-4.09281e+10
-4.09623e+10
-4.09469e+10
-4.11822e+10
-4.20874e+10
-4.20604e+10
-3.49564e+10
-3.07203e+10
-3.07176e+10
-3.1301e+10
-3.18351e+10
-3.21986e+10
-3.24222e+10
-3.2547e+10
-3.26085e+10
-3.26341e+10
-3.26448e+10
-3.26564e+10
-3.2678e+10
-3.27105e+10
-3.27465e+10
-3.27701e+10
-3.27607e+10
-3.26986e+10
-3.25751e+10
-3.24067e+10
-3.22463e+10
-3.21678e+10
-3.21816e+10
-3.20979e+10
-3.16192e+10
-3.12712e+10
-3.3893e+10
-4.27409e+10
-4.98821e+10
-2.68509e+10
-3.74571e+10
-3.74685e+10
-3.74783e+10
-3.74993e+10
-3.75396e+10
-3.76074e+10
-3.77102e+10
-3.78527e+10
-3.80364e+10
-3.82611e+10
-3.85294e+10
-3.88447e+10
-3.92027e+10
-3.95852e+10
-3.99569e+10
-4.02829e+10
-4.05541e+10
-4.07626e+10
-4.08686e+10
-4.08364e+10
-4.08308e+10
-4.13336e+10
-4.21314e+10
-4.19407e+10
-3.52184e+10
-3.05121e+10
-3.05391e+10
-3.11792e+10
-3.17597e+10
-3.21531e+10
-3.2393e+10
-3.25256e+10
-3.25899e+10
-3.26156e+10
-3.26251e+10
-3.26351e+10
-3.26551e+10
-3.26868e+10
-3.27228e+10
-3.2748e+10
-3.27414e+10
-3.26827e+10
-3.25614e+10
-3.23908e+10
-3.22182e+10
-3.21086e+10
-3.20612e+10
-3.18713e+10
-3.12189e+10
-3.05758e+10
-3.27412e+10
-4.13645e+10
-4.9631e+10
-2.65264e+10
-3.75522e+10
-3.75319e+10
-3.75497e+10
-3.75716e+10
-3.76114e+10
-3.76723e+10
-3.77596e+10
-3.78753e+10
-3.80192e+10
-3.81899e+10
-3.83861e+10
-3.8606e+10
-3.88422e+10
-3.90801e+10
-3.92974e+10
-3.94727e+10
-3.95923e+10
-3.9647e+10
-3.96299e+10
-3.95489e+10
-3.9522e+10
-3.96529e+10
-3.94241e+10
-3.74675e+10
-3.47437e+10
-3.31767e+10
-3.25869e+10
-3.24292e+10
-3.24847e+10
-3.25742e+10
-3.26446e+10
-3.26804e+10
-3.26871e+10
-3.2676e+10
-3.26602e+10
-3.26505e+10
-3.26533e+10
-3.26681e+10
-3.26861e+10
-3.26912e+10
-3.26626e+10
-3.25807e+10
-3.24362e+10
-3.22442e+10
-3.20554e+10
-3.19408e+10
-3.19106e+10
-3.17812e+10
-3.12493e+10
-3.07593e+10
-3.30075e+10
-4.14373e+10
-4.92085e+10
-2.58403e+10
-3.75493e+10
-3.75324e+10
-3.75486e+10
-3.75704e+10
-3.76099e+10
-3.76708e+10
-3.77583e+10
-3.78744e+10
-3.8019e+10
-3.81903e+10
-3.83863e+10
-3.86045e+10
-3.88382e+10
-3.90743e+10
-3.92927e+10
-3.94744e+10
-3.96074e+10
-3.96776e+10
-3.96636e+10
-3.95774e+10
-3.95584e+10
-3.97272e+10
-3.94596e+10
-3.74504e+10
-3.46073e+10
-3.29783e+10
-3.24127e+10
-3.23024e+10
-3.23966e+10
-3.2513e+10
-3.26007e+10
-3.2648e+10
-3.26631e+10
-3.2659e+10
-3.26495e+10
-3.26463e+10
-3.26557e+10
-3.26773e+10
-3.2702e+10
-3.27132e+10
-3.2689e+10
-3.26074e+10
-3.24555e+10
-3.2242e+10
-3.20083e+10
-3.18114e+10
-3.16439e+10
-3.12988e+10
-3.04198e+10
-2.92776e+10
-3.03176e+10
-3.78607e+10
-4.83065e+10
-2.87149e+10
-3.76265e+10
-3.76132e+10
-3.7631e+10
-3.76567e+10
-3.76994e+10
-3.77607e+10
-3.78438e+10
-3.79495e+10
-3.8077e+10
-3.82239e+10
-3.83868e+10
-3.85598e+10
-3.87335e+10
-3.8895e+10
-3.90297e+10
-3.91239e+10
-3.91657e+10
-3.9142e+10
-3.90416e+10
-3.8887e+10
-3.87433e+10
-3.85573e+10
-3.79392e+10
-3.65656e+10
-3.5009e+10
-3.39739e+10
-3.3381e+10
-3.30627e+10
-3.29229e+10
-3.2865e+10
-3.28356e+10
-3.28071e+10
-3.27717e+10
-3.2732e+10
-3.26957e+10
-3.26703e+10
-3.26602e+10
-3.26635e+10
-3.26708e+10
-3.26653e+10
-3.26264e+10
-3.25346e+10
-3.23812e+10
-3.21808e+10
-3.19824e+10
-3.18553e+10
-3.18103e+10
-3.16704e+10
-3.114e+10
-3.06249e+10
-3.26354e+10
-4.04967e+10
-4.85071e+10
-2.60952e+10
-3.76191e+10
-3.76091e+10
-3.76261e+10
-3.76525e+10
-3.76963e+10
-3.77592e+10
-3.78449e+10
-3.79542e+10
-3.80865e+10
-3.82393e+10
-3.8409e+10
-3.85895e+10
-3.87713e+10
-3.89417e+10
-3.90855e+10
-3.91883e+10
-3.92367e+10
-3.92147e+10
-3.91127e+10
-3.89588e+10
-3.88187e+10
-3.86249e+10
-3.79754e+10
-3.65443e+10
-3.493e+10
-3.38669e+10
-3.32799e+10
-3.29784e+10
-3.28535e+10
-3.2807e+10
-3.27857e+10
-3.27639e+10
-3.27352e+10
-3.27031e+10
-3.26753e+10
-3.26595e+10
-3.26597e+10
-3.26736e+10
-3.26913e+10
-3.26952e+10
-3.26631e+10
-3.2574e+10
-3.24163e+10
-3.22007e+10
-3.19689e+10
-3.17788e+10
-3.16255e+10
-3.1306e+10
-3.0453e+10
-2.92749e+10
-3.01047e+10
-3.72462e+10
-4.77522e+10
-2.92502e+10
-3.76551e+10
-3.76505e+10
-3.76615e+10
-3.76832e+10
-3.77195e+10
-3.77717e+10
-3.78417e+10
-3.79299e+10
-3.80353e+10
-3.81559e+10
-3.82884e+10
-3.84269e+10
-3.85625e+10
-3.86849e+10
-3.87824e+10
-3.88434e+10
-3.88561e+10
-3.88087e+10
-3.8696e+10
-3.85321e+10
-3.83248e+10
-3.79833e+10
-3.73067e+10
-3.62711e+10
-3.5196e+10
-3.43751e+10
-3.38235e+10
-3.34794e+10
-3.32744e+10
-3.31485e+10
-3.30613e+10
-3.29887e+10
-3.29216e+10
-3.28599e+10
-3.28089e+10
-3.27746e+10
-3.27603e+10
-3.27634e+10
-3.27738e+10
-3.2775e+10
-3.27472e+10
-3.26729e+10
-3.2546e+10
-3.23842e+10
-3.22396e+10
-3.21849e+10
-3.2234e+10
-3.22106e+10
-3.18238e+10
-3.15139e+10
-3.38992e+10
-4.22539e+10
-5.00142e+10
-2.76609e+10
-3.76587e+10
-3.765e+10
-3.76632e+10
-3.76856e+10
-3.77231e+10
-3.77769e+10
-3.7849e+10
-3.79399e+10
-3.80488e+10
-3.81736e+10
-3.83108e+10
-3.84546e+10
-3.85962e+10
-3.8725e+10
-3.8829e+10
-3.88959e+10
-3.89132e+10
-3.8868e+10
-3.87554e+10
-3.85911e+10
-3.83823e+10
-3.80299e+10
-3.73244e+10
-3.62532e+10
-3.51485e+10
-3.43182e+10
-3.3771e+10
-3.3435e+10
-3.32369e+10
-3.31161e+10
-3.30324e+10
-3.29627e+10
-3.28984e+10
-3.28396e+10
-3.27915e+10
-3.27599e+10
-3.27477e+10
-3.27513e+10
-3.27601e+10
-3.27564e+10
-3.27192e+10
-3.26299e+10
-3.24812e+10
-3.22894e+10
-3.21036e+10
-3.19918e+10
-3.19607e+10
-3.18185e+10
-3.12292e+10
-3.05756e+10
-3.26592e+10
-4.1548e+10
-5.03657e+10
-2.65324e+10
-3.7707e+10
-3.77036e+10
-3.77123e+10
-3.77308e+10
-3.77615e+10
-3.78047e+10
-3.78614e+10
-3.7931e+10
-3.80122e+10
-3.81027e+10
-3.81994e+10
-3.82971e+10
-3.83887e+10
-3.84658e+10
-3.85199e+10
-3.85411e+10
-3.85186e+10
-3.84433e+10
-3.83142e+10
-3.81378e+10
-3.79001e+10
-3.75296e+10
-3.69417e+10
-3.61711e+10
-3.53837e+10
-3.4719e+10
-3.42124e+10
-3.38488e+10
-3.35916e+10
-3.34034e+10
-3.32558e+10
-3.31309e+10
-3.30211e+10
-3.29259e+10
-3.28494e+10
-3.2796e+10
-3.27669e+10
-3.27574e+10
-3.27561e+10
-3.27449e+10
-3.2703e+10
-3.26122e+10
-3.24663e+10
-3.22834e+10
-3.21168e+10
-3.20387e+10
-3.20565e+10
-3.19741e+10
-3.14725e+10
-3.09843e+10
-3.32136e+10
-4.20767e+10
-5.26766e+10
-3.50591e+10
-3.77101e+10
-3.76971e+10
-3.77102e+10
-3.77291e+10
-3.77608e+10
-3.78049e+10
-3.78625e+10
-3.79333e+10
-3.80158e+10
-3.81078e+10
-3.82059e+10
-3.83051e+10
-3.83986e+10
-3.84781e+10
-3.85346e+10
-3.85578e+10
-3.85368e+10
-3.84626e+10
-3.83345e+10
-3.81597e+10
-3.79239e+10
-3.75527e+10
-3.69624e+10
-3.61873e+10
-3.54007e+10
-3.47397e+10
-3.42379e+10
-3.38783e+10
-3.36236e+10
-3.34371e+10
-3.32911e+10
-3.31681e+10
-3.30605e+10
-3.29679e+10
-3.28936e+10
-3.28415e+10
-3.28123e+10
-3.28005e+10
-3.27936e+10
-3.27724e+10
-3.27151e+10
-3.26031e+10
-3.24297e+10
-3.22127e+10
-3.20051e+10
-3.18795e+10
-3.18436e+10
-3.16959e+10
-3.11204e+10
-3.07393e+10
-3.39298e+10
-4.45064e+10
-5.3012e+10
-2.77225e+10
-3.7753e+10
-3.77438e+10
-3.7755e+10
-3.77719e+10
-3.77997e+10
-3.78374e+10
-3.78852e+10
-3.79421e+10
-3.80062e+10
-3.80747e+10
-3.81441e+10
-3.82095e+10
-3.82648e+10
-3.83029e+10
-3.83167e+10
-3.82987e+10
-3.82408e+10
-3.81376e+10
-3.7988e+10
-3.77913e+10
-3.75327e+10
-3.71751e+10
-3.66905e+10
-3.61116e+10
-3.55213e+10
-3.4989e+10
-3.4546e+10
-3.41936e+10
-3.39163e+10
-3.36937e+10
-3.35083e+10
-3.33486e+10
-3.32097e+10
-3.30925e+10
-3.30007e+10
-3.29381e+10
-3.29052e+10
-3.28959e+10
-3.28969e+10
-3.2888e+10
-3.28461e+10
-3.27505e+10
-3.25924e+10
-3.23875e+10
-3.21867e+10
-3.20573e+10
-3.19944e+10
-3.17839e+10
-3.10986e+10
-3.03775e+10
-3.23272e+10
-4.09249e+10
-5.22607e+10
-3.60922e+10
-3.77555e+10
-3.77374e+10
-3.77506e+10
-3.77666e+10
-3.77938e+10
-3.78304e+10
-3.78769e+10
-3.79323e+10
-3.79947e+10
-3.80612e+10
-3.81283e+10
-3.81915e+10
-3.8245e+10
-3.82821e+10
-3.82952e+10
-3.82765e+10
-3.8218e+10
-3.81141e+10
-3.79643e+10
-3.77689e+10
-3.75138e+10
-3.71629e+10
-3.66869e+10
-3.61203e+10
-3.55412e+10
-3.50182e+10
-3.45808e+10
-3.42307e+10
-3.39533e+10
-3.37292e+10
-3.35419e+10
-3.33799e+10
-3.32385e+10
-3.31185e+10
-3.30234e+10
-3.29568e+10
-3.29185e+10
-3.29025e+10
-3.28946e+10
-3.28744e+10
-3.28183e+10
-3.27056e+10
-3.25272e+10
-3.22986e+10
-3.20708e+10
-3.19128e+10
-3.18221e+10
-3.15811e+10
-3.08908e+10
-3.0479e+10
-3.37756e+10
-4.45016e+10
-5.34802e+10
-2.97146e+10
-3.77796e+10
-3.77621e+10
-3.77734e+10
-3.7786e+10
-3.7808e+10
-3.78375e+10
-3.78745e+10
-3.79176e+10
-3.79647e+10
-3.80128e+10
-3.80586e+10
-3.80974e+10
-3.81241e+10
-3.81329e+10
-3.81177e+10
-3.80718e+10
-3.79879e+10
-3.78615e+10
-3.76911e+10
-3.74743e+10
-3.72016e+10
-3.68581e+10
-3.64407e+10
-3.59739e+10
-3.55001e+10
-3.5058e+10
-3.46683e+10
-3.43358e+10
-3.4054e+10
-3.38125e+10
-3.36015e+10
-3.3415e+10
-3.32516e+10
-3.31141e+10
-3.30076e+10
-3.29365e+10
-3.29015e+10
-3.28966e+10
-3.29084e+10
-3.29161e+10
-3.28959e+10
-3.28267e+10
-3.26997e+10
-3.25314e+10
-3.23748e+10
-3.22995e+10
-3.23019e+10
-3.21749e+10
-3.1644e+10
-3.1318e+10
-3.40436e+10
-4.315e+10
-5.13117e+10
-2.88045e+10
-3.77841e+10
-3.7766e+10
-3.77767e+10
-3.77894e+10
-3.78115e+10
-3.78407e+10
-3.78773e+10
-3.79198e+10
-3.79662e+10
-3.80134e+10
-3.80577e+10
-3.8095e+10
-3.812e+10
-3.81272e+10
-3.81098e+10
-3.80612e+10
-3.79753e+10
-3.78479e+10
-3.76774e+10
-3.74614e+10
-3.71906e+10
-3.685e+10
-3.64378e+10
-3.59763e+10
-3.55088e+10
-3.50712e+10
-3.46846e+10
-3.43541e+10
-3.40737e+10
-3.38332e+10
-3.36233e+10
-3.34377e+10
-3.32748e+10
-3.31374e+10
-3.30302e+10
-3.29576e+10
-3.29202e+10
-3.29122e+10
-3.29197e+10
-3.29216e+10
-3.28936e+10
-3.28136e+10
-3.26706e+10
-3.24786e+10
-3.22867e+10
-3.2159e+10
-3.20816e+10
-3.18274e+10
-3.11135e+10
-3.06581e+10
-3.36427e+10
-4.33854e+10
-5.13839e+10
-2.75403e+10
-3.77951e+10
-3.7787e+10
-3.77915e+10
-3.78014e+10
-3.78186e+10
-3.78417e+10
-3.78703e+10
-3.79026e+10
-3.79365e+10
-3.79688e+10
-3.79961e+10
-3.80143e+10
-3.80185e+10
-3.8004e+10
-3.79655e+10
-3.78982e+10
-3.7799e+10
-3.7665e+10
-3.74933e+10
-3.72801e+10
-3.702e+10
-3.67087e+10
-3.63501e+10
-3.59602e+10
-3.55636e+10
-3.51824e+10
-3.48314e+10
-3.45155e+10
-3.4233e+10
-3.39788e+10
-3.37485e+10
-3.35399e+10
-3.33545e+10
-3.31966e+10
-3.30723e+10
-3.29859e+10
-3.29378e+10
-3.29216e+10
-3.29228e+10
-3.29194e+10
-3.28859e+10
-3.28004e+10
-3.26549e+10
-3.24674e+10
-3.22943e+10
-3.22117e+10
-3.22219e+10
-3.21277e+10
-3.16908e+10
-3.16019e+10
-3.47122e+10
-4.3717e+10
-5.0697e+10
-2.62564e+10
-3.78013e+10
-3.77892e+10
-3.7795e+10
-3.78046e+10
-3.78217e+10
-3.78444e+10
-3.78725e+10
-3.79044e+10
-3.79378e+10
-3.797e+10
-3.79972e+10
-3.80156e+10
-3.80206e+10
-3.80075e+10
-3.79707e+10
-3.79051e+10
-3.7807e+10
-3.76737e+10
-3.7502e+10
-3.72883e+10
-3.70269e+10
-3.67137e+10
-3.6352e+10
-3.59601e+10
-3.55619e+10
-3.51804e+10
-3.48296e+10
-3.45149e+10
-3.42343e+10
-3.39823e+10
-3.37539e+10
-3.35468e+10
-3.33619e+10
-3.32035e+10
-3.30772e+10
-3.29879e+10
-3.2936e+10
-3.29155e+10
-3.29121e+10
-3.29032e+10
-3.28623e+10
-3.27653e+10
-3.26002e+10
-3.23804e+10
-3.21546e+10
-3.19854e+10
-3.18537e+10
-3.153e+10
-3.07371e+10
-3.014e+10
-3.25856e+10
-4.12221e+10
-5.07055e+10
-3.46919e+10
-3.78169e+10
-3.77997e+10
-3.78053e+10
-3.78112e+10
-3.78236e+10
-3.78401e+10
-3.78602e+10
-3.78824e+10
-3.79043e+10
-3.79232e+10
-3.7936e+10
-3.79389e+10
-3.79279e+10
-3.78992e+10
-3.78484e+10
-3.77712e+10
-3.76633e+10
-3.75218e+10
-3.73448e+10
-3.71302e+10
-3.68755e+10
-3.65809e+10
-3.62524e+10
-3.59025e+10
-3.55479e+10
-3.52039e+10
-3.48808e+10
-3.4583e+10
-3.43096e+10
-3.40579e+10
-3.38255e+10
-3.36127e+10
-3.34222e+10
-3.32592e+10
-3.31291e+10
-3.30358e+10
-3.29782e+10
-3.29492e+10
-3.29331e+10
-3.29061e+10
-3.2841e+10
-3.27138e+10
-3.25141e+10
-3.22582e+10
-3.20014e+10
-3.18195e+10
-3.17151e+10
-3.14914e+10
-3.09032e+10
-3.06213e+10
-3.36271e+10
-4.32815e+10
-5.2573e+10
-3.22704e+10
-3.78247e+10
-3.78027e+10
-3.78088e+10
-3.78135e+10
-3.78246e+10
-3.78393e+10
-3.78575e+10
-3.78774e+10
-3.7897e+10
-3.79138e+10
-3.79245e+10
-3.79257e+10
-3.79138e+10
-3.78848e+10
-3.78341e+10
-3.7757e+10
-3.76492e+10
-3.75088e+10
-3.73343e+10
-3.71234e+10
-3.68735e+10
-3.65844e+10
-3.62619e+10
-3.59177e+10
-3.55689e+10
-3.52292e+10
-3.49086e+10
-3.46112e+10
-3.43364e+10
-3.40816e+10
-3.38445e+10
-3.36252e+10
-3.34267e+10
-3.32545e+10
-3.31147e+10
-3.30118e+10
-3.2946e+10
-3.29105e+10
-3.28903e+10
-3.28621e+10
-3.2798e+10
-3.26723e+10
-3.24728e+10
-3.22146e+10
-3.19498e+10
-3.17466e+10
-3.15966e+10
-3.12857e+10
-3.05684e+10
-3.03142e+10
-3.41643e+10
-4.53714e+10
-5.21096e+10
-2.59754e+10
-3.78261e+10
-3.78094e+10
-3.78116e+10
-3.78144e+10
-3.78219e+10
-3.78318e+10
-3.78436e+10
-3.78553e+10
-3.78646e+10
-3.7869e+10
-3.78653e+10
-3.78503e+10
-3.78207e+10
-3.77732e+10
-3.77048e+10
-3.76126e+10
-3.74943e+10
-3.73483e+10
-3.71735e+10
-3.69685e+10
-3.67327e+10
-3.64678e+10
-3.61785e+10
-3.58731e+10
-3.55617e+10
-3.52541e+10
-3.49574e+10
-3.46752e+10
-3.44082e+10
-3.41559e+10
-3.39187e+10
-3.36994e+10
-3.3503e+10
-3.33358e+10
-3.32037e+10
-3.31102e+10
-3.30545e+10
-3.30298e+10
-3.30216e+10
-3.30079e+10
-3.29617e+10
-3.28583e+10
-3.26859e+10
-3.24596e+10
-3.2232e+10
-3.20766e+10
-3.20046e+10
-3.18237e+10
-3.12682e+10
-3.09094e+10
-3.34874e+10
-4.23681e+10
-5.19992e+10
-3.3143e+10
-3.78307e+10
-3.78113e+10
-3.78134e+10
-3.78153e+10
-3.78218e+10
-3.78305e+10
-3.78409e+10
-3.7851e+10
-3.78587e+10
-3.78614e+10
-3.78561e+10
-3.78397e+10
-3.7809e+10
-3.77607e+10
-3.76918e+10
-3.75998e+10
-3.74826e+10
-3.73385e+10
-3.71661e+10
-3.69642e+10
-3.67324e+10
-3.64721e+10
-3.61878e+10
-3.58878e+10
-3.55812e+10
-3.52778e+10
-3.49837e+10
-3.47024e+10
-3.44347e+10
-3.41806e+10
-3.39403e+10
-3.37166e+10
-3.35143e+10
-3.334e+10
-3.32001e+10
-3.30989e+10
-3.30362e+10
-3.30054e+10
-3.29926e+10
-3.29758e+10
-3.29276e+10
-3.28217e+10
-3.2644e+10
-3.24079e+10
-3.21656e+10
-3.19908e+10
-3.18858e+10
-3.16532e+10
-3.10472e+10
-3.08185e+10
-3.42151e+10
-4.44198e+10
-5.18781e+10
-2.63283e+10
-3.78464e+10
-3.78311e+10
-3.78333e+10
-3.78346e+10
-3.784e+10
-3.78468e+10
-3.78543e+10
-3.78605e+10
-3.78632e+10
-3.78596e+10
-3.78468e+10
-3.78216e+10
-3.77811e+10
-3.77222e+10
-3.76427e+10
-3.75404e+10
-3.74139e+10
-3.72623e+10
-3.70849e+10
-3.68815e+10
-3.6653e+10
-3.64024e+10
-3.61343e+10
-3.5855e+10
-3.55719e+10
-3.52916e+10
-3.50187e+10
-3.47556e+10
-3.45027e+10
-3.42597e+10
-3.40273e+10
-3.38086e+10
-3.36087e+10
-3.34341e+10
-3.32902e+10
-3.31805e+10
-3.31046e+10
-3.30571e+10
-3.3026e+10
-3.29929e+10
-3.29331e+10
-3.28206e+10
-3.26391e+10
-3.23998e+10
-3.21591e+10
-3.2001e+10
-3.19387e+10
-3.17807e+10
-3.12764e+10
-3.1046e+10
-3.40298e+10
-4.3349e+10
-5.0416e+10
-2.61142e+10
-3.7856e+10
-3.78375e+10
-3.78397e+10
-3.78406e+10
-3.78457e+10
-3.78522e+10
-3.78595e+10
-3.78656e+10
-3.78684e+10
-3.78651e+10
-3.78528e+10
-3.78285e+10
-3.77889e+10
-3.77311e+10
-3.76525e+10
-3.75509e+10
-3.74251e+10
-3.72742e+10
-3.70978e+10
-3.68955e+10
-3.6668e+10
-3.64182e+10
-3.61504e+10
-3.58705e+10
-3.55863e+10
-3.53037e+10
-3.50275e+10
-3.47599e+10
-3.45011e+10
-3.42514e+10
-3.40119e+10
-3.37858e+10
-3.35781e+10
-3.3395e+10
-3.32425e+10
-3.31244e+10
-3.304e+10
-3.29831e+10
-3.29409e+10
-3.28948e+10
-3.28203e+10
-3.26893e+10
-3.24813e+10
-3.22039e+10
-3.19091e+10
-3.16695e+10
-3.14867e+10
-3.1162e+10
-3.04223e+10
-2.97999e+10
-3.21189e+10
-4.11383e+10
-5.09888e+10
-3.14804e+10
-3.78623e+10
-3.78433e+10
-3.7843e+10
-3.78417e+10
-3.78439e+10
-3.7847e+10
-3.785e+10
-3.78512e+10
-3.78481e+10
-3.78382e+10
-3.78187e+10
-3.77865e+10
-3.7739e+10
-3.76737e+10
-3.75885e+10
-3.74819e+10
-3.7353e+10
-3.72014e+10
-3.7027e+10
-3.683e+10
-3.66119e+10
-3.63753e+10
-3.61247e+10
-3.58653e+10
-3.56027e+10
-3.53413e+10
-3.5084e+10
-3.48321e+10
-3.45858e+10
-3.4345e+10
-3.41111e+10
-3.38875e+10
-3.36799e+10
-3.3495e+10
-3.33392e+10
-3.3217e+10
-3.31296e+10
-3.30727e+10
-3.30352e+10
-3.29994e+10
-3.29417e+10
-3.28356e+10
-3.26582e+10
-3.24108e+10
-3.21546e+10
-3.19899e+10
-3.19065e+10
-3.16852e+10
-3.10414e+10
-3.04554e+10
-3.27e+10
-4.15445e+10
-5.08926e+10
-2.99807e+10
-3.78634e+10
-3.78437e+10
-3.78427e+10
-3.78413e+10
-3.78434e+10
-3.78464e+10
-3.78495e+10
-3.78507e+10
-3.78479e+10
-3.78383e+10
-3.78193e+10
-3.77879e+10
-3.77413e+10
-3.76769e+10
-3.75926e+10
-3.74869e+10
-3.73589e+10
-3.72081e+10
-3.70345e+10
-3.68384e+10
-3.6621e+10
-3.63849e+10
-3.61344e+10
-3.58747e+10
-3.56109e+10
-3.53479e+10
-3.50883e+10
-3.48334e+10
-3.45834e+10
-3.43387e+10
-3.4101e+10
-3.38742e+10
-3.36638e+10
-3.34765e+10
-3.33186e+10
-3.3195e+10
-3.31061e+10
-3.30467e+10
-3.30052e+10
-3.29646e+10
-3.29035e+10
-3.27956e+10
-3.26178e+10
-3.2375e+10
-3.21236e+10
-3.19384e+10
-3.18161e+10
-3.15389e+10
-3.07848e+10
-2.9938e+10
-3.15554e+10
-3.96662e+10
-5.0228e+10
-3.40472e+10
-3.78832e+10
-3.78518e+10
-3.78524e+10
-3.78492e+10
-3.78499e+10
-3.78506e+10
-3.78505e+10
-3.78476e+10
-3.78398e+10
-3.78243e+10
-3.77986e+10
-3.776e+10
-3.77058e+10
-3.76343e+10
-3.75437e+10
-3.74333e+10
-3.73029e+10
-3.71527e+10
-3.69834e+10
-3.67956e+10
-3.6591e+10
-3.63727e+10
-3.61445e+10
-3.5911e+10
-3.56763e+10
-3.54435e+10
-3.52134e+10
-3.49869e+10
-3.4764e+10
-3.45454e+10
-3.43328e+10
-3.41306e+10
-3.39459e+10
-3.37867e+10
-3.36611e+10
-3.35758e+10
-3.35328e+10
-3.35266e+10
-3.35431e+10
-3.35616e+10
-3.35585e+10
-3.35099e+10
-3.33945e+10
-3.32074e+10
-3.30006e+10
-3.28829e+10
-3.28381e+10
-3.26e+10
-3.18765e+10
-3.11818e+10
-3.34718e+10
-4.23334e+10
-4.98954e+10
-2.63556e+10
-3.78765e+10
-3.78493e+10
-3.78496e+10
-3.78474e+10
-3.78489e+10
-3.78505e+10
-3.78516e+10
-3.78499e+10
-3.78434e+10
-3.78294e+10
-3.78053e+10
-3.77683e+10
-3.77159e+10
-3.7646e+10
-3.7557e+10
-3.74478e+10
-3.73183e+10
-3.71685e+10
-3.69989e+10
-3.68103e+10
-3.66043e+10
-3.63843e+10
-3.61538e+10
-3.59176e+10
-3.56802e+10
-3.54441e+10
-3.52107e+10
-3.4981e+10
-3.47549e+10
-3.45332e+10
-3.43178e+10
-3.41134e+10
-3.39269e+10
-3.37663e+10
-3.36396e+10
-3.3553e+10
-3.35085e+10
-3.35007e+10
-3.35159e+10
-3.35343e+10
-3.35338e+10
-3.34917e+10
-3.33905e+10
-3.32357e+10
-3.30774e+10
-3.299e+10
-3.29698e+10
-3.27856e+10
-3.20989e+10
-3.14048e+10
-3.36754e+10
-4.22945e+10
-4.8831e+10
-2.48646e+10
-3.78915e+10
-3.78534e+10
-3.78535e+10
-3.78485e+10
-3.78473e+10
-3.78454e+10
-3.78423e+10
-3.78359e+10
-3.78241e+10
-3.78045e+10
-3.77747e+10
-3.77322e+10
-3.76747e+10
-3.76008e+10
-3.75091e+10
-3.73994e+10
-3.72721e+10
-3.71276e+10
-3.69666e+10
-3.67898e+10
-3.65989e+10
-3.63965e+10
-3.6186e+10
-3.59715e+10
-3.57559e+10
-3.55407e+10
-3.53264e+10
-3.51132e+10
-3.49013e+10
-3.46911e+10
-3.44845e+10
-3.42857e+10
-3.41022e+10
-3.39425e+10
-3.38155e+10
-3.37273e+10
-3.36785e+10
-3.36601e+10
-3.36524e+10
-3.36299e+10
-3.35676e+10
-3.3447e+10
-3.32612e+10
-3.30155e+10
-3.27404e+10
-3.25009e+10
-3.23172e+10
-3.19548e+10
-3.10621e+10
-3.01401e+10
-3.23585e+10
-4.2201e+10
-5.46146e+10
-3.88122e+10
-3.78896e+10
-3.7857e+10
-3.78569e+10
-3.7853e+10
-3.7853e+10
-3.78524e+10
-3.78507e+10
-3.78457e+10
-3.78354e+10
-3.78174e+10
-3.77892e+10
-3.77482e+10
-3.76921e+10
-3.76191e+10
-3.75279e+10
-3.74179e+10
-3.72892e+10
-3.71424e+10
-3.69783e+10
-3.6798e+10
-3.66034e+10
-3.63974e+10
-3.61833e+10
-3.59653e+10
-3.57462e+10
-3.55274e+10
-3.53093e+10
-3.50924e+10
-3.48768e+10
-3.46634e+10
-3.44544e+10
-3.42545e+10
-3.40714e+10
-3.39141e+10
-3.37914e+10
-3.371e+10
-3.36713e+10
-3.36678e+10
-3.3682e+10
-3.36893e+10
-3.36649e+10
-3.35897e+10
-3.34541e+10
-3.32647e+10
-3.30611e+10
-3.29105e+10
-3.28019e+10
-3.24925e+10
-3.16008e+10
-3.05475e+10
-3.23452e+10
-4.15595e+10
-5.33639e+10
-3.54008e+10
-4.25878e+10
-4.42184e+10
-4.25716e+10
-4.35736e+10
-4.36144e+10
-2.95232e+10
-4.13727e+10
-2.99585e+10
-1.60575e+10
-1.64153e+10
-4.30893e+10
-4.49418e+10
-4.15419e+10
-4.36175e+10
-4.38829e+10
-2.96568e+10
-4.11945e+10
-2.93286e+10
-1.65582e+10
-1.65893e+10
-4.35289e+10
-4.41605e+10
-4.2045e+10
-4.39307e+10
-4.23378e+10
-1.59354e+10
-1.67507e+10
-3.95109e+10
-2.82154e+10
-4.02058e+10
-2.90134e+10
-4.39221e+10
-4.38946e+10
-4.26932e+10
-4.40682e+10
-4.26387e+10
-1.72208e+10
-1.7683e+10
-4.03286e+10
-2.91725e+10
-4.02202e+10
-2.88606e+10
-3.82175e+10
-4.02719e+10
-3.84672e+10
-4.20371e+10
-3.99551e+10
-4.23091e+10
-4.01156e+10
-3.31792e+10
-3.56566e+10
-3.36674e+10
-3.60379e+10
-3.27069e+10
-3.62178e+10
-3.31275e+10
-3.85937e+10
-4.06348e+10
-3.87057e+10
-4.24597e+10
-4.03023e+10
-4.33999e+10
-4.05961e+10
-3.35505e+10
-3.55975e+10
-3.34354e+10
-3.60712e+10
-3.2731e+10
-3.59077e+10
-3.24843e+10
-4.4513e+10
-4.2865e+10
-4.44381e+10
-4.3484e+10
-4.42365e+10
-4.34289e+10
-4.41131e+10
-3.71161e+10
-3.68576e+10
-4.12297e+10
-3.7044e+10
-3.61369e+10
-2.76197e+10
-2.67847e+10
-2.79883e+10
-2.15323e+10
-2.51051e+10
-2.18138e+10
-2.55351e+10
-4.45483e+10
-4.30207e+10
-4.42776e+10
-4.35602e+10
-4.4142e+10
-4.34369e+10
-4.40909e+10
-3.67617e+10
-3.68842e+10
-4.1575e+10
-3.70013e+10
-3.66132e+10
-2.78431e+10
-2.63069e+10
-2.75915e+10
-2.18453e+10
-2.54593e+10
-2.17064e+10
-2.51718e+10
-4.42807e+10
-4.33924e+10
-4.41378e+10
-4.2819e+10
-4.46253e+10
-4.28265e+10
-4.45345e+10
-4.34508e+10
-4.35508e+10
-4.41287e+10
-4.41039e+10
-4.33241e+10
-3.05315e+10
-2.92808e+10
-2.48506e+10
-2.18348e+10
-2.53296e+10
-2.5648e+10
-2.69691e+10
-2.61479e+10
-2.73734e+10
-4.41606e+10
-4.33809e+10
-4.41576e+10
-4.30663e+10
-4.45153e+10
-4.30316e+10
-4.44447e+10
-4.39846e+10
-4.37487e+10
-4.41441e+10
-4.38038e+10
-4.42294e+10
-3.46971e+10
-3.33849e+10
-2.55598e+10
-2.22979e+10
-2.52388e+10
-2.63929e+10
-2.7433e+10
-2.61878e+10
-2.70641e+10
-3.95026e+10
-4.20782e+10
-3.95868e+10
-3.99892e+10
-3.80228e+10
-4.01503e+10
-3.82503e+10
-3.14219e+10
-3.5221e+10
-3.17962e+10
-3.50494e+10
-3.28813e+10
-3.5382e+10
-3.3254e+10
-3.96583e+10
-4.20303e+10
-3.95386e+10
-4.01636e+10
-3.8215e+10
-4.0191e+10
-3.81318e+10
-3.16687e+10
-3.50002e+10
-3.12625e+10
-3.53021e+10
-3.31564e+10
-3.50553e+10
-3.27692e+10
-4.38015e+10
-4.25213e+10
-4.25918e+10
-4.22673e+10
-4.34607e+10
-4.40273e+10
-4.25975e+10
-4.2042e+10
-4.21893e+10
-4.42091e+10
-4.36549e+10
-4.40441e+10
-4.35415e+10
-4.39602e+10
-4.35141e+10
-4.3951e+10
-4.35281e+10
-4.35773e+10
-4.39337e+10
-4.36073e+10
-4.39194e+10
-4.38584e+10
-4.39815e+10
-4.48775e+10
-3.69525e+10
-4.14265e+10
-3.70571e+10
-3.7164e+10
-3.67337e+10
-3.29182e+10
-3.20864e+10
-2.59919e+10
-1.99219e+10
-1.5698e+10
-1.98527e+10
-2.54731e+10
-3.26372e+10
-3.24374e+10
-2.58314e+10
-2.01415e+10
-1.60196e+10
-1.99953e+10
-2.55473e+10
-4.41812e+10
-4.27602e+10
-4.32239e+10
-4.29171e+10
-4.40644e+10
-4.51122e+10
-4.27451e+10
-4.06494e+10
-4.18491e+10
-4.4811e+10
-4.40213e+10
-4.40841e+10
-4.37667e+10
-4.39089e+10
-4.41922e+10
-4.41234e+10
-4.42246e+10
-4.43718e+10
-4.40557e+10
-4.40736e+10
-4.41495e+10
-4.4216e+10
-4.51686e+10
-4.66774e+10
-3.69388e+10
-4.17302e+10
-3.68843e+10
-3.70998e+10
-3.59311e+10
-3.23509e+10
-3.25554e+10
-2.54039e+10
-2.00958e+10
-1.64361e+10
-2.55393e+10
-2.00113e+10
-3.23898e+10
-3.12913e+10
-2.53221e+10
-1.98864e+10
-1.6211e+10
-1.97953e+10
-2.46037e+10
-4.34366e+10
-4.33043e+10
-4.3571e+10
-4.35684e+10
-4.40255e+10
-4.40486e+10
-4.35528e+10
-4.36649e+10
-4.43467e+10
-4.33972e+10
-4.258e+10
-4.21931e+10
-4.27101e+10
-4.32198e+10
-4.35591e+10
-4.23794e+10
-4.25895e+10
-4.38244e+10
-4.28446e+10
-2.45479e+10
-1.56595e+10
-1.95018e+10
-1.95133e+10
-2.36625e+10
-3.08597e+10
-3.243e+10
-2.49118e+10
-1.61847e+10
-2.05645e+10
-2.00348e+10
-2.62525e+10
-3.46123e+10
-3.50894e+10
-3.98477e+10
-3.53274e+10
-3.34639e+10
-3.47828e+10
-4.00446e+10
-3.57615e+10
-3.57982e+10
-3.55342e+10
-4.42214e+10
-4.41751e+10
-4.40139e+10
-4.39344e+10
-4.4251e+10
-4.41478e+10
-4.39246e+10
-4.51575e+10
-4.45682e+10
-4.41187e+10
-4.31211e+10
-4.29345e+10
-4.38999e+10
-4.3412e+10
-4.42101e+10
-4.25335e+10
-4.29894e+10
-4.25966e+10
-4.44346e+10
-2.8295e+10
-1.73258e+10
-2.12224e+10
-2.70362e+10
-2.14497e+10
-3.50825e+10
-3.43077e+10
-2.86019e+10
-1.73195e+10
-2.16347e+10
-2.15722e+10
-2.79904e+10
-3.72219e+10
-3.58873e+10
-4.04528e+10
-3.64032e+10
-3.59984e+10
-3.75114e+10
-4.0379e+10
-3.5913e+10
-3.59855e+10
-3.66589e+10
-4.38886e+10
-4.34714e+10
-4.40109e+10
-4.4771e+10
-4.33157e+10
-4.46339e+10
-4.39255e+10
-4.41639e+10
-4.35211e+10
-4.41273e+10
-4.48819e+10
-4.36173e+10
-4.42159e+10
-4.48278e+10
-4.38247e+10
-4.3967e+10
-4.34708e+10
-4.48263e+10
-4.36232e+10
-4.45876e+10
-4.4138e+10
-2.95422e+10
-3.22547e+10
-2.96473e+10
-2.57641e+10
-3.24341e+10
-2.5792e+10
-2.92767e+10
-2.95259e+10
-2.98118e+10
-3.25409e+10
-2.598e+10
-3.25663e+10
-2.58958e+10
-2.9346e+10
-4.44204e+10
-4.4681e+10
-4.47723e+10
-4.51503e+10
-4.3666e+10
-4.50774e+10
-4.45359e+10
-2.91622e+10
-3.22734e+10
-2.95887e+10
-2.56872e+10
-3.22811e+10
-2.91064e+10
-2.56127e+10
-2.91923e+10
-2.94157e+10
-3.20349e+10
-2.54256e+10
-3.2227e+10
-2.54644e+10
-2.88579e+10
-4.38352e+10
-4.47768e+10
-4.33628e+10
-4.39803e+10
-4.47052e+10
-4.32363e+10
-4.39229e+10
-4.38637e+10
-4.48717e+10
-4.39196e+10
-4.33201e+10
-4.47076e+10
-4.39991e+10
-4.33299e+10
-2.79594e+10
-2.46986e+10
-3.05701e+10
-2.83869e+10
-2.48289e+10
-3.08128e+10
-2.75893e+10
-2.83319e+10
-2.56718e+10
-2.8757e+10
-3.13756e+10
-2.52639e+10
-2.87651e+10
-3.11055e+10
-4.43785e+10
-4.494e+10
-4.34784e+10
-4.38409e+10
-4.41994e+10
-4.51097e+10
-4.34078e+10
-4.47219e+10
-4.51173e+10
-4.41002e+10
-4.36125e+10
-4.54057e+10
-4.31531e+10
-4.46186e+10
-2.97455e+10
-2.6119e+10
-3.15442e+10
-2.90874e+10
-2.93671e+10
-2.6219e+10
-3.16143e+10
-2.99569e+10
-2.62001e+10
-2.8983e+10
-3.14268e+10
-2.6261e+10
-3.15694e+10
-2.97244e+10
-4.51905e+10
-3.72395e+10
-4.72926e+10
-3.72408e+10
-3.71135e+10
-4.54404e+10
-4.7442e+10
-4.7415e+10
-4.73138e+10
-4.77219e+10
-4.68729e+10
-4.73809e+10
-4.81337e+10
-4.78815e+10
-4.75431e+10
-4.55036e+10
-3.7235e+10
-3.69116e+10
-4.60978e+10
-3.70789e+10
-4.75271e+10
-4.41554e+10
-4.54061e+10
-3.71545e+10
-3.65953e+10
-4.76161e+10
-3.69097e+10
-4.59525e+10
-4.73182e+10
-4.76096e+10
-4.84997e+10
-4.76957e+10
-4.84053e+10
-4.52304e+10
-3.65818e+10
-3.68745e+10
-4.71313e+10
-4.53584e+10
-3.68303e+10
-4.71006e+10
-4.78988e+10
-4.92374e+10
-4.85978e+10
-4.84084e+10
-4.33388e+10
-4.3242e+10
-4.36816e+10
-4.33979e+10
-4.30999e+10
-4.34243e+10
-4.36516e+10
-4.27748e+10
-4.26017e+10
-4.2516e+10
-4.28813e+10
-4.2896e+10
-4.28117e+10
-4.26394e+10
-4.3036e+10
-4.32334e+10
-4.32951e+10
-4.30251e+10
-4.36145e+10
-4.30274e+10
-4.36035e+10
-4.33596e+10
-3.05932e+10
-3.00901e+10
-4.3419e+10
-4.37059e+10
-4.38336e+10
-4.38517e+10
-4.35507e+10
-4.35304e+10
-4.38279e+10
-4.30366e+10
-4.28804e+10
-4.29215e+10
-4.29837e+10
-4.31589e+10
-4.31848e+10
-4.30488e+10
-4.32711e+10
-4.33675e+10
-4.38235e+10
-4.34694e+10
-4.37272e+10
-4.33173e+10
-4.35024e+10
-4.3794e+10
-3.44313e+10
-3.39725e+10
-4.32734e+10
-4.34521e+10
-4.38666e+10
-4.35602e+10
-4.33316e+10
-4.35213e+10
-4.37193e+10
-4.42515e+10
-4.60621e+10
-4.61149e+10
-4.41954e+10
-4.43405e+10
-4.66738e+10
-4.62124e+10
-4.46186e+10
-4.33063e+10
-4.34621e+10
-4.32957e+10
-4.34535e+10
-4.33377e+10
-4.34808e+10
-4.31847e+10
-4.36842e+10
-4.34927e+10
-4.45784e+10
-4.39913e+10
-4.37117e+10
-4.3136e+10
-4.53285e+10
-4.59377e+10
-4.78616e+10
-4.80661e+10
-4.55288e+10
-4.57636e+10
-4.74699e+10
-4.53712e+10
-4.79783e+10
-4.35409e+10
-4.36467e+10
-4.33176e+10
-4.48789e+10
-4.28904e+10
-4.57389e+10
-4.34059e+10
-4.32101e+10
-4.35994e+10
-4.31002e+10
-4.35151e+10
-4.36231e+10
-4.30032e+10
-4.32843e+10
-4.27021e+10
-4.25949e+10
-4.24764e+10
-4.28343e+10
-4.28012e+10
-4.27887e+10
-4.25895e+10
-4.29596e+10
-4.31614e+10
-4.34692e+10
-4.36489e+10
-4.29715e+10
-4.36362e+10
-4.29566e+10
-4.32996e+10
-4.36769e+10
-4.35488e+10
-4.33997e+10
-4.35847e+10
-4.36493e+10
-4.33457e+10
-4.35209e+10
-4.34107e+10
-4.34798e+10
-4.31137e+10
-4.2927e+10
-4.31044e+10
-4.29844e+10
-4.33533e+10
-4.37944e+10
-4.36948e+10
-4.34339e+10
-4.35056e+10
-4.36193e+10
-4.34006e+10
-4.32155e+10
-4.30251e+10
-4.31846e+10
-4.30905e+10
-4.44021e+10
-4.52544e+10
-4.54883e+10
-3.72542e+10
-4.72332e+10
-3.68721e+10
-4.55658e+10
-3.71817e+10
-4.72968e+10
-4.80888e+10
-4.91084e+10
-4.80212e+10
-4.9427e+10
-4.81648e+10
-4.87833e+10
-4.78914e+10
-4.92757e+10
-4.54453e+10
-3.67841e+10
-3.7064e+10
-4.72063e+10
-4.55478e+10
-3.70327e+10
-4.72433e+10
-3.32815e+10
-3.30783e+10
-1.72582e+10
-2.2931e+10
-1.91653e+10
-2.61629e+10
-2.29025e+10
-1.93313e+10
-1.72864e+10
-1.354e+10
-1.22256e+10
-1.1781e+10
-1.39232e+10
-1.38163e+10
-1.24748e+10
-1.39252e+10
-1.21716e+10
-1.69347e+10
-2.58598e+10
-2.26651e+10
-1.8842e+10
-2.26694e+10
-1.88731e+10
-1.74296e+10
-3.25509e+10
-3.25418e+10
-1.71891e+10
-2.2884e+10
-2.56862e+10
-1.89684e+10
-2.27934e+10
-1.72585e+10
-1.86953e+10
-1.40093e+10
-1.27046e+10
-1.40082e+10
-1.26697e+10
-1.71208e+10
-2.55866e+10
-2.27001e+10
-1.85617e+10
-2.2684e+10
-1.8652e+10
-1.71241e+10
-1.39965e+10
-1.269e+10
-1.40184e+10
-1.26397e+10
-4.35264e+10
-4.37555e+10
-4.39565e+10
-4.41097e+10
-4.37145e+10
-4.37833e+10
-4.37877e+10
-4.46301e+10
-4.71566e+10
-4.69487e+10
-4.49195e+10
-4.34803e+10
-4.39436e+10
-4.3582e+10
-4.40719e+10
-4.36474e+10
-4.35767e+10
-4.37886e+10
-4.4692e+10
-4.77212e+10
-4.71039e+10
-4.53423e+10
-4.60335e+10
-4.34422e+10
-4.5819e+10
-4.46145e+10
-4.4086e+10
-4.24686e+10
-5.06529e+10
-5.13919e+10
-5.00158e+10
-5.08129e+10
-4.83754e+10
-4.95123e+10
-4.94115e+10
-4.71298e+10
-5.08425e+10
-5.02846e+10
-4.44548e+10
-4.09089e+10
-5.92179e+10
-4.1513e+10
-6.29261e+10
-4.4728e+10
-4.36214e+10
-4.3874e+10
-4.40072e+10
-4.36685e+10
-4.39406e+10
-4.34819e+10
-4.37536e+10
-4.30918e+10
-4.28708e+10
-4.28837e+10
-4.30703e+10
-4.35236e+10
-4.38858e+10
-4.38323e+10
-4.33893e+10
-4.38986e+10
-4.34644e+10
-4.3376e+10
-4.32148e+10
-4.31751e+10
-4.30072e+10
-4.3395e+10
-4.39575e+10
-4.40345e+10
-4.37196e+10
-4.40871e+10
-4.38534e+10
-4.4521e+10
-4.38869e+10
-4.3887e+10
-4.3974e+10
-4.36655e+10
-4.36017e+10
-4.36428e+10
-4.36376e+10
-4.36653e+10
-4.34905e+10
-4.36699e+10
-4.36324e+10
-4.37331e+10
-4.43579e+10
-4.38741e+10
-4.41222e+10
-4.37957e+10
-4.41564e+10
-4.37712e+10
-4.60467e+10
-4.72337e+10
-4.66973e+10
-3.72923e+10
-4.80404e+10
-3.70978e+10
-4.64793e+10
-3.72904e+10
-4.84179e+10
-5.01639e+10
-5.14329e+10
-5.20853e+10
-4.946e+10
-5.00155e+10
-5.06766e+10
-4.92874e+10
-5.19445e+10
-4.7174e+10
-3.70938e+10
-3.7108e+10
-4.71132e+10
-3.72755e+10
-4.86292e+10
-4.55631e+10
-3.24185e+10
-3.25221e+10
-1.71263e+10
-2.54039e+10
-2.26368e+10
-1.83989e+10
-2.25943e+10
-1.84875e+10
-1.70441e+10
-1.4304e+10
-1.30508e+10
-1.42437e+10
-1.31448e+10
-1.71535e+10
-2.5465e+10
-2.26291e+10
-1.87973e+10
-1.71835e+10
-2.25612e+10
-1.87299e+10
-1.42816e+10
-1.32372e+10
-1.41745e+10
-1.32259e+10
-3.25902e+10
-3.23562e+10
-1.67181e+10
-2.25344e+10
-1.82288e+10
-2.53528e+10
-2.24375e+10
-1.68434e+10
-1.81406e+10
-1.35696e+10
-1.30482e+10
-1.25778e+10
-1.39849e+10
-1.38561e+10
-1.31432e+10
-1.40236e+10
-1.28588e+10
-1.63083e+10
-2.49556e+10
-2.2201e+10
-1.76541e+10
-2.21508e+10
-1.76253e+10
-1.68707e+10
-4.34778e+10
-4.3345e+10
-4.33003e+10
-4.33922e+10
-4.36799e+10
-4.35929e+10
-4.34495e+10
-4.34447e+10
-4.35396e+10
-4.29703e+10
-4.28752e+10
-4.29369e+10
-4.29237e+10
-4.30866e+10
-4.29799e+10
-4.31327e+10
-4.30367e+10
-4.32113e+10
-4.33706e+10
-4.34338e+10
-4.34123e+10
-4.31883e+10
-4.34876e+10
-4.32949e+10
-4.38538e+10
-4.45105e+10
-4.3113e+10
-4.33877e+10
-4.34195e+10
-4.32806e+10
-4.32602e+10
-4.3293e+10
-4.32723e+10
-4.33556e+10
-4.40912e+10
-4.41167e+10
-4.33517e+10
-4.33625e+10
-4.40794e+10
-4.3465e+10
-4.41414e+10
-4.30556e+10
-4.32986e+10
-4.32219e+10
-4.32119e+10
-4.32772e+10
-4.32678e+10
-4.29904e+10
-4.37781e+10
-4.35734e+10
-4.35983e+10
-4.35349e+10
-4.39982e+10
-4.34863e+10
-4.35384e+10
-4.4476e+10
-4.51591e+10
-4.50012e+10
-4.45069e+10
-4.42019e+10
-4.4378e+10
-4.37595e+10
-4.47236e+10
-4.39739e+10
-4.36959e+10
-4.4389e+10
-4.36457e+10
-4.44609e+10
-4.35746e+10
-4.38645e+10
-1.6432e+10
-1.8245e+10
-2.20015e+10
-2.44171e+10
-1.80035e+10
-1.67009e+10
-2.17885e+10
-1.31153e+10
-1.20895e+10
-1.16429e+10
-1.35151e+10
-1.34636e+10
-1.23733e+10
-1.20149e+10
-1.37446e+10
-1.59295e+10
-2.39093e+10
-1.73199e+10
-2.15173e+10
-1.72454e+10
-2.14756e+10
-1.65236e+10
-3.12143e+10
-3.18791e+10
-1.7427e+10
-1.87124e+10
-2.23419e+10
-2.52145e+10
-1.71223e+10
-1.89763e+10
-2.2559e+10
-1.47284e+10
-1.30444e+10
-1.28987e+10
-1.50218e+10
-1.43552e+10
-1.26918e+10
-1.27249e+10
-1.41209e+10
-1.78223e+10
-2.57207e+10
-2.0257e+10
-2.32712e+10
-1.97065e+10
-2.28795e+10
-1.82598e+10
-4.19315e+10
-4.35494e+10
-3.49212e+10
-3.45704e+10
-4.36625e+10
-3.47707e+10
-4.20406e+10
-4.3939e+10
-4.43579e+10
-4.46781e+10
-4.35505e+10
-4.39603e+10
-4.45813e+10
-4.47822e+10
-4.3818e+10
-4.21485e+10
-3.43981e+10
-4.23412e+10
-3.4511e+10
-4.36104e+10
-3.46709e+10
-4.09468e+10
-4.22432e+10
-4.36882e+10
-3.50039e+10
-3.50925e+10
-4.39548e+10
-4.21363e+10
-3.52039e+10
-4.43017e+10
-4.5386e+10
-4.53995e+10
-4.43842e+10
-4.42501e+10
-4.47686e+10
-4.51886e+10
-4.39352e+10
-4.24398e+10
-3.53914e+10
-4.45344e+10
-3.56826e+10
-4.41863e+10
-3.5416e+10
-4.26987e+10
-4.4286e+10
-4.41837e+10
-4.33611e+10
-4.42797e+10
-4.35042e+10
-4.24713e+10
-4.34849e+10
-4.6415e+10
-4.3068e+10
-4.37237e+10
-4.35962e+10
-4.3651e+10
-4.3679e+10
-4.35434e+10
-4.33793e+10
-4.33157e+10
-4.35902e+10
-4.37477e+10
-4.3658e+10
-4.41617e+10
-4.39557e+10
-4.43056e+10
-4.3887e+10
-4.38061e+10
-4.66124e+10
-4.47657e+10
-4.40455e+10
-4.40908e+10
-4.41841e+10
-4.40904e+10
-4.41127e+10
-4.40517e+10
-4.42083e+10
-4.43866e+10
-4.50719e+10
-4.44865e+10
-4.50839e+10
-4.39746e+10
-4.40075e+10
-4.42087e+10
-4.38198e+10
-4.40146e+10
-4.4145e+10
-4.39644e+10
-4.44183e+10
-4.53773e+10
-4.46854e+10
-4.52013e+10
-4.41114e+10
-4.4848e+10
-4.40099e+10
-4.44376e+10
-4.44818e+10
-4.44706e+10
-4.39921e+10
-4.4921e+10
-4.57854e+10
-4.5883e+10
-4.48744e+10
-4.48764e+10
-4.5445e+10
-4.50941e+10
-4.58068e+10
-4.4247e+10
-4.44331e+10
-4.44042e+10
-4.41054e+10
-4.43836e+10
-4.41274e+10
-4.41919e+10
-1.97579e+10
-2.27686e+10
-2.79611e+10
-2.47714e+10
-2.23964e+10
-2.00138e+10
-2.45149e+10
-1.598e+10
-1.35413e+10
-1.37214e+10
-1.56387e+10
-1.62403e+10
-1.39856e+10
-1.38927e+10
-1.63663e+10
-1.93703e+10
-2.75074e+10
-2.1265e+10
-2.39079e+10
-2.19247e+10
-1.8965e+10
-2.4175e+10
-3.5364e+10
-3.53261e+10
-2.03078e+10
-2.31085e+10
-2.4986e+10
-2.87904e+10
-2.02239e+10
-2.33384e+10
-2.50173e+10
-1.64307e+10
-1.40915e+10
-1.36515e+10
-1.65705e+10
-1.64925e+10
-1.39835e+10
-1.38085e+10
-1.64729e+10
-2.00855e+10
-2.85939e+10
-2.27211e+10
-2.47685e+10
-2.30735e+10
-2.48346e+10
-2.03315e+10
-4.29321e+10
-3.69375e+10
-4.56282e+10
-3.64297e+10
-4.54247e+10
-3.62021e+10
-4.32035e+10
-4.43802e+10
-4.53191e+10
-4.43946e+10
-4.53003e+10
-4.28002e+10
-3.66304e+10
-4.49902e+10
-3.59887e+10
-4.51299e+10
-4.28291e+10
-3.60034e+10
-4.452e+10
-4.5501e+10
-4.53646e+10
-4.4603e+10
-4.33504e+10
-4.58806e+10
-3.65252e+10
-3.75735e+10
-4.6028e+10
-4.33562e+10
-3.64566e+10
-4.52404e+10
-4.57954e+10
-4.60895e+10
-4.49699e+10
-4.50118e+10
-4.57097e+10
-4.60316e+10
-4.47684e+10
-4.3833e+10
-3.77255e+10
-4.52229e+10
-3.64693e+10
-4.63413e+10
-3.65437e+10
-4.27019e+10
)
;
boundaryField
{
inlet
{
type zeroGradient;
}
outlet
{
type fixedValue;
value uniform 101325;
}
rightSide
{
type symmetryPlane;
}
leftSide
{
type symmetryPlane;
}
duct
{
type zeroGradient;
}
cylinder
{
type zeroGradient;
}
}
// ************************************************************************* //
| [
"[arnau.prat.gasull@estudiant.upc.edu]"
] | [arnau.prat.gasull@estudiant.upc.edu] | |
e1ad403eedf2dea821ed69f5d1fd0dbfd5bb9f71 | 4d6d28b3a3ff72068cb66678a1090597aa357504 | /Snake.h | 67f0540ab8ec48c02a27a4310921432f66c42659 | [] | no_license | Batuzz/snake-cpp | b78a16585507f876c4fc0ff5a92d5b887cb469fc | 4c1b8fad0a4db0b0e304c03f1c0870cbe625ce7c | refs/heads/master | 2020-05-18T20:18:46.734882 | 2019-06-21T17:21:52 | 2019-06-21T17:21:52 | 184,628,279 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 494 | h | #pragma once
#include "Point.h"
#include <vector>
using namespace std;
class Snake
{
private:
char snakeCharacter;
vector<Point*> body;
int size;
int currentElementIndex = 0;
public:
Snake(char snakeCharacter, Point* startPos, int startSize);
void addNewPosition(Point point);
void incrementSize();
Point* getPosition(int index);
int getSize();
int getBodySize();
int getPositionsAmmount();
Point* getNextElement();
void resetCurrentElementIndex();
char getSnakeCharacter();
}; | [
"wellski15@gmail.com"
] | wellski15@gmail.com |
c68bcf780db4a470ed1ad3ac402634df67ce8554 | e261475d0e86cc1f4ba7af252ba957945b7e8950 | /emulatorLib/emulatorLib.h | cb6e38d23c0c085caf0f454747bab1ab4c0fd127 | [] | no_license | SiChiTong/emu-LLC | 6130e9e947b26b2167711d85857e1bffa37df479 | 60e538f1bc433d2067f886c62e519a14d471238f | refs/heads/master | 2022-11-22T05:51:37.506142 | 2020-08-02T00:24:18 | 2020-08-02T00:24:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,279 | h | #ifndef emulatorLib_h
#define emulatorLib_h
#include "mbed.h"
#include "emulatorPin.h"
#include <cstdint>
#include <cstring>
#include "FIFO.hpp"
#include <deque>
#include "crc.h"
#include "eeprom.h"
#include <cmath>
#define PI 3.14159265359
class Emuart{
public:
Emuart(RawSerial& serialObject, unsigned int bufferSize);
Emuart(RawSerial& serialObject, unsigned int bufferSize, float SamplingTime);
~Emuart();
void init(void);
uint8_t command;
uint8_t data[4096]; //command will be added at dataLen+1 when calculate checksum
uint16_t dataLen; //Excluding start,dataLen
void clearData(void);
void clearAll(void);
int parse(void);
void write(uint8_t command, uint16_t dataLen, uint8_t* dataBuffer);
void write(uint8_t command);
void print(char* string);
void clearInputBuffer(void);
void setBufferSize(unsigned int size);
unsigned int getBufferSize(void);
void setSamplingTime(float Ts);
float getSamplingTime(void);
private:
RawSerial& SER;
FIFO<uint8_t> fifo;
unsigned int bufferSize;
unsigned int samplingTime;
uint32_t checksum; //crc32
void rxCallback(void);
};
class JointState{
public:
JointState(){}
JointState(double initial_pos, float initial_vel){
this->q = initial_pos;
this->qd = initial_vel;
}
~JointState(){}
void positionIsAt(double pos){this->q = pos;}
void velocityIsAt(float vel){this->qd = vel;}
double position(){return q;}
float velocity(){return qd;}
private:
double q = 0.0;
float qd = 0.0f;
};
class Stepper {
public:
Stepper(PinName pulsePin, PinName directionPin, PinName enablePin);
~Stepper();
void enable(void);
void disable(void);
void setFrequency(float frequency);
void setFrequency(int frequency);
void setMaxFrequency(float max_frequency);
void setRatio(float reducingRatio);
void setMicro(uint8_t microstepDen);
void setDir(int8_t setDefaultDirection);
void ols(float speed); //open-loop speed rad/s
private:
DigitalOut EN;
DigitalOut DIR;
PwmOut STEP;
int8_t dir;
float frequency; //Hz
float max_frequency;
float microstep = 1;
float spr = 200.0f; //Step per rev
float ratio = 1.0f;
};
class AMT21{
public:
AMT21(RawSerial&, uint8_t, PinName);
~AMT21();
JointState state;
void setID(uint8_t);
void setRatio(float ratio);
uint8_t getID();
void setChecksum(bool checksumRequirement);
bool getChecksum();
int16_t read();
int16_t read(uint8_t);
double readPosition();
double position(); //Filtered position
float velocity(); //Filtered position
//Kalman Filter
void setKdt(float kalmanDt);
float getKdt();
void setSigmaW(float covariance);
float getSigmaW();
void setSigmaA(float covariance);
float getSigmaA();
void kmfInit();
void kmfEstimate();
bool continuous = 0;
private:
RawSerial& SER;
DigitalOut FLOW;
uint8_t ID;
float ratio = 1.0f; //Velocity ratio between encoder and destination
bool check = 1; //Allow to calculate checksum
int32_t k_wrap = 0;
int8_t initial_pose = 0;
//Kalman Filter
bool k_init = 0;
float p11, p12, p21, p22;
float x_hat_1, x_hat_2;
float k_prev_pos;
float kdt = 0.005f; //Kalman Filter sampling time max: 0.0002883 sec(3468.208 Hz)
float sigma_a = 0.1f;
float sigma_w = 0.008f;
unsigned char checksum(uint16_t);
};
class Controller{
public:
Controller(float, float, float);
~Controller();
void setKp(float _Kp);
void setKi(float _Ki);
void setKd(float _Kd);
float getKp(void);
float getKi(void);
float getKd(void);
void init(void);
float updatePID(float setPoint, float feedback);
float updatePIDF(float setPoint, float feedforward, float feedback);
void setSat(float lb, float ub);
void unsetSat();
private:
float Kp;
float Ki;
float Kd;
float s, p;
bool isInit;
float sat = 0;
float u_lim;
float l_lim;
float saturate(float saturation);
};
class Trajectory {
public:
Trajectory();
~Trajectory();
void setGoal(float qi, float qf, float vi, float vf, float duration);
void setViaPoints(std::deque <float> _qr, std::deque <float> _vr, std::deque <float> _Tvec);
float getPosTraj(float time);
float getVelTraj(float time);
float getTime();
bool reached();
float getC0();
float getC1();
float getC2();
float getC3();
float getQi();
float getQf();
float getVi();
float getVf();
uint8_t pointLeft();
float getDuration();
float step(float stop_at);
private:
void nextSub();
float qi, qf;
float vi, vf;
float c0,c1,c2,c3, T;
std::deque <float> qr, vr;
std::deque <float> Tvec;
float Tlat;
bool atGoal;
};
class Actuator {
public:
Actuator(PinName pulsePin, PinName directionPin, PinName enablePin, int8_t defaultDirection, RawSerial& serialObject, uint8_t encoderID, PinName flowControlPin);
Actuator(PinName pulsePin, PinName directionPin, PinName enablePin, int8_t defaultDirection, RawSerial& serialObject, uint8_t encoderID, PinName flowControlPin, float Kp, float Ki, float Kd);
~Actuator();
Stepper stepper;
AMT21 encoder;
Controller pcon;
Trajectory trajectory;
float at();
float vat();
void operator=(float speed);
void operator=(int speed);
float update(float setPoint, float feedforward, float feedback, uint8_t controllerType);
void setPconSat(float lb, float ub);
void unsetPconSat();
private:
int8_t dir;
};
#endif | [
"c.thanapong@aol.com"
] | c.thanapong@aol.com |
709df3921ce4799f120aeab5a97d90b4105a793f | d53067340047ba0c74b72351e9d9683aa10cded7 | /onnxruntime/core/providers/nnapi/nnapi_builtin/builders/helper.cc | 5f2cd755d35e16d38ede2595d8dd4fbe24710845 | [
"MIT"
] | permissive | Gideon0805/onnxruntime | 8199aa2a029649212459b565b969b113c5120258 | a776b57160e3ca937573248349a9377c90e2bf24 | refs/heads/master | 2023-05-13T11:35:48.575420 | 2021-06-08T17:43:06 | 2021-06-08T17:43:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,226 | cc | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
#include <iostream>
#include <string>
#include <vector>
#include <core/common/safeint.h>
#include <core/common/logging/logging.h>
#include <core/framework/tensorprotoutils.h>
#include <core/graph/graph.h>
#include <core/graph/graph_viewer.h>
#include <core/providers/common.h>
#include "core/providers/shared/utils/utils.h"
#include "helper.h"
#include "op_support_checker.h"
namespace onnxruntime {
namespace nnapi {
using std::string;
using std::vector;
std::string GetErrorCause(int error_code) {
switch (error_code) {
case ANEURALNETWORKS_NO_ERROR:
return "ANEURALNETWORKS_NO_ERROR";
case ANEURALNETWORKS_OUT_OF_MEMORY:
return "ANEURALNETWORKS_OUT_OF_MEMORY";
case ANEURALNETWORKS_INCOMPLETE:
return "ANEURALNETWORKS_INCOMPLETE";
case ANEURALNETWORKS_UNEXPECTED_NULL:
return "ANEURALNETWORKS_UNEXPECTED_NULL";
case ANEURALNETWORKS_BAD_DATA:
return "ANEURALNETWORKS_BAD_DATA";
case ANEURALNETWORKS_OP_FAILED:
return "ANEURALNETWORKS_OP_FAILED";
case ANEURALNETWORKS_BAD_STATE:
return "ANEURALNETWORKS_BAD_STATE";
case ANEURALNETWORKS_UNMAPPABLE:
return "ANEURALNETWORKS_UNMAPPABLE";
case ANEURALNETWORKS_OUTPUT_INSUFFICIENT_SIZE:
return "ANEURALNETWORKS_OUTPUT_INSUFFICIENT_SIZE";
case ANEURALNETWORKS_UNAVAILABLE_DEVICE:
return "ANEURALNETWORKS_UNAVAILABLE_DEVICE";
default:
return "Unknown error code: " + std::to_string(error_code);
}
}
QLinearOpType GetQLinearOpType(const onnxruntime::Node& node) {
const auto& op_type = node.OpType();
if (op_type == "DequantizeLinear")
return QLinearOpType::DequantizeLinear;
else if (op_type == "QuantizeLinear")
return QLinearOpType::QuantizeLinear;
else if (op_type == "QLinearConv")
return QLinearOpType::QLinearConv;
else if (op_type == "QLinearMatMul")
return QLinearOpType::QLinearMatMul;
else if (op_type == "QLinearAdd")
return QLinearOpType::QLinearAdd;
else if (op_type == "QLinearSigmoid")
return QLinearOpType::QLinearSigmoid;
else if (op_type == "QLinearAveragePool")
return QLinearOpType::QLinearAveragePool;
return QLinearOpType::Unknown;
}
ConvType GetConvType(const onnxruntime::Node& node, const InitializedTensorSet& initializers) {
const auto& op_type = node.OpType();
bool is_qlinear_conv = (op_type == "QLinearConv");
ORT_ENFORCE(op_type == "Conv" || is_qlinear_conv);
NodeAttrHelper helper(node);
const auto group = helper.Get("group", 1);
size_t w_idx = is_qlinear_conv ? 3 : 1;
const auto& weight = node.InputDefs()[w_idx]->Name();
const auto& weight_tensor = *initializers.at(weight);
// For ONNX we only have 1 conv ops
// For NNAPI we have 3
// Input is (N, C, H, W)
// group == 1, --> regular conv
// group != 1 && weight is (M, 1, kH, kW), --> depthwise conv
// group != 1 && weight is (M, C/group, kH, kW), --> grouped conv
if (group == 1)
return ConvType::Regular;
else if ((weight_tensor.dims()[1] == 1))
return ConvType::Depthwise;
else
return ConvType::Grouped;
}
bool IsQLinearBinaryOp(QLinearOpType qlinear_op_type) {
return qlinear_op_type == QLinearOpType::QLinearConv ||
qlinear_op_type == QLinearOpType::QLinearMatMul ||
qlinear_op_type == QLinearOpType::QLinearAdd;
}
bool HasValidUnaryOpQuantizedInputs(const Node& node) {
int32_t input_type;
if (!GetType(*node.InputDefs()[0], input_type))
return false;
if (input_type != ONNX_NAMESPACE::TensorProto_DataType_UINT8) {
LOGS_DEFAULT(VERBOSE) << "[" << node.OpType()
<< "] Input type: [" << input_type
<< "] is not supported for now";
return false;
}
return true;
}
bool HasValidBinaryOpQuantizedInputs(const Node& node) {
auto op_type = GetQLinearOpType(node);
int32_t a_input_type, b_input_type;
if (!IsQLinearBinaryOp(op_type)) {
LOGS_DEFAULT(VERBOSE) << "[" << node.OpType() << "] is not a binary qlinear op";
return false;
}
const auto input_defs(node.InputDefs());
if (!GetType(*input_defs[0], a_input_type))
return false;
if (!GetType(*input_defs[3], b_input_type))
return false;
// QlinearConv supports u8u8 or u8s8
// QLinearMatMul/Add only support u8u8
bool is_qlinear_conv = op_type == QLinearOpType::QLinearConv;
bool has_valid_qlinear_conv_weight =
(b_input_type == ONNX_NAMESPACE::TensorProto_DataType_UINT8 ||
b_input_type == ONNX_NAMESPACE::TensorProto_DataType_INT8);
if (a_input_type != ONNX_NAMESPACE::TensorProto_DataType_UINT8 ||
(!is_qlinear_conv && a_input_type != b_input_type) ||
(is_qlinear_conv && !has_valid_qlinear_conv_weight)) {
LOGS_DEFAULT(VERBOSE) << "[" << node.OpType()
<< "] A Input type: [" << a_input_type
<< "] B Input type: [" << b_input_type
<< "] is not supported for now";
return false;
}
return true;
}
bool HasValidQuantizationScales(const InitializedTensorSet& initializers, const Node& node,
const std::vector<size_t>& indices, const OpSupportCheckParams& params) {
const auto& op_type = node.OpType();
auto qlinear_op_type = GetQLinearOpType(node);
bool is_qlinear_conv = (qlinear_op_type == QLinearOpType::QLinearConv);
bool is_qlinear_matmul = (qlinear_op_type == QLinearOpType::QLinearMatMul);
const auto input_defs(node.InputDefs());
for (const auto idx : indices) {
if (idx >= input_defs.size()) {
LOGS_DEFAULT(VERBOSE) << "HasValidQuantizationScales, Input index, " << idx
<< " >= input number, " << input_defs.size();
return false;
}
const auto scale_name = input_defs[idx]->Name();
if (!Contains(initializers, scale_name)) {
LOGS_DEFAULT(VERBOSE) << "The scale of " << op_type << " must be an initializer tensor";
return false;
}
// If this op is Qlinear[Conv/MatMul], we want to check u8s8 support for weight tensor (or B tensor for QlinearMatMul)
bool is_conv_matmul_weight = (is_qlinear_conv || is_qlinear_matmul) && idx == 4;
bool is_conv_matmul_u8s8_weight = false;
if (is_conv_matmul_weight) {
const auto& weight_tensor = *initializers.at(node.InputDefs()[3]->Name());
is_conv_matmul_u8s8_weight = weight_tensor.data_type() == ONNX_NAMESPACE::TensorProto_DataType_INT8;
}
const auto& scale_tensor = *initializers.at(scale_name);
int64_t scales_dim = scale_tensor.dims().empty() ? 1 : scale_tensor.dims()[0];
if (!is_conv_matmul_u8s8_weight) {
if (scales_dim != 1) {
LOGS_DEFAULT(VERBOSE) << op_type << " does not support per-channel quantization, "
<< " for now, only u8s8 QlinearConv supports per-channel quantization on API 29+";
return false;
}
} else if (scales_dim != 1) {
// For u8s8 Qlinear[Conv/MatMul], we support
// 1. Per-tensor, the weight will be transformed to uint8 later
// 2. Per-channel, only from Android API level 29
if (is_qlinear_matmul) {
LOGS_DEFAULT(VERBOSE) << "QLinearMatMul does not support per-channel quantization";
return false;
}
if (params.android_sdk_ver < 29) {
LOGS_DEFAULT(VERBOSE) << op_type << " only supports per-channel quantization on Android API 29+, "
<< "system API level: " << params.android_sdk_ver;
return false;
}
const auto& weight_tensor = *initializers.at(node.InputDefs()[3]->Name());
if (weight_tensor.dims()[0] != scales_dim) {
LOGS_DEFAULT(VERBOSE) << op_type << " mismatch int8 per-channel quantization weight,"
<< " weight dimension[0] " << weight_tensor.dims()[0]
<< " scale dimension " << scales_dim;
return false;
}
}
}
return true;
}
bool HasValidQuantizationZeroPoints(const InitializedTensorSet& initializers, const Node& node,
const std::vector<size_t>& indices) {
const auto& op_type = node.OpType();
auto qlinear_op_type = GetQLinearOpType(node);
bool is_qlinear_conv = (qlinear_op_type == QLinearOpType::QLinearConv);
bool is_qlinear_matmul = (qlinear_op_type == QLinearOpType::QLinearMatMul);
const auto input_defs(node.InputDefs());
for (const auto idx : indices) {
if (idx >= input_defs.size()) {
LOGS_DEFAULT(VERBOSE) << "HasValidQuantizationZeroPoints, Input index, " << idx
<< " >= input number, " << input_defs.size();
return false;
}
const auto zero_point_name = input_defs[idx]->Name();
if (!Contains(initializers, zero_point_name)) {
LOGS_DEFAULT(VERBOSE) << "The zero point of " << op_type << " must be an initializer tensor";
return false;
}
bool is_conv_matmul_weight = is_qlinear_conv && idx == 5;
bool is_conv_matmul_u8s8_weight = false;
if (is_conv_matmul_weight) {
const auto& weight_tensor = *initializers.at(node.InputDefs()[3]->Name());
is_conv_matmul_u8s8_weight = weight_tensor.data_type() == ONNX_NAMESPACE::TensorProto_DataType_INT8;
}
const auto& zero_tensor = *initializers.at(zero_point_name);
int64_t zero_dim = zero_tensor.dims().empty() ? 1 : zero_tensor.dims()[0];
if (!is_conv_matmul_u8s8_weight) {
if (zero_dim != 1) {
LOGS_DEFAULT(VERBOSE) << op_type << " does not support per-channel quantization, "
<< " for now, only u8s8 QlinearConv supports per-channel quantization on API 29+";
return false;
}
} else {
// For u8s8 Qlinear[Conv/MatMul], we support
// 1. Per-tensor, the weight will be transformed to uint8 later
// 2. Per-channel, only from Android API level 29
if (zero_tensor.data_type() != ONNX_NAMESPACE::TensorProto_DataType_INT8) {
LOGS_DEFAULT(VERBOSE) << "u8s8 Qlinear[Conv/MatMul] only supports int8 zero point for weight, "
<< "actual zero point type: [" << zero_tensor.data_type() << "]";
return false;
}
if (zero_dim != 1) {
if (is_qlinear_matmul) {
LOGS_DEFAULT(VERBOSE) << "QLinearMatMul does not support per-channel quantization";
return false;
}
}
// For onnx, u8s8 QlinearConv, the weight zero point can be a scalar,
// or a tensor with same channel as weight, for NNAPI we only support it be
// 0 (scalar) or all 0 (tensor), NNAPI will assume the zero point for per-channel
// quantization is 0 there is no input for it
const auto& weight_tensor = *initializers.at(node.InputDefs()[3]->Name());
if (weight_tensor.dims()[0] != zero_dim && zero_dim != 1) {
LOGS_DEFAULT(VERBOSE) << op_type << " mismatch int8 per-channel quantization weight,"
<< " weight dimension[0] " << weight_tensor.dims()[0]
<< " zero point dimension " << zero_dim;
return false;
}
std::unique_ptr<uint8_t[]> unpacked_tensor;
size_t tensor_byte_size;
auto status = onnxruntime::utils::UnpackInitializerData(
zero_tensor,
node.ModelPath(),
unpacked_tensor, tensor_byte_size);
if (!status.IsOK()) {
LOGS_DEFAULT(ERROR) << "Qlinear[Conv/MatMul] error when unpack zero tensor: " << zero_point_name
<< ", error msg: " << status.ErrorMessage();
return false;
}
// Verify all onnx weight zero point(s) are 0(s)
const int8_t* zero_points = reinterpret_cast<const int8_t*>(unpacked_tensor.get());
for (size_t i = 0; i < tensor_byte_size; i++) {
if (zero_points[i] != 0) {
LOGS_DEFAULT(VERBOSE) << "u8s8 Qlinear[Conv/MatMul] only support 0 as zero point, "
<< "zero_points[" << i << "] has value: " << zero_points[i];
return false;
}
}
}
}
return true;
}
float GetQuantizationScale(const InitializedTensorSet& initializers, const Node& node, size_t idx) {
const auto& scale_tensor = *initializers.at(node.InputDefs()[idx]->Name());
return GetTensorFloatData(scale_tensor)[0];
}
common::Status GetQuantizationZeroPoint(const InitializedTensorSet& initializers,
const Node& node, size_t idx, int32_t& zero_point) {
std::unique_ptr<uint8_t[]> unpacked_tensor;
size_t tensor_byte_size;
const auto& zero_point_tensor = *initializers.at(node.InputDefs()[idx]->Name());
ORT_RETURN_IF_ERROR(
onnxruntime::utils::UnpackInitializerData(zero_point_tensor, node.ModelPath(),
unpacked_tensor, tensor_byte_size));
// Onnx quantization uses uint8 [int8 not yet supported], need to cast to int32_t used by NNAPI
zero_point = static_cast<int32_t>(unpacked_tensor.get()[0]);
return Status::OK();
}
bool GetShape(const NodeArg& node_arg, Shape& shape) {
shape.clear();
const auto* shape_proto = node_arg.Shape();
if (!shape_proto) {
LOGS_DEFAULT(WARNING) << "NodeArg [" << node_arg.Name() << "] has no shape info";
return false;
}
// NNAPI uses 0 for dynamic dimension, which is the default value for dim.dim_value()
for (const auto& dim : shape_proto->dim())
shape.push_back(SafeInt<uint32_t>(dim.dim_value()));
return true;
}
bool GetType(const NodeArg& node_arg, int32_t& type) {
type = ONNX_NAMESPACE::TensorProto_DataType_UNDEFINED;
const auto* type_proto = node_arg.TypeAsProto();
if (!type_proto || !type_proto->has_tensor_type() || !type_proto->tensor_type().has_elem_type()) {
LOGS_DEFAULT(WARNING) << "NodeArg [" << node_arg.Name() << "] has no input type";
return false;
}
type = type_proto->tensor_type().elem_type();
return true;
}
void GetFlattenOutputShape(const Node& node, const Shape& input_shape, int32_t& dim_1, int32_t& dim_2) {
int32_t rank = static_cast<int>(input_shape.size());
NodeAttrHelper helper(node);
int32_t axis = helper.Get("axis", 1);
// axis == rank is a valid input, but invalid for HandleNegativeAxis
// Skip non-negative axis here
if (axis < 0)
axis = static_cast<int32_t>(HandleNegativeAxis(axis, rank));
dim_1 = std::accumulate(input_shape.cbegin(), input_shape.cbegin() + axis, 1, std::multiplies<int32_t>());
dim_2 = std::accumulate(input_shape.cbegin() + axis, input_shape.cend(), 1, std::multiplies<int32_t>());
}
bool IsValidSupportedNodesGroup(const std::vector<size_t>& supported_node_group, const GraphViewer& graph_viewer) {
if (supported_node_group.empty())
return false;
if (supported_node_group.size() == 1) {
const auto& node_indices = graph_viewer.GetNodesInTopologicalOrder();
const auto* node(graph_viewer.GetNode(node_indices[supported_node_group[0]]));
const auto& op = node->OpType();
// It is not worth it to perform a single Reshape/Flatten/Identity operator
// which is only copying the data in NNAPI
// If this is the case, let it fall back
if (op == "Reshape" ||
op == "Flatten" ||
op == "Identity") {
return false;
}
}
return true;
}
bool IsInternalQuantizedNode(const Node& node) {
// These operators can use uint8 input without specific QLinear version of it
// However, the mode has to be internal to the graph/partition (they cannot consume graph inputs)
static const std::unordered_set<std::string> internal_quantized_op_types =
{
"Transpose",
"Resize",
"Concat",
"MaxPool",
};
if (!Contains(internal_quantized_op_types, node.OpType()))
return false;
int32_t input_type;
ORT_ENFORCE(GetType(*node.InputDefs()[0], input_type));
return input_type == ONNX_NAMESPACE::TensorProto_DataType_UINT8;
}
// We support some operators running using uint8 internally
// These nodes cannot use a graph input as input since onnx graph input does not carry scale/zero point info
bool IsInternalQuantizationSupported(const Node& node, const std::unordered_set<std::string>& node_outputs_in_group) {
const auto& op_type = node.OpType();
// The node's input(s) have to be an output of node(s) within the group
// If not, then this node is using graph/partition input(s) as input(s)
const auto& input_defs = node.InputDefs();
// We only need to check input0 for all operators except "Concat"
bool check_all_inputs = op_type == "Concat";
for (size_t i = 0; i < (check_all_inputs ? input_defs.size() : 1); i++) {
if (!Contains(node_outputs_in_group, input_defs[i]->Name())) {
LOGS_DEFAULT(VERBOSE) << "Node [" << node.Name() << "] type: [" << op_type
<< "] has input [" << input_defs[i]->Name()
<< "] does not support using graph input(quantized) as node input";
return false;
}
}
return true;
}
bool IsNodeSupported(const Node& node, const GraphViewer& graph_viewer, const OpSupportCheckParams& params) {
const auto& op_support_checkers = GetOpSupportCheckers();
if (!Contains(op_support_checkers, node.OpType()))
return false;
const auto* op_support_checker = op_support_checkers.at(node.OpType());
return op_support_checker->IsOpSupported(graph_viewer.GetAllInitializedTensors(), node, params);
}
bool IsNodeSupportedInternal(const Node& node, const GraphViewer& graph_viewer,
const OpSupportCheckParams& params,
const std::unordered_set<std::string>& node_outputs_in_group) {
if (!IsNodeSupported(node, graph_viewer, params))
return false;
// We also want to check if the node is supported as an internal quantized node
if (IsInternalQuantizedNode(node))
return IsInternalQuantizationSupported(node, node_outputs_in_group);
else // This is not a internal quantized node, it is supported
return true;
}
bool IsInputSupported(const NodeArg& input, const std::string& parent_name) {
const auto& input_name = input.Name();
const auto* shape_proto = input.Shape();
// We do not support input with no shape
if (!shape_proto) {
LOGS_DEFAULT(VERBOSE) << "Input [" << input_name << "] of [" << parent_name
<< "] has not shape";
return false;
}
for (const auto& dim : shape_proto->dim()) {
// For now we do not support dynamic shape
if (!dim.has_dim_value()) {
LOGS_DEFAULT(WARNING) << "Dynamic shape is not supported for now, for input:" << input_name;
return false;
}
}
return true;
}
std::vector<std::vector<size_t>> GetSupportedNodes(const GraphViewer& graph_viewer, const OpSupportCheckParams& params) {
std::vector<std::vector<size_t>> supported_node_groups;
if (params.android_sdk_ver < ORT_NNAPI_MIN_API_LEVEL) {
LOGS_DEFAULT(WARNING) << "All ops will fallback to CPU EP, because Android API level [" << params.android_sdk_ver
<< "] is lower than minimal supported API level [" << ORT_NNAPI_MIN_API_LEVEL
<< "] of this build for NNAPI";
return supported_node_groups;
}
// Disable NNAPI if the graph has input with dynamic shape
for (const auto* input : graph_viewer.GetInputs()) {
if (!IsInputSupported(*input, "graph")) {
return supported_node_groups;
}
}
// This holds the supported node's topological index
std::vector<size_t> supported_node_group;
// This holds the NodeIndex of the nodes in the above group
std::unordered_set<std::string> node_outputs_in_group;
const auto& node_indices = graph_viewer.GetNodesInTopologicalOrder();
for (size_t i = 0; i < node_indices.size(); i++) {
const auto* node(graph_viewer.GetNode(node_indices[i]));
bool supported = IsNodeSupportedInternal(*node, graph_viewer, params, node_outputs_in_group);
LOGS_DEFAULT(VERBOSE) << "Operator type: [" << node->OpType()
<< "] index: [" << i
<< "] name: [" << node->Name()
<< "] supported: [" << supported
<< "]";
if (supported) {
supported_node_group.push_back(i);
// We want to put all the output names of nodes in the current group for easy query
// See IsInternalQuantizationSupported()
for (const auto* output : node->OutputDefs()) {
node_outputs_in_group.insert(output->Name());
}
} else {
if (IsValidSupportedNodesGroup(supported_node_group, graph_viewer)) {
supported_node_groups.push_back(supported_node_group);
}
supported_node_group.clear();
node_outputs_in_group.clear();
}
}
if (IsValidSupportedNodesGroup(supported_node_group, graph_viewer))
supported_node_groups.push_back(supported_node_group);
return supported_node_groups;
}
std::string Shape2String(const std::vector<uint32_t>& shape) {
std::ostringstream os;
os << "[ ";
for (const auto& dim : shape)
os << dim << " ";
os << "]";
return os.str();
}
} // namespace nnapi
} // namespace onnxruntime
| [
"noreply@github.com"
] | Gideon0805.noreply@github.com |
8e13a6fa81345d16de48bd60183541efc65499d2 | de911ba30d4690689147b9920f8c70eb88c99f65 | /src/handle_global_data_op.h | 15888cc58a59e17bfecb2abd675ef1aabfe23c2f | [] | no_license | Clcanny/shade-so | 3192418d98821708cc4d92a087f185b460c44acc | ee14ff65e5c3d6818df292475bca62700fb6421a | refs/heads/main | 2023-03-26T00:26:06.725705 | 2021-03-25T10:09:28 | 2021-03-25T14:43:20 | 311,997,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 645 | h | // Copyright (c) @ 2021 junbin.rjb.
// All right reserved.
//
// Author: junbin.rjb <837940593@qq.com>
// Created: 2021/03/18
// Description
#ifndef SRC_HANDLE_GLOBAL_DATA_OP_H_
#define SRC_HANDLE_GLOBAL_DATA_OP_H_
#include <cstdint>
#include "src/operator.h"
namespace shade_so {
class HandleGlobalDataOp : public Operator {
public:
explicit HandleGlobalDataOp(OperatorArgs args);
void extend() override;
void merge() override;
private:
void merge_relative_relocs();
private:
OperatorArgs args_;
int64_t data_off_;
int64_t rodata_off_;
};
} // namespace shade_so
#endif // SRC_HANDLE_GLOBAL_DATA_OP_H_
| [
"a837940593@gmail.com"
] | a837940593@gmail.com |
467e59d0a1b357f85ba64b143e6ffc1f3ba05e14 | a5a9de7ce58b576ae59283daf5c37aa77501ce81 | /Priority Queue Exercise/Job.h | 433e3b2ee673f104db93a524e376165480ea5cac | [] | no_license | jlgettings/Portfolio | 2c9c6c3e433905d492c7b6422ed6c468f0d3e46b | 74b1ba9927766834ffbaeb5f812fc73e9ebe1ce1 | refs/heads/master | 2016-09-05T10:09:56.684809 | 2016-01-16T15:06:31 | 2016-01-16T15:06:31 | 41,897,641 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,517 | h | /*FILE: Job.cpp (Assignment 4)
WRITTEN BY: Jessica Gettings (jgetting@spsu.edu)
Contains constructors, a print function, accessor functions, an overloaded < operator, and a destructor
*/
#ifndef JOB_H
#define JOB_H
class Job
{
public:
//default constructor
Job();
//overloaded constructor
Job(int id, int pr, int du);
//Precondition: ID, priority, and duration parameters are provided
//Postcondition: A Job objects is created using these parameters
//print function for debugging purposes
void printJob();
//Precondition: A Job object is instantiated
//Postcondition: The ID, priority, and duration of the job are printed
//accessors
int getID();
//Precondition: Job object is instantiated
//Postcondition: Job ID is returned as int
int getPriority();
//Precondition: Job object is instantiated
//Postcondition: priority of job is returned as int
int getDuration();
//Precondition: Job object is instantiated
//Postcondition: Job duration is returned as int
//operator< overload
bool operator<(Job a);
//Precondition: A Job object is passed as a parameter
//Postcondition: returns TRUE if the Job has a higher overall priority (lower priority and duration values)
//than the Job making the call
virtual ~Job();
protected:
private:
int id, priority, duration;
};
#endif // JOB_H
| [
"jlgett@gmail.com"
] | jlgett@gmail.com |
0b8a0f5e616d2b499b2c9a1adb0db01b4acd0adb | 54f0f7acacc2e351ad2829ec7ab1589dbaa36c5d | /Source/AdventureGameV001/GameplayActors/Critter.cpp | ad36a6ed6bfd2d47506ad264c6b8dd34274d18e8 | [] | no_license | PandaJoey/adventuregame | 5985d8131c4ef5e7ab0f3f50b1003e707b2f494e | b5ac9c9f79cebd75ddfb13ee03e69f7d6ffc55ed | refs/heads/main | 2023-05-13T13:04:38.611223 | 2021-06-06T15:09:13 | 2021-06-06T15:09:13 | 374,390,977 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,709 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "Critter.h"
#include "Camera/CameraComponent.h"
#include "Components/InputComponent.h"
#include "Components/SkeletalMeshComponent.h"
// Sets default values
ACritter::ACritter()
{
// Set this pawn to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCanEverTick = true;
// Creates a root component.
RootComponent = CreateDefaultSubobject<USceneComponent>(TEXT("RootComponent"));
// Creates the skeletal mesh component.
MeshComponent = CreateDefaultSubobject<USkeletalMeshComponent>(TEXT("MeshComponent"));
// Sets the skeletal mesh component to the root in blueprints.
MeshComponent->SetupAttachment(GetRootComponent());
// Creates the camaera component
Camera = CreateDefaultSubobject<UCameraComponent>(TEXT("Camera"));
// Sets the camera to the root component
Camera->SetupAttachment(GetRootComponent());
// Sets up the camera offsets from the root component.
Camera->SetRelativeLocation(FVector(-300.f, 0.f, 300.f));
Camera->SetRelativeRotation(FRotator(-45.f, 0.f, 0.f));
//AutoPossessPlayer = EAutoReceiveInput::Player0;
// Sets the current velocity.
CurrentVelocity = FVector(0.f, 0.f, 0.f);
// Sets the max speed allowed.
MaxSpeed = 100.f;
}
// Called when the game starts or when spawned
void ACritter::BeginPlay()
{
Super::BeginPlay();
}
// Called every frame
void ACritter::Tick(float DeltaTime)
{
Super::Tick(DeltaTime);
// Gets the actors location on every frame.
FVector NewLocation = GetActorLocation() + (CurrentVelocity * DeltaTime);
// Sets the actors location on every frame.
SetActorLocation(NewLocation);
}
// Called to bind functionality to input
void ACritter::SetupPlayerInputComponent(UInputComponent* PlayerInputComponent)
{
Super::SetupPlayerInputComponent(PlayerInputComponent);
// Binds the moveforward function to a key that is named in the engines input settings.
PlayerInputComponent->BindAxis(TEXT("MoveForward"), this, &ACritter::MoveForward);
PlayerInputComponent->BindAxis(TEXT("MoveRight"), this, &ACritter::MoveRight);
}
// Move forward function
void ACritter::MoveForward(float Value)
{
// Allows the movement in the x direction between 1 and -1 * max speed if 1 move forward if -1 move back
CurrentVelocity.X = FMath::Clamp(Value, -1.f, 1.f) * MaxSpeed;
}
// Move right function.
void ACritter::MoveRight(float Value)
{
// checks the movement in the y direction between 1 and -1 * maxspeed, if 1 move right. if -1 move left
CurrentVelocity.Y = FMath::Clamp(Value, -1.f, 1.f) * MaxSpeed;
}
| [
"pandajoey77@gmail.com"
] | pandajoey77@gmail.com |
8efc7f4c017fa7d0dedf795e1d36a39d01816a0a | 13266c72250ff7a18f9f4467f648c190ef7062dc | /test/lib/sense/src/subject.hxx | be38e1ca44f3d280cc0b5b5cdc07e38d186ac1c5 | [] | no_license | mucbuc/platform | a426dad90012435f81c8a72300514f18b8f1554b | bcba71447f0130465ae8a3196eacc2ad15933ff0 | refs/heads/master | 2020-04-09T09:45:17.144101 | 2016-07-23T11:40:50 | 2016-07-23T11:40:50 | 30,845,543 | 0 | 0 | null | 2016-07-23T11:32:54 | 2015-02-15T22:57:25 | C++ | UTF-8 | C++ | false | false | 8,109 | hxx | namespace om636
{
#pragma mark basic_subject
/////////////////////////////////////////////////////////////////////////////////////////////
// basic_subject
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
basic_subject<T, U>::basic_subject()
{}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
basic_subject<T, U>::~basic_subject()
{}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
void basic_subject<T, U>::attach( observer_type & o )
{
observers().push_back( & o );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
void basic_subject<T, U>::detach( observer_type & o )
{
observers().erase( find( observers().begin(), observers().end(), & o ) );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
void basic_subject<T, U>::on_swap( context_type & lhs, context_type & rhs )
{
std::for_each( observers().begin(), observers().end(), [&](observer_type * i) {
i->on_swap( lhs, rhs );
} );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
template<class V>
typename basic_subject<T, U>::value_type basic_subject<T, U>::on_init(V & v)
{
return value_type();
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
template<class V, class W>
typename basic_subject<T, U>::value_type basic_subject<T, U>::on_init(V &, const W & v)
{
return value_type(v);
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
template<class V>
V basic_subject<T, U>::to_value(const context_type & c)
{
return V( c.value_ref() );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
auto basic_subject<T, U>::observers() -> container_type &
{
return m_observers;
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T, template<class> class U>
auto basic_subject<T, U>::observers() const -> const container_type &
{
return m_observers;
}
#pragma mark safe_subject
/////////////////////////////////////////////////////////////////////////////////////////////
// safe_subject
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
safe_subject<T>::safe_subject()
: m_locked( 0 )
{}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void safe_subject<T>::attach(observer_type & o)
{
if (m_locked)
throw locked();
base_type::attach( o );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void safe_subject<T>::detach(observer_type & o)
{
if (m_locked)
throw locked();
base_type::detach( o );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void safe_subject<T>::on_swap(context_type & lhs, context_type & rhs)
{
struct guard
{
guard( bool & locked )
: m_locked( locked )
{ m_locked = 1; }
~guard()
{ m_locked = 0; }
bool & m_locked;
};
if (m_locked)
throw locked();
guard g( m_locked );
base_type::on_swap( lhs, rhs );
}
#pragma mark detachable_subject
/////////////////////////////////////////////////////////////////////////////////////////////
// detachable_subject<N>
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
detachable_subject<T>::~detachable_subject()
{
std::for_each( observers().begin(), observers().end(), [](observer_type * i) {
i->detach();
} );
}
#pragma mark state_subject
/////////////////////////////////////////////////////////////////////////////////////////////
// state_subject<N>
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
state_subject<T>::~state_subject()
{}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
bool state_subject<T>::on_equal( const context_type & lhs, const context_type & rhs ) const
{
return state(lhs)->on_equal(lhs, rhs);
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
int state_subject<T>::on_cmp( const context_type & lhs, const context_type & rhs ) const
{ return state(lhs)->on_cmp( lhs, rhs ); }
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
int state_subject<T>::on_sign( const context_type & n ) const
{ return state(n)->on_sign( n ); }
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
bool state_subject<T>::on_swap( context_type & lhs, context_type & rhs ) const
{
return state(lhs)->on_swap( lhs, rhs );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_add( context_type & lhs, const context_type & rhs ) const
{
state(lhs)->on_add( lhs, rhs );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_subtract( context_type & lhs, const context_type & rhs ) const
{
state(lhs)->on_subtract( lhs, rhs );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_mult( context_type & lhs, const context_type & rhs ) const
{
state(lhs)->on_mult( lhs, rhs );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_divide( context_type & lhs, const context_type & rhs ) const
{
state(lhs)->on_divide( lhs, rhs );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_remainder( context_type & lhs, const context_type & rhs ) const
{
state(lhs)->on_remainder( lhs, rhs );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_inc( context_type & n ) const
{
state(n)->on_inc( n );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_dec( context_type & n ) const
{
state(n)->on_dec( n );
}
/////////////////////////////////////////////////////////////////////////////////////////////
template<class T>
void state_subject<T>::on_invert( context_type & n ) const
{
state(n)->on_invert( n );
}
} // om636 | [
"mbusenitz@gmail.com"
] | mbusenitz@gmail.com |
fd0590a42b939795f19c9fb8711f97820e1e6fe7 | 3ff0a1595cbe3ba2ccd3e2a5de2e9e98dbd3c1b4 | /MK4duo/MK4duo/src/feature/probe/probe.h | 864dbc7f4dd73e2b938261998d75cd8dc18b837b | [] | no_license | yyf2009/Ramps_fd | 37c62aaacda7c00545aae98789cac5a1079bc193 | 5e39574c3340254c812d046547f33b3a47c8f67d | refs/heads/master | 2021-04-26T23:46:15.297568 | 2018-03-05T12:40:25 | 2018-03-05T12:40:25 | 123,852,164 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,803 | h | /**
* MK4duo Firmware for 3D Printer, Laser and CNC
*
* Based on Marlin, Sprinter and grbl
* Copyright (C) 2011 Camiel Gubbels / Erik van der Zalm
* Copyright (C) 2013 Alberto Cotronei @MagoKimbra
*
* 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 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
/**
* probe.h
*
* Copyright (C) 2017 Alberto Cotronei @MagoKimbra
*/
#ifndef _PROBE_H_
#define _PROBE_H_
// TRIGGERED_WHEN_STOWED_TEST can easily be extended to servo probes, ... if needed.
#if ENABLED(PROBE_IS_TRIGGERED_WHEN_STOWED_TEST)
#if HAS_Z_PROBE_PIN
#define _TRIGGERED_WHEN_STOWED_TEST (READ(Z_PROBE_PIN) != endstops.isLogic(Z_PROBE))
#else
#define _TRIGGERED_WHEN_STOWED_TEST (READ(Z_MIN_PIN) != endstops.isLogic(Z_MIN))
#endif
#endif
#if HAS_Z_SERVO_PROBE
#define DEPLOY_Z_SERVO() MOVE_SERVO(Z_ENDSTOP_SERVO_NR, probe.z_servo_angle[0])
#define STOW_Z_SERVO() MOVE_SERVO(Z_ENDSTOP_SERVO_NR, probe.z_servo_angle[1])
#endif
#if HAS_BED_PROBE
#define DEPLOY_PROBE() probe.set_deployed(true)
#define STOW_PROBE() probe.set_deployed(false)
#else
#define DEPLOY_PROBE()
#define STOW_PROBE()
#endif
class Probe {
public: /** Constructor */
Probe() {};
public: /** Public Parameters */
static float offset[XYZ];
#if HAS_Z_SERVO_PROBE
static const int z_servo_angle[2];
#endif
public: /** Public Function */
static bool set_deployed(const bool deploy);
#if HAS_BED_PROBE || ENABLED(PROBE_MANUALLY)
/**
* Check Pt (ex probe_pt)
* - Move to the given XY
* - Deploy the probe, if not already deployed
* - Probe the bed, get the Z position
* - Depending on the 'stow' flag
* - Stow the probe, or
* - Raise to the BETWEEN height
* - Return the probed Z position
*/
static float check_pt(const float &rx, const float &ry, const bool stow, const int verbose_level, const bool probe_relative=true);
#endif
#if QUIET_PROBING
static void probing_pause(const bool onoff);
#endif
#if ENABLED(BLTOUCH)
static void bltouch_command(int angle);
static bool set_bltouch_deployed(const bool deploy);
FORCE_INLINE void bltouch_init() {
// Make sure any BLTouch error condition is cleared
bltouch_command(BLTOUCH_RESET);
set_bltouch_deployed(true);
set_bltouch_deployed(false);
}
#endif
private: /** Private Parameters */
private: /** Private Function */
/**
* @brief Used by run_z_probe to do a single Z probe move.
*
* @param z Z destination
* @param fr_mm_s Feedrate in mm/s
* @return true to indicate an error
*/
static bool move_to_z(const float z, const float fr_mm_m);
/**
* @details Used by check_pt to do a single Z probe.
* Leaves current_position[Z_AXIS] at the height where the probe triggered.
*
* @return The raw Z position where the probe was triggered
*/
static float run_z_probe();
#if ENABLED(Z_PROBE_ALLEN_KEY)
static void run_deploy_moves_script();
#endif
#if HAS_Z_PROBE_SLED
static void dock_sled(bool stow);
#endif
};
extern Probe probe;
#endif /* _PROBE_H_ */
| [
"sylyyf2009@hotmail.com"
] | sylyyf2009@hotmail.com |
d67f4fca2c3c69beb9365306b3187c89c3010044 | dc2e0d49f99951bc40e323fb92ea4ddd5d9644a0 | /Activemq-cpp_3.7.1/activemq-cpp/src/test-integration/activemq/test/QueueBrowserTest.h | 3d7885d5e4c72c293f0ffc46e53759f8e764a547 | [
"Apache-2.0"
] | permissive | wenyu826/CecilySolution | 8696290d1723fdfe6e41ce63e07c7c25a9295ded | 14c4ba9adbb937d0ae236040b2752e2c7337b048 | refs/heads/master | 2020-07-03T06:26:07.875201 | 2016-11-19T07:04:29 | 2016-11-19T07:04:29 | 74,192,785 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,373 | 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_TEST_QUEUEBROWSERTEST_H_
#define _ACTIVEMQ_TEST_QUEUEBROWSERTEST_H_
#include <activemq/test/CMSTestFixture.h>
#include <activemq/util/IntegrationCommon.h>
namespace activemq {
namespace test {
class QueueBrowserTest : public CMSTestFixture {
public:
QueueBrowserTest();
virtual ~QueueBrowserTest();
void testReceiveBrowseReceive();
void testBrowseReceive();
void testQueueBrowserWith2Consumers();
};
}}
#endif /* _ACTIVEMQ_TEST_QUEUEBROWSERTEST_H_ */
| [
"626955115@qq.com"
] | 626955115@qq.com |
af394c919ff8c421eb3a5179fbb3548a800f7fe2 | d6f2d7af06687e423e60e50d416fa8c777c09c36 | /ELEVTRBL-14987560-src.cpp | 268b60b6eeaefc591e4292f5ed0e302ce1a7f1aa | [] | no_license | curiousTauseef/my-spoj-solutions | b9a70eaddaf0c3b9a43c278b9af1148806aff600 | 66b11d97073388fcebce3b74025c61839d8d5d18 | refs/heads/master | 2021-05-30T11:48:41.552433 | 2016-02-12T16:59:56 | 2016-02-12T16:59:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,120 | cpp | #include<cstdio>
#include<vector>
#include<list>
#include<utility>
using namespace std;
int main(){
int f,s,g,u,d;
scanf("%d %d %d %d %d",&f,&s,&g,&u,&d);
int vertices=f,edges;
vector< list<int> > adjacencyList(vertices + 1);
int parent[vertices + 1];
int level[vertices + 1];
for (int i = 0; i <= vertices; ++i) {
parent[i] = 0;
level[i] = -1;
}
level[s]=0;
list<int> VertexQueue;
VertexQueue.push_back(s);
while(!VertexQueue.empty()){
int newVertex=VertexQueue.front();
if(newVertex+u<=f && level[newVertex+u]==-1) {
level[newVertex+u]=level[newVertex]+1;
VertexQueue.push_back(newVertex+u);
}
if(newVertex-d>=1 && level[newVertex-d]==-1){
level[newVertex-d]=level[newVertex]+1;
VertexQueue.push_back(newVertex-d);
}
VertexQueue.pop_front();
}
if(level[g]==-1){
printf("use the stairs\n");
}
else{
printf("%d\n",level[g]-level[s]);
}
return 0;
}
| [
"mayank_124@localhost.localdomain"
] | mayank_124@localhost.localdomain |
c91b634dea41071c0c6916f59cdf154a31f46b5f | 693f4afe5f350a5651b2831c2d9842bde34a8867 | /017/UtopianTree.cpp | 6cbb4202dfb3798c798cd3af245a4e5ade6fd2d4 | [] | no_license | algorithmku/Reng | 09b37fe452562d754c7e9b8bb32b234d7ef20277 | 1b42189d7eeb5de2fc084597fae55cbca10023d2 | refs/heads/master | 2020-04-22T14:34:10.051498 | 2019-02-21T11:08:42 | 2019-02-21T11:08:42 | 170,448,112 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 733 | cpp | #include <bits/stdc++.h>
using namespace std;
// Complete the utopianTree function below.
int utopianTree(int n) {
int result = 1;
for( int i = 0; i < n; ++i )
{
if ( ( i % 2 ) == 0 )
{
result *= 2;
}
else
{
result +=1;
}
}
return result;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
int t;
cin >> t;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
for (int t_itr = 0; t_itr < t; t_itr++) {
int n;
cin >> n;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
int result = utopianTree(n);
fout << result << "\n";
}
fout.close();
return 0;
} | [
"reng731@gmail.com"
] | reng731@gmail.com |
837c6dabf3c0a45d739de93ebac2c0b412984e33 | 64089ee58be0bee590c0e9c02dbb3d4c6ca78ec2 | /src/ecs/world.h | aa6a665731d1180e2784f4de33600542f27031a1 | [] | no_license | Niakr1s/ecs | a452547b36ec4566755cfaa24007cf3c6101699d | 720b29ea943b07640041ebda6241ca096c6579fc | refs/heads/master | 2020-12-19T22:49:14.984319 | 2020-01-24T19:00:35 | 2020-01-24T19:00:35 | 235,873,943 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,981 | h | #ifndef WORLD_H
#define WORLD_H
#include <chrono>
#include <iterator>
#include "ecs_time.h"
#include "entity.h"
#include "system.h"
namespace ecs {
class World {
public:
World();
enum class Status { INIT, RUNNING, PAUSED, STOPPED };
void start();
inline void pause() { status_ = Status::PAUSED; }
inline void unpause() { status_ = Status::RUNNING; }
inline void stop() { status_ = Status::STOPPED; }
inline void addEntity(const EntityPtr& entity) { entities_.insert(entity); }
inline void addSystem(const SystemPtr& system) { systems_.push_back(system); }
template <class Entity_T>
EntityPtr entity() const;
template <class... Args>
EntityPtrs filterByComponents() const;
template <class... Args>
EntityPtrs filterByComponents(const Entity::State& state) const;
private:
EntityPtrs entities_;
SystemPtrs systems_;
Status status_;
Time_t last_update_time_;
void loop();
};
template <class Entity_T>
EntityPtr World::entity() const {
auto found = std::find_if(std::cbegin(entities_), std::cend(entities_),
[](const EntityPtr& entity) {
return dynamic_cast<Entity_T*>(entity.get());
});
return (found == std::cend(entities_)) ? nullptr : *found;
}
template <class... Args>
EntityPtrs World::filterByComponents() const {
EntityPtrs res;
std::copy_if(std::begin(entities_), std::end(entities_),
std::inserter(res, std::end(res)), [](const EntityPtr& entity) {
return ((entity->component<Args>()) && ...);
});
return res;
}
template <class... Args>
EntityPtrs World::filterByComponents(const Entity::State& state) const {
EntityPtrs res = filterByComponents<Args...>();
for (auto it = std::begin(res); it != std::end(res);) {
if ((*it)->getState() != state) {
it = res.erase(it);
} else {
++it;
}
}
return res;
}
} // namespace ecs
#endif // WORLD_H
| [
"pavel2188@gmail.com"
] | pavel2188@gmail.com |
c428b2455feed2087c65c30140b6ba9eedb79a98 | bc4f3bae021fb7db65c5fc571cc26fdec38c28b4 | /Pods/Headers/Public/SARUnArchiveANY/rijndael.hpp | e779691eebe430f9b27040f713f78ffb6f904ffa | [] | no_license | a349112363/RarDecompression | e00f101cb10f2275cee31f1cbb2a4ad0f3f757b0 | c26b8ded3ad99473f3cae81836e329acf8ba16b0 | refs/heads/master | 2020-03-18T02:56:12.417401 | 2018-05-21T06:14:27 | 2018-05-21T06:14:27 | 134,214,466 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 60 | hpp | ../../../SARUnArchiveANY/External/Unrar/Headers/rijndael.hpp | [
"kiss.loo@qq.com"
] | kiss.loo@qq.com |
272e5bd5dc366e873b4dd41e0d80ba9fdc505c8e | 7313f7b0aa777cb86e7b74045e83dda0607e19ff | /_GameEngine/GameEngine/common/controls.cpp | 4d6e426920ec946ebfe13ad5fc82c8d80ee27adc | [] | no_license | bassel97/CG-Project | 4fee21b838ea6ce5b4993f2d8ac98aaac3da8452 | 087d67d1f0a0ee824fab3b914700cbda9881d361 | refs/heads/master | 2021-03-30T17:14:48.983731 | 2018-11-29T17:45:35 | 2018-11-29T17:45:35 | 105,430,683 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,780 | cpp | // Include GLFW
#include <GL/glfw.h>
// Include GLM
#include <glm/glm.hpp>
#include <glm/gtc/matrix_transform.hpp>
using namespace glm;
#include "controls.hpp"
glm::mat4 ViewMatrix;
glm::mat4 ProjectionMatrix;
glm::mat4 getViewMatrix() {
return ViewMatrix;
}
glm::mat4 getProjectionMatrix() {
return ProjectionMatrix;
}
// Initial position : on +Z
glm::vec3 position = glm::vec3( 0, 3, 0 );
//glm::vec3 position = glm::vec3(0, 15, 30);
// Initial horizontal angle : toward -Z
float horizontalAngle = 3.14f;
// Initial vertical angle : none
float verticalAngle = 0.0f;
// Initial Field of View
float initialFoV = 45.0f;
float speed = 5.0f; // 3 units / second
float mouseSpeed = 0.005f;
void computeMatricesFromInputs() {
// glfwGetTime is called only once, the first time this function is called
static double lastTime = glfwGetTime();
// Compute time difference between current and last frame
double currentTime = glfwGetTime();
float deltaTime = float(currentTime - lastTime);
// Get mouse position
int xpos, ypos;
glfwGetMousePos(&xpos, &ypos);
// Reset mouse position for next frame
// EDIT : Doesn't work on Mac OS, hence the code below is a bit different from the website's
//glfwSetMousePos(1024/2, 768/2);
// Compute new orientation
horizontalAngle = 3.14f + mouseSpeed * float(1024 / 2 - xpos);
verticalAngle = mouseSpeed * float(768 / 2 - ypos);
// Direction : Spherical coordinates to Cartesian coordinates conversion
glm::vec3 direction(
cos(verticalAngle) * sin(horizontalAngle),
sin(verticalAngle),
cos(verticalAngle) * cos(horizontalAngle)
);
// Right vector
glm::vec3 right = glm::vec3(
sin(horizontalAngle - 3.14f / 2.0f),
0,
cos(horizontalAngle - 3.14f / 2.0f)
);
// Up vector
glm::vec3 up = glm::cross(right, direction);
// Move forward
if (glfwGetKey(GLFW_KEY_UP) == GLFW_PRESS) {
position += direction * deltaTime * speed;
}
// Move backward
if (glfwGetKey(GLFW_KEY_DOWN) == GLFW_PRESS) {
position -= direction * deltaTime * speed;
}
// Strafe right
if (glfwGetKey(GLFW_KEY_RIGHT) == GLFW_PRESS) {
position += right * deltaTime * speed;
}
// Strafe left
if (glfwGetKey(GLFW_KEY_LEFT) == GLFW_PRESS) {
position -= right * deltaTime * speed;
}
float FoV = initialFoV - 5 * glfwGetMouseWheel();
// Projection matrix : 45° Field of View, 4:3 ratio, display range : 0.1 unit <-> 100 units
ProjectionMatrix = glm::perspective(FoV, 4.0f / 3.0f, 0.1f, 1000.0f);
// Camera matrix
ViewMatrix = glm::lookAt(
position, // Camera is here
position + direction, // and looks here : at the same position, plus "direction"
up // Head is up (set to 0,-1,0 to look upside-down)
);
// For the next frame, the "last time" will be "now"
lastTime = currentTime;
} | [
"bassel.ahmed97@eng-st.cu.edu.eg"
] | bassel.ahmed97@eng-st.cu.edu.eg |
c302a8bc1726adacdae8cf3682f23c1c2ac62fca | 754a2695ba8c63bd6fcfdd42e554e84aa3148c00 | /Homework/Tran Huynh Phuong_Assignment1_42829/Gaddis__8thEd_Chap2_Prob12_Land_Calculation/main.cpp | 8eb8c6ff9e5272fbdceadd66f470e4dc7810df3c | [] | no_license | huynhphuongtran/TRAN_HUYNH_PHUONG_CSC5_42829 | 4e87c062c57384f31dad12a6a5a80e149ad8c339 | 84711e3a8dd3e1d618d78343e54cba1f51d0ff7c | refs/heads/master | 2021-01-10T10:15:33.117536 | 2016-03-22T14:33:45 | 2016-03-22T14:33:45 | 52,296,143 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 942 | cpp |
/*
* File: main.cpp
* Author: Huynh Phuong Tran
* Purpose: This program will calculate the number of acres in a tract of land
* Created on March 4, 2016, 10:05 PM
*/
#include <iostream>
using namespace std;
//Global constants
unsigned short Conversion_Acre_to_SquareFeet = 43560; //Conversion from Acre
//to square feet
int main(int argc, char** argv)
{
//Declare variables
float landAreaBySqft; //Area of land by quare feet
float landAreaByAcre; //Area of land by acres
//Initialize variables
landAreaBySqft = 391876;
//Calculate the area of land by acres
landAreaByAcre = landAreaBySqft / Conversion_Acre_to_SquareFeet;
//Print result
cout <<"Area of land by Square feet:\t"<<landAreaBySqft<<" Square feet"<<endl;
cout << "Area of land by Acres:\t\t" << landAreaByAcre << " Acre(s)"<< endl;
return 0;
}
| [
"phuongtranhuynh@gmail.com"
] | phuongtranhuynh@gmail.com |
f1e5e13c257a6b9833489c31282192ec1e7713eb | 7f90bee52b854051ef953ae200ed8d7f54e3ce55 | /videostreamer/streamer/flv/FLVFileWriter.h | 33fa3095b884ec1957158541bcedcfec1f80da16 | [
"MIT"
] | permissive | zlyadvocate/hisi3521 | 8ab283626028acce4786980b5ea78123c0d46474 | 52e9563dcb64d6f1dcd4f18fa6914575c977f7ac | refs/heads/master | 2022-08-03T20:22:41.638371 | 2020-05-26T23:50:51 | 2020-05-26T23:50:51 | 266,650,638 | 3 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,301 | h | /*
---------------------------------------------------------------------------------
oooo
`888
oooo d8b .ooooo. oooo ooo 888 oooo oooo
`888""8P d88' `88b `88b..8P' 888 `888 `888
888 888 888 Y888' 888 888 888
888 888 888 .o8"'88b 888 888 888
d888b `Y8bod8P' o88' 888o o888o `V88V"V8P'
www.roxlu.com
www.apollomedia.nl
www.twitter.com/roxlu
---------------------------------------------------------------------------------
*/
#ifndef ROXLU_FLV_FILE_WRITER_H
#define ROXLU_FILE_FILE_WRITER_H
#include <streamer/flv/FLVListener.h>
#include <fstream>
class FLVFileWriter : public FLVListener {
public:
FLVFileWriter();
~FLVFileWriter();
bool open(std::string filepath);
bool close();
void onSignature(BitStream& bs);
void onTag(BitStream& bs, FLVTag& tag);
private:
std::ofstream ofs;
};
#endif
| [
"zlyadvocate@163.com"
] | zlyadvocate@163.com |
0781ef46992e193e6f44ba698054c502f7842c64 | a15950e54e6775e6f7f7004bb90a5585405eade7 | /chrome/browser/chromeos/policy/login_policy_test_base.cc | 540878814ecfd57f18013126c53c039f436ff42f | [
"BSD-3-Clause"
] | permissive | whycoding126/chromium | 19f6b44d0ec3e4f1b5ef61cc083cae587de3df73 | 9191e417b00328d59a7060fa6bbef061a3fe4ce4 | refs/heads/master | 2023-02-26T22:57:28.582142 | 2018-04-09T11:12:57 | 2018-04-09T11:12:57 | 128,760,157 | 1 | 0 | null | 2018-04-09T11:17:03 | 2018-04-09T11:17:03 | null | UTF-8 | C++ | false | false | 4,222 | cc | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/policy/login_policy_test_base.h"
#include "base/values.h"
#include "chrome/browser/chrome_notification_types.h"
#include "chrome/browser/chromeos/login/ui/login_display_webui.h"
#include "chrome/browser/chromeos/login/wizard_controller.h"
#include "chrome/browser/chromeos/policy/user_policy_test_helper.h"
#include "chrome/browser/ui/webui/chromeos/login/signin_screen_handler.h"
#include "content/public/browser/notification_service.h"
#include "content/public/test/test_utils.h"
#include "google_apis/gaia/fake_gaia.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace policy {
namespace {
constexpr char kTestAuthCode[] = "fake-auth-code";
constexpr char kTestGaiaUberToken[] = "fake-uber-token";
constexpr char kTestAuthLoginAccessToken[] = "fake-access-token";
constexpr char kTestRefreshToken[] = "fake-refresh-token";
constexpr char kTestAuthSIDCookie[] = "fake-auth-SID-cookie";
constexpr char kTestAuthLSIDCookie[] = "fake-auth-LSID-cookie";
constexpr char kTestSessionSIDCookie[] = "fake-session-SID-cookie";
constexpr char kTestSessionLSIDCookie[] = "fake-session-LSID-cookie";
} // namespace
const char LoginPolicyTestBase::kAccountPassword[] = "letmein";
const char LoginPolicyTestBase::kAccountId[] = "user@example.com";
LoginPolicyTestBase::LoginPolicyTestBase() {
set_open_about_blank_on_browser_launch(false);
}
LoginPolicyTestBase::~LoginPolicyTestBase() {
}
void LoginPolicyTestBase::SetUp() {
base::DictionaryValue mandatory;
GetMandatoryPoliciesValue(&mandatory);
base::DictionaryValue recommended;
GetRecommendedPoliciesValue(&recommended);
user_policy_helper_.reset(new UserPolicyTestHelper(GetAccount()));
user_policy_helper_->Init(mandatory, recommended);
OobeBaseTest::SetUp();
}
void LoginPolicyTestBase::SetUpCommandLine(base::CommandLine* command_line) {
user_policy_helper_->UpdateCommandLine(command_line);
OobeBaseTest::SetUpCommandLine(command_line);
}
void LoginPolicyTestBase::SetUpOnMainThread() {
SetMergeSessionParams();
SetupFakeGaiaForLogin(GetAccount(), "", kTestRefreshToken);
OobeBaseTest::SetUpOnMainThread();
FakeGaia::MergeSessionParams params;
params.id_token = GetIdToken();
fake_gaia_->UpdateMergeSessionParams(params);
}
std::string LoginPolicyTestBase::GetAccount() const {
return kAccountId;
}
std::string LoginPolicyTestBase::GetIdToken() const {
return std::string();
}
void LoginPolicyTestBase::GetMandatoryPoliciesValue(
base::DictionaryValue* policy) const {
}
void LoginPolicyTestBase::GetRecommendedPoliciesValue(
base::DictionaryValue* policy) const {
}
void LoginPolicyTestBase::SetMergeSessionParams() {
FakeGaia::MergeSessionParams params;
params.auth_sid_cookie = kTestAuthSIDCookie;
params.auth_lsid_cookie = kTestAuthLSIDCookie;
params.auth_code = kTestAuthCode;
params.refresh_token = kTestRefreshToken;
params.access_token = kTestAuthLoginAccessToken;
params.id_token = GetIdToken();
params.gaia_uber_token = kTestGaiaUberToken;
params.session_sid_cookie = kTestSessionSIDCookie;
params.session_lsid_cookie = kTestSessionLSIDCookie;
params.email = GetAccount();
fake_gaia_->SetMergeSessionParams(params);
}
void LoginPolicyTestBase::SkipToLoginScreen() {
chromeos::WizardController::SkipPostLoginScreensForTesting();
chromeos::WizardController* const wizard_controller =
chromeos::WizardController::default_controller();
ASSERT_TRUE(wizard_controller);
wizard_controller->SkipToLoginForTesting(chromeos::LoginScreenContext());
content::WindowedNotificationObserver(
chrome::NOTIFICATION_LOGIN_OR_LOCK_WEBUI_VISIBLE,
content::NotificationService::AllSources()).Wait();
}
void LoginPolicyTestBase::LogIn(const std::string& user_id,
const std::string& password) {
GetLoginDisplay()->ShowSigninScreenForCreds(user_id, password);
content::WindowedNotificationObserver(
chrome::NOTIFICATION_SESSION_STARTED,
content::NotificationService::AllSources()).Wait();
}
} // namespace policy
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
65045717ecaa6ab98b9800eefadda6794707fef6 | ad8271700e52ec93bc62a6fa3ee52ef080e320f2 | /CatalystRichPresence/CatalystSDK/ClientCinematicDestructionAutoMeshOutputPipeEntity.h | 630795a40aa786c83c69b70d0d81ee7190ff2f04 | [] | no_license | RubberDuckShobe/CatalystRPC | 6b0cd4482d514a8be3b992b55ec143273b3ada7b | 92d0e2723e600d03c33f9f027c3980d0f087c6bf | refs/heads/master | 2022-07-29T20:50:50.640653 | 2021-03-25T06:21:35 | 2021-03-25T06:21:35 | 351,097,185 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 642 | h | //
// Generated with FrostbiteGen by Chod
// File: SDK\ClientCinematicDestructionAutoMeshOutputPipeEntity.h
// Created: Wed Mar 10 19:08:05 2021
//
#ifndef FBGEN_ClientCinematicDestructionAutoMeshOutputPipeEntity_H
#define FBGEN_ClientCinematicDestructionAutoMeshOutputPipeEntity_H
#include "ClientCinematicDestructionMeshOutputPipeEntity.h"
class ClientCinematicDestructionAutoMeshOutputPipeEntity :
public ClientCinematicDestructionMeshOutputPipeEntity // size = 0x40
{
public:
static void* GetTypeInfo()
{
return (void*)0x0000000142848FB0;
}
}; // size = 0x40
#endif // FBGEN_ClientCinematicDestructionAutoMeshOutputPipeEntity_H
| [
"dog@dog.dog"
] | dog@dog.dog |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.