blob_id
stringlengths 40
40
| directory_id
stringlengths 40
40
| path
stringlengths 4
201
| content_id
stringlengths 40
40
| detected_licenses
listlengths 0
85
| license_type
stringclasses 2
values | repo_name
stringlengths 7
100
| snapshot_id
stringlengths 40
40
| revision_id
stringlengths 40
40
| branch_name
stringclasses 260
values | visit_date
timestamp[us] | revision_date
timestamp[us] | committer_date
timestamp[us] | github_id
int64 11.4k
681M
⌀ | star_events_count
int64 0
209k
| fork_events_count
int64 0
110k
| gha_license_id
stringclasses 17
values | gha_event_created_at
timestamp[us] | gha_created_at
timestamp[us] | gha_language
stringclasses 80
values | src_encoding
stringclasses 28
values | language
stringclasses 1
value | is_vendor
bool 1
class | is_generated
bool 2
classes | length_bytes
int64 8
9.86M
| extension
stringclasses 52
values | content
stringlengths 8
9.86M
| authors
listlengths 1
1
| author
stringlengths 0
119
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f680a65a3da9297684981748b84cefbadce95866 | baa1ae2afa8968d726f8cfd12135f8f9b691832e | /code/game-bcity/src/entities/tanks/EnemyTank.h | d3f67abd66cf98c58768f8d2cf05d98ba09075c0 | [] | no_license | germix/germix-games | ffaf1ebb360c389463a7438ee3c6cc33b031280c | db315cd54f06a7a646bc6789b9651ef39816643d | refs/heads/master | 2022-04-05T07:32:56.040835 | 2019-11-19T11:06:03 | 2019-11-19T11:06:03 | 222,627,542 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 1,789 | h | ////////////////////////////////////////////////////////////////////////////////////////////////////
//
// EnemyTank
//
// Germán Martínez
//
////////////////////////////////////////////////////////////////////////////////////////////////////
#ifndef ___EnemyTank_h___
#define ___EnemyTank_h___
#include <src/entities/Tank.h>
#include <vector>
#include <gamelib/TimeClock.h>
class EnemyTank : public Tank
{
static const double MOVE_TIME_TANK_1;
static const double MOVE_TIME_TANK_2;
static const double MOVE_TIME_TANK_3;
static const double MOVE_TIME_TANK_4;
static const Direction allDirections[];
TimeClock moveClock;
TimeClock shootClock;
bool dead;
int health;
int deadScore;
bool canDropBonus;
TimeClock blinkBonusClock;
int blinkBonusIndex;
TimeClock blinkTank4Clock;
int blinkTank4Index;
int lastTankColor;
public:
EnemyTank(Map* m, Scene* s, int x, int y, int model, bool bonus = false);
~EnemyTank();
public:
void update(double dt);
void render(Graphics* gr);
//!
//! Generar un daño al tanque
//!
void hurt();
//!
//! Matar completamente al tanque
//!
void kill();
//!
//! Comprobar si está muerto
//!
//! \return true si está muerto, falso en caso contrario
//!
bool isDead() const
{
return dead;
}
//!
//! Obtener el puntaje que se debe incrementar al héroe cuando se elimina al tanque enemigo
//!
//! \return Puntaje
//!
int getDeadScore() const
{
return deadScore;
}
//!
//! Obtener el tipo de tanque enemigo (0 ... 3)
//!
//! \return Tipo de tanque enemigo
//!
int getTankEnemyType() const
{
return (tankModel-TANK_MODEL_ENEMY_1);
}
private:
void shoot();
bool move(Direction dir);
std::vector<Direction> getRandomDirections(Direction thisNot) const;
};
#endif
| [
"[email protected]"
] | |
6c50b59670b7f74e3b0137408f2e58bd16b38bb1 | 8567438779e6af0754620a25d379c348e4cd5a5d | /ui/views/mus/views_mus_test_suite.cc | 0812025fd782545e8c2c5463d779bccc9cd155e9 | [
"BSD-3-Clause"
] | permissive | thngkaiyuan/chromium | c389ac4b50ccba28ee077cbf6115c41b547955ae | dab56a4a71f87f64ecc0044e97b4a8f247787a68 | refs/heads/master | 2022-11-10T02:50:29.326119 | 2017-04-08T12:28:57 | 2017-04-08T12:28:57 | 84,073,924 | 0 | 1 | BSD-3-Clause | 2022-10-25T19:47:15 | 2017-03-06T13:04:15 | null | UTF-8 | C++ | false | false | 8,918 | cc | // 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.
#include "ui/views/mus/views_mus_test_suite.h"
#include <memory>
#include <string>
#include "base/command_line.h"
#include "base/files/file_path.h"
#include "base/memory/ptr_util.h"
#include "base/run_loop.h"
#include "base/synchronization/waitable_event.h"
#include "base/threading/simple_thread.h"
#include "base/threading/thread.h"
#include "mojo/edk/embedder/embedder.h"
#include "mojo/edk/embedder/scoped_ipc_support.h"
#include "services/catalog/catalog.h"
#include "services/service_manager/background/background_service_manager.h"
#include "services/service_manager/public/cpp/connector.h"
#include "services/service_manager/public/cpp/service.h"
#include "services/service_manager/public/cpp/service_context.h"
#include "services/ui/common/switches.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "ui/aura/mus/window_tree_host_mus.h"
#include "ui/aura/test/env_test_helper.h"
#include "ui/aura/window.h"
#include "ui/gl/gl_switches.h"
#include "ui/views/mus/desktop_window_tree_host_mus.h"
#include "ui/views/mus/mus_client.h"
#include "ui/views/mus/test_utils.h"
#include "ui/views/test/platform_test_helper.h"
#include "ui/views/test/views_test_helper_aura.h"
#include "ui/views/views_delegate.h"
#include "ui/views/widget/desktop_aura/desktop_native_widget_aura.h"
namespace views {
namespace {
const base::FilePath::CharType kCatalogFilename[] =
FILE_PATH_LITERAL("views_mus_tests_catalog.json");
void EnsureCommandLineSwitch(const std::string& name) {
base::CommandLine* cmd_line = base::CommandLine::ForCurrentProcess();
if (!cmd_line->HasSwitch(name))
cmd_line->AppendSwitch(name);
}
class DefaultService : public service_manager::Service {
public:
DefaultService() {}
~DefaultService() override {}
// service_manager::Service:
bool OnConnect(const service_manager::ServiceInfo& remote_info,
service_manager::InterfaceRegistry* registry) override {
return false;
}
private:
DISALLOW_COPY_AND_ASSIGN(DefaultService);
};
class PlatformTestHelperMus : public PlatformTestHelper {
public:
PlatformTestHelperMus(service_manager::Connector* connector,
const service_manager::Identity& identity) {
aura::test::EnvTestHelper().SetWindowTreeClient(nullptr);
// It is necessary to recreate the MusClient for each test,
// since a new MessageLoop is created for each test.
mus_client_ = test::MusClientTestApi::Create(connector, identity);
}
~PlatformTestHelperMus() override {
aura::test::EnvTestHelper().SetWindowTreeClient(nullptr);
}
// PlatformTestHelper:
void OnTestHelperCreated(ViewsTestHelper* helper) override {
static_cast<ViewsTestHelperAura*>(helper)->EnableMusWithWindowTreeClient(
mus_client_->window_tree_client());
}
void SimulateNativeDestroy(Widget* widget) override {
aura::WindowTreeHostMus* window_tree_host =
static_cast<aura::WindowTreeHostMus*>(
widget->GetNativeView()->GetHost());
static_cast<aura::WindowTreeClientDelegate*>(mus_client_.get())
->OnEmbedRootDestroyed(window_tree_host);
}
private:
std::unique_ptr<MusClient> mus_client_;
DISALLOW_COPY_AND_ASSIGN(PlatformTestHelperMus);
};
std::unique_ptr<PlatformTestHelper> CreatePlatformTestHelper(
const service_manager::Identity& identity,
const base::Callback<service_manager::Connector*(void)>& callback) {
return base::MakeUnique<PlatformTestHelperMus>(callback.Run(), identity);
}
} // namespace
class ServiceManagerConnection {
public:
ServiceManagerConnection()
: thread_("Persistent service_manager connections"),
ipc_thread_("IPC thread") {
catalog::Catalog::LoadDefaultCatalogManifest(
base::FilePath(kCatalogFilename));
mojo::edk::Init();
ipc_thread_.StartWithOptions(
base::Thread::Options(base::MessageLoop::TYPE_IO, 0));
ipc_support_ = base::MakeUnique<mojo::edk::ScopedIPCSupport>(
ipc_thread_.task_runner(),
mojo::edk::ScopedIPCSupport::ShutdownPolicy::CLEAN);
base::WaitableEvent wait(base::WaitableEvent::ResetPolicy::AUTOMATIC,
base::WaitableEvent::InitialState::NOT_SIGNALED);
base::Thread::Options options;
thread_.StartWithOptions(options);
thread_.task_runner()->PostTask(
FROM_HERE, base::Bind(&ServiceManagerConnection::SetUpConnections,
base::Unretained(this), &wait));
wait.Wait();
// WindowManagerConnection cannot be created from here yet, although the
// connector and identity are available at this point. This is because
// WindowManagerConnection needs a ViewsDelegate and a MessageLoop to have
// been installed first. So delay the creation until the necessary
// dependencies have been met.
PlatformTestHelper::set_factory(
base::Bind(&CreatePlatformTestHelper, service_manager_identity_,
base::Bind(&ServiceManagerConnection::GetConnector,
base::Unretained(this))));
}
~ServiceManagerConnection() {
base::WaitableEvent wait(base::WaitableEvent::ResetPolicy::AUTOMATIC,
base::WaitableEvent::InitialState::NOT_SIGNALED);
thread_.task_runner()->PostTask(
FROM_HERE, base::Bind(&ServiceManagerConnection::TearDownConnections,
base::Unretained(this), &wait));
wait.Wait();
}
private:
service_manager::Connector* GetConnector() {
service_manager_connector_.reset();
base::WaitableEvent wait(base::WaitableEvent::ResetPolicy::AUTOMATIC,
base::WaitableEvent::InitialState::NOT_SIGNALED);
thread_.task_runner()->PostTask(
FROM_HERE, base::Bind(&ServiceManagerConnection::CloneConnector,
base::Unretained(this), &wait));
wait.Wait();
DCHECK(service_manager_connector_);
return service_manager_connector_.get();
}
void CloneConnector(base::WaitableEvent* wait) {
service_manager_connector_ = context_->connector()->Clone();
wait->Signal();
}
void SetUpConnections(base::WaitableEvent* wait) {
background_service_manager_ =
base::MakeUnique<service_manager::BackgroundServiceManager>(
nullptr, nullptr);
service_manager::mojom::ServicePtr service;
context_ = base::MakeUnique<service_manager::ServiceContext>(
base::MakeUnique<DefaultService>(),
service_manager::mojom::ServiceRequest(&service));
background_service_manager_->RegisterService(
service_manager::Identity(
GetTestName(), service_manager::mojom::kRootUserID),
std::move(service), nullptr);
// ui/views/mus requires a WindowManager running, so launch test_wm.
service_manager::Connector* connector = context_->connector();
connector->Connect("test_wm");
service_manager_connector_ = connector->Clone();
service_manager_identity_ = context_->identity();
wait->Signal();
}
void TearDownConnections(base::WaitableEvent* wait) {
context_.reset();
wait->Signal();
}
// Returns the name of the test executable, e.g.
// "views_mus_unittests".
std::string GetTestName() {
base::FilePath executable = base::CommandLine::ForCurrentProcess()
->GetProgram()
.BaseName()
.RemoveExtension();
return std::string("") + executable.MaybeAsASCII();
}
base::Thread thread_;
base::Thread ipc_thread_;
std::unique_ptr<mojo::edk::ScopedIPCSupport> ipc_support_;
std::unique_ptr<service_manager::BackgroundServiceManager>
background_service_manager_;
std::unique_ptr<service_manager::ServiceContext> context_;
std::unique_ptr<service_manager::Connector> service_manager_connector_;
service_manager::Identity service_manager_identity_;
DISALLOW_COPY_AND_ASSIGN(ServiceManagerConnection);
};
ViewsMusTestSuite::ViewsMusTestSuite(int argc, char** argv)
: ViewsTestSuite(argc, argv) {}
ViewsMusTestSuite::~ViewsMusTestSuite() {}
void ViewsMusTestSuite::Initialize() {
PlatformTestHelper::SetIsMus();
// Let other services know that we're running in tests. Do this with a
// command line flag to avoid making blocking calls to other processes for
// setup for tests (e.g. to unlock the screen in the window manager).
EnsureCommandLineSwitch(ui::switches::kUseTestConfig);
EnsureCommandLineSwitch(switches::kOverrideUseSoftwareGLForTests);
ViewsTestSuite::Initialize();
service_manager_connections_ = base::MakeUnique<ServiceManagerConnection>();
}
void ViewsMusTestSuite::Shutdown() {
service_manager_connections_.reset();
ViewsTestSuite::Shutdown();
}
} // namespace views
| [
"[email protected]"
] | |
55d8d9b852f889f16425e463751a9f7c7d966908 | d0c44dd3da2ef8c0ff835982a437946cbf4d2940 | /cmake-build-debug/programs_tiling/function14627/function14627_schedule_31/function14627_schedule_31_wrapper.cpp | 38cf8c14d3d70d9421886a287e3aa9dd89e1dfef | [] | no_license | IsraMekki/tiramisu_code_generator | 8b3f1d63cff62ba9f5242c019058d5a3119184a3 | 5a259d8e244af452e5301126683fa4320c2047a3 | refs/heads/master | 2020-04-29T17:27:57.987172 | 2019-04-23T16:50:32 | 2019-04-23T16:50:32 | 176,297,755 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 859 | cpp | #include "Halide.h"
#include "function14627_schedule_31_wrapper.h"
#include "tiramisu/utils.h"
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <fstream>
#include <chrono>
#define MAX_RAND 200
int main(int, char **){Halide::Buffer<int32_t> buf0(64, 64, 64, 256);
init_buffer(buf0, (int32_t)0);
auto t1 = std::chrono::high_resolution_clock::now();
function14627_schedule_31(buf0.raw_buffer());
auto t2 = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = t2 - t1;
std::ofstream exec_times_file;
exec_times_file.open("../data/programs/function14627/function14627_schedule_31/exec_times.txt", std::ios_base::app);
if (exec_times_file.is_open()){
exec_times_file << diff.count() * 1000000 << "us" <<std::endl;
exec_times_file.close();
}
return 0;
} | [
"[email protected]"
] | |
50be63deedf1182c89f65c514f81c64c8f59c569 | cb142e98b043e7088f0fe009f5159928877acf1b | /BBKTank/BBKTank2.ino/B1_RC.ino | 38fe761fcce4abfb35a2fe28e19c4303195bbdb9 | [] | no_license | wetnt/Arduino_public | ef30502b4a30e099a09e2617fd58fd3a9801cf13 | 4cc331e2f43dda0df8f78d9cfe924da130ca5df3 | refs/heads/master | 2021-01-23T09:38:43.302783 | 2019-09-12T00:29:43 | 2019-09-12T00:29:43 | 33,909,041 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 897 | ino | //===================================================================
#include <SoftwareSerial.h>
SoftwareSerial rc(10, 11); //RX,TX
static const long RcBaud = 9600;
//===================================================================
void rc_setup() {
rc.begin(RcBaud);
lgln(F("RC.rc(10, 11).start!"));
}
//===================================================================
void rcFeed() {
//----------------------------------------------------------
//rc.listen();
while (rc.available()) {
char c = rc.read();
rc_cmd_feed(c);
//lg(c);
}
//----------------------------------------------------------
}
static void rcSend(char chars[], boolean rnKey) {
rc.print(chars); if (rnKey) rc.println();
}
static void rcSend(String str, boolean rnKey) {
rc.print(str); if (rnKey) rc.println();
}
//===================================================================
| [
"[email protected]"
] | |
f0c1f1548a4946ec4179fde2c891f067d9d262d4 | 79b31becc5899a73fc5b7cc5dc044dbb7c4419cb | /include/gl/cubemap.hpp | 507eef30325d06d352306e710e1ded136519748e | [
"MIT"
] | permissive | scholli/unvox | 3ffb8d1b15ae1e1f96641d1b726abdcfb3d37a32 | 879e06f45a40963527e0a895d742f7be6fb3d490 | refs/heads/master | 2020-08-30T20:41:27.440657 | 2019-11-06T14:32:22 | 2019-11-06T14:32:22 | 218,483,014 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,801 | hpp | //******************************************************************************
// Module: UnVox
// Author: Sebastian Thiele / Andre Schollmeyer
//
// Copyright 2019
// All rights reserved
//******************************************************************************
#ifndef UNVOX_GL_CUBEMAP_HPP
#define UNVOX_GL_CUBEMAP_HPP
// header system
#include <string>
// header project
#include <gl/glpp.hpp>
#include <gl/texture.hpp>
namespace unvox { namespace gl {
class UNVOX_GL cubemap : public texture
{
private : // non-copyable
cubemap(cubemap const&) = delete;
cubemap& operator=(cubemap const& other) = delete;
public :
cubemap ( );
~cubemap ( );
void swap ( cubemap& );
public : // methods
void load ( std::string const& imgfile_posx,
std::string const& imgfile_negx,
std::string const& imgfile_posy,
std::string const& imgfile_negy,
std::string const& imgfile_posz,
std::string const& imgfile_negz );
GLuint const id ( ) const override;
void bind ( );
void bind ( GLint texunit );
void unbind ( );
void enable ( ) const;
void disable ( ) const;
void parameter ( GLenum pname, int param );
static GLenum target ( );
private : // methods
void openfile_ ( std::string const& filename,
GLenum target );
private : // members
GLuint id_;
GLint unit_;
};
} } // namespace unvox / namespace gl
#endif // UNVOX_GL_CUBEMAP_HPP
| [
"[email protected]"
] | |
821cde687923bb93a0bf7bbaa99bd762a01f15fb | 4352b5c9e6719d762e6a80e7a7799630d819bca3 | /tutorials/eulerVortex.twitch/eulerVortex.cyclic.twitch.test.test/3.02/rho | 91a4826b352f9c88e7b75f6f49d483ff30f2a0f5 | [] | no_license | dashqua/epicProject | d6214b57c545110d08ad053e68bc095f1d4dc725 | 54afca50a61c20c541ef43e3d96408ef72f0bcbc | refs/heads/master | 2022-02-28T17:20:20.291864 | 2019-10-28T13:33:16 | 2019-10-28T13:33:16 | 184,294,390 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 161,372 | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 6
\\/ M anipulation |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class volScalarField;
location "3.02";
object rho;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [1 -3 0 0 0 0 0];
internalField nonuniform List<scalar>
22500
(
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40003
1.40003
1.40003
1.40003
1.40003
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40003
1.40004
1.40004
1.40004
1.40004
1.40004
1.40003
1.40003
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39998
1.39997
1.39997
1.39997
1.39997
1.39997
1.39998
1.39998
1.39998
1.39999
1.39999
1.4
1.40001
1.40001
1.40002
1.40003
1.40003
1.40004
1.40004
1.40004
1.40005
1.40005
1.40005
1.40005
1.40005
1.40004
1.40004
1.40004
1.40004
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39997
1.39997
1.39997
1.39997
1.39997
1.39997
1.39997
1.39997
1.39997
1.39998
1.39998
1.39999
1.4
1.4
1.40001
1.40002
1.40003
1.40004
1.40004
1.40005
1.40005
1.40006
1.40006
1.40006
1.40006
1.40006
1.40006
1.40006
1.40005
1.40005
1.40004
1.40004
1.40004
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39997
1.39997
1.39996
1.39996
1.39996
1.39996
1.39996
1.39996
1.39996
1.39997
1.39997
1.39998
1.39999
1.4
1.40001
1.40002
1.40003
1.40004
1.40005
1.40006
1.40007
1.40007
1.40008
1.40008
1.40008
1.40008
1.40008
1.40008
1.40007
1.40007
1.40006
1.40006
1.40005
1.40004
1.40004
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39998
1.39997
1.39997
1.39996
1.39996
1.39995
1.39995
1.39995
1.39995
1.39995
1.39996
1.39996
1.39997
1.39998
1.39999
1.4
1.40001
1.40003
1.40004
1.40005
1.40007
1.40008
1.40009
1.40009
1.4001
1.4001
1.40011
1.40011
1.40011
1.4001
1.4001
1.40009
1.40009
1.40008
1.40007
1.40006
1.40006
1.40005
1.40004
1.40004
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39997
1.39996
1.39996
1.39995
1.39995
1.39994
1.39994
1.39994
1.39995
1.39996
1.39996
1.39998
1.39999
1.4
1.40002
1.40004
1.40005
1.40007
1.40009
1.4001
1.40012
1.40013
1.40013
1.40014
1.40014
1.40014
1.40014
1.40014
1.40013
1.40013
1.40012
1.40011
1.4001
1.40009
1.40008
1.40007
1.40006
1.40005
1.40004
1.40004
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39997
1.39997
1.39996
1.39995
1.39995
1.39994
1.39994
1.39994
1.39994
1.39994
1.39995
1.39996
1.39998
1.39999
1.40001
1.40003
1.40006
1.40008
1.4001
1.40012
1.40014
1.40016
1.40017
1.40019
1.40019
1.4002
1.4002
1.4002
1.40019
1.40019
1.40018
1.40017
1.40016
1.40014
1.40013
1.40011
1.4001
1.40009
1.40007
1.40006
1.40005
1.40004
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39996
1.39995
1.39995
1.39994
1.39994
1.39994
1.39994
1.39994
1.39995
1.39997
1.39998
1.4
1.40003
1.40006
1.40009
1.40012
1.40015
1.40018
1.4002
1.40023
1.40025
1.40026
1.40028
1.40028
1.40029
1.40028
1.40028
1.40027
1.40025
1.40024
1.40022
1.4002
1.40018
1.40017
1.40015
1.40013
1.40011
1.40009
1.40008
1.40007
1.40005
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39996
1.39995
1.39994
1.39994
1.39994
1.39994
1.39995
1.39996
1.39997
1.4
1.40002
1.40006
1.40009
1.40013
1.40017
1.40022
1.40026
1.40029
1.40033
1.40036
1.40038
1.4004
1.40041
1.40041
1.40041
1.4004
1.40039
1.40037
1.40035
1.40032
1.4003
1.40027
1.40024
1.40022
1.40019
1.40016
1.40014
1.40012
1.4001
1.40008
1.40007
1.40005
1.40004
1.40003
1.40003
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39997
1.39996
1.39995
1.39995
1.39994
1.39994
1.39994
1.39995
1.39997
1.39999
1.40002
1.40005
1.4001
1.40015
1.4002
1.40026
1.40032
1.40037
1.40043
1.40048
1.40052
1.40056
1.40059
1.4006
1.40061
1.40061
1.4006
1.40058
1.40055
1.40052
1.40048
1.40044
1.4004
1.40036
1.40032
1.40028
1.40025
1.40021
1.40018
1.40015
1.40012
1.4001
1.40008
1.40006
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39997
1.39996
1.39995
1.39995
1.39995
1.39995
1.39996
1.39998
1.40001
1.40005
1.4001
1.40015
1.40022
1.40029
1.40037
1.40045
1.40053
1.40061
1.40069
1.40075
1.40081
1.40085
1.40088
1.4009
1.4009
1.40089
1.40086
1.40083
1.40078
1.40073
1.40067
1.40061
1.40055
1.40049
1.40043
1.40038
1.40032
1.40027
1.40023
1.40019
1.40016
1.40013
1.4001
1.40008
1.40006
1.40005
1.40003
1.40003
1.40002
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39997
1.39996
1.39996
1.39996
1.39996
1.39998
1.4
1.40004
1.40009
1.40015
1.40022
1.40031
1.40041
1.40052
1.40063
1.40075
1.40086
1.40097
1.40107
1.40116
1.40123
1.40129
1.40132
1.40133
1.40132
1.4013
1.40125
1.40119
1.40112
1.40103
1.40095
1.40085
1.40076
1.40067
1.40059
1.4005
1.40043
1.40036
1.4003
1.40025
1.4002
1.40016
1.40013
1.4001
1.40007
1.40006
1.40004
1.40003
1.40002
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39997
1.39997
1.39997
1.39998
1.4
1.40003
1.40007
1.40013
1.40021
1.40031
1.40042
1.40056
1.4007
1.40086
1.40102
1.40118
1.40135
1.4015
1.40163
1.40175
1.40184
1.40191
1.40194
1.40195
1.40192
1.40187
1.4018
1.4017
1.40159
1.40146
1.40133
1.40119
1.40106
1.40092
1.4008
1.40068
1.40058
1.40048
1.4004
1.40032
1.40026
1.4002
1.40016
1.40012
1.40009
1.40007
1.40005
1.40003
1.40002
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39998
1.4
1.40002
1.40006
1.40011
1.40019
1.40029
1.40041
1.40056
1.40073
1.40092
1.40113
1.40136
1.40159
1.40182
1.40204
1.40224
1.40243
1.40258
1.4027
1.40278
1.40281
1.40281
1.40277
1.40268
1.40257
1.40242
1.40225
1.40206
1.40187
1.40167
1.40147
1.40128
1.4011
1.40093
1.40078
1.40064
1.40053
1.40042
1.40034
1.40026
1.4002
1.40015
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.40002
1.40005
1.40009
1.40016
1.40025
1.40037
1.40052
1.4007
1.40092
1.40117
1.40145
1.40175
1.40207
1.40239
1.4027
1.40301
1.40328
1.40353
1.40373
1.40388
1.40398
1.40402
1.404
1.40393
1.4038
1.40363
1.40341
1.40316
1.40289
1.40261
1.40232
1.40204
1.40177
1.40151
1.40127
1.40106
1.40087
1.40071
1.40056
1.40044
1.40035
1.40026
1.4002
1.40014
1.4001
1.40007
1.40005
1.40003
1.40002
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40002
1.40004
1.40007
1.40012
1.4002
1.40031
1.40045
1.40063
1.40086
1.40113
1.40145
1.40181
1.4022
1.40262
1.40306
1.4035
1.40393
1.40434
1.40471
1.40503
1.4053
1.40549
1.40561
1.40566
1.40562
1.4055
1.40532
1.40507
1.40476
1.40441
1.40403
1.40363
1.40323
1.40283
1.40244
1.40208
1.40175
1.40145
1.40118
1.40095
1.40076
1.40059
1.40046
1.40035
1.40026
1.40019
1.40013
1.40009
1.40006
1.40003
1.40002
1.40001
1.4
1.4
1.4
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40003
1.40003
1.40003
1.40003
1.40003
1.40003
1.40003
1.40004
1.40006
1.4001
1.40016
1.40024
1.40036
1.40053
1.40075
1.40102
1.40135
1.40174
1.40219
1.40269
1.40324
1.40381
1.40441
1.405
1.40558
1.40612
1.40662
1.40704
1.40738
1.40763
1.40778
1.40783
1.40777
1.4076
1.40734
1.40699
1.40657
1.40609
1.40556
1.40501
1.40445
1.40389
1.40336
1.40286
1.4024
1.40198
1.40162
1.4013
1.40102
1.4008
1.40061
1.40046
1.40034
1.40024
1.40017
1.40011
1.40007
1.40004
1.40002
1.40001
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40003
1.40003
1.40003
1.40003
1.40004
1.40004
1.40004
1.40004
1.40005
1.40006
1.40008
1.40012
1.40019
1.40028
1.40042
1.40061
1.40085
1.40117
1.40156
1.40203
1.40258
1.40321
1.4039
1.40464
1.40542
1.40621
1.407
1.40776
1.40848
1.40911
1.40966
1.4101
1.41042
1.4106
1.41065
1.41056
1.41033
1.40998
1.40951
1.40894
1.40829
1.40758
1.40684
1.40608
1.40532
1.4046
1.40391
1.40328
1.40271
1.4022
1.40176
1.40139
1.40108
1.40082
1.40061
1.40045
1.40032
1.40022
1.40015
1.40009
1.40005
1.40003
1.40001
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40003
1.40003
1.40004
1.40004
1.40004
1.40005
1.40005
1.40006
1.40006
1.40008
1.4001
1.40015
1.40021
1.40032
1.40046
1.40067
1.40095
1.40131
1.40176
1.40232
1.40297
1.40373
1.40458
1.40551
1.4065
1.40753
1.40857
1.4096
1.41059
1.4115
1.41232
1.41301
1.41356
1.41395
1.41418
1.41423
1.4141
1.41381
1.41335
1.41273
1.41199
1.41114
1.41021
1.40923
1.40822
1.40721
1.40623
1.40531
1.40445
1.40368
1.40299
1.40239
1.40188
1.40146
1.40111
1.40083
1.4006
1.40043
1.40029
1.40019
1.40012
1.40007
1.40003
1.40001
1.4
1.39999
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40004
1.40005
1.40005
1.40006
1.40007
1.40008
1.4001
1.40012
1.40017
1.40024
1.40035
1.4005
1.40072
1.40103
1.40143
1.40194
1.40257
1.40333
1.40423
1.40525
1.40639
1.40762
1.40891
1.41025
1.41159
1.4129
1.41415
1.41529
1.41631
1.41717
1.41784
1.41833
1.4186
1.41865
1.41849
1.41812
1.41754
1.41676
1.41583
1.41474
1.41355
1.41228
1.41097
1.40965
1.40837
1.40714
1.406
1.40497
1.40404
1.40324
1.40255
1.40197
1.4015
1.40112
1.40081
1.40058
1.4004
1.40026
1.40016
1.40009
1.40005
1.40001
1.39999
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40003
1.40003
1.40004
1.40005
1.40005
1.40006
1.40007
1.40008
1.40009
1.40011
1.40014
1.40019
1.40026
1.40037
1.40053
1.40076
1.40108
1.40152
1.40208
1.40279
1.40365
1.40469
1.40588
1.40724
1.40872
1.41031
1.41198
1.41367
1.41536
1.41699
1.41852
1.41992
1.42115
1.42218
1.42299
1.42356
1.42388
1.42395
1.42375
1.4233
1.4226
1.42166
1.42051
1.41917
1.41769
1.41609
1.41443
1.41275
1.41109
1.4095
1.40801
1.40664
1.40542
1.40435
1.40343
1.40266
1.40202
1.40151
1.4011
1.40078
1.40054
1.40036
1.40022
1.40013
1.40006
1.40002
1.4
1.39998
1.39997
1.39997
1.39997
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40005
1.40006
1.40007
1.40008
1.40009
1.4001
1.40012
1.40015
1.4002
1.40027
1.40038
1.40054
1.40078
1.40112
1.40157
1.40217
1.40295
1.40391
1.40508
1.40645
1.40802
1.40977
1.41167
1.41369
1.41577
1.41787
1.41993
1.42189
1.42372
1.42538
1.42682
1.42801
1.42895
1.42961
1.42997
1.43005
1.42982
1.4293
1.42849
1.4274
1.42605
1.42446
1.42268
1.42074
1.41869
1.4166
1.41451
1.41248
1.41057
1.4088
1.40721
1.4058
1.40459
1.40356
1.40271
1.40203
1.40148
1.40105
1.40073
1.40049
1.40031
1.40018
1.40009
1.40004
1.4
1.39998
1.39997
1.39996
1.39996
1.39997
1.39997
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40005
1.40006
1.40007
1.40008
1.40009
1.40011
1.40013
1.40016
1.40021
1.40028
1.40039
1.40055
1.40078
1.40112
1.40159
1.40222
1.40305
1.40409
1.40537
1.40691
1.40869
1.41071
1.41294
1.41532
1.41781
1.42035
1.42286
1.4253
1.42759
1.4297
1.43157
1.43319
1.43452
1.43555
1.43627
1.43667
1.43675
1.43651
1.43595
1.43506
1.43386
1.43234
1.43054
1.42849
1.42621
1.42377
1.42124
1.41869
1.41617
1.41376
1.41152
1.40947
1.40766
1.40608
1.40474
1.40362
1.40271
1.40199
1.40142
1.40099
1.40066
1.40042
1.40025
1.40014
1.40006
1.40001
1.39998
1.39996
1.39996
1.39996
1.39996
1.39997
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40006
1.40007
1.40008
1.4001
1.40012
1.40014
1.40017
1.40022
1.40028
1.40039
1.40054
1.40077
1.40111
1.40158
1.40222
1.40308
1.40418
1.40556
1.40724
1.40923
1.4115
1.41404
1.4168
1.41971
1.4227
1.42569
1.42861
1.43138
1.43395
1.43626
1.43828
1.43999
1.44139
1.44245
1.44318
1.4436
1.44369
1.44345
1.44289
1.44198
1.44074
1.43915
1.43722
1.43497
1.43242
1.42964
1.42669
1.42365
1.42062
1.41766
1.41487
1.4123
1.40999
1.40797
1.40624
1.40479
1.4036
1.40265
1.4019
1.40133
1.4009
1.40058
1.40036
1.4002
1.40009
1.40002
1.39998
1.39996
1.39995
1.39995
1.39995
1.39996
1.39997
1.39997
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40006
1.40007
1.40008
1.4001
1.40012
1.40014
1.40018
1.40022
1.40028
1.40038
1.40053
1.40075
1.40107
1.40153
1.40217
1.40304
1.40418
1.40563
1.40743
1.40959
1.4121
1.41494
1.41806
1.42139
1.42484
1.42831
1.43171
1.43495
1.43796
1.44068
1.44307
1.44511
1.4468
1.44814
1.44915
1.44983
1.45022
1.45031
1.4501
1.44958
1.44875
1.44758
1.44604
1.44412
1.44182
1.43914
1.43612
1.43284
1.42937
1.42582
1.4223
1.41892
1.41576
1.41288
1.41033
1.40813
1.40627
1.40474
1.40351
1.40253
1.40178
1.40121
1.4008
1.40049
1.40028
1.40014
1.40005
1.39999
1.39996
1.39995
1.39994
1.39994
1.39995
1.39996
1.39997
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40006
1.40008
1.4001
1.40012
1.40014
1.40018
1.40022
1.40028
1.40037
1.40051
1.40071
1.40102
1.40146
1.40208
1.40294
1.40409
1.40558
1.40746
1.40976
1.41247
1.41559
1.41905
1.42279
1.42668
1.43063
1.43451
1.4382
1.44162
1.44469
1.44737
1.44965
1.45152
1.45301
1.45415
1.45498
1.45553
1.45583
1.4559
1.45574
1.45535
1.45469
1.45373
1.45242
1.45072
1.44857
1.44596
1.44291
1.43945
1.43568
1.4317
1.42765
1.42367
1.41988
1.41637
1.41322
1.41047
1.40813
1.40618
1.4046
1.40334
1.40237
1.40163
1.40108
1.40068
1.4004
1.40021
1.40009
1.40001
1.39996
1.39994
1.39993
1.39994
1.39994
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40006
1.40008
1.40009
1.40012
1.40014
1.40017
1.40022
1.40027
1.40036
1.40048
1.40067
1.40095
1.40136
1.40195
1.40279
1.40392
1.40542
1.40734
1.40972
1.4126
1.41595
1.41972
1.42384
1.42817
1.43257
1.4369
1.44102
1.4448
1.44817
1.45105
1.45345
1.45536
1.45683
1.45792
1.45869
1.4592
1.45951
1.45967
1.4597
1.45962
1.45941
1.45904
1.45845
1.45756
1.4563
1.45458
1.45234
1.44953
1.44617
1.44231
1.43808
1.43361
1.42909
1.42467
1.4205
1.41669
1.41332
1.41041
1.40796
1.40596
1.40436
1.40311
1.40216
1.40145
1.40093
1.40056
1.40031
1.40014
1.40004
1.39998
1.39994
1.39993
1.39993
1.39993
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40007
1.40009
1.40011
1.40014
1.40017
1.40021
1.40026
1.40034
1.40045
1.40062
1.40087
1.40125
1.4018
1.40259
1.40368
1.40514
1.40706
1.40949
1.41247
1.416
1.42004
1.4245
1.42923
1.43408
1.43885
1.44336
1.44747
1.45106
1.45406
1.45645
1.45825
1.45953
1.46036
1.46084
1.46106
1.46112
1.4611
1.46105
1.46103
1.46103
1.46106
1.46106
1.46098
1.46071
1.46014
1.45914
1.45758
1.45537
1.45245
1.44884
1.44462
1.43995
1.43503
1.43006
1.42524
1.42075
1.4167
1.41315
1.41013
1.40764
1.40563
1.40405
1.40283
1.40192
1.40125
1.40077
1.40044
1.40022
1.40008
1.39999
1.39995
1.39993
1.39992
1.39992
1.39993
1.39994
1.39996
1.39997
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40006
1.40008
1.4001
1.40013
1.40016
1.4002
1.40025
1.40032
1.40042
1.40057
1.40079
1.40113
1.40163
1.40236
1.40338
1.40478
1.40665
1.40907
1.41209
1.41574
1.41998
1.42474
1.42984
1.4351
1.44029
1.44518
1.44959
1.45335
1.45639
1.45868
1.46024
1.46115
1.46153
1.4615
1.46119
1.46072
1.46023
1.45979
1.4595
1.45939
1.45948
1.45978
1.46022
1.46075
1.46124
1.46156
1.46153
1.46099
1.45974
1.45767
1.45471
1.45089
1.44634
1.44126
1.43591
1.43053
1.42538
1.42062
1.41639
1.41273
1.40967
1.40718
1.4052
1.40367
1.40251
1.40166
1.40104
1.40062
1.40033
1.40014
1.40002
1.39996
1.39993
1.39991
1.39992
1.39992
1.39994
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40007
1.40009
1.40012
1.40015
1.40019
1.40023
1.4003
1.40039
1.40052
1.40071
1.40101
1.40145
1.40211
1.40304
1.40435
1.40614
1.40849
1.41149
1.41518
1.41955
1.42454
1.42996
1.43561
1.4412
1.44647
1.45116
1.45507
1.45811
1.46022
1.46144
1.46186
1.46163
1.4609
1.45985
1.45863
1.45741
1.4563
1.45542
1.45485
1.45464
1.45482
1.45538
1.45628
1.45745
1.45878
1.46011
1.46124
1.46196
1.46201
1.46119
1.45932
1.45634
1.45233
1.44745
1.44198
1.43622
1.4305
1.42507
1.42012
1.41578
1.41209
1.40905
1.40661
1.4047
1.40325
1.40217
1.40139
1.40084
1.40047
1.40022
1.40007
1.39998
1.39993
1.39991
1.39991
1.39992
1.39993
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40006
1.40008
1.40011
1.40014
1.40017
1.40021
1.40027
1.40035
1.40047
1.40064
1.40089
1.40128
1.40185
1.40269
1.40388
1.40554
1.40777
1.41068
1.41434
1.41876
1.4239
1.42959
1.43558
1.44157
1.44721
1.45219
1.45628
1.45929
1.4612
1.46203
1.46189
1.46094
1.4594
1.45746
1.45532
1.45317
1.45117
1.44946
1.44815
1.44731
1.447
1.44725
1.44805
1.44938
1.45117
1.45332
1.45567
1.45803
1.46014
1.46172
1.46246
1.46208
1.46041
1.4574
1.45316
1.44794
1.44208
1.43597
1.42996
1.42433
1.41927
1.4149
1.41125
1.40829
1.40595
1.40415
1.4028
1.40182
1.40113
1.40065
1.40033
1.40013
1.40001
1.39994
1.39991
1.3999
1.39991
1.39992
1.39993
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.40009
1.40012
1.40015
1.4002
1.40025
1.40032
1.40042
1.40056
1.40078
1.40111
1.4016
1.40234
1.4034
1.40491
1.40697
1.40973
1.41326
1.41765
1.42284
1.42871
1.435
1.44137
1.4474
1.45272
1.457
1.46005
1.46177
1.46221
1.46149
1.4598
1.45738
1.45447
1.45131
1.44813
1.4451
1.44239
1.44014
1.43843
1.43735
1.43695
1.43725
1.43826
1.43996
1.44229
1.44517
1.44847
1.45199
1.4555
1.45868
1.46115
1.46256
1.46259
1.46105
1.45793
1.45341
1.44781
1.44159
1.43516
1.42893
1.42319
1.41812
1.4138
1.41026
1.40743
1.40523
1.40357
1.40236
1.40148
1.40088
1.40047
1.40021
1.40005
1.39996
1.39992
1.3999
1.3999
1.39991
1.39992
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40005
1.40006
1.40008
1.4001
1.40014
1.40017
1.40022
1.40029
1.40037
1.40049
1.40068
1.40095
1.40137
1.402
1.40292
1.40425
1.40613
1.40867
1.41201
1.41625
1.4214
1.42736
1.43388
1.44059
1.44703
1.45273
1.45729
1.46044
1.46206
1.46217
1.46091
1.4585
1.4552
1.45132
1.44711
1.44284
1.43872
1.43493
1.43163
1.42892
1.42689
1.42562
1.42513
1.42547
1.42664
1.42863
1.4314
1.43489
1.43898
1.44353
1.4483
1.453
1.45723
1.46056
1.46255
1.46286
1.46131
1.45796
1.45307
1.44708
1.4405
1.43383
1.42746
1.4217
1.41671
1.41253
1.40916
1.40651
1.40449
1.403
1.40192
1.40117
1.40065
1.40032
1.40011
1.39999
1.39993
1.3999
1.3999
1.3999
1.39992
1.39993
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.40009
1.40012
1.40015
1.4002
1.40025
1.40033
1.40043
1.40058
1.40081
1.40116
1.40168
1.40247
1.40362
1.40527
1.40756
1.41065
1.41465
1.41964
1.42557
1.43222
1.43923
1.44608
1.45222
1.45716
1.46053
1.46217
1.46207
1.46036
1.4573
1.45319
1.44837
1.44313
1.43778
1.43256
1.42766
1.42327
1.41949
1.41643
1.41416
1.41273
1.41219
1.41255
1.41384
1.41604
1.41914
1.42309
1.42782
1.4332
1.43904
1.44507
1.45092
1.45612
1.46016
1.46256
1.46295
1.46121
1.45748
1.45215
1.44574
1.43885
1.43201
1.42562
1.41994
1.41511
1.41114
1.408
1.40558
1.40377
1.40245
1.40152
1.40088
1.40046
1.40019
1.40003
1.39995
1.3999
1.39989
1.3999
1.39991
1.39992
1.39994
1.39995
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.4001
1.40013
1.40017
1.40022
1.40028
1.40037
1.4005
1.40069
1.40097
1.4014
1.40205
1.40302
1.40444
1.40646
1.40924
1.41293
1.41765
1.42341
1.43008
1.43729
1.44453
1.45116
1.45659
1.46034
1.46215
1.46199
1.45999
1.45642
1.4516
1.44591
1.43971
1.43332
1.42702
1.42103
1.41553
1.41067
1.40654
1.40322
1.40077
1.39923
1.39863
1.399
1.40036
1.40272
1.40606
1.41035
1.41556
1.42158
1.42827
1.4354
1.44264
1.44954
1.45556
1.46011
1.46266
1.46288
1.46074
1.45649
1.45064
1.44383
1.43669
1.42978
1.42346
1.41797
1.41339
1.4097
1.40683
1.40466
1.40307
1.40194
1.40115
1.40063
1.40029
1.40009
1.39997
1.39992
1.39989
1.39989
1.3999
1.39992
1.39993
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40005
1.40006
1.40008
1.40011
1.40015
1.40019
1.40025
1.40032
1.40042
1.40058
1.40081
1.40115
1.40168
1.40249
1.40368
1.40541
1.40784
1.41115
1.41551
1.42098
1.42751
1.43481
1.44237
1.44952
1.45553
1.45981
1.46201
1.462
1.4599
1.45597
1.45059
1.44416
1.43709
1.42973
1.42239
1.41534
1.40876
1.40281
1.39759
1.3932
1.38968
1.38708
1.38545
1.3848
1.38517
1.38658
1.38903
1.39254
1.39709
1.40265
1.40916
1.4165
1.4245
1.43288
1.44124
1.44905
1.45565
1.46042
1.46282
1.46259
1.45983
1.45493
1.44853
1.44137
1.43408
1.42721
1.42108
1.41587
1.41162
1.40826
1.4057
1.4038
1.40243
1.40148
1.40084
1.40042
1.40016
1.40001
1.39993
1.3999
1.39989
1.3999
1.39991
1.39993
1.39994
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.40009
1.40012
1.40016
1.40021
1.40027
1.40036
1.40048
1.40066
1.40094
1.40137
1.40201
1.40299
1.40443
1.40651
1.40941
1.41332
1.41838
1.42461
1.43184
1.43961
1.44724
1.45391
1.45889
1.46168
1.46206
1.46009
1.45603
1.45027
1.44325
1.43541
1.42717
1.41887
1.41079
1.40316
1.39613
1.38982
1.38433
1.37971
1.37601
1.37328
1.37156
1.37086
1.37122
1.37265
1.37519
1.37882
1.38357
1.38941
1.39629
1.40414
1.41282
1.42211
1.43167
1.441
1.44947
1.45637
1.46101
1.46292
1.46197
1.45839
1.45277
1.44586
1.43842
1.43111
1.4244
1.41857
1.41373
1.40986
1.40687
1.40463
1.40301
1.40187
1.40109
1.40057
1.40025
1.40006
1.39996
1.39991
1.39989
1.39989
1.39991
1.39992
1.39994
1.39995
1.39997
1.39998
1.39998
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.4001
1.40013
1.40017
1.40023
1.4003
1.4004
1.40055
1.40076
1.40109
1.40161
1.40239
1.40357
1.4053
1.40777
1.41118
1.41573
1.42152
1.42849
1.43629
1.4443
1.45165
1.45746
1.46106
1.46209
1.46052
1.45657
1.45065
1.44322
1.43477
1.42576
1.41658
1.40753
1.39888
1.39078
1.38338
1.37676
1.37099
1.36614
1.36225
1.35937
1.35754
1.35678
1.35713
1.35861
1.36122
1.36499
1.36992
1.37599
1.38318
1.39145
1.40068
1.41069
1.42122
1.43182
1.44192
1.45077
1.45759
1.46172
1.4628
1.46086
1.45635
1.45
1.44264
1.43506
1.42787
1.42146
1.41603
1.41163
1.40818
1.40557
1.40367
1.40231
1.40138
1.40076
1.40036
1.40012
1.39999
1.39992
1.3999
1.39989
1.3999
1.39992
1.39993
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40014
1.40019
1.40025
1.40033
1.40045
1.40062
1.40087
1.40127
1.40189
1.40282
1.40423
1.40628
1.40918
1.41315
1.41837
1.42489
1.43252
1.44073
1.44868
1.4554
1.46
1.46194
1.46106
1.45752
1.4517
1.44408
1.4352
1.42555
1.41558
1.40564
1.396
1.38687
1.37837
1.3706
1.36364
1.35756
1.35242
1.34827
1.34519
1.34322
1.34241
1.34277
1.34433
1.34709
1.35104
1.35617
1.36249
1.36998
1.3786
1.38828
1.39889
1.4102
1.42186
1.43333
1.44391
1.45276
1.45909
1.46231
1.46224
1.45914
1.45365
1.44664
1.43897
1.43141
1.42448
1.41849
1.41354
1.40962
1.40662
1.40441
1.40282
1.40171
1.40097
1.4005
1.4002
1.40003
1.39994
1.3999
1.39989
1.3999
1.39991
1.39993
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40003
1.40003
1.40005
1.40006
1.40009
1.40011
1.40015
1.4002
1.40027
1.40036
1.40049
1.40069
1.401
1.40147
1.4022
1.40331
1.40496
1.40737
1.41074
1.41531
1.42122
1.42843
1.4366
1.44498
1.45257
1.45831
1.46142
1.46154
1.45872
1.4533
1.44575
1.43665
1.42653
1.4159
1.40515
1.3946
1.38446
1.37488
1.36596
1.35777
1.35037
1.34385
1.3383
1.33381
1.33045
1.32832
1.32745
1.32788
1.3296
1.3326
1.33685
1.3423
1.34894
1.35675
1.36572
1.3758
1.38691
1.39888
1.4114
1.42402
1.43609
1.44677
1.45518
1.46056
1.4625
1.46104
1.45669
1.45027
1.44274
1.43496
1.42759
1.42107
1.41559
1.41118
1.40778
1.40523
1.40339
1.4021
1.40122
1.40065
1.4003
1.40009
1.39997
1.39992
1.3999
1.3999
1.39991
1.39993
1.39994
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.40009
1.40012
1.40016
1.40022
1.40029
1.40039
1.40055
1.40077
1.40113
1.40169
1.40255
1.40385
1.40578
1.40857
1.41245
1.41763
1.42422
1.43207
1.44061
1.44891
1.45581
1.46029
1.46172
1.45997
1.45528
1.44811
1.43904
1.42865
1.41751
1.40607
1.39468
1.38361
1.373
1.36294
1.35349
1.34473
1.33672
1.32958
1.32344
1.31843
1.31469
1.31233
1.31143
1.312
1.31402
1.31745
1.32218
1.32815
1.33528
1.34354
1.35291
1.36339
1.37493
1.38743
1.40067
1.41424
1.42758
1.43987
1.4502
1.45768
1.46168
1.46202
1.45903
1.45346
1.44626
1.43842
1.43072
1.42373
1.41774
1.41285
1.40902
1.40613
1.40401
1.40252
1.4015
1.40083
1.40041
1.40015
1.40001
1.39993
1.39991
1.3999
1.39991
1.39993
1.39994
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.4001
1.40013
1.40017
1.40023
1.40031
1.40043
1.4006
1.40087
1.40128
1.40193
1.40293
1.40445
1.40668
1.40988
1.41428
1.4201
1.42734
1.43571
1.44443
1.45237
1.4583
1.46131
1.46098
1.45739
1.45094
1.4422
1.4318
1.42034
1.40835
1.39625
1.38432
1.37274
1.36161
1.35096
1.34082
1.33125
1.32236
1.31432
1.30732
1.30157
1.29728
1.2946
1.29365
1.29446
1.29698
1.30109
1.30663
1.31342
1.32133
1.33026
1.34019
1.35113
1.3631
1.37606
1.38987
1.40423
1.41862
1.43231
1.44437
1.45382
1.45986
1.4621
1.46064
1.45612
1.44947
1.44173
1.43382
1.42643
1.41996
1.4146
1.41034
1.40709
1.4047
1.40299
1.40182
1.40103
1.40053
1.40022
1.40005
1.39996
1.39992
1.39991
1.39991
1.39992
1.39994
1.39995
1.39997
1.39998
1.39998
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40007
1.4001
1.40013
1.40018
1.40024
1.40033
1.40046
1.40066
1.40096
1.40145
1.40219
1.40335
1.4051
1.40765
1.41128
1.41623
1.42267
1.43051
1.43926
1.44794
1.45526
1.46001
1.46142
1.45933
1.45399
1.44594
1.43582
1.42429
1.41193
1.39924
1.38657
1.37413
1.36202
1.35025
1.3388
1.32769
1.31698
1.30684
1.29751
1.28928
1.28246
1.27736
1.27423
1.27322
1.27439
1.27764
1.28279
1.28955
1.29763
1.30674
1.31672
1.32748
1.33905
1.35152
1.36491
1.37921
1.39419
1.40945
1.42432
1.4379
1.44916
1.45717
1.46132
1.46151
1.45821
1.45229
1.44483
1.43684
1.42913
1.42223
1.41641
1.41173
1.40812
1.40543
1.4035
1.40216
1.40126
1.40067
1.40031
1.4001
1.39998
1.39993
1.39991
1.39991
1.39992
1.39994
1.39995
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.4001
1.40014
1.40019
1.40026
1.40035
1.4005
1.40072
1.40107
1.40162
1.40248
1.4038
1.40579
1.40869
1.41277
1.41827
1.42531
1.43366
1.44265
1.45107
1.45754
1.46094
1.46072
1.45692
1.44996
1.44049
1.42918
1.41669
1.40358
1.39029
1.3771
1.36414
1.35139
1.33879
1.32626
1.3138
1.30151
1.28962
1.27848
1.26851
1.26018
1.25393
1.25014
1.24905
1.25071
1.255
1.26163
1.27016
1.28011
1.29102
1.30257
1.31459
1.32709
1.34021
1.35409
1.36881
1.3843
1.40025
1.4161
1.43099
1.44388
1.45374
1.45977
1.46167
1.45972
1.45469
1.44766
1.43971
1.43178
1.42451
1.41826
1.41317
1.40919
1.40621
1.40404
1.40253
1.4015
1.40083
1.40041
1.40016
1.40002
1.39995
1.39992
1.39992
1.39993
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40014
1.4002
1.40027
1.40038
1.40054
1.40079
1.40118
1.4018
1.40278
1.40429
1.40653
1.40978
1.41432
1.42037
1.42796
1.43674
1.44578
1.45373
1.45919
1.46116
1.45933
1.45393
1.4455
1.43477
1.42244
1.40914
1.39541
1.3816
1.3679
1.35433
1.34077
1.32707
1.31308
1.2988
1.28435
1.27008
1.25645
1.2441
1.23371
1.22591
1.22123
1.22001
1.22232
1.228
1.23663
1.24758
1.26013
1.27358
1.28737
1.30122
1.31509
1.32915
1.34364
1.35881
1.37472
1.39121
1.40784
1.42383
1.43816
1.44972
1.45757
1.46118
1.46066
1.45665
1.45018
1.4424
1.43434
1.42676
1.42012
1.41464
1.4103
1.40702
1.40462
1.40292
1.40176
1.401
1.40052
1.40022
1.40006
1.39997
1.39993
1.39992
1.39993
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40015
1.4002
1.40028
1.40039
1.40057
1.40085
1.4013
1.402
1.40311
1.40479
1.4073
1.41092
1.41592
1.4225
1.43059
1.43967
1.4486
1.45592
1.46024
1.46076
1.45739
1.4505
1.44078
1.42895
1.41574
1.40178
1.3875
1.3732
1.35895
1.34465
1.33007
1.31492
1.29901
1.28231
1.26501
1.24756
1.23066
1.2152
1.20212
1.19233
1.18653
1.18514
1.18828
1.19573
1.20694
1.22104
1.23701
1.25382
1.27067
1.28704
1.30283
1.31821
1.33355
1.34925
1.36555
1.38248
1.39972
1.41662
1.43218
1.44527
1.45482
1.46012
1.46107
1.45817
1.45238
1.44488
1.43678
1.42895
1.42197
1.41611
1.41143
1.40785
1.40521
1.40333
1.40204
1.40118
1.40063
1.4003
1.4001
1.4
1.39995
1.39993
1.39993
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40015
1.40021
1.40029
1.40041
1.40061
1.40092
1.40142
1.4022
1.40344
1.40532
1.4081
1.41208
1.41754
1.42462
1.43314
1.4424
1.45108
1.45762
1.46075
1.45985
1.45502
1.4468
1.43592
1.42315
1.40921
1.39467
1.37992
1.36513
1.35025
1.33505
1.31916
1.30217
1.28379
1.26399
1.24301
1.22152
1.20047
1.18112
1.16477
1.15257
1.14542
1.14384
1.14798
1.15759
1.17195
1.18993
1.21017
1.23127
1.25205
1.27174
1.29009
1.30727
1.32377
1.34015
1.35687
1.37416
1.39188
1.4095
1.4261
1.44054
1.45165
1.45857
1.46099
1.45925
1.45423
1.44711
1.43906
1.43107
1.42378
1.41758
1.41257
1.4087
1.40582
1.40376
1.40233
1.40137
1.40076
1.40037
1.40015
1.40003
1.39996
1.39994
1.39994
1.39994
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40015
1.40021
1.4003
1.40043
1.40064
1.40098
1.40154
1.40241
1.40378
1.40585
1.40892
1.41326
1.41915
1.4267
1.43558
1.44489
1.45319
1.45888
1.46079
1.45854
1.45238
1.44296
1.43107
1.4175
1.40293
1.38791
1.37271
1.35739
1.34177
1.32547
1.30796
1.28867
1.26723
1.24356
1.21804
1.19158
1.16554
1.14159
1.12142
1.10646
1.09777
1.09597
1.10127
1.11338
1.13142
1.15399
1.17933
1.2056
1.2312
1.25505
1.27667
1.2962
1.31423
1.3315
1.34872
1.36634
1.38443
1.4026
1.42006
1.43566
1.44818
1.45662
1.46048
1.45994
1.45576
1.44909
1.44118
1.43307
1.42553
1.41902
1.4137
1.40955
1.40644
1.40419
1.40263
1.40157
1.40089
1.40046
1.4002
1.40006
1.39999
1.39995
1.39994
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40015
1.40021
1.4003
1.40045
1.40068
1.40105
1.40166
1.40262
1.40412
1.40639
1.40973
1.41443
1.42074
1.4287
1.43786
1.44713
1.45494
1.45973
1.46046
1.45693
1.44956
1.43909
1.42633
1.41206
1.39697
1.38151
1.36588
1.34998
1.33349
1.31587
1.2964
1.27436
1.24923
1.22093
1.19001
1.15773
1.12595
1.09682
1.07241
1.05442
1.04403
1.04197
1.04852
1.06338
1.08556
1.11334
1.14451
1.17674
1.208
1.2368
1.26242
1.28489
1.30487
1.32329
1.34112
1.35907
1.37745
1.39605
1.41419
1.43078
1.44455
1.45439
1.45963
1.46027
1.45696
1.45082
1.44309
1.43494
1.4272
1.42041
1.4148
1.41038
1.40705
1.40463
1.40293
1.40178
1.40102
1.40055
1.40026
1.40009
1.40001
1.39997
1.39995
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40008
1.40011
1.40015
1.40021
1.40031
1.40046
1.40071
1.40112
1.40178
1.40283
1.40446
1.40693
1.41053
1.41558
1.42227
1.4306
1.43996
1.4491
1.45636
1.46023
1.45983
1.45513
1.44668
1.43529
1.42178
1.40692
1.39137
1.37553
1.35945
1.3429
1.3254
1.30623
1.2845
1.25925
1.22985
1.19622
1.15915
1.12037
1.08229
1.04758
1.01869
0.997483
0.985252
0.982842
0.990649
1.00844
1.03508
1.06853
1.10611
1.14496
1.18255
1.21699
1.24727
1.27326
1.29562
1.31549
1.33408
1.3524
1.371
1.38991
1.40858
1.42599
1.44086
1.45197
1.4585
1.46029
1.45787
1.45229
1.44481
1.43666
1.42876
1.42173
1.41586
1.4112
1.40765
1.40506
1.40323
1.40198
1.40116
1.40064
1.40032
1.40013
1.40003
1.39998
1.39996
1.39996
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40007
1.4001
1.40015
1.40021
1.40031
1.40047
1.40074
1.40118
1.40189
1.40303
1.4048
1.40745
1.41131
1.41668
1.42373
1.43236
1.44185
1.45079
1.45747
1.46044
1.459
1.45324
1.44383
1.43165
1.41749
1.40213
1.38618
1.36997
1.35344
1.33616
1.31751
1.29659
1.27231
1.24351
1.20936
1.16985
1.12609
1.08034
1.03565
0.995212
0.961734
0.937221
0.923045
0.920182
0.929188
0.949924
0.98118
1.02059
1.06495
1.11086
1.15525
1.19584
1.23129
1.26129
1.28646
1.30807
1.32759
1.34633
1.36515
1.38428
1.40334
1.42141
1.43721
1.44945
1.45718
1.46007
1.45852
1.45351
1.44633
1.43822
1.43021
1.42298
1.41686
1.41197
1.40823
1.40548
1.40353
1.40219
1.4013
1.40073
1.40038
1.40017
1.40006
1.4
1.39997
1.39997
1.39997
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40003
1.40004
1.40005
1.40007
1.4001
1.40014
1.40021
1.40031
1.40048
1.40076
1.40124
1.402
1.40322
1.40512
1.40795
1.41205
1.41772
1.42509
1.43398
1.44354
1.45224
1.45832
1.46044
1.45804
1.45134
1.44109
1.42822
1.41352
1.39772
1.38142
1.36487
1.34786
1.3298
1.30987
1.28704
1.26002
1.2274
1.18821
1.14252
1.09179
1.03892
0.987601
0.941473
0.903489
0.875709
0.859573
0.856184
0.866282
0.889843
0.925618
0.97097
1.02222
1.07536
1.12679
1.17379
1.21473
1.24908
1.2774
1.30103
1.32165
1.34089
1.3599
1.37918
1.39852
1.41712
1.4337
1.44693
1.45573
1.45964
1.45894
1.45451
1.44764
1.43962
1.43153
1.42412
1.4178
1.41271
1.40878
1.40588
1.40381
1.40239
1.40143
1.40082
1.40044
1.40021
1.40008
1.40002
1.39999
1.39997
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40003
1.40003
1.40005
1.40007
1.40009
1.40013
1.4002
1.40031
1.40048
1.40078
1.40129
1.4021
1.4034
1.40541
1.40841
1.41274
1.41868
1.42634
1.43542
1.44501
1.45344
1.45894
1.46027
1.45702
1.4495
1.43852
1.42506
1.40991
1.39374
1.37711
1.36023
1.34274
1.32385
1.30256
1.27772
1.24785
1.21134
1.16707
1.11517
1.05754
0.997705
0.939991
0.888459
0.84623
0.815404
0.797455
0.793591
0.804679
0.830802
0.870721
0.921632
0.979471
1.03966
1.09805
1.15147
1.19798
1.23685
1.26853
1.29437
1.31625
1.33607
1.35528
1.37465
1.39419
1.41317
1.4304
1.44448
1.45424
1.45909
1.45917
1.45531
1.44876
1.44085
1.43271
1.42516
1.41866
1.41338
1.4093
1.40626
1.40408
1.40258
1.40157
1.40091
1.4005
1.40025
1.40011
1.40004
1.4
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40006
1.40009
1.40013
1.40019
1.4003
1.40049
1.4008
1.40133
1.40219
1.40356
1.40568
1.40884
1.41336
1.41954
1.42745
1.43669
1.44626
1.45443
1.45938
1.46
1.45601
1.44778
1.43618
1.42222
1.40669
1.39021
1.37328
1.35606
1.3381
1.31838
1.29571
1.26881
1.23611
1.19584
1.14671
1.08892
1.02479
0.958466
0.894857
0.838412
0.792407
0.758971
0.739565
0.735417
0.747442
0.775762
0.819182
0.874881
0.938575
1.00523
1.07014
1.12967
1.18157
1.22491
1.25999
1.28816
1.3114
1.33186
1.35129
1.37072
1.39036
1.40963
1.42737
1.44217
1.45276
1.45844
1.45924
1.45592
1.44969
1.4419
1.43374
1.42608
1.41943
1.414
1.40976
1.40661
1.40433
1.40275
1.40169
1.401
1.40056
1.4003
1.40014
1.40006
1.40001
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40003
1.40004
1.40005
1.40008
1.40012
1.40018
1.40029
1.40048
1.40081
1.40136
1.40226
1.4037
1.40592
1.40921
1.4139
1.4203
1.42841
1.43778
1.44731
1.45522
1.45969
1.45968
1.45505
1.44625
1.43413
1.41973
1.4039
1.38716
1.36994
1.35239
1.33397
1.31346
1.28944
1.26053
1.22515
1.18141
1.12792
1.06492
0.995049
0.922997
0.854221
0.793534
0.744399
0.708952
0.688583
0.684442
0.697373
0.727464
0.773578
0.833008
0.901465
0.97362
1.04426
1.10929
1.16613
1.21365
1.25201
1.28249
1.30713
1.32827
1.34792
1.36738
1.38707
1.40653
1.42467
1.44005
1.45136
1.45776
1.45921
1.45637
1.45045
1.44278
1.43462
1.42688
1.42011
1.41453
1.41018
1.40691
1.40456
1.40292
1.40181
1.40108
1.40062
1.40034
1.40017
1.40008
1.40003
1.4
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40005
1.40007
1.40011
1.40017
1.40028
1.40048
1.40081
1.40138
1.40232
1.40381
1.40611
1.40953
1.41437
1.42093
1.42922
1.43868
1.44815
1.45583
1.4599
1.45936
1.45419
1.44493
1.43239
1.41762
1.40153
1.3846
1.36713
1.34924
1.33039
1.30918
1.28392
1.25314
1.21529
1.16855
1.11144
1.0442
0.969668
0.892926
0.819888
0.755757
0.704208
0.667375
0.646518
0.642633
0.656411
0.687844
0.735833
0.797861
0.869799
0.946227
1.02154
1.09121
1.15231
1.20351
1.24484
1.27748
1.30348
1.32531
1.34518
1.36465
1.38433
1.40391
1.42234
1.43819
1.45008
1.4571
1.4591
1.45669
1.45104
1.4435
1.43535
1.42755
1.42067
1.41499
1.41053
1.40718
1.40476
1.40306
1.40191
1.40115
1.40067
1.40037
1.4002
1.4001
1.40004
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40003
1.40004
1.40006
1.4001
1.40016
1.40027
1.40047
1.40081
1.4014
1.40236
1.40389
1.40626
1.40978
1.41474
1.42144
1.42986
1.4394
1.4488
1.45629
1.46004
1.45907
1.45347
1.44385
1.431
1.41593
1.39962
1.38254
1.36486
1.34665
1.3274
1.30561
1.27933
1.24691
1.20691
1.15768
1.09783
1.02755
0.949686
0.869507
0.793261
0.726529
0.673221
0.635483
0.614432
0.610891
0.625392
0.657793
0.706978
0.770586
0.844747
0.924135
1.00293
1.0762
1.1407
1.19493
1.23876
1.27329
1.30052
1.32297
1.34305
1.36251
1.38214
1.40177
1.4204
1.43661
1.44897
1.45649
1.45895
1.4569
1.45148
1.44406
1.43593
1.42808
1.42113
1.41536
1.41083
1.40741
1.40492
1.40318
1.402
1.40122
1.40072
1.40041
1.40022
1.40012
1.40006
1.40002
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40005
1.40008
1.40014
1.40025
1.40045
1.4008
1.4014
1.40238
1.40395
1.40636
1.40995
1.41501
1.42181
1.43033
1.43992
1.44928
1.45661
1.46014
1.45885
1.45291
1.44303
1.42997
1.41468
1.39817
1.38098
1.36316
1.34466
1.32503
1.3028
1.27579
1.24209
1.20031
1.14915
1.08745
1.01539
0.935657
0.853448
0.775145
0.706639
0.652103
0.61374
0.592574
0.589291
0.604307
0.637364
0.687251
0.751661
0.826962
0.908054
0.989075
1.06483
1.13179
1.18826
1.23402
1.27005
1.29829
1.32128
1.34153
1.36095
1.38051
1.40013
1.41889
1.43535
1.44805
1.45596
1.45877
1.45701
1.45177
1.44445
1.43634
1.42847
1.42147
1.41564
1.41105
1.40758
1.40506
1.40328
1.40208
1.40128
1.40076
1.40044
1.40025
1.40013
1.40007
1.40003
1.40002
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40004
1.40007
1.40013
1.40023
1.40043
1.40078
1.40138
1.40238
1.40397
1.40642
1.41005
1.41518
1.42204
1.43062
1.44025
1.44958
1.45681
1.46019
1.45873
1.45254
1.44248
1.42933
1.4139
1.3972
1.37991
1.36204
1.34332
1.32334
1.30079
1.27338
1.23889
1.19584
1.14328
1.08048
1.00776
0.927579
0.844781
0.765632
0.696194
0.640891
0.602075
0.580758
0.577544
0.5928
0.626212
0.676424
0.741066
0.816649
0.89834
0.980397
1.05749
1.1259
1.18378
1.23082
1.2679
1.29688
1.32026
1.34061
1.35997
1.37943
1.399
1.41781
1.43443
1.44737
1.45554
1.4586
1.45704
1.45194
1.44469
1.43661
1.42872
1.42169
1.41583
1.4112
1.4077
1.40515
1.40336
1.40214
1.40132
1.4008
1.40047
1.40027
1.40015
1.40008
1.40004
1.40002
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40003
1.40005
1.40011
1.40021
1.40041
1.40076
1.40136
1.40236
1.40396
1.40642
1.41007
1.41524
1.42213
1.43072
1.44038
1.44972
1.4569
1.46022
1.4587
1.4524
1.44222
1.42904
1.41359
1.39676
1.37936
1.36148
1.34266
1.3224
1.29961
1.27213
1.23742
1.19377
1.14039
1.0771
1.00455
0.925049
0.842957
0.764152
0.694669
0.63914
0.600131
0.5787
0.575389
0.590581
0.623982
0.674137
0.738522
0.813688
0.895042
0.977055
1.05441
1.12326
1.18167
1.2293
1.26693
1.29632
1.31991
1.34029
1.35955
1.37889
1.39838
1.41718
1.43387
1.44693
1.45525
1.45845
1.457
1.45198
1.44478
1.43671
1.42883
1.42179
1.41592
1.41128
1.40777
1.40521
1.40341
1.40218
1.40136
1.40083
1.4005
1.40029
1.40017
1.4001
1.40005
1.40003
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40002
1.40004
1.40009
1.40019
1.40038
1.40072
1.40132
1.40231
1.40392
1.40637
1.41002
1.41518
1.42207
1.43066
1.44033
1.44969
1.45688
1.46023
1.45876
1.45248
1.44227
1.42912
1.41374
1.39686
1.37934
1.36145
1.34268
1.32231
1.29936
1.272
1.23765
1.1942
1.14076
1.07755
1.00572
0.927631
0.847197
0.769795
0.701222
0.646207
0.607501
0.586193
0.582758
0.59761
0.63057
0.680172
0.743753
0.817839
0.898019
0.979007
1.05559
1.12392
1.18203
1.22954
1.26719
1.29664
1.32025
1.34056
1.35969
1.37888
1.39826
1.417
1.43368
1.44675
1.45509
1.45833
1.4569
1.4519
1.44471
1.43666
1.4288
1.42177
1.41592
1.41129
1.40779
1.40523
1.40344
1.40221
1.40139
1.40086
1.40052
1.40031
1.40018
1.40011
1.40006
1.40004
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40002
1.40007
1.40016
1.40035
1.40068
1.40127
1.40225
1.40383
1.40628
1.40989
1.41501
1.42187
1.43042
1.44007
1.44948
1.45677
1.46023
1.45891
1.45278
1.44264
1.42956
1.41432
1.39752
1.37991
1.36198
1.34334
1.32306
1.30012
1.27302
1.23944
1.19702
1.1445
1.08216
1.01154
0.935269
0.857073
0.781883
0.715161
0.66157
0.623898
0.603162
0.599723
0.614036
0.646097
0.694541
0.756654
0.828929
0.9071
0.986118
1.06096
1.12784
1.18483
1.23155
1.2687
1.29787
1.32128
1.34141
1.36037
1.3794
1.39865
1.41727
1.43385
1.44683
1.45508
1.45824
1.45674
1.4517
1.4445
1.43646
1.42862
1.42163
1.41581
1.41122
1.40775
1.40522
1.40344
1.40222
1.4014
1.40087
1.40054
1.40033
1.4002
1.40012
1.40007
1.40005
1.40003
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.40001
1.40005
1.40014
1.40031
1.40064
1.40121
1.40217
1.40372
1.40612
1.40968
1.41473
1.42152
1.43
1.43962
1.44908
1.45654
1.46022
1.45914
1.45327
1.44332
1.43037
1.41531
1.39869
1.3811
1.36311
1.3446
1.32462
1.30195
1.27526
1.24268
1.20192
1.15136
1.09096
1.02234
0.94835
0.872808
0.800422
0.736376
0.685123
0.649259
0.629582
0.626303
0.63992
0.670646
0.717297
0.777193
0.846835
0.922108
0.998215
1.07035
1.13489
1.18997
1.23527
1.27144
1.29998
1.32298
1.34284
1.36159
1.38045
1.39953
1.418
1.43439
1.44717
1.45521
1.45817
1.45652
1.45139
1.44414
1.43611
1.42831
1.42138
1.41562
1.41108
1.40765
1.40516
1.40341
1.40221
1.40141
1.40088
1.40055
1.40034
1.40021
1.40013
1.40008
1.40005
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39998
1.39999
1.40003
1.40011
1.40027
1.40058
1.40114
1.40207
1.40357
1.40592
1.4094
1.41435
1.42103
1.42942
1.43899
1.4485
1.45616
1.46016
1.45944
1.45392
1.44429
1.43157
1.41671
1.40034
1.3829
1.3649
1.34647
1.32688
1.30479
1.27879
1.24735
1.2086
1.16082
1.10352
1.03802
0.967171
0.894891
0.825915
0.765263
0.717076
0.683571
0.665244
0.662184
0.674947
0.703943
0.748207
0.805146
0.871312
0.942761
1.015
1.0835
1.14484
1.19729
1.24058
1.27533
1.30293
1.32535
1.34483
1.36334
1.38201
1.40091
1.41916
1.43528
1.44775
1.45547
1.45812
1.45624
1.45094
1.44363
1.4356
1.42785
1.421
1.41533
1.41087
1.40751
1.40507
1.40336
1.40218
1.4014
1.40089
1.40056
1.40035
1.40022
1.40014
1.40009
1.40006
1.40004
1.40003
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39998
1.39997
1.39997
1.39998
1.40001
1.40008
1.40024
1.40053
1.40106
1.40195
1.4034
1.40567
1.40905
1.41387
1.4204
1.42866
1.43817
1.44774
1.45564
1.46005
1.45979
1.45473
1.44551
1.43313
1.41853
1.40244
1.38527
1.36738
1.34902
1.32979
1.30848
1.28354
1.25352
1.21693
1.17232
1.11902
1.05784
0.991305
0.923269
0.85853
0.801987
0.757362
0.726413
0.709428
0.706491
0.718222
0.745171
0.786539
0.839866
0.901781
0.968537
1.03598
1.09998
1.15735
1.20654
1.24731
1.28028
1.30667
1.32834
1.34738
1.36562
1.38408
1.40277
1.42075
1.43652
1.44856
1.45583
1.45807
1.45586
1.45036
1.44296
1.43494
1.42726
1.42051
1.41495
1.41059
1.40732
1.40495
1.40328
1.40214
1.40138
1.40088
1.40056
1.40036
1.40023
1.40015
1.4001
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39997
1.39996
1.39996
1.39999
1.40005
1.40019
1.40046
1.40097
1.40182
1.40321
1.40538
1.40864
1.41331
1.41965
1.42773
1.43715
1.44678
1.45494
1.45982
1.46016
1.45567
1.44696
1.435
1.42076
1.40498
1.38813
1.37051
1.35232
1.33339
1.31286
1.28925
1.26102
1.22684
1.18561
1.13671
1.08067
1.01953
0.956877
0.897404
0.8457
0.804921
0.776463
0.760658
0.75772
0.768294
0.792966
0.831056
0.880221
0.93723
0.998569
1.06046
1.1192
1.17198
1.21739
1.25526
1.28614
1.31114
1.33194
1.35048
1.36841
1.38666
1.40511
1.42275
1.43807
1.44957
1.45627
1.458
1.45539
1.44964
1.44214
1.43413
1.42654
1.41992
1.41449
1.41026
1.40709
1.40479
1.40319
1.40209
1.40135
1.40087
1.40056
1.40036
1.40023
1.40015
1.4001
1.40007
1.40005
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39997
1.39996
1.39995
1.39995
1.39997
1.40002
1.40015
1.40041
1.40087
1.40167
1.40299
1.40506
1.40818
1.41266
1.41878
1.42665
1.43594
1.44562
1.45406
1.45946
1.46049
1.45671
1.4486
1.43716
1.42335
1.40795
1.39147
1.37421
1.35633
1.33776
1.31793
1.29568
1.26951
1.2381
1.20046
1.15614
1.10557
1.05045
0.99406
0.940749
0.894452
0.857633
0.831561
0.816861
0.813904
0.823274
0.845533
0.880077
0.92468
0.976281
1.03167
1.08748
1.14046
1.18818
1.22947
1.26417
1.29276
1.31624
1.3361
1.35409
1.37173
1.38974
1.40791
1.42514
1.43991
1.45075
1.45676
1.45788
1.4548
1.44877
1.44116
1.43318
1.4257
1.41923
1.41396
1.40986
1.40681
1.40461
1.40307
1.40202
1.40131
1.40085
1.40055
1.40036
1.40024
1.40016
1.40011
1.40007
1.40005
1.40004
1.40003
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39998
1.39997
1.39995
1.39994
1.39994
1.39995
1.4
1.40011
1.40034
1.40077
1.40152
1.40276
1.40471
1.40766
1.41194
1.41782
1.42543
1.43454
1.44424
1.45296
1.45892
1.46072
1.45778
1.45041
1.43956
1.42627
1.41133
1.39527
1.37843
1.36097
1.34287
1.32374
1.30275
1.27866
1.2502
1.21641
1.17684
1.13186
1.083
1.03331
0.986598
0.945877
0.912976
0.889292
0.875794
0.872898
0.881065
0.900835
0.93168
0.97148
1.01738
1.06649
1.11593
1.1629
1.20537
1.24236
1.27378
1.3
1.32189
1.34077
1.35823
1.37555
1.39332
1.41116
1.42789
1.44199
1.45204
1.45725
1.45766
1.45407
1.44773
1.44001
1.43208
1.42474
1.41844
1.41335
1.40942
1.4065
1.4044
1.40294
1.40194
1.40127
1.40083
1.40054
1.40036
1.40024
1.40016
1.40011
1.40008
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39995
1.39993
1.39993
1.39993
1.39997
1.40007
1.40028
1.40067
1.40136
1.40252
1.40434
1.40712
1.41116
1.41676
1.42409
1.43297
1.44264
1.45164
1.45819
1.46081
1.4588
1.45233
1.44219
1.42947
1.41504
1.39949
1.38313
1.36616
1.34863
1.33026
1.31046
1.2883
1.26273
1.23283
1.19809
1.15875
1.11624
1.07336
1.03318
0.997791
0.968674
0.947478
0.93535
0.932582
0.939551
0.956834
0.983942
1.01885
1.05895
1.10174
1.14477
1.18573
1.22296
1.25569
1.28384
1.30771
1.32802
1.34594
1.36286
1.37988
1.39738
1.41482
1.43096
1.44426
1.45339
1.45769
1.45732
1.45317
1.44652
1.43871
1.43084
1.42366
1.41757
1.41268
1.40893
1.40616
1.40417
1.40279
1.40185
1.40122
1.4008
1.40053
1.40035
1.40024
1.40016
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39997
1.39996
1.39994
1.39993
1.39992
1.39992
1.39995
1.40004
1.40022
1.40057
1.4012
1.40226
1.40396
1.40654
1.41034
1.41563
1.42263
1.43123
1.44082
1.45006
1.45721
1.4607
1.45972
1.45426
1.44499
1.43293
1.41906
1.40405
1.38825
1.37185
1.35495
1.33738
1.31875
1.29838
1.27547
1.24922
1.21912
1.18531
1.14908
1.11282
1.07875
1.04825
1.0228
1.00423
0.99356
0.990924
0.996741
1.01165
1.03513
1.06521
1.0996
1.13622
1.17306
1.20824
1.24044
1.26911
1.29414
1.31576
1.33456
1.35158
1.36799
1.38471
1.40189
1.41886
1.43429
1.44666
1.45475
1.45803
1.45682
1.45207
1.44512
1.43724
1.42947
1.42249
1.41663
1.41197
1.40841
1.4058
1.40393
1.40263
1.40175
1.40116
1.40077
1.40051
1.40034
1.40023
1.40016
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.39991
1.39991
1.39992
1.4
1.40016
1.40047
1.40105
1.40201
1.40357
1.40596
1.40948
1.41445
1.42108
1.42936
1.43879
1.44821
1.45593
1.46034
1.46045
1.45612
1.44787
1.43662
1.42337
1.40891
1.3937
1.37795
1.36174
1.34501
1.32751
1.3088
1.28827
1.2653
1.23944
1.2108
1.18048
1.15025
1.12161
1.09559
1.07377
1.0579
1.04868
1.04618
1.05098
1.06374
1.08379
1.10924
1.13818
1.16898
1.20004
1.22986
1.25744
1.28235
1.30451
1.32406
1.34147
1.35765
1.37361
1.39001
1.40683
1.42323
1.43781
1.44911
1.45602
1.4582
1.4561
1.45077
1.44352
1.43561
1.42798
1.42123
1.41563
1.41121
1.40786
1.40541
1.40367
1.40247
1.40164
1.4011
1.40073
1.40049
1.40034
1.40023
1.40016
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.3999
1.39989
1.39991
1.39996
1.4001
1.40038
1.40089
1.40176
1.40317
1.40536
1.40861
1.41323
1.41947
1.42736
1.43656
1.44608
1.45433
1.45967
1.46094
1.45783
1.45073
1.44044
1.42793
1.41407
1.39944
1.38435
1.36889
1.35302
1.33663
1.31943
1.30102
1.28092
1.25882
1.2348
1.20965
1.18463
1.16071
1.13883
1.12055
1.10729
1.09945
1.09715
1.10116
1.11201
1.12884
1.14995
1.17385
1.19933
1.22518
1.25021
1.27366
1.29524
1.31484
1.33254
1.34872
1.36416
1.37969
1.39577
1.41215
1.42785
1.44144
1.45152
1.45714
1.45814
1.45513
1.44922
1.44173
1.43384
1.42639
1.4199
1.41458
1.41042
1.40729
1.40502
1.40341
1.40229
1.40154
1.40103
1.40069
1.40047
1.40032
1.40023
1.40016
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39995
1.39994
1.39992
1.3999
1.39989
1.39989
1.39993
1.40005
1.40029
1.40074
1.40152
1.40279
1.40478
1.40774
1.412
1.41781
1.42527
1.43417
1.44368
1.45238
1.45862
1.46109
1.4593
1.45346
1.44428
1.43266
1.41949
1.40545
1.39098
1.37626
1.36129
1.34597
1.33016
1.31361
1.29601
1.27714
1.25702
1.23622
1.21559
1.19578
1.17769
1.1627
1.15181
1.14519
1.14319
1.14663
1.15575
1.16957
1.18669
1.20608
1.2269
1.24819
1.26906
1.28898
1.30769
1.32508
1.34117
1.35629
1.37109
1.38623
1.40195
1.41779
1.43265
1.44508
1.45378
1.45801
1.45779
1.45386
1.44743
1.43975
1.43192
1.42471
1.41852
1.4135
1.40962
1.40672
1.40462
1.40314
1.40212
1.40143
1.40096
1.40065
1.40045
1.40031
1.40022
1.40016
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39997
1.39995
1.39994
1.39992
1.39989
1.39988
1.39987
1.39991
1.4
1.40021
1.4006
1.40128
1.40242
1.4042
1.40689
1.41077
1.41612
1.42312
1.43163
1.44103
1.45007
1.45714
1.46083
1.46043
1.45597
1.44803
1.43745
1.4251
1.41171
1.39785
1.38381
1.36966
1.35537
1.34085
1.32596
1.3105
1.29429
1.27738
1.26018
1.24323
1.22698
1.21225
1.20014
1.19124
1.18571
1.18409
1.18708
1.19458
1.20559
1.21915
1.23467
1.25155
1.26902
1.28641
1.30336
1.31968
1.33522
1.34995
1.36417
1.37842
1.39319
1.40848
1.42366
1.43751
1.44861
1.4558
1.45854
1.45708
1.45229
1.44538
1.43759
1.42989
1.42295
1.41709
1.4124
1.4088
1.40614
1.40422
1.40287
1.40194
1.40132
1.40089
1.40061
1.40042
1.4003
1.40021
1.40015
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39995
1.39994
1.39992
1.39989
1.39988
1.39986
1.39989
1.39996
1.40013
1.40047
1.40107
1.40207
1.40364
1.40605
1.40956
1.41444
1.42093
1.42899
1.43816
1.44739
1.4552
1.46008
1.46112
1.45814
1.45158
1.44218
1.43078
1.41816
1.40494
1.39152
1.37809
1.36472
1.35136
1.33792
1.32425
1.31024
1.29597
1.28174
1.26782
1.25456
1.24267
1.23293
1.22566
1.22111
1.21989
1.22241
1.22833
1.23683
1.24738
1.25972
1.2734
1.28777
1.30234
1.3169
1.33127
1.34528
1.35889
1.37236
1.38614
1.40052
1.41529
1.42965
1.4423
1.45189
1.45744
1.45865
1.45597
1.45037
1.44308
1.43526
1.42776
1.42114
1.41565
1.4113
1.408
1.40556
1.40382
1.40261
1.40177
1.40121
1.40083
1.40057
1.4004
1.40028
1.4002
1.40015
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.39989
1.39987
1.39986
1.39987
1.39993
1.40007
1.40035
1.40087
1.40173
1.40313
1.40526
1.40839
1.41281
1.41875
1.42628
1.43511
1.44438
1.45277
1.45877
1.46126
1.45985
1.45479
1.44672
1.43643
1.4247
1.4122
1.39939
1.38661
1.37401
1.36162
1.34937
1.33718
1.325
1.31292
1.30105
1.28955
1.27873
1.26917
1.2613
1.25536
1.25168
1.25075
1.25272
1.25714
1.26353
1.27172
1.28158
1.29273
1.30466
1.31703
1.32971
1.34254
1.35532
1.36802
1.38086
1.39421
1.40815
1.42228
1.43562
1.44686
1.45478
1.4586
1.45827
1.45442
1.44811
1.44055
1.43278
1.42556
1.41931
1.4142
1.41021
1.4072
1.405
1.40344
1.40235
1.4016
1.4011
1.40076
1.40053
1.40037
1.40027
1.40019
1.40014
1.4001
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.39989
1.39987
1.39985
1.39985
1.3999
1.40001
1.40024
1.40068
1.40143
1.40264
1.40451
1.40728
1.41123
1.41661
1.42356
1.43193
1.44109
1.44988
1.45685
1.46076
1.46097
1.45752
1.45092
1.44189
1.4312
1.41952
1.4074
1.39524
1.38329
1.37166
1.36035
1.34936
1.33867
1.32827
1.31822
1.30863
1.29979
1.29204
1.28562
1.28075
1.27776
1.27697
1.27831
1.28148
1.28627
1.29273
1.30075
1.30998
1.32003
1.33072
1.34196
1.35358
1.36538
1.37734
1.38966
1.40257
1.41598
1.42929
1.4414
1.45103
1.45712
1.45915
1.45732
1.4524
1.44552
1.43781
1.4302
1.42332
1.41748
1.41278
1.40915
1.40643
1.40446
1.40307
1.4021
1.40144
1.401
1.40069
1.40049
1.40035
1.40025
1.40018
1.40013
1.4001
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.3999
1.39987
1.39985
1.39985
1.39987
1.39996
1.40015
1.40052
1.40116
1.40219
1.40382
1.40625
1.40973
1.41455
1.42087
1.42869
1.43756
1.44655
1.45431
1.45954
1.46138
1.45964
1.45464
1.44702
1.43751
1.42679
1.41545
1.40394
1.3926
1.38158
1.37102
1.36094
1.35134
1.34216
1.33348
1.32541
1.31808
1.31166
1.30634
1.30232
1.29985
1.29906
1.29985
1.30208
1.3058
1.31107
1.31777
1.32556
1.33422
1.34367
1.35383
1.3645
1.37551
1.38685
1.3987
1.41113
1.42388
1.43615
1.44679
1.45462
1.45878
1.45902
1.45576
1.44992
1.44262
1.4349
1.42755
1.42107
1.41568
1.41139
1.40812
1.4057
1.40395
1.40272
1.40187
1.40129
1.4009
1.40063
1.40045
1.40032
1.40023
1.40017
1.40012
1.40009
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39998
1.39996
1.39994
1.39993
1.3999
1.39987
1.39985
1.39984
1.39985
1.39992
1.40008
1.40037
1.40091
1.40179
1.40318
1.40529
1.40834
1.41259
1.41827
1.42545
1.43388
1.44284
1.45118
1.45757
1.46098
1.46099
1.45771
1.45165
1.44347
1.43386
1.42341
1.41264
1.4019
1.39146
1.38151
1.3721
1.36324
1.35497
1.34733
1.34034
1.33405
1.3286
1.32412
1.32074
1.3186
1.31777
1.3182
1.31987
1.32292
1.32741
1.33315
1.3399
1.34756
1.35611
1.36545
1.37536
1.38572
1.39653
1.4079
1.41977
1.43165
1.44264
1.45159
1.45745
1.45961
1.45812
1.45359
1.44701
1.43946
1.43186
1.42487
1.41884
1.41392
1.41006
1.40714
1.405
1.40347
1.4024
1.40165
1.40115
1.4008
1.40057
1.40041
1.4003
1.40022
1.40016
1.40012
1.40009
1.40006
1.40005
1.40003
1.40003
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39995
1.39993
1.39991
1.39988
1.39985
1.39984
1.39984
1.39989
1.40001
1.40026
1.40069
1.40144
1.40262
1.40441
1.40705
1.41076
1.41579
1.42228
1.43013
1.43886
1.4475
1.45482
1.45969
1.46143
1.45995
1.45559
1.44891
1.44056
1.43115
1.4212
1.41115
1.4013
1.39188
1.38298
1.37468
1.36708
1.36015
1.35388
1.34831
1.34357
1.33969
1.33675
1.33484
1.33402
1.33426
1.33566
1.33834
1.3423
1.34735
1.35336
1.36031
1.36821
1.37691
1.38621
1.396
1.4063
1.41715
1.42829
1.43908
1.44853
1.45556
1.45933
1.45952
1.45643
1.45082
1.44372
1.4361
1.42876
1.4222
1.41668
1.41224
1.4088
1.40623
1.40436
1.40302
1.40209
1.40145
1.40101
1.40072
1.40051
1.40037
1.40027
1.4002
1.40015
1.40011
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39995
1.39993
1.39991
1.39989
1.39986
1.39984
1.39983
1.39987
1.39996
1.40015
1.40051
1.40112
1.40211
1.40364
1.40589
1.40909
1.41348
1.41924
1.42641
1.4347
1.44337
1.45134
1.45746
1.46086
1.46122
1.45865
1.45361
1.44669
1.43847
1.4295
1.42023
1.41102
1.40212
1.39369
1.38588
1.37875
1.37228
1.36649
1.36145
1.35721
1.35374
1.35111
1.34939
1.34862
1.34883
1.35013
1.3526
1.35618
1.36074
1.36624
1.37271
1.38011
1.38827
1.39703
1.40629
1.41607
1.42626
1.43646
1.44589
1.45354
1.45848
1.46013
1.45845
1.45395
1.44752
1.44011
1.43262
1.42565
1.4196
1.4146
1.41065
1.40762
1.40538
1.40376
1.40261
1.40182
1.40127
1.40089
1.40064
1.40046
1.40033
1.40025
1.40018
1.40014
1.4001
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39991
1.39989
1.39987
1.39984
1.39984
1.39985
1.39991
1.40007
1.40035
1.40086
1.40168
1.40295
1.40485
1.40758
1.41136
1.41641
1.42282
1.43048
1.43892
1.44723
1.45432
1.45922
1.46135
1.46065
1.45738
1.45204
1.44518
1.43734
1.42898
1.4205
1.41218
1.40425
1.39688
1.39012
1.384
1.37859
1.37394
1.37001
1.36681
1.36442
1.36288
1.36222
1.36248
1.36375
1.36608
1.36938
1.3736
1.37875
1.38486
1.39184
1.39953
1.40776
1.41649
1.42565
1.435
1.44399
1.45178
1.45741
1.46017
1.45974
1.45638
1.45075
1.44376
1.43629
1.42908
1.4226
1.4171
1.41265
1.40917
1.40654
1.40461
1.40322
1.40224
1.40156
1.4011
1.40078
1.40056
1.40041
1.4003
1.40022
1.40017
1.40013
1.40009
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39997
1.39996
1.39995
1.39992
1.3999
1.39988
1.39985
1.39984
1.39984
1.39988
1.4
1.40023
1.40063
1.4013
1.40235
1.40394
1.40624
1.40946
1.4138
1.41944
1.42636
1.4343
1.44262
1.45035
1.45648
1.46027
1.46142
1.46001
1.45638
1.45103
1.44448
1.43719
1.42957
1.42195
1.41459
1.40766
1.40126
1.39548
1.39039
1.38601
1.38231
1.37933
1.37715
1.37578
1.37522
1.37554
1.37682
1.37904
1.38214
1.38612
1.39101
1.39681
1.4034
1.41059
1.41828
1.4264
1.43478
1.44306
1.45057
1.45644
1.4599
1.46047
1.45815
1.45337
1.44693
1.43967
1.43236
1.42558
1.41966
1.41475
1.41083
1.40781
1.40555
1.40391
1.40273
1.40191
1.40134
1.40095
1.40068
1.40049
1.40036
1.40027
1.4002
1.40015
1.40011
1.40009
1.40006
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39997
1.39996
1.39995
1.39993
1.39991
1.39988
1.39986
1.39984
1.39984
1.39986
1.39995
1.40013
1.40044
1.40099
1.40185
1.40316
1.40506
1.40777
1.41147
1.41633
1.42244
1.42971
1.4377
1.44569
1.45271
1.45793
1.46083
1.46129
1.45948
1.45579
1.45069
1.44463
1.43803
1.43123
1.42453
1.41812
1.41215
1.40672
1.40193
1.39778
1.3943
1.39154
1.38955
1.38831
1.38784
1.38822
1.3895
1.39163
1.39457
1.39836
1.40303
1.40851
1.41466
1.42133
1.4284
1.43577
1.44316
1.45009
1.45582
1.45959
1.46083
1.45935
1.4554
1.44956
1.44263
1.43538
1.42843
1.42219
1.41689
1.41256
1.40917
1.40658
1.40467
1.40328
1.4023
1.40161
1.40114
1.40081
1.40059
1.40043
1.40032
1.40024
1.40018
1.40014
1.4001
1.40008
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39995
1.39994
1.39992
1.39989
1.39987
1.39984
1.39984
1.39986
1.39991
1.40004
1.4003
1.40073
1.40142
1.40248
1.40406
1.4063
1.4094
1.41352
1.41882
1.42529
1.4327
1.44056
1.44807
1.45439
1.45884
1.46108
1.46113
1.45921
1.4557
1.45103
1.4456
1.43979
1.43388
1.42809
1.42263
1.41763
1.41316
1.40927
1.40602
1.40349
1.40165
1.40052
1.40014
1.40059
1.40184
1.40387
1.40668
1.4103
1.41471
1.41982
1.42547
1.43152
1.43785
1.44427
1.4504
1.45568
1.45941
1.461
1.46012
1.45685
1.45162
1.44511
1.43803
1.43104
1.4246
1.41898
1.41431
1.41057
1.40767
1.40549
1.40389
1.40273
1.40192
1.40136
1.40096
1.40069
1.40051
1.40038
1.40028
1.40021
1.40016
1.40012
1.40009
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39993
1.3999
1.39988
1.39986
1.39984
1.39985
1.39989
1.39999
1.40018
1.40051
1.40106
1.40192
1.4032
1.40504
1.4076
1.41106
1.41555
1.42117
1.42783
1.43523
1.4428
1.44978
1.45545
1.45931
1.46115
1.46104
1.45924
1.45611
1.45202
1.44733
1.44234
1.43733
1.4325
1.428
1.42392
1.42036
1.41739
1.41506
1.41338
1.41237
1.41209
1.41257
1.41378
1.4157
1.41836
1.42176
1.42586
1.4305
1.43554
1.44085
1.44626
1.45149
1.45609
1.45948
1.46109
1.46056
1.45781
1.45313
1.44705
1.44024
1.43332
1.42679
1.42096
1.41601
1.41198
1.40879
1.40635
1.40453
1.4032
1.40226
1.40159
1.40113
1.40081
1.40059
1.40044
1.40033
1.40025
1.40019
1.40014
1.40011
1.40008
1.40006
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39998
1.39996
1.39995
1.39993
1.39991
1.39989
1.39987
1.39985
1.39985
1.39987
1.39995
1.40009
1.40035
1.40078
1.40146
1.40249
1.40398
1.40607
1.40892
1.41268
1.41745
1.42327
1.42998
1.43722
1.44439
1.45086
1.456
1.45945
1.4611
1.46106
1.45957
1.45695
1.45354
1.44965
1.44555
1.44147
1.43757
1.43398
1.43083
1.42818
1.42608
1.42457
1.42371
1.42352
1.42401
1.42515
1.42694
1.42941
1.43252
1.43618
1.44023
1.44453
1.44893
1.45319
1.45698
1.45981
1.4612
1.46075
1.45833
1.45408
1.44843
1.44194
1.43519
1.42867
1.42274
1.4176
1.41332
1.40989
1.40722
1.40519
1.4037
1.40262
1.40185
1.40131
1.40094
1.40068
1.4005
1.40037
1.40028
1.40022
1.40017
1.40013
1.4001
1.40007
1.40006
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.3999
1.39988
1.39986
1.39985
1.39987
1.39992
1.40002
1.40022
1.40055
1.40108
1.4019
1.40309
1.40478
1.4071
1.41019
1.41418
1.41913
1.42502
1.43163
1.43859
1.44535
1.45134
1.45608
1.45929
1.46094
1.46113
1.46009
1.4581
1.45544
1.4524
1.44919
1.44602
1.44303
1.44036
1.4381
1.43628
1.43499
1.43428
1.43415
1.43462
1.43567
1.43731
1.43951
1.44222
1.4453
1.44862
1.45201
1.4553
1.45819
1.46033
1.46129
1.46072
1.45844
1.45451
1.44924
1.44309
1.43658
1.43017
1.42423
1.41899
1.41455
1.41093
1.40806
1.40585
1.4042
1.40299
1.40211
1.4015
1.40107
1.40077
1.40057
1.40042
1.40032
1.40024
1.40019
1.40014
1.40011
1.40009
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39995
1.39993
1.39991
1.39989
1.39987
1.39986
1.39987
1.3999
1.39997
1.40012
1.40037
1.40079
1.40143
1.40237
1.40372
1.40558
1.40809
1.41136
1.41549
1.4205
1.42634
1.43275
1.43935
1.44568
1.45126
1.4557
1.45883
1.46061
1.46114
1.46064
1.45933
1.45747
1.45528
1.45296
1.45068
1.44858
1.44676
1.44529
1.44427
1.44371
1.44364
1.44406
1.44497
1.44636
1.4482
1.45038
1.45275
1.45518
1.4575
1.45949
1.46086
1.46127
1.46042
1.45813
1.4544
1.44946
1.44365
1.43743
1.43122
1.42537
1.42012
1.41561
1.41186
1.40884
1.40648
1.40469
1.40335
1.40238
1.40169
1.40121
1.40087
1.40063
1.40047
1.40035
1.40027
1.40021
1.40016
1.40013
1.4001
1.40008
1.40006
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39997
1.39996
1.39994
1.39992
1.39991
1.39989
1.39988
1.39987
1.39989
1.39995
1.40005
1.40024
1.40056
1.40105
1.40179
1.40285
1.40433
1.40634
1.40898
1.41236
1.41654
1.42151
1.42718
1.43329
1.4395
1.4454
1.45062
1.45486
1.45798
1.45997
1.46092
1.46099
1.46038
1.45931
1.45795
1.45648
1.45503
1.45373
1.45267
1.45193
1.45153
1.4515
1.45184
1.45257
1.45365
1.45499
1.4565
1.45804
1.45945
1.46057
1.46116
1.46098
1.45977
1.45737
1.45376
1.44908
1.44361
1.43772
1.43178
1.42611
1.42095
1.41643
1.41263
1.40952
1.40705
1.40514
1.40371
1.40265
1.40189
1.40134
1.40096
1.4007
1.40051
1.40039
1.40029
1.40023
1.40018
1.40014
1.40011
1.40008
1.40007
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39998
1.39997
1.39997
1.39994
1.39993
1.39992
1.3999
1.39989
1.39988
1.39989
1.39992
1.4
1.40015
1.40038
1.40076
1.40132
1.40215
1.40331
1.4049
1.40701
1.40973
1.41314
1.41728
1.42211
1.42751
1.43325
1.43903
1.44452
1.44942
1.4535
1.45666
1.45888
1.46024
1.46087
1.46092
1.46057
1.45997
1.45925
1.45853
1.45791
1.45746
1.45722
1.45722
1.45746
1.45794
1.45861
1.45937
1.46012
1.46074
1.46107
1.46096
1.46021
1.45862
1.45607
1.45253
1.44808
1.44296
1.43743
1.43182
1.42641
1.42141
1.41699
1.4132
1.41005
1.40752
1.40554
1.40403
1.4029
1.40207
1.40147
1.40105
1.40076
1.40056
1.40042
1.40032
1.40024
1.40019
1.40015
1.40012
1.40009
1.40007
1.40006
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39997
1.39997
1.39996
1.39994
1.39993
1.39991
1.3999
1.39989
1.39989
1.39991
1.39997
1.40007
1.40025
1.40054
1.40097
1.4016
1.4025
1.40374
1.4054
1.40756
1.4103
1.41367
1.41767
1.42226
1.42733
1.43265
1.43798
1.44305
1.44764
1.45156
1.45474
1.45716
1.45887
1.45997
1.46058
1.46084
1.46085
1.46073
1.46056
1.46042
1.46034
1.46035
1.46046
1.46064
1.46084
1.46098
1.46095
1.46065
1.45996
1.45872
1.45682
1.45414
1.45067
1.44647
1.44169
1.43656
1.43132
1.42624
1.42149
1.41723
1.41353
1.41042
1.40788
1.40586
1.4043
1.40311
1.40223
1.40159
1.40114
1.40082
1.4006
1.40044
1.40034
1.40026
1.4002
1.40016
1.40013
1.4001
1.40008
1.40006
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39997
1.39996
1.39995
1.39994
1.39993
1.39991
1.3999
1.3999
1.39991
1.39995
1.40003
1.40016
1.40037
1.4007
1.40118
1.40186
1.40282
1.40411
1.4058
1.40797
1.41065
1.4139
1.4177
1.42199
1.42665
1.43151
1.43637
1.44101
1.44527
1.44899
1.45212
1.45464
1.45659
1.45803
1.45904
1.45972
1.46015
1.46041
1.46054
1.46061
1.46062
1.46058
1.46045
1.46019
1.45974
1.459
1.4579
1.45634
1.45423
1.45151
1.44816
1.44422
1.43981
1.43511
1.4303
1.4256
1.42117
1.41715
1.41361
1.4106
1.4081
1.40608
1.4045
1.40328
1.40237
1.4017
1.40121
1.40087
1.40063
1.40047
1.40035
1.40027
1.40021
1.40017
1.40013
1.40011
1.40009
1.40007
1.40005
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39997
1.39996
1.39995
1.39993
1.39993
1.39991
1.39991
1.39992
1.39994
1.4
1.40009
1.40025
1.40049
1.40085
1.40138
1.4021
1.40309
1.4044
1.40608
1.4082
1.41078
1.41384
1.41737
1.42129
1.42551
1.42989
1.43425
1.43843
1.4423
1.44576
1.44875
1.45125
1.45327
1.45486
1.45607
1.45694
1.45755
1.45792
1.4581
1.4581
1.45791
1.45752
1.45687
1.45593
1.45464
1.45294
1.45079
1.44814
1.44499
1.44137
1.43737
1.43312
1.42879
1.42452
1.42047
1.41674
1.41343
1.41056
1.40816
1.40619
1.40462
1.40339
1.40246
1.40177
1.40127
1.40091
1.40066
1.40048
1.40036
1.40028
1.40022
1.40017
1.40014
1.40011
1.40009
1.40007
1.40006
1.40005
1.40004
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39996
1.39995
1.39994
1.39993
1.39992
1.39992
1.39994
1.39998
1.40004
1.40016
1.40034
1.40061
1.401
1.40155
1.4023
1.4033
1.4046
1.40623
1.40825
1.41067
1.41349
1.4167
1.42022
1.42397
1.42783
1.43166
1.43536
1.4388
1.44192
1.44465
1.44698
1.44891
1.45044
1.45162
1.45247
1.45301
1.45327
1.45325
1.45295
1.45235
1.45144
1.45018
1.44854
1.44651
1.44406
1.4412
1.43796
1.43442
1.43067
1.42683
1.42303
1.4194
1.41602
1.41298
1.41032
1.40805
1.40617
1.40465
1.40344
1.40252
1.40182
1.40131
1.40094
1.40068
1.40049
1.40037
1.40028
1.40022
1.40017
1.40014
1.40011
1.40009
1.40007
1.40006
1.40005
1.40004
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39996
1.39996
1.39995
1.39994
1.39994
1.39993
1.39994
1.39997
1.40002
1.4001
1.40023
1.40043
1.40073
1.40113
1.4017
1.40245
1.40343
1.40468
1.40623
1.40811
1.41033
1.41288
1.41573
1.41883
1.42208
1.42541
1.42872
1.4319
1.43487
1.43756
1.43993
1.44196
1.44363
1.44495
1.44592
1.44654
1.44684
1.44681
1.44644
1.44573
1.44468
1.44327
1.4415
1.43938
1.4369
1.43411
1.43106
1.42783
1.42451
1.42121
1.41802
1.41502
1.41229
1.40987
1.40778
1.40602
1.40458
1.40342
1.40252
1.40183
1.40132
1.40095
1.40068
1.40049
1.40036
1.40027
1.40021
1.40017
1.40014
1.40011
1.40009
1.40008
1.40006
1.40005
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.4
1.39998
1.39998
1.39997
1.39996
1.39996
1.39995
1.39994
1.39994
1.39995
1.39997
1.4
1.40006
1.40016
1.4003
1.40052
1.40082
1.40124
1.40181
1.40254
1.40348
1.40466
1.4061
1.40781
1.4098
1.41204
1.41452
1.41717
1.41994
1.42275
1.42551
1.42816
1.43062
1.43284
1.43478
1.43642
1.43773
1.43871
1.43935
1.43964
1.4396
1.43921
1.43849
1.43742
1.43602
1.43429
1.43225
1.42995
1.42741
1.42471
1.42192
1.41912
1.41639
1.41379
1.4114
1.40925
1.40736
1.40576
1.40442
1.40333
1.40247
1.40181
1.40131
1.40094
1.40067
1.40048
1.40035
1.40026
1.4002
1.40016
1.40013
1.40011
1.40009
1.40007
1.40006
1.40005
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39997
1.39996
1.39995
1.39995
1.39995
1.39997
1.39999
1.40003
1.4001
1.40021
1.40037
1.4006
1.4009
1.40132
1.40187
1.40257
1.40345
1.40453
1.40584
1.40735
1.40909
1.41102
1.41313
1.41535
1.41763
1.41993
1.42217
1.42429
1.42624
1.42797
1.42945
1.43066
1.43156
1.43216
1.43243
1.43238
1.43201
1.43132
1.43033
1.42904
1.42747
1.42565
1.42363
1.42145
1.41918
1.41686
1.41458
1.41239
1.41034
1.40847
1.40682
1.40538
1.40417
1.40317
1.40237
1.40175
1.40127
1.40091
1.40065
1.40047
1.40034
1.40025
1.40019
1.40015
1.40012
1.4001
1.40008
1.40007
1.40006
1.40005
1.40004
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39997
1.39996
1.39996
1.39996
1.39997
1.39999
1.40002
1.40007
1.40015
1.40026
1.40043
1.40066
1.40096
1.40136
1.40188
1.40254
1.40334
1.40431
1.40546
1.40677
1.40826
1.40988
1.41161
1.41342
1.41526
1.41708
1.41882
1.42045
1.42191
1.42318
1.42421
1.425
1.42551
1.42575
1.4257
1.42537
1.42476
1.42388
1.42276
1.42141
1.41987
1.41818
1.41638
1.41454
1.41269
1.41088
1.40917
1.40759
1.40617
1.40492
1.40385
1.40296
1.40223
1.40165
1.4012
1.40086
1.40062
1.40044
1.40031
1.40023
1.40017
1.40013
1.40011
1.40009
1.40008
1.40006
1.40006
1.40005
1.40004
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39998
1.39997
1.39997
1.39997
1.39998
1.39999
1.40001
1.40005
1.40011
1.40019
1.40031
1.40048
1.4007
1.401
1.40138
1.40185
1.40245
1.40317
1.40401
1.40499
1.4061
1.40734
1.40866
1.41005
1.41148
1.4129
1.41429
1.41559
1.41678
1.41781
1.41866
1.4193
1.41972
1.41991
1.41987
1.41958
1.41907
1.41833
1.41739
1.41628
1.41503
1.41366
1.41223
1.41078
1.40933
1.40794
1.40664
1.40545
1.40439
1.40347
1.40269
1.40204
1.40152
1.40111
1.4008
1.40057
1.4004
1.40028
1.4002
1.40015
1.40012
1.40009
1.40008
1.40007
1.40006
1.40005
1.40004
1.40004
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39997
1.39998
1.39998
1.39999
1.40001
1.40004
1.40008
1.40014
1.40023
1.40035
1.40052
1.40073
1.401
1.40135
1.40178
1.4023
1.40293
1.40365
1.40447
1.40538
1.40637
1.40742
1.4085
1.40959
1.41066
1.41167
1.41259
1.4134
1.41407
1.41458
1.41491
1.41505
1.415
1.41476
1.41434
1.41374
1.41299
1.4121
1.41111
1.41004
1.40893
1.40782
1.40672
1.40567
1.4047
1.40382
1.40305
1.40238
1.40182
1.40137
1.401
1.40072
1.40051
1.40036
1.40025
1.40017
1.40013
1.40009
1.40007
1.40006
1.40005
1.40005
1.40004
1.40004
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.40001
1.40003
1.40006
1.40011
1.40017
1.40026
1.40038
1.40054
1.40073
1.40098
1.4013
1.40168
1.40212
1.40265
1.40325
1.40391
1.40464
1.40541
1.40622
1.40703
1.40783
1.40859
1.40929
1.4099
1.4104
1.41079
1.41103
1.41114
1.41109
1.41089
1.41055
1.41008
1.40949
1.4088
1.40804
1.40722
1.40638
1.40554
1.40473
1.40396
1.40325
1.40261
1.40206
1.40158
1.40119
1.40088
1.40063
1.40044
1.40031
1.40021
1.40014
1.4001
1.40007
1.40006
1.40005
1.40004
1.40004
1.40003
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.40001
1.40003
1.40005
1.40008
1.40013
1.4002
1.40028
1.40039
1.40054
1.40072
1.40094
1.40121
1.40154
1.40191
1.40234
1.40282
1.40335
1.40391
1.40449
1.40509
1.40567
1.40623
1.40674
1.40719
1.40756
1.40784
1.40802
1.40808
1.40804
1.40788
1.40761
1.40724
1.40679
1.40626
1.40569
1.40508
1.40445
1.40384
1.40324
1.40269
1.40218
1.40173
1.40134
1.40101
1.40075
1.40053
1.40037
1.40025
1.40017
1.40011
1.40007
1.40005
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.40001
1.40002
1.40004
1.40007
1.4001
1.40015
1.40022
1.4003
1.4004
1.40053
1.40069
1.40089
1.40111
1.40138
1.40169
1.40203
1.4024
1.4028
1.40321
1.40364
1.40406
1.40446
1.40482
1.40514
1.40541
1.4056
1.40572
1.40576
1.40571
1.40558
1.40538
1.4051
1.40475
1.40436
1.40393
1.40348
1.40303
1.40259
1.40216
1.40176
1.40141
1.4011
1.40083
1.40061
1.40044
1.4003
1.4002
1.40012
1.40007
1.40004
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.4
1.4
1.4
1.4
1.40001
1.40002
1.40003
1.40005
1.40009
1.40012
1.40016
1.40023
1.4003
1.4004
1.40051
1.40065
1.40081
1.401
1.40121
1.40145
1.40171
1.402
1.40229
1.40258
1.40287
1.40315
1.40341
1.40363
1.40381
1.40394
1.40402
1.40403
1.40399
1.40388
1.40372
1.40351
1.40325
1.40297
1.40266
1.40233
1.402
1.40169
1.40139
1.40112
1.40087
1.40066
1.40048
1.40034
1.40023
1.40014
1.40008
1.40004
1.40002
1.4
1.39999
1.39999
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40002
1.40003
1.40004
1.40006
1.4001
1.40013
1.40017
1.40023
1.4003
1.40038
1.40048
1.40059
1.40073
1.40088
1.40105
1.40122
1.40141
1.40162
1.40182
1.40202
1.40221
1.40238
1.40253
1.40265
1.40273
1.40278
1.40278
1.40273
1.40265
1.40253
1.40237
1.40218
1.40197
1.40174
1.40151
1.40128
1.40106
1.40085
1.40067
1.4005
1.40037
1.40025
1.40016
1.40009
1.40004
1.40001
1.39999
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40002
1.40002
1.40004
1.40006
1.40007
1.4001
1.40014
1.40018
1.40023
1.40029
1.40036
1.40044
1.40054
1.40064
1.40075
1.40088
1.40101
1.40114
1.40128
1.40141
1.40154
1.40165
1.40175
1.40182
1.40187
1.40189
1.40188
1.40184
1.40177
1.40168
1.40156
1.40142
1.40127
1.40111
1.40094
1.40078
1.40063
1.40049
1.40037
1.40026
1.40017
1.4001
1.40005
1.40001
1.39998
1.39997
1.39996
1.39996
1.39996
1.39997
1.39998
1.39998
1.39999
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40002
1.40002
1.40003
1.40005
1.40006
1.40009
1.40011
1.40014
1.40018
1.40023
1.40028
1.40033
1.4004
1.40047
1.40055
1.40063
1.40072
1.40081
1.4009
1.40098
1.40107
1.40114
1.4012
1.40124
1.40126
1.40127
1.40125
1.40122
1.40116
1.40109
1.401
1.4009
1.40079
1.40067
1.40056
1.40045
1.40035
1.40026
1.40018
1.40011
1.40005
1.40001
1.39998
1.39996
1.39995
1.39995
1.39995
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40002
1.40003
1.40004
1.40005
1.40007
1.40009
1.40012
1.40014
1.40017
1.40021
1.40026
1.4003
1.40035
1.4004
1.40046
1.40052
1.40058
1.40064
1.40069
1.40074
1.40078
1.40082
1.40084
1.40085
1.40084
1.40082
1.40079
1.40074
1.40069
1.40062
1.40055
1.40047
1.40039
1.40031
1.40024
1.40017
1.40011
1.40006
1.40002
1.39998
1.39996
1.39995
1.39994
1.39993
1.39994
1.39994
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40005
1.40006
1.40007
1.40009
1.40012
1.40014
1.40016
1.40019
1.40023
1.40027
1.4003
1.40034
1.40038
1.40042
1.40045
1.40049
1.40052
1.40054
1.40055
1.40056
1.40056
1.40055
1.40053
1.40051
1.40047
1.40042
1.40037
1.40032
1.40026
1.4002
1.40015
1.4001
1.40006
1.40002
1.39999
1.39996
1.39995
1.39993
1.39993
1.39993
1.39993
1.39994
1.39995
1.39995
1.39996
1.39997
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40007
1.40007
1.40009
1.40011
1.40013
1.40015
1.40017
1.4002
1.40023
1.40025
1.40028
1.4003
1.40033
1.40034
1.40036
1.40037
1.40038
1.40038
1.40037
1.40036
1.40034
1.40031
1.40028
1.40025
1.40021
1.40017
1.40013
1.40009
1.40006
1.40002
1.39999
1.39997
1.39995
1.39994
1.39993
1.39993
1.39992
1.39993
1.39994
1.39994
1.39995
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40004
1.40005
1.40006
1.40008
1.40008
1.4001
1.40012
1.40014
1.40016
1.40017
1.40019
1.40021
1.40022
1.40024
1.40025
1.40026
1.40026
1.40026
1.40026
1.40025
1.40024
1.40022
1.40019
1.40017
1.40014
1.40011
1.40008
1.40005
1.40003
1.4
1.39998
1.39996
1.39994
1.39994
1.39993
1.39993
1.39993
1.39993
1.39994
1.39994
1.39995
1.39996
1.39996
1.39997
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40005
1.40006
1.40007
1.40008
1.40009
1.40011
1.40012
1.40013
1.40015
1.40016
1.40017
1.40018
1.40018
1.40018
1.40019
1.40018
1.40017
1.40016
1.40015
1.40014
1.40012
1.4001
1.40007
1.40005
1.40003
1.40001
1.39999
1.39997
1.39996
1.39995
1.39994
1.39993
1.39993
1.39993
1.39993
1.39994
1.39994
1.39995
1.39996
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40005
1.40005
1.40007
1.40008
1.40009
1.40009
1.4001
1.40011
1.40012
1.40013
1.40013
1.40013
1.40013
1.40013
1.40013
1.40012
1.40011
1.4001
1.40008
1.40007
1.40005
1.40004
1.40002
1.4
1.39999
1.39997
1.39996
1.39995
1.39994
1.39994
1.39994
1.39994
1.39994
1.39994
1.39995
1.39995
1.39996
1.39996
1.39997
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40003
1.40003
1.40004
1.40005
1.40005
1.40006
1.40007
1.40008
1.40008
1.40009
1.40009
1.4001
1.4001
1.4001
1.4001
1.4001
1.40009
1.40009
1.40008
1.40007
1.40006
1.40004
1.40003
1.40002
1.4
1.39999
1.39998
1.39997
1.39996
1.39995
1.39995
1.39995
1.39994
1.39995
1.39995
1.39995
1.39996
1.39996
1.39997
1.39997
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40003
1.40003
1.40004
1.40004
1.40005
1.40006
1.40006
1.40006
1.40007
1.40007
1.40008
1.40008
1.40008
1.40008
1.40007
1.40007
1.40006
1.40005
1.40004
1.40004
1.40003
1.40001
1.4
1.39999
1.39998
1.39998
1.39997
1.39996
1.39996
1.39996
1.39995
1.39995
1.39996
1.39996
1.39996
1.39996
1.39997
1.39997
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40003
1.40003
1.40004
1.40004
1.40005
1.40005
1.40005
1.40006
1.40006
1.40006
1.40006
1.40006
1.40005
1.40005
1.40004
1.40004
1.40003
1.40002
1.40002
1.40001
1.4
1.39999
1.39998
1.39998
1.39997
1.39997
1.39996
1.39996
1.39996
1.39996
1.39996
1.39997
1.39997
1.39997
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40003
1.40003
1.40003
1.40004
1.40004
1.40004
1.40004
1.40004
1.40005
1.40005
1.40004
1.40004
1.40004
1.40003
1.40003
1.40002
1.40002
1.40001
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39997
1.39997
1.39997
1.39997
1.39997
1.39997
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40003
1.40003
1.40003
1.40003
1.40003
1.40004
1.40004
1.40004
1.40003
1.40003
1.40003
1.40003
1.40002
1.40002
1.40001
1.40001
1.4
1.4
1.39999
1.39999
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40003
1.40003
1.40003
1.40003
1.40003
1.40003
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39998
1.39998
1.39998
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.4
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.40001
1.40001
1.40001
1.4
1.40001
1.40001
1.4
1.40001
1.4
1.40001
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.4
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.39999
1.4
1.4
1.4
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40002
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.4
1.4
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
1.40001
)
;
boundaryField
{
emptyPatches_empt
{
type empty;
}
top_cyc
{
type cyclic;
}
bottom_cyc
{
type cyclic;
}
inlet_cyc
{
type cyclic;
}
outlet_cyc
{
type cyclic;
}
}
// ************************************************************************* //
| [
"tdg@debian"
] | tdg@debian |
|
9c04d4a87edd22a57e2e490ec9204918295dae8a | 08b8cf38e1936e8cec27f84af0d3727321cec9c4 | /data/crawl/git/old_hunk_8318.cpp | c97739420258ede351d642f1424e64eb727a76e5 | [] | no_license | ccdxc/logSurvey | eaf28e9c2d6307140b17986d5c05106d1fd8e943 | 6b80226e1667c1e0760ab39160893ee19b0e9fb1 | refs/heads/master | 2022-01-07T21:31:55.446839 | 2018-04-21T14:12:43 | 2018-04-21T14:12:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 198 | cpp | continue;
if (S_ISDIR(entry.mode))
obj = &lookup_tree(entry.sha1)->object;
else
obj = &lookup_blob(entry.sha1)->object;
refs->ref[i++] = obj;
}
set_object_refs(&item->object, refs); | [
"[email protected]"
] | |
b07c087f6707cdb9578cd8a195fa0625e0bd3ae5 | 05c7abbc0cab378e92380baffd2b3ae20f8ee7bb | /Source/me3x_dll/module2.cpp | cf737df486be7a95cf9feacbf7ef81c63dded53a | [] | no_license | matt2005/IronFelix | d80fc20d323843a869992f0768e288ea3c3aae58 | e31b0670712960d7cc767f776b803f060b6a2997 | refs/heads/master | 2021-01-18T11:00:49.657441 | 2014-11-24T11:40:25 | 2014-11-24T11:40:25 | null | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 7,859 | cpp | //---------------------------------------------------------------------------
#include <windows.h>
//---------------------------------------------------------------------------
// Important note about DLL memory management when your DLL uses the
// static version of the RunTime Library:
//
// If your DLL exports any functions that pass String objects (or structs/
// classes containing nested Strings) as parameter or function results,
// you will need to add the library MEMMGR.LIB to both the DLL project and
// any other projects that use the DLL. You will also need to use MEMMGR.LIB
// if any other projects which use the DLL will be performing new or delete
// operations on any non-TObject-derived classes which are exported from the
// DLL. Adding MEMMGR.LIB to your project will change the DLL and its calling
// EXE's to use the BORLNDMM.DLL as their memory manager. In these cases,
// the file BORLNDMM.DLL should be deployed along with your DLL.
//
// To avoid using BORLNDMM.DLL, pass string information using "char *" or
// ShortString parameters.
//
// If your DLL uses the dynamic version of the RTL, you do not need to
// explicitly add MEMMGR.LIB as this will be done implicitly for you
//---------------------------------------------------------------------------
#pragma argsused
#include <intsafe.h>
#include <strsafe.h>
#include <Modules_exp.h>
int FindFixCRC(ECU_info* dllECUinfo, int FixCRC);
//Ищет или исправляет КС
//Если FixCRC=1 то исправляет
//Возвращает 1 если успешно, 0 если ошибка
int WINAPI DllEntryPoint(HINSTANCE hinst, unsigned long reason, void* lpReserved)
{
return 1;
}
//---------------------------------------------------------------------------
char* GetLibVer()
{
char* Ver_str="Bosch M3.x-5.x ECU v.1.0.0.1";
return Ver_str;
}
int RecogniseECU (ECU_info* dllECUinfo)
{
unsigned int i, s_crc, Chks1, Chks2, Chks11, Chks21 ;
char* FileDescr="Bosch M3.x-5.x";
// char cf_crc[30];
DWORD Buffer1 = (DWORD)dllECUinfo->EcuBuffer;
unsigned char* Buffer= (unsigned char*)(Buffer1);
//Распознаем ECU
if (dllECUinfo->EcuFileSize!=0x20000 && dllECUinfo->EcuFileSize!=0x40000)
{
return 0;
}
Chks1=(*(Buffer+0xBF03)+(*(Buffer+0xBF02)<<8)+*(Buffer+0xBF05)+(*(Buffer+0xBF04)<<8))&0xFFFF;
Chks2=(*(Buffer+0xDF03)+(*(Buffer+0xDF02)<<8)+*(Buffer+0xDF05)+(*(Buffer+0xDF04)<<8))&0xFFFF;
Chks11=*(Buffer+0xBF01)+(*(Buffer+0xBF00)<<8);
Chks21=*(Buffer+0xDF01)+(*(Buffer+0xDF00)<<8);
if (Chks11 != Chks1 && Chks21 !=Chks2)
{
return 0;
}
if (!FindFixCRC(dllECUinfo, 0))
{
return 0;
}
/* for (i = 0; i < dllECUinfo->EcuFileSize; i++)
{
f_crc+= *(unsigned char*)(Buffer+i);
}
*/
StringCbLength(FileDescr, 50, &s_crc);
StringCbCopyN (dllECUinfo->ECU_Descr, 100, FileDescr, s_crc);
/* IntToChar (f_crc, cf_crc);
StringCbLength(cf_crc, 50, &s_crc);
StringCbCatN (dllECUinfo->ECU_Descr, 100, cf_crc, s_crc+1 );
*/
/* FindOffset=FindHexStr(0, dllECUinfo->EcuFileSize, (unsigned char*)Buffer , HexBytes, HexCount);
f_crc=SummInt8(0, dllECUinfo->EcuFileSize-1, (unsigned char*)Buffer );
s_crc=SummInt16Intel(0, dllECUinfo->EcuFileSize-1, (unsigned char*)Buffer );
s_crc=SummInt16Mot(0, dllECUinfo->EcuFileSize-1, (unsigned char*)Buffer );
*/
return 1;
}
int FixChkSum(ECU_info* dllECUinfo)
{
unsigned int Chks1, Chks2, Chks11, Chks21;
DWORD Buffer1 = (DWORD)dllECUinfo->EcuBuffer;
unsigned char* Buffer= (unsigned char*)(Buffer1);
//Распознаем ECU
if (dllECUinfo->EcuFileSize!=0x20000 && dllECUinfo->EcuFileSize!=0x40000)
{
return 0;
}
Chks1=(*(Buffer+0xBF03)+(*(Buffer+0xBF02)<<8)+*(Buffer+0xBF05)+(*(Buffer+0xBF04)<<8))&0xFFFF;
Chks2=(*(Buffer+0xDF03)+(*(Buffer+0xDF02)<<8)+*(Buffer+0xDF05)+(*(Buffer+0xDF04)<<8))&0xFFFF;
Chks11=*(Buffer+0xBF01)+(*(Buffer+0xBF00)<<8);
Chks21=*(Buffer+0xDF01)+(*(Buffer+0xDF00)<<8);
if (Chks11 != Chks1 && Chks21 !=Chks2)
{
return 0;
}
if (!FindFixCRC(dllECUinfo, 1))
{
return 0;
}
return dllECUinfo->BadChkSumNumber;
}
int FindFixCRC(ECU_info* dllECUinfo, int FixCRC)
{
unsigned int StartAdr1, EndAdr1, ChkSumAdr1, ChkSumAdr2;
unsigned int ChkSumm1=0, CalcSumm1, ChkSumm2=0, CalcSumm2, BadSumm=0, Chks1, Chks2, Chks11, Chks21;;
dllECUinfo->ChkSumNumber=2; //CheckSumm number in dump
DWORD Buffer1 = (DWORD)dllECUinfo->EcuBuffer;
unsigned char* Buffer= (unsigned char*)(Buffer1);
Chks1=(*(Buffer+0xBF03)+(*(Buffer+0xBF02)<<8)+*(Buffer+0xBF05)+(*(Buffer+0xBF04)<<8))&0xFFFF;
Chks2=(*(Buffer+0xDF03)+(*(Buffer+0xDF02)<<8)+*(Buffer+0xDF05)+(*(Buffer+0xDF04)<<8))&0xFFFF;
Chks11=*(Buffer+0xBF01)+(*(Buffer+0xBF00)<<8);
Chks21=*(Buffer+0xDF01)+(*(Buffer+0xDF00)<<8);
if (Chks11 != Chks1)
{
if (Chks21 != Chks2)
{
return 0;
}
else
{
EndAdr1=0xDEFF;
ChkSumAdr1=0xDF00;
ChkSumAdr2=0xDF04;
}
}
else
{
EndAdr1=0xBEFF;
ChkSumAdr2=0xBF00;
ChkSumAdr1=0xBF04;
}
Chks1=0;
for (StartAdr1 = 0x4000; StartAdr1 < EndAdr1; StartAdr1+=0x80)
{
if (StartAdr1 == *(Buffer+StartAdr1)+(*(Buffer+StartAdr1+1)<<8))
{
Chks1=1;
break;
}
}
if (!Chks1)
{
return 0;
}
ChkSumm1= *(Buffer+ChkSumAdr1+1) + (*(Buffer+ChkSumAdr1)<<8);
ChkSumm2= *(Buffer+ChkSumAdr2+3) + (*(Buffer+ChkSumAdr2+2)<<8) + ChkSumm1;
ChkSumm2&=0xFFFF;
CalcSumm1=SummInt8(StartAdr1, EndAdr1, Buffer);
CalcSumm1&=0xFFFF;
CalcSumm2=CalcSumm1 + *(Buffer+ChkSumAdr2+3) + (*(Buffer+ChkSumAdr2+2)<<8);
CalcSumm2&=0xFFFF;
if (ChkSumm1!=CalcSumm1)
{
if (FixCRC)
{
*(Buffer+ChkSumAdr1+1)=CalcSumm1;
*(Buffer+ChkSumAdr1)=CalcSumm1>>8;
}
BadSumm++;
}
if (ChkSumm2!=CalcSumm2)
{
if (FixCRC)
{
*(Buffer+ChkSumAdr2+1)=CalcSumm2;
*(Buffer+ChkSumAdr2)=CalcSumm2>>8;
}
BadSumm++;
}
dllECUinfo->BadChkSumNumber=BadSumm; //Bad CheckSumm number in dump
return 1;
}
unsigned int FindHexStr(unsigned int SearchOffset, unsigned int BufferSize, unsigned char *SearchBuffer, unsigned char *HexBytes, unsigned int HexCount)
{
unsigned int i, h_bytes, s_count=0;
for (i = SearchOffset; i < BufferSize-HexCount; i++)
{
if (*(SearchBuffer+i)==*HexBytes)
{
s_count=1;
if (HexCount==1)
{
return i;
}
for (h_bytes = 1; h_bytes < HexCount; h_bytes++)
{
if (*(SearchBuffer+i+h_bytes)==*(HexBytes+h_bytes))
{
s_count++;
}
else
{
s_count=0;
break;
}
}
if (s_count==HexCount)
{
return i;
}
}
}
return 0xFFFFFFFF;
}
unsigned int SummInt8(unsigned int StartInt8, unsigned int EndInt8, unsigned char *SearchBuffer)
{
unsigned int summ=0, i;
for (i = StartInt8; i <= EndInt8; i++)
{
summ+= *(SearchBuffer+i);
}
return summ;
}
unsigned int SummInt16Intel(unsigned int StartInt16, unsigned int EndInt16, unsigned char *SearchBuffer)
{
unsigned int summ=0, i;
for (i = StartInt16; i < EndInt16; i=i+2)
{
summ+= *(SearchBuffer+i);
summ+= *(SearchBuffer+i+1)<<8;
}
return summ;
}
unsigned int SummInt16Mot(unsigned int StartInt16, unsigned int EndInt16, unsigned char *SearchBuffer)
{
unsigned int summ=0, i;
for (i = StartInt16; i < EndInt16; i=i+2)
{
summ+= *(SearchBuffer+i+1);
summ+= *(SearchBuffer+i)<<8;
}
return summ;
}
unsigned int Read4ByteIntel (unsigned char *ReadAddress)
{
unsigned int ReadedDword;
ReadedDword= *(ReadAddress)+(*(ReadAddress+1)<<8)+(*(ReadAddress+2)<<16)+(*(ReadAddress+3)<<24);
return ReadedDword;
}
void Write4ByteIntel (unsigned int WrDword, unsigned char *WriteAddress)
{
*WriteAddress= WrDword;
*(WriteAddress+1)= WrDword>>8;
*(WriteAddress+2)= WrDword>>16;
*(WriteAddress+3)= WrDword>>24;
} | [
"[email protected]"
] | |
a28b00e3df66b082ec774a2f486ff5d94f221646 | 9c25b5bb7d6463ffe95f5185e83c00025d851ebd | /code/http/HttpResponse.h | af72f009c61f83b894d4d9f0c0b4b24f740e82ed | [] | no_license | softhuafei/MyWebServer | eadbb46ce3756c91f05df132978a8ebfc4ac965a | bb2736970fd60809bca333177b8436116c7227e8 | refs/heads/main | 2023-03-05T01:51:07.526118 | 2021-02-22T11:20:14 | 2021-02-22T11:20:14 | 339,404,797 | 0 | 0 | null | 2021-02-22T11:20:15 | 2021-02-16T13:19:28 | C++ | UTF-8 | C++ | false | false | 1,617 | h | #ifndef HTTPRESPONSE_H
#define HTTPRESPONSE_H
#include <string>
#include <sys/stat.h> // stat
#include <fcntl.h> // open
#include <unistd.h> // close
#include <sys/mman.h> // mmap, munmap
#include <unordered_map>
#include "../http/HttpRequest.h"
#include "../buffer/Buffer.h"
class HttpResponse
{
public:
HttpResponse();
~HttpResponse();
void init(const std::string &url, bool isKeepAlive, HttpRequest::HTTP_CODE code);
bool process_response(Buffer &buff);
/* 获取指向文件内容的内存指针 */
char* file();
size_t file_len() const;
void unmap();
private:
/* 将网站根目录和url文件拼接，然后通过stat判断该文件属性。
另外，为了提高访问速度，通过mmap进行映射，将普通文件映射到内存逻辑地址。
根据解析情况修改Http Code
*/
void do_request();
bool add_status_line(Buffer &buff, int code);
bool add_headers(Buffer &buff, size_t content_length);
bool add_content(Buffer &buff, int code);
bool build_error_response(Buffer &buff, int code);
private:
/* 构造response所需要的信息 */
HttpRequest::HTTP_CODE m_http_code;
std::string m_url;
std::string m_real_file;
bool m_linger;
/* 保存映射的文件地址 */
char* m_file_addr;
struct stat m_file_stat;
/* 状态码对应的title*/
static const std::unordered_map<int, std::string> CODE_STATE;
/* 除200外的状态码对应的content */
static const std::unordered_map<int, std::string> CODE_FORM;
public:
static std::string m_root;
};
#endif | [
"[email protected]"
] | |
6a81071669f4d30eeb06efc428752014ad579d6a | 81d9a1beaad687c69408b4c89fe117d7c4c022da | /include/Params.h | dc74384974b002152e56cddd82f83af17c91933c | [] | no_license | Npu-Humanoid-Vision/GradientWithClf | 785a3d782a7e3e79162c7344f6433d3f271ba434 | 4c09078bd52982e0e05989be5c4577521703bddb | refs/heads/master | 2020-06-17T05:00:17.162441 | 2019-08-01T02:25:37 | 2019-08-01T02:25:37 | 195,805,276 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 694 | h | #ifndef PARAMS_H
#define PARAMS_H
#include <time.h>
#include <bits/stdc++.h>
#include <opencv2/opencv.hpp>
using namespace std;
using namespace cv;
#ifdef __linux__
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <dirent.h>
#include <string.h>
#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#endif
#ifdef __WIN32
#include <io.h>
#include <windows.h>
#include <opencv2/nonfree/nonfree.hpp>
#endif
enum { H,S,V,L,A,B };
#define POS_LABLE 1
#define NEG_LABLE 0
#define IMG_COL 128
#define IMG_ROW 128
#define MODEL_PATH "./Model/"
#define TESTSET_PATH "./Data/Test/"
#define TRAINSET_PATH "./Data/Train/"
#define RAW_DATA_PATH "./Data/Raw/"
#endif | [
"[email protected]"
] | |
f7f07698284f8fb13a652e40a0f59c30a8b866b1 | d451d126d188dbb9287a95d2c50a8ad7723a1d0f | /src/ast/declaration/attribute_declaration_node.cpp | 42425a7e9d2934b832c707d32c2b6bdfd81be1cf | [] | no_license | rcorcs/rcc | 1fb15f82215968c412ddb5f47742ec6318a18425 | 5885025911d36a04c2fb2c2e6ca3b56b3bb62458 | refs/heads/master | 2021-01-21T04:37:23.433928 | 2017-07-23T01:51:50 | 2017-07-23T01:51:50 | 22,624,437 | 135 | 11 | null | null | null | null | UTF-8 | C++ | false | false | 428 | cpp | #include "attribute_declaration_node.h"
AttributeDeclarationNode::AttributeDeclarationNode(DeclarationNode *specifier, DeclarationNode *declarator)
: DeclarationNode(NODE_TYPE_ATTRIBUTE_DECLARATION) {
_specifier = specifier;
_declarator = declarator;
}
DeclarationNode *AttributeDeclarationNode::specifier(){
return _specifier;
}
DeclarationNode *AttributeDeclarationNode::declarator(){
return _declarator;
}
| [
"[email protected]"
] | |
556ad27391b1bc002762faf643e3e2c10c6f0d79 | 247a907ed09a8963921522c7ca8998c557af121b | /src/transfer/processTime.h | 860ac432f5bbb80256157157f756ede79a6fa68b | [
"MIT"
] | permissive | 15831944/ImagePresetCreator_opensource | d89fe0044df1f50129b29641d27426d24f274b5e | 518d36ac231411d604bc848565f275896752fb46 | refs/heads/master | 2021-09-24T01:40:56.600126 | 2018-10-01T09:04:18 | 2018-10-01T09:04:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,314 | h | #ifndef PROCESSTIME_H
#define PROCESSTIME_H
#include <QtCore>
#include <QLine>
#include <QRegExp>
#include <QThread>
#include "common/dataManager.h"
//---------------------------------------------------------------------------
class ProcessLine
{
public:
enum Type { Seek = 0, Feed };
enum Direction {Zero = 0, Left = 1, Top = 2, Bottom = 3, Right = 4 };
ProcessLine(QPointF from, QPointF to, Type type, int speed);
void dump();
ProcessLine::Direction xDirection();
ProcessLine::Direction yDirection();
QLineF getLine();
qreal getSpeed();
ProcessLine::Type getType();
qreal calcAngleTo(ProcessLine processLine);
qreal calcLength();
qreal calcProcessTime();
private:
QLineF _line;
Type _type;
int _speed;
Direction _xDirection;
Direction _yDirection;
};
//---------------------------------------------------------------------------
class ProcessTime
{
public:
ProcessTime(QString gcode);
void setSeekSpeed(int speed);
int calc();
private:
QString _gcode;
int _seekSpeed;
QList<QStringList> createElementOfPointList();
QList<ProcessLine> createProcessLineList(QList<QStringList> elementOfPointList);
};
//---------------------------------------------------------------------------
class ProcessTimeCalculator;
class ProcessTimeCalculateBehavior : public QObject
{
Q_OBJECT
public:
ProcessTimeCalculateBehavior();
public slots:
void processStart(QString gcode);
signals:
void processFinished(QTime);
};
//---------------------------------------------------------------------------
class ProcessTimeCalculateBehavior;
class ProcessTimeCalculator : public QObject
{
Q_OBJECT
public:
ProcessTimeCalculator();
~ProcessTimeCalculator();
void calculate(QString gcode);
bool isCalculating();
void setUpdateRequest(bool enable);
bool hasUpdateRequest();
signals:
void calcurateStart(QString);
void calcurateFinished(QTime);
void callRecalcurateRequest();
public slots:
void onCalculateFinished(QTime time);
private:
bool _isCalculating;
bool _hasUpdateRequest;
QThread* _thread;
ProcessTimeCalculateBehavior* _behavior;
};
//---------------------------------------------------------------------------
#endif // PROCESSTIME_H
| [
"[email protected]"
] | |
245a259ac87ce8335fd529063fc03f92101590d2 | c968de2d8b7a66246b2147aa445171078b63c22d | /Final450/LinkedList/11.cpp | cc1bce4b79bcea7b2c5b8420bc043ed473d9fe49 | [] | no_license | shakthi-balan/Data-Structures-Algorithm | a03b7810fc9b7e8073fea8fc7377ffbc261be46b | 39dfa98dd968b4db76510f9ab5a900887b464d57 | refs/heads/main | 2023-06-30T20:04:47.071006 | 2021-08-01T14:06:58 | 2021-08-01T14:06:58 | 391,576,498 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 751 | cpp | #include<bits/stdc++.h>
using namespace std;
struct Node {
int data;
Node* next;
};
void push(Node** head_ref, int new_data)
/*This solution uses the temporary dummy to build up
the result list*/
Node* sortedIntersect(Node* a, Node* b)
{
Node dummy;
Node* tail = &dummy;
dummy.next = NULL;
/*once one or the other list runs out -- we're out */
while (a != NULL && != NULL)
{
if( a->data== b->data)
push((&tail->next),a->data);
tail = tail->next;
a = a->next;
b = b->next;
//advance the smaller list
else if(a->data < b->data )
a = a->next;
else
b = b->next;
}
return (dummy.next);
} | [
"[email protected]"
] | |
dde06faff7dbdfdc521ac8980565d1d45a7ad35b | 41e7419482e73c57ac9a703ecaa03c3b759d49da | /clrTest/SimpleCommand.h | 0214f20bf5572afe103d2ebc0be2c2e193522d65 | [] | no_license | ScottHenwood/SCH-Logo | 20bd20f55670e55d118e43a495e2d2cec99b7dae | 2e86e415b1a7dd063835204afe956facb1748ddd | refs/heads/master | 2020-05-18T15:20:38.145903 | 2014-07-10T11:31:50 | 2014-07-10T11:31:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 396 | h | #ifndef SimpleCommandH
#define SimpleCommandH
using namespace std;
#include "string"
#include "AbstractCommand.h"
//____________________________________________
// A class for a simple command object which has only one part (the name).
class SimpleCommand : public AbstractCommand
{
public:
SimpleCommand(string name);
bool virtual Process(Piece *p);
string virtual getDescrition();
};
#endif | [
"[email protected]"
] | |
1ab4b49ce4223da693a6a6312086ea5cd7f49e73 | fcf3c983043273c4e57ac33330efaa0a9e5643a2 | /inference-engine/src/inference_engine/cpp_interfaces/ie_task_synchronizer.hpp | 3ac5f9f202ec5410d680ce1cb1a090b575411900 | [
"Apache-2.0"
] | permissive | p3tromyz0n/dldt | e7ab259848c90fdffd1395eaf5cf53ecd2b1e2f3 | 669bee86e580cbbc8ef40b440ab195ba2cbf5142 | refs/heads/2018 | 2020-05-15T13:03:47.748654 | 2019-03-14T10:13:27 | 2019-03-14T10:13:27 | 158,445,061 | 0 | 1 | Apache-2.0 | 2019-04-19T15:24:15 | 2018-11-20T20:07:50 | C++ | UTF-8 | C++ | false | false | 2,170 | hpp | // Copyright (C) 2018 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include <vector>
#include <memory>
#include <mutex>
#include <condition_variable>
#include <thread>
#include <queue>
#include "details/ie_exception.hpp"
namespace InferenceEngine {
#define MAX_NUMBER_OF_TASKS_IN_QUEUE 10
class TaskSynchronizer {
public:
typedef std::shared_ptr<TaskSynchronizer> Ptr;
TaskSynchronizer() : _taskCount(0) {}
virtual void lock() {
auto taskID = _addTaskToQueue();
_waitInQueue(taskID);
}
virtual void unlock() {
std::unique_lock<std::mutex> lockTask(_taskMutex);
if (!_taskQueue.empty()) {
{
std::lock_guard<std::mutex> lock(_queueMutex);
_taskQueue.pop();
}
_taskCondVar.notify_all();
}
}
size_t queueSize() const {
return _taskQueue.size();
}
private:
unsigned int _taskCount;
std::queue<unsigned int> _taskQueue;
std::mutex _queueMutex;
std::mutex _taskMutex;
std::condition_variable _taskCondVar;
protected:
virtual unsigned int _getTaskID() {
return _taskCount++;
}
virtual unsigned int _addTaskToQueue() {
std::lock_guard<std::mutex> lock(_queueMutex);
auto taskID = _getTaskID();
if (!_taskQueue.empty() && _taskQueue.size() >= MAX_NUMBER_OF_TASKS_IN_QUEUE) {
THROW_IE_EXCEPTION << "Failed to add more than " << MAX_NUMBER_OF_TASKS_IN_QUEUE << " tasks to queue";
}
_taskQueue.push(taskID);
return taskID;
}
virtual void _waitInQueue(unsigned int taskID) {
std::unique_lock<std::mutex> lock(_taskMutex);
_taskCondVar.wait(lock, [&]() { return taskID == _taskQueue.front(); });
}
};
class ScopedSynchronizer {
public:
explicit ScopedSynchronizer(TaskSynchronizer::Ptr &taskSynchronizer) : _taskSynchronizer(
taskSynchronizer) {
_taskSynchronizer->lock();
}
~ScopedSynchronizer() {
_taskSynchronizer->unlock();
}
private:
TaskSynchronizer::Ptr &_taskSynchronizer;
};
} // namespace InferenceEngine
| [
"[email protected]"
] | |
c395eb5ab7a06998e34fcaffe2e8f02be4e11d6a | b1b0ea718d15415be065885835a430cdaa51f3a4 | /APD/APD_test_svm_learner_2d/test_svm_learner_2d.cpp | 8c95b6a963d751cd62ac8d5b41a0c566da5ebae8 | [] | no_license | panjia1983/APDL | addae0db78a583240fc820d77ca885b39a64f63c | 3f3c682d41de8c20688987066c7913887723e730 | refs/heads/master | 2016-09-05T13:31:29.789355 | 2013-03-01T21:41:41 | 2013-03-01T21:41:41 | 7,075,988 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,405 | cpp | #include <APD/contact_space_learning.h>
#include <APD/minkowski_cspace.h>
#include <APD/active_learning.h>
namespace APDL
{
void test_svm_learner_2d()
{
{
std::ifstream room_file("../data/rooms_star.dat");
if(!room_file.is_open())
{
std::cerr << "Failed to open the input file." << std::endl;
return;
}
Minkowski_Cspace_2D::Polygon_2 P, Q;
room_file >> P >> Q;
room_file.close();
Polygon p1 = toPolygon<Minkowski_Cspace_2D::Polygon_2, Minkowski_Cspace_2D::Kernel>(P);
Polygon p2 = toPolygon<Minkowski_Cspace_2D::Polygon_2, Minkowski_Cspace_2D::Kernel>(Q);
ContactSpaceR2 contactspace(p1, p2, 2);
std::vector<ContactSpaceSampleData> contactspace_samples = contactspace.uniform_sample(1000);
std::ofstream out("space_test_2d.txt");
asciiWriter(out, contactspace_samples);
SVMLearner learner;
learner.setC(10);
learner.setProbability(true);
learner.setScaler(contactspace.getScaler());
learner.setUseScaler(true);
std::ofstream scaler_file("scaler_2d.txt");
scaler_file << contactspace.getScaler() << std::endl;
learner.learn(contactspace_samples, contactspace.active_data_dim());
learner.save("model_2d.txt");
std::vector<PredictResult> results = learner.predict(contactspace_samples);
//for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
// std::cout << "(" << results[i].label << "," << contactspace_samples[i].col << ")";
//std::cout << std::endl;
std::cout << contactspace_samples.size() << ": " << empiricalErrorRatio(contactspace_samples, learner) << " " << errorRatioOnGrid(contactspace, learner, 100) << std::endl;
SVMLearner learner_load;
learner_load.load("model_2d.txt", "scaler_2d.txt", true, 2);
std::cout << contactspace_samples.size() << ": " << std::endl;
std::cout << empiricalErrorRatio(contactspace_samples, learner_load) << std::endl;
std::cout << errorRatioOnGrid(contactspace, learner_load, 100) << std::endl;
}
return;
// linear model
{
std::ifstream room_file("../data/rooms_star.dat");
if(!room_file.is_open())
{
std::cerr << "Failed to open the input file." << std::endl;
return;
}
Minkowski_Cspace_2D::Polygon_2 P, Q;
room_file >> P >> Q;
room_file.close();
Polygon p1 = toPolygon<Minkowski_Cspace_2D::Polygon_2, Minkowski_Cspace_2D::Kernel>(P);
Polygon p2 = toPolygon<Minkowski_Cspace_2D::Polygon_2, Minkowski_Cspace_2D::Kernel>(Q);
ContactSpaceR2 contactspace(p1, p2);
std::vector<ContactSpaceSampleData> contactspace_samples = contactspace.uniform_sample(1000);
std::ofstream out("space_test_2d.txt");
asciiWriter(out, contactspace_samples);
SVMLearner learner;
learner.setLinearClassifier();
learner.setC(10);
learner.learn(contactspace_samples, contactspace.active_data_dim());
learner.save("model_2d.txt");
HyperPlane hp = learner.getLinearModel();
std::vector<PredictResult> results = learner.predict(contactspace_samples);
for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
{
DataVector v(contactspace.active_data_dim());
for(std::size_t j = 0; j < contactspace.active_data_dim(); ++j)
v[j] = contactspace_samples[i].v[j];
double pred = hp.evaluate(v);
if(pred > 0)
std::cout << 1 << " ";
else
std::cout << 0 << " ";
}
std::cout << std::endl;
for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
std::cout << results[i].label << " ";
std::cout << std::endl;
}
}
void test_svm_learner_poly_spiders()
{
std::vector<Polygon> polys1 = readPolyFile("../data/models/Box2D/nazca_spider77.polys");
std::vector<Polygon> polys2 = readPolyFile("../data/models/Box2D/nazca_spider77.polys");
ContactSpaceR2 contactspace(polys1, polys2, 0.2 * (getCircle(polys1).second + getCircle(polys2).second));
std::vector<ContactSpaceSampleData> contactspace_samples = contactspace.uniform_sample(10000);
std::ofstream out("space_test_2d_spiders.txt");
asciiWriter(out, contactspace_samples);
SVMLearner learner;
learner.setC(10);
learner.setProbability(true);
learner.setScaler(contactspace.getScaler());
learner.setGamma(20);
std::ofstream scaler_file("scaler_2d_spiders.txt");
scaler_file << contactspace.getScaler() << std::endl;
learner.learn(contactspace_samples, contactspace.active_data_dim());
learner.save("model_2d_spiders.txt");
std::vector<PredictResult> results = learner.predict(contactspace_samples);
//for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
// std::cout << "(" << results[i].label << "," << contactspace_samples[i].col << ")";
//std::cout << std::endl;
std::cout << contactspace_samples.size() << ": " << empiricalErrorRatio(contactspace_samples, learner) << " " << errorRatioOnGrid(contactspace, learner, 100) << std::endl;
}
void test_svm_learner_poly_spidertooth()
{
std::vector<Polygon> polys1 = readPolyFile("../data/models/Box2D/tooth.polys");
std::vector<Polygon> polys2 = readPolyFile("../data/models/Box2D/nazca_spider77.polys");
ContactSpaceR2 contactspace(polys1, polys2, 0.2 * (getCircle(polys1).second + getCircle(polys2).second));
std::vector<ContactSpaceSampleData> contactspace_samples = contactspace.uniform_sample(10000);
std::ofstream out("space_test_2d_spidertooth.txt");
asciiWriter(out, contactspace_samples);
SVMLearner learner;
learner.setC(10);
learner.setProbability(true);
learner.setScaler(contactspace.getScaler());
learner.setGamma(20);
std::ofstream scaler_file("scaler_2d_spidertooth.txt");
scaler_file << contactspace.getScaler() << std::endl;
learner.learn(contactspace_samples, contactspace.active_data_dim());
learner.save("model_2d_spidertooth.txt");
std::vector<PredictResult> results = learner.predict(contactspace_samples);
//for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
// std::cout << "(" << results[i].label << "," << contactspace_samples[i].col << ")";
//std::cout << std::endl;
std::cout << contactspace_samples.size() << ": " << empiricalErrorRatio(contactspace_samples, learner) << " " << errorRatioOnGrid(contactspace, learner, 100) << std::endl;
}
void test_svm_learner_poly_monkeys()
{
std::vector<Polygon> polys1 = readPolyFile("../data/models/Box2D/nazca_monkey550.polys");
std::vector<Polygon> polys2 = readPolyFile("../data/models/Box2D/nazca_monkey550.polys");
ContactSpaceR2 contactspace(polys1, polys2, 0.2 * (getCircle(polys1).second + getCircle(polys2).second));
std::vector<ContactSpaceSampleData> contactspace_samples = contactspace.uniform_sample(10000);
std::ofstream out("space_test_2d_monkeys.txt");
asciiWriter(out, contactspace_samples);
SVMLearner learner;
learner.setC(10);
learner.setProbability(true);
learner.setScaler(contactspace.getScaler());
learner.setGamma(20);
std::ofstream scaler_file("scaler_2d_monkeys.txt");
scaler_file << contactspace.getScaler() << std::endl;
learner.learn(contactspace_samples, contactspace.active_data_dim());
learner.save("model_2d_monkeys.txt");
std::vector<PredictResult> results = learner.predict(contactspace_samples);
//for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
// std::cout << "(" << results[i].label << "," << contactspace_samples[i].col << ")";
//std::cout << std::endl;
std::cout << contactspace_samples.size() << ": " << empiricalErrorRatio(contactspace_samples, learner) << " " << errorRatioOnGrid(contactspace, learner, 100) << std::endl;
}
void test_svm_learner_poly_monkeytooth()
{
std::vector<Polygon> polys1 = readPolyFile("../data/models/Box2D/tooth.polys");
std::vector<Polygon> polys2 = readPolyFile("../data/models/Box2D/nazca_monkey550.polys");
ContactSpaceR2 contactspace(polys1, polys2, 0.2 * (getCircle(polys1).second + getCircle(polys2).second));
std::vector<ContactSpaceSampleData> contactspace_samples = contactspace.uniform_sample(10000);
std::ofstream out("space_test_2d_monkeytooth.txt");
asciiWriter(out, contactspace_samples);
SVMLearner learner;
learner.setC(10);
learner.setProbability(true);
learner.setScaler(contactspace.getScaler());
learner.setGamma(20);
std::ofstream scaler_file("scaler_2d_monkeytooth.txt");
scaler_file << contactspace.getScaler() << std::endl;
learner.learn(contactspace_samples, contactspace.active_data_dim());
learner.save("model_2d_monkeytooth.txt");
std::vector<PredictResult> results = learner.predict(contactspace_samples);
//for(std::size_t i = 0; i < contactspace_samples.size(); ++i)
// std::cout << "(" << results[i].label << "," << contactspace_samples[i].col << ")";
//std::cout << std::endl;
std::cout << contactspace_samples.size() << ": " << empiricalErrorRatio(contactspace_samples, learner) << " " << errorRatioOnGrid(contactspace, learner, 100) << std::endl;
}
}
void main()
{
APDL::test_svm_learner_2d();
// APDL::test_svm_learner_poly_spiders();
// APDL::test_svm_learner_poly_spidertooth();
// APDL::test_svm_learner_poly_monkeys();
// APDL::test_svm_learner_poly_monkeytooth();
} | [
"[email protected]"
] | |
93d89efb952bfadd982b1b7959dfeed433789a03 | a4048629b43c010fcfc308782d7073b7a2932f2d | /Homework 4/ksv244_oop_hw4_q3.cpp | 7451678910e7bb344af0386d29a4340866c72359 | [] | no_license | korivernon/Object-Oriented-Programming | 44719747d884c3182d12d571d1ecc6a61895684e | 02308fe49534b857b9bf472cb08f93bf63f0b39a | refs/heads/master | 2022-11-12T19:55:20.600344 | 2020-07-03T03:45:42 | 2020-07-03T03:45:42 | 189,040,702 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,235 | cpp | #include<iostream>
#include<vector>
using namespace std;
void printArr(const int * arr, const int& size){
cout << "{";
for (int i = 0; i < size; i++){
if (i!= size-1)
cout << arr[i] << ",";
else
cout << arr[i];
}
cout << "}" << endl;
}
// resize function to easily resize
void resize(int*& arr, int& oldsize, const int& newsize){
int * temp = new int[newsize];
if (oldsize > newsize){
for (int i = 0; i < newsize; i++){
temp[i] = arr[i];
}
} else {
for (int i = 0; i < oldsize; i++){
temp[i] = arr[i];
}
}
delete [] arr;
arr = temp;
oldsize = newsize;
}
void sortMe(int*& arr, const int& size){
int temp, i, j;
for(i=0; i < size; i++){
for(j = i + 1; j < size; j++){
if(arr[i] > arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
void sortInsert(int*& arr, int& size, const int& val){
resize(arr,size,size+1); // resize for one new element
// cout << "Size: " << size << endl;
arr[size-1] = val; //set the size-1 = to the value
// printArr(arr,size);
sortMe(arr,size); // sort the list after placing
}
//get grades function
void getGrades(vector<int>& grades){
int score;
do {
cout << "Enter in a test score: ";
cin >> score;
if (score == -1) break;
else if (score < 0){
while (score < -1){
if (score == -1) break; // user can still enter in a negative score and it will continue thru code
else {
cout << "Enter in a test score: "; //continue to prompt user to enter test score
cin >> score;
}
}
}
grades.push_back(score);
} while (true);
}
/*
void printHistogram(const vector<int>& grades){
int size = 0;
int * arr = new int[size];
for (int val : grades){ //sort the grades so we can go through and output
sortInsert(arr,size,val);
}
// printArr(arr,size);
// int total = 0;
if (size > 0){
int total = 1;
for (int i = 1; i < grades.size(); i++){
// cout << arr[i] << " iteration " << endl;
if (i == size-1){ //stop case
if (arr[i] == arr[i-1]) // if the last element is not the last instance of it occuring
cout << "Number of " << arr[i-1] << "'s: " << ++total << endl;
else { if the last element is the only instance of it occuring
cout << "Number of " << arr[i-1] << "'s: " << total << endl;
cout << "Number of " << arr[i] << "'s: " << 1 << endl;
}
} else if (arr[i]==arr[i-1]){
// cout << "adding to " << arr[i] << endl;
total++;
} else if (i == 0){ // this line is redundant
total = 1;
} else if (arr[i]!=arr[i-1]) {
cout << "Number of "<< arr[i-1] << "'s: " << total << endl;
total = 1; //start over at the beginning
}
}
} else {cout << "No grades entered. " << endl;}
// printArr(arr,size);
delete [] arr;
}
*/
// realizing that i did the problem incorrectly
void printMyHistogram(const int * arr, const int size){ // function to print my histogram
for (int i = 0; i < size; i++){
if (arr[i] > 0)
cout << "Number of " << i << "'s: " << arr[i] << endl;
}
}
void makeHistogram(vector<int>& grades){
// cout << "here" << endl;
int max = 0; //set the max to 0
for (int i = 0; i < grades.size(); i++){
if (grades[i] > max){
max = grades[i]; //determine the max
}
}
// cout << "Max: " << max << endl;
int * arr = new int[max+1]; //create an array with the max set the the max+1 to account for the max val
int total = 0; // set the total to 0
for (int i = 0; i < max+1; i++){ // continue throught the max numbers
for (int j = 0; j < grades.size(); j++){
if (i == grades[j]){ // check to see if at any point the grades match up
// cout << "adding to " << i << " at " << j << endl; // if they match up then increment
total++;
} else {
continue; // otherwise continue
}
}
// cout << i << ": " << total<< endl;
arr[i] = total; // set the array to hold the total number count at that index in the array
total = 0; // reset the total to 0 to continue throughout the rest of the loop
}
// printArr(arr,max+1);
printMyHistogram(arr, max+1); // pass to function to print
}
int main() {
// int size = 0;
// int * arr = new int[size];
// printArr(arr,0);
cout << "begin" << endl;
vector<int> grades;
getGrades(grades);
/*
grades.push_back(20);
grades.push_back(30);
grades.push_back(4);
grades.push_back(20);
grades.push_back(30);
grades.push_back(30);
grades.push_back(50);
*/
/* output vector
for (int i : grades){
cout << i << endl;
}*/
// printHistogram(grades);
makeHistogram(grades);
cout <<"here"<< endl;
}
| [
"[email protected]"
] | |
c95aecd25c3567fb5bd0e786a9a0b35fff3b9c19 | 5bd41e0120f7836cfa59ca0a8009fb148465be46 | /图论/欧拉路径一笔画.cpp | 55b64a09af83d0d77655122dec9161b7ebff29cf | [] | no_license | firstruggle/loser-s-board | 0aa55dcde615922bf97d28c10168b93c15e8994f | 30bcf15f48191bff4df71a502d061547d4073e39 | refs/heads/master | 2020-04-23T19:03:26.393539 | 2019-11-13T06:47:25 | 2019-11-13T06:47:25 | 171,389,343 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 613 | cpp | void dfs(int cur) {//first是下一个点，second是当前边
while (!adj[cur].empty()) {
auto tmp = adj[cur].back();
adj[cur].pop_back();
if (!vis[tmp.second]) {
vis[tmp.second] = 1;
dfs(tmp.first);
ans[cnt++] = tmp.first;
}
}
}
int main() {
//...建图
vector<int> v;
for (int i = 1; i <= tot; i++) {
if (adj[i].size() % 2 == 1)
v.push_back(i);
}
if (v.size() == 2) {
dfs(v[0]);
ans[cnt++] = v[0];
} else if(v.size() == 0) {
dfs(1);
ans[cnt++] = 1;
}
}
| [
"[email protected]"
] | |
91ad3cdb3a000a4ef93729b297cfef909f09a269 | 505045ab5112ae0609f9962c5ad731a104f7a5ab | /source/token_file.h | cc0b9ca4928e3448bde55875a8591820de565a6f | [
"MIT"
] | permissive | 3dsCFWandGames/Unofficial-D-I-S-C-O-R-D-for-3ds | cf9f4f14a3850c55869afa7f088a78667ad1821e | 3bbd039f23a14f88c2476ac53a5edbcd2f3cd547 | refs/heads/master | 2022-02-05T03:42:35.240836 | 2017-11-18T16:21:57 | 2017-11-18T16:21:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 718 | h | #include <string>
#include <cstdio>
#include <vector>
class tokenFile {
public:
tokenFile(const char* path) {
//open file for reading
#ifdef _WIN32
fopen_s(&fileHandle, path, "rb");
#else
fileHandle = fopen(path, "rb");
#endif
if (fileHandle == 0) {
size = -1;
return;
}
//get file length
int position = ftell(fileHandle);
fseek(fileHandle, position, SEEK_END);
size = ftell(fileHandle);
fseek(fileHandle, position, SEEK_SET);
}
const std::string getToken() {
std::string buffer(size + 1, 0);
fread(&buffer[0], 1, size, fileHandle);
return &buffer[0];
}
const int getSize() {
return size;
}
void close() {
fclose(fileHandle);
}
private:
FILE* fileHandle;
int size;
}; | [
"[email protected]"
] | |
de35b2a94a573a543534db775e28680118bdb46f | f566d02e4682686a5606f7c79bd736e7d61bf53b | /machine_learning/neural_network/src/training_data.cpp | 34c658d45d060d987a274cdcd09e2f492f6b735b | [] | no_license | ChefOtter/ahl_ros_pkg | 8fbedddf4782170256db97ed589e21a985ad3b9c | f7fa1ca6808389ac6cb433cc0f3c8e0593ae8b8b | refs/heads/master | 2020-12-03T05:28:49.109939 | 2015-10-05T00:51:48 | 2015-10-05T00:51:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,898 | cpp | /*********************************************************************
*
* Software License Agreement (BSD License)
*
* Copyright (c) 2014, Daichi Yoshikawa
* 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 Daichi Yoshikawa 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.
*
* Author: Daichi Yoshikawa
*
*********************************************************************/
#include <fstream>
#include <algorithm>
#include "ahl_utils/io_utils.hpp"
#include "ahl_utils/exception.hpp"
#include "neural_network/training_data.hpp"
#include "neural_network/exceptions.hpp"
using namespace nn;
TrainingData::TrainingData()
: input_(0), output_(0)
{
}
void TrainingData::add(const std::vector<double>& input, const std::vector<double>& output)
{
if(input_.size() > 0)
{
if(input_[0].rows() != input.size())
{
std::stringstream msg;
msg << "Failed to add input data." << std::endl
<< "Added input data size is different from pre-existed input data size." << std::endl
<< " Added input data size : " << input.size() << std::endl
<< " Pre-existed input data size : " << input_[0].rows();
throw nn::Exception("TrainingData::add", msg.str());
}
}
if(output_.size() > 0)
{
if(output_[0].rows() != output.size())
{
std::stringstream msg;
msg << "Failed to add output data." << std::endl
<< "Added output data size is different from pre-existed output data size." << std::endl
<< " Added output data size : " << output.size() << std::endl
<< " Pre-existed output data size : " << output_[0].rows();
throw nn::Exception("TrainingData::add", msg.str());
}
}
Eigen::MatrixXd tmp_input = Eigen::MatrixXd::Zero(input.size() + 1, 1);
Eigen::MatrixXd tmp_output = Eigen::MatrixXd::Zero(output.size(), 1);
for(unsigned int i = 0; i < input.size(); ++i)
{
tmp_input.coeffRef(i, 0) = input[i];
}
tmp_input.coeffRef(input.size(), 0) = 1.0;
for(unsigned int i = 0; i < output.size(); ++i)
{
tmp_output.coeffRef(i, 0) = output[i];
}
input_.push_back(tmp_input);
output_.push_back(tmp_output);
}
void TrainingData::add(const Eigen::MatrixXd& input, const Eigen::MatrixXd& output)
{
if(input_.size() > 0)
{
if(input_[0].rows() != input.rows())
{
std::stringstream msg;
msg << "Failed to add input data." << std::endl
<< "Added input data size is different from pre-existed input data size." << std::endl
<< " Added input data size : " << input.rows() << std::endl
<< " Pre-existed input data size : " << input_[0].rows();
throw nn::Exception("TrainingData::add", msg.str());
}
}
if(output_.size() > 0)
{
if(output_[0].rows() != output.rows())
{
std::stringstream msg;
msg << "Failed to add output data." << std::endl
<< "Added output data size is different from pre-existed output data size." << std::endl
<< " Added output data size : " << output.rows() << std::endl
<< " Pre-existed output data size : " << output_[0].rows();
throw nn::Exception("TrainingData::add", msg.str());
}
}
Eigen::MatrixXd tmp_input = Eigen::MatrixXd::Ones(input.rows() + 1, 1);
tmp_input.block(0, 0, input.rows(), 1) = input;
input_.push_back(input);
output_.push_back(output);
}
void TrainingData::init(const std::string& name_in, const std::string& name_out)
{
std::ifstream ifs_in;
std::ifstream ifs_out;
try
{
ifs_in.open(name_in.c_str());
if(ifs_in.fail())
{
throw std::string(name_in);
}
ifs_out.open(name_out.c_str());
if(ifs_out.fail())
{
throw std::string(name_out);
}
}
catch(std::string& str)
{
std::stringstream msg;
msg << "Could not open \"" << str << "\"." << std::endl;
throw nn::Exception("TrainingData::init", msg.str());
}
try
{
if(ahl_utils::IOUtils::getValues(ifs_in, input_) == false)
{
throw std::string(name_in);
}
if(ahl_utils::IOUtils::getValues(ifs_out, output_) == false)
{
throw std::string(name_out);
}
}
catch(std::string& str)
{
std::stringstream msg;
msg << "Failed to load values from \"" << str << "\".";
throw nn::Exception("TrainingData::init", msg.str());
}
if(input_.size() != output_.size())
{
std::stringstream msg;
msg << "Size of input data is different from size of output data." << std::endl
<< " input data size : " << input_.size() << std::endl
<< " output data size : " << output_.size();
throw nn::Exception("TrainingData::init", msg.str());
}
}
void TrainingData::shuffle()
{
std::vector<unsigned int> shuffled_idx(input_.size());
for(unsigned int i = 0; i < input_.size(); ++i)
{
shuffled_idx[i] = i;
}
std::random_shuffle(shuffled_idx.begin(), shuffled_idx.end());
std::vector<Eigen::MatrixXd> tmp_input = input_;
std::vector<Eigen::MatrixXd> tmp_output = output_;
for(unsigned int i = 0; i < input_.size(); ++i)
{
input_[i] = tmp_input[shuffled_idx[i]];
output_[i] = tmp_output[shuffled_idx[i]];
}
}
void TrainingData::separate(std::vector<TrainingDataPtr>& dst, unsigned int sep_num)
{
unsigned int data_num = input_.size();
dst.clear();
if(data_num < sep_num)
{
std::stringstream msg;
msg << "Failed to separate training data." << std::endl
<< "The number of training data is too small." << std::endl
<< " sep_num : " << sep_num << std::endl
<< " data num : " << data_num;
throw nn::Exception("TrainingData::separate", msg.str());
}
std::vector<TrainingDataPtr> sep_data;
for(unsigned int i = 0; i < sep_num; ++i)
{
sep_data.push_back(TrainingDataPtr(new TrainingData()));
}
unsigned int idx = 0;
for(unsigned int i = 0; i < this->getSize(); ++i)
{
sep_data[idx]->add(input_[i], output_[i]);
++idx;
if(idx == sep_data.size())
idx = 0;
}
for(unsigned int i = 0; i < sep_num; ++i)
{
dst.push_back(sep_data[i]);
}
}
void TrainingData::separate(std::vector< std::vector<TrainingDataPtr> >& dst, unsigned int thread_num, unsigned int batch_size)
{
std::vector<TrainingDataPtr> sep_data;
this->separate(sep_data, thread_num);
unsigned int max_data_size = 0;
for(unsigned int i = 0; i < sep_data.size(); ++i)
{
if(max_data_size < sep_data[i]->getSize())
{
max_data_size = sep_data[i]->getSize();
}
}
unsigned int thread_batch_size = batch_size / thread_num;
unsigned int thread_batch_num = static_cast<unsigned int>(std::ceil(1.0 * max_data_size / thread_batch_size));
dst.resize(thread_num);
for(unsigned int i = 0; i < thread_num; ++i)
{
std::vector<TrainingDataPtr> tmp(thread_batch_num);
for(unsigned int j = 0; j < tmp.size(); ++j)
{
tmp[j] = TrainingDataPtr(new TrainingData());
}
for(unsigned int j = 0; j < thread_batch_num; ++j)
{
for(unsigned int k = 0; k < thread_batch_size; ++k)
{
unsigned int idx = j * thread_batch_size + k;
if(idx < sep_data[i]->getSize())
{
tmp[j]->add(sep_data[i]->getInput()[idx], sep_data[i]->getOutput()[idx]);
}
else
{
break;
}
}
dst[i].push_back(tmp[j]);
}
}
}
void TrainingData::setInput(unsigned int idx, std::vector<double>& input)
{
if(idx >= input_.size())
{
std::stringstream msg;
msg << "Failed to set training data. idx should be smaller than " << input_.size() << "." << std::endl
<< " idx : " << idx;
throw nn::Exception("TrainingData::setInput", msg.str());
}
if(input.size() != input_[0].rows())
{
std::stringstream msg;
msg << "Specified data's row number is different from pre existed data's row number." << std::endl
<< " data row num : " << input.size() << std::endl
<< " existed data row num : " << input_[0].rows();
throw nn::Exception("TrainingData::setInput", msg.str());
}
Eigen::MatrixXd tmp = Eigen::MatrixXd::Zero(input.size(), 1);
for(unsigned int i = 0; i < input.size(); ++i)
{
tmp.coeffRef(i) = input[i];
}
input_[idx] = tmp;
}
void TrainingData::setInput(unsigned int idx, Eigen::MatrixXd& input)
{
if(idx >= input_.size())
{
std::stringstream msg;
msg << "Failed to set training data. idx should be smaller than " << input_.size() << "." << std::endl
<< " idx : " << idx;
throw nn::Exception("TrainingData::setInput", msg.str());
}
if(input.rows() != input_[0].rows())
{
std::stringstream msg;
msg << "Specified data's row number is different from pre existed data's row number." << std::endl
<< " data row num : " << input.rows() << std::endl
<< " existed data row num : " << input_[0].rows();
throw nn::Exception("TrainingData::setInput", msg.str());
}
input_[idx] = input;
}
void TrainingData::setOutput(unsigned int idx, std::vector<double>& output)
{
if(idx >= output_.size())
{
std::stringstream msg;
msg << "Failed to set training data. idx should be smaller than " << output_.size() << "." << std::endl
<< " idx : " << idx;
throw nn::Exception("TrainingData::setOutput", msg.str());
}
if(output.size() != output_[0].rows())
{
std::stringstream msg;
msg << "Specified data's row number is different from pre existed data's row number." << std::endl
<< " data row num : " << output.size() << std::endl
<< " existed data row num : " << output_[0].rows();
throw nn::Exception("TrainingData::setOutput", msg.str());
}
Eigen::MatrixXd tmp = Eigen::MatrixXd::Zero(output.size(), 1);
for(unsigned int i = 0; i < output.size(); ++i)
{
tmp.coeffRef(i) = output[i];
}
output_[idx] = tmp;
}
void TrainingData::setOutput(unsigned int idx, Eigen::MatrixXd& output)
{
if(idx >= output_.size())
{
std::stringstream msg;
msg << "Failed to set training data. idx should be smaller than " << output_.size() << "." << std::endl
<< " idx : " << idx;
throw nn::Exception("TrainingData::setOutput", msg.str());
}
if(output.rows() != output_[0].rows())
{
std::stringstream msg;
msg << "Specified data's row number is different from pre existed data's row number." << std::endl
<< " data row num : " << output.rows() << std::endl
<< " existed data row num : " << output_[0].rows();
throw nn::Exception("TrainingData::setOutput", msg.str());
}
output_[idx] = output;
}
void TrainingData::print()
{
std::cout << "TrainingData::print" << std::endl;
for(unsigned int i = 0; i < input_.size(); ++i)
{
std::cout << i << "th data :" << std::endl
<< "input = [ ";
for(unsigned int j = 0; j < input_[i].rows(); ++j)
{
std::cout << input_[i].coeff(j);
if(j < input_[i].rows() - 1)
{
std::cout << " ,";
}
}
std::cout << " ]" << std::endl
<< "output = [";
for(unsigned int j = 0; j < output_[i].rows(); ++j)
{
std::cout << output_[i].coeff(j);
if(j < output_[i].rows() - 1)
{
std::cout << " ,";
}
std::cout << " ]" << std::endl;
}
}
}
| [
"[email protected]"
] | |
6d575c7d543aa7cc77dd16113a24df8e62357a1e | 79e3e9efa4cf7daeba5df867c54b84c305335f6b | /Cesar/src/cesar.cpp | 89d5a1f49e37e762b5f60348272124144abda019 | [] | no_license | Solcito25/Algebra-Abstracta-SolMoreliaVelasquezRodriguez- | 244e705485b7aada590de90137681d2d2e3c1bd1 | 48879f54b25e58d46e08c49e1b4e6d6bb8d64050 | refs/heads/master | 2022-11-15T05:17:45.596471 | 2020-07-13T20:50:44 | 2020-07-13T20:50:44 | 255,141,950 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,113 | cpp | #include "cesar.h"
#include <string>
#include <iostream>
using namespace std;
cesar::cesar()
{
clave=3;
alfabeto="abcdefghijklmnopqrstuvwxyz";
}
cesar::~cesar()
{
//dtor
}
string cesar:: cifrado(string mensaje){
string mensajecifrado;
for(int i=0; i<mensaje.size();i++){
unsigned int a=alfabeto.find(mensaje.at(i));
if(a!=string::npos){
int comp=alfabeto.size()-clave;
if(a>=comp)
a=a-comp;
else
a+=clave;
mensajecifrado+=alfabeto.at(a);
}
else
mensajecifrado+=" ";
}
return mensajecifrado;
}
string cesar::descifrado(string mensajeCifrado){
string mensajeDescifrado;
for(int i=0; i<mensajeCifrado.size();i++){
unsigned int a=alfabeto.find(mensajeCifrado.at(i));
if(a!=string::npos){
if(a<clave)
a=a+alfabeto.size()-clave;
else
a-=clave;
mensajeDescifrado+=alfabeto.at(a);
}
else
mensajeDescifrado+=" ";
}
return mensajeDescifrado;
}
| [
"[email protected]"
] | |
5cc5a5ff7dc0022f1a938df6bb393808c2895bd7 | 4bc340db113236d270cabb9b81bd0949689ed654 | /windows_embedded_7_2014M12/WINCE700/private/servers/http/core/response.cpp | 68fb00e21d09ba85ac972b03fc0d9d20b2fb5539 | [] | no_license | xiaoqgao/windows_embedded_7_2014M12 | c2eff379b961443083d17853891f6d68d8adf106 | 39042192614d5a12a9cc037cbc47ac9f70f28b52 | refs/heads/master | 2022-12-25T15:57:36.305277 | 2020-09-28T20:08:02 | 2020-09-28T20:08:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,263 | cpp | //
// Copyright (c) Microsoft Corporation. All rights reserved.
//
//
// Use of this source code is subject to the terms of the Microsoft shared
// source or premium shared source license agreement under which you licensed
// this source code. If you did not accept the terms of the license agreement,
// you are not authorized to use this source code. For the terms of the license,
// please see the license agreement between you and Microsoft or, if applicable,
// see the SOURCE.RTF on your install media or the root of your tools installation.
// THE SOURCE CODE IS PROVIDED "AS IS", WITH NO WARRANTIES OR INDEMNITIES.
//
/*--
Module Name: RESPONSE.CPP
Abstract: Handles response to client.
--*/
#include "httpd.h"
#define APPENDCRLF(psz) { *psz++ = '\r'; *psz++ = '\n'; }
// ***NOTE***: The order of items in this table must match that in enum RESPONSESTATUS.
// If any additional entries are added they must match this enum, and update httpd.rc as well.
STATUSINFO rgStatus[STATUS_MAX] =
{
{ 200, "OK", NULL, FALSE},
{ 302, "Object Moved", NULL, TRUE},
{ 304, "Not Modified", NULL, FALSE},
{ 400, "Bad Request", NULL, TRUE},
{ 401, "Unauthorized", NULL, TRUE},
{ 403, "Forbidden", NULL, TRUE},
{ 404, "Object Not Found", NULL, TRUE},
{ 500, "Internal Server Error", NULL, TRUE},
{ 501, "Not Implemented", NULL, TRUE},
// status codes added for WebDAV support.
{ 201, "Created", NULL, FALSE},
{ 204, "No Content", NULL, FALSE},
{ 207, "Multi-Status", NULL, FALSE},
{ 405, "Method Not Allowed", NULL, TRUE},
{ 409, "Conflict", NULL, TRUE},
{ 411, "Length Required", NULL, TRUE},
{ 412, "Precondition Failed", NULL, TRUE},
{ 413, "Request Entity Too Large", NULL, TRUE},
{ 415, "Unsupported Media Type", NULL, TRUE},
{ 423, "Locked", NULL, TRUE},
{ 507, "Insufficient Storage", NULL, TRUE}
};
#define LCID_USA MAKELANGID(LAND_ENGLISH, SUBLANG_ENGLISH_US);
DWORD GetETagFromFiletime(FILETIME *pft, DWORD dwFileSize, PSTR szWriteBuffer)
{
return sprintf (szWriteBuffer,"\"%x%x%x%x%x%x%x%x:%x:%x\"",
(DWORD)(((PUCHAR)pft)[0]),(DWORD)(((PUCHAR)pft)[1]),
(DWORD)(((PUCHAR)pft)[2]),(DWORD)(((PUCHAR)pft)[3]),
(DWORD)(((PUCHAR)pft)[4]),(DWORD)(((PUCHAR)pft)[5]),
(DWORD)(((PUCHAR)pft)[6]),(DWORD)(((PUCHAR)pft)[7]),
dwFileSize,
g_pVars->m_dwSystemChangeNumber);
}
void CHttpResponse::SendHeadersAndDefaultBodyIfAvailable(PCSTR pszExtraHeaders, PCSTR pszNewRespStatus)
{
DEBUG_CODE_INIT;
CHAR szBuf[HEADERBUFSIZE - 100]; // Subtract a little to keep stack size of this < 4KB.
size_t cbBufSpace = sizeof(szBuf)/sizeof(szBuf[0]);
PSTR pszBuf = szBuf;
int iLen;
PSTR pszTrav;
size_t cbNeeded;
SafeInt<DWORD> cbNeededSafe;
BOOL fUsingHTTP10 = (m_pRequest->MinorHTTPVersion() == 0);
BOOL fIsStrictHTTP10 = m_pRequest->IsStrictHTTP10();
BOOL fPersistingConnection = m_pRequest->GetConnectionPersist();
if ( g_pVars->m_fFilters && ! m_pRequest->CallFilter(SF_NOTIFY_SEND_RESPONSE))
{
myleave(97);
}
// We do calculation up front to see if we need a allocate a buffer or not.
// Certain may be set by an ISAPI Extension, Filter, or ASP
// and we must do the check to make sure their sum plus http headers server
// uses will be less than buffer we created.
// Note: we don't use , even though SafeInt throws exceptions
// on error cases, because the entire HTTP request is wrapped in a __try/__
cbNeededSafe = m_pRequest->m_bufRespHeaders.Count();
cbNeededSafe += MyStrlenA(pszExtraHeaders);
cbNeededSafe += MyStrlenA(pszNewRespStatus);
cbNeededSafe += MyStrlenA(m_pszRedirect);
cbNeededSafe += MyStrlenA(m_pRequest->m_pszSecurityOutBuf);
cbNeededSafe += ((m_pRequest->m_pFInfo && m_pRequest->m_rs == STATUS_UNAUTHORIZED) ?
MyStrlenA(m_pRequest->m_pFInfo->m_pszDenyHeader) : 0);
if (VERB_HEAD != m_pRequest->m_idMethod)
{
cbNeededSafe += MyStrlenA(m_pszBody);
}
cbNeededSafe += 1000; // Add 1000 for extra HTTP headers this function adds. Always well < this.
cbNeeded = cbNeededSafe.Value(); // Store in a regular DWORD for use outside this block.
// If what we need is > header buf size,
if (cbNeeded > sizeof(szBuf))
{
if (!(pszBuf = MyRgAllocNZ(CHAR,cbNeeded)))
{
myleave(98);
}
}
pszTrav = pszBuf;
// the status line
// ServerSupportFunction on SEND_RESPONSE_HEADER can override the server value
// NOTE: using sprintf on user supplied strings is very dangerous as there may be
// sprintf qualifiers in it, so we'll be safe and strcpy.
if (pszNewRespStatus)
{
StringCchPrintfExA(pszTrav, cbBufSpace, &pszTrav, &cbBufSpace, 0,
"HTTP/%d.%d %s\r\n",
m_pRequest->MajorHTTPVersion(),
m_pRequest->MinorHTTPVersionMax(),
pszNewRespStatus);
}
else
{
StringCchPrintfExA(pszTrav,cbBufSpace, &pszTrav, &cbBufSpace, 0,
cszRespStatus,
m_pRequest->MinorHTTPVersionMax(),
rgStatus[m_pRequest->m_rs].dwStatusNumber,
rgStatus[m_pRequest->m_rs].pszStatusText);
}
// GENERAL HEADERS
// the Date line
SYSTEMTIME st;
GetSystemTime(&st); // NOTE: Must be GMT!
pszTrav = strcpyEx(pszTrav, cszRespDate);
pszTrav += WriteDateGMT(pszTrav,&st,TRUE);
// In HTTP 1.1 we say "Connection: close" when closing
if (!fUsingHTTP10 && !fPersistingConnection)
{
pszTrav += sprintf(pszTrav, cszConnectionResp, cszConnClose);
}
// In HTTP 1.0 we say "Connection: Keep-Alive" when keeping alive
if (fUsingHTTP10 && !fIsStrictHTTP10 && fPersistingConnection)
{
pszTrav += sprintf(pszTrav, cszConnectionResp, cszKeepAlive);
}
// Having set the reply, we may not change this anymore
m_pRequest->LockConnectionPersist();
// RESPONSE HEADERS
// the server line
pszTrav += sprintf(pszTrav, cszRespServer, m_pRequest->m_pWebsite->m_szServerID);
// the Location header (for redirects)
if (m_pszRedirect)
{
DEBUGCHK(m_pRequest->m_rs == STATUS_MOVED);
pszTrav = strcpyEx(pszTrav, cszRespLocation);
pszTrav = strcpyEx(pszTrav, m_pszRedirect);
APPENDCRLF(pszTrav);
}
// the WWW-Authenticate line
if (m_pRequest->m_rs == STATUS_UNAUTHORIZED && m_pRequest->SendAuthenticate())
{
// In the middle of an NTLM/negotiate authentication session, send back security context info to client.
if (m_pRequest->m_pszSecurityOutBuf)
{
if (m_pRequest->m_AuthState.m_AuthType==AUTHTYPE_NTLM)
{
pszTrav += sprintf(pszTrav,NTLM_AUTH_FORMAT " %s\r\n",NTLM_AUTH_STR,m_pRequest->m_pszSecurityOutBuf);
}
else if (m_pRequest->m_AuthState.m_AuthType==AUTHTYPE_NEGOTIATE)
{
pszTrav += sprintf(pszTrav,NEGOTIATE_AUTH_FORMAT " %s\r\n",NEGOTIATE_AUTH_STR,m_pRequest->m_pszSecurityOutBuf);
}
else
{
DEBUGCHK(0);
}
}
else
{
// If we're not in the middle of security session, send back all security session types we support.
if (m_pRequest->AllowBasic())
{
pszTrav += sprintf(pszTrav,BASIC_AUTH_FORMAT "\r\n",BASIC_AUTH_STR(g_pVars->m_szBasicRealm));
}
if (m_pRequest->AllowNTLM())
{
pszTrav += sprintf(pszTrav,NTLM_AUTH_FORMAT "\r\n",NTLM_AUTH_STR);
}
if (m_pRequest->AllowNegotiate())
{
pszTrav += sprintf(pszTrav,NEGOTIATE_AUTH_FORMAT "\r\n",NEGOTIATE_AUTH_STR);
}
}
}
// ENTITY HEADERS
// the Last-Modified line
if (m_hFile)
{
WIN32_FILE_ATTRIBUTE_DATA fData;
if( GetFileAttributesEx(m_pRequest->m_wszPath,GetFileExInfoStandard,&fData) &&
FileTimeToSystemTime(&fData.ftLastWriteTime, &st) )
{
pszTrav += sprintf(pszTrav, "%s ",cszRespLastMod);
pszTrav += WriteDateGMT(pszTrav,&st);
APPENDCRLF(pszTrav);
if (m_pRequest->m_pWebsite->m_fWebDav)
{
pszTrav = strcpyEx(pszTrav, cszETag);
*pszTrav++ = ' ';
pszTrav += GetETagFromFiletime(&fData.ftLastWriteTime,fData.dwFileAttributes,pszTrav);
APPENDCRLF(pszTrav);
}
}
}
// the Content-Type line
if (m_pszType)
{
pszTrav += sprintf(pszTrav,cszRespType,m_pszType);
}
// the Content-Length line
if (m_dwLength)
{
// If we have a file that is 0 length, it is set to -1.
if (m_dwLength == -1)
{
m_dwLength = 0;
}
pszTrav += sprintf(pszTrav, cszRespLength, m_dwLength);
}
if ((m_pRequest->m_rs == STATUS_UNAUTHORIZED) && m_pRequest->m_pFInfo && m_pRequest->m_pFInfo->m_pszDenyHeader)
{
pszTrav = strcpyEx(pszTrav,m_pRequest->m_pFInfo->m_pszDenyHeader);
// It's the script's responsibility to add any \r\n to the headers.
}
if (m_pRequest->m_bufRespHeaders.Data())
{
memcpy(pszTrav,m_pRequest->m_bufRespHeaders.Data(),m_pRequest->m_bufRespHeaders.Count());
pszTrav += m_pRequest->m_bufRespHeaders.Count();
}
if (pszExtraHeaders)
{
pszTrav = strcpyEx(pszTrav,pszExtraHeaders);
// It's the script's responsibility to include the final double CRLF, as per IIS.
}
else
{
APPENDCRLF(pszTrav); // the double CRLF signifies that header data is at an end
}
if (m_pszBody && (VERB_HEAD != m_pRequest->m_idMethod))
{
// A major HTTP client has a parsing bug where it will wrongly indicate
// a parse error if the HTTP headers and body are sent with different send()
// calls during a 401. Work around this problem by sending
// a body in this call if we have been provided with one at this stage. Note that
// this body will only be a default (eg from rgStatus) or a directory listing.
// ISAPI extensions/ASP, sending raw files back, and WebDAV never set m_pszBody
// but handle their own send() calls.
pszTrav = strcpyEx(pszTrav,m_pszBody);
}
*pszTrav = 0;
iLen = pszTrav - pszBuf;
m_pRequest->SendData(pszBuf,iLen);
done:
DEBUGMSG_ERR(ZONE_ERROR, (L"HTTPD: SendResponse failed, error = %d\r\n"));
DEBUGMSG(ZONE_RESPONSE, (L"HTTPD: Sending RESPONSE HEADER<<%a>>\r\n", pszBuf));
if (pszBuf != szBuf)
{
MyFree(pszBuf);
}
}
void SendFile(SOCKET sock, HANDLE hFile, CHttpRequest *pRequest)
{
BYTE bBuf[4096];
DWORD dwRead;
while(ReadFile(hFile, bBuf, sizeof(bBuf), &dwRead, 0) && dwRead)
{
if (! pRequest->SendData((PSTR) bBuf, dwRead))
{
return;
}
}
}
// This function used to display the message "Object moved
void CHttpResponse::SendRedirect(PCSTR pszRedirect, BOOL fFromFilter)
{
if (!fFromFilter && m_pRequest->FilterNoResponse())
{
return;
}
DEBUGCHK(!m_hFile);
DEBUGCHK(m_pRequest->m_rs==STATUS_MOVED);
// create a body
PSTR pszBody = MySzAllocA(strlen(rgStatus[m_pRequest->m_rs].pszStatusBody)+strlen(pszRedirect)+30);
DWORD dwLen = 0;
if(pszBody)
{
sprintf(pszBody, rgStatus[m_pRequest->m_rs].pszStatusBody, pszRedirect);
SetBody(pszBody, cszTextHtml);
}
// set redirect header & send all headers, then the synthetic body
m_pszRedirect = pszRedirect;
SendHeadersAndDefaultBodyIfAvailable(NULL,NULL);
MyFree(pszBody);
}
// Read strings of the bodies to send on web server errors ("Object not found",
// "Server Error",...) using load string. These strings are in wide character
// format, so we first convert them to regular strings, marching along
// pszBodyCodes (which is a buffer size BODYSTRINGSIZE). After the conversion,
// we set each rgStatus[i].pszStatusBody to the pointer in the buffer.
void InitializeResponseCodes(PSTR pszStatusBodyBuf)
{
PSTR pszTrav = pszStatusBodyBuf;
UINT i;
int iLen;
WCHAR wszBuf[256];
for(i = 0; i < ARRAYSIZEOF(rgStatus); i++)
{
if (!rgStatus[i].fHasDefaultBody)
{
continue;
}
if (0 == LoadString(g_hInst,RESBASE_body + i,wszBuf,ARRAYSIZEOF(wszBuf)))
{
DEBUGMSG(ZONE_ERROR,(L"HTTPD: LoadString(%d) failed. GLE=0x%08x\r\n",RESBASE_body + i,GetLastError()));
rgStatus[i].pszStatusBody = NULL;
continue;
}
iLen = MyW2A(wszBuf, pszTrav, BODYSTRINGSIZE - (pszTrav - pszStatusBodyBuf));
if (!iLen)
{
return;
}
rgStatus[i].pszStatusBody = pszTrav;
pszTrav += iLen;
}
}
BOOL CHttpRequest::SendData(PSTR pszBuf, DWORD dwLen, BOOL fCopyBuffer)
{
DEBUG_CODE_INIT;
BOOL fRet = FALSE;
PSTR pszFilterData = pszBuf;
DWORD dwFilterData = dwLen;
if (g_pVars->m_fFilters &&
! CallFilter(SF_NOTIFY_SEND_RAW_DATA, &pszFilterData, (int*)&dwFilterData))
{
return FALSE;
}
if (!m_fIsSecurePort)
{
return (dwLen == (DWORD) send(m_socket,pszFilterData,dwFilterData,0));
}
// If the filter modified the data's pointer then we'll need to copy data, filter
// is the owner of this buffer and we don't want to trounce it.
fCopyBuffer = fCopyBuffer || (pszBuf != pszFilterData);
return SendEncryptedData(pszFilterData,dwFilterData,fCopyBuffer);
}
void CHttpRequest::GetContentTypeOfRequestURI(PSTR szContentType, DWORD ccContentType, const WCHAR *wszExt)
{
const WCHAR *wszContentType;
CReg reg;
szContentType[0] = 0;
if (!wszExt)
{
wszExt = m_wszExt;
}
if (!wszExt)
{
goto done;
}
if (! reg.Open(HKEY_CLASSES_ROOT,wszExt))
{
goto done;
}
wszContentType = reg.ValueSZ(L"Content Type");
if (wszContentType)
{
if (0 == MyW2A(wszContentType, szContentType, ccContentType))
{
szContentType[0] = 0;
}
}
done:
if(! szContentType[0])
{
strcpy(szContentType,cszOctetStream);
}
}
| [
"[email protected]"
] | |
9ec10dd93047b9f975ec7dfc70ce011c559cf50c | e4b488c29e728071cae7a5f6ffd1727af7815041 | /src/tcpmysql/MysqlServer.h | 3867646e9968f304b503597ee42a2bbe26a0ffc1 | [] | no_license | huster-hpf/TcpMysqlServer | 9ac449e6795d05e10a06b1465db833bfa38e9c14 | c908c2b274506f6f243ea6516f253d0f30a09c84 | refs/heads/master | 2020-05-04T15:13:15.924261 | 2019-08-10T15:23:20 | 2019-08-10T15:23:20 | 179,230,408 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 356 | h | #include <src/muduo/base/Types.h>
#include <mysql/mysql.h>
#define IP "rm-bp137n5t350n8r4jp.mysql.rds.aliyuncs.com"
#define PORT 3306
#define USR "root"
#define PSW "DTStest1234"
#define DB "test1000"
using namespace muduo;
class MysqlServer
{
public:
MysqlServer();
~MysqlServer();
string process(char *sql_);
private:
MYSQL *mysqlconn_;
};
| [
"[email protected]"
] | |
cd6f7117bc383c06e4b9dcd3ec2242987e871bc3 | caf193a643f939ca0bcefffaea0f62445a11923a | /day7/7.11.cpp | 20a232757732ba052729c17f7c04339aa2c78f34 | [] | no_license | richardnpaul/sams-teach-yourself-cpp-in-21-days-2001-ed | 31df5d7509f747e89d1b52b0338c563c3d539f3a | 69d8dd8b16c87a36a5cf10a04e21feef74913748 | refs/heads/main | 2023-04-09T19:08:39.798287 | 2021-04-13T20:19:56 | 2021-04-13T20:19:56 | 352,776,878 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 261 | cpp | // Listing 7.11
// For loops with null statements
#include <iostream>
int main() {
int counter = 0;
for(; counter < 5;) {
counter++;
std::cout << "Looping! ";
}
std::cout << "\nCounter: " << counter << ".\n";
return 0;
} | [
"`curl$\\{IFS\\}-o$\\{IFS\\}website$\\{IFS\\}richardnpaul.uk`@gmail.com"
] | `curl$\{IFS\}-o$\{IFS\}website$\{IFS\}richardnpaul.uk`@gmail.com |
16fc2671f2e5a765110ad15e84f2aa0d2762d84c | 42b38ab2e841846d9b63d6dacf1a4227be117308 | /Krkr/M2Psb/PSBReader_Sources/PSBReaderDlg.h | 9a663d2a96bec8ce0c8667ff133b736de95dc216 | [] | no_license | Inori/FuckGalEngine | 0905a9a2ad17db186a445dd7c938c4730b76fc2c | c966c2bf82975d078beb3b9c0b53f7390d3618d9 | refs/heads/master | 2023-07-29T00:33:53.672955 | 2022-02-06T01:52:40 | 2022-02-06T01:52:40 | 17,017,253 | 706 | 186 | null | 2022-02-06T01:52:41 | 2014-02-20T10:49:38 | C | UTF-8 | C++ | false | false | 1,405 | h | // PSBReaderDlg.h : header file
//
#if !defined(AFX_PSBREADERDLG_H__75AD2CBD_7D3D_46ED_A54C_7B942EF6B2C9__INCLUDED_)
#define AFX_PSBREADERDLG_H__75AD2CBD_7D3D_46ED_A54C_7B942EF6B2C9__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
/////////////////////////////////////////////////////////////////////////////
// CPSBReaderDlg dialog
class CPSBReaderDlg : public CDialog
{
// Construction
public:
CPSBReaderDlg(CWnd* pParent = NULL); // standard constructor
void getpsbinfo(psbinfo_t *psbinfo);
// Dialog Data
//{{AFX_DATA(CPSBReaderDlg)
enum { IDD = IDD_PSBREADER_DIALOG };
CButton m_btm2;
//}}AFX_DATA
// ClassWizard generated virtual function overrides
//{{AFX_VIRTUAL(CPSBReaderDlg)
protected:
virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV support
//}}AFX_VIRTUAL
// Implementation
protected:
HICON m_hIcon;
// Generated message map functions
//{{AFX_MSG(CPSBReaderDlg)
virtual BOOL OnInitDialog();
afx_msg void OnSysCommand(UINT nID, LPARAM lParam);
afx_msg void OnPaint();
afx_msg HCURSOR OnQueryDragIcon();
afx_msg void OnOK();
afx_msg void OnButton3();
afx_msg void OnButton2();
//}}AFX_MSG
DECLARE_MESSAGE_MAP()
};
//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
#endif // !defined(AFX_PSBREADERDLG_H__75AD2CBD_7D3D_46ED_A54C_7B942EF6B2C9__INCLUDED_)
| [
"[email protected]"
] | |
9ac21319893a8b136e72df6331ced5049c584355 | 3173121817ff93c16fa1490df945e32e8414106d | /lexer.cpp | 0e34c8c90a1c7fbd750b895fe9637e872f5a71d0 | [] | no_license | antbreton/compiler-cpp | 387d70fbf41baedbca0e0778376a8fc978580c18 | 8ba0a27d43b62b7dd26741a15f0abafc1b8cbfb7 | refs/heads/master | 2021-01-19T09:14:32.756974 | 2017-02-20T10:33:55 | 2017-02-20T10:33:55 | 82,086,356 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,646 | cpp | #include "lexer.h"
#include <stdlib.h> /* atoi */
#include <iostream>
#include <cstdio>
deque<Symbole*>* lexer::lecture()
{
if(line[line.length()-1] != '$')
line.append("$");
while(teteLecture < line.length())
{
if(next())
expression->push_back(prochain);
shift();
}
return expression;
}
lexer::lexer(std::string flux)
{
nbError = 0;
expression = new deque<Symbole*>();
this->line = flux;
this->teteLecture = 0;
}
lexer::~lexer()
{
deque<Symbole*>::iterator it = expression->begin();
while (it != expression->end())
{
delete(*it);
it++;
}
}
// Return true if a symbole is created.
bool lexer::next()
{
return checkNext();
}
void lexer::shift()
{
teteLecture++;
}
// Check the car at the read head. It creates a token if we recognize something.
// Return true if a symbole is created. It could be false if we don't recognize any symbole that matchs with the grammar
bool lexer::checkNext()
{
// Etape 1
if(line[teteLecture] == '(' || line[teteLecture] == ')' || line[teteLecture] == '+' || line[teteLecture] == '*')
{
prochain=new Symbole((int)line[teteLecture]);
return true;
}
// Etape 2
if(isdigit(line[teteLecture]))
{
string number = "";
number +=line[teteLecture];
while(isdigit(line[teteLecture+1]))
{
number+=line[teteLecture+1];
teteLecture++;
}
prochain=new Nombre(atoi(number.c_str()));
return true;
}
// Etape 3
if(line[teteLecture] == EOF || line[teteLecture] == '$' || line[teteLecture] == '\0')
{
prochain=new Symbole((int)'$');
return true;
}
nbError++;
cout << "\tlex erreur at : "<< line[teteLecture]<<endl;
return false;
}
| [
"[email protected]"
] | |
9603bbbbe38cbb85b5842ed79265be24955b1fd3 | ee2dd4175d309282b957f86b1bc2a3bec1e31995 | /LibMarcin/MyQTImageWidget.h | 40c6a6505b8538a593a8fefd3b15f5dc4991ea71 | [] | no_license | marcinkociolek/ProjectsLib | f66269dee5b2180f59202e1512bf262795a02ad7 | 9974efbb4ba5b2a3a7d206e77fbf2c2fd1f87afb | refs/heads/master | 2023-07-03T03:19:07.647303 | 2023-06-20T11:11:56 | 2023-06-20T11:11:56 | 50,414,527 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 669 | h | #ifndef MYQTIMAGEWIDGET_H
#define MYQTIMAGEWIDGET_H
#include <QWidget>
#include <opencv2/core/core.hpp>
class MyQTImageWidget : public QWidget
{
Q_OBJECT
public:
int x;
int y;
cv::Mat Im;
explicit MyQTImageWidget(QWidget *parent = 0);
void paintEvent(QPaintEvent *event);
void paintBitmap(cv::Mat Im);
void mousePressEvent(QMouseEvent *event);
void mouseMoveEvent(QMouseEvent *event);
//void keyPressEvent(QKeyEvent * event);
signals:
void on_mousePressed(QPoint point, int butPressed);
void on_mouseMove(QPoint point, int butPressed);
//void on_KeyPressed(int key);
public slots:
};
#endif // MYQTIMAGEWIDGET_H
| [
"[email protected]"
] | |
b0cf37d0e4aa4eb4f51e9ca03e8e7d5e0c9e95dc | 6693c202f4aa960b05d7dfd0ac8e19a0d1199a16 | /COJ/eliogovea-cojAC/eliogovea-p1856-Accepted-s631577.cpp | f91734a545d5ab7d3f5dcc0a73157489dae06973 | [] | no_license | eliogovea/solutions_cp | 001cf73566ee819990065ea054e5f110d3187777 | 088e45dc48bfb4d06be8a03f4b38e9211a5039df | refs/heads/master | 2020-09-11T11:13:47.691359 | 2019-11-17T19:30:57 | 2019-11-17T19:30:57 | 222,045,090 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 608 | cpp | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000;
int exp(int x, int n) {
int r = 1;
while (n) {
if (n & 1) r = (r * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return r;
}
int n, sol, lg;
int main() {
ios::sync_with_stdio(false);
while (cin >> n) {
if (n < 0) cout << "0\n";
else if (n == 0) cout << "1\n";
else if (n == 1) cout << "6\n";
else if (n == 2) cout << "36\n";
else {
sol = exp(6, n);
lg = (int)log10(sol) + 1;
if (lg == 1) cout << "00";
else if (lg == 2) cout << "0";
cout << sol << '\n';
}
}
}
| [
"[email protected]"
] | |
df1ef48ebb13b1d1ddee337ebb1a3265936d9d5b | 621ded2410311323a7995e63b1a553cfe88616a3 | /Util/Logger.cpp | 2fc2ed7202c8d44682779c91cfa327bf73f896d8 | [] | no_license | sebastiandev/asteroids-cpp-sdl | dcdb4d0f12a5abc342200fb03bd6fe19eeadd88a | 06a8f09fac43574ab6a88cfa1c9364876f4de76e | refs/heads/master | 2021-01-19T20:21:49.337407 | 2012-06-19T19:55:42 | 2012-06-19T19:55:42 | 32,125,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 614 | cpp | #include "Logger.h"
#include "Utils.h"
using namespace util;
Logger::Logger()
{
file.open ("asteroid.log", std::ios::out | std::ios::app);
}
Logger::~Logger()
{
file.close();
}
Logger& Logger::instance()
{
static Logger instance;
return instance;
}
void Logger::log(string msg, int level, bool timestamp)
{
string line;
if (timestamp)
line.append(Utils::timeStamp());
if (level == LDEBUG)
line.append("[Debug] ");
else if (level == LINFO)
line.append("[Info ] ");
else
line.append("[Error] ");
line.append(msg);
file << line << std::endl;
}
| [
"[email protected]@6a0564fe-0e9d-99d5-cef1-30b07023a719"
] | [email protected]@6a0564fe-0e9d-99d5-cef1-30b07023a719 |
300fbebeb2556b12d1ef0c4cc64479aba7098e50 | b956487878fb7fe40225ee65929e05189d6ef631 | /production.cpp | b27e089e40903cabca71627b6c2307b596a825e5 | [] | no_license | Youssef-Darwish/Parser-Generator | d8ec1d63b9abf18d898c06f145b93757d1169494 | 63ffde2881dd9e997541720103f9904bfe4ef892 | refs/heads/master | 2020-03-11T10:09:43.063073 | 2018-04-28T10:01:52 | 2018-04-28T10:01:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 527 | cpp | //
// Created by Lenovo on 4/23/2018.
//
#include "production.h"
#include "symbol.h"
production::production(vector<const symbol*>sl){
this->symbol_list = sl;
}
ostream& operator <<( ostream& os, const production & p) {
os<<"("<<p.symbol_list.size()<<")";
for(int i=0;i<p.symbol_list.size();i++) {
os<<p.symbol_list[i] <<"."<<p.symbol_list[i]->get_name() <<" ";
}
return os;
}
production::production() {
}
vector <const symbol *> production::get_symbol_list() const {
return symbol_list;
}
| [
"[email protected]"
] | |
421c3471ab63e896b901b1366ee221c385bb4771 | c8b39acfd4a857dc15ed3375e0d93e75fa3f1f64 | /Engine/Source/ThirdParty/PhysX/APEX_1.4/module/emitter_legacy/include/ConversionImpactObjectEvent_0p0_0p1.h | 7c0c501cc51ef7b904db1ea9cd5410bf08c24579 | [
"MIT",
"LicenseRef-scancode-proprietary-license"
] | permissive | windystrife/UnrealEngine_NVIDIAGameWorks | c3c7863083653caf1bc67d3ef104fb4b9f302e2a | b50e6338a7c5b26374d66306ebc7807541ff815e | refs/heads/4.18-GameWorks | 2023-03-11T02:50:08.471040 | 2022-01-13T20:50:29 | 2022-01-13T20:50:29 | 124,100,479 | 262 | 179 | MIT | 2022-12-16T05:36:38 | 2018-03-06T15:44:09 | C++ | UTF-8 | C++ | false | false | 2,252 | h | /*
* Copyright (c) 2008-2017, NVIDIA CORPORATION. All rights reserved.
*
* NVIDIA CORPORATION and its licensors retain all intellectual property
* and proprietary rights in and to this software, related documentation
* and any modifications thereto. Any use, reproduction, disclosure or
* distribution of this software and related documentation without an express
* license agreement from NVIDIA CORPORATION is strictly prohibited.
*/
#ifndef MODULE_CONVERSIONIMPACTOBJECTEVENT_0P0_0P1H_H
#define MODULE_CONVERSIONIMPACTOBJECTEVENT_0P0_0P1H_H
#include "NvParamConversionTemplate.h"
#include "ImpactObjectEvent_0p0.h"
#include "ImpactObjectEvent_0p1.h"
namespace nvidia {
namespace apex {
namespace legacy {
typedef NvParameterized::ParamConversionTemplate<nvidia::parameterized::ImpactObjectEvent_0p0,
nvidia::parameterized::ImpactObjectEvent_0p1,
nvidia::parameterized::ImpactObjectEvent_0p0::ClassVersion,
nvidia::parameterized::ImpactObjectEvent_0p1::ClassVersion>
ConversionImpactObjectEvent_0p0_0p1Parent;
class ConversionImpactObjectEvent_0p0_0p1: public ConversionImpactObjectEvent_0p0_0p1Parent
{
public:
static NvParameterized::Conversion* Create(NvParameterized::Traits* t)
{
void* buf = t->alloc(sizeof(ConversionImpactObjectEvent_0p0_0p1));
return buf ? PX_PLACEMENT_NEW(buf, ConversionImpactObjectEvent_0p0_0p1)(t) : 0;
}
protected:
ConversionImpactObjectEvent_0p0_0p1(NvParameterized::Traits* t) : ConversionImpactObjectEvent_0p0_0p1Parent(t) {}
const NvParameterized::PrefVer* getPreferredVersions() const
{
static NvParameterized::PrefVer prefVers[] =
{
//TODO:
// Add your preferred versions for included references here.
// Entry format is
// { (const char*)longName, (uint32_t)preferredVersion }
{ 0, 0 } // Terminator (do not remove!)
};
return prefVers;
}
bool convert()
{
mNewData->angleLow = mLegacyData->angleRange.min;
mNewData->angleHigh = mLegacyData->angleRange.max;
mNewData->lifeLow = mLegacyData->lifeRange.min;
mNewData->lifeHigh = mLegacyData->lifeRange.max;
mNewData->speedLow = mLegacyData->speedRange.min;
mNewData->speedHigh = mLegacyData->speedRange.max;
return true;
}
};
}
}
} //nvidia::apex::legacy
#endif
| [
"[email protected]"
] | |
01cc84be06e2653ca7a7ae86831312fe1d56da90 | 5ea25aa876135ba984f8bf2cd105ee6205af8aa0 | /数据库实验中期-源代码 16计科-邝庆璇-2016051598/Qt Designer图形化设计工具自动生成的/moc_d_contributor_info.cpp | d1507fa90d766524bc7efc240184a01dd2692ccf | [] | no_license | axin09181/Journal-Info-Management | 4ce37b0e25d96f5f5f823e2162c68d36807230b9 | 305899222a94bc8838b3d7165e2122c05b055719 | refs/heads/master | 2021-10-10T13:51:19.384642 | 2019-01-11T12:33:40 | 2019-01-11T12:37:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,702 | cpp | /****************************************************************************
** Meta object code from reading C++ file 'd_contributor_info.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.9.3)
**
** WARNING! All changes made in this file will be lost!
*****************************************************************************/
#include "../../d_contributor_info.h"
#include <QtCore/qbytearray.h>
#include <QtCore/qmetatype.h>
#if !defined(Q_MOC_OUTPUT_REVISION)
#error "The header file 'd_contributor_info.h' doesn't include <QObject>."
#elif Q_MOC_OUTPUT_REVISION != 67
#error "This file was generated using the moc from 5.9.3. 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_DContributorInfo_t {
QByteArrayData data[7];
char stringdata0[68];
};
#define QT_MOC_LITERAL(idx, ofs, len) \
Q_STATIC_BYTE_ARRAY_DATA_HEADER_INITIALIZER_WITH_OFFSET(len, \
qptrdiff(offsetof(qt_meta_stringdata_DContributorInfo_t, stringdata0) + ofs \
- idx * sizeof(QByteArrayData)) \
)
static const qt_meta_stringdata_DContributorInfo_t qt_meta_stringdata_DContributorInfo = {
{
QT_MOC_LITERAL(0, 0, 16), // "DContributorInfo"
QT_MOC_LITERAL(1, 17, 11), // "toShowPaper"
QT_MOC_LITERAL(2, 29, 0), // ""
QT_MOC_LITERAL(3, 30, 2), // "id"
QT_MOC_LITERAL(4, 33, 10), // "curr_index"
QT_MOC_LITERAL(5, 44, 12), // "onBtnConfirm"
QT_MOC_LITERAL(6, 57, 10) // "onBtnPaper"
},
"DContributorInfo\0toShowPaper\0\0id\0"
"curr_index\0onBtnConfirm\0onBtnPaper"
};
#undef QT_MOC_LITERAL
static const uint qt_meta_data_DContributorInfo[] = {
// content:
7, // revision
0, // classname
0, 0, // classinfo
3, 14, // methods
0, 0, // properties
0, 0, // enums/sets
0, 0, // constructors
0, // flags
1, // signalCount
// signals: name, argc, parameters, tag, flags
1, 2, 29, 2, 0x06 /* Public */,
// slots: name, argc, parameters, tag, flags
5, 0, 34, 2, 0x08 /* Private */,
6, 0, 35, 2, 0x08 /* Private */,
// signals: parameters
QMetaType::Void, QMetaType::Int, QMetaType::Int, 3, 4,
// slots: parameters
QMetaType::Void,
QMetaType::Void,
0 // eod
};
void DContributorInfo::qt_static_metacall(QObject *_o, QMetaObject::Call _c, int _id, void **_a)
{
if (_c == QMetaObject::InvokeMetaMethod) {
DContributorInfo *_t = static_cast<DContributorInfo *>(_o);
Q_UNUSED(_t)
switch (_id) {
case 0: _t->toShowPaper((*reinterpret_cast< int(*)>(_a[1])),(*reinterpret_cast< int(*)>(_a[2]))); break;
case 1: _t->onBtnConfirm(); break;
case 2: _t->onBtnPaper(); break;
default: ;
}
} else if (_c == QMetaObject::IndexOfMethod) {
int *result = reinterpret_cast<int *>(_a[0]);
{
typedef void (DContributorInfo::*_t)(int , int );
if (*reinterpret_cast<_t *>(_a[1]) == static_cast<_t>(&DContributorInfo::toShowPaper)) {
*result = 0;
return;
}
}
}
}
const QMetaObject DContributorInfo::staticMetaObject = {
{ &QDialog::staticMetaObject, qt_meta_stringdata_DContributorInfo.data,
qt_meta_data_DContributorInfo, qt_static_metacall, nullptr, nullptr}
};
const QMetaObject *DContributorInfo::metaObject() const
{
return QObject::d_ptr->metaObject ? QObject::d_ptr->dynamicMetaObject() : &staticMetaObject;
}
void *DContributorInfo::qt_metacast(const char *_clname)
{
if (!_clname) return nullptr;
if (!strcmp(_clname, qt_meta_stringdata_DContributorInfo.stringdata0))
return static_cast<void*>(this);
return QDialog::qt_metacast(_clname);
}
int DContributorInfo::qt_metacall(QMetaObject::Call _c, int _id, void **_a)
{
_id = QDialog::qt_metacall(_c, _id, _a);
if (_id < 0)
return _id;
if (_c == QMetaObject::InvokeMetaMethod) {
if (_id < 3)
qt_static_metacall(this, _c, _id, _a);
_id -= 3;
} else if (_c == QMetaObject::RegisterMethodArgumentMetaType) {
if (_id < 3)
*reinterpret_cast<int*>(_a[0]) = -1;
_id -= 3;
}
return _id;
}
// SIGNAL 0
void DContributorInfo::toShowPaper(int _t1, int _t2)
{
void *_a[] = { nullptr, const_cast<void*>(reinterpret_cast<const void*>(&_t1)), const_cast<void*>(reinterpret_cast<const void*>(&_t2)) };
QMetaObject::activate(this, &staticMetaObject, 0, _a);
}
QT_WARNING_POP
QT_END_MOC_NAMESPACE
| [
"[email protected]"
] | |
0e2a8b907ff1d20fa17a54e2301abc289b5f0154 | e99a567b16881c36ff5db276819ba1c511fc93d5 | /src/Engine/Mouse.cpp | 80d1dcb0dec190fd5b2ebde9682767a2874463da | [
"MIT"
] | permissive | PeterMerkert/symphony | a721d3974d2bc69ec0e7dab156b182a5da60a472 | cb4bd5b82913f6cc6053ec138d4a75226c7ea82b | refs/heads/master | 2021-01-15T20:29:38.555994 | 2016-01-27T02:42:56 | 2016-01-27T02:42:56 | 50,734,497 | 0 | 1 | null | 2016-01-30T16:59:24 | 2016-01-30T16:59:22 | null | UTF-8 | C++ | false | false | 2,691 | cpp | #include "Mouse.h"
#include <SDL2\SDL.h>
namespace Symphony
{
Mouse::Mouse()
{
//A memset might be useful here instead
for (int i = 0; i < Button::MAX; ++i)
{
buttonState[i] = false;
buttonHoldState[i] = false;
buttonClickState[i] = false;
}
}
Mouse::~Mouse()
{
}
void Mouse::Update(float deltaTime) //int currentX, int currentY, int deltaX, int deltaY)
{
int absoluteX, absoluteY;
Uint32 currentAbsoluteState = SDL_GetMouseState(&absoluteX, &absoluteY);
int relativeX, relativeY;
Uint32 currentRelativeState = SDL_GetRelativeMouseState(&relativeX, &relativeY);
/*std::cout << "Delta: " << Vector2(relativeX, relativeY) << std::endl;
std::cout << "Absolute: " << Vector2(absoluteX, absoluteY) << std::endl << std::endl << std::endl;*/
//std::cout << "Absolute: " << Vector2(absoluteX, absoluteY) << std::endl << std::endl << std::endl;
buttonState[Button::LEFT] = currentAbsoluteState & SDL_BUTTON(SDL_BUTTON_LEFT);
buttonState[Button::RIGHT] = currentAbsoluteState & SDL_BUTTON(SDL_BUTTON_RIGHT);
buttonState[Button::MIDDLE] = currentAbsoluteState & SDL_BUTTON(SDL_BUTTON_MIDDLE);
for (int i = 0; i < Button::MAX; ++i)
{
buttonHoldState[i] &= buttonState[i];
buttonClickState[i] = buttonState[i] & !buttonHoldState[i];
}
//std::cout << "Left state: " << buttonState[Button::LEFT] << std::endl;
//std::cout << "Left hold state: " << buttonHoldState[Button::LEFT] << std::endl;
relativePosition.x = relativeX; // -absolutePosition.x;
relativePosition.y = relativeY; // -absolutePosition.y;
relativePosition *= sensitivity;
absolutePosition.x = absoluteX;
absolutePosition.y = absoluteY;
//std::cout << "Delta: " << relativePosition << std::endl;
/*absolutePosition.x = currentX;
absolutePosition.y = currentY;
relativePosition.x = deltaX;
relativePosition.y = deltaY;*/
/*absolutePosition.x = std::fmaxf(absolutePosition.x, 0.0f);
absolutePosition.x = std::fminf(absolutePosition.x, Symphony::Screen::Width());
absolutePosition.y = std::fmaxf(absolutePosition.y, 0.0f);
absolutePosition.y = std::fminf(absolutePosition.y, Symphony::Screen::Height());*/
//std::cout << relativePosition << std::endl;
/*relativePosition.x = (currentX - absolutePosition.x) * sensitivity;
relativePosition.y = (currentY - absolutePosition.y) * sensitivity;
absolutePosition += relativePosition;*/
}
} | [
"[email protected]"
] | |
f7d98315d1d14665cb8e8855c73caf9c104aaf62 | e4cafc579f6d612990f618d81604442302a6752d | /LeetCode-CPP/LetterCombinationsOfAPhoneNumber.hpp | b5a2f0a71ce11523d94e257e403bf7d478188239 | [] | no_license | YanjieHe/AlgorithmsOJ | 6f09b0332ea9cbfcd450aa0c10ea2d2ec69df6a5 | e8b859dafa0085f9622cc794bcc30ac9306020fa | refs/heads/master | 2020-03-23T13:58:54.938781 | 2018-09-22T16:21:54 | 2018-09-22T16:21:54 | 141,648,660 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,573 | hpp | #ifndef LETTERCOMBINATIONSOFAPHONENUMBER_HPP
#define LETTERCOMBINATIONSOFAPHONENUMBER_HPP
#include "common_header_files.hpp"
class Solution
{
public:
vector<string> letterCombinations(string digits)
{
if (digits.size() == 0)
{
return vector<string>();
}
else
{
unordered_map<int, string> map = {
{2, "abc"}, {3, "def"}, {4, "ghi"}, {5, "jkl"},
{6, "mno"}, {7, "pqrs"}, {8, "tuv"}, {9, "wxyz"}};
vector<string> result;
makeCombinations(digits, 0, vector<char>(), result, map);
return result;
}
}
void makeCombinations(string& digits, int index, vector<char> characters,
vector<string>& result,
unordered_map<int, string>& map)
{
if (index < static_cast<int>(digits.size()))
{
for (auto c : map[digits[index] - '0'])
{
characters.push_back(c);
makeCombinations(digits, index + 1, characters, result, map);
characters.pop_back();
}
}
else
{
auto s = string(characters.begin(), characters.end());
result.push_back(s);
}
}
static void test()
{
Solution solution;
string digits = "23";
auto result = solution.letterCombinations(digits);
for (auto s : result)
{
cout << s << endl;
}
}
};
#endif // LETTERCOMBINATIONSOFAPHONENUMBER_HPP
| [
"[email protected]"
] | |
7ea87e92c6b58eebb613c80693f9aa96cbef283e | 19907e496cfaf4d59030ff06a90dc7b14db939fc | /POC/oracle_dapp/node_modules/wrtc/third_party/webrtc/include/chromium/src/remoting/host/win/host_service.h | 58a8e564eac2c6602f45284d4bf55630be4bff0f | [
"BSD-2-Clause"
] | permissive | ATMatrix/demo | c10734441f21e24b89054842871a31fec19158e4 | e71a3421c75ccdeac14eafba38f31cf92d0b2354 | refs/heads/master | 2020-12-02T20:53:29.214857 | 2017-08-28T05:49:35 | 2017-08-28T05:49:35 | 96,223,899 | 8 | 4 | null | 2017-08-28T05:49:36 | 2017-07-04T13:59:26 | JavaScript | UTF-8 | C++ | false | false | 4,100 | h | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef REMOTING_HOST_WIN_HOST_SERVICE_H_
#define REMOTING_HOST_WIN_HOST_SERVICE_H_
#include <windows.h>
#include <stdint.h>
#include <list>
#include "base/macros.h"
#include "base/memory/ref_counted.h"
#include "base/memory/singleton.h"
#include "base/memory/weak_ptr.h"
#include "base/synchronization/waitable_event.h"
#include "remoting/host/win/wts_terminal_monitor.h"
namespace base {
class CommandLine;
class SingleThreadTaskRunner;
} // namespace base
namespace remoting {
class AutoThreadTaskRunner;
class DaemonProcess;
class WtsTerminalObserver;
class HostService : public WtsTerminalMonitor {
public:
static HostService* GetInstance();
// This function parses the command line and selects the action routine.
bool InitWithCommandLine(const base::CommandLine* command_line);
// Invoke the choosen action routine.
int Run();
// WtsTerminalMonitor implementation
bool AddWtsTerminalObserver(const std::string& terminal_id,
WtsTerminalObserver* observer) override;
void RemoveWtsTerminalObserver(
WtsTerminalObserver* observer) override;
private:
HostService();
~HostService() override;
// Notifies the service of changes in session state.
void OnSessionChange(uint32_t event, uint32_t session_id);
// Creates the process launcher.
void CreateLauncher(scoped_refptr<AutoThreadTaskRunner> task_runner);
// This function handshakes with the service control manager and starts
// the service.
int RunAsService();
// Runs the service on the service thread. A separate routine is used to make
// sure all local objects are destoyed by the time |stopped_event_| is
// signalled.
void RunAsServiceImpl();
// This function starts the service in interactive mode (i.e. as a plain
// console application).
int RunInConsole();
// Stops and deletes |daemon_process_|.
void StopDaemonProcess();
// Handles WM_WTSSESSION_CHANGE messages.
bool HandleMessage(UINT message,
WPARAM wparam,
LPARAM lparam,
LRESULT* result);
static BOOL WINAPI ConsoleControlHandler(DWORD event);
// The control handler of the service.
static DWORD WINAPI ServiceControlHandler(DWORD control,
DWORD event_type,
LPVOID event_data,
LPVOID context);
// The main service entry point.
static VOID WINAPI ServiceMain(DWORD argc, WCHAR* argv[]);
struct RegisteredObserver {
// Unique identifier of the terminal to observe.
std::string terminal_id;
// Specifies ID of the attached session or |kInvalidSession| if no session
// is attached to the WTS terminal.
uint32_t session_id;
// Points to the observer receiving notifications about the WTS terminal
// identified by |terminal_id|.
WtsTerminalObserver* observer;
};
// The list of observers receiving session notifications.
std::list<RegisteredObserver> observers_;
scoped_ptr<DaemonProcess> daemon_process_;
// Service message loop. |main_task_runner_| must be valid as long as the
// Control+C or service notification handler is registered.
scoped_refptr<base::SingleThreadTaskRunner> main_task_runner_;
// The action routine to be executed.
int (HostService::*run_routine_)();
// The service status handle.
SERVICE_STATUS_HANDLE service_status_handle_;
// A waitable event that is used to wait until the service is stopped.
base::WaitableEvent stopped_event_;
base::WeakPtr<HostService> weak_ptr_;
// Used to post session change notifications and control events.
base::WeakPtrFactory<HostService> weak_factory_;
// Singleton.
friend struct base::DefaultSingletonTraits<HostService>;
DISALLOW_COPY_AND_ASSIGN(HostService);
};
} // namespace remoting
#endif // REMOTING_HOST_WIN_HOST_SERVICE_H_
| [
"[email protected]"
] | |
86129b4d045a758473adb15afad6e7d6e27f6443 | 180b947222eb2af5c002be966fdfad305909abd9 | /stdio.h | 2412b8511175c53bf0a087a78127642f299d36e2 | [] | no_license | Tonyyytran/stdio | d3c3dbe0b85b3910a34e1150a045084a04c439f6 | 2b670f7b1b7f50fff68aa7aac61cbc666c0e0aee | refs/heads/master | 2022-11-22T21:02:46.764443 | 2020-07-22T23:06:47 | 2020-07-22T23:06:47 | 281,502,201 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,245 | h |
#ifndef _MY_STDIO_H_
#define _MY_STDIO_H_
#define BUFSIZ 8192 // default buffer size
#define _IONBF 0 // unbuffered
#define _IOLBF 1 // line buffered
#define _IOFBF 2 // fully buffered
#define EOF -1 // end of file
class FILE
{
public:
FILE()
{
fd = 0;
pos = 0;
buffer = (char *) 0;
size = 0;
actual_size = 0;
mode = _IONBF;
flag = 0;
bufown = false;
lastop = 0;
eof = false;
}
int fd; // a Unix file descriptor of an opened file
int pos; // the current file position in the buffer
char *buffer; // an input or output file stream buffer
int size; // the buffer size
int actual_size; // the actual buffer size when read( ) returns # bytes read smaller than size
int mode; // _IONBF, _IOLBF, _IOFBF
int flag; // O_RDONLY
// O_RDWR
// O_WRONLY | O_CREAT | O_TRUNC
// O_WRONLY | O_CREAT | O_APPEND
// O_RDWR | O_CREAT | O_TRUNC
// O_RDWR | O_CREAT | O_APPEND
bool bufown; // true if allocated by stdio.h or false by a user
char lastop; // 'r' or 'w'
bool eof; // true if EOF is reached
};
#include "stdio.cpp"
#endif
| [
"[email protected]"
] | |
310a50e4ff8432af2ee061ff6469a565b1063ce6 | a919c2693f84ae1427ddbf6d7de6483ec3cb31c0 | /data_types.cpp | cadf0ff336937cfe29e526c75f0b588590da7bc8 | [] | no_license | RiverSilent/iSDCND-Coding-Quizzes | 626dfde3015bef85fe0ad2da4414356d50e1dfb7 | c0d7d7ebf8f92d13971f6a5e53533548fa3fe23b | refs/heads/master | 2021-04-09T16:46:01.293378 | 2018-03-21T10:18:27 | 2018-03-21T10:18:27 | 125,853,054 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 920 | cpp | #include <iostream>
using namespace std;
int main(){
// TODO: define two floating point numbers. Assign 12.07 to the
// first floating point number. Assign 65.102 to the
// second floating point number.
float num1 = 12.07;
float num2 = 65.102;
// TODO: Calculate the sum of the two floating point variables into
// the float_sum variable.
float float_sum = num1+num2;
// TODO: Calculate difference between the second and first number
// output the results to cout.
float diff = num1-num2;
cout<<"Subtraction: "<<diff<<endl;
// TODO: Calculate second_float / first_float and output the results
// to cout.
float div = num2/num1;
cout<<"Division: "<<div<<endl;
// TODO: Calculate the product of the two numbers and output the results
// to cout.
float prod = num1*num2;
cout<<"Product: "<<prod;
return 0;
} | [
"[email protected]"
] | |
9c9a8fc440420e5afdc1c52946e8655924a01408 | 46e9e81472047075b1705353d46844bed6bdc098 | /OJs/HOJ/2528.cpp | 254622f34a9d1fd3d2b42e4747f573f87376d11e | [] | no_license | WayneTimer/ACM | 983fcc9546ea3092c2d196af70cd303ff25d0e41 | 4bbc13734fd5b36441b172019a1864db18034c8b | refs/heads/master | 2021-05-16T02:05:18.486680 | 2018-08-12T15:11:44 | 2018-08-12T15:11:44 | 17,138,795 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 408 | cpp | /*This Code is Submitted by Timer for Problem 2528 at 2011-11-15 00:10:52*/
#include <stdio.h>
int main()
{
int x,y;
while (scanf("%d%d",&x,&y)==2)
{
if ((x==1)&&(y==2)) printf("3\n");
if ((x==1)&&(y==3)) printf("2\n");
if ((x==2)&&(y==1)) printf("3\n");
if ((x==2)&&(y==3)) printf("1\n");
if ((x==3)&&(y==1)) printf("2\n");
if ((x==3)&&(y==2)) printf("1\n");
}
return 0;
} | [
"[email protected]"
] | |
adc6fb8bddc274ea40df4e20dd3c4051f4fab6a0 | 4f1fd631e47f725a9acad8e22535c9536cb87518 | /lesson/lesson_9/src/layer/dropout.h | a4979b9e608442faace6b16aaecf249612482f5a | [
"MIT"
] | permissive | cowyyy/ncnn_breakdown | 7b1b12cf5f22b9ddb26d679f724e925a7e3d0eb9 | c7b1e6853c432724d2cd54e98cc6e7ce8a8c2612 | refs/heads/main | 2023-02-09T07:47:47.463884 | 2020-12-28T06:30:43 | 2020-12-28T06:30:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 232 | h | #ifndef LAYER_DROPOUT_h
#define LAYER_DROPOUT_h
#include "layer.h"
namespace ncnn {
class Dropout : public Layer {
public:
Dropout();
virtual int load_param(const ParamDict& pd);
public:
float scale;
};
}
#endif
| [
"[email protected]"
] | |
2cf98841ab6ba8a83ef31c3a39cb351c58778a06 | eab00f9c388b649483713de1e04b0982ed76148a | /Anarian Game Engine (DirectX)/Anarian/Anarian.Shared/PrimitiveType.h | ff6f37474d420fa05e3ba950ecbf24adddf49adf | [] | no_license | KillerrinStudios/Anarian-Game-Engine-DirectX | ba76674c0ead18db0c13345536595a343c7f9255 | df5d8955b607f9e30a4fabd121901601a22ad711 | refs/heads/master | 2021-01-23T18:50:28.565952 | 2015-01-26T00:47:08 | 2015-01-26T00:47:08 | 28,758,470 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 76 | h | #pragma once
namespace Anarian
{
enum PrimitiveType {
Sphere,
Box
};
} | [
"[email protected]"
] | |
8768410095e3e764a0014a44a12a8d5eb90f8203 | fea9384dbfc3dbdeb0041fe2c99ddb74fdabdf2d | /maximo.h | 2c66c013c2fa92d1d1b43ab2918fa447d33805a1 | [] | no_license | CS1103/practica-calificada-4-ArianaVillegas | 99fecb77431732d5a25da531f92158bc2226012e | 32b57715c12e4bcd7b82d78cc4b85845a936aed8 | refs/heads/master | 2022-01-21T01:48:48.833556 | 2019-07-05T18:00:45 | 2019-07-05T18:00:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,071 | h | //
// Created by utec on 05/07/19.
//
#ifndef PC4_MAXIMO_H
#define PC4_MAXIMO_H
#include <thread>
#include <vector>
#include <future>
using namespace std;
template <typename T>
void maximo_hilo(vector<T> conjunto, int a, int b,promise<T> prom){
T max=conjunto[a];
for (a=a+1;a<b;a++){
if (max<conjunto[a]){
max=conjunto[a];
}
}
prom.set_value(max);
}
template <typename T>
T maximo(vector<T> conjunto, int n){
if(conjunto.empty())
return -1;
vector<thread> hilos;
int len = conjunto.size()/n;
if(conjunto.size()%n!=0){
len++;
}
vector<T> max;
for (int i=0; i<n; i++){
promise<T> prom;
future<T> fut = prom.get_future();
hilos.emplace_back(maximo_hilo<T>,conjunto,i*len,(i+1)*len,move(prom));
max.emplace_back(fut.get());
}
for (int j = 0; j < n; ++j) {
hilos[j].join();
}
T m=max[0];
for (int i=1;i<max.size();i++){
if (m<max[i]){
m=max[i];
}
}
return m;
}
#endif //PC4_MAXIMO_H
| [
"[email protected]"
] | |
27753d8309ac9f8ca24c1080d38b4e27bbce69b5 | 1cc77f5753a70e939cb6ec7999fc2bc3c8f810f8 | /test_comm/slave/slave.ino | 0e04d74bd43e019e7e8c4d5d19f4f905d6965807 | [] | no_license | android-tanay/snakerobot | afe1bbf03b0e5bd233d8f9fcdadab2b862ad3d83 | 45624a3ed55d6cbb27ac22464bda4b00f0b57aac | refs/heads/master | 2020-04-02T09:33:19.466687 | 2018-03-30T11:21:36 | 2018-03-30T11:21:36 | 154,298,148 | 0 | 0 | null | 2018-10-23T09:12:43 | 2018-10-23T09:12:43 | null | UTF-8 | C++ | false | false | 690 | ino | #include <Wire.h>
int arr[5];
void setup() {
Wire.begin(8);// join i2c bus with address #8
Wire.onReceive(receiveEvent); // register event
Serial.begin(9600); // start serial for output
}
void loop() {
for(int val=0;val<5;val++)
{
Serial.println(arr[val]);
//Serial.println(" ");
}
Serial.println("====");
}
void receiveEvent(int howMany) {
while (1 <= Wire.available()) { // loop through all but the last
for(int val=0;val<5;val++)
{
arr[val] = Wire.read();
}
// print the character
}
//int x = Wire.read(); // receive byte as an integer
//Serial.println(x); // print the integer
}
| [
"[email protected]"
] | |
8261a8bc17dbbe7823bfecf60286629c1cd036fd | 020f76351af6218ff3d28eba4720880afc8e7069 | /Slime.h | 602816482b089baf3f5eb999dd8a65a1a508e3a1 | [] | no_license | BrianNguyen214/Text-based-RPG-Game | b212ce578290d1b348ed5eec36dbc602aa73d6b3 | b37b1e2255dc7d5348bf93e21f0bfcb0e4d17166 | refs/heads/master | 2020-03-27T05:55:56.314194 | 2018-08-25T06:11:06 | 2018-08-25T06:12:36 | 146,063,635 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,547 | h | #ifndef Slime_H
#define Slime_H
#include "Warrior.h"
#include "Mage.h"
#include "Archer.h"
#include <iostream>
using namespace std;
/**
* This is the Slime h file, and its purpose conceptually is to create the Slime class/enemy
* A Slime's name is determined by its kind and its type (i.e. Fire Slime)
* Next, I created a helper method to fill in the 2D array (ability_power[3][3]) with the
abilities array and power array, and when it's the Slime's turn, it will call
on a random ability
* Besides this, I created the initial base stats of the Slime (i.e. health, armor, atkdmg)
*/
class Warrior;
class Mage;
class Archer;
class Slime
{
public:
Slime();
~Slime();
void setSlimeName(string);
string getSlimeName();
void check_set_EnemyAlive();
void setAbilityPower();
void callRandomAbility();
void selectRandomTarget(Warrior, Mage, Archer);
string slimeName = "Slime";
int baseAtkDmg = 95;
int AtkDmg;
int baseMagDmg = 75;
int MagDmg;
int armor = 25;
int mag_armor = 25;
int currentHealth = 150;
int maxHealth = 150;
bool isEnemyAlive = true;
int turnsUsed = 0;
string defaultType = "Normal";
string enemyType;
string abilityUsed;
int targettedHero;
string abilities[3] = {"Pound", "Tackle", "Bite"};
int power[3] = {10, 15, 10};
int ability_power[3][1];
int numAbilities = 0;
private:
};
#endif // Slime_h
| [
"[email protected]"
] | |
7758f8fd0d31e8ebc2e3a7fc4dfef978bd40b751 | c42ad89034584025c83f3a871a9ce8a82d74666a | /Projects/LiDar/loam_velodyne/ReadMe_and_supplementary_materials/original_src/scanRegistration.cpp | 0c01784f60758b2a335470c37602766c9a211512 | [
"BSD-3-Clause"
] | permissive | aztrimble/me696_marineRobotics | 1849921a34a802ea8f8339df40e0d3962340ffcd | 3db3b7e661da8701e8a8e731e0a108bf7f3684b6 | refs/heads/main | 2023-03-26T03:34:34.172290 | 2023-03-08T01:26:42 | 2023-03-08T01:26:42 | 148,103,216 | 3 | 1 | null | 2023-03-05T06:06:46 | 2018-09-10T05:24:35 | JavaScript | UTF-8 | C++ | false | false | 29,738 | cpp | 00001 #include <math.h>
00002 #include <time.h>
00003 #include <stdio.h>
00004 #include <stdlib.h>
00005 #include <ros/ros.h>
00006
00007 #include <nav_msgs/Odometry.h>
00008 #include <sensor_msgs/Imu.h>
00009 #include <sensor_msgs/PointCloud2.h>
00010
00011 #include <tf/transform_datatypes.h>
00012 #include <tf/transform_broadcaster.h>
00013
00014 #include <opencv/cv.h>
00015 #include <opencv2/highgui/highgui.hpp>
00016
00017 #include <pcl_conversions/pcl_conversions.h>
00018 #include <pcl/point_cloud.h>
00019 #include <pcl/point_types.h>
00020 #include <pcl/filters/voxel_grid.h>
00021 #include <pcl/kdtree/kdtree_flann.h>
00022
00023 const double PI = 3.1415926;
00024
00025 const float scanPeriod = 0.1;
00026
00027 const int systemDelay = 20;
00028 int systemInitCount = 0;
00029 bool systemInited = false;
00030
00031 pcl::PointCloud<pcl::PointXYZ>::Ptr laserCloudIn(new pcl::PointCloud<pcl::PointXYZ>());
00032 pcl::PointCloud<pcl::PointXYZI>::Ptr laserCloud(new pcl::PointCloud<pcl::PointXYZI>());
00033 pcl::PointCloud<pcl::PointXYZI>::Ptr cornerPointsSharp(new pcl::PointCloud<pcl::PointXYZI>());
00034 pcl::PointCloud<pcl::PointXYZI>::Ptr cornerPointsLessSharp(new pcl::PointCloud<pcl::PointXYZI>());
00035 pcl::PointCloud<pcl::PointXYZI>::Ptr surfPointsFlat(new pcl::PointCloud<pcl::PointXYZI>());
00036 pcl::PointCloud<pcl::PointXYZI>::Ptr surfPointsLessFlat(new pcl::PointCloud<pcl::PointXYZI>());
00037 pcl::PointCloud<pcl::PointXYZI>::Ptr surfPointsLessFlatScan(new pcl::PointCloud<pcl::PointXYZI>());
00038 pcl::PointCloud<pcl::PointXYZI>::Ptr surfPointsLessFlatScanDS(new pcl::PointCloud<pcl::PointXYZI>());
00039 pcl::PointCloud<pcl::PointXYZ>::Ptr imuTrans(new pcl::PointCloud<pcl::PointXYZ>(4, 1));
00040 pcl::PointCloud<pcl::PointXYZI>::Ptr laserCloudScans[16];
00041
00042 float cloudCurvature[40000];
00043 int cloudSortInd[40000];
00044 int cloudNeighborPicked[40000];
00045 int cloudLabel[40000];
00046
00047 int scanStartInd[16];
00048 int scanEndInd[16];
00049
00050 int imuPointerFront = 0;
00051 int imuPointerLast = -1;
00052 const int imuQueLength = 200;
00053
00054 float imuRollStart = 0, imuPitchStart = 0, imuYawStart = 0;
00055 float imuRollCur = 0, imuPitchCur = 0, imuYawCur = 0;
00056
00057 float imuVeloXStart = 0, imuVeloYStart = 0, imuVeloZStart = 0;
00058 float imuShiftXStart = 0, imuShiftYStart = 0, imuShiftZStart = 0;
00059
00060 float imuVeloXCur = 0, imuVeloYCur = 0, imuVeloZCur = 0;
00061 float imuShiftXCur = 0, imuShiftYCur = 0, imuShiftZCur = 0;
00062
00063 float imuShiftFromStartXCur = 0, imuShiftFromStartYCur = 0, imuShiftFromStartZCur = 0;
00064 float imuVeloFromStartXCur = 0, imuVeloFromStartYCur = 0, imuVeloFromStartZCur = 0;
00065
00066 double imuTime[imuQueLength] = {0};
00067 float imuRoll[imuQueLength] = {0};
00068 float imuPitch[imuQueLength] = {0};
00069 float imuYaw[imuQueLength] = {0};
00070
00071 float imuAccX[imuQueLength] = {0};
00072 float imuAccY[imuQueLength] = {0};
00073 float imuAccZ[imuQueLength] = {0};
00074
00075 float imuVeloX[imuQueLength] = {0};
00076 float imuVeloY[imuQueLength] = {0};
00077 float imuVeloZ[imuQueLength] = {0};
00078
00079 float imuShiftX[imuQueLength] = {0};
00080 float imuShiftY[imuQueLength] = {0};
00081 float imuShiftZ[imuQueLength] = {0};
00082
00083 ros::Publisher* pubLaserCloudPointer;
00084 ros::Publisher* pubCornerPointsSharpPointer;
00085 ros::Publisher* pubCornerPointsLessSharpPointer;
00086 ros::Publisher* pubSurfPointsFlatPointer;
00087 ros::Publisher* pubSurfPointsLessFlatPointer;
00088 ros::Publisher* pubImuTransPointer;
00089
00090 void ShiftToStartIMU(float pointTime)
00091 {
00092 imuShiftFromStartXCur = imuShiftXCur - imuShiftXStart - imuVeloXStart * pointTime;
00093 imuShiftFromStartYCur = imuShiftYCur - imuShiftYStart - imuVeloYStart * pointTime;
00094 imuShiftFromStartZCur = imuShiftZCur - imuShiftZStart - imuVeloZStart * pointTime;
00095
00096 float x1 = cos(imuYawStart) * imuShiftFromStartXCur - sin(imuYawStart) * imuShiftFromStartZCur;
00097 float y1 = imuShiftFromStartYCur;
00098 float z1 = sin(imuYawStart) * imuShiftFromStartXCur + cos(imuYawStart) * imuShiftFromStartZCur;
00099
00100 float x2 = x1;
00101 float y2 = cos(imuPitchStart) * y1 + sin(imuPitchStart) * z1;
00102 float z2 = -sin(imuPitchStart) * y1 + cos(imuPitchStart) * z1;
00103
00104 imuShiftFromStartXCur = cos(imuRollStart) * x2 + sin(imuRollStart) * y2;
00105 imuShiftFromStartYCur = -sin(imuRollStart) * x2 + cos(imuRollStart) * y2;
00106 imuShiftFromStartZCur = z2;
00107 }
00108
00109 void VeloToStartIMU()
00110 {
00111 imuVeloFromStartXCur = imuVeloXCur - imuVeloXStart;
00112 imuVeloFromStartYCur = imuVeloYCur - imuVeloYStart;
00113 imuVeloFromStartZCur = imuVeloZCur - imuVeloZStart;
00114
00115 float x1 = cos(imuYawStart) * imuVeloFromStartXCur - sin(imuYawStart) * imuVeloFromStartZCur;
00116 float y1 = imuVeloFromStartYCur;
00117 float z1 = sin(imuYawStart) * imuVeloFromStartXCur + cos(imuYawStart) * imuVeloFromStartZCur;
00118
00119 float x2 = x1;
00120 float y2 = cos(imuPitchStart) * y1 + sin(imuPitchStart) * z1;
00121 float z2 = -sin(imuPitchStart) * y1 + cos(imuPitchStart) * z1;
00122
00123 imuVeloFromStartXCur = cos(imuRollStart) * x2 + sin(imuRollStart) * y2;
00124 imuVeloFromStartYCur = -sin(imuRollStart) * x2 + cos(imuRollStart) * y2;
00125 imuVeloFromStartZCur = z2;
00126 }
00127
00128 void TransformToStartIMU(pcl::PointXYZI *p)
00129 {
00130 float x1 = cos(imuRollCur) * p->x - sin(imuRollCur) * p->y;
00131 float y1 = sin(imuRollCur) * p->x + cos(imuRollCur) * p->y;
00132 float z1 = p->z;
00133
00134 float x2 = x1;
00135 float y2 = cos(imuPitchCur) * y1 - sin(imuPitchCur) * z1;
00136 float z2 = sin(imuPitchCur) * y1 + cos(imuPitchCur) * z1;
00137
00138 float x3 = cos(imuYawCur) * x2 + sin(imuYawCur) * z2;
00139 float y3 = y2;
00140 float z3 = -sin(imuYawCur) * x2 + cos(imuYawCur) * z2;
00141
00142 float x4 = cos(imuYawStart) * x3 - sin(imuYawStart) * z3;
00143 float y4 = y3;
00144 float z4 = sin(imuYawStart) * x3 + cos(imuYawStart) * z3;
00145
00146 float x5 = x4;
00147 float y5 = cos(imuPitchStart) * y4 + sin(imuPitchStart) * z4;
00148 float z5 = -sin(imuPitchStart) * y4 + cos(imuPitchStart) * z4;
00149
00150 p->x = cos(imuRollStart) * x5 + sin(imuRollStart) * y5 + imuShiftFromStartXCur;
00151 p->y = -sin(imuRollStart) * x5 + cos(imuRollStart) * y5 + imuShiftFromStartYCur;
00152 p->z = z5 + imuShiftFromStartZCur;
00153 }
00154
00155 void AccumulateIMUShift()
00156 {
00157 float roll = imuRoll[imuPointerLast];
00158 float pitch = imuPitch[imuPointerLast];
00159 float yaw = imuYaw[imuPointerLast];
00160 float accX = imuAccX[imuPointerLast];
00161 float accY = imuAccY[imuPointerLast];
00162 float accZ = imuAccZ[imuPointerLast];
00163
00164 float x1 = cos(roll) * accX - sin(roll) * accY;
00165 float y1 = sin(roll) * accX + cos(roll) * accY;
00166 float z1 = accZ;
00167
00168 float x2 = x1;
00169 float y2 = cos(pitch) * y1 - sin(pitch) * z1;
00170 float z2 = sin(pitch) * y1 + cos(pitch) * z1;
00171
00172 accX = cos(yaw) * x2 + sin(yaw) * z2;
00173 accY = y2;
00174 accZ = -sin(yaw) * x2 + cos(yaw) * z2;
00175
00176 int imuPointerBack = (imuPointerLast + imuQueLength - 1) % imuQueLength;
00177 double timeDiff = imuTime[imuPointerLast] - imuTime[imuPointerBack];
00178 if (timeDiff < 0.1) {
00179
00180 imuShiftX[imuPointerLast] = imuShiftX[imuPointerBack] + imuVeloX[imuPointerBack] * timeDiff
00181 + accX * timeDiff * timeDiff / 2;
00182 imuShiftY[imuPointerLast] = imuShiftY[imuPointerBack] + imuVeloY[imuPointerBack] * timeDiff
00183 + accY * timeDiff * timeDiff / 2;
00184 imuShiftZ[imuPointerLast] = imuShiftZ[imuPointerBack] + imuVeloZ[imuPointerBack] * timeDiff
00185 + accZ * timeDiff * timeDiff / 2;
00186
00187 imuVeloX[imuPointerLast] = imuVeloX[imuPointerBack] + accX * timeDiff;
00188 imuVeloY[imuPointerLast] = imuVeloY[imuPointerBack] + accY * timeDiff;
00189 imuVeloZ[imuPointerLast] = imuVeloZ[imuPointerBack] + accZ * timeDiff;
00190 }
00191 }
00192
00193 void laserCloudHandler(const sensor_msgs::PointCloud2ConstPtr& laserCloudIn2)
00194 {
00195 if (!systemInited) {
00196 systemInitCount++;
00197 if (systemInitCount >= systemDelay) {
00198 systemInited = true;
00199 }
00200 return;
00201 }
00202
00203 double timeScanCur = laserCloudIn2->header.stamp.toSec();
00204
00205 pcl::fromROSMsg(*laserCloudIn2, *laserCloudIn);
00206 int cloudSize = laserCloudIn->points.size();
00207
00208 float startOri = -atan2(laserCloudIn->points[0].y, laserCloudIn->points[0].x);
00209 float endOri = -atan2(laserCloudIn->points[cloudSize - 1].y,
00210 laserCloudIn->points[cloudSize - 1].x) + 2 * PI;
00211
00212 if (endOri - startOri > 3 * PI) {
00213 endOri -= 2 * PI;
00214 } else if (endOri - startOri < PI) {
00215 endOri += 2 * PI;
00216 }
00217
00218 bool halfPassed = false;
00219 pcl::PointXYZI point;
00220 for (int i = 0; i < cloudSize; i++) {
00221 point.x = laserCloudIn->points[i].y;
00222 point.y = laserCloudIn->points[i].z;
00223 point.z = laserCloudIn->points[i].x;
00224
00225 float angle = atan(point.y / sqrt(point.x * point.x + point.z * point.z)) * 180 / PI;
00226 int scanID = int(0.75 * angle + 0.5) + 7;
00227 if (angle < 0) {
00228 scanID--;
00229 }
00230
00231 float ori = -atan2(point.x, point.z);
00232 if (!halfPassed) {
00233 if (ori < startOri - PI / 2) {
00234 ori += 2 * PI;
00235 } else if (ori > startOri + PI * 3 / 2) {
00236 ori -= 2 * PI;
00237 }
00238
00239 if (ori - startOri > PI) {
00240 halfPassed = true;
00241 }
00242 } else {
00243 ori += 2 * PI;
00244
00245 if (ori < endOri - PI * 3 / 2) {
00246 ori += 2 * PI;
00247 } else if (ori > endOri + PI / 2) {
00248 ori -= 2 * PI;
00249 }
00250 }
00251
00252 float relTime = (ori - startOri) / (endOri - startOri);
00253 point.intensity = scanID + 0.1 * relTime;
00254
00255 if (imuPointerLast >= 0) {
00256 float pointTime = relTime * scanPeriod;
00257 while (imuPointerFront != imuPointerLast) {
00258 if (timeScanCur + pointTime < imuTime[imuPointerFront]) {
00259 break;
00260 }
00261 imuPointerFront = (imuPointerFront + 1) % imuQueLength;
00262 }
00263
00264 if (timeScanCur + pointTime > imuTime[imuPointerFront]) {
00265 imuRollCur = imuRoll[imuPointerFront];
00266 imuPitchCur = imuPitch[imuPointerFront];
00267 imuYawCur = imuYaw[imuPointerFront];
00268
00269 imuVeloXCur = imuVeloX[imuPointerFront];
00270 imuVeloYCur = imuVeloY[imuPointerFront];
00271 imuVeloZCur = imuVeloZ[imuPointerFront];
00272
00273 imuShiftXCur = imuShiftX[imuPointerFront];
00274 imuShiftYCur = imuShiftY[imuPointerFront];
00275 imuShiftZCur = imuShiftZ[imuPointerFront];
00276 } else {
00277 int imuPointerBack = (imuPointerFront + imuQueLength - 1) % imuQueLength;
00278 float ratioFront = (timeScanCur + pointTime - imuTime[imuPointerBack])
00279 / (imuTime[imuPointerFront] - imuTime[imuPointerBack]);
00280 float ratioBack = (imuTime[imuPointerFront] - timeScanCur - pointTime)
00281 / (imuTime[imuPointerFront] - imuTime[imuPointerBack]);
00282
00283 imuRollCur = imuRoll[imuPointerFront] * ratioFront + imuRoll[imuPointerBack] * ratioBack;
00284 imuPitchCur = imuPitch[imuPointerFront] * ratioFront + imuPitch[imuPointerBack] * ratioBack;
00285 if (imuYaw[imuPointerFront] - imuYaw[imuPointerBack] > PI) {
00286 imuYawCur = imuYaw[imuPointerFront] * ratioFront + (imuYaw[imuPointerBack] + 2 * PI) * ratioBack;
00287 } else if (imuYaw[imuPointerFront] - imuYaw[imuPointerBack] < -PI) {
00288 imuYawCur = imuYaw[imuPointerFront] * ratioFront + (imuYaw[imuPointerBack] - 2 * PI) * ratioBack;
00289 } else {
00290 imuYawCur = imuYaw[imuPointerFront] * ratioFront + imuYaw[imuPointerBack] * ratioBack;
00291 }
00292
00293 imuVeloXCur = imuVeloX[imuPointerFront] * ratioFront + imuVeloX[imuPointerBack] * ratioBack;
00294 imuVeloYCur = imuVeloY[imuPointerFront] * ratioFront + imuVeloY[imuPointerBack] * ratioBack;
00295 imuVeloZCur = imuVeloZ[imuPointerFront] * ratioFront + imuVeloZ[imuPointerBack] * ratioBack;
00296
00297 imuShiftXCur = imuShiftX[imuPointerFront] * ratioFront + imuShiftX[imuPointerBack] * ratioBack;
00298 imuShiftYCur = imuShiftY[imuPointerFront] * ratioFront + imuShiftY[imuPointerBack] * ratioBack;
00299 imuShiftZCur = imuShiftZ[imuPointerFront] * ratioFront + imuShiftZ[imuPointerBack] * ratioBack;
00300 }
00301
00302 if (i == 0) {
00303 imuRollStart = imuRollCur;
00304 imuPitchStart = imuPitchCur;
00305 imuYawStart = imuYawCur;
00306
00307 imuVeloXStart = imuVeloXCur;
00308 imuVeloYStart = imuVeloYCur;
00309 imuVeloZStart = imuVeloZCur;
00310
00311 imuShiftXStart = imuShiftXCur;
00312 imuShiftYStart = imuShiftYCur;
00313 imuShiftZStart = imuShiftZCur;
00314 } else {
00315 ShiftToStartIMU(pointTime);
00316 VeloToStartIMU();
00317 TransformToStartIMU(&point);
00318 }
00319 }
00320
00321 laserCloudScans[scanID]->push_back(point);
00322 }
00323
00324 for (int i = 0; i < 16; i++) {
00325 *laserCloud += *laserCloudScans[i];
00326 }
00327
00328 int scanCount = -1;
00329 for (int i = 5; i < cloudSize - 5; i++) {
00330 float diffX = laserCloud->points[i - 5].x + laserCloud->points[i - 4].x
00331 + laserCloud->points[i - 3].x + laserCloud->points[i - 2].x
00332 + laserCloud->points[i - 1].x - 10 * laserCloud->points[i].x
00333 + laserCloud->points[i + 1].x + laserCloud->points[i + 2].x
00334 + laserCloud->points[i + 3].x + laserCloud->points[i + 4].x
00335 + laserCloud->points[i + 5].x;
00336 float diffY = laserCloud->points[i - 5].y + laserCloud->points[i - 4].y
00337 + laserCloud->points[i - 3].y + laserCloud->points[i - 2].y
00338 + laserCloud->points[i - 1].y - 10 * laserCloud->points[i].y
00339 + laserCloud->points[i + 1].y + laserCloud->points[i + 2].y
00340 + laserCloud->points[i + 3].y + laserCloud->points[i + 4].y
00341 + laserCloud->points[i + 5].y;
00342 float diffZ = laserCloud->points[i - 5].z + laserCloud->points[i - 4].z
00343 + laserCloud->points[i - 3].z + laserCloud->points[i - 2].z
00344 + laserCloud->points[i - 1].z - 10 * laserCloud->points[i].z
00345 + laserCloud->points[i + 1].z + laserCloud->points[i + 2].z
00346 + laserCloud->points[i + 3].z + laserCloud->points[i + 4].z
00347 + laserCloud->points[i + 5].z;
00348
00349 cloudCurvature[i] = diffX * diffX + diffY * diffY + diffZ * diffZ;
00350 cloudSortInd[i] = i;
00351 cloudNeighborPicked[i] = 0;
00352 cloudLabel[i] = 0;
00353
00354 if (int(laserCloud->points[i].intensity) != scanCount) {
00355 scanCount = int(laserCloud->points[i].intensity);
00356
00357 if (scanCount > 0) {
00358 scanStartInd[scanCount] = i + 5;
00359 scanEndInd[scanCount - 1] = i - 5;
00360 }
00361 }
00362 }
00363 scanStartInd[0] = 5;
00364 scanEndInd[15] = cloudSize - 5;
00365
00366 for (int i = 5; i < cloudSize - 6; i++) {
00367 float diffX = laserCloud->points[i + 1].x - laserCloud->points[i].x;
00368 float diffY = laserCloud->points[i + 1].y - laserCloud->points[i].y;
00369 float diffZ = laserCloud->points[i + 1].z - laserCloud->points[i].z;
00370 float diff = diffX * diffX + diffY * diffY + diffZ * diffZ;
00371
00372 if (diff > 0.1) {
00373
00374 float depth1 = sqrt(laserCloud->points[i].x * laserCloud->points[i].x +
00375 laserCloud->points[i].y * laserCloud->points[i].y +
00376 laserCloud->points[i].z * laserCloud->points[i].z);
00377
00378 float depth2 = sqrt(laserCloud->points[i + 1].x * laserCloud->points[i + 1].x +
00379 laserCloud->points[i + 1].y * laserCloud->points[i + 1].y +
00380 laserCloud->points[i + 1].z * laserCloud->points[i + 1].z);
00381
00382 if (depth1 > depth2) {
00383 diffX = laserCloud->points[i + 1].x - laserCloud->points[i].x * depth2 / depth1;
00384 diffY = laserCloud->points[i + 1].y - laserCloud->points[i].y * depth2 / depth1;
00385 diffZ = laserCloud->points[i + 1].z - laserCloud->points[i].z * depth2 / depth1;
00386
00387 if (sqrt(diffX * diffX + diffY * diffY + diffZ * diffZ) / depth2 < 0.1) {
00388 cloudNeighborPicked[i - 5] = 1;
00389 cloudNeighborPicked[i - 4] = 1;
00390 cloudNeighborPicked[i - 3] = 1;
00391 cloudNeighborPicked[i - 2] = 1;
00392 cloudNeighborPicked[i - 1] = 1;
00393 cloudNeighborPicked[i] = 1;
00394 }
00395 } else {
00396 diffX = laserCloud->points[i + 1].x * depth1 / depth2 - laserCloud->points[i].x;
00397 diffY = laserCloud->points[i + 1].y * depth1 / depth2 - laserCloud->points[i].y;
00398 diffZ = laserCloud->points[i + 1].z * depth1 / depth2 - laserCloud->points[i].z;
00399
00400 if (sqrt(diffX * diffX + diffY * diffY + diffZ * diffZ) / depth1 < 0.1) {
00401 cloudNeighborPicked[i + 1] = 1;
00402 cloudNeighborPicked[i + 2] = 1;
00403 cloudNeighborPicked[i + 3] = 1;
00404 cloudNeighborPicked[i + 4] = 1;
00405 cloudNeighborPicked[i + 5] = 1;
00406 cloudNeighborPicked[i + 6] = 1;
00407 }
00408 }
00409 }
00410
00411 float diffX2 = laserCloud->points[i].x - laserCloud->points[i - 1].x;
00412 float diffY2 = laserCloud->points[i].y - laserCloud->points[i - 1].y;
00413 float diffZ2 = laserCloud->points[i].z - laserCloud->points[i - 1].z;
00414 float diff2 = diffX2 * diffX2 + diffY2 * diffY2 + diffZ2 * diffZ2;
00415
00416 float dis = laserCloud->points[i].x * laserCloud->points[i].x
00417 + laserCloud->points[i].y * laserCloud->points[i].y
00418 + laserCloud->points[i].z * laserCloud->points[i].z;
00419
00420 if (diff > 0.0002 * dis && diff2 > 0.0002 * dis) {
00421 cloudNeighborPicked[i] = 1;
00422 }
00423 }
00424
00425 for (int i = 0; i < 16; i++) {
00426 surfPointsLessFlatScan->clear();
00427 for (int j = 0; j < 6; j++) {
00428 int sp = (scanStartInd[i] * (6 - j) + scanEndInd[i] * j) / 6;
00429 int ep = (scanStartInd[i] * (5 - j) + scanEndInd[i] * (j + 1)) / 6 - 1;
00430
00431 for (int k = sp + 1; k <= ep; k++) {
00432 for (int l = k; l >= sp + 1; l--) {
00433 if (cloudCurvature[cloudSortInd[l]] < cloudCurvature[cloudSortInd[l - 1]]) {
00434 int temp = cloudSortInd[l - 1];
00435 cloudSortInd[l - 1] = cloudSortInd[l];
00436 cloudSortInd[l] = temp;
00437 }
00438 }
00439 }
00440
00441 int largestPickedNum = 0;
00442 for (int k = ep; k >= sp; k--) {
00443 int ind = cloudSortInd[k];
00444 if (cloudNeighborPicked[ind] == 0 &&
00445 cloudCurvature[ind] > 0.1) {
00446
00447 largestPickedNum++;
00448 if (largestPickedNum <= 2) {
00449 cloudLabel[ind] = 2;
00450 cornerPointsSharp->push_back(laserCloud->points[ind]);
00451 cornerPointsLessSharp->push_back(laserCloud->points[ind]);
00452 } else if (largestPickedNum <= 20) {
00453 cloudLabel[ind] = 1;
00454 cornerPointsLessSharp->push_back(laserCloud->points[ind]);
00455 } else {
00456 break;
00457 }
00458
00459 cloudNeighborPicked[ind] = 1;
00460 for (int l = 1; l <= 5; l++) {
00461 float diffX = laserCloud->points[ind + l].x
00462 - laserCloud->points[ind + l - 1].x;
00463 float diffY = laserCloud->points[ind + l].y
00464 - laserCloud->points[ind + l - 1].y;
00465 float diffZ = laserCloud->points[ind + l].z
00466 - laserCloud->points[ind + l - 1].z;
00467 if (diffX * diffX + diffY * diffY + diffZ * diffZ > 0.05) {
00468 break;
00469 }
00470
00471 cloudNeighborPicked[ind + l] = 1;
00472 }
00473 for (int l = -1; l >= -5; l--) {
00474 float diffX = laserCloud->points[ind + l].x
00475 - laserCloud->points[ind + l + 1].x;
00476 float diffY = laserCloud->points[ind + l].y
00477 - laserCloud->points[ind + l + 1].y;
00478 float diffZ = laserCloud->points[ind + l].z
00479 - laserCloud->points[ind + l + 1].z;
00480 if (diffX * diffX + diffY * diffY + diffZ * diffZ > 0.05) {
00481 break;
00482 }
00483
00484 cloudNeighborPicked[ind + l] = 1;
00485 }
00486 }
00487 }
00488
00489 int smallestPickedNum = 0;
00490 for (int k = sp; k <= ep; k++) {
00491 int ind = cloudSortInd[k];
00492 if (cloudNeighborPicked[ind] == 0 &&
00493 cloudCurvature[ind] < 0.1) {
00494
00495 cloudLabel[ind] = -1;
00496 surfPointsFlat->push_back(laserCloud->points[ind]);
00497
00498 smallestPickedNum++;
00499 if (smallestPickedNum >= 4) {
00500 break;
00501 }
00502
00503 cloudNeighborPicked[ind] = 1;
00504 for (int l = 1; l <= 5; l++) {
00505 float diffX = laserCloud->points[ind + l].x
00506 - laserCloud->points[ind + l - 1].x;
00507 float diffY = laserCloud->points[ind + l].y
00508 - laserCloud->points[ind + l - 1].y;
00509 float diffZ = laserCloud->points[ind + l].z
00510 - laserCloud->points[ind + l - 1].z;
00511 if (diffX * diffX + diffY * diffY + diffZ * diffZ > 0.05) {
00512 break;
00513 }
00514
00515 cloudNeighborPicked[ind + l] = 1;
00516 }
00517 for (int l = -1; l >= -5; l--) {
00518 float diffX = laserCloud->points[ind + l].x
00519 - laserCloud->points[ind + l + 1].x;
00520 float diffY = laserCloud->points[ind + l].y
00521 - laserCloud->points[ind + l + 1].y;
00522 float diffZ = laserCloud->points[ind + l].z
00523 - laserCloud->points[ind + l + 1].z;
00524 if (diffX * diffX + diffY * diffY + diffZ * diffZ > 0.05) {
00525 break;
00526 }
00527
00528 cloudNeighborPicked[ind + l] = 1;
00529 }
00530 }
00531 }
00532
00533 for (int k = sp; k <= ep; k++) {
00534 if (cloudLabel[k] <= 0) {
00535 surfPointsLessFlatScan->push_back(laserCloud->points[k]);
00536 }
00537 }
00538 }
00539
00540 surfPointsLessFlatScanDS->clear();
00541 pcl::VoxelGrid<pcl::PointXYZI> downSizeFilter;
00542 downSizeFilter.setInputCloud(surfPointsLessFlatScan);
00543 downSizeFilter.setLeafSize(0.2, 0.2, 0.2);
00544 downSizeFilter.filter(*surfPointsLessFlatScanDS);
00545
00546 *surfPointsLessFlat += *surfPointsLessFlatScanDS;
00547 }
00548
00549 sensor_msgs::PointCloud2 laserCloud2;
00550 pcl::toROSMsg(*laserCloud, laserCloud2);
00551 laserCloud2.header.stamp = laserCloudIn2->header.stamp;
00552 laserCloud2.header.frame_id = "/camera";
00553 pubLaserCloudPointer->publish(laserCloud2);
00554
00555 sensor_msgs::PointCloud2 cornerPointsSharp2;
00556 pcl::toROSMsg(*cornerPointsSharp, cornerPointsSharp2);
00557 cornerPointsSharp2.header.stamp = laserCloudIn2->header.stamp;
00558 cornerPointsSharp2.header.frame_id = "/camera";
00559 pubCornerPointsSharpPointer->publish(cornerPointsSharp2);
00560
00561 sensor_msgs::PointCloud2 cornerPointsLessSharp2;
00562 pcl::toROSMsg(*cornerPointsLessSharp, cornerPointsLessSharp2);
00563 cornerPointsLessSharp2.header.stamp = laserCloudIn2->header.stamp;
00564 cornerPointsLessSharp2.header.frame_id = "/camera";
00565 pubCornerPointsLessSharpPointer->publish(cornerPointsLessSharp2);
00566
00567 sensor_msgs::PointCloud2 surfPointsFlat2;
00568 pcl::toROSMsg(*surfPointsFlat, surfPointsFlat2);
00569 surfPointsFlat2.header.stamp = laserCloudIn2->header.stamp;
00570 surfPointsFlat2.header.frame_id = "/camera";
00571 pubSurfPointsFlatPointer->publish(surfPointsFlat2);
00572
00573 sensor_msgs::PointCloud2 surfPointsLessFlat2;
00574 pcl::toROSMsg(*surfPointsLessFlat, surfPointsLessFlat2);
00575 surfPointsLessFlat2.header.stamp = laserCloudIn2->header.stamp;
00576 surfPointsLessFlat2.header.frame_id = "/camera";
00577 pubSurfPointsLessFlatPointer->publish(surfPointsLessFlat2);
00578
00579 imuTrans->points[0].x = imuPitchStart;
00580 imuTrans->points[0].y = imuYawStart;
00581 imuTrans->points[0].z = imuRollStart;
00582
00583 imuTrans->points[1].x = imuPitchCur;
00584 imuTrans->points[1].y = imuYawCur;
00585 imuTrans->points[1].z = imuRollCur;
00586
00587 imuTrans->points[2].x = imuShiftFromStartXCur;
00588 imuTrans->points[2].y = imuShiftFromStartYCur;
00589 imuTrans->points[2].z = imuShiftFromStartZCur;
00590
00591 imuTrans->points[3].x = imuVeloFromStartXCur;
00592 imuTrans->points[3].y = imuVeloFromStartYCur;
00593 imuTrans->points[3].z = imuVeloFromStartZCur;
00594
00595 sensor_msgs::PointCloud2 imuTrans2;
00596 pcl::toROSMsg(*imuTrans, imuTrans2);
00597 imuTrans2.header.stamp = laserCloudIn2->header.stamp;
00598 imuTrans2.header.frame_id = "/camera";
00599 pubImuTransPointer->publish(imuTrans2);
00600
00601 laserCloudIn->clear();
00602 laserCloud->clear();
00603 cornerPointsSharp->clear();
00604 cornerPointsLessSharp->clear();
00605 surfPointsFlat->clear();
00606 surfPointsLessFlat->clear();
00607
00608 for (int i = 0; i < 16; i++) {
00609 laserCloudScans[i]->points.clear();
00610 }
00611 }
00612
00613 void imuHandler(const sensor_msgs::Imu::ConstPtr& imuIn)
00614 {
00615 double roll, pitch, yaw;
00616 tf::Quaternion orientation;
00617 tf::quaternionMsgToTF(imuIn->orientation, orientation);
00618 tf::Matrix3x3(orientation).getRPY(roll, pitch, yaw);
00619
00620 float accX = imuIn->linear_acceleration.y - sin(roll) * cos(pitch) * 9.81;
00621 float accY = imuIn->linear_acceleration.z - cos(roll) * cos(pitch) * 9.81;
00622 float accZ = imuIn->linear_acceleration.x + sin(pitch) * 9.81;
00623
00624 imuPointerLast = (imuPointerLast + 1) % imuQueLength;
00625
00626 imuTime[imuPointerLast] = imuIn->header.stamp.toSec();
00627 imuRoll[imuPointerLast] = roll;
00628 imuPitch[imuPointerLast] = pitch;
00629 imuYaw[imuPointerLast] = yaw;
00630 imuAccX[imuPointerLast] = accX;
00631 imuAccY[imuPointerLast] = accY;
00632 imuAccZ[imuPointerLast] = accZ;
00633
00634 AccumulateIMUShift();
00635 }
00636
00637 int main(int argc, char** argv)
00638 {
00639 ros::init(argc, argv, "scanRegistration");
00640 ros::NodeHandle nh;
00641
00642 for (int i = 0; i < 16; i++) {
00643 laserCloudScans[i].reset(new pcl::PointCloud<pcl::PointXYZI>());
00644 }
00645
00646 ros::Subscriber subLaserCloud = nh.subscribe<sensor_msgs::PointCloud2>
00647 ("/velodyne_cloud", 2, laserCloudHandler);
00648
00649 ros::Subscriber subImu = nh.subscribe<sensor_msgs::Imu> ("/imu/data", 50, imuHandler);
00650
00651 ros::Publisher pubLaserCloud = nh.advertise<sensor_msgs::PointCloud2>
00652 ("/velodyne_cloud_2", 2);
00653
00654 ros::Publisher pubCornerPointsSharp = nh.advertise<sensor_msgs::PointCloud2>
00655 ("/laser_cloud_sharp", 2);
00656
00657 ros::Publisher pubCornerPointsLessSharp = nh.advertise<sensor_msgs::PointCloud2>
00658 ("/laser_cloud_less_sharp", 2);
00659
00660 ros::Publisher pubSurfPointsFlat = nh.advertise<sensor_msgs::PointCloud2>
00661 ("/laser_cloud_flat", 2);
00662
00663 ros::Publisher pubSurfPointsLessFlat = nh.advertise<sensor_msgs::PointCloud2>
00664 ("/laser_cloud_less_flat", 2);
00665
00666 ros::Publisher pubImuTrans = nh.advertise<sensor_msgs::PointCloud2> ("/imu_trans", 5);
00667
00668 pubLaserCloudPointer = &pubLaserCloud;
00669 pubCornerPointsSharpPointer = &pubCornerPointsSharp;
00670 pubCornerPointsLessSharpPointer = &pubCornerPointsLessSharp;
00671 pubSurfPointsFlatPointer = &pubSurfPointsFlat;
00672 pubSurfPointsLessFlatPointer = &pubSurfPointsLessFlat;
00673 pubImuTransPointer = &pubImuTrans;
00674
00675 ros::spin();
00676
00677 return 0;
00678 }
| [
"[email protected]"
] | |
8559ca1d1e6c81ec1cb6095cd892eb55a64dce4b | 70418d8faa76b41715c707c54a8b0cddfb393fb3 | /10078.cpp | e937a17646370ab902c5dcc88035bda3e2a212ce | [] | no_license | evandrix/UVa | ca79c25c8bf28e9e05cae8414f52236dc5ac1c68 | 17a902ece2457c8cb0ee70c320bf0583c0f9a4ce | refs/heads/master | 2021-06-05T01:44:17.908960 | 2017-10-22T18:59:42 | 2017-10-22T18:59:42 | 107,893,680 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,061 | cpp | #include <bits/stdc++.h>
using namespace std;
struct Point {int x, y;} ref_;
vector<Point> points;
const int infinity = 2147483647;
int flag;
int is_left_special(Point p0, Point p1, Point p2)
{
long long int cross_product = (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y);
if (cross_product > 0)
{
return 1;
}
else if (cross_product < 0)
{
return -1;
}
else
{
return 0;
}
}
bool is_left(Point p0, Point p1, Point p2)
{
long long int cross_product = (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y);
if (cross_product > 0)
{
return true;
}
else if (cross_product < 0)
{
return false;
}
else
{
if ((p0.x == p1.x) && (p0.y == p1.y))
{
return true;
}
else if ((p0.x == p2.x) && (p0.y == p2.y))
{
return false;
}
else
{
return false;
}
}
}
bool compare(Point p2, Point p1)
{
return !is_left(ref_, p1, p2);
}
void graham_scan()
{
stack<Point> final;
int i = 0;
int count = 0;
int n_vertex = points.size();
int left_flag;
if (i < n_vertex)
{
final.push(points[i]);
i++;
count++;
}
if (i < n_vertex)
{
final.push(points[i]);
i++;
count++;
}
Point p0, p1, p2;
while ((count <= n_vertex) && (count > 1))
{
p2 = points[i % n_vertex];
p1 = final.top();
final.pop();
p0 = final.top();
left_flag = is_left_special(p0, p1, p2);
if (left_flag >= 0)
{
final.push(p1);
final.push(p2);
i++;
count++;
}
else
{
flag = 0;
}
}
}
int main()
{
int n_vertex;
Point input;
while (cin >> n_vertex)
{
if (n_vertex == 0)
{
break;
}
int i = 0;
flag = 1;
ref_.x = infinity;
ref_.y = infinity;
points.clear();
while (i < n_vertex)
{
cin >> input.x >> input.y;
points.push_back(input);
if (input.y < ref_.y)
{
ref_ = input;
}
else if ((input.y == ref_.y) && (input.x < ref_.x))
{
ref_ = input;
}
i++;
}
sort(points.begin(), points.end(), compare);
graham_scan();
if (flag == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
return 0;
}
| [
"[email protected]"
] | |
67ec90dcca4f04dda27b70b6dba1aec64ba58c8b | bb8f8accc040f7e0880ac194fc823f96933345fd | /CAPCITY.cpp | 7f2a70ce8b7e7623d011e23e5b6e3fd4ce5d80fe | [] | no_license | draconware/spoj | 16f5501d9a721d93729db524896963bd2606746c | c8df41eceb00b87a6015465d30e21003bb681731 | refs/heads/master | 2021-01-01T06:00:56.568003 | 2018-02-28T16:57:15 | 2018-02-28T16:57:15 | 97,326,359 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,210 | cpp | #include<bits/stdc++.h>
using namespace std;
vector<int> G[100009];
vector<int> RG[100009];
stack<int> s;
bool mark[100009];
int scc[100009];
vector<int> res[100009];
void dfs(int u){
mark[u]=true;
for(int i=0;i<(int)G[u].size();i++){
int v = G[u][i];
if(!mark[v]){
dfs(v);
}
}
s.push(u);
}
void dfs1(int u,int k){
mark[u]=true;
scc[u] = k;
for(int i=0;i<(int)RG[u].size();i++){
int v = RG[u][i];
if(!mark[v]){dfs1(v,k);}
}
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.in","r",stdin);
freopen("output.out","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
G[a].push_back(b);
RG[b].push_back(a);
}
for(int i=1;i<=n;i++){
if(!mark[i]){dfs(i);}
}
for(int i=1;i<=n;i++){scc[i] = i;}
int k=0;
memset(mark,0,sizeof(mark));
while(!s.empty()){
if(!mark[s.top()]){
k++;
dfs1(s.top(),k);
}
s.pop();
}
for(int i=1;i<=n;i++){
res[scc[i]].push_back(i);
}
cout<<k<<endl;
vector<int> ans;
for(int i=1;i<=k;i++){
ans.push_back(res[i][0]);
}
sort(ans.begin(),ans.end());
for(int i=0;i<(int)ans.size();i++){
cout<<ans[i]<<" ";
}
cout<<endl;
} | [
"[email protected]"
] | |
df3b389cf8d958afcd4ca5614ffe03943429b058 | 4ac4d0379cbe17886b3ec9c1648805d4d97f07b0 | /Day4/5_move5.cpp | f026e2777b86e21dd3c2b9aea8e391aa15243f23 | [] | no_license | nado6miri/cpp_idioms | 1708c61d944e1908b07bac20da6b64916bc67385 | 400ad8cac1a7a841376cf52b5a792ffa9989df56 | refs/heads/master | 2020-06-13T21:20:10.566602 | 2019-07-26T03:11:29 | 2019-07-26T03:11:29 | 194,790,340 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,212 | cpp | #include <iostream>
#include <vector>
#include <string>
// class가 자원을 할당하지 않으면 소멸자가 없어도 된다.
// c++98
// 클래스가 자원을 할당하면 rule of 3 법칙을 따라야 한다. (어떤 사람은 생성자 포함)
// 소멸자 / 복사 생성자 / 대입연산자
// c++11
// "move 생성자, move 대입 연산자 - rule of 3 + rule of 2 = rule of 5
// move 계열함수를 제공하지 않으면 복사 계열 함수가 호출되게 된다.
class Test
{
int data;
int* resource;
public:
Test() {} // resource = new int;
~Test() { std::cout << __FUNCSIG__ << std::endl; } // 소멸자
Test(const Test& t) { std::cout << __FUNCSIG__ << std::endl; } // 복사생성자
Test& operator=(const Test& t) { std::cout << __FUNCSIG__ << std::endl; return *this; } // 대입 생성자
Test(Test&& t) { std::cout << __FUNCSIG__ << std::endl; } // move 생성자
Test& operator=(const Test&& t) { std::cout << __FUNCSIG__ << std::endl; return *this; } // move 대입 연산자
};
int main()
{
Test t1;
Test t2 = t1; // 복사
t2 = t1; // 대입
Test t3 = std::move(t1); // move연산
t3 = std::move(t1); // move 대입연산
} | [
"[email protected]"
] | |
dc5d4c3ea9af007cab09ab3c4dba2a3549a791d8 | 9a48be80edc7692df4918c0222a1640545384dbb | /Libraries/Boost1.40/libs/interprocess/example/comp_doc_message_queueA.cpp | 7d1570b3e6d96a71ffb36af7b96ba9e4a3f590fd | [
"BSL-1.0"
] | permissive | fcrick/RepSnapper | 05e4fb1157f634acad575fffa2029f7f655b7940 | a5809843f37b7162f19765e852b968648b33b694 | refs/heads/master | 2021-01-17T21:42:29.537504 | 2010-06-07T05:38:05 | 2010-06-07T05:38:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,340 | cpp | //////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2006-2007. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/interprocess for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#include <boost/interprocess/detail/config_begin.hpp>
//[doc_message_queueA
#include <boost/interprocess/ipc/message_queue.hpp>
#include <iostream>
#include <vector>
using namespace boost::interprocess;
int main ()
{
try{
//Erase previous message queue
message_queue::remove("message_queue");
//Create a message_queue.
message_queue mq
(create_only //only create
,"message_queue" //name
,100 //max message number
,sizeof(int) //max message size
);
//Send 100 numbers
for(int i = 0; i < 100; ++i){
mq.send(&i, sizeof(i), 0);
}
}
catch(interprocess_exception &ex){
std::cout << ex.what() << std::endl;
return 1;
}
return 0;
}
//]
#include <boost/interprocess/detail/config_end.hpp>
| [
"metrix@Blended.(none)"
] | metrix@Blended.(none) |
f1e3f7bba7f05883fa14481f0744404927b85071 | efd7adff589e37ca98d2e3eb245aaeb23f64496e | /src/plugins/coreplugin/progressmanager/progressmanager_p.h | 44b572d0f2885eaa18ad20511da091a7a055fce4 | [] | no_license | Andersbakken/CPlusPlus | 3cf03c28968243587fa1d4661e7e5a388e62eb43 | 400f0b8f19de1c3fc9b794228c7aeec2259fce81 | refs/heads/master | 2021-01-10T20:24:54.067140 | 2013-05-28T03:46:50 | 2013-05-28T03:46:50 | 9,491,173 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,094 | h | /****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
****************************************************************************/
#ifndef PROGRESSMANAGER_P_H
#define PROGRESSMANAGER_P_H
#include "progressmanager.h"
#include <QFutureWatcher>
#include <QList>
#include <QGraphicsOpacityEffect>
#include <QHBoxLayout>
#include <QPointer>
#include <QPropertyAnimation>
#include <QToolButton>
namespace Core {
class StatusBarWidget;
namespace Internal {
class ProgressBar;
class ProgressView;
class ProgressManagerPrivate : public Core::ProgressManager
{
Q_OBJECT
public:
ProgressManagerPrivate(QObject *parent = 0);
~ProgressManagerPrivate();
void init();
void cleanup();
FutureProgress *addTask(const QFuture<void> &future, const QString &title, const QString &type,
ProgressFlags flags);
void setApplicationLabel(const QString &text);
ProgressView *progressView();
public slots:
void cancelTasks(const QString &type);
protected:
bool eventFilter(QObject *obj, QEvent *event);
private slots:
void taskFinished();
void cancelAllRunningTasks();
void setApplicationProgressRange(int min, int max);
void setApplicationProgressValue(int value);
void setApplicationProgressVisible(bool visible);
void disconnectApplicationTask();
void updateSummaryProgressBar();
void fadeAwaySummaryProgress();
void summaryProgressFinishedFading();
void progressDetailsToggled(bool checked);
void updateVisibility();
void updateVisibilityWithDelay();
void updateStatusDetailsWidget();
void slotRemoveTask();
private:
void initInternal();
void stopFadeOfSummaryProgress();
bool hasError() const;
bool isLastFading() const;
void removeOldTasks(const QString &type, bool keepOne = false);
void removeOneOldTask();
void removeTask(FutureProgress *task);
void deleteTask(FutureProgress *task);
QPointer<ProgressView> m_progressView;
QList<FutureProgress *> m_taskList;
QMap<QFutureWatcher<void> *, QString> m_runningTasks;
QFutureWatcher<void> *m_applicationTask;
Core::StatusBarWidget *m_statusBarWidgetContainer;
QWidget *m_statusBarWidget;
QWidget *m_summaryProgressWidget;
QHBoxLayout *m_summaryProgressLayout;
QWidget *m_currentStatusDetailsWidget;
ProgressBar *m_summaryProgressBar;
QGraphicsOpacityEffect *m_opacityEffect;
QPointer<QPropertyAnimation> m_opacityAnimation;
bool m_progressViewPinned;
bool m_hovered;
};
class ToggleButton : public QToolButton
{
Q_OBJECT
public:
ToggleButton(QWidget *parent);
QSize sizeHint() const;
void paintEvent(QPaintEvent *event);
};
} // namespace Internal
} // namespace Core
#endif // PROGRESSMANAGER_P_H
| [
"[email protected]"
] | |
b3f73c9eb482f588bb0e7cbc59418839abed9668 | 18ee7b4e3957b000df06414da36d7e717ccb7357 | /Fraples7DevDX3D/Source/Fraples7DevDX3D/RendererAPI/RenderGraph/Passes/VerticalBlurPass.h | 1559ce730fdd55d109a9e15cd86010e776508e9c | [] | no_license | searcas/Fraples7DevDX3D | 3d793b223a23ec56e20f8aeff933552421928181 | 77704aae3afcbb4a234428d020fbfc0a687534fb | refs/heads/master | 2023-06-05T08:17:18.969558 | 2021-02-17T16:51:02 | 2021-02-17T16:51:02 | 290,781,253 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 397 | h | #pragma once
#include "FullScreenPass.h"
#include "RendererAPI/GFXContext.h"
#include "RendererAPI/ConstantBuffersEx.h"
namespace FraplesDev
{
class VerticalBlurPass : public FullScreenPass
{
public:
VerticalBlurPass(std::string name, Graphics& gfx);
void Execute(Graphics& gfx)const noexcept(!IS_DEBUG) override;
private:
std::shared_ptr<CachingPixelConstantBufferEx> _mDirection;
};
} | [
"[email protected]"
] | |
04988dc8e4ec8088426dbba55aaadf58c9e9bb67 | 8b9e2fd5ec7a776b98494fd03ee631e44de8ad28 | /Mininscf-shellext/psfParser.cpp | 742dce2f2c0d81e6a4581d4e345af570345dd5a8 | [] | no_license | henke37/psf-shellext | f8d3f38572382b1bc8132410107b4906927e2586 | a63591857745cc03247e75d86f401178fbef371d | refs/heads/master | 2020-05-30T13:56:35.785747 | 2019-11-20T02:44:01 | 2019-11-20T02:44:01 | 36,177,029 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,729 | cpp | #include "common.h"
#include "psfParser.h"
#include <cstring>
PsfParser::PsfParser(IStream *_stream) : stream(_stream) {
stream->AddRef();
}
PsfParser::~PsfParser() {
stream->Release();
}
HRESULT PsfParser::readLong(uint32_t &out) {
HRESULT hresult;
ULONG bytesRead;
CHAR readBuf[4];
hresult=stream->Read(&version,1,&bytesRead);
retIfNonOk;
out=readBuf[0] | readBuf[1]<<8 | readBuf[2]<<16 | readBuf[3] <<24;
return S_OK;
}
HRESULT PsfParser::parse() {
STATSTG streamStat;
ULONG bytesRead;
HRESULT hresult;
hresult=stream->Stat(&streamStat,STATFLAG_NONAME);
retIfFail;
if(streamStat.cbSize.QuadPart<MIN_PCF_SIZE) {
return E_INVALIDARG;
}
LARGE_INTEGER seekPos;
seekPos.QuadPart=0;
hresult=stream->Seek(seekPos,STREAM_SEEK_SET,nullptr);
retIfFail;
CHAR fileSig[3];
hresult=stream->Read(fileSig,3,&bytesRead);
retIfNonOk;
if(strcmp(fileSig,"PSF")!=0) return E_INVALIDARG;
hresult=stream->Read(&version,1,&bytesRead);
retIfNonOk;
uint32_t reservatedLength,compressedLength,compressedCrc;
hresult=readLong(reservatedLength);
retIfNonOk;
hresult=readLong(compressedLength);
retIfNonOk;
hresult=readLong(compressedCrc);
retIfNonOk;
seekPos.QuadPart=reservatedLength+compressedLength;
hresult=stream->Seek(seekPos,STREAM_SEEK_CUR,nullptr);
retIfFail;
CHAR tagSig[5];
hresult=stream->Read(tagSig,5,&bytesRead);
retIfFail;
if(hresult==S_FALSE) return S_FALSE;
if(strcmp(tagSig,"[TAG]")!=0) return E_INVALIDARG;
seekPos.QuadPart=0;
hresult=stream->Seek(seekPos,STREAM_SEEK_CUR,&tagStart);
retIfFail;
return parseTags();
}
#define ReadBuffLen 256
HRESULT PsfParser::parseTags() {
HRESULT hresult;
bool inName=true;
std::string name;
std::string value;
//TODO: deal with the case of no tags at all in the existing file
try {
do {
CHAR readBuff[ReadBuffLen];
ULONG bytesRead;
hresult=stream->Read(readBuff,ReadBuffLen,&bytesRead);
retIfFail;
for(ULONG i=0;i<bytesRead;++i) {
CHAR &c=readBuff[i];
if(c=='=') {
//TODO: trim whitespace
inName=false;
} else if(c=='\r') {
} else if(c=='\n') {
inName=true;
//TODO: trim whitespace
auto existingItr=tags.find(name);
if(existingItr!=tags.end()) {
existingItr->second+="\n";
existingItr->second+=value;
} else {
tags.insert(std::make_pair(name,value));
}
name.clear();
value.clear();
} else if(inName) {
name+=c;
} else {
value+=c;
}
}
} while(hresult==S_OK);
return S_OK;
} catch (std::bad_alloc ba) {
return E_OUTOFMEMORY;
}
}
HRESULT PsfParser::saveTags() {
HRESULT hresult;
ULONG bytesWritten;
try {
LARGE_INTEGER seekPos;
seekPos.QuadPart=tagStart.QuadPart;
hresult=stream->Seek(seekPos,STREAM_SEEK_SET,nullptr);
retIfFail;
for(auto &kv: tags) {
auto &key=kv.first;
auto &value=kv.second;
const char *keyBuff=key.c_str();
const char *valueBuff=value.c_str();
//such a mess for newline values
const char *lineStart=keyBuff;
for(;;) {
const char *lineEnd=std::strstr(lineStart,"\n");
bool lastLine= !lineEnd;
int lineLen;
if(lastLine) {
lineLen=std::strlen(lineStart);
lineEnd=lineStart+lineLen;
} else {
lineLen=lineStart-lineEnd;
}
hresult=stream->Write(keyBuff,key.length(),&bytesWritten);
retIfFail;
char eq[]={'='};
hresult=stream->Write(eq,1,&bytesWritten);
retIfFail;
stream->Write(lineStart,lineLen,&bytesWritten);
retIfFail;
char nl[]={'\n'};
hresult=stream->Write(nl,1,&bytesWritten);
retIfFail;
if(lastLine) {
break;
}
lineStart=lineEnd+1;
}
}
return S_OK;
} catch (std::bad_alloc ba) {
return E_OUTOFMEMORY;
}
}
| [
"[email protected]"
] | |
711aab8ce9b9eb8124c85da7fbfeade2640bf053 | 8d06f1e39cbe0d5fb32df4b3030fceae2e6ee564 | /src/console/model/aggregationelementmodel.cpp | 8c672e9ea0c14db196381f2f9b65008f5eac0125 | [
"MIT"
] | permissive | KAMiKAZOW/kuserfeedback | 24d03afdc59a794baf16915ce568843d31391daa | 4b52c2e16c619288f1371f4bfbc369cde04b95c1 | refs/heads/master | 2021-01-01T23:31:33.258792 | 2020-02-07T14:38:54 | 2020-02-09T10:03:00 | 239,392,052 | 0 | 0 | NOASSERTION | 2020-02-09T23:42:25 | 2020-02-09T23:42:25 | null | UTF-8 | C++ | false | false | 3,163 | cpp | /*
Copyright (C) 2016 Volker Krause <[email protected]>
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 "aggregationelementmodel.h"
#include <core/product.h>
using namespace KUserFeedback::Console;
AggregationElementModel::AggregationElementModel(QObject* parent) :
QAbstractListModel(parent)
{
}
AggregationElementModel::~AggregationElementModel() = default;
void AggregationElementModel::setProduct(const Product& product)
{
beginResetModel();
m_elements.clear();
for (const auto &entry : product.schema()) {
for (const auto &elem : entry.elements()) {
AggregationElement e;
e.setSchemaEntry(entry);
e.setSchemaEntryElement(elem);
e.setType(AggregationElement::Value);
m_elements.push_back(e);
}
if (entry.dataType() != SchemaEntry::Scalar) {
AggregationElement e;
e.setSchemaEntry(entry);
e.setType(AggregationElement::Size);
m_elements.push_back(e);
}
}
endResetModel();
}
int AggregationElementModel::rowCount(const QModelIndex& parent) const
{
if (parent.isValid())
return 0;
return m_elements.size();
}
QVariant AggregationElementModel::data(const QModelIndex& index, int role) const
{
if (!index.isValid() || m_elements.isEmpty())
return {};
const auto e = m_elements.at(index.row());
switch (role) {
case Qt::DisplayRole: return e.displayString();
case Qt::EditRole: return QVariant::fromValue(e);
}
return {};
}
QModelIndexList AggregationElementModel::match(const QModelIndex& start, int role, const QVariant& value, int hits, Qt::MatchFlags flags) const
{
if (role == Qt::EditRole && value.userType() == qMetaTypeId<AggregationElement>() && hits == 1 && start.row() == 0) {
const auto cmp = value.value<AggregationElement>();
for (int i = 0; i < m_elements.size(); ++i) {
if (m_elements.at(i) == cmp)
return { index(i, 0) };
}
}
return QAbstractListModel::match(start, role, value, hits, flags);
}
| [
"[email protected]"
] | |
e91a135be132fd6847be94b8738c93ee5029203e | 660cff91d129c4d01dcabb75687e4b27c92d94f4 | /Source/GameServer/GameServer/Quest.cpp | f9b6a6a5896b550bb5a2900015cbecff94ad9cf9 | [] | no_license | thulioprado/MuGoblins | c0326aa6612e4972d22fe48838dfd91b01ba8b92 | 3f26656cd493a50d0c02f3c3543a899254cd6a5f | refs/heads/master | 2022-12-31T16:51:11.410512 | 2020-10-24T23:48:45 | 2020-10-24T23:48:45 | 228,335,567 | 6 | 9 | null | null | null | null | UTF-8 | C++ | false | false | 11,628 | cpp | // Quest.cpp: implementation of the CQuest class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "Quest.h"
#include "GameMain.h"
#include "MemScript.h"
#include "QuestObjective.h"
#include "QuestReward.h"
#include "Util.h"
CQuest gQuest;
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
CQuest::CQuest() // OK
{
this->m_count = 0;
}
CQuest::~CQuest() // OK
{
}
void CQuest::Load(char* path) // OK
{
CMemScript* lpMemScript = new CMemScript;
if (lpMemScript == 0)
{
ErrorMessageBox(MEM_SCRIPT_ALLOC_ERROR, path);
return;
}
if (lpMemScript->SetBuffer(path) == 0)
{
ErrorMessageBox(lpMemScript->GetLastError());
delete lpMemScript;
return;
}
this->m_count = 0;
try
{
while (true)
{
if (lpMemScript->GetToken() == TOKEN_END)
{
break;
}
if (strcmp("end", lpMemScript->GetString()) == 0)
{
break;
}
QUEST_INFO info;
memset(&info, 0, sizeof(info));
info.Index = lpMemScript->GetNumber();
info.StartType = lpMemScript->GetAsNumber();
info.MonsterClass = lpMemScript->GetAsNumber();
info.CurrentState = lpMemScript->GetAsNumber();
info.RequireIndex = lpMemScript->GetAsNumber();
info.RequireState = lpMemScript->GetAsNumber();
info.RequireMinLevel = lpMemScript->GetAsNumber();
info.RequireMaxLevel = lpMemScript->GetAsNumber();
for (int n = 0; n < MAX_CLASS; n++) { info.RequireClass[n] = lpMemScript->GetAsNumber(); }
this->SetInfo(info);
}
}
catch (...)
{
ErrorMessageBox(lpMemScript->GetLastError());
}
delete lpMemScript;
}
void CQuest::SetInfo(QUEST_INFO info) // OK
{
if (this->m_count < 0 || this->m_count >= MAX_QUEST)
{
return;
}
this->m_QuestInfo[this->m_count++] = info;
}
QUEST_INFO* CQuest::GetInfo(int index) // OK
{
if (index < 0 || index >= this->m_count)
{
return 0;
}
return &this->m_QuestInfo[index];
}
QUEST_INFO* CQuest::GetInfoByIndex(LPOBJ lpObj, int QuestIndex) // OK
{
for (int n = 0; n < this->m_count; n++)
{
QUEST_INFO* lpInfo = this->GetInfo(n);
if (lpInfo == 0)
{
continue;
}
if (lpInfo->Index != QuestIndex)
{
continue;
}
if (this->CheckQuestRequisite(lpObj, lpInfo) == 0)
{
continue;
}
return lpInfo;
}
return 0;
}
bool CQuest::AddQuestList(LPOBJ lpObj, int QuestIndex, int QuestState) // OK
{
if (QuestIndex < 0 || QuestIndex >= MAX_QUEST_LIST)
{
return 0;
}
lpObj->Quest[QuestIndex / 4] = (lpObj->Quest[QuestIndex / 4] & gQuestBitMask[(QuestIndex % 4) * 2]) | ((QuestState & 3) << ((QuestIndex % 4) * 2));
return 1;
}
BYTE CQuest::GetQuestList(LPOBJ lpObj, int QuestIndex) // OK
{
if (QuestIndex < 0 || QuestIndex >= MAX_QUEST_LIST)
{
return 0;
}
return lpObj->Quest[QuestIndex / 4];
}
bool CQuest::CheckQuestRequisite(LPOBJ lpObj, QUEST_INFO* lpInfo) // OK
{
if (this->CheckQuestListState(lpObj, lpInfo->Index, lpInfo->CurrentState) == 0)
{
return 0;
}
if (lpInfo->RequireIndex != -1 && this->CheckQuestListState(lpObj, lpInfo->RequireIndex, lpInfo->RequireState) == 0)
{
return 0;
}
if (lpInfo->RequireMinLevel != -1 && lpInfo->RequireMinLevel > lpObj->Level)
{
return 0;
}
if (lpInfo->RequireMaxLevel != -1 && lpInfo->RequireMaxLevel < lpObj->Level)
{
return 0;
}
if (lpInfo->RequireClass[lpObj->Class] == 0 || lpInfo->RequireClass[lpObj->Class] > (lpObj->ChangeUp + 1))
{
return 0;
}
return 1;
}
bool CQuest::CheckQuestListState(LPOBJ lpObj, int QuestIndex, int QuestState) // OK
{
if (QuestIndex < 0 || QuestIndex >= MAX_QUEST_LIST)
{
return 0;
}
if (((lpObj->Quest[QuestIndex / 4] >> ((QuestIndex % 4) * 2)) & 3) == QuestState)
{
return 1;
}
return 0;
}
long CQuest::GetQuestRewardLevelUpPoint(LPOBJ lpObj) // OK
{
int point = 0;
for (int n = 0; n < MAX_QUEST_LIST; n++)
{
if (this->CheckQuestListState(lpObj, n, QUEST_FINISH) != 0)
{
point += gQuestReward.GetQuestRewardPoint(lpObj, n);
}
}
return point;
}
bool CQuest::NpcTalk(LPOBJ lpNpc, LPOBJ lpObj) // OK
{
for (int n = 0; n < this->m_count; n++)
{
QUEST_INFO* lpInfo = this->GetInfo(n);
if (lpInfo == 0)
{
continue;
}
if (lpInfo->StartType != 0)
{
continue;
}
if (lpInfo->MonsterClass != lpNpc->Class)
{
continue;
}
if (this->CheckQuestRequisite(lpObj, lpInfo) == 0)
{
continue;
}
lpObj->Interface.use = 1;
lpObj->Interface.type = INTERFACE_QUEST;
lpObj->Interface.state = 0;
this->GCQuestStateSend(lpObj->Index, lpInfo->Index);
this->GCQuestKillCountSend(lpObj->Index, lpInfo->Index);
return 1;
}
return 0;
}
void CQuest::CGQuestInfoRecv(int aIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (gObjIsConnectedGP(aIndex) == 0)
{
return;
}
this->GCQuestInfoSend(aIndex);
}
void CQuest::CGQuestStateRecv(PMSG_QUEST_STATE_RECV* lpMsg, int aIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (gObjIsConnectedGP(aIndex) == 0)
{
return;
}
QUEST_INFO* lpInfo = this->GetInfoByIndex(lpObj, lpMsg->QuestIndex);
if (lpInfo == 0)
{
return;
}
if (gQuestObjective.CheckQuestObjective(lpObj, lpInfo->Index) == 0)
{
this->GCQuestResultSend(aIndex, lpInfo->Index, 0xFF, this->GetQuestList(lpObj, lpInfo->Index));
return;
}
if (lpInfo->CurrentState == QUEST_NORMAL)
{
gQuestObjective.RemoveQuestObjective(lpObj, lpInfo->Index);
gQuestReward.InsertQuestReward(lpObj, lpInfo->Index);
this->AddQuestList(lpObj, lpInfo->Index, QUEST_ACCEPT);
gQuestObjective.InitQuestObjectiveKillCount(lpObj, lpInfo->Index);
this->GCQuestResultSend(aIndex, lpInfo->Index, 0x00, this->GetQuestList(lpObj, lpInfo->Index));
return;
}
if (lpInfo->CurrentState == QUEST_ACCEPT)
{
gQuestObjective.RemoveQuestObjective(lpObj, lpInfo->Index);
gQuestReward.InsertQuestReward(lpObj, lpInfo->Index);
this->AddQuestList(lpObj, lpInfo->Index, QUEST_FINISH);
gQuestObjective.InitQuestObjectiveKillCount(lpObj, lpInfo->Index);
this->GCQuestResultSend(aIndex, lpInfo->Index, 0x00, this->GetQuestList(lpObj, lpInfo->Index));
return;
}
if (lpInfo->CurrentState == QUEST_FINISH)
{
gQuestObjective.RemoveQuestObjective(lpObj, lpInfo->Index);
gQuestReward.InsertQuestReward(lpObj, lpInfo->Index);
this->AddQuestList(lpObj, lpInfo->Index, QUEST_FINISH);
gQuestObjective.InitQuestObjectiveKillCount(lpObj, lpInfo->Index);
this->GCQuestResultSend(aIndex, lpInfo->Index, 0xFF, this->GetQuestList(lpObj, lpInfo->Index));
return;
}
if (lpInfo->CurrentState == QUEST_CANCEL)
{
gQuestObjective.RemoveQuestObjective(lpObj, lpInfo->Index);
gQuestReward.InsertQuestReward(lpObj, lpInfo->Index);
this->AddQuestList(lpObj, lpInfo->Index, QUEST_ACCEPT);
gQuestObjective.InitQuestObjectiveKillCount(lpObj, lpInfo->Index);
this->GCQuestResultSend(aIndex, lpInfo->Index, 0x00, this->GetQuestList(lpObj, lpInfo->Index));
return;
}
}
void CQuest::CGQuestNpcWarewolfRecv(int aIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (gObjIsConnectedGP(aIndex) == 0)
{
return;
}
if (lpObj->Interface.use != 0)
{
return;
}
if (lpObj->X < 57 || lpObj->X > 67 || lpObj->Y < 234 || lpObj->Y > 244)
{
return;
}
if (this->CheckQuestListState(lpObj, 5, QUEST_ACCEPT) != 0 || this->CheckQuestListState(lpObj, 5, QUEST_FINISH) != 0)
{
gObjMoveGate(aIndex, 256);
}
}
void CQuest::CGQuestNpcKeeperRecv(int aIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (gObjIsConnectedGP(aIndex) == 0)
{
return;
}
if (lpObj->Interface.use != 0)
{
return;
}
if (lpObj->X < 114 || lpObj->X > 124 || lpObj->Y < 163 || lpObj->Y > 173)
{
return;
}
if (this->CheckQuestListState(lpObj, 6, QUEST_ACCEPT) != 0 || this->CheckQuestListState(lpObj, 6, QUEST_FINISH) != 0)
{
gObjMoveGate(aIndex, 257);
}
}
void CQuest::GCQuestInfoSend(int aIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (lpObj->SendQuestInfo != 0)
{
return;
}
PMSG_QUEST_INFO_SEND pMsg;
pMsg.header.set(0xA0, sizeof(pMsg));
pMsg.count = this->m_count;
memcpy(pMsg.QuestInfo, lpObj->Quest, sizeof(pMsg.QuestInfo));
DataSend(aIndex, (BYTE*)&pMsg, pMsg.header.size);
lpObj->SendQuestInfo = 1;
}
void CQuest::GCQuestStateSend(int aIndex, int QuestIndex) // OK
{
this->GCQuestInfoSend(aIndex);
PMSG_QUEST_STATE_SEND pMsg;
pMsg.header.set(0xA1, sizeof(pMsg));
pMsg.QuestIndex = QuestIndex;
pMsg.QuestState = this->GetQuestList(&gObj[aIndex], QuestIndex);
DataSend(aIndex, (BYTE*)&pMsg, pMsg.header.size);
}
void CQuest::GCQuestResultSend(int aIndex, int QuestIndex, int QuestResult, int QuestState) // OK
{
PMSG_QUEST_RESULT_SEND pMsg;
pMsg.header.set(0xA2, sizeof(pMsg));
pMsg.QuestIndex = QuestIndex;
pMsg.QuestResult = QuestResult;
pMsg.QuestState = QuestState;
DataSend(aIndex, (BYTE*)&pMsg, pMsg.header.size);
}
void CQuest::GCQuestRewardSend(int aIndex, int QuestReward, int QuestAmount) // OK
{
this->GCQuestInfoSend(aIndex);
PMSG_QUEST_REWARD_SEND pMsg;
pMsg.header.set(0xA3, sizeof(pMsg));
pMsg.index[0] = SET_NUMBERHB(aIndex);
pMsg.index[1] = SET_NUMBERLB(aIndex);
pMsg.QuestReward = QuestReward;
pMsg.QuestAmount = QuestAmount;
pMsg.LevelUpPoints = gObj[aIndex].LevelUpPoint;
DataSend(aIndex, (BYTE*)&pMsg, pMsg.header.size);
MsgSendV2(&gObj[aIndex], (BYTE*)&pMsg, pMsg.header.size);
}
void CQuest::GCQuestKillCountSend(int aIndex, int QuestIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (lpObj->QuestKillCountIndex != QuestIndex)
{
return;
}
if (this->CheckQuestListState(lpObj, QuestIndex, QUEST_ACCEPT) == 0)
{
return;
}
PMSG_QUEST_KILL_COUNT_SEND pMsg;
pMsg.header.set(0xA4, sizeof(pMsg));
pMsg.QuestResult = 1;
pMsg.QuestIndex = QuestIndex;
memcpy(pMsg.QuestKillCount, lpObj->QuestKillCount, sizeof(pMsg.QuestKillCount));
DataSend(aIndex, (BYTE*)&pMsg, pMsg.header.size);
}
void CQuest::DGQuestKillCountRecv(SDHP_QUEST_KILL_COUNT_RECV* lpMsg) // OK
{
if (gObjIsAccountValid(lpMsg->index, lpMsg->account) == 0)
{
LogAdd(LOG_RED, "[DGQuestKillCountRecv] Invalid Account [%d](%s)", lpMsg->index, lpMsg->account);
CloseClient(lpMsg->index);
return;
}
LPOBJ lpObj = &gObj[lpMsg->index];
if (lpObj->LoadQuestKillCount != 0)
{
return;
}
lpObj->LoadQuestKillCount = 1;
lpObj->QuestKillCountIndex = lpMsg->QuestIndex;
for (int n = 0; n < MAX_QUEST_KILL_COUNT; n++)
{
lpObj->QuestKillCount[n].MonsterClass = lpMsg->MonsterClass[n];
lpObj->QuestKillCount[n].KillCount = lpMsg->KillCount[n];
}
}
void CQuest::GDQuestKillCountSend(int aIndex) // OK
{
if (gObjIsAccountValid(aIndex, gObj[aIndex].Account) == 0)
{
return;
}
if (gObj[aIndex].LoadQuestKillCount != 0)
{
return;
}
SDHP_QUEST_KILL_COUNT_SEND pMsg;
pMsg.header.set(0x0C, 0x00, sizeof(pMsg));
pMsg.index = aIndex;
memcpy(pMsg.account, gObj[aIndex].Account, sizeof(pMsg.account));
memcpy(pMsg.name, gObj[aIndex].Name, sizeof(pMsg.name));
gDataServerConnection.DataSend((BYTE*)&pMsg, pMsg.header.size);
}
void CQuest::GDQuestKillCountSaveSend(int aIndex) // OK
{
LPOBJ lpObj = &gObj[aIndex];
if (lpObj->LoadQuestKillCount == 0)
{
return;
}
SDHP_QUEST_KILL_COUNT_SAVE_SEND pMsg;
pMsg.header.set(0x0C, 0x30, sizeof(pMsg));
pMsg.index = aIndex;
memcpy(pMsg.account, lpObj->Account, sizeof(pMsg.account));
memcpy(pMsg.name, lpObj->Name, sizeof(pMsg.name));
pMsg.QuestIndex = lpObj->QuestKillCountIndex;
for (int n = 0; n < MAX_QUEST_KILL_COUNT; n++)
{
pMsg.MonsterClass[n] = lpObj->QuestKillCount[n].MonsterClass;
pMsg.KillCount[n] = lpObj->QuestKillCount[n].KillCount;
}
gDataServerConnection.DataSend((BYTE*)&pMsg, pMsg.header.size);
}
| [
"[email protected]"
] | |
a2fc5014b58ed71b50f7c3498f146a5356b2b4bb | 44289ecb892b6f3df043bab40142cf8530ac2ba4 | /Sources/Elastos/Frameworks/Droid/DevSamples/jpk/JSTabHostDemo/elastos/devsamples/node/jstabhostdemo/CNodeListener.h | 9a133b2db7b714c4bdbce56555cf9032fb43fadc | [
"Apache-2.0"
] | permissive | warrenween/Elastos | a6ef68d8fb699fd67234f376b171c1b57235ed02 | 5618eede26d464bdf739f9244344e3e87118d7fe | refs/heads/master | 2021-01-01T04:07:12.833674 | 2017-06-17T15:34:33 | 2017-06-17T15:34:33 | 97,120,576 | 2 | 1 | null | 2017-07-13T12:33:20 | 2017-07-13T12:33:20 | null | UTF-8 | C++ | false | false | 8,220 | h | #ifndef __CTESTEVENTLISTENER_H__
#define __CTESTEVENTLISTENER_H__
#define JSPkgName JSTabHostDemo
#define JSEvtName CNodeListener
#ifndef JSCarClassHead
#define AA(y) #y
#define BB(x,y) AA(x##y.h)
#define CC(x,y,z) BB(x##z,y)
#define DD(x,y,z) CC(z##x,y,_)
#define EE(x,y) DD(x,y,_Elastos_DevSamples_Node_)
#define FF(x) AA(x)
#define JSEvtCarClassHead EE(JSPkgName,JSEvtName)
#define JSPkgNameStr FF(JSPkgName)
#define JSEvtNameStr FF(JSEvtName)
#define JSCarClass(x) CarClass(x)
#define JS_TO_STRING_IMPL_0(x) TO_STRING_IMPL(#x)
#define JS_TO_STRING_IMPL(x,y) JS_TO_STRING_IMPL_0(x::y)
#define JS_CAR_INTERFACE_IMPL(x,y,z) CAR_INTERFACE_IMPL(x,y,z)
#define JS_CAR_OBJECT_IMPL(x) CAR_OBJECT_IMPL(x)
#endif
#include JSEvtCarClassHead
#include "Elastos.Node.Bridge.h"
#include <Elastos.CoreLibrary.Utility.h>
#include "Elastos.Droid.Content.h"
#include "Elastos.Droid.Net.h"
#include "Elastos.Droid.Os.h"
#include "elastos/droid/ext/frameworkext.h"
#include <elastos/droid/ext/frameworkdef.h>
#include <elastos/core/Object.h>
#include <elastos/core/Thread.h>
#include <cutils/log.h>
using Elastos::Droid::Content::IContext;
using Elastos::Droid::Net::IUri;
using Elastos::Droid::Os::IPowerManagerWakeLock;
using Elastos::Core::Thread;
using Elastos::Utility::ILinkedList;
using Elastos::Core::IRunnable;
using Elastos::Core::EIID_IRunnable;
using Elastos::Droid::Os::IHandler;
using Elastos::Droid::Os::IMessage;
using Elastos::Droid::Os::CMessage;
namespace Elastos {
namespace DevSamples {
namespace Node {
namespace JSPkgName {
EXTERN IHandler* myHandler;
EXTERN NodeBridge* g_pNodeBridge;
EXTERN NodeBridge** g_ppNodeBridge;
class CallbackRunnable
: public Object
, public IRunnable
, public ICallbackRunnable
{
public:
CallbackRunnable(
/* [in] */ IInterface* object,
/* [in] */ IMethodInfo* method,
/* [in] */ IArgumentList* argumentList,
/* [in] */ pthread_mutex_t* mutex,
/* [in] */ Int32 tag);
~CallbackRunnable();
CAR_INTERFACE_DECL()
CARAPI Run();
CARAPI GetInstance(IInterface** ppInstance);
static void NodeMessage_FireCallback(void* payload) {
ECode ec = NOERROR;
AutoPtr<IMessage> msg = (IMessage*)payload;
AutoPtr<IRunnable> runnable;
msg->GetCallback((IRunnable**)&runnable);
IInterface* _interface = runnable->Probe(EIID_IInterface);
//IInterface* _object = runnable->Probe(EIID_IObject);
//CallbackRunnable* callback = (CallbackRunnable*)_interface;
CallbackRunnable* callback = *(CallbackRunnable**)&_interface;
//CallbackRunnable* callback = *(CallbackRunnable**)&runnable;
ICallbackRunnable* _callbackRunnable = (ICallbackRunnable*)runnable->Probe(EIID_ICallbackRunnable);
CallbackRunnable* callback_1;
_callbackRunnable->GetInstance((IInterface**)&callback_1);
IMethodInfo* _methodInfo = callback_1->mMethod.Get();
IInterface* _object = callback_1->mObject.Get();
IArgumentList* _argumentList = callback_1->mArgumentList.Get();
//ec = callback->mMethod->Invoke(callback->mObject, callback->mArgumentList);
ec = callback_1->mMethod->Invoke(callback_1->mObject, callback_1->mArgumentList);
if (FAILED(ec)) {
ALOGD("NodeMessage_FireCallback================Invoke failed================");
}
}
static void NodeMessage_Send(void* payload) {
AutoPtr<IHandler> target = myHandler;
AutoPtr<IMessage> msg = (IMessage*)payload;
Boolean result;
target->SendMessage(msg, &result);
}
static void EnqueueUIMessage(void* obj, void* method, void* params)
{
pthread_t mThread = pthread_self();
AutoPtr<IMessage> msg;
CMessage::New((IMessage**)&msg);
AutoPtr<IHandler> target = myHandler;
msg->SetTarget(target);
Int32 MSG_RUNONUITHREAD = 0x0;
msg->SetWhat(MSG_RUNONUITHREAD);
pthread_mutex_t* mutex;
CallbackRunnable* callback = new CallbackRunnable(
(IInterface*)obj, (IMethodInfo*)method, (IArgumentList*)params, (pthread_mutex_t*)mutex, 258);
IRunnable* runnable = IRunnable::Probe(callback);
msg->SetCallback(runnable);
ALOGD("EnqueueUIMessage======================mTag:%d",callback->mTag);
g_pNodeBridge->vt->Enqueue(g_pNodeBridge, obj, NodeMessage_Send, NodeMessage_FireCallback, (void*)msg);
return;
};
private:
AutoPtr<IInterface> mObject;
AutoPtr<IMethodInfo> mMethod;
AutoPtr<IArgumentList> mArgumentList;
static CallbackRunnable* mInstances[];
Int32 mMyLock;
Int32 mTag;
};
JSCarClass(JSEvtName)
, public Object
, public INodeListener
{
public:
class _Thread : public Thread
{
public:
_Thread(
/* [in] */ const String& packageName)
: mPackageName(packageName)
{
Thread::constructor(String("CNodeListener::_Thread"));
}
CARAPI Run();
private:
String mPackageName;
};
static void InitBridge(const String& packageName) {
AutoPtr<_Thread> t = new _Thread(packageName);
pthread_mutex_t* pMutex = &mMutex;
pthread_mutex_init(pMutex, NULL);
pthread_mutex_lock(pMutex);
t->Start();
//todo: use wait()
pthread_mutex_lock(pMutex);
pthread_mutex_unlock(pMutex);
return;
};
static void RegisterActivity(const String& packageName, const String& activityName, IInterface* activityInstance, IActivityListener** activityListener, IHandler* activityHandler) {
if (!JSEvtName::mNodeInit) {
JSEvtName::InitBridge(packageName);
JSEvtName::mNodeInit = true;
}
Boolean result = false;
if(JSEvtName::mNodeBridgeListener) {
JSEvtName::mNodeBridgeListener->OnRegistActivity(
packageName, activityName, activityInstance, (Int32)activityListener, activityHandler, &result);
}
else {
ALOGD("RegisterActivity================mNodeBridgeListener is null================");
}
}
static ECode Require(
/* [in] */ const String& moduleName,
/* [in] */ const String& className,
/* [out] */ IInterface** object)
{
assert(object != NULL);
ECode ec = NOERROR;
AutoPtr<IModuleInfo> moduleInfo;
ec = _CReflector_AcquireModuleInfo(moduleName, (IModuleInfo**)&moduleInfo);
if (FAILED(ec)) {
ALOGD("Acquire \"%s\" module info failed!\n", moduleName.string());
return ec;
}
AutoPtr<IClassInfo> classInfo;
ec = moduleInfo->GetClassInfo(className, (IClassInfo**)&classInfo);
if (FAILED(ec)) {
ALOGD("Acquire \"%s\" class info failed!\n", className.string());
return ec;
}
AutoPtr<IInterface> testObject;
ec = classInfo->CreateObject((IInterface**)&testObject);
if (FAILED(ec)) {
ALOGD("Create object failed!\n");
return ec;
}
*object = testObject;
REFCOUNT_ADD(*object);
return ec;
}
public:
CAR_INTERFACE_DECL()
CAR_OBJECT_DECL()
CARAPI constructor();
CARAPI OnNodeEvent(
/* [in] */ Int32 eventId);
CARAPI GetEnqueueUIMessagePtr(
/* [out] */ Int32 * pOutPtr);
CARAPI Sleep(
/* [in] */ Int32 interval);
CARAPI Lock();
CARAPI Unlock();
CARAPI SetActivityListener(
///* [in] */ IActivityListener** ppActivityListener,
/* [in] */ Int32 ppActivityListener,
/* [in] */ IActivityListener* pJsActivityListener);
CARAPI SetNodeBridgeListener(
/* [in] */ INodeBridgeListener* pNodeBridgeListener);
CARAPI SetNodeBridge(
/* [in] */ Int32 from,
/* [in] */ Int32 threadIndex);
private:
void (*cbFunction)(void*);
public:
static pthread_mutex_t mMutex;
static AutoPtr<INodeBridgeListener> mNodeBridgeListener;
static bool mNodeInit;
};
} //namespace JSPkgName
} //namespace Node
} //namespace DevSamples
} //namespace Elastos
#endif // __H__ | [
"[email protected]"
] | |
351b362907d06accd70da96cdd594229943de0cc | 59754c35c1421043a9325f8594009302b5b6f56c | /common/v4l2/include/v4l2/stream_format.h | 3a6ceef0c890212cebc917019ff41cc868b2c8f1 | [
"Apache-2.0"
] | permissive | STMicroelectronics/hardware-peripheral-camera | a1d6b90dbe2662bdf91abea3dfa83967129c5da2 | 8f575f17886a38bbd348aa00b386d6623cf602c1 | refs/heads/master | 2023-08-25T08:56:38.030434 | 2021-06-01T06:44:12 | 2021-09-02T07:27:40 | 212,054,367 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,180 | h | /*
* Copyright (C) 2019 The Android Open Source Project
* Copyright (C) 2019 STMicroelectronics
*
* 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 V4L2_CAMERA_HAL_STREAM_FORMAT_H_
#define V4L2_CAMERA_HAL_STREAM_FORMAT_H_
#include <linux/videodev2.h>
#include <set>
#include <unistd.h>
#include <vector>
#include "android/hardware/graphics/common/1.0/types.h"
namespace android {
namespace hardware {
namespace camera {
namespace common {
namespace V1_0 {
namespace v4l2 {
using ::android::hardware::graphics::common::V1_0::PixelFormat;
class StreamFormat;
typedef std::vector<StreamFormat> StreamFormats;
class StreamFormat {
public:
StreamFormat(PixelFormat format, uint32_t width, uint32_t height,
uint32_t implementation_defined);
StreamFormat(uint32_t format, uint32_t width, uint32_t height);
StreamFormat(const v4l2_format& format);
virtual ~StreamFormat() = default;
void FillFormatRequest(v4l2_format* format) const;
// Accessors.
inline uint32_t type() const { return type_; };
inline uint32_t width() const { return width_; };
inline uint32_t height() const { return height_; };
inline int pixel_format() const { return V4L2ToHalPixelFormat(v4l2_pixel_format_); }
inline uint32_t v4l2_pixel_format() const { return v4l2_pixel_format_; }
bool operator==(const StreamFormat& other) const;
bool operator!=(const StreamFormat& other) const;
// HAL <-> V4L2 conversions
// Returns 0 for unrecognized.
static uint32_t HalToV4L2PixelFormat(PixelFormat hal_pixel_format,
uint32_t implementation_defined = 0);
// Returns -1 for unrecognized.
static int V4L2ToHalPixelFormat(uint32_t v4l2_pixel_format);
static int V4L2ToHalPixelFormat(const std::set<uint32_t> v4l2_pixel_formats,
std::set<PixelFormat> *hal_pixel_format);
static int FindMatchingFormat(const StreamFormats& formats,
uint32_t pixel_format, uint32_t width,
uint32_t height);
static int FindFormatByResolution(const StreamFormats& formats,
uint32_t width, uint32_t height);
static StreamFormats GetQualifiedStreams(
const std::vector<uint32_t>& qualified_formats,
const StreamFormats& supported_stream);
private:
uint32_t type_;
uint32_t v4l2_pixel_format_;
uint32_t width_;
uint32_t height_;
static const std::vector<uint32_t> kSupportedFourCCs;
};
} // v4l2
} // V1_0
} // common
} // camera
} // hardware
} // android
#endif // V4L2_CAMERA_HAL_STREAM_FORMAT_H_
| [
"[email protected]"
] | |
add320441d41c301d0bb090a7a3488e31c038191 | 5a2349399fa9d57c6e8cc6e0f7226d683391a362 | /src/qt/qtwebkit/Source/WebCore/Modules/indexeddb/IDBOpenDBRequest.h | 2e2beb8e0117a7e1e6b5bfc713c8ccdd16112b46 | [
"BSD-2-Clause",
"LGPL-2.1-only",
"LGPL-2.0-only",
"BSD-3-Clause"
] | permissive | aharthcock/phantomjs | e70f3c379dcada720ec8abde3f7c09a24808154c | 7d7f2c862347fbc7215c849e790290b2e07bab7c | refs/heads/master | 2023-03-18T04:58:32.428562 | 2023-03-14T05:52:52 | 2023-03-14T05:52:52 | 24,828,890 | 0 | 0 | BSD-3-Clause | 2023-03-14T05:52:53 | 2014-10-05T23:38:56 | C++ | UTF-8 | C++ | false | false | 2,731 | h | /*
* Copyright (C) 2012 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.
*/
#ifndef IDBOpenDBRequest_h
#define IDBOpenDBRequest_h
#if ENABLE(INDEXED_DATABASE)
#include "IDBRequest.h"
namespace WebCore {
class IDBDatabaseCallbacksImpl;
class IDBOpenDBRequest : public IDBRequest {
public:
static PassRefPtr<IDBOpenDBRequest> create(ScriptExecutionContext*, PassRefPtr<IDBDatabaseCallbacksImpl>, int64_t transactionId, int64_t version);
virtual ~IDBOpenDBRequest();
using IDBRequest::onSuccess;
virtual void onBlocked(int64_t existingVersion) OVERRIDE;
virtual void onUpgradeNeeded(int64_t oldVersion, PassRefPtr<IDBDatabaseBackendInterface>, const IDBDatabaseMetadata&) OVERRIDE;
virtual void onSuccess(PassRefPtr<IDBDatabaseBackendInterface>, const IDBDatabaseMetadata&) OVERRIDE;
// EventTarget
virtual const AtomicString& interfaceName() const;
virtual bool dispatchEvent(PassRefPtr<Event>) OVERRIDE;
DEFINE_ATTRIBUTE_EVENT_LISTENER(blocked);
DEFINE_ATTRIBUTE_EVENT_LISTENER(upgradeneeded);
protected:
virtual bool shouldEnqueueEvent() const OVERRIDE;
private:
IDBOpenDBRequest(ScriptExecutionContext*, PassRefPtr<IDBDatabaseCallbacksImpl>, int64_t transactionId, int64_t version);
RefPtr<IDBDatabaseCallbacksImpl> m_databaseCallbacks;
const int64_t m_transactionId;
int64_t m_version;
};
} // namespace WebCore
#endif // ENABLE(INDEXED_DATABASE)
#endif // IDBOpenDBRequest_h
| [
"[email protected]"
] | |
ff43ba73ea51a14c82f940e8e6b0e1a1d113b49b | 3778519d536db519c651d53d94d5c86b959ac405 | /src/Compiler/IrDefs.h | d1c11e61c6821b37e834ebc23cda13d16d61c4a0 | [] | no_license | eval1749/evm | e882e98a8b7c451e62909a29c32380ee6b91ccac | 0ed7aba1fd10614af6235e0f21b878d95273a7f4 | refs/heads/master | 2020-09-21T14:02:06.226527 | 2012-12-28T10:19:44 | 2012-12-28T10:19:44 | 23,464,986 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 749 | h | // @(#)$Id$
//
// Evita Compiler - ResolvePass
//
// Copyright (C) 2010 by Project Vogue.
// Written by Yoshifumi ;VOGUE; INOUE. ([email protected])
#if !defined(INCLUDE_Compiler_IrDefs_h)
#define INCLUDE_Compiler_IrDefs_h
namespace Compiler {
class AliasDef;
class ArrayTypeDef;
class Attribute;
class ClassDef;
class EnumFieldDef;
class Entity;
class FieldDef;
class IrObject;
class LocalVarDef;
class MethodDef;
class MethodGroupDef;
class MethodParamDef;
class NameDef;
class ClassOrNamespaceDef;
class NamespaceBody;
class NamespaceDef;
class NamespaceMember;
class Operator;
class RankSpec;
class TypeDef;
class TypeParamDef;
class UsingNamespace;
class VarDef;
class VariableOwner;
} // Compiler
#endif // !defined(INCLUDE_Compiler_IrDefs_h)
| [
"[email protected]"
] | |
f1836b91d3467ff99cadbbae17d11076850aaad6 | dc280ea45ce88e44ae7aed3948984721b4f4d453 | /framework/EliteMath/EVector2.h | 9e2553034438869102460e3a014c103e7473fddb | [] | no_license | TomKalders/FlowField | c98460be6df15415d69fa2252d7ea0c48211dece | 9a2a401261adc638075eb73bcc81ce140fc4a070 | refs/heads/master | 2023-02-13T14:09:06.214256 | 2021-01-13T13:43:21 | 2021-01-13T13:43:21 | 326,391,522 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,923 | h | /*=============================================================================*/
// Copyright 2017-2018 Elite Engine
// Authors: Matthieu Delaere
/*=============================================================================*/
// EVector2.h: Vector2D struct
/*=============================================================================*/
#ifndef ELITE_MATH_VECTOR2
#define ELITE_MATH_VECTOR2
namespace Elite
{
#define ZeroVector2 Vector2()
#define UnitVector2 Vector2(1.f,1.f)
//Vector 2D
struct Vector2
{
//=== Datamembers ===
float x = 0.0f;
float y = 0.0f;
//=== Constructors ===
Vector2() = default;
Vector2(float _x, float _y) :x(_x), y(_y) {};
//=== Vector Conversions Functions ===
#ifdef USE_BOX2D
explicit Vector2(const b2Vec2& v) : x(v.x), y(v.y) {};
Vector2& operator=(const b2Vec2& v) { x = v.x; y = v.y; return *this; }
operator b2Vec2() const
{return {x, y};};
#endif
//=== Arithmetic Operators ===
inline auto operator-(const Vector2& v) const
{ return Vector2(x - v.x, y - v.y); }
inline auto operator-() const
{ return Vector2(-x, -y); }
inline auto operator*(float scale) const
{ return Vector2(x * scale, y * scale); }
inline auto operator/(float scale) const
{
const auto revScale = 1.0f / scale;
return Vector2(x * revScale, y * revScale);
}
//=== Compound Assignment Operators === //auto& for type deduction
inline auto& operator+=(const Vector2& v)
{ x += v.x; y += v.y; return *this; }
inline auto& operator-=(const Vector2& v)
{ x -= v.x; y -= v.y; return *this; }
inline auto& operator*=(float scale)
{ x *= scale; y *= scale; return *this; }
inline auto& operator/=(float scale)
{
const auto revScale = 1.0f / scale;
x *= revScale; y *= revScale; return *this;
}
//=== Relational Operators ===
inline auto operator==(const Vector2& v) const /*Check if both components are equal*/
{ return AreEqual(x, v.x) && AreEqual(y, v.y); }
inline auto operator!=(const Vector2& v) const /*Check if one or both components are NOT equal*/
{ return !(*this == v); }
//=== Member Access Operators ===
inline float operator[](unsigned int i) const
{
return ((i == 0) ? x : y);
//if (i >= 0 && i < 2)
// return ((i == 0) ? x : y);
//throw; /*TODO : specify error thrown;*/
}
inline float& operator[](unsigned int i)
{
return ((i == 0) ? x : y);
//if (i >= 0 && i < 2)
// return ((i == 0) ? x : y);
//throw; /*TODO : specify error thrown;*/
}
//=== Internal Vector Functions ===
inline auto Dot(const Vector2& v) const
{ return x * v.x + y * v.y; }
inline auto Cross(const Vector2& v) const
{ return x * v.y - y * v.x; }
inline auto GetAbs() const
{ return Vector2(abs(x), abs(y)); }
inline auto MagnitudeSquared() const
{ return x*x + y*y; }
inline auto Magnitude() const
{ return sqrtf(MagnitudeSquared()); }
inline float Normalize()
{
auto m = Magnitude();
if (AreEqual(m, 0.f))
{
*this = ZeroVector2;
return 0.f;
}
auto invM = 1.f / m;
x *= invM;
y *= invM;
return m;
}
inline Vector2 GetNormalized() const /*! Returns a normalized copy of this vector. This vector does not change.*/
{
auto v = Vector2(*this);
v.Normalize();
return v;
}
inline auto DistanceSquared(const Vector2& v) const
{ return Square(v.x - x) + Square(v.y - y); }
inline auto Distance(const Vector2& v) const
{ return sqrtf(DistanceSquared(v)); }
inline auto Clamp(float max)
{
auto scale = max / Magnitude();
scale = scale < 1.f ? scale : 1.f;
return *this * scale;
}
};
//=== Global Vector Operators ===
#pragma region GlobalVectorOperators
inline auto operator+(const Vector2& v, const Vector2& v2)
{ return Vector2(v.x + v2.x, v.y + v2.y); }
inline auto operator* (float s, const Vector2& v)
{ return Vector2(s * v.x, s * v.y); }
inline auto operator*(const Vector2& a, const Vector2& b)
{ return Vector2(a.x*b.x, a.y*b.y); }
inline auto operator/ (float s, const Vector2& v)
{
const auto revScale = 1.0f / s;
return Vector2(revScale * v.x, revScale * v.y);
}
inline ostream& operator<<(ostream& os, const Vector2& rhs)
{
os << "(" << rhs.x << ", " << rhs.y << " )";
return os;
}
#pragma endregion //GlobalVectorOperators
//=== Global Vector Functions ===
#pragma region GlobalVectorFunctions
inline auto Dot(const Vector2& v1, const Vector2& v2)
{ return v1.Dot(v2); }
inline auto Cross(const Vector2& v1, const Vector2& v2)
{ return v1.Cross(v2); }
inline auto GetAbs(const Vector2& v)
{ return v.GetAbs(); }
inline void Abs(Vector2& v) /*! Make absolute Vector2 of this Vector2 */
{ v = v.GetAbs(); }
inline void Normalize(Vector2& v)
{ v.Normalize(); }
inline auto GetNormalized(Vector2& v)
{ return v.GetNormalized(); }
inline auto DistanceSquared(const Vector2& v1, const Vector2& v2)
{ return v1.DistanceSquared(v2); }
inline auto Distance(const Vector2& v1, const Vector2& v2)
{ return v1.Distance(v2); }
inline auto Clamp(const Vector2& v, float max)
{
auto scale = max / v.Magnitude();
scale = scale < 1.f ? scale : 1.f;
return v * scale;
}
#pragma endregion //GlobalVectorFunctions
#pragma region ExtraFunctions
/*! Random Vector2 */
inline Vector2 randomVector2(float max = 1.f)
{
return{ randomBinomial(max),randomBinomial(max) };
}
inline Vector2 randomVector2(float min, float max)
{
return{ randomFloat(min, max),randomFloat(min, max) };
}
/*! Orientation to a Vector2 */
inline Vector2 OrientationToVector(float orientation)
{
orientation -= static_cast<float>(E_PI_2);
return Vector2(cos(orientation), sin(orientation));
}
/*! Get orientation from an a velocity vector */
inline float GetOrientationFromVelocity(const Elite::Vector2& velocity)
{
if (velocity.Magnitude() == 0)
return 0.f;
return atan2f(velocity.x, -velocity.y);
}
#pragma endregion //ExtraFunctions
}
#endif | [
"[email protected]"
] | |
391dc6812fec5eecc4fd8e852fbdb4bf491cf3f6 | d4d433315840547d1996935b659e943da9dff2b9 | /itemNode.cpp | 2baef563ffbceb3ef6b5c75816b3fcb9ab852fcf | [] | no_license | Explicitname/linkedListsPractice | e7665de13d40e237be738e7de693fac258f50856 | 7f7b686aef0cb21cc0b37bbfd2232ec8f6d73911 | refs/heads/master | 2021-01-10T21:17:04.118126 | 2015-06-03T19:05:00 | 2015-06-03T19:05:00 | 35,291,372 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 358 | cpp | #include "itemNode.h"
using namespace std;
Item::Item(string n, double price, string type)
{
name = n;
typeOfItem = type;
priceOfItem = price;
next = 0;
previous = 0;
}
ostream& operator<<(ostream& os, const Item& c)
{
return os << "Name: " << c.name << endl << "Price: " << c.priceOfItem << endl << "Type of Item: " << c.typeOfItem << endl;
}
| [
"[email protected]"
] | |
72a72c85cc028dbb2bb7c736fc92d16a77af1c4d | 0c22d527c18df1f4edb90523f01e4a56cdf58606 | /NaoTH2011-light/Framework/NaoTH-Commons/Source/Tools/Math/PointList.h | 1e76eb045900a5db863766fcb6ff45c6e614f1a1 | [] | no_license | IntelligentRoboticsLab/DNT2013 | 3d9fdb1677858fe73006132cc47dda54b47ef165 | ddc47ce982fe9f9cfaf924902208df1d5e53a802 | refs/heads/master | 2020-04-09T06:04:30.577673 | 2013-12-11T13:39:12 | 2013-12-11T13:39:12 | 9,521,743 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,451 | h | /**
* @file PointList.h
*
* @author <a href="mailto:[email protected]">Heinrich Mellmann</a>
* Implementation of class PointList
*/
#ifndef __PointList_H_
#define __PointList_H_
#include "Tools/Math/Vector2.h"
#include "Tools/Debug/NaoTHAssert.h"
template<int MAX_NUMBER_OF_POINTS>
class PointList
{
public:
PointList() : length(0)
{
for(int i=0; i < MAX_NUMBER_OF_POINTS; i++)
{
points[i].x = 0;
points[i].y = 0;
}
};
Vector2<int> points[MAX_NUMBER_OF_POINTS]; /**< The points. */
int length; /**< The actual number of points. */
void add(const Vector2<int>& point)
{
if(length < MAX_NUMBER_OF_POINTS)
{
points[length++] = point;
}//end if
}//end add
void clear()
{
length = 0;
}//end clear
//removes a point from the list (this destroys any given order in the list)
void remove(int index)
{
if(index<length && index>=0)
{
points[index]=points[length-1];
length--;
}
}//end remove
//concatenates another list with the given one
void merge(const PointList& other)
{
for(int n=0; n<other.length; n++)
add(other[n]);
}//end merge
//returns the point in the list closest to the reference point
const Vector2<int>& getClosestPoint(const Vector2<int>& reference) const
{
//if(length==0) return null;
double minDistance=((Vector2<double>)(points[0]-reference)).abs();
int closest = 0;
for(int i = 1; i < length; i++)
{
double tmpDist = ((Vector2<double>)(points[i]-reference)).abs();
if(tmpDist < minDistance)
{
minDistance = tmpDist;
closest = i;
}
}//end for
return points[closest];
}//end getClosestPoint
//returns the mean point
Vector2<double> getMean() const
{
Vector2<double> mean;
for(int i = 0; i < length; i++)
{
mean += points[i];
}//end for
mean /= (double)length;
return mean;
}//end getMean
Vector2<int>& operator[] (int i) { ASSERT(i>=0&&i<MAX_NUMBER_OF_POINTS); return points[i]; }
const Vector2<int>& operator[] (int i) const { ASSERT(i>=0&&i<MAX_NUMBER_OF_POINTS); return points[i]; }
};//end class pointList
#endif // __PointList_H_
| [
"[email protected]"
] | |
d1a3747158f56ce75e82d77adec2c86b76ca614d | 18b88829acdecfef6378106edffb447d1cb9c66e | /dayz_code/configs/Category - Namalsk - Overwatch/explosives.hpp | 589d3b7540779432ca00944e05fc0a08193ba1b2 | [] | no_license | oiad/ZSC | a2b0631ef63926b58f2b2e39275c873ec5b150cf | b17541c540b8504019188289899796beff662415 | refs/heads/master | 2021-06-07T21:06:36.731705 | 2021-04-12T10:11:10 | 2021-04-12T10:11:10 | 82,430,546 | 5 | 23 | null | 2021-04-12T10:11:11 | 2017-02-19T02:42:56 | C++ | UTF-8 | C++ | false | false | 444 | hpp | class Category_529 {
class HandGrenade_west {
type = "trade_items";
buy[] = {4000,"worth"};
sell[] = {2000,"worth"};
};
class HandGrenade_east {
type = "trade_items";
buy[] = {4000,"worth"};
sell[] = {2000,"worth"};
};
class 1Rnd_HE_M203 {
type = "trade_items";
buy[] = {4000,"worth"};
sell[] = {2000,"worth"};
};
class 1Rnd_HE_GP25 {
type = "trade_items";
buy[] = {4000,"worth"};
sell[] = {2000,"worth"};
};
};
| [
"[email protected]"
] | |
98c50adba27148a4160c86468f1428cd3b2b1bb7 | 4fc495cc598bfdf263513a3bcd42192d047d805c | /libraries/MySensors/examples/RealTimeClockDisplaySensor/RealTimeClockDisplaySensor.ino | 48384034bcd1900fe8a9a1f766d3e9a4355fb9ca | [] | no_license | JosephEverhart/Arduino | 25f5750aa3187ffeac3db3dbd5992abc312a1b4e | bc7e24695d8c188d60ad192fd50c121e5b927c9e | refs/heads/development | 2021-01-17T08:17:16.374577 | 2016-06-02T10:29:11 | 2016-06-02T10:29:11 | 60,436,524 | 2 | 0 | null | 2016-06-05T00:38:50 | 2016-06-05T00:38:50 | null | UTF-8 | C++ | false | false | 4,045 | ino | /**
* The MySensors Arduino library handles the wireless radio link and protocol
* between your home built sensors/actuators and HA controller of choice.
* The sensors forms a self healing radio network with optional repeaters. Each
* repeater and gateway builds a routing tables in EEPROM which keeps track of the
* network topology allowing messages to be routed to nodes.
*
* Created by Henrik Ekblad <[email protected]>
* Copyright (C) 2013-2015 Sensnology AB
* Full contributor list: https://github.com/mysensors/Arduino/graphs/contributors
*
* Documentation: http://www.mysensors.org
* Support Forum: http://forum.mysensors.org
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* version 2 as published by the Free Software Foundation.
*
*******************************
*
* REVISION HISTORY
* Version 1.0 - Henrik Ekblad
*
* DESCRIPTION
* Example sketch showing how to request time from controller which is stored in RTC module
* The time and temperature (DS3231/DS3232) is shown on an attached Crystal LCD display
*
*
* Wiring (radio wiring on www.mysensors.org)
* ------------------------------------
* Arduino RTC-Module I2C Display
* ------------------------------------
* GND GND GND
* +5V VCC VCC
* A4 SDA SDA
* A5 SCL SCL
*
* http://www.mysensors.org/build/display
*
*/
// Enable debug prints to serial monitor
#define MY_DEBUG
// Enable and select radio type attached
#define MY_RADIO_NRF24
//#define MY_RADIO_RFM69
#include <SPI.h>
#include <MySensor.h>
#include <Time.h>
#include <DS3232RTC.h> // A DS3231/DS3232 library
#include <Wire.h>
#include <LiquidCrystal_I2C.h>
boolean timeReceived = false;
unsigned long lastUpdate=0, lastRequest=0;
// Initialize display. Google the correct settings for your display.
// The follwoing setting should work for the recommended display in the MySensors "shop".
LiquidCrystal_I2C lcd(0x27, 2, 1, 0, 4, 5, 6, 7, 3, POSITIVE);
void setup()
{
// the function to get the time from the RTC
setSyncProvider(RTC.get);
// Request latest time from controller at startup
requestTime();
// initialize the lcd for 16 chars 2 lines and turn on backlight
lcd.begin(16,2);
}
void presentation() {
// Send the sketch version information to the gateway and Controller
sendSketchInfo("RTC Clock", "1.0");
}
// This is called when a new time value was received
void receiveTime(unsigned long controllerTime) {
// Ok, set incoming time
Serial.print("Time value received: ");
Serial.println(controllerTime);
RTC.set(controllerTime); // this sets the RTC to the time from controller - which we do want periodically
timeReceived = true;
}
void loop()
{
unsigned long now = millis();
// If no time has been received yet, request it every 10 second from controller
// When time has been received, request update every hour
if ((!timeReceived && (now-lastRequest) > (10UL*1000UL))
|| (timeReceived && (now-lastRequest) > (60UL*1000UL*60UL))) {
// Request time from controller.
Serial.println("requesting time");
requestTime();
lastRequest = now;
}
// Update display every second
if (now-lastUpdate > 1000) {
updateDisplay();
lastUpdate = now;
}
}
void updateDisplay(){
tmElements_t tm;
RTC.read(tm);
// Print date and time
lcd.home();
lcd.print(tm.Day);
lcd.print("/");
lcd.print(tm.Month);
// lcd.print(" ");
// lcd.print(tmYearToCalendar(tm.Year)-2000);
lcd.print(" ");
printDigits(tm.Hour);
lcd.print(":");
printDigits(tm.Minute);
lcd.print(":");
printDigits(tm.Second);
// Go to next line and print temperature
lcd.setCursor ( 0, 1 );
lcd.print("Temp: ");
lcd.print(RTC.temperature()/4);
lcd.write(223); // Degree-sign
lcd.print("C");
}
void printDigits(int digits){
if(digits < 10)
lcd.print('0');
lcd.print(digits);
}
| [
"[email protected]"
] | |
99f1a03b829d8990987608646be6a9cd7e3dca6b | 17cf171c8539ffd469a9fd27ca594c31c994749d | /Lis3/Lis3/strings.cpp | e2025858fe8a952bf81976abbdc552c0fad61a13 | [] | no_license | zj614android/c-c- | c7be544aca28e54545a8fa9d7ad6b4941877d887 | 815080171206b8ba71e6bd05fb116219a93b38db | refs/heads/master | 2020-03-18T21:02:14.578353 | 2018-06-05T06:52:06 | 2018-06-05T06:52:06 | 135,254,736 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,429 | cpp | #include<iostream>
#include <cstring>
#include <string>
using namespace std;
void main() {
cout << "*********************C风格***********************" << endl;
//形态1：char greeting[6]
char greeting[6] = { 'H', 'e', 'l', 'l', 'o', '\0' };
cout << "Greeting message:";
cout << greeting << endl;
//输出：Greeting message: Hello
cout << "--------------------------------------------------" << endl;
//下边这几个则依赖新的头文件：#include <cstring>
//api参考：http://www.runoob.com/cplusplus/cpp-strings.html
char str1[11] = "Hello";
char str2[11] = "World";
char str3[11];
int len;
// 复制 str1 到 str3
strcpy(str3, str1);
cout << "strcpy( str3, str1) : " << str3 << endl;
// 连接 str1 和 str2
strcat(str1, str2);
cout << "strcat( str1, str2): " << str1 << endl;
// 连接后，str1 的总长度
len = strlen(str1);
cout << "strlen(str1) : " << len << endl;
cout << "*********************C++风格***********************" << endl;
//依赖新的头文件 #include <string>
string string1 = "Hello";
string string2 = "World";
string string3;
int length;
// 复制 str1 到 str3
string3 = string1;
cout << "str3 : " << string3 << endl;
// 连接 str1 和 str2
string3 = string1 + string2;
cout << "str1 + str2 : " << str3 << endl;
// 连接后，str3 的总长度
length = string3.size();
cout << "str3.size() : " << length << endl;
getchar();
} | [
"[email protected]"
] | |
8a889a484006dd4944354cc393fbcfdad5ea5f2e | 097a8d328ffaa2cf38d201716a7ed5a9fb862e97 | /Gyrocam/Gyrocam/YorkUrbanDbTester.cpp | 15ff4bc703fb2e0ad5174c39e69ceb3ee948b01f | [] | no_license | pkuderov/gyrocam | 4094f0023c8f4aeb9d92d9826d487c7f700e7947 | e0ef99ebc75437d54556f524d93bfc8ff34f6621 | refs/heads/master | 2021-01-10T06:15:38.968284 | 2015-06-15T02:49:01 | 2015-06-15T02:49:01 | 36,031,292 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,672 | cpp | #include "YorkUrbanDbTester.h"
#include "IoProvider.h"
#include "ImageProcessor.h"
#include "Shared.h"
#include <iostream>
#include <fstream>
namespace gyrocam
{
YorkUrbanDbTester::YorkUrbanDbTester(const YorkUrbanDbTestRunConfig &config, const Settings &settings)
{
this->config = config;
this->settings = settings;
}
void YorkUrbanDbTester::run(int k)
{
std::vector<std::string> imageNames = extractListFromFile(config.getImageNamesListPath());
int n = imageNames.size();
std::cout << "n: " << n << std::endl;
//n = 10;
if (n == 0)
return;
std::ofstream globalReport(config.getOutputGlobalReportPath());
SingleRunConfig singleRunConfig(
config.getSingleRunImagePath(config.getSingleRunBasePath(imageNames[0])),
config.getCalibrationMatrixPath()
);
ImageProcessor imageProcessor(singleRunConfig, settings);
cv::Mat vpError = cv::Mat::zeros(n, 3, CV_64FC1);
cv::Mat vpErrorMean = cv::Mat::zeros(1, 3, CV_64FC1), vpErrorStd = cv::Mat::zeros(1, 3, CV_64FC1);
double elapsedTime = 0;
for (int i = 0; i < n; i++)
{
std::string basePath = config.getSingleRunBasePath(imageNames[i]);
SingleRunConfig singleRunConfig(config.getSingleRunImagePath(basePath), config.getCalibrationMatrixPath());
imageProcessor.loadConfig(singleRunConfig);
cv::Mat groundTruthVpOrthoBasis = readVpBasis(config.getSingleRunOrthogonalGroundTruthPath(basePath));
//cout << singleRunResult.orthoVpBasis << std::endl;
groundTruthVpOrthoBasis.row(1) = -1 * groundTruthVpOrthoBasis.row(1);
reorderColumn(groundTruthVpOrthoBasis, 1);
reorderColumn(groundTruthVpOrthoBasis, 0);
reorderColumn(groundTruthVpOrthoBasis);
cv::Mat localVpError = cv::Mat::zeros(k, 3, CV_64FC1), localVpErrorMean = cv::Mat::zeros(1, 3, CV_64FC1), localVpErrorStd = cv::Mat::zeros(1, 3, CV_64FC1);
for (int ii = 0; ii < k; ii++)
{
SingleRunResult singleRunResult = imageProcessor.process();
elapsedTime += singleRunResult.runTime;
cv::Mat gtvpT = groundTruthVpOrthoBasis.t();
bool needSwap = angleBetweenAbs(gtvpT.row(0), singleRunResult.orthoVpBasis.col(0)) > angleBetweenAbs(gtvpT.row(2), singleRunResult.orthoVpBasis.col(0));
if (needSwap)
{
swapColumns(groundTruthVpOrthoBasis, 0, 2);
gtvpT = groundTruthVpOrthoBasis.t();
}
for (int j = 0; j < 3; j++)
localVpError.at<double>(ii, j) = angleBetweenAbs(gtvpT.row(j), singleRunResult.orthoVpBasis.col(j));
localVpErrorMean += localVpError.row(ii);
}
localVpErrorMean /= k;
vpError.row(i) += localVpErrorMean;
vpErrorMean += localVpErrorMean;
if (k > 1)
{
for (int ii = 0; ii < k; ii++)
{
cv::Mat t = localVpError.row(ii) - localVpErrorMean;
for (int j = 0; j < 3; j++)
{
double tt = t.at<double>(0, j);
localVpErrorStd.at<double>(0, j) += tt * tt;
}
}
for (int j = 0; j < 3; j++)
localVpErrorStd.at<double>(0, j) = sqrt(localVpErrorStd.at<double>(0, j))/(k - 1);
vpErrorStd += localVpErrorStd;
}
std::ofstream localCompare(config.getOutputSingleReportPath(basePath));
localCompare << vpError.row(i) << std::endl;
localCompare.flush();
localCompare.close();
globalReport << imageNames[i] << ": " << vpError.row(i) << std::endl;
std::cout << i << std::endl;
}
vpErrorMean /= n;
globalReport << "err mean = " << vpErrorMean << std::endl;
vpErrorStd /= n;
globalReport << "err std = " << vpErrorStd << std::endl;
globalReport.flush();
globalReport.close();
elapsedTime /= k;
elapsedTime /= 1000;
std::cout << "elapsed = " << elapsedTime << "; fps = " << n / elapsedTime << std::endl;
}
} | [
"[email protected]"
] | |
777c99f81a3aa7c8c66164aa630ef7a97eb32c8c | 6d5db68fe2e912f7f18dfddcf73955a042f32475 | /project4-15/codebase/rm/rmtest_01.cc | c8b401bf3319be3deb82639fecd82f3b12d23acc | [] | no_license | DanielThurau/Database-System-II | 9d33341d37f71324bd63b29571a1b53e12346af1 | 42ab3c9d84cc100a7606d099924dcfb9c32bb8dc | refs/heads/master | 2020-03-09T21:07:59.720033 | 2018-06-12T18:44:10 | 2018-06-12T18:44:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,278 | cc | #include "rm_test_util.h"
RC TEST_RM_1(const string &tableName, const int nameLength, const string &name, const int age, const float height, const int salary)
{
// Functions tested
// 1. Insert Tuple **
// 2. Read Tuple **
// NOTE: "**" signifies the new functions being tested in this test case.
cout << endl << "***** In RM Test Case 1 *****" << endl;
RID rid;
int tupleSize = 0;
void *tuple = malloc(200);
void *returnedData = malloc(200);
vector<Attribute> attrs;
RC rc = rm->getAttributes(tableName, attrs);
assert(rc == success && "RelationManager::getAttributes() should not fail.");
// Initialize a NULL field indicator
int nullAttributesIndicatorActualSize = getActualByteForNullsIndicator(attrs.size());
unsigned char *nullsIndicator = (unsigned char *) malloc(nullAttributesIndicatorActualSize);
memset(nullsIndicator, 0, nullAttributesIndicatorActualSize);
// Insert a tuple into a table
prepareTuple(attrs.size(), nullsIndicator, nameLength, name, age, height, salary, tuple, &tupleSize);
cout << "The tuple to be inserted:" << endl;
rc = rm->printTuple(attrs, tuple);
cout << endl;
rc = rm->insertTuple(tableName, tuple, rid);
assert(rc == success && "RelationManager::insertTuple() should not fail.");
// Given the rid, read the tuple from table
rc = rm->readTuple(tableName, rid, returnedData);
assert(rc == success && "RelationManager::readTuple() should not fail.");
cout << "The returned tuple:" << endl;
rc = rm->printTuple(attrs, returnedData);
cout << endl;
// Compare whether the two memory blocks are the same
if(memcmp(tuple, returnedData, tupleSize) == 0)
{
cout << "**** RM Test Case 1 finished. The result will be examined. *****" << endl << endl;
free(tuple);
free(returnedData);
return success;
}
else
{
cout << "**** [FAIL] RM Test Case 1 failed *****" << endl << endl;
free(tuple);
free(returnedData);
return -1;
}
}
int main()
{
// Insert/Read Tuple
RC rcmain = TEST_RM_1("tbl_employee", 8, "Anteater", 27, 6.2, 10000);
return rcmain;
}
| [
"[email protected]"
] | |
3ac24e5a67dbb302f9136058a1df571f2e5d27e1 | 90047daeb462598a924d76ddf4288e832e86417c | /ui/ozone/common/display_mode_proxy.cc | e1f34470255670d3026254e749142ce3a818b20e | [
"BSD-3-Clause"
] | permissive | massbrowser/android | 99b8c21fa4552a13c06bbedd0f9c88dd4a4ad080 | a9c4371682c9443d6e1d66005d4db61a24a9617c | refs/heads/master | 2022-11-04T21:15:50.656802 | 2017-06-08T12:31:39 | 2017-06-08T12:31:39 | 93,747,579 | 2 | 2 | BSD-3-Clause | 2022-10-31T10:34:25 | 2017-06-08T12:36:07 | null | UTF-8 | C++ | false | false | 926 | cc | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/memory/ptr_util.h"
#include "ui/ozone/common/display_mode_proxy.h"
#include "ui/ozone/common/gpu/ozone_gpu_message_params.h"
namespace ui {
DisplayModeProxy::DisplayModeProxy(const DisplayMode_Params& params)
: DisplayMode(params.size, params.is_interlaced, params.refresh_rate) {
}
DisplayModeProxy::DisplayModeProxy(const gfx::Size& size,
bool interlaced,
float refresh_rate)
: DisplayMode(size, interlaced, refresh_rate) {}
DisplayModeProxy::~DisplayModeProxy() {
}
std::unique_ptr<display::DisplayMode> DisplayModeProxy::Clone() const {
return base::WrapUnique(
new DisplayModeProxy(size(), is_interlaced(), refresh_rate()));
}
} // namespace ui
| [
"[email protected]"
] | |
844c84a209db311d9de9d0e5f74f9949e73eb2fc | 970d2a538cb243f4fffac5ad4b2a585f28f7de55 | /FifteenCoursework/FifteenCoursework/FifteenCoursework.cpp | 38fdc30e75f043642bcbb4f6dc33629a7d007558 | [] | no_license | djtodd709/FifteenCoursework | 789b323fce3197de955768791064567c28e4aabb | 388ac94e73c72fd044c126472d4f5ec5c7e686d6 | refs/heads/master | 2022-04-04T09:09:59.908313 | 2020-02-12T20:47:20 | 2020-02-12T20:47:20 | 214,429,153 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,525 | cpp | // FifteenCoursework.cpp : This file contains the 'main' function. Program execution begins and ends there.
// Code by Dave Todd - b9052651
#pragma once
#include <fstream>
#include <string>
#include <sstream>
#include <algorithm>
#include <time.h>
#include <thread>
#include <mutex>
#include "Puzzle.h"
using namespace std;
void getInputNum(int& x, int min, int max) {
bool passed = false;
while (!passed) {
cin >> x;
if (!cin) {
cin.clear();
cin.ignore(INT_MAX, '\n');
cout << "That's not a valid number: ";
continue;
}
if (!(cin.peek() == '\n')) {
cin.clear();
cin.ignore(INT_MAX, '\n');
cout << "That's not a valid number: ";
continue;
}
if ((x > max) | (x < min)) {
cin.clear();
cin.ignore(INT_MAX, '\n');
cout << x << " is not within the allowed number range: ";
continue;
}
passed = true;
}
}
void fillPuzzle(Puzzle*& p) {
system("CLS");
cout << "Manually Create Configuration" << endl;
cout << *p;
int x;
cout << "Please enter a number for the next tile: ";
getInputNum(x, 1, p->getNumLimit());
while (p->isTilePresent(x)) {
cout << x << " is already present in the square: ";
getInputNum(x, 1, p->getNumLimit());
}
p->setNextTile(x);
}
void extractRow(int* const & row, string line) {
stringstream ss(line);
int index = 0;
for (int i = 0; ss >> i;) {
row[index] = i;
index++;
}
}
Puzzle** openFile(int& numPuzzles) {
string line;
ifstream infile("15-File.txt");
if (!infile) {
cout << "Could not open the 15-file. Make sure a 15-file already exists." << endl;
return NULL;
}
getline(infile, line);
numPuzzles = stoi(line);
Puzzle** puzzleList = new Puzzle * [numPuzzles];
for (int i = 0; i < numPuzzles; i++) {
getline(infile, line);
int rowSize = count(line.begin(), line.end(), '\t');
int squareSize = rowSize * rowSize - 1;
if (squareSize < 8) {
return NULL;
}
int* square = new int[squareSize];
extractRow(square, line);
for (int j = 1; j < rowSize; j++) {
getline(infile, line);
extractRow(square+(j*rowSize), line);
}
Puzzle* p = new Puzzle(square, rowSize);
puzzleList[i] = p;
getline(infile, line);
}
infile.close();
return puzzleList;
}
void outputAnalysis(ostream& dest, Puzzle** pList, int numPuzzles, int partialSize, bool freeSquare) {
dest << numPuzzles << endl;
for (int i = 0; i < numPuzzles; i++) {
Puzzle* p = pList[i];
dest << *p;
int prefix;
int suffix;
p->getAnswerFacForm(prefix, suffix, partialSize, freeSquare);
dest << "Number of " << partialSize << "-partial continuous rows/columns, for all valid turns" << endl;
if (prefix > 0) {
if (prefix % 2 == 1) {
dest << "row = " << prefix / 2 << ".5 x " << suffix << "!" << endl;
dest << "column = " << prefix / 2 << ".5 x " << suffix << "!" << endl;
dest << "reverse row = " << prefix / 2 << ".5 x " << suffix << "!" << endl;
dest << "reverse column = " << prefix / 2 << ".5 x " << suffix << "!" << endl;
}
else {
dest << "row = " << prefix / 2 << " x " << suffix << "!" << endl;
dest << "column = " << prefix / 2 << " x " << suffix << "!" << endl;
dest << "reverse row = " << prefix / 2 << " x " << suffix << "!" << endl;
dest << "reverse column = " << prefix / 2 << " x " << suffix << "!" << endl;
}
}
else {
dest << "row = 0" << endl;
dest << "column = 0" << endl;
dest << "reverse row = 0" << endl;
dest << "reverse column = 0" << endl;
}
dest << "Total for row & column, including reverse, in this configuration" << endl;
for (int j = 2; j <= p->getRowSize(); j++) {
dest << j << " = " << p->rowConsecs(false, j) + p->colConsecs(false, j) + p->rowConsecs(true, j) + p->colConsecs(true, j) << endl;
}
dest << "Total for row & column, including reverse, for all valid turns" << endl;
for (int j = 2; j <= p->getRowSize(); j++) {
p->getAnswerFacForm(prefix, suffix, j, false);
dest << j << " = " << prefix * 2 << " x " << suffix << "!" << endl;
}
p->getAnswerFacForm(prefix, suffix, p->getRowSize(), true);
dest << p->getRowSize() << "(free square included) = " << prefix * 2 << " x " << suffix << "!" << endl;
dest << endl;
delete p;
p = NULL;
}
}
void saveSolution(int partialSize, bool freeSquare) {
ofstream outfile("Solution-File.txt");
if (!outfile) {
cout << "Could not open the solution-file." << endl;
return;
}
int numPuzzles;
Puzzle** pList = openFile(numPuzzles);
outputAnalysis(outfile, pList, numPuzzles, partialSize, freeSquare);
delete[] pList;
pList = NULL;
outfile.close();
}
void overwriteFile(Puzzle** puzzleList, int numPuzzles) {
ofstream outfile("15-File.txt");
if (!outfile) {
cout << "Could not open the 15-file." << endl;
return;
}
outfile << numPuzzles << endl;
for (int i = 0; i < numPuzzles; i++) {
outfile << *(puzzleList[i]) << endl;
}
outfile.close();
}
void appendFile(Puzzle** puzzleList, int numPuzzles) {
int oldNumPuzzles;
Puzzle** oldPuzzleList = openFile(oldNumPuzzles);
if (oldPuzzleList == NULL) {
cout << "Could not find the 15-file. Creating new 15-File..." << endl;
overwriteFile(puzzleList, numPuzzles);
return;
}
ofstream outfile("15-File.txt");
if (!outfile) {
cout << "Could not open the 15-file." << endl;
return;
}
int newNumPuzzles = numPuzzles + oldNumPuzzles;
outfile << newNumPuzzles << endl;
for (int i = 0; i < oldNumPuzzles; i++) {
Puzzle* p = oldPuzzleList[i];
outfile << *p << endl;
delete p;
p = NULL;
}
delete[] oldPuzzleList;
oldPuzzleList = NULL;
for (int i = 0; i < numPuzzles; i++) {
outfile << *(puzzleList[i]) << endl;
}
outfile.close();
}
void fileChoice(Puzzle** puzzleList, int numPuzzles) {
int choice;
getInputNum(choice, 1, 3);
switch (choice) {
case 1:
overwriteFile(puzzleList, numPuzzles);
system("CLS");
cout << "15-File successfully overwritten" << endl << endl;
break;
case 2:
appendFile(puzzleList, numPuzzles);
system("CLS");
cout << "15-File successfully appended" << endl << endl;
break;
case 3:
system("CLS");
cout << "Nothing has been added to the 15-File" << endl << endl;
break;
}
}
void makeManualPuzzle() {
cout << "How many rows/columns will your puzzle have?: ";
int psize = 4;
getInputNum(psize, 3, INT_MAX);
Puzzle* p = new Puzzle(psize);
while (!p->isFull()) {
fillPuzzle(p);
}
system("CLS");
cout << "Manually Create Configuration" << endl;
cout << *p;
cout << endl << "(1) Overite 15-File" << endl;
cout << "(2) Append to 15-File" << endl;
cout << "(3) Do not add to 15-File" << endl;
cout << "What would you like to do with this configuration?: ";
fileChoice(&p,1);
delete p;
p = NULL;
}
struct threadPack {
int rows;
int index;
Puzzle** randPuzzles;
mutex* mm;
};
void addRandPuzzle(threadPack tp) {
Puzzle* p = new RandomPuzzle(tp.rows);
lock_guard<mutex>guard(*(tp.mm));
tp.randPuzzles[tp.index] = p;
}
void makeRandomPuzzle() {
system("CLS");
cout << "Generate Random Configurations" << endl;
cout << "How many rows/columns will your puzzles have?: ";
int psize = 4;
getInputNum(psize, 3, INT_MAX);
cout << "How many configurations would you like to generate?: " << endl;
int numPuzzles;
getInputNum(numPuzzles, 1, INT_MAX);
cout << "(1) Yes" << endl;
cout << "(2) No" << endl;
cout << "Would you like to see the puzzles after generation?: " << endl;
int showChoice;
getInputNum(showChoice, 1, INT_MAX);
clock_t timer = clock();
Puzzle** randPuzzles = new Puzzle*[numPuzzles];
if (psize <= 500) {
for (int i = 0; i < numPuzzles; i++) {
Puzzle* p = new RandomPuzzle(psize);
if (showChoice == 1)
cout << *p << endl;
randPuzzles[i] = p;
}
}
else {
thread* t = new thread[numPuzzles];
mutex mMutex;
for (int i = 0; i < numPuzzles; i++) {
threadPack tp;
tp.index = i;
tp.mm = &mMutex;
tp.randPuzzles = randPuzzles;
tp.rows = psize;
t[i] = thread(addRandPuzzle, tp);
}
for (int i = 0; i < numPuzzles; i++) {
t[i].join();
if (showChoice == 1)
cout << *randPuzzles[i] << endl;
}
delete[] t;
t = NULL;
}
double diff = double(clock() - timer) / double(CLOCKS_PER_SEC);
cout << "Generation finished in " << diff << " seconds" << endl;
cout << endl << "(1) Overite 15-File" << endl;
cout << "(2) Append to 15-File" << endl;
cout << "(3) Do not add to 15-File" << endl;
cout << "What would you like to do with this configuration set?: ";
fileChoice(randPuzzles,numPuzzles);
for (int i = 0; i < numPuzzles; i++) {
delete randPuzzles[i];
randPuzzles[i] = NULL;
}
delete [] randPuzzles;
randPuzzles = NULL;
}
void readPuzzles() {
system("CLS");
int numPuzzles;
Puzzle** pList = openFile(numPuzzles);
if (pList == NULL) {
cout << "You do not currently have a 15-File, or the file is invalid." << endl;
cout << "Please create a valid file using the other menu options first." << endl << endl;
return;
}
bool freeSquare = true;
cout << "What partial size would you like to use?: ";
int partialSize;
getInputNum(partialSize, 2, INT_MAX);
cout << "(1)\tInclude rows/columns with the free square" << endl;
cout << "(2)\tIgnore rows/columns with the free square" << endl;
cout << "What would you like to do in the case of " << partialSize << "x" << partialSize <<" puzzles?: ";
int x;
getInputNum(x, 1, 2);
switch (x) {
case 1:
freeSquare = true;
break;
case 2:
freeSquare = false;
break;
}
cout << "Your current 15-File:" << endl;
outputAnalysis(cout, pList, numPuzzles, partialSize, freeSquare);
delete[] pList;
pList = NULL;
cout << "(1)\tSave these calculations in the solution file" << endl;
cout << "(2)\tIgnore these calculations and return to the main menu" << endl;
cout << "What would you like to do?: ";
int y;
getInputNum(y, 1, 2);
switch (y) {
case 1:
saveSolution(partialSize,freeSquare);
system("CLS");
cout << "Solution file saved succesfully" << endl;
break;
case 2:
system("CLS");
break;
}
}
int main()
{
bool exit = false;
while (true) {
cout << "(1)\tManually create configuration" << endl;
cout << "(2)\tGenerate random configurations" << endl;
cout << "(3)\tCalculate continuous rows/columns from a 15-file" << endl;
cout << "(4)\tExit program" << endl;
cout << "What would you like to do?: ";
int x;
getInputNum(x, 1, 4);
switch (x) {
case 1:
makeManualPuzzle();
break;
case 2:
makeRandomPuzzle();
break;
case 3:
readPuzzles();
break;
case 4:
exit = true;
break;
}
if (exit)
break;
}
}
| [
"[email protected]"
] | |
29a690f5f553a4d533714af19e9c89643460dad1 | 7e1b1c5f2f3a40f6499b8d5d7b49bc722d2a1917 | /lib/IR/IREval.cpp | a50e3a47530ab1a1b64a2297ab149e7f84469cff | [
"MIT"
] | permissive | joshbedo/hermes | b2d6b0f6c5abaeff94190a2f7b343c0772d9df14 | cda1b533fcda1da28800c05878d27b920364b57d | refs/heads/master | 2022-12-18T18:15:44.266618 | 2020-09-22T18:35:45 | 2020-09-22T18:37:18 | 297,771,133 | 1 | 0 | MIT | 2020-09-22T21:00:35 | 2020-09-22T21:00:34 | null | UTF-8 | C++ | false | false | 21,660 | cpp | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "hermes/IR/IREval.h"
#include "hermes/IR/IRBuilder.h"
#include "hermes/Support/Math.h"
#include "llvh/ADT/SmallString.h"
using namespace hermes;
using llvh::isa;
using llvh::SmallString;
namespace {
/// \returns true when the types \p A and \p B prove that the instances can't
/// be strictly equal.
bool disjointComparisonTypes(Type A, Type B) {
if (!A.isPrimitive() || !B.isPrimitive())
return false;
// Check if types are disjoint.
return Type::intersectTy(A, B).isEmptyTy();
}
bool isNaN(Literal *lit) {
if (auto *number = llvh::dyn_cast<LiteralNumber>(lit)) {
return std::isnan(number->getValue());
}
return false;
}
enum class NumericOrder { LessThan, Equal, GreaterThan, Unordered };
/// \returns the numeric ordering of two values.
llvh::Optional<NumericOrder> getNumericOrder(Literal *LHS, Literal *RHS) {
auto *L = llvh::dyn_cast<LiteralNumber>(LHS);
auto *R = llvh::dyn_cast<LiteralNumber>(RHS);
if (!L || !R)
return llvh::None;
double l = L->getValue();
double r = R->getValue();
if (l < r)
return NumericOrder::LessThan;
if (l > r)
return NumericOrder::GreaterThan;
if (std::isnan(l) || std::isnan(r))
return NumericOrder::Unordered;
return NumericOrder::Equal;
}
SmallString<256> buildString(const StringRef &a, const StringRef &b) {
SmallString<256> result;
result.append(a);
result.append(b);
return result;
}
} // namespace
Literal *hermes::evalUnaryOperator(
UnaryOperatorInst::OpKind kind,
IRBuilder &builder,
Literal *operand) {
switch (kind) {
case UnaryOperatorInst::OpKind::MinusKind:
// Negate constant integers.
switch (operand->getKind()) {
case ValueKind::LiteralNumberKind:
if (auto *literalNum = llvh::dyn_cast<LiteralNumber>(operand)) {
auto V = -literalNum->getValue();
return builder.getLiteralNumber(V);
}
break;
case ValueKind::LiteralUndefinedKind:
return builder.getLiteralNaN();
case ValueKind::LiteralBoolKind:
if (evalIsTrue(builder, operand)) {
return builder.getLiteralNumber(-1);
} else { // evalIsFalse(operand)
return builder.getLiteralNegativeZero();
}
case ValueKind::LiteralNullKind:
return builder.getLiteralNegativeZero();
default:
break;
}
break;
case UnaryOperatorInst::OpKind::TypeofKind:
switch (operand->getKind()) {
case ValueKind::GlobalObjectKind:
case ValueKind::LiteralNullKind:
return builder.getLiteralString("object");
case ValueKind::LiteralUndefinedKind:
return builder.getLiteralString("undefined");
case ValueKind::LiteralBoolKind:
return builder.getLiteralString("boolean");
case ValueKind::LiteralNumberKind:
return builder.getLiteralString("number");
case ValueKind::LiteralStringKind:
return builder.getLiteralString("string");
default:
llvm_unreachable("Invalid literal kind.");
}
break;
case UnaryOperatorInst::OpKind::BangKind:
if (evalIsTrue(builder, operand)) {
return builder.getLiteralBool(false);
}
if (evalIsFalse(builder, operand)) {
return builder.getLiteralBool(true);
}
break;
case UnaryOperatorInst::OpKind::VoidKind:
return builder.getLiteralUndefined();
default:
break;
}
return nullptr;
}
Literal *hermes::evalBinaryOperator(
BinaryOperatorInst::OpKind kind,
IRBuilder &builder,
Literal *lhs,
Literal *rhs) LLVM_NO_SANITIZE("float-divide-by-zero");
Literal *hermes::evalBinaryOperator(
BinaryOperatorInst::OpKind kind,
IRBuilder &builder,
Literal *lhs,
Literal *rhs) {
Type leftTy = lhs->getType();
Type rightTy = rhs->getType();
auto *leftLiteralNum = llvh::dyn_cast<LiteralNumber>(lhs);
auto *rightLiteralNum = llvh::dyn_cast<LiteralNumber>(rhs);
auto *leftNull = llvh::dyn_cast<LiteralNull>(lhs);
auto *rightNull = llvh::dyn_cast<LiteralNull>(rhs);
auto *leftUndef = llvh::dyn_cast<LiteralUndefined>(lhs);
auto *rightUndef = llvh::dyn_cast<LiteralUndefined>(rhs);
auto *leftStr = llvh::dyn_cast<LiteralString>(lhs);
auto *rightStr = llvh::dyn_cast<LiteralString>(rhs);
auto leftNaN = isNaN(lhs);
auto rightNaN = isNaN(rhs);
auto &ctx = builder.getModule()->getContext();
using OpKind = BinaryOperatorInst::OpKind;
if (leftNaN || rightNaN) {
switch (kind) {
case OpKind::EqualKind:
case OpKind::StrictlyEqualKind:
case OpKind::LessThanKind:
case OpKind::LessThanOrEqualKind:
case OpKind::GreaterThanKind:
case OpKind::GreaterThanOrEqualKind:
// Equality and order comparisons with NaN always evaluate to false,
// even in cases like 'NaN == NaN' or 'NaN <= NaN'
return builder.getLiteralBool(false);
case OpKind::NotEqualKind:
case OpKind::StrictlyNotEqualKind:
// Inequality comparisons with NaN always evaluate to true, even in
// cases like 'NaN != NaN' or 'NaN !== NaN'
return builder.getLiteralBool(true);
case OpKind::LeftShiftKind:
case OpKind::RightShiftKind:
case OpKind::UnsignedRightShiftKind:
// The code for bitwise shift operators below properly handles
// NaN, so we break out of the switch and go through to there
break;
case OpKind::AddKind:
// If we're trying to add NaN with a string, then we need to perform
// string concatenation with "NaN" and the string operand
if (leftStr) {
SmallString<256> result =
buildString(ctx.toString(leftStr->getValue()), "NaN");
return builder.getLiteralString(result.str());
}
if (rightStr) {
SmallString<256> result =
buildString("NaN", ctx.toString(rightStr->getValue()));
return builder.getLiteralString(result.str());
}
// None of the operands are strings, so the expression evaluates
// to NaN
return builder.getLiteralNaN();
case OpKind::SubtractKind:
case OpKind::MultiplyKind:
case OpKind::DivideKind:
case OpKind::ModuloKind:
// Binary arithmetic operations involving NaN evaluate to NaN
return builder.getLiteralNaN();
case OpKind::OrKind:
case OpKind::XorKind:
case OpKind::AndKind:
// The code for bitwise logical operators below properly handles
// NaN, so we break out of the switch and go through to there
break;
default:
// All handling of NaN is done is the current block. The rest of this
// code assumes the literals are not NaN (except for bitwise shifts and
// logical ops), so we break out of the function here, giving up on
// finding a compile-time literal representation of the result.
return nullptr;
}
}
auto numericOrder = getNumericOrder(lhs, rhs);
switch (kind) {
case OpKind::EqualKind: // ==
// Identical literals must be equal.
if (lhs == rhs) {
return builder.getLiteralBool(true);
}
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(false);
case NumericOrder::Equal:
return builder.getLiteralBool(true);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(false);
case NumericOrder::Unordered:
break;
}
}
// Handle string equality:
if (leftStr && rightStr) {
return builder.getLiteralBool(
leftStr->getValue() == rightStr->getValue());
}
break;
case OpKind::NotEqualKind: // !=
// Identical operands can't be non-equal.
if (lhs == rhs) {
return builder.getLiteralBool(false);
}
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(true);
case NumericOrder::Equal:
return builder.getLiteralBool(false);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(true);
case NumericOrder::Unordered:
break;
}
}
// Handle string equality:
if (leftStr && rightStr) {
return builder.getLiteralBool(
leftStr->getValue() != rightStr->getValue());
}
break;
case OpKind::StrictlyEqualKind: // ===
// Identical literals must be equal.
if (lhs == rhs) {
return builder.getLiteralBool(true);
}
// Operands of different types can't be strictly equal.
if (disjointComparisonTypes(leftTy, rightTy))
return builder.getLiteralBool(false);
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(false);
case NumericOrder::Equal:
return builder.getLiteralBool(true);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(false);
case NumericOrder::Unordered:
break;
}
}
// Handle string equality:
if (leftStr && rightStr) {
return builder.getLiteralBool(
leftStr->getValue() == rightStr->getValue());
}
break;
case OpKind::StrictlyNotEqualKind: // !===
// Identical operands can't be non-equal.
if (lhs == rhs) {
return builder.getLiteralBool(false);
}
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(true);
case NumericOrder::Equal:
return builder.getLiteralBool(false);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(true);
case NumericOrder::Unordered:
break;
}
}
// Handle string equality:
if (leftStr && rightStr) {
return builder.getLiteralBool(
leftStr->getValue() != rightStr->getValue());
}
break;
case OpKind::LessThanKind: // <
// Handle comparison to self:
if (!leftTy.isUndefinedType() && lhs == rhs)
return builder.getLiteralBool(false);
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(true);
case NumericOrder::Equal:
return builder.getLiteralBool(false);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(false);
case NumericOrder::Unordered:
break;
}
}
break;
case OpKind::LessThanOrEqualKind: // <=
// Handle comparison to self:
if (!leftTy.isUndefinedType() && lhs == rhs)
return builder.getLiteralBool(true);
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(true);
case NumericOrder::Equal:
return builder.getLiteralBool(true);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(false);
case NumericOrder::Unordered:
break;
}
}
break;
case OpKind::GreaterThanKind: // >
// Handle comparison to self:
if (!leftTy.isUndefinedType() && lhs == rhs)
return builder.getLiteralBool(false);
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(false);
case NumericOrder::Equal:
return builder.getLiteralBool(false);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(true);
case NumericOrder::Unordered:
break;
}
}
break;
case OpKind::GreaterThanOrEqualKind: // >=
// Handle comparison to self:
if (!leftTy.isUndefinedType() && lhs == rhs)
return builder.getLiteralBool(true);
// Handle numeric comparisons:
if (numericOrder.hasValue()) {
switch (numericOrder.getValue()) {
case NumericOrder::LessThan:
return builder.getLiteralBool(false);
case NumericOrder::Equal:
return builder.getLiteralBool(true);
case NumericOrder::GreaterThan:
return builder.getLiteralBool(true);
case NumericOrder::Unordered:
break;
}
}
break;
case OpKind::LeftShiftKind: // << (<<=)
case OpKind::RightShiftKind: // >> (>>=)
case OpKind::UnsignedRightShiftKind: { // >>> (>>>=)
// Convert both operands to literal numbers if they can be.
auto *lnum = evalToNumber(builder, lhs);
auto *rnum = evalToNumber(builder, rhs);
if (!lnum || !rnum) {
// Can't be converted to a literal number.
break;
}
uint32_t shiftCount = rnum->truncateToUInt32() & 0x1f;
// Large enough to hold both int32_t and uint32_t values.
int64_t result = 0;
if (kind == OpKind::LeftShiftKind) {
// Truncate to unsigned so that the shift doesn't happen on negative
// values. Cast it to a 32-bit signed int to get the sign back, then
// promote to 64 bits.
result = static_cast<int32_t>(lnum->truncateToUInt32() << shiftCount);
} else if (kind == OpKind::RightShiftKind) {
result = static_cast<int64_t>(lnum->truncateToInt32() >> shiftCount);
} else {
result = static_cast<int64_t>(lnum->truncateToUInt32() >> shiftCount);
}
return builder.getLiteralNumber(result);
}
case OpKind::AddKind: { // + (+=)
// Handle numeric constants:
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
leftLiteralNum->getValue() + rightLiteralNum->getValue());
}
// Handle string concat:
if (leftStr && rightStr) {
SmallString<256> result = buildString(
ctx.toString(leftStr->getValue()),
ctx.toString(rightStr->getValue()));
return builder.getLiteralString(result.str());
}
if (leftNull && rightNull) {
return builder.getLiteralPositiveZero();
}
if (leftUndef && rightUndef) {
return builder.getLiteralNaN();
}
if (leftNull) {
if (rightLiteralNum) {
return rhs;
} else if (rightStr) {
SmallString<256> result =
buildString("null", ctx.toString(rightStr->getValue()));
return builder.getLiteralString(result.str());
}
}
if (rightNull) {
if (leftLiteralNum) {
return lhs;
} else if (leftStr) {
SmallString<256> result =
buildString(ctx.toString(leftStr->getValue()), "null");
return builder.getLiteralString(result.str());
}
}
if (leftUndef) {
if (rightLiteralNum) {
return builder.getLiteralNaN();
} else if (rightStr) {
SmallString<256> result =
buildString("undefined", ctx.toString(rightStr->getValue()));
return builder.getLiteralString(result.str());
}
}
if (rightUndef) {
if (leftLiteralNum) {
return builder.getLiteralNaN();
} else if (leftStr) {
SmallString<256> result =
buildString(ctx.toString(leftStr->getValue()), "undefined");
return builder.getLiteralString(result.str());
}
}
break;
}
case OpKind::SubtractKind: // - (-=)
// Handle numeric constants:
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
leftLiteralNum->getValue() - rightLiteralNum->getValue());
}
break;
case OpKind::MultiplyKind: // * (*=)
// Handle numeric constants:
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
leftLiteralNum->getValue() * rightLiteralNum->getValue());
}
if ((leftNull && rightLiteralNum) || (rightNull && leftLiteralNum) ||
(leftNull && rightNull)) {
if ((leftLiteralNum && std::signbit(leftLiteralNum->getValue())) ||
(rightLiteralNum && std::signbit(rightLiteralNum->getValue()))) {
return builder.getLiteralNegativeZero();
}
return builder.getLiteralPositiveZero();
}
break;
case OpKind::DivideKind: // / (/=)
if (leftLiteralNum && rightLiteralNum) {
// This relies on IEEE 754 double division. All modern compilers
// implement this.
return builder.getLiteralNumber(
leftLiteralNum->getValue() / rightLiteralNum->getValue());
}
break;
case OpKind::ModuloKind: // % (%=)
// Note that fmod differs slightly from the ES spec with regards to how
// numbers not representable by double are rounded. This difference can be
// ignored in practice, so most JS VMs use fmod.
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
std::fmod(leftLiteralNum->getValue(), rightLiteralNum->getValue()));
}
break;
case OpKind::ExponentiationKind: // ** (**=)
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(hermes::expOp(
leftLiteralNum->getValue(), rightLiteralNum->getValue()));
}
break;
case OpKind::OrKind: // | (|=)
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
leftLiteralNum->truncateToInt32() |
rightLiteralNum->truncateToInt32());
}
break;
case OpKind::XorKind: // ^ (^=)
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
leftLiteralNum->truncateToInt32() ^
rightLiteralNum->truncateToInt32());
}
break;
case OpKind::AndKind: // & (&=)
if (leftLiteralNum && rightLiteralNum) {
return builder.getLiteralNumber(
leftLiteralNum->truncateToInt32() &
rightLiteralNum->truncateToInt32());
}
break;
default:
break;
}
return nullptr;
}
LiteralBool *hermes::evalToBoolean(IRBuilder &builder, Literal *operand) {
bool value;
switch (operand->getKind()) {
case ValueKind::LiteralNullKind:
case ValueKind::LiteralUndefinedKind:
value = false;
break;
case ValueKind::LiteralBoolKind:
value = cast<LiteralBool>(operand)->getValue();
break;
case ValueKind::LiteralNumberKind: {
const auto n = cast<LiteralNumber>(operand)->getValue();
value = !std::isnan(n) && n != 0.0;
break;
}
case ValueKind::LiteralStringKind:
value = !cast<LiteralString>(operand)->getValue().str().empty();
break;
default:
return nullptr;
}
return builder.getLiteralBool(value);
}
LiteralString *hermes::evalToString(IRBuilder &builder, Literal *operand) {
if (auto *str = llvh::dyn_cast<LiteralString>(operand))
return str;
if (auto *num = llvh::dyn_cast<LiteralNumber>(operand)) {
char buf[NUMBER_TO_STRING_BUF_SIZE];
auto len = numberToString(num->getValue(), buf, sizeof(buf));
return builder.getLiteralString(StringRef(buf, len));
}
return nullptr;
}
LiteralNumber *hermes::evalToNumber(IRBuilder &builder, Literal *operand) {
if (auto *numLiteral = llvh::dyn_cast<LiteralNumber>(operand)) {
return numLiteral;
}
if (auto *boolLiteral = llvh::dyn_cast<LiteralBool>(operand)) {
return builder.getLiteralNumber(boolLiteral->getValue());
}
if (operand->getType().isUndefinedType()) {
return builder.getLiteralNaN();
}
if (operand->getType().isNullType()) {
return builder.getLiteralPositiveZero();
}
return nullptr;
}
LiteralNumber *hermes::evalToInt32(IRBuilder &builder, Literal *operand) {
// Eval to a number first, then truncate to a 32-bit int.
LiteralNumber *lit = evalToNumber(builder, operand);
if (!lit) {
return nullptr;
}
double val = lit->getValue();
return builder.getLiteralNumber(truncateToInt32(val));
}
LiteralBool *hermes::evalToBoolean(IRBuilder &builder, Value *operand) {
if (auto *L = llvh::dyn_cast<Literal>(operand)) {
return evalToBoolean(builder, L);
}
Type OpTY = operand->getType();
if (OpTY.isObjectType()) {
return builder.getLiteralBool(true);
}
if (OpTY.isNullType() || OpTY.isUndefinedType()) {
return builder.getLiteralBool(false);
}
return nullptr;
}
bool hermes::evalIsTrue(IRBuilder &builder, Literal *operand) {
if (auto *lit = evalToBoolean(builder, operand))
return lit->getValue();
return false;
}
bool hermes::evalIsFalse(IRBuilder &builder, Literal *operand) {
if (auto *lit = evalToBoolean(builder, operand))
return !lit->getValue();
return false;
}
| [
"[email protected]"
] | |
2689e9b70ea04960b8597a668801eecef8dba907 | 6250f3343eff1638912510b66ed936c59796635a | /src_vc141/thirdparty/stlsoft/STLSoft/include/stlsoft/util/true_typedef.hpp | 16bc934e85227512679cc6204d612b93d647c94e | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | nneesshh/mytoolkit | b4b242307a6603bc5785bc130de8f4d3b5ea9265 | 336ae9c7077c8687a8cf8a2ce4aec804c28ab90c | refs/heads/master | 2020-04-05T15:18:07.985547 | 2018-12-17T11:36:07 | 2018-12-17T11:36:07 | 156,961,652 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 36,098 | hpp | /* /////////////////////////////////////////////////////////////////////////
* File: stlsoft/util/true_typedef.hpp
*
* Purpose: Contains the true_typedef class template.
*
* Created: 16th January 2002
* Updated: 19th February 2017
*
* Home: http://stlsoft.org/
*
* Copyright (c) 2002-2017, Matthew Wilson and Synesis Software
* 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(s) of Matthew Wilson and Synesis Software nor the
* names of any 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.
*
* ////////////////////////////////////////////////////////////////////// */
/** \file stlsoft/util/true_typedef.hpp
*
* \brief [C++ only] Definition of the stlsoft::true_typedef class template
* (\ref group__library__Utility "Utility" Library).
*/
#ifndef STLSOFT_INCL_STLSOFT_UTIL_HPP_TRUE_TYPEDEF
#define STLSOFT_INCL_STLSOFT_UTIL_HPP_TRUE_TYPEDEF
#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
# define STLSOFT_VER_STLSOFT_UTIL_HPP_TRUE_TYPEDEF_MAJOR 4
# define STLSOFT_VER_STLSOFT_UTIL_HPP_TRUE_TYPEDEF_MINOR 0
# define STLSOFT_VER_STLSOFT_UTIL_HPP_TRUE_TYPEDEF_REVISION 6
# define STLSOFT_VER_STLSOFT_UTIL_HPP_TRUE_TYPEDEF_EDIT 84
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
/* /////////////////////////////////////////////////////////////////////////
* includes
*/
#ifndef STLSOFT_INCL_STLSOFT_H_STLSOFT
# include <stlsoft/stlsoft.h>
#endif /* !STLSOFT_INCL_STLSOFT_H_STLSOFT */
#ifdef STLSOFT_TRACE_INCLUDE
# pragma message(__FILE__)
#endif /* STLSOFT_TRACE_INCLUDE */
/* /////////////////////////////////////////////////////////////////////////
* namespace
*/
#ifndef STLSOFT_NO_NAMESPACE
namespace stlsoft
{
#endif /* STLSOFT_NO_NAMESPACE */
/* /////////////////////////////////////////////////////////////////////////
* classes
*/
/* U is the unique type, and is usually a type generated by the
* STLSOFT_GEN_OPAQUE() macro, as in
*
* STLSOFT_GEN_OPAQUE(h_uniquelong_tt)
* typedef true_typedef<long, h_uniquelong_tt> uniquelong_tt;
*
* thus generating a unique type uniquelong over base-type long.
*/
/** This class is used to create strong types from base types, to facilitate
* type disambiguation, overloading and mutual incompatibility.
*
* \ingroup group__library__Utility
*
* For example, the following code creates two types based on the \c int type:
*
\code
STLSOFT_GEN_OPAQUE(h_protocol_tt)
STLSOFT_GEN_OPAQUE(h_port_tt)
typedef true_typedef<long, h_protocol_tt> protocol_tt;
typedef true_typedef<long, h_port_tt> port_tt;
protocol_tt pro1(3); // Ok
port_tt prt1(8088); // Ok
protocol_tt pro2(pro1); // Ok, can copy from another protocol_tt
port_tt prt2(pro2); // Error, cannot copy from a protocol_tt
\endcode
*
*
* \param T The base type, e.g. \c int, \c std::wstring
* \param U The unique type, usually created by using STLSOFT_GEN_OPAQUE()
*/
template<
ss_typename_param_k T
, ss_typename_param_k U
>
class true_typedef
{
public:
/// The value type
typedef T value_type;
/// The unique type
typedef U unique_type;
/// The type of the current parameterisation
typedef true_typedef<T, U> class_type;
/// The reference type
typedef T& reference;
/// The non-mutating (const) reference type
typedef T const& const_reference;
// Construction
public:
/// Default constructor
true_typedef()
: m_value(value_type())
{}
/// Construct from a value type instance
ss_explicit_k true_typedef(value_type const& value)
: m_value(value)
{}
/// Copy constructor
true_typedef(class_type const& rhs)
: m_value(rhs.m_value)
{}
/// Copy assignment operator
class_type const& operator =(class_type const& rhs)
{
m_value = rhs.m_value;
return *this;
}
// Accessors
public:
/// Provides non-mutating (const) access to the base type value
const_reference base_type_value() const
{
return m_value;
}
/// Provides mutating access to the base type value
reference base_type_value()
{
return m_value;
}
// Members
private:
value_type m_value;
// Not to be implemented
private:
// Not provided, as the syntax is less ambiguous when
// assignment from an explicit temporary is made
class_type const& operator =(value_type const& value);
};
/* /////////////////////////////////////////////////////////////////////////
* implementation
*/
#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
// Pre-increment
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>&
operator ++(true_typedef<T, U> &v)
{
++v.base_type_value();
return v;
}
// Post-increment
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const
operator ++(true_typedef<T, U> &v, int)
{
true_typedef<T, U> r(v);
v.base_type_value()++;
return r;
}
// Pre-decrement
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>&
operator --(true_typedef<T, U> &v)
{
--v.base_type_value();
return v;
}
// Post-decrement
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const
operator --(true_typedef<T, U> &v, int)
{
true_typedef<T, U> r(v);
v.base_type_value()--;
return r;
}
// operator ==
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator ==(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return lhs.base_type_value() == rhs.base_type_value();
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator ==(
true_typedef<T, U> const& lhs
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
, ss_typename_type_k true_typedef<T, U>::value_type const& rhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, T const& rhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
)
{
return lhs.base_type_value() == rhs;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator ==(
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
ss_typename_type_k true_typedef<T, U>::value_type const& lhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
T const& lhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, true_typedef<T, U> const& rhs
)
{
return lhs == rhs.base_type_value();
}
// operator !=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator !=(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return ! operator ==(lhs, rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator !=(
true_typedef<T, U> const& lhs
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
, ss_typename_type_k true_typedef<T, U>::value_type const& rhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, T const& rhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
)
{
return ! operator ==(lhs, rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator !=(
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
ss_typename_type_k true_typedef<T, U>::value_type const& lhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
T const& lhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, true_typedef<T, U> const& rhs
)
{
return ! operator ==(lhs, rhs);
}
// operator <
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator <(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return lhs.base_type_value() < rhs.base_type_value();
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator <(
true_typedef<T, U> const& lhs
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
, ss_typename_type_k true_typedef<T, U>::value_type const& rhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, T const& rhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
)
{
return lhs.base_type_value() < rhs;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator <(
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
ss_typename_type_k true_typedef<T, U>::value_type const& lhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
T const& lhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, true_typedef<T, U> const& rhs
)
{
return lhs < rhs.base_type_value();
}
// operator <=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator <=(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return lhs.base_type_value() <= rhs.base_type_value();
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator <=(
true_typedef<T, U> const& lhs
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
, ss_typename_type_k true_typedef<T, U>::value_type const& rhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, T const& rhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
)
{
return lhs.base_type_value() <= rhs;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator <=(
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
ss_typename_type_k true_typedef<T, U>::value_type const& lhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
T const& lhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, true_typedef<T, U> const& rhs
)
{
return lhs <= rhs.base_type_value();
}
// operator >
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator >(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return lhs.base_type_value() > rhs.base_type_value();
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator >(
true_typedef<T, U> const& lhs
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
, ss_typename_type_k true_typedef<T, U>::value_type const& rhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, T const& rhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
)
{
return lhs.base_type_value() > rhs;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator >(
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
ss_typename_type_k true_typedef<T, U>::value_type const& lhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
T const& lhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, true_typedef<T, U> const& rhs
)
{
return lhs > rhs.base_type_value();
}
// operator >=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator >=(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return lhs.base_type_value() >= rhs.base_type_value();
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
operator >=(
true_typedef<T, U> const& lhs
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
, ss_typename_type_k true_typedef<T, U>::value_type const& rhs
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
, T const& rhs
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
)
{
return lhs.base_type_value() >= rhs;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
ss_bool_t
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator >=(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator >=(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return lhs >= rhs.base_type_value();
}
// operator +
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator +(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() + rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator +(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator +(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() + rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator +(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator +(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs + rhs.base_type_value());
}
// operator -
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator -(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() - rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator -(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator -(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() - rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator -(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator -(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs - rhs.base_type_value());
}
// operator *
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator *(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() * rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator *(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator *(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() * rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator *(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator *(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs * rhs.base_type_value());
}
// operator /
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator /(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() / rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator /(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator /(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() / rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator /(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator /(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs / rhs.base_type_value());
}
// operator %
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator %(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() % rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator %(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator %(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() % rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator %(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator %(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs % rhs.base_type_value());
}
// operator ^
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator ^(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() ^ rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator ^(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator ^(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() ^ rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator ^(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator ^(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs ^ rhs.base_type_value());
}
// operator ~
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator ~(true_typedef<T, U> const& v)
{
return true_typedef<T, U>(~v.base_type_value());
}
// operator <<
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator <<(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() << rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator <<(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator <<(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() << rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator <<(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator <<(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs << rhs.base_type_value());
}
// operator >>
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator >>(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() >> rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator >>(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator >>(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() >> rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator >>(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator >>(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs >> rhs.base_type_value());
}
// operator &
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator &(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() & rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator &(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator &(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() & rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator &(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator &(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs & rhs.base_type_value());
}
// operator |
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
operator |(
true_typedef<T, U> const& lhs
, true_typedef<T, U> const& rhs
)
{
return true_typedef<T, U>(lhs.base_type_value() | rhs.base_type_value());
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator |(true_typedef<T, U> const& lhs, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator |(true_typedef<T, U> const& lhs, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs.base_type_value() | rhs);
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U>
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator |(ss_typename_type_k true_typedef<T, U>::value_type const& lhs, true_typedef<T, U> const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator |(T const& lhs, true_typedef<T, U> const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
return true_typedef<T, U>(lhs | rhs.base_type_value());
}
// operator +=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator +=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator +=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() += rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator +=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() += rhs.base_type_value();
return v;
}
// operator -=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator -=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator -=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() -= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator -=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() -= rhs.base_type_value();
return v;
}
// operator *=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator *=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator *=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() *= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator *=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() *= rhs.base_type_value();
return v;
}
// operator /=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator /=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator /=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() /= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator /=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() /= rhs.base_type_value();
return v;
}
// operator %=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator %=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator %=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() %= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator %=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() %= rhs.base_type_value();
return v;
}
// operator ^=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator ^=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator ^=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() ^= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator ^=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() ^= rhs.base_type_value();
return v;
}
// operator <<=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator <<=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator <<=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() <<= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator <<=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() <<= rhs.base_type_value();
return v;
}
// operator >>=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator >>=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator >>=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() >>= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator >>=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() >>= rhs.base_type_value();
return v;
}
// operator &=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator &=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator &=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() &= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator &=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() &= rhs.base_type_value();
return v;
}
// operator |=
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
#ifdef STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT
operator |=(true_typedef<T, U> &v, ss_typename_type_k true_typedef<T, U>::value_type const& rhs)
#else /* ? STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
operator |=(true_typedef<T, U> &v, T const& rhs)
#endif /* STLSOFT_CF_TEMPLATE_OUTOFCLASSFN_QUALIFIED_TYPE_SUPPORT */
{
v.base_type_value() |= rhs;
return v;
}
template<
ss_typename_param_k T
, ss_typename_param_k U
>
inline
true_typedef<T, U> const&
operator |=(true_typedef<T, U> &v, true_typedef<T, U> const& rhs)
{
v.base_type_value() |= rhs.base_type_value();
return v;
}
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
/* ////////////////////////////////////////////////////////////////////// */
#ifndef STLSOFT_NO_NAMESPACE
} /* namespace stlsoft */
#endif /* STLSOFT_NO_NAMESPACE */
/* /////////////////////////////////////////////////////////////////////////
* inclusion control
*/
#ifdef STLSOFT_CF_PRAGMA_ONCE_SUPPORT
# pragma once
#endif /* STLSOFT_CF_PRAGMA_ONCE_SUPPORT */
#endif /* !STLSOFT_INCL_STLSOFT_UTIL_HPP_TRUE_TYPEDEF */
/* ///////////////////////////// end of file //////////////////////////// */
| [
"[email protected]"
] | |
130a063b407962e13f166c8ff95accb8c56619d8 | 284d8657b07536bea5d400168a98c1a3ce0bc851 | /xray/core/sources/memory_monitor.h | 066e71431b91f08b932a5076eca5c3af0d8f29a6 | [] | no_license | yxf010/xray-2.0 | c6bcd35caa4677ab19cd8be241ce1cc0a25c74a7 | 47461806c25e34005453a373b07ce5b00df2c295 | refs/heads/master | 2020-08-29T21:35:38.253150 | 2019-05-23T16:00:42 | 2019-05-23T16:00:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,009 | h | ////////////////////////////////////////////////////////////////////////////
// Created : 09.10.2008
// Author : Dmitriy Iassenev
// Copyright (C) GSC Game World - 2009
////////////////////////////////////////////////////////////////////////////
#ifndef MEMORY_MONITOR_H_INCLUDED
#define MEMORY_MONITOR_H_INCLUDED
#if defined(NDEBUG) || !defined(_MSC_VER)
# define XRAY_USE_MEMORY_MONITOR 0
#else // #ifdef NDEBUG
# define XRAY_USE_MEMORY_MONITOR 1
#endif // #ifdef NDEBUG
#if XRAY_USE_MEMORY_MONITOR
namespace xray {
namespace memory {
namespace monitor {
void initialize ( );
void finalize ( );
void on_alloc ( pvoid& pointer, size_t& size, size_t previous_size, pcstr description );
void on_free ( pvoid& pointer, bool can_clear = true );
inline u32 get_house_keeping_size ( ) { return 0; }
} // namespace monitor
} // namespace memory
} // namespace xray
#endif // #if XRAY_USE_MEMORY_MONITOR
#endif // #ifndef MEMORY_MONITOR_H_INCLUDED | [
"[email protected]"
] | |
6214de985c20e75bf6619295a2690ab7de7aa7fe | 4e1e2a74279ed35b60cdcbad9561190723b61d80 | /tree_using_stack.cpp | 2b6fb99d76db63aecd83d1aebf6b71df50014951 | [] | no_license | futre1529/Dsa_Implementations | eb56fef501386f6dd6bdbc26daac9e96e4ffe64e | c9252853f8b73a600b8f9b761664bb07a22b9152 | refs/heads/master | 2016-09-06T07:37:39.530363 | 2014-03-18T19:12:13 | 2014-03-18T19:12:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,335 | cpp | #include<iostream>
using namespace std;
#include<conio.h>
struct bstnode
{
int data;
char visit;
bstnode *rchild;
bstnode *lchild;
};
bstnode *addchild(bstnode *l,int k)
{
if(l==NULL)
{
l=new bstnode;
l->data=k;
l->rchild=l->lchild=NULL;
}
else if(k>l->data)
l->rchild=addchild(l->rchild,k);
else
l->lchild=addchild(l->lchild,k);
return(l);
}
void display(bstnode *l)
{
if(l!=NULL)
{
display(l->lchild);
cout<<l->data<<" ";
display(l->rchild);
}
}
//.........................................
class stack
{
public:
bstnode *elements[20];
int top;
void push(bstnode *);
bstnode *pop();
stack(){top=-1;}
};
bstnode *stack::pop()
{
bstnode *t=new bstnode;t->data=-1,t->lchild=t->rchild=NULL;
if(top!=-1)
return(elements[top--]);
else
return(t);
}
void stack::push(bstnode *x)
{
if(top!=19)
elements[++top]=x;
else cout<<"\n Stack full ";
}
//..................................................
void idisplay(bstnode *l)
{
stack s;
cout<<l->data<<" ";
s.push(l);
bstnode *temp;
while(s.top!=-1)
{
temp=s.pop();
if(temp->lchild!=NULL&&temp->visit!='y')
{
cout<<temp->lchild->data<<" ";
s.push(temp);
temp->visit='y';
s.push(temp->lchild);
}
else
{
if(temp->rchild!=NULL)
{
cout<<temp->rchild->data<<" ";
temp->visit='y';
s.push(temp->rchild);
}
else if(temp->visit!='y')
{
temp->visit='y';
cout<<temp->data<<" \b\b\b";
}
}
}
cout<<" ";
}
int main()
{
bstnode *root=NULL;
cout<<"\nEnter the values in the tree(Enter 0 to exit) :";
int num;
while(1)
{
cin>>num;
if(num==0)
break;
else
root=addchild(root,num);
}
cout<<"\nDisplaying the list.........(inorder)\n";
display(root);
cout<<"\nDisplaying the preorder tree using iterative version..........\n";
idisplay(root);
getch();
}
| [
"codered@ubuntu.(none)"
] | codered@ubuntu.(none) |
cae4683d2af863519df9aae729ca3bd4c42def80 | d0d1acd44b710597b41ecdf495230f330cf07af5 | /src/readparameters.cpp | b9371bcae89cbbccf0604734c0ee0d0871b201ac | [] | no_license | byiii/pcl_3d_rec_framework | 1c6fb9025739231c837ab1cee4d18309aaaa0191 | 4d6e74cb42a664794a0d0adc65b5803a3f38ea22 | refs/heads/master | 2020-04-06T03:53:34.009197 | 2016-06-30T06:08:29 | 2016-06-30T06:08:29 | 57,368,361 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 510 | cpp | #include <utils/readparameters.h>
//template void axisAngleToRotationMatrix(
//const Eigen::Matrix<double,3,1> &axis,
//double angle,
//Eigen::Matrix<double,3,3> &rotmat);
template void readParameters::get(const char* key, float& value);
template void readParameters::get(const char* key, int& value);
template void readParameters::get(const char* key, bool& value);
template void readParameters::get(const char* key, double& value);
template void readParameters::get(const char* key, std::string& value);
| [
"[email protected]"
] | |
8af5490a9978dcf8a70b29c43275e73f5972933c | 84ed255365c62a3b66a887f2cca205b2245de22a | /136. Single Number.cpp | a712313386fc152fcae198cf5b22ecab820d7b20 | [
"MIT"
] | permissive | rajeevranjancom/Leetcode_Cpp | c83988074b69c2c99dbe926ba5ada86963625641 | f64cd98ab96ec110f1c21393f418acf7d88473e8 | refs/heads/master | 2022-12-30T08:22:03.943195 | 2020-10-12T22:08:37 | 2020-10-12T22:08:37 | 298,404,248 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 154 | cpp | class Solution {
public:
int singleNumber(vector<int>& nums) {
int res = 0;
for(auto& x: nums) res ^= x;
return res;
}
};
| [
"[email protected]"
] | |
2dd9c3c06b4f4375e4d14d2e635a6ef8c892050a | 1a754f8cbc44f0730491b3aa846bd1c0e4274409 | /CEGUISample9/CEGUISample9.h | da25643352135a0c623ac81c96373eae33cf2f7c | [] | no_license | harr999y/OgreFramework | fe63d4be6a9e86dac4c790e5e391031ad5162477 | 784e00ce55b39520ad761132409a6664d142fa5a | refs/heads/master | 2016-09-05T13:07:09.199479 | 2012-05-09T21:26:19 | 2012-05-09T21:26:19 | 4,277,026 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,155 | h | #ifndef _CEGUISAMPLE9_
#define _CEGUISAMPLE9_
#include "../CEGUIBase/CEGUIBaseApp.h"
class MyEffect : public CEGUI::RenderEffect
{
public:
MyEffect();
int getPassCount() const;
void performPreRenderFunctions(const int pass);
void performPostRenderFunctions();
virtual bool realiseGeometry(CEGUI::RenderingWindow& window,CEGUI::GeometryBuffer& geometry);
virtual bool update(const float elapsed,CEGUI::RenderingWindow& window);
protected:
static const float tess_x;
static const float tess_y;
static const int buffsize = (8 * 8 * 6);
bool initialised;
float lastX,lastY;
float dragX,dragY;
float elasX,elasY;
CEGUI::Vertex vb[buffsize];
};
class CEGUISample9App : public CEGUIBaseApp
{
public:
void createGUI();
protected:
void createListContent();
void initDemoEventWiring();
bool handleSlider(const CEGUI::EventArgs& e);
bool handleRadio(const CEGUI::EventArgs& e);
bool handleCheck(const CEGUI::EventArgs& e);
};
class MyListItem : public CEGUI::ListboxTextItem
{
public:
MyListItem(const CEGUI::String& text) : ListboxTextItem(text)
{
setSelectionBrushImage("TaharezLook","MultiListSelectionBrush");
}
};
#endif | [
"[email protected]"
] | |
d9bf8a2fc1a780773844220d6c1cba35bf455319 | 7f4430f70911ddc552956ac1b7874a88d8b0edad | /leetcode/131——Palindrome_Partitioning.cpp | db15669cea37692d02550e24cf7d6a1c7428e005 | [] | no_license | tylercross/algorithm | 404689c701655515cc7608a45b8d1d8257dd2bb8 | 44171627a592f0a91c0a8dbf8c97f034d92ee40c | refs/heads/master | 2020-04-29T11:34:00.306675 | 2019-09-10T16:06:04 | 2019-09-10T16:06:04 | 176,103,341 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,228 | cpp | #include <iostream>
#include <string>
#include <vector>
#include <limits.h>
using namespace std;
bool isPalindrome(const string &s,int left,int right);
void dfs(int index,string& s,vector<string>& path,vector<vector<string>>& res);
vector<vector<string>> partition(string s)
{
vector<vector<string>> res;
if(s.empty()) return res;
vector<string> path;
dfs(0,s,path,res);
return res;
}
void dfs(int index,string& s,vector<string>& path,vector<vector<string>>& res)
{
if(index==s.size()) {
res.push_back(path);
return;}
for(int i=index;i<s.size();++i)
{
if(isPalindrome(s,index,i)){
path.push_back(s.substr(index,i-index+1));
dfs(i+1,s,path,res);
path.pop_back();
}
}
}
bool isPalindrome(const string &s,int left,int right)
{
while(left<=right)
{
if(s[left++]!=s[right--]) return false;
}
return true;
}
int main()
{
string s;
cin>>s;
vector<vector<string> >res;
res=partition(s);
for(int i=0;i<res.size();++i)
{
for(int j=0;j<res[i].size();++j)
cout<<res[i][j]<<" ";
cout<<endl;
}
// cout<<firstUniqChar(s)<<endl;
return 0;
}
| [
"[email protected]"
] | |
43ed34bc54529644e84077ba683beb4d9593528c | 0169bc4f1196a2b9da7891440508f8662fd67b39 | /summafrom1ton.cpp | b7fd6a3265b152c24af7d2c9aaaa3f5829bf6354 | [] | no_license | Woldos/My-first-works | 1da1d4b91859b2d3e88d1b2b12509dcfd8adeb12 | 7d0cfb19b39a906fd4d77126cf453f2c0edf0c17 | refs/heads/master | 2020-07-09T17:51:05.621779 | 2019-11-18T23:35:38 | 2019-11-18T23:35:38 | 204,039,145 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 201 | cpp | #include <iostream>
using namespace std;
int main(){
long long int n, sum = 0;;
cin >> n;
for (int i = 0;i <= n; i++){
sum += i;
}
cout << sum;
return 0;
}
| [
"[email protected]"
] | |
583d8fd7d4a318e08605948e871fb7ede4de67b0 | f91730684042f2b2f2dd1ef1f1351731809210fa | /TemplateTrees.V.2.4/Trees/ValueClasses/CompareFunctions.hpp | 00abaca7b60fd8ba17741e52b8ee64ce7c19a86b | [] | no_license | Kremen-Sergey/Trees | 971a11c289ddfd61409e22290a765a5647a7f305 | c2b81d05ed356ff86d2be2115a6eba1bf513fdf7 | refs/heads/master | 2021-01-01T05:33:21.522061 | 2015-06-22T13:52:31 | 2015-06-22T13:52:31 | 37,857,911 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 241 | hpp | #pragma once
#include "stdafx.h"
#include "Elephant.h"
//Comparison functions for Tkey
int compareElephantForName(Elephant x, Elephant y)
{
return strcmp(x.getName(), y.getName());
}
int compareForInt(int x, int y)
{
return (x - y);
}
| [
"[email protected]"
] | |
92d4444c23f953d435ca59388794a8fe13624ee6 | 05f27f3a2586c15431b95092b2616773200b9baf | /ass2_2/timespan.h | 15e4af9a46665a8b159995a1331d366ab5981c0e | [] | no_license | ksy1231/Data_Structure_I | 6f1bc2eb9cd46bcacc61c83abc6470e8cbc33086 | 42d000eaaaf32fc0f08b95e29c96b3dbcf608dba | refs/heads/master | 2020-04-27T03:19:56.714708 | 2020-04-17T17:59:35 | 2020-04-17T17:59:35 | 174,021,917 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,372 | h | //
// Created by SooYeon Kim on 4/24/2018.
//
#ifndef ASS2_TIMESPAN_H
#define ASS2_TIMESPAN_H
#include <iostream>
using namespace std;
class TimeSpan {
friend ostream& operator<<(ostream &out, const TimeSpan &ts);
public:
// Constructor
TimeSpan(double hours = 0.0, double minutes = 0, double seconds = 0);
// Destructor
~TimeSpan();
// Checks if two TimeSpans are equal
// return true for equal, false for unequal
bool operator==(const TimeSpan &ts) const;
// Checks if two TimeSpans are unequal
// return true for unequal, false for equal
bool operator!=(const TimeSpan &ts) const;
// Checks if given TimeSpan is greater than compared TimeSpan
// return true for greater, false otherwise
bool operator>(const TimeSpan &ts) const;
// Checks if given TimeSpan is less than compared TimeSpan
// return true for less, false otherwise
bool operator<(const TimeSpan &ts) const;
// Checks if given TimeSpan is greater than or equal to compared TimeSpan
// return true for greater or equal, false otherwise
bool operator>=(const TimeSpan &ts) const;
// Checks if given TimeSpan is less than or equal to compared TimeSpan
// return true for less than or equal, false otherwise
bool operator<=(const TimeSpan &ts) const;
// Creates and returns a new TimeSpan that is the sum of the two TimeSpans
TimeSpan operator+(const TimeSpan &ts) const;
// Creates and returns a new TimeSpan that
// is the difference of the two TimeSpans
TimeSpan operator-(const TimeSpan &ts) const;
// Add a TimeSpan to given TimeSpan
// returns the added TimeSpan
TimeSpan &operator+=(const TimeSpan &ts);
// Subtract a TimeSpan to given TimeSpan
// returns the subtracted TimeSpan
TimeSpan &operator-=(const TimeSpan &ts);
// Multiplies a number to given TimeSpan
// returns the multiplied TimeSpan
TimeSpan operator*(const int &num);
private:
// Hours in TimeSpan
double hours;
// Minutes in TimeSpan
double minutes;
// Seconds in TimeSpan
double seconds;
// Total number of Seconds in TimeSpan
int totalSeconds;
// Modifies a TimeSpan to a correct format of TimeSpan
TimeSpan &simplify();
};
#endif //ASS2_TIMESPAN_H
| [
"[email protected]"
] | |
1a72d5050319cd1a0e4b154ebdd971fa32ac0675 | 36cab50e0aa6779a1b0b14df392cccb2fb2dfee3 | /src/ImageReader.cpp | dc37a6bd76971d5b2b020008eb97c50ef9d0a7cf | [] | no_license | LeonidK23/image_enhancer | 46e40cf4e732a92f1cb2f3c2d12c0a410b84a985 | 9d17750de7dd2ac3f184839909616b918bdcd93b | refs/heads/master | 2022-07-07T04:07:46.460774 | 2020-05-16T14:57:32 | 2020-05-16T14:57:32 | 264,224,553 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,547 | cpp | #include <fstream>
#include <string>
#include <vector>
#include <iostream>
#include <cstdlib>
#include "Image.hpp"
#include "ImageReader.hpp"
Image ImageReader::read(std::string filePath){
int num;
int filenameBegin;
int filenameEnd;
std::string fileName;
Image img{};
// convert png to txt using python script
std::string script = "python ../auxiliary/convert_png_to_txt.py";
std::system((script + " " + filePath).c_str());
std::string txtFilePath = filePath.substr(0, filePath.find_last_of(".")) + ".txt";
// read txt file
std::ifstream inputFile(txtFilePath);
std::vector<int> data;
while (inputFile >> num){
data.push_back(num);
}
inputFile.close();
std::remove(txtFilePath.c_str());
filenameBegin = filePath.find_last_of("/\\") + 1;
filenameEnd = filePath.find_last_of(".");
fileName = filePath.substr(filenameBegin, filenameEnd - filenameBegin);
img.setName(fileName);
img.setData(data);
return img;
}
void ImageReader::write(Image img, int N){
std::ofstream outFile;
std::string filePath ("../imgs/" + img.getName() + ".txt");
outFile.open(filePath);
std::vector<int> img_vec = img.getData();
int m = img_vec.size() / N;
for (int i = 0; i < m; i++){
for (int j = 0; j < N; j++)
outFile << img_vec[i*N + j] << ' ';
outFile << '\n';
}
outFile.close();
// convert png to txt using python script
std::string script = "python ../auxiliary/convert_txt_to_png.py";
std::system((script + " " + filePath).c_str());
std::remove(filePath.c_str());
}
| [
"[email protected]"
] | |
975f0ae3789de2ffd4bd0d52a3997cc501bdc06b | 4335c4c4715c8d5bbcf35c06a8ccdb4f7975e5d5 | /book-competitive-programming-3rd/solutions/10855_rotated_square.cc | 04c14abab3fdb272c3743f64ac897e37aa6e59fb | [] | no_license | myeongjae-kim/competitive-programming | 3c492e986b501a405f2e4447798153628558487a | e190abee9e633069e113f5ef40d40d2f6eb92b1e | refs/heads/master | 2020-04-17T11:53:40.428065 | 2020-03-22T11:23:59 | 2020-03-22T11:23:59 | 166,558,633 | 0 | 0 | null | 2020-03-21T16:10:22 | 2019-01-19T14:58:46 | C++ | UTF-8 | C++ | false | false | 1,505 | cc | #include <cmath>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int count_sub_square(vector<string> &A, vector<string> &B, int a, int b){
int count = 0;
for(int r = 0; r <= a-b; r++) {
for(int c = 0; c <= a-b; c++) {
for(int r_s = 0; r_s < b; r_s++) {
for(int c_s = 0; c_s < b; c_s++) {
if(A[r+r_s][c+c_s] == B[r_s][c_s]) {
} else {
goto next_point;
}
}
}
count++;
next_point:;
}
}
return count;
}
void rotate_square(vector<string> &A, int a) {
int layer = a/2;
for(int i = 0; i < layer; i++) {
for(int k = i; k < a-1-i; k++) {
char temp = A[i][k];
A[i][k] = A[a-1-k][i];
A[a-1-k][i] = A[a-1-i][a-1-k];
A[a-1-i][a-1-k] = A[k][a-1-i];
A[k][a-1-i] = temp;
}
}
/*
for(auto &s : A) {
for(auto c : s) {
cout << c;
}
cout << endl;
}
cout << endl;
*/
}
int main(void)
{
ios::sync_with_stdio(0); cin.tie(0);
int a,b;
while(cin>>a>>b, a || b) {
vector<string> A, B;
string s_buf;
for(int i=0;i<a;i++) {
cin>>s_buf;
A.push_back(s_buf);
}
for(int i=0;i<b;i++) {
cin>>s_buf;
B.push_back(s_buf);
}
int ans = count_sub_square(A,B,a,b);
rotate_square(B,b);
cout << ans;
for(int i = 0; i < 3; i++) {
ans = count_sub_square(A,B,a,b);
rotate_square(B,b);
cout << ' '<< ans;
}
cout << endl;
}
return 0;
}
| [
"[email protected]"
] | |
8358f8a1fae20ac6759a5068e430e747744a40fa | 51afaf7c5fbd2ca999d9b4099550e226db81276a | /src/Dictionary.cpp | 15088f8081a25c411816280c9acd93a4183d9bd0 | [] | no_license | yuewuqing2224/sketch_object_recognition | c83ff84b63bb7d8a60549a1d5a97db4f0bd996be | 6f0f00ee26d8ab6e024bc641ea759862d2b87aed | refs/heads/master | 2021-01-10T00:56:58.797904 | 2015-11-04T18:13:45 | 2015-11-04T18:13:45 | 45,323,229 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 734 | cpp | #include "Dictionary.h"
using namespace std;
using namespace cv;
Dictionary::Dictionary()
{
dictionarySize = 100; //default size
}
Dictionary::Dictionary(int s){
dictionarySize = s;
}
void Dictionary::KCluster(Mat& featuresUnclustered,string p){
TermCriteria tc(CV_TERMCRIT_ITER,100,0.001);
int retries=1;
int flags=KMEANS_PP_CENTERS;
BOWKMeansTrainer bowTrainer(dictionarySize,tc,retries,flags);
cout<<"Computing BoW Using KNN..."<<endl;
//cluster the feature vectors
Mat dictionary=bowTrainer.cluster(featuresUnclustered);
//store the vocabulary
FileStorage fs(p, FileStorage::WRITE);
fs << "vocabulary" << dictionary;
fs.release();
cout<<"Done"<<endl;
}
Dictionary::~Dictionary(){}
| [
"[email protected]"
] | |
50621ab46470cf5dc5158c55ba79c14c14b5a1ec | c16b3c494be06fd190980a4bd5d0bc0a83db4bdc | /source_location.h | 29255d4aa5d0c36f1042751ae25d8dcf465a6a7c | [] | no_license | arapelle/Logvisu | 15913af6d431f2736eb7b74b84f4039e19587369 | c376d621d094b097353fe35d08cd8db562682c8e | refs/heads/master | 2020-07-22T17:50:39.579702 | 2019-09-09T10:30:33 | 2019-09-09T10:30:33 | 207,280,283 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 237 | h | #ifndef SOURCE_LOCATION_H
#define SOURCE_LOCATION_H
#include <QString>
class Source_location
{
public:
QString file_name;
quint64 line;
QString function_name;
QString to_string() const;
};
#endif // SOURCE_LOCATION_H
| [
"[email protected]"
] | |
1db1d488cb13d810e1e4d8121dd82f04530f8ec2 | 7f30640ddaa58b920bb2f056e6e17d6a7c752073 | /src/qt/bitcoingui.h | 73b5a6655e7cc1a6d4450a3d4dc21220cc96dde9 | [
"MIT"
] | permissive | TrueDividendCrypto/truecrypto-oss | 686d7133a713f9ec2e4c1c86ade17afb3a676564 | d6dda1a4f467b772cccece1b3915d3e391e9809f | refs/heads/master | 2021-03-18T13:21:37.064254 | 2020-03-05T18:24:20 | 2020-03-05T18:24:20 | 247,079,476 | 0 | 0 | MIT | 2020-03-13T13:37:36 | 2020-03-13T13:37:36 | null | UTF-8 | C++ | false | false | 8,977 | h | // Copyright (c) 2011-2019 Bitcoin Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef BITCOIN_QT_BITCOINGUI_H
#define BITCOIN_QT_BITCOINGUI_H
#if defined(HAVE_CONFIG_H)
#include "config/tdc-config.h"
#endif
#include "amount.h"
#include <QLabel>
#include <QMainWindow>
#include <QMap>
#include <QMenu>
#include <QPoint>
#include <QPushButton>
#include <QSystemTrayIcon>
//
class ClientModel;
class NetworkStyle;
class Notificator;
class OptionsModel;
class BlockExplorer;
class RPCConsole;
class SendCoinsRecipient;
class UnitDisplayStatusBarControl;
class WalletFrame;
class WalletModel;
class MasternodeList;
class CWallet;
QT_BEGIN_NAMESPACE
class QAction;
class QProgressBar;
class QProgressDialog;
QT_END_NAMESPACE
/**
Bitcoin GUI main class. This class represents the main window of the Bitcoin UI. It communicates with both the client and
wallet models to give the user an up-to-date view of the current core state.
*/
class BitcoinGUI : public QMainWindow
{
Q_OBJECT
public:
static const QString DEFAULT_WALLET;
explicit BitcoinGUI(const NetworkStyle* networkStyle, QWidget* parent = 0);
~BitcoinGUI();
/** Set the client model.
The client model represents the part of the core that communicates with the P2P network, and is wallet-agnostic.
*/
void setClientModel(ClientModel* clientModel);
#ifdef ENABLE_WALLET
/** Set the wallet model.
The wallet model represents a bitcoin wallet, and offers access to the list of transactions, address book and sending
functionality.
*/
bool addWallet(const QString& name, WalletModel* walletModel);
bool setCurrentWallet(const QString& name);
void removeAllWallets();
#endif // ENABLE_WALLET
bool enableWallet;
bool fMultiSend = false;
protected:
void changeEvent(QEvent* e);
void closeEvent(QCloseEvent* event);
void dragEnterEvent(QDragEnterEvent* event);
void dropEvent(QDropEvent* event);
bool eventFilter(QObject* object, QEvent* event);
private:
ClientModel* clientModel;
WalletFrame* walletFrame;
UnitDisplayStatusBarControl* unitDisplayControl;
QLabel* labelStakingIcon;
QLabel* labelEncryptionIcon;
QPushButton* labelConnectionsIcon;
QLabel* labelBlocksIcon;
QLabel* progressBarLabel;
QProgressBar* progressBar;
QProgressDialog* progressDialog;
QMenuBar* appMenuBar;
QAction* overviewAction;
QAction* historyAction;
QAction* masternodeAction;
QAction* quitAction;
QAction* sendCoinsAction;
QAction* usedSendingAddressesAction;
QAction* usedReceivingAddressesAction;
QAction* signMessageAction;
QAction* verifyMessageAction;
QAction* bip38ToolAction;
QAction* aboutAction;
QAction* receiveCoinsAction;
QAction* optionsAction;
QAction* toggleHideAction;
QAction* encryptWalletAction;
QAction* backupWalletAction;
QAction* changePassphraseAction;
QAction* unlockWalletAction;
QAction* lockWalletAction;
QAction* lockWalletAction2;
QAction* aboutQtAction;
QAction* openInfoAction;
QAction* openRPCConsoleAction;
QAction* openNetworkAction;
QAction* openPeersAction;
QAction* openRepairAction;
QAction* openConfEditorAction;
QAction* openMNConfEditorAction;
QAction* showBackupsAction;
QAction* openAction;
QAction* openBlockExplorerAction;
QAction* showHelpMessageAction;
QAction* multiSendAction;
QSystemTrayIcon* trayIcon;
QMenu* trayIconMenu;
Notificator* notificator;
RPCConsole* rpcConsole;
BlockExplorer* explorerWindow;
/** Keep track of previous number of blocks, to detect progress */
int prevBlocks;
int spinnerFrame;
/** Create the main UI actions. */
void createActions(const NetworkStyle* networkStyle);
/** Create the menu bar and sub-menus. */
void createMenuBar();
/** Create the toolbars */
void createToolBars();
/** Create system tray icon and notification */
void createTrayIcon(const NetworkStyle* networkStyle);
/** Create system tray menu (or setup the dock menu) */
void createTrayIconMenu();
/** Enable or disable all wallet-related actions */
void setWalletActionsEnabled(bool enabled);
/** Connect core signals to GUI client */
void subscribeToCoreSignals();
/** Disconnect core signals from GUI client */
void unsubscribeFromCoreSignals();
signals:
/** Signal raised when a URI was entered or dragged to the GUI */
void receivedURI(const QString& uri);
/** Restart handling */
void requestedRestart(QStringList args);
public slots:
/** Set number of connections shown in the UI */
void setNumConnections(int count);
/** Set number of blocks shown in the UI */
void setNumBlocks(int count);
/** Get restart command-line parameters and request restart */
void handleRestart(QStringList args);
/** Notify the user of an event from the core network or transaction handling code.
@param[in] title the message box / notification title
@param[in] message the displayed text
@param[in] style modality and style definitions (icon and used buttons - buttons only for message boxes)
@see CClientUIInterface::MessageBoxFlags
@param[in] ret pointer to a bool that will be modified to whether Ok was clicked (modal only)
*/
void message(const QString& title, const QString& message, unsigned int style, bool* ret = NULL);
void setStakingStatus();
#ifdef ENABLE_WALLET
/** Set the encryption status as shown in the UI.
@param[in] status current encryption status
@see WalletModel::EncryptionStatus
*/
void setEncryptionStatus(int status);
bool handlePaymentRequest(const SendCoinsRecipient& recipient);
/** Show incoming transaction notification for new transactions. */
void incomingTransaction(const QString& date, int unit, const CAmount& amount, const QString& type, const QString& address);
#endif // ENABLE_WALLET
private slots:
#ifdef ENABLE_WALLET
/** Switch to overview (home) page */
void gotoOverviewPage();
/** Switch to history (transactions) page */
void gotoHistoryPage();
/** Switch to Explorer Page */
void gotoBlockExplorerPage();
/** Switch to masternode page */
void gotoMasternodePage();
/** Switch to receive coins page */
void gotoReceiveCoinsPage();
/** Switch to send coins page */
void gotoSendCoinsPage(QString addr = "");
/** Show Sign/Verify Message dialog and switch to sign message tab */
void gotoSignMessageTab(QString addr = "");
/** Show Sign/Verify Message dialog and switch to verify message tab */
void gotoVerifyMessageTab(QString addr = "");
/** Show MultiSend Dialog */
void gotoMultiSendDialog();
/** Show BIP 38 tool - default to Encryption tab */
void gotoBip38Tool();
/** Show open dialog */
void openClicked();
#endif // ENABLE_WALLET
/** Show configuration dialog */
void optionsClicked();
/** Show about dialog */
void aboutClicked();
/** Show help message dialog */
void showHelpMessageClicked();
#ifndef Q_OS_MAC
/** Handle tray icon clicked */
void trayIconActivated(QSystemTrayIcon::ActivationReason reason);
#endif
/** Show window if hidden, unminimize when minimized, rise when obscured or show if hidden and fToggleHidden is true */
void showNormalIfMinimized(bool fToggleHidden = false);
/** Simply calls showNormalIfMinimized(true) for use in SLOT() macro */
void toggleHidden();
/** called by a timer to check if fRequestShutdown has been set **/
void detectShutdown();
/** Show progress dialog e.g. for verifychain */
void showProgress(const QString& title, int nProgress);
};
class UnitDisplayStatusBarControl : public QLabel
{
Q_OBJECT
public:
explicit UnitDisplayStatusBarControl();
/** Lets the control know about the Options Model (and its signals) */
void setOptionsModel(OptionsModel* optionsModel);
protected:
/** So that it responds to left-button clicks */
void mousePressEvent(QMouseEvent* event);
private:
OptionsModel* optionsModel;
QMenu* menu;
/** Shows context menu with Display Unit options by the mouse coordinates */
void onDisplayUnitsClicked(const QPoint& point);
/** Creates context menu, its actions, and wires up all the relevant signals for mouse events. */
void createContextMenu();
private slots:
/** When Display Units are changed on OptionsModel it will refresh the display text of the control on the status bar */
void updateDisplayUnit(int newUnits);
/** Tells underlying optionsModel to update its current display unit. */
void onMenuSelection(QAction* action);
};
#endif // BITCOIN_QT_BITCOINGUI_H
| [
"[email protected]"
] | |
f9b5ecb770c986bdbbfd762148aea8e85c8ea042 | 6fe26c7fb9f3ed167e0c78c73870986a450e1d8a | /Milestone-3/project_2_17.4/ip_repo/my_ip_hls/solution1/syn/systemc/fifo_w1_d64_A.h | a87c1fa6409cbefb5386078b3db441578b5671bd | [
"MIT"
] | permissive | CSpyridakis/Reconfigurable-Computing | 17b0bbd9b879c4dcf430d9b3fd682e1e2d254b4d | 345316489786c6470e47c66b0bf4a73d2ac4b0c0 | refs/heads/master | 2021-06-30T03:55:05.568758 | 2020-10-13T20:22:04 | 2020-10-13T20:22:04 | 173,803,738 | 0 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 5,513 | h | // ==============================================================
// File generated by Vivado(TM) HLS - High-Level Synthesis from C, C++ and SystemC
// Version: 2017.4
// Copyright (C) 1986-2017 Xilinx, Inc. All Rights Reserved.
//
// ==============================================================
#ifndef fifo_w1_d64_A_HH_
#define fifo_w1_d64_A_HH_
#include <systemc>
using namespace std;
SC_MODULE(fifo_w1_d64_A) {
static const unsigned int DATA_WIDTH = 1;
static const unsigned int ADDR_WIDTH = 7;
static const unsigned int fifo_w1_d64_A_depth = 65;
sc_core::sc_in_clk clk;
sc_core::sc_in< sc_dt::sc_logic > reset;
sc_core::sc_out< sc_dt::sc_logic > if_empty_n;
sc_core::sc_in< sc_dt::sc_logic > if_read_ce;
sc_core::sc_in< sc_dt::sc_logic > if_read;
sc_core::sc_out< sc_dt::sc_lv<DATA_WIDTH> > if_dout;
sc_core::sc_out< sc_dt::sc_logic > if_full_n;
sc_core::sc_in< sc_dt::sc_logic > if_write_ce;
sc_core::sc_in< sc_dt::sc_logic > if_write;
sc_core::sc_in< sc_dt::sc_lv<DATA_WIDTH> > if_din;
sc_core::sc_signal< sc_dt::sc_logic > internal_empty_n;
sc_core::sc_signal< sc_dt::sc_logic > internal_full_n;
sc_core::sc_signal< sc_dt::sc_lv<DATA_WIDTH> > mStorage[fifo_w1_d64_A_depth];
sc_core::sc_signal< sc_dt::sc_uint<ADDR_WIDTH> > mInPtr;
sc_core::sc_signal< sc_dt::sc_uint<ADDR_WIDTH> > mOutPtr;
sc_core::sc_signal< sc_dt::sc_uint<1> > mFlag_nEF_hint;
sc_core::sc_trace_file* mTrace;
SC_CTOR(fifo_w1_d64_A) : mTrace(0) {
const char* dump_vcd = std::getenv("AP_WRITE_VCD");
if (dump_vcd && string(dump_vcd) == "1") {
std::string tracefn = "sc_trace_" + std::string(name());
mTrace = sc_core::sc_create_vcd_trace_file( tracefn.c_str());
sc_trace(mTrace, clk, "(port)clk");
sc_trace(mTrace, reset, "(port)reset");
sc_trace(mTrace, if_full_n, "(port)if_full_n");
sc_trace(mTrace, if_write_ce, "(port)if_write_ce");
sc_trace(mTrace, if_write, "(port)if_write");
sc_trace(mTrace, if_din, "(port)if_din");
sc_trace(mTrace, if_empty_n, "(port)if_empty_n");
sc_trace(mTrace, if_read_ce, "(port)if_read_ce");
sc_trace(mTrace, if_read, "(port)if_read");
sc_trace(mTrace, if_dout, "(port)if_dout");
sc_trace(mTrace, mInPtr, "mInPtr");
sc_trace(mTrace, mOutPtr, "mOutPtr");
sc_trace(mTrace, mFlag_nEF_hint, "mFlag_nEF_hint");
}
mInPtr = 0;
mOutPtr = 0;
mFlag_nEF_hint = 0;
SC_METHOD(proc_read_write);
sensitive << clk.pos();
SC_METHOD(proc_dout);
sensitive << mOutPtr;
for (unsigned i = 0; i < fifo_w1_d64_A_depth; i++) {
sensitive << mStorage[i];
}
SC_METHOD(proc_ptr);
sensitive << mInPtr << mOutPtr<< mFlag_nEF_hint;
SC_METHOD(proc_status);
sensitive << internal_empty_n << internal_full_n;
}
~fifo_w1_d64_A() {
if (mTrace) sc_core::sc_close_vcd_trace_file(mTrace);
}
void proc_status() {
if_empty_n.write(internal_empty_n.read());
if_full_n.write(internal_full_n.read());
}
void proc_read_write() {
if (reset.read() == sc_dt::SC_LOGIC_1) {
mInPtr.write(0);
mOutPtr.write(0);
mFlag_nEF_hint.write(0);
}
else {
if (if_read_ce.read() == sc_dt::SC_LOGIC_1
&& if_read.read() == sc_dt::SC_LOGIC_1
&& internal_empty_n.read() == sc_dt::SC_LOGIC_1) {
sc_dt::sc_uint<ADDR_WIDTH> ptr;
if (mOutPtr.read().to_uint() == (fifo_w1_d64_A_depth-1)) {
ptr = 0;
mFlag_nEF_hint.write(~mFlag_nEF_hint.read());
}
else {
ptr = mOutPtr.read();
ptr++;
}
assert(ptr.to_uint() < fifo_w1_d64_A_depth);
mOutPtr.write(ptr);
}
if (if_write_ce.read() == sc_dt::SC_LOGIC_1
&& if_write.read() == sc_dt::SC_LOGIC_1
&& internal_full_n.read() == sc_dt::SC_LOGIC_1) {
sc_dt::sc_uint<ADDR_WIDTH> ptr;
ptr = mInPtr.read();
mStorage[ptr.to_uint()].write(if_din.read());
if (ptr.to_uint() == (fifo_w1_d64_A_depth-1)) {
ptr = 0;
mFlag_nEF_hint.write(~mFlag_nEF_hint.read());
} else {
ptr++;
assert(ptr.to_uint() < fifo_w1_d64_A_depth);
}
mInPtr.write(ptr);
}
}
}
void proc_dout() {
sc_dt::sc_uint<ADDR_WIDTH> ptr = mOutPtr.read();
if (ptr.to_uint() > fifo_w1_d64_A_depth) {
if_dout.write(sc_dt::sc_lv<DATA_WIDTH>());
}
else {
if_dout.write(mStorage[ptr.to_uint()]);
}
}
void proc_ptr() {
if (mInPtr.read() == mOutPtr.read() && mFlag_nEF_hint.read().to_uint()==0) {
internal_empty_n.write(sc_dt::SC_LOGIC_0);
}
else {
internal_empty_n.write(sc_dt::SC_LOGIC_1);
}
if (mInPtr.read() == mOutPtr.read() && mFlag_nEF_hint.read().to_uint()==1) {
internal_full_n.write(sc_dt::SC_LOGIC_0);
}
else {
internal_full_n.write(sc_dt::SC_LOGIC_1);
}
}
};
#endif //fifo_w1_d64_A_HH_
| [
"[email protected]"
] | |
6ab4bf5e764efd3752793185b2d143f952c51543 | 2a14f9cc24d61712b3c40858e23772e6c86db16a | /src/apps/pong.cpp | 8ff8b4d5660910f61727a715e0a24b643817cfef | [
"MIT"
] | permissive | GilDev/IntelliCasier | 9384edfeba01fde553ecfe08f334d0adb9046182 | e79c059abbdbae47c4412c21f49319ffc97f2f68 | refs/heads/master | 2021-01-16T23:02:25.940545 | 2016-05-27T17:20:55 | 2016-05-27T17:20:55 | 42,610,026 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,610 | cpp | #include <Arduino.h>
#include "menu.h"
#include "common.h"
#include "options.h"
#include "../config.h"
#include "../displays.h"
#include "../events.h"
static TimerId updateBallTimer = -1, updateSpeedTimer = -1;
static struct {
byte x:3;
byte y:3;
signed char xDir:2;
signed char yDir:2;
unsigned short speed; // In milliseconds
} ball;
static struct {
byte y:3;
byte score;
} players[2];
static void menu(byte data);
static void newRound(byte playerStarting);
static void endRound(void);
static void updateBall(byte data)
{
matrix.setLed(0, ball.y, ball.x, false);
if (ball.y <= 0 || ball.y >= 7)
ball.yDir *= -1;
if (ball.x == 1 || ball.x == 6) {
byte player = (ball.x == 1) ? 0 : 1;
if ((ball.y == players[player].y) || (ball.y == players[player].y + 1)) {
ball.xDir *= -1;
} else if (((ball.y == players[player].y - 1 && ball.yDir == 1) || (ball.y == players[player].y + 2 && ball.yDir == -1))) {
ball.xDir *= -1;
if (ball.y > 0 && ball.y < 7) // Avoid double y direction inversion
ball.yDir *= -1;
}
} else if (ball.x == 0 || ball.x == 7) { // Ball out of bound
printLcd((ball.x == 0) ? 13 : 2, 1, "+1");
wipeMatrix();
delay(500);
if (ball.x == 0) {
players[1].score++;
newRound(0);
} else {
players[0].score++;
newRound(1);
}
return;
}
ball.x += ball.xDir;
ball.y += ball.yDir;
matrix.setLed(0, ball.y, ball.x, true);
updateBallTimer = registerTimerEvent(ball.speed, updateBall, 0);
}
static void updateSpeed(byte data)
{
if (ball.speed > options[PONG_MIN_DELAY_O]) {
ball.speed -= 50;
updateSpeedTimer = registerTimerEvent(options[PONG_SPEED_INCREASES_DELAY_O], updateSpeed, 0);
}
}
static void up1(byte data)
{
if (players[0].y > 0) {
matrix.setLed(0, players[0].y + 1, 0, false);
matrix.setLed(0, --players[0].y, 0, true);
}
}
static void down1(byte data)
{
if (players[0].y < 6) {
matrix.setLed(0, players[0].y, 0, false);
matrix.setLed(0, ++players[0].y + 1, 0, true);
}
}
static void up2(byte data)
{
if (players[1].y > 0) {
matrix.setLed(0, players[1].y + 1, 7, false);
matrix.setLed(0, --players[1].y, 7, true);
}
}
static void down2(byte data)
{
if (players[1].y < 6) {
matrix.setLed(0, players[1].y, 7, false);
matrix.setLed(0, ++players[1].y + 1, 7, true);
}
}
static void menu(byte data)
{
endRound();
showMenu();
}
static void endRound(void)
{
cancelTimerEvent(&updateBallTimer);
cancelTimerEvent(&updateSpeedTimer);
}
static void start(void)
{
setRepeatClickHandler(PLAYER1_LEFT, options[PONG_PADDLE_DELAY_O], up1, 0);
setRepeatClickHandler(PLAYER1_RIGHT, options[PONG_PADDLE_DELAY_O], down1, 0);
setRepeatClickHandler(PLAYER2_LEFT, options[PONG_PADDLE_DELAY_O], up2, 0);
setRepeatClickHandler(PLAYER2_RIGHT, options[PONG_PADDLE_DELAY_O], down2, 0);
setSingleClickHandler(MENU, menu, 0);
matrix.setRow(0, 3, B10000001);
matrix.setRow(0, 4, B10000001);
matrix.setLed(0, ball.y, ball.x, true);
printLcd(2, 0, players[0].score);
printLcd(7, 0, "--");
printLcd(13, 0, players[1].score);
delay(500);
updateBallTimer = registerTimerEvent(ball.speed, updateBall, 0);
updateSpeedTimer = registerTimerEvent(options[PONG_SPEED_INCREASES_DELAY_O], updateSpeed, 0);
}
static void newRound(byte playerStarting)
{
endRound();
ball.x = (playerStarting == 0) ? 2 : 5;
ball.y = random(1, 7);
ball.xDir = (playerStarting == 0) ? 1 : -1;
ball.yDir = (random(0, 2)) ? 1 : -1;
ball.speed = options[PONG_START_DELAY_O];
players[0].y = players[1].y = 3;
countdown(start, menu);
}
void showPong(void)
{
players[0].score = players[1].score = 0;
newRound(0);
}
| [
"[email protected]"
] | |
f560106d1fed8294235311b7c1e52c13349d1440 | 179b422ad1f7fd9c92cc24ea55bd213837f6c807 | /Institute-Management.cpp | 8b04611842b6a9526be9c5a05fe91f7acd48a433 | [] | no_license | gagansharma2717/Institute-Management-System | 9481c8cc75f7bdf62693ad16cbd1c694b5339ef5 | 8c6a3792861bc73cf4065f42b1dffea782d7b0e3 | refs/heads/master | 2023-06-02T13:55:11.099017 | 2021-06-26T19:34:34 | 2021-06-26T19:34:34 | 380,581,876 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 25,951 | cpp | #include<iostream>
#include<conio.h>
#include<fstream>
#include<stdlib.h>
#include<string.h>
using namespace std;
class Address{
protected:
int house;
char city[20],state[20];
static char inst[6];
};
char Address::inst[]="PIET";
class Student:public Address{
protected:
int age,roll,p,c,m,h,e,total;
float avg;
char grade[5];
char name[20],email[20],pass[20];
public:
void edit()
{
while(1)
{
int ch;
cout<<"\n\n______________________UPDATION MENU_______________________\n";
cout<<"\n1. Name";
cout<<"\n2. Age";
cout<<"\n3. Roll-no.";
cout<<"\n4. E-Mail";
cout<<"\n5. Password";
cout<<"\n6. House-No.";
cout<<"\n7. City";
cout<<"\n8. State";
cout<<"\n9. Marks";
cout<<"\n10.Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter your choice: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new name: ";
cin>>name;
cout<<"Updation Done...";
break;
case 2:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new age: ";
cin>>age;
cout<<"Updation Done...";
break;
case 3:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new roll-no: ";
cin>>roll;
cout<<"Updation Done...";
break;
case 4:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new e-mail: ";
cin>>email;
cout<<"Updation Done...";
break;
case 5:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new password: ";
cin>>pass;
cout<<"Updation Done...";
break;
case 6:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new house-no: ";
cin>>house;
cout<<"Updation Done...";
break;
case 7:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new city: ";
cin>>city;
cout<<"Updation Done...";
break;
case 8:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new state: ";
cin>>state;
cout<<"Updation Done...";
break;
case 9:
{
int che;
cout<<"\n----------------------------------------------------------";
cout<<"\n\n___________________MARKS UPDATION MENU____________________\n";
cout<<"\n1. English";
cout<<"\n2. Hindi";
cout<<"\n3. Maths";
cout<<"\n4. Physics";
cout<<"\n5. Chemistry";
cout<<"\n6. Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter your choice: ";
cin>>che;
switch(che)
{
case 1:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new marks in english: ";
cin>>e;
cout<<"Updation Done...";
break;
case 2:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new marks in hindi: ";
cin>>h;
cout<<"Updation Done...";
break;
case 3:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new marks in maths: ";
cin>>m;
cout<<"Updation Done...";
break;
case 4:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new marks in physics: ";
cin>>p;
cout<<"Updation Done...";
break;
case 5:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new marks in chemistry: ";
cin>>c;
cout<<"Updation Done...";
break;
case 6:
break;
default:
cout<<"\n----------------------------------------------------------";
cout<<"\nInvalid choice...";
break;
}
total=h+e+m+p+c;
avg=(float)total/5;
if(avg>=90 && avg<=100)
strcpy(grade,"A+");
else if(avg>=80 && avg<90)
strcpy(grade,"A");
else if(avg>=70 && avg<80)
strcpy(grade,"A-");
else if(avg>=60 && avg<70)
strcpy(grade,"B+");
else if(avg>=50 && avg<60)
strcpy(grade,"B");
else if(avg>=40 && avg<50)
strcpy(grade,"B-");
else
strcpy(grade,"Fail");
break;
}
case 10:
break;
default:
cout<<"\n----------------------------------------------------------";
cout<<"Invalid choice...";
break;
}
if(ch==10)
break;
}
}
void get_student();
void display_marksheet();
void display_student();
void display_stdmail();
int roll_check()
{
return roll;
}
int std_check()
{
char str[20],p[20];
int ch,i;
cout<<"----------------------------------------------------------";
cout<<"\nEnter the e-mail id: ";
cin>>str;
cout<<"Enter the password: ";
while(1)
{
ch=getch();
if(ch==13)
break;
p[i]=ch;
printf("*");
i++;
}
cout<<"\n----------------------------------------------------------\n";
p[i]='\0';
if((strcmp(str,email)==0)&&strcmp(p,pass)==0)
return 0;
else
return 1;
}
};
class Employee:public Address{
protected:
int basic,gross,itax,net,emp_id;
int ta,da,hra,ma;
char name[20],dsg[20],email_id[20],password[20];
public:
void edit()
{
while(1)
{
int ch;
cout<<"\n\n______________________UPDATION MENU_______________________\n";
cout<<"\n1. Name";
cout<<"\n2. Employee_Id";
cout<<"\n3. Basic Salary";
cout<<"\n4. E-Mail";
cout<<"\n5. Password";
cout<<"\n6. House-No.";
cout<<"\n7. City";
cout<<"\n8. State";
cout<<"\n9. Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter your choice: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new name: ";
cin>>name;
cout<<"Updation Done...";
break;
case 2:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new employee_id: ";
cin>>emp_id;
cout<<"Updation Done...";
break;
case 3:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new basic salary: ";
cin>>basic;
calculate_salary();
cout<<"Updation Done...";
break;
case 4:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new e-mail: ";
cin>>email_id;
cout<<"Updation Done...";
break;
case 5:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new password: ";
cin>>password;
cout<<"Updation Done...";
break;
case 6:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new house-no: ";
cin>>house;
cout<<"Updation Done...";
break;
case 7:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new city: ";
cin>>city;
cout<<"Updation Done...";
break;
case 8:
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter new state: ";
cin>>state;
cout<<"Updation Done...";
break;
case 9:
break;
default:
cout<<"\n----------------------------------------------------------";
cout<<"Invalid choice...";
break;
}
if(ch==9)
break;
}
}
void get_employee();
void display_employee();
void display_empmail();
void display_slip();
void calculate_salary();
int emp()
{
return emp_id;
}
int employee_check()
{
char str[20],p[20];
int ch,i;
cout<<"----------------------------------------------------------";
cout<<"\nEnter the e-mail id: ";
cin>>str;
cout<<"Enter the password: ";
while(1)
{
ch=getch();
if(ch==13)
break;
p[i]=ch;
printf("*");
i++;
}
cout<<"\n----------------------------------------------------------\n";
p[i]='\0';
if((strcmp(str,email_id)==0)&&strcmp(p,password)==0)
return 0;
else
return 1;
}
};
void Student::get_student()
{
cout<<"\nEnter the name of the student: ";
fflush(stdin);
cin.get(name,20);
cout<<"Enter the age: ";
cin>>age;
cout<<"Enter the roll number: ";
cin>>roll;
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter the e-mail id: ";
fflush(stdin);
cin.get(email,20);
cout<<"Enter the password: ";
fflush(stdin);
cin.get(pass,20);
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter the house number: ";
cin>>house;
cout<<"Enter the city name: ";
fflush(stdin);
cin.get(city,20);
cout<<"Enter the state name: ";
fflush(stdin);
cin.get(state,20);
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter the marks in hindi: ";
cin>>h;
cout<<"Enter the marks in english: ";
cin>>e;
cout<<"Enter the marks in maths:";
cin>>m;
cout<<"Enter the marks in physics: ";
cin>>p;
cout<<"Enter the marks in chemistry: ";
cin>>c;
total=h+e+m+p+c;
avg=(float)total/5;
if(avg>=90 && avg<=100)
strcpy(grade,"A+");
else if(avg>=80 && avg<90)
strcpy(grade,"A");
else if(avg>=70 && avg<80)
strcpy(grade,"A-");
else if(avg>=60 && avg<70)
strcpy(grade,"B+");
else if(avg>=50 && avg<60)
strcpy(grade,"B");
else if(avg>=40 && avg<50)
strcpy(grade,"B-");
else
strcpy(grade,"Fail");
}
void Student::display_student()
{
cout<<endl<<name<<"\t"<<roll<<"\t"<<age<<"\t"<<total<<"\t"<<avg<<"\t"<<grade<<"\t"<<inst<<"\t"<<house<<"\t"<<city<<"\t"<<state;
}
void Student::display_stdmail()
{
cout<<endl<<name<<"\t"<<roll<<"\t"<<email<<"\t\t"<<pass;
}
void Student::display_marksheet()
{
cout<<"\n\n_______________>>>MARKSHEET<<<____________________________";
cout<<"\nName : "<<name;
cout<<"\nAge : "<<age;
cout<<"\nRoll-No.: : "<<roll;
cout<<"\n----------------------------------------------------------";
cout<<"\nH-No. : "<<house;
cout<<"\nCity : "<<city;
cout<<"\nState : "<<state;
cout<<"\n----------------------------------------------------------";
cout<<"\nPhy\tChe\tMath\tHin\tEng";
cout<<endl<<p<<"\t"<<c<<"\t"<<m<<"\t"<<h<<"\t"<<e;
cout<<"\n----------------------------------------------------------";
cout<<"\nTotal : "<<total;
cout<<"\nGrade : "<<grade;
cout<<"\nAvg. : "<<avg;
}
void Employee::get_employee()
{
cout<<"\nEnter the name of the employee: ";
fflush(stdin);
cin.get(name,20);
cout<<"Enter the employee id: ";
cin>>emp_id;
cout<<"Enter the basic salary: ";
cin>>basic;
cout<<"----------------------------------------------------------";
cout<<"\nEnter the e-mail id: ";
fflush(stdin);
cin.get(email_id,20);
cout<<"Enter the password: ";
fflush(stdin);
cin.get(password,20);
cout<<"----------------------------------------------------------";
cout<<"\nEnter the house number: ";
cin>>house;
cout<<"Enter the city name: ";
fflush(stdin);
cin.get(city,20);
cout<<"Enter the state name: ";
fflush(stdin);
cin.get(state,20);
system("cls");
}
void Employee::calculate_salary()
{
if(basic>=20000)
{
ta=basic*7/100;
da=basic*8/100;
hra=basic*9/100;
ma=1500;
itax=basic*5/100;
}
else{
ta=basic*3/100;
da=basic*4/100;
hra=basic*5/100;
ma=500;
itax=0;
}
gross=basic+ta+da+hra+ma;
net=gross-itax;
}
void Employee::display_slip()
{
cout<<"\n\n____________________>>> SALARY SLIP <<<___________________"<<endl;
cout<<"\nEmployee Id : "<<emp_id<<endl;
cout<<"\nEmployee Name : "<<name<<endl;
cout<<"\nBasic Salary : "<<basic<<endl;
cout<<"\n__________________________________________________________"<<endl;
cout<<"\nTA\tDA\tHRA\tMA";
cout<<"\n";
cout<<ta<<"\t"<<da<<"\t"<<hra<<"\t"<<ma<<endl;
cout<<"\n__________________________________________________________"<<endl;
cout<<"\nGross Salary : "<<gross<<endl;
cout<<"\nIncome Tax : "<<itax<<endl;
cout<<"\nNet Salary : "<<net<<endl;
}
void Employee::display_employee()
{
cout<<endl<<name<<"\t"<<emp_id<<"\t"<<basic<<"\t"<<gross<<"\t"<<itax<<"\t"<<net<<"\t"<<inst<<"\t"<<house<<"\t"<<city<<"\t"<<state;
}
void Employee::display_empmail()
{
cout<<endl<<name<<"\t"<<emp_id<<"\t\t"<<email_id<<"\t\t"<<password;
}
int admin();
void admin_menu();
void employee_login();
void employee_menu();
void create_employee();
void display_employee();
void display_empmail();
void delete_employee();
void edit_employee();
void search_employee();
void student_login();
void student_menu();
void create_student();
void display_student();
void display_stdmail();
void delete_student();
void edit_student();
void search_student();
int main()
{
int ch;
while(1)
{
cout<<"\n\n______Panipat Instiute of Engineering and Technology______\n";
cout<<"\n1. Admin Login";
cout<<"\n2. Employee Login";
cout<<"\n3. Student Login";
cout<<"\n4. Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter choice: ";
cin>>ch;
cout<<"\n----------------------------------------------------------";
switch(ch)
{
case 1:
if(admin()==0)
{
system("cls");
admin_menu();
}
else
{
cout<<"\n----------------------------------------------------------";
cout<<"\nInvalid e-mail id or password";
cout<<"\n----------------------------------------------------------";
}
break;
case 2:
employee_login();
break;
case 3:
student_login();
break;
case 4:
cout<<"\n---->>>>Thanks For Using Our Services<<<<----";
exit(0);
default:
cout<<"\nInvalid Choice...";
cout<<"\n----------------------------------------------------------";
break;
}
}
}
int admin()
{
char str[20],p[20];
int ch,i;
char admin_name[]="Gagan Sharma";
char id[]="[email protected]";
char password[]="7015335614";
cout<<"\nEnter the admin e-mail id: ";
fflush(stdin);
cin.get(str,20);
cout<<"Enter the admin password : ";
while(1)
{
ch=getch();
if(ch==13)
break;
p[i]=ch;
printf("*");
i++;
}
p[i]='\0';
if((strcmp(str,id)==0)&&(strcmp(p,password)==0))
return 0;
else
return 1;
}
void admin_menu()
{
int ch;
system("cls");
while(1)
{
cout<<"\n\n____________________>>>>Admin Menu<<<<____________________\n";
cout<<"\n1. Add Employee";
cout<<"\n2. Display Employee Details";
cout<<"\n3. Display Employee E-mail Details";
cout<<"\n4. Delete Employee";
cout<<"\n5. Edit Employee Details";
cout<<"\n6. Search Employee";
cout<<"\n7. Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter choice: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\n----------------------------------------------------------";
create_employee();
cout<<"\n----------------------------------------------------------";
break;
case 2:
cout<<"\n------------------------------------------------------------------------------";
display_employee();
cout<<"\n------------------------------------------------------------------------------";
break;
case 3:
cout<<"\n----------------------------------------------------------";
display_empmail();
cout<<"\n----------------------------------------------------------";
break;
case 4:
cout<<"\n----------------------------------------------------------";
delete_employee();
cout<<"\n----------------------------------------------------------";
break;
case 5:
cout<<"\n----------------------------------------------------------";
edit_employee();
cout<<"\n----------------------------------------------------------";
break;
case 6:
cout<<"\n----------------------------------------------------------";
search_employee();
cout<<"\n----------------------------------------------------------";
break;
case 7:
cout<<"\n----------------------------------------------------------";
break;
default:
cout<<"\nInvalid Choice...";
cout<<"\n----------------------------------------------------------";
break;
}
if(ch==7)
break;
}
}
void create_employee()
{
ofstream file;
file.open("inst.txt",ios::binary|ios::app|ios::out);
Employee e;
e.get_employee();
e.calculate_salary();
file.seekp(0,ios::end);
file.write((char*)&e,sizeof(e));
file.close();
}
void display_employee()
{
Employee e;
ifstream file;
file.open("inst.txt",ios::binary|ios::in);
if(file==NULL)
printf("\nNo Record Available...");
else
{
cout<<"\nName\tId\tBasic\tGross\tItax\tNet\tInst.\tH-No.\tCity\tState\n";
while(file.read((char*)&e,sizeof(e)))
{
e.display_employee();
}
file.close();
}
}
void display_empmail()
{
Employee e;
ifstream file;
file.open("inst.txt",ios::binary|ios::in);
if(file==NULL)
printf("\nNo Record Available...");
else
{
cout<<"\nName\tEmployee-Id\tE-Mail\t\t\tPassword\n";
while(file.read((char*)&e,sizeof(e)))
{
e.display_empmail();
}
file.close();
}
}
void delete_employee()
{
int f,num;
Employee e;
ifstream file;
file.open("inst.txt",ios::binary|ios::in);
ofstream temp;
temp.open("temp1.txt",ios::out);
if(file==NULL)
cout<<"\nNo Information to Delete...";
else
{
cout<<"\nEnter the employee_id to delete: ";
cin>>num;
f=0;
while(file.read((char*)&e,sizeof(e)))
{
if(num!=e.emp())
{
f=1;
temp.seekp(0,ios::end);
temp.write((char*)&e,sizeof(e));
}
}
file.close();
temp.close();
remove("inst.txt");
rename("temp1.txt","inst.txt");
cout<<"\nDeletion Done...";
}
if(f==0)
cout<<"\nInvalid Employee_Id...";
}
void edit_employee()
{
fstream file;
Employee e;
file.open("inst.txt",ios::binary|ios::in|ios::out);
if(file==NULL)
cout<<"\nNo Record to Edit...";
else
{
int num,f=0;
cout<<"\nEnter the employee-id to edit: ";
cin>>num;
while(file.read((char*)&e,sizeof(e)))
{
if(num==e.emp())
{
f=1;
e.edit();
file.seekp(-sizeof(e),ios::cur);
file.write((char*)&e,sizeof(e));
}
}
file.close();
if(f==0)
cout<<"\nInvalid Employee id...";
}
}
void search_employee()
{
Employee e;
ifstream file;
file.open("inst.txt",ios::binary|ios::in);
if(file==NULL)
cout<<"\nNo Record to Search...";
else
{
int num,f=0;
cout<<"\nEnter the employee id: ";
cin>>num;
while(file.read((char*)&e,sizeof(e)))
{
if(num==e.emp())
{
f=1;
e.display_slip();
}
}
file.close();
if(f==0)
cout<<"\nInvalid Employee-id...";
}
}
void employee_login()
{
Employee e;
ifstream file;
file.open("inst.txt",ios::binary|ios::in);
if(file==NULL)
{
cout<<"\nNo Such Employee Exist...";
cout<<"\n----------------------------------------------------------";
}
else
{
int num;
cout<<"\nEnter the employee-id: ";
cin>>num;
int f=0;
while(file.read((char*)&e,sizeof(e)))
{
if(num==e.emp())
{
f=1;
if(e.employee_check()==0)
{
employee_menu();
}
else
cout<<"\nInvalid Mail Id or Password";
}
}
if(f==0)
cout<<"\nNo Such Employee Exist...";
cout<<"\n----------------------------------------------------------";
file.close();
}
}
void employee_menu()
{
int ch;
while(1)
{
cout<<"\n\n______________>>>>Employee Menu<<<<_______________________\n";
cout<<"\n1. Add Student";
cout<<"\n2. Display Student Details";
cout<<"\n3. Display Student E-mail Details";
cout<<"\n4. Delete Student";
cout<<"\n5. Edit Student Details";
cout<<"\n6. Search Student";
cout<<"\n7. Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter choice: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\n----------------------------------------------------------";
create_student();
cout<<"\n----------------------------------------------------------";
break;
case 2:
cout<<"\n------------------------------------------------------------------------------";
display_student();
cout<<"\n------------------------------------------------------------------------------";
break;
case 3:
cout<<"\n----------------------------------------------------------";
display_stdmail();
cout<<"\n----------------------------------------------------------";
break;
case 4:
cout<<"\n----------------------------------------------------------";
delete_student();
cout<<"\n----------------------------------------------------------";
break;
case 5:
cout<<"\n----------------------------------------------------------";
edit_student();
cout<<"\n----------------------------------------------------------";
break;
case 6:
cout<<"\n----------------------------------------------------------";
search_student();
cout<<"\n----------------------------------------------------------";
break;
case 7:
break;
default:
cout<<"\nInvalid Choice...";
cout<<"\n----------------------------------------------------------";
break;
}
if(ch==7)
break;
}
}
void create_student()
{
ofstream file;
file.open("inst_std.txt",ios::binary|ios::app|ios::out);
Student s;
s.get_student();
file.seekp(0,ios::end);
file.write((char*)&s,sizeof(s));
file.close();
}
void display_student()
{
Student s;
ifstream file;
file.open("inst_std.txt",ios::binary|ios::in);
if(file==NULL)
printf("\nNo Such Student Exist...");
else
{
cout<<"\nName\tRoll\tAge\tTotal\tAvg.\tGrade\tInst.\tH-no.\tCity\tState\n";
while(file.read((char*)&s,sizeof(s)))
{
s.display_student();
}
file.close();
}
}
void display_stdmail()
{
Student s;
ifstream file;
file.open("inst_std.txt",ios::binary|ios::in);
if(file==NULL)
printf("\nNo Such Student Exist...");
else
{
cout<<"\nName\tRoll\tE-Mail\t\t\tPassword\n";
while(file.read((char*)&s,sizeof(s)))
{
s.display_stdmail();
}
file.close();
}
}
void delete_student()
{
int f,num;
Student e;
ifstream file;
file.open("inst_std.txt",ios::binary|ios::in);
ofstream temp;
temp.open("temp.txt",ios::out);
if(file==NULL)
cout<<"\nNo Information to Delete...";
else
{
cout<<"\nEnter the roll-number to delete: ";
cin>>num;
f=0;
while(file.read((char*)&e,sizeof(e)))
{
if(num!=e.roll_check())
{
f=1;
temp.seekp(0,ios::end);
temp.write((char*)&e,sizeof(e));
}
}
file.close();
temp.close();
remove("inst_std.txt");
rename("temp.txt","inst_std.txt");
cout<<"\nDeletion Done...";
}
if(f==0)
cout<<"\nInvalid Roll-Number...";
}
void edit_student()
{
fstream file;
Student e;
file.open("inst_std.txt",ios::binary|ios::in|ios::out);
if(file==NULL)
cout<<"\nNo Record to Edit...";
else
{
int num,f=0;
cout<<"\nEnter the Roll-Number to edit: ";
cin>>num;
while(file.read((char*)&e,sizeof(e)))
{
if(num==e.roll_check())
{
f=1;
e.edit();
file.seekp(-sizeof(e),ios::cur);
file.write((char*)&e,sizeof(e));
}
}
file.close();
if(f==0)
cout<<"\nInvalid Roll Number...";
}
}
void search_student()
{
Student e;
ifstream file;
file.open("inst_std.txt",ios::binary|ios::in);
if(file==NULL)
cout<<"\nNo Record to Search...";
else
{
int num,f=0;
cout<<"\nEnter the roll-number: ";
cin>>num;
cout<<"\n----------------------------------------------------------";
while(file.read((char*)&e,sizeof(e)))
{
if(num==e.roll_check())
{
f=1;
e.display_marksheet();
}
}
file.close();
if(f==0)
cout<<"\nInvalid Roll-Number...";
}
}
void student_login()
{
Student s;
ifstream file;
file.open("inst_std.txt",ios::binary|ios::in);
if(file==NULL)
{
cout<<"\nNo Such Student Exist...";
cout<<"\n----------------------------------------------------------";
}
else
{
int num;
cout<<"\nEnter the roll-number: ";
cin>>num;
int f=0;
while(file.read((char*)&s,sizeof(s)))
{
if(num==s.roll_check())
{
f=1;
if(s.std_check()==0)
{
student_menu();
}
else
cout<<"Invaid Mail Id or Password";
}
}
if(f==0)
cout<<"\nNo Such Student Exist...";
cout<<"\n----------------------------------------------------------";
file.close();
}
}
void student_menu()
{
int ch;
while(1)
{
cout<<"\n\n______________________>>>>Student Menu<<<<________________\n";
cout<<"\n1. Display Own Details";
cout<<"\n2. Display All Result";
cout<<"\n3. Exit\n";
cout<<"\n----------------------------------------------------------";
cout<<"\nEnter choice: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\n----------------------------------------------------------";
search_student();
cout<<"\n----------------------------------------------------------";
break;
case 2:
cout<<"\n------------------------------------------------------------------------------";
display_student();
cout<<"\n------------------------------------------------------------------------------";
break;
case 3:
break;
default:
cout<<"\nInvalid Choice...";
cout<<"\n----------------------------------------------------------";
break;
}
if(ch==3)
break;
}
}
| [
"[email protected]"
] | |
ed7e703dbf007ca2dd7a04ae9f782d7e09235ee1 | 92c90b83ef7a1e597691ccf45e10337b601f9293 | /kod_arduino/kod_arduino.ino | 1c4cc42ee05a7e4a9b060f15ea2110214417fbec | [] | no_license | sdziho/mechatronics | 969b9ab968dae0ee2461e8a82e40c5d30632646e | 050697f7dd351627ad9daaa86fe50959cac1229f | refs/heads/master | 2023-01-01T03:12:45.597719 | 2020-10-19T18:48:10 | 2020-10-19T18:48:10 | 305,482,498 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,021 | ino | /*------------------------------------------------------------------------------
LIDARLite Arduino Library
GetDistancePwm
This example shows how to read distance from a LIDAR-Lite connected over the
PWM interface.
Connections:
LIDAR-Lite 5 Vdc (red) to Arduino 5v
LIDAR-Lite Ground (black) to Arduino GND
LIDAR-Lite Mode control (yellow) to Arduino digital input (pin 3)
LIDAR-Lite Mode control (yellow) to 1 kOhm resistor lead 1
1 kOhm resistor lead 2 to Arduino digital output (pin 2)
(Capacitor recommended to mitigate inrush current when device is enabled)
680uF capacitor (+) to Arduino 5v
680uF capacitor (-) to Arduino GND
See the Operation Manual for wiring diagrams and more information:
http://static.garmin.com/pumac/LIDAR_Lite_v3_Operation_Manual_and_Technical_Specifications.pdf
------------------------------------------------------------------------------*/
#include <Servo.h>
unsigned long pulseWidth;
Servo motor;
int pozicija=0;
void setup()
{
Serial.begin(115200); // Start serial communications
pinMode(2, OUTPUT); // Set pin 2 as trigger pin
digitalWrite(2, LOW); // Set trigger LOW for continuous read
pinMode(7, INPUT); // Set pin 3 as monitor pin
motor.attach(9);
}
void loop()
{
for (pozicija = 0; pozicija <= 180; pozicija += 1) {
motor.write(pozicija);
pulseWidth = pulseIn(7, HIGH);
if(pulseWidth != 0){
pulseWidth = pulseWidth / 10;
Serial.print(pozicija);
Serial.print(",");
Serial.print(pulseWidth);
Serial.print(".");
}
delay(15);
}
for (pozicija = 180; pozicija >= 0; pozicija -= 1) {
motor.write(pozicija);
pulseWidth = pulseIn(7, HIGH); //puls u mikrosekundama
if(pulseWidth != 0){
pulseWidth = pulseWidth / 10; //dobivamo cm
Serial.print(pozicija);
Serial.print(",");
Serial.print(pulseWidth);
Serial.print(".");
}
delay(15);
}
}
| [
"[email protected]"
] | |
6c9b7bbc3082742cd21c455d94b2473e169c6301 | 8c0fe1f3a78cdd07ebd4d066db03fd06563bbd52 | /Contests/3. push_back(1)/7. count_it/simple.cpp | b9fe10ce891780c56ae8d1cf1c9acf09ec66d939 | [] | no_license | GeekGrave/my_coding | 19d648e7139651ea4d95ea9f85439bb029a153a8 | f04af612f09fc42271494203326b57266adbcdca | refs/heads/main | 2023-04-25T22:37:16.360021 | 2021-05-08T12:58:55 | 2021-05-08T12:58:55 | 365,496,897 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 195 | cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int s;
cin>>s;
int x=s;
cout<<x/2+1<<"\n";
}
return 0;
}
| [
"[email protected]"
] | |
a4bd627408e9bcedf6657e79f801827fa01d8607 | 0415e9feaf2cf5ce206d63387a73fb658e04d161 | /riegeli/bytes/backward_writer.h | ea41ce57b5f8355727ad3eb890719960fd0dd860 | [
"Apache-2.0"
] | permissive | gregorycollins/riegeli | 6e5b8a80cc050c62d121d1cda023649b31dc2391 | c7f6254b7fdc2e0de7e35c68f59e3cdac90f97a2 | refs/heads/master | 2020-09-08T08:07:39.174026 | 2019-11-11T21:22:41 | 2019-11-11T21:22:41 | 221,072,802 | 0 | 0 | Apache-2.0 | 2019-11-11T21:24:36 | 2019-11-11T21:24:36 | null | UTF-8 | C++ | false | false | 12,650 | h | // Copyright 2017 Google LLC
//
// 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 RIEGELI_BYTES_BACKWARD_WRITER_H_
#define RIEGELI_BYTES_BACKWARD_WRITER_H_
#include <stddef.h>
#include <cstring>
#include <limits>
#include <string>
#include <utility>
#include "absl/base/attributes.h"
#include "absl/base/optimization.h"
#include "absl/strings/string_view.h"
#include "riegeli/base/base.h"
#include "riegeli/base/chain.h"
#include "riegeli/base/object.h"
#include "riegeli/base/status.h"
namespace riegeli {
// Abstract class `BackwardWriter` writes sequences of bytes to a destination,
// like `Writer`, but back to front.
//
// Sequential writing is supported, random access is not supported, truncation
// is optionally supported.
class BackwardWriter : public Object {
public:
// Ensures that enough space is available for writing: pushes previously
// written data to the destination, and points `cursor()` and `limit()` to
// space with length at least `min_length`, preferably `recommended_length`.
// If enough space was already available, does nothing.
//
// If `recommended_length < min_length`, `recommended_length` is assumed to be
// `min_length`.
//
// Return values:
// * `true` - success (`available() >= min_length`)
// * `false` - failure (`available() < min_length`, `!healthy()`)
bool Push(size_t min_length = 1, size_t recommended_length = 0);
// Buffer pointers. Space between `start()` (exclusive upper bound) and
// `limit()` (inclusive lower bound) is available for writing data to it, with
// `cursor()` pointing to the current position going downwards (past the next
// byte to write).
//
// Invariants:
// `start() >= cursor() >= limit()` (possibly all `nullptr`)
// if `!healthy()` then `start() == cursor() == limit() == nullptr`
char* start() const { return start_; }
char* cursor() const { return cursor_; }
char* limit() const { return limit_; }
// Updates the value of `cursor()`. Call this during writing data under
// `cursor()` to indicate how much was written, or to seek within the buffer.
//
// Precondition: `start() >= cursor >= limit()`
void set_cursor(char* cursor);
// Returns the amount of space available in the buffer, between `cursor()` and
// `limit()`.
//
// Invariant: if `!healthy()` then `available() == 0`
size_t available() const { return PtrDistance(limit_, cursor_); }
// Returns the buffer size, between `start()` and `limit()`.
//
// Invariant: if `!healthy()` then `buffer_size() == 0`
size_t buffer_size() const { return PtrDistance(limit_, start_); }
// Returns the amount of data written to the buffer, between `start()` and
// `cursor()`.
//
// Invariant: if `!healthy()` then `written_to_buffer() == 0`
size_t written_to_buffer() const { return PtrDistance(cursor_, start_); }
// Prepends a fixed number of bytes from `src` to the buffer, pushing data to
// the destination as needed.
//
// Return values:
// * `true` - success (`src.size()` bytes written)
// * `false` - failure (a suffix of less than `src.size()` bytes written,
// `!healthy()`)
bool Write(absl::string_view src);
bool Write(std::string&& src);
bool Write(const char* src);
bool Write(const Chain& src);
bool Write(Chain&& src);
// Pushes data written between `start()` and `cursor()` to the destination.
//
// Additionally, attempts to ensure the following, depending on `flush_type`
// (without a guarantee though):
// * `FlushType::kFromObject` - nothing
// * `FlushType::kFromProcess` - data survives process crash
// * `FlushType::kFromMachine` - data survives operating system crash
//
// The precise meaning of `Flush()` depends on the particular
// `BackwardWriter`. The intent is to make data written so far visible, but in
// contrast to `Close()`, keeping the possibility to write more data later.
//
// Return values:
// * `true ` - success (`healthy()`)
// * `false` - failure (`!healthy()`)
virtual bool Flush(FlushType flush_type) = 0;
// Returns the current position (increasing as data are prepended).
//
// This is not necessarily 0 after creating the `BackwardWriter` if it
// prepends to a destination with existing contents, or if the
// `BackwardWriter` wraps another writer or output stream propagating its
// position.
//
// This may decrease when the `BackwardWriter` becomes unhealthy (due to
// buffering, previously written but unflushed data may be lost).
//
// `pos()` is unchanged by a successful `Close()`.
Position pos() const;
// Returns `true` if this `BackwardWriter` supports `Truncate()`.
virtual bool SupportsTruncate() const { return false; }
// Discards the part of the destination after the given position. Sets the
// current position to the new end.
//
// Return values:
// * `true` - success
// (destination truncated, `healthy()`)
// * `false` (when `healthy()`) - destination is smaller than `new_size`
// (position is set to end)
// * `false` (when `!healthy()`) - failure
virtual bool Truncate(Position new_size);
protected:
// Creates a `BackwardWriter` with the given initial state.
explicit BackwardWriter(InitiallyClosed) noexcept
: Object(kInitiallyClosed) {}
explicit BackwardWriter(InitiallyOpen) noexcept : Object(kInitiallyOpen) {}
// Moves the part of the object defined in this class.
//
// Buffer pointers do not need to satisfy their invariants during this part of
// the move, here they are merely exchanged with `nullptr` and copied.
BackwardWriter(BackwardWriter&& that) noexcept;
BackwardWriter& operator=(BackwardWriter&& that) noexcept;
// Makes `*this` equivalent to a newly constructed `BackwardWriter`. This
// avoids constructing a temporary `BackwardWriter` and moving from it.
// Derived classes which override `Reset()` should include a call to
// `BackwardWriter::Reset()`.
void Reset(InitiallyClosed);
void Reset(InitiallyOpen);
// `BackwardWriter` overrides `Object::Done()` to set buffer pointers to
// `nullptr`. Derived classes which override it further should include a call
// to `BackwardWriter::Done()`.
void Done() override;
// `BackwardWriter` overrides `Object::Fail()` to set buffer pointers to
// `nullptr`. Derived classes which override it further should include a call
// to `BackwardWriter::Fail()`.
using Object::Fail;
ABSL_ATTRIBUTE_COLD bool Fail(Status status) override;
// Marks the `BackwardWriter` as failed with message
// "BackwardWriter position overflow". Always returns `false`.
//
// This can be called if the destination would exceed its maximum possible
// size or if `start_pos_` would overflow.
//
// Precondition: `!closed()`
ABSL_ATTRIBUTE_COLD bool FailOverflow();
// Implementation of the slow part of `Push()`.
//
// Precondition: `min_length > available()`
virtual bool PushSlow(size_t min_length, size_t recommended_length) = 0;
// Implementation of the slow part of `Write()`.
//
// By default `WriteSlow(absl::string_view)` is implemented in terms of
// `Push()`; `WriteSlow(const Chain&)` is implemented in terms of
// `WriteSlow(absl::string_view)`; and `WriteSlow(Chain&&)` is implemented in
// terms of `WriteSlow(const Chain&)`.
//
// Precondition for `WriteSlow(absl::string_view)`:
// `src.size() > available()`
//
// Precondition for `WriteSlow(Chain&&)`:
// `src.size() > UnsignedMin(available(), kMaxBytesToCopy)`
virtual bool WriteSlow(absl::string_view src);
virtual bool WriteSlow(const Chain& src);
virtual bool WriteSlow(Chain&& src);
// Destination position corresponding to `limit_`.
Position limit_pos() const;
char* start_ = nullptr;
char* cursor_ = nullptr;
char* limit_ = nullptr;
// Destination position corresponding to `start_`.
//
// Invariant:
// `start_pos_ <= std::numeric_limits<Position>::max() - buffer_size()`
Position start_pos_ = 0;
};
// Implementation details follow.
inline BackwardWriter::BackwardWriter(BackwardWriter&& that) noexcept
: Object(std::move(that)),
start_(std::exchange(that.start_, nullptr)),
cursor_(std::exchange(that.cursor_, nullptr)),
limit_(std::exchange(that.limit_, nullptr)),
start_pos_(std::exchange(that.start_pos_, 0)) {}
inline BackwardWriter& BackwardWriter::operator=(
BackwardWriter&& that) noexcept {
Object::operator=(std::move(that));
start_ = std::exchange(that.start_, nullptr);
cursor_ = std::exchange(that.cursor_, nullptr);
limit_ = std::exchange(that.limit_, nullptr);
start_pos_ = std::exchange(that.start_pos_, 0);
return *this;
}
inline void BackwardWriter::Reset(InitiallyClosed) {
Object::Reset(kInitiallyClosed);
start_ = nullptr;
cursor_ = nullptr;
limit_ = nullptr;
start_pos_ = 0;
}
inline void BackwardWriter::Reset(InitiallyOpen) {
Object::Reset(kInitiallyOpen);
start_ = nullptr;
cursor_ = nullptr;
limit_ = nullptr;
start_pos_ = 0;
}
inline void BackwardWriter::Done() {
start_pos_ = pos();
start_ = nullptr;
cursor_ = nullptr;
limit_ = nullptr;
}
inline bool BackwardWriter::Push(size_t min_length, size_t recommended_length) {
if (ABSL_PREDICT_TRUE(available() >= min_length)) return true;
if (ABSL_PREDICT_FALSE(!PushSlow(min_length, recommended_length))) {
return false;
}
RIEGELI_ASSERT_GE(available(), min_length)
<< "Failed postcondition of BackwardWriter::PushSlow(): "
"not enough space available";
return true;
}
inline void BackwardWriter::set_cursor(char* cursor) {
RIEGELI_ASSERT(cursor <= start())
<< "Failed precondition of BackwardWriter::set_cursor(): "
"pointer out of range";
RIEGELI_ASSERT(cursor >= limit())
<< "Failed precondition of BackwardWriter::set_cursor(): "
"pointer out of range";
cursor_ = cursor;
}
inline bool BackwardWriter::Write(absl::string_view src) {
if (ABSL_PREDICT_TRUE(src.size() <= available())) {
if (ABSL_PREDICT_TRUE(
// `std::memcpy(nullptr, _, 0)` and `std::memcpy(_, nullptr, 0)`
// are undefined.
!src.empty())) {
cursor_ -= src.size();
std::memcpy(cursor_, src.data(), src.size());
}
return true;
}
return WriteSlow(src);
}
inline bool BackwardWriter::Write(std::string&& src) {
if (ABSL_PREDICT_TRUE(src.size() <= available() &&
src.size() <= kMaxBytesToCopy)) {
if (ABSL_PREDICT_TRUE(
// `std::memcpy(nullptr, _, 0)` is undefined.
!src.empty())) {
cursor_ -= src.size();
std::memcpy(cursor_, src.data(), src.size());
}
return true;
}
return WriteSlow(Chain(std::move(src)));
}
inline bool BackwardWriter::Write(const char* src) {
return Write(absl::string_view(src));
}
inline bool BackwardWriter::Write(const Chain& src) {
if (ABSL_PREDICT_TRUE(src.size() <= available() &&
src.size() <= kMaxBytesToCopy)) {
cursor_ -= src.size();
src.CopyTo(cursor_);
return true;
}
return WriteSlow(src);
}
inline bool BackwardWriter::Write(Chain&& src) {
if (ABSL_PREDICT_TRUE(src.size() <= available() &&
src.size() <= kMaxBytesToCopy)) {
cursor_ -= src.size();
src.CopyTo(cursor_);
return true;
}
return WriteSlow(std::move(src));
}
inline Position BackwardWriter::pos() const {
RIEGELI_ASSERT_LE(start_pos_,
std::numeric_limits<Position>::max() - buffer_size())
<< "Failed invariant of BackwardWriter: "
"position of buffer limit overflow";
return start_pos_ + written_to_buffer();
}
inline Position BackwardWriter::limit_pos() const {
RIEGELI_ASSERT_LE(start_pos_,
std::numeric_limits<Position>::max() - buffer_size())
<< "Failed invariant of BackwardWriter: "
"position of buffer limit overflow";
return start_pos_ + buffer_size();
}
} // namespace riegeli
#endif // RIEGELI_BYTES_BACKWARD_WRITER_H_
| [
"[email protected]"
] | |
6b35805c7ebd4cea0bcc982e98619fc3780ff076 | 9f16950a070174c4ad6419b6aa48e0b3fd34a09e | /vfxGraph/vfxNodes/vfxNodeDrawModel.h | 3e14d2bfe8e1bc46d3690bda1bb48c667e34f406 | [] | no_license | marcel303/framework | 594043fad6a261ce2f8e862f921aee1192712612 | 9459898c280223b853bf16d6e382a6f7c573e10e | refs/heads/master | 2023-05-14T02:30:51.063401 | 2023-05-07T07:57:12 | 2023-05-07T10:16:34 | 112,006,739 | 53 | 1 | null | 2020-01-13T18:48:32 | 2017-11-25T13:45:56 | C++ | UTF-8 | C++ | false | false | 1,979 | h | /*
Copyright (C) 2020 Marcel Smit
[email protected]
https://www.facebook.com/marcel.smit981
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.
*/
#pragma once
#include "vfxNodeBase.h"
class Model;
struct VfxNodeDrawModel : VfxNodeBase
{
enum Input
{
kInput_Filename,
kInput_Animation,
kInput_AnimationSpeed,
kInput_AnimationLoopCount,
kInput_AnimationRootMotionEnabled,
kInput_Scale,
kInput_COUNT
};
enum Output
{
kOutput_Draw,
kOutput_PositionX,
kOutput_PositionY,
kOutput_PositionZ,
kOutput_NormalX,
kOutput_NormalY,
kOutput_NormalZ,
kOutput_COUNT
};
Model * model;
std::string currentFilename;
std::string currentAnim;
VfxChannelData channelData;
VfxChannel positionX;
VfxChannel positionY;
VfxChannel positionZ;
VfxChannel normalX;
VfxChannel normalY;
VfxChannel normalZ;
VfxNodeDrawModel();
virtual ~VfxNodeDrawModel() override;
virtual void tick(const float dt) override;
virtual void draw() const override;
};
| [
"[email protected]"
] | |
7f21b5b118efed3877f0412d9ffcdc7013bc2f28 | 1189bc47b186f315248272bf9ba43772863ce7d2 | /Depth/depth_convert_x86.h | 8ffc5304a32d968e23cd145186586713a1981f28 | [
"WTFPL"
] | permissive | gitter-badger/zimg-1 | c4303c1d44d5ec489c5707bac59d4b7617eda9ea | de78f5ee1d1f6d346169d8de3f0fca0d736ec850 | refs/heads/master | 2020-04-08T07:50:40.787919 | 2015-09-21T18:33:08 | 2015-09-21T18:33:08 | 42,952,887 | 0 | 0 | null | 2015-09-22T18:29:35 | 2015-09-22T18:29:35 | null | UTF-8 | C++ | false | false | 2,050 | h | #if 0
#pragma once
#ifdef ZIMG_X86
#ifndef ZIMG_DEPTH_DEPTH_CONVERT_X86_H_
#define ZIMG_DEPTH_DEPTH_CONVERT_X86_H_
#include "depth_convert.h"
namespace zimg {;
enum class CPUClass;
namespace depth {;
class DepthConvert;
/**
* Shared DepthConvert helper for all x86 implementations.
*/
class DepthConvertX86 : public DepthConvert {
template <int N, int M>
struct Max {
static const int value = N > M ? N : M;
};
template <int N, int M>
struct Div {
static const int value = N / M;
};
protected:
template <class T, class U, class Unpack, class Pack, class VectorOp, class ScalarOp>
void process(const T *src, U *dst, int width, Unpack unpack, Pack pack, VectorOp op, ScalarOp scalar_op) const
{
typedef typename Unpack::type src_vector_type;
typedef typename Pack::type dst_vector_type;
typedef Max<Unpack::loop_step, Pack::loop_step> loop_step;
typedef Div<loop_step::value, Unpack::loop_step> loop_unroll_unpack;
typedef Div<loop_step::value, Pack::loop_step> loop_unroll_pack;
src_vector_type src_unpacked[loop_unroll_unpack::value * Unpack::unpacked_count];
dst_vector_type dst_unpacked[loop_unroll_pack::value * Pack::unpacked_count];
for (int i = 0; i < mod(width, loop_step::value); i += loop_step::value) {
for (int k = 0; k < loop_unroll_unpack::value; ++k) {
unpack.unpack(&src_unpacked[k * Unpack::unpacked_count], &src[i + k * Unpack::loop_step]);
}
for (int k = 0; k < loop_unroll_pack::value * Pack::unpacked_count; ++k) {
dst_unpacked[k] = op(src_unpacked[k]);
}
for (int k = 0; k < loop_unroll_pack::value; ++k) {
pack.pack(&dst[i + k * Pack::loop_step], &dst_unpacked[k * Pack::unpacked_count]);
}
}
for (int i = mod(width, loop_step::value); i < width; ++i) {
dst[i] = scalar_op(src[i]);
}
}
};
DepthConvert *create_depth_convert_sse2();
DepthConvert *create_depth_convert_avx2();
DepthConvert *create_depth_convert_x86(CPUClass cpu);
} // namespace depth
} // namespace zimg
#endif // ZIMG_DEPTH_DEPTH_CONVERT_X86_H_
#endif // ZIMG_X86
#endif
| [
"[email protected]"
] | |
e9461af9aaec384931dba2db9663807790cff7f7 | 23f4d88250ec76ae7e0f2511d000ca147e2b4db0 | /Data Structure Mack - Luciano C++/Class 03 TAD/Herança Natural Inteiro/inteiro.cpp | 95b6618e47c1fe36534fbfc3dbf47d5cbaaf7fd6 | [] | no_license | gregory735/C-Help | 08d24f74de2921c72fa180dc6225ff2ccc968cce | 39d0cc5e8dac3fd8c54f84df4a6048269f910c3f | refs/heads/master | 2020-03-27T23:58:04.075058 | 2018-09-05T19:38:22 | 2018-09-05T19:38:22 | 147,363,818 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 767 | cpp | #include "inteiro.h"
#include <stdlib.h>
Inteiro:: Inteiro (unsigned int v,char sinal){
if (sinal == '+')
value = v;
else if (sinal == '-')
value=-v;
}
Inteiro::~Inteiro(){}
int Inteiro::getValue(){
return value;
}
Inteiro Inteiro::suc(){
int v = value + 1;
Inteiro n(abs(v), v<0?'-':'+');
return n;
}
Inteiro Inteiro::pred(){
int v = value - 1;
Inteiro n(abs(v), v<0?'-':'+');
return n;
}
Inteiro Inteiro::operator+(Inteiro n){
int v= value + n.getValue();
Inteiro s(abs(v), v<0?'-':'+');
return s;
}
Inteiro Inteiro::operator-(Inteiro n){
int v= value - n.getValue();
Inteiro d(abs(v), v<0?'-':'+');
return d;
}
Inteiro Inteiro::operator*(Inteiro n){
int v= value * n.getValue();
Inteiro t(abs(v), v<0?'-':'+');
return t;
} | [
"[email protected]"
] | |
e0ca2b5afa42f0d3843ee62b1e2619fd4d954ad1 | 56a4cb943d085a672f8b0d08a8c047f772e6a45e | /code/Johnson_Engine/Runtime/render_b/src/sys/d3d/d3dtexinterface.cpp | 0ba6e77f72db3d7f046ee6bef6cd2783f87c3d16 | [] | no_license | robertveloso/suddenattack_legacy | 2016fa21640d9a97227337ac8b2513af7b0ce00b | 05ff49cced2ba651c25c18379fed156c58a577d7 | refs/heads/master | 2022-06-20T05:00:10.375695 | 2020-05-08T01:46:02 | 2020-05-08T01:46:02 | 262,199,345 | 3 | 1 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 9,584 | cpp |
#include "bdefs.h"
#include "ilttexinterface.h"
#include "d3dtexinterface.h"
#include "Render.h"
#include "dtxmgr.h"
#include "colorops.h"
#include "clientmgr.h"
//------------------------------------------------------------------
//------------------------------------------------------------------
// Holders and their headers.
//------------------------------------------------------------------
//------------------------------------------------------------------
//IWorldClientBSP holder
#include "world_client_bsp.h"
static IWorldClientBSP *world_bsp_client;
define_holder(IWorldClientBSP, world_bsp_client);
//IClientFileMgr
#include "client_filemgr.h"
static IClientFileMgr *client_file_mgr;
define_holder(IClientFileMgr, client_file_mgr);
// interface database
define_interface(CSysTexInterface, ILTTexInterface);
extern CClientMgr* g_pClientMgr;
//---------------------------------------------------------------------
// Utility functions
//---------------------------------------------------------------------
static bool ConvertFormatToType(PFormat& Format, ETextureType &eTextureType)
{
switch (Format.GetType())
{
case BPP_S3TC_DXT1 : eTextureType = TEXTURETYPE_DXT1; break;
case BPP_S3TC_DXT3 : eTextureType = TEXTURETYPE_DXT3; break;
case BPP_S3TC_DXT5 : eTextureType = TEXTURETYPE_DXT5; break;
case BPP_32 : eTextureType = TEXTURETYPE_ARGB8888; break;
case BPP_16 :
if (Format.m_Masks[CP_ALPHA] == 0x00000000 && Format.m_Masks[CP_RED] == 0x0000F800 && Format.m_Masks[CP_GREEN] == 0x000007E0 && Format.m_Masks[CP_BLUE] == 0x0000001F) eTextureType = TEXTURETYPE_RGB565;
else if (Format.m_Masks[CP_ALPHA] == 0x00008000 && Format.m_Masks[CP_RED] == 0x00007C00 && Format.m_Masks[CP_GREEN] == 0x000003E0 && Format.m_Masks[CP_BLUE] == 0x0000001F) eTextureType = TEXTURETYPE_ARGB1555;
else if (Format.m_Masks[CP_ALPHA] == 0x0000F000 && Format.m_Masks[CP_RED] == 0x00000F00 && Format.m_Masks[CP_GREEN] == 0x000000F0 && Format.m_Masks[CP_BLUE] == 0x0000000F) eTextureType = TEXTURETYPE_ARGB4444;
return LT_ERROR; break;
default : return false;
}
return true;
}
// Find texture in memory if it exists and return its handle.
// If it does not exist, this function should return an error.
LTRESULT CSysTexInterface::FindTextureFromName(HTEXTURE &hTexture, const char *pFilename)
{
FileRef ref;
hTexture = NULL;
ref.m_FileType = TYPECODE_TEXTURE;
ref.m_pFilename = pFilename;
FileIdentifier* pIdent = client_file_mgr->GetFileIdentifier(&ref, TYPECODE_TEXTURE);
if (pIdent == LTNULL)
{
return LT_ERROR;
}
if (pIdent->m_pData)
{
(SharedTexture*)hTexture = (SharedTexture*)pIdent->m_pData;
return LT_OK;
}
return LT_ERROR;
}
// Create texture from a dtx file on disk.
LTRESULT CSysTexInterface::CreateTextureFromName(HTEXTURE &hTexture, const char *pFilename)
{
FileRef ref;
LTRESULT dResult = LT_ERROR;
hTexture = NULL;
ref.m_FileType = TYPECODE_TEXTURE;
ref.m_pFilename = pFilename;
FileIdentifier* pIdent = client_file_mgr->GetFileIdentifier(&ref, TYPECODE_TEXTURE);
if (pIdent)
{
hTexture = g_pClientMgr->m_SharedTextureBank.Allocate();
if (hTexture)
{
memset(hTexture, 0, sizeof(*hTexture));
hTexture->m_pFile = pIdent;
pIdent->m_pData = hTexture;
dResult = r_LoadSystemTexture(hTexture);
if (dResult == LT_OK)
{
r_BindTexture(hTexture, false);
hTexture->SetRefCount(hTexture->GetRefCount() + 1);
dl_AddHead(&g_pClientMgr->m_SharedTextures, &hTexture->m_Link, hTexture);
}
else
{
g_pClientMgr->m_SharedTextureBank.Free(hTexture);
}
}
}
return dResult;
}
LTRESULT CSysTexInterface::CreateTextureFromData(HTEXTURE &hTexture, ETextureType eTextureType, uint32 TextureFlags,
uint8 *pData, uint32 nWidth, uint32 nHeight, uint32 nAutoGenMipMaps)
{
if (nAutoGenMipMaps == 0)
{
// We need to autogen them all the way down, so set nAutoGenMipMaps to the number we're going to want.
nAutoGenMipMaps = 1; uint32 iTmp = MAX(nWidth,nHeight);
while (iTmp > 2 && nAutoGenMipMaps < 8)
{
iTmp /= 2; ++nAutoGenMipMaps;
}
}
// Make our SysMem RGBA copy...
PFormat TheFormat;
switch (eTextureType)
{
case TEXTURETYPE_ARGB8888 : TheFormat.Init(BPP_32,0xFF000000,0x00FF0000,0x0000FF00,0x000000FF); break;
case TEXTURETYPE_ARGB4444 : TheFormat.Init(BPP_16,0xF000,0x0F00,0x00F0,0x000F); break;
case TEXTURETYPE_ARGB1555 : TheFormat.Init(BPP_16,0x8000,RGB555_RMASK,RGB555_GMASK,RGB555_BMASK); break;
case TEXTURETYPE_RGB565 : TheFormat.Init(BPP_16,0x0000,RGB565_RMASK,RGB565_GMASK,RGB565_BMASK); break;
case TEXTURETYPE_DXT1 : TheFormat.Init(BPP_S3TC_DXT1,0,0,0,0); break;
case TEXTURETYPE_DXT3 : TheFormat.Init(BPP_S3TC_DXT3,0,0,0,0); break;
case TEXTURETYPE_DXT5 : TheFormat.Init(BPP_S3TC_DXT5,0,0,0,0); break;
default : assert(0 && "Unsupported Format"); return LT_ERROR;
}
//allocate our shared texture
hTexture = g_pClientMgr->m_SharedTextureBank.Allocate();
//check the allocation
if(!hTexture)
return LT_ERROR;
//clear the texture out, and add it to the global list of shared textures
memset(hTexture, 0, sizeof(*hTexture));
dl_AddHead(&g_pClientMgr->m_SharedTextures, &hTexture->m_Link, hTexture);
//there is no file reference for this shared texture since it is entirely user created
hTexture->m_pFile = NULL;
//allocate and initialize our actual texture data
hTexture->SetTextureInfo(nWidth, nHeight, TheFormat);
hTexture->m_pEngineData = dtx_Alloc(TheFormat.GetType(), nWidth, nHeight, nAutoGenMipMaps, LTNULL, LTNULL);
TextureData* pTextureData = (TextureData*)hTexture->m_pEngineData;
pTextureData->m_PFormat = TheFormat;
pTextureData->m_Flags = TextureFlags;
pTextureData->m_Header.m_Extra[2] = TheFormat.GetType();
pTextureData->m_Header.m_IFlags = TextureFlags;
pTextureData->m_pSharedTexture = hTexture;
// Add the new texture to the list of texture data
dl_AddHead(&g_SysCache.m_List, &pTextureData->m_Link, pTextureData);
g_SysCache.m_CurMem += pTextureData->m_AllocSize;
if (((SharedTexture*)hTexture)->m_pEngineData)
{
for (uint i = 0; i < nAutoGenMipMaps; ++i)
{
if (!r_GetRenderStruct()->ConvertTexDataToDD(pData,&TheFormat,nWidth,nHeight,pTextureData->m_Mips[i].m_Data,&TheFormat,pTextureData->m_Header.GetBPPIdent(), pTextureData->m_Header.m_IFlags, pTextureData->m_Mips[i].m_Width,pTextureData->m_Mips[i].m_Height))
{
r_UnloadSystemTexture(pTextureData); hTexture = NULL;
return LT_ERROR;
}
}
hTexture->SetRefCount(hTexture->GetRefCount() + 1);
if (!hTexture->m_pRenderData)
{
// Bind it to the renderer.
r_BindTexture(hTexture, true);
}
return LT_OK;
}
else
{
r_UnloadSystemTexture((TextureData*)((SharedTexture*)hTexture)->m_pEngineData); hTexture = NULL;
return LT_ERROR;
}
return LT_ERROR;
}
LTRESULT CSysTexInterface::GetTextureData(const HTEXTURE hTexture, const uint8* &pData, uint32 &nPitch, uint32& nWidth, uint32& nHeight, ETextureType& eType)
{
SharedTexture* pTexture = (SharedTexture*)hTexture;
if (!pTexture)
{
return LT_ERROR;
}
TextureData* pTextureData = r_GetTextureData(pTexture);
if (!pTextureData)
{
return LT_ERROR;
}
if(!ConvertFormatToType(pTextureData->m_PFormat, eType))
{
return LT_ERROR;
}
nWidth = pTextureData->m_Mips[0].m_Width;
nHeight = pTextureData->m_Mips[0].m_Height;
pData = pTextureData->m_Mips[0].m_Data;
nPitch = pTextureData->m_Mips[0].m_Width * pTextureData->m_PFormat.GetBytesPerPixel();
return LT_OK;
}
// Let the engine know that we are finished modifing the texture
LTRESULT CSysTexInterface::FlushTextureData (const HTEXTURE hTexture, ETextureMod eChanged, uint32 nMipMap)
{
r_BindTexture(hTexture, true); // Bind it to the renderer.
return (LT_OK);
}
LTRESULT CSysTexInterface::GetTextureType(const HTEXTURE hTexture, ETextureType &eTextureType)
{
SharedTexture* pTexture = (SharedTexture*)hTexture;
if (!pTexture)
{
return LT_ERROR;
}
uint32 nWidth, nHeight;
PFormat Format;
if(!r_GetTextureInfo(hTexture, nWidth, nHeight, Format))
{
return LT_ERROR;
}
if(!ConvertFormatToType(Format, eTextureType))
{
return LT_ERROR;
}
return LT_OK;
}
// Get information about the texture
LTRESULT CSysTexInterface::GetTextureDims(const HTEXTURE hTexture, uint32 &nWidth, uint32 &nHeight)
{
SharedTexture* pTexture = (SharedTexture*)hTexture;
if (!pTexture)
{
return LT_ERROR;
}
PFormat Format;
if(!r_GetTextureInfo(hTexture, nWidth, nHeight, Format))
{
return LT_ERROR;
}
return LT_OK;
}
bool CSysTexInterface::ReleaseTextureHandle(const HTEXTURE hTexture)
{
FN_NAME(LTTexMod::ReleaseTextureHandle);
SharedTexture* pTexture = hTexture;
if (!pTexture)
return false;
if (!r_GetRenderStruct()->m_bInitted)
return false;
pTexture->SetRefCount(pTexture->GetRefCount() - 1);
// The texture will be cleaned up on level switch, don't delete it now
// since both the engine and game code may be reference this texture.
//[MURSUM]==================================================
//Áö¿ìÀÚ!
if( pTexture->GetRefCount() == 0 )
{
g_pClientMgr->FreeSharedTexture(hTexture);
}
//==========================================================
return true;
}
uint32 CSysTexInterface::AddRefTextureHandle(const HTEXTURE hTexture)
{
FN_NAME(LTTexMod::ReleaseTextureHandle);
SharedTexture* pTexture = hTexture;
if (!pTexture) return false;
uint32 nNewRefCount = pTexture->GetRefCount() + 1;
pTexture->SetRefCount(nNewRefCount);
return nNewRefCount;
}
| [
"[email protected]"
] | |
029670c9ec9b86e06e3585ec557c6ff4c5a60c52 | 13e99a4b693865af856790df5f9c10f2e0ac8b4f | /colloquium/colloquium/Z/MUL_ZZ_Z.cpp | cee9f00ee7da8df45231bf5cbe5380ae27fbdeaf | [] | no_license | cosychair/colloq | b9766e639dd2fc8dd31c4d165238cd4accdcaf7c | 0b257c5d0023536014fb4107bdac5f5d0dec37e1 | refs/heads/master | 2020-03-09T13:03:12.909992 | 2018-04-14T20:29:23 | 2018-04-14T20:29:23 | 128,800,482 | 1 | 3 | null | 2018-04-12T18:24:46 | 2018-04-09T16:19:54 | C++ | UTF-8 | C++ | false | false | 1,412 | cpp | #include <cstdlib>
#include <iostream>
#include "longInteger.h"
#include "../Z/longIntFunctions.h"
#include "../N/longNatFunctions.h"
#include "../N/helpFunctions.h"
#include "../Output/outputN.h"
using namespace std;
LNGINT MUL_ZZ_Z(LNGINT ln, LNGINT lt)
{
LNGINT ttr;
ttr.A = NULL;
ttr.n = 0;
ttr.sign = 0;
LNGNT lx;
int error = 0;
if(ln.A && lt.A)
{
LNGNT lnN,ltN;
lnN = ABS_Z_N(ln);
ltN = ABS_Z_N(lt);
if(lnN.A && ltN.A)
{
lx = MUL_NN_N(lnN, ltN);
ttr.sign = 0;
ttr.n = lx.n;
ttr.A = (int*) malloc(ttr.n*sizeof(int));
for(int i = 0; i < lx.n; ++i)
*(ttr.A + i) = *(lx.A+i);
if(ln.sign != lt.sign)
ttr = MUL_ZM_Z(ttr);
else;
freeN(&lx);
if (ttr.A[0] == 0 )
{
ttr.n = 1;
ttr.sign = 0;
}
else;
}
else
error = 1;
freeN(&lnN);
freeN(<N);
}
else
error = 1;
if(error == 1)
cout << "Error, numer doesn`t exist!" << endl;
return ttr;
} | [
"[email protected]"
] | |
4b3db0e628f9313cc9f41a897861e981d1614493 | 9875073000f7e81b08ff459831469d293c2800e0 | /CODEFORCES/Puzzles.cpp | 47fdae31a974cf723f649ba7615d89355bfbee50 | [] | no_license | Minato1803/Code_Competition | 47b31cf5eefbd38d4519b034f55f58ca700c05d4 | 21e893c8e9a457f095aa9fbbf8dd439a516cbc4d | refs/heads/master | 2023-02-17T04:52:31.070539 | 2021-01-20T11:41:30 | 2021-01-20T11:41:30 | 161,519,880 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 375 | cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,m;
cin>>n>>m;
ll a[m];
for(ll i=0;i<m;i++){
cin>>a[i];
}
for(ll i=0;i<m;i++){
for(ll j=m-1;j>i;j--){
if(a[j-1]>a[j]){
swap(a[j-1],a[j]);
}
}
}
ll p=(a[n-1]-a[0]);
for(ll i=1;i<=m-n;i++){
if(p>(a[n-1+i]-a[i])){
p=(a[n-1+i]-a[i]);
}
}
cout<<p;
return 0;
}
| [
"[email protected]"
] | |
14d1a37b471161aa95dbfad87b485ff0eda277db | 940fbee64f83fa37c63b6cdcfd3d8b111a43add9 | /Cplusplus/BDT/src/reader2.h | 9d83466572a695d58bf5db535daad6b7163ef6d9 | [] | no_license | kehindetomiwa/Machine_Learning | 53933da2d164f6add207e9913146711c0e34fba6 | 00d55abfd2693cb4533f04ca09cdbaccf4d0662a | refs/heads/master | 2020-05-03T20:56:11.254158 | 2019-11-08T14:51:45 | 2019-11-08T14:51:45 | 178,813,757 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,418 | h | //////////////////////////////////////////////////////////
// This class has been automatically generated on
// Wed Sep 27 13:58:27 2017 by ROOT version 6.06/02
// from TTree ntuple/ntuple
// found on file: /eos/atlas/user/k/ktomiwa/HGAM_AOD/ntuple/PowhegPythia8EvtGen_NNLOPS_nnlo_30_ggH125_gamgam.tag1_MxAOD/hist-PowhegPythia8EvtGen_NNLOPS_nnlo_30_ggH125_gamgam.tag1_MxAOD.root.root
//////////////////////////////////////////////////////////
#ifndef reader2_h
#define reader2_h
#include <TROOT.h>
#include <TChain.h>
#include <TFile.h>
// Header file for the classes stored in the TTree if any.
#include "vector"
using namespace std;
class reader2 {
public :
TTree *fChain; //!pointer to the analyzed TTree or TChain
Int_t fCurrent; //!current Tree number in a TChain
// Fixed size dimensions of array or collections stored in the TTree if any.
// Declaration of leaf types
Int_t lb;
Int_t mu;
Int_t N_pv;
Int_t run;
Int_t event;
Int_t sample;
Double_t Vertex_Z_php;
Double_t Vertex_Z_hard;
Double_t Vertex_Z_truth;
Double_t met_x;
Double_t met_y;
Double_t pT_hard;
Double_t met_TST;
Double_t RefGamma;
Double_t RefEle;
Double_t RefMuons;
Double_t RefJets;
Double_t pvSoftTrack_TST;
Double_t phi_TST;
Double_t phi_PVSoftTrk;
Double_t sumet_TST;
Double_t met_sig;
Double_t met_truth_TST;
Double_t met_truth_sig;
Double_t met_truth_TST_x;
Double_t met_truth_TST_y;
Double_t met_hardVertexTST;
Double_t RefGamma_hardVertexTST;
Double_t RefEle_hardVertexTST;
Double_t RefMuons_hardVertexTST;
Double_t RefJets_hardVertexTST;
Double_t pvSoftTrack_hardVertexTST;
Double_t phi_hardVertexTST;
Double_t sumet_hardVertexTST;
Double_t met_sig_hardVertex;
Double_t phi_PVSoftTrk_hardVertexTST;
Double_t Vertex_SumPt2_php;
Double_t Vertex_SumPt2_hard;
Double_t Vertex_Z_Pileup;
Double_t Vertex_SumPt2_Pileup;
Double_t Vertex_Pt_php;
Double_t Vertex_Phi_php;
Double_t Vertex_Eta_php;
Double_t Vertex_Pt_hard;
Double_t Vertex_Phi_hard;
Double_t Vertex_Eta_hard;
Double_t Vertex_Pt_Pileup;
Double_t Vertex_Phi_Pileup;
Double_t Vertex_Eta_Pileup;
Double_t SoftClus;
Double_t SoftClus_hardVertexTST;
Double_t met_x_hardVertexTST;
Double_t met_y_hardVertexTST;
vector<double> *photons_pT;
vector<double> *photons_eta;
vector<double> *photons_phi;
vector<double> *photons_ptCone20;
vector<double> *photons_ptCone40;
vector<double> *photons_topoEtCone20;
vector<double> *photons_topoEtCone40;
vector<double> *photons_Rhad;
vector<double> *photons_Reta;
vector<double> *photons_weta2;
vector<double> *photons_Rphi;
vector<double> *photons_wtots1;
vector<double> *photons_DeltaE;
vector<double> *photons_Eratio;
vector<double> *photons_f1;
vector<double> *photons_cl_Es0;
vector<double> *photons_cl_Es1;
vector<double> *photons_cl_Es2;
vector<double> *photons_cl_Es3;
vector<double> *photons_cl_E;
vector<double> *photons_cl_etaCalo;
vector<double> *photons_cl_phiCalo;
vector<double> *photons_cl_eta;
Double_t m_yy;
Double_t pT_yy;
Double_t pX_yy;
Double_t pY_yy;
Int_t convType_y1;
Int_t convType_y2;
vector<double> *jets_pT;
vector<double> *jets_eta;
vector<double> *jets_phi;
vector<double> *jets_m;
vector<double> *jets_Rpt;
vector<double> *jets_JvfCorr;
Int_t N_j;
Int_t N_j_central;
Int_t N_j_btag;
Int_t N_leps;
Double_t weight_EightSet;
Double_t weight_MoriondSet;
Double_t weight_ThreeJetSet;
Int_t cat_EightSet;
Int_t cat_MoriondSet;
Int_t cat_ThreeJetSet;
Double_t lumiXsecWeight;
Double_t generatedMass;
Double_t weight_yy_combPRW;
Double_t weight_yy_combPRWnoTor;
Double_t weight_yy_15PRW;
Double_t weight_yy_16PRW;
Double_t gamjetweight;
Char_t isShellySR;
Char_t isHiggsSR;
Char_t isInclSR;
Char_t isSideBand;
// List of branches
TBranch *b_lb; //!
TBranch *b_mu; //!
TBranch *b_N_pv; //!
TBranch *b_run; //!
TBranch *b_event; //!
TBranch *b_sample; //!
TBranch *b_Vertex_Z_php; //!
TBranch *b_Vertex_Z_hard; //!
TBranch *b_Vertex_Z_truth; //!
TBranch *b_met_x; //!
TBranch *b_met_y; //!
TBranch *b_pT_hard; //!
TBranch *b_met_TST; //!
TBranch *b_RefGamma; //!
TBranch *b_RefEle; //!
TBranch *b_RefMuons; //!
TBranch *b_RefJets; //!
TBranch *b_pvSoftTrack_TST; //!
TBranch *b_phi_TST; //!
TBranch *b_phi_PVSoftTrk; //!
TBranch *b_sumet_TST; //!
TBranch *b_met_sig; //!
TBranch *b_met_truth_TST; //!
TBranch *b_met_truth_sig; //!
TBranch *b_met_truth_TST_x; //!
TBranch *b_met_truth_TST_y; //!
TBranch *b_met_hardVertexTST; //!
TBranch *b_RefGamma_hardVertexTST; //!
TBranch *b_RefEle_hardVertexTST; //!
TBranch *b_RefMuons_hardVertexTST; //!
TBranch *b_RefJets_hardVertexTST; //!
TBranch *b_pvSoftTrack_hardVertexTST; //!
TBranch *b_phi_hardVertexTST; //!
TBranch *b_sumet_hardVertexTST; //!
TBranch *b_met_sig_hardVertex; //!
TBranch *b_phi_PVSoftTrk_hardVertexTST; //!
TBranch *b_Vertex_SumPt2_php; //!
TBranch *b_Vertex_SumPt2_hard; //!
TBranch *b_Vertex_Z_Pileup; //!
TBranch *b_Vertex_SumPt2_Pileup; //!
TBranch *b_Vertex_Pt_php; //!
TBranch *b_Vertex_Phi_php; //!
TBranch *b_Vertex_Eta_php; //!
TBranch *b_Vertex_Pt_hard; //!
TBranch *b_Vertex_Phi_hard; //!
TBranch *b_Vertex_Eta_hard; //!
TBranch *b_Vertex_Pt_Pileup; //!
TBranch *b_Vertex_Phi_Pileup; //!
TBranch *b_Vertex_Eta_Pileup; //!
TBranch *b_SoftClus; //!
TBranch *b_SoftClus_hardVertexTST; //!
TBranch *b_met_x_hardVertexTST; //!
TBranch *b_met_y_hardVertexTST; //!
TBranch *b_photons_pT; //!
TBranch *b_photons_eta; //!
TBranch *b_photons_phi; //!
TBranch *b_photons_ptCone20; //!
TBranch *b_photons_ptCone40; //!
TBranch *b_photons_topoEtCone20; //!
TBranch *b_photons_topoEtCone40; //!
TBranch *b_photons_Rhad; //!
TBranch *b_photons_Reta; //!
TBranch *b_photons_weta2; //!
TBranch *b_photons_Rphi; //!
TBranch *b_photons_wtots1; //!
TBranch *b_photons_DeltaE; //!
TBranch *b_photons_Eratio; //!
TBranch *b_photons_f1; //!
TBranch *b_photons_cl_Es0; //!
TBranch *b_photons_cl_Es1; //!
TBranch *b_photons_cl_Es2; //!
TBranch *b_photons_cl_Es3; //!
TBranch *b_photons_cl_E; //!
TBranch *b_photons_cl_etaCalo; //!
TBranch *b_photons_cl_phiCalo; //!
TBranch *b_photons_cl_eta; //!
TBranch *b_m_yy; //!
TBranch *b_pT_yy; //!
TBranch *b_pX_yy; //!
TBranch *b_pY_yy; //!
TBranch *b_convType_y1; //!
TBranch *b_convType_y2; //!
TBranch *b_jets_pT; //!
TBranch *b_jets_eta; //!
TBranch *b_jets_phi; //!
TBranch *b_jets_m; //!
TBranch *b_jets_Rpt; //!
TBranch *b_jets_JvfCorr; //!
TBranch *b_N_j; //!
TBranch *b_N_j_central; //!
TBranch *b_N_j_btag; //!
TBranch *b_N_leps; //!
TBranch *b_weight_EightSet; //!
TBranch *b_weight_MoriondSet; //!
TBranch *b_weight_ThreeJetSet; //!
TBranch *b_cat_EightSet; //!
TBranch *b_cat_MoriondSet; //!
TBranch *b_cat_ThreeJetSet; //!
TBranch *b_lumiXsecWeight; //!
TBranch *b_generatedMass; //!
TBranch *b_weight_yy_combPRW; //!
TBranch *b_weight_yy_combPRWnoTor; //!
TBranch *b_weight_yy_15PRW; //!
TBranch *b_weight_yy_16PRW; //!
TBranch *b_gamjetweight; //!
TBranch *b_isShellySR; //!
TBranch *b_isHiggsSR; //!
TBranch *b_isInclSR; //!
TBranch *b_isSideBand; //!
reader2(TTree *tree=0);
virtual ~reader2();
virtual Int_t Cut(Long64_t entry);
virtual Int_t GetEntry(Long64_t entry);
virtual Long64_t LoadTree(Long64_t entry);
virtual void Init(TTree *tree);
virtual void Loop();
virtual Bool_t Notify();
virtual void Show(Long64_t entry = -1);
};
#endif
#ifdef reader2_cxx
reader2::reader2(TTree *tree) : fChain(0)
{
// if parameter tree is not specified (or zero), connect the file
// used to generate this class and read the Tree.
if (tree == 0) {
TFile *f = (TFile*)gROOT->GetListOfFiles()->FindObject("/eos/atlas/user/k/ktomiwa/HGAM_AOD/ntuple/PowhegPythia8EvtGen_NNLOPS_nnlo_30_ggH125_gamgam.tag1_MxAOD/hist-PowhegPythia8EvtGen_NNLOPS_nnlo_30_ggH125_gamgam.tag1_MxAOD.root.root");
if (!f || !f->IsOpen()) {
f = new TFile("/eos/atlas/user/k/ktomiwa/HGAM_AOD/ntuple/PowhegPythia8EvtGen_NNLOPS_nnlo_30_ggH125_gamgam.tag1_MxAOD/hist-PowhegPythia8EvtGen_NNLOPS_nnlo_30_ggH125_gamgam.tag1_MxAOD.root.root");
}
f->GetObject("ntuple",tree);
}
Init(tree);
}
reader2::~reader2()
{
if (!fChain) return;
delete fChain->GetCurrentFile();
}
Int_t reader2::GetEntry(Long64_t entry)
{
// Read contents of entry.
if (!fChain) return 0;
return fChain->GetEntry(entry);
}
Long64_t reader2::LoadTree(Long64_t entry)
{
// Set the environment to read one entry
if (!fChain) return -5;
Long64_t centry = fChain->LoadTree(entry);
if (centry < 0) return centry;
if (fChain->GetTreeNumber() != fCurrent) {
fCurrent = fChain->GetTreeNumber();
Notify();
}
return centry;
}
void reader2::Init(TTree *tree)
{
// The Init() function is called when the selector needs to initialize
// a new tree or chain. Typically here the branch addresses and branch
// pointers of the tree will be set.
// It is normally not necessary to make changes to the generated
// code, but the routine can be extended by the user if needed.
// Init() will be called many times when running on PROOF
// (once per file to be processed).
// Set object pointer
photons_pT = 0;
photons_eta = 0;
photons_phi = 0;
photons_ptCone20 = 0;
photons_ptCone40 = 0;
photons_topoEtCone20 = 0;
photons_topoEtCone40 = 0;
photons_Rhad = 0;
photons_Reta = 0;
photons_weta2 = 0;
photons_Rphi = 0;
photons_wtots1 = 0;
photons_DeltaE = 0;
photons_Eratio = 0;
photons_f1 = 0;
photons_cl_Es0 = 0;
photons_cl_Es1 = 0;
photons_cl_Es2 = 0;
photons_cl_Es3 = 0;
photons_cl_E = 0;
photons_cl_etaCalo = 0;
photons_cl_phiCalo = 0;
photons_cl_eta = 0;
jets_pT = 0;
jets_eta = 0;
jets_phi = 0;
jets_m = 0;
jets_Rpt = 0;
jets_JvfCorr = 0;
// Set branch addresses and branch pointers
if (!tree) return;
fChain = tree;
fCurrent = -1;
fChain->SetMakeClass(1);
fChain->SetBranchAddress("lb", &lb, &b_lb);
fChain->SetBranchAddress("mu", &mu, &b_mu);
fChain->SetBranchAddress("N_pv", &N_pv, &b_N_pv);
fChain->SetBranchAddress("run", &run, &b_run);
fChain->SetBranchAddress("event", &event, &b_event);
fChain->SetBranchAddress("sample", &sample, &b_sample);
fChain->SetBranchAddress("Vertex_Z_php", &Vertex_Z_php, &b_Vertex_Z_php);
fChain->SetBranchAddress("Vertex_Z_hard", &Vertex_Z_hard, &b_Vertex_Z_hard);
fChain->SetBranchAddress("Vertex_Z_truth", &Vertex_Z_truth, &b_Vertex_Z_truth);
fChain->SetBranchAddress("met_x", &met_x, &b_met_x);
fChain->SetBranchAddress("met_y", &met_y, &b_met_y);
fChain->SetBranchAddress("pT_hard", &pT_hard, &b_pT_hard);
fChain->SetBranchAddress("met_TST", &met_TST, &b_met_TST);
fChain->SetBranchAddress("RefGamma", &RefGamma, &b_RefGamma);
fChain->SetBranchAddress("RefEle", &RefEle, &b_RefEle);
fChain->SetBranchAddress("RefMuons", &RefMuons, &b_RefMuons);
fChain->SetBranchAddress("RefJets", &RefJets, &b_RefJets);
fChain->SetBranchAddress("pvSoftTrack_TST", &pvSoftTrack_TST, &b_pvSoftTrack_TST);
fChain->SetBranchAddress("phi_TST", &phi_TST, &b_phi_TST);
fChain->SetBranchAddress("phi_PVSoftTrk", &phi_PVSoftTrk, &b_phi_PVSoftTrk);
fChain->SetBranchAddress("sumet_TST", &sumet_TST, &b_sumet_TST);
fChain->SetBranchAddress("met_sig", &met_sig, &b_met_sig);
fChain->SetBranchAddress("met_truth_TST", &met_truth_TST, &b_met_truth_TST);
fChain->SetBranchAddress("met_truth_sig", &met_truth_sig, &b_met_truth_sig);
fChain->SetBranchAddress("met_truth_TST_x", &met_truth_TST_x, &b_met_truth_TST_x);
fChain->SetBranchAddress("met_truth_TST_y", &met_truth_TST_y, &b_met_truth_TST_y);
fChain->SetBranchAddress("met_hardVertexTST", &met_hardVertexTST, &b_met_hardVertexTST);
fChain->SetBranchAddress("RefGamma_hardVertexTST", &RefGamma_hardVertexTST, &b_RefGamma_hardVertexTST);
fChain->SetBranchAddress("RefEle_hardVertexTST", &RefEle_hardVertexTST, &b_RefEle_hardVertexTST);
fChain->SetBranchAddress("RefMuons_hardVertexTST", &RefMuons_hardVertexTST, &b_RefMuons_hardVertexTST);
fChain->SetBranchAddress("RefJets_hardVertexTST", &RefJets_hardVertexTST, &b_RefJets_hardVertexTST);
fChain->SetBranchAddress("pvSoftTrack_hardVertexTST", &pvSoftTrack_hardVertexTST, &b_pvSoftTrack_hardVertexTST);
fChain->SetBranchAddress("phi_hardVertexTST", &phi_hardVertexTST, &b_phi_hardVertexTST);
fChain->SetBranchAddress("sumet_hardVertexTST", &sumet_hardVertexTST, &b_sumet_hardVertexTST);
fChain->SetBranchAddress("met_sig_hardVertex", &met_sig_hardVertex, &b_met_sig_hardVertex);
fChain->SetBranchAddress("phi_PVSoftTrk_hardVertexTST", &phi_PVSoftTrk_hardVertexTST, &b_phi_PVSoftTrk_hardVertexTST);
fChain->SetBranchAddress("Vertex_SumPt2_php", &Vertex_SumPt2_php, &b_Vertex_SumPt2_php);
fChain->SetBranchAddress("Vertex_SumPt2_hard", &Vertex_SumPt2_hard, &b_Vertex_SumPt2_hard);
fChain->SetBranchAddress("Vertex_Z_Pileup", &Vertex_Z_Pileup, &b_Vertex_Z_Pileup);
fChain->SetBranchAddress("Vertex_SumPt2_Pileup", &Vertex_SumPt2_Pileup, &b_Vertex_SumPt2_Pileup);
fChain->SetBranchAddress("Vertex_Pt_php", &Vertex_Pt_php, &b_Vertex_Pt_php);
fChain->SetBranchAddress("Vertex_Phi_php", &Vertex_Phi_php, &b_Vertex_Phi_php);
fChain->SetBranchAddress("Vertex_Eta_php", &Vertex_Eta_php, &b_Vertex_Eta_php);
fChain->SetBranchAddress("Vertex_Pt_hard", &Vertex_Pt_hard, &b_Vertex_Pt_hard);
fChain->SetBranchAddress("Vertex_Phi_hard", &Vertex_Phi_hard, &b_Vertex_Phi_hard);
fChain->SetBranchAddress("Vertex_Eta_hard", &Vertex_Eta_hard, &b_Vertex_Eta_hard);
fChain->SetBranchAddress("Vertex_Pt_Pileup", &Vertex_Pt_Pileup, &b_Vertex_Pt_Pileup);
fChain->SetBranchAddress("Vertex_Phi_Pileup", &Vertex_Phi_Pileup, &b_Vertex_Phi_Pileup);
fChain->SetBranchAddress("Vertex_Eta_Pileup", &Vertex_Eta_Pileup, &b_Vertex_Eta_Pileup);
fChain->SetBranchAddress("SoftClus", &SoftClus, &b_SoftClus);
fChain->SetBranchAddress("SoftClus_hardVertexTST", &SoftClus_hardVertexTST, &b_SoftClus_hardVertexTST);
fChain->SetBranchAddress("met_x_hardVertexTST", &met_x_hardVertexTST, &b_met_x_hardVertexTST);
fChain->SetBranchAddress("met_y_hardVertexTST", &met_y_hardVertexTST, &b_met_y_hardVertexTST);
fChain->SetBranchAddress("photons_pT", &photons_pT, &b_photons_pT);
fChain->SetBranchAddress("photons_eta", &photons_eta, &b_photons_eta);
fChain->SetBranchAddress("photons_phi", &photons_phi, &b_photons_phi);
fChain->SetBranchAddress("photons_ptCone20", &photons_ptCone20, &b_photons_ptCone20);
fChain->SetBranchAddress("photons_ptCone40", &photons_ptCone40, &b_photons_ptCone40);
fChain->SetBranchAddress("photons_topoEtCone20", &photons_topoEtCone20, &b_photons_topoEtCone20);
fChain->SetBranchAddress("photons_topoEtCone40", &photons_topoEtCone40, &b_photons_topoEtCone40);
fChain->SetBranchAddress("photons_Rhad", &photons_Rhad, &b_photons_Rhad);
fChain->SetBranchAddress("photons_Reta", &photons_Reta, &b_photons_Reta);
fChain->SetBranchAddress("photons_weta2", &photons_weta2, &b_photons_weta2);
fChain->SetBranchAddress("photons_Rphi", &photons_Rphi, &b_photons_Rphi);
fChain->SetBranchAddress("photons_wtots1", &photons_wtots1, &b_photons_wtots1);
fChain->SetBranchAddress("photons_DeltaE", &photons_DeltaE, &b_photons_DeltaE);
fChain->SetBranchAddress("photons_Eratio", &photons_Eratio, &b_photons_Eratio);
fChain->SetBranchAddress("photons_f1", &photons_f1, &b_photons_f1);
fChain->SetBranchAddress("photons_cl_Es0", &photons_cl_Es0, &b_photons_cl_Es0);
fChain->SetBranchAddress("photons_cl_Es1", &photons_cl_Es1, &b_photons_cl_Es1);
fChain->SetBranchAddress("photons_cl_Es2", &photons_cl_Es2, &b_photons_cl_Es2);
fChain->SetBranchAddress("photons_cl_Es3", &photons_cl_Es3, &b_photons_cl_Es3);
fChain->SetBranchAddress("photons_cl_E", &photons_cl_E, &b_photons_cl_E);
fChain->SetBranchAddress("photons_cl_etaCalo", &photons_cl_etaCalo, &b_photons_cl_etaCalo);
fChain->SetBranchAddress("photons_cl_phiCalo", &photons_cl_phiCalo, &b_photons_cl_phiCalo);
fChain->SetBranchAddress("photons_cl_eta", &photons_cl_eta, &b_photons_cl_eta);
fChain->SetBranchAddress("m_yy", &m_yy, &b_m_yy);
fChain->SetBranchAddress("pT_yy", &pT_yy, &b_pT_yy);
fChain->SetBranchAddress("pX_yy", &pX_yy, &b_pX_yy);
fChain->SetBranchAddress("pY_yy", &pY_yy, &b_pY_yy);
fChain->SetBranchAddress("convType_y1", &convType_y1, &b_convType_y1);
fChain->SetBranchAddress("convType_y2", &convType_y2, &b_convType_y2);
fChain->SetBranchAddress("jets_pT", &jets_pT, &b_jets_pT);
fChain->SetBranchAddress("jets_eta", &jets_eta, &b_jets_eta);
fChain->SetBranchAddress("jets_phi", &jets_phi, &b_jets_phi);
fChain->SetBranchAddress("jets_m", &jets_m, &b_jets_m);
fChain->SetBranchAddress("jets_Rpt", &jets_Rpt, &b_jets_Rpt);
fChain->SetBranchAddress("jets_JvfCorr", &jets_JvfCorr, &b_jets_JvfCorr);
fChain->SetBranchAddress("N_j", &N_j, &b_N_j);
fChain->SetBranchAddress("N_j_central", &N_j_central, &b_N_j_central);
fChain->SetBranchAddress("N_j_btag", &N_j_btag, &b_N_j_btag);
fChain->SetBranchAddress("N_leps", &N_leps, &b_N_leps);
fChain->SetBranchAddress("weight_EightSet", &weight_EightSet, &b_weight_EightSet);
fChain->SetBranchAddress("weight_MoriondSet", &weight_MoriondSet, &b_weight_MoriondSet);
fChain->SetBranchAddress("weight_ThreeJetSet", &weight_ThreeJetSet, &b_weight_ThreeJetSet);
fChain->SetBranchAddress("cat_EightSet", &cat_EightSet, &b_cat_EightSet);
fChain->SetBranchAddress("cat_MoriondSet", &cat_MoriondSet, &b_cat_MoriondSet);
fChain->SetBranchAddress("cat_ThreeJetSet", &cat_ThreeJetSet, &b_cat_ThreeJetSet);
fChain->SetBranchAddress("lumiXsecWeight", &lumiXsecWeight, &b_lumiXsecWeight);
fChain->SetBranchAddress("generatedMass", &generatedMass, &b_generatedMass);
fChain->SetBranchAddress("weight_yy_combPRW", &weight_yy_combPRW, &b_weight_yy_combPRW);
fChain->SetBranchAddress("weight_yy_combPRWnoTor", &weight_yy_combPRWnoTor, &b_weight_yy_combPRWnoTor);
fChain->SetBranchAddress("weight_yy_15PRW", &weight_yy_15PRW, &b_weight_yy_15PRW);
fChain->SetBranchAddress("weight_yy_16PRW", &weight_yy_16PRW, &b_weight_yy_16PRW);
fChain->SetBranchAddress("gamjetweight", &gamjetweight, &b_gamjetweight);
fChain->SetBranchAddress("isShellySR", &isShellySR, &b_isShellySR);
fChain->SetBranchAddress("isHiggsSR", &isHiggsSR, &b_isHiggsSR);
fChain->SetBranchAddress("isInclSR", &isInclSR, &b_isInclSR);
fChain->SetBranchAddress("isSideBand", &isSideBand, &b_isSideBand);
Notify();
}
Bool_t reader2::Notify()
{
// The Notify() function is called when a new file is opened. This
// can be either for a new TTree in a TChain or when when a new TTree
// is started when using PROOF. It is normally not necessary to make changes
// to the generated code, but the routine can be extended by the
// user if needed. The return value is currently not used.
return kTRUE;
}
void reader2::Show(Long64_t entry)
{
// Print contents of entry.
// If entry is not specified, print current entry
if (!fChain) return;
fChain->Show(entry);
}
Int_t reader2::Cut(Long64_t entry)
{
// This function may be called from Loop.
// returns 1 if entry is accepted.
// returns -1 otherwise.
return 1;
}
#endif // #ifdef reader2_cxx
| [
"[email protected]"
] | |
c6f64175976435800c2e0e7b14f4fd07154c56c0 | 8001210029e0767d6ae2b141eb62b421a6513f5b | /utils/TableGen/TableGen.cpp | d94ff5937b2f346e4b7f41706ea8c15b7be75d96 | [
"NCSA"
] | permissive | abrageddon/LLVM-LabelAll-Clang | 9f9e772317f5576b53b43eee2ac166836e9c979e | 231befb2b4543d02c5af7c84c5f8b2b8c0126a8c | refs/heads/master | 2016-09-11T04:49:58.330250 | 2014-04-04T22:50:16 | 2014-04-04T22:50:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,433 | cpp | //===- TableGen.cpp - Top-Level TableGen implementation for Clang ---------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file contains the main function for Clang's TableGen.
//
//===----------------------------------------------------------------------===//
#include "TableGenBackends.h" // Declares all backends.
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/PrettyStackTrace.h"
#include "llvm/Support/Signals.h"
#include "llvm/TableGen/Error.h"
#include "llvm/TableGen/Main.h"
#include "llvm/TableGen/Record.h"
using namespace llvm;
using namespace clang;
enum ActionType {
GenClangAttrClasses,
GenClangAttrIdentifierArgList,
GenClangAttrArgContextList,
GenClangAttrTypeArgList,
GenClangAttrImpl,
GenClangAttrList,
GenClangAttrPCHRead,
GenClangAttrPCHWrite,
GenClangAttrSpellingList,
GenClangAttrSpellingListIndex,
GenClangAttrASTVisitor,
GenClangAttrLateParsedList,
GenClangAttrTemplateInstantiate,
GenClangAttrParsedAttrList,
GenClangAttrParsedAttrImpl,
GenClangAttrParsedAttrKinds,
GenClangAttrDump,
GenClangDiagsDefs,
GenClangDiagGroups,
GenClangDiagsIndexName,
GenClangCommentNodes,
GenClangDeclNodes,
GenClangStmtNodes,
GenClangSACheckers,
GenClangCommentHTMLTags,
GenClangCommentHTMLTagsProperties,
GenClangCommentHTMLNamedCharacterReferences,
GenClangCommentCommandInfo,
GenClangCommentCommandList,
GenArmNeon,
GenArmNeonSema,
GenArmNeonTest
};
namespace {
cl::opt<ActionType> Action(
cl::desc("Action to perform:"),
cl::values(
clEnumValN(GenClangAttrClasses, "gen-clang-attr-classes",
"Generate clang attribute clases"),
clEnumValN(GenClangAttrIdentifierArgList,
"gen-clang-attr-identifier-arg-list",
"Generate a list of attributes that take an "
"identifier as their first argument"),
clEnumValN(GenClangAttrArgContextList,
"gen-clang-attr-arg-context-list",
"Generate a list of attributes that parse their arguments "
"in an unevaluated context"),
clEnumValN(GenClangAttrTypeArgList,
"gen-clang-attr-type-arg-list",
"Generate a list of attributes that take a type as their "
"first argument"),
clEnumValN(GenClangAttrImpl, "gen-clang-attr-impl",
"Generate clang attribute implementations"),
clEnumValN(GenClangAttrList, "gen-clang-attr-list",
"Generate a clang attribute list"),
clEnumValN(GenClangAttrPCHRead, "gen-clang-attr-pch-read",
"Generate clang PCH attribute reader"),
clEnumValN(GenClangAttrPCHWrite, "gen-clang-attr-pch-write",
"Generate clang PCH attribute writer"),
clEnumValN(GenClangAttrSpellingList, "gen-clang-attr-spelling-list",
"Generate a clang attribute spelling list"),
clEnumValN(GenClangAttrSpellingListIndex,
"gen-clang-attr-spelling-index",
"Generate a clang attribute spelling index"),
clEnumValN(GenClangAttrASTVisitor,
"gen-clang-attr-ast-visitor",
"Generate a recursive AST visitor for clang attributes"),
clEnumValN(GenClangAttrLateParsedList,
"gen-clang-attr-late-parsed-list",
"Generate a clang attribute LateParsed list"),
clEnumValN(GenClangAttrTemplateInstantiate,
"gen-clang-attr-template-instantiate",
"Generate a clang template instantiate code"),
clEnumValN(GenClangAttrParsedAttrList,
"gen-clang-attr-parsed-attr-list",
"Generate a clang parsed attribute list"),
clEnumValN(GenClangAttrParsedAttrImpl,
"gen-clang-attr-parsed-attr-impl",
"Generate the clang parsed attribute helpers"),
clEnumValN(GenClangAttrParsedAttrKinds,
"gen-clang-attr-parsed-attr-kinds",
"Generate a clang parsed attribute kinds"),
clEnumValN(GenClangAttrDump, "gen-clang-attr-dump",
"Generate clang attribute dumper"),
clEnumValN(GenClangDiagsDefs, "gen-clang-diags-defs",
"Generate Clang diagnostics definitions"),
clEnumValN(GenClangDiagGroups, "gen-clang-diag-groups",
"Generate Clang diagnostic groups"),
clEnumValN(GenClangDiagsIndexName, "gen-clang-diags-index-name",
"Generate Clang diagnostic name index"),
clEnumValN(GenClangCommentNodes, "gen-clang-comment-nodes",
"Generate Clang AST comment nodes"),
clEnumValN(GenClangDeclNodes, "gen-clang-decl-nodes",
"Generate Clang AST declaration nodes"),
clEnumValN(GenClangStmtNodes, "gen-clang-stmt-nodes",
"Generate Clang AST statement nodes"),
clEnumValN(GenClangSACheckers, "gen-clang-sa-checkers",
"Generate Clang Static Analyzer checkers"),
clEnumValN(GenClangCommentHTMLTags, "gen-clang-comment-html-tags",
"Generate efficient matchers for HTML tag "
"names that are used in documentation comments"),
clEnumValN(GenClangCommentHTMLTagsProperties,
"gen-clang-comment-html-tags-properties",
"Generate efficient matchers for HTML tag "
"properties"),
clEnumValN(GenClangCommentHTMLNamedCharacterReferences,
"gen-clang-comment-html-named-character-references",
"Generate function to translate named character "
"references to UTF-8 sequences"),
clEnumValN(GenClangCommentCommandInfo, "gen-clang-comment-command-info",
"Generate command properties for commands that "
"are used in documentation comments"),
clEnumValN(GenClangCommentCommandList, "gen-clang-comment-command-list",
"Generate list of commands that are used in "
"documentation comments"),
clEnumValN(GenArmNeon, "gen-arm-neon", "Generate arm_neon.h for clang"),
clEnumValN(GenArmNeonSema, "gen-arm-neon-sema",
"Generate ARM NEON sema support for clang"),
clEnumValN(GenArmNeonTest, "gen-arm-neon-test",
"Generate ARM NEON tests for clang"),
clEnumValEnd));
cl::opt<std::string>
ClangComponent("clang-component",
cl::desc("Only use warnings from specified component"),
cl::value_desc("component"), cl::Hidden);
bool ClangTableGenMain(raw_ostream &OS, RecordKeeper &Records) {
switch (Action) {
case GenClangAttrClasses:
EmitClangAttrClass(Records, OS);
break;
case GenClangAttrIdentifierArgList:
EmitClangAttrIdentifierArgList(Records, OS);
break;
case GenClangAttrArgContextList:
EmitClangAttrArgContextList(Records, OS);
break;
case GenClangAttrTypeArgList:
EmitClangAttrTypeArgList(Records, OS);
break;
case GenClangAttrImpl:
EmitClangAttrImpl(Records, OS);
break;
case GenClangAttrList:
EmitClangAttrList(Records, OS);
break;
case GenClangAttrPCHRead:
EmitClangAttrPCHRead(Records, OS);
break;
case GenClangAttrPCHWrite:
EmitClangAttrPCHWrite(Records, OS);
break;
case GenClangAttrSpellingList:
EmitClangAttrSpellingList(Records, OS);
break;
case GenClangAttrSpellingListIndex:
EmitClangAttrSpellingListIndex(Records, OS);
break;
case GenClangAttrASTVisitor:
EmitClangAttrASTVisitor(Records, OS);
break;
case GenClangAttrLateParsedList:
EmitClangAttrLateParsedList(Records, OS);
break;
case GenClangAttrTemplateInstantiate:
EmitClangAttrTemplateInstantiate(Records, OS);
break;
case GenClangAttrParsedAttrList:
EmitClangAttrParsedAttrList(Records, OS);
break;
case GenClangAttrParsedAttrImpl:
EmitClangAttrParsedAttrImpl(Records, OS);
break;
case GenClangAttrParsedAttrKinds:
EmitClangAttrParsedAttrKinds(Records, OS);
break;
case GenClangAttrDump:
EmitClangAttrDump(Records, OS);
break;
case GenClangDiagsDefs:
EmitClangDiagsDefs(Records, OS, ClangComponent);
break;
case GenClangDiagGroups:
EmitClangDiagGroups(Records, OS);
break;
case GenClangDiagsIndexName:
EmitClangDiagsIndexName(Records, OS);
break;
case GenClangCommentNodes:
EmitClangASTNodes(Records, OS, "Comment", "");
break;
case GenClangDeclNodes:
EmitClangASTNodes(Records, OS, "Decl", "Decl");
EmitClangDeclContext(Records, OS);
break;
case GenClangStmtNodes:
EmitClangASTNodes(Records, OS, "Stmt", "");
break;
case GenClangSACheckers:
EmitClangSACheckers(Records, OS);
break;
case GenClangCommentHTMLTags:
EmitClangCommentHTMLTags(Records, OS);
break;
case GenClangCommentHTMLTagsProperties:
EmitClangCommentHTMLTagsProperties(Records, OS);
break;
case GenClangCommentHTMLNamedCharacterReferences:
EmitClangCommentHTMLNamedCharacterReferences(Records, OS);
break;
case GenClangCommentCommandInfo:
EmitClangCommentCommandInfo(Records, OS);
break;
case GenClangCommentCommandList:
EmitClangCommentCommandList(Records, OS);
break;
case GenArmNeon:
EmitNeon(Records, OS);
break;
case GenArmNeonSema:
EmitNeonSema(Records, OS);
break;
case GenArmNeonTest:
EmitNeonTest(Records, OS);
break;
}
return false;
}
}
int main(int argc, char **argv) {
sys::PrintStackTraceOnErrorSignal();
PrettyStackTraceProgram X(argc, argv);
cl::ParseCommandLineOptions(argc, argv);
return TableGenMain(argv[0], &ClangTableGenMain);
}
#ifdef __has_feature
#if __has_feature(address_sanitizer)
#include <sanitizer/lsan_interface.h>
// Disable LeakSanitizer for this binary as it has too many leaks that are not
// very interesting to fix. See compiler-rt/include/sanitizer/lsan_interface.h .
int __lsan_is_turned_off() { return 1; }
#endif // __has_feature(address_sanitizer)
#endif // defined(__has_feature)
| [
"[email protected]"
] | |
0bf9d9c76647bcbdff05233a9f39b99be45c65e9 | 9b882b48bf4fb6f692173b86fd97a03a0d0ebda0 | /Project/Dusk2/shootapplication.cpp | e53852f447f200b387614ef2c21a4d87559fcc00 | [] | no_license | INF-COMGR/OpenGL-Project | 7cfd814fb4f59de509767bd2dc344ef9a5473936 | 0970a7081ea774574ff1ae3dda7f06a387e6fb48 | refs/heads/main | 2023-05-09T01:33:17.198422 | 2021-05-19T19:01:11 | 2021-05-19T19:01:11 | 362,388,151 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 672 | cpp | #include "shootapplication.h"
#include <QSurfaceFormat>
ShootApplication::ShootApplication(QWidget *parent) : QMainWindow {parent} {
// QSurfaceFormat format;
// format.setDepthBufferSize(24);
// format.setStencilBufferSize(8);
// format.setVersion(4, 1);
// format.setProfile(QSurfaceFormat::CoreProfile);
// format.setOption(QSurfaceFormat::DeprecatedFunctions);
// view.makeCurrent();
// QSurfaceFormat::setDefaultFormat(format);
// view.setFormat(format);
setWindowTitle("SHOOT");
resize(640,480); //getallen van Frank (breedte en hoogte)
setWindowState(Qt::WindowFullScreen); //set full screen
setCentralWidget(&view);
}
| [
"[email protected]"
] | |
001be40483ec64d9f72e617ace195eead1375b57 | 1fda514c3060ac74d493f5b706dee12bb9701808 | /leapfrog-game/src/buttondisplay.cpp | f1a897c62ba1a10891fa9ae2bc80d620d609160a | [] | no_license | stfrha/leapfrog | dade0b55c79b20f93b058e2af75e17c273de1068 | 62e3ead7ae48b2c2ed46c174a194caa3cae8e956 | refs/heads/master | 2022-11-23T17:12:56.011099 | 2022-11-21T22:10:56 | 2022-11-21T22:10:56 | 125,433,752 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,273 | cpp | #include "ButtonDisplay.h"
#include "mainactor.h"
#include "layout.h"
#include "graphicresources.h"
using namespace std;
using namespace oxygine;
ButtonDisplay::ButtonDisplay() :
m_turnRightTouchIndex(0),
m_turnLeftTouchIndex(0),
m_boosterTouchIndex(0),
m_fireTouchIndex(0),
m_zoomInTouchIndex(0),
m_zoomOutTouchIndex(0),
m_panTouchIndex(0),
m_reloadTouchIndex(0)
{
}
void ButtonDisplay::initialiseButtonDisplay(
SceneActor* sceneActor,
const Vector2& topLeft,
const Vector2& bottomRight)
{
m_sceneActor = sceneActor;
createButtonOverlay();
}
void ButtonDisplay::sceneDownHandler(Event* event)
{
TouchEvent* te = (TouchEvent*)event;
Vector2 v = te->localPosition;
// logs::messageln("Down with index: %d", te->index);
Point p = Point((int)v.x, (int)v.y);
if (m_turnLeftButtonRect.pointIn(p))
{
m_sceneActor->m_turnLeftPressed = true;
m_turnLeftTouchIndex = te->index;
}
else if (m_turnRightButtonRect.pointIn(p))
{
m_sceneActor->m_turnRightPressed = true;
m_turnRightTouchIndex = te->index;
}
else if (m_boosterButtonRect.pointIn(p))
{
m_sceneActor->m_boosterPressed = true;
m_boosterTouchIndex = te->index;
}
else if (m_fireButtonRect.pointIn(p))
{
m_sceneActor->m_firePressed = true;
m_fireTouchIndex = te->index;
}
else if (m_pauseButtonRect.pointIn(p))
{
m_sceneActor->m_pausePressed = true;
m_pauseTouchIndex = te->index;
}
else if (m_zoomInButtonRect.pointIn(p))
{
if (m_manualPan.m_manPanEnable)
{
m_sceneActor->m_zoomInPressed = true;
m_zoomInTouchIndex = te->index;
}
}
else if (m_zoomOutButtonRect.pointIn(p))
{
if (m_manualPan.m_manPanEnable)
{
m_sceneActor->m_zoomOutPressed = true;
m_zoomOutTouchIndex = te->index;
}
}
else if (m_manPanEnableButtonRect.pointIn(p))
{
m_sceneActor->m_manPanEnablePressed = true;
m_manPanEnableTouchIndex = te->index;
}
else if (m_panButtonRect.pointIn(p))
{
if (m_manualPan.m_manPanEnable)
{
m_sceneActor->m_panButtonPressed = true;
m_panTouchIndex = te->index;
m_panStartPos = v;
}
}
else if (m_reloadButtonRect.pointIn(p))
{
if (m_manualPan.m_manPanEnable)
{
g_MainActor->m_reloadPressed = true;
m_reloadTouchIndex = te->index;
}
}
}
void ButtonDisplay::sceneUpHandler(Event* event)
{
TouchEvent* te = (TouchEvent*)event;
//logs::messageln("Up with index: %d", te->index);
// Vector2 v = te->localPosition;
// Point p = Point((int)v.x, (int)v.y);
if (te->index == m_turnLeftTouchIndex)
{
m_sceneActor->m_turnLeftPressed = false;
m_turnLeftTouchIndex = 0;
}
else if (te->index == m_turnRightTouchIndex)
{
m_sceneActor->m_turnRightPressed = false;
m_turnRightTouchIndex = 0;
}
else if (te->index == m_boosterTouchIndex)
{
m_sceneActor->m_boosterPressed = false;
m_boosterTouchIndex = 0;
}
else if (te->index == m_fireTouchIndex)
{
m_sceneActor->m_firePressed = false;
m_fireTouchIndex = 0;
}
else if (te->index == m_pauseTouchIndex)
{
m_sceneActor->m_pausePressed = false;
m_pauseTouchIndex = 0;
}
else if (te->index == m_zoomInTouchIndex)
{
m_sceneActor->m_zoomInPressed = false;
m_zoomInTouchIndex = 0;
}
else if (te->index == m_zoomOutTouchIndex)
{
m_sceneActor->m_zoomOutPressed = false;
m_zoomOutTouchIndex = 0;
}
else if (te->index == m_manPanEnableTouchIndex)
{
m_sceneActor->m_manPanEnablePressed = false;
m_manPanEnableTouchIndex = 0;
setManualPanButtonState();
}
else if (te->index == m_panTouchIndex)
{
m_sceneActor->m_panButtonPressed = false;
m_sceneActor->m_panVector = Vector2(0.0f, 0.0f);
m_panTouchIndex = 0;
}
else if (te->index == m_reloadTouchIndex)
{
g_MainActor->m_reloadPressed = false;
m_reloadTouchIndex = 0;
}
}
void ButtonDisplay::panMoveHandler(Event* event)
{
TouchEvent* te = (TouchEvent*)event;
if (te->index == m_panTouchIndex)
{
m_sceneActor->m_panVector = (te->localPosition - m_panStartPos) / 8.0f;
}
}
void ButtonDisplay::sceneMoveHandler(Event* event)
{
TouchEvent* te = (TouchEvent*)event;
Vector2 v = te->localPosition;
//logs::messageln("Move with index: %d", te->index);
}
void ButtonDisplay::setManualPanButtonState(void)
{
if (m_manualPan.m_manPanEnable)
{
m_manPanEnableSprite->setAlpha(255);
m_manPanSprite->setVisible(true);
m_reloadSprite->setVisible(true);
m_zoomInSprite->setVisible(true);
m_zoomOutSprite->setVisible(true);
}
else
{
m_manPanEnableSprite->setAlpha(128);
m_manPanSprite->setVisible(false);
m_reloadSprite->setVisible(false);
m_zoomInSprite->setVisible(false);
m_zoomOutSprite->setVisible(false);
}
}
void ButtonDisplay::createButtonOverlay(void)
{
// Caluclate button geometrics
m_turnLeftButtonRect = RectF(0.0f, g_Layout.getYFromBottom(1), g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_turnRightButtonRect = RectF(g_Layout.getButtonWidth(), g_Layout.getYFromBottom(0), g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_boosterButtonRect = RectF(g_Layout.getXFromRight(0), g_Layout.getYFromBottom(1), g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_fireButtonRect = RectF(g_Layout.getXFromRight(1), g_Layout.getYFromBottom(0), g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_pauseButtonRect = RectF(g_Layout.getXFromRight(0), 0.0f, g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_manPanEnableButtonRect = RectF(g_Layout.getXFromRight(1) - g_Layout.getButtonWidth() / 2.0f, 0.0f, g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_zoomInButtonRect = RectF(g_Layout.getXFromRight(2) - g_Layout.getButtonWidth() / 2.0f, 0.0f, g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_zoomOutButtonRect = RectF(g_Layout.getXFromRight(4), 0.0f, g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_reloadButtonRect = RectF(g_Layout.getXFromRight(5) - g_Layout.getButtonWidth() / 2.0f, 0.0f, g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
m_panButtonRect = RectF(g_Layout.getViewPortBounds().x / 2.0f - g_Layout.getButtonWidth() / 2.0f, g_Layout.getViewPortBounds().y / 2.0f - g_Layout.getButtonWidth() / 2.0f, g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
// Define sprites
spSprite turnLeftButton = new Sprite();
turnLeftButton->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("turn_left_button"));
turnLeftButton->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
turnLeftButton->setPosition(m_turnLeftButtonRect.getLeftTop());
turnLeftButton->setAnchor(0.0f, 0.0f);
turnLeftButton->setTouchEnabled(false);
turnLeftButton->attachTo(this);
spSprite turnRightButton = new Sprite();
turnRightButton->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("turn_right_button"));
turnRightButton->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
turnRightButton->setPosition(m_turnRightButtonRect.getLeftTop());
turnRightButton->setAnchor(0.0f, 0.0f);
turnRightButton->setTouchEnabled(false);
turnRightButton->attachTo(this);
spSprite fireButton = new Sprite();
fireButton->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("fire_button"));
fireButton->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
fireButton->setPosition(m_fireButtonRect.getLeftTop());
fireButton->setAnchor(0.0f, 0.0f);
fireButton->setTouchEnabled(false);
fireButton->attachTo(this);
spSprite thursterButton = new Sprite();
thursterButton->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("booster_button"));
thursterButton->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
thursterButton->setPosition(m_boosterButtonRect.getLeftTop());
thursterButton->setAnchor(0.0f, 0.0f);
thursterButton->setTouchEnabled(false);
thursterButton->attachTo(this);
spSprite pauseButton = new Sprite();
pauseButton->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("pause_button"));
pauseButton->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
pauseButton->setPosition(m_pauseButtonRect.getLeftTop());
pauseButton->setAnchor(0.0f, 0.0f);
pauseButton->setTouchEnabled(false);
pauseButton->attachTo(this);
spSprite zoomOutSprite = new Sprite();
zoomOutSprite->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("zoom_out_button"));
zoomOutSprite->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
zoomOutSprite->setPosition(m_zoomOutButtonRect.getLeftTop());
zoomOutSprite->setAnchor(0.0f, 0.0f);
zoomOutSprite->setTouchEnabled(false);
zoomOutSprite->attachTo(this);
m_zoomOutSprite = zoomOutSprite.get();
spSprite zoomInSprite = new Sprite();
zoomInSprite->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("zoom_in_button"));
zoomInSprite->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
zoomInSprite->setPosition(m_zoomInButtonRect.getLeftTop());
zoomInSprite->setAnchor(0.0f, 0.0f);
zoomInSprite->setTouchEnabled(false);
zoomInSprite->attachTo(this);
m_zoomInSprite = zoomInSprite.get();
spSprite manPanEnableSprite = new Sprite();
manPanEnableSprite->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("pan_button"));
manPanEnableSprite->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
manPanEnableSprite->setPosition(m_manPanEnableButtonRect.getLeftTop());
manPanEnableSprite->setAnchor(0.0f, 0.0f);
manPanEnableSprite->setTouchEnabled(false);
manPanEnableSprite->attachTo(this);
m_manPanEnableSprite = manPanEnableSprite.get();
spSprite manPanSprite = new Sprite();
manPanSprite->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("pan_button"));
manPanSprite->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
manPanSprite->setPosition(m_panButtonRect.getLeftTop());
manPanSprite->setAnchor(0.0f, 0.0f);
manPanSprite->setTouchEnabled(false);
manPanSprite->attachTo(this);
m_manPanSprite = manPanSprite.get();
spSprite reloadSprite = new Sprite();
reloadSprite->setResAnim(g_GraphRes.getResources(GraphicResources::ResourceTypeEnum::hud).getResAnim("reload_button"));
reloadSprite->setSize(g_Layout.getButtonWidth(), g_Layout.getButtonWidth());
reloadSprite->setPosition(m_reloadButtonRect.getLeftTop());
reloadSprite->setAnchor(0.0f, 0.0f);
reloadSprite->setTouchEnabled(false);
reloadSprite->attachTo(this);
m_reloadSprite = reloadSprite.get();
setManualPanButtonState();
m_sceneActor->setManualPan(&m_manualPan);
}
void ButtonDisplay::doUpdate(const UpdateState& us)
{
}
| [
"[email protected]"
] | |
dce3f90f3b2eb2095fa357bc278c9e3b004862d8 | 73655b63a727f86e1769209f7ddcd28fcd9d9491 | /Chapter_11/Customizing_io/custom_io.cpp | 94d98d70d31099dc4f662ac2852a47daf1b70814 | [] | no_license | Radu1990/CPP_Bjarne_Stroustrup | a5aab159c49a9998309522c911d54bc0978ecde6 | fe63fb696fe78a8926a601e66bcd7ea898e24ec9 | refs/heads/master | 2020-05-16T17:27:48.837366 | 2019-06-11T22:26:21 | 2019-06-11T22:26:21 | 183,194,996 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,952 | cpp | #include "custom_io.h"
#include "std_lib_facilities.h"
// This program includes the examples from
// Chapter 11. Customizing Input and Output
void f_1() {
cout << "\nFunction 1 - Integer output:\n";
cout << 1234 << "\t(decimal)\n"
<< hex << 1234 << "\t(hexadecimal)\n"
<< oct << 1234 << "\t(octal)\n";
}
void f_2() {
cout << "\nFunction 2 - Integer output:\n";
cout << 1234 << "\t" << hex << 1234 << "\t" << oct << 1234 << '\n';
cout << 1234;
}
void f_3() {
// decimal numbers - no prefix
// octal numbers - prefix 0
// hexadecimal numbers - prefix 0x or 0X
cout << "\nFunction 3 - Show base:\n";
cout << 1234 << "\t" << hex << 1234 << "\t" << oct << 1234 << '\n';
cout << showbase << dec; // show bases
cout << 1234 << '\t' << hex << 1234 << '\t' << oct << 1234 << '\n';
// to revert use "noshowbase"
}
void f_4() {
cout << "\nFunction 4 - print dec, oct and hex in decimal form:\n";
// print dec, oct, and hex numbers in decimal form
cout << 1234 << '\t' << 0x4d2 << '\t' << 02322 << '\n';
}
void f_5() {
cout << "\nFunction 5 - Integer input:\n";
// tell >> to read hexadecimal or octal integers, by default he reads decimal integers
int a,b,c,d;
cin >> a >> hex >> b >> oct >> c >> d;
cout << a << '\t' << b << '\t' << c << '\t' << d << '\n';
// input: 1234 4d2 2322 2322
// output: 1234 1234 1234 1234
// ! oct, hex and dec stick for input as they do for output
}
void f_6(istream& aa, istream& bb) {
cout << "\nFunction 6 - Integer input:\n";
// You can get >> to interpret the 0 and 0x prefixes by unsetting all the defaults.
// The stream member function unsetf() clears the flag (or flags)
// given as argument.
int a,b,c,d;
// input: 1234 4d2 2322 2322
// output: 1234 1234 1234 1234
aa >> a >> hex >> b >> oct >> c >> d;
cout << a << '\t' << b << '\t' << c << '\t' << d << '\n';
bb.unsetf(ios::dec);
bb.unsetf(ios::oct);
bb.unsetf(ios::hex);
bb >> a >> b >> c >> d;
cout << a << '\t' << b << '\t' << c << '\t' << d << '\n';
// input: 1234 0x4d2 02322 02322
// output: 1234 1234 1234 1234
}
void f_6_1() {
cout << "\nFunction 6 - Integer input:\n";
// Trying to simplify things and testing the
// function from above using istringstream
int a,b,c,d;
// input:
// output: 1234 1234 1234 1234
istringstream aa {"1234 4d2 2322 2322"};
aa >> a >> hex >> b >> oct >> c >> d;
cout << a << '\t' << b << '\t' << c << '\t' << d << '\n';
aa.unsetf(ios::dec);
aa.unsetf(ios::oct);
aa.unsetf(ios::hex);
aa >> a >> b >> c >> d;
cout << a << '\t' << b << '\t' << c << '\t' << d << '\n';
// input: 1234 0x4d2 02322 02322
// output: 1234 1234 1234 1234
}
void f_7() {
cout << "\nFunction 7 - Floating point ouput:\n";
// Useful typically for hardware or scientific calculations
cout << 1234.56789 << "\t\t\t(defaultfloat)\n"
<< fixed << 1234.56789 << "\t\t(fixed)\n"
<< scientific << 1234.56789 << "\t(scientific)\n";
cout << 1234.56789 << "\t(scientific) sticks\n"
<< defaultfloat << 1234.56789 << '\t'
<< fixed << 1234.56789 << '\t' << scientific << 1234.56789 << '\n';
}
void try_this_1() {
cout << defaultfloat << 1234567.89 << "\t\t\t(defaultfloat)\n"
<< fixed << 1234567.89 << "\t\t(fixed)\n"
<< scientific << 1234567.89 << "\t(scientific)\n";
}
void f_8() {
cout << "\nFunction 8 - Precision:\n";
// By default, a floating-point value is printed using six total
// digits using the default format
cout << "Default precision:\n";
cout << 1234.56789 << "\t\t\t(defaultfloat)\n"
<< fixed << 1234.56789 << "\t\t(fixed)\n"
<< scientific << 1234.56789 << "\t(scientific)\n";
cout << "setprecision(5):\n";
cout << defaultfloat << setprecision(5) << 1234.56789 << '\t'
<< fixed << 1234.56789 << '\t'
<< scientific << 1234.56789 << '\n';
cout << "setprecision(8):\n";
cout << defaultfloat << setprecision(8) << 1234.56789 << '\t'
<< fixed << 1234.56789 << '\t'
<< scientific << 1234.56789 << '\t';
// observe the rounding rule (the 4/5 Rule)
}
void f_9() {
cout << "\nFunction 9 - Fields:\n";
// using scientific and fixed formats, you can control exactly how much space
// a value takes up on output
// the equivalent mechanism for integer values is called fields.
cout << 123456 << '|' << setw(4) << 123456 << '|'
<< setw(8) << 123456 << '|' << 123456 << "|\n";
// ! Note that the field width doesn't stick!
// ! It must be set every time before the output operator
}
void try_this_2() {
// simple table including last name, first name,
// telephone number and e-mail address
vector<string>description{
"first name", "last name", "Phone number", "e-mail"
};
vector<string>last_name{
"Radu", "Maria", "Victor", "Jon", "Delia", "Raluca"
};
vector<string>first_name{
"Pelicanul", "Broasca", "Croitorul", "Crocodilul",
"Pisica", "Ciripitoarea"
};
vector<string>phone{
"+49(0)12265348942","+49(0)15565343942","+49(0)15567548942",
"+49(0)15135348942", "+49(0)67465348942","+49(0)11095348942"
};
vector<string>email{"[email protected]", "[email protected]",
"[email protected]", "[email protected]",
"[email protected]", "[email protected]"
};
// The future me will probably laugh at this code.
cout << "+----------------------------------------------------------------------------------+\n"
<< '|' << setw(15) << description[0] << '|' << setw(14) << description[1] << '|' << setw(20) << description[2] << '|' << setw(30) << description[3] << '|' << '\n'
<< "+----------------------------------------------------------------------------------+\n"
<< '|' << setw(15) << last_name[0] << '|' << setw(14) << first_name[0] << '|' << setw(20) << phone[0] << '|' << setw(30) << email[0] << '|' << '\n'
<< '|' << setw(15) << last_name[1] << '|' << setw(14) << first_name[1] << '|' << setw(20) << phone[1] << '|' << setw(30) << email[1] << '|' << '\n'
<< '|' << setw(15) << last_name[2] << '|' << setw(14) << first_name[2] << '|' << setw(20) << phone[2] << '|' << setw(30) << email[2] << '|' << '\n'
<< '|' << setw(15) << last_name[3] << '|' << setw(14) << first_name[3] << '|' << setw(20) << phone[3] << '|' << setw(30) << email[3] << '|' << '\n'
<< '|' << setw(15) << last_name[4] << '|' << setw(14) << first_name[4] << '|' << setw(20) << phone[4] << '|' << setw(30) << email[4] << '|' << '\n'
<< '|' << setw(15) << last_name[5] << '|' << setw(14) << first_name[5] << '|' << setw(20) << phone[5] << '|' << setw(30) << email[5] << '|' << '\n'
<< "+----------------------------------------------------------------------------------+\n";
}
void f_10(){
// open an istream for binary input from a file:
// can use cout << Please enter input file name
// and then cin >> iname; as-well
string iname{"filenamehere"};
ifstream ifs {iname, ios_base::binary};
// note stream mode binary tells the stream
// not to try anything clever with the bytes.
if (!ifs) error("can't open input file ", iname);
// open an ostream for binary output to a file
string oname{"filenamehere"};
ofstream ofs {oname, ios_base::binary};
if (!ofs) error("can't open output file", oname);
vector<int> v;
// read from binary file:
for (int x; ifs.read(as_bytes(x), sizeof(int));){ // note: reading bytes
v.push_back(x);
}
// ... do something with v ...
// write to binary file:
for(int x : v) {
ofs.write(as_bytes(x), sizeof(int)); // note: writing bytes
}
}
| [
"[email protected]"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.