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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
941c9c369ca4b79c5607e74d65b9125a31d0c02b | b7f3edb5b7c62174bed808079c3b21fb9ea51d52 | /third_party/blink/renderer/modules/wake_lock/worker_navigator_wake_lock.h | c7bc84e84cf445a71c7cc439748b0ddfff5d6ce0 | [
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"MIT",
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer",
"LGPL-2.1-only",
"GPL-2.0-only",
"LGPL-2.0-only",
"BSD-2-Clause",
"LicenseRef-scancode-other-copyleft",
"BSD-3-Clause"
] | permissive | otcshare/chromium-src | 26a7372773b53b236784c51677c566dc0ad839e4 | 64bee65c921db7e78e25d08f1e98da2668b57be5 | refs/heads/webml | 2023-03-21T03:20:15.377034 | 2020-11-16T01:40:14 | 2020-11-16T01:40:14 | 209,262,645 | 18 | 21 | BSD-3-Clause | 2023-03-23T06:20:07 | 2019-09-18T08:52:07 | null | UTF-8 | C++ | false | false | 1,190 | h | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef THIRD_PARTY_BLINK_RENDERER_MODULES_WAKE_LOCK_WORKER_NAVIGATOR_WAKE_LOCK_H_
#define THIRD_PARTY_BLINK_RENDERER_MODULES_WAKE_LOCK_WORKER_NAVIGATOR_WAKE_LOCK_H_
#include "third_party/blink/renderer/platform/heap/handle.h"
#include "third_party/blink/renderer/platform/supplementable.h"
namespace blink {
class ScriptState;
class WakeLock;
class WorkerNavigator;
class WorkerNavigatorWakeLock final
: public GarbageCollected<WorkerNavigatorWakeLock>,
public Supplement<WorkerNavigator> {
USING_GARBAGE_COLLECTED_MIXIN(WorkerNavigatorWakeLock);
public:
static const char kSupplementName[];
static WorkerNavigatorWakeLock& From(WorkerNavigator&);
static WakeLock* wakeLock(ScriptState*, WorkerNavigator&);
explicit WorkerNavigatorWakeLock(WorkerNavigator&);
void Trace(Visitor*) const override;
private:
WakeLock* GetWakeLock(ScriptState*);
Member<WakeLock> wake_lock_;
};
} // namespace blink
#endif // THIRD_PARTY_BLINK_RENDERER_MODULES_WAKE_LOCK_WORKER_NAVIGATOR_WAKE_LOCK_H_
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
91a4c220b2931e4402f6db44a9762a1791926d8a | 08d3b7a3ae96d96630ffa198b7ced8c2cf5e49d3 | /ActiveDirectory/sidcloner/SIDCloner - add sIDHistory from PowerShell/C++/AssemblyInfo.cpp | 8ac27c8951b4c69bbda2ca8aa5468a8c7cfb6bf7 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | BertMueller18/Powershell_Functions | d5c95ae4368ff31cf83c6240aaa567695e94c592 | a5a94b37887a1201df4857dfe09d98e6909709ff | refs/heads/master | 2021-09-02T04:19:15.735342 | 2021-08-11T21:06:26 | 2021-08-11T21:06:26 | 15,676,503 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,296 | cpp | #include "stdafx.h"
using namespace System;
using namespace System::Reflection;
using namespace System::Runtime::CompilerServices;
using namespace System::Runtime::InteropServices;
using namespace System::Security::Permissions;
//
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
//
[assembly:AssemblyTitleAttribute("SIDCloner")];
[assembly:AssemblyDescriptionAttribute("")];
[assembly:AssemblyConfigurationAttribute("")];
[assembly:AssemblyCompanyAttribute("")];
[assembly:AssemblyProductAttribute("SIDCloner")];
[assembly:AssemblyCopyrightAttribute("Copyright (c) 2011")];
[assembly:AssemblyTrademarkAttribute("")];
[assembly:AssemblyCultureAttribute("")];
//
// Version information for an assembly consists of the following four values:
//
// Major Version
// Minor Version
// Build Number
// Revision
//
// You can specify all the value or you can default the Revision and Build Numbers
// by using the '*' as shown below:
[assembly:AssemblyVersionAttribute("1.0.1.*")];
[assembly:ComVisible(false)];
[assembly:CLSCompliantAttribute(true)];
[assembly:SecurityPermission(SecurityAction::RequestMinimum, UnmanagedCode = true)];
| [
"jan@imac.fritz.box"
] | jan@imac.fritz.box |
b18d796f147be1105700d33defdfac5e89fca00e | 157d0810d40bbb165889f946566346663cf5b22f | /C++ for Everyone, 2nd Ed, Horstmann/Chapter1/P1-2.cpp | c9c763f2488736013bb7b8acd256e196d382c2bd | [] | no_license | dg5921096/Books-solutions | e6ccdcaba0294bdc95e2267723a02d2ba090cb10 | 31bb4bba240bf95aafeb6d189eade62c66a1765a | refs/heads/master | 2021-12-09T16:07:47.756390 | 2021-11-14T07:09:25 | 2021-11-14T07:09:25 | 255,447,147 | 0 | 0 | null | 2020-04-13T21:39:02 | 2020-04-13T21:39:01 | null | WINDOWS-1252 | C++ | false | false | 506 | cpp | // Write a program that prints the message, “Hello, my name is Hal!” Then, on a new
// line, the program should print the message “What would you like me to do ? ” Then
// it’s the user’s turn to type in an input.
#include<iostream>
#include<string>
using namespace std;
int main()
{
cout << "Holla, my name is Hal!\n";
cout << "What would you like me to do?\n";
string user_input;
getline(cin, user_input);
cout << "I am sorry, I cannnot do that.";
return 0;
}
| [
"syndbe@gmail.com"
] | syndbe@gmail.com |
0c5ae2b069ce3ce27d5aee92054619c324aa4320 | 6bae8050966a723c748f5662e218f91c23d55cac | /menu.cpp | fd5482797e2104768ad4be4625e578d87d186308 | [] | no_license | anukq/PsychTool | b42b1a76601c11616d97512ec37f9afd3e35b5b1 | ebb1ae27258a56dd53f91634ee5e690bb59235dc | refs/heads/master | 2023-07-21T01:11:46.774006 | 2020-05-15T01:01:03 | 2020-05-15T01:01:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,011 | cpp | #include "menu.h"
#include "ui_menu.h"
#include <QTextStream>
#include <QDebug>
Menu::Menu(QWidget *parent) : QDialog(parent),
ui(new Ui::Menu)
{
ui->setupUi(this);
}
Menu::~Menu()
{
delete ui;
}
void Menu::on_Button_Close_clicked()
{
this->close();
}
/*
QString Menu::getRandomSeedText(void)
{
return m_seedText;
}
*/
void Menu::on_lineEdit_randomSeed_returnPressed()
{
m_seedText = ui->lineEdit_randomSeed->text(); //setting variable to Text entered within textbox
qDebug() << "seed text: " << m_seedText; // For Testing Puporses
Random r;
r.setSeedText(m_seedText); //Setting variable used in text RNG
//Algorithm 1
ui->spinbox_VarOne->setValue(double(r.getStringLength()));
ui->spinbox_VarTwo->setValue(double(r.getConsonants()));
ui->spinbox_VarThree->setValue(double(r.getAs()));
ui->spinbox_VarFour->setValue(double(r.getVowels()));
qDebug() << "length: " << r.getStringLength();
qDebug() << "consonants: " << r.getConsonants();
qDebug() << "a's: " << r.getAs();
qDebug() << "vowels: " << r.getVowels();
//Algorithm2
ui->spinbox_VarOne_Algo2->setValue(double(r.getStringLength()));
//Algorithm3
if(ui->comboBox_shapeType->currentIndex() == 0)
{
ui->spinbox_Iterations_Algo3->setValue(double(r.getStringLength() * 50000));
}
if(ui->comboBox_shapeType->currentIndex() == 1 || ui->comboBox_shapeType->currentIndex() == 2 || ui->comboBox_shapeType->currentIndex() == 3)
{
ui->spinbox_Iterations_Algo3->setValue(double(r.getConsonants() * 10));
}
if(ui->comboBox_shapeType->currentIndex() > 4 )
{
ui->spinbox_Iterations_Algo3->setValue(double(r.getStringLength()));
}
ui->spinbox_VarOne_Algo3->setValue(double(r.getStringLength()));
ui->spinbox_VarTwo_Algo3->setValue(double(r.getConsonants()));
ui->spinbox_VarThree_Algo3->setValue(double(r.getAs()));
ui->spinbox_VarFour_Algo3->setValue(double(r.getVowels()));
}
void Menu::on_button_generate_randomNumbers_clicked()
{
//Algorithm 1
ui->spinbox_VarOne->setValue(double(XY(rng)));
ui->spinbox_VarTwo->setValue(double(XY(rng)));
ui->spinbox_VarThree->setValue(double(WZ(rng)));
ui->spinbox_VarFour->setValue(double(WZ(rng)));
//Algorithm 2
ui->spinbox_zValue_Algo2->setValue(double(zAxisValue(rng)));
ui->spinbox_VarOne_Algo2->setValue(double(XY(rng)));
qDebug() << "Random Button Clicked!";
//Algorithm 3
//ui->comboBox_shapeType->setCurrentIndex(int(r_shapeType(rng)));
if(ui->comboBox_shapeType->currentIndex() == 0)
{
ui->spinbox_Iterations_Algo3->setValue(double(Iterations(rng)));
}
if(ui->comboBox_shapeType->currentIndex() == 1 || ui->comboBox_shapeType->currentIndex() == 2 || ui->comboBox_shapeType->currentIndex() == 3)
{
ui->spinbox_Iterations_Algo3->setValue(double(r_shape_line(rng)));
}
if(ui->comboBox_shapeType->currentIndex() > 4 )
{
ui->spinbox_Iterations_Algo3->setValue(double(r_shape_triangle(rng)));
}
ui->spinbox_VarOne_Algo3->setValue(double(XY(rng)));
ui->spinbox_VarTwo_Algo3->setValue(double(XY(rng)));
ui->spinbox_VarThree_Algo3->setValue(double(XY(rng)));
ui->spinbox_VarFour_Algo3->setValue(double(XY(rng)));
}
void Menu::on_button_generate_randomShape_clicked()
{
ui->comboBox_shapeType->setCurrentIndex(int(r_shapeType(rng)));
}
void Menu::on_Button_save_AlgoValues_clicked()
{
QString fileName = QFileDialog::getSaveFileName(this, tr("Save File"), "", tr("File Type (*.txt)"));
if (fileName != "") {
QFile file(fileName);
if (file.open(QIODevice::ReadWrite)) {
QTextStream stream(&file);
stream << ui->plainTextEdit->toPlainText();
file.flush();
file.close();
}
else {
QMessageBox::critical(this, tr("Error"), tr("Cannot save file!"));
return;
}
}
}
| [
"git@jamieacharya.com"
] | git@jamieacharya.com |
4a413c6e9c16539be3ac1e2abd31a39df2a2b839 | a33aac97878b2cb15677be26e308cbc46e2862d2 | /program_data/PKU_raw/35/2200.c | 86f84e44c187aaa3d5473acbe4119556b7eedaf4 | [] | no_license | GabeOchieng/ggnn.tensorflow | f5d7d0bca52258336fc12c9de6ae38223f28f786 | 7c62c0e8427bea6c8bec2cebf157b6f1ea70a213 | refs/heads/master | 2022-05-30T11:17:42.278048 | 2020-05-02T11:33:31 | 2020-05-02T11:33:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 522 | c | int main()
{
int i,j,n,m,a[8][8],max[8],b[8],k;
scanf("%d,%d",&n,&m);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
for(i=0;i<n;i++)
{max[i]=a[i][0];
b[i]=0;
for(j=0;j<m;j++)
{
if(a[i][j]>max[i])
{ max[i]=a[i][j];
b[i]=j;}
}
}
for(i=0;i<n;i++)
{for(k=0;k<n;k++)
{
if(max[i]>a[k][b[i]])
break;
}
if(k==n) { printf("%d+%d",i,b[i]);break;}
}
if(i==n) printf("No");
return 0;
}
| [
"bdqnghi@gmail.com"
] | bdqnghi@gmail.com |
e1c465f4cf169aeb7075c8c98fea88e520c8ada4 | 65ff42353c2dafede6ec9f4062e2aa3597cce0c9 | /io_test/io_client.cc | 4366cbee84cba81aaa92293aa17d0f349c5b2fa1 | [] | no_license | monty-pavel/indexfs_old | aef5fdbc6e3d4e81d15a170b70f58bccd7a55fdd | 622169a8af1c80e7de7648a9ee6f874af919200c | refs/heads/master | 2020-09-04T04:16:04.097276 | 2015-01-12T20:26:27 | 2015-01-12T20:26:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,898 | cc | // Copyright (c) 2014 The IndexFS 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.
#include <mpi.h>
#include <time.h>
#include <sstream>
#include <gflags/gflags.h>
#include "io_client.h"
#include "leveldb/util/socket.h"
#include "leveldb/util/histogram.h"
namespace indexfs { namespace mpi {
IOClient::~IOClient() {
// empty
}
DEFINE_bool(print_ops, false, "Log all operations performed to stdout");
DEFINE_string(tsdb_ip, "127.0.0.1", "TSDB's IP address");
DEFINE_int32(tsdb_port, 10600, "TSDB's UDP port");
DEFINE_bool(per_op, false, "send Performance data per certain number of ops");
DEFINE_int32(perf_num_ops, 5000, "Send performance data per such number of ops");
DEFINE_bool(per_sec, true, "Send Performance data per certain number of seconds");
DEFINE_int32(perf_num_secs, 5, "Send performance data per such number of seconds");
namespace {
using ::leveldb::Histogram;
using ::leveldb::UDPSocket;
using ::leveldb::SocketException;
static
inline void AddOpCounts(std::stringstream &ss,
int now, int numops, const char** names, int* counters,
int rank, const std::string &runid) {
for (int i = 0; i < numops; i++) {
ss << "idxfs.bench." << names[i] << "_num "
<< now << " " << counters[i]
<< " rank=" << rank
<< " run=" << runid << "\n";
}
}
static
inline void AddSuccOps(std::stringstream &ss,
int now, int ops, int rank, const std::string &runid) {
ss << "idxfs.bench.succ_ops "
<< now << " " << ops
<< " rank=" << rank
<< " run=" << runid << "\n";
}
static
inline void AddErrOps(std::stringstream &ss,
int now, int ops, int rank, const std::string &runid) {
ss << "idxfs.bench.err_ops "
<< now << " " << ops
<< " rank=" << rank
<< " run=" << runid << "\n";
}
static
inline void AddAvgLatency(std::stringstream &ss,
int now, double sum, int ops, int rank, const std::string &runid) {
if (ops > 0) {
ss << "idxfs.bench.avg_latency "
<< now << " " << sum / ops
<< " rank=" << rank
<< " run=" << runid << "\n";
}
}
static
void SendPerfData(const std::string &data) {
UDPSocket sock;
try {
sock.sendTo(data.data(), data.length(),
FLAGS_tsdb_ip, (unsigned short) FLAGS_tsdb_port);
} catch (SocketException &e) {
fprintf(stderr, "cannot send perf data to TSDB: %s\n", e.what());
}
}
class MetaClient: public IOClient {
public:
virtual ~MetaClient() {
delete cli_;
}
explicit MetaClient(IOClient* cli, int rank, const std::string &id)
: IOClient(), rank_(rank), id_(id), cli_(cli) {
mon_ = true;
last_sent_ = 0;
res_sum_ = ops_ = err_ops_ = 0;
last_res_sum_ = last_ops_ = last_err_ops_ = 0;
}
virtual void Noop() { cli_->Noop(); }
virtual Status Init();
virtual Status Dispose();
void PublishPerfData() {
std::stringstream ss;
int now = time(NULL);
AddOpCounts(ss, now, kNumOps, kOpNames, counters_, rank_, id_);
AddSuccOps(ss, now, ops_, rank_, id_);
AddErrOps(ss, now, err_ops_, rank_, id_);
AddAvgLatency(ss, now, res_sum_ - last_res_sum_, ops_ - last_ops_ , rank_, id_);
last_ops_ = ops_;
last_err_ops_ = err_ops_;
last_res_sum_ = res_sum_;
SendPerfData(ss.str()); // Send perf data to TSDB or its local agent
}
#define MONITORED_OP_1ARG(op, arg_type) \
virtual Status op(arg_type arg) { \
if (mon_) { \
double start, finish, dura; \
start = MPI_Wtime(); \
Status s = cli_->op(arg); \
finish = MPI_Wtime(); \
dura = (finish - start) * 1000 * 1000; \
if (!s.ok()) { \
err_ops_++; \
} else { \
ops_++; \
res_sum_ += dura; \
counters_[k##op]++; \
latencies_[kOpCategoryIndex[k##op]].Add(dura); \
} \
if (FLAGS_per_sec) { \
if (finish - last_sent_ >= FLAGS_perf_num_secs) { \
PublishPerfData(); \
last_sent_ = finish; \
} \
} \
else if (FLAGS_per_op) { \
if ((ops_ + err_ops_) % FLAGS_perf_num_ops == 0) { \
PublishPerfData(); \
} \
} \
return s; \
} \
return cli_->op(arg); \
}
#define MONITORED_OP_2ARG(op, arg_type1, arg_type2) \
virtual Status op(arg_type1 arg1, arg_type2 arg2) { \
if (mon_) { \
double start, finish, dura; \
start = MPI_Wtime(); \
Status s = cli_->op(arg1, arg2); \
finish = MPI_Wtime(); \
dura = (finish - start) * 1000 * 1000; \
if (!s.ok()) { \
err_ops_++; \
} else { \
ops_++; \
res_sum_ += dura; \
counters_[k##op]++; \
latencies_[kOpCategoryIndex[k##op]].Add(dura); \
} \
if (FLAGS_per_sec) { \
if (finish - last_sent_ >= FLAGS_perf_num_secs) { \
PublishPerfData(); \
last_sent_ = finish; \
} \
} \
else if (FLAGS_per_op) { \
if ((ops_ + err_ops_) % FLAGS_perf_num_ops == 0) { \
PublishPerfData(); \
} \
} \
return s; \
} \
return cli_->op(arg1, arg2); \
}
// WRAP ALL IO OPS TO GATHER PERF DATA //
MONITORED_OP_1ARG(NewFile ,Path&)
MONITORED_OP_1ARG(MakeDirectory ,Path&)
MONITORED_OP_1ARG(MakeDirectories ,Path&)
MONITORED_OP_1ARG(SyncDirectory ,Path&)
MONITORED_OP_1ARG(ResetMode ,Path&)
MONITORED_OP_1ARG(GetAttr ,Path&)
MONITORED_OP_1ARG(ListDirectory ,Path&)
MONITORED_OP_1ARG(Remove ,Path&)
MONITORED_OP_2ARG(Rename ,Path& ,Path&)
// IO MEASUREMENT INTERFACE //
void EnableMonitoring(bool enable);
void Reset();
void __PrintMeasurements__(FILE* output); // max, min, avg and latency histogram
private:
// All Recoginized Operation Categories
enum { kMDRead, kMDWrite, kIO, kNumCategories };
// All supported Operations
enum { kMakeDirectory, kMakeDirectories, kSyncDirectory, kNewFile,
kResetMode, kRename, kGetAttr, kListDirectory, kRemove, kNumOps };
static const char* kOpNames[kNumOps];
static const char* kCategoryNames[kNumCategories];
static const int kOpCategoryIndex[kNumOps];
int ops_;
int err_ops_;
double res_sum_;
int last_ops_;
int last_err_ops_;
double last_res_sum_;
double last_sent_; // the last time we published performance data
bool mon_; // true iff monitoring is enabled
int rank_; // an unique rank identifying a specific client process
std::string id_; // an unique string identifier for a particular test/benchmark run
Histogram latencies_[kNumCategories];
int counters_[kNumOps];
IOClient* cli_; // The real IO client being composited
// No copying allowed
MetaClient(const MetaClient&);
MetaClient& operator=(const MetaClient&);
};
const char* MetaClient::kOpNames[kNumOps] = {
"mkdir", "mkdirs", "fsyncdir", "mknod",
"chmod", "rename", "getattr", "readdir", "remove"
};
const char* MetaClient::kCategoryNames[kNumCategories] = {
"Read" /* Metadata Reads */, "Write" /* Metadata Updates */, "I/O" /* Data */
};
const int MetaClient::kOpCategoryIndex[kNumOps] = {
kMDWrite /* MakeDirectory*/, kMDWrite /* MakeDirectories */, kMDWrite /* SyncDirectory */,
kMDWrite /* NewFile */, kMDWrite /* ResetMode */, kMDWrite /* Rename */, kMDRead /* GetAttr */,
kMDRead /* ListDirectory */, kMDWrite /* Remove*/
};
Status MetaClient::Init() {
return cli_->Init();
}
Status MetaClient::Dispose() {
return cli_->Dispose();
}
void MetaClient::EnableMonitoring(bool enable) {
mon_ = enable;
}
void MetaClient::Reset() {
memset(counters_, 0, kNumOps * sizeof(int));
for (int i = 0; i < kNumCategories; i++) {
latencies_[i].Clear();
}
last_sent_ = MPI_Wtime();
res_sum_ = ops_ = err_ops_ = 0;
last_res_sum_ = last_ops_ = last_err_ops_ = 0;
}
void MetaClient::__PrintMeasurements__(FILE* output) {
fprintf(output, ">>>>>> Client's Self-Measurements >>> \n\n");
cli_->PrintMeasurements(output);
fprintf(output, "\n\n\n");
// --------------------------------------------------------- //
fprintf(output, ">>>>>> IO Client Measurements >>>>>>> \n\n");
for (int i = 0; i < kNumCategories; i++) {
fprintf(output, "== Latencies for %s ops:\n", kCategoryNames[i]);
fprintf(output, "%s\n", latencies_[i].ToString().c_str());
}
fprintf(output, "== Total I/O Ops Issued: %d ", ops_ + err_ops_);
fprintf(output, "(Succ ops: %d, Error ops: %d)\n\n", ops_, err_ops_);
}
} /* anonymous namespace */
Status IOClient::MakeDirectory(int dno, const std::string &prefix) {
std::stringstream ss;
ss << "/d_" << prefix << dno;
return MakeDirectory(ss.str());
}
Status IOClient::SyncDirectory(int dno, const std::string &prefix) {
std::stringstream ss;
ss << "/d_" << prefix << dno;
return SyncDirectory(ss.str());
}
Status IOClient::NewFile(int dno, int fno, const std::string &prefix) {
std::stringstream ss;
ss << "/d_" << prefix << dno << "/f_" << prefix << fno;
return NewFile(ss.str());
}
Status IOClient::GetAttr(int dno, int fno, const std::string &prefix) {
std::stringstream ss;
ss << "/d_" << prefix << dno << "/f_" << prefix << fno;
return GetAttr(ss.str());
}
//////////////////////////////////////////////////////////////////////////////////
// IO MEASUREMENT INTERFACE
//
void IOMeasurements::EnableMonitoring(IOClient* cli, bool enable) {
MetaClient* meta_cli = reinterpret_cast<MetaClient*>(cli);
meta_cli->EnableMonitoring(enable);
}
void IOMeasurements::Reset(IOClient* cli) {
MetaClient* meta_cli = reinterpret_cast<MetaClient*>(cli);
meta_cli->Reset();
}
void IOMeasurements::PrintMeasurements(IOClient* cli, FILE* output) {
MetaClient* meta_cli = reinterpret_cast<MetaClient*>(cli);
meta_cli->__PrintMeasurements__(output);
}
//////////////////////////////////////////////////////////////////////////////////
// IO-CLIENT FACTORY
//
IOClient* IOClientFactory::GetIndexFSClient(int rank, const std::string &id) {
return new MetaClient(IOClient::NewIndexFSClient(), rank, id);
}
IOClient* IOClientFactory::GetLocalFSClient(int rank, const std::string &id) {
return new MetaClient(IOClient::NewLocalFSClient(), rank, id);
}
IOClient* IOClientFactory::GetOrangeFSClient(int rank, const std::string &id) {
return new MetaClient(IOClient::NewOrangeFSClient(), rank, id);
}
} /* namespace mpi */ } /* namespace indexfs */
| [
"zhengqmark@gmail.com"
] | zhengqmark@gmail.com |
88cab975f56662b71b595896469c4fdd1542e00a | 183b723d37345cc7f08c1ee48188c882ec374d68 | /SdrDevice.h | fd2d163f9b9e6f5121ce2e82695b44bc792473ea | [] | no_license | jcmaeso/LimeSDR-Test | 5c543fb676030283e6f795b22700e36b8d188b1b | 56f1ab39c5381a835188c948940a190c911ac671 | refs/heads/master | 2020-12-15T15:25:15.009016 | 2020-01-20T17:15:59 | 2020-01-20T17:15:59 | 235,155,483 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,792 | h | //
// Created by calata on 1/03/19.
//
#ifndef LIMESUITERX_SDRDEVICE_H
#define LIMESUITERX_SDRDEVICE_H
#include "lime/LimeSuite.h"
typedef float samplesBuffer;
class SdrDevice {
public:
SdrDevice(char* serialId, int deviceId);
int EnableRxChannels();
int EnableTxChannels();
int SetRxLOFrecuency(double LO_frequency);
int SetTxLOFrecuency(double LO_frequency);
int SetRxNormalizedGain(double gain);
int SetTxNormalizedGain(double gain);
int SetSampleRate(double rate, size_t oversampling);
int SetupRxStream();
int SetupTxStream();
void StartRxStream();
samplesBuffer** GetRxBuffers();
void PollGetSamples();
void PrintRxStats();
void StopAndDestroy();
void CalibrateRx(double bw);
void PrintRxAntennas();
void PrintTxAntennas();
void SetRxHfAntenna();
void SetRxWfAntenna();
void SetRxLfAntenna();
void SetRxLpfBandwidth(double bw);
void SetTxLpfBandwidth(double bw);
void SetRxGainDB(double gain);
void SetTxGainDB(double gain);
private:
int id;
int bufferRxSize;
int rxChannels, txChannels;
bool connected;
lms_device_t* device;
lms_info_str_t deviceInfo;
lms_stream_t* rxStreams;
lms_stream_t* txStreams;
lms_stream_meta_t rxMetadata;
lms_stream_meta_t txMetadata;
lms_name_t antennaList[10];
samplesBuffer** rxBuffers;
samplesBuffer** txBuffers;
void errorLogger(int errorCode);
void PrintAntennas(bool way);
int EnableChannels(bool way);
int SetNormalizedGain(bool way, double gain);
int SetLOFrecuency(bool way,double LO_frequency);
void SetAntenna(bool way, size_t antenna);
void SetLpfBandwidth(bool way, double bw);
void SetGainDB(bool way, double gain);
};
#endif //LIMESUITERX_SDRDEVICE_H
| [
"jorgecmaeso@gr.ssr.upm.es"
] | jorgecmaeso@gr.ssr.upm.es |
9fe7de8ef41b3b57c76aa5111abb4fc5be98acd6 | 491cae9ea6b7853cafbd309299eaf55f7e1c8cba | /komallab4.cpp | 50e55354126d1098f78a65c95b797267b4553eb1 | [] | no_license | komalpreet9932/kkaur | 20fdfb78b83eafdad9cc78d0dada0999dae9c42e | 1a4bb99963ac7b0bde6f9e28d1d76244caf65add | refs/heads/master | 2020-03-30T20:57:13.785244 | 2018-10-04T17:37:30 | 2018-10-04T17:37:30 | 151,611,411 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,383 | cpp | #include <iostream>
#include <string>
#include <sstream>
// Include the library that will allow you to convert from string to integer
int main()
{
int i,j,k,l;
/*-------------------------------
PART 1 - Reading multiple integers
--------------------------------*/
std::cout << std::endl << "=========================" << std::endl;
std::cout << "= PART 1 =" << std::endl;
std::cout << "=========================" << std::endl;
std::cout <<"Enter any three values:" <<std::endl;
// Ask the user for 3 integers as input
std::cin >>i>>j>>k;// The user should enter all integers on the same line, pressing enter only once
l=i*j*k;
// Multiply the three integers
std::cout <<"Result of the multipilcation= "<<l<< std::endl;
// Output the result of the multiplication
/*-------------------------------
PART 2 - Reading strings
--------------------------------*/
std::cout << std::endl << "=========================" << std::endl;
std::cout << "= PART 2 =" << std::endl;
std::cout << "=========================" << std::endl;
// Ask the user for three strings and output a haiku poem
// http://examples.yourdictionary.com/examples-of-haiku-poems.html
using std::cout;
using std::cin;
using std::endl;
std::string village;
std::string snow;
std::string water;
std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
cout<<"The name of village : ";
std::getline(cin,village);
cout<<"The name of snow : ";
std::getline(cin,snow);
cout<<"The name of water : ";
std::getline(cin,water);
cout<<" "<<endl;
cout<<"A mountain "<<village<<" "<<endl;
cout<<"under the piled-up "<<snow<<" "<<endl;
cout<<"the sound of "<<water<<" " <<endl;
/*-------------------------------
PART 3 - Converting strings
--------------------------------*/
std::cout << std::endl << "=========================" << std::endl;
std::cout << "= PART 3 =" << std::endl;
std::cout << "=========================" << std::endl;
std::string myNumber = "1234"; // Convert this string to an integer
int t;
std::stringstream(myNumber)>>t;
std::cout <<" "<<t<<":is an integer"; //Insert the integer before the text of this output
return 0;
} | [
"36015240+deeplove5905@users.noreply.github.com"
] | 36015240+deeplove5905@users.noreply.github.com |
ca66c24ddef761a74dfadd7f870a0af85cfa6225 | 94a88c9cb36803c36eeff0fad57689e5fe76cab1 | /Qt/NLP_CHEN/nlp_test.cpp | 1d738b9c9741064946f143b8b82bd86a172462db | [] | no_license | YFCbingyi/test_own | c5e38842765831dcc6c45e3181f370083877fc7f | 8b5461deceeb0b64ef8b571796a017ee532be429 | refs/heads/master | 2021-07-19T19:15:56.742920 | 2020-10-29T02:32:49 | 2020-10-29T02:32:49 | 225,312,122 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 712 | cpp | #include "nlp_test.h"
#include "debug_log.h"
nlp_test::nlp_test()
{
}
void nlp_test::run()
{
LOG(INFO) << "run _ ";
int i = 10;
try
{
thread1 = std::thread(&nlp_test::_func1_,this);
thread2 = std::thread(&nlp_test::_func1_,this);
thread3 = std::thread(&nlp_test::_func1_,this);
}
catch(std::exception &e)
{
LOG(ERROR) << "exception: "<< e.what();
}
}
void nlp_test::_func1_()
{
// std::string cmd = "rosservice call /speech_service/nlp_baidu \"ask: '你好'\"";
while(true)
{
LOG(INFO) << "打印";
system("rosservice call /speech_service/nlp_baidu \"ask: '你好'\"");
}
}
| [
"“lighty_chen@163.com”"
] | “lighty_chen@163.com” |
65e29b2bc931bdbebd62bf6475c2c42dd277c95a | 0641d87fac176bab11c613e64050330246569e5c | /tags/coll-prototype/source/i18n/unicode/translit.h | a4a236c099a9fe0c7af213d335aa4b4109698879 | [
"ICU"
] | permissive | svn2github/libicu_full | ecf883cedfe024efa5aeda4c8527f227a9dbf100 | f1246dcb7fec5a23ebd6d36ff3515ff0395aeb29 | refs/heads/master | 2021-01-01T17:00:58.555108 | 2015-01-27T16:59:40 | 2015-01-27T16:59:40 | 9,308,333 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 55,545 | h | /*
* Copyright (C) 1999-2001, International Business Machines Corporation and others. All Rights Reserved.
**********************************************************************
* Date Name Description
* 11/17/99 aliu Creation.
**********************************************************************
*/
#ifndef TRANSLIT_H
#define TRANSLIT_H
#include "unicode/utypes.h"
#if !UCONFIG_NO_TRANSLITERATION
#include "unicode/uobject.h"
#include "unicode/unistr.h"
#include "unicode/parseerr.h"
#include "unicode/utrans.h" // UTransPosition, UTransDirection
U_NAMESPACE_BEGIN
class Replaceable;
class UnicodeFilter;
class UnicodeSet;
class TransliterationRuleData;
class U_I18N_API UVector;
class CompoundTransliterator;
class TransliteratorParser;
class NormalizationTransliterator;
class TransliteratorIDParser;
/**
* <code>Transliterator</code> is an abstract class that
* transliterates text from one format to another. The most common
* kind of transliterator is a script, or alphabet, transliterator.
* For example, a Russian to Latin transliterator changes Russian text
* written in Cyrillic characters to phonetically equivalent Latin
* characters. It does not <em>translate</em> Russian to English!
* Transliteration, unlike translation, operates on characters, without
* reference to the meanings of words and sentences.
*
* <p>Although script conversion is its most common use, a
* transliterator can actually perform a more general class of tasks.
* In fact, <code>Transliterator</code> defines a very general API
* which specifies only that a segment of the input text is replaced
* by new text. The particulars of this conversion are determined
* entirely by subclasses of <code>Transliterator</code>.
*
* <p><b>Transliterators are stateless</b>
*
* <p><code>Transliterator</code> objects are <em>stateless</em>; they
* retain no information between calls to
* <code>transliterate()</code>. (However, this does <em>not</em>
* mean that threads may share transliterators without synchronizing
* them. Transliterators are not immutable, so they must be
* synchronized when shared between threads.) This1 might seem to
* limit the complexity of the transliteration operation. In
* practice, subclasses perform complex transliterations by delaying
* the replacement of text until it is known that no other
* replacements are possible. In other words, although the
* <code>Transliterator</code> objects are stateless, the source text
* itself embodies all the needed information, and delayed operation
* allows arbitrary complexity.
*
* <p><b>Batch transliteration</b>
*
* <p>The simplest way to perform transliteration is all at once, on a
* string of existing text. This is referred to as <em>batch</em>
* transliteration. For example, given a string <code>input</code>
* and a transliterator <code>t</code>, the call
*
* <blockquote><code>String result = t.transliterate(input);
* </code></blockquote>
*
* will transliterate it and return the result. Other methods allow
* the client to specify a substring to be transliterated and to use
* {@link Replaceable} objects instead of strings, in order to
* preserve out-of-band information (such as text styles).
*
* <p><b>Keyboard transliteration</b>
*
* <p>Somewhat more involved is <em>keyboard</em>, or incremental
* transliteration. This is the transliteration of text that is
* arriving from some source (typically the user's keyboard) one
* character at a time, or in some other piecemeal fashion.
*
* <p>In keyboard transliteration, a <code>Replaceable</code> buffer
* stores the text. As text is inserted, as much as possible is
* transliterated on the fly. This means a GUI that displays the
* contents of the buffer may show text being modified as each new
* character arrives.
*
* <p>Consider the simple <code>RuleBasedTransliterator</code>:
*
* <blockquote><code>
* th>{theta}<br>
* t>{tau}
* </code></blockquote>
*
* When the user types 't', nothing will happen, since the
* transliterator is waiting to see if the next character is 'h'. To
* remedy this, we introduce the notion of a cursor, marked by a '|'
* in the output string:
*
* <blockquote><code>
* t>|{tau}<br>
* {tau}h>{theta}
* </code></blockquote>
*
* Now when the user types 't', tau appears, and if the next character
* is 'h', the tau changes to a theta. This is accomplished by
* maintaining a cursor position (independent of the insertion point,
* and invisible in the GUI) across calls to
* <code>transliterate()</code>. Typically, the cursor will
* be coincident with the insertion point, but in a case like the one
* above, it will precede the insertion point.
*
* <p>Keyboard transliteration methods maintain a set of three indices
* that are updated with each call to
* <code>transliterate()</code>, including the cursor, start,
* and limit. Since these indices are changed by the method, they are
* passed in an <code>int[]</code> array. The <code>START</code> index
* marks the beginning of the substring that the transliterator will
* look at. It is advanced as text becomes committed (but it is not
* the committed index; that's the <code>CURSOR</code>). The
* <code>CURSOR</code> index, described above, marks the point at
* which the transliterator last stopped, either because it reached
* the end, or because it required more characters to disambiguate
* between possible inputs. The <code>CURSOR</code> can also be
* explicitly set by rules in a <code>RuleBasedTransliterator</code>.
* Any characters before the <code>CURSOR</code> index are frozen;
* future keyboard transliteration calls within this input sequence
* will not change them. New text is inserted at the
* <code>LIMIT</code> index, which marks the end of the substring that
* the transliterator looks at.
*
* <p>Because keyboard transliteration assumes that more characters
* are to arrive, it is conservative in its operation. It only
* transliterates when it can do so unambiguously. Otherwise it waits
* for more characters to arrive. When the client code knows that no
* more characters are forthcoming, perhaps because the user has
* performed some input termination operation, then it should call
* <code>finishTransliteration()</code> to complete any
* pending transliterations.
*
* <p><b>Inverses</b>
*
* <p>Pairs of transliterators may be inverses of one another. For
* example, if transliterator <b>A</b> transliterates characters by
* incrementing their Unicode value (so "abc" -> "def"), and
* transliterator <b>B</b> decrements character values, then <b>A</b>
* is an inverse of <b>B</b> and vice versa. If we compose <b>A</b>
* with <b>B</b> in a compound transliterator, the result is the
* indentity transliterator, that is, a transliterator that does not
* change its input text.
*
* The <code>Transliterator</code> method <code>getInverse()</code>
* returns a transliterator's inverse, if one exists, or
* <code>null</code> otherwise. However, the result of
* <code>getInverse()</code> usually will <em>not</em> be a true
* mathematical inverse. This is because true inverse transliterators
* are difficult to formulate. For example, consider two
* transliterators: <b>AB</b>, which transliterates the character 'A'
* to 'B', and <b>BA</b>, which transliterates 'B' to 'A'. It might
* seem that these are exact inverses, since
*
* <blockquote>"A" x <b>AB</b> -> "B"<br>
* "B" x <b>BA</b> -> "A"</blockquote>
*
* where 'x' represents transliteration. However,
*
* <blockquote>"ABCD" x <b>AB</b> -> "BBCD"<br>
* "BBCD" x <b>BA</b> -> "AACD"</blockquote>
*
* so <b>AB</b> composed with <b>BA</b> is not the
* identity. Nonetheless, <b>BA</b> may be usefully considered to be
* <b>AB</b>'s inverse, and it is on this basis that
* <b>AB</b><code>.getInverse()</code> could legitimately return
* <b>BA</b>.
*
* <p><b>IDs and display names</b>
*
* <p>A transliterator is designated by a short identifier string or
* <em>ID</em>. IDs follow the format <em>source-destination</em>,
* where <em>source</em> describes the entity being replaced, and
* <em>destination</em> describes the entity replacing
* <em>source</em>. The entities may be the names of scripts,
* particular sequences of characters, or whatever else it is that the
* transliterator converts to or from. For example, a transliterator
* from Russian to Latin might be named "Russian-Latin". A
* transliterator from keyboard escape sequences to Latin-1 characters
* might be named "KeyboardEscape-Latin1". By convention, system
* entity names are in English, with the initial letters of words
* capitalized; user entity names may follow any format so long as
* they do not contain dashes.
*
* <p>In addition to programmatic IDs, transliterator objects have
* display names for presentation in user interfaces, returned by
* {@link #getDisplayName()}.
*
* <p><b>Factory methods and registration</b>
*
* <p>In general, client code should use the factory method
* {@link #createInstance()} to obtain an instance of a
* transliterator given its ID. Valid IDs may be enumerated using
* <code>getAvailableIDs()</code>. Since transliterators are mutable,
* multiple calls to {@link #createInstance()} with the same ID will
* return distinct objects.
*
* <p>In addition to the system transliterators registered at startup,
* user transliterators may be registered by calling
* <code>registerInstance()</code> at run time. A registered instance
* acts a template; future calls to {@link #createInstance()} with the ID
* of the registered object return clones of that object. Thus any
* object passed to <tt>registerInstance()</tt> must implement
* <tt>clone()</tt> propertly. To register a transliterator subclass
* without instantiating it (until it is needed), users may call
* <code>registerClass()</code>. In this case, the objects are
* instantiated by invoking the zero-argument public constructor of
* the class.
*
* <p><b>Subclassing</b>
*
* Subclasses must implement the abstract method
* <code>handleTransliterate()</code>. <p>Subclasses should override
* the <code>transliterate()</code> method taking a
* <code>Replaceable</code> and the <code>transliterate()</code>
* method taking a <code>String</code> and <code>StringBuffer</code>
* if the performance of these methods can be improved over the
* performance obtained by the default implementations in this class.
*
* @author Alan Liu
* @stable ICU 2.0
*/
class U_I18N_API Transliterator : public UObject {
private:
/**
* Programmatic name, e.g., "Latin-Arabic".
*/
UnicodeString ID;
/**
* This transliterator's filter. Any character for which
* <tt>filter.contains()</tt> returns <tt>false</tt> will not be
* altered by this transliterator. If <tt>filter</tt> is
* <tt>null</tt> then no filtering is applied.
*/
UnicodeFilter* filter;
int32_t maximumContextLength;
public:
/**
* A context integer or pointer for a factory function, passed by
* value.
* @draft ICU 2.4
*/
union Token {
/**
* This token, interpreted as a 32-bit integer.
* @draft ICU 2.4
*/
int32_t integer;
/**
* This token, interpreted as a native pointer.
* @draft ICU 2.4
*/
void* pointer;
};
/**
* Return a token containing an integer.
* @return a token containing an integer.
* @draft ICU 2.4
*/
inline static Token integerToken(int32_t);
/**
* Return a token containing a pointer.
* @return a token containing a pointer.
* @draft ICU 2.4
*/
inline static Token pointerToken(void*);
/**
* A function that creates and returns a Transliterator. When
* invoked, it will be passed the ID string that is being
* instantiated, together with the context pointer that was passed
* in when the factory function was first registered. Many
* factory functions will ignore both parameters, however,
* functions that are registered to more than one ID may use the
* ID or the context parameter to parameterize the transliterator
* they create.
* @param ID the string identifier for this transliterator
* @param context a context pointer that will be stored and
* later passed to the factory function when an ID matching
* the registration ID is being instantiated with this factory.
* @draft ICU 2.4
*/
typedef Transliterator* (*Factory)(const UnicodeString& ID, Token context);
protected:
/**
* Default constructor.
* @param ID the string identifier for this transliterator
* @param adoptedFilter the filter. Any character for which
* <tt>filter.contains()</tt> returns <tt>false</tt> will not be
* altered by this transliterator. If <tt>filter</tt> is
* <tt>null</tt> then no filtering is applied.
* @draft ICU 2.4
*/
Transliterator(const UnicodeString& ID, UnicodeFilter* adoptedFilter);
/**
* Copy constructor.
* @draft ICU 2.4
*/
Transliterator(const Transliterator&);
/**
* Assignment operator.
* @draft ICU 2.4
*/
Transliterator& operator=(const Transliterator&);
/**
* Create a transliterator from a basic ID. This is an ID
* containing only the forward direction source, target, and
* variant.
* @param id a basic ID of the form S-T or S-T/V.
* @param canon canonical ID to assign to the object, or
* NULL to leave the ID unchanged
* @return a newly created Transliterator or null if the ID is
* invalid.
* @draft ICU 2.4
*/
static Transliterator* createBasicInstance(const UnicodeString& id,
const UnicodeString* canon);
friend class TransliteratorParser; // for parseID()
friend class TransliteratorIDParser; // for createBasicInstance()
public:
/**
* Destructor.
* @stable ICU 2.0
*/
virtual ~Transliterator();
/**
* Implements Cloneable.
* All subclasses are encouraged to implement this method if it is
* possible and reasonable to do so. Subclasses that are to be
* registered with the system using <tt>registerInstance()<tt>
* are required to implement this method. If a subclass does not
* implement clone() properly and is registered with the system
* using registerInstance(), then the default clone() implementation
* will return null, and calls to createInstance() will fail.
*
* @return a copy of the object.
* @see #registerInstance
* @stable ICU 2.0
*/
virtual Transliterator* clone() const { return 0; }
/**
* Transliterates a segment of a string, with optional filtering.
*
* @param text the string to be transliterated
* @param start the beginning index, inclusive; <code>0 <= start
* <= limit</code>.
* @param limit the ending index, exclusive; <code>start <= limit
* <= text.length()</code>.
* @return The new limit index. The text previously occupying <code>[start,
* limit)</code> has been transliterated, possibly to a string of a different
* length, at <code>[start, </code><em>new-limit</em><code>)</code>, where
* <em>new-limit</em> is the return value. If the input offsets are out of bounds,
* the returned value is -1 and the input string remains unchanged.
* @stable ICU 2.0
*/
virtual int32_t transliterate(Replaceable& text,
int32_t start, int32_t limit) const;
/**
* Transliterates an entire string in place. Convenience method.
* @param text the string to be transliterated
* @stable ICU 2.0
*/
virtual void transliterate(Replaceable& text) const;
/**
* Transliterates the portion of the text buffer that can be
* transliterated unambiguosly after new text has been inserted,
* typically as a result of a keyboard event. The new text in
* <code>insertion</code> will be inserted into <code>text</code>
* at <code>index.limit</code>, advancing
* <code>index.limit</code> by <code>insertion.length()</code>.
* Then the transliterator will try to transliterate characters of
* <code>text</code> between <code>index.cursor</code> and
* <code>index.limit</code>. Characters before
* <code>index.cursor</code> will not be changed.
*
* <p>Upon return, values in <code>index</code> will be updated.
* <code>index.start</code> will be advanced to the first
* character that future calls to this method will read.
* <code>index.cursor</code> and <code>index.limit</code> will
* be adjusted to delimit the range of text that future calls to
* this method may change.
*
* <p>Typical usage of this method begins with an initial call
* with <code>index.start</code> and <code>index.limit</code>
* set to indicate the portion of <code>text</code> to be
* transliterated, and <code>index.cursor == index.start</code>.
* Thereafter, <code>index</code> can be used without
* modification in future calls, provided that all changes to
* <code>text</code> are made via this method.
*
* <p>This method assumes that future calls may be made that will
* insert new text into the buffer. As a result, it only performs
* unambiguous transliterations. After the last call to this
* method, there may be untransliterated text that is waiting for
* more input to resolve an ambiguity. In order to perform these
* pending transliterations, clients should call {@link
* #finishTransliteration()} after the last call to this
* method has been made.
*
* @param text the buffer holding transliterated and untransliterated text
* @param index an array of three integers.
*
* <ul><li><code>index.start</code>: the beginning index,
* inclusive; <code>0 <= index.start <= index.limit</code>.
*
* <li><code>index.limit</code>: the ending index, exclusive;
* <code>index.start <= index.limit <= text.length()</code>.
* <code>insertion</code> is inserted at
* <code>index.limit</code>.
*
* <li><code>index.cursor</code>: the next character to be
* considered for transliteration; <code>index.start <=
* index.cursor <= index.limit</code>. Characters before
* <code>index.cursor</code> will not be changed by future calls
* to this method.</ul>
*
* @param insertion text to be inserted and possibly
* transliterated into the translation buffer at
* <code>index.limit</code>. If <code>null</code> then no text
* is inserted.
* @param status Output param to filled in with a success or an error.
* @see #handleTransliterate
* @exception IllegalArgumentException if <code>index</code>
* is invalid
* @see UTransPosition
* @stable ICU 2.0
*/
virtual void transliterate(Replaceable& text, UTransPosition& index,
const UnicodeString& insertion,
UErrorCode& status) const;
/**
* Transliterates the portion of the text buffer that can be
* transliterated unambiguosly after a new character has been
* inserted, typically as a result of a keyboard event. This is a
* convenience method; see {@link
* #transliterate(Replaceable, UTransPosition, UnicodeString)} for details.
* @param text the buffer holding transliterated and
* untransliterated text
* @param index an array of three integers. See {@link
* #transliterate(Replaceable, UTransPosition, UnicodeString)}.
* @param insertion text to be inserted and possibly
* transliterated into the translation buffer at
* <code>index.limit</code>.
* @param status Output param to filled in with a success or an error.
* @see #transliterate(Replaceable, UTransPosition, UnicodeString)
* @stable ICU 2.0
*/
virtual void transliterate(Replaceable& text, UTransPosition& index,
UChar32 insertion,
UErrorCode& status) const;
/**
* Transliterates the portion of the text buffer that can be
* transliterated unambiguosly. This is a convenience method; see
* {@link #transliterate(Replaceable, UTransPosition, UnicodeString)} for
* details.
* @param text the buffer holding transliterated and
* untransliterated text
* @param index an array of three integers. See {@link
* #transliterate(Replaceable, UTransPosition, UnicodeString)}.
* @param status Output param to filled in with a success or an error.
* @see #transliterate(Replaceable, int[], String)
* @stable ICU 2.0
*/
virtual void transliterate(Replaceable& text, UTransPosition& index,
UErrorCode& status) const;
/**
* Finishes any pending transliterations that were waiting for
* more characters. Clients should call this method as the last
* call after a sequence of one or more calls to
* <code>transliterate()</code>.
* @param text the buffer holding transliterated and
* untransliterated text.
* @param index the array of indices previously passed to {@link
* #transliterate()}
* @stable ICU 2.0
*/
virtual void finishTransliteration(Replaceable& text,
UTransPosition& index) const;
private:
/**
* This internal method does incremental transliteration. If the
* 'insertion' is non-null then we append it to 'text' before
* proceeding. This method calls through to the pure virtual
* framework method handleTransliterate() to do the actual
* work.
* @param text the buffer holding transliterated and
* untransliterated text
* @param index an array of three integers. See {@link
* #transliterate(Replaceable, int[], String)}.
* @param insertion text to be inserted and possibly
* transliterated into the translation buffer at
* <code>index.limit</code>.
* @param status Output param to filled in with a success or an error.
*/
void _transliterate(Replaceable& text,
UTransPosition& index,
const UnicodeString* insertion,
UErrorCode &status) const;
protected:
/**
* Abstract method that concrete subclasses define to implement
* their transliteration algorithm. This method handles both
* incremental and non-incremental transliteration. Let
* <code>originalStart</code> refer to the value of
* <code>pos.start</code> upon entry.
*
* <ul>
* <li>If <code>incremental</code> is false, then this method
* should transliterate all characters between
* <code>pos.start</code> and <code>pos.limit</code>. Upon return
* <code>pos.start</code> must == <code> pos.limit</code>.</li>
*
* <li>If <code>incremental</code> is true, then this method
* should transliterate all characters between
* <code>pos.start</code> and <code>pos.limit</code> that can be
* unambiguously transliterated, regardless of future insertions
* of text at <code>pos.limit</code>. Upon return,
* <code>pos.start</code> should be in the range
* [<code>originalStart</code>, <code>pos.limit</code>).
* <code>pos.start</code> should be positioned such that
* characters [<code>originalStart</code>, <code>
* pos.start</code>) will not be changed in the future by this
* transliterator and characters [<code>pos.start</code>,
* <code>pos.limit</code>) are unchanged.</li>
* </ul>
*
* <p>Implementations of this method should also obey the
* following invariants:</p>
*
* <ul>
* <li> <code>pos.limit</code> and <code>pos.contextLimit</code>
* should be updated to reflect changes in length of the text
* between <code>pos.start</code> and <code>pos.limit</code>. The
* difference <code> pos.contextLimit - pos.limit</code> should
* not change.</li>
*
* <li><code>pos.contextStart</code> should not change.</li>
*
* <li>Upon return, neither <code>pos.start</code> nor
* <code>pos.limit</code> should be less than
* <code>originalStart</code>.</li>
*
* <li>Text before <code>originalStart</code> and text after
* <code>pos.limit</code> should not change.</li>
*
* <li>Text before <code>pos.contextStart</code> and text after
* <code> pos.contextLimit</code> should be ignored.</li>
* </ul>
*
* <p>Subclasses may safely assume that all characters in
* [<code>pos.start</code>, <code>pos.limit</code>) are filtered.
* In other words, the filter has already been applied by the time
* this method is called. See
* <code>filteredTransliterate()</code>.
*
* <p>This method is <b>not</b> for public consumption. Calling
* this method directly will transliterate
* [<code>pos.start</code>, <code>pos.limit</code>) without
* applying the filter. End user code should call <code>
* transliterate()</code> instead of this method. Subclass code
* should call <code>filteredTransliterate()</code> instead of
* this method.<p>
*
* @param text the buffer holding transliterated and
* untransliterated text
*
* @param pos the indices indicating the start, limit, context
* start, and context limit of the text.
*
* @param incremental if true, assume more text may be inserted at
* <code>pos.limit</code> and act accordingly. Otherwise,
* transliterate all text between <code>pos.start</code> and
* <code>pos.limit</code> and move <code>pos.start</code> up to
* <code>pos.limit</code>.
*
* @see #transliterate
* @draft ICU 2.4
*/
virtual void handleTransliterate(Replaceable& text,
UTransPosition& pos,
UBool incremental) const = 0;
/**
* Transliterate a substring of text, as specified by index, taking filters
* into account. This method is for subclasses that need to delegate to
* another transliterator, such as CompoundTransliterator.
* @param text the text to be transliterated
* @param index the position indices
* @param incremental if TRUE, then assume more characters may be inserted
* at index.limit, and postpone processing to accomodate future incoming
* characters
* @draft ICU 2.4
*/
virtual void filteredTransliterate(Replaceable& text,
UTransPosition& index,
UBool incremental) const;
friend class CompoundTransliterator; // for filteredTransliterate()
friend class AnyTransliterator; // for filteredTransliterate()
private:
/**
* Top-level transliteration method, handling filtering, incremental and
* non-incremental transliteration, and rollback. All transliteration
* public API methods eventually call this method with a rollback argument
* of TRUE. Other entities may call this method but rollback should be
* FALSE.
*
* <p>If this transliterator has a filter, break up the input text into runs
* of unfiltered characters. Pass each run to
* <subclass>.handleTransliterate().
*
* <p>In incremental mode, if rollback is TRUE, perform a special
* incremental procedure in which several passes are made over the input
* text, adding one character at a time, and committing successful
* transliterations as they occur. Unsuccessful transliterations are rolled
* back and retried with additional characters to give correct results.
*
* @param text the text to be transliterated
* @param index the position indices
* @param incremental if TRUE, then assume more characters may be inserted
* at index.limit, and postpone processing to accomodate future incoming
* characters
* @param rollback if TRUE and if incremental is TRUE, then perform special
* incremental processing, as described above, and undo partial
* transliterations where necessary. If incremental is FALSE then this
* parameter is ignored.
*/
virtual void filteredTransliterate(Replaceable& text,
UTransPosition& index,
UBool incremental,
UBool rollback) const;
public:
/**
* Returns the length of the longest context required by this transliterator.
* This is <em>preceding</em> context. The default implementation supplied
* by <code>Transliterator</code> returns zero; subclasses
* that use preceding context should override this method to return the
* correct value. For example, if a transliterator translates "ddd" (where
* d is any digit) to "555" when preceded by "(ddd)", then the preceding
* context length is 5, the length of "(ddd)".
*
* @return The maximum number of preceding context characters this
* transliterator needs to examine
* @stable ICU 2.0
*/
int32_t getMaximumContextLength(void) const;
protected:
/**
* Method for subclasses to use to set the maximum context length.
* @param maxContextLength the new value to be set.
* @see #getMaximumContextLength
* @draft ICU 2.4
*/
void setMaximumContextLength(int32_t maxContextLength);
public:
/**
* Returns a programmatic identifier for this transliterator.
* If this identifier is passed to <code>createInstance()</code>, it
* will return this object, if it has been registered.
* @return a programmatic identifier for this transliterator.
* @see #registerInstance
* @see #registerClass
* @see #getAvailableIDs
* @stable ICU 2.0
*/
virtual const UnicodeString& getID(void) const;
/**
* Returns a name for this transliterator that is appropriate for
* display to the user in the default locale. See {@link
* #getDisplayName()} for details.
* @param ID the string identifier for this transliterator
* @param result Output param to receive the display name
* @return A reference to 'result'.
* @stable ICU 2.0
*/
static UnicodeString& getDisplayName(const UnicodeString& ID,
UnicodeString& result);
/**
* Returns a name for this transliterator that is appropriate for
* display to the user in the given locale. This name is taken
* from the locale resource data in the standard manner of the
* <code>java.text</code> package.
*
* <p>If no localized names exist in the system resource bundles,
* a name is synthesized using a localized
* <code>MessageFormat</code> pattern from the resource data. The
* arguments to this pattern are an integer followed by one or two
* strings. The integer is the number of strings, either 1 or 2.
* The strings are formed by splitting the ID for this
* transliterator at the first '-'. If there is no '-', then the
* entire ID forms the only string.
* @param ID the string identifier for this transliterator
* @param inLocale the Locale in which the display name should be
* localized.
* @param result Output param to receive the display name
* @return A reference to 'result'.
* @stable ICU 2.0
*/
static UnicodeString& getDisplayName(const UnicodeString& ID,
const Locale& inLocale,
UnicodeString& result);
/**
* Returns the filter used by this transliterator, or <tt>NULL</tt>
* if this transliterator uses no filter.
* @return the filter used by this transliterator, or <tt>NULL</tt>
* if this transliterator uses no filter.
* @stable ICU 2.0
*/
const UnicodeFilter* getFilter(void) const;
/**
* Returns the filter used by this transliterator, or <tt>NULL</tt> if this
* transliterator uses no filter. The caller must eventually delete the
* result. After this call, this transliterator's filter is set to
* <tt>NULL</tt>.
* @return the filter used by this transliterator, or <tt>NULL</tt> if this
* transliterator uses no filter.
* @draft ICU 2.4
*/
UnicodeFilter* orphanFilter(void);
#ifdef U_USE_DEPRECATED_TRANSLITERATOR_API
/**
* Changes the filter used by this transliterator. If the filter
* is set to <tt>null</tt> then no filtering will occur.
*
* <p>Callers must take care if a transliterator is in use by
* multiple threads. The filter should not be changed by one
* thread while another thread may be transliterating.
*
* @obsolete ICU 2.4. This method will be made non-virtual in that release.
*/
virtual void adoptFilter(UnicodeFilter* adoptedFilter);
#else
/**
* Changes the filter used by this transliterator. If the filter
* is set to <tt>null</tt> then no filtering will occur.
*
* <p>Callers must take care if a transliterator is in use by
* multiple threads. The filter should not be changed by one
* thread while another thread may be transliterating.
* @param adoptedFilter the new filter to be adopted.
* @stable ICU 2.0
*/
void adoptFilter(UnicodeFilter* adoptedFilter);
#endif
/**
* Returns this transliterator's inverse. See the class
* documentation for details. This implementation simply inverts
* the two entities in the ID and attempts to retrieve the
* resulting transliterator. That is, if <code>getID()</code>
* returns "A-B", then this method will return the result of
* <code>createInstance("B-A")</code>, or <code>null</code> if that
* call fails.
*
* <p>Subclasses with knowledge of their inverse may wish to
* override this method.
*
* @param status Output param to filled in with a success or an error.
* @return a transliterator that is an inverse, not necessarily
* exact, of this transliterator, or <code>null</code> if no such
* transliterator is registered.
* @see #registerInstance
* @stable ICU 2.0
*/
Transliterator* createInverse(UErrorCode& status) const;
/**
* Returns a <code>Transliterator</code> object given its ID.
* The ID must be either a system transliterator ID or a ID registered
* using <code>registerInstance()</code>.
*
* @param ID a valid ID, as enumerated by <code>getAvailableIDs()</code>
* @param dir either FORWARD or REVERSE.
* @param parseError Struct to recieve information on position
* of error if an error is encountered
* @param status Output param to filled in with a success or an error.
* @return A <code>Transliterator</code> object with the given ID
* @see #registerInstance
* @see #getAvailableIDs
* @see #getID
* @stable ICU 2.0
*/
static Transliterator* createInstance(const UnicodeString& ID,
UTransDirection dir,
UParseError& parseError,
UErrorCode& status);
/**
* Returns a <code>Transliterator</code> object given its ID.
* The ID must be either a system transliterator ID or a ID registered
* using <code>registerInstance()</code>.
* @param ID a valid ID, as enumerated by <code>getAvailableIDs()</code>
* @param dir either FORWARD or REVERSE.
* @param status Output param to filled in with a success or an error.
* @return A <code>Transliterator</code> object with the given ID
* @stable ICU 2.0
*/
static Transliterator* createInstance(const UnicodeString& ID,
UTransDirection dir,
UErrorCode& status);
/**
* Returns a <code>Transliterator</code> object constructed from
* the given rule string. This will be a RuleBasedTransliterator,
* if the rule string contains only rules, or a
* CompoundTransliterator, if it contains ID blocks, or a
* NullTransliterator, if it contains ID blocks which parse as
* empty for the given direction.
* @param id the id for the transliterator.
* @param rules rules, separated by ';'
* @param dir either FORWARD or REVERSE.
* @param parseError Struct to recieve information on position
* of error if an error is encountered
* @param status Output param set to success/failure code.
* @stable ICU 2.0
*/
static Transliterator* createFromRules(const UnicodeString& ID,
const UnicodeString& rules,
UTransDirection dir,
UParseError& parseError,
UErrorCode& status);
/**
* Create a rule string that can be passed to createFromRules()
* to recreate this transliterator.
* @param result the string to receive the rules. Previous
* contents will be deleted.
* @param escapeUnprintable if TRUE then convert unprintable
* character to their hex escape representations, \uxxxx or
* \Uxxxxxxxx. Unprintable characters are those other than
* U+000A, U+0020..U+007E.
* @stable ICU 2.0
*/
virtual UnicodeString& toRules(UnicodeString& result,
UBool escapeUnprintable) const;
/**
* Returns the set of all characters that may be modified in the
* input text by this Transliterator. This incorporates this
* object's current filter; if the filter is changed, the return
* value of this function will change. The default implementation
* returns an empty set. Some subclasses may override {@link
* #handleGetSourceSet()} to return a more precise result. The
* return result is approximate in any case and is intended for
* use by tests, tools, or utilities.
* @param result receives result set; previous contents lost
* @return a reference to result
* @see #getTargetSet
* @see #handleGetSourceSet
* @draft ICU 2.4
*/
UnicodeSet& getSourceSet(UnicodeSet& result) const;
/**
* Framework method that returns the set of all characters that
* may be modified in the input text by this Transliterator,
* ignoring the effect of this object's filter. The base class
* implementation returns the empty set. Subclasses that wish to
* implement this should override this method.
* @return the set of characters that this transliterator may
* modify. The set may be modified, so subclasses should return a
* newly-created object.
* @param result receives result set; previous contents lost
* @see #getSourceSet
* @see #getTargetSet
* @draft ICU 2.4
*/
virtual void handleGetSourceSet(UnicodeSet& result) const;
/**
* Returns the set of all characters that may be generated as
* replacement text by this transliterator. The default
* implementation returns the empty set. Some subclasses may
* override this method to return a more precise result. The
* return result is approximate in any case and is intended for
* use by tests, tools, or utilities requiring such
* meta-information.
* @param result receives result set; previous contents lost
* @return a reference to result
* @see #getTargetSet
* @draft ICU 2.4
*/
virtual UnicodeSet& getTargetSet(UnicodeSet& result) const;
public:
/**
* Registers a factory function that creates transliterators of
* a given ID.
* @param id the ID being registered
* @param factory a function pointer that will be copied and
* called later when the given ID is passed to createInstance()
* @param context a context pointer that will be stored and
* later passed to the factory function when an ID matching
* the registration ID is being instantiated with this factory.
* @stable ICU 2.0
*/
static void registerFactory(const UnicodeString& id,
Factory factory,
Token context);
/**
* Registers a instance <tt>obj</tt> of a subclass of
* <code>Transliterator</code> with the system. When
* <tt>createInstance()</tt> is called with an ID string that is
* equal to <tt>obj->getID()</tt>, then <tt>obj->clone()</tt> is
* returned.
*
* After this call the Transliterator class owns the adoptedObj
* and will delete it.
*
* @param adoptedObj an instance of subclass of
* <code>Transliterator</code> that defines <tt>clone()</tt>
* @see #createInstance
* @see #registerClass
* @see #unregister
* @stable ICU 2.0
*/
static void registerInstance(Transliterator* adoptedObj);
protected:
/**
* @internal
* @param id the ID being registered
* @param factory a function pointer that will be copied and
* called later when the given ID is passed to createInstance()
* @param context a context pointer that will be stored and
* later passed to the factory function when an ID matching
* the registration ID is being instantiated with this factory.
*/
static void _registerFactory(const UnicodeString& id,
Factory factory,
Token context);
/**
* @internal
*/
static void _registerInstance(Transliterator* adoptedObj);
/**
* Register two targets as being inverses of one another. For
* example, calling registerSpecialInverse("NFC", "NFD", true) causes
* Transliterator to form the following inverse relationships:
*
* <pre>NFC => NFD
* Any-NFC => Any-NFD
* NFD => NFC
* Any-NFD => Any-NFC</pre>
*
* (Without the special inverse registration, the inverse of NFC
* would be NFC-Any.) Note that NFD is shorthand for Any-NFD, but
* that the presence or absence of "Any-" is preserved.
*
* <p>The relationship is symmetrical; registering (a, b) is
* equivalent to registering (b, a).
*
* <p>The relevant IDs must still be registered separately as
* factories or classes.
*
* <p>Only the targets are specified. Special inverses always
* have the form Any-Target1 <=> Any-Target2. The target should
* have canonical casing (the casing desired to be produced when
* an inverse is formed) and should contain no whitespace or other
* extraneous characters.
*
* @param target the target against which to register the inverse
* @param inverseTarget the inverse of target, that is
* Any-target.getInverse() => Any-inverseTarget
* @param bidirectional if true, register the reverse relation
* as well, that is, Any-inverseTarget.getInverse() => Any-target
* @internal
*/
static void _registerSpecialInverse(const UnicodeString& target,
const UnicodeString& inverseTarget,
UBool bidirectional);
public:
/**
* Unregisters a transliterator or class. This may be either
* a system transliterator or a user transliterator or class.
* Any attempt to construct an unregistered transliterator based
* on its ID will fail.
*
* @param ID the ID of the transliterator or class
* @return the <code>Object</code> that was registered with
* <code>ID</code>, or <code>null</code> if none was
* @see #registerInstance
* @see #registerClass
* @stable ICU 2.0
*/
static void unregister(const UnicodeString& ID);
public:
/**
* Return the number of IDs currently registered with the system.
* To retrieve the actual IDs, call getAvailableID(i) with
* i from 0 to countAvailableIDs() - 1.
* @return the number of IDs currently registered with the system.
* @stable ICU 2.0
*/
static int32_t countAvailableIDs(void);
/**
* Return the index-th available ID. index must be between 0
* and countAvailableIDs() - 1, inclusive. If index is out of
* range, the result of getAvailableID(0) is returned.
* @param index the given ID index.
* @return the index-th available ID. index must be between 0
* and countAvailableIDs() - 1, inclusive. If index is out of
* range, the result of getAvailableID(0) is returned.
* @stable ICU 2.0
*/
static const UnicodeString& getAvailableID(int32_t index);
/**
* Return the number of registered source specifiers.
* @return the number of registered source specifiers.
* @stable ICU 2.0
*/
static int32_t countAvailableSources(void);
/**
* Return a registered source specifier.
* @param index which specifier to return, from 0 to n-1, where
* n = countAvailableSources()
* @param result fill-in paramter to receive the source specifier.
* If index is out of range, result will be empty.
* @return reference to result
* @stable ICU 2.0
*/
static UnicodeString& getAvailableSource(int32_t index,
UnicodeString& result);
/**
* Return the number of registered target specifiers for a given
* source specifier.
* @param source the given source specifier.
* @return the number of registered target specifiers for a given
* source specifier.
* @stable ICU 2.0
*/
static int32_t countAvailableTargets(const UnicodeString& source);
/**
* Return a registered target specifier for a given source.
* @param index which specifier to return, from 0 to n-1, where
* n = countAvailableTargets(source)
* @param source the source specifier
* @param result fill-in paramter to receive the target specifier.
* If source is invalid or if index is out of range, result will
* be empty.
* @return reference to result
* @stable ICU 2.0
*/
static UnicodeString& getAvailableTarget(int32_t index,
const UnicodeString& source,
UnicodeString& result);
/**
* Return the number of registered variant specifiers for a given
* source-target pair.
* @param source the source specifiers.
* @param target the target specifiers.
* @stable ICU 2.0
*/
static int32_t countAvailableVariants(const UnicodeString& source,
const UnicodeString& target);
/**
* Return a registered variant specifier for a given source-target
* pair.
* @param index which specifier to return, from 0 to n-1, where
* n = countAvailableVariants(source, target)
* @param source the source specifier
* @param target the target specifier
* @param result fill-in paramter to receive the variant
* specifier. If source is invalid or if target is invalid or if
* index is out of range, result will be empty.
* @return reference to result
* @stable ICU 2.0
*/
static UnicodeString& getAvailableVariant(int32_t index,
const UnicodeString& source,
const UnicodeString& target,
UnicodeString& result);
protected:
/**
* Non-mutexed internal method
* @internal
*/
static int32_t _countAvailableSources(void);
/**
* Non-mutexed internal method
* @internal
*/
static UnicodeString& _getAvailableSource(int32_t index,
UnicodeString& result);
/**
* Non-mutexed internal method
* @internal
*/
static int32_t _countAvailableTargets(const UnicodeString& source);
/**
* Non-mutexed internal method
* @internal
*/
static UnicodeString& _getAvailableTarget(int32_t index,
const UnicodeString& source,
UnicodeString& result);
/**
* Non-mutexed internal method
* @internal
*/
static int32_t _countAvailableVariants(const UnicodeString& source,
const UnicodeString& target);
/**
* Non-mutexed internal method
* @internal
*/
static UnicodeString& _getAvailableVariant(int32_t index,
const UnicodeString& source,
const UnicodeString& target,
UnicodeString& result);
public:
/**
* Return the class ID for this class. This is useful only for
* comparing to a return value from getDynamicClassID(). For example:
* <pre>
* . Base* polymorphic_pointer = createPolymorphicObject();
* . if (polymorphic_pointer->getDynamicClassID() ==
* . Derived::getStaticClassID()) ...
* </pre>
* @return The class ID for all objects of this class.
* @stable ICU 2.0
*/
static UClassID getStaticClassID(void) { return (UClassID)&fgClassID; }
/**
* Returns a unique class ID <b>polymorphically</b>. This method
* is to implement a simple version of RTTI, since not all C++
* compilers support genuine RTTI. Polymorphic operator==() and
* clone() methods call this method.
*
* <p>Concrete subclasses of Transliterator that wish clients to
* be able to identify them should implement getDynamicClassID()
* and also a static method and data member:
*
* <pre>
* static UClassID getStaticClassID() { return (UClassID)&fgClassID; }
* static char fgClassID;
* </pre>
*
* Subclasses that do not implement this method will have a
* dynamic class ID of Transliterator::getStatisClassID().
*
* @return The class ID for this object. All objects of a given
* class have the same class ID. Objects of other classes have
* different class IDs.
* @stable ICU 2.0
*/
virtual UClassID getDynamicClassID(void) const = 0;
private:
/**
* Class identifier for subclasses of Transliterator that do not
* define their class (anonymous subclasses).
*/
static const char fgClassID;
protected:
/**
* Set the ID of this transliterators. Subclasses shouldn't do
* this, unless the underlying script behavior has changed.
* @param id the new id t to be set.
* @draft ICU 2.4
*/
void setID(const UnicodeString& id);
private:
static void initializeRegistry(void);
#ifdef U_USE_DEPRECATED_TRANSLITERATOR_API
public:
/**
* Returns a <code>Transliterator</code> object given its ID.
* The ID must be either a system transliterator ID or a ID registered
* using <code>registerInstance()</code>.
*
* @param ID a valid ID, as enumerated by <code>getAvailableIDs()</code>
* @param dir either FORWARD or REVERSE.
* @param parseError Struct to recieve information on position
* @return A <code>Transliterator</code> object with the given ID
* @exception IllegalArgumentException if the given ID is invalid.
* @see #registerInstance
* @see #getAvailableIDs
* @see #getID
* @obsolete ICU 2.4. Use the factory method that takes UParseError and UErrorCode instead since this API will be removed in that release.
*/
inline Transliterator* createInstance(const UnicodeString& ID,
UTransDirection dir=UTRANS_FORWARD,
UParseError* parseError=0);
/**
* Returns this transliterator's inverse. See the class
* documentation for details. This implementation simply inverts
* the two entities in the ID and attempts to retrieve the
* resulting transliterator. That is, if <code>getID()</code>
* returns "A-B", then this method will return the result of
* <code>createInstance("B-A")</code>, or <code>null</code> if that
* call fails.
*
* <p>This method does not take filtering into account. The
* returned transliterator will have no filter.
*
* <p>Subclasses with knowledge of their inverse may wish to
* override this method.
*
* @return a transliterator that is an inverse, not necessarily
* exact, of this transliterator, or <code>null</code> if no such
* transliterator is registered.
* @obsolete ICU 2.4. Use the factory method that takes UErrorCode instead since this API will be removed in that release.
*/
inline Transliterator* createInverse() const;
protected:
/**
* Method for subclasses to use to obtain a character in the given
* string, with filtering. If the character at the given offset
* is excluded by this transliterator's filter, then U+FFFE is returned.
*
* <p><b>Note:</b> Most subclasses that implement
* handleTransliterator() will <em>not</em> want to use this
* method, since characters they see are already filtered. Only
* subclasses with special requirements, such as those overriding
* filteredTransliterate(), should need this method.
*
* @obsolete ICU 2.4. No need to call this since the new architecture provides filtering at the top level.
*/
UChar filteredCharAt(const Replaceable& text, int32_t i) const;
#endif
};
inline int32_t Transliterator::getMaximumContextLength(void) const {
return maximumContextLength;
}
inline void Transliterator::setID(const UnicodeString& id) {
ID = id;
}
inline Transliterator::Token Transliterator::integerToken(int32_t i) {
Token t;
t.integer = i;
return t;
}
inline Transliterator::Token Transliterator::pointerToken(void* p) {
Token t;
t.pointer = p;
return t;
}
/**
* Definitions for obsolete API
* TODO: Remove after Aug 2002
*/
#ifdef U_USE_DEPRECATED_TRANSLITERATOR_API
inline Transliterator* Transliterator::createInstance(const UnicodeString& ID,
UTransDirection dir,
UParseError* parseError){
UErrorCode status = U_ZERO_ERROR;
UParseError error;
if(parseError == NULL){
parseError = &error;
}
return Transliterator::createInstance(ID,dir,*parseError,status);
}
inline Transliterator* Transliterator::createInverse() const{
UErrorCode status = U_ZERO_ERROR;
return createInverse(status);
}
#endif
U_NAMESPACE_END
#endif /* #if !UCONFIG_NO_TRANSLITERATION */
#endif
| [
"(no author)@251d0590-4201-4cf1-90de-194747b24ca1"
] | (no author)@251d0590-4201-4cf1-90de-194747b24ca1 |
cc7a913e190fbae8d8965472707aed61dddff431 | 64252bc56b696143057e04e45cabf33977e1e389 | /SDJGameFramework/Component.cpp | 32b7538f34345297157634377aaae26ddcfc7607 | [] | no_license | jayong93/SDJGameFramework | 183e59e369880a2f7c7ad0e2af7d0b7817afef1b | 0755913563025fd28f4ee74fb9b7b206715070a5 | refs/heads/master | 2021-01-19T22:34:01.162505 | 2017-08-25T12:05:11 | 2017-08-25T12:05:11 | 101,254,808 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 70 | cpp | #include "stdafx.h"
#include "Component.h"
#include "ObjectManager.h"
| [
"jayong93@gmail.com"
] | jayong93@gmail.com |
390f37f8dbf82ce0bf4b3e6d1cae30cdac8d0e63 | 7cc9f9f4beb2af797635be0845f59b149adfb5cd | /Tuple.cpp | deb42981b2226bfdad25e8b1c9b7547afbe6320d | [] | no_license | Ashaman47/CS236 | a8ae6d1e6cbb11fe051a2c7c6f2be2c8774e7bb8 | deb226398b7b7f874e1c28d55a439427c820f285 | refs/heads/master | 2022-04-08T20:10:33.307260 | 2020-03-10T16:01:51 | 2020-03-10T16:01:51 | 236,593,709 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 974 | cpp | #include "Tuple.h"
void Tuple::addTuple(string current){
Tuples.push_back(current);
return;
}
bool Tuple::compareTuple(string queries, int i){
if (queries == Tuples[i]){
return true;
}
return false;
}
string Tuple::toString(){
string g;
for (unsigned int i = 0; i < Tuples.size(); ++i){
g += Tuples[i];
if (i < Tuples.size() - 1){
g += " ";
}
}
return g;
}
void Tuple::deleteTuple(){
Tuples.clear();
return;
}
bool Tuple::findDuplicateTuple(){
for (unsigned int i = 0; i < Tuples.size();++i){
for (unsigned int j = 0;j < Tuples.size(); ++j){
if (Tuples[i] == Tuples[j] && i != j){
return true;
}
}
}
return false;
}
string Tuple::receiveOneTuple(int i){
return Tuples[i];
}
bool operator<(Tuple &s1, Tuple &s2){
return s1.toString() < s2.toString();
}
int Tuple::size(){
return Tuples.size();
} | [
"noreply@github.com"
] | Ashaman47.noreply@github.com |
dc62d96870fba89bf101df6fc43ab774bd504115 | 4cf3985b76da8af9b43d96cec1bb72258a6434d4 | /DXEdit/VertexEdit.h | 6482af3ac8515619b44fbbec1bbc2fb0dc298089 | [] | no_license | d16/freefalcon-contrib | 6d235885c1629739d2bc47006c4ec0d1838fa63c | 9995379bd5ed734acfccd30918117c3b3765e5ca | refs/heads/master | 2020-12-24T17:45:02.978021 | 2013-01-17T18:41:28 | 2013-01-17T18:41:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,020 | h | #pragma once
#include "afxwin.h"
#include "afxcmn.h"
// CVertexEdit dialog
class CVertexEdit : public CDialog
{
DECLARE_DYNAMIC(CVertexEdit)
public:
CVertexEdit(CWnd* pParent = NULL); // standard constructor
virtual ~CVertexEdit();
bool EditVertex(CSelectList *List, void **Object, D3DVERTEXEX **Vertex);
void UpdateEditValues(CSelectList *List, void **Object, D3DVERTEXEX **Vertex);
void VertexScaleFunction(D3DXVECTOR3 Transform, D3DXVECTOR3 Move, bool Remove);
void VertexUVFunction(D3DXVECTOR3 Transform, D3DXVECTOR3 Move, bool Remove);
// Dialog Data
enum { IDD = IDD_VERTEXEDIT };
protected:
virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV support
D3DVERTEXEX **m_VSelected;
void **m_VertexOwner;
DWORD m_SAlpha, m_DAlpha;
bool m_bVertexMove, m_bVertexScale, m_bVertexUV;
CSelectList *m_SelectList;
D3DCOLOR m_DiffuseCopy, m_SpecularCopy;
D3DVECTOR m_PositionCopy;
float m_UCopy, m_VCopy;
DECLARE_MESSAGE_MAP()
public:
void VertexMoveFunction(D3DXVECTOR3 Transform, D3DXVECTOR3 Move, bool Remove);
afx_msg void OnBnClickedDiffusecolor();
afx_msg void OnBnClickedSpecularcolor();
afx_msg void OnNMCustomdrawDiffuseslider(NMHDR *pNMHDR, LRESULT *pResult);
afx_msg void OnNMCustomdrawSpecularslider(NMHDR *pNMHDR, LRESULT *pResult);
CButton m_SingleVertexCheck;
CSliderCtrl m_SpecularAlpha;
CSliderCtrl m_DiffuseSlider;
protected:
CButton m_VertexMove ;
CButton m_VertexScale;
CButton m_VertexUV ;
public:
afx_msg void OnBnClickedSvertexmove();
afx_msg void OnBnClickedSvertexscale();
protected:
CButton m_OnlySelectCheck;
public:
afx_msg void OnBnClickedDcopy();
afx_msg void OnBnClickedScopy();
afx_msg void OnBnClickedDpaste();
afx_msg void OnBnClickedSpaste();
afx_msg void OnBnClickedButton3();
afx_msg void OnBnClickedPoscopy();
afx_msg void OnBnClickedPospaste();
afx_msg void OnBnClickedCopyuv();
afx_msg void OnBnClickedPasteuv();
afx_msg void OnBnClickedSvertexuv();
CButton m_ScaleOmniCheck;
CButton m_ScaleAbsolute;
};
| [
"pmvstrm@yahoo.de"
] | pmvstrm@yahoo.de |
0c7e4bbcf2ace74fe99264efc9f5029bf3a85ab0 | aade1e73011f72554e3bd7f13b6934386daf5313 | /Contest/AsiaEast/Guilin2021/H.cpp | b3815c75b9091170eecd08e4e3d1485853c91153 | [] | no_license | edisonhello/waynedisonitau123 | 3a57bc595cb6a17fc37154ed0ec246b145ab8b32 | 48658467ae94e60ef36cab51a36d784c4144b565 | refs/heads/master | 2022-09-21T04:24:11.154204 | 2022-09-18T15:23:47 | 2022-09-18T15:23:47 | 101,478,520 | 34 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 3,268 | cpp | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
constexpr int kN = 500'000 + 123;
constexpr int kB = 30;
int jump[kB][kN][2];
int to[kN][2];
int64_t used[kB][kN][2];
int nxt[kN][2];
int fail[kN];
int l[kN], r[kN], pos[kN];
char buf[kN];
int64_t cnt[kN];
int Read() {
char c = 0;
while (c = getchar(), !isdigit(c));
int x = c - '0';
while (c = getchar(), isdigit(c)) {
x = x * 10 + c - '0';
}
return x;
}
int main() {
int N = Read();
int Q = Read();
for (int i = 0; i < N; ++i) {
l[i] = Read();
r[i] = Read();
}
memset(fail, -1, sizeof(fail));
memset(nxt, -1, sizeof(nxt));
int W = 1;
auto Insert = [&]() {
int x = 0;
for (int i = 0; buf[i] != '\n'; ++i) {
if (nxt[x][buf[i] - '0'] == -1) {
nxt[x][buf[i] - '0'] = W++;
}
x = nxt[x][buf[i] - '0'];
}
return x;
};
for (int i = 0; i < Q; ++i) {
fgets(buf, kN, stdin);
pos[i] = Insert();
}
vector<int> que = {0};
for (int it = 0; it < que.size(); ++it) {
int x = que[it];
for (int i = 0; i < 2; ++i) {
if (nxt[x][i] != -1) {
int p = nxt[x][i], fp = fail[x];
while (fp != -1 && nxt[fp][i] == -1) {
fp = fail[fp];
}
int pd = fp != -1 ? nxt[fp][i] : 0;
fail[p] = pd;
que.push_back(p);
}
}
}
// reverse(que.begin(), que.end());
for (int i : que) {
for (int j = 0; j < 2; ++j) {
if (nxt[i][j] == -1) {
nxt[i][j] = fail[i] == -1 ? 0 : nxt[fail[i]][j];
}
// nxt[i][j] = x;
}
jump[0][i][0] = nxt[i][0];
jump[0][i][1] = nxt[i][1];
}
for (int bit = 1; bit < kB; ++bit) {
for (int i = 0; i < W; ++i) {
for (int j = 0; j < 2; ++j) {
jump[bit][i][j] = jump[bit - 1][jump[bit - 1][i][j]][j ^ 1];
}
}
}
auto Get = [&](int x) {
return __builtin_popcount(x) % 2;
};
int x = 0;
for (int i = 0; i < N; ++i) {
r[i]++;
while (l[i] < r[i]) {
int low_bit = __builtin_ctz(l[i] & -l[i]);
if (l[i] + (1 << low_bit) > r[i]) {
break;
}
int b = Get(l[i]);
used[low_bit][x][b]++;
x = jump[low_bit][x][b];
l[i] += (1 << low_bit);
}
while (l[i] < r[i]) {
int low_bit = 31 - __builtin_clz(r[i] - l[i]);
int b = Get(l[i]);
used[low_bit][x][b]++;
x = jump[low_bit][x][b];
l[i] += (1 << low_bit);
}
assert(l[i] == r[i]);
}
for (int bit = kB - 2; bit >= 0; --bit) {
for (int i = 0; i < W; ++i) {
for (int j = 0; j < 2; ++j) {
used[bit][i][j] += used[bit + 1][i][j];
used[bit][jump[bit][i][j]][j ^ 1] += used[bit + 1][i][j];
}
}
}
// for (int i = 0; i < W; ++i) {
// used[kB - 1][i][0] = 0;
// }
for (int i = 0; i < W; ++i) {
for (int j = 0; j < 2; ++j) {
cnt[nxt[i][j]] += used[0][i][j];
// used[kB - 1][nxt[i][j]][0] += used[0][i][j];
}
}
reverse(que.begin(), que.end());
for (int i : que) {
if (fail[i] != -1) {
cnt[fail[i]] += cnt[i];
// used[kB - 1][fail[i]][0] += used[kB - 1][i][0];
}
}
for (int i = 0; i < Q; ++i) {
cout << cnt[pos[i]] << "\n";
// cout << used[kB - 1][pos[i]][0] << "\n";
}
return 0;
}
| [
"tu.da.wei@gmail.com"
] | tu.da.wei@gmail.com |
f6ba708df1fffac7c41e4a5f0a291ff47f03ed76 | 27046ecc4b9a8e8d15890691f552440957d25fb6 | /Classes/cgw/WayPoint.h | a867ad31d90767cd68b229c8961b16a794a088ee | [] | no_license | pototao/DefenseTest | def94db1960f2618b5bc2439df5b67148c91180b | 289406d1e9e63fc47ca71593751ce213cb56de78 | refs/heads/master | 2021-01-18T14:10:26.311985 | 2013-05-15T02:09:47 | 2013-05-15T02:09:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 212 | h | #ifndef __TowerDefenseCCX__WayPoint__
#define __TowerDefenseCCX__WayPoint__
#include <iostream>
#include "cocos2d.h"
class WayPoint:public cocos2d::CCNode{
};
#endif /* defined(__TowerDefenseCCX__WayPoint__) */
| [
"classic2008olympic@163.com"
] | classic2008olympic@163.com |
cbb7e04a2f40fa5e17811772b00c5a13da976c0b | a2fd3f4bb49eebfa011a85eab417f0080b1eec0e | /Source/Balanca/DataStructure.cpp | 78eeea2351239f0ac87ebc39acaf68013757b2d5 | [] | no_license | grecabral/starmines | badf04be9640859dacac9a46079d76edd92edbec | c9e050cd36f9a12a4276f4e42d4852bed6d6fa90 | refs/heads/master | 2022-12-12T08:27:17.274836 | 2017-11-08T12:12:25 | 2017-11-08T12:12:25 | 294,151,147 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 201 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "Balanca.h"
#include "DataStructure.h"
DataStructure::DataStructure()
{
}
DataStructure::~DataStructure()
{
}
| [
"csf2@cin.ufpe.br"
] | csf2@cin.ufpe.br |
82f4084b6799f559e920c7905a52e2bd5513b474 | f6f58e522207ee0735d2dcd5c40e25f3729322f2 | /I2C/I2C.ino | 848c1a572314b84206a5a24051757989f7dbf6cf | [] | no_license | ChesangFelister/Electronic_s | 1b6103ce78a5445d01de739d81a068bcd80afe5a | 71e45c5aea475c5ce02c65adb2767e2f3a73b183 | refs/heads/master | 2020-09-05T00:04:12.712019 | 2019-11-06T06:41:57 | 2019-11-06T06:41:57 | 219,929,332 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 320 | ino | #include<Wire.h>
#include<LiquidCrystal_I2C.h>
LiquidCrystal_I2C lcd(0x27,20,4);
//20,4
void setup() {
lcd.init();
lcd.backlight();
Serial.begin(9600);
}
}
void loop() {
if(Serial.available())
{
delay(1000);
lcd.clear();
while(Serial.available()>0){
lcd.write(Serial.read());
}
}
| [
"student"
] | student |
2151a7d989ca17793a03260471b1480a23a7d4a1 | 2fa764b33e15edd3b53175456f7df61a594f0bb5 | /appseed/aura/aura/node/macos/macos_main.cpp | 2ef79eae594ca1276fa033499a7f2aa5e6ed7174 | [] | no_license | PeterAlfonsLoch/app | 5f6ac8f92d7f468bc99e0811537380fcbd828f65 | 268d0c7083d9be366529e4049adedc71d90e516e | refs/heads/master | 2021-01-01T17:44:15.914503 | 2017-07-23T16:58:08 | 2017-07-23T16:58:08 | 98,142,329 | 1 | 0 | null | 2017-07-24T02:44:10 | 2017-07-24T02:44:10 | null | UTF-8 | C++ | false | false | 568 | cpp | #include "framework.h"
#include <crt_externs.h>
CLASS_DECL_AURA int32_t ca2_main();
//CLASS_DECL_BOOT extern fixed_alloc_array * g_pfixedallocaWstring;
//CLASS_DECL_BOOT fixed_alloc_array * new_wstring_manager();
void CLASS_DECL_AURA __cdecl _ca2_purecall()
{
throw simple_exception(::get_thread_app());
}
void __cdecl _null_se_translator(uint32_t uiCode, EXCEPTION_POINTERS * ppointers);
void __cdecl _null_se_translator(uint32_t uiCode, EXCEPTION_POINTERS * ppointers)
{
UNREFERENCED_PARAMETER(uiCode);
UNREFERENCED_PARAMETER(ppointers);
}
| [
"camilo@ca2.email"
] | camilo@ca2.email |
5b3952b625ace9caa3ee4bddc7c818837eb0c56b | c1ff870879152fba2b54eddfb7591ec322eb3061 | /plugins/languageAPI/jsAPI/3rdParty/nodejs/10.1.0/source/deps/v8/src/base/ieee754.h | 72f3db15ef22afa6004b4fad945bc285beb4d0a6 | [
"LicenseRef-scancode-free-unknown",
"MIT",
"ISC",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"Artistic-2.0",
"NAIST-2003",
"BSD-3-Clause",
"Zlib",
"NTP",
"LicenseRef-scancode-openssl",
"ICU",
"LicenseRef-scancode-unicode",
"LicenseRef-scancode-unknown-license-reference",
"bzip2... | permissive | MTASZTAKI/ApertusVR | 1a9809fb7af81c3cd7fb732ed481ebe4ce66fefa | 424ec5515ae08780542f33cc4841a8f9a96337b3 | refs/heads/0.9 | 2022-12-11T20:03:42.926813 | 2019-10-11T09:29:45 | 2019-10-11T09:29:45 | 73,708,854 | 188 | 55 | MIT | 2022-12-11T08:53:21 | 2016-11-14T13:48:00 | C++ | UTF-8 | C++ | false | false | 2,546 | h | // Copyright 2016 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.
#ifndef V8_BASE_IEEE754_H_
#define V8_BASE_IEEE754_H_
#include "src/base/base-export.h"
namespace v8 {
namespace base {
namespace ieee754 {
// Returns the arc cosine of |x|; that is the value whose cosine is |x|.
V8_BASE_EXPORT double acos(double x);
// Returns the inverse hyperbolic cosine of |x|; that is the value whose
// hyperbolic cosine is |x|.
V8_BASE_EXPORT double acosh(double x);
// Returns the arc sine of |x|; that is the value whose sine is |x|.
V8_BASE_EXPORT double asin(double x);
// Returns the inverse hyperbolic sine of |x|; that is the value whose
// hyperbolic sine is |x|.
V8_BASE_EXPORT double asinh(double x);
// Returns the principal value of the arc tangent of |x|; that is the value
// whose tangent is |x|.
V8_BASE_EXPORT double atan(double x);
// Returns the principal value of the arc tangent of |y/x|, using the signs of
// the two arguments to determine the quadrant of the result.
V8_BASE_EXPORT double atan2(double y, double x);
// Returns the cosine of |x|, where |x| is given in radians.
V8_BASE_EXPORT double cos(double x);
// Returns the base-e exponential of |x|.
V8_BASE_EXPORT double exp(double x);
V8_BASE_EXPORT double atanh(double x);
// Returns the natural logarithm of |x|.
V8_BASE_EXPORT double log(double x);
// Returns a value equivalent to |log(1+x)|, but computed in a way that is
// accurate even if the value of |x| is near zero.
V8_BASE_EXPORT double log1p(double x);
// Returns the base 2 logarithm of |x|.
V8_BASE_EXPORT double log2(double x);
// Returns the base 10 logarithm of |x|.
V8_BASE_EXPORT double log10(double x);
// Returns the cube root of |x|.
V8_BASE_EXPORT double cbrt(double x);
// Returns exp(x)-1, the exponential of |x| minus 1.
V8_BASE_EXPORT double expm1(double x);
// Returns the sine of |x|, where |x| is given in radians.
V8_BASE_EXPORT double sin(double x);
// Returns the tangent of |x|, where |x| is given in radians.
V8_BASE_EXPORT double tan(double x);
// Returns the hyperbolic cosine of |x|, where |x| is given radians.
V8_BASE_EXPORT double cosh(double x);
// Returns the hyperbolic sine of |x|, where |x| is given radians.
V8_BASE_EXPORT double sinh(double x);
// Returns the hyperbolic tangent of |x|, where |x| is given radians.
V8_BASE_EXPORT double tanh(double x);
} // namespace ieee754
} // namespace base
} // namespace v8
#endif // V8_BASE_IEEE754_H_
| [
"peter.kovacs@sztaki.mta.hu"
] | peter.kovacs@sztaki.mta.hu |
5107e3afcba0bdcc1cc7733d3bb35ceae92b9f95 | 50a8a3fe0fdffb4141b12b0ee73363f218efc222 | /src/ngap/ngapIEs/GNB-ID.cpp | 0e49796d7388808323b0bf91ca698f91e6c5b8dd | [] | no_license | dukl/fake_gnb | f89972ad50c6a50e620fe8590cece7200d2560da | b6f772e8fb82c61a9949a4f4c317637d97c36fb6 | refs/heads/master | 2022-12-07T21:55:26.285263 | 2020-08-27T07:11:37 | 2020-08-27T07:11:37 | 290,703,480 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,668 | cpp | #include "GNB-ID.hpp"
#include <iostream>
using namespace std;
namespace ngap{
GNB_ID::GNB_ID(){}
GNB_ID::~GNB_ID(){}
void GNB_ID::setValue(uint32_t gnbId)
{
gNBId.id = gnbId;
uint8_t len = 0;
for(uint32_t i = 0x00000001; i<= 0x00000400; i=i<<1,len++)
{
if((i & gnbId))
{
gNBId.biteslen = 32 - len;
break;
}
}
if(!((gNBId.biteslen >= 22)&&(gNBId.biteslen <= 32)))
{
cout<<"[warning][gNBID length out of range]"<<endl;
}
}
bool GNB_ID::encode2bitstring(Ngap_GNB_ID_t &gnbid)
{
gnbid.present = Ngap_GNB_ID_PR_gNB_ID;
if(!(gNBId.biteslen % 8))
gnbid.choice.gNB_ID.size = gNBId.biteslen / 8;
else
gnbid.choice.gNB_ID.size = gNBId.biteslen / 8 + 1;
//printf("m_gNBId.size(%d)\n",m_gNBId.size);
gnbid.choice.gNB_ID.bits_unused = 32 - gNBId.biteslen;
gnbid.choice.gNB_ID.buf = (uint8_t*)calloc(1,4*sizeof(uint8_t));
if(!gnbid.choice.gNB_ID.buf) return false;
gnbid.choice.gNB_ID.buf[3] = gNBId.id & 0x000000ff;
gnbid.choice.gNB_ID.buf[2] = (gNBId.id & 0x0000ff00)>>8;
gnbid.choice.gNB_ID.buf[1] = (gNBId.id & 0x00ff0000)>>16;
gnbid.choice.gNB_ID.buf[0] = (gNBId.id & 0xff000000)>>24;
return true;
}
bool GNB_ID::decodefrombitstring(Ngap_GNB_ID_t &gnbid)
{
if(gnbid.present != Ngap_GNB_ID_PR_gNB_ID) return false;
if(!gnbid.choice.gNB_ID.buf) return false;
gNBId.id = gnbid.choice.gNB_ID.buf[0]<<24;
gNBId.id |= gnbid.choice.gNB_ID.buf[1]<<16;
gNBId.id |= gnbid.choice.gNB_ID.buf[2]<<8;
gNBId.id |= gnbid.choice.gNB_ID.buf[3];
return true;
}
long GNB_ID::getValue()
{
return gNBId.id;
}
}
| [
"du_keliang@163.com"
] | du_keliang@163.com |
126256e59f05fa6be538d55f8e8341df1a2493f9 | 4c25432a6d82aaebd82fd48e927317b15a6bf6ab | /data/dataset_2017/dataset_2017_8_formatted_macrosremoved/kojingharang/8294486_5630967708385280_kojingharang.cpp | c98ef115fbe49396688d36f5baa4e85591a1dccd | [] | no_license | wzj1988tv/code-imitator | dca9fb7c2e7559007e5dbadbbc0d0f2deeb52933 | 07a461d43e5c440931b6519c8a3f62e771da2fc2 | refs/heads/master | 2020-12-09T05:33:21.473300 | 2020-01-09T15:29:24 | 2020-01-09T15:29:24 | 231,937,335 | 1 | 0 | null | 2020-01-05T15:28:38 | 2020-01-05T15:28:37 | null | UTF-8 | C++ | false | false | 2,035 | cpp | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
using namespace std;
template <typename T0, typename T1>
std::ostream &operator<<(std::ostream &os, const map<T0, T1> &v) {
for (typename map<T0, T1>::const_iterator p = v.begin(); p != v.end(); p++) {
os << p->first << ": " << p->second << " ";
}
return os;
}
template <typename T0, typename T1>
std::ostream &operator<<(std::ostream &os, const pair<T0, T1> &v) {
os << v.first << ": " << v.second << " ";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << " ";
}
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const set<T> &v) {
vector<T> tmp(v.begin(), v.end());
os << tmp;
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const deque<T> &v) {
vector<T> tmp(v.begin(), v.end());
os << tmp;
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const vector<vector<T>> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << endl;
}
return os;
}
/*
*/
int main() {
int test_cases;
cin >> test_cases;
long long D, N, K, S;
string s;
for (int ttt = 0, _n = (test_cases); (ttt) < (int)_n; ++ttt) {
cin >> D >> N;
// DD(ttt);
// DD(D);
// DD(N);
long double t = 0;
for (int i = 0, _n = (N); (i) < (int)_n; ++i) {
cin >> K >> S;
long double lt = ((long double)D - K) / S;
// DD(D-K);
// DD(S);
// DD(lt);
// printf("%.9Lf\n", lt);
t = max(t, lt);
}
// DD(t);
long double ans = D / t;
printf("Case #%d: %.9Lf\n", ttt + 1, ans);
// return 0;
}
return 0;
}
| [
"e.quiring@tu-bs.de"
] | e.quiring@tu-bs.de |
8eb86774b97c37d3a6dca4d6a20595155493b634 | 14c4d7b03f45facd76fdabb623488823d95f2bdb | /Arduino/Tests etc/Arduino Sketches/Knightrider/Knightride_Timer/Knightride_Timer.ino | c5f53fd6553631c2c397a16b1b850f07344b856c | [] | no_license | aoifemops/arduinoGame | 47ce45d6dca23456a352eff8b021e02c0f43aac9 | 7a2a907d3a83f85a3c7638ec218e50e33aa2caaf | refs/heads/master | 2021-01-19T00:47:09.048178 | 2017-04-04T16:23:42 | 2017-04-04T16:23:42 | 87,207,814 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,260 | ino | /* Knight Rider 1 */
int pin8 = 8;
int pin9 = 9;
int pin10 = 10;
int pin11 = 11;
int pin12 = 12;
int pin13 = 13;
int timer = 150;
void setup(){
pinMode(pin8, OUTPUT);
pinMode(pin9, OUTPUT);
pinMode(pin10, OUTPUT);
pinMode(pin11, OUTPUT);
pinMode(pin12, OUTPUT);
pinMode(pin13, OUTPUT);
}
void loop() {
digitalWrite(pin8, HIGH);
delay(timer);
digitalWrite(pin8, LOW);
delay(timer);
digitalWrite(pin9, HIGH);
delay(timer);
digitalWrite(pin9, LOW);
delay(timer);
digitalWrite(pin10, HIGH);
delay(timer);
digitalWrite(pin10, LOW);
delay(timer);
digitalWrite(pin11, HIGH);
delay(timer);
digitalWrite(pin11, LOW);
delay(timer);
digitalWrite(pin12, HIGH);
delay(timer);
digitalWrite(pin12, LOW);
delay(timer);
digitalWrite(pin13, HIGH);
delay(timer);
digitalWrite(pin13, LOW);
delay(timer);
digitalWrite(pin12, HIGH);
delay(timer);
digitalWrite(pin12, LOW);
delay(timer);
digitalWrite(pin11, HIGH);
delay(timer);
digitalWrite(pin11, LOW);
delay(timer);
digitalWrite(pin10, HIGH);
delay(timer);
digitalWrite(pin10, LOW);
delay(timer);
digitalWrite(pin9, HIGH);
delay(timer);
digitalWrite(pin9, LOW);
delay(timer);
}
| [
"noreply@github.com"
] | aoifemops.noreply@github.com |
ffdf5a38604a68836319fcbb1f473d50e42bbb92 | 5e8d200078e64b97e3bbd1e61f83cb5bae99ab6e | /main/source/src/protocols/loops/LoopsFileLoader.hh | 4def6c46887de197f9df460f7e1cca787b9c3244 | [] | no_license | MedicaicloudLink/Rosetta | 3ee2d79d48b31bd8ca898036ad32fe910c9a7a28 | 01affdf77abb773ed375b83cdbbf58439edd8719 | refs/heads/master | 2020-12-07T17:52:01.350906 | 2020-01-10T08:24:09 | 2020-01-10T08:24:09 | 232,757,729 | 2 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 2,222 | hh | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the contributing members of the Rosetta Commons.
// (c) For more information, see http://www.rosettacommons.org. Questions about this can be
// (c) addressed to University of Washington CoMotion, email: license@uw.edu.
/// @file protocols/loops/LoopsFileLoader.hh
/// @brief
/// @author
#ifndef INCLUDED_protocols_loops_LoopsFileLoader_HH
#define INCLUDED_protocols_loops_LoopsFileLoader_HH
//unit headers
#include <protocols/loops/LoopsFileLoader.fwd.hh>
//project headers
#include <basic/resource_manager/ResourceLoader.hh>
#include <basic/resource_manager/types.hh>
//utility headers
#include <utility/pointer/ReferenceCount.hh>
#include <utility/tag/Tag.fwd.hh>
#include <utility/tag/XMLSchemaGeneration.fwd.hh>
//C++ headers
#include <istream>
namespace protocols {
namespace loops {
/// @brief %LoopsFileLoader constructs a LoopsFileData instance from data provided by the %ResourceManager.
/// @details The %LoopsFileLoader is given an istream containing the information in a %LoopsFile from the
/// ResourceManager. This information is then processed by an instance of LoopsFileIO to produce a LoopsFileDataOP to
/// return to the protocol.
class LoopsFileLoader : public basic::resource_manager::ResourceLoader
{
public:
/// @brief Construct the %LoopsFileLoader.
LoopsFileLoader();
/// @brief Destructor.
~LoopsFileLoader() override;
/// @brief Return a LoopsFileDataOP constructed from the given input stream (istream).
basic::resource_manager::ResourceCOP
create_resource(
basic::resource_manager::ResourceManager & resource_manager,
utility::tag::TagCOP resource_tag,
std::string const & input_id,
std::istream & input_stream
) const override;
static
std::string
classname();
static
void
provide_xml_schema( utility::tag::XMLSchemaDefinition & xsd );
};
} // namespace loops
} // namespace protocols
#endif //INCLUDED_protocols_loops_LoopsFileLoader_HH
| [
"36790013+MedicaicloudLink@users.noreply.github.com"
] | 36790013+MedicaicloudLink@users.noreply.github.com |
e34427a9c9bdac75f005f4bd54c97495d00506c8 | c3a0f82e6d0fb3e8fb49afc042560e5787e42141 | /codeforces/468/B.cpp | ad52d534a2eeeba51ebe0a14bd86ae5b8c40fa6f | [] | no_license | SahajGupta11/Codeforces-submissions | 04abcd8b0632e7cdd2748d8b475eed152d00ed1b | 632f87705ebe421f954a59d99428e7009d021db1 | refs/heads/master | 2023-02-05T08:06:53.500395 | 2019-09-18T16:16:00 | 2020-12-22T14:32:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,875 | cpp | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
// #define int long long
using namespace std;
#define e "\n"
#define endl "\n"
#define Tp template<class T>
#define Tp2 template<class T1, class T2>
#define Tps template<class T, class... Ts>
#define Tps2 template<class T1, class T2, class... Ts>
#define ff first
#define ss second
#define rev(Aa) reverse(Aa.begin(),Aa.end())
#define all(Aa) Aa.begin(),Aa.end()
#define lb lower_bound
#define ub upper_bound
#define rsz resize
#define ins insert
#define mp make_pair
#define pb emplace_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define sz(Xx) (int)(Xx).size()
typedef long long ll;
typedef long double ld;
typedef double db;
using pii = pair<int, int>;
const int MOD = 1000000007; //1e9 + 7
const int INF = 2000000000; //2e9
const ll DESPACITO = 1000000000000000000; //1e18
namespace minmax {
Tp T max(T&& A) { return A; }
Tp T min(T&& A) { return A; }
Tp T max(T&& A, T&& B) { return A>B?A:B; }
Tp T chmin2(T&& A, T&& B) { return A<B?A:B; }
Tps T max(T&& A, Ts&&... ts) { T B = max(ts...); return A>B?A:B; }
Tps T min(T&& A, Ts&&... ts) { T B = min(ts...); return A<B?A:B; }
Tps T chmax(T&& A, Ts&&... ts) { A = max(A, ts...); return A; }
Tps T chmin(T&& A, Ts&&... ts) { A = min(A, ts...); return A; }
Tp2 void chmin2(T1&& A, T2&& Aa, T1&& B, T2&& Bb) { if(B < A) A = B, Aa = Bb; }
Tp2 void chmax2(T1&& A, T2&& Aa, T1&& B, T2&& Bb) { if(B > A) A = B, Aa = Bb; }
}
namespace input {
Tp void re(T&& Xx) { cin >> Xx; }
Tp2 void re(pair<T1,T2>& Pp) { re(Pp.first); re(Pp.second); }
Tp void re(vector<T>& Aa) { for(int i = 0; i < sz(Aa); i++) re(Aa[i]); }
Tp2 void rea(T1&& Aa, T2 t) { for(int i = 0; i < t; i++) re(Aa[i]); }
Tps2 void rea(T1&& Aa, T2 t, Ts&&... ts) { rea(Aa, t); rea(ts...); }
Tp2 void rea1(T1&& Aa, T2 t) { for(int i = 1; i <= t; i++) re(Aa[i]); }
Tps2 void rea1(T1&& Aa, T2 t, Ts&... ts) { rea1(Aa, t); rea1(ts...); }
Tps void re(T&& t, Ts&... ts) { re(t); re(ts...); }
}
namespace output {
void pr(int32_t Xx) { cout << Xx; }
// void pr(num Xx) { cout << Xx; }
void pr(bool Xx) { cout << Xx; }
void pr(long long Xx) { cout << Xx; }
void pr(long long unsigned Xx) { cout << Xx; }
void pr(double Xx) { cout << Xx; }
void pr(char Xx) { cout << Xx; }
void pr(const string& Xx) { cout << Xx; }
void pr(const char* Xx) { cout << Xx; }
void pr(const char* Xx, size_t len) { cout << string(Xx, len); }
void ps() { cout << endl; }
void pn() { /*do nothing*/ }
void pw() { pr(" "); }
void pc() { pr("]"); ps(); }
Tp2 void pr(const pair<T1,T2>& Xx) { pr(Xx.first); pw(); pr(Xx.second);}
Tp void pr(const T&);
bool parse(const char* t) { if(t == e) return true; return false;}
Tp bool parse(T&& t) { return false;}
Tp2 bool parsepair(const pair<T1,T2>& Xx) { return true; }
Tp bool parsepair(T&& t) { return false;}
Tp2 void psa(T1&& Aa, T2 t) { for(int i = 0; i < t; i++) pr(Aa[i]), pw(); ps(); }
Tp2 void pna(T1&& Aa, T2 t) { for(int i = 0; i < t; i++) pr(Aa[i]), ps(); }
Tp2 void psa2(T1&& Aa, T2 t1, T2 t2) { for(int i = 0; i < t1; i++) {for(int j = 0; j < t2; j++) pr(Aa[i][j]), pw(); ps();} }
Tp void pr(const T& Xx) { if(!sz(Xx)) return; bool fst = 1; bool op = 0; if (parsepair(*Xx.begin())) op = 1; for (const auto& Aa: Xx) {if(!fst) pw(); if(op) pr("{"); pr(Aa), fst = 0; if(op) pr("}"); } }
Tps void pr(const T& t, const Ts&... ts) { pr(t); pr(ts...); }
Tps void ps(const T& t, const Ts&... ts) { pr(t); if (sizeof...(ts)) {if (!parse(t)) pw(); } ps(ts...); }
Tp void pn(const T& t) { for (const auto& Aa: t) ps(Aa); }
Tps void pw(const T& t, const Ts&... ts) { pr(t); if (sizeof...(ts)) pw(); pw(ts...); }
Tps void pc(const T& t, const Ts&... ts) { bool op = 0; if (parsepair(t)) op = 1; if(op) pr("{"); pr(t); if(op) pr("}"); if (sizeof...(ts)) pr(", "); pc(ts...); }
namespace trace {
#define tr(Xx...) pr("[",#Xx,"] = ["), pc(Xx);
#define tra(Xx, y...) __f0(#Xx, Xx, y)
#define tran(Xx, n) __fn(n, #Xx, Xx) // TO DO~ variadic multidimensional
Tp2 void __f(const char* name, const T1& Xx, const T2& y){ pr("[",y,"] = "); ps(Xx); }
Tps2 void __f(const char* name, const T1& Xx, const T2& y, const Ts&... rest){ const char *open = strchr(name, '['); pr("[",y,"]"); __f(open+1, Xx, rest...); }
Tps2 void __f0(const char* name, const T1& Xx, const T2& y, const Ts&... rest){ const char *open = strchr(name, '['); pr(name, size_t(open-name)); __f(name, Xx, y, rest...); }
Tp void __fn(int n, const char* name, const T& Xx) { for(int i = 0; i < n; i++) pr(name), __f(name, Xx[i], i); }
}
}
using namespace minmax;
using namespace input;
using namespace output;
using namespace output::trace;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5 + 5;
int nums[N];
struct Two_SAT {
int n, m, sccount = 0; bool ok = 1;
vector<vector<int>> g, rg;
vector<int> comp, assignment;
vector<bool> vis;
stack<int> st;
Two_SAT (int _n) {
n = 2*_n;
vis.rsz(n);
comp.rsz(n);
g.rsz(n);
rg.rsz(n);
}
void addedge(int u, int v) {
g[u].pb(v);
rg[v].pb(u);
}
void dfs1(int v) {
vis[v] = 1;
for (auto x: g[v])
if (!vis[x]) dfs1(x);
st.push(v);
}
void dfs2(int v, int k) {
comp[v] = k;
for (auto& x: rg[v])
if(!comp[x]) dfs2(x, k);
}
// Kosaraju's SCC
void scc() {
int i;
for(i = 0; i < n; i++)
if(!vis[i]) dfs1(i);
while(!st.empty()) {
sccount++;
dfs2(st.top(), sccount);
while(!st.empty() and comp[st.top()]) st.pop();
}
}
bool is_sat() {
scc();
assignment.rsz(n);
for(int i = 0; i < n; i++) {
if(comp[i] == comp[i^1]) ok = 0;
assignment[i] = !(comp[i] > comp[i^1]);
}
return ok;
}
};
int32_t main() {
IOS;
int i, n, a, b;
re(n, a, b);
Two_SAT o(n);
map<int,int> idx;
for(i = 0; i < n; i++) {
re(nums[i]);
idx[nums[i]] = i;
}
for(i = 0; i < n; i++) {
int x = nums[i];
if(idx.count(a-x)) {
o.addedge(2*i, 2*idx[a-x]);
o.addedge(2*i^1, 2*idx[a-x]^1);
}
else
o.addedge(2*i, 2*i^1);
if(idx.count(b-x)) {
o.addedge(2*i, 2*idx[b-x]);
o.addedge(2*i^1, 2*idx[b-x]^1);
}
else
o.addedge(2*i^1, 2*i);
}
if(!o.is_sat())
return ps("NO"), 0;
ps("YES");
for(i = 0; i < n; i++)
pw(o.assignment[2*i]);
return 0;
} | [
"ghriday.bits@gmail.com"
] | ghriday.bits@gmail.com |
4808f28dd6344cafc8271166a39dcd17d48835fc | fb7efe44f4d9f30d623f880d0eb620f3a81f0fbd | /third_party/WebKit/Source/modules/webgl/WebGLContextEvent.cpp | 4be21ce2a8800febcbf0c6b314b2f64fcadde2fd | [
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"MIT",
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer",
"LGPL-2.1-only",
"GPL-2.0-only",
"LGPL-2.0-only",
"BSD-2-Clause",
"LicenseRef-scancode-other-copyleft",
"BSD-3-Clause"
] | permissive | wzyy2/chromium-browser | 2644b0daf58f8b3caee8a6c09a2b448b2dfe059c | eb905f00a0f7e141e8d6c89be8fb26192a88c4b7 | refs/heads/master | 2022-11-23T20:25:08.120045 | 2018-01-16T06:41:26 | 2018-01-16T06:41:26 | 117,618,467 | 3 | 2 | BSD-3-Clause | 2022-11-20T22:03:57 | 2018-01-16T02:09:10 | null | UTF-8 | C++ | false | false | 2,276 | cpp | /*
* Copyright (C) 2010 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "modules/webgl/WebGLContextEvent.h"
namespace blink {
WebGLContextEvent::WebGLContextEvent() {}
WebGLContextEvent::WebGLContextEvent(const AtomicString& type,
bool can_bubble,
bool cancelable,
const String& status_message)
: Event(type, can_bubble, cancelable), status_message_(status_message) {}
WebGLContextEvent::WebGLContextEvent(const AtomicString& type,
const WebGLContextEventInit& initializer)
: Event(type, initializer) {
if (initializer.hasStatusMessage())
status_message_ = initializer.statusMessage();
}
WebGLContextEvent::~WebGLContextEvent() {}
const AtomicString& WebGLContextEvent::InterfaceName() const {
return EventNames::WebGLContextEvent;
}
DEFINE_TRACE(WebGLContextEvent) {
Event::Trace(visitor);
}
} // namespace blink
| [
"jacob-chen@iotwrt.com"
] | jacob-chen@iotwrt.com |
5f46d4d68b526ef933906edc7baeef2227c6c817 | c12c8522d04f2a7db0df8dd887004c12c55d0e28 | /C++基础08/6 如何定义一个函数指针/6 如何定义一个函数指针.cpp | 84e5802996d273a807ed9a42806e7f85af3993da | [] | no_license | chicocao/CppBase | b451990fed72c87209f3ab6ea88cc663a504b708 | b4037d954166092305e8e1c2261c7f3316f0676c | refs/heads/master | 2022-02-18T13:08:32.022932 | 2018-12-20T12:59:24 | 2018-12-20T12:59:24 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,146 | cpp | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
//定义一个函数
int func(int a, int b) {
cout << "func1" << endl;
return 0;
}
//定义一个函数指针
// C语言中 决定一个函数类型
// 返回值 参数列表
typedef int(FUNC)(int, int);//定义一个函数类型
typedef int(*FUNC_POINTER)(int, int);//定义一个函数指针类型
//如何将一个函数指针当成一个函数参数呢？
void my_function(FUNC *fp) {
fp(1, 2);
}
void my_function2(FUNC_POINTER fp) {
fp(1, 2);
}
void my_function3(int(*fp)(int, int)) {
cout << "1999 年写的架构" << endl;
cout << "固定业务1" << endl;
fp(10, 20);
cout << "固定业务2" << endl;
}
//2015 实现一个子函数
int my_new_function(int a, int b)
{
cout << a << b << endl;
cout << "2015年实现的新业务" << endl;
return 0;
}
int main(void)
{
FUNC *p = func;
FUNC_POINTER p2 = func;
int(*fp)(int, int) = func;
p(1, 2);
(*p)(1, 2);//这两者等价
p2(1, 2);
(*p2)(1, 2);
fp(1, 2);
(*fp)(1, 2);
cout << " -------- " << endl;
//2015 实现一个子函数，再调用1999的架构
my_function3(my_new_function);
} | [
"2467697276@qq.com"
] | 2467697276@qq.com |
20566807967bdae95d63d5a29402256e5af1e377 | 3670f2ca6f5609e14cce8c31cb1348052d0b6358 | /xacro/gazebo_ros_pkgs/gazebo_plugins/src/gazebo_ros_wheel_slip.cpp | e4abedfebbf0c4fe36cf8954118ba068301e3d74 | [] | no_license | jincheng-ai/ros-melodic-python3-opencv4 | b0f4d3860ab7ae3d683ade8aa03e74341eff7fcf | 47c74188560c2274b8304647722d0c9763299a4b | refs/heads/main | 2023-05-28T17:37:34.345164 | 2021-06-17T09:59:25 | 2021-06-17T09:59:25 | 377,856,153 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,557 | cpp | /*
* Copyright (C) 2017 Open Source Robotics Foundation
*
* 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 <gazebo/physics/World.hh>
#include <gazebo/physics/Model.hh>
#include <sdf/sdf.hh>
#include "gazebo_plugins/gazebo_ros_wheel_slip.h"
namespace gazebo
{
// Register this plugin with the simulator
GZ_REGISTER_MODEL_PLUGIN(GazeboRosWheelSlip)
/////////////////////////////////////////////////
GazeboRosWheelSlip::GazeboRosWheelSlip()
{
}
/////////////////////////////////////////////////
GazeboRosWheelSlip::~GazeboRosWheelSlip()
{
// Custom Callback Queue
this->queue_.clear();
this->queue_.disable();
delete this->dyn_srv_;
this->rosnode_->shutdown();
delete this->rosnode_;
}
/////////////////////////////////////////////////
void GazeboRosWheelSlip::configCallback(
gazebo_plugins::WheelSlipConfig &config, uint32_t level)
{
if (level == ~0)
{
// don't overwrite initial parameters
return;
}
ROS_INFO_NAMED("wheel_slip", "Reconfigure request for the gazebo ros wheel_slip: %s. New slip compliances, lateral: %.3e, longitudinal: %.3e",
this->GetParentModel()->GetScopedName().c_str(),
config.slip_compliance_unitless_lateral,
config.slip_compliance_unitless_longitudinal);
this->SetSlipComplianceLateral(config.slip_compliance_unitless_lateral);
this->SetSlipComplianceLongitudinal(config.slip_compliance_unitless_longitudinal);
}
/////////////////////////////////////////////////
// Load the controller
void GazeboRosWheelSlip::Load(physics::ModelPtr _parent, sdf::ElementPtr _sdf)
{
// Load the plugin
WheelSlipPlugin::Load(_parent, _sdf);
if (_sdf->HasElement("robotNamespace"))
{
this->robotNamespace_ = _sdf->Get<std::string>("robotNamespace") + "/";
}
if (this->robotNamespace_.empty() ||
this->robotNamespace_ == "/" ||
this->robotNamespace_ == "//")
{
this->robotNamespace_ = "wheel_slip/";
}
this->robotNamespace_ = _parent->GetName() + "/" + this->robotNamespace_;
// Init ROS
if (!ros::isInitialized())
{
ROS_FATAL_STREAM_NAMED("wheel_slip", "Not loading plugin since ROS hasn't been "
<< "properly initialized. Try starting gazebo with ros plugin:\n"
<< " gazebo -s libgazebo_ros_api_plugin.so\n");
return;
}
this->rosnode_ = new ros::NodeHandle(this->robotNamespace_);
// set up dynamic reconfigure
dyn_srv_ =
new dynamic_reconfigure::Server<gazebo_plugins::WheelSlipConfig>
(*this->rosnode_);
dynamic_reconfigure::Server<gazebo_plugins::WheelSlipConfig>
::CallbackType f =
boost::bind(&GazeboRosWheelSlip::configCallback, this, _1, _2);
dyn_srv_->setCallback(f);
// Custom Callback Queue
this->callbackQueueThread_ =
boost::thread(boost::bind(&GazeboRosWheelSlip::QueueThread, this));
}
/////////////////////////////////////////////////
void GazeboRosWheelSlip::QueueThread()
{
static const double timeout = 0.01;
while (this->rosnode_->ok())
{
this->queue_.callAvailable(ros::WallDuration(timeout));
}
}
}
| [
"shuyuanhao@cetiti.com"
] | shuyuanhao@cetiti.com |
772f0aab32b14ad799223fe882a795e5666e77d7 | ee07962fca45a856e147d0b7abd15108e004f9de | /client/src/include/particleSystem.h | ad9f99bb121c87b59cb7f91b9f569b493ecf6217 | [] | no_license | AzP/LudumDare24 | 6dffc42c1b8e75678580682ee6fa902494e3fc9b | 1e8aa09b2b3f5c90191b609b9212f4ebdb0c9a9e | refs/heads/master | 2020-04-09T00:38:46.975544 | 2013-03-03T21:53:42 | 2013-03-03T21:53:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 463 | h | #ifndef PARTICLESYSTEM_H
#define PARTICLESYSTEM_H
#include "device.h"
#include <irrlicht.h>
#include <vector>
using namespace std;
using namespace irr;
class CParticleSystem
{
public:
CParticleSystem(CDevice& device, ITriangleSelector* selector);
void createExplosion(const vector3df&);
private:
//std::vector<CParticleSystem*> m_explosions;
CDevice& m_device;
ITriangleSelector* m_terrainSelector;
ISceneCollisionManager* m_collisionMgr;
};
#endif
| [
"peter.azp@gmail.com"
] | peter.azp@gmail.com |
0fe012ddfd96fbad6cab60c978518d085de8ba3b | e29b00487669bdbd26faa33960ba0de83c5d771f | /array_list.cpp | 2f0d1ae55493a35f098a4bd12c0767546bdbf127 | [] | no_license | FeriXue/algorithm | 0a7cd9029dccdb23b3fa0d590f70fb9297fbec50 | adbb74cab749f9fa72298ca72f0d6b00527e9c80 | refs/heads/master | 2023-03-30T22:05:00.201852 | 2021-04-10T04:32:02 | 2021-04-10T04:32:02 | 318,991,219 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,759 | cpp | #include <iostream>
#include <unistd.h>
using namespace std;
const int N = 1e5 + 10;
int l[N], r[N], value[N];
int now_in;
void init()
{
r[0] = 1;
l[0] = -1;
l[1] = 0;
r[1] = -1;
now_in = 2;
}
//在下标为k的点的右边插入x；
void insert(int k, int x)
{
value[now_in] = x;
r[now_in] = r[k];
l[now_in] = k;
l[r[k]] = now_in;
r[k] = now_in++;
}
void zleft_insert(int x)
{
insert(0, x);
}
void zright_insert(int x)
{
insert(l[1], x);
}
// 删除第k个点；
void delete_one(int k)
{
r[l[k]] = r[k];
l[r[k]] = l[k];
}
int main()
{
init();
int m = 0;
cin >> m;
string op;
int k = 0, x = 0;
while (m--) {
cin >> op;
if (op == "L") {
cin >> x;
zleft_insert(x);
} else if (op == "R") {
cin >> x;
zright_insert(x);
} else if (op == "D") {
cin >> k;
delete_one(k + 1);
} else if (op == "IL") {
cin >> k >> x;
insert(l[(k + 1)], x);
} else if (op == "IR"){
cin >> k >> x;
insert(k + 1, x);
}
}
for (int i = r[0]; i != 1; i = r[i]) {
cout << value[i] << " ";
}
cout << endl;
return 0;
}
| [
"2567219039@qq.com"
] | 2567219039@qq.com |
5c3532be3d06f25e174d3f319d9db4ae17e3a9fd | 55e664afa0a7744b3f5e813f35c3395307c12456 | /AsteroidGameOpenGL/main.cpp | b06cd163e285daffbd3256de9a5b9e52ffdf3b3f | [] | no_license | FutureProg/AsteroidGameOpenGL | 12cc6080e1ed5b34a72af1a0f2fd74444a1334d0 | 168ddddd756c051621b6e2ff3521bd2c36edc6cc | refs/heads/master | 2016-09-02T05:45:35.861754 | 2015-01-11T21:27:27 | 2015-01-11T21:27:27 | 29,106,684 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 778 | cpp | //
// main.cpp
// AsteroidGameOpenGL
//
// Created by Nickolas Morrison on 2014-11-02.
// Copyright (c) 2014 Nickolas Morrison. All rights reserved.
//
#include <stdio.h>
#include "GameWindow.h"
#include "Entities.h"
int main(int argc, const char * argv[]) {
GLint glfwstatus = glfwInit();
if (glfwstatus != GL_TRUE) {
glfwTerminate();
throw "Unable to initialize GLFW!";
}
char name[] = "Asteroid Game";
GameWindow game(name,500,500);
Rocket rocket(glm::vec3(0.f,0.f,0.f));
rocket.setID("rocket");
Entity::Collider col = Entity::Collider(20,0,60,50);
col.makeCircle(50, glm::vec3(50.f,50.f,0.f));
rocket.addCollider(col);
game.init();
game.instantiate(rocket);
return game.execute();
}
| [
"nickmorrison09@gmail.com"
] | nickmorrison09@gmail.com |
b92fb66c77cb4c483849ed445e6f5454e773e157 | 4d970b256d83615117e3ffb714f2fee19de2a0cd | /C++做足一百/qz88-TEXT_EDITOR/LINE.CPP | 87f303f7884fc6c52f77a4ca3e54aeeb65526e8e | [] | no_license | liyvwen/CollegeProgram | 10519770af386032a9dc76f5c8927005b6e45a03 | a95c1e7d3794337aa08602d2ecae0ce33b771089 | refs/heads/master | 2021-05-28T07:40:28.733594 | 2014-03-24T15:37:44 | 2014-03-24T15:37:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,702 | cpp | #include <iostream>
using namespace std;
#include "LINE.H"
LINE::LINE(int line_size)
{
if(line_size <= 0)
{
line_size = INIT_LINE_SIZE;
}
this->line_size = line_size;
line_length = 0;
str = new MyString(this->line_size);
}
LINE::LINE(const LINE& x)
{
line_size = x.line_size;
line_length = x.line_length;
str = new MyString(line_size);
*str = *(x.str);
}
LINE::~LINE()
{
delete [] str;
}
const LINE& LINE::operator =(const LINE& x)
{
if(this != &x)
{
line_size = x.line_size;
line_length = x.line_length;
*str = *(x.str);
}
return *this;
}
void LINE::Input()
{
char c;
line_length = 0;
do
{
c = cin.get();
if(c != '\n')
{
str->Append(c);
line_length ++;
}
}
while(c != '\n' && !IsFull());
cin.sync();
}
void LINE::Append(char c)
{
if(!IsFull() && c != '\n')
{
str->Append(c);
line_length ++;
}
}
/*
istream& operator >>(istream& in, const LINE& x)
{
char c;
UINT i = 0;
while(c = getchar(), c!= '\n' && i < length)
{
line.Append(c);
}
}
*/
void LINE::Output()const
{
str->Output();
cout << endl;
}
/*
ostream& operator <<(ostream& out, const LINE& x)
{
line.Output();
cout << endl;
}
*/
UINT LINE::Length()const
{
return line_length;
}
char LINE::operator[](int pos)const
{
return (*str)[pos];
}
bool LINE::IsFull()const
{
return line_length == line_size;
}
bool LINE::IsEmpty()const
{
return line_length == 0;
}
void LINE::Clear()
{
line_length = 0;
}
| [
"CharellkingQu@gmail.com"
] | CharellkingQu@gmail.com |
b8a3f7deb684ee8429ea6ba2f8e85f5fb3e3d20b | de97899cfe3a78a2d6fa45f394ae932dae51d01f | /software/Firmware/applications/params.cpp | 86e7cfcde05de35d5045b3f09315c6a0af10c337 | [] | no_license | nongxiaoming/Hexacopter_LPC1549 | f1a66ddba78acd95e3641dbc734bf4cf6b8791d3 | 1fd2434b39fd2cf7b54eea89b012056d1d62c176 | refs/heads/master | 2020-06-04T05:48:34.529703 | 2015-06-03T13:41:36 | 2015-06-03T13:41:36 | 31,605,217 | 0 | 3 | null | null | null | null | GB18030 | C++ | false | false | 4,269 | cpp | /******************** (C) COPYRIGHT 2014 ANO Tech ***************************
* 作者 ：匿名科创
* 文件名 ：ANO_Param.cpp
* 描述 ：参数读取和保存
* 官网 ：www.anotc.com
* 淘宝 ：anotc.taobao.com
* 技术Q群 ：190169595
**********************************************************************************/
#include "params.h"
#include "pidctrl.h"
#include "sensor.h"
#include "string.h"
#include "drv_eeprom.h"
#define PARAMS_SAVE_ADDRESS ((uint32_t)0x00)
static params_t params;
static bool Params_Read(void);
void Params_Init(void)
{
if(Params_Read()==true)
{
fc.pid_group[PIDROLL].kD = params.roll_pid.kd;
fc.pid_group[PIDROLL].kI = params.roll_pid.ki;
fc.pid_group[PIDROLL].kP = params.roll_pid.kp;
fc.pid_group[PIDPITCH].kD = params.pitch_pid.kd;
fc.pid_group[PIDPITCH].kI = params.pitch_pid.ki;
fc.pid_group[PIDPITCH].kP = params.pitch_pid.kp;
fc.pid_group[PIDYAW].kD = params.yaw_pid.kd;
fc.pid_group[PIDYAW].kI = params.yaw_pid.ki;
fc.pid_group[PIDYAW].kP = params.yaw_pid.kp;
fc.pid_group[PIDALT].kD = params.alt_pid.kd;
fc.pid_group[PIDALT].kI = params.alt_pid.ki;
fc.pid_group[PIDALT].kP = params.alt_pid.kp;
fc.pid_group[PIDLEVEL].kD = params.level_pid.kd;
fc.pid_group[PIDLEVEL].kI = params.level_pid.ki;
fc.pid_group[PIDLEVEL].kP = params.level_pid.kp;
fc.pid_group[PIDMAG].kD = params.mag_pid.kd;
fc.pid_group[PIDMAG].kI = params.mag_pid.ki;
fc.pid_group[PIDMAG].kP = params.mag_pid.kp;
sensor.Acc_Offset = params.acc_offset;
sensor.Gyro_Offset = params.gyro_offset;
}else
{
params.roll_pid.kd = fc.pid_group[PIDROLL].kD ;
params.roll_pid.ki = fc.pid_group[PIDROLL].kI ;
params.roll_pid.kp = fc.pid_group[PIDROLL].kP;
params.pitch_pid.kd = fc.pid_group[PIDPITCH].kD ;
params.pitch_pid.ki = fc.pid_group[PIDPITCH].kI ;
params.pitch_pid.kp = fc.pid_group[PIDPITCH].kP ;
params.yaw_pid.kd = fc.pid_group[PIDYAW].kD ;
params.yaw_pid.ki = fc.pid_group[PIDYAW].kI ;
params.yaw_pid.kp = fc.pid_group[PIDYAW].kP ;
params.alt_pid.kd = fc.pid_group[PIDALT].kD ;
params.alt_pid.ki = fc.pid_group[PIDALT].kI ;
params.alt_pid.kp = fc.pid_group[PIDALT].kP ;
params.level_pid.kd = fc.pid_group[PIDLEVEL].kD ;
params.level_pid.ki = fc.pid_group[PIDLEVEL].kI ;
params.level_pid.kp = fc.pid_group[PIDLEVEL].kP;
params.mag_pid.kd = fc.pid_group[PIDMAG].kD ;
params.mag_pid.ki = fc.pid_group[PIDMAG].kI;
params.mag_pid.kp = fc.pid_group[PIDMAG].kP ;
params.acc_offset = sensor.Acc_Offset ;
params.gyro_offset = sensor.Gyro_Offset ;
Params_Save();
}
}
void Params_setAccOffset(Vector3i offset)
{
params.acc_offset = offset;
sensor.Acc_Offset = offset;
}
void Params_setGyroOffset(Vector3i offset)
{
params.gyro_offset = offset;
sensor.Gyro_Offset = offset;
}
void Params_setRollPid(pid_t val)
{
params.roll_pid = val;
fc.pid_group[PIDROLL].kD = val.kd;
fc.pid_group[PIDROLL].kI = val.ki;
fc.pid_group[PIDROLL].kP = val.kp;
}
void Params_setPitchPid(pid_t val)
{
params.pitch_pid = val;
fc.pid_group[PIDPITCH].kD = val.kd;
fc.pid_group[PIDPITCH].kI = val.ki;
fc.pid_group[PIDPITCH].kP = val.kp;
}
void Params_setYawPid(pid_t val)
{
params.yaw_pid = val;
fc.pid_group[PIDYAW].kD = val.kd;
fc.pid_group[PIDYAW].kI = val.ki;
fc.pid_group[PIDYAW].kP = val.kp;
}
void Params_setAltPid(pid_t val)
{
params.alt_pid = val;
fc.pid_group[PIDALT].kD = val.kd;
fc.pid_group[PIDALT].kI = val.ki;
fc.pid_group[PIDALT].kP = val.kp;
}
void Params_setLevelPid(pid_t val)
{
params.level_pid = val;
fc.pid_group[PIDLEVEL].kD = val.kd;
fc.pid_group[PIDLEVEL].kI = val.ki;
fc.pid_group[PIDLEVEL].kP = val.kp;
}
void Params_setMagPid(pid_t val)
{
params.mag_pid = val;
fc.pid_group[PIDMAG].kD = val.kd;
fc.pid_group[PIDMAG].kI = val.ki;
fc.pid_group[PIDMAG].kP = val.kp;
}
bool Params_Read(void)
{
uint8_t *data;
data = (uint8_t *)¶ms;
EEPROM_Read(PARAMS_SAVE_ADDRESS,data,sizeof(params_t));
if(params.magic != MAGIC)
{
return false;
}
return true;
}
void Params_Save(void)
{
uint8_t *data;
params.magic = MAGIC;
data = (uint8_t *)¶ms;
EEPROM_Write(PARAMS_SAVE_ADDRESS,data,sizeof(params_t));
}
| [
"nongxiaoming@gmail.com"
] | nongxiaoming@gmail.com |
18a5d2bac241a16725632afd2ad6649e6d8c79c5 | ab1f3ee37ed5a263f0f77c7acb8dbf4032888df6 | /Battle_Tank/Source/Battle_Tank/Private/TankMovementComponent.cpp | dcbb5e1f9385757991f9cfd06b163ba16a3b9e69 | [] | no_license | mikolicsreka/TankBattle | d23bbd71f54193493687a770eb95e5cf86824188 | c82f2f5d5990e25669061c9b0c3ea5fe3e587a60 | refs/heads/master | 2022-09-05T23:05:14.972418 | 2020-05-27T14:12:23 | 2020-05-27T14:12:23 | 265,258,653 | 0 | 0 | null | null | null | null | WINDOWS-1250 | C++ | false | false | 1,276 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "TankMovementComponent.h"
#include "TankTrack.h"
void UTankMovementComponent::Initialize(UTankTrack* LeftTrackToSet, UTankTrack* RightTrackToSet)
{
LeftTrack = LeftTrackToSet;
RightTrack = RightTrackToSet;
}
void UTankMovementComponent::IntendTurnRight(float Throttle)
{
if (!ensure(LeftTrack && RightTrack))
{
return;
}
LeftTrack->SetThrottle(-Throttle);
RightTrack->SetThrottle(Throttle);
}
void UTankMovementComponent::RequestDirectMove(const FVector& MoveVelocity, bool bForceMaxSpeed)
{
//No need to call super as we're replacing the functionality
auto TankName = GetOwner()->GetName();
auto TankForward = GetOwner()->GetActorForwardVector().GetSafeNormal();
auto AIForwardIntention = MoveVelocity.GetSafeNormal();
auto ForwardThrow = FVector::DotProduct(TankForward, AIForwardIntention);
IntendMoveForward(ForwardThrow);
auto RightThrow = FVector::CrossProduct(TankForward, AIForwardIntention).Z; //skaláris szorzat i guess
IntendTurnRight(RightThrow);
}
void UTankMovementComponent::IntendMoveForward(float Throttle)
{
if (!ensure(LeftTrack&& RightTrack))
{
return;
}
LeftTrack->SetThrottle(Throttle);
RightTrack->SetThrottle(Throttle);
} | [
"mskyubi@gmail.com"
] | mskyubi@gmail.com |
ef12076a5d608414dd2adb880eb72c55d0495d35 | 344d903970d7b4643a5de5467add9755f164cc4f | /ros2_ign_bridge/include/ros2_ign_bridge/factory.hpp | 449fb19f8569a1a93dbc016bbd7a9662523ae7ce | [
"Apache-2.0"
] | permissive | osrf/ros2_ign | 2b082cf94eb20e2f65e15611c13b6d1c1da4916e | 477218f57e07ba644b19dea180f402239dee8f33 | refs/heads/master | 2020-06-30T04:04:45.102480 | 2020-06-15T15:25:57 | 2020-06-15T15:25:57 | 200,718,849 | 6 | 0 | Apache-2.0 | 2020-06-15T15:25:04 | 2019-08-05T19:47:29 | C++ | UTF-8 | C++ | false | false | 3,907 | hpp | // Copyright 2019 Open Source Robotics Foundation, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef ROS2_IGN_BRIDGE__FACTORY_HPP_
#define ROS2_IGN_BRIDGE__FACTORY_HPP_
#include <ignition/transport/Node.hh>
// include ROS 2
#include <rclcpp/rclcpp.hpp>
#include <ros2_ign_bridge/factory_interface.hpp>
#include <functional>
#include <memory>
#include <string>
namespace ros2_ign_bridge
{
template<typename ROS2_T, typename IGN_T>
class Factory : public FactoryInterface
{
public:
Factory(
const std::string & ros2_type_name, const std::string & ign_type_name)
: ros2_type_name_(ros2_type_name),
ign_type_name_(ign_type_name)
{}
rclcpp::PublisherBase::SharedPtr
create_ros2_publisher(
rclcpp::Node::SharedPtr ros2_node,
const std::string & topic_name,
size_t queue_size)
{
std::shared_ptr<rclcpp::Publisher<ROS2_T>> publisher =
ros2_node->create_publisher<ROS2_T>(topic_name, rclcpp::QoS(rclcpp::KeepLast(queue_size)));
return publisher;
}
ignition::transport::Node::Publisher
create_ign_publisher(
std::shared_ptr<ignition::transport::Node> ign_node,
const std::string & topic_name)
{
return ign_node->Advertise<IGN_T>(topic_name);
}
rclcpp::SubscriptionBase::SharedPtr
create_ros2_subscriber(
rclcpp::Node::SharedPtr ros2_node,
const std::string & topic_name,
size_t queue_size,
ignition::transport::Node::Publisher & ign_pub)
{
std::function<void(std::shared_ptr<const ROS2_T>)> fn =
std::bind(&Factory<ROS2_T, IGN_T>::ros2_callback, std::placeholders::_1, ign_pub);
std::shared_ptr<rclcpp::Subscription<ROS2_T>> subscription =
ros2_node->create_subscription<ROS2_T>(
topic_name, rclcpp::QoS(rclcpp::KeepLast(queue_size)), fn);
return subscription;
}
void
create_ign_subscriber(
std::shared_ptr<ignition::transport::Node> node,
const std::string & topic_name,
rclcpp::PublisherBase::SharedPtr ros2_pub)
{
std::function<void(const IGN_T &,
const ignition::transport::MessageInfo &)> subCb =
[this, ros2_pub](const IGN_T & _msg,
const ignition::transport::MessageInfo & _info)
{
// Ignore messages that are published from this bridge.
if (!_info.IntraProcess()) {
this->ign_callback(_msg, ros2_pub);
}
};
node->Subscribe(topic_name, subCb);
}
protected:
static
void ros2_callback(
std::shared_ptr<const ROS2_T> ros2_msg,
ignition::transport::Node::Publisher & ign_pub)
{
IGN_T ign_msg;
convert_ros2_to_ign(*ros2_msg, ign_msg);
ign_pub.Publish(ign_msg);
}
static
void ign_callback(
const IGN_T & ign_msg,
rclcpp::PublisherBase::SharedPtr ros2_pub)
{
ROS2_T ros2_msg;
convert_ign_to_ros2(ign_msg, ros2_msg);
std::shared_ptr<rclcpp::Publisher<ROS2_T>> pub =
std::dynamic_pointer_cast<rclcpp::Publisher<ROS2_T>>(ros2_pub);
pub->publish(ros2_msg);
}
public:
// since convert functions call each other for sub messages they must be
// public defined outside of the class
static
void
convert_ros2_to_ign(
const ROS2_T & ros2_msg,
IGN_T & ign_msg);
static
void
convert_ign_to_ros2(
const IGN_T & ign_msg,
ROS2_T & ros2_msg);
std::string ros2_type_name_;
std::string ign_type_name_;
};
} // namespace ros2_ign_bridge
#endif // ROS2_IGN_BRIDGE__FACTORY_HPP_
| [
"louise@openrobotics.org"
] | louise@openrobotics.org |
a585dd28c9a277cda37bc2739bc50f9200d3b136 | fd2b6c755abc4da2887ba444cae6d48940ff9e07 | /dom/media/encoder/fmp4_muxer/ISOMediaWriter.cpp | 0b4449447867d76df55d5679587d2b1066ff2a8a | [] | no_license | janekptacijarabaci/Pale-Moon | 497069fc8f967e1a9acf92cbec5821412bf4bde3 | 4197dba3260021c414b0355ece296e47d5050431 | refs/heads/master | 2021-01-17T22:09:22.101979 | 2018-06-13T16:47:33 | 2018-06-13T16:47:33 | 67,629,079 | 4 | 0 | null | 2016-09-07T17:30:55 | 2016-09-07T17:30:54 | null | UTF-8 | C++ | false | false | 6,208 | cpp | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-*/
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this file,
* You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "ISOMediaWriter.h"
#include "ISOControl.h"
#include "ISOMediaBoxes.h"
#include "ISOTrackMetadata.h"
#include "nsThreadUtils.h"
#include "MediaEncoder.h"
#include "VideoUtils.h"
#include "GoannaProfiler.h"
#undef LOG
#ifdef MOZ_WIDGET_GONK
#include <android/log.h>
#define LOG(args...) __android_log_print(ANDROID_LOG_INFO, "MediaEncoder", ## args);
#else
#define LOG(args, ...)
#endif
namespace mozilla {
const static uint32_t FRAG_DURATION = 2 * USECS_PER_S; // microsecond per unit
ISOMediaWriter::ISOMediaWriter(uint32_t aType, uint32_t aHint)
: ContainerWriter()
, mState(MUXING_HEAD)
, mBlobReady(false)
, mType(0)
{
if (aType & CREATE_AUDIO_TRACK) {
mType |= Audio_Track;
}
if (aType & CREATE_VIDEO_TRACK) {
mType |= Video_Track;
}
mControl = new ISOControl(aHint);
MOZ_COUNT_CTOR(ISOMediaWriter);
}
ISOMediaWriter::~ISOMediaWriter()
{
MOZ_COUNT_DTOR(ISOMediaWriter);
}
nsresult
ISOMediaWriter::RunState()
{
nsresult rv;
switch (mState) {
case MUXING_HEAD:
{
rv = mControl->GenerateFtyp();
NS_ENSURE_SUCCESS(rv, rv);
rv = mControl->GenerateMoov();
NS_ENSURE_SUCCESS(rv, rv);
mState = MUXING_FRAG;
break;
}
case MUXING_FRAG:
{
rv = mControl->GenerateMoof(mType);
NS_ENSURE_SUCCESS(rv, rv);
bool EOS;
if (ReadyToRunState(EOS) && EOS) {
mState = MUXING_DONE;
}
break;
}
case MUXING_DONE:
{
break;
}
}
mBlobReady = true;
return NS_OK;
}
nsresult
ISOMediaWriter::WriteEncodedTrack(const EncodedFrameContainer& aData,
uint32_t aFlags)
{
PROFILER_LABEL("ISOMediaWriter", "WriteEncodedTrack",
js::ProfileEntry::Category::OTHER);
// Muxing complete, it doesn't allowed to reentry again.
if (mState == MUXING_DONE) {
MOZ_ASSERT(false);
return NS_ERROR_FAILURE;
}
FragmentBuffer* frag = nullptr;
uint32_t len = aData.GetEncodedFrames().Length();
if (!len) {
// no frame? why bother to WriteEncodedTrack
return NS_OK;
}
for (uint32_t i = 0; i < len; i++) {
nsRefPtr<EncodedFrame> frame(aData.GetEncodedFrames()[i]);
EncodedFrame::FrameType type = frame->GetFrameType();
if (type == EncodedFrame::AAC_AUDIO_FRAME ||
type == EncodedFrame::AAC_CSD ||
type == EncodedFrame::AMR_AUDIO_FRAME ||
type == EncodedFrame::AMR_AUDIO_CSD) {
frag = mAudioFragmentBuffer;
} else if (type == EncodedFrame::AVC_I_FRAME ||
type == EncodedFrame::AVC_P_FRAME ||
type == EncodedFrame::AVC_B_FRAME ||
type == EncodedFrame::AVC_CSD) {
frag = mVideoFragmentBuffer;
} else {
MOZ_ASSERT(0);
return NS_ERROR_FAILURE;
}
frag->AddFrame(frame);
}
// Encoder should send CSD (codec specific data) frame before sending the
// audio/video frames. When CSD data is ready, it is sufficient to generate a
// moov data. If encoder doesn't send CSD yet, muxer needs to wait before
// generating anything.
if (mType & Audio_Track && (!mAudioFragmentBuffer ||
!mAudioFragmentBuffer->HasCSD())) {
return NS_OK;
}
if (mType & Video_Track && (!mVideoFragmentBuffer ||
!mVideoFragmentBuffer->HasCSD())) {
return NS_OK;
}
// Only one FrameType in EncodedFrameContainer so it doesn't need to be
// inside the for-loop.
if (frag && (aFlags & END_OF_STREAM)) {
frag->SetEndOfStream();
}
nsresult rv;
bool EOS;
if (ReadyToRunState(EOS)) {
// Because track encoder won't generate new data after EOS, it needs to make
// sure the state reaches MUXING_DONE when EOS is signaled.
do {
rv = RunState();
} while (EOS && mState != MUXING_DONE);
NS_ENSURE_SUCCESS(rv, rv);
}
return NS_OK;
}
bool
ISOMediaWriter::ReadyToRunState(bool& aEOS)
{
aEOS = false;
bool bReadyToMux = true;
if ((mType & Audio_Track) && (mType & Video_Track)) {
if (!mAudioFragmentBuffer->HasEnoughData()) {
bReadyToMux = false;
}
if (!mVideoFragmentBuffer->HasEnoughData()) {
bReadyToMux = false;
}
if (mAudioFragmentBuffer->EOS() && mVideoFragmentBuffer->EOS()) {
aEOS = true;
bReadyToMux = true;
}
} else if (mType == Audio_Track) {
if (!mAudioFragmentBuffer->HasEnoughData()) {
bReadyToMux = false;
}
if (mAudioFragmentBuffer->EOS()) {
aEOS = true;
bReadyToMux = true;
}
} else if (mType == Video_Track) {
if (!mVideoFragmentBuffer->HasEnoughData()) {
bReadyToMux = false;
}
if (mVideoFragmentBuffer->EOS()) {
aEOS = true;
bReadyToMux = true;
}
}
return bReadyToMux;
}
nsresult
ISOMediaWriter::GetContainerData(nsTArray<nsTArray<uint8_t>>* aOutputBufs,
uint32_t aFlags)
{
PROFILER_LABEL("ISOMediaWriter", "GetContainerData",
js::ProfileEntry::Category::OTHER);
if (mBlobReady) {
if (mState == MUXING_DONE) {
mIsWritingComplete = true;
}
mBlobReady = false;
return mControl->GetBufs(aOutputBufs);
}
return NS_OK;
}
nsresult
ISOMediaWriter::SetMetadata(TrackMetadataBase* aMetadata)
{
PROFILER_LABEL("ISOMediaWriter", "SetMetadata",
js::ProfileEntry::Category::OTHER);
if (aMetadata->GetKind() == TrackMetadataBase::METADATA_AAC ||
aMetadata->GetKind() == TrackMetadataBase::METADATA_AMR) {
mControl->SetMetadata(aMetadata);
mAudioFragmentBuffer = new FragmentBuffer(Audio_Track, FRAG_DURATION);
mControl->SetFragment(mAudioFragmentBuffer);
return NS_OK;
}
if (aMetadata->GetKind() == TrackMetadataBase::METADATA_AVC) {
mControl->SetMetadata(aMetadata);
mVideoFragmentBuffer = new FragmentBuffer(Video_Track, FRAG_DURATION);
mControl->SetFragment(mVideoFragmentBuffer);
return NS_OK;
}
return NS_ERROR_FAILURE;
}
} // namespace mozilla
| [
"git-repo@palemoon.org"
] | git-repo@palemoon.org |
ef1d86b788b36953ed1813ff4046667e2b0ec977 | 35780b02ad20850b3df9ab642553c1bdae14bc80 | /AsciiGameV2/AsciiGameV2/Headers/Vector2.h | 94c40543c703208ec83b77e751fabcecff29195e | [] | no_license | Kraghan/AsciiGame | 38f1b4878ba6c471725684ee95cc5cd294c8842d | f53c67e03e818ca2f91c45914255a448f9ee1e26 | refs/heads/master | 2021-09-02T03:14:24.624175 | 2017-12-29T21:58:20 | 2017-12-29T21:58:20 | 105,511,369 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 978 | h | #pragma once
template <typename T>
class Vector2
{
public:
T x;
T y;
explicit Vector2(void);
explicit Vector2(T xx, T yy);
virtual ~Vector2(void);
};
template <typename T>
Vector2<T> operator* (Vector2<T> const& type1, T const& type2);
template <typename T>
Vector2<T> operator* (T const& type1, Vector2<T> const& type2);
template <typename T>
Vector2<T> operator/ (Vector2<T> const& type1, T const& type2);
template <typename T>
Vector2<T> operator- (Vector2<T> const& type1, Vector2<T> const& type2);
template <typename T>
Vector2<T> operator+ (Vector2<T> const& type1, Vector2<T> const& type2);
template <typename T>
Vector2<T> operator* (Vector2<T> const& type1, Vector2<T> const& type2);
template <typename T>
bool operator== (Vector2<T> const& type1, Vector2<T> const& type2);
#include "../Inlines/Vector2.inl"
typedef Vector2<int> Vector2i;
typedef Vector2<float> Vector2f;
typedef Vector2<unsigned int> Vector2ui;
typedef Vector2<double> Vector2d; | [
"madjojo70@live.fr"
] | madjojo70@live.fr |
a470444d84deec5fb2d3f18d6660f9f2f1055c01 | ad2fb11144fa9b91cab38a0685447a543c0de6d2 | /Lib/Lexer/Tokens/Instructions/Token_Instruction_Lea.cpp | 3a1580763ebb34881c0a6c356cc0ab84915a6fc1 | [] | no_license | Pyxxil/LC3AS | 53b1ba17cbbe50ba7c2ac64dfb55d8b8e8ee620f | e8f4b755d7c3d0650ed1efda79e6b55741b3a131 | refs/heads/master | 2021-01-01T04:33:16.288512 | 2018-09-07T05:59:32 | 2018-09-07T05:59:32 | 97,195,773 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,357 | cpp | #include "Tokens/Instructions/Token_Instruction_Lea.hpp"
#include <fmt/ostream.h>
#include "Tokens/Token_Immediate.hpp"
#include "Tokens/Token_Label.hpp"
#include "Tokens/Token_Register.hpp"
Lea::Lea(const std::string &instruction,
const std::string &instruction_uppercase, const std::string &t_file,
size_t line_number, size_t t_column)
: Instruction(instruction, instruction_uppercase, t_file, line_number,
t_column) {}
int32_t Lea::assemble(std::vector<std::shared_ptr<Token>> &tokens,
const std::map<std::string, Symbol> &symbols,
uint16_t program_counter) {
if (!is_valid) {
return 0;
}
int offset = 0;
if (tokens[2]->type() == Token::LABEL) {
if (0u == symbols.count(tokens[2]->token)) {
std::static_pointer_cast<Label>(tokens[2])->not_found(symbols);
return -1;
}
offset = static_cast<int>(symbols.find(tokens[2]->token)->second.address) -
(static_cast<int>(program_counter) + 1);
} else {
offset = std::static_pointer_cast<Immediate>(tokens[2])->value;
}
if (offset > 255 || offset < -256) {
tokens[2]->requires_too_many_bits(9, SIGNED, this, symbols);
return -1;
}
provided = tokens[2];
assembled.emplace_back(static_cast<uint16_t>(
0xE000 | ((std::static_pointer_cast<Register>(tokens[1])->reg & 7) << 9) |
(offset & 0x1FF)));
return 1;
}
bool Lea::valid_arguments(std::vector<std::shared_ptr<Token>> &tokens) {
if (tokens.size() != 3) {
invalid_argument_count(tokens.size(), 2,
tokens.back()->column +
tokens.back()->token.length());
return (is_valid = false);
}
if (tokens[1]->type() != Token::REGISTER) {
tokens[1]->expected(Expected::REGISTER);
return (is_valid = false);
}
if (tokens[2]->type() != Token::LABEL &&
tokens[2]->type() != Token::IMMEDIATE) {
tokens[2]->expected(Expected::LABEL_OR_IMMEDIATE_VAL);
return (is_valid = false);
}
if (!(tokens[1]->is_valid && tokens[2]->is_valid)) {
return (is_valid = false);
}
return is_valid;
}
uint16_t
Lea::guess_memory_size(std::vector<std::shared_ptr<Token>> &tokens) const {
(void)tokens;
return static_cast<uint16_t>(is_valid);
}
std::string Lea::disassemble(uint16_t &program_counter,
const std::string &symbol, int width) const {
const auto value = assembled.front();
++program_counter;
#ifdef INCLUDE_ADDONS
return fmt::format(
"({0:04X}) {1:04X} {1:016b} ({2: >4d}) {3: <{4}s} LEA R{5:d} "
"{6:s}\t{7:s}\n",
program_counter - 1, value, line, symbol, width, value >> 9 & 0x7,
provided->type() == Token::LABEL
? provided->token
: fmt::format("{:#06x}",
std::static_pointer_cast<Immediate>(provided)->value +
program_counter),
file);
#else
return fmt::format(
"({0:04X}) {1:04X} {1:016b} ({2: >4d}) {3: <{4}s} LEA R{5:d} {6:s}\n",
program_counter - 1, value, line, symbol, width, value >> 9 & 0x7,
provided->type() == Token::LABEL
? provided->token
: fmt::format("{:#06x}",
std::static_pointer_cast<Immediate>(provided)->value +
program_counter));
#endif
}
| [
"josh.hill189@gmail.com"
] | josh.hill189@gmail.com |
8cb6c68a9dadaba20bd711b645b529c3c410c9c9 | fa04d2f56c8d4ebfb931968392811a127a4cb46c | /trunk/Cities3D/src/StandardRules/RuleRemoveCity.cpp | af76bce187ff28a36619a2a9f63f78cc95c26825 | [] | no_license | andrewlangemann/Cities3D | 9ea8b04eb8ec43d05145e0b91d1c542fa3163ab3 | 58c6510f609a0c8ef801c77f5be9ea622e338f9a | refs/heads/master | 2022-10-04T10:44:51.565770 | 2020-06-03T23:44:07 | 2020-06-03T23:44:07 | 268,979,591 | 0 | 0 | null | 2020-06-03T03:25:54 | 2020-06-03T03:25:53 | null | UTF-8 | C++ | false | false | 2,878 | cpp | /*
* Cities3D - Copyright (C) 2001-2009 Jason Fugate (saladyears@gmail.com)
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*/
#include "stdwx.h"
#include "style.h" //READ THIS BEFORE MAKING ANY CHANGES TO THIS FILE!!!
//---------------------------- SYSTEM INCLUDES -----------------------------//
//---------------------------- USER INCLUDES -----------------------------//
#include "Rule.h"
#include "RuleSetDatabase.h"
#include "GameEngine.h"
#include "CityObject.h"
#include "AggregatorObject.h"
#include "Utility.h"
#include "Controller.h"
#include "IRuleEngine.h"
//---------------------------- TYPEDEFS -----------------------------//
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
//---------------------------- STATICS -----------------------------//
//---------------------------- RULES -----------------------------//
//---------------------------------------------------------------------------//
// Class: RuleRemoveCity
//
// Removes a city from the board at the given tile and corner for the
// current player.
//
// Derived From:
// <Rule>
//
// Project:
// <StandardRules>
//
// RuleSet:
// <Standard>
//
class RuleRemoveCity : public Rule
{
public:
virtual void Execute(const DataObject &object)
{
wxASSERT(1 <= object.numItems());
wxInt32 player = current();
// See if a particular player is having it removed.
if(2 <= object.numItems())
{
player = object.read<wxInt32>(1);
}
// Get the tile and corner being removed.
wxInt32 tile, corner;
boost::tie(tile, corner) = Utility::decodeSel(object.read<wxInt32>());
// Find the city in the player's current list.
const PlayerGame::CornerObjectArray &cities =
playerGame(player).getCornerObjects(shCities);
CornerObject::TileCorner tileCorner(tile, corner);
CornerObjectPtr city;
PlayerGame::CornerObjectArray::const_iterator it,
itEnd = cities.end();
for(it = cities.begin(); it != itEnd; ++it)
{
if(true == (*it)->onTileCorner(tileCorner))
{
city = (*it);
break;
}
}
// Remove it from the player's list.
playerGame(player).removeCornerObject(shCities, city);
// Add one to the player's stock cities.
playerGameData<wxInt32>(shStockCities, player) += 1;
// Subtract two points from the player's score.
RULE.Execute(shRuleAdjustPoints, DataObject(player, -2));
}
};
IMPLEMENT_RULE(RuleRemoveCity, STANDARD)
| [
"saladyears@gmail.com"
] | saladyears@gmail.com |
baca457dba63dd998840d52152445cb1fda70778 | 01f6085a563b8e080e615c4a71af20dc9d341195 | /include/instruction.h | c1021fd16241b0c09d0b61872ec617bc45e299ac | [
"Apache-2.0"
] | permissive | Chill-Language/ICM | 90f54aa69289fd06e956cbf69d441875bb6f3f47 | a0ee83e5bbd2aef216cc28faa5d5dad36c99d606 | refs/heads/master | 2022-04-07T11:07:44.255757 | 2019-05-06T13:42:44 | 2019-05-06T13:42:44 | 59,800,677 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 8,233 | h | #pragma once
#include "basic.h"
#include "parser/keyword.h"
#include "runtime/typebase.h"
#include "temp-getelement2.h"
namespace ICM
{
namespace Instruction
{
enum Instruction {
begin, end,
sing, // sing a
stor, // stor
list, // list ...
nop, // nop
pti, // pti ...
// Function
call, // call f.i args...
ccal, // ccal f args...
iadd,
isub,
imul,
idiv,
imod,
ilrl,
farg, // farg args... ; Ve(E) -> DL
fargl, // fargl args... ; DL
fargv, // fargv args... ; Ve(E) -> Ve(O*) -> DL
fsub, // fsub f, $
fsubr, // fsubr r, $
fsubv, // fsubv v, $
fcal, // fcal $, $
// Assign
let, // let V E
cpy, // cpy V E
ref, // ref V E
set, // set V E
cpys, // cpys E
refs, // refs E
//
inc, // inc E
dec, // dec E
// Jump
jump, // jump {i}
jmpf, // jmpf b {i}
jmpn, // jmpn b {i}
jmpc, // jmpc b {i} {j}
jpsm, jpse, jpla, jple, // jpxx a b {i}
// Compare
cpsm, cpse, cpla, cple, cpeq, cpne, // cpxx a b
// Calc
add, sub, mul, div, mod, rem, // xxx a b
// Varb
dim, // dim a type
rest, // rest a type
};
extern BijectionMap<Instruction, string> InstructionName;
}
string to_string(Instruction::Instruction inst);
namespace ASTBase
{
struct Element;
}
namespace Instruction
{
//=======================================
// * Struct Element
//=======================================
struct Element
{
private:
enum ElementType {
E_Void,
E_Literal,
E_Refer,
E_Ident,
E_Key,
};
public:
Element() = default;
Element(ElementType et, size_t id, size_t index)
: etype((uint8_t)et), stype((uint8_t)id), index(index) {}
Element(const Element&) = default;
// Static Function
static Element Literal(size_t type, size_t index) { return Element(E_Literal, type, index); }
static Element Refer(size_t index) { return Element(E_Refer, 0, index); }
static Element Keyword(Keyword::KeywordID key) { return Element(E_Key, key, 0); }
static Element Identifier(size_t index) { return Element(E_Ident, 0, index); }
static Element Identifier(IdentType type, size_t index) { return Element(E_Ident, type, index); }
// Judge
bool isLiteral() const { return isEltType(E_Literal); }
bool isRefer() const { return isEltType(E_Refer); }
bool isKeyword() const { return isEltType(E_Key); }
bool isIdent() const { return isEltType(E_Ident); }
bool isLiteralType(TypeUnit type) const { return isLiteral() && getSubType() == type; }
bool isIdentType(IdentType type) const { return isIdent() && getSubType() == type; }
// Get/Set Index
void setIndex(size_t id) { index = id; }
size_t getIndex() const { return index; }
// Get/Set
void setRefer(size_t id) { assert(isRefer()); setIndex(id); }
size_t getRefer() const { assert(isRefer()); return getIndex(); }
const IdentIndex& getIdentIndex() const { return reinterpret_cast<const IdentIndex&>(index); }
TypeUnit getLiteralType() const { assert(isLiteral()); return getSubType(); }
size_t getIndetType() const { assert(isIdent()); return getSubType(); }
Keyword::KeywordID getKeyword() const { assert(isKeyword()); return (Keyword::KeywordID)getSubType(); }
private:
union {
struct { uint8_t etype, stype; };
uint32_t type = 0;
};
uint_t index = 0;
private:
bool isEltType(ElementType et) const { return (ElementType)this->etype == et; }
size_t getSubType() const { return (size_t)this->stype; }
};
inline Element ConvertToInstElement(const ASTBase::Element &elt) {
return *(const Element*)(&elt);
}
inline vector<Element> ConvertToInstElement(const vector<ASTBase::Element> &elt) {
return *(const vector<Element>*)(&elt);
}
}
string to_string(const Instruction::Element &elt);
string to_string(const vector<Instruction::Element> &elt);
namespace Instruction
{
using FuncType = TypeBase::FunctionType;
class InstructionData
{
public:
InstructionData(Instruction inst)
: Inst(inst) {}
Instruction inst() const { return Inst; }
string to_string() const;
private:
Instruction Inst;
virtual string getToString() const { return ""; }
};
namespace Insts
{
template <Instruction _Inst>
struct InstDataBase : public InstructionData {
InstDataBase() : InstructionData(_Inst) {}
};
struct List : public InstDataBase<list>
{
vector<Element> Data;
private:
string getToString() const {
return ICM::to_string(Data);
}
};
struct CheckCall : public InstDataBase<ccal>
{
vector<Element> Data;
private:
string getToString() const {
return ICM::to_string(Data);
}
};
struct PrintIdent : public InstDataBase<pti>
{
vector<Element> Args;
private:
string getToString() const {
return ICM::to_string(Args);
}
};
/*
// FuncArgs
struct FuncArgs : public InstDataBase<farg>
{
vector<Element> Args;
private:
string getToString() const { return ICM::to_string(Args); }
};
struct FuncArgsLight : public InstDataBase<fargl>
{
DataList Args;
private:
string getToString() const { return Convert::to_string(Args.begin(), Args.end()); }
};
struct FuncArgsVary : public InstDataBase<fargv>
{
vector<Element> Args;
private:
string getToString() const { return ICM::to_string(Args); }
};
// FuncSub
struct FuncSub : public InstDataBase<fsub>
{
FuncType Func;
private:
string getToString() const { return ICM::to_string(Func) + ", $"; }
};
struct FuncSubVarb : public InstDataBase<fsubv>
{
Object* VFunc;
private:
string getToString() const { return VFunc->to_string() + ", $"; }
};
struct FuncSubRef : public InstDataBase<fsubr>
{
size_t RFunc;
private:
string getToString() const { return "{" + std::to_string(RFunc) + "}" + ", $"; }
};*/
struct FuncCall : public InstDataBase<fcal>
{
private:
string getToString() const { return "$, $"; }
};
struct Assign : public InstructionData
{
Assign(Instruction inst, const IdentIndex &VTUID, const Element &elt)
: InstructionData(inst), VTU(VTUID), Data(elt) {}
IdentIndex VTU;
Element Data;
private:
string getToString() const { return getIdentName(VTU) + ", " + ICM::to_string(Data); }
};
struct CopySingle : public InstDataBase<cpys>
{
CopySingle(const Element &Data) : Data(Data) {}
Element Data;
private:
string getToString() const { return ICM::to_string(Data); }
};
struct Store : public InstDataBase<stor>
{
Store(const Element &Data) : Data(Data) {}
Element Data;
private:
string getToString() const { return ICM::to_string(Data); }
};
struct JumpNot : public InstDataBase<jmpn>
{
Element Data;
size_t Index;
private:
string getToString() const {
return ICM::to_string(Data) + ", {" + std::to_string(Index) + "}";
}
};
struct Jump : public InstDataBase<jump>
{
size_t Index;
private:
string getToString() const {
return "{" + std::to_string(Index) + "}";
}
};
struct Inc : public InstDataBase<inc>
{
Inc(const IdentIndex &VTU) : VTU(VTU) {}
IdentIndex VTU;
private:
string getToString() const { return getIdentName(VTU); }
};
struct Compare : public InstructionData
{
Compare(Instruction inst, const IdentIndex &VTU, const Element &Data)
: InstructionData(inst), VTU(VTU), Data(Data) {}
IdentIndex VTU;
Element Data;
protected:
string getToString() const { return getIdentName(VTU) + ", " + ICM::to_string(Data); }
};
struct JumpCompare : public Compare
{
JumpCompare(Instruction inst, const IdentIndex &VTU, const Element &Data)
: Compare(inst, VTU, Data) {}
size_t Index;
private:
string getToString() const { return Compare::getToString() + ", {" + std::to_string(Index) + "}"; }
};
}
class InstructionList : public vector<InstructionData*>
{
public:
void push(Instruction inst) {
push_back(new InstructionData(inst));
}
void push(InstructionData *instdata) {
push_back(instdata);
}
private:
};
}
}
| [
"hanlengmowang@hotmail.com"
] | hanlengmowang@hotmail.com |
e2fd9ebc6ad588e0fb31795c05100748f08edad2 | 55a8933754c78c4348e2f9de59c6ffdfcf49528e | /code/oj/myEP/test02.cpp | 57daf63346f59cd22b6c06bc88ec431b9424896e | [] | no_license | liuqian-test/LeetCode | d28aa2b79cf09503331bf2abce031b5b39127df4 | 5592209321ea8523f3a2703fde3eae20abe15e77 | refs/heads/master | 2022-04-08T14:52:57.438464 | 2020-03-15T16:45:54 | 2020-03-15T16:45:54 | 242,993,392 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 508 | cpp | /*************************************************************************
> File Name: test02.cpp
> Author: ma6174
> Mail: ma6174@163.com
> Created Time: 2020年01月11日 星期六 16时21分04秒
************************************************************************/
#include<iostream>
#include<cstring>
using namespace std;
int main() {
char str[1000];
scanf("%[^\n]s", str);
int len = strlen(str);
for(int i = 0; str[i]; i++) {
if(str[i] == ' ')str[i] = '\n';
}
printf("%d", str);
}
| [
"1254143911@qq.com"
] | 1254143911@qq.com |
6f0f38cbc93a4b79a7e159b39c65501c448a74ae | 484e9a41584aea505040d885dac9c03f69ab14ba | /April24_Cprojects/april24_3project.cpp | c90cef932812cb07e5218a3892e66c0894d8f926 | [] | no_license | leejinho/c-language | 474495a330c4418602eb2303c7558d4afac8740d | 9cc92718540a9437cfb58d2d706823cde9797368 | refs/heads/master | 2020-07-01T22:52:37.541158 | 2015-06-18T09:02:36 | 2015-06-18T09:02:36 | 34,090,336 | 0 | 1 | null | 2015-05-29T02:28:30 | 2015-04-17T01:39:23 | C++ | UTF-8 | C++ | false | false | 309 | cpp | #include <stdio.h>
void main()
{
int button;
printf("숫자(1-5)를 입력하고 Enter>");
scanf("%d", &button);
switch(button)
{
case 1 : printf("밀크커피\n");
break;
case 2 : printf("프림커피\n");
break;
case 3 : printf("블렉커피\n");
break;
default : printf("코코아\n");
}
}
| [
"leejh2773@naver.com"
] | leejh2773@naver.com |
401ba6baed3506a552d4822431d7c101167dd32d | b829632e0c3f954b5d2439926c45f19f0ba273ee | /ROS/devel/include/projectx/Label.h | 0a2ac7fda6beba5b6b50ea77f60a82314170be22 | [] | no_license | kaaninan/ProjectX | bc557b9e959966c914637717dc7186c1e3cae5f3 | 8f0b289fe88a323b690d82e4c20dba06c3a3ea51 | refs/heads/master | 2021-01-21T21:33:19.256604 | 2016-06-05T09:07:55 | 2016-06-05T09:07:55 | 48,510,976 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,913 | h | // Generated by gencpp from file projectx/Label.msg
// DO NOT EDIT!
#ifndef PROJECTX_MESSAGE_LABEL_H
#define PROJECTX_MESSAGE_LABEL_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>
#include <std_msgs/Header.h>
#include <projectx/CommonProperties.h>
namespace projectx
{
template <class ContainerAllocator>
struct Label_
{
typedef Label_<ContainerAllocator> Type;
Label_()
: header()
, common()
, value() {
}
Label_(const ContainerAllocator& _alloc)
: header(_alloc)
, common(_alloc)
, value(_alloc) {
}
typedef ::std_msgs::Header_<ContainerAllocator> _header_type;
_header_type header;
typedef ::projectx::CommonProperties_<ContainerAllocator> _common_type;
_common_type common;
typedef std::basic_string<char, std::char_traits<char>, typename ContainerAllocator::template rebind<char>::other > _value_type;
_value_type value;
typedef boost::shared_ptr< ::projectx::Label_<ContainerAllocator> > Ptr;
typedef boost::shared_ptr< ::projectx::Label_<ContainerAllocator> const> ConstPtr;
}; // struct Label_
typedef ::projectx::Label_<std::allocator<void> > Label;
typedef boost::shared_ptr< ::projectx::Label > LabelPtr;
typedef boost::shared_ptr< ::projectx::Label const> LabelConstPtr;
// constants requiring out of line definition
template<typename ContainerAllocator>
std::ostream& operator<<(std::ostream& s, const ::projectx::Label_<ContainerAllocator> & v)
{
ros::message_operations::Printer< ::projectx::Label_<ContainerAllocator> >::stream(s, "", v);
return s;
}
} // namespace projectx
namespace ros
{
namespace message_traits
{
// BOOLTRAITS {'IsFixedSize': False, 'IsMessage': True, 'HasHeader': True}
// {'std_msgs': ['/opt/ros/indigo/share/std_msgs/cmake/../msg'], 'projectx': ['/home/ubuntu/ProjectX/ROS/src/projectx/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< ::projectx::Label_<ContainerAllocator> >
: FalseType
{ };
template <class ContainerAllocator>
struct IsFixedSize< ::projectx::Label_<ContainerAllocator> const>
: FalseType
{ };
template <class ContainerAllocator>
struct IsMessage< ::projectx::Label_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct IsMessage< ::projectx::Label_<ContainerAllocator> const>
: TrueType
{ };
template <class ContainerAllocator>
struct HasHeader< ::projectx::Label_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct HasHeader< ::projectx::Label_<ContainerAllocator> const>
: TrueType
{ };
template<class ContainerAllocator>
struct MD5Sum< ::projectx::Label_<ContainerAllocator> >
{
static const char* value()
{
return "b5cfc77fbfd3429b0db9743556374f86";
}
static const char* value(const ::projectx::Label_<ContainerAllocator>&) { return value(); }
static const uint64_t static_value1 = 0xb5cfc77fbfd3429bULL;
static const uint64_t static_value2 = 0x0db9743556374f86ULL;
};
template<class ContainerAllocator>
struct DataType< ::projectx::Label_<ContainerAllocator> >
{
static const char* value()
{
return "projectx/Label";
}
static const char* value(const ::projectx::Label_<ContainerAllocator>&) { return value(); }
};
template<class ContainerAllocator>
struct Definition< ::projectx::Label_<ContainerAllocator> >
{
static const char* value()
{
return "# TouchOSC Label Control\n\
\n\
Header header\n\
CommonProperties common\n\
string value\n\
\n\
================================================================================\n\
MSG: std_msgs/Header\n\
# Standard metadata for higher-level stamped data types.\n\
# This is generally used to communicate timestamped data \n\
# in a particular coordinate frame.\n\
# \n\
# sequence ID: consecutively increasing ID \n\
uint32 seq\n\
#Two-integer timestamp that is expressed as:\n\
# * stamp.sec: seconds (stamp_secs) since epoch (in Python the variable is called 'secs')\n\
# * stamp.nsec: nanoseconds since stamp_secs (in Python the variable is called 'nsecs')\n\
# time-handling sugar is provided by the client library\n\
time stamp\n\
#Frame this data is associated with\n\
# 0: no frame\n\
# 1: global frame\n\
string frame_id\n\
\n\
================================================================================\n\
MSG: projectx/CommonProperties\n\
# Common functionality to all TouchOSC controls\n\
\n\
string tabpage # Control tabpage\n\
string name # Control Name\n\
int16 x # X position of the control\n\
int16 y # Y position of the control\n\
uint16 width # Width of the control\n\
uint16 height # Height of the control\n\
string visible # Visibility of the control\n\
\n\
# Possible colors are:\n\
# \"red\", \"green\", \"blue\", \"yellow\", \"orange\", \"purple\", \"gray\"\n\
string color # Color of the control\n\
";
}
static const char* value(const ::projectx::Label_<ContainerAllocator>&) { return value(); }
};
} // namespace message_traits
} // namespace ros
namespace ros
{
namespace serialization
{
template<class ContainerAllocator> struct Serializer< ::projectx::Label_<ContainerAllocator> >
{
template<typename Stream, typename T> inline static void allInOne(Stream& stream, T m)
{
stream.next(m.header);
stream.next(m.common);
stream.next(m.value);
}
ROS_DECLARE_ALLINONE_SERIALIZER;
}; // struct Label_
} // namespace serialization
} // namespace ros
namespace ros
{
namespace message_operations
{
template<class ContainerAllocator>
struct Printer< ::projectx::Label_<ContainerAllocator> >
{
template<typename Stream> static void stream(Stream& s, const std::string& indent, const ::projectx::Label_<ContainerAllocator>& v)
{
s << indent << "header: ";
s << std::endl;
Printer< ::std_msgs::Header_<ContainerAllocator> >::stream(s, indent + " ", v.header);
s << indent << "common: ";
s << std::endl;
Printer< ::projectx::CommonProperties_<ContainerAllocator> >::stream(s, indent + " ", v.common);
s << indent << "value: ";
Printer<std::basic_string<char, std::char_traits<char>, typename ContainerAllocator::template rebind<char>::other > >::stream(s, indent + " ", v.value);
}
};
} // namespace message_operations
} // namespace ros
#endif // PROJECTX_MESSAGE_LABEL_H
| [
"kaaninan99@gmail.com"
] | kaaninan99@gmail.com |
b43f3cacd24fb8f8fc1ec6bc595a3cc34371ebe9 | 50385efb6781b1cb55c9dcefe3cebdbca6d7e361 | /src/BPmono29.cpp | 1bbeb41ff5fdf14a50436de2817b1a5a521bf01c | [] | no_license | CariadDisplayLibrary/BPmono | 3b639bd5108b827ac93032db572bed62e197e827 | 813c473cdaee288d2666dbdb988aacc35830498a | refs/heads/master | 2022-11-17T17:32:59.830627 | 2020-07-14T16:10:13 | 2020-07-14T16:10:13 | 102,229,463 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 125,636 | cpp | #include <BPmono.h>
namespace Fonts {
const uint8_t BPmono29[] = {
33, 12, 32, 127, 4,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 136, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 176, 239, 245, 0, 0, 0, 0, 0, 0, 0, 11, 255, 160, 239, 243, 0, 0, 0, 0, 0, 0, 0, 10, 255, 160, 223, 240, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 223, 240, 0, 0, 0, 0, 0, 0, 0, 9, 255, 128, 207, 240, 0, 0, 0, 0, 0, 0, 0, 8, 255, 112, 207, 224, 0, 0, 0, 0, 0, 0, 0, 7, 255, 96, 191, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 253, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 253, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 22, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 158, 255, 255, 255, 144, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 255, 250, 0, 0, 0, 0, 0, 0, 0, 108, 134, 36, 142, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 223, 249, 0, 0, 0, 0, 0, 0, 0, 0, 124, 255, 253, 112, 0, 0, 0, 0, 0, 0, 0, 28, 255, 252, 112, 0, 0, 0, 0, 0, 0, 0, 0, 191, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 96, 0, 0, 37, 0, 0, 0, 0, 0, 0, 0, 239, 233, 67, 123, 237, 0, 0, 0, 0, 0, 0, 0, 143, 255, 255, 255, 255, 80, 0, 0, 0, 0, 0, 0, 8, 255, 255, 254, 181, 0, 0, 0, 0, 0, 0, 0, 0, 24, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 255, 255, 255, 255, 212, 0, 0, 0, 0, 0, 5, 255, 192, 0, 223, 169, 252, 0, 0, 0, 0, 0, 0, 191, 246, 0, 255, 68, 254, 0, 0, 0, 0, 0, 0, 63, 252, 0, 255, 33, 255, 0, 0, 0, 0, 0, 0, 10, 255, 96, 255, 33, 255, 0, 0, 0, 0, 0, 0, 2, 239, 208, 239, 68, 254, 0, 0, 0, 0, 0, 0, 0, 159, 247, 191, 169, 252, 0, 0, 0, 0, 0, 0, 0, 14, 253, 44, 255, 212, 0, 0, 0, 0, 0, 0, 0, 8, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 208, 0, 0, 0, 0, 0, 0, 0, 2, 207, 253, 127, 248, 0, 0, 0, 0, 0, 0, 0, 11, 250, 175, 189, 254, 0, 0, 0, 0, 0, 0, 0, 14, 245, 79, 230, 255, 128, 0, 0, 0, 0, 0, 0, 15, 242, 31, 240, 207, 224, 0, 0, 0, 0, 0, 0, 15, 240, 15, 240, 79, 249, 0, 0, 0, 0, 0, 0, 15, 242, 47, 240, 11, 254, 0, 0, 0, 0, 0, 0, 14, 245, 95, 224, 3, 255, 144, 0, 0, 0, 0, 0, 10, 249, 159, 176, 0, 175, 225, 0, 0, 0, 0, 0, 2, 207, 253, 48, 0, 30, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 141, 255, 214, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 255, 255, 96, 0, 0, 0, 0, 0, 0, 0, 13, 252, 36, 223, 192, 0, 0, 0, 0, 0, 0, 0, 15, 244, 0, 127, 240, 0, 0, 0, 0, 0, 0, 0, 15, 245, 0, 63, 240, 0, 0, 0, 0, 0, 0, 0, 13, 251, 0, 111, 240, 0, 0, 0, 0, 0, 0, 0, 8, 255, 128, 191, 192, 0, 0, 0, 0, 0, 0, 0, 0, 207, 249, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 251, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 175, 251, 0, 0, 0, 0, 0, 0, 14, 235, 96, 0, 9, 255, 192, 0, 0, 0, 0, 0, 46, 255, 254, 200, 32, 143, 248, 0, 0, 0, 0, 0, 0, 79, 255, 255, 48, 11, 253, 0, 0, 0, 0, 0, 0, 15, 246, 138, 0, 5, 255, 0, 0, 0, 0, 0, 0, 15, 242, 0, 0, 2, 255, 0, 0, 0, 0, 0, 0, 15, 246, 0, 0, 7, 255, 0, 0, 0, 0, 0, 0, 12, 252, 0, 0, 13, 252, 0, 0, 0, 0, 0, 0, 7, 255, 180, 5, 207, 246, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 255, 144, 0, 0, 0, 0, 0, 0, 0, 7, 223, 255, 198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 172, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 172, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 242, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 239, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 245, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 239, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 174, 96, 220, 64, 0, 0, 0, 0, 0, 0, 0, 0, 191, 217, 254, 48, 0, 0, 0, 0, 0, 0, 0, 0, 29, 255, 247, 0, 0, 0, 0, 0, 0, 0, 0, 14, 255, 255, 255, 251, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 255, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 217, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 126, 96, 218, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 241, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 225, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 245, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 141, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 44, 255, 255, 255, 252, 32, 0, 0, 0, 0, 0, 0, 223, 253, 114, 124, 255, 209, 0, 0, 0, 0, 0, 10, 255, 250, 0, 0, 159, 250, 0, 0, 0, 0, 0, 47, 255, 255, 48, 0, 11, 255, 32, 0, 0, 0, 0, 159, 252, 255, 176, 0, 2, 255, 144, 0, 0, 0, 0, 207, 242, 223, 243, 0, 0, 191, 208, 0, 0, 0, 0, 239, 176, 127, 251, 0, 0, 143, 224, 0, 0, 0, 0, 255, 128, 13, 255, 48, 0, 95, 240, 0, 0, 0, 0, 255, 64, 7, 255, 176, 0, 47, 240, 0, 0, 0, 0, 255, 32, 0, 223, 244, 0, 79, 240, 0, 0, 0, 0, 239, 80, 0, 111, 251, 0, 127, 224, 0, 0, 0, 0, 207, 128, 0, 13, 255, 64, 191, 208, 0, 0, 0, 0, 159, 192, 0, 6, 255, 176, 239, 160, 0, 0, 0, 0, 47, 243, 0, 0, 207, 250, 255, 48, 0, 0, 0, 0, 9, 251, 0, 0, 111, 255, 250, 0, 0, 0, 0, 0, 0, 207, 128, 0, 12, 255, 209, 0, 0, 0, 0, 0, 0, 28, 251, 48, 76, 253, 32, 0, 0, 0, 0, 0, 0, 0, 141, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 218, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 254, 201, 48, 0, 0, 0, 0, 0, 0, 0, 255, 190, 255, 255, 112, 0, 0, 0, 0, 0, 0, 0, 255, 0, 73, 205, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 4, 255, 255, 255, 255, 255, 255, 255, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 206, 255, 254, 218, 64, 0, 0, 0, 0, 0, 0, 159, 233, 99, 106, 239, 249, 0, 0, 0, 0, 0, 7, 253, 32, 0, 0, 27, 249, 0, 0, 0, 0, 0, 13, 247, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 15, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 254, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 239, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 253, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 255, 211, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 254, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 255, 229, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 239, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 78, 255, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 223, 255, 48, 0, 0, 0, 0, 207, 255, 255, 255, 255, 255, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 190, 255, 255, 254, 202, 0, 0, 0, 0, 0, 0, 127, 252, 116, 36, 139, 236, 0, 0, 0, 0, 0, 0, 239, 160, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 228, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 223, 184, 82, 0, 0, 0, 0, 0, 0, 0, 0, 9, 239, 255, 255, 251, 0, 0, 0, 0, 0, 0, 0, 191, 253, 149, 35, 85, 0, 0, 0, 0, 0, 0, 8, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 242, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 245, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 239, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 93, 251, 96, 0, 72, 190, 144, 0, 0, 0, 0, 0, 0, 140, 239, 255, 254, 237, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 254, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 175, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 13, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 255, 4, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 143, 250, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 12, 255, 112, 0, 0, 0, 0, 0, 0, 0, 255, 0, 2, 239, 227, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 111, 252, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 10, 255, 144, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 223, 245, 0, 0, 0, 0, 5, 255, 255, 255, 255, 255, 255, 253, 0, 0, 0, 0, 5, 255, 255, 255, 255, 255, 255, 254, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 255, 255, 255, 255, 144, 0, 0, 0, 0, 0, 0, 191, 255, 255, 255, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 245, 0, 0, 0, 0, 0, 0, 0, 124, 239, 255, 239, 247, 0, 0, 0, 0, 0, 0, 60, 253, 148, 37, 122, 144, 0, 0, 0, 0, 0, 1, 223, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 176, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 191, 253, 149, 35, 105, 206, 48, 0, 0, 0, 0, 0, 10, 255, 255, 255, 255, 255, 144, 0, 0, 0, 0, 0, 0, 75, 239, 255, 254, 183, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 253, 181, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 255, 255, 213, 0, 0, 0, 0, 0, 0, 0, 0, 4, 122, 223, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 207, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 208, 0, 0, 0, 0, 0, 0, 8, 223, 255, 218, 45, 247, 0, 0, 0, 0, 0, 3, 223, 182, 37, 174, 234, 251, 0, 0, 0, 0, 0, 13, 249, 0, 0, 2, 223, 253, 0, 0, 0, 0, 0, 159, 192, 0, 0, 0, 13, 255, 0, 0, 0, 0, 0, 223, 128, 0, 0, 0, 5, 255, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 1, 255, 0, 0, 0, 0, 0, 255, 32, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 255, 96, 0, 0, 0, 8, 254, 0, 0, 0, 0, 0, 207, 160, 0, 0, 0, 12, 251, 0, 0, 0, 0, 0, 127, 226, 0, 0, 0, 95, 245, 0, 0, 0, 0, 0, 11, 253, 16, 0, 1, 223, 160, 0, 0, 0, 0, 0, 0, 175, 231, 0, 125, 250, 0, 0, 0, 0, 0, 0, 0, 6, 206, 255, 236, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 255, 255, 255, 255, 255, 255, 32, 0, 0, 0, 0, 207, 255, 255, 255, 255, 255, 255, 112, 0, 0, 0, 0, 111, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 222, 255, 237, 128, 0, 0, 0, 0, 0, 0, 2, 223, 199, 67, 123, 253, 32, 0, 0, 0, 0, 0, 12, 249, 0, 0, 0, 159, 192, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 63, 240, 0, 0, 0, 0, 0, 15, 251, 0, 0, 0, 191, 240, 0, 0, 0, 0, 0, 12, 255, 196, 0, 76, 255, 192, 0, 0, 0, 0, 0, 2, 223, 255, 188, 255, 254, 48, 0, 0, 0, 0, 0, 0, 10, 255, 255, 255, 177, 0, 0, 0, 0, 0, 0, 0, 9, 239, 237, 254, 144, 0, 0, 0, 0, 0, 0, 5, 223, 233, 16, 125, 253, 80, 0, 0, 0, 0, 0, 94, 251, 32, 0, 0, 175, 228, 0, 0, 0, 0, 0, 207, 176, 0, 0, 0, 10, 253, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 255, 80, 0, 0, 0, 5, 255, 0, 0, 0, 0, 0, 223, 208, 0, 0, 0, 12, 253, 0, 0, 0, 0, 0, 127, 254, 147, 0, 57, 239, 247, 0, 0, 0, 0, 0, 8, 255, 255, 255, 255, 255, 128, 0, 0, 0, 0, 0, 0, 58, 223, 255, 253, 162, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 141, 255, 253, 144, 0, 0, 0, 0, 0, 0, 0, 28, 255, 255, 255, 253, 48, 0, 0, 0, 0, 0, 0, 191, 252, 98, 107, 255, 208, 0, 0, 0, 0, 0, 6, 255, 144, 0, 0, 127, 250, 0, 0, 0, 0, 0, 12, 253, 0, 0, 0, 11, 254, 0, 0, 0, 0, 0, 14, 249, 0, 0, 0, 6, 255, 0, 0, 0, 0, 0, 15, 245, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 15, 242, 0, 0, 0, 4, 254, 0, 0, 0, 0, 0, 15, 249, 0, 0, 0, 9, 252, 0, 0, 0, 0, 0, 14, 255, 144, 0, 0, 62, 245, 0, 0, 0, 0, 0, 13, 251, 253, 132, 56, 239, 128, 0, 0, 0, 0, 0, 11, 252, 59, 239, 254, 197, 0, 0, 0, 0, 0, 0, 6, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 228, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 254, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 250, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 255, 252, 149, 32, 0, 0, 0, 0, 0, 0, 0, 2, 191, 255, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 2, 156, 239, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 245, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 255, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 231, 0, 0, 0, 0, 0, 0, 0, 0, 0, 26, 255, 255, 197, 0, 0, 0, 0, 0, 0, 0, 0, 0, 59, 255, 255, 179, 0, 0, 0, 0, 0, 0, 0, 0, 0, 76, 255, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 92, 255, 254, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 125, 255, 252, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 125, 255, 253, 16, 0, 0, 0, 0, 0, 0, 0, 92, 255, 254, 128, 0, 0, 0, 0, 0, 0, 0, 75, 255, 255, 160, 0, 0, 0, 0, 0, 0, 0, 42, 255, 255, 179, 0, 0, 0, 0, 0, 0, 0, 9, 239, 255, 213, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 231, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 109, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 76, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 26, 255, 255, 32, 0, 0, 0, 0, 0, 0, 0, 8, 239, 255, 215, 0, 0, 0, 0, 0, 0, 0, 6, 223, 255, 232, 0, 0, 0, 0, 0, 0, 0, 4, 207, 255, 233, 0, 0, 0, 0, 0, 0, 0, 1, 175, 255, 250, 16, 0, 0, 0, 0, 0, 0, 0, 126, 255, 251, 48, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 255, 251, 64, 0, 0, 0, 0, 0, 0, 0, 0, 2, 175, 255, 250, 32, 0, 0, 0, 0, 0, 0, 0, 0, 4, 207, 255, 233, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 223, 255, 232, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 239, 255, 215, 0, 0, 0, 0, 0, 0, 0, 0, 0, 42, 255, 255, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 76, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 109, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 157, 255, 235, 64, 0, 0, 0, 0, 0, 0, 0, 12, 255, 255, 255, 247, 0, 0, 0, 0, 0, 0, 0, 159, 251, 32, 126, 255, 64, 0, 0, 0, 0, 0, 0, 223, 176, 0, 4, 216, 0, 0, 0, 0, 0, 0, 0, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 205, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 59, 239, 254, 200, 0, 0, 0, 0, 0, 0, 0, 5, 239, 181, 55, 223, 194, 0, 0, 0, 0, 0, 0, 14, 250, 0, 0, 11, 253, 0, 0, 0, 0, 0, 0, 143, 224, 0, 0, 0, 223, 160, 0, 0, 0, 0, 0, 207, 169, 254, 255, 213, 95, 242, 0, 0, 0, 0, 0, 239, 120, 253, 87, 254, 45, 249, 0, 0, 0, 0, 0, 255, 87, 251, 0, 191, 170, 252, 0, 0, 0, 0, 0, 255, 38, 252, 0, 127, 215, 254, 0, 0, 0, 0, 0, 255, 52, 253, 0, 79, 244, 255, 0, 0, 0, 0, 0, 239, 82, 253, 0, 31, 242, 255, 0, 0, 0, 0, 0, 207, 144, 254, 0, 63, 243, 255, 0, 0, 0, 0, 0, 143, 177, 255, 80, 127, 230, 254, 0, 0, 0, 0, 0, 13, 247, 255, 212, 223, 169, 252, 0, 0, 0, 0, 0, 4, 223, 249, 223, 251, 13, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 239, 112, 0, 0, 0, 0, 0, 0, 11, 166, 53, 175, 248, 0, 0, 0, 0, 0, 0, 0, 44, 239, 255, 235, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 252, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 231, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 192, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 239, 128, 207, 176, 0, 0, 0, 0, 0, 0, 0, 6, 255, 48, 175, 224, 0, 0, 0, 0, 0, 0, 0, 11, 253, 0, 95, 244, 0, 0, 0, 0, 0, 0, 0, 13, 251, 0, 14, 250, 0, 0, 0, 0, 0, 0, 0, 79, 247, 0, 12, 253, 0, 0, 0, 0, 0, 0, 0, 159, 255, 255, 255, 255, 32, 0, 0, 0, 0, 0, 0, 223, 144, 0, 0, 223, 128, 0, 0, 0, 0, 0, 1, 255, 64, 0, 0, 175, 192, 0, 0, 0, 0, 0, 8, 254, 0, 0, 0, 111, 224, 0, 0, 0, 0, 0, 11, 252, 0, 0, 0, 15, 246, 0, 0, 0, 0, 0, 14, 249, 0, 0, 0, 12, 251, 0, 0, 0, 0, 0, 95, 243, 0, 0, 0, 10, 254, 0, 0, 0, 0, 0, 175, 224, 0, 0, 0, 5, 255, 64, 0, 0, 0, 0, 223, 176, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 74, 222, 255, 255, 237, 0, 0, 0, 0, 0, 0, 9, 254, 148, 0, 4, 255, 0, 0, 0, 0, 0, 0, 159, 209, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 239, 96, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 239, 128, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 175, 230, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 11, 255, 201, 100, 16, 255, 0, 0, 0, 0, 0, 0, 3, 191, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 143, 253, 167, 81, 0, 255, 0, 0, 0, 0, 0, 6, 255, 144, 0, 0, 0, 255, 0, 0, 0, 0, 0, 12, 251, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 245, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 247, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 13, 252, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 7, 255, 160, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 191, 253, 148, 0, 0, 255, 0, 0, 0, 0, 0, 0, 9, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 58, 222, 255, 255, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 173, 239, 254, 201, 0, 0, 0, 0, 0, 0, 0, 79, 255, 255, 255, 255, 231, 0, 0, 0, 0, 0, 0, 11, 217, 48, 5, 191, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 239, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 62, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 46, 253, 0, 0, 0, 0, 0, 6, 0, 0, 0, 3, 223, 246, 0, 0, 0, 0, 0, 175, 216, 32, 5, 175, 255, 128, 0, 0, 0, 0, 0, 191, 255, 255, 255, 255, 231, 0, 0, 0, 0, 0, 0, 5, 189, 255, 254, 201, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 173, 239, 255, 254, 192, 0, 0, 0, 0, 0, 3, 207, 255, 255, 255, 255, 240, 0, 0, 0, 0, 0, 94, 255, 217, 80, 0, 47, 240, 0, 0, 0, 0, 4, 239, 231, 0, 0, 0, 15, 240, 0, 0, 0, 0, 12, 254, 64, 0, 0, 0, 15, 240, 0, 0, 0, 0, 111, 247, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 191, 208, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 96, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 96, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 239, 128, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 143, 244, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 14, 253, 16, 0, 0, 0, 15, 240, 0, 0, 0, 0, 7, 255, 212, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 159, 255, 200, 48, 0, 15, 240, 0, 0, 0, 0, 0, 7, 239, 255, 255, 255, 255, 240, 0, 0, 0, 0, 0, 0, 7, 189, 239, 255, 254, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 207, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 143, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 6, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 108, 239, 255, 235, 64, 0, 0, 0, 0, 0, 0, 7, 255, 255, 255, 255, 249, 0, 0, 0, 0, 0, 0, 0, 188, 112, 0, 141, 255, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 255, 255, 255, 0, 0, 0, 63, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 63, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 111, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 159, 208, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 223, 176, 0, 0, 0, 0, 255, 0, 0, 0, 0, 6, 255, 96, 0, 0, 0, 0, 255, 0, 0, 0, 0, 30, 253, 0, 0, 0, 0, 0, 255, 16, 0, 0, 3, 223, 245, 0, 0, 0, 0, 0, 255, 234, 80, 4, 175, 255, 128, 0, 0, 0, 0, 0, 110, 255, 255, 255, 255, 231, 0, 0, 0, 0, 0, 0, 0, 140, 239, 255, 217, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 255, 255, 255, 255, 255, 253, 0, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 230, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 218, 134, 67, 33, 0, 0, 0, 0, 0, 0, 0, 73, 205, 239, 255, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 192, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 159, 251, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 9, 255, 160, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 175, 249, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 11, 255, 144, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 191, 248, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 12, 255, 112, 15, 240, 0, 0, 0, 0, 0, 0, 0, 2, 255, 246, 15, 240, 0, 0, 0, 0, 0, 0, 0, 11, 255, 254, 95, 240, 0, 0, 0, 0, 0, 0, 0, 95, 252, 239, 239, 240, 0, 0, 0, 0, 0, 0, 0, 223, 226, 78, 255, 240, 0, 0, 0, 0, 0, 0, 9, 255, 128, 4, 239, 240, 0, 0, 0, 0, 0, 0, 62, 253, 0, 0, 79, 240, 0, 0, 0, 0, 0, 0, 191, 244, 0, 0, 15, 240, 0, 0, 0, 0, 0, 6, 255, 160, 0, 0, 15, 240, 0, 0, 0, 0, 0, 13, 254, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 159, 247, 0, 0, 0, 15, 240, 0, 0, 0, 0, 3, 255, 192, 0, 0, 0, 15, 240, 0, 0, 0, 0, 12, 255, 48, 0, 0, 0, 15, 240, 0, 0, 0, 0, 127, 249, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 143, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 242, 0, 0, 0, 79, 255, 0, 0, 0, 0, 0, 255, 248, 0, 0, 0, 159, 255, 0, 0, 0, 0, 0, 255, 251, 0, 0, 0, 207, 255, 0, 0, 0, 0, 0, 255, 253, 0, 0, 0, 239, 255, 0, 0, 0, 0, 0, 255, 255, 32, 0, 4, 255, 255, 0, 0, 0, 0, 0, 255, 223, 128, 0, 9, 253, 255, 0, 0, 0, 0, 0, 255, 191, 176, 0, 12, 250, 255, 0, 0, 0, 0, 0, 255, 127, 224, 0, 14, 246, 255, 0, 0, 0, 0, 0, 255, 15, 243, 0, 95, 240, 255, 0, 0, 0, 0, 0, 255, 13, 248, 0, 175, 208, 255, 0, 0, 0, 0, 0, 255, 11, 251, 0, 223, 160, 255, 0, 0, 0, 0, 0, 255, 7, 254, 0, 255, 96, 255, 0, 0, 0, 0, 0, 255, 1, 255, 54, 255, 0, 255, 0, 0, 0, 0, 0, 255, 0, 223, 138, 253, 0, 255, 0, 0, 0, 0, 0, 255, 0, 191, 205, 250, 0, 255, 0, 0, 0, 0, 0, 255, 0, 127, 239, 246, 0, 255, 0, 0, 0, 0, 0, 255, 0, 31, 255, 240, 0, 255, 0, 0, 0, 0, 0, 255, 0, 13, 255, 208, 0, 255, 0, 0, 0, 0, 0, 255, 0, 11, 255, 160, 0, 255, 0, 0, 0, 0, 0, 255, 0, 6, 221, 96, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 14, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 159, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 239, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 9, 255, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 14, 251, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 159, 244, 255, 0, 0, 0, 0, 0, 15, 240, 0, 1, 239, 176, 255, 0, 0, 0, 0, 0, 15, 240, 0, 10, 255, 48, 255, 0, 0, 0, 0, 0, 15, 240, 0, 47, 251, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 175, 242, 0, 255, 0, 0, 0, 0, 0, 15, 240, 2, 255, 160, 0, 255, 0, 0, 0, 0, 0, 15, 240, 11, 255, 32, 0, 255, 0, 0, 0, 0, 0, 15, 240, 63, 250, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 191, 225, 0, 0, 255, 0, 0, 0, 0, 0, 15, 244, 255, 144, 0, 0, 255, 0, 0, 0, 0, 0, 15, 251, 254, 16, 0, 0, 255, 0, 0, 0, 0, 0, 15, 255, 249, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 255, 224, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 255, 144, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 254, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 125, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 12, 255, 255, 255, 252, 16, 0, 0, 0, 0, 0, 0, 207, 251, 48, 58, 255, 192, 0, 0, 0, 0, 0, 8, 255, 128, 0, 0, 111, 249, 0, 0, 0, 0, 0, 14, 251, 0, 0, 0, 9, 254, 0, 0, 0, 0, 0, 143, 243, 0, 0, 0, 0, 239, 128, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 191, 192, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 143, 224, 0, 0, 0, 0, 255, 80, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 255, 80, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 239, 128, 0, 0, 0, 0, 143, 224, 0, 0, 0, 0, 207, 176, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 143, 224, 0, 0, 0, 2, 255, 128, 0, 0, 0, 0, 14, 250, 0, 0, 0, 10, 254, 0, 0, 0, 0, 0, 9, 255, 96, 0, 0, 127, 249, 0, 0, 0, 0, 0, 0, 207, 250, 48, 58, 255, 192, 0, 0, 0, 0, 0, 0, 28, 255, 255, 255, 252, 32, 0, 0, 0, 0, 0, 0, 0, 141, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 189, 239, 254, 238, 220, 0, 0, 0, 0, 0, 2, 207, 233, 80, 0, 4, 255, 0, 0, 0, 0, 0, 29, 251, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 175, 208, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 239, 128, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 239, 112, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 207, 176, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 111, 246, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 9, 255, 128, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 126, 254, 167, 66, 37, 255, 0, 0, 0, 0, 0, 0, 0, 123, 222, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 125, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 12, 255, 255, 255, 252, 16, 0, 0, 0, 0, 0, 0, 207, 251, 48, 58, 255, 192, 0, 0, 0, 0, 0, 8, 255, 128, 0, 0, 111, 249, 0, 0, 0, 0, 0, 14, 251, 0, 0, 0, 9, 254, 0, 0, 0, 0, 0, 127, 242, 0, 0, 0, 0, 239, 128, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 191, 192, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 143, 224, 0, 0, 0, 0, 255, 80, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 255, 32, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 63, 240, 0, 0, 0, 0, 255, 80, 0, 0, 0, 0, 95, 240, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 159, 224, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 143, 242, 0, 0, 0, 3, 255, 128, 0, 0, 0, 0, 30, 250, 0, 0, 0, 11, 254, 0, 0, 0, 0, 0, 9, 255, 128, 0, 0, 159, 248, 0, 0, 0, 0, 0, 0, 207, 251, 99, 108, 255, 176, 0, 0, 0, 0, 0, 0, 28, 255, 255, 255, 251, 0, 0, 0, 0, 0, 0, 0, 0, 141, 255, 252, 112, 0, 0, 0, 0, 0, 0, 0, 0, 2, 239, 160, 0, 0, 0, 0, 0, 0, 0, 0, 54, 174, 255, 80, 0, 0, 0, 0, 0, 0, 0, 10, 255, 255, 249, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 235, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 91, 222, 255, 255, 237, 192, 0, 0, 0, 0, 0, 60, 253, 148, 0, 0, 79, 240, 0, 0, 0, 0, 2, 239, 160, 0, 0, 0, 15, 240, 0, 0, 0, 0, 11, 252, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 14, 247, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 15, 244, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 14, 249, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 10, 254, 48, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 239, 231, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 78, 255, 219, 134, 49, 31, 240, 0, 0, 0, 0, 0, 1, 191, 253, 239, 255, 255, 240, 0, 0, 0, 0, 0, 0, 223, 208, 0, 0, 15, 240, 0, 0, 0, 0, 0, 9, 255, 112, 0, 0, 15, 240, 0, 0, 0, 0, 0, 63, 252, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 191, 245, 0, 0, 0, 15, 240, 0, 0, 0, 0, 6, 255, 176, 0, 0, 0, 15, 240, 0, 0, 0, 0, 13, 255, 48, 0, 0, 0, 15, 240, 0, 0, 0, 0, 159, 250, 0, 0, 0, 0, 15, 240, 0, 0, 0, 2, 239, 225, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 173, 239, 255, 253, 181, 0, 0, 0, 0, 0, 0, 6, 255, 255, 255, 255, 255, 160, 0, 0, 0, 0, 0, 0, 186, 97, 0, 7, 191, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 142, 255, 246, 0, 0, 0, 0, 0, 0, 0, 4, 190, 255, 254, 112, 0, 0, 0, 0, 0, 0, 5, 207, 255, 255, 178, 0, 0, 0, 0, 0, 0, 2, 191, 255, 254, 145, 0, 0, 0, 0, 0, 0, 0, 61, 255, 252, 96, 0, 0, 0, 0, 0, 0, 0, 0, 207, 252, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 228, 0, 0, 0, 0, 3, 16, 0, 0, 0, 0, 46, 255, 183, 81, 53, 138, 223, 144, 0, 0, 0, 0, 4, 223, 255, 255, 255, 255, 255, 208, 0, 0, 0, 0, 0, 7, 206, 255, 255, 237, 184, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 255, 112, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 255, 32, 0, 0, 0, 1, 255, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 255, 112, 0, 0, 0, 7, 255, 0, 0, 0, 0, 0, 223, 160, 0, 0, 0, 9, 253, 0, 0, 0, 0, 0, 191, 208, 0, 0, 0, 13, 251, 0, 0, 0, 0, 0, 127, 246, 0, 0, 0, 95, 246, 0, 0, 0, 0, 0, 13, 254, 32, 0, 1, 223, 208, 0, 0, 0, 0, 0, 6, 255, 231, 0, 125, 255, 80, 0, 0, 0, 0, 0, 0, 143, 255, 255, 255, 247, 0, 0, 0, 0, 0, 0, 0, 5, 206, 255, 235, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 255, 128, 0, 0, 0, 0, 207, 208, 0, 0, 0, 0, 223, 192, 0, 0, 0, 1, 255, 144, 0, 0, 0, 0, 175, 224, 0, 0, 0, 8, 255, 48, 0, 0, 0, 0, 79, 246, 0, 0, 0, 12, 253, 0, 0, 0, 0, 0, 14, 251, 0, 0, 0, 14, 250, 0, 0, 0, 0, 0, 11, 254, 0, 0, 0, 111, 244, 0, 0, 0, 0, 0, 6, 255, 80, 0, 0, 191, 224, 0, 0, 0, 0, 0, 0, 239, 160, 0, 0, 239, 176, 0, 0, 0, 0, 0, 0, 191, 208, 0, 5, 255, 96, 0, 0, 0, 0, 0, 0, 127, 243, 0, 10, 254, 0, 0, 0, 0, 0, 0, 0, 15, 249, 0, 13, 251, 0, 0, 0, 0, 0, 0, 0, 12, 252, 0, 63, 247, 0, 0, 0, 0, 0, 0, 0, 8, 255, 16, 159, 240, 0, 0, 0, 0, 0, 0, 0, 2, 255, 128, 223, 192, 0, 0, 0, 0, 0, 0, 0, 0, 223, 193, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 159, 232, 255, 32, 0, 0, 0, 0, 0, 0, 0, 0, 63, 253, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 255, 128, 0, 0, 0, 0, 207, 192, 0, 0, 0, 0, 255, 144, 0, 0, 0, 0, 223, 176, 0, 0, 0, 0, 239, 176, 0, 0, 0, 0, 255, 144, 0, 0, 0, 0, 207, 192, 0, 0, 0, 2, 255, 112, 0, 0, 0, 0, 191, 208, 0, 0, 0, 6, 255, 64, 0, 0, 0, 0, 175, 224, 0, 0, 0, 9, 255, 0, 0, 0, 0, 0, 143, 240, 0, 239, 144, 10, 254, 0, 0, 0, 0, 0, 111, 243, 6, 255, 192, 12, 253, 0, 0, 0, 0, 0, 31, 247, 10, 255, 208, 13, 251, 0, 0, 0, 0, 0, 14, 249, 12, 255, 241, 14, 250, 0, 0, 0, 0, 0, 13, 250, 14, 255, 247, 31, 248, 0, 0, 0, 0, 0, 12, 251, 79, 255, 250, 111, 244, 0, 0, 0, 0, 0, 11, 253, 159, 252, 253, 143, 240, 0, 0, 0, 0, 0, 10, 254, 191, 217, 254, 175, 224, 0, 0, 0, 0, 0, 8, 255, 223, 181, 255, 207, 208, 0, 0, 0, 0, 0, 5, 255, 255, 128, 255, 255, 176, 0, 0, 0, 0, 0, 1, 255, 255, 48, 223, 255, 160, 0, 0, 0, 0, 0, 0, 239, 254, 0, 175, 255, 128, 0, 0, 0, 0, 0, 0, 223, 252, 0, 127, 255, 80, 0, 0, 0, 0, 0, 0, 207, 249, 0, 47, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 246, 0, 0, 0, 12, 255, 64, 0, 0, 0, 0, 14, 253, 0, 0, 0, 111, 250, 0, 0, 0, 0, 0, 7, 255, 128, 0, 0, 223, 225, 0, 0, 0, 0, 0, 0, 207, 224, 0, 7, 255, 128, 0, 0, 0, 0, 0, 0, 79, 250, 0, 13, 253, 0, 0, 0, 0, 0, 0, 0, 10, 255, 48, 159, 245, 0, 0, 0, 0, 0, 0, 0, 1, 239, 177, 239, 176, 0, 0, 0, 0, 0, 0, 0, 0, 143, 251, 254, 32, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 255, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 232, 255, 80, 0, 0, 0, 0, 0, 0, 0, 4, 255, 144, 207, 208, 0, 0, 0, 0, 0, 0, 0, 12, 253, 0, 95, 248, 0, 0, 0, 0, 0, 0, 0, 143, 247, 0, 11, 254, 32, 0, 0, 0, 0, 0, 1, 239, 192, 0, 2, 239, 176, 0, 0, 0, 0, 0, 10, 255, 80, 0, 0, 159, 245, 0, 0, 0, 0, 0, 95, 251, 0, 0, 0, 13, 253, 0, 0, 0, 0, 0, 207, 226, 0, 0, 0, 7, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 192, 0, 0, 0, 13, 254, 0, 0, 0, 0, 0, 159, 243, 0, 0, 0, 95, 249, 0, 0, 0, 0, 0, 14, 250, 0, 0, 0, 191, 224, 0, 0, 0, 0, 0, 10, 254, 0, 0, 2, 255, 160, 0, 0, 0, 0, 0, 2, 255, 128, 0, 9, 255, 32, 0, 0, 0, 0, 0, 0, 191, 208, 0, 14, 251, 0, 0, 0, 0, 0, 0, 0, 79, 245, 0, 127, 244, 0, 0, 0, 0, 0, 0, 0, 12, 251, 0, 207, 192, 0, 0, 0, 0, 0, 0, 0, 6, 255, 36, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 223, 171, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 238, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 255, 255, 255, 255, 255, 250, 0, 0, 0, 0, 0, 127, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 225, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 254, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 239, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 46, 255, 80, 0, 0, 0, 0, 207, 255, 255, 255, 255, 255, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 239, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 239, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 62, 255, 251, 0, 0, 0, 0, 0, 0, 0, 0, 1, 223, 213, 255, 144, 0, 0, 0, 0, 0, 0, 0, 12, 254, 48, 143, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 175, 255, 255, 255, 255, 255, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 204, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 207, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 191, 255, 218, 48, 0, 0, 0, 0, 0, 0, 0, 0, 174, 164, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 223, 255, 254, 220, 112, 0, 0, 0, 0, 0, 1, 223, 214, 0, 40, 207, 80, 0, 0, 0, 0, 0, 10, 253, 16, 0, 0, 2, 0, 0, 0, 0, 0, 0, 14, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 254, 255, 255, 237, 182, 0, 0, 0, 0, 0, 0, 15, 249, 99, 20, 106, 239, 176, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 12, 250, 0, 0, 0, 0, 0, 15, 241, 0, 0, 0, 5, 254, 0, 0, 0, 0, 0, 15, 249, 0, 0, 0, 3, 255, 0, 0, 0, 0, 0, 15, 255, 144, 0, 0, 8, 253, 0, 0, 0, 0, 0, 15, 247, 237, 130, 0, 142, 246, 0, 0, 0, 0, 0, 15, 240, 58, 239, 255, 235, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 108, 239, 255, 237, 255, 0, 0, 0, 0, 0, 0, 10, 254, 128, 3, 158, 255, 0, 0, 0, 0, 0, 0, 175, 209, 0, 0, 0, 255, 0, 0, 0, 0, 0, 5, 255, 48, 0, 0, 0, 255, 0, 0, 0, 0, 0, 12, 251, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 14, 247, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 244, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 242, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 246, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 13, 250, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 8, 253, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 223, 144, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 78, 248, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 4, 223, 198, 0, 24, 255, 0, 0, 0, 0, 0, 0, 0, 7, 206, 255, 254, 216, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 189, 239, 254, 218, 32, 0, 0, 0, 0, 0, 0, 9, 255, 255, 255, 255, 232, 0, 0, 0, 0, 0, 0, 2, 184, 32, 5, 175, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 223, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 62, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 239, 243, 0, 0, 0, 0, 0, 10, 182, 0, 6, 191, 255, 128, 0, 0, 0, 0, 0, 47, 255, 255, 255, 255, 231, 0, 0, 0, 0, 0, 0, 6, 190, 255, 254, 217, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 254, 255, 254, 200, 0, 0, 0, 0, 0, 0, 0, 15, 249, 99, 72, 207, 213, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 8, 255, 80, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 159, 224, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 13, 249, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 9, 253, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 5, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 8, 253, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 13, 249, 0, 0, 0, 0, 0, 15, 244, 0, 0, 0, 159, 208, 0, 0, 0, 0, 0, 15, 255, 165, 0, 91, 253, 48, 0, 0, 0, 0, 0, 15, 252, 239, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 206, 255, 236, 80, 0, 0, 0, 0, 0, 0, 0, 159, 255, 255, 255, 250, 0, 0, 0, 0, 0, 0, 9, 255, 198, 0, 91, 255, 160, 0, 0, 0, 0, 0, 47, 252, 0, 0, 0, 143, 245, 0, 0, 0, 0, 0, 175, 243, 0, 0, 0, 11, 251, 0, 0, 0, 0, 0, 223, 192, 0, 0, 0, 6, 254, 0, 0, 0, 0, 0, 239, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 255, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 246, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 239, 176, 0, 0, 0, 0, 0, 111, 200, 48, 4, 175, 251, 0, 0, 0, 0, 0, 0, 124, 223, 255, 255, 219, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 141, 255, 255, 217, 0, 0, 0, 0, 0, 0, 0, 0, 60, 149, 72, 223, 211, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 14, 255, 255, 255, 255, 255, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 191, 255, 255, 255, 255, 255, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 189, 255, 255, 218, 32, 0, 0, 0, 0, 0, 0, 15, 250, 99, 72, 207, 231, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 7, 255, 112, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 143, 225, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 13, 249, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 10, 253, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 6, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 8, 253, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 12, 248, 0, 0, 0, 0, 0, 15, 247, 0, 0, 0, 143, 208, 0, 0, 0, 0, 0, 15, 255, 198, 0, 75, 252, 32, 0, 0, 0, 0, 0, 15, 252, 239, 255, 236, 128, 0, 0, 0, 0, 0, 0, 14, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 252, 32, 0, 0, 0, 80, 0, 0, 0, 0, 0, 4, 255, 234, 99, 55, 174, 246, 0, 0, 0, 0, 0, 0, 110, 255, 255, 255, 255, 250, 0, 0, 0, 0, 0, 0, 0, 157, 239, 255, 235, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 9, 223, 254, 199, 0, 255, 0, 0, 0, 0, 0, 0, 207, 255, 255, 255, 176, 255, 0, 0, 0, 0, 0, 9, 255, 163, 1, 141, 252, 255, 0, 0, 0, 0, 0, 13, 251, 0, 0, 0, 159, 255, 0, 0, 0, 0, 0, 15, 246, 0, 0, 0, 10, 255, 0, 0, 0, 0, 0, 15, 241, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 255, 255, 248, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 95, 255, 255, 255, 255, 255, 255, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 255, 255, 255, 208, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 239, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 251, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 223, 252, 168, 101, 50, 0, 0, 0, 0, 0, 0, 0, 5, 172, 238, 255, 255, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 125, 220, 80, 0, 0, 0, 255, 0, 0, 0, 0, 0, 8, 255, 247, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 110, 255, 144, 0, 0, 255, 0, 0, 0, 0, 0, 0, 4, 223, 252, 16, 0, 255, 0, 0, 0, 0, 0, 0, 0, 28, 255, 212, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 223, 254, 96, 255, 0, 0, 0, 0, 0, 0, 0, 9, 255, 255, 249, 255, 0, 0, 0, 0, 0, 0, 0, 79, 254, 77, 255, 255, 0, 0, 0, 0, 0, 0, 0, 223, 247, 0, 191, 255, 0, 0, 0, 0, 0, 0, 9, 255, 176, 0, 9, 255, 0, 0, 0, 0, 0, 0, 79, 254, 32, 0, 0, 255, 0, 0, 0, 0, 0, 0, 223, 247, 0, 0, 0, 255, 0, 0, 0, 0, 0, 9, 255, 176, 0, 0, 0, 255, 0, 0, 0, 0, 0, 95, 254, 16, 0, 0, 0, 255, 0, 0, 0, 0, 0, 223, 247, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 255, 254, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 10, 255, 255, 255, 255, 255, 255, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 223, 232, 8, 239, 213, 255, 0, 0, 0, 0, 0, 11, 255, 255, 143, 255, 254, 255, 0, 0, 0, 0, 0, 14, 250, 62, 255, 208, 94, 255, 0, 0, 0, 0, 0, 15, 244, 7, 255, 112, 8, 255, 0, 0, 0, 0, 0, 15, 241, 2, 255, 48, 3, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 255, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 223, 254, 199, 0, 221, 0, 0, 0, 0, 0, 0, 207, 255, 255, 255, 176, 255, 0, 0, 0, 0, 0, 9, 255, 163, 1, 141, 251, 255, 0, 0, 0, 0, 0, 13, 251, 0, 0, 0, 159, 255, 0, 0, 0, 0, 0, 15, 246, 0, 0, 0, 10, 255, 0, 0, 0, 0, 0, 15, 241, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
18,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 206, 255, 235, 80, 0, 0, 0, 0, 0, 0, 0, 191, 214, 0, 126, 249, 0, 0, 0, 0, 0, 0, 11, 252, 0, 0, 2, 223, 144, 0, 0, 0, 0, 0, 95, 242, 0, 0, 0, 95, 244, 0, 0, 0, 0, 0, 191, 176, 0, 0, 0, 12, 251, 0, 0, 0, 0, 0, 239, 112, 0, 0, 0, 8, 254, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 255, 32, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 239, 128, 0, 0, 0, 8, 254, 0, 0, 0, 0, 0, 191, 176, 0, 0, 0, 11, 251, 0, 0, 0, 0, 0, 79, 244, 0, 0, 0, 79, 245, 0, 0, 0, 0, 0, 9, 253, 0, 0, 1, 223, 160, 0, 0, 0, 0, 0, 0, 175, 214, 0, 126, 250, 0, 0, 0, 0, 0, 0, 0, 6, 206, 255, 236, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 108, 239, 239, 236, 255, 0, 0, 0, 0, 0, 0, 11, 254, 129, 2, 158, 255, 0, 0, 0, 0, 0, 0, 191, 193, 0, 0, 2, 255, 0, 0, 0, 0, 0, 6, 254, 32, 0, 0, 0, 255, 0, 0, 0, 0, 0, 12, 250, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 14, 246, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 245, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 13, 249, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 10, 253, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 1, 239, 112, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 127, 230, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 6, 239, 182, 0, 24, 255, 0, 0, 0, 0, 0, 0, 0, 9, 206, 255, 253, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 190, 255, 254, 217, 0, 0, 0, 0, 0, 0, 0, 15, 249, 82, 72, 223, 229, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 8, 255, 96, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 159, 224, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 13, 249, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 9, 253, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 5, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 8, 253, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 12, 250, 0, 0, 0, 0, 0, 15, 243, 0, 0, 0, 159, 225, 0, 0, 0, 0, 0, 15, 254, 146, 0, 108, 253, 64, 0, 0, 0, 0, 0, 15, 252, 239, 255, 237, 128, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 157, 239, 235, 64, 255, 255, 255, 0, 0, 0, 0, 0, 223, 255, 255, 228, 255, 255, 255, 0, 0, 0, 0, 0, 91, 80, 75, 252, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 15, 255, 255, 255, 255, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 158, 255, 255, 238, 180, 0, 0, 0, 0, 0, 0, 0, 59, 114, 0, 23, 238, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 125, 255, 240, 0, 0, 0, 0, 0, 0, 0, 2, 174, 255, 255, 208, 0, 0, 0, 0, 0, 0, 0, 175, 255, 255, 253, 64, 0, 0, 0, 0, 0, 0, 45, 255, 255, 253, 128, 0, 0, 0, 0, 0, 0, 0, 191, 255, 235, 80, 0, 0, 0, 0, 0, 0, 0, 0, 255, 232, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 232, 16, 5, 157, 226, 0, 0, 0, 0, 0, 0, 62, 255, 255, 255, 255, 249, 0, 0, 0, 0, 0, 0, 2, 174, 255, 255, 219, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 191, 255, 255, 255, 255, 255, 255, 176, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 160, 0, 0, 0, 0, 0, 0, 0, 2, 53, 141, 254, 32, 0, 0, 0, 0, 0, 0, 0, 239, 255, 253, 179, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 2, 255, 0, 0, 0, 0, 0, 15, 240, 0, 0, 0, 5, 254, 0, 0, 0, 0, 0, 15, 241, 0, 0, 0, 9, 251, 0, 0, 0, 0, 0, 15, 252, 32, 0, 0, 46, 244, 0, 0, 0, 0, 0, 15, 248, 234, 64, 6, 223, 128, 0, 0, 0, 0, 0, 15, 240, 92, 239, 254, 198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 247, 0, 0, 0, 13, 254, 0, 0, 0, 0, 0, 14, 252, 0, 0, 0, 63, 250, 0, 0, 0, 0, 0, 10, 255, 16, 0, 0, 175, 244, 0, 0, 0, 0, 0, 4, 255, 128, 0, 0, 223, 208, 0, 0, 0, 0, 0, 0, 223, 192, 0, 5, 255, 144, 0, 0, 0, 0, 0, 0, 143, 242, 0, 10, 255, 16, 0, 0, 0, 0, 0, 0, 31, 249, 0, 14, 252, 0, 0, 0, 0, 0, 0, 0, 11, 253, 0, 111, 246, 0, 0, 0, 0, 0, 0, 0, 6, 255, 64, 191, 224, 0, 0, 0, 0, 0, 0, 0, 0, 239, 160, 239, 160, 0, 0, 0, 0, 0, 0, 0, 0, 175, 215, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 63, 253, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 224, 0, 255, 160, 7, 255, 64, 0, 0, 0, 0, 159, 240, 5, 255, 192, 9, 255, 0, 0, 0, 0, 0, 127, 243, 8, 255, 224, 11, 253, 0, 0, 0, 0, 0, 63, 246, 11, 255, 240, 12, 252, 0, 0, 0, 0, 0, 15, 248, 13, 254, 246, 13, 250, 0, 0, 0, 0, 0, 13, 250, 14, 251, 249, 14, 247, 0, 0, 0, 0, 0, 12, 251, 79, 217, 251, 15, 243, 0, 0, 0, 0, 0, 10, 252, 143, 198, 253, 95, 240, 0, 0, 0, 0, 0, 9, 253, 175, 160, 254, 143, 208, 0, 0, 0, 0, 0, 6, 254, 207, 112, 239, 175, 192, 0, 0, 0, 0, 0, 1, 255, 239, 16, 207, 223, 160, 0, 0, 0, 0, 0, 0, 239, 254, 0, 175, 255, 112, 0, 0, 0, 0, 0, 0, 223, 252, 0, 143, 255, 48, 0, 0, 0, 0, 0, 0, 207, 250, 0, 79, 254, 0, 0, 0, 0, 0, 0, 0, 175, 248, 0, 15, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 254, 32, 0, 0, 159, 250, 0, 0, 0, 0, 0, 5, 255, 192, 0, 4, 255, 208, 0, 0, 0, 0, 0, 0, 159, 248, 0, 13, 255, 64, 0, 0, 0, 0, 0, 0, 13, 254, 48, 159, 249, 0, 0, 0, 0, 0, 0, 0, 4, 239, 196, 255, 192, 0, 0, 0, 0, 0, 0, 0, 0, 143, 254, 254, 48, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 255, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 250, 255, 112, 0, 0, 0, 0, 0, 0, 0, 7, 255, 144, 207, 227, 0, 0, 0, 0, 0, 0, 0, 62, 253, 0, 79, 252, 0, 0, 0, 0, 0, 0, 0, 207, 245, 0, 9, 255, 128, 0, 0, 0, 0, 0, 9, 255, 160, 0, 0, 207, 244, 0, 0, 0, 0, 0, 95, 253, 0, 0, 0, 79, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 224, 0, 0, 0, 12, 254, 0, 0, 0, 0, 0, 63, 247, 0, 0, 0, 63, 250, 0, 0, 0, 0, 0, 12, 252, 0, 0, 0, 175, 242, 0, 0, 0, 0, 0, 8, 255, 32, 0, 0, 239, 192, 0, 0, 0, 0, 0, 0, 239, 144, 0, 7, 255, 80, 0, 0, 0, 0, 0, 0, 191, 208, 0, 12, 253, 0, 0, 0, 0, 0, 0, 0, 95, 244, 0, 79, 248, 0, 0, 0, 0, 0, 0, 0, 13, 250, 0, 175, 224, 0, 0, 0, 0, 0, 0, 0, 9, 254, 0, 239, 160, 0, 0, 0, 0, 0, 0, 0, 2, 255, 104, 255, 48, 0, 0, 0, 0, 0, 0, 0, 0, 207, 189, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 255, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 241, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 221, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 255, 255, 255, 255, 255, 249, 0, 0, 0, 0, 0, 11, 255, 226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 239, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 207, 254, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 46, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 255, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 239, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 255, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 254, 0, 0, 0, 0, 0, 143, 255, 255, 255, 255, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 254, 196, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 255, 80, 0, 0, 0, 0, 0, 0, 0, 0, 4, 122, 255, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 249, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 252, 132, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 223, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 239, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 143, 253, 149, 0, 0, 0, 0, 0, 0, 0, 0, 0, 239, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 223, 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 255, 112, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 191, 208, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 79, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 111, 240, 0, 0, 0, 0, 0, 0, 0, 0, 4, 121, 239, 208, 0, 0, 0, 0, 0, 0, 0, 0, 8, 255, 255, 96, 0, 0, 0, 0, 0, 0, 0, 0, 5, 254, 197, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 108, 237, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 254, 151, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 251, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 144, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 253, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 207, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 253, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 252, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 89, 223, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 255, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 254, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 159, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 255, 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 252, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 245, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 255, 151, 64, 0, 0, 0, 0, 0, 0, 0, 0, 6, 255, 255, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 76, 239, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 158, 112, 0, 3, 207, 254, 144, 0, 0, 0, 0, 0, 175, 192, 0, 126, 198, 77, 250, 0, 0, 0, 0, 0, 95, 249, 58, 250, 0, 3, 255, 32, 0, 0, 0, 0, 8, 223, 253, 96, 0, 0, 221, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
};
};
| [
"matt@majenko.co.uk"
] | matt@majenko.co.uk |
fbd1176ace81daecf00c4e803c1f7f3aea256218 | abb1eea21e89926b177eae47aa1da6cd8494574b | /05_Command_5/ControlledSystems/Music.hpp | 0fa3615bd84a6568b6f9bd7ac999e3f9178b4f12 | [] | no_license | oleggy-gvz/DesignPatterns_samples | cb4fe897b3f12d137999067292e97fb2c9fc093c | 530242280fb7d283e6432f02b87f6d0282b6bf31 | refs/heads/master | 2020-05-09T22:00:06.523688 | 2019-10-04T04:08:53 | 2019-10-04T04:08:53 | 181,455,313 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 328 | hpp | #ifndef MUSIC_HPP
#define MUSIC_HPP
#include "Commands\ICommand.hpp"
class Music
{
public:
State _state;
void TurnOn()
{
cout << "Music on" << endl;
_state = State::On;
}
void TurnOff()
{
cout << "Music off" << endl;
_state = State::Off;
}
};
#endif // MUSIC_HPP
| [
"oleggy.gvz@gmail.com"
] | oleggy.gvz@gmail.com |
75a368df991c0726510cf711a564cc5dc655fd1a | e272d18a042e6b6808bc615917b1783d53607870 | /misc/Online Contests/2003, November 8/I - Game Tree.cpp | db75656cb20876d2d585c0d9432dc65038dcbce2 | [] | no_license | chessdroid/morbidel-timus | 58656c7a62132aaae71289a20ee77baeca4ba554 | b079bf3ae716d4eeb54722037ac55066f9e9da7c | refs/heads/master | 2020-07-10T02:20:08.032088 | 2013-04-11T20:48:39 | 2013-04-11T20:48:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,569 | cpp | /*
* ACM Timus Online Contest, 8 November 2003
* Problem 9 -> Game tree
*/
#include <stdio.h>
#include <stdlib.h>
#define NODS 10200
int n, a[NODS], b[NODS], gr[NODS], tata[NODS];
struct graf
{
int nod;
graf *next;
} *g[NODS];
void readdata()
{
char ch;
int i;
graf *q;
scanf("%d", &n);
for (i = 2; i <= n; i++)
{
scanf("\n%c %d", &ch, &tata[i]);
q = (graf*) malloc(sizeof(*q));
q -> nod = i; q -> next = g[tata[i]]; g[tata[i]] = q;
if (ch == 'N') gr[tata[i]]++;
if (ch == 'L') /* frunza */
scanf("%d", &a[i]), b[i] = a[i], gr[i] = -1;
}
}
void solve()
{
int i, j, ok, nod, next, w1, d1, w2, d2;
graf *q;
for (nod = 0, i = 1; i <= n; i++)
if (!gr[i])
nod = i, i = n;
for (j = 0; j < n; j++)
{
if (gr[nod] < 0 || nod == 10000) break;
/* avem frunza nod, calculez a[nod] si b[nod] */
for (w1 = w2 = d1 = d2 = 0, q = g[nod]; q; q = q -> next)
{
next = q -> nod;
switch (b[next])
{
case 0: d1++; break;
case 1: w1++; break;
}
switch (a[next])
{
case 0: d2++; break;
case -1: w2++; break;
}
}
a[nod] = w1 ? 1 : (d1 ? 0 : -1);
b[nod] = w2 ? -1 : (d2 ? 0 : 1);
/* caut urm. frunza minima */
for (next = 10000, i = nod + 1; i <= n; i++)
if (!gr[i])
next = i, i = n;
if (--gr[tata[nod]] == 0 && tata[nod] < next)
next = tata[nod];
gr[nod] = -1; nod = next;
}
if (a[1] == 1) printf("+");
printf("%d\n", a[1]);
}
int main()
{
readdata();
solve();
return 0;
}
| [
"stefangh@gmail.com"
] | stefangh@gmail.com |
cef6ac05f3184f7832302002dc4132c59909fc58 | d33049720b378a043d3eb0cf676fedde4997184d | /Teme/ASD/Tema3/Liste_Polinoame/main.cpp | 444fd4493c74611215326b5a98264a507f4d017b | [] | no_license | AntonioDrk/MaterialeFMI2017-2018 | 033d5651fe7513bcf1cc29b2c7913f087ac5cbc2 | 8d0d4c677dc1ce50a439cf07a496da627409f3c7 | refs/heads/master | 2021-09-26T12:57:28.275473 | 2018-10-30T13:52:42 | 2018-10-30T13:52:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,899 | cpp | #include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
struct nod {
int info;
nod *next;
};
struct pol {
int gr,coef;
pol *next;
};
ifstream fin("in.in");
void inserareOrdonata(nod*&head, int &size, int x){
nod* p = head;
nod* tmp = nullptr;
if( p == nullptr){ /// Daca nu exista HEAD
p = new nod;
p->info = x;
p->next = nullptr;
head = p;
size++;
return;
}
if(x <= head->info){ /// Daca elementul pe care incerc sa-l inserez e mai mic decat HEAD
nod *q = new nod;
q->info = x;
q->next = head;
head = q;
size++;
return;
}
while(p != nullptr){ ///Parcurg sa vad unde trebuie inserat elementul
if(x >= p->info){
tmp = p;
}
p = p->next;
}
if(tmp != nullptr) ///Pe pozitia tmp (care e cu una la stanga fata de p) inseram in fata lui noul elem.
{
nod *q = new nod;
q->info = x;
q->next = tmp->next;
tmp->next = q;
size++;
}
}
void inserareOrdonataPolin(pol*&head, int &size, int grad, int coef){
pol* p = head;
pol* tmp = nullptr;
if( p == nullptr){ /// Daca nu exista HEAD
p = new pol;
p->gr = grad;
p->coef = coef;
p->next = nullptr;
head = p;
size++;
return;
}
if(grad <= head->gr){ /// Daca elementul pe care incerc sa-l inserez e mai mic decat HEAD
pol *q = new pol;
q->gr = grad;
q->coef = coef;
q->next = head;
head = q;
size++;
return;
}
while(p != nullptr){ ///Parcurg sa vad unde trebuie inserat elementul
if(grad >= p->gr){
tmp = p;
}
p = p->next;
}
if(tmp != nullptr) ///Pe pozitia tmp (care e cu una la stanga fata de p) inseram in fata lui noul elem.
{
pol *q = new pol;
q->gr = grad;
q->coef = coef;
q->next = tmp->next;
tmp->next = q;
size++;
}
}
void showList(nod* head){
nod* p = head;
if( p == nullptr ){
cout<< "Lista este goala";
return;
}
while( p != nullptr ){
cout << p->info << " ";
p = p->next;
}
}
void showListPolin(pol* head){ ///Afisarea polinomului
pol* p = head;
if( p == nullptr ){
cout<< "Polinomul nu exista";
return;
}
while( p != nullptr ){
cout << p->coef << "x^" << p->gr << " " ;
p = p->next;
}
cout << '\n';
}
/*void pushBack(pol *&vf, pol *&sf, int &size, int coef, int gr) {
size ++;
pol *p = new pol;
p->coef = coef;
p->gr = gr;
p->next = nullptr;
if(sf == nullptr) {
vf = sf = p;
} else {
sf->next = p;
sf = p;
}
}
void pushFront(pol *&vf, pol *&sf, int &size, int coef, int gr) {
size ++;
pol *p = new pol;
p->coef = coef;
p->gr = gr;
if(vf == nullptr) {
vf = sf = p;
p->urm = nullptr;
} else {
p->urm = vf;
vf = p;
}
}
void deleteAll(pol *vf, pol *sf, int &size) {
if( vf == sf ) {
cout << "Lista deja nu exista!" << '\n';
} else {
pol *p = vf;
pol *tmp = p;
while( p != nullptr ) {
tmp = p->urm;
delete p;
p = tmp;
}
vf = sf;
size = 0;
}
}
void sortList(pol *&vf, pol *&sf, int &size) {
pol* vf_rez,*sf_rez;
vf_rez = sf_rez = nullptr;
int size_rez = 0;
int min = vf->gr;
pol* minpointer = vf;
while(size > 0){
for(pol *p = vf; p != nullptr; p = p->urm){
if(p->gr < min){
min = p->gr;
minpointer = p;
}
}
pushBack(vf_rez,sf_rez,size_rez,minpointer->coef,minpointer->gr);
size--;
}
size = size_rez;
vf = vf_rez;
sf = sf_rez;
}*/
void citireLista(nod *&head, int &size){
int n;
fin >> n;
for(int i=0; i<n; i++){
int x;
fin >> x;
inserareOrdonata(head,size,x);
}
showList(head);
}
void citireListaPoli(pol *&head, int &size){
int n;
fin >> n;
for(int i=0; i<n; i++){
int grad,coef;
fin >> grad;
fin >> coef;
inserareOrdonataPolin(head,size,grad,coef);
}
showListPolin(head);
}
void problema2(){
int size1 = 0;
pol *head = nullptr;
int multiplier;
citireListaPoli(head,size1);
fin >> multiplier;
pol *p = head;
while(p != nullptr){
p->coef *= multiplier;
p = p->next;
}
showListPolin(head);
}
void problema3(){
int size1 = 0;
pol *head = nullptr;
int evalNumber;
int result = 0;
citireListaPoli(head,size1);
fin >> evalNumber;
pol* p = head;
while( p != nullptr ){
result += p->coef * pow(evalNumber, p->gr);
p = p->next;
}
cout << "P(" << evalNumber << ") = " << result;
}
void problema4(){
int size1, size2, size3;
size1 = size2 = size3 = 0;
pol *head1, *head2, *head3;
head1 = head2 = head3 = nullptr;
cout << "P(x) = ";
citireListaPoli(head1, size1);
cout << "+\nQ(x) = ";
citireListaPoli(head2, size2);
pol *p = (size1 >= size2)?head1:head2;
while(p != nullptr){
pol *q = (size1 <= size2)?head1:head2;
int ok = 0;
while(q != nullptr){
if(p->gr == q->gr){
int newCoef = p->coef + q->coef;
inserareOrdonataPolin(head3, size3, p->gr, newCoef);
ok = 1;
}
q = q->next;
}
if(ok == 0){
inserareOrdonataPolin(head3, size3, p->gr, p->coef);
}
p = p->next;
}
showListPolin(head3);
}
int main()
{
///nod* head = nullptr;
problema4();
return 0;
}
| [
"ekro98@gmail.com"
] | ekro98@gmail.com |
2b4de4372d027a02a2efeabbb6c19dd7336ca17b | bcf138c82fcba9acc7d7ce4d3a92618b06ebe7c7 | /gta5/0x4B7620C47217126C.cpp | d4b0cab3133a57fabb18138c35bbcb7a6dc3d53b | [] | no_license | DeepWolf413/additional-native-data | aded47e042f0feb30057e753910e0884c44121a0 | e015b2500b52065252ffbe3c53865fe3cdd3e06c | refs/heads/main | 2023-07-10T00:19:54.416083 | 2021-08-12T16:00:12 | 2021-08-12T16:00:12 | 395,340,507 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 207 | cpp | // fm_content_island_heist.ysc @ L33566
bool func_981(int iParam0)
{
return ((func_855(7) && WEAPON::IS_FLASH_LIGHT_ON(iLocal_12605)) && func_982(NETWORK::NET_TO_PED(Local_12697.f_134[iParam0 /*22*/])));
} | [
"jesper15fuji@live.dk"
] | jesper15fuji@live.dk |
927037bd230a5b76813abc3e1fbe16c8d6afeb1a | b7d4e7e24f6b37c990c45c96b837798d7e229f14 | /prototype/point-cloud-streaming/pcd_read/pcd_read.cpp | adac389660293bb075d6eedff07f2b226a645b77 | [
"MIT"
] | permissive | taimooralam/master-thesis | f16725bbbbb125a3a169c023f55a2546fe21a383 | dcb988a2866e65e2faef67627428d1ffd1c0182e | refs/heads/master | 2020-04-09T05:05:56.356492 | 2018-12-16T23:57:15 | 2018-12-16T23:57:15 | 160,051,042 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,578 | cpp | #include <iostream>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <pcl/io/tar.h>
#include <boost/any.hpp>
#include <boost/filesystem.hpp>
#include <boost/foreach.hpp>
#include <pcl/compression/octree_pointcloud_compression.h>
#include <sstream>
#include <typeinfo>
#include "base64.h"
namespace fs = boost::filesystem;
class Comdecomp
{
public:
Comdecomp(){
//constructor
showStatistics = false;
compressionProfile = pcl::io::MED_RES_ONLINE_COMPRESSION_WITHOUT_COLOR;
PointCloudEncoder = new pcl::io::OctreePointCloudCompression<pcl::PointXYZ>(compressionProfile, showStatistics);
PointCloudDecoder = new pcl::io::OctreePointCloudCompression<pcl::PointXYZ>();
//Open the fifo here
char * fifo = "/tmp/pipe.log";
mkfifo(fifo, 0777);
std::cout << " o ";
fd_fifo = open(fifo, O_WRONLY);
std::cout << "cc " << std::endl;
}
bool showStatistics;
pcl::io::compression_Profiles_e compressionProfile;
pcl::io::OctreePointCloudCompression<pcl::PointXYZ>* PointCloudEncoder;
pcl::io::OctreePointCloudCompression<pcl::PointXYZ>* PointCloudDecoder;
int fd_fifo;
int read_decompressed(std::string filename, pcl::PointCloud<pcl::PointXYZ>::Ptr cloud){
return pcl::io::loadPCDFile<pcl::PointXYZ>(filename, *cloud);
}
int write_compressed(std::stringstream &stream){
//TODO: write a compressed stringstream to a file
//send the string stream to the fifo here
const std::string& tmp = stream.str();
//std::cout << "last 50 characters of compressed data: \n" << tmp.substr(tmp.length()-50) << std::endl;
std::cout << " Compressed: " << tmp.length() << std::endl;
//std::cout << tmp.length() << std::endl;
std::string encoded = base64_encode(reinterpret_cast<const unsigned char*>(tmp.c_str()), tmp.length()) + "~";
std::cout << "Encoded: " << encoded.length() << std::endl;
const char* cstr = encoded.c_str();
write(fd_fifo, cstr, encoded.length()); //todo: correct the arguments here
std::cout << " w ";
return 0;
}
~Comdecomp(){
//std::cout << "Destroying Compdecomp: \n";
delete PointCloudEncoder;
delete PointCloudDecoder;
//close the fifo here
close(fd_fifo);
}
};
int main(int argc, char ** argv){
//std::ofstream out("out.txt");
//std::streambuf *coutbuf = std::cout.rdbuf(); //save old buf
//std::cout.rdbuf(out.rdbuf()); //redirect std::cout to out.txt!
std::cout << "Start ---- " << std::endl;
Comdecomp codec;
fs::path targetDir(argv[1]);
fs::directory_iterator it(targetDir), eod;
BOOST_FOREACH(fs::path const&p, std::make_pair(it, eod)){
if(fs::is_regular_file(p)){
pcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);
//if(pcl::io::loadPCDFile<pcl::PointXYZ> ("test_pcd.pcd", *cloud) == -1){
std::string filename = p.string();
std::cout << p << std::endl;
if(codec.read_decompressed(filename, cloud) == -1){
std::cout << p << std::endl;
PCL_ERROR("Could read the file \n");
}else{
std::cout << "\n L ";
}
std::stringstream compressed_data;
codec.PointCloudEncoder->encodePointCloud(cloud, compressed_data);
codec.write_compressed(compressed_data);
//std::cout << compressed_data.str().size() << std::endl;
//std::cout << typeid(compressed_data).name() << std::endl;
//std::cout << "Loaded "
//<< cloud->width * cloud->height
//<< " data points from test_pcd.pcd with the following fields: " << std::endl;
}else{
std::cout << "Not a regular file" << std::endl;
}
}
//std::cout.rdbuf(coutbuf); //reset to standard output again
return 0;
}
| [
"taimoor.alam12@gmail.com"
] | taimoor.alam12@gmail.com |
95e82cfe00379cb9dc3ce95a89e98615a3f36a95 | dd8437ee950bd46fc36505221f432e6bb4fb926b | /stage2/testRFID/testRFID.ino | 1c179339cb5fbc03d913810ef9f2d11b4fbcb3d3 | [] | no_license | alexbhandari/WTT | d5b7592f6e2f8dd0312592d159620e1e6ce8e0c6 | 34a851c93ec2582705371b9f99ad241b3a8095aa | refs/heads/master | 2016-09-11T01:07:14.354329 | 2014-07-18T21:15:04 | 2014-07-18T21:15:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 327 | ino | #include <serLCD.h>
#include <SD.h>
#include <SoftwareSerial.h>
#include <SPI.h>
String tag="";
SoftwareSerial master(4, 5);
//Init
void setup()
{
// master.begin(9600,SERIAL_8O2);
master.begin(9600);
}
void loop()
{
master.print("rfid 9823732346\r");
delay(100);
master.print("rfid 1823798345\r");
delay(100);
}
| [
"alexbhandari@Alexs-MacBook-Air.local"
] | alexbhandari@Alexs-MacBook-Air.local |
fc247cdf0301b69f95600a63c7f75303c4df04af | 4eaa809ac3f505b83e33172b1d4a099e71c2926a | /openFoam/cases/heavingCylinder/1/uniform/profilingInfo | ad059fce09bbbb9459bcda56d264e76bb4e5f561 | [
"MIT"
] | permissive | krajit/krajit.github.io | 3c4326b8c8b674afd7bbf735caca95824ed194ed | 5f81be0c4b940c3a6a2646c166f99d0c3b515432 | refs/heads/master | 2021-12-04T22:40:12.267880 | 2021-12-02T01:42:03 | 2021-12-02T01:42:03 | 98,024,086 | 1 | 8 | null | null | null | null | UTF-8 | C++ | false | false | 8,098 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | foam-extend: Open Source CFD |
| \\ / O peration | Version: 3.2 |
| \\ / A nd | Web: http://www.foam-extend.org |
| \\/ M anipulation | For copyright notice see file Copyright |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class regIOobject;
location "1/uniform";
object profilingInfo;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
profilingInfo
(
{
id 29;
parentId 28;
description "Foam::Time::writeObject - outputTime";
calls 90;
totalTime 6.500284;
childTime 0;
onStack 1;
}
{
id 28;
parentId 1;
description "Foam::Time::writeObject";
calls 90;
totalTime 6.501319;
childTime 6.500284;
onStack 1;
}
{
id 1;
description "application::main";
calls 1;
totalTime 62.116727;
childTime 15.503189;
onStack 1;
}
{
id 13;
parentId 1;
description "MULES::explicitSolve";
calls 270;
totalTime 1.785667;
childTime 0;
onStack 0;
}
{
id 7;
parentId 6;
description "functionObjectList::read";
calls 1;
totalTime 1.2e-05;
childTime 0;
onStack 0;
}
{
id 30;
parentId 1;
description "functionObjects_.execute()";
calls 89;
totalTime 0.001012;
childTime 0;
onStack 0;
}
{
id 6;
parentId 1;
description "functionObjects_.start()";
calls 1;
totalTime 2.9e-05;
childTime 1.2e-05;
onStack 0;
}
{
id 14;
parentId 1;
description "fvMatrix::solve_U";
calls 90;
totalTime 0.572828;
childTime 0.420817;
onStack 0;
}
{
id 8;
parentId 1;
description "fvMatrix::solve_cellDisplacement";
calls 90;
totalTime 1.625932;
childTime 1.542191;
onStack 0;
}
{
id 24;
parentId 1;
description "fvMatrix::solve_epsilon";
calls 90;
totalTime 0.287244;
childTime 0.241469;
onStack 0;
}
{
id 26;
parentId 1;
description "fvMatrix::solve_k";
calls 90;
totalTime 0.249015;
childTime 0.233246;
onStack 0;
}
{
id 2;
parentId 1;
description "fvMatrix::solve_pcorr";
calls 1;
totalTime 0.029091;
childTime 0.02888;
onStack 0;
}
{
id 19;
parentId 1;
description "fvMatrix::solve_pd";
calls 360;
totalTime 4.451052;
childTime 4.374192;
onStack 0;
}
{
id 16;
parentId 15;
description "lduMatrix::smoother_Ux";
calls 90;
totalTime 0.191478;
childTime 0;
onStack 0;
}
{
id 18;
parentId 17;
description "lduMatrix::smoother_Uy";
calls 90;
totalTime 0.185628;
childTime 0;
onStack 0;
}
{
id 15;
parentId 14;
description "lduMatrix::solver_Ux";
calls 90;
totalTime 0.214249;
childTime 0.191478;
onStack 0;
}
{
id 17;
parentId 14;
description "lduMatrix::solver_Uy";
calls 90;
totalTime 0.206568;
childTime 0.185628;
onStack 0;
}
{
id 9;
parentId 8;
description "lduMatrix::solver_cellDisplacementx";
calls 90;
totalTime 0.997556;
childTime 0.037178;
onStack 0;
}
{
id 11;
parentId 8;
description "lduMatrix::solver_cellDisplacementy";
calls 90;
totalTime 0.544635;
childTime 0.017643;
onStack 0;
}
{
id 5;
parentId 4;
description "lduMatrix::solver_coarsestLevelCorr";
calls 8;
totalTime 0.000339;
childTime 0;
onStack 0;
}
{
id 10;
parentId 9;
description "lduMatrix::solver_coarsestLevelCorr";
calls 420;
totalTime 0.037178;
childTime 0;
onStack 0;
}
{
id 12;
parentId 11;
description "lduMatrix::solver_coarsestLevelCorr";
calls 226;
totalTime 0.017643;
childTime 0;
onStack 0;
}
{
id 21;
parentId 20;
description "lduMatrix::solver_coarsestLevelCorr";
calls 875;
totalTime 0.054362;
childTime 0;
onStack 0;
}
{
id 23;
parentId 22;
description "lduMatrix::solver_coarsestLevelCorr";
calls 546;
totalTime 0.026767;
childTime 0;
onStack 0;
}
{
id 4;
parentId 3;
description "lduMatrix::solver_dummy";
calls 1;
totalTime 0.02858;
childTime 0.000339;
onStack 0;
}
{
id 22;
parentId 20;
description "lduMatrix::solver_dummy";
calls 90;
totalTime 2.039453;
childTime 0.026767;
onStack 0;
}
{
id 25;
parentId 24;
description "lduMatrix::solver_epsilon";
calls 90;
totalTime 0.241469;
childTime 0;
onStack 0;
}
{
id 27;
parentId 26;
description "lduMatrix::solver_k";
calls 90;
totalTime 0.233246;
childTime 0;
onStack 0;
}
{
id 3;
parentId 2;
description "lduMatrix::solver_pcorr";
calls 1;
totalTime 0.02888;
childTime 0.02858;
onStack 0;
}
{
id 20;
parentId 19;
description "lduMatrix::solver_pd";
calls 360;
totalTime 4.374192;
childTime 2.093815;
onStack 0;
}
);
// ************************************************************************* //
| [
"ajitkumar22@gmail.com"
] | ajitkumar22@gmail.com | |
fdde25f1352dc47fe166da4cdf8b49d52c83614a | 832a52bc7c7810512dfb1846e1116d0c81995fcd | /Function/question 1/question 1/Source.cpp | 4ea3cc285fed7bd462c4aa0795041a107d9c8a4d | [] | no_license | RoryVaughn/Homework | be39c5b96a4045bc9bccc33036a636061660c52a | fe4e1ea99f1cdd097767277844e469141cdd8bc8 | refs/heads/master | 2020-04-16T08:04:34.661795 | 2015-10-21T16:46:33 | 2015-10-21T16:46:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 460 | cpp | #include <iostream>
void PrintInteger(int variable)
{
std::cout << variable << std::endl;
}
int main()
{
int the_variable = 1;
PrintInteger(the_variable);
{
PrintInteger(the_variable);
int the_variable = 2;
PrintInteger(the_variable);
{
PrintInteger(the_variable);
int the_variable = 3;
PrintInteger(the_variable);
}
PrintInteger(the_variable);
}
PrintInteger(the_variable);
}//the output of this fuction is: 1, 1, 2, 2, 3, 2, 1
| [
"Rvaughn2525@gmail.com"
] | Rvaughn2525@gmail.com |
423c1820b5e5a21bde546201261adce66636fd72 | 29c59030394b01eba7d68aa10f3201f0a72da60e | /JobArrivalEvent.h | eed0cbb6a480ca49962ecb5181d5e18af13dcc49 | [] | no_license | alexandrahurst/SchedulingSimulator | a75c78f4c07267b1fa087e74823d1cb928374a83 | b9112b87fd74adbdd96bca680a57625cd213ed43 | refs/heads/master | 2020-03-16T20:31:41.678911 | 2018-05-25T08:31:14 | 2018-05-25T08:31:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 418 | h | // Alexandra Hurst & Kalyani Khutale
// CISC-361
// 2018-05-24
// Final Project
#ifndef _JOB_ARRIVAL_EVENT_H_
#define _JOB_ARRIVAL_EVENT_H_
#include "Event.h"
#include "Job.h"
class SystemState;
class JobArrivalEvent : public Event {
public:
JobArrivalEvent(int time, Job job);
void process(SystemState& state);
Type get_type() const;
private:
Job m_job;
};
#endif // _JOB_ARRIVAL_EVENT_H_
| [
"alexa@Yin.alx"
] | alexa@Yin.alx |
f5764ce7e955d734bbf4bf81408b37b4b4821f8d | f1a9e001d3b56da3464101d68fcdd313e86ccf72 | /RaspPiFiles/serialTester/serialTester.ino | 5915870043b584416141e9a9110ad765f9ac55cc | [] | no_license | danielcagostinho/4G06parkme | c49b741c4770546de2bddfd65b9a7351ef6374ff | b64ff0c3a9d9de138bd5cc857d6642c18d280ca7 | refs/heads/master | 2020-03-30T16:51:27.277979 | 2019-03-25T17:00:31 | 2019-03-25T17:00:31 | 151,430,489 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,988 | ino |
#include <Ultrasonic.h>
// Declaration of Ultrasonic Pins
const unsigned int TxPin1 = 11; // Sensor 1 Trigger
const unsigned int RxPin1 = 10; // Sensor 1 Echo
const unsigned int TxPin2= 13; // Sensor 2 Trigger
const unsigned int RxPin2 = 12; // Sensor 2 Echo
const unsigned int TxPin3 = 7; // Sensor 3 Trigger
const unsigned int RxPin3 = 6; // Sensor 3 Echo
const unsigned int TxPin4 = 9; // Sensor 4 Trigger
const unsigned int RxPin4 = 8; // Sensor 4 Echo
// Sensor IDs
const char sensorID1[24] = "5c4946c9ac8f790000f001cf";
const char sensorID2[24] = "5c4be566bc01840000b851d3";
const char sensorID3[24] = "5c534fd3a2b1de00000ed7a3";
const char sensorID4[24] = "5c53504ea2b1de00000ed7a4";
// Other Pins
//int redPin1 = 5;
//int greenPin1 = 3;
//int ledCol1[] = {0,0};
// State Variables
bool read1 = false;
bool read2 = false;
bool read3 = false;
bool read4 = false;
bool loopdist = true;
// Threshold Distance
int threshold = 5; // Will sense at a range of 120cm
Ultrasonic sensor1(TxPin1, RxPin1);
Ultrasonic sensor2(TxPin2, RxPin2);
Ultrasonic sensor3(TxPin3, RxPin3);
Ultrasonic sensor4(TxPin4, RxPin4);
void setup()
{
Serial.begin(9600);
// pinMode(redPin0, OUTPUT);
// pinMode(greenPin0, OUTPUT);
pinMode(TxPin1, OUTPUT);
pinMode(RxPin1, INPUT);
pinMode(TxPin2, OUTPUT);
pinMode(RxPin2, INPUT);
pinMode(TxPin3, OUTPUT);
pinMode(RxPin3, INPUT);
pinMode(TxPin4, OUTPUT);
pinMode(RxPin4, INPUT);
}
void loop()
{
// int distance1 = sensor1.read(CM);
// int distance2 = sensor2.read(CM);
// int distance3 = sensor3.read(CM);
// int distance4 = sensor4.read(CM);
int distance1=100, distance2=100, distance3=100, distance4=100;
if (loopdist == true){
Serial.println("5c4946c9ac8f790000f001cf, 1"); // Sensor 1
Serial.println("5c4be566bc01840000b851d3, 1"); // Sensor 2
Serial.println("5c534fd3a2b1de00000ed7a3, 0"); // Sensor 3
Serial.println("5c53504ea2b1de00000ed7a4, 0"); // Sensor 4
loopdist = false;
} else {
Serial.println("5c4946c9ac8f790000f001cf,0");
Serial.println("5c4be566bc01840000b851d3,0");
Serial.println("5c534fd3a2b1de00000ed7a3,1");
Serial.println("5c53504ea2b1de00000ed7a4,1");
loopdist = false;
}
//
// //Check first sensor
// if (distance1 <= threshold && read1 == false) { // if it is within range and the previous state was unoccupied
// read1 = true; // set state to occupied
// Serial.println("5c4946c9ac8f790000f001cf,1");
// } else if(distance1 > threshold && read1 == true) { // if it is not within range and the previous state was occupiedM
// read1 = false;
// Serial.println("5c4946c9ac8f790000f001cf,0");
// }
// //Check second sensor
// if (distance2 <= threshold && read2 == false) { // if it is within range and the previous state was unoccupied
// read2 = true; // set state to occupied
// Serial.println("5c4be566bc01840000b851d3,1");
// } else if(distance2 > threshold && read2 == true) { // if it is not within range and the previous state was occupied
// read2 = false;
// Serial.println("5c4be566bc01840000b851d3,0");
// }
// //Check first sensor
// if (distance3 <= threshold && read3 == false) { // if it is within range and the previous state was unoccupied
// read3 = true; // set state to occupied
// Serial.println("5c534fd3a2b1de00000ed7a3,1");
// } else if(distance3 > threshold && read3 == true) { // if it is not within range and the previous state was occupied
// read3 = false;
// Serial.println("5c534fd3a2b1de00000ed7a3,0");
// }
// //Check first sensor
// if (distance4 <= threshold && read4 == false) { // if it is within range and the previous state was unoccupied
// read4 = true; // set state to occupied
// Serial.println("5c53504ea2b1de00000ed7a4,1");
// } else if(distance4 > threshold && read4 == true) { // if it is not within range and the previous state was occupied
// read4 = false;
// Serial.println("5c53504ea2b1de00000ed7a4,0");
// }
delay(10000);
}
| [
"danielcagostinho@gmail.com"
] | danielcagostinho@gmail.com |
772e0fb1535223915459e4cfd984abac8bc891f2 | 32da1cd9597d377fdd5a75e7cadce72302f9f914 | /include/QRcode.h | 1b879d6749f5afc518f19c7504c455d508c5b595 | [] | no_license | 20SecondsToSun/PhotoBooth | 44df6c48b46734f49b4a1e27706d6820ac962518 | 02b315431b953aaea4b981a66ca1e83c212550d9 | refs/heads/master | 2016-09-06T00:17:29.384787 | 2014-12-17T10:52:29 | 2014-12-17T10:52:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 727 | h | #pragma once
#include "cinder/app/AppNative.h"
#include "cinder/gl/Texture.h"
#include "cinder/gl/gl.h"
#include "cinder/Text.h"
#include "PreloaderCircle.h"
#include "AssetsManager.h"
#include "Utils.h"
using namespace std;
class QRcode
{
public:
void draw();
void setup();
void drawError();
bool isReady, isRender;
void setTexture(ci::gl::Texture qrCodeTexture);
void setLink(std::string link, ci::Font qrCodeFont);
void setTextureString(std::string str);
private:
ci::gl::Texture qrCodeTextTexture;
ci::gl::Texture qrCodeTexture, *errorTexture;
ci::Font qrCodeFont;
std::string url;
std::string stringQrcode;
gl::Texture loadImageFromString(std::string value);
}; | [
"yurikblech@gmail.com"
] | yurikblech@gmail.com |
0f3c831898bf50ea9f32763ed877bffbfaf4d17c | d38609ea8bdc9602fdfadeb9080350920b1c8726 | /src/MainSceneWidget.hpp | 9817c8f3b0e4a7fa468c7e351c90b6124ea17baa | [] | no_license | veleswel/PlayrixTestTask | 1517dc97e97337aefd4ab2d0335a6331eea4d936 | 96569ffb473d9df745d867a69f4f56c37842a7fb | refs/heads/master | 2020-03-22T00:45:04.923293 | 2019-07-02T17:54:03 | 2019-07-02T17:54:03 | 139,261,459 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,382 | hpp | #pragma once
#include "GameStateHandler.hpp"
class QuadTree;
class Wall;
typedef std::unique_ptr<Wall> WallPtr;
class Projectile;
typedef boost::intrusive_ptr<Projectile> ProjectilePtr;
class Cannon;
typedef std::unique_ptr<Cannon> CannonPtr;
class Bubble;
typedef boost::intrusive_ptr<Bubble> BubblePtr;
typedef std::unique_ptr<EffectsContainer> EffectsContainerPtr;
// Основной виджет в игре. Содержит все игровые объекты,
// контейнер с эффектами, обрабатывает пользовательский ввод,
// управляет состоянием игры, управляет определением и разрешением столкновений
class MainSceneWidget: public GUI::Widget
{
public:
MainSceneWidget(const std::string& name, rapidxml::xml_node<>* elem);
void Draw() override;
void Update(float dt) override;
void AcceptMessage(const Message& message) override;
bool MouseDown(const IPoint& mouse_pos) override;
virtual void KeyPressed(int keyCode) override;
protected:
void Init();
// Метод, который вычитывает из файла стартовые данные
void ReadInitialData();
// Метод, который вычитывает из файла пару "ключ-значение"
template<typename T>
T ReadLineAndGetValue(IO::TextReader* reader, const std::string& valueName)
{
std::string out, name, value;
T result = 0;
out = reader->ReadAsciiLine();
if (utils::ReadNvp(out, name, value) && name == valueName)
{
result = utils::lexical_cast<T>(value);
}
else
{
Log::Error("Failed to read data from file");
assert(false);
}
return result;
}
void StartNewGame();
void PauseGame();
void ResumeGame();
void Win();
void Loose();
void FinishGame();
void DrawFinishImageAndText();
void CalculateFinishImagePosition();
void UpdateCannon(float dt);
void UpdateGameItems(float dt);
void CheckAndResolveProjectilesCollisions(float dt, QuadTree& quadTree);
void CheckAndResolveBubblesCollisions(float dt, QuadTree& quadTree);
void DrawProjectiles();
void LaunchProjectile();
const FPoint CalculateProjectileStartPosition() const;
void RemoveProjectile(const ProjectilePtr& projectile);
void DrawBubbles();
void LaunchBubbles();
void RemoveBubble(const BubblePtr& projectile);
void FillQuadTree(QuadTree& quad);
protected:
static const float MinBubbleSpeed;
static const float MaxBubbleSpeed;
static const float BubbleLaunchScreenOffset;
static const float CannonPositionYOffset;
static const float InfoTextXOffset;
static const float LaunchedTextYOffset;
static const float BubblesTextYOffset;
static const float TimeTextYOffset;
static const float FinishImageYOffset;
static const float MenuEnterTextYOffset;
protected:
float _projectileSpeed;
int _startBubblesCount;
float _playTime;
const FPoint _startPosition;
const FRect _screenRect;
CannonPtr _cannon;
std::list<ProjectilePtr> _launchedProjectiles;
std::list<BubblePtr> _bubbles;
EffectsContainerPtr _effectContainer;
std::array<WallPtr, 4> _walls;
size_t _projectilesTotalLaunched;
Core::Timer _timer;
float _timeLeft;
Render::TexturePtr _background;
Render::TexturePtr _gameFinishImage;
IPoint _gameFinishPosition;
GameStateHandler& _gameStateHandlerRef;
};
| [
"alex.vlasenko1991@gmail.com"
] | alex.vlasenko1991@gmail.com |
19fc1fc55554bba93a0a7de7b88c165c48f4d3e0 | 81b6521d8204a962b908094deb8998c291cdb07b | /lightoj/1341.cpp | d76d3f48e6a4fde8655a9e82fcb663c54da88578 | [] | no_license | doldre/ACM | 9c86c242a347e5b31daa365ddf0e835af7468fa9 | 23e4694fee51831831b1346b8ccc0e97eebef20a | refs/heads/master | 2020-04-12T02:29:59.345719 | 2017-04-10T08:15:10 | 2017-04-10T08:15:10 | 55,833,991 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,002 | cpp | /************************************************
*Author :mathon
*Created Time :四 4/21 21:22:04 2016
*Problem class:
*************************************************/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <stack>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
vector<int> vi;
#define xx first
#define yy second
#define sa(n) scanf("%d", &(n))
#define rep(i, a, n) for (int i = a; i < n; i++)
#define vep(c) for(decltype((c).begin() ) it = (c).begin(); it != (c).end(); it++)
#define pr(x) cout << #x << " " << x << " "
#define prln(x) cout << #x << " " << x << endl
const int maxn = 1e6 + 5;
int primes[maxn];
bool isprime[maxn];
int cntp = 0;
void init() {
memset(isprime, true, sizeof(isprime));
for (int i = 2; i < maxn; i++) {
if(isprime[i]) {
primes[cntp++] = i;
for (int j = i + i; j < maxn; j += i) {
isprime[j] = false;
}
}
}
}
int main(void)
{
#ifdef LOCAL
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif
int T;
init();
cin >> T;
for (int Cas = 1; Cas <= T; Cas++) {
ll a, b;
cin >> a >> b;
ll t = a;
if(a / b <= b) {
printf("Case %d: %d\n", Cas, 0);
continue;
}
int ans = 1;
for (int i = 0; i < cntp && primes[i] * primes[i] <= a; i++) {
int cnt = 0;
int x = primes[i];
while(a % x == 0) {
cnt++;
a /= x;
}
ans *= (cnt + 1);
}
if(a > 1) ans *= 2;
ans /= 2;
for (int i = 1; i < b; i++) {
if(t % i == 0) ans--;
}
printf("Case %d: %d\n", Cas, ans);
}
return 0;
}
| [
"luoxinchen96@gmail.com"
] | luoxinchen96@gmail.com |
b11225c2964a41768b284b7813a4539a71ed1534 | 9b30e07cfd0a9e2253041db66d0d236fe1abe17c | /AviSynthPlus/src/Anime4KCPPASP.cpp | c88b52995c7cb3f9dc1a98e52623c1d50288f2c2 | [
"MIT"
] | permissive | smoothmiao/Anime4KCPP | 32d4d0954548d02a04aa3ee1f2c17d5aaa0dd96a | 95173e282a556dfd98719e9e1ddb86947de8c683 | refs/heads/master | 2022-11-10T01:42:00.018548 | 2020-06-24T01:22:15 | 2020-06-24T01:22:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,233 | cpp | #include <avisynth.h>
#include "Anime4KCPP.h"
#ifdef _MSC_VER
#define AC_STDCALL __stdcall
#define AC_CDECL __cdecl
#define AC_DLL __declspec(dllexport)
#else
#define AC_STDCALL __attribute__((__stdcall__))
#define AC_CDECL __attribute__((__cdecl__))
#define AC_DLL
#endif
enum AC_Parameters
{
AC_passes = 1,
AC_pushColorCount = 2,
AC_strengthColor = 3,
AC_strengthGradient = 4,
AC_zoomFactor = 5,
AC_ACNet = 6,
AC_GPUMode = 7,
AC_HDN = 8,
AC_platformID = 9,
AC_deviceID = 10
};
class Anime4KCPPF : public GenericVideoFilter
{
public:
Anime4KCPPF(
PClip _child,
Anime4KCPP::Parameters& inputs,
bool CNN,
bool GPUMode,
unsigned int pID,
unsigned int dID,
IScriptEnvironment* env
);
PVideoFrame __stdcall GetFrame(int n, IScriptEnvironment* env);
private:
Anime4KCPP::Parameters parameters;
Anime4KCPP::Anime4KCreator anime4KCreator;
bool GPUMode;
bool CNN;
};
Anime4KCPPF::Anime4KCPPF(
PClip _child,
Anime4KCPP::Parameters& inputs,
bool CNN,
bool GPUMode,
unsigned int pID,
unsigned int dID,
IScriptEnvironment* env
) :
GenericVideoFilter(_child),
parameters(inputs),
anime4KCreator(GPUMode, CNN, pID, dID),
GPUMode(GPUMode),
CNN(CNN)
{
if (!vi.IsRGB24() && (!vi.IsYUV() || vi.BitsPerComponent() != 8 || !vi.IsPlanar()))
{
env->ThrowError("Anime4KCPP: RGB24 or planar YUV 8bit data only!");
}
if (vi.IsYUV() && !CNN)
{
env->ThrowError("Anime4KCPP: YUV only for ACNet!");
}
vi.height *= inputs.zoomFactor;
vi.width *= inputs.zoomFactor;
}
PVideoFrame AC_STDCALL Anime4KCPPF::GetFrame(int n, IScriptEnvironment* env)
{
PVideoFrame src = child->GetFrame(n, env);
PVideoFrame dst = env->NewVideoFrameP(vi, &src);
if (vi.IsYUV())
{
int srcPitchY = src->GetPitch(PLANAR_Y);
int dstPitchY = dst->GetPitch(PLANAR_Y);
int srcPitchU = src->GetPitch(PLANAR_U);
int dstPitchU = dst->GetPitch(PLANAR_U);
int srcPitchV = src->GetPitch(PLANAR_V);
int dstPitchV = dst->GetPitch(PLANAR_V);
int srcHY = src->GetHeight(PLANAR_Y);
int srcLY = src->GetRowSize(PLANAR_Y);
int srcHU = src->GetHeight(PLANAR_U);
int srcLU = src->GetRowSize(PLANAR_U);
int srcHV = src->GetHeight(PLANAR_V);
int srcLV = src->GetRowSize(PLANAR_V);
int dstHY = dst->GetHeight(PLANAR_Y);
int dstLY = dst->GetRowSize(PLANAR_Y);
int dstHU = dst->GetHeight(PLANAR_U);
int dstLU = dst->GetRowSize(PLANAR_U);
int dstHV = dst->GetHeight(PLANAR_V);
int dstLV = dst->GetRowSize(PLANAR_V);
const unsigned char* srcpY = src->GetReadPtr(PLANAR_Y);
const unsigned char* srcpU = src->GetReadPtr(PLANAR_U);
const unsigned char* srcpV = src->GetReadPtr(PLANAR_V);
unsigned char* dstpY = dst->GetWritePtr(PLANAR_Y);
unsigned char* dstpU = dst->GetWritePtr(PLANAR_U);
unsigned char* dstpV = dst->GetWritePtr(PLANAR_V);
unsigned char* srcDataY = new unsigned char[static_cast<size_t>(srcHY) * static_cast<size_t>(srcLY)];
unsigned char* srcDataU = new unsigned char[static_cast<size_t>(srcHU) * static_cast<size_t>(srcLU)];
unsigned char* srcDataV = new unsigned char[static_cast<size_t>(srcHV) * static_cast<size_t>(srcLV)];
for (int y = 0; y < srcHY; y++)
{
memcpy(srcDataY + y * static_cast<size_t>(srcLY), srcpY, srcLY);
srcpY += srcPitchY;
if (y < srcHU)
{
memcpy(srcDataU + y * static_cast<size_t>(srcLU), srcpU, srcLU);
srcpU += srcPitchU;
}
if (y < srcHV)
{
memcpy(srcDataV + y * static_cast<size_t>(srcLV), srcpV, srcLV);
srcpV += srcPitchV;
}
}
Anime4KCPP::Anime4K* anime4K;
if (GPUMode)
anime4K = anime4KCreator.create(parameters, Anime4KCPP::ProcessorType::GPUCNN);
else
anime4K = anime4KCreator.create(parameters, Anime4KCPP::ProcessorType::CPUCNN);
anime4K->loadImage(srcHY, srcLY, srcDataY, srcHU, srcLU, srcDataU, srcHV, srcLV, srcDataV);
anime4K->process();
size_t dstSize = anime4K->getResultDataPerChannelLength();
unsigned char* dstDataY = new unsigned char[dstSize];
unsigned char* dstDataU = new unsigned char[dstSize];
unsigned char* dstDataV = new unsigned char[dstSize];
anime4K->saveImage(dstDataY, dstDataU, dstDataV);
for (int y = 0; y < dstHY; y++)
{
memcpy(dstpY, dstDataY + y * static_cast<size_t>(dstLY), dstLY);
dstpY += dstPitchY;
if (y < dstHU)
{
memcpy(dstpU, dstDataU + y * static_cast<size_t>(dstLU), dstLU);
dstpU += dstPitchU;
}
if (y < dstHV)
{
memcpy(dstpV, dstDataV + y * static_cast<size_t>(dstLV), dstLV);
dstpV += dstPitchV;
}
}
anime4KCreator.release(anime4K);
delete[] dstDataY;
delete[] dstDataU;
delete[] dstDataV;
delete[] srcDataY;
delete[] srcDataU;
delete[] srcDataV;
return dst;
}
else
{
int srcPitch = src->GetPitch();
int dstPitch = dst->GetPitch();
int srcH = src->GetHeight();
int srcL = src->GetRowSize();
int dstH = dst->GetHeight();
int dstL = dst->GetRowSize();
const unsigned char* srcp = src->GetReadPtr();
unsigned char* dstp = dst->GetWritePtr();
unsigned char* srcData = new unsigned char[static_cast<size_t>(srcH) * static_cast<size_t>(srcL)];
for (int y = 0; y < srcH; y++)
{
memcpy(srcData + y * static_cast<size_t>(srcL), srcp, srcL);
srcp += srcPitch;
}
Anime4KCPP::Anime4K* anime4K;
if (CNN)
if (GPUMode)
anime4K = anime4KCreator.create(parameters, Anime4KCPP::ProcessorType::GPUCNN);
else
anime4K = anime4KCreator.create(parameters, Anime4KCPP::ProcessorType::CPUCNN);
else
if (GPUMode)
anime4K = anime4KCreator.create(parameters, Anime4KCPP::ProcessorType::GPU);
else
anime4K = anime4KCreator.create(parameters, Anime4KCPP::ProcessorType::CPU);
anime4K->loadImage(srcH, srcL / 3, srcData);
anime4K->process();
unsigned char* dstData = new unsigned char[anime4K->getResultDataLength()];
anime4K->saveImage(dstData);
for (int y = 0; y < dstH; y++)
{
memcpy(dstp, dstData + y * static_cast<size_t>(dstL), dstL);
dstp += dstPitch;
}
anime4KCreator.release(anime4K);
delete[] dstData;
delete[] srcData;
return dst;
}
}
AVSValue AC_CDECL createAnime4KCPP(AVSValue args, void* user_data, IScriptEnvironment* env)
{
Anime4KCPP::Parameters inputs(
args[AC_passes].AsInt(),
args[AC_pushColorCount].AsInt(),
args[AC_strengthColor].AsFloatf(),
args[AC_strengthGradient].AsFloatf(),
args[AC_zoomFactor].AsInt(),
false, false, false, false, 4, 40,std::thread::hardware_concurrency(),
args[AC_HDN].AsBool()
);
bool CNN = args[AC_ACNet].AsBool();
bool GPUMode = args[AC_GPUMode].AsBool();
unsigned int pID = args[AC_platformID].AsInt();
unsigned int dID = args[AC_deviceID].AsInt();
if (!args[AC_passes].Defined())
inputs.passes = 2;
if (!args[AC_pushColorCount].Defined())
inputs.pushColorCount = 2;
if (!args[AC_strengthColor].Defined())
inputs.strengthColor = 0.3;
if (!args[AC_strengthGradient].Defined())
inputs.strengthGradient = 1.0;
if (!args[AC_zoomFactor].Defined())
inputs.zoomFactor = 1.0;
if (!args[AC_ACNet].Defined())
CNN = false;
if (!args[AC_GPUMode].Defined())
GPUMode = false;
if (!args[AC_platformID].Defined())
pID = 0;
if (!args[AC_deviceID].Defined())
dID = 0;
if (inputs.strengthColor < 0.0 || inputs.strengthColor>1.0)
env->ThrowError("Anime4KCPP: strengthColor must range from 0 to 1!");
if (inputs.strengthGradient < 0.0 || inputs.strengthGradient>1.0)
env->ThrowError("Anime4KCPP: strengthGradient must range from 0 to 1!");
if (inputs.zoomFactor < 1.0)
env->ThrowError("Anime4KCPP: zoomFactor must be an integer which >= 1!");
if (GPUMode)
{
std::pair<bool, std::string> ret =
Anime4KCPP::Anime4KGPU::checkGPUSupport(pID, dID);
if (!ret.first)
{
std::ostringstream err;
err << "Anime4KCPP: The current device is unavailable" << std::endl
<< "Your input is: " << std::endl
<< " platform ID: " << pID << std::endl
<< " device ID: " << dID << std::endl
<< "Error: " << std::endl
<< " " + ret.second << std::endl;
env->ThrowError(err.str().c_str());
}
}
return new Anime4KCPPF(
args[0].AsClip(),
inputs,
CNN,
GPUMode,
pID,
dID,
env
);
}
AVSValue AC_CDECL listGPUs(AVSValue args, void* user_data, IScriptEnvironment* env)
{
env->ThrowError(Anime4KCPP::Anime4KGPU::listGPUs().second.c_str());
return AVSValue();
}
const AVS_Linkage* AVS_linkage = 0;
extern "C" AC_DLL const char* AC_STDCALL AvisynthPluginInit3(IScriptEnvironment * env, const AVS_Linkage* const vectors)
{
AVS_linkage = vectors;
env->AddFunction("listGPUs", "", listGPUs, 0);
env->AddFunction("Anime4KCPP",
"[src]c"
"[passes]i"
"[pushColorCount]i"
"[strengthColor]f"
"[strengthGradient]f"
"[zoomFactor]i"
"[ACNet]b"
"[GPUMode]b"
"[HDN]b"
"[platformID]i"
"[deviceID]i",
createAnime4KCPP, 0);
return "Anime4KCPP plugin for AviSynthPlus";
}
| [
"TianLin2112@outlook.com"
] | TianLin2112@outlook.com |
f53d9fac32a4aec11aa5fe8b42c718e6f56416aa | 046b675cb8529d1585a688f21563eb0209c94f19 | /src/Control2012/libreoffice/com/sun/star/sheet/Solver.hpp | b93b506ea3f117baeda8650a95ac5b56f34eec18 | [] | no_license | yoshi5534/schorsch-the-robot | a2a4bd35668600451e53bd8d7f879df90dcb9994 | 77eb8dcabaad5da3908d6b4b78a05985323f9ba4 | refs/heads/master | 2021-03-12T19:41:35.524173 | 2013-04-17T20:00:29 | 2013-04-17T20:00:29 | 32,867,962 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,478 | hpp | #ifndef INCLUDED_COM_SUN_STAR_SHEET_SOLVER_HPP
#define INCLUDED_COM_SUN_STAR_SHEET_SOLVER_HPP
#include "sal/config.h"
#include "com/sun/star/uno/RuntimeException.hpp"
#include "com/sun/star/uno/XComponentContext.hpp"
#include "com/sun/star/uno/Exception.hpp"
#include "com/sun/star/uno/DeploymentException.hpp"
#include "com/sun/star/lang/XMultiComponentFactory.hpp"
#include "com/sun/star/sheet/XSolver.hpp"
#include "com/sun/star/uno/Reference.hxx"
#include "cppu/unotype.hxx"
#include "rtl/ustring.h"
#include "rtl/ustring.hxx"
namespace com { namespace sun { namespace star { namespace sheet {
class Solver {
public:
static ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSolver > create(::com::sun::star::uno::Reference< ::com::sun::star::uno::XComponentContext > const & the_context) {
::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiComponentFactory > the_factory(the_context->getServiceManager());
if (!the_factory.is()) {
throw ::com::sun::star::uno::DeploymentException(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("component context fails to supply service manager")), the_context);
}
::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSolver > the_instance;
try {
the_instance = ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSolver >(the_factory->createInstanceWithContext(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("com.sun.star.sheet.Solver")), the_context), ::com::sun::star::uno::UNO_QUERY);
} catch (::com::sun::star::uno::RuntimeException &) {
throw;
} catch (::com::sun::star::uno::Exception & the_exception) {
throw ::com::sun::star::uno::DeploymentException(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("component context fails to supply service com.sun.star.sheet.Solver of type com.sun.star.sheet.XSolver: ")) + the_exception.Message, the_context);
}
if (!the_instance.is()) {
throw ::com::sun::star::uno::DeploymentException(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("component context fails to supply service com.sun.star.sheet.Solver of type com.sun.star.sheet.XSolver")), the_context);
}
return the_instance;
}
private:
Solver(); // not implemented
Solver(Solver &); // not implemented
~Solver(); // not implemented
void operator =(Solver); // not implemented
};
} } } }
#endif // INCLUDED_COM_SUN_STAR_SHEET_SOLVER_HPP
| [
"schorsch@localhost"
] | schorsch@localhost |
e61e9c11eb4d8d4b745f99f32e0a44252796dcea | c6936c9ea44289c67d9abf0ce45072a03248455c | /cpp/include/mojo/grammar/attribute.hpp | 6022fd85a4b154f12700639aad191cb390c5d585 | [] | no_license | mojo-lang/mojo | 76eb91d728f2b8ffa2779140fb2d4e6ad4e06f58 | 1424532f49ee2a0e8d4a4525342bd1b839d0a4a5 | refs/heads/main | 2023-07-08T08:04:32.047515 | 2023-06-30T09:13:09 | 2023-06-30T09:13:09 | 85,015,407 | 78 | 6 | null | 2023-07-27T01:58:19 | 2017-03-15T01:36:33 | Java | UTF-8 | C++ | false | false | 2,345 | hpp | #ifndef MOJO_GRAMMAR_ATTRIBUTE_HPP
#define MOJO_GRAMMAR_ATTRIBUTE_HPP
#include <pegtl.hh>
#include <mojo/grammar/at.hpp>
#include <mojo/grammar/expression.hpp>
#include <mojo/grammar/identifier.hpp>
namespace mojo {
namespace grammar {
struct attribute_arguments_begin : pegtl::one<'('> {};
struct attribute_arguments_end : pegtl::one<')'> {};
struct attribute_arguments_separator : pegtl::one<','> {};
struct attribute_arguments_content : pegtl::list<expression, attribute_arguments_separator, sep> {};
struct attribute_arguments
: pegtl::seq<attribute_arguments_begin, seps, attribute_arguments_content, seps, attribute_arguments_end> {
using begin = attribute_arguments_begin;
using end = attribute_arguments_end;
using content = attribute_arguments_content;
using separator = attribute_arguments_separator;
};
struct attribute_clause
: pegtl::sor<decimal_digits, pegtl::seq<generic_path_identifier, pre_pad_opt<attribute_arguments, pegtl::ascii::blank>>> {};
/**
* GRAMMAR OF AN ATTRIBUTE
*/
struct attribute : pegtl::seq<pegtl::one<'@'>, attribute_clause> {
using predication = pegtl::one<'@'>;
using content = attribute_clause;
};
struct group_attribute_element_separator : pegtl::one<':'> {};
struct group_attribute_element
: pegtl::seq<path_identifier, seps, group_attribute_element_separator, seps, expression> {
using separator = group_attribute_element_separator;
};
struct group_attribute_clause : list_tail<group_attribute_element, value_separator, sep> {
using element = group_attribute_element;
using separator = value_separator;
};
/**
* GRAMMAR OF AN ATTRIBUTE GROUP
*/
struct group_attribute
: pegtl::seq<pegtl_string_t("@{"), pegtl::pad_opt<group_attribute_clause, sep>, pegtl::one<'}'>> {
using content = group_attribute_clause;
};
struct attribute_separator
: pegtl::seq<inline_seps, pegtl::star<pegtl::eolf>, blanks> {};
using attributes_clause = pegtl::seq<pegtl::sor<group_attribute, attribute>,
pegtl::star<attribute_separator, pegtl::sor<group_attribute, attribute>>>;
/**
* GRAMMAR OF AN ATTRIBUTES
*/
struct attributes : pegtl::seq<at<pegtl::one<'@'>>, attributes_clause> {
using predication = at<pegtl::one<'@'>>;
using content = attributes_clause;
};
}
}
#endif // MOJO_GRAMMAR_ATTRIBUTE_HPP | [
"noreply@github.com"
] | mojo-lang.noreply@github.com |
1dc0416359d7c7431e85a5d3fc88fd21f51853d9 | 950276f370539ad552c1969170258cb8a13e137d | /src/PhysicsList.cxx | 43117615b1f964777b6a5624f6f3c2a62c7e54e9 | [
"BSD-3-Clause"
] | permissive | fermi-lat/G4Generator | b4be72b15c7898fa2c49d553e4ad09bc6bced4ca | e62475754d1be9330e2c865b0a4517f8d9b105e9 | refs/heads/master | 2022-02-17T03:19:37.917081 | 2019-08-27T17:27:36 | 2019-08-27T17:27:36 | 103,186,864 | 0 | 0 | null | 2018-07-05T20:47:41 | 2017-09-11T20:51:33 | C++ | UTF-8 | C++ | false | false | 5,345 | cxx | // File and Version Information:
// $Header: /nfs/slac/g/glast/ground/cvs/GlastRelease-scons/G4Generator/src/PhysicsList.cxx,v 1.24 2011/08/26 23:59:15 flongo Exp
//
// Description: This class manages the building of particles definitions and
// physics processes setup by creating a set of specialized classes and
// registering them
//
//
// Author(s):
// F.Longo
#include "PhysicsList.h"
#include "G4ParticleDefinition.hh"
#include "G4ParticleWithCuts.hh"
#include "G4ProcessManager.hh"
#include "G4ProcessVector.hh"
#include "G4ParticleTable.hh"
#include "G4Material.hh"
#include "G4MaterialTable.hh"
#include "G4ParticleTypes.hh"
// GLAST
// others
#include "EmStandardPhysics.hh"
#include "EmLowEnergyPhysics.hh"
#include "EpaxIonPhysics.h"
//#include "HadronPhysicsLHEP.hh"
//#include "HadronPhysicsQGSP.hh"
//#include "HadronPhysicsQGSP_BIC.hh"
#include "HadronPhysicsQGSP_BERT.hh"
#include "G4EmStandardPhysics.hh"
#include "G4EmExtraPhysics.hh"
#include "G4EmLivermorePhysics.hh"
#include "G4DecayPhysics.hh"
//#include "G4IonPhysics.hh"
// new
#include "G4QStoppingPhysics.hh"
#include "G4HadronElasticPhysicsLHEP.hh"
#include "G4HadronElasticPhysics.hh"
#include "G4NeutronTrackingCut.hh"
#include "G4IonBinaryCascadePhysics.hh"
#include <cstdlib>
PhysicsList::PhysicsList(double cutValue, const std::string& physicsChoice,
const std::string& physicsTable, const std::string& physicsDir)
: G4VModularPhysicsList()
{
// The default cut value for all particles
defaultCutValue = cutValue;
// Physics Choice
m_physicsChoice = physicsChoice;
// Physics Tables
m_physicsTable = physicsTable;
m_physicsDir = physicsDir;
std::cout << physicsChoice << std::endl; // this is for hadronic stuff
// EmLow
// EmStd
// EmLiv // New
// QGSP_BERT_EPAX // New
if (m_physicsChoice=="EmLow")
{
G4int ver=0;
// EM Physics
RegisterPhysics( new EmLowEnergyPhysics("lowEnergy EM", ver));
// Decay Physics - i.e. decay
RegisterPhysics( new G4DecayPhysics("decay") );
// Ion Physics
RegisterPhysics( new EpaxIonPhysics("ion", m_physicsChoice));
RegisterPhysics( new HadronPhysicsQGSP_BERT("hadron")); // to be updated
}
if (m_physicsChoice=="EmLiv")
{
G4int ver=0;
// EM Physics
RegisterPhysics( new G4EmLivermorePhysics(ver));
RegisterPhysics( new G4EmExtraPhysics("extra EM"));
// Decay Physics - i.e. decay
RegisterPhysics( new G4DecayPhysics("decay") );
// Ion Physics
RegisterPhysics( new EpaxIonPhysics("ion", m_physicsChoice));
// Hadron Phyiscs
RegisterPhysics( new G4NeutronTrackingCut(ver) );
RegisterPhysics( new HadronPhysicsQGSP_BERT("hadron")); // to be updated
RegisterPhysics( new G4HadronElasticPhysics("hadronElast"));
RegisterPhysics( new G4QStoppingPhysics("stopping"));
}
if (m_physicsChoice=="EmStd")
{
G4int ver=0;
// EM Physics
RegisterPhysics( new EmStandardPhysics("standard EM", ver));
// Synchroton Radiation & GN Physics
RegisterPhysics( new G4EmExtraPhysics("extra EM"));
// Decay Physics - i.e. decay
RegisterPhysics( new G4DecayPhysics("decay") );
// Full Ion Physics
RegisterPhysics( new EpaxIonPhysics("ion", m_physicsChoice));
// Neutrons
RegisterPhysics( new G4NeutronTrackingCut(ver) );
RegisterPhysics( new HadronPhysicsQGSP_BERT("hadron"));
// Hadron Elastic Phys
RegisterPhysics( new G4HadronElasticPhysics("hadronElast"));
// Stopping Physics
RegisterPhysics( new G4QStoppingPhysics("stopping"));
}
if (m_physicsChoice=="QGSP_BERT_EPAX")
{
G4int ver=0;
// EM standard physics (default)
RegisterPhysics( new G4EmStandardPhysics(ver));
// Synchroton Radiation & GN Physics
RegisterPhysics( new G4EmExtraPhysics("extra EM"));
// Decay Physics - i.e. decay
RegisterPhysics( new G4DecayPhysics("decay") );
// Ion Physics
RegisterPhysics( new EpaxIonPhysics("ion", m_physicsChoice));
// Neutrons
RegisterPhysics( new G4NeutronTrackingCut(ver) );
// Hadron Physics
RegisterPhysics( new HadronPhysicsQGSP_BERT("hadron"));
// Hadron Elastic Phys
RegisterPhysics( new G4HadronElasticPhysics("hadronElast"));
// Stopping Physics
RegisterPhysics( new G4QStoppingPhysics("stopping"));
}
}
PhysicsList::~PhysicsList()
{;}
void PhysicsList::SetCuts()
{
#ifndef SCons
std::string physics_basedir = getenv("G4GENERATORROOT");
#else
// Shouldn't matter since this routine is normally called with
// m_physicsTable = "build"
std::string physics_basedir("stuffAndNonsense");
#endif
std::string physics_Dir = physics_basedir + "/" + m_physicsDir;
if (m_physicsTable=="retrieve")
{
SetPhysicsTableRetrieved(physics_Dir);
}
SetCutsWithDefault();
if (m_physicsTable=="store")
{
if(StorePhysicsTable(physics_Dir))
{// std::cout << "done Physics Store" << std::endl;
}
}
}
| [
""
] | |
6cf22ceee78cfb63330ae9ac65cc8c293d3742a6 | a2b28ba3349304ccb01b10edd9378a446d13abe6 | /SWGHeightDump/engine/Breakpoint.h | 6eacd164844c871e1fdfa5371e1647870554a016 | [
"WTFPL"
] | permissive | TheAnswer/Tools | 9bec3570be8023c262eb7b6b4271bccad2008c48 | 880a68f618290445dd770e1b52176083244768f3 | refs/heads/master | 2023-08-17T07:44:54.870503 | 2020-05-10T20:32:32 | 2020-05-23T17:55:51 | 9,735,112 | 5 | 18 | null | null | null | null | UTF-8 | C++ | false | false | 440 | h | #ifndef BREAKPOINT_H_
#define BREAKPOINT_H_
class Breakpoint {
unsigned long address;
unsigned char originalData;
public:
Breakpoint(unsigned long address, unsigned char originalData) {
this->address = address;
this->originalData = originalData;
}
inline unsigned long getAddress() {
return address;
}
inline unsigned char getOriginalData() {
return originalData;
}
};
#endif /*BREAKPOINT_H_*/
| [
"TheAnswer@c3d1530f-68f5-4bd0-87dc-8ef779617e40"
] | TheAnswer@c3d1530f-68f5-4bd0-87dc-8ef779617e40 |
39775c6417dafe8d6158c5b4356125fb9bd9f6d4 | 95a0807737ef2aab9dcb42ad94da846a77a5a00d | /hash-table/open-addressed-hash-table/include/open-addressed-hash-table.hpp | 6f7c8908e644c9f16d8c3d89dedbf198a6643cd0 | [] | no_license | rafaeltmbr/algorithm-data-structure | 82b052ba2b3edf98ce9a98f40943018fc74e9951 | e329bf81c65546dcc802cf7ae408b3525809d85d | refs/heads/master | 2020-06-10T23:22:28.677381 | 2019-08-02T16:54:29 | 2019-08-02T16:54:29 | 193,788,457 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,240 | hpp | #ifndef OPEN_ADDRESSED_HASH_TABLE_HPP
#define OPEN_ADDRESSED_HASH_TABLE_HPP
typedef void (*destroy_t)(void *data);
typedef bool (*match_t)(const void *data1, const void *data2);
typedef int (*hash_t)(const void *data, int keys);
class OpenAddressedHashTable {
protected:
int keys;
int size;
void **table;
void *empty;
match_t match;
destroy_t destroy_;
hash_t hash1, hash2;
int getIndex(void *data, int i);
public:
OpenAddressedHashTable(
int keys,
hash_t hash1 = nullptr,
hash_t hash2 = nullptr,
match_t match = nullptr,
destroy_t destroy = nullptr);
OpenAddressedHashTable(OpenAddressedHashTable &ohtable);
~OpenAddressedHashTable();
void destroy(void);
void destroy(destroy_t destroy);
void setMatch(match_t match) { this->match = match; };
void setHash1(hash_t hash1) { this->hash1 = hash1; };
void setHash2(hash_t hash2) { this->hash2 = hash2; };
void setDestroy(destroy_t destroy) { this->destroy_ = destroy; };
bool insert(void *data);
void* remove(void *data);
void* lookup(void *data);
int getSize(void) { return size; };
int getKeys(void) { return keys; };
};
#endif // OPEN_ADDRESSED_HASH_TABLE_HPP | [
"rafaeltmbr@gmail.com"
] | rafaeltmbr@gmail.com |
062af515e761e9f41bb8af19eb7ec4cd837a2930 | 26354b1d3331e153f5ed4de61245435b1dd3c654 | /1st/path_sum.cpp | dab7a88e3c5c29623d8beacb48ff99449ae3b655 | [] | no_license | buptlxb/leetcode | 90203be80a038c54a34d4ec829c4805fc26a1689 | b641419de040801c4f54618d7ee26edcf10ee53c | refs/heads/master | 2020-04-05T23:47:54.990923 | 2016-09-11T14:10:30 | 2016-09-11T14:10:30 | 33,243,374 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,121 | cpp | #include <iostream>
#include <vector>
using std::cout;
using std::endl;
using std::vector;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
if (!root)
return false;
vector<TreeNode*> stack;
vector<int> sums;
stack.push_back(root);
sums.push_back(root->val);
while (!stack.empty()) {
TreeNode *tmp = stack.back();
if (tmp->left) {
stack.push_back(tmp->left);
sums.push_back(sums.back() + tmp->left->val);
} else if (tmp->right) {
stack.pop_back();
int cur_sum = sums.back();
sums.pop_back();
stack.push_back(tmp->right);
sums.push_back(cur_sum + tmp->right->val);
} else {
if (sums.back() == sum) {
return true;
}
stack.pop_back();
sums.pop_back();
while (!stack.empty() && stack.back()->right == NULL) {
stack.pop_back();
sums.pop_back();
}
if (!stack.empty()) {
TreeNode *tmp = stack.back();
stack.pop_back();
stack.push_back(tmp->right);
int cur_sum = sums.back();
sums.pop_back();
sums.push_back(cur_sum + tmp->right->val);
}
}
}
return false;
}
};
int main(void)
{
TreeNode root(5);
TreeNode t1(4);
TreeNode t2(8);
TreeNode t3(11);
TreeNode t4(13);
TreeNode t5(4);
TreeNode t6(7);
TreeNode t7(2);
TreeNode t8(1);
root.left = &t1;
root.right = &t2;
t1.left = &t3;
t2.left = &t4;
t2.right = &t5;
t3.left = &t6;
t3.right = &t7;
t5.right = &t8;
int sum = 22;
cout << Solution().hasPathSum(&root, sum) << endl;
return 0;
}
| [
"buptlxb@gmail.com"
] | buptlxb@gmail.com |
9309c114ad09da4f4ce78406fca487b0ee4c8fd2 | 7ecc73e396a81519cb1b1cec4c1d704e22cdd47d | /P1126.cpp | 9c1c5533904ddb5acb9d6e3af582ea951a4ef43c | [] | no_license | NiaBie/luogu | 8f1c528372e067b43bdef4e44786c8618f1818fc | 810e47d43636fa410a1328ec4be49b14749e94c1 | refs/heads/master | 2020-06-03T06:27:18.999023 | 2019-09-28T01:06:40 | 2019-09-28T01:06:40 | 168,447,793 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,836 | cpp | #include <stdio.h>
#include <assert.h>
#include <queue>
using namespace std;
const int MAXN = 60;
const int INF = 0xfffffff;
struct fuck
{
int x, y;
int dir;
int my_time;
};
queue <fuck> que;
fuck src, dest;
int my_map[MAXN][MAXN] = {0};
int visit[MAXN][MAXN][4] = {0};
int m, n;
int neigh[4][2];
int steps[12][2];
int ans = INF;
int my_min(int a, int b)
{
if (a < b)
return a;
return b;
}
int bfs(int x, int y, char dir);
int main()
{
char dir[2];
int i, j, k;
int x, y;
int temp;
neigh[0][0] = +0, neigh[0][1] = +0;
neigh[1][0] = +0, neigh[1][1] = +1;
neigh[2][0] = +1, neigh[2][1] = +0;
neigh[3][0] = +1, neigh[3][1] = +1;
steps[0][0] = -1; steps[0][1] = +0;// N
steps[1][0] = +0; steps[1][1] = +1;// E
steps[2][0] = +1; steps[2][1] = +0;// S
steps[3][0] = +0; steps[3][1] = -1;// W
steps[4][0] = -2; steps[4][1] = +0;// N
steps[5][0] = +0; steps[5][1] = +2;// E
steps[6][0] = +2; steps[6][1] = +0;// S
steps[7][0] = +0; steps[7][1] = -2;// W
steps[8][0] = -3; steps[8][1] = +0;// N
steps[9][0] = +0; steps[9][1] = +3;// E
steps[10][0] = +3; steps[10][1] = +0;// S
steps[11][0] = +0; steps[11][1] = -3;// W
scanf("%d%d", &n, &m);
for (i = 0; i < n; i ++)
{
for (j = 0; j < m; j ++)
{
scanf("%d", &temp);
if (temp == 1)
{
for (k = 0; k < 4; k ++)
{
x = i + neigh[k][0];
y = j + neigh[k][1];
if (x >= 0 && x <= n && y >= 0 && y <= m)// n + 1, m + 1
{
my_map[x][y] = 2;
}
}
}
}
}
n ++, m ++;
for (i = 0; i < n; i ++)
my_map[i][0] = my_map[i][m - 1] = 2;
for (i = 0; i < m; i ++)
my_map[0][i] = my_map[n - 1][i] = 2;
/*
printf("\n");
for (i = 0; i < n; i ++)
{
for (j = 0; j < m; j ++)
{
printf("%d ", my_map[i][j]);
}
printf("\n");
}
*/
scanf("%d%d%d%d%s", &src.x, &src.y, &dest.x, &dest.y, dir);
if (bfs(src.x, src.y, dir[0]) == 1)
printf("%d\n", ans);
else
printf("-1\n");
return 0;
}
int bfs(int x, int y, char dir)
{
int i, j;
fuck u, v;
u.x = x, u.y = y, u.my_time = 0;
switch (dir)
{
case 'N':
u.dir = 0; break;
case 'E':
u.dir = 1; break;
case 'S':
u.dir = 2; break;
case 'W':
u.dir = 3; break;
default: assert(0);
}
que.push(u);
while (que.empty() == 0)
{
u = que.front();
que.pop();
assert(u.dir <= 3 && u.dir >= 0);
//printf("pop x:%d y:%d dir:%d time:%d\n", u.x, u.y, u.dir, u.my_time);
if (u.x == dest.x && u.y == dest.y)
{
ans = my_min(ans, u.my_time);
}
for (i = 0; i < 4; i ++)
{
for (j = 0; j < 12; j += 4)
{
v.x = u.x + steps[i + j][0];// init x
v.y = u.y + steps[i + j][1];// init y
if (v.x >= 0 && v.x < n && v.y >= 0 && v.y < m)
{
if (my_map[v.x][v.y] < 2)
{
v.dir = i%4;// init dir
v.my_time = u.my_time + 1;
switch ((u.dir + 4 - v.dir)%4)
{
case 0:
break;
case 1:
case 3:
v.my_time ++; break;
case 2:
v.my_time += 2; break;
default: assert(0);
}// init time
if (visit[v.x][v.y][v.dir] == 0 || visit[v.x][v.y][v.dir] > v.my_time)
{
visit[v.x][v.y][v.dir] = v.my_time;
//printf("push x:%d y:%d dir:%d time:%d\n", v.x, v.y, v.dir, v.my_time);
que.push(v);
}
}
else
{
break;
}
}
else
{
break;
}
}
}
}
if (ans == INF)
return 0;
return 1;
}
| [
"1197225628@qq.com"
] | 1197225628@qq.com |
d198498fa473d1e1740cacb99bedd0f41bd25d9b | 2f2ece30e6314a830a6f4583a3f3ed59fa8354ff | /sim/cgi/sim_Effects.h | 5f2a026f540b153746772b08c4e53597b514549e | [
"MIT"
] | permissive | radarEnforced/fsg | fdffc5cbaba96557cf04667a31d4bcad04f8cc2b | 7825785bbf46a367b3daf1beb32b727c58e85e46 | refs/heads/master | 2020-09-22T07:06:04.372723 | 2019-11-30T06:31:30 | 2019-11-30T06:31:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,436 | h | /****************************************************************************//*
* Copyright (C) 2019 Marek M. Cel
*
* 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.
******************************************************************************/
#ifndef SIM_EFFECTS_H
#define SIM_EFFECTS_H
////////////////////////////////////////////////////////////////////////////////
#include <osg/Group>
#include <osgParticle/SmokeEffect>
#include <sim/sim_Base.h>
////////////////////////////////////////////////////////////////////////////////
namespace sim
{
/** Effects class. */
class Effects : public Base
{
public:
typedef osgParticle::SmokeEffect Smoke;
/** Creates explosion effect. */
static osg::Group* createExplosion( float scale );
/** Creates flames effect. */
static osg::Group* createFlames( const char *texture );
/** Creates smoke effect. */
static osg::Group* createSmoke( float lifeTime = 1.5f,
float size0 = 1.0f, float size1 = 0.2f,
float spread = 1.0f,
float intensity = 1.0f,
float speed = 1.0f );
/** Creates smoke trail effect. */
static Smoke* createSmokeTrail();
};
} // end of sim namespace
////////////////////////////////////////////////////////////////////////////////
#endif // SIM_EFFECTS_H
| [
"46421808+marek-cel@users.noreply.github.com"
] | 46421808+marek-cel@users.noreply.github.com |
487e16147ef280ac22f9e38de60df7d52062ed1d | d17a0ec1f7d4cfffbd222e8de190c56f9ec3cb7c | /modules/terrain_module/src/Noise.cpp | c1adde1a281a1e75dba317159fcdc87da36c7323 | [
"MIT"
] | permissive | fuchstraumer/DiamondDogs | 84553f03fb3782fafacb3bea738e0d6dad159bc0 | 06ad7f80ea87e9ce681f0d846ec3b3993300009f | refs/heads/master | 2023-02-08T18:16:38.405099 | 2023-02-04T18:06:21 | 2023-02-04T18:06:21 | 75,507,011 | 6 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,411 | cpp | #include "Noise.hpp"
#include "NoiseGen.hpp"
#include "glm/vec3.hpp"
#include "glm/vec2.hpp"
#include "glm/gtc/type_ptr.hpp"
float FBM(const glm::vec3 & pos, const int32_t& seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistance) {
glm::vec3 npos = pos * freq;
float sum = 0.0f, amplitude = 1.0f;
NoiseGen& ng = NoiseGen::Get();
for (size_t i = 0; i < octaves; ++i) {
sum += ng.SimplexNoiseWithDerivative3D(npos.x, npos.y, npos.z, nullptr) * amplitude;
npos *= lacun;
amplitude *= persistance;
}
return sum;
}
float FBM_Bounded(const glm::vec3 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistence, const float & min, const float & max) {
return (FBM(pos, seed, freq, octaves, lacun, persistence) - min) / (max - min);
}
//float FBM(const glm::vec2 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistance) {
// glm::vec2 npos = pos * freq;
// float sum = 0.0f, amplitude = 1.0f;
// NoiseGen ng;
// for (size_t i = 0; i < octaves; ++i) {
// sum += ng.SimplexNoiseWithDerivative3D(npos.x, npos.y, nullptr, nullptr) * amplitude;
// npos *= lacun;
// amplitude *= persistance;
// }
//
// return sum;
//}
//float FBM_Bounded(const glm::vec2 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistence, const float & min, const float & max) {
// return (FBM(pos, seed, freq, octaves, lacun, persistence) - min) / (max - min);
//}
float Billow(const glm::vec3 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistance) {
glm::vec3 npos = pos * freq;
float sum = 0.0f, amplitude = 1.0f;
NoiseGen& ng = NoiseGen::Get();
for (size_t i = 0; i < octaves; ++i) {
sum += fabsf(ng.SimplexNoiseWithDerivative3D(npos.x, npos.y, npos.z, nullptr)) * amplitude;
npos *= lacun;
amplitude *= persistance;
}
return sum;
}
float RidgedMulti(const glm::vec3 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistance) {
glm::vec3 npos = pos * freq;
float sum = 0.0f, amplitude = 1.0f;
NoiseGen ng;
for (size_t i = 0; i < octaves; ++i) {
sum += 1.0f - fabsf(ng.SimplexNoiseWithDerivative3D(npos.x, npos.y, npos.z, nullptr)) * amplitude;
npos *= lacun;
amplitude *= persistance;
}
return sum;
}
float DecarpientierSwiss(const glm::vec3 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistance) {
float sum = 0.0f;
float amplitude = 1.0f;
float warp = 0.03f;
glm::vec3 sp = pos * freq;
glm::vec3 dSum = glm::vec3(0.0f);
NoiseGen& ng = NoiseGen::Get();
for (size_t i = 0; i < octaves; ++i) {
glm::vec3 deriv;
float n = ng.SimplexNoiseWithDerivative3D(sp.x, sp.y, sp.z, glm::value_ptr(deriv));
sum += (1.0f - fabsf(n)) * amplitude;
dSum += amplitude * -n * deriv;
sp *= lacun;
sp += (warp * dSum);
amplitude *= (glm::clamp(sum, 0.0f, 1.0f) * persistance);
}
return sum;
}
float DecarpientierSwiss_Bounded(const glm::vec3 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistence, const float & min, const float & max) {
return (DecarpientierSwiss(pos, seed, freq, octaves, lacun, persistence) - min) / (max - min);
}
//
//float DecarpientierSwiss(const glm::vec2 & pos, const int32_t & seed, const float & freq, const size_t & octaves, const float & lacun, const float & persistance) {
// float sum = 0.0f;
// float amplitude = 1.0f;
// float warp = 0.1f;
//
// glm::vec2 sp = pos * freq;
// glm::vec2 dSum = glm::vec2(0.0f);
// NoiseGen& ng = NoiseGen::Get();
//
// for (size_t i = 0; i < octaves; ++i) {
// glm::vec2 deriv;
// float n = ng.sdnoise2(sp.x, sp.y, &deriv.x, &deriv.y);
// sum += (1.0f - fabsf(n)) * amplitude;
// dSum += amplitude * -n * deriv;
// sp *= lacun;
// sp += (warp * dSum);
// amplitude *= (glm::clamp(sum, 0.0f, 1.0f) * persistance);
// }
//
// return sum;
//}
| [
"jonesk74@uw.edu"
] | jonesk74@uw.edu |
558565dcb7528471a08a8e870d04517847790220 | e7d7377b40fc431ef2cf8dfa259a611f6acc2c67 | /SampleDump/Cpp/SDK/BP_CorsescaRaphaeliteBlade_functions.cpp | 7c8addc1a0ca130e0c909038d7c84e8d24379257 | [] | no_license | liner0211/uSDK_Generator | ac90211e005c5f744e4f718cd5c8118aab3f8a18 | 9ef122944349d2bad7c0abe5b183534f5b189bd7 | refs/heads/main | 2023-09-02T16:37:22.932365 | 2021-10-31T17:38:03 | 2021-10-31T17:38:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,574 | cpp | // Name: Mordhau, Version: Patch23
#include "../pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//---------------------------------------------------------------------------
// Function:
// Offset -> 0x014F36A0
// Name -> Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ReceiveBeginPlay
// Flags -> (BlueprintCallable, BlueprintEvent)
void UBP_CorsescaRaphaeliteBlade_C::ReceiveBeginPlay()
{
static UFunction* fn = UObject::FindObject<UFunction>("Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ReceiveBeginPlay");
UBP_CorsescaRaphaeliteBlade_C_ReceiveBeginPlay_Params params;
auto flags = fn->FunctionFlags;
UObject::ProcessEvent(fn, ¶ms);
fn->FunctionFlags = flags;
}
// Function:
// Offset -> 0x014F36A0
// Name -> Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ReceiveActorBeginOverlap
// Flags -> (BlueprintCallable, BlueprintEvent)
// Parameters:
// class AActor* OtherActor (BlueprintVisible, BlueprintReadOnly, Parm, ZeroConstructor, IsPlainOldData, NoDestructor, HasGetValueTypeHash)
void UBP_CorsescaRaphaeliteBlade_C::ReceiveActorBeginOverlap(class AActor* OtherActor)
{
static UFunction* fn = UObject::FindObject<UFunction>("Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ReceiveActorBeginOverlap");
UBP_CorsescaRaphaeliteBlade_C_ReceiveActorBeginOverlap_Params params;
params.OtherActor = OtherActor;
auto flags = fn->FunctionFlags;
UObject::ProcessEvent(fn, ¶ms);
fn->FunctionFlags = flags;
}
// Function:
// Offset -> 0x014F36A0
// Name -> Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ReceiveTick
// Flags -> (BlueprintCallable, BlueprintEvent)
// Parameters:
// float DeltaSeconds (BlueprintVisible, BlueprintReadOnly, Parm, ZeroConstructor, IsPlainOldData, NoDestructor, HasGetValueTypeHash)
void UBP_CorsescaRaphaeliteBlade_C::ReceiveTick(float DeltaSeconds)
{
static UFunction* fn = UObject::FindObject<UFunction>("Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ReceiveTick");
UBP_CorsescaRaphaeliteBlade_C_ReceiveTick_Params params;
params.DeltaSeconds = DeltaSeconds;
auto flags = fn->FunctionFlags;
UObject::ProcessEvent(fn, ¶ms);
fn->FunctionFlags = flags;
}
// Function:
// Offset -> 0x014F36A0
// Name -> Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ExecuteUbergraph_BP_CorsescaRaphaeliteBlade
// Flags -> (Final)
// Parameters:
// int EntryPoint (BlueprintVisible, BlueprintReadOnly, Parm, ZeroConstructor, IsPlainOldData, NoDestructor, HasGetValueTypeHash)
void UBP_CorsescaRaphaeliteBlade_C::ExecuteUbergraph_BP_CorsescaRaphaeliteBlade(int EntryPoint)
{
static UFunction* fn = UObject::FindObject<UFunction>("Function BP_CorsescaRaphaeliteBlade.BP_CorsescaRaphaeliteBlade_C.ExecuteUbergraph_BP_CorsescaRaphaeliteBlade");
UBP_CorsescaRaphaeliteBlade_C_ExecuteUbergraph_BP_CorsescaRaphaeliteBlade_Params params;
params.EntryPoint = EntryPoint;
auto flags = fn->FunctionFlags;
UObject::ProcessEvent(fn, ¶ms);
fn->FunctionFlags = flags;
}
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
| [
"talon_hq@outlook.com"
] | talon_hq@outlook.com |
f6ceb2d5e3b3754b06af4ee624a3a6a5440179c0 | 83b83a353272b536e9f8df67f5fcc8a093dd4f02 | /kernel.cpp | cd813e232da86fbde35b1c7a56cf630348b89b64 | [
"MIT"
] | permissive | dougcoburn/minkernel | 2cd5ad2e98e0024e069036a09d9c000b8f868101 | a06291757b8ec9224ee4296ae2dfb03fe344c9fb | refs/heads/master | 2020-04-08T08:55:24.381913 | 2018-11-26T16:29:49 | 2018-11-27T05:36:20 | 159,199,703 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 819 | cpp | unsigned short * const VideoMemory = (unsigned short* const)0xb8000;
void clear() { // 80 cols x 25 rows x 2 bytes
int pos = 0;
for (int col = 0; col < 80; col += 1) {
for (int row = 0; row < 25; row += 1) {
VideoMemory[pos++] = (0x0A00 | ' ');
}
}
}
void printf(const char* str) {
for (int i = 0; str[i] != '\0'; i += 1) {
VideoMemory[i] = (VideoMemory[i] & 0xFF00) | str[i];
}
}
using constructor = void (*)();
extern "C" constructor start_ctors;
extern "C" constructor end_ctors;
extern "C" void callConstructors() {
for (constructor* p = &start_ctors; p != &end_ctors; p++) {
(*p)();
}
}
extern "C" void kernelMain(void* multiboot_structure, unsigned int magicnumber) {
clear();
printf("Hello, World!");
while(true); // spin
}
| [
"doug@numetric.com"
] | doug@numetric.com |
1096ca607da67056f6b883fc967c27eea838fca2 | a81c07a5663d967c432a61d0b4a09de5187be87b | /ui/ozone/platform/x11/x11_surface_factory.h | 35dad5d886456ca03e16e6449423f6f7cf315ef9 | [
"BSD-3-Clause"
] | permissive | junxuezheng/chromium | c401dec07f19878501801c9e9205a703e8643031 | 381ce9d478b684e0df5d149f59350e3bc634dad3 | refs/heads/master | 2023-02-28T17:07:31.342118 | 2019-09-03T01:42:42 | 2019-09-03T01:42:42 | 205,967,014 | 2 | 0 | BSD-3-Clause | 2019-09-03T01:48:23 | 2019-09-03T01:48:23 | null | UTF-8 | C++ | false | false | 1,291 | h | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef UI_OZONE_PLATFORM_X11_X11_SURFACE_FACTORY_H_
#define UI_OZONE_PLATFORM_X11_X11_SURFACE_FACTORY_H_
#include <memory>
#include <vector>
#include "base/macros.h"
#include "gpu/vulkan/buildflags.h"
#include "ui/gl/gl_surface.h"
#include "ui/ozone/public/gl_ozone.h"
#include "ui/ozone/public/surface_factory_ozone.h"
namespace ui {
// Handles GL initialization and surface/context creation for X11.
class X11SurfaceFactory : public SurfaceFactoryOzone {
public:
X11SurfaceFactory();
~X11SurfaceFactory() override;
// SurfaceFactoryOzone:
std::vector<gl::GLImplementation> GetAllowedGLImplementations() override;
GLOzone* GetGLOzone(gl::GLImplementation implementation) override;
#if BUILDFLAG(ENABLE_VULKAN)
std::unique_ptr<gpu::VulkanImplementation> CreateVulkanImplementation(
bool allow_protected_memory,
bool enforce_protected_memory) override;
#endif
private:
std::unique_ptr<GLOzone> glx_implementation_;
std::unique_ptr<GLOzone> egl_implementation_;
DISALLOW_COPY_AND_ASSIGN(X11SurfaceFactory);
};
} // namespace ui
#endif // UI_OZONE_PLATFORM_X11_X11_SURFACE_FACTORY_H_
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
b608b288e051f3aeef84349c5dc9ab7f344ec1de | 9b4839ef9563a206882b65da1b2d101baf1bcbad | /aten/src/ATen/native/BatchLinearAlgebra.cpp | 4c6d231379235d60413874deae1edb62324f6ebf | [
"BSD-2-Clause",
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla",
"Apache-2.0"
] | permissive | jcooky/pytorch | ced9221062c57dfc18b2f0bc330d3b3420c9ed40 | c36b77fcdad3d54227cf0fd51693eb57035002c0 | refs/heads/master | 2020-04-27T05:39:53.429136 | 2019-09-02T09:58:21 | 2019-09-02T09:59:47 | 174,086,657 | 1 | 0 | NOASSERTION | 2019-03-06T06:37:21 | 2019-03-06T06:37:21 | null | UTF-8 | C++ | false | false | 45,429 | cpp | #include <ATen/ATen.h>
#include <ATen/CPUApplyUtils.h>
#include <ATen/Dispatch.h>
#include <ATen/NativeFunctions.h>
#include <ATen/ExpandUtils.h>
#include <ATen/native/LinearAlgebraUtils.h>
#include <ATen/Parallel.h>
#include <TH/TH.h> // for USE_LAPACK
#include <vector>
// First the required LAPACK implementations are registered here.
// A comment above the registered LAPACK routine suggest which batched
// linear algebra function uses that routine
#ifdef USE_LAPACK
// gesv
extern "C" void dgesv_(int *n, int *nrhs, double *a, int *lda, int *ipiv, double *b, int *ldb, int *info);
extern "C" void sgesv_(int *n, int *nrhs, float *a, int *lda, int *ipiv, float *b, int *ldb, int *info);
// getrf
extern "C" void dgetrf_(int *m, int *n, double *a, int *lda, int *ipiv, int *info);
extern "C" void sgetrf_(int *m, int *n, float *a, int *lda, int *ipiv, int *info);
// getri
extern "C" void dgetri_(int *n, double *a, int *lda, int *ipiv, double *work, int *lwork, int *info);
extern "C" void sgetri_(int *n, float *a, int *lda, int *ipiv, float *work, int *lwork, int *info);
// potrs
extern "C" void dpotrs_(char *uplo, int *n, int *nrhs, double *a, int *lda, double *b, int *ldb, int *info);
extern "C" void spotrs_(char *uplo, int *n, int *nrhs, float *a, int *lda, float *b, int *ldb, int *info);
// potrf
extern "C" void dpotrf_(char *uplo, int *n, double *a, int *lda, int *info);
extern "C" void spotrf_(char *uplo, int *n, float *a, int *lda, int *info);
// trtrs
extern "C" void dtrtrs_(char *uplo, char *trans, char *diag, int *n, int *nrhs, double *a, int *lda, double *b, int *ldb, int *info);
extern "C" void strtrs_(char *uplo, char *trans, char *diag, int *n, int *nrhs, float *a, int *lda, float *b, int *ldb, int *info);
// geqrf
extern "C" void dgeqrf_(int *m, int *n, double *a, int *lda, double *tau, double *work, int *lwork, int *info);
extern "C" void sgeqrf_(int *m, int *n, float *a, int *lda, float *tau, float *work, int *lwork, int *info);
// orgqr
extern "C" void dorgqr_(int *m, int *n, int *k, double *a, int *lda, double *tau, double *work, int *lwork, int *info);
extern "C" void sorgqr_(int *m, int *n, int *k, float *a, int *lda, float *tau, float *work, int *lwork, int *info);
// syev
extern "C" void dsyev_(char *jobz, char *uplo, int *n, double *a, int *lda, double *w, double *work, int *lwork, int *info);
extern "C" void ssyev_(char *jobz, char *uplo, int *n, float *a, int *lda, float *w, float *work, int *lwork, int *info);
// gesdd
extern "C" void dgesdd_(char *jobz, int *m, int *n, double *a, int *lda,
double *s, double *u, int *ldu, double *vt, int *ldvt, double *work, int *lwork, int *iwork, int *info);
extern "C" void sgesdd_(char *jobz, int *m, int *n, float *a, int *lda,
float *s, float *u, int *ldu, float *vt, int *ldvt, float *work, int *lwork, int *iwork, int *info);
// getrs
extern "C" void dgetrs_(char *trans, int *n, int *nrhs, double *a, int *lda, int *ipiv, double *b, int *ldb, int *info);
extern "C" void sgetrs_(char *trans, int *n, int *nrhs, float *a, int *lda, int *ipiv, float *b, int *ldb, int *info);
#endif
namespace at {
namespace native {
// Define the per-batch functions to be used in the main implementation of the batched
// linear algebra operations
template<class scalar_t>
void lapackSolve(int n, int nrhs, scalar_t *a, int lda, int *ipiv, scalar_t *b, int ldb, int *info) {
AT_ERROR("solve only takes float or double Tensors");
}
template<class scalar_t>
void lapackLu(int m, int n, scalar_t *a, int lda, int *ipiv, int *info) {
AT_ERROR("lu only takes float or double Tensors");
}
template<class scalar_t>
void lapackGetri(int n, scalar_t *a, int lda, int *ipiv, scalar_t *work, int lwork, int *info) {
AT_ERROR("getri only takes float or double Tensors");
}
template<class scalar_t>
void lapackCholeskySolve(char uplo, int n, int nrhs, scalar_t *a, int lda, scalar_t *b, int ldb, int *info) {
AT_ERROR("cholesky_solve only takes float or double Tensors");
}
template<class scalar_t>
void lapackCholesky(char uplo, int n, scalar_t *a, int lda, int *info) {
AT_ERROR("cholesky only takes float or double Tensors");
}
template<class scalar_t>
void lapackTriangularSolve(char uplo, char trans, char diag, int n, int nrhs, scalar_t *a, int lda, scalar_t *b, int ldb, int *info) {
AT_ERROR("triangular_solve only takes float or double Tensors");
}
template<class scalar_t>
void lapackGeqrf(int m, int n, scalar_t *a, int lda, scalar_t *tau, scalar_t *work, int lwork, int *info) {
AT_ERROR("geqrf only takes float or double Tensors");
}
template<class scalar_t>
void lapackOrgqr(int m, int n, int k, scalar_t *a, int lda, scalar_t *tau, scalar_t *work, int lwork, int *info) {
AT_ERROR("orgqr only takes float or double Tensors");
}
template<class scalar_t>
void lapackSymeig(char jobz, char uplo, int n, scalar_t *a, int lda, scalar_t *w, scalar_t *work, int lwork, int *info) {
AT_ERROR("symeig only takes float or double Tensors");
}
template<class scalar_t>
void lapackSvd(char jobz, int m, int n, scalar_t *a, int lda,
scalar_t *s, scalar_t *u, int ldu, scalar_t *vt, int ldvt, scalar_t *work, int lwork, int *iwork, int *info) {
AT_ERROR("svd only takes float or double Tensors");
}
template<class scalar_t>
void lapackLuSolve(char trans, int n, int nrhs, scalar_t *a, int lda, int *ipiv, scalar_t *b, int ldb, int *info) {
AT_ERROR("lu_solve only takes float or double Tensors");
}
#ifdef USE_LAPACK
template<> void lapackSolve<double>(int n, int nrhs, double *a, int lda, int *ipiv, double *b, int ldb, int *info) {
dgesv_(&n, &nrhs, a, &lda, ipiv, b, &ldb, info);
}
template<> void lapackSolve<float>(int n, int nrhs, float *a, int lda, int *ipiv, float *b, int ldb, int *info) {
sgesv_(&n, &nrhs, a, &lda, ipiv, b, &ldb, info);
}
template<> void lapackGetri<double>(int n, double *a, int lda, int *ipiv, double *work, int lwork, int *info) {
dgetri_(&n, a, &lda, ipiv, work, &lwork, info);
}
template<> void lapackGetri<float>(int n, float *a, int lda, int *ipiv, float *work, int lwork, int *info) {
sgetri_(&n, a, &lda, ipiv, work, &lwork, info);
}
template<> void lapackLu<double>(int m, int n, double *a, int lda, int *ipiv, int *info) {
dgetrf_(&m, &n, a, &lda, ipiv, info);
}
template<> void lapackLu<float>(int m, int n, float *a, int lda, int *ipiv, int *info) {
sgetrf_(&m, &n, a, &lda, ipiv, info);
}
template<> void lapackCholeskySolve<double>(char uplo, int n, int nrhs, double *a, int lda, double *b, int ldb, int *info) {
dpotrs_(&uplo, &n, &nrhs, a, &lda, b, &ldb, info);
}
template<> void lapackCholeskySolve<float>(char uplo, int n, int nrhs, float *a, int lda, float *b, int ldb, int *info) {
spotrs_(&uplo, &n, &nrhs, a, &lda, b, &ldb, info);
}
template<> void lapackCholesky<double>(char uplo, int n, double *a, int lda, int *info) {
dpotrf_(&uplo, &n, a, &lda, info);
}
template<> void lapackCholesky<float>(char uplo, int n, float *a, int lda, int *info) {
spotrf_(&uplo, &n, a, &lda, info);
}
template<> void lapackTriangularSolve<double>(char uplo, char trans, char diag, int n, int nrhs, double *a, int lda, double *b, int ldb, int *info) {
dtrtrs_(&uplo, &trans, &diag, &n, &nrhs, a, &lda, b, &ldb, info);
}
template<> void lapackTriangularSolve<float>(char uplo, char trans, char diag, int n, int nrhs, float *a, int lda, float *b, int ldb, int *info) {
strtrs_(&uplo, &trans, &diag, &n, &nrhs, a, &lda, b, &ldb, info);
}
template<> void lapackGeqrf<double>(int m, int n, double *a, int lda, double *tau, double *work, int lwork, int *info) {
dgeqrf_(&m, &n, a, &lda, tau, work, &lwork, info);
}
template<> void lapackGeqrf<float>(int m, int n, float *a, int lda, float *tau, float *work, int lwork, int *info) {
sgeqrf_(&m, &n, a, &lda, tau, work, &lwork, info);
}
template<> void lapackOrgqr<double>(int m, int n, int k, double *a, int lda, double *tau, double *work, int lwork, int *info) {
dorgqr_(&m, &n, &k, a, &lda, tau, work, &lwork, info);
}
template<> void lapackOrgqr<float>(int m, int n, int k, float *a, int lda, float *tau, float *work, int lwork, int *info) {
sorgqr_(&m, &n, &k, a, &lda, tau, work, &lwork, info);
}
template<> void lapackSymeig<double>(char jobz, char uplo, int n, double *a, int lda, double *w, double *work, int lwork, int *info) {
dsyev_(&jobz, &uplo, &n, a, &lda, w, work, &lwork, info);
}
template<> void lapackSymeig<float>(char jobz, char uplo, int n, float *a, int lda, float *w, float *work, int lwork, int *info) {
ssyev_(&jobz, &uplo, &n, a, &lda, w, work, &lwork, info);
}
template<> void lapackSvd<double>(char jobz, int m, int n, double *a, int lda,
double *s, double *u, int ldu, double *vt, int ldvt, double *work, int lwork, int *iwork, int *info) {
dgesdd_(&jobz, &m, &n, a, &lda, s, u, &ldu, vt, &ldvt, work, &lwork, iwork, info);
}
template<> void lapackSvd<float>(char jobz, int m, int n, float *a, int lda,
float *s, float *u, int ldu, float *vt, int ldvt, float *work, int lwork, int *iwork, int *info) {
sgesdd_(&jobz, &m, &n, a, &lda, s, u, &ldu, vt, &ldvt, work, &lwork, iwork, info);
}
template<> void lapackLuSolve<double>(char trans, int n, int nrhs, double *a, int lda, int *ipiv, double *b, int ldb, int *info) {
dgetrs_(&trans, &n, &nrhs, a, &lda, ipiv, b, &ldb, info);
}
template<> void lapackLuSolve<float>(char trans, int n, int nrhs, float *a, int lda, int *ipiv, float *b, int ldb, int *info) {
sgetrs_(&trans, &n, &nrhs, a, &lda, ipiv, b, &ldb, info);
}
#endif
// Below of the definitions of the functions operating on a batch that are going to be dispatched
// in the main helper functions for the linear algebra operations
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ solve ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_solve(Tensor& b, Tensor& A, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("solve: LAPACK library not found in compilation");
#else
auto A_data = A.data_ptr<scalar_t>();
auto b_data = b.data_ptr<scalar_t>();
auto A_mat_stride = matrixStride(A);
auto b_mat_stride = matrixStride(b);
auto batch_size = batchCount(A);
auto n = A.size(-2);
auto nrhs = b.size(-1);
auto ipiv = at::empty({n}, b.options().dtype(kInt));
auto ipiv_data = ipiv.data_ptr<int>();
int info;
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* A_working_ptr = &A_data[i * A_mat_stride];
scalar_t* b_working_ptr = &b_data[i * b_mat_stride];
lapackSolve<scalar_t>(n, nrhs, A_working_ptr, n, ipiv_data, b_working_ptr, n, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
std::tuple<Tensor, Tensor> _solve_helper_cpu(const Tensor& self, const Tensor& A) {
auto self_working_copy = cloneBatchedColumnMajor(self);
auto A_working_copy = cloneBatchedColumnMajor(A);
std::vector<int64_t> infos(batchCount(self), 0);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "solve_cpu", [&]{
apply_solve<scalar_t>(self_working_copy, A_working_copy, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "solve_cpu");
} else {
singleCheckErrors(infos[0], "solve_cpu");
}
return std::tuple<Tensor, Tensor>(self_working_copy, A_working_copy);
}
// Supports arbitrary batch dimensions for self and A
std::tuple<Tensor,Tensor> solve(const Tensor& self, const Tensor& A) {
TORCH_CHECK(self.dim() >= 2,
"B should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
TORCH_CHECK(A.dim() >= 2,
"A should have at least 2 dimensions, but has ", A.dim(), " dimensions instead");
Tensor self_broadcasted, A_broadcasted;
std::tie(self_broadcasted, A_broadcasted) = _linear_solve_broadcast_args(self, A, "solve");
return at::_solve_helper(self_broadcasted, A_broadcasted);
}
std::tuple<Tensor&,Tensor&> solve_out(Tensor& solution, Tensor& lu, const Tensor& self, const Tensor& A) {
Tensor solution_tmp, lu_tmp;
std::tie(solution_tmp, lu_tmp) = at::_solve_helper(self, A);
solution.resize_as_(solution_tmp).copy_(solution_tmp);
lu.resize_as_(lu_tmp).copy_(lu_tmp);
return std::tuple<Tensor&, Tensor&>(solution, lu);
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ inverse ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template <typename scalar_t>
static void apply_inverse(Tensor& self, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("inverse: LAPACK library not found in compilation");
#else
auto self_data = self.data_ptr<scalar_t>();
auto self_matrix_stride = matrixStride(self);
auto batch_size = batchCount(self);
auto n = self.size(-2);
auto ipiv = at::empty({n}, self.options().dtype(kInt));
auto ipiv_data = ipiv.data_ptr<int>();
int info;
// Run once, first to get the optimum work size
// Since we deal with batches of matrices with the same dimensions, doing this outside
// the loop saves (batch_size - 1) workspace queries which would provide the same result
// and (batch_size - 1) calls to allocate and deallocate workspace using at::empty()
int lwork = -1;
scalar_t wkopt;
lapackGetri<scalar_t>(n, self_data, n, ipiv_data, &wkopt, lwork, &info);
lwork = static_cast<int>(wkopt);
Tensor work = at::empty({lwork}, self.options());
auto work_data = work.data_ptr<scalar_t>();
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* self_working_ptr = &self_data[i * self_matrix_stride];
lapackLu<scalar_t>(n, n, self_working_ptr, n, ipiv_data, &info);
infos[i] = info;
if (info != 0) {
return;
}
// now compute the actual inverse
lapackGetri<scalar_t>(n, self_working_ptr, n, ipiv_data, work_data, lwork, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
Tensor _inverse_helper_cpu(const Tensor& self) {
std::vector<int64_t> infos(batchCount(self), 0);
auto self_working_copy = cloneBatchedColumnMajor(self);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "inverse_cpu", [&]{
apply_inverse<scalar_t>(self_working_copy, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "inverse_cpu");
} else {
singleCheckErrors(infos[0], "inverse_cpu");
}
return self_working_copy;
}
Tensor inverse(const Tensor &self) {
if (self.size(-1) == 0) {
return at::empty_like(self);
}
squareCheckInputs(self);
return at::_inverse_helper(self);
}
Tensor& inverse_out(Tensor &result, const Tensor &self) {
if (self.size(-1) == 0) {
return result.resize_as_(self);
}
result.copy_(native::inverse(self));
return result;
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cholesky_solve ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_cholesky_solve(Tensor& b, Tensor& A, bool upper, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("cholesky_solve: LAPACK library not found in compilation");
#else
char uplo = upper ? 'U' : 'L';
auto A_data = A.data_ptr<scalar_t>();
auto b_data = b.data_ptr<scalar_t>();
auto A_mat_stride = matrixStride(A);
auto b_mat_stride = matrixStride(b);
auto batch_size = batchCount(A);
auto n = A.size(-2);
auto nrhs = b.size(-1);
int info;
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* A_working_ptr = &A_data[i * A_mat_stride];
scalar_t* b_working_ptr = &b_data[i * b_mat_stride];
lapackCholeskySolve<scalar_t>(uplo, n, nrhs, A_working_ptr, n, b_working_ptr, n, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
Tensor _cholesky_solve_helper_cpu(const Tensor& self, const Tensor& A, bool upper) {
auto self_working_copy = cloneBatchedColumnMajor(self);
auto A_working_copy = cloneBatchedColumnMajor(A);
std::vector<int64_t> infos(batchCount(self), 0);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "cholesky_solve_cpu", [&]{
apply_cholesky_solve<scalar_t>(self_working_copy, A_working_copy, upper, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "cholesky_solve_cpu");
} else {
singleCheckErrors(infos[0], "cholesky_solve_cpu");
}
return self_working_copy;
}
// Supports arbitrary batch dimensions for self and A
Tensor cholesky_solve(const Tensor& self, const Tensor& A, bool upper) {
TORCH_CHECK(self.dim() >= 2,
"b should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
TORCH_CHECK(A.dim() >= 2,
"u should have at least 2 dimensions, but has ", A.dim(), " dimensions instead");
Tensor self_broadcasted, A_broadcasted;
std::tie(self_broadcasted, A_broadcasted) = _linear_solve_broadcast_args(self, A, "cholesky_solve");
return at::_cholesky_solve_helper(self_broadcasted, A_broadcasted, upper);
}
Tensor& cholesky_solve_out(Tensor& result, const Tensor& self, const Tensor& A, bool upper) {
Tensor result_tmp;
result_tmp = at::_cholesky_solve_helper(self, A, upper);
result.resize_as_(result_tmp).copy_(result_tmp);
return result;
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cholesky ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_cholesky(Tensor& self, bool upper, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("cholesky: LAPACK library not found in compilation");
#else
char uplo = upper ? 'U' : 'L';
auto self_data = self.data_ptr<scalar_t>();
auto self_matrix_stride = matrixStride(self);
auto batch_size = batchCount(self);
auto n = self.size(-2);
int info;
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* self_working_ptr = &self_data[i * self_matrix_stride];
lapackCholesky<scalar_t>(uplo, n, self_working_ptr, n, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
Tensor _cholesky_helper_cpu(const Tensor& self, bool upper) {
std::vector<int64_t> infos(batchCount(self), 0);
auto self_working_copy = cloneBatchedColumnMajor(self);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "cholesky_cpu", [&]{
apply_cholesky<scalar_t>(self_working_copy, upper, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "cholesky_cpu");
} else {
singleCheckErrors(infos[0], "cholesky_cpu");
}
return self_working_copy;
}
Tensor cholesky(const Tensor &self, bool upper) {
if (self.size(-1) == 0) {
return at::empty_like(self);
}
squareCheckInputs(self);
auto raw_cholesky_output = at::_cholesky_helper(self, upper);
if (upper) {
return raw_cholesky_output.triu_();
} else {
return raw_cholesky_output.tril_();
}
}
Tensor& cholesky_out(Tensor &result, const Tensor &self, bool upper) {
if (self.size(-1) == 0) {
return result.resize_as_(self);
}
result.copy_(native::cholesky(self, upper));
return result;
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ lu ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_lu(Tensor& self, Tensor& pivots, Tensor& infos) {
#ifndef USE_LAPACK
AT_ERROR("lu: LAPACK library not found in compilation");
#else
auto self_data = self.data_ptr<scalar_t>();
auto pivots_data = pivots.data_ptr<int>();
auto infos_data = infos.data_ptr<int>();
auto self_matrix_stride = matrixStride(self);
auto pivots_matrix_stride = pivots.size(-1);
auto batch_size = batchCount(self);
auto n = self.size(-1);
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* self_working_ptr = &self_data[i * self_matrix_stride];
int* pivots_working_ptr = &pivots_data[i * pivots_matrix_stride];
int* infos_working_ptr = &infos_data[i];
lapackLu<scalar_t>(n, n, self_working_ptr, n, pivots_working_ptr, infos_working_ptr);
}
#endif
}
std::tuple<Tensor, Tensor, Tensor> _lu_with_info_cpu(const Tensor& self, bool pivot, bool check_errors) {
TORCH_CHECK(pivot, "lu without pivoting is not implemented on the CPU");
TORCH_CHECK(self.dim() >= 2,
"expected tensor with 2 or more dimensions, got size: ", self.sizes(),
" instead");
squareCheckInputs(self);
auto req_size = self.sizes().vec();
req_size.pop_back();
auto pivots_tensor = at::empty(req_size, self.options().dtype(kInt));
req_size.pop_back();
auto infos_tensor = at::zeros(req_size, self.options().dtype(kInt));
Tensor self_working_copy;
if (self.numel() == 0) {
self_working_copy = at::empty_like(self);
} else {
self_working_copy = cloneBatchedColumnMajor(self);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "lu_cpu", [&]{
apply_lu<scalar_t>(self_working_copy, pivots_tensor, infos_tensor);
});
}
if (check_errors) {
if (self.dim() > 2) {
batchCheckErrors(infos_tensor, "lu");
} else {
singleCheckErrors(infos_tensor.item<int64_t>(), "lu");
}
}
return std::make_tuple(self_working_copy, pivots_tensor, infos_tensor);
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ triu/tril ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template <typename scalar_t, bool upper>
static void apply_triu_tril_single(
scalar_t* result, scalar_t* self, bool inplace,
int64_t k, int64_t n, int64_t m,
int64_t res_row_stride, int64_t res_col_stride,
int64_t self_row_stride, int64_t self_col_stride) {
constexpr int64_t zero = 0;
if (upper) {
at::parallel_for(0, n, 0, [&](int64_t start, int64_t end) {
for (auto i = start; i < end; i++) {
for (int64_t j = 0; j < std::min(m, i + k); j++) {
result[i * res_row_stride + j * res_col_stride] = 0;
}
if (!inplace) { // copy the rest of the self if not inplace
for (int64_t j = std::max(zero, i + k); j < m; j++) {
result[i * res_row_stride + j * res_col_stride] = self[i * self_row_stride + j * self_col_stride];
}
}
}
});
} else {
at::parallel_for(0, n, 0, [&](int64_t start, int64_t end) {
for (auto i = start; i < end; i++) {
for (int64_t j = std::max(zero, i + k + 1); j < m; j++) {
result[i * res_row_stride + j * res_col_stride] = 0;
}
if (!inplace) { // copy the rest of the self if not inplace
for (int64_t j = zero; j < std::min(m, i + k + 1); j++) {
result[i * res_row_stride + j * res_col_stride] = self[i * self_row_stride + j * self_col_stride];
}
}
}
});
}
}
template <typename scalar_t, bool upper>
void apply_triu_tril(Tensor& result, const Tensor& self, bool inplace, int64_t k) {
auto n = self.size(-2);
auto m = self.size(-1);
auto self_data = self.data_ptr<scalar_t>();
auto self_stride = (self.dim() > 2 && self.stride(-3) > 0) ? self.stride(-3) : 1;
auto batchsize = batchCountTrilTriu(result);
auto self_row_stride = self.stride(-2);
auto self_column_stride = self.stride(-1);
auto result_data = result.data_ptr<scalar_t>();
int64_t result_stride, result_row_stride, result_column_stride;
if (result_data != self_data) {
result_stride = (result.dim() > 2 && result.stride(-3) > 0) ? result.stride(-3) : 1;
result_row_stride = result.stride(-2);
result_column_stride = result.stride(-1);
} else {
result_stride = self_stride;
result_row_stride = self_row_stride;
result_column_stride = self_column_stride;
}
at::parallel_for(0, batchsize, 0, [&](int64_t start, int64_t end) {
for (auto b = start; b < end; b++) {
scalar_t* self_batch = &self_data[b * self_stride];
scalar_t* result_batch = &result_data[b * result_stride];
apply_triu_tril_single<scalar_t, upper>(
result_batch, self_batch, inplace, k, n, m,
result_row_stride, result_column_stride, self_row_stride, self_column_stride);
}
});
}
Tensor tril(const Tensor& self, int64_t k) {
Tensor result = at::empty({0}, self.options());
at::tril_out(result, self, k);
return result;
}
Tensor& tril_cpu_(Tensor &self, int64_t k) {
if (self.numel() == 0) {
return self;
}
bool inplace;
Tensor self_c;
std::tie(inplace, self_c) = checkTrilTriuBatchContiguous(self, true);
Tensor result = inplace ? self : at::empty_like(self);
AT_DISPATCH_ALL_TYPES_AND2(at::ScalarType::Half, at::ScalarType::Bool, self.scalar_type(), "tril", [&]{
apply_triu_tril<scalar_t, false>(result, self_c, inplace, k);
});
if (!inplace) self.copy_(result);
return self;
}
Tensor& tril_cpu_out(Tensor &result, const Tensor& self, int64_t k) {
if (result.sizes() != self.sizes()) {
result.resize_as_(self);
}
if (self.numel() == 0) {
return result;
}
Tensor self_c;
std::tie(std::ignore, self_c) = checkTrilTriuBatchContiguous(self, false);
AT_DISPATCH_ALL_TYPES_AND2(at::ScalarType::Half, at::ScalarType::Bool, self.scalar_type(), "tril", [&]{
apply_triu_tril<scalar_t, false>(result, self_c, false, k);
});
return result;
}
Tensor triu(const Tensor& self, int64_t k) {
Tensor result = at::empty({0}, self.options());
at::triu_out(result, self, k);
return result;
}
Tensor& triu_cpu_(Tensor &self, int64_t k) {
if (self.numel() == 0) {
return self;
}
bool inplace;
Tensor self_c;
std::tie(inplace, self_c) = checkTrilTriuBatchContiguous(self, true);
Tensor result = inplace ? self : at::empty_like(self);
AT_DISPATCH_ALL_TYPES_AND2(at::ScalarType::Half, at::ScalarType::Bool, self.scalar_type(), "triu", [&]{
apply_triu_tril<scalar_t, true>(result, self_c, inplace, k);
});
if (!inplace) self.copy_(result);
return self;
}
Tensor& triu_cpu_out(Tensor &result, const Tensor& self, int64_t k) {
if (result.sizes() != self.sizes()) {
result.resize_as_(self);
}
if (self.numel() == 0) {
return result;
}
Tensor self_c;
std::tie(std::ignore, self_c) = checkTrilTriuBatchContiguous(self, false);
AT_DISPATCH_ALL_TYPES_AND2(at::ScalarType::Half, at::ScalarType::Bool, self.scalar_type(), "triu", [&]{
apply_triu_tril<scalar_t, true>(result, self_c, false, k);
});
return result;
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ triangular_solve ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_triangular_solve(Tensor& b, Tensor& A, bool upper, bool transpose, bool unitriangular) {
#ifndef USE_LAPACK
AT_ERROR("triangular_solve: LAPACK library not found in compilation");
#else
char uplo = upper ? 'U' : 'L';
char trans = transpose ? 'T' : 'N';
char diag = unitriangular ? 'U' : 'N';
auto A_data = A.data_ptr<scalar_t>();
auto b_data = b.data_ptr<scalar_t>();
auto A_mat_stride = matrixStride(A);
auto b_mat_stride = matrixStride(b);
auto batch_size = batchCount(A);
auto n = A.size(-2);
auto nrhs = b.size(-1);
int info;
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* A_working_ptr = &A_data[i * A_mat_stride];
scalar_t* b_working_ptr = &b_data[i * b_mat_stride];
lapackTriangularSolve<scalar_t>(uplo, trans, diag, n, nrhs, A_working_ptr, n, b_working_ptr, n, &info);
}
#endif
}
std::tuple<Tensor, Tensor> _triangular_solve_helper_cpu(const Tensor& self, const Tensor& A,
bool upper, bool transpose, bool unitriangular) {
auto self_working_copy = cloneBatchedColumnMajor(self);
auto A_working_copy = cloneBatchedColumnMajor(A);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "triangular_solve_cpu", [&]{
apply_triangular_solve<scalar_t>(self_working_copy, A_working_copy, upper, transpose, unitriangular);
});
return std::tuple<Tensor, Tensor>(self_working_copy, A_working_copy);
}
// Supports arbitrary batch dimensions for self and A
std::tuple<Tensor, Tensor> triangular_solve(const Tensor& self, const Tensor& A,
bool upper, bool transpose, bool unitriangular) {
TORCH_CHECK(self.dim() >= 2,
"b should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
TORCH_CHECK(A.dim() >= 2,
"u should have at least 2 dimensions, but has ", A.dim(), " dimensions instead");
Tensor self_broadcasted, A_broadcasted;
std::tie(self_broadcasted, A_broadcasted) = _linear_solve_broadcast_args(self, A, "triangular_solve");
return at::_triangular_solve_helper(self_broadcasted, A_broadcasted, upper, transpose, unitriangular);
}
std::tuple<Tensor&, Tensor&> triangular_solve_out(Tensor& result, Tensor& clone_A, const Tensor& self, const Tensor& A,
bool upper, bool transpose, bool unitriangular) {
Tensor result_tmp, clone_A_tmp;
std::tie(result_tmp, clone_A_tmp) = at::_triangular_solve_helper(self, A, upper, transpose, unitriangular);
result.resize_as_(result_tmp).copy_(result_tmp);
clone_A.resize_as_(clone_A_tmp).copy_(clone_A_tmp);
return std::tuple<Tensor&, Tensor&>(result, clone_A);
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ qr ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_geqrf(Tensor& self, Tensor& tau, int64_t m, int64_t n,
std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("qr: LAPACK library not found in compilation");
#else
auto self_data = self.data_ptr<scalar_t>();
auto tau_data = tau.data_ptr<scalar_t>();
auto self_matrix_stride = matrixStride(self);
auto tau_stride = tau.size(-1);
auto batch_size = batchCount(self);
int info;
// Run once, first to get the optimum work size.
// Since we deal with batches of matrices with the same dimensions, doing this outside
// the loop saves (batch_size - 1) workspace queries which would provide the same result
// and (batch_size - 1) calls to allocate and deallocate workspace using at::empty()
int lwork = -1;
scalar_t wkopt;
lapackGeqrf<scalar_t>(m, n, self_data, m, tau_data, &wkopt, lwork, &info);
lwork = static_cast<int>(wkopt);
Tensor work = at::empty({lwork}, self.options());
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* self_working_ptr = &self_data[i * self_matrix_stride];
scalar_t* tau_working_ptr = &tau_data[i * tau_stride];
// now compute the actual R and TAU
lapackGeqrf<scalar_t>(m, n, self_working_ptr, m, tau_working_ptr, work.data_ptr<scalar_t>(), lwork, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
template<typename scalar_t>
static void apply_orgqr(Tensor& self, const Tensor& tau, int64_t m, int64_t n_columns,
int64_t k, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("qr: LAPACK library not found in compilation");
#else
auto self_data = self.data_ptr<scalar_t>();
auto tau_data = tau.data_ptr<scalar_t>();
auto self_matrix_stride = matrixStride(self);
auto tau_stride = tau.size(-1);
auto batch_size = batchCount(self);
int info;
// Run once, first to get the optimum work size.
// Since we deal with batches of matrices with the same dimensions, doing this outside
// the loop saves (batch_size - 1) workspace queries which would provide the same result
// and (batch_size - 1) calls to allocate and deallocate workspace using at::empty()
int lwork = -1;
scalar_t wkopt;
lapackOrgqr<scalar_t>(m, n_columns, k, self_data, m, tau_data, &wkopt, lwork, &info);
lwork = static_cast<int>(wkopt);
Tensor work = at::empty({lwork}, self.options());
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* self_working_ptr = &self_data[i * self_matrix_stride];
scalar_t* tau_working_ptr = &tau_data[i * tau_stride];
// now compute the actual Q
lapackOrgqr<scalar_t>(m, n_columns, k, self_working_ptr, m, tau_working_ptr, work.data_ptr<scalar_t>(), lwork, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
std::tuple<Tensor, Tensor> _qr_helper_cpu(const Tensor& self, bool some) {
std::vector<int64_t> infos(batchCount(self), 0);
int64_t m = self.size(-2), n = self.size(-1);
// Setup inputs for apply_geqrf
auto self_sizes = self.sizes().vec();
self_sizes.pop_back();
self_sizes[self.dim() - 2] = std::min(m, n);
auto tau_working_copy = at::empty(self_sizes, self.options());
Tensor q_working_copy;
// Setup input geometry for apply_orgqr
std::vector<int64_t> q_sizes, q_strides;
int64_t n_columns_q;
Tensor R;
std::tie(q_sizes, q_strides, n_columns_q) = _compute_geometry_for_Q(self, some);
// If there are no elements, then we simply return a pair of tensors of required dimensions
if (self.numel() == 0) {
// Fix the number of columns of q appropriately
q_sizes[self.dim() - 1] = n_columns_q;
q_working_copy = at::eye(q_sizes[self.dim() - 2], q_sizes[self.dim() - 1], self.options());
q_working_copy = q_working_copy.expand_as(q_working_copy);
// We repurpose the same q_sizes for R
// Fix the number of rows and columns of q_working_copy appropriately
q_sizes[self.dim() - 1] = n;
q_sizes[self.dim() - 2] = n_columns_q;
R = at::empty(q_sizes, self.options());
return std::make_tuple(q_working_copy, R);
}
// First perform GEQRF for R and TAU (the elementary reflectors)
// We will need to generate R from the upper triangular matrix from the
// matrix input to GEQRF.
q_working_copy = at::empty_strided(q_sizes, q_strides, self.options());
q_working_copy.narrow(-1, 0, n).copy_(self);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "qr_cpu", [&]{
apply_geqrf<scalar_t>(q_working_copy, tau_working_copy, m, n, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "qr_cpu");
} else {
singleCheckErrors(infos[0], "qr_cpu");
}
R = q_working_copy.slice(-2, 0, n_columns_q).slice(-1, 0, n).triu();
// Next perform ORGQR for Q using the results (both raw R and TAU) from GEQRF
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "qr_cpu", [&]{
apply_orgqr<scalar_t>(q_working_copy, tau_working_copy, m, n_columns_q, std::min(m, n), infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "qr_cpu");
} else {
singleCheckErrors(infos[0], "qr_cpu");
}
return std::make_tuple(q_working_copy.narrow(-1, 0, n_columns_q), R);
}
std::tuple<Tensor,Tensor> qr(const Tensor& self, bool some) {
TORCH_CHECK(self.dim() >= 2,
"self should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
return at::_qr_helper(self, some);
}
std::tuple<Tensor&,Tensor&> qr_out(Tensor& Q, Tensor& R, const Tensor& self, bool some) {
TORCH_CHECK(self.dim() >= 2,
"self should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
Tensor Q_tmp, R_tmp;
std::tie(Q_tmp, R_tmp) = at::_qr_helper(self, some);
Q.resize_as_(Q_tmp).copy_(Q_tmp);
R.resize_as_(R_tmp).copy_(R_tmp);
return std::tuple<Tensor&, Tensor&>(Q, R);
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ symeig ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template <typename scalar_t>
static void apply_symeig(Tensor& self, Tensor& eigvals, bool eigenvectors, bool upper, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("symeig: LAPACK library not found in compilation");
#else
auto self_data = self.data_ptr<scalar_t>();
auto eigvals_data = eigvals.data_ptr<scalar_t>();
auto self_matrix_stride = matrixStride(self);
auto eigvals_stride = eigvals.size(-1);
auto batch_size = batchCount(self);
auto n = self.size(-1);
char uplo = upper ? 'U' : 'L';
char jobz = eigenvectors ? 'V' : 'N';
int info;
// Run once, first to get the optimum work size.
// Since we deal with batches of matrices with the same dimensions, doing this outside
// the loop saves (batch_size - 1) workspace queries which would provide the same result
// and (batch_size - 1) calls to allocate and deallocate workspace using at::empty()
int lwork = -1;
scalar_t wkopt;
lapackSymeig<scalar_t>(jobz, uplo, n, self_data, n, eigvals_data, &wkopt, lwork, &info);
lwork = static_cast<int>(wkopt);
Tensor work = at::empty({lwork}, self.options());
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* self_working_ptr = &self_data[i * self_matrix_stride];
scalar_t* eigvals_working_ptr = &eigvals_data[i * eigvals_stride];
// now compute the eigenvalues and the eigenvectors (optionally)
lapackSymeig<scalar_t>(jobz, uplo, n, self_working_ptr, n, eigvals_working_ptr, work.data_ptr<scalar_t>(), lwork, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
std::tuple<Tensor, Tensor> _symeig_helper_cpu(const Tensor& self, bool eigenvectors, bool upper) {
std::vector<int64_t> infos(batchCount(self), 0);
auto self_sizes = self.sizes().vec();
self_sizes.pop_back();
auto eigvals = at::empty(self_sizes, self.options());
if (self.numel() == 0) {
return std::tuple<Tensor, Tensor>(eigvals, at::empty_like(self));
}
auto self_working_copy = cloneBatchedColumnMajor(self);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "symeig_cpu", [&]{
apply_symeig<scalar_t>(self_working_copy, eigvals, eigenvectors, upper, infos);
});
if (!eigenvectors) {
self_working_copy.zero_();
}
if (self.dim() > 2) {
batchCheckErrors(infos, "symeig_cpu");
} else {
singleCheckErrors(infos[0], "symeig_cpu");
}
return std::tuple<Tensor, Tensor>(eigvals, self_working_copy);
}
std::tuple<Tensor, Tensor> symeig(const Tensor& self, bool eigenvectors, bool upper) {
squareCheckInputs(self);
return at::_symeig_helper(self, eigenvectors, upper);
}
std::tuple<Tensor&, Tensor&> symeig_out(Tensor& vals, Tensor& vecs, const Tensor& self, bool eigenvectors, bool upper) {
squareCheckInputs(self);
Tensor vals_tmp, vecs_tmp;
std::tie(vals_tmp, vecs_tmp) = at::_symeig_helper(self, eigenvectors, upper);
vals.resize_as_(vals_tmp).copy_(vals_tmp);
vecs.resize_as_(vecs_tmp).copy_(vecs_tmp);
return std::tuple<Tensor&, Tensor&>(vals, vecs);
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ svd ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template <typename scalar_t>
static void apply_svd(Tensor& self, Tensor& U, Tensor& S, Tensor& VT,
char jobz, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("svd: LAPACK library not found in compilation");
#else
auto self_data = self.data_ptr<scalar_t>();
auto U_data = U.data_ptr<scalar_t>();
auto S_data = S.data_ptr<scalar_t>();
auto VT_data = VT.data_ptr<scalar_t>();
auto self_stride = matrixStride(self);
auto U_stride = matrixStride(U);
auto S_stride = S.size(-1);
auto VT_stride = matrixStride(VT);
auto batchsize = batchCount(self);
int info;
auto m = self.size(-2);
auto n = self.size(-1);
auto k = std::min(m, n);
Tensor iwork = at::empty({8 * k}, at::kInt);
auto iwork_data = iwork.data_ptr<int>();
// Run once, first to get the optimum work size.
// Since we deal with batches of matrices with the same dimensions, doing this outside
// the loop saves (batch_size - 1) workspace queries which would provide the same result
// and (batch_size - 1) calls to allocate and deallocate workspace using at::empty()
int lwork = -1;
scalar_t wkopt;
lapackSvd<scalar_t>(jobz, m, n, self_data, m, S_data, U_data, m, VT_data, n, &wkopt, lwork, iwork_data, &info);
lwork = static_cast<int>(wkopt);
Tensor work = at::empty({lwork}, self.options());
auto work_data = work.data_ptr<scalar_t>();
for (int64_t i = 0; i < batchsize; i++) {
scalar_t* self_working_ptr = &self_data[i * self_stride];
scalar_t* S_working_ptr = &S_data[i * S_stride];
scalar_t* U_working_ptr = &U_data[i * U_stride];
scalar_t* VT_working_ptr = &VT_data[i * VT_stride];
// Compute S, U (optionally) and VT (optionally)
lapackSvd<scalar_t>(jobz, m, n, self_working_ptr, m,
S_working_ptr, U_working_ptr, m, VT_working_ptr, n, work_data, lwork, iwork_data, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
std::tuple<Tensor, Tensor, Tensor> _svd_helper_cpu(const Tensor& self, bool some, bool compute_uv) {
std::vector<int64_t> infos(batchCount(self), 0);
int64_t m = self.size(-2), n = self.size(-1);
int64_t k = std::min(m, n);
char jobz = compute_uv ? (some ? 'S' : 'A') : 'N';
Tensor U_working_copy, S_working_copy, VT_working_copy;
std::tie(U_working_copy, S_working_copy, VT_working_copy) = _create_U_S_VT(self, some, compute_uv);
if (self.numel() > 0) {
auto self_working_copy = cloneBatchedColumnMajor(self);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "svd_cpu", [&]{
apply_svd<scalar_t>(self_working_copy, U_working_copy, S_working_copy, VT_working_copy, jobz, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "svd_cpu");
} else {
singleCheckErrors(infos[0], "svd_cpu");
}
if (compute_uv) {
if (some) {
VT_working_copy = VT_working_copy.narrow(-1, 0, k);
}
} else {
VT_working_copy.zero_();
U_working_copy.zero_();
}
} else {
U_working_copy.zero_();
VT_working_copy.zero_();
}
return std::make_tuple(U_working_copy, S_working_copy, VT_working_copy);
}
std::tuple<Tensor, Tensor, Tensor> svd(const Tensor& self, bool some, bool compute_uv) {
TORCH_CHECK(self.dim() >= 2,
"self should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
return at::_svd_helper(self, some, compute_uv);
}
std::tuple<Tensor&, Tensor&, Tensor&> svd_out(Tensor& U, Tensor& S, Tensor& VT,
const Tensor& self, bool some, bool compute_uv) {
TORCH_CHECK(self.dim() >= 2,
"self should have at least 2 dimensions, but has ", self.dim(), " dimensions instead");
Tensor U_tmp, S_tmp, VT_tmp;
std::tie(U_tmp, S_tmp, VT_tmp) = at::_svd_helper(self, some, compute_uv);
U.resize_as_(U_tmp).copy_(U_tmp);
S.resize_as_(S_tmp).copy_(S_tmp);
VT.resize_as_(VT_tmp).copy_(VT_tmp);
return std::tuple<Tensor&, Tensor&, Tensor&>(U, S, VT);
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ lu_solve ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
template<typename scalar_t>
static void apply_lu_solve(Tensor& b, const Tensor& lu, const Tensor& pivots, std::vector<int64_t>& infos) {
#ifndef USE_LAPACK
AT_ERROR("lu_solve: LAPACK library not found in compilation");
#else
auto b_data = b.data_ptr<scalar_t>();
auto lu_data = lu.data_ptr<scalar_t>();
auto pivots_data = pivots.data_ptr<int>();
auto b_stride = matrixStride(b);
auto lu_stride = matrixStride(lu);
auto pivots_stride = pivots.size(-1);
auto batch_size = batchCount(b);
auto n = lu.size(-2);
auto nrhs = b.size(-1);
int info;
for (int64_t i = 0; i < batch_size; i++) {
scalar_t* b_working_ptr = &b_data[i * b_stride];
scalar_t* lu_working_ptr = &lu_data[i * lu_stride];
int* pivots_working_ptr = &pivots_data[i * pivots_stride];
lapackLuSolve<scalar_t>('N', n, nrhs, lu_working_ptr, n, pivots_working_ptr,
b_working_ptr, n, &info);
infos[i] = info;
if (info != 0) {
return;
}
}
#endif
}
Tensor _lu_solve_helper_cpu(const Tensor& self, const Tensor& LU_data, const Tensor& LU_pivots) {
auto self_working_copy = cloneBatchedColumnMajor(self);
auto LU_data_working_copy = cloneBatchedColumnMajor(LU_data);
auto LU_pivots_working_copy = LU_pivots.is_contiguous() ? LU_pivots : LU_pivots.contiguous();
std::vector<int64_t> infos(batchCount(self), 0);
AT_DISPATCH_FLOATING_TYPES(self.scalar_type(), "lu_solve_cpu", [&]{
apply_lu_solve<scalar_t>(self_working_copy, LU_data_working_copy, LU_pivots_working_copy, infos);
});
if (self.dim() > 2) {
batchCheckErrors(infos, "lu_solve_cpu");
} else {
singleCheckErrors(infos[0], "lu_solve_cpu");
}
return self_working_copy;
}
Tensor lu_solve(const Tensor& self, const Tensor& LU_data, const Tensor& LU_pivots) {
TORCH_CHECK(self.dim() == 3 || self.dim() == 2,
"b should have 2 or 3 dimensions, but has ", self.dim(), " dimensions instead");
TORCH_CHECK(LU_data.dim() == 3,
"LU_data should have 3 dimensions, but has ", LU_data.dim(), " dimensions instead");
TORCH_CHECK(self.size(0) == LU_data.size(0),
"b and LU_data should have the same number of batches");
TORCH_CHECK(LU_pivots.size(1) == LU_data.size(2),
"Number of pivots per batch should be same as the dimension of the matrix");
TORCH_CHECK(LU_pivots.size(0) == LU_data.size(0),
"Batch dimensions of LU_pivots doesn't match batch dimensions of LU_data");
TORCH_CHECK(LU_pivots.dtype() == at::kInt,
"LU_pivots should be a Tensor of scalar type Int");
TORCH_CHECK(LU_pivots.device() == LU_data.device(),
"Expected LU_pivots and LU_data to be on the same device, "
"but found LU_pivots on ", LU_pivots.device(), " and LU_data on ",
LU_data.device(), " instead");
Tensor self_3D;
if (self.dim() == 2) {
TORCH_WARN("Passing RHS tensor with number of dimensions = 2 is deprecated, "
"and will be removed in the next release. Please unsqueeze the last dimension "
"to obtain an RHS tensor with number of right hand sides = 1");
self_3D = self.unsqueeze(2);
} else {
self_3D = self;
}
linearSolveCheckInputs(self_3D, LU_data, "lu_solve");
Tensor solution = at::_lu_solve_helper(self_3D, LU_data, LU_pivots);
if (self.dim() == 2) {
return solution.squeeze(2);
} else {
return solution;
}
}
Tensor& lu_solve_out(Tensor& result, const Tensor& self, const Tensor& LU_data, const Tensor& LU_pivots) {
Tensor result_tmp = at::lu_solve(self, LU_data, LU_pivots);
result.resize_as_(result_tmp).copy_(result_tmp);
return result;
}
}} // namespace at::native
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
4deee7353856a98c50bde69367ee527ff3b360ca | 31703ceb0e93ed10107f5c190929506b435cc7a5 | /Cryptoss/test.cpp | 6fb1b73ec77827bc918d2e2d9177a153b92276e9 | [] | no_license | Kaustav97/CPP_Reference | 7baa6dd6ef7a337d98665264204f3156b3c50a29 | a0f4a654a1825065e0e8b74b248c24a0de10839e | refs/heads/master | 2020-05-14T20:47:58.027806 | 2019-04-17T18:58:18 | 2019-04-17T18:58:18 | 181,951,052 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 341 | cpp | #include <bits/stdc++.h>
using namespace std;
#define tr(cont) for(auto it=cont.begin();it!=cont.end();it++)
#define tr1(cont,it) for(;it!=cont.end();it++)
#define rep(n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define ll long long
#define fs first
#define sc second
int main(){
string str= "hello";
str.pop_back();
cout<<str;
}
| [
"chanda.kaustav13@gmail.com"
] | chanda.kaustav13@gmail.com |
c0e5def83efdca4e6f1160a7a72c262347799e1a | f42dd0e2471c03600f890b2c769e57b24aaa08e3 | /FrameWork/Engine/Code/Observer.cpp | ed84f179f5a1b55b12aa66a1f2eee69c6ee9ddb0 | [] | no_license | zeldie/- | 1722f777fbe870e9ccef9e1eed49bb07e2ce1dd7 | 658225e7ead91839750f8024593ed67b059d8923 | refs/heads/master | 2022-12-22T02:34:30.128966 | 2020-09-14T07:56:25 | 2020-09-14T07:56:25 | 295,115,224 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 123 | cpp | #include "Observer.h"
USING(Engine)
CObserver::CObserver()
{
}
CObserver::~CObserver()
{
}
void CObserver::Free()
{
}
| [
"Administrator@JUSIN-20200527X"
] | Administrator@JUSIN-20200527X |
50eec4cf500fbb497ef705ed7837c0e4d0e33129 | 5d57ae30d25e717040150a9371e921cac8702e51 | /MapRepresentation/qgslib/gui/qgis_gui_autogen/include_RelWithDebInfo/2Z5TG4AWKX/moc_qgslabelsettingswidgetbase.cpp | d216aae1a97a3b6cf421558ac3968218db89c378 | [] | no_license | 11wy11/MapRepresentation | 726092ae8d4da46de1664e62f811d140571f19e7 | 507a44e9b14cdeb6ad671470e9ec35c555b8ac53 | refs/heads/master | 2023-02-22T20:17:27.715037 | 2021-01-25T13:43:02 | 2021-01-25T13:43:02 | 330,683,896 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,479 | cpp | /****************************************************************************
** Meta object code from reading C++ file 'qgslabelsettingswidgetbase.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.11.2)
**
** WARNING! All changes made in this file will be lost!
*****************************************************************************/
#include "../../../../../../../../src/gui/labeling/qgslabelsettingswidgetbase.h"
#include <QtCore/qbytearray.h>
#include <QtCore/qmetatype.h>
#if !defined(Q_MOC_OUTPUT_REVISION)
#error "The header file 'qgslabelsettingswidgetbase.h' doesn't include <QObject>."
#elif Q_MOC_OUTPUT_REVISION != 67
#error "This file was generated using the moc from 5.11.2. It"
#error "cannot be used with the include files from this version of Qt."
#error "(The moc has changed too much.)"
#endif
QT_BEGIN_MOC_NAMESPACE
QT_WARNING_PUSH
QT_WARNING_DISABLE_DEPRECATED
struct qt_meta_stringdata_QgsLabelSettingsWidgetBase_t {
QByteArrayData data[6];
char stringdata0[105];
};
#define QT_MOC_LITERAL(idx, ofs, len) \
Q_STATIC_BYTE_ARRAY_DATA_HEADER_INITIALIZER_WITH_OFFSET(len, \
qptrdiff(offsetof(qt_meta_stringdata_QgsLabelSettingsWidgetBase_t, stringdata0) + ofs \
- idx * sizeof(QByteArrayData)) \
)
static const qt_meta_stringdata_QgsLabelSettingsWidgetBase_t qt_meta_stringdata_QgsLabelSettingsWidgetBase = {
{
QT_MOC_LITERAL(0, 0, 26), // "QgsLabelSettingsWidgetBase"
QT_MOC_LITERAL(1, 27, 7), // "changed"
QT_MOC_LITERAL(2, 35, 0), // ""
QT_MOC_LITERAL(3, 36, 21), // "auxiliaryFieldCreated"
QT_MOC_LITERAL(4, 58, 20), // "createAuxiliaryField"
QT_MOC_LITERAL(5, 79, 25) // "updateDataDefinedProperty"
},
"QgsLabelSettingsWidgetBase\0changed\0\0"
"auxiliaryFieldCreated\0createAuxiliaryField\0"
"updateDataDefinedProperty"
};
#undef QT_MOC_LITERAL
static const uint qt_meta_data_QgsLabelSettingsWidgetBase[] = {
// content:
7, // revision
0, // classname
0, 0, // classinfo
4, 14, // methods
0, 0, // properties
0, 0, // enums/sets
0, 0, // constructors
0, // flags
2, // signalCount
// signals: name, argc, parameters, tag, flags
1, 0, 34, 2, 0x06 /* Public */,
3, 0, 35, 2, 0x06 /* Public */,
// slots: name, argc, parameters, tag, flags
4, 0, 36, 2, 0x08 /* Private */,
5, 0, 37, 2, 0x08 /* Private */,
// signals: parameters
QMetaType::Void,
QMetaType::Void,
// slots: parameters
QMetaType::Void,
QMetaType::Void,
0 // eod
};
void QgsLabelSettingsWidgetBase::qt_static_metacall(QObject *_o, QMetaObject::Call _c, int _id, void **_a)
{
if (_c == QMetaObject::InvokeMetaMethod) {
QgsLabelSettingsWidgetBase *_t = static_cast<QgsLabelSettingsWidgetBase *>(_o);
Q_UNUSED(_t)
switch (_id) {
case 0: _t->changed(); break;
case 1: _t->auxiliaryFieldCreated(); break;
case 2: _t->createAuxiliaryField(); break;
case 3: _t->updateDataDefinedProperty(); break;
default: ;
}
} else if (_c == QMetaObject::IndexOfMethod) {
int *result = reinterpret_cast<int *>(_a[0]);
{
using _t = void (QgsLabelSettingsWidgetBase::*)();
if (*reinterpret_cast<_t *>(_a[1]) == static_cast<_t>(&QgsLabelSettingsWidgetBase::changed)) {
*result = 0;
return;
}
}
{
using _t = void (QgsLabelSettingsWidgetBase::*)();
if (*reinterpret_cast<_t *>(_a[1]) == static_cast<_t>(&QgsLabelSettingsWidgetBase::auxiliaryFieldCreated)) {
*result = 1;
return;
}
}
}
Q_UNUSED(_a);
}
QT_INIT_METAOBJECT const QMetaObject QgsLabelSettingsWidgetBase::staticMetaObject = {
{ &QgsPanelWidget::staticMetaObject, qt_meta_stringdata_QgsLabelSettingsWidgetBase.data,
qt_meta_data_QgsLabelSettingsWidgetBase, qt_static_metacall, nullptr, nullptr}
};
const QMetaObject *QgsLabelSettingsWidgetBase::metaObject() const
{
return QObject::d_ptr->metaObject ? QObject::d_ptr->dynamicMetaObject() : &staticMetaObject;
}
void *QgsLabelSettingsWidgetBase::qt_metacast(const char *_clname)
{
if (!_clname) return nullptr;
if (!strcmp(_clname, qt_meta_stringdata_QgsLabelSettingsWidgetBase.stringdata0))
return static_cast<void*>(this);
if (!strcmp(_clname, "QgsExpressionContextGenerator"))
return static_cast< QgsExpressionContextGenerator*>(this);
return QgsPanelWidget::qt_metacast(_clname);
}
int QgsLabelSettingsWidgetBase::qt_metacall(QMetaObject::Call _c, int _id, void **_a)
{
_id = QgsPanelWidget::qt_metacall(_c, _id, _a);
if (_id < 0)
return _id;
if (_c == QMetaObject::InvokeMetaMethod) {
if (_id < 4)
qt_static_metacall(this, _c, _id, _a);
_id -= 4;
} else if (_c == QMetaObject::RegisterMethodArgumentMetaType) {
if (_id < 4)
*reinterpret_cast<int*>(_a[0]) = -1;
_id -= 4;
}
return _id;
}
// SIGNAL 0
void QgsLabelSettingsWidgetBase::changed()
{
QMetaObject::activate(this, &staticMetaObject, 0, nullptr);
}
// SIGNAL 1
void QgsLabelSettingsWidgetBase::auxiliaryFieldCreated()
{
QMetaObject::activate(this, &staticMetaObject, 1, nullptr);
}
struct qt_meta_stringdata_QgsLabelSettingsWidgetDialog_t {
QByteArrayData data[1];
char stringdata0[29];
};
#define QT_MOC_LITERAL(idx, ofs, len) \
Q_STATIC_BYTE_ARRAY_DATA_HEADER_INITIALIZER_WITH_OFFSET(len, \
qptrdiff(offsetof(qt_meta_stringdata_QgsLabelSettingsWidgetDialog_t, stringdata0) + ofs \
- idx * sizeof(QByteArrayData)) \
)
static const qt_meta_stringdata_QgsLabelSettingsWidgetDialog_t qt_meta_stringdata_QgsLabelSettingsWidgetDialog = {
{
QT_MOC_LITERAL(0, 0, 28) // "QgsLabelSettingsWidgetDialog"
},
"QgsLabelSettingsWidgetDialog"
};
#undef QT_MOC_LITERAL
static const uint qt_meta_data_QgsLabelSettingsWidgetDialog[] = {
// content:
7, // revision
0, // classname
0, 0, // classinfo
0, 0, // methods
0, 0, // properties
0, 0, // enums/sets
0, 0, // constructors
0, // flags
0, // signalCount
0 // eod
};
void QgsLabelSettingsWidgetDialog::qt_static_metacall(QObject *_o, QMetaObject::Call _c, int _id, void **_a)
{
Q_UNUSED(_o);
Q_UNUSED(_id);
Q_UNUSED(_c);
Q_UNUSED(_a);
}
QT_INIT_METAOBJECT const QMetaObject QgsLabelSettingsWidgetDialog::staticMetaObject = {
{ &QDialog::staticMetaObject, qt_meta_stringdata_QgsLabelSettingsWidgetDialog.data,
qt_meta_data_QgsLabelSettingsWidgetDialog, qt_static_metacall, nullptr, nullptr}
};
const QMetaObject *QgsLabelSettingsWidgetDialog::metaObject() const
{
return QObject::d_ptr->metaObject ? QObject::d_ptr->dynamicMetaObject() : &staticMetaObject;
}
void *QgsLabelSettingsWidgetDialog::qt_metacast(const char *_clname)
{
if (!_clname) return nullptr;
if (!strcmp(_clname, qt_meta_stringdata_QgsLabelSettingsWidgetDialog.stringdata0))
return static_cast<void*>(this);
return QDialog::qt_metacast(_clname);
}
int QgsLabelSettingsWidgetDialog::qt_metacall(QMetaObject::Call _c, int _id, void **_a)
{
_id = QDialog::qt_metacall(_c, _id, _a);
return _id;
}
QT_WARNING_POP
QT_END_MOC_NAMESPACE
| [
"1124485058@qq.com"
] | 1124485058@qq.com |
7c53617ce989587b1959c366a4e1d3c9f15d539b | d0fb46aecc3b69983e7f6244331a81dff42d9595 | /ga/include/alibabacloud/ga/model/CreateBasicAccelerateIpResult.h | 9071833c1fc6e7b4d6d8faa59f6d116ebe671190 | [
"Apache-2.0"
] | permissive | aliyun/aliyun-openapi-cpp-sdk | 3d8d051d44ad00753a429817dd03957614c0c66a | e862bd03c844bcb7ccaa90571bceaa2802c7f135 | refs/heads/master | 2023-08-29T11:54:00.525102 | 2023-08-29T03:32:48 | 2023-08-29T03:32:48 | 115,379,460 | 104 | 82 | NOASSERTION | 2023-09-14T06:13:33 | 2017-12-26T02:53:27 | C++ | UTF-8 | C++ | false | false | 1,711 | h | /*
* Copyright 2009-2017 Alibaba Cloud 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.
*/
#ifndef ALIBABACLOUD_GA_MODEL_CREATEBASICACCELERATEIPRESULT_H_
#define ALIBABACLOUD_GA_MODEL_CREATEBASICACCELERATEIPRESULT_H_
#include <string>
#include <vector>
#include <utility>
#include <alibabacloud/core/ServiceResult.h>
#include <alibabacloud/ga/GaExport.h>
namespace AlibabaCloud
{
namespace Ga
{
namespace Model
{
class ALIBABACLOUD_GA_EXPORT CreateBasicAccelerateIpResult : public ServiceResult
{
public:
CreateBasicAccelerateIpResult();
explicit CreateBasicAccelerateIpResult(const std::string &payload);
~CreateBasicAccelerateIpResult();
std::string getIpSetId()const;
std::string getAccelerateIpId()const;
std::string getAccelerateIpAddress()const;
std::string getState()const;
std::string getAcceleratorId()const;
protected:
void parse(const std::string &payload);
private:
std::string ipSetId_;
std::string accelerateIpId_;
std::string accelerateIpAddress_;
std::string state_;
std::string acceleratorId_;
};
}
}
}
#endif // !ALIBABACLOUD_GA_MODEL_CREATEBASICACCELERATEIPRESULT_H_ | [
"sdk-team@alibabacloud.com"
] | sdk-team@alibabacloud.com |
09d4b189ed983c1f51bdd8809ae6a56a5d8d57fd | db4b6573376a630a7bdbbd8329e17eb9f70f6417 | /Modules/ParticleSystem/Src/Emitters/ParticleSpriteEmitter.cpp | f8e088cf50f97bfb3a7f3d51ae888db58b5bd700 | [
"MIT"
] | permissive | Reve4Mevol/Explosion | 1c4e21347a35129a995a68f4f7daa3c1c1972917 | ed2bf534a863b8143fcc947591026b62571cc083 | refs/heads/master | 2023-08-14T00:58:12.406126 | 2021-09-09T10:50:20 | 2021-09-09T10:50:20 | 362,523,655 | 0 | 0 | MIT | 2021-04-28T15:43:51 | 2021-04-28T15:43:50 | null | UTF-8 | C++ | false | false | 113 | cpp | //
// Created by LiZhen on 2021/5/30.
//
#include <Emitters/ParticleSpriteEmitter.h>
namespace Explosion {
} | [
"bluesky013@126.com"
] | bluesky013@126.com |
4f8a6d3623a6752df6c80894b0f53ae87cb769d8 | f4e17640afef6d1b4d4a85f583a90e37f705dbd5 | /B2G/gecko/content/base/src/nsImageLoadingContent.cpp | b2853de024abcf291530d1d3a2767444fb0e86fb | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | wilebeast/FireFox-OS | d370362916f0c5a5408fa08285dbf4779f8b5eb3 | 43067f28711d78c429a1d6d58c77130f6899135f | refs/heads/master | 2016-09-05T22:06:54.838558 | 2013-09-03T13:49:21 | 2013-09-03T13:49:21 | 12,572,236 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 38,146 | cpp | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
// vim: ft=cpp tw=78 sw=2 et ts=2
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/*
* A base class which implements nsIImageLoadingContent and can be
* subclassed by various content nodes that want to provide image
* loading functionality (eg <img>, <object>, etc).
*/
#include "nsImageLoadingContent.h"
#include "nsAutoPtr.h"
#include "nsError.h"
#include "nsIContent.h"
#include "nsIDocument.h"
#include "nsIScriptGlobalObject.h"
#include "nsIDOMWindow.h"
#include "nsServiceManagerUtils.h"
#include "nsContentPolicyUtils.h"
#include "nsIURI.h"
#include "nsILoadGroup.h"
#include "imgIContainer.h"
#include "imgILoader.h"
#include "nsThreadUtils.h"
#include "nsNetUtil.h"
#include "nsAsyncDOMEvent.h"
#include "nsGenericElement.h"
#include "nsImageFrame.h"
#include "nsIPresShell.h"
#include "nsEventStates.h"
#include "nsGUIEvent.h"
#include "nsIChannel.h"
#include "nsIStreamListener.h"
#include "nsIFrame.h"
#include "nsIDOMNode.h"
#include "nsContentUtils.h"
#include "nsLayoutUtils.h"
#include "nsIContentPolicy.h"
#include "nsEventDispatcher.h"
#include "nsSVGEffects.h"
#include "mozAutoDocUpdate.h"
#include "mozilla/dom/Element.h"
using namespace mozilla;
#ifdef DEBUG_chb
static void PrintReqURL(imgIRequest* req) {
if (!req) {
printf("(null req)\n");
return;
}
nsCOMPtr<nsIURI> uri;
req->GetURI(getter_AddRefs(uri));
if (!uri) {
printf("(null uri)\n");
return;
}
nsAutoCString spec;
uri->GetSpec(spec);
printf("spec='%s'\n", spec.get());
}
#endif /* DEBUG_chb */
nsImageLoadingContent::nsImageLoadingContent()
: mCurrentRequestFlags(0),
mPendingRequestFlags(0),
mObserverList(nullptr),
mImageBlockingStatus(nsIContentPolicy::ACCEPT),
mLoadingEnabled(true),
mIsImageStateForced(false),
mLoading(false),
// mBroken starts out true, since an image without a URI is broken....
mBroken(true),
mUserDisabled(false),
mSuppressed(false),
mNewRequestsWillNeedAnimationReset(false),
mStateChangerDepth(0),
mCurrentRequestRegistered(false),
mPendingRequestRegistered(false)
{
if (!nsContentUtils::GetImgLoaderForChannel(nullptr)) {
mLoadingEnabled = false;
}
}
void
nsImageLoadingContent::DestroyImageLoadingContent()
{
// Cancel our requests so they won't hold stale refs to us
// NB: Don't ask to discard the images here.
ClearCurrentRequest(NS_BINDING_ABORTED, 0);
ClearPendingRequest(NS_BINDING_ABORTED, 0);
}
nsImageLoadingContent::~nsImageLoadingContent()
{
NS_ASSERTION(!mCurrentRequest && !mPendingRequest,
"DestroyImageLoadingContent not called");
NS_ASSERTION(!mObserverList.mObserver && !mObserverList.mNext,
"Observers still registered?");
}
// Macro to call some func on each observer. This handles observers
// removing themselves.
#define LOOP_OVER_OBSERVERS(func_) \
PR_BEGIN_MACRO \
nsAutoScriptBlocker scriptBlocker; \
for (ImageObserver* observer = &mObserverList, *next; observer; \
observer = next) { \
next = observer->mNext; \
if (observer->mObserver) { \
observer->mObserver->func_; \
} \
} \
PR_END_MACRO
/*
* imgIContainerObserver impl
*/
NS_IMETHODIMP
nsImageLoadingContent::FrameChanged(imgIRequest* aRequest,
imgIContainer* aContainer,
const nsIntRect* aDirtyRect)
{
LOOP_OVER_OBSERVERS(FrameChanged(aRequest, aContainer, aDirtyRect));
return NS_OK;
}
/*
* imgIDecoderObserver impl
*/
NS_IMETHODIMP
nsImageLoadingContent::OnStartRequest(imgIRequest* aRequest)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStartRequest(aRequest));
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnStartDecode(imgIRequest* aRequest)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStartDecode(aRequest));
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnStartContainer(imgIRequest* aRequest,
imgIContainer* aContainer)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStartContainer(aRequest, aContainer));
// Have to check for state changes here, since we might have been in
// the LOADING state before.
UpdateImageState(true);
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnStartFrame(imgIRequest* aRequest,
uint32_t aFrame)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStartFrame(aRequest, aFrame));
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnDataAvailable(imgIRequest* aRequest,
bool aCurrentFrame,
const nsIntRect* aRect)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnDataAvailable(aRequest, aCurrentFrame, aRect));
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnStopFrame(imgIRequest* aRequest,
uint32_t aFrame)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStopFrame(aRequest, aFrame));
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnStopContainer(imgIRequest* aRequest,
imgIContainer* aContainer)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStopContainer(aRequest, aContainer));
return NS_OK;
}
// Warning - This isn't actually fired when decode is complete. Rather, it's
// fired when load is complete. See bug 505385, and in the mean time use
// OnStopContainer.
NS_IMETHODIMP
nsImageLoadingContent::OnStopDecode(imgIRequest* aRequest,
nsresult aStatus,
const PRUnichar* aStatusArg)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
// We should definitely have a request here
NS_ABORT_IF_FALSE(aRequest, "no request?");
NS_PRECONDITION(aRequest == mCurrentRequest || aRequest == mPendingRequest,
"Unknown request");
LOOP_OVER_OBSERVERS(OnStopDecode(aRequest, aStatus, aStatusArg));
// XXXbholley - When we fix bug 505385, everything here should go in
// OnStopRequest.
// Our state may change. Watch it.
AutoStateChanger changer(this, true);
// If the pending request is loaded, switch to it.
if (aRequest == mPendingRequest) {
MakePendingRequestCurrent();
}
NS_ABORT_IF_FALSE(aRequest == mCurrentRequest,
"One way or another, we should be current by now");
// We just loaded all the data we're going to get. If we're visible and
// haven't done an initial paint (*), we want to make sure the image starts
// decoding immediately, for two reasons:
//
// 1) This image is sitting idle but might need to be decoded as soon as we
// start painting, in which case we've wasted time.
//
// 2) We want to block onload until all visible images are decoded. We do this
// by blocking onload until all in-progress decodes get at least one frame
// decoded. However, if all the data comes in while painting is suppressed
// (ie, before the initial paint delay is finished), we fire onload without
// doing a paint first. This means that decode-on-draw images don't start
// decoding, so we can't wait for them to finish. See bug 512435.
//
// (*) IsPaintingSuppressed returns false if we haven't gotten the initial
// reflow yet, so we have to test !DidInitialize || IsPaintingSuppressed.
// It's possible for painting to be suppressed for reasons other than the
// initial paint delay (for example, being in the bfcache), but we probably
// aren't loading images in those situations.
// XXXkhuey should this be GetOurCurrentDoc? Decoding if we're not in
// the document seems silly.
nsIDocument* doc = GetOurOwnerDoc();
nsIPresShell* shell = doc ? doc->GetShell() : nullptr;
if (shell && shell->IsVisible() &&
(!shell->DidInitialize() || shell->IsPaintingSuppressed())) {
mCurrentRequest->RequestDecode();
}
// Fire the appropriate DOM event.
if (NS_SUCCEEDED(aStatus)) {
FireEvent(NS_LITERAL_STRING("load"));
} else {
FireEvent(NS_LITERAL_STRING("error"));
}
nsCOMPtr<nsINode> thisNode = do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
nsSVGEffects::InvalidateDirectRenderingObservers(thisNode->AsElement());
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnStopRequest(imgIRequest* aRequest, bool aLastPart)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnStopRequest(aRequest, aLastPart));
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnImageIsAnimated(imgIRequest *aRequest)
{
bool* requestFlag = GetRegisteredFlagForRequest(aRequest);
if (requestFlag) {
nsLayoutUtils::RegisterImageRequest(GetFramePresContext(),
aRequest, requestFlag);
}
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::OnDiscard(imgIRequest *aRequest)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
LOOP_OVER_OBSERVERS(OnDiscard(aRequest));
return NS_OK;
}
/*
* nsIImageLoadingContent impl
*/
NS_IMETHODIMP
nsImageLoadingContent::GetLoadingEnabled(bool *aLoadingEnabled)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
*aLoadingEnabled = mLoadingEnabled;
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::SetLoadingEnabled(bool aLoadingEnabled)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
if (nsContentUtils::GetImgLoaderForChannel(nullptr)) {
mLoadingEnabled = aLoadingEnabled;
}
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::GetImageBlockingStatus(int16_t* aStatus)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
NS_PRECONDITION(aStatus, "Null out param");
*aStatus = mImageBlockingStatus;
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::AddObserver(imgIDecoderObserver* aObserver)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
NS_ENSURE_ARG_POINTER(aObserver);
if (!mObserverList.mObserver) {
mObserverList.mObserver = aObserver;
// Don't touch the linking of the list!
return NS_OK;
}
// otherwise we have to create a new entry
ImageObserver* observer = &mObserverList;
while (observer->mNext) {
observer = observer->mNext;
}
observer->mNext = new ImageObserver(aObserver);
if (! observer->mNext) {
return NS_ERROR_OUT_OF_MEMORY;
}
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::RemoveObserver(imgIDecoderObserver* aObserver)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
NS_ENSURE_ARG_POINTER(aObserver);
if (mObserverList.mObserver == aObserver) {
mObserverList.mObserver = nullptr;
// Don't touch the linking of the list!
return NS_OK;
}
// otherwise have to find it and splice it out
ImageObserver* observer = &mObserverList;
while (observer->mNext && observer->mNext->mObserver != aObserver) {
observer = observer->mNext;
}
// At this point, we are pointing to the list element whose mNext is
// the right observer (assuming of course that mNext is not null)
if (observer->mNext) {
// splice it out
ImageObserver* oldObserver = observer->mNext;
observer->mNext = oldObserver->mNext;
oldObserver->mNext = nullptr; // so we don't destroy them all
delete oldObserver;
}
#ifdef DEBUG
else {
NS_WARNING("Asked to remove nonexistent observer");
}
#endif
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::GetRequest(int32_t aRequestType,
imgIRequest** aRequest)
{
switch(aRequestType) {
case CURRENT_REQUEST:
*aRequest = mCurrentRequest;
break;
case PENDING_REQUEST:
*aRequest = mPendingRequest;
break;
default:
NS_ERROR("Unknown request type");
*aRequest = nullptr;
return NS_ERROR_UNEXPECTED;
}
NS_IF_ADDREF(*aRequest);
return NS_OK;
}
NS_IMETHODIMP_(void)
nsImageLoadingContent::FrameCreated(nsIFrame* aFrame)
{
NS_ASSERTION(aFrame, "aFrame is null");
// We need to make sure that our image request is registered, if it should
// be registered.
nsPresContext* presContext = aFrame->PresContext();
if (mCurrentRequest) {
nsLayoutUtils::RegisterImageRequestIfAnimated(presContext, mCurrentRequest,
&mCurrentRequestRegistered);
}
if (mPendingRequest) {
nsLayoutUtils::RegisterImageRequestIfAnimated(presContext, mPendingRequest,
&mPendingRequestRegistered);
}
}
NS_IMETHODIMP_(void)
nsImageLoadingContent::FrameDestroyed(nsIFrame* aFrame)
{
NS_ASSERTION(aFrame, "aFrame is null");
// We need to make sure that our image request is deregistered.
if (mCurrentRequest) {
nsLayoutUtils::DeregisterImageRequest(GetFramePresContext(),
mCurrentRequest,
&mCurrentRequestRegistered);
}
if (mPendingRequest) {
nsLayoutUtils::DeregisterImageRequest(GetFramePresContext(),
mPendingRequest,
&mPendingRequestRegistered);
}
}
NS_IMETHODIMP
nsImageLoadingContent::GetRequestType(imgIRequest* aRequest,
int32_t* aRequestType)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
NS_PRECONDITION(aRequestType, "Null out param");
if (aRequest == mCurrentRequest) {
*aRequestType = CURRENT_REQUEST;
return NS_OK;
}
if (aRequest == mPendingRequest) {
*aRequestType = PENDING_REQUEST;
return NS_OK;
}
*aRequestType = UNKNOWN_REQUEST;
NS_ERROR("Unknown request");
return NS_ERROR_UNEXPECTED;
}
NS_IMETHODIMP
nsImageLoadingContent::GetCurrentURI(nsIURI** aURI)
{
if (mCurrentRequest) {
return mCurrentRequest->GetURI(aURI);
}
if (!mCurrentURI) {
*aURI = nullptr;
return NS_OK;
}
return NS_EnsureSafeToReturn(mCurrentURI, aURI);
}
NS_IMETHODIMP
nsImageLoadingContent::LoadImageWithChannel(nsIChannel* aChannel,
nsIStreamListener** aListener)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
if (!nsContentUtils::GetImgLoaderForChannel(aChannel)) {
return NS_ERROR_NULL_POINTER;
}
nsCOMPtr<nsIDocument> doc = GetOurOwnerDoc();
if (!doc) {
// Don't bother
return NS_OK;
}
// XXX what should we do with content policies here, if anything?
// Shouldn't that be done before the start of the load?
// XXX what about shouldProcess?
// Our state might change. Watch it.
AutoStateChanger changer(this, true);
// Do the load.
nsCOMPtr<imgIRequest>& req = PrepareNextRequest();
nsresult rv = nsContentUtils::GetImgLoaderForChannel(aChannel)->
LoadImageWithChannel(aChannel, this, doc, aListener,
getter_AddRefs(req));
if (NS_SUCCEEDED(rv)) {
TrackImage(req);
ResetAnimationIfNeeded();
} else {
// If we don't have a current URI, we might as well store this URI so people
// know what we tried (and failed) to load.
if (!mCurrentRequest)
aChannel->GetURI(getter_AddRefs(mCurrentURI));
FireEvent(NS_LITERAL_STRING("error"));
return rv;
}
return NS_OK;;
}
NS_IMETHODIMP nsImageLoadingContent::ForceReload()
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
nsCOMPtr<nsIURI> currentURI;
GetCurrentURI(getter_AddRefs(currentURI));
if (!currentURI) {
return NS_ERROR_NOT_AVAILABLE;
}
return LoadImage(currentURI, true, true, nullptr, nsIRequest::VALIDATE_ALWAYS);
}
NS_IMETHODIMP
nsImageLoadingContent::BlockOnload(imgIRequest* aRequest)
{
if (aRequest != mCurrentRequest) {
return NS_OK;
}
NS_ASSERTION(!(mCurrentRequestFlags & REQUEST_BLOCKS_ONLOAD),
"Double BlockOnload!?");
mCurrentRequestFlags |= REQUEST_BLOCKS_ONLOAD;
nsIDocument* doc = GetOurCurrentDoc();
if (doc) {
doc->BlockOnload();
}
return NS_OK;
}
NS_IMETHODIMP
nsImageLoadingContent::UnblockOnload(imgIRequest* aRequest)
{
if (aRequest != mCurrentRequest) {
return NS_OK;
}
NS_ASSERTION(mCurrentRequestFlags & REQUEST_BLOCKS_ONLOAD,
"Double UnblockOnload!?");
mCurrentRequestFlags &= ~REQUEST_BLOCKS_ONLOAD;
nsIDocument* doc = GetOurCurrentDoc();
if (doc) {
doc->UnblockOnload(false);
}
return NS_OK;
}
/*
* Non-interface methods
*/
nsresult
nsImageLoadingContent::LoadImage(const nsAString& aNewURI,
bool aForce,
bool aNotify)
{
// First, get a document (needed for security checks and the like)
nsIDocument* doc = GetOurOwnerDoc();
if (!doc) {
// No reason to bother, I think...
return NS_OK;
}
nsCOMPtr<nsIURI> imageURI;
nsresult rv = StringToURI(aNewURI, doc, getter_AddRefs(imageURI));
NS_ENSURE_SUCCESS(rv, rv);
// XXXbiesi fire onerror if that failed?
bool equal;
if (aNewURI.IsEmpty() &&
doc->GetDocumentURI() &&
NS_SUCCEEDED(doc->GetDocumentURI()->EqualsExceptRef(imageURI, &equal)) &&
equal) {
// Loading an embedded img from the same URI as the document URI will not work
// as a resource cannot recursively embed itself. Attempting to do so generally
// results in having to pre-emptively close down an in-flight HTTP transaction
// and then incurring the significant cost of establishing a new TCP channel.
// This is generally triggered from <img src="">
// In light of that, just skip loading it..
// Do make sure to drop our existing image, if any
CancelImageRequests(aNotify);
return NS_OK;
}
NS_TryToSetImmutable(imageURI);
return LoadImage(imageURI, aForce, aNotify, doc);
}
nsresult
nsImageLoadingContent::LoadImage(nsIURI* aNewURI,
bool aForce,
bool aNotify,
nsIDocument* aDocument,
nsLoadFlags aLoadFlags)
{
if (!mLoadingEnabled) {
// XXX Why fire an error here? seems like the callers to SetLoadingEnabled
// don't want/need it.
FireEvent(NS_LITERAL_STRING("error"));
return NS_OK;
}
NS_ASSERTION(!aDocument || aDocument == GetOurOwnerDoc(),
"Bogus document passed in");
// First, get a document (needed for security checks and the like)
if (!aDocument) {
aDocument = GetOurOwnerDoc();
if (!aDocument) {
// No reason to bother, I think...
return NS_OK;
}
}
// URI equality check.
//
// We skip the equality check if our current image was blocked, since in that
// case we really do want to try loading again.
if (!aForce && NS_CP_ACCEPTED(mImageBlockingStatus)) {
nsCOMPtr<nsIURI> currentURI;
GetCurrentURI(getter_AddRefs(currentURI));
bool equal;
if (currentURI &&
NS_SUCCEEDED(currentURI->Equals(aNewURI, &equal)) &&
equal) {
// Nothing to do here.
return NS_OK;
}
}
// From this point on, our image state could change. Watch it.
AutoStateChanger changer(this, aNotify);
// Sanity check.
//
// We use the principal of aDocument to avoid having to QI |this| an extra
// time. It should always be the same as the principal of this node.
#ifdef DEBUG
nsCOMPtr<nsIContent> thisContent = do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
NS_ABORT_IF_FALSE(thisContent &&
thisContent->NodePrincipal() == aDocument->NodePrincipal(),
"Principal mismatch?");
#endif
// Are we blocked?
int16_t cpDecision = nsIContentPolicy::REJECT_REQUEST;
nsContentUtils::CanLoadImage(aNewURI,
static_cast<nsIImageLoadingContent*>(this),
aDocument,
aDocument->NodePrincipal(),
&cpDecision);
if (!NS_CP_ACCEPTED(cpDecision)) {
FireEvent(NS_LITERAL_STRING("error"));
SetBlockedRequest(aNewURI, cpDecision);
return NS_OK;
}
nsLoadFlags loadFlags = aLoadFlags;
int32_t corsmode = GetCORSMode();
if (corsmode == CORS_ANONYMOUS) {
loadFlags |= imgILoader::LOAD_CORS_ANONYMOUS;
} else if (corsmode == CORS_USE_CREDENTIALS) {
loadFlags |= imgILoader::LOAD_CORS_USE_CREDENTIALS;
}
// Not blocked. Do the load.
nsCOMPtr<imgIRequest>& req = PrepareNextRequest();
nsresult rv;
rv = nsContentUtils::LoadImage(aNewURI, aDocument,
aDocument->NodePrincipal(),
aDocument->GetDocumentURI(),
this, loadFlags,
getter_AddRefs(req));
if (NS_SUCCEEDED(rv)) {
TrackImage(req);
ResetAnimationIfNeeded();
// Handle cases when we just ended up with a pending request but it's
// already done. In that situation we have to synchronously switch that
// request to being the current request, because websites depend on that
// behavior.
if (req == mPendingRequest) {
uint32_t pendingLoadStatus;
rv = req->GetImageStatus(&pendingLoadStatus);
if (NS_SUCCEEDED(rv) &&
(pendingLoadStatus & imgIRequest::STATUS_LOAD_COMPLETE)) {
MakePendingRequestCurrent();
MOZ_ASSERT(mCurrentRequest,
"How could we not have a current request here?");
nsImageFrame *f = do_QueryFrame(GetOurPrimaryFrame());
if (f) {
f->NotifyNewCurrentRequest(mCurrentRequest, NS_OK);
}
}
}
} else {
// If we don't have a current URI, we might as well store this URI so people
// know what we tried (and failed) to load.
if (!mCurrentRequest)
mCurrentURI = aNewURI;
FireEvent(NS_LITERAL_STRING("error"));
return NS_OK;
}
return NS_OK;
}
nsresult
nsImageLoadingContent::ForceImageState(bool aForce, nsEventStates::InternalType aState)
{
NS_ENSURE_TRUE(nsContentUtils::IsCallerChrome(), NS_ERROR_NOT_AVAILABLE);
mIsImageStateForced = aForce;
mForcedImageState = nsEventStates(aState);
return NS_OK;
}
nsEventStates
nsImageLoadingContent::ImageState() const
{
if (mIsImageStateForced) {
return mForcedImageState;
}
nsEventStates states;
if (mBroken) {
states |= NS_EVENT_STATE_BROKEN;
}
if (mUserDisabled) {
states |= NS_EVENT_STATE_USERDISABLED;
}
if (mSuppressed) {
states |= NS_EVENT_STATE_SUPPRESSED;
}
if (mLoading) {
states |= NS_EVENT_STATE_LOADING;
}
return states;
}
void
nsImageLoadingContent::UpdateImageState(bool aNotify)
{
if (mStateChangerDepth > 0) {
// Ignore this call; we'll update our state when the outermost state
// changer is destroyed. Need this to work around the fact that some libpr0n
// stuff is actually sync and hence we can get OnStopDecode called while
// we're still under LoadImage, and OnStopDecode doesn't know anything about
// aNotify.
// XXX - This machinery should be removed after bug 521604.
return;
}
nsCOMPtr<nsIContent> thisContent = do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
if (!thisContent) {
return;
}
mLoading = mBroken = mUserDisabled = mSuppressed = false;
// If we were blocked by server-based content policy, we claim to be
// suppressed. If we were blocked by type-based content policy, we claim to
// be user-disabled. Otherwise, claim to be broken.
if (mImageBlockingStatus == nsIContentPolicy::REJECT_SERVER) {
mSuppressed = true;
} else if (mImageBlockingStatus == nsIContentPolicy::REJECT_TYPE) {
mUserDisabled = true;
} else if (!mCurrentRequest) {
// No current request means error, since we weren't disabled or suppressed
mBroken = true;
} else {
uint32_t currentLoadStatus;
nsresult rv = mCurrentRequest->GetImageStatus(¤tLoadStatus);
if (NS_FAILED(rv) || (currentLoadStatus & imgIRequest::STATUS_ERROR)) {
mBroken = true;
} else if (!(currentLoadStatus & imgIRequest::STATUS_SIZE_AVAILABLE)) {
mLoading = true;
}
}
NS_ASSERTION(thisContent->IsElement(), "Not an element?");
thisContent->AsElement()->UpdateState(aNotify);
}
void
nsImageLoadingContent::CancelImageRequests(bool aNotify)
{
AutoStateChanger changer(this, aNotify);
ClearPendingRequest(NS_BINDING_ABORTED, REQUEST_DISCARD);
ClearCurrentRequest(NS_BINDING_ABORTED, REQUEST_DISCARD);
}
nsresult
nsImageLoadingContent::UseAsPrimaryRequest(imgIRequest* aRequest,
bool aNotify)
{
// Our state will change. Watch it.
AutoStateChanger changer(this, aNotify);
// Get rid if our existing images
ClearPendingRequest(NS_BINDING_ABORTED, REQUEST_DISCARD);
ClearCurrentRequest(NS_BINDING_ABORTED, REQUEST_DISCARD);
// Clone the request we were given.
nsCOMPtr<imgIRequest>& req = PrepareNextRequest();;
nsresult rv = aRequest->Clone(this, getter_AddRefs(req));
if (NS_SUCCEEDED(rv))
TrackImage(req);
else
return rv;
return NS_OK;
}
nsIDocument*
nsImageLoadingContent::GetOurOwnerDoc()
{
nsCOMPtr<nsIContent> thisContent =
do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
NS_ENSURE_TRUE(thisContent, nullptr);
return thisContent->OwnerDoc();
}
nsIDocument*
nsImageLoadingContent::GetOurCurrentDoc()
{
nsCOMPtr<nsIContent> thisContent =
do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
NS_ENSURE_TRUE(thisContent, nullptr);
return thisContent->GetCurrentDoc();
}
nsIFrame*
nsImageLoadingContent::GetOurPrimaryFrame()
{
nsCOMPtr<nsIContent> thisContent =
do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
return thisContent->GetPrimaryFrame();
}
nsPresContext* nsImageLoadingContent::GetFramePresContext()
{
nsIFrame* frame = GetOurPrimaryFrame();
if (!frame) {
return nullptr;
}
return frame->PresContext();
}
nsresult
nsImageLoadingContent::StringToURI(const nsAString& aSpec,
nsIDocument* aDocument,
nsIURI** aURI)
{
NS_PRECONDITION(aDocument, "Must have a document");
NS_PRECONDITION(aURI, "Null out param");
// (1) Get the base URI
nsCOMPtr<nsIContent> thisContent = do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
NS_ASSERTION(thisContent, "An image loading content must be an nsIContent");
nsCOMPtr<nsIURI> baseURL = thisContent->GetBaseURI();
// (2) Get the charset
const nsAFlatCString &charset = aDocument->GetDocumentCharacterSet();
// (3) Construct the silly thing
return NS_NewURI(aURI,
aSpec,
charset.IsEmpty() ? nullptr : charset.get(),
baseURL,
nsContentUtils::GetIOService());
}
nsresult
nsImageLoadingContent::FireEvent(const nsAString& aEventType)
{
// We have to fire the event asynchronously so that we won't go into infinite
// loops in cases when onLoad handlers reset the src and the new src is in
// cache.
nsCOMPtr<nsINode> thisNode = do_QueryInterface(static_cast<nsIImageLoadingContent*>(this));
nsRefPtr<nsAsyncDOMEvent> event =
new nsLoadBlockingAsyncDOMEvent(thisNode, aEventType, false, false);
event->PostDOMEvent();
return NS_OK;
}
nsCOMPtr<imgIRequest>&
nsImageLoadingContent::PrepareNextRequest()
{
// If we don't have a usable current request, get rid of any half-baked
// request that might be sitting there and make this one current.
if (!HaveSize(mCurrentRequest))
return PrepareCurrentRequest();
// Otherwise, make it pending.
return PreparePendingRequest();
}
void
nsImageLoadingContent::SetBlockedRequest(nsIURI* aURI, int16_t aContentDecision)
{
// Sanity
NS_ABORT_IF_FALSE(!NS_CP_ACCEPTED(aContentDecision), "Blocked but not?");
// We do some slightly illogical stuff here to maintain consistency with
// old behavior that people probably depend on. Even in the case where the
// new image is blocked, the old one should really be canceled with the
// reason "image source changed". However, apparently there's some abuse
// over in nsImageFrame where the displaying of the "broken" icon for the
// next image depends on the cancel reason of the previous image. ugh.
ClearPendingRequest(NS_ERROR_IMAGE_BLOCKED, REQUEST_DISCARD);
// For the blocked case, we only want to cancel the existing current request
// if size is not available. bz says the web depends on this behavior.
if (!HaveSize(mCurrentRequest)) {
mImageBlockingStatus = aContentDecision;
ClearCurrentRequest(NS_ERROR_IMAGE_BLOCKED, REQUEST_DISCARD);
// We still want to remember what URI we were despite not having an actual
// request.
mCurrentURI = aURI;
}
}
nsCOMPtr<imgIRequest>&
nsImageLoadingContent::PrepareCurrentRequest()
{
// Blocked images go through SetBlockedRequest, which is a separate path. For
// everything else, we're unblocked.
mImageBlockingStatus = nsIContentPolicy::ACCEPT;
// Get rid of anything that was there previously.
ClearCurrentRequest(NS_ERROR_IMAGE_SRC_CHANGED, REQUEST_DISCARD);
if (mNewRequestsWillNeedAnimationReset) {
mCurrentRequestFlags |= REQUEST_NEEDS_ANIMATION_RESET;
}
// Return a reference.
return mCurrentRequest;
}
nsCOMPtr<imgIRequest>&
nsImageLoadingContent::PreparePendingRequest()
{
// Get rid of anything that was there previously.
ClearPendingRequest(NS_ERROR_IMAGE_SRC_CHANGED, REQUEST_DISCARD);
if (mNewRequestsWillNeedAnimationReset) {
mPendingRequestFlags |= REQUEST_NEEDS_ANIMATION_RESET;
}
// Return a reference.
return mPendingRequest;
}
namespace {
class ImageRequestAutoLock
{
public:
ImageRequestAutoLock(imgIRequest* aRequest)
: mRequest(aRequest)
{
if (mRequest) {
mRequest->LockImage();
}
}
~ImageRequestAutoLock()
{
if (mRequest) {
mRequest->UnlockImage();
}
}
private:
nsCOMPtr<imgIRequest> mRequest;
};
} // anonymous namespace
void
nsImageLoadingContent::MakePendingRequestCurrent()
{
MOZ_ASSERT(mPendingRequest);
// Lock mCurrentRequest for the duration of this method. We do this because
// PrepareCurrentRequest() might unlock mCurrentRequest. If mCurrentRequest
// and mPendingRequest are both requests for the same image, unlocking
// mCurrentRequest before we lock mPendingRequest can cause the lock count
// to go to 0 and the image to be discarded!
ImageRequestAutoLock autoLock(mCurrentRequest);
PrepareCurrentRequest() = mPendingRequest;
mPendingRequest = nullptr;
mCurrentRequestFlags = mPendingRequestFlags;
mPendingRequestFlags = 0;
ResetAnimationIfNeeded();
}
void
nsImageLoadingContent::ClearCurrentRequest(nsresult aReason,
uint32_t aFlags)
{
if (!mCurrentRequest) {
// Even if we didn't have a current request, we might have been keeping
// a URI as a placeholder for a failed load. Clear that now.
mCurrentURI = nullptr;
return;
}
NS_ABORT_IF_FALSE(!mCurrentURI,
"Shouldn't have both mCurrentRequest and mCurrentURI!");
// Deregister this image from the refresh driver so it no longer receives
// notifications.
nsLayoutUtils::DeregisterImageRequest(GetFramePresContext(), mCurrentRequest,
&mCurrentRequestRegistered);
// Clean up the request.
UntrackImage(mCurrentRequest, aFlags);
mCurrentRequest->CancelAndForgetObserver(aReason);
mCurrentRequest = nullptr;
mCurrentRequestFlags = 0;
}
void
nsImageLoadingContent::ClearPendingRequest(nsresult aReason,
uint32_t aFlags)
{
if (!mPendingRequest)
return;
// Push a null JSContext on the stack so that code that runs within
// the below code doesn't think it's being called by JS. See bug
// 604262.
nsCxPusher pusher;
pusher.PushNull();
// Deregister this image from the refresh driver so it no longer receives
// notifications.
nsLayoutUtils::DeregisterImageRequest(GetFramePresContext(), mPendingRequest,
&mPendingRequestRegistered);
UntrackImage(mPendingRequest, aFlags);
mPendingRequest->CancelAndForgetObserver(aReason);
mPendingRequest = nullptr;
mPendingRequestFlags = 0;
}
bool*
nsImageLoadingContent::GetRegisteredFlagForRequest(imgIRequest* aRequest)
{
if (aRequest == mCurrentRequest) {
return &mCurrentRequestRegistered;
} else if (aRequest == mPendingRequest) {
return &mPendingRequestRegistered;
} else {
return nullptr;
}
}
void
nsImageLoadingContent::ResetAnimationIfNeeded()
{
if (mCurrentRequest &&
(mCurrentRequestFlags & REQUEST_NEEDS_ANIMATION_RESET)) {
nsCOMPtr<imgIContainer> container;
mCurrentRequest->GetImage(getter_AddRefs(container));
if (container)
container->ResetAnimation();
mCurrentRequestFlags &= ~REQUEST_NEEDS_ANIMATION_RESET;
}
}
bool
nsImageLoadingContent::HaveSize(imgIRequest *aImage)
{
// Handle the null case
if (!aImage)
return false;
// Query the image
uint32_t status;
nsresult rv = aImage->GetImageStatus(&status);
return (NS_SUCCEEDED(rv) && (status & imgIRequest::STATUS_SIZE_AVAILABLE));
}
void
nsImageLoadingContent::BindToTree(nsIDocument* aDocument, nsIContent* aParent,
nsIContent* aBindingParent,
bool aCompileEventHandlers)
{
// We may be entering the document, so if our image should be tracked,
// track it.
if (!aDocument)
return;
// Push a null JSContext on the stack so that callbacks triggered by the
// below code won't think they're being called from JS.
nsCxPusher pusher;
pusher.PushNull();
if (mCurrentRequestFlags & REQUEST_SHOULD_BE_TRACKED)
aDocument->AddImage(mCurrentRequest);
if (mPendingRequestFlags & REQUEST_SHOULD_BE_TRACKED)
aDocument->AddImage(mPendingRequest);
if (mCurrentRequestFlags & REQUEST_BLOCKS_ONLOAD)
aDocument->BlockOnload();
}
void
nsImageLoadingContent::UnbindFromTree(bool aDeep, bool aNullParent)
{
// We may be leaving the document, so if our image is tracked, untrack it.
nsCOMPtr<nsIDocument> doc = GetOurCurrentDoc();
if (!doc)
return;
// Push a null JSContext on the stack so that callbacks triggered by the
// below code won't think they're being called from JS.
nsCxPusher pusher;
pusher.PushNull();
if (mCurrentRequestFlags & REQUEST_SHOULD_BE_TRACKED)
doc->RemoveImage(mCurrentRequest);
if (mPendingRequestFlags & REQUEST_SHOULD_BE_TRACKED)
doc->RemoveImage(mPendingRequest);
if (mCurrentRequestFlags & REQUEST_BLOCKS_ONLOAD)
doc->UnblockOnload(false);
}
nsresult
nsImageLoadingContent::TrackImage(imgIRequest* aImage)
{
if (!aImage)
return NS_OK;
MOZ_ASSERT(aImage == mCurrentRequest || aImage == mPendingRequest,
"Why haven't we heard of this request?");
if (aImage == mCurrentRequest) {
mCurrentRequestFlags |= REQUEST_SHOULD_BE_TRACKED;
} else {
mPendingRequestFlags |= REQUEST_SHOULD_BE_TRACKED;
}
nsIDocument* doc = GetOurCurrentDoc();
if (doc)
return doc->AddImage(aImage);
return NS_OK;
}
nsresult
nsImageLoadingContent::UntrackImage(imgIRequest* aImage,
uint32_t aFlags /* = 0 */)
{
if (!aImage)
return NS_OK;
MOZ_ASSERT(aImage == mCurrentRequest || aImage == mPendingRequest,
"Why haven't we heard of this request?");
if (aImage == mCurrentRequest) {
mCurrentRequestFlags &= ~REQUEST_SHOULD_BE_TRACKED;
} else {
mPendingRequestFlags &= ~REQUEST_SHOULD_BE_TRACKED;
}
// We may not be in the document. If we outlived our document that's fine,
// because the document empties out the tracker and unlocks all locked images
// on destruction. But if we were never in the document we may need to force
// discarding the image here, since this is the only chance we have.
nsIDocument* doc = GetOurCurrentDoc();
if (doc) {
return doc->RemoveImage(aImage,
(aFlags & REQUEST_DISCARD) ? nsIDocument::REQUEST_DISCARD :
0);
} else if (aFlags & REQUEST_DISCARD) {
// If we're not in the document we may still need to be discarded.
aImage->RequestDiscard();
}
return NS_OK;
}
void
nsImageLoadingContent::CreateStaticImageClone(nsImageLoadingContent* aDest) const
{
aDest->mCurrentRequest = nsContentUtils::GetStaticRequest(mCurrentRequest);
aDest->TrackImage(aDest->mCurrentRequest);
aDest->mForcedImageState = mForcedImageState;
aDest->mImageBlockingStatus = mImageBlockingStatus;
aDest->mLoadingEnabled = mLoadingEnabled;
aDest->mStateChangerDepth = mStateChangerDepth;
aDest->mIsImageStateForced = mIsImageStateForced;
aDest->mLoading = mLoading;
aDest->mBroken = mBroken;
aDest->mUserDisabled = mUserDisabled;
aDest->mSuppressed = mSuppressed;
}
CORSMode
nsImageLoadingContent::GetCORSMode()
{
return CORS_NONE;
}
| [
"info@hadrons.me"
] | info@hadrons.me |
1788c6c6e848ed552d4c35784515732ced99e2f8 | 1cc5720e245ca0d8083b0f12806a5c8b13b5cf98 | /uva/src/cinco/p524/p524.cpp | 2128b68da8e3f2e88b7492229ae424edcac9ccf1 | [] | no_license | Emerson21/uva-problems | 399d82d93b563e3018921eaff12ca545415fd782 | 3079bdd1cd17087cf54b08c60e2d52dbd0118556 | refs/heads/master | 2021-01-18T09:12:23.069387 | 2010-12-15T00:38:34 | 2010-12-15T00:38:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,084 | cpp | #include <stdio.h>
#define ehPrimo(soma) (soma==3 || soma==5 || soma==7 || soma==11 || soma==13 || soma==17 || soma==19 || soma==23 || soma==29 || soma==31)
long maxV;
char lista[10000000];
long passado[17];
long posNalista;
long inicioUltimaCarreira;
void geraCopia() {
long zi;
lista[inicioUltimaCarreira-1] = '\n';
//cout << "inicioUltima: " << inicioUltimaCarreira << "-" << (posNalista-1) << endl;
for(zi=inicioUltimaCarreira;zi<posNalista-1;zi++) {
//cout << (zi+posNalista-inicioUltimaCarreira) << "=" << zi << endl;
lista[(zi-inicioUltimaCarreira)+posNalista] = lista[zi];
}
//posNalista+=posNalista+1-(novo<10)?2:3;
zi = posNalista;
posNalista+=posNalista - inicioUltimaCarreira;
inicioUltimaCarreira = zi;
//std::cout << "(" << lista << ")" << std::endl;
}
void tenta(int nivel, int novo) {
int zi;
passado[novo] = 1;
if(novo<10) {
lista[posNalista] = (novo + '1' - 1);
lista[posNalista+1] = ' ';
posNalista+=2;
} else {
lista[posNalista] = ((novo/10) + '1' - 1);
lista[posNalista+1] = ((novo%10) + '1' - 1);
lista[posNalista+2] = ' ';
posNalista+=3;
}
nivel++;
if(nivel==maxV) {
lista[posNalista-1] = 0;
geraCopia();
posNalista-=(novo<10)?2:3;
passado[novo] = 0;
return;
}
for(zi=1;zi!=maxV+1;zi++) {
if(passado[zi]==0 && ehPrimo(zi+novo)) {
if(nivel==maxV-1) {
if(ehPrimo(zi+1)) {
tenta(nivel,zi);
}
} else {
tenta(nivel,zi);
}
}
}
passado[novo] = 0;
posNalista-=(novo<10)?2:3;
}
int main(int argc, char **argv) {
int counter = 0;
int i;
//long zi;
while(scanf("%d",&maxV)==1) {
posNalista = 0;
counter++;
inicioUltimaCarreira = 0;
if(counter!=1) printf("\n");
for(i=0;i!=maxV+1;i++) {
passado[i]=0;
}
printf("Case %d: \n",counter);
tenta(0,1);
lista[posNalista-1] = 0;
//for(zi=0;zi!=posNalista-1;zi++) {
// if(lista[zi]==0) lista[zi]='-';
//}
printf("%s\n",lista);
//cout << posNalista << endl;
}
return 0;
}
| [
"guilherme.silveira@caelum.com.br"
] | guilherme.silveira@caelum.com.br |
1bb00cc61f6f9ee7f9393b33065bca11d8bd0254 | 170ed90aae1b2989a67c1138625bc0b5984c22e2 | /20-21-1/4. Gyak/Ke1. Feladat/main.cpp | bb4fe41ad8b79c4e9b4d2fd53bbeaff8db8bac63 | [] | no_license | gvikthor/Programozas | f7bbf9fdeaa7d0cf7d3f2d8ae2fa589515835115 | 381cbd84ba259fc87b1d1a500d69fd484f22b45b | refs/heads/master | 2023-07-22T09:10:08.789444 | 2021-05-19T20:49:12 | 2021-05-19T20:49:12 | 293,271,754 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 603 | cpp | #include <iostream>
using namespace std;
int main()
{
const int meret = 7;
int pontok[meret] = {65,38,82,83,27,91,100};
string nevek[meret] = {"Peti", "Aron", "Tomi", "Laura", "Dalma", "Nandor", "Gergo"};
int i = 1;
bool talalt = false;
while(i < meret && !talalt){
if(pontok[i-1] == pontok[i]){
talalt = true;
}else{
i++;
}
}
if(talalt){
cout << "Voltak ilyenek, pl.: " << nevek[i-1] << " es " << nevek[i] << " diak." << endl;
}else{
cout << "Nem volt ilyen ember." << endl;
}
return 0;
}
| [
"mohmas@inf.elte.hu"
] | mohmas@inf.elte.hu |
ab26e1795deaa5f79091a2b1f014bab0587b99af | 1be3509c550e8c02b8ac54568e90350830df1ffb | /Source/SimpleShooter/Gun.cpp | 550f5f8bb20c547edac5e5152296f37334cfd5d9 | [] | no_license | nu12/SimpleShooter | 4287fb8458849847a1538c70622c8ecaf6bc7108 | 23ffe02deaf4a5d1c4dc57c34cdeab94b3fedba9 | refs/heads/master | 2023-01-01T23:24:44.843742 | 2020-10-09T15:25:53 | 2020-10-09T15:25:53 | 295,551,258 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,655 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "Gun.h"
#include "Components/SkeletalMeshComponent.h"
#include "Particles/ParticleSystem.h"
#include "Kismet/GameplayStatics.h"
#include "DrawDebugHelpers.h"
// Sets default values
AGun::AGun()
{
PrimaryActorTick.bCanEverTick = true;
Root = CreateDefaultSubobject<USceneComponent>(TEXT("Root"));
SetRootComponent(Root);
MeshComponent = CreateDefaultSubobject<USkeletalMeshComponent>(TEXT("Mesh"));
MeshComponent->SetupAttachment(Root);
}
// Called when the game starts or when spawned
void AGun::BeginPlay()
{
Super::BeginPlay();
}
// Called every frame
void AGun::Tick(float DeltaTime)
{
Super::Tick(DeltaTime);
}
void AGun::PullTrigger()
{
if (!OwnerController) SetupController();
if (HasNullPointers()) return;
FShootData ShootData(GetWorld(), OwnerController, MaxRange);
PlayMuzzleEffects();
if (!ShootData.HasHit) return;
PlayHitEffects(ShootData);
if (!ShootData.HitResult.GetActor()) return;
DealDamage(ShootData);
}
void AGun::PlayMuzzleEffects() const
{
UGameplayStatics::SpawnEmitterAttached(MuzzleEffect, MeshComponent, FName(TEXT("MuzzleFlashSocket")));
UGameplayStatics::SpawnSoundAttached(MuzzleSound, MeshComponent, FName(TEXT("MuzzleFlashSocket")));
}
void AGun::PlayHitEffects(FShootData& ShootData) const
{
UGameplayStatics::SpawnEmitterAtLocation(GetWorld(), HitWorldEffect, ShootData.HitResult.ImpactPoint, ShootData.OppositeRotation);
UGameplayStatics::SpawnSoundAtLocation(GetWorld(), HitWorldSound, ShootData.HitResult.ImpactPoint);
}
void AGun::DealDamage(FShootData& ShootData)
{
FPointDamageEvent DamageEvent(Damage, ShootData.HitResult, ShootData.OppositeDirection, nullptr);
ShootData.HitResult.GetActor()->TakeDamage(Damage, DamageEvent, OwnerController, this);
}
void AGun::SetupController()
{
APawn* GunOwner = Cast<APawn>(GetOwner());
if (GunOwner)
{
OwnerController = GunOwner->GetController();
}
}
bool AGun::HasNullPointers() const
{
if (!MuzzleEffect)
{
UE_LOG(LogTemp, Error, TEXT("Muzzle effect not found!"));
return true;
}
if (!HitWorldEffect)
{
UE_LOG(LogTemp, Error, TEXT("HitWorld effect not found!"));
return true;
}
if (!MuzzleSound)
{
UE_LOG(LogTemp, Error, TEXT("MuzzleSound not found!"));
return true;
}
if (!HitWorldSound)
{
UE_LOG(LogTemp, Error, TEXT("HitWorldSound not found!"));
return true;
}
if (!OwnerController)
{
UE_LOG(LogTemp, Error, TEXT("OwnerController not found!"));
return true;
}
return false;
} | [
"alysson.avila.costa@gamil.com"
] | alysson.avila.costa@gamil.com |
e810d183d20f4756a9b5d9cc37685f451bcf922b | ab3f863fc5043e8970c3d4b5c861778586226657 | /csvIO.h | 9b98211022d96ca744157e55620f737e615e5baf | [] | no_license | JPatchett/Quantum-Simulations | 5185fb021a47930aee394960b979c5fd61e53b2a | 0de6916b9c2a85e2bcf3d87d361cc8de86f4fafb | refs/heads/master | 2020-04-07T09:33:16.625583 | 2018-11-19T16:54:22 | 2018-11-19T16:54:22 | 158,256,811 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 339 | h | #ifndef CSVIO_H
#define CSVIO_H
#include <string>
#include <vector>
class CSVWriter{
private:
std::string filename;
std::string delimeter;
int linesCount;
public:
CSVWriter(std::string filename, std::string delm = ",");
void addDataInRow(std::vector<double> & first);
};
#endif | [
"james.patchett1996@gmail.com"
] | james.patchett1996@gmail.com |
1ce68736dd87ef8afb1ed7f1a7792368c9ab27a0 | 59968c6f0a65d6930665276a13008450d22f73fb | /gdal/frmts/pcidsk/sdk/blockdir/blocklayer.cpp | cae5d9db0318ca02cf9f663799ff725c74e439a0 | [
"MIT",
"Apache-2.0",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"LicenseRef-scancode-warranty-disclaimer",
"SunPro",
"LicenseRef-scancode-info-zip-2005-02",
"BSD-3-Clause"
] | permissive | tangyibo/gdal | 8e6c4bff3b547175604d54bebc6d731c3e897ec7 | 447e7505baf95cf3bdba07b3b36f5b96849ab59d | refs/heads/master | 2023-03-13T16:37:12.444233 | 2021-03-08T22:42:20 | 2021-03-08T22:42:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,924 | cpp | /******************************************************************************
*
* Purpose: Block directory API.
*
******************************************************************************
* Copyright (c) 2011
* PCI Geomatics, 90 Allstate Parkway, Markham, Ontario, Canada.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
****************************************************************************/
#include "blockdir/blocklayer.h"
#include "blockdir/blockfile.h"
#include "pcidsk_exception.h"
using namespace PCIDSK;
/************************************************************************/
/* BlockLayer() */
/************************************************************************/
/**
* Constructor.
*
* @param poBlockDir The associated block directory.
* @param nLayer The index of the block layer.
*/
BlockLayer::BlockLayer(BlockDir * poBlockDir, uint32 nLayer)
: mpoBlockDir(poBlockDir),
mnLayer(nLayer)
{
}
/************************************************************************/
/* ~BlockLayer() */
/************************************************************************/
/**
* Destructor.
*/
BlockLayer::~BlockLayer(void)
{
}
/************************************************************************/
/* GetBlockInfo() */
/************************************************************************/
/**
* Gets the layer block at the specified index.
*
* @param iBlock The index of the layer block.
*
* @return The layer block at the specified index.
*/
BlockInfo * BlockLayer::GetBlockInfo(uint32 iBlock)
{
if (!IsValid())
return nullptr;
uint32 nBlockCount = GetBlockCount();
if (nBlockCount != moBlockList.size())
{
mpoBlockDir->ReadLayerBlocks(mnLayer);
if (moBlockList.size() != nBlockCount)
ThrowPCIDSKExceptionPtr("Corrupted block directory.");
}
if (iBlock >= moBlockList.size())
return nullptr;
return &moBlockList[iBlock];
}
/************************************************************************/
/* AllocateBlocks() */
/************************************************************************/
/**
* Allocates the blocks of the specified data.
*
* @param nOffset The offset of the data.
* @param nSize The size of the data.
*/
void BlockLayer::AllocateBlocks(uint64 nOffset, uint64 nSize)
{
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
uint32 iStartBlock = (uint32) (nOffset / nBlockSize);
uint32 nStartOffset = (uint32) (nOffset % nBlockSize);
uint32 nNumBlocks = (uint32)
((nSize + nStartOffset + nBlockSize - 1) / nBlockSize);
for (uint32 iBlock = 0; iBlock < nNumBlocks; iBlock++)
{
BlockInfo * psBlock = GetBlockInfo(iStartBlock + iBlock);
if (!psBlock)
break;
if (psBlock->nSegment == INVALID_SEGMENT ||
psBlock->nStartBlock == INVALID_BLOCK)
{
*psBlock = mpoBlockDir->GetFreeBlock();
}
}
}
/************************************************************************/
/* AreBlocksAllocated() */
/************************************************************************/
/**
* Checks if the blocks of the specified data are allocated.
*
* @param nOffset The offset of the data.
* @param nSize The size of the data.
*
* @return If the blocks of the specified data are allocated.
*/
bool BlockLayer::AreBlocksAllocated(uint64 nOffset, uint64 nSize)
{
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
uint32 iStartBlock = (uint32) (nOffset / nBlockSize);
uint32 nStartOffset = (uint32) (nOffset % nBlockSize);
uint32 nNumBlocks = (uint32)
((nSize + nStartOffset + nBlockSize - 1) / nBlockSize);
for (uint32 iBlock = 0; iBlock < nNumBlocks; iBlock++)
{
BlockInfo * psBlock = GetBlockInfo(iStartBlock + iBlock);
if (!psBlock)
return false;
if (psBlock->nSegment == INVALID_SEGMENT ||
psBlock->nStartBlock == INVALID_BLOCK)
{
return false;
}
}
return true;
}
/************************************************************************/
/* GetContiguousCount() */
/************************************************************************/
/**
* Gets the number of contiguous blocks for the specified data.
*
* @param nOffset The offset of the data.
* @param nSize The size of the data.
*
* @return The number of contiguous blocks for the specified data.
*/
uint32 BlockLayer::GetContiguousCount(uint64 nOffset, uint64 nSize)
{
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
uint32 iStartBlock = (uint32) (nOffset / nBlockSize);
uint32 nStartOffset = (uint32) (nOffset % nBlockSize);
uint32 nNumBlocks = (uint32)
((nSize + nStartOffset + nBlockSize - 1) / nBlockSize);
BlockInfo * psStartBlock = GetBlockInfo(iStartBlock);
if (!psStartBlock)
return 0;
uint32 nContiguousCount = 1;
for (uint32 iBlock = 1; iBlock < nNumBlocks; iBlock++)
{
BlockInfo * psNextBlock = GetBlockInfo(iStartBlock + iBlock);
if (!psNextBlock)
break;
if (psNextBlock->nSegment != psStartBlock->nSegment)
break;
if (psNextBlock->nStartBlock != psStartBlock->nStartBlock + iBlock)
break;
nContiguousCount++;
}
return nContiguousCount;
}
/************************************************************************/
/* FreeBlocks() */
/************************************************************************/
/**
* Frees the blocks of the specified data.
*
* @param nOffset The offset of the data.
* @param nSize The size of the data.
*/
void BlockLayer::FreeBlocks(uint64 nOffset, uint64 nSize)
{
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
uint32 iStartBlock = (uint32) ((nOffset + nBlockSize - 1) / nBlockSize);
uint32 iEndBlock = (uint32) ((nOffset + nSize) / nBlockSize);
uint32 nNumBlocks = iStartBlock < iEndBlock ? iEndBlock - iStartBlock : 0;
BlockInfoList oFreeBlocks;
oFreeBlocks.reserve(nNumBlocks);
for (uint32 iBlock = 0; iBlock < nNumBlocks; iBlock++)
{
BlockInfo * psBlock = GetBlockInfo(iStartBlock + iBlock);
if (!psBlock)
break;
if (psBlock->nSegment != INVALID_SEGMENT &&
psBlock->nStartBlock != INVALID_BLOCK)
{
oFreeBlocks.push_back(*psBlock);
psBlock->nSegment = INVALID_SEGMENT;
psBlock->nStartBlock = INVALID_BLOCK;
}
}
mpoBlockDir->AddFreeBlocks(oFreeBlocks);
}
/************************************************************************/
/* WriteToLayer() */
/************************************************************************/
/**
* Writes the specified data to the layer.
*
* @param pData The data buffer to write.
* @param nOffset The offset of the data.
* @param nSize The size of the data.
*/
void BlockLayer::WriteToLayer(const void * pData, uint64 nOffset, uint64 nSize)
{
if (nOffset + nSize > GetLayerSize())
Resize(nOffset + nSize);
AllocateBlocks(nOffset, nSize);
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
uint8 * pabyData = (uint8 *) pData;
for (uint64 iByte = 0; iByte < nSize; )
{
uint32 nContiguousCount =
GetContiguousCount(nOffset + iByte, nSize - iByte);
uint32 iBlock = (uint32) ((nOffset + iByte) / nBlockSize);
uint32 iWork = (uint32) ((nOffset + iByte) % nBlockSize);
uint64 nWorkSize = nContiguousCount * nBlockSize - iWork;
if (nWorkSize > nSize - iByte)
nWorkSize = nSize - iByte;
BlockInfo * psBlock = GetBlockInfo(iBlock);
uint64 nWorkOffset = (uint64) psBlock->nStartBlock * nBlockSize + iWork;
GetFile()->WriteToSegment(psBlock->nSegment, pabyData + iByte,
nWorkOffset, nWorkSize);
iByte += nWorkSize;
}
}
/************************************************************************/
/* ReadFromLayer() */
/************************************************************************/
/**
* Reads the specified data from the layer.
*
* @param pData The data buffer to read.
* @param nOffset The offset of the data.
* @param nSize The size of the data.
*/
bool BlockLayer::ReadFromLayer(void * pData, uint64 nOffset, uint64 nSize)
{
uint64 nLayerSize = GetLayerSize();
if (nSize > nLayerSize ||
nOffset > nLayerSize ||
nOffset + nSize > nLayerSize)
{
return false;
}
if (!AreBlocksAllocated(nOffset, nSize))
return false;
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
uint8 * pabyData = (uint8 *) pData;
for (uint64 iByte = 0; iByte < nSize; )
{
uint32 nContiguousCount =
GetContiguousCount(nOffset + iByte, nSize - iByte);
uint32 iBlock = (uint32) ((nOffset + iByte) / nBlockSize);
uint32 iWork = (uint32) ((nOffset + iByte) % nBlockSize);
uint64 nWorkSize = nContiguousCount * nBlockSize - iWork;
if (nWorkSize > nSize - iByte)
nWorkSize = nSize - iByte;
BlockInfo * psBlock = GetBlockInfo(iBlock);
uint64 nWorkOffset = (uint64) psBlock->nStartBlock * nBlockSize + iWork;
GetFile()->ReadFromSegment(psBlock->nSegment, pabyData + iByte,
nWorkOffset, nWorkSize);
iByte += nWorkSize;
}
return true;
}
/************************************************************************/
/* GetFile() */
/************************************************************************/
/**
* Gets the associated file of the block layer.
*
* @return The associated file of the block layer.
*/
BlockFile * BlockLayer::GetFile(void) const
{
return mpoBlockDir->GetFile();
}
/************************************************************************/
/* NeedsSwap() */
/************************************************************************/
/**
* Checks if the block directory on disk needs swapping.
*
* @return If the block directory on disk needs swapping.
*/
bool BlockLayer::NeedsSwap(void) const
{
return mpoBlockDir->NeedsSwap();
}
/************************************************************************/
/* IsValid() */
/************************************************************************/
/**
* Checks if the block layer is valid.
*
* @return If the block layer is valid.
*/
bool BlockLayer::IsValid(void) const
{
return GetLayerType() != BLTDead;
}
/************************************************************************/
/* Resize() */
/************************************************************************/
/**
* Resizes the block layer to the specified size in bytes.
*
* @param nLayerSize The new block layer size in bytes.
*/
void BlockLayer::Resize(uint64 nLayerSize)
{
if (!IsValid())
return;
if (nLayerSize == GetLayerSize())
return;
uint32 nBlockCount = GetBlockCount();
uint32 nBlockSize = mpoBlockDir->GetBlockSize();
// Check how many blocks are needed.
uint32 nNeededBlocks =
(uint32) ((nLayerSize + nBlockSize - 1) / nBlockSize);
// Create new blocks.
if (nNeededBlocks > nBlockCount)
{
uint32 nNewBlocks = nNeededBlocks - nBlockCount;
PushBlocks(mpoBlockDir->CreateNewBlocks(nNewBlocks));
}
// Free blocks.
else if (nNeededBlocks < nBlockCount)
{
uint32 nFreeBlocks = nBlockCount - nNeededBlocks;
mpoBlockDir->AddFreeBlocks(PopBlocks(nFreeBlocks));
}
_SetLayerSize(nLayerSize);
}
/************************************************************************/
/* PushBlocks() */
/************************************************************************/
/**
* Pushes the specified block list at the end of the layer's block list.
*
* @param oBlockList The block list to add.
*/
void BlockLayer::PushBlocks(const BlockInfoList & oBlockList)
{
uint32 nBlockCount = GetBlockCount();
if (nBlockCount != moBlockList.size())
{
mpoBlockDir->ReadLayerBlocks(mnLayer);
if (moBlockList.size() != nBlockCount)
ThrowPCIDSKException("Corrupted block directory.");
}
try
{
moBlockList.resize(nBlockCount + oBlockList.size());
}
catch (const std::exception & ex)
{
return ThrowPCIDSKException("Out of memory in BlockLayer::PushBlocks(): %s", ex.what());
}
for (size_t iBlock = 0; iBlock < oBlockList.size(); iBlock++)
moBlockList[nBlockCount + iBlock] = oBlockList[iBlock];
_SetBlockCount((uint32) moBlockList.size());
}
/************************************************************************/
/* PopBlocks() */
/************************************************************************/
/**
* Pops the specified number of blocks from the end of the layer's block list.
*
* @param nBlockCount The number of blocks to remove.
*
* @return The removed block list.
*/
BlockInfoList BlockLayer::PopBlocks(uint32 nBlockCount)
{
uint32 nCurrentBlockCount = GetBlockCount();
if (nCurrentBlockCount != moBlockList.size())
{
mpoBlockDir->ReadLayerBlocks(mnLayer);
if (moBlockList.size() != nCurrentBlockCount)
ThrowPCIDSKException("Corrupted block directory.");
}
uint32 nRemainingBlockCount;
BlockInfoList oRemovedBlocks;
if (nBlockCount < nCurrentBlockCount)
{
nRemainingBlockCount = nCurrentBlockCount - nBlockCount;
oRemovedBlocks =
BlockInfoList(moBlockList.begin() + nRemainingBlockCount,
moBlockList.begin() + nCurrentBlockCount);
}
else
{
nRemainingBlockCount = 0;
oRemovedBlocks = moBlockList;
}
try
{
moBlockList.resize(nRemainingBlockCount);
}
catch (const std::exception & ex)
{
ThrowPCIDSKException("Out of memory in BlockLayer::PopBlocks(): %s", ex.what());
}
_SetBlockCount(nRemainingBlockCount);
return oRemovedBlocks;
}
| [
"noreply@github.com"
] | tangyibo.noreply@github.com |
c1e90ee4207f0011898925a51ec91121995a2764 | 0c5461dec012986b620f46596b543cd0769f2b32 | /codeforces/489c_givenlengthandsumofdigits....cpp | 0f0494d70651f9c7f1a721950664c61a7b59fcbe | [
"MIT"
] | permissive | aoibird/pc | ec6e0d634cf7bd03f102416c7847decf80a5e493 | 01b7c006df899365eaa73ff179a220f6a7d799c6 | refs/heads/master | 2022-11-28T04:48:15.458782 | 2022-11-21T01:30:39 | 2022-11-21T01:30:39 | 205,393,242 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 871 | cpp | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int a[100+10];
int b[100+10];
int main()
{
int m, s;
scanf("%d%d", &m, &s);
if (m == 1 && s == 0) {
printf("0 0\n");
return 0;
}
if (s < 1 || s > m*9) {
printf("-1 -1\n");
return 0;
}
int s1 = s;
for (int i = 0; i < m; i++) {
if (i == 0) {
if ((m-1)*9 >= s1) a[i] = 1;
else a[i] = s1 - (m-1)*9;
}
else {
if ((m-1-i)*9 >= s1) a[i] = 0;
else a[i] = s1 - (m-i-1) * 9;
}
s1 -= a[i];
}
int s2 = s;
for (int i = 0; i < m; i++) {
b[i] = (s2 > 9) ? 9 : s2;
s2 -= b[i];
}
for (int i = 0; i < m; i++)
printf("%d", a[i]);
printf(" ");
for (int i = 0; i < m; i++)
printf("%d", b[i]);
printf("\n");
return 0;
}
| [
"aoi@aoibird.com"
] | aoi@aoibird.com |
a20f4bfced3d47e62fca238e4803ebc24fe9a042 | 453ca9ebe562134126d3de5cb9950763d65d1a29 | /digital clock.ino | 5b94200746755a7cc7516eb9fbfb7c2e79077882 | [] | no_license | soubhikmandal2000/My-Old-Arduino-Projects | 6c547d7effefac7545f37f67f254580993c5e6c0 | 0e93416613191e7127bef380ddd1e0bdd429a530 | refs/heads/main | 2023-09-05T08:40:13.778917 | 2021-11-01T01:06:43 | 2021-11-01T01:06:43 | 401,735,941 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,484 | ino | #include <RTClib.h>
#include <LiquidCrystal.h>
#include <EnableInterrupt.h>
#define BUTTON_UP_PIN A0
#define BUTTON_DOWN_PIN A1
#define BUTTON_LEFT_PIN A2
#define BUTTON_RIGHT_PIN A3
#define BUTTON_NONE 0xFF
#define ALARM_BUZZER_PIN 7
#define MAX_DAY_STR_SIZE 9
const uint8_t buttons[] =
{
BUTTON_UP_PIN,
BUTTON_DOWN_PIN,
BUTTON_LEFT_PIN,
BUTTON_RIGHT_PIN
};
const char daysOfTheWeek[7][10] =
{
"Sunday",
"Monday",
"Tuesday",
"Wednesday",
"Thursday",
"Friday",
"Saturday"
};
char timestr[20];
char datestr[20];
uint8_t strLength;
char strBuffer[32];
uint8_t serialLength;
char serialBuffer[32];
uint8_t rtc_status;
volatile uint8_t pressCount;
volatile uint8_t pressedButton = BUTTON_NONE;
LiquidCrystal lcd(8, 9, 10, 11, 12, 13);
RTC_DS1307 rtc;
DateTime now;
void setup()
{
Serial.begin(9600);
Serial.println("DS1307 Digital Clock");
lcd.begin(20, 4);
CreateCustomChars();
lcd.setCursor(4, 0);
lcd.print("DS1307 RTC");
lcd.setCursor(3, 1);
lcd.print("Digital Clock");
// set button pin mode as input pullup
for(uint8_t i; i < sizeof(buttons); i++)
{
pinMode(buttons[i], INPUT_PULLUP);
enableInterrupt(buttons[i], scan_buttons, CHANGE);
}
// set buzzer pin as ouput
pinMode(ALARM_BUZZER_PIN, OUTPUT);
rtc_status = rtc.begin();
if(!rtc_status) Serial.println("Couldn't begin RTC!");
if (rtc_status && !rtc.isrunning())
{
Serial.println("RTC is Not running, setting the time!");
rtc.adjust(DateTime(F(__DATE__), F(__TIME__)));
}
delay(2500);
lcd.clear();
}
void loop()
{
HandleButtonOperations();
ProcessSerialCommand();
UpdateDisplay();
delay(1000);
}
void scan_buttons()
{
for(uint8_t i; i < sizeof(buttons); i++)
{
if(digitalRead(buttons[i]) == LOW)
{
pressedButton = buttons[i];
break;
}
}
}
void HandleButtonOperations()
{
if(pressedButton != BUTTON_NONE)
{
pressCount++;
Serial.print("Button Pressed: ");
Serial.println(pressedButton);
lcd.setCursor(7, 2);
lcd.print("B:");
lcd.print(pressedButton);
lcd.setCursor(12, 2);
lcd.print(pressCount);
}
switch(pressedButton)
{
case BUTTON_UP_PIN:
break;
case BUTTON_DOWN_PIN:
break;
case BUTTON_LEFT_PIN:
break;
case BUTTON_RIGHT_PIN:
break;
}
pressedButton = BUTTON_NONE;
}
void UpdateDisplay()
{
now = rtc.now();
sprintf(datestr, "%.2u/%.2u/%.4u", now.day(), now.month(), now.year());
sprintf(timestr, "%.2u:%.2u:%.2u %s", now.twelveHour(), now.minute(), now.second(), now.isPM() ? "PM" : "AM");
//update time display
printBigString(2, ×tr[0], 2); //hour
lcd.setCursor(8, 0);
lcd.write('.');
lcd.setCursor(8, 1);
lcd.write('.');
printBigString(9, ×tr[3], 2); //minute
lcd.setCursor(16, 0);
lcd.write(×tr[9], 2); //AM/PM
lcd.setCursor(16, 1);
lcd.write(×tr[6], 2); //second
//update date display
strLength = sprintf(strBuffer,"%s", daysOfTheWeek[now.dayOfTheWeek()]);
str_padding_at_end(strBuffer, MAX_DAY_STR_SIZE - strLength);
lcd.setCursor(0, 3);
lcd.print(strBuffer);
lcd.setCursor(10, 3);
lcd.print(datestr);
}
void str_padding_at_end(char *str, uint8_t paddinglen)
{
while(paddinglen--)
strcat(str, " ");
}
void ProcessSerialCommand()
{
int rxlen = Serial.available();
if(rxlen < 4) return;
serialLength = 0;
while(serialLength < rxlen)
{
serialBuffer[serialLength++] = Serial.read();
}
if(strstr(serialBuffer, "\r")) return;
//"SET 22:29:12 Jan 14 2021\r"
if(strstr(serialBuffer, "SET"))
{
if(serialLength < 25) return;
rtc.adjust(DateTime(&serialBuffer[13], &serialBuffer[4]));
Serial.println("OK");
}
else if(strstr(serialBuffer, "GET"))
{
now = rtc.now();
sprintf(timestr, "%.2u:%.2u:%.2u", now.hour(), now.minute(), now.second());
sprintf(datestr, "%.2u %.2u %.4u", now.month(), now.day(), now.year());
Serial.print(timestr);
Serial.print(" ");
Serial.println(datestr);
}
}
// the 8 arrays that form each segment of the custom numbers
uint8_t bar1[8] =
{
B11100,
B11110,
B11110,
B11110,
B11110,
B11110,
B11110,
B11100
};
uint8_t bar2[8] =
{
B00111,
B01111,
B01111,
B01111,
B01111,
B01111,
B01111,
B00111
};
uint8_t bar3[8] =
{
B11111,
B11111,
B00000,
B00000,
B00000,
B00000,
B11111,
B11111
};
uint8_t bar4[8] =
{
B11110,
B11100,
B00000,
B00000,
B00000,
B00000,
B11000,
B11100
};
uint8_t bar5[8] =
{
B01111,
B00111,
B00000,
B00000,
B00000,
B00000,
B00011,
B00111
};
uint8_t bar6[8] =
{
B00000,
B00000,
B00000,
B00000,
B00000,
B00000,
B11111,
B11111
};
uint8_t bar7[8] =
{
B00000,
B00000,
B00000,
B00000,
B00000,
B00000,
B00111,
B01111
};
uint8_t bar8[8] =
{
B11111,
B11111,
B00000,
B00000,
B00000,
B00000,
B00000,
B00000
};
void CreateCustomChars()
{
// assignes each segment a write number
lcd.createChar(1, bar1);
lcd.createChar(2, bar2);
lcd.createChar(3, bar3);
lcd.createChar(4, bar4);
lcd.createChar(5, bar5);
lcd.createChar(6, bar6);
lcd.createChar(7, bar7);
lcd.createChar(8, bar8);
}
// uses segments to build the number 0
void custom0(int col)
{
lcd.setCursor(col, 0);
lcd.write(2);
lcd.write(8);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(2);
lcd.write(6);
lcd.write(1);
}
void custom1(int col)
{
lcd.setCursor(col,0);
lcd.write(32);
lcd.write(32);
lcd.write(1);
lcd.setCursor(col,1);
lcd.write(32);
lcd.write(32);
lcd.write(1);
}
void custom2(int col)
{
lcd.setCursor(col,0);
lcd.write(5);
lcd.write(3);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(2);
lcd.write(6);
lcd.write(6);
}
void custom3(int col)
{
lcd.setCursor(col,0);
lcd.write(5);
lcd.write(3);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(7);
lcd.write(6);
lcd.write(1);
}
void custom4(int col)
{
lcd.setCursor(col,0);
lcd.write(2);
lcd.write(6);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(32);
lcd.write(32);
lcd.write(1);
}
void custom5(int col)
{
lcd.setCursor(col,0);
lcd.write(2);
lcd.write(3);
lcd.write(4);
lcd.setCursor(col, 1);
lcd.write(7);
lcd.write(6);
lcd.write(1);
}
void custom6(int col)
{
lcd.setCursor(col,0);
lcd.write(2);
lcd.write(3);
lcd.write(4);
lcd.setCursor(col, 1);
lcd.write(2);
lcd.write(6);
lcd.write(1);
}
void custom7(int col)
{
lcd.setCursor(col,0);
lcd.write(2);
lcd.write(8);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(32);
lcd.write(32);
lcd.write(1);
}
void custom8(int col)
{
lcd.setCursor(col, 0);
lcd.write(2);
lcd.write(3);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(2);
lcd.write(6);
lcd.write(1);
}
void custom9(int col)
{
lcd.setCursor(col, 0);
lcd.write(2);
lcd.write(3);
lcd.write(1);
lcd.setCursor(col, 1);
lcd.write(7);
lcd.write(6);
lcd.write(1);
}
void printBigNumber(int col, int value)
{
if (value == 0) {
custom0(col);
} if (value == 1) {
custom1(col);
} if (value == 2) {
custom2(col);
} if (value == 3) {
custom3(col);
} if (value == 4) {
custom4(col);
} if (value == 5) {
custom5(col);
} if (value == 6) {
custom6(col);
} if (value == 7) {
custom7(col);
} if (value == 8) {
custom8(col);
} if (value == 9) {
custom9(col);
}
}
void printBigString(int col, char* str, int size)
{
for(int i = 0; i < size; i++)
{
printBigNumber(col, str[i] - '0');
col += 3;
}
} | [
"noreply@github.com"
] | soubhikmandal2000.noreply@github.com |
726454d338569ccdc66d3f410fc3cc1e0d0697ca | 7e9f6309246619247ce61159437881a1fa3d5dea | /multi_agent_planner/src/MotionPrimitives/MotionPrimitivesMgr.cpp | 21e9d83072fbc5c26a88755af430af3b0c191d0c | [] | no_license | sid24ss/multi_agent_planner | a7e652682a610f0d5ff838823c8e97db40519f49 | ab9c617f5231a8397e6c7d8c19611ae1b14ac949 | refs/heads/master | 2020-06-02T00:31:55.582600 | 2014-10-03T15:25:19 | 2014-10-03T15:25:19 | 23,503,842 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,436 | cpp | #include <multi_agent_planner/MotionPrimitives/MotionPrimitivesMgr.h>
#include <multi_agent_planner/Constants.h>
using namespace multi_agent_planner;
MotionPrimitivesMgr::MotionPrimitivesMgr(std::shared_ptr<GoalState>& goal)
: m_goal(goal) { }
void MotionPrimitivesMgr::setMprimParams(const MotionPrimitiveParams& params) {
m_params = params;
}
/*! \brief loads all mprims from configuration. also sets up amps. note that
* these are not necessarily the exact mprims used during search, because
* there's a user parameter that selects which mprims to actually use.
*/
bool MotionPrimitivesMgr::loadMPrims(){
// generate the nav mprims
MPrimList nav_mprims;
loadNavPrims(nav_mprims);
m_all_mprims = nav_mprims;
// load the adaptive primitive
auto adaptive_navprim = std::make_shared<NavAdaptiveMotionPrimitive>();
adaptive_navprim->setID(nav_mprims.size());
adaptive_navprim->setBaseCost(1);
m_all_mprims.push_back(adaptive_navprim);
// load the change leader primitive
m_change_leader_prim = std::make_shared<ChangeLeaderPrimitive>();
m_change_leader_prim->setBaseCost(m_params.change_leader_cost);
for (auto& mprim: m_all_mprims){
mprim->print();
}
return true;
}
void MotionPrimitivesMgr::loadNavPrims(MPrimList& nav_mprims) {
const int NUM_DIRS = 17;
std::vector<int> dx_(NUM_DIRS, 0), dy_(NUM_DIRS, 0);
std::vector<int> dx0intersects_(NUM_DIRS, 0), dy0intersects_(NUM_DIRS, 0);
std::vector<int> dx1intersects_(NUM_DIRS, 0), dy1intersects_(NUM_DIRS, 0);
std::vector<int> dxy_distance_mm_(NUM_DIRS, 0);
dx_[0] = 1;
dy_[0] = 1;
dx0intersects_[0] = -1;
dy0intersects_[0] = -1;
dx_[1] = 1;
dy_[1] = 0;
dx0intersects_[1] = -1;
dy0intersects_[1] = -1;
dx_[2] = 1;
dy_[2] = -1;
dx0intersects_[2] = -1;
dy0intersects_[2] = -1;
dx_[3] = 0;
dy_[3] = 1;
dx0intersects_[3] = -1;
dy0intersects_[3] = -1;
dx_[4] = 0;
dy_[4] = 0;
dx0intersects_[4] = -1;
dy0intersects_[4] = -1;
dx_[5] = 0;
dy_[5] = -1;
dx0intersects_[5] = -1;
dy0intersects_[5] = -1;
dx_[6] = -1;
dy_[6] = 1;
dx0intersects_[6] = -1;
dy0intersects_[6] = -1;
dx_[7] = -1;
dy_[7] = 0;
dx0intersects_[7] = -1;
dy0intersects_[7] = -1;
dx_[8] = -1;
dy_[8] = -1;
dx0intersects_[8] = -1;
dy0intersects_[8] = -1;
dx_[9] = 2; dy_[9] = 1;
dx0intersects_[9] = 1; dy0intersects_[9] = 0; dx1intersects_[9] = 1; dy1intersects_[9] = 1;
dx_[10] = 1; dy_[10] = 2;
dx0intersects_[10] = 0; dy0intersects_[10] = 1; dx1intersects_[10] = 1; dy1intersects_[10] = 1;
dx_[11] = -1; dy_[11] = 2;
dx0intersects_[11] = 0; dy0intersects_[11] = 1; dx1intersects_[11] = -1; dy1intersects_[11] = 1;
dx_[12] = -2; dy_[12] = 1;
dx0intersects_[12] = -1; dy0intersects_[12] = 0; dx1intersects_[12] = -1; dy1intersects_[12] = 1;
dx_[13] = -2; dy_[13] = -1;
dx0intersects_[13] = -1; dy0intersects_[13] = 0; dx1intersects_[13] = -1; dy1intersects_[13] = -1;
dx_[14] = -1; dy_[14] = -2;
dx0intersects_[14] = 0; dy0intersects_[14] = -1; dx1intersects_[14] = -1; dy1intersects_[14] = -1;
dx_[15] = 1; dy_[15] = -2;
dx0intersects_[15] = 0; dy0intersects_[15] = -1; dx1intersects_[15] = 1; dy1intersects_[15] = -1;
dx_[16] = 2; dy_[16] = -1;
dx0intersects_[16] = 1; dy0intersects_[16] = 0; dx1intersects_[16] = 1; dy1intersects_[16] = -1;
//compute costs
for (int dind = 0; dind < NUM_DIRS; dind++) {
if (dx_[dind] != 0 && dy_[dind] != 0) {
if (dind <= 8)
//the cost of a diagonal move in millimeters
dxy_distance_mm_[dind] = static_cast<int>(m_params.env_resolution * 1414);
else
//the cost of a move to 1,2 or 2,1 or so on in millimeters
dxy_distance_mm_[dind] = static_cast<int>(m_params.env_resolution * 2236);
} else {
// we set the cost of no move to be the same as a horizontal move.
// zero-cost actions are not nice.
dxy_distance_mm_[dind] = static_cast<int>(m_params.env_resolution * 1000); //the cost of a horizontal move in millimeters
}
}
// create the MPrims themselves
for (int i = 0; i < NUM_DIRS; i++) {
// make end coords
GraphStateMotion end_coords(ROBOT_DOF, 0);
end_coords[RobotStateElement::X] = dx_[i];
end_coords[RobotStateElement::Y] = dy_[i];
IntermSteps interm_steps;
// make intermsteps (if any)
if (i > 8) {
interm_steps.resize(2);
interm_steps[0] = std::vector<double>{
static_cast<double>(dx0intersects_[i]),
static_cast<double>(dy0intersects_[i])
};
interm_steps[1] = std::vector<double>{
static_cast<double>(dx1intersects_[i]),
static_cast<double>(dy1intersects_[i])
};
}
// fill up the primitive
NavMotionPrimitivePtr prim = std::make_shared<NavMotionPrimitive>();
prim->setID(i);
prim->setEndCoord(end_coords);
prim->setIntermSteps(interm_steps);
prim->setBaseCost(dxy_distance_mm_[i]);
nav_mprims.push_back(prim);
}
} | [
"sid24ss@gmail.com"
] | sid24ss@gmail.com |
ab4ce31a841630ae44b16e2c9a007f91ea60599b | 299e07b5c43500597be3e39b45d09bf5e7a404b5 | /Sourcecode.cpp | 44349fb553f1ebbb50872e300636f34c3e04593a | [] | no_license | farhanashrafdev/pacman-in-Cplusplus-and-basic-OOP-with-urdu-comments | 38f1345afdc1f82ce1592c226d2e6001be36aee9 | 65d38f1f831d315f5c88faf5cecab6c0a5af726a | refs/heads/master | 2022-11-24T10:31:52.798744 | 2020-07-22T04:46:06 | 2020-07-22T04:46:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,910 | cpp | #include<iostream>
using namespace std;
class Game {
private:
int count = 0;//count krega k kitne elements packman khagya
int pos_x=0, pos_y = 0;//packman ki location kia hai x, y k hisab mein yani arr[x][y] hogi position or wahan packman
//SHOW KRE GA postx or pos y
int tempx = 0, tempy = 0;//ye packman ki old location hai jahan pr hmne * gayab krk space store krni
bool check_win = false;//jb hm game jeet jayeingay to ye True hojayegaaa
char arr[15][15]; //ye hmari main array hai jo display horhi jismein * star store hua wa hai
char ch = 'P'; char input=' ';
public:
//defualt contructor mein sb kuch initialize krwarhe hain
Game(){
for(int i=0;i<15;i++)
for (int j = 0; j < 15; j++)
{
arr[i][j]='*';
pos_x,pos_y = 0;
}
arr[0][0] = ch;
}
~Game() {
for (int i = 0; i < 15; i++)
for (int j = 0; j < 15; j++)
{
arr[i][j] = '\0';
}
}
bool check() {
return check_win;//loop ko btayega k jeet gaye hain ya nhi
}
void display();//function prototypes
void Move();
void checkwin();
};
int main(){
Game obj;
//!obj,check ka mtlb hai k funtion jo btarha is loop ko k jeetgaye ya nhi...agr wo false ho to loop true ho
//islie ! ka sign use kia haui
while (!obj.check()) {
obj.display();//display ka fucntion call horha...ab jakr display ka function dekho..seedha isk bad
obj.Move();//ye input lene k bad ab character move krwayega pacman ko move krayega..ab ye ye wala function prho pehle
obj.checkwin();//ab checkwin call hoga wo wala dekho
}
return 0;
}
void Game::display() {
system("cls");//take screen clear krde
cout << "\t \t";//do bar tab space chorde or game cneter mein chle
for (int i = 0; i < 16; i++) { cout << "-"; }//game k oper ----------- cshow krne k lie loop
cout << endl;//usk bad line chorne k lie
//ab array show kreingay jismein * store hain
for (int j = 0; j < 15; j++)
{
cout << "\t \t"; cout << "|";//hr line k shuru mein | ka sign lgega border
for (int k = 0; k < 15; k++)
{
cout << arr[j][k];//ye show krega * ya jb ismein pac man hua wo..ya jb isko khalia to space
}
cout << "|" << endl;//hr line k end pr bhi border
}
cout << "\t \t";//2 tab space
for (int i = 0; i < 16; i++) { cout << "-"; }//ab array etc k end pr ------- show krega
cout << endl;//eik line chorne k lie
cout << "Eat the all * to win the game";//msg
cout << "Enter the (w,s,a,d) : to play: "; cin >> input;//input lega k pac man kahan move ho
//Ab wapis main mein jakr dekho agla function konsa hai or kia krrha phr
}
void Game::Move() {
//agr ismein eik bhi if smj lia na programm ki smj ajayegi main yehi hai
if (input=='d' || input=='D')//agr d enter kia mtlb k ab packman neche move krega eik step arr mein or * kha kr wahan space chordega
{
if (pos_y == 14) {//iska mtlb hai k packman agr full right pr hua yani array k axis y 14 hue mtlb k column 14
//mein hua agr packman jo k last column hai to sb se pehle column mein ajayega agr dobaran right dubaya
pos_y = 0;
arr[pos_x][14] = ' ';//last column mein us row k space store hogi
arr[pos_x][0] = 'P';//usi row k first colum mein Pack man jo k P hai ajayega store
}
else {//else ka mtlb hai k last column mein nhi hai packman
tempx = pos_x;//abhi jo position packman ki wo store hogi uska x or us y
tempy = pos_y;
pos_y++;//phr new position update hogi yani eik agla..right wala column hojayega
arr[pos_x][pos_y] = ch;//wahan pr P store hoga bec ch mein P hai
arr[tempx][tempy] =' '; //or purani position jo tempx and tempy mein store huiw ahan space ajayegi
}
//Sare if yehi krrha eik right se eik left se eik uper se eik neche se dekhta hai ab again main fucntion dekho
}
else if (input=='a')
{
if (pos_y == 0) {
pos_y = 14;
arr[pos_x][pos_y] = ' ';
arr[pos_x][0] = 'P';
}
else {
tempx = pos_x;
tempy = pos_y;
pos_y--;
arr[pos_x][pos_y] = 'P';
arr[tempx][tempy] = ' ';
}
}else if (input=='w')
{
if (pos_x == 0) {
pos_x = 14;
arr[pos_x][pos_y] = ' ';
arr[0][pos_y] = 'P';
}
else {
tempx = pos_x;
tempy = pos_y;
pos_x--;
arr[pos_x][pos_y] = 'P';
arr[tempx][tempy] =' ';
}
}
else if (input='s')
{
if (pos_x == 14) {
pos_x = 0;
arr[14][pos_y] = ' ';
arr[0][pos_y] = 'P';
}
else {
tempx = pos_x;
tempy = pos_y;
pos_x++;
cout << "ink done";
cout << pos_x << " " << pos_y;
arr[pos_x][pos_y] = 'P';
cout << "issuehere";
arr[tempx][tempy] =' ';
cout << "emmpty";
}
}
}
void Game::checkwin() {
//array sare elements check kregi jitne packman khagya count ki value utni hojayega kiun k jonsa element packman khayega wahan
//simple space ajayegi
for (int i = 0; i < 15; i++)
for (int j = 0; j < 15; j++)
{
if (arr[i][j] == ' ')
count++;
}
//Agr sare ch arr mein " "(space hogaye) yani packman khagya to win hojaye array 15 15 ki 2d hai to 15*15 yani 225
//dfa count++ hojayega jb tb ap jeeet jaogay
if (count == (15*15)) {
cout << "Congrats You have Eated All *" << endl;
cout << "You won The game: ";
check_win = true;//ye check win variable ko true krdega jis se loop ko true milega or wo false hojayegi
//or false hogi to dobaran se nhi chelgi mtlv game khtm hai...then
system("pause");//is lie take show krde ye sb or prh skte banda...k kia likha arha hai jb koi key ab press hogi
exit(1);//to program game band krdega..bt still Count=0 wala dekho
}
else count = 0;//ye else pr hai mtlb k abhi agr game na jeeto ho gay to count mgr increment hoga jitni spaces hui array mein
//mtlb k agr 25 spaces hui ton count =25 hojayega...jis se agli bar km hui to total jb bhi 225 hogayei ye jeet jayega
//Ya hostka jb loop chle 224 hojaye ye..then agli bar chle to 224+225 hojayega..jis se loop false he rhegi
//IMPORTANT::::::::::islie hr abr count ko 0 krdeingay take agli bar 0 se ++ hona shuru ho
}
| [
"noreply@github.com"
] | farhanashrafdev.noreply@github.com |
f403702b7cd0ed0fe5b3344282f7388bad88c960 | ba10da4be74ba4e472bbe4b51d411627fc07bdbf | /build/iOS/Preview/include/Fuse.Motion.Simulatio-17bdd43e.h | a8932f1eca52ce0ad7adc23c39f5a5c445a5ecf5 | [] | no_license | ericaglimsholt/gadden | 80f7c7b9c3c5c46c2520743dc388adbad549c679 | daef25c11410326f067c896c242436ff1cbd5df0 | refs/heads/master | 2021-07-03T10:07:58.451759 | 2017-09-05T18:11:47 | 2017-09-05T18:11:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,724 | h | // This file was generated based on '/Users/ericaglimsholt/Library/Application Support/Fusetools/Packages/Fuse.Motion/1.0.5/simulation/$.uno'.
// WARNING: Changes might be lost if you edit this file directly.
#pragma once
#include <Fuse.Motion.Simulatio-8063728b.h>
#include <Fuse.Motion.Simulatio-a4ba96c1.h>
#include <Fuse.Motion.Simulatio-b08eb1c5.h>
#include <Uno.Object.h>
namespace g{namespace Fuse{namespace Internal{struct ScalarBlender;}}}
namespace g{namespace Fuse{namespace Motion{namespace Simulation{struct AdapterMultiplier;}}}}
namespace g{
namespace Fuse{
namespace Motion{
namespace Simulation{
// internal sealed class AdapterMultiplier<T> :94
// {
struct AdapterMultiplier_type : uType
{
::g::Fuse::Motion::Simulation::DestinationSimulation interface0;
::g::Fuse::Motion::Simulation::MotionSimulation interface1;
::g::Fuse::Motion::Simulation::Simulation interface2;
};
AdapterMultiplier_type* AdapterMultiplier_typeof();
void AdapterMultiplier__ctor__fn(AdapterMultiplier* __this, uObject* impl, double* multiplier);
void AdapterMultiplier__get_Destination_fn(AdapterMultiplier* __this, uTRef __retval);
void AdapterMultiplier__set_Destination_fn(AdapterMultiplier* __this, void* value);
void AdapterMultiplier__In_fn(AdapterMultiplier* __this, void* val, uTRef __retval);
void AdapterMultiplier__get_IsStatic_fn(AdapterMultiplier* __this, bool* __retval);
void AdapterMultiplier__New1_fn(uType* __type, uObject* impl, double* multiplier, AdapterMultiplier** __retval);
void AdapterMultiplier__Out_fn(AdapterMultiplier* __this, void* val, uTRef __retval);
void AdapterMultiplier__get_Position_fn(AdapterMultiplier* __this, uTRef __retval);
void AdapterMultiplier__set_Position_fn(AdapterMultiplier* __this, void* value);
void AdapterMultiplier__Reset_fn(AdapterMultiplier* __this, void* value);
void AdapterMultiplier__Start_fn(AdapterMultiplier* __this);
void AdapterMultiplier__Update_fn(AdapterMultiplier* __this, double* elapsed);
void AdapterMultiplier__get_Velocity_fn(AdapterMultiplier* __this, uTRef __retval);
void AdapterMultiplier__set_Velocity_fn(AdapterMultiplier* __this, void* value);
struct AdapterMultiplier : uObject
{
uStrong< ::g::Fuse::Internal::ScalarBlender*> _blender;
uStrong<uObject*> _impl;
double _multiplier;
void ctor_(uObject* impl, double multiplier);
template<class T>
T Destination() { T __retval; return AdapterMultiplier__get_Destination_fn(this, &__retval), __retval; }
template<class T>
void Destination(T value) { AdapterMultiplier__set_Destination_fn(this, uConstrain(__type->T(0), value)); }
template<class T>
T In(T val) { T __retval; return AdapterMultiplier__In_fn(this, uConstrain(__type->T(0), val), &__retval), __retval; }
bool IsStatic();
template<class T>
T Out(T val) { T __retval; return AdapterMultiplier__Out_fn(this, uConstrain(__type->T(0), val), &__retval), __retval; }
template<class T>
T Position() { T __retval; return AdapterMultiplier__get_Position_fn(this, &__retval), __retval; }
template<class T>
void Position(T value) { AdapterMultiplier__set_Position_fn(this, uConstrain(__type->T(0), value)); }
template<class T>
void Reset(T value) { AdapterMultiplier__Reset_fn(this, uConstrain(__type->T(0), value)); }
void Start();
void Update(double elapsed);
template<class T>
T Velocity() { T __retval; return AdapterMultiplier__get_Velocity_fn(this, &__retval), __retval; }
template<class T>
void Velocity(T value) { AdapterMultiplier__set_Velocity_fn(this, uConstrain(__type->T(0), value)); }
static AdapterMultiplier* New1(uType* __type, uObject* impl, double multiplier);
};
// }
}}}} // ::g::Fuse::Motion::Simulation
| [
"ericaglimsholt@hotmail.com"
] | ericaglimsholt@hotmail.com |
7856d80f3dc8cfb8885557e0a31699258fed7e60 | 3fa1158e7b741664ac3d9d0fe2000c969c9ba58b | /src/gpuwattch/logic.h | b96c1b80c016df85f06177110f433ca5035390fd | [
"BSD-3-Clause"
] | permissive | kstraube/gpgpusim-capp | 22521effa78e9845898c002a19614e61c479f9d9 | 056184f28ad381eaab9dd27f3d3848a882c54787 | refs/heads/master | 2021-09-12T21:09:19.445316 | 2017-11-13T18:54:34 | 2017-11-13T18:54:34 | 110,017,269 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,228 | h | /*****************************************************************************
* McPAT
* SOFTWARE LICENSE AGREEMENT
* Copyright 2012 Hewlett-Packard Development Company, L.P.
* All Rights Reserved
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.”
*
***************************************************************************/
/********************************************************************
* Modified by: *
* Jingwen Leng, Univeristy of Texas, Austin *
* Syed Gilani, University of Wisconsin–Madison *
* Tayler Hetherington, University of British Columbia *
* Ahmed ElTantawy, University of British Columbia *
********************************************************************/
#ifndef LOGIC_H_
#define LOGIC_H_
#include "cacti/const.h"
#include "cacti/component.h"
#include "basic_components.h"
#include "cacti/basic_circuit.h"
#include "cacti/cacti_interface.h"
#include "cacti/decoder.h"
#include "cacti/parameter.h"
#include "xmlParser.h"
#include "XML_Parse.h"
#include "arch_const.h"
#include <cstring>
#include <iostream>
#include <cmath>
#include <cassert>
using namespace std;
class selection_logic : public Component{
public:
selection_logic(bool _is_default, int win_entries_,
int issue_width_, const InputParameter *configure_interface,
enum Device_ty device_ty_=Core_device,
enum Core_type core_ty_=Inorder);//, const ParseXML *_XML_interface);
bool is_default;
InputParameter l_ip;
uca_org_t local_result;
const ParseXML *XML_interface;
int win_entries;
int issue_width;
int num_threads;
enum Device_ty device_ty;
enum Core_type core_ty;
void selection_power();
void leakage_feedback(double temperature); // TODO
};
class dep_resource_conflict_check : public Component{
public:
dep_resource_conflict_check(const InputParameter *configure_interface, const CoreDynParam & dyn_p_, int compare_bits_, bool _is_default=true);
InputParameter l_ip;
uca_org_t local_result;
double WNORn, WNORp, Wevalinvp, Wevalinvn, Wcompn, Wcompp, Wcomppreequ;
CoreDynParam coredynp;
int compare_bits;
bool is_default;
statsDef tdp_stats;
statsDef rtp_stats;
statsDef stats_t;
powerDef power_t;
void conflict_check_power();
double compare_cap();
~dep_resource_conflict_check(){
local_result.cleanup();
}
void leakage_feedback(double temperature);
};
class inst_decoder: public Component{
public:
inst_decoder(bool _is_default, const InputParameter *configure_interface,
int opcode_length_,
int num_decoders_,
bool x86_,
enum Device_ty device_ty_=Core_device,
enum Core_type core_ty_=Inorder);
inst_decoder();
bool is_default;
int opcode_length;
int num_decoders;
bool x86;
int num_decoder_segments;
int num_decoded_signals;
InputParameter l_ip;
uca_org_t local_result;
enum Device_ty device_ty;
enum Core_type core_ty;
Decoder * final_dec;
Predec * pre_dec;
statsDef tdp_stats;
statsDef rtp_stats;
statsDef stats_t;
powerDef power_t;
void inst_decoder_delay_power();
~inst_decoder();
void leakage_feedback(double temperature);
};
class DFFCell : public Component {
public:
DFFCell(bool _is_dram, double _WdecNANDn, double _WdecNANDp,double _cell_load,
const InputParameter *configure_interface);
InputParameter l_ip;
bool is_dram;
double cell_load;
double WdecNANDn;
double WdecNANDp;
double clock_cap;
int model;
int n_switch;
int n_keep_1;
int n_keep_0;
int n_clock;
powerDef e_switch;
powerDef e_keep_1;
powerDef e_keep_0;
powerDef e_clock;
double fpfp_node_cap(unsigned int fan_in, unsigned int fan_out);
void compute_DFF_cell(void);
};
class Pipeline : public Component{
public:
Pipeline(const InputParameter *configure_interface, const CoreDynParam & dyn_p_, enum Device_ty device_ty_=Core_device, bool _is_core_pipeline=true, bool _is_default=true);
InputParameter l_ip;
uca_org_t local_result;
CoreDynParam coredynp;
enum Device_ty device_ty;
bool is_core_pipeline, is_default;
double num_piperegs;
// int pipeline_stages;
// int tot_stage_vector, per_stage_vector;
bool process_ind;
double WNANDn ;
double WNANDp;
double load_per_pipeline_stage;
// int Hthread, num_thread, fetchWidth, decodeWidth, issueWidth, commitWidth, instruction_length;
// int PC_width, opcode_length, num_arch_reg_tag, data_width,num_phsical_reg_tag, address_width;
// bool thread_clock_gated;
// bool in_order, multithreaded;
void compute_stage_vector();
void compute();
~Pipeline(){
local_result.cleanup();
};
};
//class core_pipeline :public pipeline{
//public:
// int Hthread, num_thread, fetchWidth, decodeWidth, issueWidth, commitWidth, instruction_length;
// int PC_width, opcode_length, num_arch_reg_tag, data_width,num_phsical_reg_tag, address_width;
// bool thread_clock_gated;
// bool in_order, multithreaded;
// core_pipeline(bool _is_default, const InputParameter *configure_interface);
// virtual void compute_stage_vector();
//
//};
class FunctionalUnit :public Component{
public:
ParseXML *XML;
int ithCore;
InputParameter interface_ip;
CoreDynParam coredynp;
double FU_height;
double clockRate,executionTime;
double num_fu;
double energy, base_energy,per_access_energy, leakage, gate_leakage;
bool is_default;
enum FU_type fu_type;
statsDef tdp_stats;
statsDef rtp_stats;
statsDef stats_t;
powerDef power_t;
FunctionalUnit(ParseXML *XML_interface, int ithCore_, InputParameter* interface_ip_,const CoreDynParam & dyn_p_, enum FU_type fu_type, double exClockRate);
void computeEnergy(bool is_tdp=true);
void displayEnergy(uint32_t indent = 0,int plevel = 100, bool is_tdp=true);
void leakage_feedback(double temperature);
};
class UndiffCore :public Component{
public:
UndiffCore(ParseXML* XML_interface, int ithCore_, InputParameter* interface_ip_, const CoreDynParam & dyn_p_, bool exist_=true, bool embedded_=false);
ParseXML *XML;
int ithCore;
InputParameter interface_ip;
CoreDynParam coredynp;
double clockRate,executionTime;
double scktRatio, chip_PR_overhead, macro_PR_overhead;
enum Core_type core_ty;
bool opt_performance, embedded;
double pipeline_stage,num_hthreads,issue_width;
bool is_default;
void displayEnergy(uint32_t indent = 0,int plevel = 100, bool is_tdp=true);
~UndiffCore(){};
bool exist;
};
#endif /* LOGIC_H_ */
| [
"kkstraube@kafka.ece.ucdavis.edu"
] | kkstraube@kafka.ece.ucdavis.edu |
bb7ff66458380f50442bebcd0d50fd49b9c5f0e5 | b7f3edb5b7c62174bed808079c3b21fb9ea51d52 | /chromeos/services/device_sync/fake_cryptauth_device_syncer.cc | 2f82793d83651905f8aa5d56ad0dc77383423409 | [
"BSD-3-Clause"
] | permissive | otcshare/chromium-src | 26a7372773b53b236784c51677c566dc0ad839e4 | 64bee65c921db7e78e25d08f1e98da2668b57be5 | refs/heads/webml | 2023-03-21T03:20:15.377034 | 2020-11-16T01:40:14 | 2020-11-16T01:40:14 | 209,262,645 | 18 | 21 | BSD-3-Clause | 2023-03-23T06:20:07 | 2019-09-18T08:52:07 | null | UTF-8 | C++ | false | false | 1,765 | cc | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chromeos/services/device_sync/fake_cryptauth_device_syncer.h"
#include "chromeos/services/device_sync/cryptauth_device_sync_result.h"
namespace chromeos {
namespace device_sync {
FakeCryptAuthDeviceSyncer::FakeCryptAuthDeviceSyncer() = default;
FakeCryptAuthDeviceSyncer::~FakeCryptAuthDeviceSyncer() = default;
void FakeCryptAuthDeviceSyncer::FinishAttempt(
const CryptAuthDeviceSyncResult& device_sync_result) {
DCHECK(client_metadata_);
DCHECK(client_app_metadata_);
OnAttemptFinished(device_sync_result);
}
void FakeCryptAuthDeviceSyncer::OnAttemptStarted(
const cryptauthv2::ClientMetadata& client_metadata,
const cryptauthv2::ClientAppMetadata& client_app_metadata) {
client_metadata_ = client_metadata;
client_app_metadata_ = client_app_metadata;
}
FakeCryptAuthDeviceSyncerFactory::FakeCryptAuthDeviceSyncerFactory() = default;
FakeCryptAuthDeviceSyncerFactory::~FakeCryptAuthDeviceSyncerFactory() = default;
std::unique_ptr<CryptAuthDeviceSyncer>
FakeCryptAuthDeviceSyncerFactory::CreateInstance(
CryptAuthDeviceRegistry* device_registry,
CryptAuthKeyRegistry* key_registry,
CryptAuthClientFactory* client_factory,
PrefService* pref_service,
std::unique_ptr<base::OneShotTimer> timer) {
last_device_registry_ = device_registry;
last_key_registry_ = key_registry;
last_client_factory_ = client_factory;
last_pref_service_ = pref_service;
auto instance = std::make_unique<FakeCryptAuthDeviceSyncer>();
instances_.push_back(instance.get());
return instance;
}
} // namespace device_sync
} // namespace chromeos
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
ede32bcb444f8038d17a2e54c6580f64d6f69e54 | 0d084ff09f85061fbb87757f3579361b013e301e | /src/qt/addressbookpage.cpp | 786eace13ba803012aab8af1b310ba2c7291edf8 | [
"MIT"
] | permissive | alik918/dngrcoin | c5a699d6cfd753457b2dde1ea2fb9cc80f882e70 | adf8bb68e4c2f8d3b6673c2807d99ba5377d8dd1 | refs/heads/master | 2023-02-04T11:31:01.342700 | 2020-12-22T16:34:18 | 2020-12-22T16:34:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,160 | cpp | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The DNGRcoin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H)
#include "config/dngrcoin-config.h"
#endif
#include "addressbookpage.h"
#include "ui_addressbookpage.h"
#include "addresstablemodel.h"
#include "bitcoingui.h"
#include "csvmodelwriter.h"
#include "editaddressdialog.h"
#include "guiutil.h"
#include "platformstyle.h"
#include <QIcon>
#include <QMenu>
#include <QMessageBox>
#include <QSortFilterProxyModel>
AddressBookPage::AddressBookPage(const PlatformStyle *platformStyle, Mode mode, Tabs tab, QWidget *parent) :
QDialog(parent),
ui(new Ui::AddressBookPage),
model(0),
mode(mode),
tab(tab)
{
QString theme = GUIUtil::getThemeName();
ui->setupUi(this);
if (!platformStyle->getImagesOnButtons()) {
ui->newAddress->setIcon(QIcon());
ui->copyAddress->setIcon(QIcon());
ui->deleteAddress->setIcon(QIcon());
ui->exportButton->setIcon(QIcon());
} else {
ui->newAddress->setIcon(QIcon(":/icons/" + theme + "/add"));
ui->copyAddress->setIcon(QIcon(":/icons/" + theme + "/editcopy"));
ui->deleteAddress->setIcon(QIcon(":/icons/" + theme + "/remove"));
ui->exportButton->setIcon(QIcon(":/icons/" + theme + "/export"));
}
switch(mode)
{
case ForSelection:
switch(tab)
{
case SendingTab: setWindowTitle(tr("Choose the address to send coins to")); break;
case ReceivingTab: setWindowTitle(tr("Choose the address to receive coins with")); break;
}
connect(ui->tableView, SIGNAL(doubleClicked(QModelIndex)), this, SLOT(accept()));
ui->tableView->setEditTriggers(QAbstractItemView::NoEditTriggers);
ui->tableView->setFocus();
ui->closeButton->setText(tr("C&hoose"));
ui->exportButton->hide();
break;
case ForEditing:
switch(tab)
{
case SendingTab: setWindowTitle(tr("Sending addresses")); break;
case ReceivingTab: setWindowTitle(tr("Receiving addresses")); break;
}
break;
}
switch(tab)
{
case SendingTab:
ui->labelExplanation->setText(tr("These are your DNGRcoin addresses for sending payments. Always check the amount and the receiving address before sending coins."));
ui->deleteAddress->setVisible(true);
break;
case ReceivingTab:
ui->labelExplanation->setText(tr("These are your DNGRcoin addresses for receiving payments. It is recommended to use a new receiving address for each transaction."));
ui->deleteAddress->setVisible(false);
break;
}
// Context menu actions
QAction *copyAddressAction = new QAction(tr("&Copy Address"), this);
QAction *copyLabelAction = new QAction(tr("Copy &Label"), this);
QAction *editAction = new QAction(tr("&Edit"), this);
deleteAction = new QAction(ui->deleteAddress->text(), this);
// Build context menu
contextMenu = new QMenu();
contextMenu->addAction(copyAddressAction);
contextMenu->addAction(copyLabelAction);
contextMenu->addAction(editAction);
if(tab == SendingTab)
contextMenu->addAction(deleteAction);
contextMenu->addSeparator();
// Connect signals for context menu actions
connect(copyAddressAction, SIGNAL(triggered()), this, SLOT(on_copyAddress_clicked()));
connect(copyLabelAction, SIGNAL(triggered()), this, SLOT(onCopyLabelAction()));
connect(editAction, SIGNAL(triggered()), this, SLOT(onEditAction()));
connect(deleteAction, SIGNAL(triggered()), this, SLOT(on_deleteAddress_clicked()));
connect(ui->tableView, SIGNAL(customContextMenuRequested(QPoint)), this, SLOT(contextualMenu(QPoint)));
connect(ui->closeButton, SIGNAL(clicked()), this, SLOT(accept()));
}
AddressBookPage::~AddressBookPage()
{
delete ui;
}
void AddressBookPage::setModel(AddressTableModel *model)
{
this->model = model;
if(!model)
return;
proxyModel = new QSortFilterProxyModel(this);
proxyModel->setSourceModel(model);
proxyModel->setDynamicSortFilter(true);
proxyModel->setSortCaseSensitivity(Qt::CaseInsensitive);
proxyModel->setFilterCaseSensitivity(Qt::CaseInsensitive);
switch(tab)
{
case ReceivingTab:
// Receive filter
proxyModel->setFilterRole(AddressTableModel::TypeRole);
proxyModel->setFilterFixedString(AddressTableModel::Receive);
break;
case SendingTab:
// Send filter
proxyModel->setFilterRole(AddressTableModel::TypeRole);
proxyModel->setFilterFixedString(AddressTableModel::Send);
break;
}
ui->tableView->setModel(proxyModel);
ui->tableView->sortByColumn(0, Qt::AscendingOrder);
// Set column widths
#if QT_VERSION < 0x050000
ui->tableView->horizontalHeader()->setResizeMode(AddressTableModel::Label, QHeaderView::Stretch);
ui->tableView->horizontalHeader()->setResizeMode(AddressTableModel::Address, QHeaderView::ResizeToContents);
#else
ui->tableView->horizontalHeader()->setSectionResizeMode(AddressTableModel::Label, QHeaderView::Stretch);
ui->tableView->horizontalHeader()->setSectionResizeMode(AddressTableModel::Address, QHeaderView::ResizeToContents);
#endif
connect(ui->tableView->selectionModel(), SIGNAL(selectionChanged(QItemSelection,QItemSelection)),
this, SLOT(selectionChanged()));
// Select row for newly created address
connect(model, SIGNAL(rowsInserted(QModelIndex,int,int)), this, SLOT(selectNewAddress(QModelIndex,int,int)));
selectionChanged();
}
void AddressBookPage::on_copyAddress_clicked()
{
GUIUtil::copyEntryData(ui->tableView, AddressTableModel::Address);
}
void AddressBookPage::onCopyLabelAction()
{
GUIUtil::copyEntryData(ui->tableView, AddressTableModel::Label);
}
void AddressBookPage::onEditAction()
{
if(!model)
return;
if(!ui->tableView->selectionModel())
return;
QModelIndexList indexes = ui->tableView->selectionModel()->selectedRows();
if(indexes.isEmpty())
return;
EditAddressDialog dlg(
tab == SendingTab ?
EditAddressDialog::EditSendingAddress :
EditAddressDialog::EditReceivingAddress, this);
dlg.setModel(model);
QModelIndex origIndex = proxyModel->mapToSource(indexes.at(0));
dlg.loadRow(origIndex.row());
dlg.exec();
}
void AddressBookPage::on_newAddress_clicked()
{
if(!model)
return;
EditAddressDialog dlg(
tab == SendingTab ?
EditAddressDialog::NewSendingAddress :
EditAddressDialog::NewReceivingAddress, this);
dlg.setModel(model);
if(dlg.exec())
{
newAddressToSelect = dlg.getAddress();
}
}
void AddressBookPage::on_deleteAddress_clicked()
{
QTableView *table = ui->tableView;
if(!table->selectionModel())
return;
QModelIndexList indexes = table->selectionModel()->selectedRows();
if(!indexes.isEmpty())
{
table->model()->removeRow(indexes.at(0).row());
}
}
void AddressBookPage::selectionChanged()
{
// Set button states based on selected tab and selection
QTableView *table = ui->tableView;
if(!table->selectionModel())
return;
if(table->selectionModel()->hasSelection())
{
switch(tab)
{
case SendingTab:
// In sending tab, allow deletion of selection
ui->deleteAddress->setEnabled(true);
ui->deleteAddress->setVisible(true);
deleteAction->setEnabled(true);
break;
case ReceivingTab:
// Deleting receiving addresses, however, is not allowed
ui->deleteAddress->setEnabled(false);
ui->deleteAddress->setVisible(false);
deleteAction->setEnabled(false);
break;
}
ui->copyAddress->setEnabled(true);
}
else
{
ui->deleteAddress->setEnabled(false);
ui->copyAddress->setEnabled(false);
}
}
void AddressBookPage::done(int retval)
{
QTableView *table = ui->tableView;
if(!table->selectionModel() || !table->model())
return;
// Figure out which address was selected, and return it
QModelIndexList indexes = table->selectionModel()->selectedRows(AddressTableModel::Address);
Q_FOREACH (const QModelIndex& index, indexes) {
QVariant address = table->model()->data(index);
returnValue = address.toString();
}
if(returnValue.isEmpty())
{
// If no address entry selected, return rejected
retval = Rejected;
}
QDialog::done(retval);
}
void AddressBookPage::on_exportButton_clicked()
{
// CSV is currently the only supported format
QString filename = GUIUtil::getSaveFileName(this,
tr("Export Address List"), QString(),
tr("Comma separated file (*.csv)"), NULL);
if (filename.isNull())
return;
CSVModelWriter writer(filename);
// name, column, role
writer.setModel(proxyModel);
writer.addColumn("Label", AddressTableModel::Label, Qt::EditRole);
writer.addColumn("Address", AddressTableModel::Address, Qt::EditRole);
if(!writer.write()) {
QMessageBox::critical(this, tr("Exporting Failed"),
tr("There was an error trying to save the address list to %1. Please try again.").arg(filename));
}
}
void AddressBookPage::contextualMenu(const QPoint &point)
{
QModelIndex index = ui->tableView->indexAt(point);
if(index.isValid())
{
contextMenu->exec(QCursor::pos());
}
}
void AddressBookPage::selectNewAddress(const QModelIndex &parent, int begin, int /*end*/)
{
QModelIndex idx = proxyModel->mapFromSource(model->index(begin, AddressTableModel::Address, parent));
if(idx.isValid() && (idx.data(Qt::EditRole).toString() == newAddressToSelect))
{
// Select row of newly created address, once
ui->tableView->setFocus();
ui->tableView->selectRow(idx.row());
newAddressToSelect.clear();
}
}
| [
"you@example.com"
] | you@example.com |
991012d434eb82b4a5cd5b793c8904e46c3f7cdc | d6125fb9313bd89b40de90d3bbe1a17dcb452c1e | /src/Messages/StopMsg.h | 9612da9955197ec80d179469d5477576efd21c18 | [] | no_license | alejandroguillen/testbed_final | 011d3820784026978b5047d9cec91c4b0fdaf304 | 354660ae99e99a7615c30f2709bc2817bab7e036 | refs/heads/master | 2021-01-19T21:28:39.538813 | 2015-05-06T08:13:30 | 2015-05-06T08:13:30 | 35,144,996 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 275 | h | /*
* StopMsg.h
*
* Created on: 24/lug/2014
* Author: greeneyes
*/
#ifndef STOPMSG_H_
#define STOPMSG_H_
#include "Message.h"
class StopMsg : public Message{
private:
public:
StopMsg();
int getBitStream(vector<uchar>& bitstream);
};
#endif /* STOPMSG_H_ */
| [
"alexisga90@gmail.com"
] | alexisga90@gmail.com |
fa35b52b209e2f135d3d3f96ac7e568893d7db56 | 973b980152375c0d037b48ec00e7fe202c284e78 | /Query_base/Query_base/Query_base.cpp | 1ae21ccef26431ecec36bb16896fdf6b90b28ce2 | [] | no_license | Hashirama/Cplusplus-Primer-5 | 3b7b11245033248b8f8185125085a08c3f9f024b | f3fd3275e781fa9a0d244475b7256fa884c30535 | refs/heads/master | 2021-06-11T11:55:09.844529 | 2016-11-25T20:44:38 | 2016-11-25T20:44:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,304 | cpp | #include <iostream>
#include "Query_base.h"
#include <iterator>
#include <algorithm>
std::ostream &operator<<(std::ostream &os, const Query &query) {
return os << query.rep();
}
QueryResult OrQuery::eval(const TextQuery& text) const {
auto right = rhs.eval(text), left = lhs.eval(text);
auto ret_lines = std::make_shared<std::set<line_no>>(left.begin(), left.end());
ret_lines->insert(right.begin(), right.end());
return QueryResult(rep(), ret_lines, left.get_file());
}
QueryResult AndQuery::eval(const TextQuery& text) const {
auto left = lhs.eval(text), right = rhs.eval(text);
auto ret_lines = std::make_shared<std::set<line_no>>();
std::set_intersection(left.begin(), left.end(), right.begin(), right.end(), std::inserter(*ret_lines, ret_lines->begin()));
return QueryResult(rep(), ret_lines, left.get_file());
}
QueryResult NotQuery::eval(const TextQuery& text) const {
auto result = query.eval(text);
auto ret_lines = std::make_shared<std::set<line_no>>();
auto beg = result.begin(), end = result.end();
auto sz = result.get_file()->size();
for (size_t n = 0; n != sz; ++n) {
if (beg == end || *beg != n)
ret_lines->insert(n);
else if (beg != end)
++beg;
}
return QueryResult(rep(), ret_lines, result.get_file());
} | [
"noreply@github.com"
] | Hashirama.noreply@github.com |
c4896696f882a874a706c07e5bf8c460997d2e1a | cd38af1ae85bc76d87c4602cd45769ab1c066cfa | /Chapter11/11-2-1.cpp | c6eb4bd457e46a298a0a74f1b1c937afd948671a | [] | no_license | afterhoon/cppProgrammingExam | 6113be0536c1c63288baaad0c1f1a79c92033d05 | 9162b175ecb48e583b8402242f4cc1b89308c926 | refs/heads/master | 2020-06-18T20:06:10.012034 | 2016-12-18T16:18:51 | 2016-12-18T16:18:51 | 74,943,964 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,723 | cpp | /*
문제 1. StablePointPtrArray.cpp의 Point클래스를 대상으로 연산자 오버로딩
*/
#include <iostream>
#include <cstdlib>
using namespace std;
class Point {
private:
int xpos, ypos;
public:
Point(int x = 0, int y = 0) : xpos(x), ypos(y) {
}
friend ostream& operator<< (ostream& os, const Point& pos);
friend ostream& operator<< (ostream& os, const Point* pos);
};
ostream& operator<<(ostream& os, const Point& pos) {
os << '[' << pos.xpos << ", " << pos.ypos << ']' << endl;
return os;
}
ostream& operator<<(ostream& os, const Point* pos) {
os << '[' << pos->xpos << ", " << pos->ypos << ']' << endl;
return os;
}
typedef Point * POINT_PTR;
class BoundCheckPointPtrArray {
private:
POINT_PTR * arr;
int arrlen;
BoundCheckPointPtrArray(const BoundCheckPointPtrArray& arr) {}
BoundCheckPointPtrArray &operator=(const BoundCheckPointPtrArray& arr) {}
public:
BoundCheckPointPtrArray(int len) : arrlen(len) {
arr = new POINT_PTR[len];
}
POINT_PTR& operator[] (int idx) {
if (idx < 0 || idx >= arrlen) {
cout << "Array index out of bound exception" << endl;
exit(1);
}
return arr[idx];
}
POINT_PTR operator[] (int idx) const {
if (idx < 0 || idx >= arrlen) {
cout << "Array index out of bound exception" << endl;
exit(1);
}
return arr[idx];
}
int GetArrLen() const { return arrlen; }
~BoundCheckPointPtrArray() { delete[]arr; }
};
int main() {
BoundCheckPointPtrArray arr(3);
arr[0] = new Point(3, 4);
arr[1] = new Point(5, 6);
arr[2] = new Point(7, 8);
/*
for (int i = 0; i < arr.GetArrLen(); i++)
cout << *(arr[i]);
*/
for (int i = 0; i < arr.GetArrLen(); i++)
cout << arr[i];
delete arr[0];
delete arr[1];
delete arr[2];
return 0;
}
| [
"noreply@github.com"
] | afterhoon.noreply@github.com |
26e8033a10260aba4a0540e8da9a17b19eeca46c | 129a4883c4f71fa01f3167e2589d3937864894c4 | /devel/include/ur_msgs/RobotStateRTMsg.h | 932cac0f7ce4e6c8fe660ac27b327c005b4020df | [] | no_license | ChengdaJi/SensorBasedRobotics | 21dc84fafac27e2a1e817ba2c34bb5e90af4b9f0 | 25a283868c8e0bb67e137f58397b471cf0555de9 | refs/heads/master | 2020-12-30T11:59:41.924577 | 2017-05-16T16:24:27 | 2017-05-16T16:24:27 | 91,479,804 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,080 | h | // Generated by gencpp from file ur_msgs/RobotStateRTMsg.msg
// DO NOT EDIT!
#ifndef UR_MSGS_MESSAGE_ROBOTSTATERTMSG_H
#define UR_MSGS_MESSAGE_ROBOTSTATERTMSG_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 ur_msgs
{
template <class ContainerAllocator>
struct RobotStateRTMsg_
{
typedef RobotStateRTMsg_<ContainerAllocator> Type;
RobotStateRTMsg_()
: time(0.0)
, q_target()
, qd_target()
, qdd_target()
, i_target()
, m_target()
, q_actual()
, qd_actual()
, i_actual()
, tool_acc_values()
, tcp_force()
, tool_vector()
, tcp_speed()
, digital_input_bits(0.0)
, motor_temperatures()
, controller_timer(0.0)
, test_value(0.0)
, robot_mode(0.0)
, joint_modes() {
}
RobotStateRTMsg_(const ContainerAllocator& _alloc)
: time(0.0)
, q_target(_alloc)
, qd_target(_alloc)
, qdd_target(_alloc)
, i_target(_alloc)
, m_target(_alloc)
, q_actual(_alloc)
, qd_actual(_alloc)
, i_actual(_alloc)
, tool_acc_values(_alloc)
, tcp_force(_alloc)
, tool_vector(_alloc)
, tcp_speed(_alloc)
, digital_input_bits(0.0)
, motor_temperatures(_alloc)
, controller_timer(0.0)
, test_value(0.0)
, robot_mode(0.0)
, joint_modes(_alloc) {
(void)_alloc;
}
typedef double _time_type;
_time_type time;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _q_target_type;
_q_target_type q_target;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _qd_target_type;
_qd_target_type qd_target;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _qdd_target_type;
_qdd_target_type qdd_target;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _i_target_type;
_i_target_type i_target;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _m_target_type;
_m_target_type m_target;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _q_actual_type;
_q_actual_type q_actual;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _qd_actual_type;
_qd_actual_type qd_actual;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _i_actual_type;
_i_actual_type i_actual;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _tool_acc_values_type;
_tool_acc_values_type tool_acc_values;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _tcp_force_type;
_tcp_force_type tcp_force;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _tool_vector_type;
_tool_vector_type tool_vector;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _tcp_speed_type;
_tcp_speed_type tcp_speed;
typedef double _digital_input_bits_type;
_digital_input_bits_type digital_input_bits;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _motor_temperatures_type;
_motor_temperatures_type motor_temperatures;
typedef double _controller_timer_type;
_controller_timer_type controller_timer;
typedef double _test_value_type;
_test_value_type test_value;
typedef double _robot_mode_type;
_robot_mode_type robot_mode;
typedef std::vector<double, typename ContainerAllocator::template rebind<double>::other > _joint_modes_type;
_joint_modes_type joint_modes;
typedef boost::shared_ptr< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> > Ptr;
typedef boost::shared_ptr< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> const> ConstPtr;
}; // struct RobotStateRTMsg_
typedef ::ur_msgs::RobotStateRTMsg_<std::allocator<void> > RobotStateRTMsg;
typedef boost::shared_ptr< ::ur_msgs::RobotStateRTMsg > RobotStateRTMsgPtr;
typedef boost::shared_ptr< ::ur_msgs::RobotStateRTMsg const> RobotStateRTMsgConstPtr;
// constants requiring out of line definition
template<typename ContainerAllocator>
std::ostream& operator<<(std::ostream& s, const ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> & v)
{
ros::message_operations::Printer< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >::stream(s, "", v);
return s;
}
} // namespace ur_msgs
namespace ros
{
namespace message_traits
{
// BOOLTRAITS {'IsFixedSize': False, 'IsMessage': True, 'HasHeader': False}
// {'std_msgs': ['/opt/ros/kinetic/share/std_msgs/cmake/../msg'], 'ur_msgs': ['/home/chengda/sbr_workspace/src/sbr/universal_robot/ur_msgs/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< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
: FalseType
{ };
template <class ContainerAllocator>
struct IsFixedSize< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> const>
: FalseType
{ };
template <class ContainerAllocator>
struct IsMessage< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct IsMessage< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> const>
: TrueType
{ };
template <class ContainerAllocator>
struct HasHeader< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
: FalseType
{ };
template <class ContainerAllocator>
struct HasHeader< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> const>
: FalseType
{ };
template<class ContainerAllocator>
struct MD5Sum< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
{
static const char* value()
{
return "ce6feddd3ccb4ca7dbcd0ff105b603c7";
}
static const char* value(const ::ur_msgs::RobotStateRTMsg_<ContainerAllocator>&) { return value(); }
static const uint64_t static_value1 = 0xce6feddd3ccb4ca7ULL;
static const uint64_t static_value2 = 0xdbcd0ff105b603c7ULL;
};
template<class ContainerAllocator>
struct DataType< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
{
static const char* value()
{
return "ur_msgs/RobotStateRTMsg";
}
static const char* value(const ::ur_msgs::RobotStateRTMsg_<ContainerAllocator>&) { return value(); }
};
template<class ContainerAllocator>
struct Definition< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
{
static const char* value()
{
return "# Data structure for the realtime communications interface (aka Matlab interface)\n\
# used by the Universal Robots controller\n\
# \n\
# This data structure is send at 125 Hz on TCP port 30003\n\
# \n\
# Dokumentation can be found on the Universal Robots Support Wiki\n\
# (http://wiki03.lynero.net/Technical/RealTimeClientInterface?rev=9)\n\
\n\
float64 time\n\
float64[] q_target\n\
float64[] qd_target\n\
float64[] qdd_target\n\
float64[] i_target\n\
float64[] m_target\n\
float64[] q_actual\n\
float64[] qd_actual\n\
float64[] i_actual\n\
float64[] tool_acc_values\n\
float64[] tcp_force\n\
float64[] tool_vector\n\
float64[] tcp_speed\n\
float64 digital_input_bits\n\
float64[] motor_temperatures\n\
float64 controller_timer\n\
float64 test_value\n\
float64 robot_mode\n\
float64[] joint_modes\n\
";
}
static const char* value(const ::ur_msgs::RobotStateRTMsg_<ContainerAllocator>&) { return value(); }
};
} // namespace message_traits
} // namespace ros
namespace ros
{
namespace serialization
{
template<class ContainerAllocator> struct Serializer< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
{
template<typename Stream, typename T> inline static void allInOne(Stream& stream, T m)
{
stream.next(m.time);
stream.next(m.q_target);
stream.next(m.qd_target);
stream.next(m.qdd_target);
stream.next(m.i_target);
stream.next(m.m_target);
stream.next(m.q_actual);
stream.next(m.qd_actual);
stream.next(m.i_actual);
stream.next(m.tool_acc_values);
stream.next(m.tcp_force);
stream.next(m.tool_vector);
stream.next(m.tcp_speed);
stream.next(m.digital_input_bits);
stream.next(m.motor_temperatures);
stream.next(m.controller_timer);
stream.next(m.test_value);
stream.next(m.robot_mode);
stream.next(m.joint_modes);
}
ROS_DECLARE_ALLINONE_SERIALIZER
}; // struct RobotStateRTMsg_
} // namespace serialization
} // namespace ros
namespace ros
{
namespace message_operations
{
template<class ContainerAllocator>
struct Printer< ::ur_msgs::RobotStateRTMsg_<ContainerAllocator> >
{
template<typename Stream> static void stream(Stream& s, const std::string& indent, const ::ur_msgs::RobotStateRTMsg_<ContainerAllocator>& v)
{
s << indent << "time: ";
Printer<double>::stream(s, indent + " ", v.time);
s << indent << "q_target[]" << std::endl;
for (size_t i = 0; i < v.q_target.size(); ++i)
{
s << indent << " q_target[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.q_target[i]);
}
s << indent << "qd_target[]" << std::endl;
for (size_t i = 0; i < v.qd_target.size(); ++i)
{
s << indent << " qd_target[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.qd_target[i]);
}
s << indent << "qdd_target[]" << std::endl;
for (size_t i = 0; i < v.qdd_target.size(); ++i)
{
s << indent << " qdd_target[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.qdd_target[i]);
}
s << indent << "i_target[]" << std::endl;
for (size_t i = 0; i < v.i_target.size(); ++i)
{
s << indent << " i_target[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.i_target[i]);
}
s << indent << "m_target[]" << std::endl;
for (size_t i = 0; i < v.m_target.size(); ++i)
{
s << indent << " m_target[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.m_target[i]);
}
s << indent << "q_actual[]" << std::endl;
for (size_t i = 0; i < v.q_actual.size(); ++i)
{
s << indent << " q_actual[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.q_actual[i]);
}
s << indent << "qd_actual[]" << std::endl;
for (size_t i = 0; i < v.qd_actual.size(); ++i)
{
s << indent << " qd_actual[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.qd_actual[i]);
}
s << indent << "i_actual[]" << std::endl;
for (size_t i = 0; i < v.i_actual.size(); ++i)
{
s << indent << " i_actual[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.i_actual[i]);
}
s << indent << "tool_acc_values[]" << std::endl;
for (size_t i = 0; i < v.tool_acc_values.size(); ++i)
{
s << indent << " tool_acc_values[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.tool_acc_values[i]);
}
s << indent << "tcp_force[]" << std::endl;
for (size_t i = 0; i < v.tcp_force.size(); ++i)
{
s << indent << " tcp_force[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.tcp_force[i]);
}
s << indent << "tool_vector[]" << std::endl;
for (size_t i = 0; i < v.tool_vector.size(); ++i)
{
s << indent << " tool_vector[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.tool_vector[i]);
}
s << indent << "tcp_speed[]" << std::endl;
for (size_t i = 0; i < v.tcp_speed.size(); ++i)
{
s << indent << " tcp_speed[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.tcp_speed[i]);
}
s << indent << "digital_input_bits: ";
Printer<double>::stream(s, indent + " ", v.digital_input_bits);
s << indent << "motor_temperatures[]" << std::endl;
for (size_t i = 0; i < v.motor_temperatures.size(); ++i)
{
s << indent << " motor_temperatures[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.motor_temperatures[i]);
}
s << indent << "controller_timer: ";
Printer<double>::stream(s, indent + " ", v.controller_timer);
s << indent << "test_value: ";
Printer<double>::stream(s, indent + " ", v.test_value);
s << indent << "robot_mode: ";
Printer<double>::stream(s, indent + " ", v.robot_mode);
s << indent << "joint_modes[]" << std::endl;
for (size_t i = 0; i < v.joint_modes.size(); ++i)
{
s << indent << " joint_modes[" << i << "]: ";
Printer<double>::stream(s, indent + " ", v.joint_modes[i]);
}
}
};
} // namespace message_operations
} // namespace ros
#endif // UR_MSGS_MESSAGE_ROBOTSTATERTMSG_H
| [
"chengdaji@jhu.edu"
] | chengdaji@jhu.edu |
7775d44bec948b732dec3da890341d9b42afd932 | 300039566399bc05a74fa63aafd6b3d1247e4796 | /predator.cpp | 173c9b20e5191ce66e983f8ebdc278b5a854e9fa | [] | no_license | altvictor/predatorprey | 6d84420b11d0ecb9ba27f8c4fd99fbb978561424 | 60d0e8902904a18fec935c5957638f9fa50b4f67 | refs/heads/master | 2021-01-10T14:27:53.886860 | 2015-12-04T08:23:49 | 2015-12-04T08:23:49 | 47,246,676 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,191 | cpp | #include "predator.h"
predator::predator(int row, int col):creature(row, col, 'X'){
}
void predator::move(creature* world[][ho_const::MAX]){
int place = findother(world, 'O');
if(place != 0){
kill(world, place);
_starve = 0;
}
else{
place = findblank(world);
if(place != 0){
moveto(world, place);
}
_starve++;
}
return;
}
void predator::breed(creature* world[][ho_const::MAX]){
int row = getrow();
int col = getcol();
int place = findblank(world);
if(place > 0 && gettime() > 7 && gettime() % 8 == 0){
switch(place){
case 1:
world[row-1][col] = new predator(row-1, col);
break;
case 2:
world[row][col-1] = new predator(row, col-1);
break;
case 3:
world[row][col+1] = new predator(row, col+1);
break;
case 4:
world[row+1][col] = new predator(row+1, col);
break;
default:
break;
}
}
return;
}
void predator::starve(creature* world[][ho_const::MAX]){
if(_starve >= 3){
kill(world, 0);
}
return;
}
| [
"vh1601@gmail.com"
] | vh1601@gmail.com |
b6b71fd158bd68562c2789e55d170b007e7f771f | 87afd2b9face99ac5553f6dd4cf9595f754c6650 | /definitivo/GetTheBall/GetTheBall/Conversion.h | bde3516b924a9525cb4e6165040fbfaacdb4bf78 | [] | no_license | LauraLaureus/PickTheCow | 5ca3f343d9d1ba03712e9d43763bd311cd9e5ba8 | 97f5f95daf24227f24310e60cdaa349ef17c1aed | refs/heads/master | 2021-01-17T19:51:57.935594 | 2016-06-06T17:00:02 | 2016-06-06T17:00:02 | 60,543,688 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 386 | h | #pragma once
#include "Coordinates3D.h"
#include "TableXY.h"
class Conversion {
public:
static int getRowIndexFromSubRowIndex(int subRowIndex, int numberOfSubRows);
static int getColumnIndexFromSubColumnIndex(int subColumnIndex, int numberOfSubColumns);
static Coordinates3D getCoordinates3DFromRowAndColumnIndexes(TableXY& table, int rowIndex, int columnIndex);
};
| [
"l4depende@gmail.com"
] | l4depende@gmail.com |
79b6c5c41525db92cc29181edd7dc68d50cc357e | f29b7b3a54c6cfd3c1e831fe4ffe218a1adcc308 | /Class Assignments/ex3-9b.cpp | b789dfac50e5a903effc22d289a52c4f8b58c5d0 | [] | no_license | rolandrao/CISS290 | 85be9ca4af93ada3806ee95a04e9e0827e5936d1 | a55f9765f9b005a496af76b8819ec4beab601876 | refs/heads/master | 2020-05-03T12:10:02.209163 | 2019-04-24T15:01:07 | 2019-04-24T15:01:07 | 178,617,305 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 675 | cpp | /* Bill Wohlleber
Exercise 3-9b
This program will print a line of text in uppercase and lowercase
character by character using strings
*/
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
int main()
{
string s, su, sl;
int i;
cout << "Enter a line of text: ";
getline(cin, s, '\n');
su.resize(s.length());
for (i = 0; i < s.length(); i++)
su.at(i) = toupper(s.at(i));
cout << su << endl;
if (s > su)
cout << s << " is some lowercase\n";
i = 0;
sl.resize(s.length());
for (i = 0; i < s.length(); i++)
su.at(i) = tolower(s.at(i));
cout << sl << endl;
if (s < sl)
cout << s << " is some uppercase\n";
} | [
"rolandrao@gmail.com"
] | rolandrao@gmail.com |
5ac586f0f4734a2a26830a056f5de802d32691be | a239e7d9cccf5f8b79d217e3acf6a1a6f9fe03d9 | /src/monochrome.cpp | 586faa484f9fb227a2fcf316a1bb127c2757be5d | [] | no_license | AlifArifin/mini-photoshop | e1bad70d54fa9212f0a600644954dc0473d746d3 | cec588f5452ad9dc99117b18187d4dcfd5a4304b | refs/heads/master | 2022-04-05T04:18:10.000386 | 2020-02-19T08:42:27 | 2020-02-19T08:42:27 | 215,892,965 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 32,857 | cpp | #include "monochrome.h"
#include "utils.h"
#include "pbm_state.h"
#include "pgm_state.h"
#include "operation.h"
#include "padding.h"
#include <fstream>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <QDebug>
using namespace std;
Monochrome::Monochrome() {
}
Monochrome::Monochrome(const Monochrome & monochrome) : Image(monochrome) {
this->level = monochrome.level;
this->pixel = new short*[this->resolution.height];
for (int i = 0; i < this->resolution.height; i++) {
this->pixel[i] = new short[this->resolution.width];
for (int j = 0; j < this->resolution.width; j++) {
this->pixel[i][j] = monochrome.pixel[i][j];
}
}
}
Monochrome::Monochrome(const Monochrome & monochrome, Resolution resTop, Resolution resBot) : Image(monochrome) {
Resolution newRes;
newRes.height = resBot.height - resTop.height + 1;
newRes.width = resBot.width - resTop.width + 1;
this->resolution = newRes;
this->level = monochrome.level;
this->pixel = new short*[this->resolution.height];
for (int i = 0; i < this->resolution.height; i++) {
this->pixel[i] = new short[this->resolution.width];
for (int j = 0; j < this->resolution.width; j++) {
this->pixel[i][j] = monochrome.pixel[resTop.height + i][resTop.width + j];
}
}
}
Monochrome::Monochrome(ImageFormat imageFormat, ImageType imageType) : Image(imageFormat, imageType) {
}
Monochrome::Monochrome(ImageFormat imageFormat, ImageType imageType, Resolution resolution, short level) : Image(imageFormat, imageType) {
this->level = level;
this->resolution = resolution;
this->pixel = new short*[resolution.height];
for (int i = 0; i < resolution.height; i++) {
this->pixel[i] = new short[resolution.width];
for (int j = 0; j < resolution.width; j++) {
this->pixel[i][j] = 0;
}
}
}
Monochrome::~Monochrome() {
for (int i = 0; i < this->resolution.height; i++) {
delete [] pixel[i];
}
delete [] pixel;
}
short** Monochrome::getPixel() {
return this->pixel;
}
void Monochrome::setPixel(short** pixel) {
this->pixel = pixel;
}
void Monochrome::setIndividualPixel(int i, int j, short pixel) {
this->pixel[i][j] = pixel;
}
short Monochrome::getIndividualPixel(int i, int j) {
return this->pixel[i][j];
}
short Monochrome::getLevel() {
return this->level;
}
void Monochrome::setLevel(short level) {
this->level = level;
}
void Monochrome::save(string filename) {
ofstream myfile;
myfile.open ("D://ImageSample/Saved/" + filename);
if (this->imageType == ImageType::BINARY) {
myfile << "P1" << "\n";
myfile << this->resolution.width << " " << this->resolution.height << "\n";
} else {
myfile << "P2" << "\n";
myfile << this->resolution.width << " " << this->resolution.height << "\n";
myfile << this->level << "\n";
}
int counter = 0;
for (int i = 0; i < resolution.height; i++) {
for (int j = 0; j < resolution.width; j++) {
myfile << this->pixel[i][j] << " ";
counter++;
if (counter >= 17) {
myfile << "\n";
counter = 0;
}
}
}
myfile.close();
qInfo("saved");
}
float ** Monochrome::initPixel(int h, int w) {
float ** p = new float*[h];
for (int i = 0; i < h; i++) {
p[i] = new float[w];
for (int j = 0; j < w; j++) {
p[i][j] = 0;
}
}
return p;
}
string Monochrome::toString() {
string i = Image::toString();
stringstream ss;
ss << i << "\nMonochrome\nLevel = " << this->level << "\nPixel" << endl;
for (int i = 0; i < resolution.height; i++) {
for (int j = 0; j < resolution.width; j++) {
ss << pixel[i][j] << " ";
}
ss << "\n";
}
return ss.str();
}
Monochrome Monochrome::negative() {
Monochrome mNew(
this->imageFormat,
this->imageType,
this->resolution,
this->level
);
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
mNew.pixel[i][j] = this->level - this->pixel[i][j];
}
}
return mNew;
}
Monochrome Monochrome::brightening(float b, Operation o) {
Monochrome mNew(
this->imageFormat,
this->imageType,
this->resolution,
this->level
);
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
short temp;
switch (o) {
case (Operation::ADD) : {
temp = (short) (this->pixel[i][j] + b);
break;
}
case (Operation::SUBTRACT) : {
temp = (short) (this->pixel[i][j] - b);
break;
}
case (Operation::MULTIPLY) : {
temp = (short) (this->pixel[i][j] * b);
break;
}
case (Operation::DIVISION) : {
temp = (short) ((float) this->pixel[i][j] / b);
break;
}
}
mNew.pixel[i][j] = Image::clipping(temp, level);
}
}
return mNew;
}
Monochrome Monochrome::operation(Monochrome *m, Operation o, short level) {
// check if same
if (!Image::sameResolution(this->resolution, m->resolution)) {
throw "Images have different resolution";
}
Monochrome mNew(
ImageFormat::NONE,
level == 1 ? ImageType::BINARY : ImageType::GRAYSCALE,
this->resolution,
level
);
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
short temp;
switch (o) {
case (Operation::ADD) : {
temp = this->pixel[i][j] + m->pixel[i][j];
break;
}
case (Operation::SUBTRACT) : {
temp = this->pixel[i][j] - m->pixel[i][j];
break;
}
case (Operation::MULTIPLY) : {
temp = this->pixel[i][j] * m->pixel[i][j];
break;
}
case (Operation::AND) : {
temp = this->pixel[i][j] & m->pixel[i][j];
break;
}
case (Operation::OR) : {
temp = this->pixel[i][j] | m->pixel[i][j];
break;
}
case (Operation::ADD_ABS) : {
temp = abs(this->pixel[i][j]) + abs(m->pixel[i][j]);
break;
}
case (Operation::DIVISION) : {
temp = (short) (float)this->pixel[i][j] / m->pixel[i][j];
break;
}
default : {
break;
}
}
mNew.pixel[i][j] = Image::clipping(temp, level);
}
}
return mNew;
}
Monochrome Monochrome::translastion(int m, int n) {
Monochrome mNew(
this->imageFormat,
this->imageType,
this->resolution,
this->level
);
int tempY = -n;
for (int i = 0; i < resolution.height; i++) {
int tempX = m;
for (int j = 0; j < resolution.width; j++) {
if (tempX >= 0 && tempX < resolution.width && tempY >= 0 && tempY < resolution.height) {
mNew.pixel[tempY][tempX] = this->pixel[i][j];
}
tempX++;
}
tempY++;
}
return mNew;
}
Monochrome Monochrome::geometry(Geometry geo) {
Resolution newResolution;
switch (geo) {
case (Geometry::ROTATION_90) :
case (Geometry::ROTATION_270) :
case (Geometry::MIRROR_X_Y) : {
newResolution.height = this->resolution.width;
newResolution.width = this->resolution.height;
break;
}
default : {
newResolution.height = this->resolution.height;
newResolution.width = this->resolution.width;
break;
}
}
Monochrome mNew(
this->imageFormat,
this->imageType,
newResolution,
this->level
);
int p = resolution.height - 1;
for (int i = 0; i < resolution.height; i++, p--) {
int q = resolution.width - 1;
for (int j = 0; j < resolution.width; j++, q--) {
switch (geo) {
case (Geometry::ROTATION_0) : {
mNew.pixel[i][j] = this->pixel[i][j];
break;
}
case (Geometry::ROTATION_90) : {
mNew.pixel[q][p] = this->pixel[i][j];
break;
}
case (Geometry::ROTATION_180) : {
mNew.pixel[p][q] = this->pixel[i][j];
break;
}
case (Geometry::ROTATION_270) : {
mNew.pixel[q][i] = this->pixel[i][j];
break;
}
case (Geometry::FLIPPING_HORIZONTAL) : {
mNew.pixel[i][q] = this->pixel[i][j];
break;
}
case (Geometry::FLIPPING_VERTICAL) : {
mNew.pixel[p][j] = this->pixel[i][j];
break;
}
case (Geometry::MIRROR_CARTESIAN) : {
mNew.pixel[p][q] = this->pixel[i][j];
break;
}
case (Geometry::MIRROR_X_Y) : {
mNew.pixel[j][i] = this->pixel[i][j];
break;
}
default: {
break;
}
}
}
}
return mNew;
}
Histogram Monochrome::generateHistogram() {
Histogram histogram;
histogram.size = this->level + 1;
histogram.value = new int[histogram.size];
histogram.norm = new float[histogram.size];
long totalPixel = this->resolution.height * this->resolution.width;
histogram.total = totalPixel;
for (int i = 0; i < histogram.size; i++) {
histogram.value[i] = 0;
}
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
histogram.value[this->pixel[i][j]] += 1;
}
}
int temp = 0;
long sum = 0;
for (int i = 0; i < histogram.size; i++) {
temp = histogram.value[i] > temp ? histogram.value[i] : temp;
sum += histogram.value[i] * i;
histogram.norm[i] = (float) histogram.value[i] / totalPixel;
}
histogram.max = temp;
histogram.mean = (float) sum / totalPixel;
double var = 0;
for (int i = 0; i < histogram.size; i++) {
var += pow(i - histogram.mean, 2) * histogram.value[i];
}
histogram.var = (float) var/totalPixel;
histogram.std = pow(histogram.var, 0.5);
return histogram;
}
Monochrome Monochrome::convolution(Convolution c, Padding pad, int size, float** kernel) {
qInfo("convol");
Monochrome mNew(
ImageFormat::NONE,
this->imageType,
this->resolution,
this->level
);
if (size % 2 != 1) {
throw "kernel must be odd";
}
int offset = (size - 1) / 2;
int length = size * size;
short * array = new short[length];
qInfo("convol");
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
if (i >= offset && j >= offset && i < this->resolution.height - offset && j < this->resolution.width - offset) {
float temp = 0;
int m = 0;
for (int p = i - offset; m < size; p++, m++) {
int n = 0;
for (int q = j - offset; n < size; q++, n++) {
switch (c) {
case (Convolution::NO_CLIPPING) :
case (Convolution::BASIC) : {
temp += this->pixel[p][q] * kernel[m][n];
break;
}
case (Convolution::MEDIAN) : {
array[m * size + n] = this->pixel[p][q];
break;
}
}
}
}
switch (c) {
case (Convolution::NO_CLIPPING) : {
mNew.pixel[i][j] = (short) temp;
break;
}
case (Convolution::BASIC) : {
mNew.pixel[i][j] = Image::clipping((short) temp, this->level);
break;
}
case (Convolution::MEDIAN) : {
sort(array, array + length);
mNew.pixel[i][j] = array[((length - 1)/2)];
break;
}
}
} else {
switch (pad) {
case (Padding::SAME) : {
mNew.pixel[i][j] = this->pixel[i][j];
break;
}
}
}
}
}
qInfo("convol end");
return mNew;
}
Monochrome Monochrome::convolutionTopLeft(Convolution c, int sizeX, int sizeY, float** kernel) {
Monochrome mNew(
this->imageFormat,
this->imageType,
this->resolution,
this->level
);
for (int i = 0; i < this->resolution.height - sizeX; i++) {
for (int j = 0; j < this->resolution.width - sizeY; j++) {
float temp = 0;
for (int p = 0; p < sizeX; p++) {
for (int q = 0; q < sizeY; q++) {
temp += this->pixel[i + p][j + q] * kernel[p][q];
}
}
switch (c) {
case (Convolution::NO_CLIPPING) : {
mNew.pixel[i][j] = (short) temp;
break;
}
default : {
mNew.pixel[i][j] = Image::clipping((short) temp, this->level);
break;
}
}
}
}
return mNew;
}
Monochrome Monochrome::sharpening(Monochrome * lowPass, float alpha) {
Monochrome highPass = this->operation(lowPass, Operation::SUBTRACT, this->level);
Monochrome sharp = (this->brightening(alpha, Operation::MULTIPLY)).operation(&highPass, Operation::ADD, this->level);
return sharp;
}
Monochrome Monochrome::histogramLeveling() {
Histogram h = this->generateHistogram();
Mapping m = Image::histogramStretching(h);
Monochrome mNew(
this->imageFormat,
this->imageType,
this->resolution,
this->level
);
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
mNew.pixel[i][j] = m.value[this->pixel[i][j]];
}
}
return mNew;
}
Monochrome Monochrome::histogramSpecification(Histogram h) {
Histogram h2 = this->generateHistogram();
if (h2.size != h.size) {
throw "Have different size";
}
Mapping m1 = Image::histogramStretching(h);
Mapping m2 = Image::histogramStretching(h2);
Monochrome mNew(
this->imageFormat,
this->imageType,
this->resolution,
this->level
);
float * cumulative = new float[m1.size];
float inc = 0;
for (int i = 0; i < m1.size; i++) {
inc += m1.real[i];
cumulative[i] = inc;
}
short * newMapping = new short[m1.size];
// make new mapping
for (int i = 0; i < m2.size; i++) {
float min_delta = 0;
float nearest = -1;
for (int j = 0; j < m1.size; j++) {
float temp = abs(m2.value[i] - m1.real[j]);
if (nearest < 0) {
min_delta = temp;
nearest = m1.real[j];
} else if (temp < min_delta) {
min_delta = temp;
nearest = m1.real[j];
}
}
newMapping[i] = round(nearest);
}
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
mNew.pixel[i][j] = newMapping[this->pixel[i][j]];
}
}
return mNew;
}
Monochrome Monochrome::zoom(bool in) {
if (in) {
Resolution rNew;
rNew.height = this->resolution.height * 2;
rNew.width= this->resolution.width * 2;
Monochrome mNew(
this->imageFormat,
this->imageType,
rNew,
this->level
);
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
mNew.pixel[i * 2][j * 2] = this->pixel[i][j];
mNew.pixel[i * 2 + 1][j * 2] = this->pixel[i][j];
mNew.pixel[i * 2][j * 2 + 1] = this->pixel[i][j];
mNew.pixel[i * 2 + 1][j * 2 + 1] = this->pixel[i][j];
}
}
return mNew;
} else {
Resolution rNew;
rNew.height = this->resolution.height / 2;
rNew.width= this->resolution.width / 2;
Monochrome mNew(
this->imageFormat,
this->imageType,
rNew,
this->level
);
for (int i = 0; i < this->resolution.height - 1; i += 2) {
for (int j = 0; j < this->resolution.width - 1; j += 2) {
mNew.pixel[i / 2][j / 2] = (short) ((
this->pixel[i][j] +
this->pixel[i + 1][j] +
this->pixel[i][j + 1] +
this->pixel[i + 1][j + 1]) / 4.0);
}
}
return mNew;
}
}
Monochrome Monochrome::showBoundaryBox(Monochrome * m, float rat_top, float rat_bot) {
qInfo("boundary box");
if (!Image::sameResolution(this->resolution, m->resolution)) {
throw "Images have different resolution";
}
Monochrome mNew(*this);
short ** box = new short*[m->level];
for (int i = 0; i < m->level; i++) {
box[i] = new short[4];
for (int j = 0; j < 4; j++) {
box[i][j] = -1;
}
}
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
if (m->pixel[i][j] != 0) {
short t = m->pixel[i][j];
// qInfo(to_string(t).c_str());
if (box[t][0] == -1) {
box[t][0] = i;
box[t][1] = j;
box[t][2] = i;
box[t][3] = j;
}
if (box[t][0] > i) {
box[t][0] = i;
}
if (box[t][1] > j) {
box[t][1] = j;
}
if (box[t][2] < i) {
box[t][2] = i;
}
if (box[t][3] < j) {
box[t][3] = j;
}
}
}
}
for (int k = 0; k < m->level; k++) {
if (box[k][0] != -1) {
// qInfo((to_string(box[k][0]) + " " + to_string(box[k][2])).c_str());
float ratio = (float) (box[k][3] - box[k][1]) / (box[k][2] - box[k][0]);
if ((ratio > rat_bot && ratio < rat_top) || (rat_bot < 0)) {
for (int i = box[k][0]; i <= box[k][2]; i++) {
for (int j = box[k][1]; j <= box[k][3]; j++) {
if (i == box[k][0] || i == box[k][2]) {
mNew.pixel[i][j] = 1;
}
if (j == box[k][1] || j == box[k][3]) {
mNew.pixel[i][j] = 1;
}
}
}
}
}
}
return mNew;
}
vector<Monochrome*> Monochrome::boundaryBox(Monochrome * m, Monochrome * real, float rat_top, float rat_bot) {
qInfo("boundary box");
if (!Image::sameResolution(this->resolution, m->resolution)) {
throw "Images have different resolution";
}
Monochrome mNew(*this);
qInfo("boundary box");
short ** box = new short*[m->level];
for (int i = 0; i < m->level; i++) {
box[i] = new short[4];
for (int j = 0; j < 4; j++) {
box[i][j] = -1;
}
}
qInfo("boundary box");
qInfo(to_string(m->level).c_str());
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
if (m->pixel[i][j] != 0) {
short t = m->pixel[i][j];
// qInfo(to_string(t).c_str());
if (box[t][0] == -1) {
box[t][0] = i;
box[t][1] = j;
box[t][2] = i;
box[t][3] = j;
}
if (box[t][0] > i) {
box[t][0] = i;
}
if (box[t][1] > j) {
box[t][1] = j;
}
if (box[t][2] < i) {
box[t][2] = i;
}
if (box[t][3] < j) {
box[t][3] = j;
}
}
}
}
qInfo("boundary box");
vector<Monochrome*> vec;
for (int k = 0; k < m->level; k++) {
if (box[k][0] != -1) {
// qInfo((to_string(box[k][0]) + " " + to_string(box[k][2])).c_str());
float ratio = (float) (box[k][3] - box[k][1]) / (box[k][2] - box[k][0]);
if ((ratio > rat_bot && ratio < rat_top) || (rat_bot < 0)) {
// for (int i = box[k][0]; i <= box[k][2]; i++) {
// for (int j = box[k][1]; j <= box[k][3]; j++) {
// if (i == box[k][0] || i == box[k][2]) {
// mNew.pixel[i][j] = 1;
// }
// if (j == box[k][1] || j == box[k][3]) {
// mNew.pixel[i][j] = 1;
// }
// }
// }
Resolution resTop, resBot;
resTop.height = box[k][0];
resTop.width = box[k][1];
resBot.height = box[k][2];
resBot.width = box[k][3];
vec.push_back(new Monochrome(*real, resTop, resBot));
}
}
}
qInfo("boundary box");
return vec;
}
int Monochrome::boundaryBoxCount(Monochrome * m, float rat_top, float rat_bot) {
qInfo("boundary box");
if (!Image::sameResolution(this->resolution, m->resolution)) {
throw "Images have different resolution";
}
int middle = this->resolution.height / 3;
Monochrome mNew(*this);
qInfo("boundary box");
short ** box = new short*[m->level];
for (int i = 0; i < m->level; i++) {
box[i] = new short[4];
for (int j = 0; j < 4; j++) {
box[i][j] = -1;
}
}
qInfo("boundary box");
qInfo(to_string(m->level).c_str());
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
if (m->pixel[i][j] != 0) {
short t = m->pixel[i][j];
// qInfo(to_string(t).c_str());
if (box[t][0] == -1) {
box[t][0] = i;
box[t][1] = j;
box[t][2] = i;
box[t][3] = j;
}
if (box[t][0] > i) {
box[t][0] = i;
}
if (box[t][1] > j) {
box[t][1] = j;
}
if (box[t][2] < i) {
box[t][2] = i;
}
if (box[t][3] < j) {
box[t][3] = j;
}
}
}
}
qInfo("boundary box");
int count = 0;
for (int k = 0; k < m->level; k++) {
if (box[k][0] != -1) {
float ratio = (float) (box[k][3] - box[k][1]) / (box[k][2] - box[k][0]);
if (((ratio > rat_bot && ratio < rat_top) || (rat_bot < 0)) && (box[k][0] < middle && box[k][2] > middle)) {
count++;
}
}
}
qInfo("boundary box");
return count;
}
vector<Monochrome*> Monochrome::boundaryBoxPlate(Monochrome * m, float rat_top, float rat_bot) {
qInfo("boundary box");
if (!Image::sameResolution(this->resolution, m->resolution)) {
throw "Images have different resolution";
}
int middle = this->resolution.height / 3;
Monochrome mNew(*this);
qInfo("boundary box");
short ** box = new short*[m->level];
for (int i = 0; i < m->level; i++) {
box[i] = new short[4];
for (int j = 0; j < 4; j++) {
box[i][j] = -1;
}
}
qInfo("boundary box");
qInfo(to_string(m->level).c_str());
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
if (m->pixel[i][j] != 0) {
short t = m->pixel[i][j];
// qInfo(to_string(t).c_str());
if (box[t][0] == -1) {
box[t][0] = i;
box[t][1] = j;
box[t][2] = i;
box[t][3] = j;
}
if (box[t][0] > i) {
box[t][0] = i;
}
if (box[t][1] > j) {
box[t][1] = j;
}
if (box[t][2] < i) {
box[t][2] = i;
}
if (box[t][3] < j) {
box[t][3] = j;
}
}
}
}
qInfo("boundary box");
vector<Monochrome*> vec;
vector<int> res_width;
vector<int> boun_height;
for (int k = 0; k < m->level; k++) {
if (box[k][0] != -1) {
// qInfo((to_string(box[k][0]) + " " + to_string(box[k][2])).c_str());
float ratio = (float) (box[k][3] - box[k][1]) / (box[k][2] - box[k][0]);
if (((ratio > rat_bot && ratio < rat_top) || (rat_bot < 0)) && (box[k][0] < middle && box[k][2] > middle)) {
// for (int i = box[k][0]; i <= box[k][2]; i++) {
// for (int j = box[k][1]; j <= box[k][3]; j++) {
// if (i == box[k][0] || i == box[k][2]) {
// mNew.pixel[i][j] = 1;
// }
// if (j == box[k][1] || j == box[k][3]) {
// mNew.pixel[i][j] = 1;
// }
// }
// }
Resolution resTop, resBot;
resTop.height = box[k][0];
resTop.width = box[k][1];
resBot.height = box[k][2];
resBot.width = box[k][3];
vec.push_back(new Monochrome(*this, resTop, resBot));
res_width.push_back(resTop.width);
boun_height.push_back(resBot.height - resTop.height);
}
}
}
qInfo("boundary box");
vector<int> deletedIndex;
int boun_size = boun_height.size() - 1;
if (boun_size > 0) {
for (int i = boun_height.size() - 1; i >= 0; i--) {
int count = 0;
for (int j = 0; j < boun_height.size(); j++) {
count += abs (boun_height[i] - boun_height[j]);
}
qInfo(to_string(count / boun_size).c_str());
qInfo(to_string(this->resolution.height / 5).c_str());
if (count / boun_size > (this->resolution.height / 5)) {
deletedIndex.push_back(i);
}
}
}
qInfo("boundary box");
for (int i = 0; i < deletedIndex.size(); i++) {
vec.erase(vec.begin() + deletedIndex[i]);
res_width.erase(res_width.begin() + deletedIndex[i]);
}
qInfo("boundary box");
vector<Monochrome*> vec2;
while (vec.size() > 0) {
int min_x = -1;
int min_idx = -1;
for (int i = 0; i < vec.size(); i++) {
if (i == 0) {
min_x = res_width[i];
min_idx = i;
}
if (min_x > res_width[i]) {
min_x = res_width[i];
min_idx = i;
}
}
vec2.push_back(vec[min_idx]);
vec.erase(vec.begin() + min_idx);
res_width.erase(res_width.begin() + min_idx);
}
qInfo("boundary box");
return vec2;
}
Monochrome Monochrome::resizePixels(Resolution res) {
Monochrome mNew(
this->imageFormat,
this->imageType,
res,
this->level
);
// EDIT: added +1 to account for an early rounding problem
int x_ratio = (int)((this->resolution.width << 16) / res.width) + 1;
int y_ratio = (int)((this->resolution.height << 16) / res.height) + 1;
//int x_ratio = (int)((w1<<16)/w2) ;
//int y_ratio = (int)((h1<<16)/h2) ;
int x2, y2 ;
for (int i = 0;i < res.height; i++) {
for (int j = 0; j < res.width; j++) {
x2 = ((j * x_ratio)>>16) ;
y2 = ((i * y_ratio)>>16) ;
mNew.pixel[i][j] = this->pixel[y2][x2] ;
}
}
return mNew;
}
Monochrome Monochrome::hough(int threshold) {
Resolution res_P;
res_P.height = 301;
res_P.width = 181;
Monochrome P(
ImageFormat::NONE,
ImageType::GRAYSCALE,
res_P,
255
);
float DEG2RAD = 3.14159265/180;
// init sin and cos
float * t_sin = new float[181];
float * t_cos = new float[181];
for (int i = 0; i < res_P.height; i++) {
t_sin[i] = sin((i * 180.0 / (res_P.height - 1) - 90) * DEG2RAD);
t_cos[i] = cos((i * 180.0 / (res_P.height - 1) - 90) * DEG2RAD);
}
float SQRTD = sqrt(pow(this->resolution.width, 2) + pow(this->resolution.height, 2));
int max_l = 0;
for (int i = 0; i < this->resolution.height; i++) {
for (int j = 0; j < this->resolution.width; j++) {
if (this->pixel[i][j] == 1) {
for (int k = 0; k < res_P.height; k++) {
float r = i * t_cos[k] + j * t_sin[k];
float b = SQRTD;
r += b; r /= (SQRTD * 2.0); r *= (res_P.width - 1); r += 0.5;
int l = floor(r);
if (max_l < l) {
max_l = l;
}
P.pixel[k][l]++;
}
}
}
}
Monochrome bp (
ImageFormat::NONE,
ImageType::BINARY,
res_P,
1
);
int max2 = 0;
for (int i = 0; i < res_P.height; i++) {
for (int j = 0; j < res_P.width; j++) {
if (P.pixel[i][j] > max2) {
max2 = P.pixel[i][j];
}
if (P.pixel[i][j] > threshold) {
bp.pixel[i][j] = 1;
} else {
bp.pixel[i][j] = 0;
}
}
}
qInfo(to_string(max2).c_str());
Monochrome res(
ImageFormat::NONE,
ImageType::BINARY,
this->resolution,
1
);
for (int i = 0; i < res_P.height; i++) {
for (int j = 0; j < res_P.width; j++) {
float y = 0;
if (bp.pixel[i][j] == 1) {
for (int k = 0; k < this->resolution.height; k++) {
float r = j * 2.0 * SQRTD / (res_P.width - 1) - SQRTD;
if (t_sin[i] <= 0.0000001 && t_sin[i] >= - 0.0000001) {
y += 1;
} else {
y = (r - k * t_cos[i]) / t_sin[i];
}
y += 0.5;
int l = floor(y);
if (l >= 0 && l < this->resolution.width) {
if (this->pixel[k][l] == 1) {
res.pixel[k][l] = 1;
}
}
}
}
}
}
return res;
}
| [
"m.alif.arifin@gmail.com"
] | m.alif.arifin@gmail.com |
901fa935773e853e20ee38652269de1cae6da9d6 | f76a85d09fae8151dd38a8a349529a456f50ab35 | /3.二叉树/lab3-1.cpp | d2d151ac53e71b4639800d7e833fa7d4a331e9d8 | [] | no_license | lofon/date_structure_experiment | 20e0662f0f8a64f9dcbaaa4ef1feaaeb4c4f4b03 | 4e68bd26164ed5a486e87358de62c5cfbadcdcce | refs/heads/master | 2020-05-03T12:33:53.147845 | 2019-04-21T14:00:20 | 2019-04-21T14:00:20 | 178,629,921 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,658 | cpp | //lab3-1.cpp
/////////////////////////////////written by lofone at 2018/11/06////////////////////////////////////
#include<stdio.h>
#include<malloc.h>
#define OK 1
#define ERROR 0
typedef int Status;
typedef char TElemType;
//--------------二叉链表存储表述-----------------
typedef struct BiTNode
{
TElemType data; //数据域
struct BiTNode *lchild, *rchild;
/*左右孩子结点*/
}BiTNode, *BiTree;
//---------------基本操作函数原型-----------------
Status InitBiTree(BiTree&);
Status CreateBiTree(BiTree&);
Status PreOrderTraverse(BiTree&); //先序
Status InOrderTraverse(BiTree&); //中序
Status PostOrderTraverse(BiTree&); //后序
int main()
{
BiTree Tree = NULL;
InitBiTree(Tree);
printf("Input some elements to create a Binary Tree : ");
CreateBiTree(Tree);
printf("-------------------------------------------------\n");
printf("Input a number to start<0-3> \n");
/*一直循环，输入 0 跳出*/
while (1)
{
static int n;
printf("\n-------------------------------------------------\n");
printf("1: PreOrderTraverse\n2: InOrderTraverse\n3: PostOrderTraverse\n0:EXIT!\n");
scanf_s("%d", &n);
switch (n)
{
case 1: printf("The preorder is : "); PreOrderTraverse(Tree); break;
case 2:printf("The midorder is : "); InOrderTraverse(Tree); break;
case 3:printf("The backorder is :"); PostOrderTraverse(Tree); break;
case 0: printf("Done ! Press any keys to Exit\n"); goto sign;
default: printf("ERROR ! Please input the right number<0-3> : "); break;
}
}
sign: getchar();
return OK;
}
//---------------基本操作函数定义------------------
Status InitBiTree(BiTree &T)
{
//构造空树
T = (BiTree)malloc(sizeof(BiTNode));
T->lchild = NULL;
T->rchild = NULL;
return OK;
}
Status CreateBiTree(BiTree &T)
{
char e;
scanf_s("%c", &e);
if (e == '#') T = NULL;
else
InitBiTree(T);
if (!T) return ERROR; //创建失败
else //递归创建 //先序
{
T->data = e; //根
CreateBiTree(T->lchild); //左子树
CreateBiTree(T->rchild); //右子树
}
return OK;
}
Status PreOrderTraverse(BiTree &T) //先序
{
if (T != NULL)
{
printf("%c ", T->data);
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}
return OK;
}
Status InOrderTraverse(BiTree &T) /*中序遍历二叉树函数*/
{
if (T != NULL)
{
InOrderTraverse(T->lchild); //左子树
printf("%c ", T->data); //根
InOrderTraverse(T->rchild); //右子树
}
return OK;
}
Status PostOrderTraverse(BiTree &T) //后序
{
if (T != NULL)
{
PostOrderTraverse(T->lchild); //遍历左子树
PostOrderTraverse(T->rchild); //遍历右子树
printf("%c", T->data); //根
}
return OK;
}
| [
"noreply@github.com"
] | lofon.noreply@github.com |
006d55db63a40d8c6bd61e4da7c0bf0406c777fc | 49fc8b067bc2ded6ef050255c14370638f4e8962 | /CS202/lab5/Person.cpp | 60d3fb3800fc08eabd2ca8e43941683664454b21 | [] | no_license | tleek135/university | c6c33820849e0e3c589f3696a0a9be5da097c1b9 | e9abeb26893cf8a2abe2c54bc41bfa9feb7428dd | refs/heads/master | 2021-01-02T09:09:47.830661 | 2017-08-02T18:30:55 | 2017-08-02T18:30:55 | 99,148,748 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,890 | cpp | /********************************************************************
* Kyle Lee
* Person.cpp
* May 6, 2015
* CSE 202 (Wednesday lab)
* Description: Implement functions found in Person.h file
* Solution: Include constructors to initialize values (name, DOB, gender)
and a print function to display these values
* Percent complete: 100%
********************************************************************/
#include <string>
#include <iostream>
#include "Person.h"
using namespace std;
//Default constructor
Person::Person(): name(""), dob(""), gender("") { }
// don't delete the following line as it's needed to preserve source code of this autogenerated element
// section -117--74--108--126-566dc4d1:14d2b87c0eb:-8000:000000000000087B begin
// section -117--74--108--126-566dc4d1:14d2b87c0eb:-8000:000000000000087B end
// don't delete the previous line as it's needed to preserve source code of this autogenerated element
//Constructor that initializes name, DOB, and gender
Person::Person(string n, string d, string g): name(n), dob(d), gender(g) { }
// don't delete the following line as it's needed to preserve source code of this autogenerated element
// section -117--74--108--126-566dc4d1:14d2b87c0eb:-8000:000000000000087E begin
// section -117--74--108--126-566dc4d1:14d2b87c0eb:-8000:000000000000087E end
// don't delete the previous line as it's needed to preserve source code of this autogenerated element
//Prints name and DOB
void Person::print() { cout << name << " " << dob << endl; }
// don't delete the following line as it's needed to preserve source code of this autogenerated element
// section -117--74--108--126-566dc4d1:14d2b87c0eb:-8000:0000000000000893 begin
// section -117--74--108--126-566dc4d1:14d2b87c0eb:-8000:0000000000000893 end
// don't delete the previous line as it's needed to preserve source code of this autogenerated element
| [
"kylel365@yahoo.com"
] | kylel365@yahoo.com |
663b23a35ed1b01f1e7adf9034e2abd0578ddf9c | 0c360ce74a4b3f08457dd354a6d1ed70a80a7265 | /src/components/policy/include/policy/user_consent_manager.h | 55c6239a6c2666fb6bbd2f051d1c25f013c2f152 | [] | permissive | APCVSRepo/sdl_implementation_reference | 917ef886c7d053b344740ac4fc3d65f91b474b42 | 19be0eea481a8c05530048c960cce7266a39ccd0 | refs/heads/master | 2021-01-24T07:43:52.766347 | 2017-10-22T14:31:21 | 2017-10-22T14:31:21 | 93,353,314 | 4 | 3 | BSD-3-Clause | 2022-10-09T06:51:42 | 2017-06-05T01:34:12 | C++ | UTF-8 | C++ | false | false | 1,862 | h | /*
Copyright (c) 2013, Ford Motor Company
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following
disclaimer in the documentation and/or other materials provided with the
distribution.
Neither the name of the Ford Motor Company nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef SRC_COMPONENTS_POLICY_INCLUDE_POLICY_USER_CONSENT_MANAGER_H_
#define SRC_COMPONENTS_POLICY_INCLUDE_POLICY_USER_CONSENT_MANAGER_H_
namespace policy {
class UserConsentManager {
public:
UserConsentManager() {}
~UserConsentManager() {}
};
} // namespace policy
#endif // SRC_COMPONENTS_POLICY_INCLUDE_POLICY_USER_CONSENT_MANAGER_H_
| [
"luwanjia@aliyun.com"
] | luwanjia@aliyun.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.