blob_id
stringlengths 40
40
| directory_id
stringlengths 40
40
| path
stringlengths 2
247
| content_id
stringlengths 40
40
| detected_licenses
listlengths 0
57
| license_type
stringclasses 2
values | repo_name
stringlengths 4
111
| snapshot_id
stringlengths 40
40
| revision_id
stringlengths 40
40
| branch_name
stringlengths 4
58
| visit_date
timestamp[ns]date 2015-07-25 18:16:41
2023-09-06 10:45:08
| revision_date
timestamp[ns]date 1970-01-14 14:03:36
2023-09-06 06:22:19
| committer_date
timestamp[ns]date 1970-01-14 14:03:36
2023-09-06 06:22:19
| github_id
int64 3.89k
689M
⌀ | star_events_count
int64 0
209k
| fork_events_count
int64 0
110k
| gha_license_id
stringclasses 25
values | gha_event_created_at
timestamp[ns]date 2012-06-07 00:51:45
2023-09-14 21:58:52
⌀ | gha_created_at
timestamp[ns]date 2008-03-27 23:40:48
2023-08-24 19:49:39
⌀ | gha_language
stringclasses 159
values | src_encoding
stringclasses 34
values | language
stringclasses 1
value | is_vendor
bool 1
class | is_generated
bool 2
classes | length_bytes
int64 7
10.5M
| extension
stringclasses 111
values | filename
stringlengths 1
195
| text
stringlengths 7
10.5M
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b9369292d39ccbc985c069f7c99f2cf7daee68a7
|
08e04af75fa7b12f56a762f30745228f878db806
|
/sdf-net/lib/submodules/libigl/python/python_shared.cpp
|
955037564fed8de9bdcfc871979d7a1a9c4c263e
|
[
"MIT",
"GPL-3.0-only",
"MPL-2.0"
] |
permissive
|
hardikk13/nglod
|
3d4bd01124cc7a084688ae014b24f4365460160b
|
6c6c66ce1b39c5a3515cafc290ec903ae90b506e
|
refs/heads/main
| 2023-05-07T10:48:19.715916
| 2021-05-19T17:31:17
| 2021-05-19T17:31:17
| 367,096,223
| 0
| 0
|
MIT
| 2021-05-13T15:42:42
| 2021-05-13T15:42:42
| null |
UTF-8
|
C++
| false
| false
| 4,862
|
cpp
|
python_shared.cpp
|
// This file is part of libigl, a simple c++ geometry processing library.
//
// Copyright (C) 2017 Sebastian Koch <s.koch@tu-berlin.de> and Daniele Panozzo <daniele.panozzo@gmail.com>
//
// This Source Code Form is subject to the terms of the Mozilla Public License
// v. 2.0. If a copy of the MPL was not distributed with this file, You can
// obtain one at http://mozilla.org/MPL/2.0/.
#include "python_shared.h"
#include <sstream>
#include <string>
#include <fstream>
extern void python_export_vector(py::module &);
extern void python_export_igl(py::module &);
#ifdef PY_GLFW
extern void python_export_igl_glfw(py::module &);
#endif
#ifdef PY_COMISO
extern void python_export_igl_comiso(py::module &);
#endif
#ifdef PY_TETGEN
extern void python_export_igl_tetgen(py::module &);
#endif
#ifdef PY_EMBREE
extern void python_export_igl_embree(py::module &);
#endif
#ifdef PY_TRIANGLE
extern void python_export_igl_triangle(py::module &);
#endif
#ifdef PY_CGAL
extern void python_export_igl_cgal(py::module &);
#endif
#ifdef PY_COPYLEFT
extern void python_export_igl_copyleft(py::module &);
#endif
#ifdef PY_PNG
extern void python_export_igl_png(py::module &);
#endif
PYBIND11_PLUGIN(pyigl) {
py::module m("pyigl", R"pyigldoc(
Python wrappers for libigl
--------------------------
.. currentmodule:: pyigl
.. autosummary::
:toctree: _generate
AABB
ARAPEnergyType
MeshBooleanType
SolverStatus
active_set
adjacency_list
arap
avg_edge_length
barycenter
barycentric_coordinates
barycentric_to_global
bbw
boundary_conditions
boundary_facets
boundary_loop
cat
collapse_edge
colon
column_to_quats
comb_cross_field
comb_frame_field
compute_frame_field_bisectors
copyleft_cgal_RemeshSelfIntersectionsParam
copyleft_cgal_mesh_boolean
copyleft_cgal_remesh_self_intersections
copyleft_comiso_miq
copyleft_comiso_nrosy
copyleft_marching_cubes
copyleft_swept_volume
copyleft_tetgen_tetrahedralize
cotmatrix
covariance_scatter_matrix
cross_field_mismatch
cut_mesh_from_singularities
deform_skeleton
directed_edge_orientations
directed_edge_parents
doublearea
dqs
edge_lengths
edge_topology
eigs
embree_ambient_occlusion
embree_line_mesh_intersection
embree_reorient_facets_raycast
find_cross_field_singularities
fit_rotations
floor
fast_winding_number
forward_kinematics
gaussian_curvature
get_seconds
grad
harmonic
hsv_to_rgb
internal_angles
invert_diag
is_irregular_vertex
jet
lbs_matrix
local_basis
lscm
map_vertices_to_circle
massmatrix
min_quad_with_fixed
normalize_row_lengths
normalize_row_sums
parula
per_corner_normals
per_edge_normals
per_face_normals
per_vertex_normals
planarize_quad_mesh
png_readPNG
png_writePNG
point_mesh_squared_distance
polar_svd
principal_curvature
quad_planarity
randperm
readDMAT
readMESH
readOBJ
readOFF
readTGF
read_triangle_mesh
remove_duplicate_vertices
rotate_vectors
setdiff
signed_distance
slice
slice_into
slice_mask
marching_tets
sortrows
streamlines
triangle_triangle_adjacency
triangle_triangulate
unique
unproject_onto_mesh
upsample
winding_number
writeMESH
writeOBJ
writePLY
readPLY
)pyigldoc");
python_export_vector(m);
python_export_igl(m);
#ifdef PY_GLFW
python_export_igl_glfw(m);
#endif
#ifdef PY_COMISO
python_export_igl_comiso(m);
#endif
#ifdef PY_TETGEN
python_export_igl_tetgen(m);
#endif
#ifdef PY_EMBREE
python_export_igl_embree(m);
#endif
#ifdef PY_TRIANGLE
python_export_igl_triangle(m);
#endif
#ifdef PY_CGAL
python_export_igl_cgal(m);
#endif
#ifdef PY_COPYLEFT
python_export_igl_copyleft(m);
#endif
#ifdef PY_PNG
python_export_igl_png(m);
#endif
return m.ptr();
}
|
9c17007a5a4c15011d5e731645d094e719bb4bdb
|
ab2fde8c987e4108690b84eb1508fa65ff04aece
|
/source/lib/PccLibCommon/source/PCCKdTree.cpp
|
1b03f0a8c46cfa92c53e6297925fe778d664298f
|
[
"BSD-3-Clause"
] |
permissive
|
MPEGGroup/mpeg-pcc-tmc2
|
a319c14febdd75b1c5137da3777d015cb915b03e
|
30ce27aeb9d88d5dd2efedc6d45086396260444d
|
refs/heads/master
| 2023-03-08T14:49:57.434200
| 2022-05-30T12:22:33
| 2022-05-30T12:22:33
| 194,936,485
| 129
| 52
|
NOASSERTION
| 2023-03-07T21:28:57
| 2019-07-02T21:20:59
|
C++
|
UTF-8
|
C++
| false
| false
| 3,625
|
cpp
|
PCCKdTree.cpp
|
/* The copyright in this software is being made available under the BSD
* License, included below. This software may be subject to other third party
* and contributor rights, including patent rights, and no such rights are
* granted under this license.
*
* Copyright (c) 2010-2017, ISO/IEC
* 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 ISO/IEC nor the names of its contributors may
* be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "PCCCommon.h"
#include "PCCPointSet.h"
#include "PCCKdTree.h"
#include "KDTreeVectorOfVectorsAdaptor.h"
using namespace pcc;
typedef KDTreeVectorOfVectorsAdaptor<PCCPointSet3, PCCType, float, 3, metric_L2_Simple_2, size_t> KdTreeAdaptor;
PCCKdTree::PCCKdTree() : kdtree_( nullptr ) {}
PCCKdTree::PCCKdTree( const PCCPointSet3& pointCloud ) : kdtree_( nullptr ) { init( pointCloud ); }
PCCKdTree::~PCCKdTree() { clear(); }
void PCCKdTree::clear() {
if ( kdtree_ != nullptr ) {
delete ( static_cast<KdTreeAdaptor*>( kdtree_ ) );
kdtree_ = nullptr;
}
}
void PCCKdTree::init( const PCCPointSet3& pointCloud ) {
clear();
kdtree_ = new KdTreeAdaptor( 3, pointCloud, 10 );
}
void PCCKdTree::search( const PCCPoint3D& point, const size_t num_results, PCCNNResult& results ) const {
if ( num_results != results.size() ) { results.resize( num_results ); }
auto retSize = ( static_cast<KdTreeAdaptor*>( kdtree_ ) )
->index->knnSearch( &point[0], num_results, results.indices(), results.dist() );
assert( retSize == results.size() );
}
void PCCKdTree::searchRadius( const PCCPoint3D& point,
const size_t num_results,
const double radius,
PCCNNResult& results ) const {
std::vector<std::pair<size_t, double> > ret;
nanoflann::SearchParams params;
size_t retSize = ( static_cast<KdTreeAdaptor*>( kdtree_ ) )->index->radiusSearch( &point[0], radius, ret, params );
if ( retSize > num_results ) { retSize = num_results; }
ret.resize( retSize );
results.reserve( retSize );
for ( const auto& result : ret ) { results.pushBack( result ); }
}
|
5b00465b80ac4e3db719a26d2cf5c8553dfad237
|
0f6765cdbf6b59519a407e071be79f860898640f
|
/alho/seqdebug.h
|
c890a05c7599666f289a7f6db751bb7f39bc2049
|
[] |
no_license
|
skifcorp/bossn
|
0d6ee9d894c823fd9660f9c6d05f1ec6313fccb9
|
09b9d1cd6542fa5af71e8808572552d618160eee
|
HEAD
| 2016-09-06T00:08:25.981114
| 2014-09-19T05:47:11
| 2014-09-19T05:47:11
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 502
|
h
|
seqdebug.h
|
#ifndef SEQDEBUG_H
#define SEQDEBUG_H
#include <QDebug>
#include <QString>
class MainSequenceBaseOp;
class SeqDebug : public QDebug
{
public:
SeqDebug(bool use_db, MainSequenceBaseOp& s, int err_code, bool toCons = true) :
QDebug(&buffer), use_database(use_db), seq(s),
error_code(err_code), to_console(toCons) {}
~SeqDebug();
private:
bool use_database;
MainSequenceBaseOp & seq;
QString buffer;
int error_code;
bool to_console;
};
#endif // SEQDEBUG_H
|
6f906b7cc907045e629112e15a9e7fd3afaeeea4
|
ad57ffe2372cf614796e316b4865ba02a760acab
|
/tcs/csp_solver_pt_sf_perf_interp.h
|
659cf11c0c7ede8e927f0646803b14211cb1fc36
|
[
"LGPL-2.0-or-later",
"LGPL-2.1-only",
"BSD-3-Clause"
] |
permissive
|
NREL/ssc
|
6208c26a9bbab21d7beca630d61b8640fe073f49
|
38860345e14a14357cf2ad4f1918729a0c7ac0c6
|
refs/heads/develop
| 2023-08-30T10:09:17.654286
| 2023-08-16T20:27:59
| 2023-08-16T20:27:59
| 94,245,800
| 74
| 84
|
BSD-3-Clause
| 2023-09-14T20:03:50
| 2017-06-13T18:40:17
|
C++
|
UTF-8
|
C++
| false
| false
| 4,945
|
h
|
csp_solver_pt_sf_perf_interp.h
|
/*
BSD 3-Clause License
Copyright (c) Alliance for Sustainable Energy, LLC. See also https://github.com/NREL/ssc/blob/develop/LICENSE
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __csp_solver_pt_heliostatfield_
#define __csp_solver_pt_heliostatfield_
#include "csp_solver_util.h"
#include "csp_solver_core.h"
#include "sort_method.h"
#include "interpolation_routines.h"
#include "AutoPilot_API.h"
#include "IOUtil.h"
class C_pt_sf_perf_interp
{
private:
// Class Instances
GaussMarkov *field_efficiency_table;
MatDoub m_map_sol_pos;
double m_p_start; //[kWe-hr] Heliostat startup energy
double m_p_track; //[kWe] Heliostat tracking power
double m_hel_stow_deploy; //[rad] converted from [deg] in ms_params
double m_v_wind_max; //[m/s]
int m_n_flux_x; //[-]
int m_n_flux_y; //[-]
// receiver target values
double m_A_rec_active_total; //[m2]
double m_A_rec_flux_node; //[m2]
//Stored Variables
bool m_is_field_tracking;
bool m_is_field_tracking_prev;
// member string for exception messages
std::string error_msg;
double rdist(VectDoub *p1, VectDoub *p2, int dim = 2);
// track number of calls per timestep, reset = -1 in converged() call
int m_ncall;
public:
// Class to save messages for up stream classes
C_csp_messages mc_csp_messages;
C_pt_sf_perf_interp(double m_A_rec_active_total /*m2*/);
~C_pt_sf_perf_interp();
struct RUN_TYPE { enum A {AUTO, USER_FIELD, USER_DATA}; };
// Callback funtion
bool(*mf_callback)(simulation_info* siminfo, void *data);
void *m_cdata;
struct S_params
{
bool m_eta_map_aod_format; //[-]
double m_p_start; //[kWe-hr] Heliostat startup energy
double m_p_track; //[kWe] Heliostat tracking power
double m_hel_stow_deploy; //[deg] convert to [rad] in init()
double m_v_wind_max; //[m/s] max wind speed
int m_N_hel; //[-]
int m_n_flux_x;
int m_n_flux_y;
util::matrix_t<double> m_eta_map;
util::matrix_t<double> m_flux_maps;
util::matrix_t<double> m_sf_adjust; // array of length equal to number of time steps
double m_land_area;
double m_A_sf; //[m2]
int m_clearsky_model;
std::vector<double> mv_clearsky_data;
S_params()
{
// Integers
m_n_flux_x = m_n_flux_y = m_N_hel = m_clearsky_model = -1;
// Doubles
m_p_start = m_p_track = m_hel_stow_deploy = m_v_wind_max =
m_land_area = m_A_sf = std::numeric_limits<double>::quiet_NaN();
}
};
S_params ms_params;
struct S_outputs
{
double m_q_dot_field_inc; //[MWt] Field incident thermal power (from the sun!)
util::matrix_t<double> m_flux_map_out;
double m_pparasi; //[MWe]
double m_eta_field; //[-] field efficiency * sf_adjust. plant defocus not applied
double m_sf_adjust_out;
double m_plant_defocus_out; //[-] plant defocus input adjusted for field control events
double m_clearsky_dni; //[W/m2]
S_outputs()
{
m_q_dot_field_inc = m_pparasi =
m_eta_field = m_sf_adjust_out = m_plant_defocus_out =
m_clearsky_dni = std::numeric_limits<double>::quiet_NaN();
}
};
S_outputs ms_outputs;
void init();
void call(const C_csp_weatherreader::S_outputs &weather,
double field_control_in,
const C_csp_solver_sim_info &sim_info);
void off(const C_csp_weatherreader::S_outputs& weather,
const C_csp_solver_sim_info &sim_info);
void converged();
double get_clearsky(const C_csp_weatherreader::S_outputs& weather, double hour);
};
#endif
|
263c5bbb8562fc6433c685a74fdb785812bb9c76
|
7fca4e645f24880ab75f644f03d227aa5688749d
|
/dataStructure/Classes_cpp/stl/deque/test.cpp
|
bbb4ce1dc54de3dc4bf9e38704cbb4d6bdad304c
|
[] |
no_license
|
jcarlosadm/classes
|
95e687f8ec6e4c1f405442de86c0dffc588f0f2e
|
9658b1b0805647f64d02c4b760d81d26943ec6da
|
refs/heads/master
| 2021-05-15T02:18:30.318844
| 2018-07-24T15:29:20
| 2018-07-24T15:29:20
| 24,521,175
| 2
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 465
|
cpp
|
test.cpp
|
//http://www.cplusplus.com/reference/deque/deque/
#include <iostream>
#include <deque>
using namespace std;
int main()
{
deque<int> mydeque;
mydeque.push_front(20);
mydeque.push_front(50);
mydeque.push_back(66);
mydeque.push_front(212);
mydeque.push_back(31);
mydeque.push_back(88);
while(!mydeque.empty()){
cout<<" "<<mydeque.front();
mydeque.pop_front();
}
cout<<endl;
return 0;
}
|
1f82d2b65f554826dbea3a44ee29b3dc0024e56c
|
279d3947563bcba72f4effe293a0b0e62dfc1051
|
/More_with_servos_tutorial_33.cpp
|
d20b81f966e05de0914288ec8610666b1dc216de
|
[] |
no_license
|
SRCinVA/Arduino
|
ee0ed5470cb556372f8e7ba6afe03a416f9cd894
|
ba0650e2edb2133f5457f283ccada3e158fe29b8
|
refs/heads/main
| 2023-08-20T14:24:31.954548
| 2021-09-27T00:55:54
| 2021-09-27T00:55:54
| 318,236,680
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,138
|
cpp
|
More_with_servos_tutorial_33.cpp
|
// joysticks are far more precise controls than knobs.
#include <Servo.h> //need to import the library
Servo Xservo;
Servo Yservo;
int Xpin=A0;
int Ypin=A1;
int Spin=2; // it can also operated as an on/off switch.
int XSpin=9;
int YSpin=10;
int buzzPin=7;
int WVx;
int WVy;
int Xval; // to read off of
int Yval; // to read off of
int Sval;
int dt=200;
void setup(){
Serial.begin(9600);
pinMode(Xpin,INPUT);
pinMode(Ypin,INPUT);
pinMode(Spin,INPUT);
pinMode(XSpin,OUTPUT);
pinMode(YSpin,OUTPUT);
Xservo.attach(XSpin);
Yservo.attach(YSpin);
digitalWrite(Spin, HIGH); // to power the switch function?
}
void loop(){
Xval = analogRead(Xpin);
WVx = (180./1023.) * Xval;
Yval = analogRead(Ypin);
WVy = (180./1023.) * Yval;
Sval=digitalRead(Spin);
// now that you've calculated those values, you can give
// those instructions to the servo.
Xservo.write(WVx);
Yservo.write(WVy);
if (Sval==0){
digitalWrite(buzzPin,HIGH);
}
else {
digitalWrite(buzzPin,LOW);
}
delay(dt);
Serial.print("X Value = ");
Serial.print(Xval);
Serial.print("Y Value = ");
Serial.print(Yval);
Serial.print("Switch state is: ");
Serial.println(Sval);
}
|
c15edaa247712209259ca2ab4b3c46037e198e5c
|
b6c516bd9f3768941a657fdeeb0be098e51358d0
|
/lab_3_ManipulatingMIDI/cs302-midi.cpp
|
990c07ddad262c6e80138ba4170d8c07f6002719
|
[] |
no_license
|
bschwarz67/CS-302
|
f8156f28c8862490fbdf9909726020519a1f7791
|
625bb07359b60a6f0a8e73030f0b8cd2bcad2bf5
|
refs/heads/master
| 2023-02-26T20:48:13.883846
| 2021-02-07T19:17:39
| 2021-02-07T19:17:39
| 283,343,764
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 8,950
|
cpp
|
cs302-midi.cpp
|
#include <iostream>
#include <map>
#include <vector>
#include <fstream>
#include <list>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include "cs302-midi.h"
using namespace std;
//copy data from the event file data structure(EventList) to the Note file data structure (NDMap)
void CS302_Midi::el_to_nd()
{
vector<ND *> unmatched(128, NULL); // temporary data structure for new Note events, which stored here until we reach their end event
nd = new NDMap; //data structure we are copying to, key is the start time, values is an ND *
NDMap::iterator ndit;
EventList::iterator elit;
ND* newnd; // holds newly created ND*s that represent notes
ND* damper = NULL; //holds newly created ND*s that represent damper events
double aggtime = 0; //stores timepoint we are at in the EventList data structure as it stores realtive times and NDMap stores absolute times
//go through the EventList data struture and convert into the NDMap format and store it in the new NDMap
for(elit = el->begin(); elit != el->end(); elit++) {
if((*elit)->time != 0) aggtime += (*elit)->time; //if the event marks that a new length of time has elapsed, add that amound to the aggregate
if((*elit)->key == 'O') { //if the event is an 'ON' event, create a new ND object and store the data in it, then put it into the temporary data structure
//until we cant its correlate 'OFF' event
newnd = new ND;
newnd->key = 'N';
newnd->start = aggtime / 480; //convert that start time from event to note/damper format
newnd->pitch = (*elit)->v1;
newnd->volume = (*elit)->v2;
unmatched[newnd->pitch] = newnd;
}
else if((*elit)->key == 'F') { //if the event is an 'OFF' event, find the correlate 'ON' event in the temporary data structure,
//add the stop time to the ND object, and put the object in the NDMap with the start time as the key
//erase the created ND in the temp data structure
unmatched[(*elit)->v1]->stop = aggtime / 480;
nd->insert(pair<double, ND*>(unmatched[(*elit)->v1]->start, unmatched[(*elit)->v1]));
unmatched[(*elit)->v1] = NULL;
}
else { //if the event not neither 'ON' nor 'OFF' it is a 'DAMPER'
if((*elit)->v1 == 1) { //if it is a damper down event, create a new ND object, copy the data to it, and store it in the temp variable
damper = new ND;
damper->key = 'D';
damper->start = aggtime / 480;
}
else { //if it is a damper up event, add the stop time to the object and then put the object into the map with the start time as the key
//delete the object stored in the temp variable
damper->stop = aggtime / 480;
nd->insert(pair<double, ND*>(damper->start, damper));
damper = NULL;
}
}
}
//print to test
for(ndit = nd->begin(); ndit != nd->end(); ndit++) {
if(ndit->second->key == 'N') {
cout << "NOTE " << ndit->second->pitch << " " << ndit->second->volume << " " << ndit->second->start << " " << ndit->second->stop << endl;
}
else {
cout << "DAMPER " << ndit->second->start << " " << ndit->second->stop << endl;
}
}
}
typedef multimap<int, Event *> EBTypeMap; //stores all events that happen at the same time point from the EventList data structure
//keys: 1 == off, 2 == damper up, 3 == damper down, 4 == on
//copy data from the Note file data structure (NDMap) to the event file data structure(EventList)
void CS302_Midi::nd_to_el()
{
map <double, EBTypeMap *> ebtime; //temporary data structure for Event objects, stores multimaps of all events at each timepoint indicated in the event file
map <double, EBTypeMap *>::iterator ebtimeit;
map <double, EBTypeMap *>::iterator prev; //iterator that points to previous event multimap, used to calculate elapsed time between two time points
EBTypeMap::iterator ebtypeit;
NDMap::iterator ndit;
el = new EventList; // data strucure we ary copying to, it is a list of event objects
EventList::iterator elit;
Event *ne; //variable that will hold pointers to newly created Event objects
int et; //hold elapsed time between two time points held in ebtime, also holds numbers 1-4 that represent the type of event
//the event type controls where the object should be stored in the multimap so that its easier to put them into
//the event list in the order specified
//for every ND event in our data structure, extract the data, create a new Event object, and out the data in this object. Then put this event object
//in the temporary data structure.
for(ndit = nd->begin(); ndit != nd->end(); ndit++) {
if(rint(ndit->second->start * 480) != rint(ndit->second->stop * 480)) { //ignore Notes or dampers that have the same start and stop time
//if it is a note event, create two new Events, one for note ON and one for note OFF, copy the data to the objects,
//if there is already an index for the start time of an event, just store the event in the multimap at that index,
//else create the new index with they key as the start time.
if(ndit->second->key == 'N') {
ne = new Event;
ne->key = 'O'; //O means note on event
ne->time = ndit->second->start;
ne->v1 = ndit->second->pitch;
ne->v2 = ndit->second->volume;
et = 4;
if(ebtime.find(ndit->second->start) == ebtime.end()) {
ebtime.insert(pair<double, EBTypeMap *>(ndit->second->start, new EBTypeMap)).first->second->insert(pair<int, Event *>(et, ne));
}
else {
ebtime.find(ndit->second->start)->second->insert(pair<int, Event *>(et, ne));
}
ne = new Event;
ne->key = 'F'; //F means note off event
ne->time = ndit->second->stop;
ne->v1 = ndit->second->pitch;
et = 1;
if(ebtime.find(ndit->second->stop) == ebtime.end()) {
ebtime.insert(pair<double, EBTypeMap *>(ndit->second->stop, new EBTypeMap)).first->second->insert(pair<int, Event *>(et, ne));
}
else {
ebtime.find(ndit->second->stop)->second->insert(pair<int, Event *>(et, ne));
}
}
//if it is a damper event, create two new Events, one for damper up and one for damper down, copy the data to the objects,
//if there is already an index for the start time of an event, just store the event in the multimap at that index,
//else create the new index with they key as the start time.
else {
ne = new Event;
ne->key = 'D'; //D means damper event
ne->time = ndit->second->start;
ne->v1 = 1;
et = 3;
if(ebtime.find(ndit->second->start) == ebtime.end()) {
ebtime.insert(pair<double, EBTypeMap *>(ndit->second->start, new EBTypeMap)).first->second->insert(pair<int, Event *>(et, ne));
}
else {
ebtime.find(ndit->second->start)->second->insert(pair<int, Event *>(et, ne));
}
ne = new Event;
ne->key = 'D';
ne->time = ndit->second->stop;
ne->v1 = 0;
et = 2;
if(ebtime.find(ndit->second->stop) == ebtime.end()) {
ebtime.insert(pair<double, EBTypeMap *>(ndit->second->stop, new EBTypeMap)).first->second->insert(pair<int, Event *>(et, ne));
}
else {
ebtime.find(ndit->second->stop)->second->insert(pair<int, Event *>(et, ne));
}
}
}
}
//iterate through our temporary structure, for every time point in the structure, put the events stored in its multimap into the EventList
for(ebtimeit = ebtime.begin(); ebtimeit != ebtime.end(); ebtimeit++) {
//cout << ebtimeit->first << ": " << endl;
//if this is the first timepoint in our data structure, the time of the first event should be set to whatever time it starts at, coverted to Event file units
if(ebtimeit == ebtime.begin()) {
et = rint(ebtimeit->first * 480);
}
//else the time for the first event at the time point should be set to the difference between this and the previous timepoint
else {
et = rint(ebtimeit->first * 480) - rint(prev->first * 480);
}
//put every event from this timepoint into the EventList data structure. Only set the relative time of the first event,
//the rest of the event times are 0. as specified in the lab instructions the events in every time point should be put
//in in this order: OFF, DAMPER UP, DAMPER DOWN, ON we have already ordered the events in this way by giving them a key
//for the multimap based on their event type
for(ebtypeit = ebtimeit->second->begin(); ebtypeit != ebtimeit->second->end(); ebtypeit++) {
if(ebtypeit != ebtimeit->second->begin()) ebtypeit->second->time = 0;
else ebtypeit->second->time = et;
el->push_back(ebtypeit->second);
}
prev = ebtimeit;
}
//print to test
for(elit = el->begin(); elit != el->end(); elit++) {
if((*elit)->key == 79) {
cout << "ON " << (*elit)->time << " " << (*elit)->v1 << " " << (*elit)->v2 << endl;
}
else if((*elit)->key == 70) {
cout << "OFF " << (*elit)->time << " " << (*elit)->v1 << " " << endl;
}
else {
if((*elit)->v1 == 1) cout << "DAMPER " << (*elit)->time << " " << "DOWN" << endl;
else cout << "DAMPER " << (*elit)->time << " " << "UP" << endl;
}
}
}
|
d82f9df0a85fab54da27da5ccb87c29618c6f042
|
afd4616c3adac5d8c6e80f9e9d34bc11dfe48826
|
/ConsoleMemory/MemBlock.cpp
|
d472331517bc450f2d8bae1bc275b83f8e3708ca
|
[] |
no_license
|
sfinktah/ConsoleMemory
|
c352109190cd11f3ce5466bbc5b42a9c85253917
|
8357d1326d1df96afc62ebd5a382d10aa1c8d19d
|
refs/heads/master
| 2021-01-13T03:32:29.713772
| 2016-12-28T12:04:11
| 2016-12-28T12:04:11
| 77,529,846
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 695
|
cpp
|
MemBlock.cpp
|
#include "stdafx.h"
#include "MemBlock.h"
MemBlock::MemBlock(RMem rPtr, uintptr_t remoteAddress, size_t maxSize) : rPtr(rPtr), remoteAddress(remoteAddress), maxSize(maxSize)
{
}
MemBlock::~MemBlock()
{
}
RMem MemBlock::GetRPtr()
{
return rPtr;
}
size_t MemBlock::GetSize()
{
return dumpArray.size();
}
size_t MemBlock::GetMaxSize()
{
return maxSize;
}
uintptr_t MemBlock::GetRemoteAddress()
{
return remoteAddress;
}
std::vector<byte> & MemBlock::GetByteDump()
{
return dumpArray;
}
void MemBlock::Update()
{
LogDebug("[MemDump][Dump] Copying 0x%I64X (0x%I64X bytes)", remoteAddress, maxSize);
dumpArray = rPtr.ReadArray<byte>(remoteAddress, maxSize);
}
|
27d49ce8d73edeab6734caae5aae7d3b710422dd
|
f87c7fe84bb079238e224bbe359904ba64e4e7b4
|
/Dynamic_Programming/max_path_sum.cpp
|
2fbfab87668a0185c7a21987b1fd19a99378554f
|
[] |
no_license
|
Himanish-9502/Competative_Coding
|
6e81a3f3c5747e4b28953af0eb3dd0842b6a7b91
|
70ab7a8ca5ee2ee51f31d3e372e832a7c13960a8
|
refs/heads/master
| 2023-07-15T12:42:53.305450
| 2021-09-02T11:22:24
| 2021-09-02T11:22:24
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,861
|
cpp
|
max_path_sum.cpp
|
/*
Maximum path sum in grid
Time-Limit: 1 sec Score: 100
Difficulty :
Memory: 256 MB Accepted Submissions: 100
Relevant For:
Description
Given a grid of size n*m with non-negative integers, you need to find the maximum path sum from (1, 1) to (n, m). You are allowed to move from (x, y) to (x+1, y) and (x, y) to (x, y+1).
Input Format
The first line of the input contains one integer t - the number of test cases. Then t test cases follow.
The first line of each test case contains two space-separated integers n, m - the size of the grid.
Each of the following n lines contains m space-separated integers, aij - the number at that cell.
Output Format
For each test case, print the maximum path sum.
Constraints
1 ≤ t ≤ 105
1 ≤ n, m ≤ 103
0 ≤ aij ≤ 107
It is guaranteed that the sum of n*m over all test cases does not exceed 106.
Sample Input 1
3
2 3
3 2 1
4 1 1
3 3
1 2 1
3 5 1
4 1 1
2 2
1 2
3 4
Sample Output 1
9
11
8
Note
For the first test case, path 3 → 4 → 1 → 1 maximises the sum.
For the second test case, path 1 → 2 → 5 → 1 → 1 and 1 → 3 → 4 → 1 → 1 maximises the sum.
For the third test case, path 1 → 3 → 4 maximises the sum.
1
*/
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m;
int grid[1005][1005];
int dp[1005][1005];
void solve(){
cin>>m>>n;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>grid[i][j];
dp[i][j] = 0;
}
}
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(i && j)
{
dp[i][j] = max(dp[i-1][j],dp[i][j-1]) + grid[i][j];
}
else if(i)
{
dp[i][j] = dp[i-1][j] + grid[i][j];
}
else{
dp[i][j] = dp[i][j-1] + grid[i][j];
}
}
}
cout<<dp[m-1][n-1]<<endl;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
}
|
f2d587ab83a87f9ac842849b63b22574ec01626f
|
21efe41be7ed2079432f4a7a4bd9d4c60be64604
|
/test/libpldmresponder_platform_test.cpp
|
5ea71abb78f9f1f08c27192c2ca9d0eb3da171c7
|
[
"Apache-2.0"
] |
permissive
|
manikandan-e/pldm
|
e4c6132e65157f273a75f16a3761f4fb64e86318
|
3bdb3c2acde56079c3f8bfd5c1e7922b20c51414
|
refs/heads/master
| 2022-07-27T14:25:05.199688
| 2020-05-01T19:55:39
| 2020-05-13T08:28:02
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 12,148
|
cpp
|
libpldmresponder_platform_test.cpp
|
#include "libpldmresponder/pdr.hpp"
#include "libpldmresponder/pdr_utils.hpp"
#include "libpldmresponder/platform.hpp"
#include "libpldmresponder/platform_numeric_effecter.hpp"
#include "libpldmresponder/platform_state_effecter.hpp"
#include "mocked_utils.hpp"
#include "utils.hpp"
#include <iostream>
using namespace pldm::utils;
using namespace pldm::responder;
using namespace pldm::responder::platform;
using namespace pldm::responder::pdr;
using namespace pldm::responder::pdr_utils;
TEST(getPDR, testGoodPath)
{
std::array<uint8_t, sizeof(pldm_msg_hdr) + PLDM_GET_PDR_REQ_BYTES>
requestPayload{};
auto req = reinterpret_cast<pldm_msg*>(requestPayload.data());
size_t requestPayloadLength = requestPayload.size() - sizeof(pldm_msg_hdr);
struct pldm_get_pdr_req* request =
reinterpret_cast<struct pldm_get_pdr_req*>(req->payload);
request->request_count = 100;
auto pdrRepo = pldm_pdr_init();
Handler handler("./pdr_jsons/state_effecter/good", pdrRepo, nullptr);
Repo repo(pdrRepo);
ASSERT_EQ(repo.empty(), false);
auto response = handler.getPDR(req, requestPayloadLength);
auto responsePtr = reinterpret_cast<pldm_msg*>(response.data());
struct pldm_get_pdr_resp* resp =
reinterpret_cast<struct pldm_get_pdr_resp*>(responsePtr->payload);
ASSERT_EQ(PLDM_SUCCESS, resp->completion_code);
ASSERT_EQ(2, resp->next_record_handle);
ASSERT_EQ(true, resp->response_count != 0);
pldm_pdr_hdr* hdr = reinterpret_cast<pldm_pdr_hdr*>(resp->record_data);
ASSERT_EQ(hdr->record_handle, 1);
ASSERT_EQ(hdr->version, 1);
pldm_pdr_destroy(pdrRepo);
}
TEST(getPDR, testShortRead)
{
std::array<uint8_t, sizeof(pldm_msg_hdr) + PLDM_GET_PDR_REQ_BYTES>
requestPayload{};
auto req = reinterpret_cast<pldm_msg*>(requestPayload.data());
size_t requestPayloadLength = requestPayload.size() - sizeof(pldm_msg_hdr);
struct pldm_get_pdr_req* request =
reinterpret_cast<struct pldm_get_pdr_req*>(req->payload);
request->request_count = 1;
auto pdrRepo = pldm_pdr_init();
Handler handler("./pdr_jsons/state_effecter/good", pdrRepo, nullptr);
Repo repo(pdrRepo);
ASSERT_EQ(repo.empty(), false);
auto response = handler.getPDR(req, requestPayloadLength);
auto responsePtr = reinterpret_cast<pldm_msg*>(response.data());
struct pldm_get_pdr_resp* resp =
reinterpret_cast<struct pldm_get_pdr_resp*>(responsePtr->payload);
ASSERT_EQ(PLDM_SUCCESS, resp->completion_code);
ASSERT_EQ(1, resp->response_count);
pldm_pdr_destroy(pdrRepo);
}
TEST(getPDR, testBadRecordHandle)
{
std::array<uint8_t, sizeof(pldm_msg_hdr) + PLDM_GET_PDR_REQ_BYTES>
requestPayload{};
auto req = reinterpret_cast<pldm_msg*>(requestPayload.data());
size_t requestPayloadLength = requestPayload.size() - sizeof(pldm_msg_hdr);
struct pldm_get_pdr_req* request =
reinterpret_cast<struct pldm_get_pdr_req*>(req->payload);
request->record_handle = 100000;
request->request_count = 1;
auto pdrRepo = pldm_pdr_init();
Handler handler("./pdr_jsons/state_effecter/good", pdrRepo, nullptr);
Repo repo(pdrRepo);
ASSERT_EQ(repo.empty(), false);
auto response = handler.getPDR(req, requestPayloadLength);
auto responsePtr = reinterpret_cast<pldm_msg*>(response.data());
ASSERT_EQ(responsePtr->payload[0], PLDM_PLATFORM_INVALID_RECORD_HANDLE);
pldm_pdr_destroy(pdrRepo);
}
TEST(getPDR, testNoNextRecord)
{
std::array<uint8_t, sizeof(pldm_msg_hdr) + PLDM_GET_PDR_REQ_BYTES>
requestPayload{};
auto req = reinterpret_cast<pldm_msg*>(requestPayload.data());
size_t requestPayloadLength = requestPayload.size() - sizeof(pldm_msg_hdr);
struct pldm_get_pdr_req* request =
reinterpret_cast<struct pldm_get_pdr_req*>(req->payload);
request->record_handle = 1;
auto pdrRepo = pldm_pdr_init();
Handler handler("./pdr_jsons/state_effecter/good", pdrRepo, nullptr);
Repo repo(pdrRepo);
ASSERT_EQ(repo.empty(), false);
auto response = handler.getPDR(req, requestPayloadLength);
auto responsePtr = reinterpret_cast<pldm_msg*>(response.data());
struct pldm_get_pdr_resp* resp =
reinterpret_cast<struct pldm_get_pdr_resp*>(responsePtr->payload);
ASSERT_EQ(PLDM_SUCCESS, resp->completion_code);
ASSERT_EQ(2, resp->next_record_handle);
pldm_pdr_destroy(pdrRepo);
}
TEST(getPDR, testFindPDR)
{
std::array<uint8_t, sizeof(pldm_msg_hdr) + PLDM_GET_PDR_REQ_BYTES>
requestPayload{};
auto req = reinterpret_cast<pldm_msg*>(requestPayload.data());
size_t requestPayloadLength = requestPayload.size() - sizeof(pldm_msg_hdr);
struct pldm_get_pdr_req* request =
reinterpret_cast<struct pldm_get_pdr_req*>(req->payload);
request->request_count = 100;
auto pdrRepo = pldm_pdr_init();
Handler handler("./pdr_jsons/state_effecter/good", pdrRepo, nullptr);
Repo repo(pdrRepo);
ASSERT_EQ(repo.empty(), false);
auto response = handler.getPDR(req, requestPayloadLength);
// Let's try to find a PDR of type stateEffecter (= 11) and entity type =
// 100
bool found = false;
uint32_t handle = 0; // start asking for PDRs from recordHandle 0
while (!found)
{
request->record_handle = handle;
auto response = handler.getPDR(req, requestPayloadLength);
auto responsePtr = reinterpret_cast<pldm_msg*>(response.data());
struct pldm_get_pdr_resp* resp =
reinterpret_cast<struct pldm_get_pdr_resp*>(responsePtr->payload);
ASSERT_EQ(PLDM_SUCCESS, resp->completion_code);
handle = resp->next_record_handle; // point to the next pdr in case
// current is not what we want
pldm_pdr_hdr* hdr = reinterpret_cast<pldm_pdr_hdr*>(resp->record_data);
std::cerr << "PDR next record handle " << handle << "\n";
std::cerr << "PDR type " << hdr->type << "\n";
if (hdr->type == PLDM_STATE_EFFECTER_PDR)
{
pldm_state_effecter_pdr* pdr =
reinterpret_cast<pldm_state_effecter_pdr*>(resp->record_data);
std::cerr << "PDR entity type " << pdr->entity_type << "\n";
if (pdr->entity_type == 100)
{
found = true;
// Rest of the PDR can be accessed as need be
break;
}
}
if (!resp->next_record_handle) // no more records
{
break;
}
}
ASSERT_EQ(found, true);
pldm_pdr_destroy(pdrRepo);
}
TEST(setStateEffecterStatesHandler, testGoodRequest)
{
auto inPDRRepo = pldm_pdr_init();
auto outPDRRepo = pldm_pdr_init();
Repo outRepo(outPDRRepo);
Handler handler("./pdr_jsons/state_effecter/good", inPDRRepo, nullptr);
Repo inRepo(inPDRRepo);
getRepoByType(inRepo, outRepo, PLDM_STATE_EFFECTER_PDR);
pdr_utils::PdrEntry e;
auto record1 = pdr::getRecordByHandle(outRepo, 1, e);
ASSERT_NE(record1, nullptr);
pldm_state_effecter_pdr* pdr =
reinterpret_cast<pldm_state_effecter_pdr*>(e.data);
EXPECT_EQ(pdr->hdr.type, PLDM_STATE_EFFECTER_PDR);
std::vector<set_effecter_state_field> stateField;
stateField.push_back({PLDM_REQUEST_SET, 1});
stateField.push_back({PLDM_REQUEST_SET, 1});
std::string value = "xyz.openbmc_project.Foo.Bar.V1";
PropertyValue propertyValue = value;
MockdBusHandler handlerObj;
DBusMapping dbusMapping{"/foo/bar", "xyz.openbmc_project.Foo.Bar",
"propertyName", "string"};
EXPECT_CALL(handlerObj, setDbusProperty(dbusMapping, propertyValue))
.Times(2);
auto rc = platform_state_effecter::setStateEffecterStatesHandler<
MockdBusHandler, Handler>(handlerObj, handler, 0x1, stateField);
ASSERT_EQ(rc, 0);
pldm_pdr_destroy(inPDRRepo);
pldm_pdr_destroy(outPDRRepo);
}
TEST(setStateEffecterStatesHandler, testBadRequest)
{
auto inPDRRepo = pldm_pdr_init();
auto outPDRRepo = pldm_pdr_init();
Repo outRepo(outPDRRepo);
Handler handler("./pdr_jsons/state_effecter/good", inPDRRepo, nullptr);
Repo inRepo(inPDRRepo);
getRepoByType(inRepo, outRepo, PLDM_STATE_EFFECTER_PDR);
pdr_utils::PdrEntry e;
auto record1 = pdr::getRecordByHandle(outRepo, 1, e);
ASSERT_NE(record1, nullptr);
pldm_state_effecter_pdr* pdr =
reinterpret_cast<pldm_state_effecter_pdr*>(e.data);
EXPECT_EQ(pdr->hdr.type, PLDM_STATE_EFFECTER_PDR);
std::vector<set_effecter_state_field> stateField;
stateField.push_back({PLDM_REQUEST_SET, 3});
stateField.push_back({PLDM_REQUEST_SET, 4});
MockdBusHandler handlerObj;
auto rc = platform_state_effecter::setStateEffecterStatesHandler<
MockdBusHandler, Handler>(handlerObj, handler, 0x1, stateField);
ASSERT_EQ(rc, PLDM_PLATFORM_SET_EFFECTER_UNSUPPORTED_SENSORSTATE);
rc = platform_state_effecter::setStateEffecterStatesHandler<MockdBusHandler,
Handler>(
handlerObj, handler, 0x9, stateField);
ASSERT_EQ(rc, PLDM_PLATFORM_INVALID_EFFECTER_ID);
stateField.push_back({PLDM_REQUEST_SET, 4});
rc = platform_state_effecter::setStateEffecterStatesHandler<MockdBusHandler,
Handler>(
handlerObj, handler, 0x1, stateField);
ASSERT_EQ(rc, PLDM_ERROR_INVALID_DATA);
pldm_pdr_destroy(inPDRRepo);
pldm_pdr_destroy(outPDRRepo);
}
TEST(setNumericEffecterValueHandler, testGoodRequest)
{
auto inPDRRepo = pldm_pdr_init();
auto numericEffecterPdrRepo = pldm_pdr_init();
Repo numericEffecterPDRs(numericEffecterPdrRepo);
Handler handler("./pdr_jsons/state_effecter/good", inPDRRepo, nullptr);
Repo inRepo(inPDRRepo);
getRepoByType(inRepo, numericEffecterPDRs, PLDM_NUMERIC_EFFECTER_PDR);
pdr_utils::PdrEntry e;
auto record3 = pdr::getRecordByHandle(numericEffecterPDRs, 3, e);
ASSERT_NE(record3, nullptr);
pldm_numeric_effecter_value_pdr* pdr =
reinterpret_cast<pldm_numeric_effecter_value_pdr*>(e.data);
EXPECT_EQ(pdr->hdr.type, PLDM_NUMERIC_EFFECTER_PDR);
uint16_t effecterId = 3;
uint32_t effecterValue = 2100000000; // 2036-07-18 21:20:00
PropertyValue propertyValue = static_cast<uint32_t>(effecterValue);
MockdBusHandler handlerObj;
DBusMapping dbusMapping{"/foo/bar", "xyz.openbmc_project.Foo.Bar",
"propertyName", "uint64_t"};
EXPECT_CALL(handlerObj, setDbusProperty(dbusMapping, propertyValue))
.Times(1);
auto rc = platform_numeric_effecter::setNumericEffecterValueHandler<
MockdBusHandler, Handler>(
handlerObj, handler, effecterId, PLDM_EFFECTER_DATA_SIZE_UINT32,
reinterpret_cast<uint8_t*>(&effecterValue), 4);
ASSERT_EQ(rc, 0);
pldm_pdr_destroy(inPDRRepo);
pldm_pdr_destroy(numericEffecterPdrRepo);
}
TEST(setNumericEffecterValueHandler, testBadRequest)
{
auto inPDRRepo = pldm_pdr_init();
auto numericEffecterPdrRepo = pldm_pdr_init();
Repo numericEffecterPDRs(numericEffecterPdrRepo);
Handler handler("./pdr_jsons/state_effecter/good", inPDRRepo, nullptr);
Repo inRepo(inPDRRepo);
getRepoByType(inRepo, numericEffecterPDRs, PLDM_NUMERIC_EFFECTER_PDR);
pdr_utils::PdrEntry e;
auto record3 = pdr::getRecordByHandle(numericEffecterPDRs, 3, e);
ASSERT_NE(record3, nullptr);
pldm_numeric_effecter_value_pdr* pdr =
reinterpret_cast<pldm_numeric_effecter_value_pdr*>(e.data);
EXPECT_EQ(pdr->hdr.type, PLDM_NUMERIC_EFFECTER_PDR);
uint16_t effecterId = 3;
uint64_t effecterValue = 9876543210;
MockdBusHandler handlerObj;
auto rc = platform_numeric_effecter::setNumericEffecterValueHandler<
MockdBusHandler, Handler>(
handlerObj, handler, effecterId, PLDM_EFFECTER_DATA_SIZE_SINT32,
reinterpret_cast<uint8_t*>(&effecterValue), 3);
ASSERT_EQ(rc, PLDM_ERROR_INVALID_DATA);
pldm_pdr_destroy(inPDRRepo);
pldm_pdr_destroy(numericEffecterPdrRepo);
}
|
cb44fa3104da3ffbea7ecc62237bcca8c27c5fc8
|
47cec727aa95560ac54184fccab50d1a6c727083
|
/ReEngine/src/Runtime/RenderDevice/OpenGL/ThirdPart/OpenGLContext.h
|
bef9df2c70f2e920770f7dcd3cad6007e130d265
|
[] |
no_license
|
kingdomheartstao/Renderer-Learning
|
303cd8f054178dfdc629d81f3569c7fcb2b1eb1d
|
b35f963414a4dabf6d2fd9ab7dee278ecf38284a
|
refs/heads/master
| 2023-07-28T01:07:32.919132
| 2021-09-10T09:24:46
| 2021-09-10T09:24:46
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 156
|
h
|
OpenGLContext.h
|
#pragma once
#include <string>
#include "Singleton.h"
#include "ReOpenGL_API.h"
class ReOpenGL_API OpenGLContext
{
public:
static const char* Version;
};
|
2f1c7d7fa272afaa6841460a3fd7718a593bc2b2
|
8693fef04e4ac2d9a893110f3c426b5001cc48e5
|
/src/campaign/tunnels.cc
|
f79da81f2841375d39b100ac23784e1fb44cc228
|
[] |
no_license
|
quarian/revenge-moon-storm
|
9290b22fa92aafdcf76a34d191228f00ed49fa14
|
31a48f0f9fcbd2aa785409285a36b76ee180ca50
|
refs/heads/master
| 2016-09-06T11:44:17.378229
| 2014-02-27T13:08:29
| 2014-02-27T13:08:29
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,306
|
cc
|
tunnels.cc
|
#include "CampaignGame.hh"
#include "CampaignGameWorld.hh"
#include "StoryScreen.hh"
#include "Fixtures.hh"
#include <string>
#include <vector>
void CampaignGame::showStoryTunnels() {
std::vector<std::string> msg = {
"Despair sets in as you descend the mine shaft. Up until now you've been",
"able to tell yourself that everything will be fine once you reach the",
"emergency zone, that once you're at the ladder, you'd hear the familiar,",
"reassuring voices of your crewmates...",
"",
"Not Rudyard, whose body you saw in the dining hall...",
"Nor Alice, whose empty stare you will never be able to forget...",
"But Marcus, Albert, Linda, and the others... someone has to be alive...",
"",
"But all you hear is more skittering. And something else... Explosions,",
"in the distance..."
};
spawn(new StoryScreen(this, msg));
}
void CampaignGame::launchLevelTunnels() {
map_.loadFromFile("./maps/campaign/tunnels.map", game_.terrainManager_);
// Essential elements
map_.spawnPlayer(player_, 6, 36, false);
new Fixtures::LevelExit(map_, map_.getBlock(62, 1), flagVictorious_, {player_}, "hole_to_light.png");
spawn(new CampaignGameWorld(this, map_, player_, flagVictorious_));
}
|
ec71c6c9d72bb671d9cdabbf193334c6bb08664e
|
0d77bec309e4f36428d573045d4bec9df5b7f092
|
/REO-1 Semana/q13.cpp
|
1be98636f17b192e903d18329efce68887c3d92b
|
[] |
no_license
|
JoseVictorAmorim/IAlg2020-1
|
18c3e13e9bbfb8260a354799dc1d7bdc7cea87ef
|
a7efce1199ae4f1349679cc7904c6d974922406b
|
refs/heads/main
| 2023-03-08T12:31:56.922424
| 2021-02-19T11:33:05
| 2021-02-19T11:33:05
| 315,319,681
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 452
|
cpp
|
q13.cpp
|
#include <iostream>
using namespace std;
int antecessor(int num1){
num1--;
return num1;
}
int sucessor(int num2){
num2++;
return num2;
}
int soma(int a, int b){
if(a==0)
return b;
else if(b == 0)
return a;
else{
return(soma(antecessor(a), sucessor(b)));
}
}
int main(){
int x, y;
cin >> x >> y;
int maior, menor;
if(x>y){
maior = x;
menor = y;
}
else{
maior = y;
menor = x;
}
cout << soma(maior, menor);
return 0;
}
|
4605d32837f75b5fbf95c674643171999a904727
|
08419b67ac9ff6ba132eb283c19d5f0c8d85a242
|
/Shared/AddLocalDataController.cpp
|
b1c50b1b27158e9900e3e5e723ac9460a6b57327
|
[
"Apache-2.0"
] |
permissive
|
Esri/dynamic-situational-awareness-qt
|
6bcdcf9a91a64e16d400fe150cbc66ce13cc4d28
|
703511764217a9144fd581326cfad99f8d70d82f
|
refs/heads/main
| 2023-04-30T04:17:13.770667
| 2022-12-19T14:51:00
| 2022-12-19T14:51:00
| 100,742,320
| 46
| 20
|
Apache-2.0
| 2022-12-21T22:10:56
| 2017-08-18T19:04:25
|
C++
|
UTF-8
|
C++
| false
| false
| 31,689
|
cpp
|
AddLocalDataController.cpp
|
/*******************************************************************************
* Copyright 2012-2018 Esri
*
* 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.
******************************************************************************/
// PCH header
#include "pch.hpp"
#include "AddLocalDataController.h"
// dsa app headers
#include "DataItemListModel.h"
#include "DsaUtility.h"
#include "MarkupLayer.h"
// toolkit headers
#include "ToolManager.h"
#include "ToolResourceProvider.h"
// C++ API headers
#include "ArcGISSceneLayer.h"
#include "ArcGISTiledElevationSource.h"
#include "ArcGISTiledLayer.h"
#include "ArcGISVectorTiledLayer.h"
#include "ElevationSource.h"
#include "FeatureCollection.h"
#include "FeatureCollectionLayer.h"
#include "FeatureCollectionTable.h"
#include "FeatureLayer.h"
#include "GeoPackage.h"
#include "GeoPackageFeatureTable.h"
#include "GeoPackageRaster.h"
#include "Geodatabase.h"
#include "GeodatabaseFeatureTable.h"
#include "KmlDataset.h"
#include "KmlLayer.h"
#include "LayerListModel.h"
#include "Raster.h"
#include "RasterElevationSource.h"
#include "RasterLayer.h"
#include "Scene.h"
#include "ShapefileFeatureTable.h"
#include "TileCache.h"
// Qt headers
#include <QDir>
#include <QFile>
#include <QFileInfo>
#include <QJsonDocument>
#include <QJsonObject>
#include <QTextStream>
using namespace Esri::ArcGISRuntime;
namespace Dsa
{
const QString AddLocalDataController::LOCAL_DATAPATHS_PROPERTYNAME = "LocalDataPaths";
const QString AddLocalDataController::DEFAULT_ELEVATION_PROPERTYNAME = "DefaultElevationSource";
const QString AddLocalDataController::s_allData = QStringLiteral("All Data (*.geodatabase *.tpk *.shp *.gpkg *.slpk *.img *.tif *.tiff *.i1, *.dt0 *.dt1 *.dt2 *.tc2 *.geotiff *.hr1 *.jpg *.jpeg *.jp2 *.ntf *.png *.i21 *.ovr *.markup *.sid *.kml *.kmz)");
const QString AddLocalDataController::s_rasterData = QStringLiteral("Raster Files (*.img *.tif *.tiff *.I1, *.dt0 *.dt1 *.dt2 *.tc2 *.geotiff *.hr1 *.jpg *.jpeg *.jp2 *.ntf *.png *.i21 *.ovr *.sid)");
const QString AddLocalDataController::s_geodatabaseData = QStringLiteral("Geodatabase (*.geodatabase)");
const QString AddLocalDataController::s_shapefileData = QStringLiteral("Shapefile (*.shp)");
const QString AddLocalDataController::s_geopackageData = QStringLiteral("GeoPackage (*.gpkg)");
const QString AddLocalDataController::s_sceneLayerData = QStringLiteral("Scene Layer Package (*.slpk)");
const QString AddLocalDataController::s_vectorTilePackageData = QStringLiteral("Vector Tile Package (*.vtpk)");
const QString AddLocalDataController::s_tilePackageData = QStringLiteral("Tile Package (*.tpk)");
const QString AddLocalDataController::s_markupData = QStringLiteral("Markup (*.markup)");
const QString AddLocalDataController::s_kmlData = QStringLiteral("KML (*.kml *.kmz)");
/*!
\class Dsa::AddLocalDataController
\inmodule Dsa
\inherits Dsa::AbstractTool
\brief Tool controller for adding local data to the app.
*/
/*!
\brief Constructor that takes an optional \a parent.
*/
AddLocalDataController::AddLocalDataController(QObject* parent /* = nullptr */):
AbstractTool(parent),
m_localDataModel(new DataItemListModel(this))
{
// add the base path to the string list
addPathToDirectoryList(DsaUtility::dataPath());
// create file filter list
m_fileFilterList = QStringList{allData(), rasterData(), geodatabaseData(),
sceneLayerData(), tilePackageData(), shapefileData(), geopackageData(),
markupData(), kmlData()
/*, vectorTilePackageData()*/}; // VTPK is not supported in 3D
emit fileFilterListChanged();
emit localDataModelChanged();
ToolManager::instance().addTool(this);
}
/*!
\property AddLocalDataController::localDataModel
\brief Returns the local data model associated with the controller.
*/
QAbstractListModel* AddLocalDataController::localDataModel() const
{
return m_localDataModel;
}
/*!
\brief Adds the provided \a path to the directory list.
The directory list contains all of the directories that will be searched for local data.
*/
void AddLocalDataController::addPathToDirectoryList(const QString& path)
{
if (m_dataPaths.contains(path))
return;
if (!QFileInfo::exists(path))
{
emit toolErrorOccurred(QStringLiteral("Failed to add local data path"), QString("Could not find %1").arg(path));
return;
}
m_dataPaths << path;
emit propertyChanged(LOCAL_DATAPATHS_PROPERTYNAME, m_dataPaths);
}
/*!
\brief Refreshes the local data model with a given \a fileType.
*/
void AddLocalDataController::refreshLocalDataModel(const QString& fileType)
{
QStringList fileFilters = determineFileFilters(fileType);
m_localDataModel->clear();
for (const QString& path : m_dataPaths)
{
QDir localDir(path);
if (fileFilters.length() > 0)
localDir.setNameFilters(fileFilters);
for (const QString& file : localDir.entryList(QDir::Files, QDir::Name))
{
QFileInfo fileInfo(localDir, file);
m_localDataModel->addDataItem(fileInfo.absoluteFilePath());
}
}
}
/*!
\property AddLocalDataController::fileFilterList
\brief Returns the file filter string list for filtering data from the QDir entrylist
*/
QStringList AddLocalDataController::determineFileFilters(const QString& fileType)
{
QStringList fileFilter;
QStringList rasterExtensions{"*.img", "*.tif", "*.tiff", "*.i1", "*.dt0", "*.dt1", "*.dt2", "*.tc2", "*.geotiff", "*.hr1", "*.jpg", "*.jpeg", "*.jp2", "*.ntf", "*.png", "*.i21", "*.sid"};
if (fileType == geodatabaseData())
fileFilter << "*.geodatabase";
else if (fileType == tilePackageData())
fileFilter << "*.tpk";
else if (fileType == shapefileData())
fileFilter << "*.shp";
else if (fileType == geopackageData())
fileFilter << "*.gpkg";
else if (fileType == sceneLayerData())
fileFilter << "*.slpk";
else if (fileType == vectorTilePackageData())
fileFilter << "*.vtpk";
else if (fileType == markupData())
fileFilter << "*.markup";
else if (fileType == kmlData())
fileFilter << "*.kml" << "*.kmz";
else if (fileType == rasterData())
fileFilter = rasterExtensions;
else
{
fileFilter = rasterExtensions;
fileFilter << "*.geodatabase" << "*.tpk" << "*.shp" << "*.gpkg" << "*.slpk" << "*.markup" << "*.kml" << "*.kmz"/* << "*.vtpk"*/; // VTPK is not supported in 3D
}
return fileFilter;
}
/*!
\brief Adds the provided \a indices from the list model as elevation sources to the Scene.
*/
void AddLocalDataController::addItemAsElevationSource(const QList<int>& indices)
{
QStringList dataPaths;
for (const int index : indices)
{
const DataType dataItemType = m_localDataModel->getDataItemType(index);
const QString dataItemPath = m_localDataModel->getDataItemPath(index);
if (dataItemType == DataType::TilePackage)
{
createElevationSourceFromTpk(dataItemPath);
}
else if (dataItemType == DataType::Raster)
{
// add the path to a string list
dataPaths << dataItemPath;
}
else
continue;
}
if (dataPaths.isEmpty())
return;
createElevationSourceFromRasters(dataPaths);
emit propertyChanged(DEFAULT_ELEVATION_PROPERTYNAME, dataPaths);
}
/*!
\brief Adds the provided TPK \a path as an elevation source.
*/
void AddLocalDataController::createElevationSourceFromTpk(const QString& path)
{
TileCache* tileCache = new TileCache(path, this);
connect(tileCache, &TileCache::doneLoading, this, [this, tileCache](Error error)
{
if (!error.isEmpty())
return;
// Check if the tiles are LERC encoded
if (tileCache->tileInfo().format() == TileImageFormat::LERC)
{
// create the source from the tiled source
ArcGISTiledElevationSource* source = new ArcGISTiledElevationSource(tileCache, this);
connect(source, &ArcGISTiledElevationSource::errorOccurred, this, &AddLocalDataController::errorOccurred);
auto scene = ToolResourceProvider::instance()->scene();
if (scene)
scene->baseSurface()->elevationSources()->append(source);
emit elevationSourceSelected(source);
emit propertyChanged(DEFAULT_ELEVATION_PROPERTYNAME, tileCache->path());
}
});
tileCache->load();
}
/*!
\brief Adds the provided Raster \a paths as an elevation source.
*/
void AddLocalDataController::createElevationSourceFromRasters(const QStringList& paths)
{
RasterElevationSource* source = new RasterElevationSource(paths, this);
connect(source, &RasterElevationSource::errorOccurred, this, &AddLocalDataController::errorOccurred);
auto scene = ToolResourceProvider::instance()->scene();
if (scene)
scene->baseSurface()->elevationSources()->append(source);
emit elevationSourceSelected(source);
}
/*!
\brief Adds the the markup from the provided path as a MarkupLayer.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createMarkupLayer(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
MarkupLayer* markupLayer = MarkupLayer::createFromPath(path, this);
if (!markupLayer)
return;
markupLayer->setVisible(visible);
connect(markupLayer, &MarkupLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
operationalLayers->append(markupLayer);
}
else
emit layerCreated(layerIndex, markupLayer);
}
/*!
\brief Adds the provided \a indices from the list model as layers.
*/
void AddLocalDataController::addItemAsLayer(const QList<int>& indices)
{
for (const int index : indices)
{
DataType dataItemType = m_localDataModel->getDataItemType(index);
QString dataItemPath = m_localDataModel->getDataItemPath(index);
switch (dataItemType) {
case DataType::Geodatabase:
createFeatureLayerGeodatabase(dataItemPath);
break;
case DataType::GeoPackage:
createLayerGeoPackage(dataItemPath);
break;
case DataType::Raster:
createRasterLayer(dataItemPath);
break;
case DataType::SceneLayerPackage:
createSceneLayer(dataItemPath);
break;
case DataType::Shapefile:
createFeatureLayerShapefile(dataItemPath);
break;
case DataType::TilePackage:
createTiledLayer(dataItemPath);
break;
case DataType::VectorTilePackage:
createVectorTiledLayer(dataItemPath);
break;
case DataType::Markup:
createMarkupLayer(dataItemPath);
break;
case DataType::Kml:
createKmlLayer(dataItemPath);
break;
default:
break;
}
}
}
/*!
\brief Determines data type from the given \a path, and calls the appropriate helper.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::addLayerFromPath(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
QFileInfo fileInfo(path);
if (!fileInfo.exists())
{
emit toolErrorOccurred(QString("Failed to add %1").arg(fileInfo.fileName()), QString("File not found %1").arg(path));
return;
}
QStringList rasterExtensions{"img", "tif", "tiff", "i1", "dt0", "dt1", "dt2", "tc2", "geotiff", "hr1", "jpg", "jpeg", "jp2", "ntf", "png", "i21", "sid"};
// determine the layer type
QString fileExtension = fileInfo.completeSuffix();
if (fileExtension == "geodatabase")
createFeatureLayerGeodatabaseWithId(path, layerIndex, visible, autoAdd);
else if (fileExtension.compare("tpk", Qt::CaseInsensitive) == 0)
createTiledLayer(path, layerIndex, visible, autoAdd);
else if (fileExtension.compare("shp", Qt::CaseInsensitive) == 0)
createFeatureLayerShapefile(path, layerIndex, visible, autoAdd);
else if (fileExtension.compare("gpkg", Qt::CaseInsensitive) == 0)
createLayerGeoPackage(path);
else if (fileExtension.compare("slpk", Qt::CaseInsensitive) == 0)
createSceneLayer(path, layerIndex, visible, autoAdd);
else if (fileExtension.compare("vtpk", Qt::CaseInsensitive) == 0)
createVectorTiledLayer(path, layerIndex, visible, autoAdd);
else if (fileExtension.compare("markup", Qt::CaseInsensitive) == 0)
createMarkupLayer(path, layerIndex, visible, autoAdd);
else if ((fileExtension.compare("kml", Qt::CaseInsensitive) == 0) || (fileExtension.compare("kmz", Qt::CaseInsensitive) == 0))
createKmlLayer(path, layerIndex, visible, autoAdd);
else if (rasterExtensions.contains(fileExtension.toLower()))
createRasterLayer(path, layerIndex, visible, autoAdd);
}
/*!
\brief Creates a Geodatabase from the given \a path, and creates a FeatureLayer for each table in the Geodatabase.
*/
void AddLocalDataController::createFeatureLayerGeodatabase(const QString& path)
{
Geodatabase* gdb = new Geodatabase(path, this);
connect(gdb, &Geodatabase::doneLoading, this, [this, gdb](Error e)
{
if (!e.isEmpty())
{
emit errorOccurred(e);
return;
}
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
for (FeatureTable* featureTable : gdb->geodatabaseFeatureTables())
{
FeatureLayer* featureLayer = new FeatureLayer(featureTable, this);
connect(featureLayer, &FeatureLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
connect(featureLayer, &FeatureLayer::doneLoading, this, [featureLayer](Error loadError)
{
if (!loadError.isEmpty())
return;
if (featureLayer->featureTable()->hasZ() && featureLayer->featureTable()->geometryType() == GeometryType::Point)
featureLayer->setSceneProperties(LayerSceneProperties(SurfacePlacement::Absolute));
});
if (operationalLayers)
operationalLayers->append(featureLayer);
emit layerSelected(featureLayer);
}
});
gdb->load();
}
/*!
\brief Creates a FeatureLayer with the feature table at the given id of a Geodatabase
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a serviceLayerId - The service layer ID of the GeodatabaseFeatureTable.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createFeatureLayerGeodatabaseWithId(const QString& path, int layerIndex, int serviceLayerId, bool visible, bool autoAdd)
{
Geodatabase* gdb = new Geodatabase(path, this);
connect(gdb, &Geodatabase::doneLoading, this, [this, gdb, serviceLayerId, visible, autoAdd, layerIndex](Error e)
{
if (!e.isEmpty())
{
emit errorOccurred(e);
return;
}
FeatureLayer* featureLayer = new FeatureLayer(gdb->geodatabaseFeatureTable(serviceLayerId), this);
featureLayer->setVisible(visible);
connect(featureLayer, &FeatureLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
connect(featureLayer, &FeatureLayer::doneLoading, this, [featureLayer](Error loadError)
{
if (!loadError.isEmpty())
return;
if (featureLayer->featureTable()->hasZ() && featureLayer->featureTable()->geometryType() == GeometryType::Point)
featureLayer->setSceneProperties(LayerSceneProperties(SurfacePlacement::Absolute));
});
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(featureLayer);
emit layerSelected(featureLayer);
}
else
{
emit layerCreated(layerIndex, featureLayer);
}
});
gdb->load();
}
/*!
\brief Creates a FeatureLayer with the feature table at the given index of a GeoPackage
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a id - The index of the feature table in the GeoPackage feature table list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createFeatureLayerGeoPackage(const QString& path, int layerIndex, int id, bool visible, bool autoAdd)
{
GeoPackage* geoPackage = new GeoPackage(path, this);
connect(geoPackage, &GeoPackage::doneLoading, this, [this, geoPackage, id, visible, autoAdd, layerIndex](Error e)
{
if (!e.isEmpty())
{
emit errorOccurred(e);
return;
}
FeatureLayer* featureLayer = new FeatureLayer(geoPackage->geoPackageFeatureTables().at(id), this);
featureLayer->setVisible(visible);
connect(featureLayer, &FeatureLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
connect(featureLayer, &FeatureLayer::doneLoading, this, [featureLayer](Error loadError)
{
if (!loadError.isEmpty())
return;
if (featureLayer->featureTable()->hasZ() && featureLayer->featureTable()->geometryType() == GeometryType::Point)
featureLayer->setSceneProperties(LayerSceneProperties(SurfacePlacement::Absolute));
});
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
operationalLayers->append(featureLayer);
emit layerSelected(featureLayer);
}
else
{
emit layerCreated(layerIndex, featureLayer);
}
});
geoPackage->load();
}
/*!
\brief Creates a RasterLayer with the raster at the given index of a GeoPackage
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a id - The index of the raster in the GeoPackage raster list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createRasterLayerGeoPackage(const QString& path, int layerIndex, int id, bool visible, bool autoAdd)
{
GeoPackage* geoPackage = new GeoPackage(path, this);
connect(geoPackage, &GeoPackage::doneLoading, this, [this, geoPackage, id, visible, autoAdd, layerIndex](Error e)
{
if (!e.isEmpty())
{
emit errorOccurred(e);
return;
}
RasterLayer* rasterLayer = new RasterLayer(geoPackage->geoPackageRasters().at(id), this);
connect(rasterLayer, &RasterLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
rasterLayer->setVisible(visible);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (!operationalLayers)
return;
operationalLayers->append(rasterLayer);
emit layerSelected(rasterLayer);
}
else
{
emit layerCreated(layerIndex, rasterLayer);
}
});
geoPackage->load();
}
/*!
\brief Creates a GeoPackage from the given \a path, and adds a Layer for each table and raster in the GeoPackage
*/
void AddLocalDataController::createLayerGeoPackage(const QString& path)
{
GeoPackage* geoPackage = new GeoPackage(path, this);
connect(geoPackage, &GeoPackage::doneLoading, this, [this, geoPackage](Error e)
{
if (!e.isEmpty())
{
emit errorOccurred(e);
return;
}
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
for (const auto& table : geoPackage->geoPackageFeatureTables())
{
FeatureLayer* featureLayer = new FeatureLayer(table, this);
connect(featureLayer, &FeatureLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
connect(featureLayer, &FeatureLayer::doneLoading, this, [featureLayer](Error loadError)
{
if (!loadError.isEmpty())
return;
if (featureLayer->featureTable()->hasZ() && featureLayer->featureTable()->geometryType() == GeometryType::Point)
featureLayer->setSceneProperties(LayerSceneProperties(SurfacePlacement::Absolute));
});
if (operationalLayers)
operationalLayers->append(featureLayer);
emit layerSelected(featureLayer);
}
for (const auto& raster : geoPackage->geoPackageRasters())
{
RasterLayer* rasterLayer = new RasterLayer(raster, this);
connect(rasterLayer, &RasterLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (operationalLayers)
operationalLayers->append(rasterLayer);
emit layerSelected(rasterLayer);
}
});
geoPackage->load();
}
/*!
\brief Creates a FeatureLayer with the provided shapefile path.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createFeatureLayerShapefile(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
ShapefileFeatureTable* shpFt = new ShapefileFeatureTable(path, this);
FeatureLayer* featureLayer = new FeatureLayer(shpFt, this);
featureLayer->setVisible(visible);
connect(featureLayer, &FeatureLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
connect(featureLayer, &FeatureLayer::doneLoading, this, [featureLayer](Error loadError)
{
if (!loadError.isEmpty())
return;
if (featureLayer->featureTable()->hasZ() && featureLayer->featureTable()->geometryType() == GeometryType::Point)
{
featureLayer->setSceneProperties(LayerSceneProperties(SurfacePlacement::Absolute));
}
});
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(featureLayer);
emit layerSelected(featureLayer);
}
else
{
emit layerCreated(layerIndex, featureLayer);
}
}
/*!
\brief Creates a Rasterlayer with the provided raster path.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createRasterLayer(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
Raster* raster = new Raster(path, this);
RasterLayer* rasterLayer = new RasterLayer(raster, this);
rasterLayer->setVisible(visible);
connect(rasterLayer, &RasterLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(rasterLayer);
emit layerSelected(rasterLayer);
}
else
{
emit layerCreated(layerIndex, rasterLayer);
}
}
/*!
\brief Creates an ArcGISSceneLayer with the provided scene layer package path.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createSceneLayer(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
ArcGISSceneLayer* sceneLayer = new ArcGISSceneLayer(QUrl::fromLocalFile(path), this);
sceneLayer->setVisible(visible);
connect(sceneLayer, &ArcGISSceneLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(sceneLayer);
emit layerSelected(sceneLayer);
}
else
{
emit layerCreated(layerIndex, sceneLayer);
}
}
/*!
\brief Creates an ArcGISTiledLayer with the provided TPK path.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/
void AddLocalDataController::createTiledLayer(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
TileCache* tileCache = new TileCache(path, this);
ArcGISTiledLayer* tiledLayer = new ArcGISTiledLayer(tileCache, this);
tiledLayer->setVisible(visible);
connect(tiledLayer, &ArcGISTiledLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(tiledLayer);
emit layerSelected(tiledLayer);
}
else
{
emit layerCreated(layerIndex, tiledLayer);
}
}
/*!
\brief Creates an ArcGISVectorTiledLayer with the provided VTPK path.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/void AddLocalDataController::createVectorTiledLayer(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
VectorTileCache* tileCache = new VectorTileCache(path, this);
connect(tileCache, &VectorTileCache::errorOccurred, this, &AddLocalDataController::errorOccurred);
ArcGISVectorTiledLayer* vectorTiledLayer = new ArcGISVectorTiledLayer(tileCache, this);
vectorTiledLayer->setVisible(visible);
connect(vectorTiledLayer, &ArcGISVectorTiledLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(vectorTiledLayer);
emit layerSelected(vectorTiledLayer);
}
else
{
emit layerCreated(layerIndex, vectorTiledLayer);
}
}
/*!
\brief Creates a KmlLayer with the provided KML path.
\list
\li \a path - The path to the local data source.
\li \a layerIndex - The index for which the layer will be added to the operational layer list.
\li \a visible - Whether the layer should be visible by default.
\li \a autoAdd - Whether the layer will be automatically added to the operational layer list.
If \c false, it will not add automatically. Instead, a signal will emit once the Layer has
been constructed.
\endlist
*/void AddLocalDataController::createKmlLayer(const QString& path, int layerIndex, bool visible, bool autoAdd)
{
KmlDataset* kmlDataset = new KmlDataset(QUrl::fromLocalFile(path), this);
connect(kmlDataset, &KmlDataset::errorOccurred, this, &AddLocalDataController::errorOccurred);
KmlLayer* kmlLayer = new KmlLayer(kmlDataset, this);
kmlLayer->setVisible(visible);
connect(kmlLayer, &KmlLayer::errorOccurred, this, &AddLocalDataController::errorOccurred);
if (autoAdd)
{
auto operationalLayers = ToolResourceProvider::instance()->operationalLayers();
if (operationalLayers)
operationalLayers->append(kmlLayer);
emit layerSelected(kmlLayer);
}
else
{
emit layerCreated(layerIndex, kmlLayer);
}
}
/*!
\brief Returns the tool's name.
*/
QString AddLocalDataController::toolName() const
{
return QStringLiteral("add local data");
}
/*
\brief Sets \a properties, such as the directories to search for local data.
*/
void AddLocalDataController::setProperties(const QVariantMap& properties)
{
const QStringList filePaths = properties[LOCAL_DATAPATHS_PROPERTYNAME].toStringList();
if (filePaths.empty())
return;
bool anyNewPaths = false;
for (const QString& path : filePaths)
{
if (m_dataPaths.contains(path))
continue;
anyNewPaths = true;
break;
}
if (!anyNewPaths)
return;
for (const QString& filePath : filePaths)
addPathToDirectoryList(filePath);
refreshLocalDataModel();
}
} // Dsa
// Signal Documentation
/*!
\fn void AddLocalDataController::localDataModelChanged();
\brief Signal emitted when the LocalDataModel associated with this class changes.
*/
/*!
\fn void AddLocalDataController::layerSelected(Esri::ArcGISRuntime::Layer* layer);
\brief Signal emitted when a \a layer is selected.
*/
/*!
\fn void AddLocalDataController::elevationSourceSelected(Esri::ArcGISRuntime::ElevationSource* source);
\brief Signal emitted when an elevation \a source is selected.
*/
/*!
\fn void AddLocalDataController::layerCreated(int i, Esri::ArcGISRuntime::Layer* layer);
\brief Signal emitted when a \a layer is created.
The index of the layer in the operational layer list is passed through as \a i.
*/
/*!
\fn void AddLocalDataController::toolErrorOccurred(const QString& errorMessage, const QString& additionalMessage);
\brief Signal emitted when an error occurs.
An \a errorMessage and \a additionalMessage are passed through as parameters, describing
the error that occurred.
*/
|
eb7adf8da0c5e6deb47a43067ff1171c7ab41d14
|
f12c1ea10008863a801773857c1425e4dbb4f685
|
/public/include/macrosdef.h
|
8813787b4edbd6befe7a405b085d71305bbc8dae
|
[] |
no_license
|
alterhz/WalkingGridGame
|
c09caa4b50fc8401155192da4bbbee36dfd82a60
|
fb56f65184ee174119aeeb433aadaa0edb3cc1f5
|
refs/heads/master
| 2021-05-30T04:27:05.900721
| 2015-10-30T12:44:22
| 2015-10-30T12:44:22
| 38,820,181
| 1
| 0
| null | null | null | null |
GB18030
|
C++
| false
| false
| 1,663
|
h
|
macrosdef.h
|
//-------------------------------------------
// author : alterhz
// date : 9/9/2015
// description :
#ifndef _MACROSDEF_H_
#define _MACROSDEF_H_
#include <map>
#include <vector>
#include <list>
#include "mymath.h"
#define SAFE_DELETE(p) { delete p; p = nullptr; }
typedef std::vector<int> VtInt;
typedef std::map<int, int> MapInt;
typedef std::list<int> ListInt;
enum EGroundType
{
EGroundType_None = 0,
EGroundType_Land = 1, //土地
EGroundType_Sand = 2, //沙地
EGroundType_River = 3, //河流
EGroundType_Lawn = 4, //草地
EGroundType_Snow = 5, //雪地
};
enum EToWard
{
EToWard_None = 0, //不通
EToWard_X , //X方向通畅
EToWard_Y, //Y方向通畅
EToWard_Both, //双向通畅
};
enum GObjectType
{
GObjectType_Base = 0, //基础对象
GObjectType_Still,
GObjectType_Walkable,
};
struct COOR2
{
COOR2()
: x(0)
, y(0) { }
COOR2(int _x, int _y)
: x(_x)
, y(_y) { }
static int Length(COOR2 a, COOR2 b)
{
int nLength = NS_IO::ABS(a.x - b.x) + NS_IO::ABS(a.y - b.y);
return nLength;
}
const bool operator == (const COOR2& v) const
{
if (v.x == this->x && v.y == this->y)
{
return true;
}
else
{
return false;
}
}
int x;
int y;
};
typedef std::vector<COOR2> VtCoor2;
// 战斗对象
class IGObject;
typedef std::vector<IGObject *> VtGObject;
typedef std::map<int, IGObject *> MapGObject;
class IGrid;
typedef std::vector<IGrid *> VtGrid;
typedef std::map<int, IGrid *> MapGrid;
class ICountry;
typedef std::vector<ICountry *> VtCountry;
typedef std::map<int, ICountry *> MapCountry;
#endif
|
7b59619beb08df6c84296d46089e64c4ba426036
|
570a9425f2f32df2c75b0241f86d761b48a06a9e
|
/547test.cpp
|
1a92997a4952d323e4c6878adda0982fcca130df
|
[] |
no_license
|
Brilliantrocks/leetcodelib
|
18169b3f8c9f1302af72d0dbdc52d542a64494ce
|
e048b7189056fa5d57c78e9a06095dde1a76e96d
|
refs/heads/main
| 2023-05-24T00:13:29.837423
| 2021-06-03T16:54:50
| 2021-06-03T16:54:50
| 366,859,144
| 1
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,016
|
cpp
|
547test.cpp
|
#include<vector>
#include<iostream>
using namespace std;
class Solution {
public:
int findCircleNum(vector<vector<int>>& isConnected) {
int n = isConnected.size(),cnt = 0;
vector<int> head(n);
for (int i = 0; i < n; ++i){
head[i] = i;
}
for (int i = 0; i < n; ++i){
for (int j = i+1; j < n; ++j){
if (isConnected[i][j]){
mergecity(head,i,j);
}
}
}
for (int i = 0; i < n; ++i){
if (head[i] == i) ++cnt;
}
return cnt;
}
int find_head(vector<int> &head, int i){
if (head[i] != i){
head[i] = find_head(head,head[i]);
}
return head[i];
}
void mergecity(vector<int> &head, int i, int j){
head[find_head(head,i)] = find_head(head,j);
}
};
main(){
vector<vector<int>> fb = {{1,0,0},{0,1,0},{0,0,1}};
Solution sl;
int ret = sl.findCircleNum(fb);
cout<<ret<<endl;
}
|
a8362e1de91ae0de5f9d861e7b506454c4720db6
|
839ed24e7ecf66b6983f4f2629ef87b90c02d41e
|
/B/C++/b010.cpp
|
f45be0482574c5c72251115fb41b824f813d5a62
|
[] |
no_license
|
ht0919/ProgrammingExercises
|
86634153be11d08ba45c8d06bf2574b48974a2a6
|
5a9dc356603e3a54d7fdd9d8780c8851f7f37928
|
refs/heads/master
| 2020-04-04T07:32:09.083569
| 2018-10-17T04:28:37
| 2018-10-17T04:28:37
| 25,193,626
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,048
|
cpp
|
b010.cpp
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int XA[11];
int XB[11];
char T[4];
int U,pass,flg,num,a,b;
int i;
cin >> T;
cin >> U;
for (i=0; i<11; i++) { cin >> XA[i]; }
for (i=0; i<11; i++) { cin >> XB[i]; }
if (strcmp(T,"A") == 0) {
pass = XA[U-1];
sort(XB, XB+11);
b = XB[9];
flg = 0;
num = 1;
for (i=0; i<11; i++) {
a = XA[i];
if (a>=55 && a>b && a>pass) {
cout << num << "\n";
flg = 1;
}
num += 1;
}
if (flg == 0) { cout << "None\n"; }
} else {
pass = XB[U-1];
sort(XA, XA+11);
a = XA[1];
flg = 0;
num = 1;
for (i=0; i<11; i++) {
b = XB[i];
if (b<=55 && b<a && b<pass) {
cout << num << "\n";
flg = 1;
}
num += 1;
}
if (flg == 0) { cout << "None\n"; }
}
}
|
51c7769302983698f5d7d3f00d9fd2200fb82e39
|
0dfad761d04379de7386a09281357a60f89ee46c
|
/sort.cpp
|
d9eca53e9d7e9155c3c0b96d1de77c115b925e01
|
[] |
no_license
|
xzatkalik/line-sort
|
1bf20ee5a5d0f11ce37fd15d7c74a6aa8654b6f2
|
056fbe90dac553fa3f1a5a15c697f9a3f5b4560b
|
refs/heads/master
| 2020-03-28T22:45:10.240004
| 2018-09-18T04:16:10
| 2018-09-18T04:16:10
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 550
|
cpp
|
sort.cpp
|
#include "sort.h"
#include <string>
#include <iterator>
#include <vector>
#include <algorithm>
#include <cctype>
#include <sstream>
namespace
{
struct Line : public std::string {};
std::istream & operator >> (std::istream & is, Line & line)
{
return std::getline(is, line);
}
}
bool sort::process(Order order, Filter filter, Case compare, std::istream & input, std::ostream & output)
{
std::vector<std::string> lines { std::istream_iterator<Line>(input), std::istream_iterator<Line>() };
// implementation of sorting
return true;
}
|
b80f51eda445d1883813b2ea61851f63c620e707
|
922a9d59ca84346dc93aa787b26e291ce3fc1649
|
/src/enemyChar.hpp
|
a6e3e2af89076a24dd1d2288842938823bcd771e
|
[] |
no_license
|
Khchobo/TowerDefense-2
|
3e665502689a7426556eaf78f8cf3a70e03bdf4a
|
a4dbb7e5d4e7b3ccd18b93c6cc4ac9c9dd19b530
|
refs/heads/master
| 2022-04-13T09:09:05.031251
| 2020-01-31T10:36:29
| 2020-01-31T10:36:29
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 6,836
|
hpp
|
enemyChar.hpp
|
#ifndef ENEMYCHAR__HPP
#define ENEMYCHAR__HPP
// Include std::libs
#include <math.h>
#include <iostream>
#include <stdlib.h> /* srand, rand */
#include <vector>
#include <memory>
// Include external libs
#ifdef INCLUDE
#include <jsoncpp/json/json.h>
#else
#include <json/json.h>
#endif // INCLUDE
#include <SFML/Graphics.hpp>
#include <SFML/Audio.hpp>
// Include external files
#include "healthBar.hpp"
#include "macro.hpp"
#include "base.hpp"
/// @brief Class for an enemy character
/// @author Wilco Matthijssen
class enemyChar : public sf::RectangleShape {
Json::Value& baseStats;
healthBar hpBar;
float health;
Json::Value::iterator currAnimation;
float animationInterval;
float animationCounter;
/// @brief Follows path for n steps to the left and returns remainder if target is reached
///
/// @param steps steps enemyChar can move
/// @param target target to move towards
/// @return const float
///
const float moveLeftToTarget(float steps, const float target);
/// @brief Follows path for n steps to the right and returns remainder if target is reached
///
/// @param steps steps enemyChar can move
/// @param target target to move towards
/// @return const float
///
const float moveRightToTarget(float steps, const float target);
/// @brief Follows path for n steps up and returns remainder if target is reached
///
/// @param steps steps enemyChar can move
/// @param target target to move towards
/// @return const float
///
const float moveUpToTarget(float steps, const float target);
/// @brief Follows path for n steps down and returns remainder if target is reached
///
/// @param steps steps enemyChar can move
/// @param target target to move towards
/// @return const float
///
const float moveDownToTarget(float steps, const float target);
public:
std::vector<sf::Vector2f>::iterator currTargetLocation;
float tileSteps = 0;
/// @brief Construct an enemyChar with json
///
/// @param stats Used for getting stats
/// @param route route for enemy to walk
/// @param textures textures of all enemyChar's
/// @param size size of enemyChar in pixels
///
enemyChar(Json::Value& stats, std::vector<sf::Vector2f>& route, std::map<std::string, sf::Texture>& textures, const sf::Vector2f& size);
/// @brief Changes texture when interval is reached
///
/// @param steps increases the counter
/// @return void
///
void animate(const float steps);
/// @brief Returns health of enemyChar
///
/// @return const float
///
const float getHealth();
/// @brief Returns speed of enemyChar
///
/// @return const float
///
const float getSpeed();
/// @brief Removes health from enemyChar
///
/// @param damage damage that will be dealt to enemyChar
/// @return void
///
void decreaseHealth(const float& damage);
/// @brief Returns damage of enemyChar
///
/// @return const float
///
const float getDamage();
/// @brief Follows path for n steps
///
/// @param steps
/// @return void
///
void followPath(float& steps);
/// @brief draws HP bar on window
///
/// @param window
/// @return void
///
void drawHP(sf::RenderWindow& window);
/// @brief Returns reward for killing enemyChar
///
/// @return unsigned int
///
unsigned int getReward();
};
/// @brief Class for an enemy character
/// @author Wilco Matthijssen
class enemyCharGroup {
private:
//std::shared_ptr<base> target;
Json::Value enemyTemplates;
std::vector<sf::Vector2f> route;
sf::Texture texture;
sf::Clock clock;
float tileSize;
sf::Clock clockSpawn;
std::map<std::string, sf::Texture> &textures;
//unsigned int counter = 0;
Json::Value waves;
std::vector< std::shared_ptr< enemyChar > > enemies;
Json::Value::iterator currWave;
unsigned int &money;
base& target;
sf::Music deathmusic;
sf::Music damagemusic;
float spawnTime = 1;
/// @brief spawns new enemies based on time passed
///
/// @return void
///
void spawnWave();
/// @brief sets route for enemyChar and converts it to pixels.
///
/// @param route route in tiles
/// @param tilesize size of tiles
/// @return void
///
void setRoute(const std::vector<sf::Vector2i>& route, const float& tilesize, const sf::Vector2f& offset);
/// @brief sets the waves of enemies the class will spawn
/// @details sets current wave as first wave in enemyWaves
/// @param enemyWaves waves of enemies
/// @return void
///
void setWaves(const Json::Value enemyWaves);
/// @brief makes next wave availlable to spawn
/// @details set next wave as current wave if it's not the last wave
/// @return void
///
void nextWave();
/// @brief sets the tile size to scale enemy size from
///
/// @param size size of tile
/// @return void
///
void setTileSize(const float& givenTilesize, const sf::Vector2f& offset);
/// @brief Returns true is all enemies are dead
///
/// @param window
/// @return void
///
const bool isEnemyDefeated();
/// @brief Moves enemy for n steps and return false if enemy reached end
///
/// @param enemy shared_ptr to enemy
/// @param steps how many steps does the enemy need to move
/// @return bool
///
const bool move(std::shared_ptr<enemyChar>& enemy, float steps);
public:
/// @brief construct an enemyCharGroup
/// @details constructs an enemyCharGroup containing enemyChars for how many are defined in param waves.
///
/// @param enemyTemplates Json::Value of enemies config
/// @param route route that enemies will walk
/// @param tilesize size of tile in route
/// @param offset top left pixel position of route
/// @param waves waves of enemies the class needs to spawn
/// @param money increases when an enemyChar dies
/// @param target target for enemyChar's
/// @param textures map containing all textures
///
enemyCharGroup(Json::Value enemyTemplates,
const std::vector<sf::Vector2i>& route,
const float& tilesize,
const sf::Vector2f& offset,
Json::Value waves,
unsigned int & money,
base & target,
std::map<std::string, sf::Texture>& textures);
/// @brief draws all enemies on window
///
/// @param window
/// @return void
///
void draw(sf::RenderWindow& window);
/// @brief moves all enemies based on speed and time passed
///
/// @return void
///
void update();
/// @brief applies damage on enemy and kills it if less hp than damage
///
/// @param index index of enemy to take damage
/// @param damage damage for enemy to take
/// @return void
///
void damageEnemy(std::weak_ptr<enemyChar> & target, const float & damage);
/// @brief returns all enemies by reference
///
/// @return std::vector<std::unique_ptr<enemyChar>>
///
std::vector<std::shared_ptr<enemyChar>> & getEnemies();
/// @brief returns the current wave number
///
/// @return unsigned int
///
unsigned int getWaveNumber();
};
#endif // ENEMYCHAR__HPP
|
734d99ad0ec12b12b79dd979edbd9a44c09e75c9
|
37daba6ba2620d5bbb734abf67a0e517e67a4397
|
/src/Cqual/CQualNStore.cpp
|
ead8f9716dca09a51dd59f1bdf50af670d160857
|
[] |
no_license
|
BioinformaticsArchive/libCSAM
|
4b8be64eb09d55705aebf98d5bc898cb8efaa36f
|
7ec68901af614a7fd1faadd38df56aec270b284f
|
refs/heads/master
| 2020-02-26T13:40:57.780866
| 2014-03-14T05:18:09
| 2014-03-14T05:18:09
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 4,392
|
cpp
|
CQualNStore.cpp
|
/********************************************************************************
Copyright (c) 2013, Rodrigo Canovas
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 libCSAM 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 <COPYRIGHT HOLDER> BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
********************************************************************************/
#include "CQualNStore.h"
CQualNStore::CQualNStore(){
}
CQualNStore::CQualNStore(vector<string> QUAL, vector<RPP> rpp, int m){
sizeQualLine = QUAL[0].size();
vector<RPP>::iterator it;
numberOfLines = rpp.size();
switch(m){
case 0: QualValue = getPQualValue(QUAL, rpp); break;
case 1: QualValue = getRQualValue(QUAL, rpp); break;
default: throw CDSException("Unknown mode type");
}
}
cds_word CQualNStore::getPQualValue(vector<string> QUAL, vector<RPP> rpp){
vector<RPP>::iterator it;
string qual;
cds_word max, min, valueL;
cds_word res = 0, cont = 0;
for(it = rpp.begin(); it != rpp.end(); ++it){
qual = QUAL[(*it).Permutation];
max = 33;
min = 126;
for(cds_word w = 0; w < qual.length(); w++){
valueL = (cds_word)(qual[w]);
if(valueL < min)
min = valueL;
if(valueL > max)
max = valueL;
}
cont ++;
res += (max + min) / 2;
}
return res / cont;
}
cds_word CQualNStore::getRQualValue(vector<string> QUAL, vector<RPP> rpp){
vector<RPP>::iterator it;
string qual;
cds_word max, min, valueL;
cds_word res = 0, cont = 0;
for(it = rpp.begin(); it != rpp.end(); ++it){
qual = QUAL[(*it).Permutation];
max = 33;
min = 126;
for(cds_word w = 0; w < qual.length(); w++){
valueL = (cds_word)(qual[w]);
if(valueL < min)
min = valueL;
if(valueL > max)
max = valueL;
}
cont ++;
res += (cds_word)( sqrt((min - 33) * (max - 33)) + 33);
}
return res / cont;
}
string * CQualNStore::getAllQual() const{
string qual = "";
string *quals = new string[numberOfLines];
cout << qual << endl;
qual.append(sizeQualLine, (char)QualValue);
for(cds_word i = 0; i < numberOfLines; i++)
quals[i] = qual;
return quals;
}
CQualNStore::~CQualNStore(){
}
cds_word CQualNStore::getSize() const{
cds_word mem = sizeof(CQualNStore);
return mem;
}
vector<string> CQualNStore::getInterval(cds_word x, cds_word y) const{
vector<string> block;
string qual = "";
qual.append(sizeQualLine, (char)QualValue);
for(cds_word i = x; i <= y; i++)
block.push_back(qual);
return block;
}
void CQualNStore::Save(ofstream &fp) const{
SaveValue(fp, NSTORE);
cds_word Variables[3];
Variables[0] = sizeQualLine;
Variables[1] = numberOfLines;
Variables[2] = QualValue;
SaveValue(fp, Variables, 3);
}
CQualNStore * CQualNStore::Load(ifstream &fp){
cds_word r = LoadValue<cds_word>(fp);
if (r != NSTORE) {
assert(false);
return NULL;
}
CQualNStore *cqual = new CQualNStore();
cds_word *Variables = LoadValue<cds_word>(fp, 3);
cqual->sizeQualLine = Variables[0];
cqual->numberOfLines = Variables[1];
cqual->QualValue = Variables[2];
delete [] Variables;
return cqual;
}
|
20b3ed40f43db060e50c85dc3911a66a39f389b9
|
8264dae28229bc6b8d09c72f34c0bd2a27a71019
|
/src/pop_menu.cpp
|
4bbc1204fad346dd3ece2c567939559b13642caa
|
[] |
no_license
|
Bayonetta5/hge-gui
|
a502d9c725ea3460aa5d3b4820f2bcb68b22eb37
|
7859b47c6c204534276533f05b987111fadbb451
|
refs/heads/master
| 2023-03-19T13:28:19.128148
| 2013-10-16T18:39:32
| 2013-10-16T18:39:32
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,737
|
cpp
|
pop_menu.cpp
|
#include "list_box.h"
#include "pop_menu.h"
namespace Gui
{
PopMenu::PopMenu(float x, float y, float width, float height, Widget *parent)
: Widget(x, y, width, height, parent)
{
float delta = 20;
//m_line_edit = new TextLine(0, 0, width - 10, GetManager())
GetStyle().back_color_focused[3] = 0;
GetStyle().back_color[3] = 0;
GetStyle().back_color_mouse_down[3] = 0;
GetStyle().back_color_unfocused[3] = 0;
GetStyle().back_color_moused[3] = 0;
m_list_box = new ListBox(0, 0, width, height, this);
m_list_box->Visible(false);
m_list_box->SigItemSelected.Connect(new ValueChanged<PopMenu, int>(this, &PopMenu::ItemSelected));
}
PopMenu::~PopMenu()
{}
void PopMenu::ItemSelected(int)
{
Visible(false);
m_list_box->Visible(false);
auto item = m_list_box->CurrentItem();
SigItemSelected(SimpleType<Item*>(item));
}
void PopMenu::AddItems(const std::vector<std::string> &items)
{
m_list_box->AddItems(items);
}
void PopMenu::AddItem(const std::string &value, void *data)
{
m_list_box->AddItem(value, data);
}
void PopMenu::Exec()
{
Visible(true);
GetManager()->SetFocused(this);
m_list_box->Visible(true);
m_list_box->ResetSelection();
}
void PopMenu::OnResize(float x, float y, float width, float height)
{
Widget::OnResize(x, y, width, height);
m_list_box->Resize(0, 0, width, height);
}
void PopMenu::OnUnfocused(const Event &e)
{
Visible(false);
}
void PopMenu::OnRepaint(RenderAdapter *r)
{
Widget::OnRepaint(r);
}
}
|
68d17c7cb3a77eccef3ee75c6268a2b95effc26c
|
837a73e0e50ac7d5aec3eb5bfff6f6bde5a9d506
|
/binary-search-no-recursion.cc
|
00392d244ff41acf5f2b96d3b2e2d3baf362bdcd
|
[] |
no_license
|
narubond007/datastructure
|
4d73a8b421c4c61021cc070b3f629adc920f3807
|
79377c9df37c56e4de4cf4e8e4dd34836dfe727b
|
refs/heads/master
| 2016-09-05T20:09:01.755867
| 2015-11-17T22:47:19
| 2015-11-17T22:47:19
| 28,770,083
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 613
|
cc
|
binary-search-no-recursion.cc
|
#include <iostream>
using namespace std;
//for binary search, array has to be in ascending order
int a[] = {4,7,9,13,25,31,67,73,401,513};
int main(){
int NUM=0;
int start=0;
int end = 9;
int mid = (start + end)/2;
//remember the termination case. This works for all the numbers
// no infinite loops, we have tested it well.
while(start <= end) {
if(NUM == a[mid]){
cout << "Found " << NUM << endl;
break;
} else if( NUM > a[mid]){
start = mid+1;
end = end;
} else if( NUM < a[mid]){
start = start;
end = mid - 1;
}
mid = (start+end)/2;
}
return 0;
}
|
36180530547eb450b1e8d7662ac952ae9da5a1fa
|
bc2360489e6dbab068b36d96e10a3ad03bbbeb24
|
/customer.cpp
|
e48cf1f921a46be85b51304ac9ff5d6638aa5652
|
[] |
no_license
|
Kyloman/movie-theatre
|
8f22c6ef5453cd2b7769c27b2392f9824fcaa38d
|
64e3ddd0d460c2d665ed9ddc6b009b56a3978df3
|
refs/heads/master
| 2020-04-25T01:26:42.494799
| 2019-03-21T06:56:52
| 2019-03-21T06:56:52
| 172,408,438
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 4,061
|
cpp
|
customer.cpp
|
// ---------------------------------- customer.h-------------------------------------------
// Programmer Name Course Section Number
// 3/12/2019
// Date of Last Modification 3/20/19
// --------------------------------------------------------------------------------------------------------------------
// Purpose - this is the class for the customer that keeps track of customer info and actions.
// --------------------------------------------------------------------------------------------------------------------
// Think of this like a dossier which notes what customers have interacted with a store.
// --------------------------------------------------------------------------------------------------------------------
#include "customer.h"
// --------------------------Constructor---------------------------------
// Description: default constructor for customer class sets to null
// ----------------------------------------------------------------------
Customer::Customer()
{
ident = -1;
fName = "NULL";
lName = "OBJECT";
}
// --------------------------Constructor---------------------------------
// Description: creates a customer class
// ----------------------------------------------------------------------
Customer::Customer(int id, string first, string last)
{
ident = id;
fName = first;
lName = last;
}//end of constructor
Customer::~Customer()
{
int size = idHistory.size();
for (int x = 0; x < size; x++)
{
//out += getName() + " ";
idHistory.pop_back();
}
}
// --------------------------borrow---------------------------------
// Description: function for when customers borrow a copy of a movie
// decreases inventory when the borrow transaction goes through
// ----------------------------------------------------------------------
void Customer::borrow(Movie* newMedia)
{
if (newMedia->getInv() > 0)
{
Transaction tran(newMedia, "borrowed");
newMedia->decreaseInv(1);
idHistory.push_back(tran);
}
else
cout << "Out of Stock" << endl;
}//end of borrow
// --------------------------return---------------------------------
// Description: function for when customers return a copy of a movie
// increases inventory when the return transaction goes through
// ----------------------------------------------------------------------
void Customer::returning(Movie* newMedia)
{
Transaction tran(newMedia, "returned");
newMedia->increaseInv(1);
idHistory.push_back(tran);
}//end of returning
// --------------------------getHistory---------------------------------
// Description: getter for customer History
// ----------------------------------------------------------------------
void Customer::getHistory()
{
int size = idHistory.size();
string out = ""; //we are building a string to print
for (int x = 0; x < size; x++)
{
//out += getName() + " ";
out += idHistory[x].toString() + "\n";
}
cout << "Customer #" << getID() << "'s history:" << endl;
cout << out;
cout << endl;
}// end of getHistroy
// --------------------------getID---------------------------------
// Description: getter for customer ID
// ----------------------------------------------------------------------
int Customer::getID()
{
return ident;
}//end of getID
// --------------------------setID---------------------------------
// Description: setter for customer ID
// ----------------------------------------------------------------------
void Customer::setID(int newID)
{
ident = newID;
}//end of setID
// --------------------------getName---------------------------------
// Description: getter for customer name
// ----------------------------------------------------------------------
string Customer::getName()
{
return fName + " " + lName;
}//end of getName
// --------------------------setName---------------------------------
// Description: setter for customer name
// ----------------------------------------------------------------------
void Customer::setName(string first, string last)
{
fName = first;
lName = last;
}//end of setName
|
5b187390a2bfd4b7b8b438023ebd3135efacfe25
|
1b07ecb8aa5a209ee4a2c746d4a219431d09b9a0
|
/Point.h
|
17b604f6ad6ee775f7fcf03d7d3db3ee626a12ec
|
[] |
no_license
|
Apig-Sharbo/Geometry-Shape-Point-Circle-Cylinder
|
a1cfd0fd02a989412421b369f796c5a980b9e98e
|
5deb94f0f0bc7c7795c634aa20b8adfbfd241fb4
|
refs/heads/master
| 2020-09-11T16:42:34.559293
| 2019-11-16T16:41:19
| 2019-11-16T16:41:19
| 222,129,076
| 1
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 229
|
h
|
Point.h
|
#pragma once
#include "Shape.h"
class Point :
public Shape
{
public:
Point(int , int ,const char* );
virtual void print();
virtual double Area();
virtual double Volume();
~Point();
protected:
int x, y;
};
|
5303c0cb1cde59db763ce56acec74dd42c61f3a6
|
abc7c8f0f9dd247642ac74b0a46f00523693ab2e
|
/Pow.cpp
|
53c7d064f84186a5a1ebbf75eefb5c08c38748e0
|
[] |
no_license
|
suyangzhu/leetcode
|
e2bd38c03e7fca85d6767ae52db17d7b83365c85
|
4c0d5c100adcce85a14929fbef81922a4a4e2282
|
refs/heads/master
| 2020-05-17T15:21:46.382598
| 2014-11-26T20:01:44
| 2014-11-26T20:01:44
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 272
|
cpp
|
Pow.cpp
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
double Pow(double x, int n) {
double result = 1.0;
int i;
for(i = 0; i < n; i++)
result *= x;
return result;
}
int main() {
std::cout << Pow(1.1, 2) << std::endl;
return 0;
}
|
9f5d3076772579ff38d46757fd3189fbfbd283b7
|
0d25c05396ea7a23088366f65e3012f297e98bb7
|
/HM_StructureTest3/minioncard.cpp
|
6a9c45288d1609ed092363fc88b001ac6c3ff25c
|
[] |
no_license
|
CoderDuan/HearthMason
|
2d85f074a51e20969b08b4bef7fc2e0d5789b394
|
dec33b2dd43a0373bed33b603421e62999c06341
|
refs/heads/master
| 2021-01-10T18:21:18.745527
| 2016-02-06T15:34:52
| 2016-02-06T15:34:52
| 50,272,296
| 3
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 327
|
cpp
|
minioncard.cpp
|
#include "minioncard.h"
MinionCard::MinionCard()
{
setMinion(NULL);
}
Minion* MinionCard::minion()
{
return m_minion;
}
void MinionCard::setMinion(Minion *minion)
{
if(m_minion != minion){
m_minion = minion;
if(m_minion)
m_minion->setCard(this);
emit minionChanged();
}
}
|
7936e1aab6c4d83ab8a5296938f6a2ac3cec5be4
|
bacaab3607353ecaa3ba94441039825e5d8553bb
|
/cf/555d.cpp
|
a7201feefe9abb22f665714e0c5c63cb13340c3f
|
[] |
no_license
|
allenwhale/code
|
fc0c0e0dbb5d799484c43c26c3bd286f49342bb3
|
31d72b801791589602159ea5b5137e7f0bb42d05
|
refs/heads/master
| 2021-01-17T00:53:05.481576
| 2019-09-18T14:46:00
| 2019-09-18T14:46:00
| 27,023,130
| 2
| 1
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 846
|
cpp
|
555d.cpp
|
#include <bits/stdc++.h>
using namespace std;
int ss[200010], p[200010];
map<int,int>mp;
int main(){
int N, Q;
scanf("%d%d",&N,&Q);
for(int i=0;i<N;i++)
scanf("%d",&ss[i]), p[i]=ss[i],mp[ss[i]]=i;
sort(p,p+N);
while(Q--){
int a, l, flag=1;
scanf("%d%d",&a,&l);
int s=lower_bound(p,p+N,ss[a-1])-p;
int f=0;
int ls=-1;
while(1){
int ns;
if(flag)
ns=upper_bound(p+s,p+N, p[s]+l)-p-1;
else
ns=lower_bound(p,p+s,p[s]-l)-p;
flag ^= 1;
int ll=abs(p[s]-p[ns]);
l-=ll;
if(ns==s&&f++)
break;
if(ns==ls)
l %= (2*ll);
ls=s;
s=ns;
}
printf("%d\n",mp[p[s]]+1);
}
return 0;
}
|
458199b9eb76b0f4160eefb5642518a17bf19d2b
|
a7e234deb466a3cb1034525d88a79e8e1bbf21ed
|
/semester2/lab 6/perfect/main.cpp
|
b2e7f11c32c47c07ef4e564722f11e7ae0937314
|
[] |
no_license
|
Anninster/Coding-Projects
|
39e49a4120d6839b24bdcf2f8d55923c155cdce7
|
16de7f760cdca63422bf08be2441ba12642e6857
|
refs/heads/master
| 2020-04-11T21:34:20.303895
| 2018-12-17T12:55:46
| 2018-12-17T12:55:46
| 162,110,136
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 869
|
cpp
|
main.cpp
|
#include <iostream>
using namespace std;
bool myperfect(int a);
void myfactors(int a);
int main()
{
int nama=1;
for (int i=6;nama<5;i++)
{
if (myperfect(i))
{
cout << i << " is a perfect number\n" ;
myfactors(i);
nama++;
cout << "\n\n";
}
}
return 0;
}
bool myperfect(int a)
{
int sum=0;
for (int i=1;i<a;i++)
{
if (a%i==0)
{
sum=sum+i;
}
}
if (sum==a)
return true;
else
return false;
}
void myfactors(int a)
{
for (int i=1;i<a;i++)
{
if(a%i==0)
{
if (i==1)
{
cout << i ;
}
else
cout<< " + " << i ;
}
}
cout << " = " << a;
}
|
29fd6e5bbcb52282a016b5fee05df4c74e31b195
|
609c7a153e9abe1d0b4d71846de0b0a9926a9d15
|
/Velvet/vmt.h
|
a5ab02165dae20b9f49162d4f9ae79e116194b27
|
[
"Apache-2.0"
] |
permissive
|
AlvyPiper/Velvet
|
2ce478a14932e8f9b61eba17235a75a428d1cc3f
|
743e8177536ef17c4c8364ecf7c37e4472cec03d
|
refs/heads/master
| 2021-05-24T04:08:49.647475
| 2020-11-04T08:18:36
| 2020-11-04T08:18:36
| 45,608,314
| 29
| 13
| null | 2016-11-07T22:55:26
| 2015-11-05T11:55:31
|
C++
|
UTF-8
|
C++
| false
| false
| 14,459
|
h
|
vmt.h
|
#pragma once
//----------------------------------------------------------------
// Toolkit: Virtual method table hooks
//----------------------------------------------------------------
// These can be hooked in two distinct manners.
//
// The VMTManager class hooks by replacing the vmt pointer with a custom crafted one.
// Only calls through this instance will be hooked.
//
// The VMTPointer class hooks a pointer to an interface.
// Only calls through this specific variable will be hooked.
//
// The VMTHook class hooks by editing the vtable in the dll's .rdata.
// Every instance using that vtable will be hooked.
//
// A general hint:
// Abuse the __fastcall convention ( look it up on the msdn ) to catch the this pointer.
//
// More specific information follows the class declaration.
//
// Each class has a basic version (no constructors/destructors) and a RAII version.
//
// This code is public domain but credits (to Casual_Hacker on www.unknowncheats.me) are always appreciated.
#include <cassert>
namespace toolkit
{
// Find the number of vfuncs in a vtable
unsigned int CountFuncs(void** pVMT);
// Find the index for a vfunc, result is negative if not found
int FindFunc(void** pVMT, void* pFunc, unsigned int vfuncs = 0);
//----------------------------------------------------------------
// Class: VMTManager
//----------------------------------------------------------------
// Hooks virtual functions by replacing the vtable pointer from an instance.
// VMTManager is the RAII version of VMTBaseManager
class VMTBaseManager
{
public:
// TODO: Abstractions can never hurt...
//typedef const void* pfn_t;
//struct vtbl_t
//{
// pfn_t data[1];
// inline const pfn_t& operator[] ( unsigned int i ) const { return data[i]; }
// inline pfn_t& operator[] ( unsigned int i ) { return data[i]; }
//};
// Guard identifies if an instance is hooked.
enum { GUARD = 0xFAC0D775 }; //4206942069 huehuehuehuehue
// Init the hook, will not hook the instance yet.
VMTBaseManager& Init(void* inst, unsigned int offset = 0, unsigned int vfuncs = 0);
// Unhook and forget about this instance.
void Kill();
// Are we initialized.
bool IsInitialized() const;
// Hooks a function by index.
VMTBaseManager& HookMethod(void* newfunc, unsigned int index);
// Unhooks a function by index.
VMTBaseManager& UnhookMethod(unsigned int index);
// Unhooks all functions.
void EraseHooks();
// Return the original vtable. Instance will appear completely unhooked.
VMTBaseManager& Unhook();
// Put the vtable with the hooks back.
VMTBaseManager& Rehook();
// Test if the hooks are active.
bool Hooked() const;
// Get the original function.
// Use a function prototype for the template argument to make it very easy to call this function.
// Example syntax: hook.GetMethod<bool (__thiscall*)( void*, int )>( 12 )( inst, arg );
template< typename Fn >
const Fn& GetMethod(unsigned int index) const;
// Get/Set the userdata.
void* UserData() const;
void UserData(void* data);
// Test if the instance is hooked.
static bool HookPresent(void* inst, unsigned int offset = 0);
// Get the hook object. Does not check if the instance is actually hooked!
static VMTBaseManager& GetHook(void* inst, unsigned int offset = 0);
protected:
static void**& _getvtbl(void* inst, unsigned int offset);
protected:
void*** _vftable;
void** _oldvmt;
void** _array;
void* _userdata;
};
class VMTManager : public VMTBaseManager
{
// Forbid copy constructing and assignment.
VMTManager(const VMTManager&);
VMTManager& operator= (const VMTManager&);
public:
// Initialize & hook the instance.
VMTManager(void* inst, unsigned int offset = 0, unsigned int vfuncs = 0);
~VMTManager();
// If the instance is somehow destroyed before you get a chance to unhook it or destruct this hook object, call this.
// It'll prevent the destructor from crashing.
void Poof();
// Get the hook object. Does not check if the instance is actually hooked!
static VMTManager& GetHook(void* inst, unsigned int offset = 0);
};
// VMTBaseManager inlines
inline bool VMTBaseManager::IsInitialized() const
{
return _vftable != nullptr;
}
inline VMTBaseManager& VMTBaseManager::HookMethod(void* newfunc, unsigned int index)
{
assert(index<CountFuncs(_array + 3) && IsInitialized());
_array[index + 3] = newfunc;
return *this;
}
inline VMTBaseManager& VMTBaseManager::UnhookMethod(unsigned int index)
{
assert(index<CountFuncs(_array + 3) && IsInitialized());
_array[index + 3] = _oldvmt[index];
return *this;
}
inline VMTBaseManager& VMTBaseManager::Unhook()
{
*_vftable = _oldvmt;
return *this;
}
inline VMTBaseManager& VMTBaseManager::Rehook()
{
*_vftable = _array + 3;
return *this;
}
inline bool VMTBaseManager::Hooked() const
{
return *_vftable != _oldvmt;
}
template< typename Fn >
inline const Fn& VMTBaseManager::GetMethod(unsigned int index) const
{
assert(index<CountFuncs(_array + 3));
return *(const Fn*) &_oldvmt[index];
}
inline void* VMTBaseManager::UserData() const
{
return _userdata;
}
inline void VMTBaseManager::UserData(void* data)
{
_userdata = data;
}
inline bool VMTBaseManager::HookPresent(void* inst, unsigned int offset)
{
void** vmt = _getvtbl(inst, offset);
return vmt[-2] == (void*) GUARD;
}
inline VMTBaseManager& VMTBaseManager::GetHook(void* inst, unsigned int offset)
{
void** vmt = _getvtbl(inst, offset);
return *reinterpret_cast<VMTBaseManager*>(vmt[-3]);
}
inline void**& VMTBaseManager::_getvtbl(void* inst, unsigned int offset)
{
return *reinterpret_cast<void***>((char*) inst + offset);
}
// VMTManager inlines
inline VMTManager::VMTManager(void* inst, unsigned int offset, unsigned int vfuncs)
{
Init(inst, offset, vfuncs).Rehook();
}
inline VMTManager::~VMTManager()
{
Kill();
}
inline void VMTManager::Poof()
{
_vftable = nullptr;
}
inline VMTManager& VMTManager::GetHook(void* inst, unsigned int offset)
{
return static_cast<VMTManager&>(VMTBaseManager::GetHook(inst, offset));
}
//----------------------------------------------------------------
// Class: VMTPointer
//----------------------------------------------------------------
// Hooks virtual functions by replacing the whole pointer to the class with a dummy interface.
// Assumes only 1 vtable (no MI) placed at the start of the class.
class VMTBasePointer
{
public:
enum { GUARD = 0xDE4DB3EF };
// Init the hook, will not hook the instance yet. (the vfuncs use __thiscall convention)
VMTBasePointer& Init_thiscall(void* inst, unsigned int vfuncs = 0);
// Init the hook, will not hook the instance yet. (the vfuncs use __stdcall convention)
VMTBasePointer& Init_stdcall(void* inst, unsigned int vfuncs = 0);
// Unhook and forget about this instance.
void Kill();
// Hooks a function by index.
// WARNING! The this ptr in your hook points to the hook object!
VMTBasePointer& HookMethod(void* newfunc, unsigned int index);
// Unhooks a function by index.
VMTBasePointer& UnhookMethod(unsigned int index);
// Hook for this variable.
VMTBasePointer& Rehook(void* var);
// Unhook for this variable.
VMTBasePointer& Unhook(void* var);
// Get the original function.
// Use a function prototype for the template argument to make it very easy to call this function.
// Example syntax: hook.GetMethod<bool (__thiscall*)( void*, int )>( 12 )( inst, arg );
template< typename Fn >
const Fn& GetMethod(unsigned int index) const;
// Get/Set the userdata.
void* UserData() const;
void UserData(void* data);
// Get the original instance.
void* Instance() const;
// Get the dummy instance.
void* Dummy() const;
// Test if the instance is hooked.
static bool HookPresent(void* inst);
// Get the hook object. Does not check if the instance is actually hooked!
static VMTBasePointer& GetHook(void* inst);
protected:
// Internal constructor
typedef void(__fastcall* CallGateFn)();
VMTBasePointer& Init(void* inst, CallGateFn gate, unsigned int vfuncs = 0);
static void* __fastcall FindCallOffset(VMTBasePointer* _this, unsigned char* addr);
static void __fastcall CallGate_thiscall(); // This passed in ecx
static void __fastcall CallGate_stdcall(); // This passed on stack
static void** _getvtbl(void* inst, unsigned int offset = 0);
protected:
// Note! Do not move these members around!
// Dummy object has to come first, original instance ptr has to be at this+4!
// Fake 'this' points to our hook object
struct dummy_t
{
void** vtable;
} _dummy;
// Original instance
void* _inst;
// Call gate (__thiscall/__stdcall version, needed for UnhookMethod)
CallGateFn _gate;
// User data context
void* _userdata;
};
class VMTPointer : public VMTBasePointer
{
// Forbid copy constructing and assignment
VMTPointer(const VMTPointer&);
VMTPointer& operator= (const VMTPointer&);
public:
VMTPointer(void** var, bool thiscall = true, unsigned int vfuncs = 0);
~VMTPointer();
// Return the original vtable. Instance will appear completely unhooked.
VMTPointer& Unhook();
// Put the vtable with the hooks back.
VMTPointer& Rehook();
// Test if the hooks are active.
bool Hooked() const;
static VMTPointer& GetHook(void* inst);
private:
void** _var;
};
// Inlines for VMTBasePointer
inline VMTBasePointer& VMTBasePointer::Init_thiscall(void* inst, unsigned int vfuncs)
{
return Init(inst, &CallGate_thiscall, vfuncs);
}
inline VMTBasePointer& VMTBasePointer::Init_stdcall(void* inst, unsigned int vfuncs)
{
return Init(inst, &CallGate_stdcall, vfuncs);
}
inline VMTBasePointer& VMTBasePointer::HookMethod(void* newfunc, unsigned int index)
{
assert(index<CountFuncs(_dummy.vtable) && newfunc);
_dummy.vtable[index] = newfunc;
return *this;
}
inline VMTBasePointer& VMTBasePointer::UnhookMethod(unsigned int index)
{
assert(index<CountFuncs(_dummy.vtable));
_dummy.vtable[index] = _gate;
return *this;
}
inline VMTBasePointer& VMTBasePointer::Rehook(void* var)
{
void*& x = *(void**) var;
assert(!x || x == _inst || x == &_dummy);
x = &_dummy;
return *this;
}
inline VMTBasePointer& VMTBasePointer::Unhook(void* var)
{
void*& x = *(void**) var;
assert(!x || x == _inst || x == &_dummy);
x = _inst;
return *this;
}
template< typename Fn >
inline const Fn& VMTBasePointer::GetMethod(unsigned int index) const
{
assert(index<CountFuncs(_dummy.vtable));
return *(const Fn*) (&_getvtbl(_inst)[index]);
}
inline void* VMTBasePointer::UserData() const
{
return _userdata;
}
inline void VMTBasePointer::UserData(void* data)
{
_userdata = data;
}
inline void* VMTBasePointer::Instance() const
{
return _inst;
}
inline void* VMTBasePointer::Dummy() const
{
return const_cast<dummy_t*>(&_dummy);
}
inline bool VMTBasePointer::HookPresent(void* inst)
{
void** vmt = *(void***) inst;
return vmt[-2] == (void*) GUARD;
}
inline VMTBasePointer& VMTBasePointer::GetHook(void* inst)
{
void** vmt = *(void***) inst;
return *reinterpret_cast<VMTBasePointer*>(vmt[-3]);
}
inline void** VMTBasePointer::_getvtbl(void* inst, unsigned int offset)
{
return *reinterpret_cast<void***>((char*) inst + offset);
}
// Inlines for VMTPointer
inline VMTPointer::VMTPointer(void** var, bool thiscall, unsigned int vfuncs) : _var(var)
{
if (thiscall)
Init_thiscall(*var, vfuncs);
else
Init_stdcall(*var, vfuncs);
}
inline VMTPointer::~VMTPointer()
{
*_var = _inst;
Kill();
}
inline VMTPointer& VMTPointer::Unhook()
{
*_var = _inst;
return *this;
}
inline VMTPointer& VMTPointer::Rehook()
{
*_var = &_dummy;
return *this;
}
inline bool VMTPointer::Hooked() const
{
return *_var == &_dummy;
}
inline VMTPointer& VMTPointer::GetHook(void* inst)
{
return static_cast<VMTPointer&>(VMTBasePointer::GetHook(inst));
}
//----------------------------------------------------------------
// Class: VMTHook
//----------------------------------------------------------------
// Hooks virtual functions by overwriting the function pointers in .rdata.
// Currently no support for unhooking...
class VMTBaseHook
{
public:
// Init the hook.
VMTBaseHook& Init(void* inst, unsigned int offset = 0, unsigned int vfuncs = 0);
VMTBaseHook& Init(void** vmt, unsigned int vfuncs = 0);
// Unhook and forget about this instance.
void Kill();
// Hooks a function by index.
VMTBaseHook& HookMethod(void* new_func, unsigned int index);
// Unhooks a function by index.
VMTBaseHook& UnhookMethod(unsigned int index);
// Erase the hooks.
void EraseHooks();
// Get the original function.
// Use a function prototype for the template argument to make it very easy to call this function.
// Example syntax: hook.GetMethod<bool (__thiscall*)( void*, int )>( 0x5 )( inst, arg );
template< typename Fn >
const Fn& GetMethod(unsigned int index) const;
protected:
static bool WriteHook(void* dest, const void* src, unsigned int bytes);
private:
void** _vftable;
void** _backup;
unsigned int _vcount;
};
class VMTHook : public VMTBaseHook
{
// Forbid copy constructing and assignment
VMTHook(const VMTHook&);
VMTHook& operator= (const VMTHook&);
public:
VMTHook(void* inst, unsigned int offset = 0, unsigned int vfuncs = 0);
VMTHook(void** vmt, unsigned int vfuncs = 0);
~VMTHook();
};
// Inlines for VMTBaseHook
inline VMTBaseHook& VMTBaseHook::Init(void* inst, unsigned int offset, unsigned int vfuncs)
{
return Init(*reinterpret_cast<void***>((char*) inst + offset), vfuncs);
}
template< typename Fn >
inline const Fn& VMTBaseHook::GetMethod(unsigned int index) const
{
return *(Fn*) &_backup[index];
}
inline VMTBaseHook& VMTBaseHook::HookMethod(void* func, unsigned int index)
{
WriteHook(&_vftable[index], &func, sizeof(void*));
return *this;
}
inline VMTBaseHook& VMTBaseHook::UnhookMethod(unsigned int index)
{
WriteHook(&_vftable[index], &_backup[index], sizeof(void*));
return *this;
}
inline void VMTBaseHook::EraseHooks()
{
WriteHook(_vftable, _backup, _vcount*sizeof(void*));
}
// Inlines for VMTHook
inline VMTHook::VMTHook(void* inst, unsigned int offset, unsigned int vfuncs)
{
Init(inst, offset, vfuncs);
}
inline VMTHook::VMTHook(void** vmt, unsigned int vfuncs)
{
Init(vmt, vfuncs);
}
inline VMTHook::~VMTHook()
{
Kill();
}
}
|
54ca5cfa518e5cbe9bff66d61f0891a01086619d
|
75d24ce86e1fb833974615a8c21521c918f575b4
|
/Oschlex.h
|
eab87c3146589bfc66bc7f15dc6aecbd207b3a49
|
[] |
no_license
|
ndilday/virtualu
|
059100ec82b46c1def39643fdf7123d05db3796d
|
96012dccd26e32460403b3438ca0ce0ef7fe469b
|
refs/heads/master
| 2021-01-10T07:06:13.960690
| 2014-05-22T04:16:38
| 2014-05-22T04:16:38
| 47,211,286
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 8,022
|
h
|
Oschlex.h
|
//Filename : OSCHLEX.H
//Description: Class SchoolEx Declaration
//Owner : Fred
#ifndef __OSCHLEX_H
#define __OSCHLEX_H
#ifndef __OSCHOOL_H
#include <OSCHOOL.H>
#endif
#include <OSTUDENT.H> // MAX_STUDENT_LEVEL
#include <OFIELD.H> // IPED_FIELD_COUNT
//------- Define class SchoolFacultyEx -----//
//!Extension of SchoolFaculty including active_research_dollars per
//!faculty.
class SchoolFacultyEx : public SchoolFaculty {
public:
int active_research_dollars; // ($000) _per_faculty
};
//---------- Define class SchoolEx ---------//
class SchoolDegreeRec;
//!Class for calculating and tracking school expenses. An extended version
//!of School, with SchoolDegree variables in the "Initial Conditions"
//!spreadsheet.
class SchoolEx : public School { // an extended version of School, with variables in the "Initial Conditions" spreadsheet.
public:
int db_school_recno; // recno to db_school_array;
// field L-R
int operating_reserve; // current_funds_balance
int endowment_market; // end_of_year_endowment_market_value
int buildings; // year_end_market_value_of_plant
int capital_reserve; // year_end_capital_reserve
int general_plant_debt; // year_end_general_plant_and_residence_hall_debt
int residence_hall_debt; // residence_hall_debt
int fund_balance; // R=M1244+N1244+O1244-P1244-Q1244
// field S
int gross_tuition_revenue; // total_gross_tuition_revenue
int financial_aid; // total_financial_aid
int net_tuition_revenue; // =S-T
int state_appropriations; // state_and_local_appropriations
int sponsored_research; // adjusted_total_sponsored_research
int gifts_to_operations; // gifts_to_operations
int endowment_spending; //
// field Z
short athletics; // athletics_revenue
int other_operating_income; // adjusted_other_operating_income;
int interest_on_operating_reserve; // = current_funds_balance * 0.08
int total_sources_of_funds; // =AC=SUM(U1244:AB1244)
// field AD
int dept_expense_faculty_salaries; // academic_dept_faculty_salaries
int dept_expense_staff_salaries; // = academic_dept_total_salaries - AD
int dept_expense_other; // academic_dept_other_expense
int sponsored_research_faculty_salaries; // sponsored_research_faculty_salaries
int sponsored_research_staff_salaries; // = sponsored_research_total_salaries - AG
int sponsored_research_other; // sponsored_research_other
// field AJ
int library_staff_salaries; // library_salaries
int library_other_expense; // library_other_expense
int academic_it_staff_salaries; // = academic_support_salaries * 0.1
int academic_it_other_expense; // = academic_support_other_expense * 0.3
// field AN
int student_life_staff_salaries; // student_life_salaries
int student_life_other_expense; // student_life_other_expense
// fields already defined in base class School
// Athletics: staff salaries Athletics: other expense
// int athletics_salaries;
// int athletics_other_expense;
// field AR
int inst_advancement_staff_salaries; // inst_advancement_salaries
int inst_advancement_other_expense; // inst_advancement_other_expense
int administration_staff_salaries; // inst_support_net_salaries;
int administration_other_expense; // inst_support_net_other_expense;
int o_and_m_staff_salaries; // o_and_m_salaries
int o_and_m_other_expense; // o_and_m_other_expense
// field AX
int other_operating_expense_staff_salaries; // academic_support_salaries -AL
int other_operating_expense_other_expense; // academic_support_other_expense -AM
int total_operating_expenditure; // = SUM(AD1244:AY1244)
// field BA
int service_on_general_plant_debt; // (year_end_general_plant_and_residence_hall_debt
// -residence_hall_debt)*0.065
int transfer_to_capital_reserve; // transfer_to_plant
int total_uses_of_funds; // = AZ1244+BA1244+BB1244
int surplus_or_deficit; // = AC1244-BC1244
// field BE
int tuition_rate; // = freshmen_from_within_the_state_percent/100.0*in_state_tuition+(1-freshmen_from_within_the_state_percent/100.0)*out_state_tuition
short room_and_board_rate; // room_and_board_charges
// ug_in_housing_percent/1000.0
float percent_traditional_ug_in_residence_halls;
float percent_get_bacc_in_5_year; // student_get_bacc_in_5_year_percent/1000.0
char overhead_rate_on_sponsored_research; // overhead_rate
float endowment_spending_rate; // float endowment_spending_rate;
// field BK
// replaced super class's school_faculty_array and will be updated
SchoolFacultyEx school_faculty_array_ex[FACULTY_RANK_LEVEL_COUNT];
// Enroll ft,pt_ug,etc (Enroll SL1-5)
short full_time_undergrad; // = sPtr->full_time_undergrad;
short part_time_undergrad; // = sPtr->part_time_undergrad;
short enrollment_masters; // = sPtr->enrollment_masters;
short enrollment_doctoral; // = sPtr->enrollment_doctoral;
short non_degree_seeking; // = sPtr->non_degree_seeking
// field CM - Percent Female SL1-5
char percent_female_sl[MAX_STUDENT_LEVEL]; // = female_undergrad_percent
// field CR - Percent Minority SL1-5
char percent_minority_sl[MAX_STUDENT_LEVEL]; // = minority_undergrad_percent*0.85;
char percent_instate_freshmen; // = freshmen_from_within_the_state_percent
char percent_non_resident_alien_doctoral; // = non_resident_alien_grad_and_prof_percent;
/*
// field defined in base class School
// field CY
short target_student_intake_sl[5];
float dropout_rate_sl[5];
float target_grad_rate_sl[5];
*/
// field DN
int ug_applications; // = student_applications;
float ug_applications_rate; // = ug_applications/student_accepted;
char ug_yield_rate; // = float(student_enrolled)/student_accepted*100;
//TO int the 3nd to 5th vars?
// fields already defined in base class School
//char percent_ug_students_on_aid; // DQ= percent_ug_students_on_aid;
//float percent_freshmen_with_need; // = percent_freshmen_with_need;
//float freshmen_offered_aid; // = freshmen_offered_aid;
//float percent_freshmen_offered_full_aid; // = percent_freshmen_offered_full_aid;
//short institutional_aid_per_fte; // DU
// major_pref of sl1 = that of sl2
float student_ifield_pct[MAX_STUDENT_LEVEL-1][IPED_FIELD_COUNT];
float student_ifield_pct_total[MAX_STUDENT_LEVEL-1];
// fields already defined in base class School
//float doctoral_degrees_per_faculty_rating;
//float sponsored_research_rating; // it is integer (char) in class School
private:
void init_student_ifield_pct(SchoolDegreeRec* degRec, short sl, short len);
public:
void init(int schoolRecno); // calculate vars in SchoolEx based on vars in School
};
//--------------------------------------//
#endif
|
b1c479e1150fe24a13389d54506865f18cde1ea5
|
1048998f99a92115f4bb78d7b34b8c03a37bd6c8
|
/DNCB440.d/backup/local/include/octave-2.1.36/octave/symtab.h
|
789cfb8d23319f54506332eaf1be9c5e279a1332
|
[] |
no_license
|
tetazoo/sodalord
|
c70dcecf6284fbbc25b7d2a2fcd3743869e38509
|
ce705f48a9eb7694476dc9b5b267936855bc00be
|
refs/heads/master
| 2020-12-14T16:55:53.178363
| 2020-01-18T23:56:39
| 2020-01-18T23:56:39
| 234,811,643
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 12,345
|
h
|
symtab.h
|
/*
Copyright (C) 1996, 1997 John W. Eaton
This file is part of Octave.
Octave is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
Octave is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with Octave; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#if !defined (octave_symtab_h)
#define octave_symtab_h 1
#if defined (__GNUG__)
#pragma interface
#endif
#include <cassert>
#include <string>
#include "SLStack.h"
#include "oct-alloc.h"
#include "str-vec.h"
#include "ov.h"
class octave_lvalue;
class string_vector;
class symbol_record;
class symbol_table;
// Individual records in a symbol table.
class
symbol_record
{
public:
// If you add or delete an entry here, you'll also need to change
// the width parameter in the declaration for symbol_type below...
enum TYPE
{
UNKNOWN = 0,
USER_FUNCTION = 1,
USER_VARIABLE = 2,
DLD_FUNCTION = 4,
BUILTIN_FUNCTION = 8,
TEXT_FUNCTION = 16,
MAPPER_FUNCTION = 32,
BUILTIN_VARIABLE = 64,
BUILTIN_CONSTANT = 128
};
private:
// Variables or functions.
class symbol_def
{
public:
symbol_def (const octave_value& val = octave_value (),
unsigned int sym_type = 0)
: symbol_type (sym_type), eternal (0), read_only (0), help_string (),
definition (val), next_elem (0), count (1) { }
~symbol_def (void) { }
bool is_constant (void) const
{ return (symbol_type & symbol_record::BUILTIN_CONSTANT); }
bool is_variable (void) const
{
return (symbol_type & symbol_record::USER_VARIABLE
|| symbol_type & symbol_record::BUILTIN_VARIABLE);
}
bool is_function (void) const
{
return (symbol_type & symbol_record::USER_FUNCTION
|| symbol_type & symbol_record::DLD_FUNCTION
|| symbol_type & symbol_record::BUILTIN_FUNCTION);
}
bool is_user_variable (void) const
{ return (symbol_type & symbol_record::USER_VARIABLE); }
bool is_text_function (void) const
{ return (symbol_type & symbol_record::TEXT_FUNCTION); }
bool is_mapper_function (void) const
{ return (symbol_type & symbol_record::MAPPER_FUNCTION); }
bool is_user_function (void) const
{ return (symbol_type & symbol_record::USER_FUNCTION); }
bool is_builtin_constant (void) const
{ return (symbol_type & symbol_record::BUILTIN_CONSTANT); }
bool is_builtin_variable (void) const
{ return (symbol_type & symbol_record::BUILTIN_VARIABLE); }
bool is_builtin_function (void) const
{ return (symbol_type & symbol_record::BUILTIN_FUNCTION); }
bool is_dld_function (void) const
{ return (symbol_type & symbol_record::DLD_FUNCTION); }
// XXX FIXME XXX
bool is_map_element (const std::string& /* elts */) const
{ return false; }
bool is_defined (void) const
{ return definition.is_defined (); }
bool is_read_only (void) const
{ return read_only; }
bool is_eternal (void) const
{ return eternal; }
int rows (void) const { return definition.rows (); }
int columns (void) const { return definition.columns (); }
std::string type_name (void) const { return definition.type_name (); }
std::string type_as_string (void) const;
void type (std::ostream& os, const std::string& name, bool pr_type_info,
bool quiet, bool pr_orig_txt);
std::string which (const std::string& name);
void which (std::ostream& os, const std::string& name);
void define (const octave_value& val, unsigned int sym_type)
{
definition = val;
symbol_type = sym_type;
}
void protect (void) { read_only = 1; }
void unprotect (void) { read_only = 0; }
void make_eternal (void) { eternal = 1; }
octave_value& def (void) { return definition; }
std::string help (void) const { return help_string; }
void document (const std::string& h) { help_string = h; }
unsigned int type (void) { return symbol_type; }
void *operator new (size_t size)
{ return allocator.alloc (size); }
void operator delete (void *p, size_t size)
{ allocator.free (p, size); }
static octave_allocator allocator;
// The type of this symbol (see the enum above).
unsigned int symbol_type : 8;
// Nonzero means this variable cannot be cleared.
unsigned int eternal : 1;
// Nonzero means this variable cannot be given a new value.
unsigned int read_only : 1;
// The doc string associated with this variable.
std::string help_string;
// The value of this definition. See ov.h and related files.
octave_value definition;
// Pointer to next definition in chain. This is used so that
// variables can hide function definitions, and so that the function
// definitions can reappear if the variable is cleared.
symbol_def *next_elem;
// Reference count.
int count;
void dump_symbol_info (void);
// No copying!
symbol_def (const symbol_def& sd);
symbol_def& operator = (const symbol_def& sd);
};
public:
typedef int (*change_function) (void);
symbol_record (void)
: formal_param (0), linked_to_global (0), tagged_static (0),
nm (), chg_fcn (0), definition (new symbol_def ()),
next_elem (0) { }
symbol_record (const std::string& n, symbol_record *nxt)
: formal_param (0), linked_to_global (0), tagged_static (0),
nm (n), chg_fcn (0), definition (new symbol_def ()),
next_elem (nxt) { }
~symbol_record (void) { }
std::string name (void) const { return nm; }
std::string help (void) const { return definition->help (); }
octave_value& def (void) { return definition->def (); }
void rename (const std::string& new_name);
bool is_function (void) const
{ return definition->is_function (); }
bool is_text_function (void) const
{ return definition->is_text_function (); }
bool is_mapper_function (void) const
{ return definition->is_mapper_function (); }
bool is_user_function (void) const
{ return definition->is_user_function (); }
bool is_builtin_function (void) const
{ return definition->is_builtin_function (); }
bool is_dld_function (void) const
{ return definition->is_dld_function (); }
bool is_constant (void) const
{ return definition->is_constant (); }
bool is_builtin_constant (void) const
{ return definition->is_builtin_constant (); }
bool is_variable (void) const
{ return definition->is_variable (); }
bool is_user_variable (void) const
{ return definition->is_user_variable (); }
bool is_builtin_variable (void) const
{ return definition->is_builtin_variable (); }
bool is_map_element (const std::string& elts) const
{ return definition->is_map_element (elts); }
unsigned int type (void) const { return definition->type (); }
bool is_defined (void) const { return definition->is_defined (); }
bool is_read_only (void) const { return definition->is_read_only (); }
bool is_eternal (void) const { return definition->is_eternal (); }
void protect (void) { definition->protect (); }
void unprotect (void) { definition->unprotect (); }
void make_eternal (void) { definition->make_eternal (); }
void set_change_function (change_function f) { chg_fcn = f; }
void define (const octave_value& v, unsigned int sym_type = USER_VARIABLE);
void define_builtin_var (const octave_value& v);
bool define_builtin_const (const octave_value& v);
bool define (octave_function *f, unsigned int sym_type);
void document (const std::string& h) { definition->document (h); }
void clear (void);
void alias (symbol_record *s, bool force = false);
void mark_as_formal_parameter (void);
bool is_formal_parameter (void) const { return formal_param; }
void mark_as_linked_to_global (void);
bool is_linked_to_global (void) const { return linked_to_global; }
void mark_as_static (void);
bool is_static (void) const { return tagged_static; }
bool hides_fcn (void) const;
bool hides_builtin (void) const;
int rows (void) const { return definition->rows (); }
int columns (void) const { return definition->columns (); }
std::string type_name (void) const { return definition->type_name (); }
std::string type_as_string (void) const
{ return definition->type_as_string (); }
void type (std::ostream& os, bool pr_type_info, bool quiet, bool pr_orig_txt)
{ definition->type (os, name (), pr_type_info, quiet, pr_orig_txt); }
std::string which (void) { return definition->which (name ()); }
void which (std::ostream& os) { definition->which (os, name ()); }
octave_value& variable_value (void);
octave_lvalue variable_reference (void);
symbol_record *next (void) const { return next_elem; }
void chain (symbol_record *s) { next_elem = s; }
void push_context (void);
void pop_context (void);
void print_symbol_info_line (std::ostream& os);
void dump_symbol_info (void);
private:
unsigned int formal_param : 1;
unsigned int linked_to_global : 1;
unsigned int tagged_static : 1;
std::string nm;
change_function chg_fcn;
symbol_def *definition;
symbol_record *next_elem;
// This should maybe be one stack with a structure containing all the
// items we need to save for recursive calls...
SLStack <symbol_def *> context;
SLStack <unsigned int> global_link_context;
bool read_only_error (const char *action);
void push_def (symbol_def *sd);
void remove_top_def (void);
void replace_all_defs (symbol_def *sd);
void link_to_builtin_variable (void);
// No copying!
symbol_record (const symbol_record& s);
symbol_record& operator = (const symbol_record& s);
};
// A symbol table.
#define SYMTAB_LOCAL_SCOPE 1
#define SYMTAB_GLOBAL_SCOPE 2
#define SYMTAB_ALL_SCOPES (SYMTAB_LOCAL_SCOPE | SYMTAB_GLOBAL_SCOPE)
#define SYMTAB_ALL_TYPES (symbol_record::USER_FUNCTION \
| symbol_record::USER_VARIABLE \
| symbol_record::DLD_FUNCTION \
| symbol_record::BUILTIN_FUNCTION \
| symbol_record::TEXT_FUNCTION \
| symbol_record::MAPPER_FUNCTION \
| symbol_record::BUILTIN_VARIABLE \
| symbol_record::BUILTIN_CONSTANT)
#define SYMTAB_VARIABLES (symbol_record::USER_VARIABLE \
| symbol_record::BUILTIN_VARIABLE)
class
symbol_table
{
public:
symbol_table (unsigned int tab_size = 128)
: table_size (tab_size), table (new symbol_record [table_size])
{
assert ((tab_size % 2) == 0);
}
~symbol_table (void)
{
delete [] table;
}
symbol_record *lookup (const std::string& nm, bool insert = false,
bool warn = false);
void rename (const std::string& old_name, const std::string& new_name);
void clear (bool clear_user_functions = true);
bool clear (const std::string& nm, bool clear_user_functions = true);
int size (void) const;
Array<symbol_record *>
symbol_list (const string_vector& pats = string_vector (),
unsigned int type = SYMTAB_ALL_TYPES,
unsigned int scope = SYMTAB_ALL_SCOPES) const;
string_vector
name_list (const string_vector& pats = string_vector (),
bool sort = false, unsigned int type = SYMTAB_ALL_TYPES,
unsigned int scope = SYMTAB_ALL_SCOPES) const;
int maybe_list (const char *header, const string_vector& argv,
std::ostream& os, bool show_verbose,
unsigned type, unsigned scope);
Array<symbol_record *> glob (const std::string& pat = std::string ("*"),
unsigned int type = SYMTAB_ALL_TYPES,
unsigned int scope = SYMTAB_ALL_SCOPES) const;
void push_context (void);
void pop_context (void);
void print_stats (void);
private:
unsigned int table_size;
symbol_record *table;
unsigned int hash (const std::string& s);
// No copying!
symbol_table (const symbol_table&);
symbol_table& operator = (const symbol_table&);
};
#endif
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
4055b12754242801b56d9a58d1d384a211c8c261
|
07b0b72f5af0972dba1ed53560dcb4de7049bc3e
|
/src/includes/DOEngine.h
|
e3342ad556adcd7c6cb4513ccad8c2c5acdcace6
|
[] |
no_license
|
aneury1/DOEngine
|
8b90e14de41a1f9dc2c899c63b00acaf834772e2
|
6b384119b6fc10f45be856414250d2e0ea237967
|
refs/heads/master
| 2023-08-17T06:49:41.598503
| 2023-08-03T11:56:57
| 2023-08-03T11:56:57
| 170,516,909
| 0
| 1
| null | 2023-08-03T11:54:10
| 2019-02-13T13:57:45
|
Makefile
|
UTF-8
|
C++
| false
| false
| 644
|
h
|
DOEngine.h
|
#ifndef DOENGINE_HPP_DEFINED
#define DOENGINE_HPP_DEFINED
#include<SDL2/SDL_image.h>
#include<SDL2/SDL_ttf.h>
#include<SDL2/SDL.h>
#include <vector>
#include <string>
#include <map>
#include <iostream>
#include <sstream>
#include <string>
#include "defines.h"
#include "Window.h"
#include "sort.h"
#include "LinkList.h"
#include "EventHandler.h"
#include "Event.h"
#include "FPSManager.h"
#include "Geometric.h"
#include "GameObject.h"
#include "GameStateManager.h"
#include "Grids.h"
#include "Sprite.h"
#include "LinkList.h"
#include "Tile.h"
#include "Tilemap.h"
#include "TTFText.h"
#include "UDPPacket.h"
#include "Vector.h"
#endif
|
257ee6edd158d476754ab5ff3013eb1ea128bef3
|
57f336a72304666d0d8d21ebd25246fcae263401
|
/Project_for_study/Binary_Search/main.cpp
|
ab813423ddf5adcbaa28e0c63daa8e6889b7f22e
|
[] |
no_license
|
kalinichika/C-Cpp
|
52a641432a8d985e7a6853b4a4084ad00637559f
|
de0895436592edf1e7d9389b1385eeef82809446
|
refs/heads/master
| 2020-04-29T12:25:53.262278
| 2019-07-10T09:09:40
| 2019-07-10T09:09:40
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 2,504
|
cpp
|
main.cpp
|
#include <iostream>
#include <vector>
using std::vector;
using std::cout;
using std::endl;
// ПОИСК МЕСТА "РАЗРЫВА"
template <typename T>
int search_break(vector<T>& v){
if(v[0] < v[v.size()-1]) return v.size()-1;
int a = 0;
int b = v.size()-1;
int count = b/2;
int middle = count;
while ((a!=middle)&&(b!=middle)) {
if ( v[a] > v[middle] ) {
b = middle;
count = static_cast<int>((b-a)/ 2);
middle = middle - count;
}
else{
a = middle;
count = static_cast<int>((b-a)/ 2);
middle = middle + count;
}
}
return middle + 1;
}
// ПОИСК ЗНАЧЕНИЯ В ЧАСТИ ВЕКТОРА
template< typename It, typename T >
int search_in_part(It begin, It end, const T& value ){
It a = begin;
It b = end-1;
int size = end - begin;
It middle = begin+size/2;
if( *middle == value ) {
while(*(middle-1) == value)
middle--;
return middle-begin;
}
while((*middle!=value)&&((a!=middle)&&(b!=middle))){
if( value < *middle ) {
b = middle;
middle = middle - ((b-a)/ 2);
}
else{
a = middle;
middle = middle + ((b-a)/ 2);
}
}
It result;
if( *a == value ) result = a;
else if( *b == value ) result = b;
else if( *middle == value ) result = middle;
else return -1;
while(*(result-1)==value)
result--;
return result-begin;
}
// ФУНКЦИЯ SEARCH - ВЫЗЫВАЕТ ВСПОМОГАТЕЛЬНЫЕ
// Ф-ИИ, ОПИСАННЫЕ ВЫШЕ
template <typename T>
int search(vector<T>& v, const T value){
int pos = search_break(v);
int result=-1;
result = search_in_part(v.begin(), v.begin()+pos, value);
if (result>=0) return result;
result = search_in_part(v.begin()+pos, v.end(), value);
if (result>=0) return pos+result;
return -1;
}
int main()
{
// СОЗДАЮ ВЕКТОР
// 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11
int arr[] = {7, 8, 9, 9, 12, 12, 17, 0, 3, 3, 4, 4,};
vector<int> v(arr, arr+12);
// ПЕЧАТЬ ВЕКТОРА
cout << " num = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11\n vec = ";
for (auto i:v) cout << i << ", ";
cout << endl;
// ПОИСК ЭЛЕМЕНТОВ 0-19
for (int i = 0; i<20; i++){
cout << "position of value \"" << i << "\" = " << search(v,i) << endl;
}
}
|
2ce3e7c1e91ef6238fca9e0ebd809a5cbf85cb42
|
79547aa20cb6da706d63300ff21aba6af1fc212b
|
/UnitTest/Set1Test.cpp
|
d7f8a5d77a63e789bc96c087f5cd0e525c1e931a
|
[] |
no_license
|
wilzegers/CounterMachine
|
eeade069038d5c439d2099f472fc555e280d90ad
|
ad2546bca148453f8d4917fce1573ecc2b58d6fb
|
refs/heads/master
| 2021-05-10T10:14:08.902891
| 2018-05-14T13:50:37
| 2018-05-14T13:50:37
| 118,374,159
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 85
|
cpp
|
Set1Test.cpp
|
#include "TransformationTestUtils.h"
namespace UnitTest
{
CREATE_SET_TEST(1);
}
|
56b5d524edae5f7d2d55a2b429fc60f4e586309d
|
d1697d7be7e0be965f3a2334eb6b54feb1c4c30e
|
/hw_09/guess.cpp
|
af40b90d2c79204f590b7c7dba2bffdc57ff8766
|
[] |
no_license
|
Jhe0031/csci127-assignments
|
fa02e06421ab9175ffaa7c9024409f79ec956020
|
8e5b670aa2467429f77f55551ec1c20f846d78b0
|
refs/heads/master
| 2020-03-28T03:45:32.408565
| 2018-12-20T15:07:57
| 2018-12-20T15:07:57
| 147,669,138
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,273
|
cpp
|
guess.cpp
|
#include <iostream>
#include <stdlib.h>
#include <cstdlib>
int main()
{
int i;
int g;
int rand();
int num;
srand (time(NULL));
g = rand()%100;
std::cout << "Please enter an integer from 0 to 99, inclusive: ";
std::cin >> i;
std::cout << "Is this your number: " << g << "?\n";
std::cout << "Please enter '-1' if your number is lower\n";
std::cout << "Please enter '1' if your number is higher\n";
std::cout << "Please enter '0' if this is your number\n";
std::cin >> num;
while (g != i)
{
if (num == 0) {
std::cout << "Your number is " << g << "! Yay!\n";
break;
} else if (num == -1) {
std::cout << "Is this your number: " << g-1 << "?\n";
g = g-1;
std::cin >> num;
} else if (num == 1) {
std::cout << "Is this your number: " << g+1 << "?\n";
g = g+1;
std::cin >> num;
} else {
<<<<<<< HEAD
std::cout << "So you want to stop using 1's I see.\n";
=======
std::cout << "So you want to stop using 1's and 0's I see.\n";
>>>>>>> 7f7c1520d8ce78c731d3ac1b2be491e853bc082c
g = g+num;
std::cout << "Is this your number: " << g << "?\n";
std::cin >> num;
}
}
if (g == i)
{
std::cout << "Your number is " << g << ". Yay!\n";
}
<<<<<<< HEAD
return 0;
}
=======
}
>>>>>>> 7f7c1520d8ce78c731d3ac1b2be491e853bc082c
|
7f3b7604f4b15e7483f83d604b3198c5c8bfc3c6
|
5e6b8e78e689e0cdfb529ff4fac9d057ea3c3bb3
|
/Codeforces/QuanHeHoHang.cpp
|
f08ef38e0c314e129a9871807d3c43c36a23963a
|
[] |
no_license
|
tielse/Example_C
|
bb214c61423ce9424950a736bb5ec15346531c8c
|
21f728c0a58c5d9523779227edd5cca799625fd1
|
refs/heads/master
| 2021-01-02T22:36:47.555419
| 2017-08-04T16:08:24
| 2017-08-04T16:08:24
| 99,354,138
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 564
|
cpp
|
QuanHeHoHang.cpp
|
#include<iostream>
#include<ctime>
#include<cstring>
using namespace std;
int64_t ans=0,b[1024]={0};
string s;
int main()
{
clock_t aa=clock();
int n,x,l;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s;
l=s.size();
x=0;
for(int j=0;j<l;j++)
x|=(1<<(s[j]-48));
++b[x];
}
for(int i=0;i<1024;i++)
for(int j=i;j<1024;j++)
if((i&j)!=0)
{
if(i!=j)
ans+=b[i]*b[j];
else
ans+=(b[i]*b[i-1])/2;
}
cout<<ans;
clock_t bb=clock();
cout<<"\nTime:"<<(double)(bb-aa)/1000<<" sec";
return 0;
}
|
98b59001b4015c4c48fafad6460b19e98735e2a2
|
8de0753ea95eac28c7078f6c2782fb8cb9d89e21
|
/src/utils/JsonData.cpp
|
adabc2d2a0aeeadf493e204eafb6574c9290bc3c
|
[
"MIT"
] |
permissive
|
shady2017/game
|
3de1ef7ea5039540f678526075f6cbc151b3fcd5
|
b3040841904d716dcce76e47ef704e7a7af00eca
|
refs/heads/master
| 2021-05-11T10:56:10.431732
| 2017-12-20T22:07:49
| 2017-12-20T22:07:49
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 2,128
|
cpp
|
JsonData.cpp
|
#include "JsonData.h"
void JsonData::prettify() {
std::vector<char> formatted;
int tabs = 0;
bool in_string = false;
bool newline_after_char = false;
bool add_space_after_char = false;
auto newline = [&]() {
formatted.push_back('\n');
for(int i = 0; i < tabs; ++i)
formatted.push_back('\t');
};
for(auto it = m_data.begin(); it != m_data.end(); ++it) {
if(!in_string) {
if(*it == ',') {
newline_after_char = true;
} else if(*it == ':') {
add_space_after_char = true;
} else if(*it == '{') {
// check for empty object - if the next char closes it
if(*(it + 1) != '}') {
newline_after_char = true;
tabs++;
} else {
formatted.push_back(*it++);
}
} else if(*it == '}') {
tabs--;
newline();
} else if(*it == '[') {
// check for empty array - if the next char closes it
if(*(it + 1) != ']') {
newline_after_char = true;
tabs++;
} else {
formatted.push_back(*it++);
}
} else if(*it == ']') {
tabs--;
newline();
} else if(*it == '"') {
in_string = true;
}
} else if(*it == '"') {
auto rit = it - 1;
int num_backslashes = 0;
while(*rit-- == '\\')
num_backslashes++;
if(num_backslashes % 2 == 0)
in_string = false;
}
formatted.push_back(*it);
if(add_space_after_char) {
formatted.push_back(' ');
add_space_after_char = false;
}
if(newline_after_char) {
newline();
newline_after_char = false;
}
}
m_data = formatted;
}
|
72f2800877c518d919d0f39a83506680de6cbe29
|
1237e2b307b8f8d22ffde9124aa036c4cd1c104f
|
/Database.h
|
ff990f698a30c904dbf3c59c57d5475c8f401466
|
[] |
no_license
|
TELEUZI/handling_workers_info
|
343c2837266c01da1f106243f9ce4d294beb21d5
|
e6b7b6275803fd93b30fa6d696d34bc1ade8bc59
|
refs/heads/master
| 2023-02-19T05:19:37.434444
| 2021-01-17T17:51:12
| 2021-01-17T17:51:12
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 504
|
h
|
Database.h
|
#pragma once
#include "worker.h"
class Database
{
private:
Database() {}
Database(const Database&);
Database& operator=(Database&);
public:
static Database& getInstance() {
static Database instance;
return instance;
}
void read_from_database(vector<worker>& workers_from_database, int num);
void write_into_database(vector<worker>& workers);
int find_out_number_of_workers_in_database(string path);
void update_number_of_workers_in_database(string path, int num);
};
|
2c1e961d81a414546401edfd4447f1a8f9dccc17
|
282ec49f8ce8aa176c24e4f13a8852c9b0752e4a
|
/jumble/box_and_hits/src/ih/key_binding.cc
|
33e5a683928c5e5710a86da8c535ed51fe5dc8c8
|
[] |
no_license
|
montreal91/workshop
|
b118b9358094f91defdae1d11ff8a1553d67cee6
|
8c05e15417e99d7236744fe9f960f4d6b09e4e31
|
refs/heads/master
| 2023-05-22T00:26:09.170584
| 2023-01-28T12:41:08
| 2023-01-28T12:41:08
| 40,283,198
| 3
| 1
| null | 2023-05-01T20:19:11
| 2015-08-06T03:53:44
|
C++
|
UTF-8
|
C++
| false
| false
| 2,013
|
cc
|
key_binding.cc
|
#include "key_binding.h"
namespace ih {
EKeyBinding::EKeyBinding() {
// TODO: make this staff load from configs
this->m_key_map[sf::Keyboard::Up] = player_action::MoveForward;
this->m_key_map[sf::Keyboard::Down] = player_action::MoveBackward;
this->m_key_map[sf::Keyboard::Left] = player_action::RotateClockwise;
this->m_key_map[sf::Keyboard::Right] = player_action::RotateCounterClockwise;
this->m_key_map[sf::Keyboard::Space] = player_action::ActivateWeapon;
this->m_key_map[sf::Keyboard::LAlt] = player_action::DropBomb;
}
void
EKeyBinding::AssignKey( Action_t action, sf::Keyboard::Key key ) {
// Remove all keys that already map to action
// TODO: create two separate methods for these operations
for ( auto i = this->m_key_map.begin(); i != this->m_key_map.end(); ) {
if ( i->second == action ) this->m_key_map.erase( i++ );
else ++i;
}
// Insert new binding
this->m_key_map[key] = action;
}
sf::Keyboard::Key
EKeyBinding::GetAssignedKey( Action_t action ) const {
for ( auto pair : this->m_key_map ) {
if ( pair.second == action ) return pair.first;
}
return sf::Keyboard::Unknown;
}
std::vector<EKeyBinding::Action_t>
EKeyBinding::GetActiveRealtimeActions() const {
std::vector<Action_t> actions;
for ( auto pair : this->m_key_map ) {
// TODO: put this condition into method
if ( sf::Keyboard::isKeyPressed( pair.first ) && this->IsRealtimeAction( pair.second ) ) {
actions.push_back( pair.second );
}
}
return actions;
}
bool
EKeyBinding::IsRealtimeAction( player_action::EeType action ) {
switch ( action ) {
case player_action::MoveForward:
case player_action::MoveBackward:
case player_action::RotateClockwise:
case player_action::RotateCounterClockwise:
case player_action::ActivateWeapon:
return true;
default:
return false;
}
}
} // namespace ih
|
9ee714ddede976864e1730c7a5c409de8bef09f3
|
08574c741e81ccb7e89f3060a9be4649fb3b6e2c
|
/Kursach/fourofakind.h
|
4cc2556313aeedf16c8d6d3f30b4563dd4730fdf
|
[] |
no_license
|
Margotaro/PokerKursach
|
54bd5ec92b7e0bb46c266a0e9177c6bc9acd10eb
|
f91eecf66aed6a8b6920a9924f92626e358165f8
|
refs/heads/master
| 2020-05-21T21:43:23.084690
| 2017-06-18T20:10:07
| 2017-06-18T20:10:07
| 84,651,242
| 1
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 363
|
h
|
fourofakind.h
|
#ifndef FOUROFAKIND_H
#define FOUROFAKIND_H
#include "card.h"
#include "combination.h"
class FourOfaKind : public Combination
{
public:
FourOfaKind::FourOfaKind() : Combination() { value = 17; }
FourOfaKind(Rank t4KindCard);
Rank getRankOfCard();
virtual int compareTo(Combination *c);
private:
Rank FourKindCard;
};
#endif // FOUROFAKIND_H
|
fdd4d291b06406b2a87e53e4f11b5f982392149b
|
f23c3e9e4088e568b260f934422187f8427a2678
|
/runners/characters/charrunner.h
|
3d757d334048d5efad7adfb3ced8a220fe493d33
|
[] |
no_license
|
KDE/kdeplasma-addons
|
330e2e01676b3dc07d434899643cef00a1f1a7ef
|
4c877cf788356202b2aee3cfdf4ca0597ffa34a9
|
refs/heads/master
| 2023-09-01T15:51:35.997634
| 2023-08-30T02:14:10
| 2023-08-30T02:14:10
| 42,733,222
| 90
| 33
| null | 2023-01-24T22:28:20
| 2015-09-18T16:18:29
|
C++
|
UTF-8
|
C++
| false
| false
| 819
|
h
|
charrunner.h
|
/* SPDX-FileCopyrightText: 2010 Anton Kreuzkamp <akreuzkamp@web.de>
* SPDX-FileCopyrightText: 2020 Alexander Lohnau <alexander.lohnau@gmx.de>
*
* SPDX-License-Identifier: LGPL-2.1-only OR LGPL-3.0-only OR LicenseRef-KDE-Accepted-LGPL
*/
#ifndef CHARRUNNER_H
#define CHARRUNNER_H
#include <KRunner/AbstractRunner>
using namespace KRunner;
class CharacterRunner : public AbstractRunner
{
Q_OBJECT
public:
CharacterRunner(QObject *parent, const KPluginMetaData &metaData);
~CharacterRunner() override;
void reloadConfiguration() override;
void match(RunnerContext &context) override;
void run(const RunnerContext &context, const QueryMatch &match) override;
private:
// config-variables
QString m_triggerWord;
QList<QString> m_aliases;
QList<QString> m_codes;
};
#endif
|
1e03d7de5681d1facb1a86c1f515b785c6a9b51d
|
76261aae39cfc15a2b3444665ebcb23a657db361
|
/Main/Source/Ripley/ModerateMediaAssetsBuilder.cpp
|
ab912904c595be54c6b1005ccd3907a0276e9cea
|
[] |
no_license
|
rocketeerbkw/DNA
|
d208c72690ccfae261beb531fb52d1c2647783e3
|
de5993d6d0f8dd735085ebca4c86f4363c498615
|
refs/heads/master
| 2021-01-21T13:29:52.930616
| 2015-10-01T17:05:40
| 2015-10-01T17:05:40
| 43,528,993
| 1
| 0
| null | 2015-10-02T00:43:08
| 2015-10-02T00:43:08
| null |
UTF-8
|
C++
| false
| false
| 27,348
|
cpp
|
ModerateMediaAssetsBuilder.cpp
|
#include "stdafx.h"
#include ".\moderatemediaassetsbuilder.h"
#include "stdafx.h"
#include "SiteData.h"
#include "WholePage.h"
#include "PageUI.h"
#include "TDVAssert.h"
#include "./emailtemplate.h"
#include "ModerationClasses.h"
#include "ModReasons.h"
#include "RefereeList.h"
#include "MediaAsset.h"
#include "MediaAssetSearchPhrase.h"
#include "MediaAssetModController.h"
//#if defined (_ADMIN_VERSION)
CModerateMediaAssetsBuilder::CModerateMediaAssetsBuilder( CInputContext& InputContext ) : CXMLBuilder(InputContext)
{
m_AllowedUsers = USER_MODERATOR | USER_EDITOR | USER_ADMINISTRATOR;
}
CModerateMediaAssetsBuilder::~CModerateMediaAssetsBuilder(void)
{
}
bool CModerateMediaAssetsBuilder::Build( CWholePage* pWholePage)
{
InitPage(pWholePage, "MEDIAASSET-MODERATION", true);
bool bSuccess = true;
// do an error page if not an editor or moderator
// otherwise proceed with the process recommendation page
CUser* pViewer = m_InputContext.GetCurrentUser();
if (pViewer == NULL || !(pViewer->GetIsEditor() || pViewer->GetIsModerator()))
{
bSuccess = bSuccess && pWholePage->SetPageType("ERROR");
bSuccess = bSuccess && pWholePage->AddInside("H2G2", "<ERROR TYPE='NOT-EDITOR'>You cannot perform moderation unless you are logged in as an Editor or Moderator.</ERROR>");
return true;
}
//Process Actions.
if ( ! Process(pWholePage,pViewer) )
{
SetDNALastError("CModerateMediaAssetsBuilder::Build","Build","Unable to process");
pWholePage->AddInside("H2G2",GetLastErrorAsXMLString());
}
//Produce XML for page.
// find out if we are processing referrals or not
bool bReferrals = m_InputContext.GetParamInt("Referrals") == 1;
bool bAlerts = m_InputContext.GetParamInt("Alerts") == 1;
bool bLockedItems = m_InputContext.GetParamInt("Locked") == 1 && pViewer->GetIsSuperuser();
bool bHeldItems = m_InputContext.GetParamInt("Held") == 1;
int iShow = 10;
if ( m_InputContext.ParamExists("show") )
iShow = m_InputContext.GetParamInt("show");
//bool bFastMod = m_InputContext.GetParamInt("fastmod") != 0;
//Add Moderation Classes
CModerationClasses modclasses(m_InputContext);
if ( modclasses.GetModerationClasses() )
bSuccess = bSuccess && pWholePage->AddInside("H2G2",&modclasses);
else if ( modclasses.ErrorReported() )
bSuccess && bSuccess && pWholePage->AddInside("H2G2",modclasses.GetLastErrorAsXMLString() );
//Add Moderation Failure - Reasons
CModReasons reasons(m_InputContext);
if ( reasons.GetModReasons(0) )
bSuccess = bSuccess && pWholePage->AddInside("H2G2",&reasons);
//Add Refereee List
CRefereeList referees(m_InputContext);
if ( referees.FetchTheList() )
bSuccess = bSuccess && pWholePage->AddInside("H2G2",&referees);
//Add Site List
CTDVString sSiteXML;
bSuccess = bSuccess && m_InputContext.GetSiteListAsXML(&sSiteXML, 2);
bSuccess = bSuccess && pWholePage->AddInside("H2G2", sSiteXML);
CModerateMediaAssets moderate(m_InputContext);
if ( !moderate.GetAssets( pViewer->GetUserID(), bAlerts, bReferrals, bLockedItems, bHeldItems, iShow ) )
pWholePage->AddInside("H2G2",moderate.GetLastErrorAsXMLString() );
else
pWholePage->AddInside("H2G2",&moderate);
TDVASSERT(bSuccess, "CModerateMediaAssetsBuilder::Build() failed");
return bSuccess;
}
/*********************************************************************************
bool CForumModerationPageBuilder::Process(CWholePage* pPage,CUser* pViewer)
Author: Kim Harries
Created: 01/02/2001
Inputs: -
Outputs: -
Returns: true for success
Purpose: Processes any submission of moderation decisions made
*********************************************************************************/
bool CModerateMediaAssetsBuilder::Process(CWholePage* pPage, CUser* pViewer)
{
bool bAuthorEmailOK = false;
bool bComplainantEmailOK = false;
bool bSuccess = true;
int iAssetID = 0;
int iModID = 0;
int iStatus = 0;
int iReferTo = 0;
int iSiteID = -1;
CTDVString sNotes;
int i = 0;
int iThreadModStatus = 0;
CTDVString sEmailType;
CTDVString sCustomText;
CTDVString sMimeType;
CStoredProcedure SP;
m_InputContext.InitialiseStoredProcedureObject(&SP);
CModerateMediaAssets moderate(m_InputContext);
CMediaAssetModController oMAModController(m_InputContext);
// first get the total number of post IDs in the submission
// - there should be an equal number of all the other parameters
int iNumberOfAssets = m_InputContext.GetParamCount("ModID");
int iProcessed = 0;
for ( int i = 0; i < iNumberOfAssets; ++i )
{
if ( !bSuccess )
break;
// get the AssetID and corresponding decision, plus notes if any
iModID = m_InputContext.GetParamInt("ModID", i);
iStatus = m_InputContext.GetParamInt("Decision", i);
iReferTo = m_InputContext.GetParamInt("ReferTo", i);
iSiteID = m_InputContext.GetParamInt("SiteID", i);
iAssetID = m_InputContext.GetParamInt("MediaAssetID", i);
if (!m_InputContext.GetParamString("MimeType", sMimeType, i))
{
sMimeType = "";
}
if (!m_InputContext.GetParamString("Notes", sNotes, i))
{
sNotes = "";
}
if (!m_InputContext.GetParamString("EmailType", sEmailType, i))
{
sEmailType = "None";
}
CTDVString sCustomText;
bool bSuccess = m_InputContext.GetParamString("CustomEmailText", sCustomText, i);
// do an update for this post only if we have all necessary data
if (iModID == 0 || iAssetID == 0 || ((iStatus == 4 || iStatus == 6) && sEmailType.CompareText("None")))
continue;
CTDVString sAuthorsEmail;
CTDVString sComplainantsEmail;
int IsLegacy = 0;
int iAuthorID = 0;
int iComplainantID = 0;
if ( moderate.Update(iModID, iSiteID, pViewer->GetUserID(), iStatus, iReferTo, sNotes, sAuthorsEmail, sComplainantsEmail, iAuthorID, iComplainantID) )
{
iProcessed++;
if ( !SendMailOrSystemMessage(iModID, iAssetID, iStatus, iSiteID, sNotes, sCustomText, sEmailType, sAuthorsEmail, sComplainantsEmail, iAuthorID, iComplainantID) )
{
pPage->AddInside("H2G2", GetLastErrorAsXMLString());
}
}
else
{
pPage->AddInside("H2G2", moderate.GetLastErrorAsXMLString());
}
bool bComplaint = false;
if (sComplainantsEmail.GetLength() > 0 || (m_InputContext.IsSystemMessagesOn(iSiteID) && iComplainantID > 0))
{
bComplaint = true;
}
if (iStatus == 3) //Pass - then allow the file to be seen by the world
{
if (!oMAModController.Approve(iAssetID, sMimeType, bComplaint))
{
//If something has gone wrong for this media asset
pPage->AddInside("H2G2", oMAModController.GetLastErrorAsXMLString());
continue;
}
}
else if (iStatus == 2) //Refer - then move the image to .mod on the ftp server (hide it)
{
if (!oMAModController.Requeue(iAssetID, sMimeType, bComplaint))
{
//If something has gone wrong for this media asset
pPage->AddInside("H2G2", oMAModController.GetLastErrorAsXMLString());
continue;
}
}
else if (iStatus == 4 || iStatus == 6) //Fail - then move the image to .fail on the ftp server (hide it)
{
if (!oMAModController.Reject(iAssetID, sMimeType, bComplaint))
{
//If something has gone wrong for this media asset
pPage->AddInside("H2G2", oMAModController.GetLastErrorAsXMLString());
continue;
}
}
if (bSuccess)
{
CTDVString sKeyPhrase;
CTDVString sKeyPhrasesToRemove="";
//Get all the phrases that have been ticked to be disassociated, the param is built from the
//index of the asset we are moderating (I add one as it is passed in as the xsl position() which starts from 1)
//and the name of the input field in the xsl
CTDVString sDisassociateListNumber = "DisassociateAssetPhrases" + CTDVString(i+1);
int iKeyPhrasesToRemove = m_InputContext.GetParamCount(sDisassociateListNumber);
for (int j = 0; j < iKeyPhrasesToRemove; j++)
{
m_InputContext.GetParamString(sDisassociateListNumber, sKeyPhrase, j);
sKeyPhrasesToRemove = sKeyPhrasesToRemove + sKeyPhrase + "|";
}
if (iKeyPhrasesToRemove > 0)
{
CTDVString delimit = m_InputContext.GetCurrentSiteOptionString("KeyPhrases","DelimiterToken");
CMediaAssetSearchPhrase oMediaAssetKeyPhrase(m_InputContext,delimit);
oMediaAssetKeyPhrase.RemoveKeyPhrasesFromAsset(iAssetID, sKeyPhrasesToRemove);
}
}
}
//Create some Feedback XML.
CTDVString sXML;
sXML << "<FEEDBACK PROCESSED='" << iProcessed << "'/>";
pPage->AddInside("H2G2",sXML);
return bSuccess;
}
bool CModerateMediaAssetsBuilder::SendEmail( int iModID, int iAssetID, int iStatus, int iSiteID, CTDVString sNotes, CTDVString sCustomText, CTDVString sEmailType, CTDVString sAuthorsEmail, CTDVString sComplainantsEmail)
{
CEmailTemplate Email(m_InputContext);
CTDVString sModeratorsEmail;
CTDVString sSiteShortName;
m_InputContext.GetEmail(EMAIL_MODERATORS, sModeratorsEmail, iSiteID);
m_InputContext.GetShortName(sSiteShortName, iSiteID);
bool bSuccess = true;
if ( (iStatus == 4 || iStatus == 6) && !sEmailType.CompareText("None"))
{
CTDVString sAuthorEmailSubject;
CTDVString sAuthorEmailText;
if (iStatus == 4)
{
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"ContentRemovedEmail", sAuthorEmailSubject, sAuthorEmailText);
}
else if (iStatus == 6)
{
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"ContentFailedAndEditedEmail", sAuthorEmailSubject, sAuthorEmailText);
}
// do any necessary translations
CTDVString sURL = "http://";
CTDVString sSiteRootURL;
// construct the URL for the post
m_InputContext.GetSiteRootURL(iSiteID,sSiteRootURL);
sURL << sSiteRootURL << "MediaAsset?id=" << iAssetID << "&action=view";
CStoredProcedure SP;
m_InputContext.InitialiseStoredProcedureObject(&SP);
if ( !SP.GetMediaAsset(iAssetID) )
{
CTDVString sErr = "Failed to retrieve details for media asset ";
sErr << iAssetID;
SetDNALastError("CModerateMediaAssetsBuilder::SendEmail","SendEmail",sErr);
return false;
}
CTDVString sDescription, sCaption;
SP.GetField("Description",sDescription);
SP.GetField("Caption",sCaption);
sAuthorEmailSubject.Replace("++**content_type**++", "Media Asset");
sAuthorEmailText.Replace("++**content_type**++", "Media Asset");
sAuthorEmailText.Replace("++**add_content_method**++", "resubmit");
sAuthorEmailText.Replace("++**content_url**++", sURL);
sAuthorEmailSubject.Replace("++**content_subject**++", sCaption);
sAuthorEmailText.Replace("++**content_subject**++", sCaption);
sAuthorEmailText.Replace("++**content_text**++", sDescription);
CXMLObject::UnEscapeXMLText(&sAuthorEmailSubject);
CXMLObject::UnEscapeXMLText(&sAuthorEmailText);
if (bSuccess)
{
//Do replacements.
if ( !sCustomText.IsEmpty() )
{
sAuthorEmailText.Replace("++**inserted_text**++", sCustomText);
}
else
{
CTDVString sInsertText;
bSuccess = bSuccess && Email.FetchInsertText(iSiteID,sEmailType, sInsertText);
CXMLObject::UnEscapeXMLText(&sInsertText);
sAuthorEmailText.Replace("++**inserted_text**++", sInsertText);
}
// then send the email
bSuccess = SendMail(sAuthorsEmail, sAuthorEmailSubject, sAuthorEmailText, sModeratorsEmail, sSiteShortName);
}
if(!bSuccess)
{
CTDVString sErrorXML = "Email failed to be sent to ";
sErrorXML << sAuthorsEmail;
SetDNALastError("CModerateMediaAssetsBuilder::SendEmail","SendEmail",sErrorXML);
}
}
// Send Email to complainant if complaint.
if (sComplainantsEmail.GetLength() > 0 && (iStatus == 3 || iStatus == 4 || iStatus == 6))
{
CTDVString sComplainantEmailSubject;
CTDVString sComplainantEmailText;
// get the appropriate email template depending on whether it is a pass or fail
if (iStatus == 3)
{
// pass => complaint was overruled
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"RejectComplaintEmail", sComplainantEmailSubject, sComplainantEmailText);
}
else if (iStatus == 4)
{
// fail => complaint was upheld
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"UpholdComplaintEmail", sComplainantEmailSubject, sComplainantEmailText);
}
else if (iStatus == 6)
{
// fail => complaint was upheld
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"UpholdComplaintEditEntryEmail", sComplainantEmailSubject,
sComplainantEmailText);
}
CXMLObject::UnEscapeXMLText(&sComplainantEmailSubject);
CXMLObject::UnEscapeXMLText(&sComplainantEmailText);
if ( bSuccess )
{
// do any necessary template substitutions
// => just putting in the complaint reference number currently
CTDVString sRefNumber = "MA";
sRefNumber << iModID;
sComplainantEmailSubject.Replace("++**reference_number**++", sRefNumber);
sComplainantEmailText.Replace("++**reference_number**++", sRefNumber);
// Allow rejected complaints to have some custom text
// For now re-using the 'CustomEmailText' field since it wouldn't have
// been used to send something to the author.
//
if (iStatus == 3)
{
sComplainantEmailText.Replace("++**inserted_text**++", sCustomText);
}
// send the email
bSuccess = bSuccess && SendMail(sComplainantsEmail,
sComplainantEmailSubject, sComplainantEmailText,
sModeratorsEmail, sSiteShortName);
}
if( !bSuccess )
{
CTDVString sErrorXML = "Email failed to be sent to complainant ";
sErrorXML << sComplainantsEmail;
SetDNALastError("CModerateMediaAssetsBuilder::SendEmail","SendEmail",sErrorXML);
}
}
return bSuccess;
}
bool CModerateMediaAssetsBuilder::SendMailOrSystemMessage( int iModID, int iAssetID, int iStatus, int iSiteID, CTDVString sNotes, CTDVString sCustomText, CTDVString sEmailType, CTDVString sAuthorsEmail, CTDVString sComplainantsEmail, int iAuthorID, int iComplainantID )
{
CEmailTemplate Email(m_InputContext);
CTDVString sModeratorsEmail;
CTDVString sSiteShortName;
m_InputContext.GetEmail(EMAIL_MODERATORS, sModeratorsEmail, iSiteID);
m_InputContext.GetShortName(sSiteShortName, iSiteID);
bool bSuccess = true;
if ( (iStatus == 4 || iStatus == 6) && !sEmailType.CompareText("None"))
{
CTDVString sAuthorEmailSubject;
CTDVString sAuthorEmailText;
if (iStatus == 4)
{
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"ContentRemovedEmail", sAuthorEmailSubject, sAuthorEmailText);
}
else if (iStatus == 6)
{
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"ContentFailedAndEditedEmail", sAuthorEmailSubject, sAuthorEmailText);
}
// do any necessary translations
CTDVString sURL = "http://";
CTDVString sSiteRootURL;
// construct the URL for the post
m_InputContext.GetSiteRootURL(iSiteID,sSiteRootURL);
sURL << sSiteRootURL << "MediaAsset?id=" << iAssetID << "&action=view";
CStoredProcedure SP;
m_InputContext.InitialiseStoredProcedureObject(&SP);
if ( !SP.GetMediaAsset(iAssetID) )
{
CTDVString sErr = "Failed to retrieve details for media asset ";
sErr << iAssetID;
SetDNALastError("CModerateMediaAssetsBuilder::SendEmail","SendEmail",sErr);
return false;
}
CTDVString sDescription, sCaption;
SP.GetField("Description",sDescription);
SP.GetField("Caption",sCaption);
sAuthorEmailSubject.Replace("++**content_type**++", "Media Asset");
sAuthorEmailText.Replace("++**content_type**++", "Media Asset");
sAuthorEmailText.Replace("++**add_content_method**++", "resubmit");
sAuthorEmailText.Replace("++**content_url**++", sURL);
sAuthorEmailSubject.Replace("++**content_subject**++", sCaption);
sAuthorEmailText.Replace("++**content_subject**++", sCaption);
sAuthorEmailText.Replace("++**content_text**++", sDescription);
CXMLObject::UnEscapeXMLText(&sAuthorEmailSubject);
CXMLObject::UnEscapeXMLText(&sAuthorEmailText);
if (bSuccess)
{
//Do replacements.
if ( !sCustomText.IsEmpty() )
{
sAuthorEmailText.Replace("++**inserted_text**++", sCustomText);
}
else
{
CTDVString sInsertText;
bSuccess = bSuccess && Email.FetchInsertText(iSiteID,sEmailType, sInsertText);
CXMLObject::UnEscapeXMLText(&sInsertText);
sAuthorEmailText.Replace("++**inserted_text**++", sInsertText);
}
// then send the message to the author
bSuccess = m_InputContext.SendMailOrSystemMessage(sAuthorsEmail, sAuthorEmailSubject, sAuthorEmailText, sModeratorsEmail, sSiteShortName, false, iAuthorID, iSiteID);
}
if(!bSuccess)
{
CTDVString sErrorXML = "Email failed to be sent to ";
sErrorXML << sAuthorsEmail;
SetDNALastError("CModerateMediaAssetsBuilder::SendEmail","SendEmail",sErrorXML);
}
}
// Send Email to complainant if complaint.
if ((sComplainantsEmail.GetLength() > 0 || (m_InputContext.IsSystemMessagesOn(iSiteID) && iComplainantID > 0)) && (iStatus == 3 || iStatus == 4 || iStatus == 6))
{
CTDVString sComplainantEmailSubject;
CTDVString sComplainantEmailText;
// get the appropriate email template depending on whether it is a pass or fail
if (iStatus == 3)
{
// pass => complaint was overruled
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"RejectComplaintEmail", sComplainantEmailSubject, sComplainantEmailText);
}
else if (iStatus == 4)
{
// fail => complaint was upheld
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"UpholdComplaintEmail", sComplainantEmailSubject, sComplainantEmailText);
}
else if (iStatus == 6)
{
// fail => complaint was upheld
bSuccess = bSuccess && Email.FetchEmailText(iSiteID,
"UpholdComplaintEditEntryEmail", sComplainantEmailSubject,
sComplainantEmailText);
}
CXMLObject::UnEscapeXMLText(&sComplainantEmailSubject);
CXMLObject::UnEscapeXMLText(&sComplainantEmailText);
if ( bSuccess )
{
// do any necessary template substitutions
// => just putting in the complaint reference number currently
CTDVString sRefNumber = "MA";
sRefNumber << iModID;
sComplainantEmailSubject.Replace("++**reference_number**++", sRefNumber);
sComplainantEmailText.Replace("++**reference_number**++", sRefNumber);
// Allow rejected complaints to have some custom text
// For now re-using the 'CustomEmailText' field since it wouldn't have
// been used to send something to the author.
//
if (iStatus == 3)
{
sComplainantEmailText.Replace("++**inserted_text**++", sCustomText);
}
// send the email
bSuccess = bSuccess && m_InputContext.SendMailOrSystemMessage(sComplainantsEmail,
sComplainantEmailSubject, sComplainantEmailText,
sModeratorsEmail, sSiteShortName, false, iComplainantID, iSiteID);
}
if( !bSuccess )
{
CTDVString sErrorXML = "Email failed to be sent to complainant ";
sErrorXML << sComplainantsEmail;
SetDNALastError("CModerateMediaAssetsBuilder::SendEmail","SendEmail",sErrorXML);
}
}
return bSuccess;
}
bool CModerateMediaAssets::GetAssets( int iUserID, bool bAlerts, bool bReferrals, bool bLockedItems, bool bHeldItems, int iShow )
{
bool bSuperUser = m_InputContext.GetCurrentUser() && m_InputContext.GetCurrentUser()->GetIsSuperuser();
//Get Posts for Moderation.
CStoredProcedure SP;
m_InputContext.InitialiseStoredProcedureObject(&SP);
SP.GetModerationMediaAssets( iUserID, bSuperUser, bAlerts, bReferrals, bHeldItems, bLockedItems );
CTDVString sXML;
InitialiseXMLBuilder(&sXML,&SP);
OpenXMLTag("MEDIAASSETMODERATION", true );
//These options are exclusive.
if ( bAlerts )
AddXMLIntAttribute("ALERTS",1, false);
else if ( bReferrals )
AddXMLIntAttribute("REFERRALS",1, false);
//May be combined with other options.
if ( bLockedItems )
AddXMLIntAttribute("LOCKEDITEMS",1, false);
AddXMLIntAttribute("COUNT", SP.IsEOF() ? 0 : SP.GetIntField("count"),true );
while (!SP.IsEOF())
{
OpenXMLTag("MEDIAASSET",true);
CTDVString sFTPPath;
int iMediaAssetID = SP.GetIntField("MediaAssetID");
AddXMLIntAttribute("ID", iMediaAssetID);
AddDBXMLIntAttribute("CONTENTTYPE", "ContentType", false, false);
AddDBXMLIntAttribute("ModID","MODERATION-ID",true,true);
AddDBXMLIntTag("modclassId");
CMediaAsset::GenerateFTPDirectoryString(iMediaAssetID, sFTPPath);
AddXMLTag("FTPPATH", sFTPPath);
AddDBXMLIntTag("siteid");
AddDBXMLTag("filename");
AddDBXMLTag("caption");
AddDBXMLTag("mimetype");
AddDBXMLTag("Description");
AddDBXMLIntTag("HIDDEN", NULL, false);
CTDVString sMediaAssetKeyPhrases;
CTDVString delimit = m_InputContext.GetCurrentSiteOptionString("KeyPhrases","DelimiterToken");
CMediaAssetSearchPhrase oMediaAssetSearchPhrase(m_InputContext,delimit);
oMediaAssetSearchPhrase.GetKeyPhrasesFromAsset(iMediaAssetID);
oMediaAssetSearchPhrase.GetAsString(sMediaAssetKeyPhrases);
AddXMLTag("", sMediaAssetKeyPhrases);
if ( bLockedItems )
{
OpenXMLTag("LOCKED");
AddDBXMLDateTag("DATELOCKED");
OpenXMLTag("USER");
AddDBXMLIntTag("LOCKEDBY","USERID");
AddDBXMLTag("LOCKEDNAME","USERNAME");
AddDBXMLTag("LOCKEDFIRSTNAMES", "FIRSTNAMES");
AddDBXMLTag("LOCKEDLASTNAME","LASTNAME");
AddDBXMLIntTag("STATUS");
CloseXMLTag("USER");
CloseXMLTag("LOCKED");
}
int iComplainantID;
CTDVString sComplainantName;
CTDVString sComplainantFirstNames;
CTDVString sComplainantLastName;
int iComplainantStatus;
CTDVString sComplaintText;
CTDVDateTime dDateSubmitted;
if ( bAlerts )
{
iComplainantID = SP.GetIntField("ComplainantId");
SP.GetField("ComplainantName",sComplainantName);
SP.GetField("ComplainantFirstNames",sComplainantFirstNames);
SP.GetField("ComplainantLastName", sComplainantLastName);
iComplainantStatus = SP.GetIntField("ComplainantStatus");
dDateSubmitted = SP.GetDateField("DateSubmitted");
SP.GetField("ComplaintText",sComplaintText);
}
int iReferrerID;
CTDVString sReferrerName;
CTDVString sReferrerFirstNames;
CTDVString sReferrerLastName;
int iReferrerStatus;
CTDVString sNotes;
CTDVDateTime dDateReferred;
if ( bReferrals )
{
iReferrerID = SP.GetIntField("ReferrerId");
SP.GetField("ReferrerName",sReferrerName);
SP.GetField("ReferrerFirstNames",sReferrerFirstNames);
SP.GetField("ReferrerLastName", sReferrerLastName);
iReferrerStatus = SP.GetIntField("ReferrerStatus");
SP.GetField("Notes",sNotes);
dDateReferred = SP.GetDateField("DateReferred");
}
bool bIsSiteEditor = SP.GetIntField("IsEditor") == 1;
std::set<CTDVString> complainantmembertags;
std::set<CTDVString> usermembertags;
if ( bIsSiteEditor || bSuperUser )
{
OpenXMLTag("USER");
AddDBXMLIntTag("USERID");
AddDBXMLTag("USERNAME");
AddDBXMLTag("FIRSTNAMES");
AddDBXMLTag("LASTNAME");
AddDBXMLIntTag("STATUS");
}
//Get Member Tags.
int iModID = SP.GetIntField("ModID");
while ( !SP.IsEOF() && (SP.GetIntField("ModID") == iModID) )
{
if ( !SP.IsNULL("UserMemberTag") )
{
CTDVString sUserMemberTag;
SP.GetField("UserMemberTag",sUserMemberTag);
if ( usermembertags.find(sUserMemberTag) == usermembertags.end() )
usermembertags.insert(sUserMemberTag);
}
if ( !SP.IsNULL("ComplainantMemberTag") )
{
CTDVString sComplainantMemberTag;
SP.GetField("ComplainantMemberTag",sComplainantMemberTag);
if ( complainantmembertags.find(sComplainantMemberTag) == complainantmembertags.end() )
complainantmembertags.insert(sComplainantMemberTag);
}
SP.MoveNext();
}
if ( !usermembertags.empty() )
{
OpenXMLTag("USERMEMBERTAGS");
for ( std::set<CTDVString>::iterator iter = usermembertags.begin(); iter != usermembertags.end(); ++iter )
AddXMLTag("USERMEMBERTAG",*iter);
CloseXMLTag("USERMEMBERTAGS");
}
if ( bIsSiteEditor || bSuperUser )
CloseXMLTag("USER");
//Create the XML from the gathered data.
if ( bAlerts )
{
OpenXMLTag("ALERT");
//User Details only shown for editors.
if ( bIsSiteEditor || bSuperUser )
{
OpenXMLTag("USER");
AddXMLIntTag("USERID",iComplainantID);
AddXMLTag("USERNAME",sComplainantName);
AddXMLTag("FIRSTNAMES", sComplainantFirstNames);
AddXMLTag("LASTNAME", sComplainantLastName);
AddXMLIntTag("STATUS",iComplainantStatus);
//Add the member tags.
if ( !complainantmembertags.empty() )
{
OpenXMLTag("USERMEMBERTAGS");
for ( std::set<CTDVString>::iterator iter = complainantmembertags.begin(); iter != complainantmembertags.end(); ++iter )
AddXMLTag("USERMEMBERTAG",*iter);
CloseXMLTag("USERMEMBERTAGS");
}
//DBAddTag("ComplainantMemberTag","MEMBERTAG",false);
CloseXMLTag("USER");
}
AddXMLTag("TEXT",sComplaintText);
AddXMLDateTag("DATEQUEUED",dDateSubmitted);
CloseXMLTag("ALERT");
}
if ( bReferrals )
{
OpenXMLTag("REFERRED");
//Only referrees / editors / superusers can see referred items - stored procedure checks permissions.
OpenXMLTag("USER");
AddXMLIntTag("USERID",iReferrerID);
AddXMLTag("USERNAME",sReferrerName);
AddXMLTag("FIRSTNAMES", sReferrerFirstNames);
AddXMLTag("LASTNAME", sReferrerLastName);
AddXMLIntTag("STATUS",iReferrerStatus);
CloseXMLTag("USER");
AddXMLTag("TEXT",sNotes);
AddXMLDateTag("DATEREFERRED",dDateReferred);
CloseXMLTag("REFERRED");
}
CloseXMLTag("MEDIAASSET");
}
CloseXMLTag("MEDIAASSETMODERATION");
return CreateFromXMLText(sXML);
}
bool CModerateMediaAssets::Update(int iModID, int iSiteID, int iUserID, int iStatus, int iReferTo, const CTDVString& sNotes, CTDVString& sAuthorsEmail, CTDVString& sComplainantsEmail, int& iAuthorID, int& iComplainantID)
{
bool bSuccess = true;
CStoredProcedure SP;
m_InputContext.InitialiseStoredProcedureObject(&SP);
if ( !SP.ModerateMediaAsset(iModID, iStatus, sNotes, iReferTo, iUserID) )
{
CTDVString sErr = "Unable to update Moderation Item ";
sErr << iModID;
CTDVString dberr;
int code;
SP.GetLastError(&dberr, code);
sErr << " - " << dberr;
SetDNALastError("CModerateAssets::Update","Update",sErr );
bSuccess = false;
}
//Output Params
bSuccess = bSuccess && SP.GetField("AuthorsEmail", sAuthorsEmail);
iAuthorID = SP.GetIntField("AuthorID");
bSuccess = bSuccess && SP.GetField("ComplainantsEmail", sComplainantsEmail);
iComplainantID = SP.GetIntField("ComplainantID");
return bSuccess;
}
bool CModerateMediaAssets::UpdateOnArticleModID(int iArticleModID, int iUserID, int iStatus, int iReferTo, const CTDVString& sNotes, CTDVString& sAuthorsEmail, CTDVString& sComplainantsEmail)
{
bool bSuccess = true;
CStoredProcedure SP;
m_InputContext.InitialiseStoredProcedureObject(&SP);
if (!SP.ModerateMediaAssetByArticleID(iArticleModID, iStatus, sNotes, iReferTo, iUserID))
{
bSuccess = false;
}
//sAuthorsEmail, sComplainantsEmail,
return bSuccess;
}
//#endif // _ADMIN_VERSION
|
5a9425f8468164e2fb3c953bef1b6858ecc0d52a
|
45716a35c9fa862145b20e68b47a3187bbfbfb81
|
/src/pks/test_pks/divgrad_test/divgrad_test_reg.hh
|
720ff92e3fb23bee16bc80f36d399104b7d44ac9
|
[
"BSD-3-Clause"
] |
permissive
|
ddwivedi08/ats
|
3c5f3e69797ddcd07110a4c80c47581034c28a2f
|
932aba910b977e86121942cd24f2059f0b6bee65
|
refs/heads/master
| 2021-01-19T14:53:40.104447
| 2017-04-06T01:16:22
| 2017-04-06T01:16:22
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 535
|
hh
|
divgrad_test_reg.hh
|
/* -*- mode: c++; c-default-style: "google"; indent-tabs-mode: nil -*- */
/* -------------------------------------------------------------------------
A high level test class for the MatrixMFD operator.
License: BSD
Authors: Ethan Coon (ATS version) (ecoon@lanl.gov)
------------------------------------------------------------------------- */
#include "divgrad_test.hh"
namespace Amanzi {
namespace TestPKs {
RegisteredPKFactory_ATS<DivGradTest> DivGradTest::reg_("div-grad operator test");
} // namespace
} // namespace
|
260b0ff558c851f774e471285ac63071d4fb6392
|
9997cb296b19a9ae3149484caa2290c26c1f030a
|
/boj/02501/02501.cpp14.cpp
|
f0c662ed59a89a1358020aea3c9a6e7a945833fb
|
[] |
no_license
|
pukuba/Algorithm
|
0eca36297a5a278e666cb2d851bd0a4c99e11357
|
ea71d0e21534a2a54626fc89da58e58ea8eb1791
|
refs/heads/master
| 2023-06-03T05:54:43.564074
| 2021-06-23T02:26:06
| 2021-06-23T02:26:06
| 317,562,256
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 257
|
cpp
|
02501.cpp14.cpp
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n,k,cnt=0;
scanf("%d %d",&n ,&k);
for(int i=1; i<=n; i++){
if(n%i==0){
cnt++;
if(cnt==k){
cout<<i<<'\n';
return 0;
}
}
}
cout<<"0"<<'\n';
}
|
a7fd2c877f95f6aa75ee4c3b11026343d4f44528
|
6cdf2f5570c35f723695a6aa9d28248b5b1823ec
|
/src/aadcBase/src/arduino/AADC_ArduinoSensors/cArduinoSensors.h
|
30f69ea5731cb4b68e2f01a5ca953cfe17658d77
|
[
"BSD-2-Clause"
] |
permissive
|
TeamAutonomousCarOffenburg/A2O_2015
|
24d92040c286c75345dd8353a50b3da19519ec55
|
19a2ac67d743ad23e5a259ca70aed6b3d1f2e3ac
|
refs/heads/master
| 2021-05-30T06:46:30.745077
| 2016-02-01T17:18:31
| 2016-02-01T17:18:31
| 42,807,199
| 1
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 13,779
|
h
|
cArduinoSensors.h
|
/**
Copyright (c)
Audi Autonomous Driving Cup. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software must display the following acknowledgement: “This product includes software developed by the Audi AG and its contributors for Audi Autonomous Driving Cup.”
4. Neither the name of Audi 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 AUDI AG 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 AUDI AG 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:: spiesra $ $Date:: 2015-05-20 10:31:32#$ $Rev:: 35239 $
**********************************************************************/
#ifndef _SENSOR_FILTER_H_
#define _SENSOR_FILTER_H_
#include "stdafx.h"
#define OID_ARDUINO_SENSORS_FILTER "adtf.aadc.arduinoSensors"
/*! /brief cArduinoSensors
* This filter receives all the media samples from the Arduino Communication Filter and sends them depending on their content (i.e. ID) to the different output pins. All outputs of all four Arduino Communication Filters communicating with the four different Arduinos mounted in the car should be connected with this filter to provide all sensor data on the output pins.
The samples on the pin Ultrasonic contain structs with all sensor data from all ultrasonic sensors up to the update time of the sample.
*/
class cArduinoSensors : public adtf::cFilter
{
ADTF_DECLARE_FILTER_VERSION(OID_ARDUINO_SENSORS_FILTER, "AADC Arduino Sensors", OBJCAT_SensorDevice, "Arduino Sensors", 1, 0,0, "BFFT");
protected:
/*! Output pin for the ultrasonic front left data */
cOutputPin m_oOutputUsFrontLeft;
/*! Output pin for the ultrasonic front center left data */
cOutputPin m_oOutputUsFrontCenterLeft;
/*! Output pin for the ultrasonic front center data */
cOutputPin m_oOutputUsFrontCenter;
/*! Output pin for the ultrasonic front center right data */
cOutputPin m_oOutputUsFrontCenterRight;
/*! Output pin for the ultrasonic front right data */
cOutputPin m_oOutputUsFrontRight;
/*! Output pin for the ultrasonic side left data */
cOutputPin m_oOutputUsSideLeft;
/*! Output pin for the ultrasonic side right data */
cOutputPin m_oOutputUsSideRight;
/*! Output pin for the ultrasonic rear left data */
cOutputPin m_oOutputUsRearLeft;
/*! Output pin for the ultrasonic rear center data */
cOutputPin m_oOutputUsRearCenter;
/*! Output pin for the ultrasonic rear right data */
cOutputPin m_oOutputUsRearRight;
/*! Output pin for the ultrasonic struct data */
cOutputPin m_oOutputUsStruct;
/*! Output pin for the voltage data of measurement circuit */
cOutputPin m_oOutputVoltMeas;
/*! Output pin for the voltage data of speed controller circuit */
cOutputPin m_oOutputVoltSpeedCtr;
/*! Output pin for the inertial measurement unit data */
cOutputPin m_oOutputInerMeasUnit;
/*! Output Pin for left wheel struct*/
cOutputPin m_oOutputWheelLeft;
/*! Output Pin for right wheel struct*/
cOutputPin m_oOutputWheelRight;
/*! input pin for data from arduino communications filter */
cInputPin m_oArduinoCOMInputPin;
/*! boolean which inidicates if debug outputs are plotted to the console */
tBool m_bDebugModeEnabled;
public:
cArduinoSensors(const tChar* __info);
virtual ~cArduinoSensors();
protected: // overwrites cFilter
tResult Init(tInitStage eStage, __exception = NULL);
tResult Start(__exception = NULL);
tResult Stop(__exception = NULL);
tResult Shutdown(tInitStage eStage, __exception = NULL);
tResult OnPinEvent(IPin* pSource, tInt nEventCode, tInt nParam1, tInt nParam2, IMediaSample* pMediaSample);
protected:
/*! splits the arduino gyro package and transmits new sample to the output pin
@param inputTimeStamp the timestamp of the incoming sample
@param arduinoTimestamp the timestamp from the arduino
@param frameData pointer to the data with the frame of the inertial measurement unit data
*/
tResult TransmitInerMeasUnitData(tTimeStamp inputTimeStamp, const tUInt32 ui32ArduinoTimestamp,const tUInt8* pFrameData);
/*! splits one of the arduino ultrasonic package and transmits new sample to the output pin
@param inputTimeStamp the timestamp of the incoming sample
@param arduinoTimestamp the timestamp from the arduino
@param frameData pointer to the data in the frame
@param usSensor the type of the ultrasonic sensor
*/
tResult TransmitUltrasonicData(tTimeStamp inputTimeStamp, const tUInt32 ui32ArduinoTimestamp,const tUInt8* pFrameData, SensorDefinition::ultrasonicSensor usSensor);
/*! transmits the ultrasonic data struct saved in m_ultrasonicDataStruct
*/
tResult TransmitUltrasonicStructData();
/*! splits one of the arduino wheel encoder data package and transmits new sample to the output pin
@param inputTimeStamp the timestamp of the incoming sample
@param arduinoTimestamp the timestamp from the arduino
@param frameData pointer to the data in the frame
@param wheelSensorType defines if left or right data is sent
*/
tResult TransmitWheelData(tTimeStamp inputTimeStamp, const tUInt32 ui32ArduinoTimestamp,const tUInt8* pFrameData, SensorDefinition::wheelSensor wheelSensorType);
/*! splits one of the arduino voltage data package and transmits new sample to the output pin
@param inputTimeStamp the timestamp of the incoming sample
@param arduinoTimestamp the timestamp from the arduino
@param frameData pointer to the data in the frame
@param voltageSensor the type of the voltage sensor
*/
tResult TransmitVoltData(tTimeStamp inputTimeStamp, const tUInt32 ui32ArduinoTimestamp,const tUInt8* pFrameData, SensorDefinition::voltageSensor voltageSensor);
/*! resolves the incoming mediasample and filters to the different transmit functions
@param pMediaSample incoming mediasample
*/
tResult Process_ArduinoCOMInputPin(IMediaSample *pMediaSample);
/*!< descriptor for wheelEncoderData*/
cObjectPtr<IMediaTypeDescription> m_pDescriptionWheelData;
/*! the id for the ui32WheelTach of the media description for output pin of the WheelData data */
tBufferID m_szIDWheelDataUi32WheelTach;
/*! the id for the i8WheelDir of the media description for output pin of the WheelData data */
tBufferID m_szIDWheelDataI8WheelDir;
/*! the id for the arduino time stamp of the media description for output pin of the WheelData data */
tBufferID m_szIDWheelDataArduinoTimestamp;
/*! indicates if bufferIDs were set */
tBool m_bIDsWheelDataSet;
/*! descriptor for input data from Arduino */
cObjectPtr<IMediaTypeDescription> m_pDescriptionArduinoData;
/*! the id for the ui8SOF of the media description of input pin for the arduino data */
tBufferID m_szIDArduinoUi8SOF;
/*! the id for the ui8ID of the media description of input pin for the arduino data */
tBufferID m_szIDArduinoUi8ID;
/*! the id for the ui32ArduinoTimestamp of the media description of input pin for the arduino data */
tBufferID m_szIDArduinoUi32ArduinoTimestamp;
/*! the id for the ui8DataLength of the media description of input pin for the arduino data */
tBufferID m_szIDArduinoUi8DataLength;
/*! the id for the arduino ui8Data of the media description for input pin for the measured speed */
tBufferID m_szIDArduinoUi8Data;
/*! indicates if bufferIDs were set */
tBool m_bIDsArduinoSet;
/*! descriptor for ultrasonic sensor data */
cObjectPtr<IMediaTypeDescription> m_pDescriptionUsData;
/*! the id for the f32value of the media description for output pin of the ultrasoncic data */
tBufferID m_szIDUltrasonicF32Value;
/*! the id for the arduino time stamp of the media description for output pin of the ultrasoncic data */
tBufferID m_szIDUltrasonicArduinoTimestamp;
/*! indicates if bufferIDs were set */
tBool m_bIDsUltrasonicSet;
/*! descriptor for ultrasonic sensor data */
cObjectPtr<IMediaTypeDescription> m_pDescriptionUsStructData;
/*! the id for the f32value of the media description for output pin of the ultrasoncic data */
tBufferID m_szIDUltrasonicStructFrontLeftF32Value;
/*! the id for the arduino time stamp of the media description for output pin of the ultrasoncic data */
tBufferID m_szIDUltrasonicStructFrontLeftArduinoTimestamp;
/*! indicates if bufferIDs were set */
tBool m_bIDsUltrasonicStructSet;
/*! descriptor for voltage sensor data */
cObjectPtr<IMediaTypeDescription> m_pDescriptionVoltData;
/*! the id for the f32value of the media description for output pin of the voltage data */
tBufferID m_szIDVoltageF32Value;
/*! the id for the arduino time stamp of the media description for output pin of the voltage data */
tBufferID m_szIDVoltageArduinoTimestamp;
/*! indicates if bufferIDs were set */
tBool m_bIDsVoltageSet;
/*! descriptor for intertial measurement unit sensor data */
cObjectPtr<IMediaTypeDescription> m_pDescriptionInerMeasUnitData;
/*! the id for the f32Q_w of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32Q_w;
/*! the id for the f32Q_x of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32Q_x;
/*! the id for the f32Q_y of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32Q_y;
/*! the id for the f32Q_z of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32Q_z;
/*! the id for the f32A_x of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32A_x;
/*! the id for the f32A_y of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32A_y;
/*! the id for the f32A_z of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitF32A_z;
/*! the id for the arduino time stamp of the media description for output pin of the imu data */
tBufferID m_szIDInerMeasUnitArduinoTimestamp;
/*! indicates if bufferIDs were set */
tBool m_bIDsInerMeasUnitSet;
/*! critical section for the processing of the wheel data samples because function can be called from different onPinEvents */
cCriticalSection m_oTransmitWheelDataCritSection;
/*! critical section for the processing of the ultrasonic data samples because function can be called from different onPinEvents */
cCriticalSection m_oTransmitUltraSonicDataCritSection;
/*! critical section for the processing of the ultrasonic data samples because function can be called from different threads */
cCriticalSection m_oProcess_ArduinoCOMCritSection;
/*! in this struct all the ultrasonic signals are collected and transmitted togeher */
tUltrasonicStruct m_ultrasonicDataStruct;
private:
/*! creates all the output pins for the filter
@param __exception exception pointer
*/
inline tResult CreateOutputPins(__exception = NULL);
/*! creates all the output pins for the filter
@param __exception exception pointer
*/
inline tResult CreateInputPins(__exception = NULL);
};
//*************************************************************************************************
#endif // _SENSOR_FILTER_H_
|
fef743fe5dc1b4709b2ff2e32a08ca674215bf8d
|
30799e01ce24e922ac7a810fefb37767e8bd3567
|
/HashTable.hpp
|
18d7e0636e3c204db1e4299351ebe6369e484b9b
|
[] |
no_license
|
vladimirantigua/MallocReplacement
|
02afc99aa3db8d93bb5b4136fe50104a770f1bf1
|
ee05b0227063198897743c3e54554aca604b23d3
|
refs/heads/main
| 2023-03-29T00:49:23.511400
| 2021-03-28T06:18:19
| 2021-03-28T06:18:19
| 352,256,093
| 0
| 1
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,334
|
hpp
|
HashTable.hpp
|
//
// HashTable.hpp
// WritingMallocReplacement
//
// Created by Vladimir Antigua on 3/17/21.
//
#ifndef HashTable_hpp
#define HashTable_hpp
#include <stdio.h>
class TableEntry {
public:
void* pointer;
size_t size;
int flag; // to indicate if the part of memory is free or not 0 means memory is available 1 means busy in use
//Constructor
TableEntry(void* pointer, size_t size){
this->pointer = pointer;
this->size =size;
flag = 0;
}
};
//define hashtable
class HashTable {
public:
HashTable(); // constructor
~HashTable(); // destructor
// hash table insert, delete
// Map<Key, Value>
void insert(void* pointer, size_t memorySize); // put a pointer and memory size
void remove(void* pointer); // define the pointer and delete directly
//to access the value value directly by using the pointer:
size_t get(void* pointer);
// keep track of the HashTable:
size_t getSize();
private:
TableEntry* table;
// to keep track of capasity and size
size_t capacity;
size_t size;
// if size is equal to the capacity increase the capasity of the table
void grow();
int hash(void* pointer); // we are hashing a pointer
};
#endif /* HashTable_hpp */
|
1de2256563dfa636839f72c7749a1e16e1d6e096
|
d86dee3a88a619603bd3b7ea265373d1f6fb71cc
|
/JOI/JOI16_selling_rna.cpp
|
6e287bf8fe89b261d54b165c40fea9967870fc8b
|
[] |
no_license
|
vzsky/submissions
|
17ca8b096450170cc077b70a9efb4c7d7e21479d
|
78211da43e9b51b98bb7f42a294330507af92a65
|
refs/heads/master
| 2023-04-02T03:44:04.193078
| 2021-04-19T05:57:52
| 2021-04-19T05:57:52
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 2,227
|
cpp
|
JOI16_selling_rna.cpp
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n,m,suf[N],ans[N];
pair<string,int> sx[N];
string s[N],t[N];
tuple<string,string,int> q[N];
tuple<int,int,int,int> qe[N];
int fw[N];
void update(int idx,int val){ if(!idx) return; while(idx<N) fw[idx]+=val,idx+=(idx & -idx); }
int read(int idx){ int val = 0; while(idx>0) val+=fw[idx],idx-=(idx & -idx); return val; }
string nxt(string s)
{
s[s.size()-1]++;
return s;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for(int i = 1;i <= n;i++) cin >> s[i],t[i] = s[i],reverse(t[i].begin(),t[i].end());
for(int i = 1;i <= m;i++)
{
string a,b;
cin >> a >> b;
q[i] = {a,b,i};
}
sort(s+1,s+n+1);
sort(t+1,t+n+1);
for(int i = 1;i <= n;i++) sx[i] = {s[i],i},reverse(sx[i].first.begin(),sx[i].first.end());
sort(sx+1,sx+n+1);
for(int i = 1;i <= n;i++) suf[sx[i].second] = i;
sort(q+1,q+m+1);
for(int i = 1;i <= m;i++)
{
auto [a,b,x] = q[i];
auto ix = lower_bound(s+1,s+n+1,a),iy = upper_bound(s+1,s+n+1,nxt(a));
reverse(b.begin(),b.end());
auto jx = lower_bound(t+1,t+n+1,b),jy = upper_bound(t+1,t+n+1,nxt(b));
qe[i] = {ix-s,iy-s,jx-t,jy-t};
}
// cout << endl;
// for(int i = 1;i <= n;i++) cout << i << ' ' << s[i] << endl;
// cout << endl;
//for(int i = 1;i <= n;i++) cout << i << ' ' << t[i] << endl;
//cout << endl;
for(int i = 1;i <= m;i++)
{
auto [s,t,x] = q[i];
auto [a,b,c,d] = qe[i];
// cout << s << ' ' << t << ' ' << x << endl;
// cout << a << ' ' << b << ' ' << c << ' ' << d << endl;
}
// cout << endl;
int l = 0,r = 1;
for(int i = 1;i <= m;i++)
{
auto [a,b,c,d] = qe[i];
// cout << l << ' ' << r << endl;
// cout << a << ' ' << b << ' ' << c << ' ' << d << endl;
while(r>=b) update(suf[--r],-1);
while(r<b) update(suf[r++],1);
while(l<a) update(suf[l++],-1);
//for(int j = 1;j <= n;j++) cout << read(j)-read(j-1) << ' ';
//cout << endl;
ans[get<2>(q[i])] = read(d-1)-read(c-1);
}
for(int i = 1;i <= m;i++) cout << ans[i] << '\n';
}
|
2ba63737aa3333d8e5fc6eb056aab99cd631bb3a
|
8b4c7652384e08b2ab0f41d4d0962c212a1e32aa
|
/static/areal/arithmetic/addition.cpp
|
89d9442e9e8de408e5b11f77a3563ebdbaf6df51
|
[
"MIT",
"LicenseRef-scancode-free-unknown",
"LGPL-3.0-only",
"LicenseRef-scancode-public-domain"
] |
permissive
|
stillwater-sc/universal
|
cd9e63d8672663de6716733c3a59c64f7a745e13
|
e0d76cdd1f901d3c779ef6c1e8adf8d323b4aa53
|
refs/heads/main
| 2023-08-21T14:53:02.747975
| 2023-08-08T16:14:14
| 2023-08-08T16:14:14
| 89,959,055
| 352
| 72
|
MIT
| 2023-09-07T21:23:58
| 2017-05-01T20:13:06
|
C++
|
UTF-8
|
C++
| false
| false
| 3,373
|
cpp
|
addition.cpp
|
// addition.cpp: test suite runner for addition on arbitrary reals
//
// Copyright (C) 2017-2022 Stillwater Supercomputing, Inc.
//
// This file is part of the universal numbers project, which is released under an MIT Open Source license.
#include <universal/utility/directives.hpp>
#include <universal/number/areal/areal.hpp>
#include <universal/verification/test_status.hpp>
#include <universal/verification/test_case.hpp>
#include <universal/verification/test_suite_arithmetic.hpp>
// Regression testing guards: typically set by the cmake configuration, but MANUAL_TESTING is an override
#define MANUAL_TESTING 1
// REGRESSION_LEVEL_OVERRIDE is set by the cmake file to drive a specific regression intensity
// It is the responsibility of the regression test to organize the tests in a quartile progression.
//#undef REGRESSION_LEVEL_OVERRIDE
#ifndef REGRESSION_LEVEL_OVERRIDE
#undef REGRESSION_LEVEL_1
#undef REGRESSION_LEVEL_2
#undef REGRESSION_LEVEL_3
#undef REGRESSION_LEVEL_4
#define REGRESSION_LEVEL_1 1
#define REGRESSION_LEVEL_2 1
#define REGRESSION_LEVEL_3 0
#define REGRESSION_LEVEL_4 0
#endif
int main()
try {
using namespace sw::universal;
std::string test_suite = "areal assignment";
std::string test_tag = "assignment";
bool reportTestCases = false;
int nrOfFailedTestCases = 0;
ReportTestSuiteHeader(test_suite, reportTestCases);
#if MANUAL_TESTING
// generate individual testcases to hand trace/debug
TestCase<areal<16, 8, uint8_t>, double>(TestCaseOperator::ADD, INFINITY, INFINITY);
TestCase<areal<8, 4, uint8_t>, float>(TestCaseOperator::ADD, 0.5f, -0.5f);
// manual exhaustive test
//nrOfFailedTestCases += ReportTestResult(VerifyAddition< areal<8, 2, uint8_t> >("Manual Testing", true), "areal<8,2,uint8_t>", "addition");
ReportTestSuiteResults(test_suite, nrOfFailedTestCases);
return EXIT_SUCCESS; // ignore errors
#else
#if REGRESSION_LEVEL_1
nrOfFailedTestCases += ReportTestResult(ValidateAddition<8, 2>(tag, bReportIndividualTestCases), "areal<8,2>", "addition");
nrOfFailedTestCases += ReportTestResult(ValidateAddition<8, 4>(tag, bReportIndividualTestCases), "areal<8,4>", "addition");
#endif
#if REGRESSION_LEVEL_2
nrOfFailedTestCases += ReportTestResult(ValidateAddition<10, 4>(tag, bReportIndividualTestCases), "areal<10,4>", "addition");
nrOfFailedTestCases += ReportTestResult(ValidateAddition<16, 8>(tag, bReportIndividualTestCases), "areal<16,8>", "addition");
#endif
#if REGRESSION_LEVEL_3
#endif
#if REGRESSION_LEVEL_4
#endif
ReportTestSuiteResults(test_suite, nrOfFailedTestCases);
return (nrOfFailedTestCases > 0 ? EXIT_FAILURE : EXIT_SUCCESS);
#endif // MANUAL_TESTING
}
catch (char const* msg) {
std::cerr << "Caught ad-hoc exception: " << msg << std::endl;
return EXIT_FAILURE;
}
catch (const sw::universal::universal_arithmetic_exception& err) {
std::cerr << "Caught unexpected universal arithmetic exception: " << err.what() << std::endl;
return EXIT_FAILURE;
}
catch (const sw::universal::universal_internal_exception& err) {
std::cerr << "Caught unexpected universal internal exception: " << err.what() << std::endl;
return EXIT_FAILURE;
}
catch (const std::runtime_error& err) {
std::cerr << "Caught unexpected runtime exception: " << err.what() << std::endl;
return EXIT_FAILURE;
}
catch (...) {
std::cerr << "Caught unknown exception" << '\n';
return EXIT_FAILURE;
}
|
1e1f823bf9863d6d111b357836647e6c2c3e8f23
|
2422071887f96c92ffb573b690cfa7f8ba60937c
|
/binding/libavutil_dict.inc
|
bc871ecefe99faa70fcf9f0b5160d24dbb8a71c3
|
[] |
no_license
|
GuvaCode/ffmpeg-fpc
|
c25349be11297ac69eb97794d4ba154a47f6a01f
|
c7a39368cfdb0316f7c43fc30bb2dfb24e2d698a
|
refs/heads/master
| 2021-01-20T13:03:56.329479
| 2017-08-26T12:18:04
| 2017-08-26T12:18:04
| 101,732,006
| 1
| 1
| null | 2017-08-29T07:21:32
| 2017-08-29T07:21:32
| null |
UTF-8
|
C++
| false
| false
| 8,606
|
inc
|
libavutil_dict.inc
|
//
// avutil.h header binding for the Free Pascal Compiler aka FPC
//
// Binaries and demos available at http://www.djmaster.com/
//
(*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with FFmpeg; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*)
(**
* @file
* Public dictionary API.
* @deprecated
* AVDictionary is provided for compatibility with libav. It is both in
* implementation as well as API inefficient. It does not scale and is
* extremely slow with large dictionaries.
* It is recommended that new code uses our tree container from tree.c/h
* where applicable, which uses AVL trees to achieve O(log n) performance.
*)
// #ifndef AVUTIL_DICT_H
// #define AVUTIL_DICT_H
#include <stdint.h>
#include "version.h"
(**
* @addtogroup lavu_dict AVDictionary
* @ingroup lavu_data
*
* @brief Simple key:value store
*
* @{
* Dictionaries are used for storing key:value pairs. To create
* an AVDictionary, simply pass an address of a NULL pointer to
* av_dict_set(). NULL can be used as an empty dictionary wherever
* a pointer to an AVDictionary is required.
* Use av_dict_get() to retrieve an entry or iterate over all
* entries and finally av_dict_free() to free the dictionary
* and all its contents.
*
@code
AVDictionary *d = NULL; // "create" an empty dictionary
AVDictionaryEntry *t = NULL;
av_dict_set(&d, "foo", "bar", 0); // add an entry
char *k = av_strdup("key"); // if your strings are already allocated,
char *v = av_strdup("value"); // you can avoid copying them like this
av_dict_set(&d, k, v, AV_DICT_DONT_STRDUP_KEY | AV_DICT_DONT_STRDUP_VAL);
while (t = av_dict_get(d, "", t, AV_DICT_IGNORE_SUFFIX)) {
<....> // iterate over all entries in d
}
av_dict_free(&d);
@endcode
*)
AV_DICT_MATCH_CASE = 1; (**< Only get an entry with exact-case key match. Only relevant in av_dict_get(). *)
AV_DICT_IGNORE_SUFFIX = 2; (**< Return first entry in a dictionary whose first part corresponds to the search key,
ignoring the suffix of the found key string. Only relevant in av_dict_get(). *)
AV_DICT_DONT_STRDUP_KEY = 4; (**< Take ownership of a key that's been
allocated with av_malloc() or another memory allocation function. *)
AV_DICT_DONT_STRDUP_VAL = 8; (**< Take ownership of a value that's been
allocated with av_malloc() or another memory allocation function. *)
AV_DICT_DONT_OVERWRITE = 16; ///< Don't overwrite existing entries.
AV_DICT_APPEND = 32; (**< If the entry already exists, append to it. Note that no
delimiter is added, the strings are simply concatenated. *)
AV_DICT_MULTIKEY = 64; (**< Allow to store several equal keys in the dictionary *)
typedef struct AVDictionaryEntry {
char *key;
char *value;
} AVDictionaryEntry;
typedef struct AVDictionary AVDictionary;
(**
* Get a dictionary entry with matching key.
*
* The returned entry key or value must not be changed, or it will
* cause undefined behavior.
*
* To iterate through all the dictionary entries, you can set the matching key
* to the null string "" and set the AV_DICT_IGNORE_SUFFIX flag.
*
* @param prev Set to the previous matching element to find the next.
* If set to NULL the first matching element is returned.
* @param key matching key
* @param flags a collection of AV_DICT_* flags controlling how the entry is retrieved
* @return found entry or NULL in case no matching entry was found in the dictionary
*)
AVDictionaryEntry *av_dict_get(const AVDictionary *m, const pchar key,
const AVDictionaryEntry *prev, int flags);
(**
* Get number of entries in dictionary.
*
* @param m dictionary
* @return number of entries in dictionary
*)
function cint av_dict_count(const AVDictionary *m);
(**
* Set the given entry in *pm, overwriting an existing entry.
*
* Note: If AV_DICT_DONT_STRDUP_KEY or AV_DICT_DONT_STRDUP_VAL is set,
* these arguments will be freed on error.
*
* Warning: Adding a new entry to a dictionary invalidates all existing entries
* previously returned with av_dict_get.
*
* @param pm pointer to a pointer to a dictionary struct. If *pm is NULL
* a dictionary struct is allocated and put in *pm.
* @param key entry key to add to *pm (will either be av_strduped or added as a new key depending on flags)
* @param value entry value to add to *pm (will be av_strduped or added as a new key depending on flags).
* Passing a NULL value will cause an existing entry to be deleted.
* @return >= 0 on success otherwise an error code <0
*)
function cint av_dict_set(AVDictionary **pm, const pchar key, const pchar value, int flags);
(**
* Convenience wrapper for av_dict_set that converts the value to a string
* and stores it.
*
* Note: If AV_DICT_DONT_STRDUP_KEY is set, key will be freed on error.
*)
function cint av_dict_set_int(AVDictionary **pm, const pchar key, int64_t value, int flags);
(**
* Parse the key/value pairs list and add the parsed entries to a dictionary.
*
* In case of failure, all the successfully set entries are stored in
* *pm. You may need to manually free the created dictionary.
*
* @param key_val_sep a 0-terminated list of characters used to separate
* key from value
* @param pairs_sep a 0-terminated list of characters used to separate
* two pairs from each other
* @param flags flags to use when adding to dictionary.
* AV_DICT_DONT_STRDUP_KEY and AV_DICT_DONT_STRDUP_VAL
* are ignored since the key/value tokens will always
* be duplicated.
* @return 0 on success, negative AVERROR code on failure
*)
function cint av_dict_parse_string(AVDictionary **pm, const pchar str,
const pchar key_val_sep, const pchar pairs_sep,
int flags);
(**
* Copy entries from one AVDictionary struct into another.
* @param dst pointer to a pointer to a AVDictionary struct. If *dst is NULL,
* this function will allocate a struct for you and put it in *dst
* @param src pointer to source AVDictionary struct
* @param flags flags to use when setting entries in *dst
* @note metadata is read using the AV_DICT_IGNORE_SUFFIX flag
* @return 0 on success, negative AVERROR code on failure. If dst was allocated
* by this function, callers should free the associated memory.
*)
function cint av_dict_copy(AVDictionary **dst, const AVDictionary *src, int flags);
(**
* Free all the memory allocated for an AVDictionary struct
* and all keys and values.
*)
procedure av_dict_free(AVDictionary **m);
(**
* Get dictionary entries as a string.
*
* Create a string containing dictionary's entries.
* Such string may be passed back to av_dict_parse_string().
* @note String is escaped with backslashes ('\').
*
* @param[in] m dictionary
* @param[out] buffer Pointer to buffer that will be allocated with string containg entries.
* Buffer must be freed by the caller when is no longer needed.
* @param[in] key_val_sep character used to separate key from value
* @param[in] pairs_sep character used to separate two pairs from each other
* @return >= 0 on success, negative on error
* @warning Separators cannot be neither '\\' nor '\0'. They also cannot be the same.
*)
function cint av_dict_get_string(const AVDictionary *m, char **buffer,
const char key_val_sep, const char pairs_sep);
(**
* @}
*)
// #endif (* AVUTIL_DICT_H *)
|
9bffca7c108fe4a1c4a986064e0bb65f88bcbdcf
|
522eb32044bd2dd01aea5e89e428da43ae901988
|
/vs3.cpp
|
350ac178c104c37547270c11d966d9186e3ac0d5
|
[] |
no_license
|
vikas0799/DSA-using-CPP
|
fb9328f248bff6b260fc22a11c7a6a2d1ee72cbe
|
a80585ca0725ff0e4325b1b3b90d8273521dd666
|
refs/heads/master
| 2023-07-10T09:18:19.928850
| 2021-08-18T23:14:22
| 2021-08-18T23:14:22
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 609
|
cpp
|
vs3.cpp
|
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long int T;cin>>T;
while(T--)
{ long long int n,k;cin>>n>>k;
long long int a[n];
for(long long int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
long long int flag=0,sum=0;int t=0;
for(long long int i=n-1;i>=0;i--)
{
sum=sum+a[i];
if(sum>=k&&t==0)
{sum=0;t++;}
flag++;
if(sum>=k&&t==1)
break;
}
if(sum<k)
cout<<-1<<endl;
else
cout<<flag<<endl;
}
return 0;
}
|
c5b84186c53090f97c745a2b23460f0456e0c9cd
|
575cc98c63c459db0806ea8a87f12a582c64c963
|
/leap_2.cpp
|
3a49ebca4ebfcee48c1d5e276d8ecd63dfee2cad
|
[] |
no_license
|
techrushu/cpp
|
eace02b9ddbe67b35c10dc7a03ad4165693f5550
|
6cf351eb33e87bcdf7f7998c903c7c838a4d8e1e
|
refs/heads/master
| 2020-04-28T00:19:14.852038
| 2019-03-10T12:10:48
| 2019-03-10T12:10:48
| 174,811,359
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 228
|
cpp
|
leap_2.cpp
|
#include<iostream>
using namespace std;
void check(int year)
{
if((year%4==0) && (year%100!=0))
{
cout<<year<<" is Leap Year ";
}
else
{
cout<<year<<" not Leap Year ";
}
}
int main()
{
check(1987);
}
|
2de32999c9b33204533ed15ae6c5b42e9c740dc3
|
669c3f287f7cc6839b2c1c50de47e9187f8b4487
|
/client/src/AIConsole.cpp
|
33c9812ec2f085f2437fc1f78cca3d0a6b93e35b
|
[] |
no_license
|
asheryi/Reversi
|
e5dbb38b09b76a32e79eafd7f26e3fdf6b5f8940
|
5dcb0e8eaa8cf04d9c7244d89ecd8b9aad2a8e7d
|
refs/heads/master
| 2021-09-04T12:29:32.552474
| 2018-01-18T17:56:26
| 2018-01-18T17:56:26
| 111,551,427
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 336
|
cpp
|
AIConsole.cpp
|
#include "../include/AIConsole.h"
using namespace std;
void AIConsole::show(const Board &board, const std::vector<Path *> &moves, const Color &currPlayerColor, bool passTurn,
int blacks,
int whites) const {
}
void AIConsole::showError(Error errorType) const {
}
AIConsole::AIConsole() {}
|
9822ae2e12b94b92cfd36f9339b3ceb845d093ad
|
851323a039cfe810cf0d30e8649447921db64115
|
/SourceGame/BossClaw.cpp
|
3d12855d1f154bcd5a256e30acd3d6c2998d5e5e
|
[] |
no_license
|
minhnhut568/SourceGame
|
e6b84839b62866f773fe735869cffd68edf09ae3
|
366fe01130003f44d1fb2f36e6d9226d9dd6a0bf
|
refs/heads/master
| 2023-02-23T14:08:19.785306
| 2021-01-23T01:35:51
| 2021-01-23T01:35:51
| 314,829,861
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 776
|
cpp
|
BossClaw.cpp
|
#include "BossClaw.h"
#include"SpriteManager.h"
#include"Boss.h"
#include"PlayerOverWorld.h"
#include"Scorebar.h"
#include<string>
BossClaw::BossClaw()
{
setSprite(SpriteManager::getInstance()->getSprite(SPRITE_INFO_BOSS_BODY));
setAnimation(0);
relativeX = 0;
relativeY = 0;
inmortal = true;
setDx(0);
setDy(0);
}
void BossClaw::onUpdate(float dt)
{
}
void BossClaw::render()
{
if (Boss::getInstance()->alive)
{
AriseBase::render();
}
}
void BossClaw::onAABBCheck(MovableRect* other)
{
auto player = PlayerOverWorld::getInstance();
if (Boss::getInstance()->alive && other == player)
{
if (!player->blinkDelay.isOnTime())
{
player->blinkDelay.start();
player->blinkCantControlDelay.start();
Scorebar::getInstance()->decreaseHealth(1);
}
}
}
|
9d049155dedea8ae634b9a00fef90cf6b85c4809
|
225792e3d31604ded3fc4d2686303bfb8acf4caa
|
/PixelsOSXBothTCP/src/ofApp.cpp
|
c179c13cf0ba65dee87f3f588f86a4784e0e0707
|
[] |
no_license
|
lvjh/iOSP2PVideoStreaming
|
3801a0c6791dae5933c80b13a71e8dede3896e6c
|
19ed6b19772c59a6c13dd9f17eceac2be13428a3
|
refs/heads/master
| 2021-01-20T21:53:39.219768
| 2014-03-06T06:18:29
| 2014-03-06T06:18:29
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,831
|
cpp
|
ofApp.cpp
|
#include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup(){
//ofSetFrameRate(30);
ofSetVerticalSync(true);
ofEnableAlphaBlending();
ofBackground(0);
//ofSetLogLevel(OF_LOG_VERBOSE);
// setup a standard video grabber
int width = 192;//320;
int height = 144;//240;
int port = 4321;
#ifdef IS_SERVER
// setup a TCP encoder server on seperate thread
server.setup(port,width,height);
video = new ofVideoGrabber();//AVFoundationVideoGrabber();
video->initGrabber(width, height);
ofLog() << video->getPixelFormat();
#else
client.setup("10.0.1.134", port, width, height);
//client.setup("127.0.0.1", port, width, height);
#endif
texture = new ofTexture();
texture->allocate(width, height, GL_RGB);
}
//--------------------------------------------------------------
void ofApp::update(){
#ifdef IS_SERVER
video->update();
if (video->isFrameNew() ){
// write the pixels for sending
server.writePixels(video->getPixels());//Ref());
// test view the compressed buffer
// only works if client is connected..
if(server.getNumClients() > 0) {
ofBuffer buffer = server.getBuffer();
ofLoadImage(*texture, buffer);
}
}
#else
client.readToTexture(texture);
#endif
}
//--------------------------------------------------------------
void ofApp::draw(){
ofSetColor(255);
#ifdef IS_SERVER
video->draw(0,0, 640, 480);
if(server.getNumClients() > 0) {
texture->draw(641, 0, 640, 480); // draw the compressed video as well
}
#else
texture->draw(0, 0, 640, 480);
#endif
stringstream output;
#ifdef IS_SERVER
output << "TCPPixelsEncoder OSX demo " << ofGetFrameRate() << endl;
// adding all these slows things down due to thread locks, comment out when not debugging
output << "connected: " << server.isConnected() << endl;
output << "clients: " << server.getNumClients() << endl;
output << "encoder processing time: " << server.getProcessingTime() << endl;
output << "buffer size: " << server.getBuffer().size() << endl;
output << "frames sent: " << server.getFramesSent() << endl;
#else
output << "TCPPixelsDecoder OSX demo " << ofGetFrameRate() << endl;
// adding all these slows things down due to thread locks, comment out when not debugging
output << "connected: " << client.isConnected() << endl;
output << "decoder processing time: " << client.getProcessingTime() << endl;
output << "buffer size: " << client.getReceivedSize() << endl;
output << "frames received " << client.getFramesReceived() << endl;
#endif
ofDrawBitmapStringHighlight(output.str(), 20, 20);
}
//--------------------------------------------------------------
void ofApp::keyPressed(int key){
}
//--------------------------------------------------------------
void ofApp::keyReleased(int key){
}
//--------------------------------------------------------------
void ofApp::mouseMoved(int x, int y ){
}
//--------------------------------------------------------------
void ofApp::mouseDragged(int x, int y, int button){
}
//--------------------------------------------------------------
void ofApp::mousePressed(int x, int y, int button){
}
//--------------------------------------------------------------
void ofApp::mouseReleased(int x, int y, int button){
}
//--------------------------------------------------------------
void ofApp::windowResized(int w, int h){
}
//--------------------------------------------------------------
void ofApp::gotMessage(ofMessage msg){
}
//--------------------------------------------------------------
void ofApp::dragEvent(ofDragInfo dragInfo){
}
|
2b3e00077e2e83e9d786be460fb5a068feb82369
|
66ceb72940737fdd9eabdbeb8f3bffc3538d4aab
|
/Diablo2/Act2.cpp
|
b1afbb99c3b74510a551eb50467811c3a617beba
|
[] |
no_license
|
bmjoy/diablo2-dx
|
d5678511f42ebc6e76c9e660776fdfb61aff556d
|
87ae6fea70e5b85fcdd53ad93c37f4557ac357c4
|
refs/heads/master
| 2022-11-21T14:30:02.334660
| 2020-07-24T07:55:58
| 2020-07-24T07:55:58
| 285,954,322
| 1
| 0
| null | 2020-08-08T01:56:43
| 2020-08-08T01:56:42
| null |
UHC
|
C++
| false
| false
| 8,198
|
cpp
|
Act2.cpp
|
#include "StdAfx.h"
#include "Act2.h"
#include "TextureMgr.h"
#include "Act2Proto.h"
#include "ObjMgr.h"
#include "StateMgr.h"
#include "KeyMgr.h"
CAct2::CAct2(void)
{
}
CAct2::~CAct2(void)
{
Release();
}
void CAct2::Initialize(void)
{
//Study #2
//시작할때마다 Instance를 날려버리기 때문에 기존에 저장된 m_MapObj이나 m_mapTex들은 죄다 날아간다
CObjMgr::GetInstance()->DestroyInstance();
CTextureMgr::GetInstance()->DestroyInstance();
m_pObjProto = new CAct2Proto;
//타일
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Tile/Tile0%d.png", TEXTYPE_MULTI, OBJECT_BACKGROUND, OBJECT_STATEID_BACKGROUND_TILE, TILENUM);
//오브젝트
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Object/%d.png", TEXTYPE_MULTI, OBJECT_BACKGROUND, OBJECT_STATEID_BACKGROUND_OBJECT, OBJNUM);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/1/01_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND1, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/2/02_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND2, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/3/03_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND3, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/4/04_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND4, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/5/05_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND5, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/6/06_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND6, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/7/07_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND7, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/8/08_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND8, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/9/09_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND9, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/10/10_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND10, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/11/11_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND11, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/12/12_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND12, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/13/13_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND13, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/14/14_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND14, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/15/15_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND15, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Stand/16/16_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_STAND16, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/1/01_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN1, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/2/02_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN2, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/3/03_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN3, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/4/04_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN4, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/5/05_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN5, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/6/06_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN6, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/7/07_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN7, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/8/08_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN8, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/9/09_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN9, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/10/10_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN10, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/11/11_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN11, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/12/12_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN12, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/13/13_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN13, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/14/14_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN14, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/15/15_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN15, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Run/16/16_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_RUN16, 8);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/1/01_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK1, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/2/02_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK2, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/3/03_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK3, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/4/04_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK4, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/5/05_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK5, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/6/06_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK6, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/7/07_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK7, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/8/08_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK8, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/9/09_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK9, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/10/10_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK10, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/11/11_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK11, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/12/12_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK12, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/13/13_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK13, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/14/14_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK14, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/15/15_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK15, 18);
CTextureMgr::GetInstance()->AddTexture(L"../Texture/Attack/16/16_f0%d.png", TEXTYPE_MULTI, OBJECT_PLAYER, OBJECT_STATEID_PLAYER_ATTACK16, 18);
CObjMgr::GetInstance()->AddObject(OBJECT_BACKGROUND, m_pObjProto);
CObjMgr::GetInstance()->AddObject(OBJECT_PLAYER, m_pObjProto);
}
void CAct2::Progress(void)
{
//나중에 포탈로 구현
//Player에 있는 key관리 함수에서 하려니깐 잘안되서 넘겨뻐림;;
if(PUSH_KEY(KEY_F1))
{
//플레이어 정보를 따로 저장하고 넘겨야한다
CStateMgr::GetInstance()->SetState(STATEID_ACT1);
return;
}
CObjMgr::GetInstance()->Progress();
}
void CAct2::Render(void)
{
CObjMgr::GetInstance()->Render();
}
void CAct2::Release(void)
{
SAFE_DELETE(m_pObjProto);
}
CStateObj* CAct2::Clone(void)
{
return new CAct2(*this);
}
|
aa1975180fb196408c4ba3977143a4bd7539bbd2
|
3c8cf4de6c08e21b2c10094ef20488e93d7a34be
|
/TktkGameProcessDxlibAppendLib/TktkAppendDxlib3DComponentLib/src/TktkAppendDxlib3DComponent/Graphics/ColliderWireFrameDrawer3D/ColliderWireFrameDrawer3DMaker.cpp
|
5903b6641e0268412e7615a8133a2dfa75027142
|
[] |
no_license
|
tktk2104/TktkLib
|
07762028c8a3a7378d7e82be8f1ed8c6a0cdc97c
|
2af549bfb8448ace9f9fee6c2225ea7d2e6329b8
|
refs/heads/master
| 2022-11-30T12:26:33.290941
| 2020-08-11T17:50:14
| 2020-08-11T17:50:14
| 213,307,835
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 869
|
cpp
|
ColliderWireFrameDrawer3DMaker.cpp
|
#include "TktkAppendDxlib3DComponent/Graphics/ColliderWireFrameDrawer3D/ColliderWireFrameDrawer3DMaker.h"
namespace tktk
{
ColliderWireFrameDrawer3DMaker ColliderWireFrameDrawer3DMaker::m_self;
ColliderWireFrameDrawer3DMaker & ColliderWireFrameDrawer3DMaker::makeStart(GameObjectPtr user)
{
m_self = ColliderWireFrameDrawer3DMaker();
m_self.m_user = user;
return m_self;
}
CfpPtr<ColliderWireFrameDrawer3D> ColliderWireFrameDrawer3DMaker::create()
{
return m_user->createComponent<ColliderWireFrameDrawer3D>(
m_drawPriority,
m_wireFrameColor
);
}
ColliderWireFrameDrawer3DMaker & ColliderWireFrameDrawer3DMaker::drawPriority(float value)
{
m_drawPriority = value;
return *this;
}
ColliderWireFrameDrawer3DMaker & ColliderWireFrameDrawer3DMaker::wireFrameColor(const Color & value)
{
m_wireFrameColor = value;
return *this;
}
}
|
ea230321c6f1c18e2a91cb994ef04c23ea607469
|
e7afa2b000ff1d17aee79af9d291284bec5fb911
|
/common/options.h
|
76e5eb9e3fbce0b7805e754a89a50160efb7af13
|
[] |
no_license
|
matze999/MathX
|
33be5eed0c9d01ace4c91ae56500945da48b8066
|
1eb74999391d420cae8cc84298d78baa4c246604
|
refs/heads/master
| 2020-04-09T11:12:30.527955
| 2015-01-02T09:35:18
| 2015-01-02T09:35:18
| 24,848,616
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,510
|
h
|
options.h
|
#ifndef __OPTIONS_
#define __OPTIONS_
#include "listing.h"
enum option_type
{
OPT_NOARG,
OPT_INTARG,
OPT_STRARG
};
struct optionT
{
optionT () {}
optionT (char idx, option_type ty, char *desc, int val = 0)
{
id = idx;
type = ty;
description = desc;
value = val;
content = NULL;
}
bool isSet()
{
return value != 0;
}
char id;
option_type type;
const char *description;
int value;
const char *content;
};
template <int capacity = 20, int tag = 0>
class option_listT: public mgo::listingT <optionT, capacity, tag>
{
public:
option_listT () {}
option_listT (char opt_id, option_type type, char *desc, int val = 0)
: mgo::listingT <optionT, capacity, tag> (optionT (opt_id, type, desc, val)) {}
explicit
option_listT (char opt_id);
static
void readInput (int &argc, char *argv[]);
static
void display();
};
//*******************************************************************************
template <int capacity, int tag>
option_listT <capacity, tag>::option_listT (char opt_id)
{
while (id < length)
{
if (list[id].id == opt_id) break;
++id;
}
if (id == length) id = 0;
}
template <int capacity, int tag>
void option_listT <capacity, tag>::readInput (int &argc, char *argv[])
{
int inpos = 1,
argpos = 1,
optpos = 0; // position of the option in the input string
char *token = NULL; // actual string in argv
for (;;)
{
if (token == NULL || *token == 0) /* read next program argument */
{
if (inpos == argc) break; /* all arguments readed */
token = argv[inpos++];
if (*token != '-') /* 'real' argument */
{
argv[argpos++] = token;
token = NULL;
continue;
}
++token;
}
// input options block found => search for a match with program options
option_listT option (*token);
if (option.isInitial()) /* option not found */
{
printf ("WARNING %s: Unknow option '%c'.\n", argv[0], *token++);
continue;
}
// program option (*token) found
++token;
if (option->type == OPT_INTARG || option->type == OPT_STRARG)
{
if (*token)
option->content = token;
else if (inpos < argc)
option->content = argv[inpos++];
else
{
printf ("ERROR %s: Option '%c' need an argument.\n", argv[0], token[-1]);
argc = argpos;
return;
}
token = NULL; /* process with new argument */
}
option->value = (option->type == OPT_INTARG? atoi(option->content): ++optpos);
} /* loop over all program arguments */
argc = argpos;
}
template <int capacity, int tag>
void option_listT <capacity, tag>::display ()
{
iterator option = begin(),
last = end();
while (option != last) /* loop over program options */
{
if (option->content)
printf (" -%c: %s [%d, %s]\n",
option->id, option->description, option->value, option->content);
else
printf (" -%c: %s [%d]\n",
option->id, option->description, option->value);
++option;
}
}
#endif // __OPTIONS_
|
17ebb7804511c904dc57ff515cb097fb1a8b304c
|
f511b387dc67727badf6007eed0c3da7f8a4d17c
|
/栈的压入弹出队列/源.cpp
|
993307ab87c9e35637a73b3a97af92cf4bef0283
|
[] |
no_license
|
wujiqiang11/offer
|
82875fe616552347e4b0d9e5fc5865c8ee63df31
|
a1f09f2b34a68d94d20a293aa7852696a98f53a8
|
refs/heads/master
| 2023-03-14T15:34:35.201004
| 2021-02-23T14:25:28
| 2021-02-23T14:25:28
| 331,807,634
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,918
|
cpp
|
源.cpp
|
#include<vector>
using namespace std;
class Solution {
public:
bool IsPopOrder(vector<int> pushV, vector<int> popV) {
vector<int> marker(pushV.size(), 1);
int p1;
int p2;
for (int i = 0; i < popV.size(); i++)
{
if (i == 0)
{
for (int j = 0; j < pushV.size(); j++)
{
if (pushV[j] == popV[i])
{
p1 = j;
p2 = j;
marker[j] = 0;
}
}
p1--;
p2++;
}
else
{
if (p1 >= 0)
{
if (popV[i] == pushV[p1])
{
p1--;
while (p1>=0)
{
if (marker[p1] == 0)
p1--;
else
break;
}
continue;
}
}
if (p2 < pushV.size())
{
while (p2 < pushV.size())
{
if (popV[i] == pushV[p2])
{
p1 = p2-1;
while (p1 >= 0)
{
if (marker[p1] == 0)
p1--;
else
break;
}
marker[p2] = 0;
p2++;
continue;
}
}
}
return false;
}
}
return true;
}
};
|
c96ad27407ceab0f6e78a52747fc01494d5b69ed
|
e475756f480200f344b05a984e0d1585d5a9f1cf
|
/stack.cpp
|
55db5ef205e84e6036b18e10e0afdac9a28825fb
|
[] |
no_license
|
ravindra1234567/DSA
|
54daf09c079298eef112d3290789c82f35d59658
|
3c4e03f011930679041a9162d37310ead011accd
|
refs/heads/master
| 2022-03-09T00:16:56.214496
| 2019-11-14T18:01:27
| 2019-11-14T18:01:27
| 221,757,650
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 686
|
cpp
|
stack.cpp
|
#include<stdio.h>
int s[10];
int max=10,top=-1;
void push()
{
int x;
if(top==max-1)
{
printf("Overflow");
}
else
{
printf("Enter value in a stack => ");
scanf("%d",&x);
top=top+1;
s[top]=x;
}
}
void pop()
{
int f;
if(top==-1)
{
printf("Underflow");
}
f=s[top];
top=top-1;
printf("\npoped value of stack => %d\n ",f);
}
void display()
{
int z=top;
if(z==-1)
{
printf("Underflow");
}
else
{
while(z > -1)
{
printf("\n%d",s[z]);
z--;
}
}
}
int main()
{
push();
push();
push();
push();
push();
push();
push();
push();
printf("\nValue from stack");
display();
printf("\n Result pop value");
pop();
pop();
pop();
pop();
printf(" \n Remainder value of in stack \n");
display();
return 0;
}
|
34d8770ba3553171d1c79bfb9fdf2e83af2b76d4
|
810b26019957e90a09325e47fe6fea47c18c2123
|
/WinMine.cpp
|
c8e7811ac8e75ea564a9dd23e388f84725f69fc9
|
[] |
no_license
|
evenharder/minesweeper
|
34f020f343b8eb64cf35be0f54e07361d26c95bc
|
b7faaf1ffa25009416b3ad3b1758f60eb3627f9b
|
refs/heads/master
| 2016-09-06T15:51:58.903169
| 2015-06-10T17:22:11
| 2015-06-10T17:22:11
| 37,210,343
| 1
| 1
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 18,168
|
cpp
|
WinMine.cpp
|
// - - - - - - - - - - - - - - - - - - - //
// W I N M I N E //
// - - - - - - - - - - - - - - - - - - - //
// array[y][x]...... //
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <windows.h>
// - - - - - - - - - - - - - - - - - - - //
#define col GetStdHandle(STD_OUTPUT_HANDLE)
#define RED SetConsoleTextAttribute( col,0x000c );
#define BLUE SetConsoleTextAttribute( col,0x0001 | 0x0008);
#define HIGH SetConsoleTextAttribute( col,0x00a);
#define WHITE SetConsoleTextAttribute( col,0x000f);
#define SKY SetConsoleTextAttribute( col, 0x000b);
#define YEL SetConsoleTextAttribute( col, 0x000e);
#define FLUOR SetConsoleTextAttribute( col, 0x000d);
#define VIO SetConsoleTextAttribute( col,0x0001 | 0x0008 |0x000c);
#define BCK SetConsoleTextAttribute( col,0x0000);
#define GRAY SetConsoleTextAttribute( col,0x0008);
#define WHT SetConsoleTextAttribute( col,0x000F);
#define HIGHGRAY SetConsoleTextAttribute( col,0x00a | 0x0000);
// - - - - - - - - - - - - - - - - - - - //
#define ScreenX 70 // Screen Width
#define ScreenY 41 // Screen Height
#define LEFT 75
#define RIGHT 77
#define UP 72
#define DOWN 80
#define ENTER 13
#define ESC 27
#define SPACE 32
#define SHIFT 15
// - - - - - - - - - - - - - - - - - - - //
typedef enum { NOCURSOR, SOLIDCURSOR, NORMALCURSOR } CURSOR_TYPE;
int Field[40][40];
int ShownField[40][40];
int Flag[40][40];
int Search[40][40];
int Wrong[40][40];
int FieldX;
int FieldY;
int Diff=1;
int Flag_Amount;
int Mine_Amount;
int Space_Left;
int real_p=1;
int game_over;
int Wrong_guess;
// - - - - - - - - - - - - - - - - - - - //
void setcursortype(CURSOR_TYPE c);
void gotoxy(int x, int y);
void Arrayprint(char a[], int x, int y, int delay);
void EmptyArray();
void random();
void DrawScreenEdge();
void Intro();
void clrscr();
void Difficulty();
void NumberField();
//void ShowMine();
void DrawMineEdge();
void PrintField();
void Move();
void rerandom(int y, int x);
void RevealValue(int y, int x);
void Expand0(int y, int x);
void PlayAgain();
// - - - - - - - - - - - - - - - - - - - //
int main()
{
setcursortype(NOCURSOR);
DrawScreenEdge();
Intro();
while(real_p)
{
clrscr();
Difficulty();
clrscr();
EmptyArray();
random();
NumberField();
//ShowMine();
DrawMineEdge();
Move();
PlayAgain();
}
gotoxy(0,ScreenY);
}
// - - - - - - - - - - - - - - - - - - - //
void setcursortype(CURSOR_TYPE c)
{
CONSOLE_CURSOR_INFO CurInfo;
switch (c)
{
case NOCURSOR:
CurInfo.dwSize=1;
CurInfo.bVisible=FALSE;
break;
case SOLIDCURSOR:
CurInfo.dwSize=100;
CurInfo.bVisible=TRUE;
break;
case NORMALCURSOR:
CurInfo.dwSize=20;
CurInfo.bVisible=TRUE;
break;
}
SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE),&CurInfo);
}
void gotoxy(int x,int y)
{
COORD Cur;
Cur.Y=y;
Cur.X=x;
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),Cur);
}
void Arrayprint(char a[],int x,int y,int delay)
{
int i,l;
l=strlen(a);
for(i=x;i<x+l;i++)
{
gotoxy(i,y);
printf("%c",a[i-x]);
Sleep(delay); //windows.h
}
}
void EmptyArray()
{
for(int i=0;i<40;i++)
{
for(int j=0;j<40;j++)
{
Flag[i][j]=0;
ShownField[i][j]=0;
Field[i][j]=0;
Search[i][j]=0;
Wrong[i][j]=0;
}
}
}
void random()
{
int i=0;
srand((unsigned)time(NULL));
while(Mine_Amount!=i)
{
reshuffle:
int randx=rand()%FieldX+1;
int randy=rand()%FieldY+1;
if(Field[randy][randx])
{
goto reshuffle;
}
else
{
Field[randy][randx]='*';
i++;
}
}
}
void ColorNumber(int x)
{
SetConsoleTextAttribute(col,x-48);
printf("%d ",x-48);
}
void DrawScreenEdge()
{
int i;
for(i=0;i<ScreenX;i++)
{
gotoxy(i,0);
putch('+');
}
for(i=1;i<ScreenX;i++)
{
gotoxy(i,5);
putch('-');
}
for(i=0;i<ScreenY;i++)
{
gotoxy(ScreenX,i);
putch('+');
}
for(i=ScreenX;i>0;i--)
{
gotoxy(i,ScreenY);
putch('+');
}
for(i=ScreenY;i>0;i--)
{
gotoxy(0,i);
putch('+');
}
WHT;
gotoxy(8,ScreenY-3);
printf("Move :");
SKY;
printf(" Arrow Keys ");
WHT;
printf(" Reveal :");
YEL;
printf(" Enter Key ");
WHT;
printf(" Flag :");
VIO;
printf(" Space Key");
WHT;
gotoxy(0,ScreenY);
}
void Intro()
{
SKY;
char game_name[25]={'W','I','N','M','I','N','E',' ','C','M','D',' ','V','e','r','.'};
Arrayprint(game_name,10,2,30);
YEL;
char programmed_by[30]={'P','r','o','g','r','a','m','m','e','d',' ','b','y',' '};
Arrayprint(programmed_by,40,2,30);
HIGH;
char evenharder[12]={'E','v','e','n','h','a','r','d','e','r','.'};
//char seungwonpark[14]={'S','e','u','n','g','w','o','n','P','a','r','k'};
Arrayprint(evenharder,54,2,40);
WHT;
Sleep(200);
}
void Difficulty()
{
int ch;
char selectdiff[25]={'S','e','l','e','c','t',' ','t','h','e',' ','d','i','f','f','i','c','u','l','t','y','.'};
Arrayprint(selectdiff,23,8,40);
YEL;
gotoxy(30,16);
printf("Tiny");
gotoxy(28,16);
printf("-");
WHT;
gotoxy(30,18);
printf("Small");
gotoxy(30,20);
printf("Large");
Diff=1;
while(ch!=ENTER)
{
gotoxy(30,25);
ch=getch();
if(ch==0xE0 || ch==0)
{
ch=getch();
if(Diff==1 && ch==DOWN)
{
Diff++;
YEL;
gotoxy(28,16);
putch(' ');
gotoxy(30,18);
printf("Small");
gotoxy(28,18);
putch('-');
WHT;
gotoxy(30,16);
printf("Tiny");
}
else if(Diff==2 && ch==UP)
{
Diff--;
YEL;
gotoxy(28,18);
putch(' ');
gotoxy(30,16);
printf("Tiny");
gotoxy(28,16);
putch('-');
WHT;
gotoxy(30,18);
printf("Small");
}
else if(Diff==2 && ch==DOWN)
{
Diff++;
YEL;
gotoxy(28,18);
putch(' ');
gotoxy(30,20);
printf("Large");
gotoxy(28,20);
putch('-');
WHT;
gotoxy(30,18);
printf("Small");
}
else if(Diff==3 && ch==UP)
{
Diff--;
YEL;
gotoxy(28,20);
putch(' ');
gotoxy(30,18);
printf("Small");
gotoxy(28,18);
putch('-');
WHT;
gotoxy(30,20);
printf("Large");
}
}
else if(ch==ESC) {gotoxy(0,ScreenY); exit(1);}
}
VIO;
if(Diff==1)
{
FieldX=9;
FieldY=9;
Mine_Amount=10;
char tiny[8]{'T','i','n','y','.'};
Arrayprint(tiny,30,25,40);
}
else if(Diff==2)
{
FieldX=16;
FieldY=16;
Mine_Amount=40;
char small[8]{'S','m','a','l','l','.'};
Arrayprint(small,30,25,40);
}
else //(Diff==3)
{
FieldX=30;
FieldY=16;
Mine_Amount=99;
char large[8]{'L','a','r','g','e','.'};
Arrayprint(large,30,25,40);
}
Space_Left=FieldX*FieldY;
WHT;
Sleep(350);
gotoxy(0,ScreenY);
}
void clrscr()
{
int i,j;
for(i=1;i<ScreenX;i++)
{
gotoxy(i,4);
putch(' ');
for(j=6;j<ScreenY-3;j++)
{
gotoxy(i,j);
putch(' ');
}
}
gotoxy(0,ScreenY);
}
void DrawMineEdge()
{
int i;
GRAY;
for(i=35-FieldX-2;i<35+FieldX+1;i++)
{
gotoxy(i,8);
putch('+');
}
for(i=8;i<12+FieldY;i++)
{
gotoxy(35+FieldX+1,i);
putch('+');
}
for(i=35+FieldX+1;i>35-FieldX-2;i--)
{
gotoxy(i,12+FieldY);
putch('+');
}
for(i=12+FieldY;i>8;i--)
{
gotoxy(35-FieldX-2,i);
putch('+');
}
WHT;
gotoxy(0,ScreenY);
}
void PrintField() //For Dubugging
{
for(int i=1;i<=FieldY;i++)
{
gotoxy(35-FieldX,i+10);
for(int j=1;j<=FieldX;j++)
{
if(Field[i][j]=='*')
{
if(Flag[i][j])
{
VIO;
printf("> ");
}
else
{
GRAY;printf("%c ",Field[i][j]);WHT;
}
}
else if(Flag[i][j]){RED;printf("><");WHT;}
else if((Field[i][j]!=48)&&Field[i][j])ColorNumber(Field[i][j]);
else printf(" ");
}
}
}
void NumberField()
{
for(int i=1;i<=FieldY;i++)
{
for(int j=1;j<=FieldX;j++)
{
int Near_Mine=0;
if(Field[i][j]!='*')
{
if(Field[i-1][j-1]=='*') Near_Mine++;
if(Field[i-1][j]=='*') Near_Mine++;
if(Field[i-1][j+1]=='*') Near_Mine++;
if(Field[i][j+1]=='*') Near_Mine++;
if(Field[i+1][j+1]=='*') Near_Mine++;
if(Field[i+1][j]=='*') Near_Mine++;
if(Field[i+1][j-1]=='*') Near_Mine++;
if(Field[i][j-1]=='*') Near_Mine++;
Field[i][j]=Near_Mine+48;
}
}
}
}
void Expand0(int y, int x)
{
if((x>FieldX)||(x<1)||(y>FieldY)||(y<1)) {BCK;return;}
if(ShownField[y][x]==1) {BCK;return;}
else
{
if(Flag[y][x])
{
Wrong[y][x]=1;
Wrong_guess++;
BCK;
return;
}
if(Field[y][x]!='0')
{
gotoxy(33-FieldX+2*x,y+10);
ColorNumber(Field[y][x]);
Space_Left--;
ShownField[y][x]=1;
WHT;
}
else
{
BCK;
gotoxy(33-FieldX+2*x,y+10);
printf("[]");
Space_Left--;
ShownField[y][x]=1;
Expand0(y-1,x-1);
Expand0(y-1,x);
Expand0(y-1,x+1);
Expand0(y,x+1);
Expand0(y+1,x+1);
Expand0(y+1,x);
Expand0(y+1,x-1);
Expand0(y,x-1);
}
}
}
void PlayAgain()
{
int temp_play=1;
int ch;
char apply_limit[50]={'P','l','a','y',' ','a','g','a','i','n','?'};
FLUOR;
Arrayprint(apply_limit,28,30,50);
FLUOR;
gotoxy(33,32);
printf("YES");
gotoxy(31,32);
printf("\-");
WHT;
gotoxy(33,34);
printf("NO");
while(ch!=ENTER)
{
ch=getch();
if(ch==0xE0 || ch==0)
{
ch=getch();
if(temp_play==1 && ch==DOWN)
{
temp_play=0;
FLUOR;
gotoxy(31,34);
printf("\-");
gotoxy(33,34);
printf("NO");
WHT;
gotoxy(33,32);
printf("YES");
gotoxy(31,32);
putch(' ');
}
else if(temp_play==0 && ch==UP)
{
temp_play=1;
FLUOR;
gotoxy(31,32);
printf("\-");
gotoxy(33,32);
printf("YES");
WHT;
gotoxy(33,34);
printf("NO");
gotoxy(31,34);
putch(' ');
}
}
else if(ch==ESC) {gotoxy(0,ScreenY); exit(1);}
}
real_p=temp_play;
char game_end[25]={'C','l','o','s','i','n','g',' ','P','r','o','g','r','a','m','.','.','.','.','.','.'};
FLUOR;
if(real_p==0)
Arrayprint(game_end,25,36,50);
WHT;
Sleep(350);
}
void RevealValue(int y, int x)
{
if((x>FieldX)||(x<1)||(y>FieldY)||(y<1)||(Flag[y][x])) return;
if(ShownField[y][x]==0)
{
if(Field[y][x]=='*')
{
WHT;
if(game_over==0) PrintField();
HIGH;
if(Flag[y][x]==1)SKY;
gotoxy(33-FieldX+2*x,y+10);
printf("\* ");
gotoxy(30,4);
RED;
printf("GAME OVER");
WHT;
game_over++;
}
else if(Field[y][x]!='0')
{
HIGH;
gotoxy(33-FieldX+2*x,y+10);
ColorNumber(Field[y][x]);
ShownField[y][x]=1;
Space_Left--;
WHT;
if(Flag[y][x])
{
Flag[y][x]=0;
Flag_Amount--;
}
}
else
{
Expand0(y,x);
BCK;
gotoxy(33-FieldX+2*x,y+10);
printf("[]");
WHT;
}
}
else return;
}
void rerandom(int y, int x)
{
if(Field[y][x]=='*')
{
Field[y][x]=48;
if(Field[y-1][x-1]!='*') Field[y-1][x-1]--; else Field[y][x]++;
if(Field[y-1][x]!='*') Field[y-1][x]--; else Field[y][x]++;
if(Field[y-1][x+1]!='*') Field[y-1][x+1]--; else Field[y][x]++;
if(Field[y][x+1]!='*') Field[y][x+1]--; else Field[y][x]++;
if(Field[y+1][x+1]!='*') Field[y+1][x+1]--; else Field[y][x]++;
if(Field[y+1][x]!='*') Field[y+1][x]--; else Field[y][x]++;
if(Field[y+1][x-1]!='*') Field[y+1][x-1]--; else Field[y][x]++;
if(Field[y][x-1]!='*') Field[y][x-1]--; else Field[y][x]++;
again:
int randy=rand()%FieldY+1;
int randx=rand()%FieldX+1;
if(x==randx&&y==randy)
{
Field[randy][randx]=48;
goto again;
}
if(Field[randy][randx]=='*')
{
Field[randy][randx]=48;
goto again;
}
else
{
Field[randy][randx]='*';
randy--; randx--;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randx++;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randx++;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randy++;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randy++;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randx--;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randx--;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randy--;
if(Field[randy][randx]!='*') Field[randy][randx]++;
randx++;
}
}
}
void Move()
{
int x=1;
int y=1;
int pre_x=0;
int pre_y=0;
int pre_pre_x=-1;
int pre_pre_y=-1;
int try_=0;
int ch;
Flag_Amount=0;
game_over=0;
Wrong_guess=0;
{
for(int i=1;i<=FieldY;i++)
{
gotoxy(35-FieldX,i+10);
for(int j=1;j<=FieldX;j++)
{
printf("[]");
}
}
}
gotoxy(33-FieldX+2*x,y+10);
HIGH;
printf("[]");
WHT;
while(1)
{
fflush(stdin);
WHT;
gotoxy(2,4);
printf("Flag Left : %3d",Mine_Amount-Flag_Amount);
gotoxy(53,4);
printf("Space Left : ");
gotoxy(66,4);
printf("%3d",Space_Left-Mine_Amount);
gotoxy(33,9);
YEL;
printf("\^\-\^");
WHT;
while(ch!=ENTER)
{
ch=getch();
if(ch==0xE0 || ch==0)
{
ch=getch();
if(ch==LEFT)
{
if(x>1)
{
WHT;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
ColorNumber(Field[y][x]);
}
else
{
BCK;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
FLUOR;
printf("> ");
WHT;
}
else
{
printf("[]");
}
x--;
HIGH;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
printf("%c ",Field[y][x]);
}
else
{
HIGHGRAY;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
printf("> ");
WHT;
}
else
{
printf("[]");
}
}
}
else if(ch==RIGHT)
{
if(x<FieldX)
{
WHT;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
ColorNumber(Field[y][x]);
}
else
{
BCK;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
FLUOR;
printf("> ");
WHT;
}
else
{
printf("[]");
}
x++;
HIGH;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
printf("%c ",Field[y][x]);
}
else
{
HIGHGRAY;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
printf("> ");
WHT;
}
else
{
printf("[]");
}
}
}
else if(ch==UP)
{
if(y>1)
{
WHT;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
ColorNumber(Field[y][x]);
}
else
{
BCK;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
FLUOR;
printf("> ");
WHT;
}
else
{
printf("[]");
}
y--;
HIGH;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
printf("%c ",Field[y][x]);
}
else
{
HIGHGRAY;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
printf("> ");
WHT;
}
else
{
printf("[]");
}
}
}
else if(ch==DOWN)
{
if(y<FieldY)
{
WHT;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
ColorNumber(Field[y][x]);
}
else
{
BCK;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
FLUOR;
printf("> ");
WHT;
}
else
{
printf("[]");
}
y++;
HIGH;
gotoxy(33-FieldX+2*x,y+10);
if(ShownField[y][x])
{
if(Field[y][x]!='0')
{
printf("%c ",Field[y][x]);
}
else
{
HIGHGRAY;
printf("[]");
WHT;
}
}
else if(Flag[y][x])
{
printf("> ");
WHT;
}
else
{
printf("[]");
}
}
}
}
else if((ch==SPACE)&&ShownField[y][x]==0)
{
gotoxy(33-FieldX+2*x,y+10);
if(Flag[y][x]==0)
{
HIGH;
printf("> ");
WHT;
Flag[y][x]=1;
Flag_Amount++;
if(Field[y][x]=='*') Wrong[y][x]=1;
}
else
{
HIGH;
printf("[]");
Flag[y][x]=0;
WHT;
Flag_Amount--;
if(Field[y][x]=='*') Wrong[y][x]=0;
}
WHT;
gotoxy(2,4);
printf("Flag Left : %3d",Mine_Amount-Flag_Amount);
}
}
try_++;
if(try_==1)
{
rerandom(y,x);
}
if(Flag[y][x]==0)RevealValue(y,x);
if(ShownField[y][x]&&Field[y][x]!='0') //
{
int whether_open;
whether_open=Flag[y-1][x-1]+Flag[y-1][x]+Flag[y-1][x+1]+Flag[y][x+1]+Flag[y+1][x+1]+Flag[y+1][x]+Flag[y+1][x-1]+Flag[y][x-1];
if(whether_open==Field[y][x]-48)
{
if(!Flag[y-1][x-1])RevealValue(y-1,x-1);
if(!Flag[y-1][x])RevealValue(y-1,x);
if(!Flag[y-1][x+1])RevealValue(y-1,x+1);
if(!Flag[y][x+1])RevealValue(y,x+1);
if(!Flag[y+1][x+1])RevealValue(y+1,x+1);
if(!Flag[y+1][x])RevealValue(y+1,x);
if(!Flag[y+1][x-1])RevealValue(y+1,x-1);
if(!Flag[y][x-1])RevealValue(y,x-1);
}
}
if(Wrong_guess>=1)
{
PrintField();
gotoxy(30,4);
RED;
printf("GAME OVER");
game_over=1;
}
if(game_over>=1)
{
gotoxy(33,9);
YEL;
printf("x\_x");
goto end;
}
else if(Flag[y][x])
{
;
}
else if(Field[y][x]=='*')
{
;
}
else if(Field[y][x]!=48)
{
gotoxy(33-FieldX+2*x,y+10);
HIGH;
printf("%c ",Field[y][x]);
}
else
{
gotoxy(33-FieldX+2*x,y+10);
HIGH;
printf("[]");
}
if(Space_Left==Mine_Amount)
{
WHT;
gotoxy(2,4);
printf("Flag Left : 0");
gotoxy(53,4);
printf("Space Left : 0");
gotoxy(33,9);
YEL;
printf("\#\^\#");
HIGH;
gotoxy(25,4);
printf("Congratulations\!");
break;
}
ch=0;
}
end:
;
}
// - - - - - - - - - - - - - - - - - - - //
|
d3b48be9bd8e64ee7128d30cec19747c91e4f68d
|
c79ac2abb6b3720b4ef71a93e570cde91ef1a152
|
/libhoomd/data_structures/GPUBufferMapped.h
|
0fff0c5a08da1476854c1df2589a7f605d8b47a9
|
[] |
no_license
|
harperic/hoomd-blue
|
810590b817875ef6787b87c5d1896a7bc1fb0d29
|
bb901438c1249aa2de1e32a293818efeb23e8c86
|
refs/heads/master
| 2020-04-14T19:46:53.787982
| 2013-08-26T19:34:47
| 2013-08-26T19:34:47
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 6,429
|
h
|
GPUBufferMapped.h
|
/*
Highly Optimized Object-oriented Many-particle Dynamics -- Blue Edition
(HOOMD-blue) Open Source Software License Copyright 2008-2011 Ames Laboratory
Iowa State University and The Regents of the University of Michigan All rights
reserved.
HOOMD-blue may contain modifications ("Contributions") provided, and to which
copyright is held, by various Contributors who have granted The Regents of the
University of Michigan the right to modify and/or distribute such Contributions.
You may redistribute, use, and create derivate works of HOOMD-blue, in source
and binary forms, provided you abide by the following conditions:
* Redistributions of source code must retain the above copyright notice, this
list of conditions, and the following disclaimer both in the code and
prominently in any materials provided with the distribution.
* 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.
* All publications and presentations based on HOOMD-blue, including any reports
or published results obtained, in whole or in part, with HOOMD-blue, will
acknowledge its use according to the terms posted at the time of submission on:
http://codeblue.umich.edu/hoomd-blue/citations.html
* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:
http://codeblue.umich.edu/hoomd-blue/
* Apart from the above required attributions, neither the name of the copyright
holder nor the names of HOOMD-blue's contributors may be used to endorse or
promote products derived from this software without specific prior written
permission.
Disclaimer
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND/OR ANY
WARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// Maintainer: jglaser
/*! \file GPUBufferMapped.h
\brief Defines the GPUBufferMapped class
*/
#ifdef NVCC
#error This header cannot be compiled by nvcc
#endif
// this class is only available for GPU use
#ifdef ENABLE_CUDA
#ifndef __GPU_BUFFER_MAPPED_H__
#define __GPU_BUFFER_MAPPED_H__
#include "GPUArray.h"
#include <iostream>
#include <stdexcept>
//! Class for managing a buffer to copy data between the host and the GPU
/*! GPUBufferMapped is a class that manages a mapped pinned memory buffer.
It provides two methods to access the data: getHostPointer() returns a pointer to the host buffer,
and getDevicePointer() returns the pointer to the device memory. Data written to the host data
is automatically available on the device, and data written to the device buffer is seen on the host
after a call to getHostPointer().
The class is used for data that needs to be frequently exchanged between the GPU and the host.
Similar to GPUArray, it supports methods for resizing as well as 2D buffers.
\ingroup data_structs
*/
template<class T> class GPUBufferMapped : public GPUArray<T>
{
public:
//! Constructs a NULL GPUBufferMapped
GPUBufferMapped();
//! Constructs a GPUBufferMapped attached to a GPU
GPUBufferMapped(unsigned int num_elements, boost::shared_ptr<const ExecutionConfiguration> exec_conf);
//! Constructs a two-dimensional GPUBufferMapped
GPUBufferMapped(unsigned int width, unsigned int height, boost::shared_ptr<const ExecutionConfiguration> exec_conf);
//! Frees memory
~GPUBufferMapped() { }
//! Get a pointer to the data on the host
inline T* getHostPointer();
//! Get a pointer to the data on the host (const version)
inline const T* getHostPointer() const;
#ifdef ENABLE_CUDA
//! Get a pointer to the data on the device
T* getDevicePointer()
{
return this->d_data;
}
//! Get a pointer to the data on the device (const version)
const T* getDevicePointer() const
{
return this->d_data;
}
#endif
};
//******************************************
// GPUBufferMapped implementation
//*****************************************
//! empty constructor
template<class T> GPUBufferMapped<T>::GPUBufferMapped()
{
}
/*! \param width Number of columns
\param height Number of rows
\param exec_conf Shared pointer to the execution configuration for managing CUDA initialization and shutdown
*/
template<class T> GPUBufferMapped<T>::GPUBufferMapped(unsigned int width, unsigned int height, boost::shared_ptr<const ExecutionConfiguration> exec_conf) :
GPUArray<T>(width, height, exec_conf, true)
{
}
/*! \param num_elements Number of elements to allocate
\param exec_conf Shared pointer to the execution configuration for managing CUDA initialization and shutdown
*/
template<class T> GPUBufferMapped<T>::GPUBufferMapped(unsigned int num_elements, boost::shared_ptr<const ExecutionConfiguration> exec_conf) :
GPUArray<T>(num_elements, exec_conf, true)
{
}
template<class T> T* GPUBufferMapped<T>::getHostPointer()
{
#ifdef ENABLE_CUDA
if (this->m_exec_conf->isCUDAEnabled())
{
// synch to wait for kernels
cudaDeviceSynchronize();
}
#endif
// return pointer to data
return this->h_data;
}
/*! \returns Pointer to the host buffer (const version)
*/
template<class T> const T* GPUBufferMapped<T>::getHostPointer() const
{
#ifdef ENABLE_CUDA
if (this->m_exec_conf->isCUDAEnabled())
{
// synch to wait for kernels
cudaDeviceSynchronize();
}
#endif
// return pointer to data
return this->h_data;
}
#endif // __GPU_BUFFER_MAPPED_H__
#endif // ENABLE_CUDA
|
c81a6b8946509ca8f98f5eaaab56db5e189c7e98
|
9e81c76da4b51a9eb9f99c59e994afb89d7b5f10
|
/DrinkMixer.h
|
c2f6fbe8e04bc465795cf42be1b27e8417ed2fd4
|
[] |
no_license
|
harounhajem/ArduBarBotSlave
|
e466fc1de8410f62e32a3f5110f33ef7333bd29e
|
ca42ffcfc3a8ff4806da60f6e9b5b65f66be51f3
|
refs/heads/master
| 2021-01-17T14:03:49.387269
| 2017-06-04T10:27:55
| 2017-06-04T10:27:55
| 83,431,617
| 2
| 2
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 830
|
h
|
DrinkMixer.h
|
// DrinkMixer.h
#ifndef _DRINKMIXER_h
#define _DRINKMIXER_h
#if defined(ARDUINO) && ARDUINO >= 100
#include "arduino.h"
#include "Adafruit_NeoPixel.h"
#else
#include "WProgram.h"
#endif
class DrinkMixerClass
{
private:
int soleniod[8];
Adafruit_NeoPixel _strip = Adafruit_NeoPixel(16, 10, NEO_GRB + NEO_KHZ800);
int _airPump = 0;
int _motor = 0;
int _bottle1 = 0;
int _bottle2 = 0;
int _bottle3 = 0;
int _bottle4 = 0;
int _bottle5 = 0;
int _bottle6 = 0;
public:
void SetLiquidToStartPos();
void TurnOffAllRelays();
void CleanCenterTube();
void CleanAllTubes();
void RunDrinkOrder( int amountCentiliter, int bottleNr);
void init(int tmpairPump, int tmpmotor, int tmpbottle1, int tmpbottle2, int tmpbottle3, int tmpbottle4, int tmpbottle5, int tmpbottle6);
};
extern DrinkMixerClass DrinkMixer;
#endif
|
0da13206b987fbfcda5ed0dbcd342be412c2f613
|
747e2d79f77c64094de69df9128a4943c170d171
|
/Info/Info/Items/BagInfos.cpp
|
1db0054fb75010484088443efe9fcd5e26f057c8
|
[
"MIT"
] |
permissive
|
Teles1/LuniaAsio
|
8854b6d59e5b2622dec8eb0d74c4e4a6cafc76a1
|
62e404442cdb6e5523fc6e7a5b0f64a4471180ed
|
refs/heads/main
| 2023-06-14T00:39:11.740469
| 2021-07-05T23:29:44
| 2021-07-05T23:29:44
| 383,286,395
| 0
| 0
|
MIT
| 2021-07-05T23:29:45
| 2021-07-05T23:26:46
|
C++
|
UTF-8
|
C++
| false
| false
| 9,550
|
cpp
|
BagInfos.cpp
|
#include "BagInfos.h"
#include <Info/Info/Enchant/Enchant.h>
namespace Lunia {
namespace XRated {
namespace Database {
namespace Info {
void BagInfos::BagInfo::Serialize(Serializer::IStreamWriter& out) const
{
out.Begin(L"AllM::XRated::Database::Info::BagInfos::BagInfo");
out.Write(L"BagNumberRanges", BagNumberRanges);
out.Write(L"IsDefault", IsDefault);
}
void BagInfos::BagInfo::Deserialize(Serializer::IStreamReader& in)
{
in.Begin(L"AllM::XRated::Database::Info::BagInfos::BagInfo");
in.Read(L"BagNumberRanges", BagNumberRanges);
in.Read(L"IsDefault", IsDefault);
}
bool BagInfos::EqualBagType(BagInfos::BagType type, uint8 bagNumber)
{
BagIter it = inventoryBags.find(static_cast<int>(type));
if (it != inventoryBags.end())
{
for (size_t rangeIndex = 0; rangeIndex < it->second.size(); ++rangeIndex)
{
if (bagNumber >= it->second[rangeIndex].BagNumberRanges.first && bagNumber <= it->second[rangeIndex].BagNumberRanges.second)
{
return true;
}
}
}
return false;
}
bool BagInfos::EqualBankType(BagInfos::BagType type, uint8 bankBagNumber)
{
BagIter it = bankBags.find(static_cast<int>(type));
if (it != bankBags.end())
{
for (size_t rangeIndex = 0; rangeIndex < it->second.size(); ++rangeIndex)
{
if (bankBagNumber >= it->second[rangeIndex].BagNumberRanges.first && bankBagNumber <= it->second[rangeIndex].BagNumberRanges.second)
{
return true;
}
}
}
return false;
}
BagInfos::BagType BagInfos::GetBagType(uint8 bagNumber)
{
for (size_t i = 0; i < BagType::MaxCnt; ++i)
{
if (EqualBagType(static_cast<BagType>(i), bagNumber))
{
return static_cast<BagType>(i);
}
}
return BagInfos::Normal;
}
BagInfos::BagType BagInfos::GetBankType(uint8 bagNumber)
{
for (size_t i = 0; i < BagType::MaxCnt; ++i)
{
if (EqualBankType(static_cast<BagType>(i), bagNumber))
{
return static_cast<BagType>(i);
}
}
return BagInfos::Normal;
}
void BagInfos::GetBankNumbers(BagType type, std::vector<uint8>& banks)
{
banks.clear();
BagIter it = bankBags.find(static_cast<int>(type));
if (it != bankBags.end())
{
for (size_t Index = 0; Index < it->second.size(); ++Index)
{
for (size_t rangeIndex = it->second[Index].BagNumberRanges.first; rangeIndex <= it->second[Index].BagNumberRanges.second; ++rangeIndex)
{
banks.push_back((uint8)rangeIndex);
}
}
}
}
void BagInfos::GetBagNumbers(BagType type, std::vector<uint8>& bags)
{
bags.clear();
BagIter it = inventoryBags.find(static_cast<int>(type));
if (it != inventoryBags.end())
{
for (size_t Index = 0; Index < it->second.size(); ++Index)
{
for (size_t rangeIndex = it->second[Index].BagNumberRanges.first; rangeIndex <= it->second[Index].BagNumberRanges.second; ++rangeIndex)
{
bags.push_back((uint8)rangeIndex);
}
}
}
}
void BagInfos::GetDefaultBank(std::vector<uint8>& banks)
{
banks.clear();
for (BagIter it = bankBags.begin(), endIt = bankBags.end(); it != endIt; ++it)
{
for (size_t Index = 0; Index < it->second.size(); ++Index)
{
if (it->second[Index].IsDefault)
{
for (size_t rangeIndex = it->second[Index].BagNumberRanges.first; rangeIndex <= it->second[Index].BagNumberRanges.second; ++rangeIndex)
{
banks.push_back((uint8)rangeIndex);
}
}
}
}
}
void BagInfos::GetDefaultBag(std::vector<uint8>& bags)
{
bags.clear();
for (BagIter it = inventoryBags.begin(), endIt = inventoryBags.end(); it != endIt; ++it)
{
for (size_t Index = 0; Index < it->second.size(); ++Index)
{
if (it->second[Index].IsDefault)
{
for (size_t rangeIndex = it->second[Index].BagNumberRanges.first; rangeIndex <= it->second[Index].BagNumberRanges.second; ++rangeIndex)
{
bags.push_back((uint8)rangeIndex);
}
}
}
}
}
bool BagInfos::UsableItem(const BagType& type, const Database::Info::ItemInfo* info) {
switch (type) {
case BagType::Key:
{
if (info->MarketCategory == 404)
{
return true;
}
return false;
}
case BagType::Fame:
{
if (info->MarketCategory == 901)
{
return true;
}
return false;
}
case BagType::Cash:
{
if (info->Attributes.Attr & Database::Info::ItemInfo::ATTRIBUTES::CASH)
{
return true;
}
if (info->EquipParts >= XRated::Constants::EquipParts::CASH_WEAPON && info->EquipParts <= XRated::Constants::EquipParts::CASH_ETC2)
return true;
return false;
}
case BagType::Normal:
return true;
case BagType::Equip:
Enchant::IsEnchantable(info);
}
return false;
}
void BagInfos::Init(const bool& xml)
{
Load(xml);
}
void BagInfos::Load(bool xml)
{
if (xml == true)
{
Resource::SerializerStreamReader reader = Resource::ResourceSystemInstance().CreateSerializerXmlStreamReader(L"Database/Items/Bags/Bags.xml");
reader->Read(L"InventoryBags", inventoryBags);
reader->Read(L"BankBags", bankBags);
reader->Read(L"SwapEquipSetInfos", swapEquipSetInfos);
reader->Read(L"SwapCashSetInfos", swapCashSetInfos);
}
else
{
Resource::SerializerStreamReader reader = Resource::ResourceSystemInstance().CreateSerializerBinaryStreamReader(L"Database/Bags.b");
reader->Read(L"InventoryBags", inventoryBags);
reader->Read(L"BankBags", bankBags);
reader->Read(L"SwapEquipSetInfos", swapEquipSetInfos);
reader->Read(L"SwapCashSetInfos", swapCashSetInfos);
}
}
void BagInfos::Save(bool xml)
{
if (xml == true)
{
Resource::SerializerStreamWriter writer = Resource::ResourceSystemInstance().CreateSerializerXmlStreamWriter(L"Database/Items/Bags/Bags.xml");
writer->Write(L"InventoryBags", inventoryBags);
writer->Write(L"BankBags", bankBags);
writer->Write(L"SwapEquipSetInfos", swapEquipSetInfos);
writer->Write(L"SwapCashSetInfos", swapCashSetInfos);
}
else
{
Resource::SerializerStreamWriter writer = Resource::ResourceSystemInstance().CreateSerializerBinaryStreamWriter(L"Database/Bags.b");
writer->Write(L"InventoryBags", inventoryBags);
writer->Write(L"BankBags", bankBags);
writer->Write(L"SwapEquipSetInfos", swapEquipSetInfos);
writer->Write(L"SwapCashSetInfos", swapCashSetInfos);
}
}
uint8 BagInfos::SetIndexToBagNumber(uint8 setIndex)
{
SetIter it = std::find_if(swapEquipSetInfos.begin(), swapEquipSetInfos.end(), SwapSetInfo::FindByIndex(setIndex));
if (it != swapEquipSetInfos.end())
{
return it->BagNumber;
}
return 0;
}
uint8 BagInfos::BagNumberToSetIndex(uint8 bagNumber)
{
SetIter it = std::find_if(swapEquipSetInfos.begin(), swapEquipSetInfos.end(), SwapSetInfo::FindByBagNumber(bagNumber));
if (it != swapEquipSetInfos.end())
{
return it->SetIndex;
}
return 0;
}
std::wstring BagInfos::GetEquipSetName(uint8 setIndex)
{
SetIter it = std::find_if(swapEquipSetInfos.begin(), swapEquipSetInfos.end(), SwapSetInfo::FindByIndex(setIndex));
if (it != swapEquipSetInfos.end())
{
return it->EquipSetName;
}
return L"";
}
uint8 BagInfos::GetNextEquipIndex(uint8 setIndex)
{
std::vector< SwapSetInfo >::iterator it = std::find_if(swapEquipSetInfos.begin(), swapEquipSetInfos.end(), SwapSetInfo::FindByIndex(setIndex));
if (it != swapEquipSetInfos.end())
{
if (std::distance(swapEquipSetInfos.begin(), it) + 1 >= (__int64)swapEquipSetInfos.size())
{
return 0;
}
else
{
return (++it)->SetIndex;
}
}
return 0;
}
uint8 BagInfos::SetCashIndexToBagNumber(uint8 setIndex)
{
SetIter it = std::find_if(swapCashSetInfos.begin(), swapCashSetInfos.end(), SwapSetInfo::FindByIndex(setIndex));
if (it != swapCashSetInfos.end())
{
return it->BagNumber;
}
return 0;
}
uint8 BagInfos::BagNumberToSetCashIndex(uint8 bagNumber)
{
SetIter it = std::find_if(swapCashSetInfos.begin(), swapCashSetInfos.end(), SwapSetInfo::FindByBagNumber(bagNumber));
if (it != swapCashSetInfos.end())
{
return it->SetIndex;
}
return 0;
}
std::wstring BagInfos::GetCashEquipSetName(uint8 setIndex)
{
SetIter it = std::find_if(swapCashSetInfos.begin(), swapCashSetInfos.end(), SwapSetInfo::FindByIndex(setIndex));
if (it != swapCashSetInfos.end())
{
return it->EquipSetName;
}
return L"";
}
uint8 BagInfos::GetNextCashEquipIndex(uint8 setIndex)
{
std::vector< SwapSetInfo >::iterator it = std::find_if(swapCashSetInfos.begin(), swapCashSetInfos.end(), SwapSetInfo::FindByIndex(setIndex));
if (it != swapCashSetInfos.end())
{
if (std::distance(swapCashSetInfos.begin(), it) + 1 >= (__int64)swapCashSetInfos.size())
{
return 0;
}
else
{
return (++it)->SetIndex;
}
}
return 0;
}
}
}
}
}
|
a85df0ff8f3fb4de1664e5e46e699eb7841bc6cf
|
44c3c5749c039312e48c18217e84449506760910
|
/ForwardPlus-old/main.h
|
954bdebde214793701bd89f164ffa1d979b58af5
|
[] |
no_license
|
leothomas77/MATE20-Projetos
|
ceec536deced4ab32690feeeb24ab877e0c8c0c7
|
73eeaa2c93bc4df476e593c8e947d6d53b1dafcb
|
refs/heads/master
| 2021-05-11T21:31:49.344237
| 2018-06-27T00:04:21
| 2018-06-27T00:04:21
| 117,465,459
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 350
|
h
|
main.h
|
#ifndef MAIN_H 1
#include <glm/vec3.hpp>
#include <glm/vec4.hpp>
#include <assimp/cimport.h>
#include <assimp/scene.h>
#include <assimp/postprocess.h>
using namespace std;
static void loadMesh(char* filename, const aiScene* scene, aiVector3D scene_min, aiVector3D scene_max, aiVector3D scene_center);
void iniciaLuzes();
#endif // !MAIN_H 1
|
c0af6547cc8bba13f1be20fdfc822a695ab12157
|
4bfcb0d20707e600818fa3a95b503a6b8fe7a561
|
/Scratch3D/src/Defines.h
|
a2d2bdcb5be1b6ef5441b22d23f68ddf1d5a5fa7
|
[] |
no_license
|
Eearslya/Scratch3D
|
8623211a94a1206a33d52ffbf33c5c93378f0f96
|
6a8e065b462df9555e407361e8a4bec7c15ddd41
|
refs/heads/master
| 2022-11-19T02:47:26.332620
| 2020-07-07T23:51:22
| 2020-07-07T23:51:22
| 277,946,204
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,478
|
h
|
Defines.h
|
#pragma once
#define FORCEINLINE __forceinline
#define FORCENOINLINE _declspec(noinline)
#define ALIGN(n) __declspec(align(n))
#define WIN32_LEAN_AND_MEAN
#define NOMINMAX
#ifndef NO_ASSERT
#define ASSERT_ENABLE
#endif
#ifdef ASSERT_ENABLE
#include <iostream>
#if _MSC_VER
#include <intrin.h>
#define DebugBreak() __debugbreak();
#else
#define DebugBreak() __asm {int 3}
#endif
#define ASSERT_MSG(expr, msg) \
{ \
if (expr) { \
} else { \
AssertionFailure(#expr, msg, __FILE__, __LINE__); \
DebugBreak(); \
} \
}
#define ASSERT(expr) ASSERT_MSG(expr, "")
#ifdef _DEBUG
#define ASSERT_DEBUG(expr) ASSERT(expr)
#define ASSERT_DEBUG_MSG(expr, msg) ASSERT_MSG(expr, msg)
#else
#define ASSERT_DEBUG(expr)
#define ASSERT_DEBUG_MSG(expr, msg)
#endif
FORCEINLINE void AssertionFailure(const char* expression, const char* msg,
const char* file, int line) {
std::cerr << "Assertion Failure: " << expression << "\n";
std::cerr << " Message: " << msg << "\n";
std::cerr << " At: " << file << ":" << line << "\n";
}
#else
#define ASSERT(expr)
#define ASSERT_MSG(expr, msg)
#define ASSERT_DEBUG(expr)
#define ASSERT_DEBUG_MSG(expr, msg)
#endif
|
5232608e5890a67688c0a2f107d9a727e80ba460
|
4e8b7ab42953b43c263e0715b53e23e74b5b1a44
|
/src/tasklist.cpp
|
0e02283e8292db6bcda64d76d7a636aa4c00c35f
|
[] |
no_license
|
Kris1100/PlannerApplication
|
6ef1a0e52db45947f6516b83b96d111d305b0106
|
8dbd2245e8879ab7732ace6125df52a0ca589eae
|
refs/heads/master
| 2023-06-19T15:17:07.762527
| 2021-07-14T01:07:14
| 2021-07-14T01:07:14
| 383,720,949
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 4,315
|
cpp
|
tasklist.cpp
|
#include "tasklist.h"
#include <QVariant>
#include "datastorertask.h"
#include <QDebug>
TaskList::TaskList(QObject* parent) : QAbstractListModel(parent), m_tasks()
{
}
QHash<int, QByteArray> TaskList::roleNames() const {
QHash<int, QByteArray> roles;
roles[NameRole] = "name";
roles[TextRole] = "text";
roles[PlaceRole] = "place";
roles[TimeRole] = "time";
roles[ImportanceRole] = "importance";
roles[ParticipantsRole] = "participants";
roles[MoneyRole] = "money";
roles[CategoryRole]="category";
roles[Is_doRole]="is_do";
return roles;
}
QVariant TaskList::data(const QModelIndex &index, int role) const {
if(!index.isValid())
return QVariant();
auto filetedItemIndex = index.row();
auto realItemIndex = current_tasks[filetedItemIndex];
auto item = m_tasks[realItemIndex];
switch(role) {
case NameRole:
return QVariant(item.name);
case TextRole:
return QVariant(item.text);
case PlaceRole:
return QVariant(item.place);
case TimeRole:
return QVariant(item.time);
case ImportanceRole:
return QVariant(item.importance);
case ParticipantsRole:
return QVariant(item.participants);
case MoneyRole:
return QVariant(item.money);
case Is_doRole:
return QVariant(item.is_do);
default:
return QVariant();
}
}
void TaskList::addTask(QString name, QString text, QString place, QString time, QString importance, QString participants,
QString money, int category) {
m_tasks.append(Task(name, text,place,time,importance,participants,money, category));
auto tasksSize = current_tasks.size();
beginInsertRows(QModelIndex(), tasksSize, tasksSize);
current_tasks.append(m_tasks.size() - 1);
endInsertRows();
storeList();
}
void TaskList::edittask(int index, QString name, QString text, QString place, QString time, QString importance, QString participants,
QString money) {
m_tasks[current_tasks[index]].name=name;
m_tasks[current_tasks[index]].text=text;
m_tasks[current_tasks[index]].place=place;
m_tasks[current_tasks[index]].time=time;
m_tasks[current_tasks[index]].importance=importance;
m_tasks[current_tasks[index]].participants=participants;
m_tasks[current_tasks[index]].money=money;
beginInsertRows(QModelIndex(), index, index);
current_tasks.append(index);
endInsertRows();
beginRemoveRows(QModelIndex(), index+1, index+1);
endRemoveRows();
}
void TaskList::checkedtask(int index, bool is_do) {
m_tasks[current_tasks[index]].is_do=is_do;
beginInsertRows(QModelIndex(), index, index);
current_tasks.append(index);
endInsertRows();
beginRemoveRows(QModelIndex(), index+1, index+1);
endRemoveRows();
storeList();
}
void TaskList::readTemplates(QUrl file) {
beginResetModel();
fixed_tasks = DataStorerTask::readTemplates(file);
endResetModel();
}
void TaskList::readList() {
beginResetModel();
m_tasks = DataStorerTask::readDataTask();
endResetModel();
}
void TaskList::addFixed(int id, int category){
for (int i = 0; i < fixed_tasks.size(); i++){
if (fixed_tasks[i].category == id)
m_tasks.append(Task(fixed_tasks[i].name, fixed_tasks[i].text,fixed_tasks[i].place,fixed_tasks[i].time,fixed_tasks[i].importance,
fixed_tasks[i].participants,fixed_tasks[i].money, category));
}
}
void TaskList::readList(int id) {
beginResetModel();
current_tasks.erase(current_tasks.begin(), current_tasks.end());
for (int i=0;i<m_tasks.size();i++){
if (m_tasks[i].category == id) current_tasks.append(i);
}
endResetModel();
}
void TaskList::deleteTask(int index) {
beginRemoveRows(QModelIndex(), index, index);
m_tasks.removeAt(current_tasks[index]);
endRemoveRows();
}
void TaskList::deleteTask_id(int id) {
int i =0;
auto size = m_tasks.size();
while (i < size){
if (m_tasks[i].category == id){
beginRemoveRows(QModelIndex(), i, i);
m_tasks.removeAt(i);
endRemoveRows();
i--;
size--;
}
i++;
}
}
void TaskList::storeList() {
DataStorerTask::storeDataTask(m_tasks);
}
|
225b5318c49f61f557f08b7d9b339a2e14860ceb
|
76171660651f1c680d5b5a380c07635de5b2367c
|
/SH6_43_msh4/0.13005/T
|
260cb2fc0d34942b91d55a650d49c5d6737e14eb
|
[] |
no_license
|
lisegaAM/SH_Paper1
|
3cd0cac0d95cc60d296268e65e2dd6fed4cc6127
|
12ceadba5c58c563ccac236b965b4b917ac47551
|
refs/heads/master
| 2021-04-27T19:44:19.527187
| 2018-02-21T16:16:50
| 2018-02-21T16:16:50
| 122,360,661
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 218,035
|
T
|
/*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.x |
| \\ / A nd | Web: www.OpenFOAM.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class volScalarField;
location "0.13005";
object T;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [0 0 0 1 0 0 0];
internalField nonuniform List<scalar>
27600
(
773.066
773.066
773.066
773.066
773.066
773.066
773.066
773.067
773.067
773.067
773.067
773.066
773.066
773.067
773.068
773.069
773.07
773.071
773.072
773.074
773.075
773.077
773.08
773.082
773.085
773.088
773.091
773.094
773.097
773.1
773.103
773.106
773.109
773.112
773.114
773.117
773.119
773.12
773.122
773.123
773.123
773.124
773.123
773.123
773.122
773.121
773.119
773.117
773.115
773.113
773.111
773.108
773.106
773.103
773.101
773.099
773.097
773.095
773.093
773.091
773.09
773.088
773.087
773.087
773.086
773.085
773.085
773.085
773.084
773.084
773.084
773.084
773.084
773.085
773.085
773.085
773.085
773.085
773.085
773.085
773.086
773.086
773.086
773.086
773.086
773.086
773.087
773.087
773.087
773.088
773.088
773.089
773.089
773.09
773.091
773.092
773.093
773.094
773.096
773.097
773.099
773.101
773.103
773.106
773.109
773.111
773.115
773.118
773.121
773.125
773.129
773.132
773.136
773.14
773.143
773.147
773.15
773.154
773.157
773.159
773.162
773.164
773.166
773.167
773.168
773.169
773.17
773.17
773.169
773.169
773.168
773.167
773.166
773.164
773.162
773.16
773.158
773.156
773.154
773.151
773.148
773.146
773.143
773.14
773.137
773.135
773.132
773.129
773.126
773.123
773.121
773.118
773.115
773.113
773.11
773.108
773.106
773.104
773.102
773.1
773.099
773.097
773.096
773.094
773.093
773.092
773.091
773.09
773.09
773.089
773.088
773.088
773.087
773.087
773.087
773.086
773.086
773.086
773.086
773.085
773.085
773.085
773.085
773.085
773.085
773.085
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.085
773.09
773.092
773.204
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.106
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.165
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.086
773.086
773.22
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.061
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.086
773.086
773.219
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.061
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.086
773.086
773.216
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.085
773.086
773.213
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.085
773.086
773.209
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.085
773.085
773.196
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.084
773.084
773.175
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.082
773.082
773.152
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.081
773.079
773.123
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.076
773.088
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.077
773.075
773.041
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.074
773.075
772.977
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.071
773.079
772.881
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.07
773.085
772.808
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.069
773.089
772.77
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.061
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.069
773.092
772.736
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.061
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.105
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.164
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.068
773.095
772.705
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.062
773.063
773.064
773.065
773.067
773.068
773.07
773.072
773.075
773.077
773.08
773.083
773.085
773.088
773.092
773.095
773.098
773.101
773.104
773.106
773.109
773.111
773.113
773.115
773.117
773.118
773.118
773.118
773.118
773.118
773.117
773.116
773.114
773.112
773.11
773.108
773.106
773.103
773.101
773.098
773.096
773.093
773.091
773.089
773.087
773.086
773.084
773.083
773.082
773.081
773.081
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.08
773.08
773.08
773.08
773.08
773.08
773.081
773.081
773.081
773.081
773.081
773.082
773.082
773.082
773.082
773.083
773.083
773.084
773.085
773.086
773.087
773.088
773.089
773.09
773.092
773.094
773.096
773.098
773.101
773.103
773.106
773.109
773.113
773.116
773.12
773.123
773.127
773.131
773.135
773.138
773.142
773.145
773.148
773.151
773.154
773.157
773.159
773.161
773.162
773.163
773.164
773.165
773.165
773.164
773.164
773.163
773.162
773.161
773.159
773.157
773.155
773.153
773.151
773.148
773.146
773.143
773.141
773.138
773.135
773.132
773.129
773.127
773.124
773.121
773.118
773.115
773.113
773.11
773.108
773.105
773.103
773.101
773.099
773.097
773.095
773.093
773.092
773.09
773.089
773.088
773.087
773.086
773.085
773.084
773.084
773.083
773.083
773.082
773.082
773.081
773.081
773.081
773.081
773.08
773.08
773.08
773.08
773.08
773.08
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.079
773.068
773.098
772.676
773.066
773.066
773.066
773.066
773.066
773.066
773.066
773.067
773.067
773.067
773.067
773.066
773.066
773.067
773.068
773.069
773.07
773.071
773.072
773.074
773.075
773.077
773.08
773.082
773.085
773.088
773.091
773.094
773.097
773.1
773.103
773.106
773.109
773.112
773.114
773.117
773.119
773.12
773.122
773.123
773.123
773.124
773.123
773.123
773.122
773.121
773.119
773.117
773.115
773.113
773.111
773.108
773.106
773.103
773.101
773.099
773.097
773.095
773.093
773.091
773.09
773.088
773.087
773.087
773.086
773.085
773.085
773.085
773.084
773.084
773.084
773.084
773.084
773.085
773.085
773.085
773.085
773.085
773.085
773.085
773.086
773.086
773.086
773.086
773.086
773.086
773.087
773.087
773.087
773.088
773.088
773.089
773.089
773.09
773.091
773.092
773.093
773.094
773.096
773.097
773.099
773.101
773.103
773.106
773.109
773.111
773.115
773.118
773.121
773.125
773.129
773.132
773.136
773.14
773.143
773.147
773.15
773.154
773.157
773.159
773.162
773.164
773.166
773.167
773.168
773.169
773.17
773.17
773.169
773.169
773.168
773.167
773.166
773.164
773.162
773.16
773.158
773.156
773.154
773.151
773.148
773.146
773.143
773.14
773.137
773.135
773.132
773.129
773.126
773.123
773.121
773.118
773.115
773.113
773.11
773.108
773.106
773.104
773.102
773.1
773.099
773.097
773.096
773.094
773.093
773.092
773.091
773.09
773.09
773.089
773.088
773.088
773.087
773.087
773.087
773.086
773.086
773.086
773.086
773.085
773.085
773.085
773.085
773.085
773.085
773.085
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.084
773.073
773.101
772.704
773.181
773.202
773.211
773.217
773.22
773.222
773.224
773.225
773.225
773.226
773.225
773.225
773.224
773.223
773.221
773.218
773.212
773.204
773.191
773.165
773.178
773.193
773.199
773.202
773.203
773.204
773.205
773.204
773.203
773.201
773.199
773.197
773.195
773.192
773.189
773.185
773.179
773.171
773.158
773.135
773.18
773.193
773.201
773.204
773.206
773.208
773.21
773.211
773.211
773.211
773.21
773.209
773.208
773.207
773.204
773.201
773.196
773.188
773.174
773.149
773.179
773.191
773.198
773.199
773.201
773.202
773.203
773.202
773.202
773.2
773.199
773.197
773.195
773.193
773.19
773.187
773.181
773.173
773.16
773.138
773.176
773.188
773.196
773.199
773.201
773.203
773.205
773.206
773.206
773.206
773.205
773.203
773.201
773.2
773.197
773.194
773.188
773.179
773.165
773.142
773.173
773.185
773.192
773.194
773.196
773.197
773.198
773.198
773.198
773.197
773.196
773.194
773.192
773.19
773.187
773.183
773.178
773.169
773.156
773.134
773.163
773.174
773.182
773.186
773.19
773.193
773.194
773.195
773.196
773.196
773.195
773.193
773.191
773.188
773.185
773.181
773.174
773.165
773.152
773.133
773.148
773.157
773.163
773.164
773.165
773.165
773.165
773.165
773.165
773.165
773.164
773.163
773.162
773.16
773.156
773.153
773.147
773.14
773.129
773.116
773.13
773.138
773.142
773.145
773.147
773.15
773.152
773.153
773.153
773.152
773.151
773.149
773.147
773.145
773.142
773.137
773.132
773.125
773.117
773.107
773.11
773.115
773.117
773.118
773.118
773.117
773.116
773.116
773.116
773.116
773.117
773.116
773.116
773.115
773.114
773.112
773.11
773.106
773.101
773.095
773.088
773.088
773.088
773.088
773.088
773.09
773.092
773.092
773.092
773.09
773.089
773.088
773.086
773.084
773.083
773.08
773.079
773.077
773.077
773.077
773.057
773.054
773.051
773.049
773.046
773.044
773.041
773.041
773.041
773.042
773.044
773.046
773.048
773.05
773.052
773.055
773.058
773.062
773.067
773.071
773.017
773.011
773.004
773.001
773.001
773.001
773.001
773.001
773
772.999
772.997
772.995
772.994
772.993
772.992
772.994
772.998
773.005
773.017
773.025
772.956
772.944
772.932
772.924
772.918
772.912
772.909
772.907
772.908
772.91
772.914
772.919
772.927
772.937
772.95
772.965
772.98
772.997
773.016
773.037
772.914
772.898
772.883
772.878
772.875
772.873
772.871
772.87
772.869
772.869
772.87
772.87
772.872
772.874
772.877
772.885
772.897
772.912
772.932
772.957
772.885
772.866
772.849
772.841
772.837
772.834
772.833
772.833
772.835
772.838
772.842
772.847
772.853
772.86
772.869
772.881
772.895
772.912
772.933
772.956
772.862
772.84
772.822
772.815
772.81
772.806
772.802
772.799
772.797
772.795
772.795
772.794
772.795
772.797
772.802
772.81
772.824
772.841
772.865
772.898
772.84
772.813
772.793
772.785
772.782
772.78
772.781
772.784
772.788
772.794
772.8
772.808
772.817
772.827
772.839
772.853
772.869
772.889
772.914
772.944
772.818
772.791
772.768
772.759
772.75
772.744
772.736
772.731
772.726
772.722
772.719
772.717
772.716
772.716
772.723
772.727
772.746
772.764
772.793
772.833
772.821
772.785
772.755
772.745
772.745
772.747
772.751
772.757
772.766
772.774
772.785
772.796
772.809
772.823
772.839
772.858
772.881
772.905
772.937
772.976
773.09
773.065
773.057
773.056
773.056
773.056
773.056
773.056
773.053
773.05
773.048
773.047
773.047
773.047
773.048
773.051
773.062
773.112
773.362
774.514
777.886
781.205
783.12
783.749
783.662
782.356
778.27
774.564
772.395
771.422
771.177
771.237
771.671
772.251
772.613
772.819
772.927
772.982
773.009
773.022
773.028
773.031
773.033
773.034
773.035
773.035
773.035
773.036
773.036
773.036
773.036
773.036
773.036
773.036
773.037
773.037
773.037
773.037
773.038
773.038
773.038
773.039
773.039
773.04
773.041
773.041
773.042
773.043
773.044
773.045
773.047
773.048
773.05
773.051
773.053
773.055
773.057
773.059
773.062
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.087
773.089
773.091
773.093
773.095
773.097
773.098
773.099
773.1
773.101
773.101
773.101
773.101
773.1
773.1
773.099
773.098
773.096
773.094
773.093
773.091
773.089
773.086
773.084
773.082
773.08
773.078
773.075
773.073
773.071
773.07
773.068
773.066
773.065
773.063
773.062
773.061
773.06
773.059
773.059
773.058
773.058
773.058
773.057
773.057
773.057
773.057
773.057
773.057
773.057
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.059
773.059
773.059
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.059
773.059
773.047
773.061
772.735
773.066
773.042
773.035
773.034
773.035
773.035
773.033
773.031
773.03
773.03
773.031
773.031
773.031
773.028
773.012
772.983
772.964
772.957
772.956
772.97
773.071
773.508
774.288
774.898
775.245
775.344
775.28
774.833
773.993
773.4
773.073
772.941
772.911
772.915
772.944
772.978
772.999
773.011
773.018
773.023
773.025
773.027
773.028
773.029
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.086
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.054
773.054
773.053
773.042
773.059
772.704
773.08
773.055
773.047
773.047
773.047
773.047
773.045
773.043
773.043
773.042
773.043
773.042
773.041
773.036
773.025
773.018
773.012
772.998
772.958
772.82
772.596
772.439
772.372
772.367
772.42
772.71
773.187
773.476
773.585
773.602
773.58
773.461
773.286
773.166
773.094
773.055
773.036
773.028
773.026
773.025
773.026
773.027
773.028
773.029
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.053
773.042
773.056
772.729
773.073
773.049
773.042
773.042
773.042
773.041
773.04
773.039
773.039
773.039
773.039
773.039
773.036
773.029
773.023
773.021
773.019
773.015
773.002
772.944
772.717
772.38
772.159
772.068
772.061
772.133
772.48
772.961
773.263
773.396
773.422
773.399
773.289
773.17
773.096
773.056
773.037
773.028
773.026
773.026
773.026
773.027
773.028
773.029
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.053
773.043
773.053
772.757
773.078
773.055
773.048
773.047
773.047
773.046
773.045
773.045
773.044
773.044
773.044
773.043
773.039
773.034
773.03
773.029
773.028
773.026
773.015
772.963
772.745
772.396
772.16
772.057
772.044
772.101
772.392
772.822
773.101
773.237
773.276
773.272
773.221
773.134
773.078
773.047
773.032
773.027
773.025
773.025
773.026
773.027
773.028
773.029
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.053
773.043
773.05
772.788
773.076
773.054
773.048
773.047
773.047
773.046
773.046
773.046
773.046
773.046
773.046
773.045
773.041
773.037
773.035
773.034
773.033
773.032
773.024
772.984
772.81
772.494
772.272
772.168
772.15
772.19
772.417
772.772
773.007
773.126
773.166
773.167
773.143
773.089
773.054
773.036
773.027
773.025
773.024
773.025
773.026
773.028
773.029
773.029
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.053
773.044
773.048
772.822
773.082
773.063
773.057
773.056
773.055
773.054
773.053
773.053
773.053
773.053
773.052
773.052
773.048
773.045
773.042
773.042
773.041
773.04
773.037
773.016
772.923
772.725
772.577
772.503
772.489
772.51
772.636
772.844
772.982
773.053
773.078
773.081
773.072
773.049
773.034
773.027
773.024
773.024
773.024
773.026
773.027
773.028
773.029
773.03
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.053
773.046
773.045
772.886
773.079
773.063
773.057
773.055
773.056
773.056
773.057
773.057
773.058
773.058
773.058
773.057
773.056
773.053
773.051
773.05
773.05
773.05
773.05
773.045
773.017
772.923
772.823
772.767
772.75
772.754
772.796
772.897
772.971
773.012
773.029
773.033
773.033
773.029
773.025
773.024
773.024
773.025
773.026
773.028
773.028
773.029
773.03
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.054
773.054
773.054
773.05
773.046
772.968
773.082
773.074
773.072
773.071
773.069
773.069
773.069
773.069
773.069
773.068
773.068
773.068
773.067
773.066
773.066
773.066
773.066
773.067
773.066
773.063
773.044
772.98
772.914
772.876
772.863
772.863
772.881
772.931
772.972
772.997
773.01
773.016
773.019
773.021
773.023
773.024
773.026
773.027
773.028
773.029
773.029
773.03
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.054
773.054
773.052
773.049
773.022
773.083
773.079
773.076
773.075
773.076
773.077
773.078
773.078
773.079
773.079
773.079
773.079
773.079
773.078
773.078
773.078
773.078
773.079
773.08
773.079
773.074
773.048
772.993
772.951
772.929
772.923
772.924
772.939
772.968
772.989
773.003
773.012
773.018
773.022
773.025
773.027
773.029
773.029
773.03
773.03
773.03
773.03
773.03
773.03
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.054
773.054
773.052
773.06
773.081
773.082
773.085
773.086
773.085
773.085
773.084
773.083
773.083
773.083
773.083
773.084
773.084
773.085
773.086
773.089
773.092
773.095
773.095
773.095
773.092
773.075
773.022
772.969
772.936
772.922
772.92
772.923
772.942
772.969
772.991
773.006
773.017
773.023
773.027
773.03
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.057
773.056
773.092
773.085
773.092
773.093
773.095
773.097
773.098
773.098
773.098
773.099
773.1
773.1
773.101
773.101
773.101
773.101
773.101
773.104
773.107
773.109
773.109
773.106
773.088
773.025
772.955
772.912
772.892
772.888
772.892
772.913
772.952
772.982
773.003
773.016
773.025
773.03
773.032
773.033
773.033
773.033
773.032
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.058
773.06
773.116
773.068
773.084
773.09
773.091
773.091
773.091
773.09
773.09
773.09
773.09
773.091
773.093
773.094
773.095
773.096
773.1
773.107
773.112
773.114
773.113
773.108
773.078
772.988
772.903
772.852
772.831
772.828
772.835
772.872
772.927
772.968
772.996
773.015
773.025
773.031
773.034
773.034
773.035
773.034
773.033
773.033
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.056
773.06
773.063
773.137
773.102
773.12
773.125
773.128
773.131
773.133
773.133
773.133
773.133
773.133
773.134
773.135
773.135
773.135
773.135
773.136
773.141
773.144
773.144
773.139
773.103
772.977
772.838
772.755
772.72
772.714
772.721
772.762
772.846
772.913
772.961
772.994
773.015
773.027
773.033
773.036
773.036
773.036
773.036
773.034
773.033
773.032
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.056
773.061
773.065
773.155
773.051
773.075
773.081
773.082
773.082
773.082
773.083
773.084
773.084
773.084
773.084
773.084
773.086
773.088
773.09
773.092
773.1
773.112
773.117
773.116
773.098
773.001
772.812
772.683
772.622
772.608
772.616
772.673
772.788
772.878
772.941
772.983
773.009
773.024
773.032
773.035
773.036
773.036
773.036
773.035
773.033
773.033
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.056
773.061
773.066
773.167
773.052
773.075
773.082
773.083
773.083
773.083
773.084
773.085
773.085
773.085
773.084
773.084
773.085
773.088
773.089
773.091
773.097
773.117
773.133
773.135
773.123
773.041
772.844
772.699
772.628
772.609
772.614
772.662
772.774
772.867
772.934
772.978
773.006
773.023
773.032
773.035
773.037
773.037
773.036
773.035
773.034
773.033
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.056
773.061
773.066
773.171
773.021
773.05
773.058
773.059
773.059
773.059
773.06
773.061
773.062
773.063
773.063
773.063
773.064
773.069
773.073
773.076
773.081
773.1
773.151
773.182
773.184
773.156
773.016
772.827
772.717
772.675
772.671
772.694
772.778
772.87
772.936
772.98
773.007
773.023
773.032
773.036
773.037
773.037
773.036
773.035
773.034
773.033
773.032
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.056
773.061
773.066
773.174
773.059
773.083
773.09
773.091
773.091
773.091
773.091
773.092
773.092
773.092
773.091
773.091
773.092
773.095
773.099
773.102
773.106
773.121
773.191
773.33
773.407
773.421
773.394
773.246
773.049
772.934
772.886
772.877
772.886
772.923
772.968
772.999
773.019
773.03
773.036
773.038
773.039
773.038
773.037
773.035
773.034
773.033
773.032
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.085
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.056
773.062
773.066
773.177
772.989
773.026
773.035
773.038
773.038
773.038
773.039
773.04
773.042
773.044
773.045
773.046
773.046
773.047
773.053
773.063
773.069
773.072
773.075
773.095
773.215
773.633
774.03
774.209
774.246
774.225
774.082
773.779
773.534
773.362
773.246
773.169
773.12
773.089
773.068
773.055
773.047
773.042
773.038
773.036
773.034
773.033
773.032
773.032
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.031
773.032
773.032
773.032
773.032
773.033
773.033
773.034
773.034
773.035
773.035
773.036
773.037
773.038
773.039
773.04
773.042
773.043
773.045
773.046
773.048
773.05
773.052
773.054
773.056
773.059
773.061
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.086
773.088
773.09
773.092
773.093
773.094
773.095
773.096
773.096
773.096
773.096
773.095
773.095
773.094
773.092
773.091
773.089
773.087
773.086
773.083
773.081
773.079
773.077
773.075
773.072
773.07
773.068
773.066
773.064
773.063
773.061
773.059
773.058
773.057
773.056
773.055
773.054
773.054
773.053
773.053
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.052
773.053
773.053
773.053
773.053
773.053
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.055
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.054
773.055
773.055
773.055
773.055
773.056
773.062
773.067
773.177
773.117
773.14
773.143
773.145
773.147
773.148
773.148
773.148
773.147
773.148
773.15
773.151
773.149
773.127
773.023
772.907
772.869
772.877
772.999
773.603
774.789
775.692
776.218
776.43
776.459
776.375
775.921
775.125
774.478
773.996
773.655
773.423
773.272
773.177
773.119
773.084
773.064
773.052
773.046
773.042
773.04
773.038
773.037
773.037
773.036
773.036
773.036
773.036
773.036
773.036
773.036
773.036
773.036
773.036
773.037
773.037
773.037
773.037
773.038
773.038
773.038
773.039
773.039
773.04
773.041
773.041
773.042
773.043
773.044
773.045
773.047
773.048
773.05
773.051
773.053
773.055
773.057
773.059
773.062
773.064
773.066
773.069
773.072
773.074
773.077
773.079
773.082
773.084
773.087
773.089
773.091
773.093
773.095
773.097
773.098
773.099
773.1
773.101
773.101
773.101
773.101
773.1
773.1
773.099
773.098
773.096
773.094
773.093
773.091
773.089
773.086
773.084
773.082
773.08
773.078
773.075
773.073
773.071
773.07
773.068
773.066
773.065
773.063
773.062
773.061
773.06
773.059
773.059
773.058
773.058
773.058
773.057
773.057
773.057
773.057
773.057
773.057
773.057
773.058
773.058
773.058
773.058
773.058
773.059
773.059
773.059
773.059
773.059
773.059
773.059
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.06
773.061
773.066
773.072
773.162
772.815
772.778
772.745
772.733
772.731
772.732
772.735
772.741
772.749
772.758
772.768
772.779
772.792
772.806
772.822
772.841
772.865
772.889
772.92
772.961
772.808
772.78
772.756
772.745
772.736
772.728
772.721
772.715
772.71
772.706
772.702
772.7
772.7
772.7
772.707
772.711
772.73
772.748
772.777
772.819
772.828
772.801
772.779
772.77
772.765
772.764
772.763
772.766
772.77
772.775
772.782
772.789
772.798
772.808
772.82
772.835
772.851
772.871
772.896
772.926
772.848
772.826
772.807
772.798
772.793
772.787
772.783
772.78
772.778
772.776
772.775
772.774
772.775
772.777
772.782
772.791
772.805
772.822
772.847
772.88
772.87
772.851
772.832
772.823
772.818
772.814
772.813
772.812
772.814
772.817
772.821
772.826
772.832
772.839
772.848
772.86
772.874
772.891
772.912
772.936
772.897
772.88
772.864
772.857
772.854
772.851
772.849
772.847
772.847
772.847
772.847
772.848
772.849
772.851
772.855
772.863
772.875
772.891
772.911
772.936
772.936
772.924
772.911
772.902
772.895
772.889
772.885
772.883
772.884
772.886
772.889
772.895
772.902
772.912
772.925
772.941
772.955
772.974
772.992
773.014
772.992
772.985
772.978
772.974
772.973
772.973
772.973
772.973
772.972
772.971
772.969
772.967
772.966
772.965
772.965
772.967
772.971
772.978
772.991
772.999
773.03
773.027
773.023
773.021
773.018
773.016
773.013
773.012
773.012
773.013
773.015
773.017
773.019
773.021
773.024
773.026
773.03
773.033
773.038
773.042
773.06
773.06
773.06
773.06
773.061
773.062
773.064
773.065
773.064
773.063
773.061
773.06
773.058
773.056
773.054
773.053
773.051
773.05
773.049
773.05
773.082
773.087
773.09
773.091
773.091
773.091
773.09
773.089
773.089
773.09
773.09
773.09
773.09
773.089
773.088
773.086
773.083
773.079
773.074
773.068
773.104
773.111
773.115
773.119
773.121
773.124
773.126
773.127
773.127
773.126
773.125
773.124
773.122
773.12
773.116
773.112
773.106
773.1
773.091
773.081
773.123
773.131
773.138
773.14
773.141
773.141
773.141
773.141
773.141
773.141
773.14
773.139
773.137
773.136
773.132
773.129
773.123
773.116
773.105
773.092
773.14
773.149
773.158
773.163
773.167
773.17
773.171
773.173
773.173
773.173
773.172
773.17
773.168
773.165
773.161
773.157
773.151
773.142
773.129
773.11
773.15
773.161
773.168
773.171
773.173
773.175
773.176
773.176
773.176
773.175
773.173
773.172
773.169
773.167
773.164
773.161
773.155
773.147
773.134
773.113
773.153
773.164
773.173
773.176
773.179
773.181
773.183
773.184
773.184
773.184
773.183
773.181
773.179
773.177
773.175
773.171
773.166
773.157
773.144
773.121
773.155
773.167
773.175
773.177
773.179
773.181
773.181
773.181
773.18
773.179
773.177
773.175
773.173
773.171
773.168
773.164
773.159
773.152
773.139
773.117
773.157
773.17
773.178
773.182
773.184
773.187
773.188
773.19
773.19
773.19
773.189
773.188
773.186
773.185
773.182
773.179
773.174
773.166
773.153
773.129
773.157
773.17
773.177
773.18
773.181
773.182
773.183
773.182
773.181
773.18
773.178
773.175
773.173
773.171
773.167
773.163
773.158
773.15
773.137
773.115
773.157
773.178
773.188
773.195
773.198
773.2
773.202
773.203
773.204
773.204
773.203
773.203
773.203
773.2
773.199
773.196
773.191
773.183
773.17
773.144
773.099
773.122
773.127
773.128
773.129
773.13
773.131
773.131
773.131
773.131
773.133
773.134
773.133
773.125
773.066
772.93
772.856
772.845
772.887
773.175
774.15
775.223
775.93
776.288
776.396
776.383
776.185
775.52
774.789
774.228
773.818
773.531
773.337
773.212
773.132
773.084
773.055
773.038
773.028
773.022
773.018
773.016
773.015
773.014
773.013
773.013
773.013
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.011
773.01
772.999
773.011
772.693
772.972
773.009
773.019
773.022
773.023
773.023
773.023
773.023
773.024
773.027
773.028
773.029
773.029
773.03
773.032
773.04
773.047
773.049
773.05
773.054
773.086
773.27
773.721
774.028
774.144
774.154
774.1
773.875
773.603
773.403
773.266
773.176
773.117
773.079
773.055
773.039
773.029
773.022
773.018
773.014
773.012
773.011
773.009
773.009
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
772.994
773.008
772.661
773.04
773.065
773.072
773.073
773.073
773.073
773.073
773.074
773.075
773.075
773.075
773.074
773.074
773.075
773.079
773.082
773.084
773.088
773.103
773.178
773.342
773.442
773.468
773.453
773.342
773.152
773.029
772.968
772.949
772.949
772.958
772.981
772.998
773.009
773.015
773.017
773.017
773.017
773.015
773.013
773.012
773.01
773.009
773.009
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
772.994
773.006
772.687
773.001
773.031
773.039
773.041
773.041
773.041
773.041
773.041
773.043
773.044
773.045
773.045
773.046
773.047
773.052
773.055
773.058
773.063
773.081
773.136
773.174
773.18
773.161
773.057
772.901
772.807
772.768
772.764
772.777
772.835
772.9
772.946
772.977
772.996
773.007
773.013
773.015
773.015
773.015
773.013
773.012
773.01
773.009
773.009
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
772.994
773.003
772.714
773.031
773.055
773.061
773.063
773.063
773.063
773.063
773.064
773.065
773.066
773.066
773.065
773.066
773.067
773.069
773.07
773.072
773.078
773.097
773.112
773.115
773.104
773.032
772.87
772.756
772.701
772.687
772.693
772.736
772.824
772.893
772.942
772.974
772.994
773.006
773.012
773.014
773.014
773.014
773.013
773.011
773.01
773.009
773.009
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
772.995
773
772.744
773.029
773.053
773.06
773.061
773.061
773.061
773.061
773.062
773.063
773.063
773.064
773.064
773.064
773.066
773.068
773.07
773.072
773.08
773.09
773.092
773.091
773.07
772.974
772.823
772.727
772.684
772.675
772.684
772.738
772.828
772.896
772.944
772.975
772.995
773.006
773.011
773.013
773.014
773.014
773.013
773.011
773.01
773.009
773.008
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
772.995
772.998
772.778
773.078
773.096
773.102
773.104
773.106
773.108
773.109
773.11
773.11
773.11
773.11
773.111
773.111
773.111
773.111
773.111
773.112
773.113
773.114
773.113
773.103
773.052
772.925
772.82
772.762
772.74
772.738
772.748
772.797
772.867
772.92
772.957
772.983
772.998
773.007
773.012
773.013
773.014
773.013
773.012
773.011
773.01
773.009
773.008
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
772.998
772.996
772.841
773.041
773.058
773.064
773.065
773.065
773.065
773.065
773.065
773.065
773.065
773.065
773.066
773.067
773.068
773.069
773.073
773.078
773.081
773.083
773.083
773.081
773.069
773.018
772.933
772.872
772.84
772.829
772.829
772.842
772.884
772.929
772.961
772.983
772.997
773.005
773.009
773.011
773.012
773.012
773.011
773.01
773.009
773.008
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.005
773.001
772.997
772.922
773.057
773.064
773.066
773.067
773.069
773.07
773.071
773.071
773.071
773.072
773.073
773.073
773.073
773.073
773.073
773.073
773.075
773.077
773.078
773.078
773.077
773.069
773.03
772.961
772.91
772.883
772.874
772.873
772.882
772.912
772.945
772.969
772.986
772.997
773.004
773.008
773.009
773.01
773.01
773.01
773.009
773.008
773.008
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.004
773
772.975
773.054
773.055
773.057
773.058
773.057
773.057
773.056
773.056
773.055
773.055
773.055
773.056
773.056
773.056
773.057
773.059
773.062
773.064
773.065
773.065
773.064
773.051
773.007
772.953
772.917
772.898
772.893
772.894
772.907
772.936
772.96
772.977
772.989
772.997
773.002
773.005
773.007
773.008
773.008
773.008
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.004
773.012
773.056
773.052
773.049
773.048
773.049
773.049
773.05
773.051
773.051
773.051
773.051
773.051
773.051
773.051
773.051
773.051
773.051
773.052
773.052
773.052
773.048
773.028
772.969
772.912
772.878
772.865
772.865
772.877
772.913
772.946
772.968
772.982
772.99
772.996
773
773.002
773.004
773.005
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.009
773.008
773.043
773.056
773.049
773.046
773.045
773.044
773.042
773.042
773.042
773.042
773.042
773.042
773.041
773.041
773.041
773.041
773.041
773.041
773.042
773.042
773.04
773.029
772.978
772.881
772.81
772.776
772.768
772.776
772.822
772.896
772.946
772.975
772.989
772.995
772.998
772.999
773
773.001
773.003
773.004
773.005
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.01
773.012
773.067
773.056
773.04
773.034
773.031
773.031
773.031
773.031
773.032
773.032
773.033
773.033
773.033
773.033
773.031
773.029
773.028
773.027
773.027
773.027
773.024
773.006
772.922
772.764
772.651
772.598
772.588
772.604
772.699
772.839
772.931
772.981
773.003
773.009
773.009
773.006
773.002
773.001
773.001
773.001
773.003
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.008
773.012
773.016
773.087
773.061
773.041
773.035
773.033
773.032
773.03
773.029
773.029
773.029
773.03
773.03
773.03
773.028
773.025
773.022
773.022
773.021
773.021
773.018
773.004
772.933
772.698
772.433
772.269
772.203
772.201
772.261
772.502
772.767
772.934
773.02
773.051
773.056
773.049
773.027
773.012
773.004
773.001
773.001
773.001
773.002
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.008
773.013
773.018
773.105
773.056
773.033
773.027
773.025
773.024
773.023
773.023
773.023
773.023
773.024
773.024
773.024
773.021
773.018
773.016
773.016
773.015
773.014
773.009
772.978
772.831
772.407
772
771.76
771.673
771.675
771.791
772.217
772.665
772.946
773.088
773.137
773.141
773.12
773.068
773.032
773.013
773.004
773.001
773.001
773.001
773.003
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.008
773.013
773.019
773.117
773.059
773.035
773.028
773.026
773.024
773.023
773.023
773.023
773.023
773.024
773.024
773.023
773.02
773.016
773.014
773.013
773.012
773.01
773.002
772.958
772.756
772.242
771.799
771.547
771.462
771.47
771.625
772.158
772.697
773.032
773.196
773.247
773.246
773.201
773.114
773.057
773.025
773.01
773.004
773.002
773.002
773.003
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.008
773.013
773.019
773.121
773.053
773.029
773.023
773.021
773.019
773.018
773.018
773.018
773.019
773.019
773.019
773.019
773.016
773.011
773.009
773.008
773.007
773.004
772.994
772.942
772.711
772.156
771.687
771.419
771.329
771.338
771.514
772.128
772.761
773.147
773.325
773.369
773.356
773.266
773.148
773.074
773.034
773.014
773.005
773.003
773.002
773.002
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.008
773.013
773.019
773.124
773.06
773.035
773.028
773.026
773.024
773.023
773.023
773.023
773.024
773.024
773.024
773.023
773.019
773.015
773.013
773.011
773.007
772.998
772.961
772.794
772.234
771.551
771.1
770.899
770.872
770.977
771.552
772.462
773.057
773.348
773.447
773.454
773.404
773.258
773.139
773.068
773.03
773.012
773.004
773.002
773.002
773.002
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.008
773.014
773.019
773.127
773.047
773.023
773.016
773.014
773.013
773.011
773.011
773.011
773.011
773.012
773.012
773.012
773.01
773.007
773.004
772.999
772.988
772.951
772.836
772.708
772.64
772.637
772.738
773.243
774.05
774.562
774.733
774.706
774.403
773.698
773.184
772.914
772.818
772.807
772.828
772.89
772.938
772.967
772.984
772.993
772.998
773.002
773.004
773.005
773.006
773.006
773.006
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.007
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.006
773.007
773.007
773.007
773.008
773.014
773.019
773.127
773.07
773.046
773.038
773.034
773.033
773.033
773.034
773.036
773.036
773.035
773.03
773.024
773.023
773.023
773.026
773.038
773.082
773.232
773.811
775.964
780.001
783.375
785.51
786.395
786.466
785.767
782.34
777.342
773.916
772.006
771.211
771.05
771.158
771.682
772.253
772.603
772.801
772.906
772.96
772.986
772.999
773.005
773.008
773.01
773.011
773.011
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.012
773.013
773.018
773.025
773.112
772.769
772.731
772.698
772.686
772.684
772.684
772.688
772.693
772.702
772.711
772.721
772.732
772.745
772.759
772.774
772.794
772.817
772.841
772.873
772.912
772.761
772.734
772.71
772.698
772.689
772.681
772.673
772.668
772.662
772.658
772.655
772.653
772.652
772.652
772.659
772.664
772.682
772.7
772.729
772.77
772.781
772.754
772.732
772.723
772.718
772.716
772.716
772.718
772.722
772.727
772.734
772.741
772.75
772.761
772.772
772.787
772.803
772.823
772.848
772.878
772.801
772.779
772.76
772.75
772.745
772.74
772.736
772.732
772.73
772.728
772.727
772.726
772.727
772.729
772.734
772.743
772.757
772.774
772.798
772.832
772.823
772.804
772.785
772.775
772.77
772.767
772.765
772.765
772.766
772.769
772.773
772.778
772.784
772.791
772.8
772.812
772.826
772.843
772.864
772.887
772.849
772.833
772.817
772.81
772.806
772.803
772.801
772.799
772.799
772.799
772.799
772.8
772.801
772.803
772.807
772.815
772.826
772.843
772.862
772.888
772.889
772.877
772.863
772.854
772.847
772.84
772.837
772.835
772.835
772.837
772.841
772.846
772.853
772.864
772.876
772.892
772.906
772.925
772.943
772.965
772.944
772.937
772.93
772.926
772.924
772.924
772.925
772.924
772.923
772.922
772.92
772.918
772.917
772.916
772.916
772.917
772.921
772.929
772.942
772.95
772.982
772.978
772.975
772.972
772.97
772.967
772.965
772.963
772.964
772.965
772.966
772.968
772.97
772.972
772.975
772.977
772.981
772.984
772.99
772.993
773.012
773.012
773.012
773.012
773.012
773.014
773.016
773.016
773.016
773.015
773.013
773.012
773.01
773.008
773.006
773.004
773.003
773.001
773.001
773.001
773.034
773.039
773.042
773.043
773.043
773.043
773.042
773.041
773.041
773.042
773.042
773.042
773.042
773.04
773.04
773.037
773.035
773.031
773.026
773.02
773.056
773.063
773.067
773.071
773.074
773.076
773.078
773.079
773.079
773.078
773.077
773.075
773.074
773.071
773.068
773.064
773.059
773.052
773.043
773.034
773.075
773.083
773.09
773.092
773.093
773.093
773.093
773.093
773.093
773.093
773.092
773.091
773.09
773.088
773.085
773.081
773.076
773.069
773.058
773.044
773.092
773.101
773.11
773.115
773.119
773.122
773.124
773.125
773.125
773.125
773.124
773.123
773.121
773.118
773.115
773.11
773.104
773.094
773.081
773.062
773.102
773.113
773.121
773.123
773.126
773.127
773.128
773.128
773.128
773.127
773.126
773.125
773.123
773.121
773.118
773.114
773.108
773.098
773.085
773.063
773.105
773.117
773.125
773.129
773.132
773.134
773.135
773.136
773.136
773.136
773.136
773.134
773.133
773.131
773.128
773.124
773.118
773.109
773.095
773.071
773.107
773.119
773.127
773.13
773.132
773.133
773.133
773.133
773.133
773.131
773.13
773.128
773.126
773.124
773.121
773.117
773.111
773.103
773.09
773.067
773.11
773.122
773.13
773.134
773.137
773.139
773.141
773.142
773.142
773.142
773.142
773.141
773.14
773.138
773.136
773.132
773.126
773.118
773.104
773.079
773.109
773.122
773.129
773.132
773.134
773.135
773.135
773.135
773.133
773.132
773.131
773.128
773.126
773.124
773.12
773.116
773.11
773.101
773.088
773.065
773.109
773.13
773.14
773.147
773.15
773.153
773.154
773.156
773.156
773.157
773.156
773.156
773.156
773.154
773.151
773.148
773.143
773.134
773.121
773.095
773.053
773.075
773.08
773.082
773.083
773.084
773.083
773.083
773.082
773.083
773.085
773.086
773.084
773.06
772.952
772.834
772.794
772.802
772.922
773.492
774.466
775.173
775.567
775.713
775.724
775.624
775.173
774.537
774.041
773.678
773.424
773.252
773.141
773.071
773.028
773.003
772.988
772.979
772.973
772.97
772.968
772.967
772.966
772.966
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.966
772.966
772.966
772.966
772.966
772.966
772.966
772.966
772.966
772.965
772.965
772.965
772.965
772.965
772.964
772.964
772.963
772.963
772.962
772.962
772.961
772.96
772.959
772.958
772.957
772.955
772.954
772.952
772.951
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.934
772.932
772.931
772.929
772.928
772.927
772.926
772.926
772.925
772.925
772.925
772.925
772.925
772.926
772.927
772.928
772.929
772.93
772.932
772.933
772.935
772.937
772.939
772.941
772.943
772.945
772.947
772.949
772.951
772.953
772.956
772.958
772.96
772.962
772.963
772.965
772.967
772.969
772.97
772.972
772.973
772.974
772.975
772.977
772.978
772.979
772.979
772.98
772.981
772.983
772.989
772.995
773.086
772.926
772.961
772.972
772.975
772.976
772.976
772.976
772.976
772.978
772.979
772.98
772.98
772.981
772.982
772.989
772.997
773.001
773.002
773.003
773.015
773.104
773.443
773.792
773.951
773.983
773.958
773.81
773.555
773.36
773.222
773.13
773.07
773.032
773.007
772.991
772.981
772.974
772.969
772.966
772.964
772.963
772.962
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.941
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.978
772.984
772.99
773.101
772.994
773.017
773.024
773.027
773.027
773.027
773.027
773.027
773.027
773.026
773.025
773.025
773.026
773.03
773.034
773.037
773.039
773.047
773.087
773.234
773.387
773.452
773.456
773.41
773.244
773.089
772.999
772.957
772.946
772.946
772.952
772.962
772.968
772.97
772.971
772.971
772.97
772.967
772.965
772.964
772.963
772.962
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.978
772.984
772.989
773.101
772.955
772.983
772.992
772.995
772.995
772.995
772.995
772.995
772.995
772.996
772.996
772.996
772.997
773.001
773.007
773.01
773.013
773.022
773.062
773.124
773.148
773.146
773.102
772.969
772.86
772.807
772.793
772.796
772.823
772.874
772.912
772.938
772.954
772.962
772.966
772.968
772.968
772.967
772.965
772.964
772.963
772.962
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.978
772.984
772.989
773.098
772.985
773.007
773.014
773.016
773.017
773.017
773.017
773.017
773.017
773.017
773.017
773.017
773.017
773.02
773.023
773.024
773.027
773.039
773.061
773.07
773.068
773.037
772.923
772.803
772.739
772.717
772.718
772.739
772.803
772.864
772.906
772.934
772.951
772.961
772.965
772.967
772.967
772.967
772.965
772.964
772.962
772.962
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.978
772.984
772.989
773.095
772.982
773.006
773.013
773.014
773.015
773.015
773.015
773.015
773.015
773.015
773.015
773.015
773.016
773.02
773.022
773.024
773.029
773.039
773.044
773.044
773.036
772.985
772.859
772.762
772.713
772.7
772.703
772.733
772.805
772.865
772.907
772.934
772.951
772.96
772.965
772.966
772.967
772.966
772.965
772.963
772.962
772.961
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.978
772.984
772.989
773.091
773.03
773.049
773.055
773.058
773.06
773.061
773.061
773.061
773.06
773.06
773.061
773.063
773.063
773.063
773.064
773.064
773.066
773.066
773.066
773.061
773.034
772.94
772.835
772.772
772.746
772.74
772.745
772.776
772.836
772.883
772.917
772.939
772.953
772.961
772.965
772.966
772.966
772.966
772.964
772.963
772.962
772.961
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.977
772.983
772.988
773.079
772.993
773.011
773.017
773.018
773.017
773.017
773.016
773.016
773.015
773.016
773.016
773.018
773.019
773.02
773.023
773.028
773.032
773.035
773.035
773.034
773.028
772.996
772.922
772.862
772.827
772.813
772.812
772.819
772.85
772.89
772.919
772.939
772.951
772.959
772.962
772.964
772.964
772.964
772.963
772.962
772.961
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.977
772.982
772.986
773.061
773.009
773.017
773.018
773.019
773.021
773.022
773.022
773.022
773.022
773.023
773.024
773.024
773.024
773.025
773.025
773.026
773.028
773.03
773.03
773.029
773.024
772.999
772.937
772.886
772.857
772.846
772.845
772.851
772.874
772.904
772.926
772.941
772.951
772.957
772.96
772.962
772.962
772.962
772.962
772.961
772.961
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.977
772.981
772.983
773.04
773.005
773.007
773.009
773.009
773.008
773.008
773.007
773.007
773.007
773.007
773.007
773.007
773.008
773.008
773.009
773.012
773.015
773.016
773.017
773.016
773.008
772.974
772.921
772.883
772.864
772.858
772.858
772.869
772.894
772.916
772.932
772.943
772.95
772.955
772.958
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.976
772.979
772.979
773.016
773.007
773.003
773
773
773.001
773.001
773.002
773.003
773.003
773.003
773.003
773.003
773.003
773.003
773.003
773.003
773.003
773.004
773.004
773.001
772.988
772.939
772.881
772.844
772.829
772.827
772.836
772.868
772.901
772.922
772.936
772.944
772.949
772.952
772.955
772.956
772.958
772.958
772.959
772.959
772.959
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.976
772.976
772.974
772.984
773.008
772.999
772.997
772.997
772.996
772.995
772.994
772.994
772.994
772.994
772.994
772.993
772.992
772.992
772.992
772.993
772.993
772.993
772.993
772.986
772.95
772.856
772.778
772.737
772.726
772.73
772.767
772.842
772.895
772.926
772.941
772.948
772.95
772.951
772.953
772.954
772.955
772.956
772.957
772.958
772.958
772.959
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.976
772.976
772.974
772.971
772.946
773.006
772.99
772.985
772.983
772.984
772.984
772.984
772.985
772.985
772.985
772.985
772.985
772.984
772.981
772.98
772.98
772.979
772.979
772.978
772.967
772.909
772.761
772.637
772.573
772.557
772.567
772.643
772.781
772.876
772.929
772.953
772.96
772.96
772.958
772.954
772.953
772.953
772.954
772.955
772.956
772.957
772.958
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.972
772.969
772.892
773.011
772.992
772.987
772.985
772.984
772.983
772.982
772.982
772.982
772.982
772.982
772.98
772.977
772.975
772.974
772.974
772.974
772.972
772.964
772.918
772.734
772.457
772.272
772.188
772.177
772.218
772.42
772.691
772.867
772.959
772.995
773.001
772.996
772.977
772.963
772.956
772.953
772.953
772.953
772.955
772.956
772.957
772.958
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.968
772.967
772.809
773.005
772.985
772.979
772.977
772.977
772.976
772.976
772.976
772.976
772.976
772.976
772.974
772.971
772.969
772.968
772.968
772.968
772.965
772.947
772.853
772.509
772.077
771.804
771.69
771.679
771.758
772.121
772.584
772.882
773.035
773.09
773.095
773.075
773.023
772.986
772.966
772.957
772.954
772.954
772.954
772.955
772.957
772.958
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.966
772.97
772.744
773.008
772.986
772.98
772.978
772.977
772.976
772.976
772.976
772.976
772.976
772.975
772.973
772.969
772.967
772.966
772.965
772.964
772.959
772.933
772.8
772.363
771.881
771.587
771.474
771.47
771.582
772.054
772.614
772.969
773.145
773.2
773.2
773.157
773.068
773.01
772.977
772.962
772.956
772.954
772.954
772.955
772.956
772.957
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.966
772.973
772.709
773.003
772.981
772.975
772.973
772.972
772.972
772.971
772.971
772.971
772.971
772.971
772.969
772.966
772.963
772.962
772.961
772.958
772.951
772.916
772.756
772.274
771.785
771.495
771.389
771.39
771.527
772.081
772.72
773.113
773.293
773.336
773.32
773.223
773.102
773.027
772.986
772.966
772.957
772.955
772.955
772.955
772.956
772.957
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.965
772.976
772.679
773.01
772.987
772.98
772.978
772.977
772.977
772.977
772.977
772.976
772.975
772.973
772.971
772.97
772.969
772.967
772.965
772.959
772.936
772.83
772.45
771.944
771.608
771.462
771.443
771.525
771.983
772.726
773.199
773.414
773.473
773.467
773.384
773.212
773.092
773.021
772.982
772.964
772.957
772.954
772.954
772.955
772.956
772.957
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.965
772.979
772.651
772.997
772.975
772.968
772.966
772.965
772.966
772.966
772.965
772.963
772.962
772.962
772.962
772.961
772.961
772.958
772.947
772.901
772.8
772.717
772.678
772.683
772.796
773.316
774.085
774.576
774.753
774.73
774.432
773.703
773.161
772.876
772.774
772.762
772.782
772.844
772.892
772.921
772.937
772.946
772.951
772.954
772.956
772.957
772.958
772.959
772.959
772.959
772.959
772.959
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.96
772.959
772.959
772.958
772.958
772.957
772.956
772.956
772.955
772.954
772.953
772.951
772.95
772.949
772.947
772.946
772.944
772.942
772.941
772.939
772.937
772.935
772.933
772.932
772.93
772.928
772.927
772.925
772.924
772.923
772.922
772.921
772.921
772.92
772.92
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.925
772.926
772.928
772.93
772.932
772.934
772.936
772.938
772.94
772.942
772.944
772.946
772.948
772.95
772.952
772.954
772.956
772.958
772.96
772.962
772.963
772.965
772.966
772.968
772.969
772.97
772.971
772.972
772.973
772.974
772.975
772.975
772.975
772.964
772.982
772.625
773.021
772.998
772.99
772.987
772.986
772.987
772.988
772.988
772.988
772.983
772.979
772.977
772.976
772.978
772.985
773.01
773.099
773.437
774.775
778.336
781.918
784.353
785.513
785.729
785.329
782.811
777.862
774.263
772.199
771.306
771.1
771.181
771.652
772.216
772.563
772.759
772.862
772.914
772.939
772.952
772.957
772.961
772.962
772.963
772.964
772.964
772.964
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.965
772.966
772.966
772.966
772.966
772.966
772.966
772.966
772.966
772.966
772.965
772.965
772.965
772.965
772.965
772.964
772.964
772.963
772.963
772.962
772.962
772.961
772.96
772.959
772.958
772.957
772.955
772.954
772.952
772.951
772.949
772.947
772.946
772.944
772.942
772.94
772.939
772.937
772.935
772.934
772.932
772.931
772.929
772.928
772.927
772.926
772.926
772.925
772.925
772.925
772.925
772.925
772.926
772.927
772.928
772.929
772.93
772.932
772.933
772.935
772.937
772.939
772.941
772.943
772.945
772.947
772.949
772.951
772.953
772.956
772.958
772.96
772.962
772.963
772.965
772.967
772.969
772.97
772.972
772.973
772.974
772.975
772.977
772.978
772.979
772.979
772.98
772.98
772.98
772.97
772.984
772.656
773.081
773.103
773.113
773.12
773.123
773.125
773.127
773.128
773.129
773.129
773.129
773.129
773.128
773.127
773.125
773.122
773.116
773.108
773.095
773.07
773.081
773.094
773.101
773.105
773.106
773.107
773.108
773.107
773.106
773.105
773.103
773.101
773.099
773.097
773.093
773.089
773.083
773.075
773.062
773.04
773.082
773.095
773.103
773.106
773.109
773.112
773.113
773.114
773.115
773.115
773.114
773.114
773.113
773.111
773.109
773.105
773.1
773.092
773.078
773.054
773.08
773.092
773.099
773.102
773.104
773.105
773.106
773.106
773.105
773.104
773.103
773.101
773.099
773.097
773.094
773.09
773.085
773.076
773.064
773.042
773.077
773.089
773.098
773.101
773.104
773.106
773.108
773.108
773.109
773.109
773.108
773.107
773.106
773.104
773.101
773.097
773.092
773.083
773.069
773.046
773.074
773.085
773.093
773.096
773.098
773.1
773.1
773.101
773.1
773.1
773.099
773.097
773.096
773.094
773.091
773.087
773.081
773.073
773.059
773.038
773.064
773.074
773.083
773.087
773.092
773.095
773.096
773.097
773.097
773.098
773.097
773.096
773.094
773.091
773.088
773.084
773.078
773.069
773.055
773.037
773.047
773.056
773.062
773.065
773.065
773.066
773.066
773.066
773.065
773.065
773.065
773.064
773.063
773.061
773.058
773.055
773.05
773.043
773.032
773.019
773.028
773.035
773.04
773.043
773.046
773.049
773.051
773.052
773.052
773.051
773.05
773.048
773.047
773.044
773.041
773.037
773.032
773.026
773.018
773.008
773.006
773.011
773.014
773.015
773.016
773.015
773.014
773.013
773.014
773.014
773.015
773.014
773.015
773.014
773.013
773.011
773.009
773.005
773.001
772.995
772.984
772.984
772.984
772.984
772.985
772.987
772.988
772.989
772.989
772.987
772.986
772.984
772.983
772.981
772.979
772.977
772.976
772.975
772.975
772.976
772.954
772.951
772.947
772.945
772.942
772.94
772.937
772.936
772.936
772.937
772.939
772.941
772.943
772.945
772.948
772.95
772.954
772.958
772.963
772.968
772.916
772.909
772.901
772.898
772.896
772.897
772.897
772.897
772.895
772.894
772.892
772.891
772.889
772.888
772.888
772.889
772.893
772.9
772.914
772.921
772.86
772.847
772.834
772.825
772.818
772.812
772.808
772.806
772.807
772.809
772.812
772.817
772.825
772.835
772.847
772.863
772.877
772.895
772.913
772.935
772.819
772.803
772.787
772.78
772.777
772.774
772.771
772.77
772.77
772.769
772.77
772.77
772.772
772.774
772.778
772.785
772.796
772.811
772.831
772.854
772.793
772.774
772.755
772.745
772.74
772.737
772.735
772.735
772.737
772.74
772.743
772.748
772.754
772.761
772.77
772.782
772.796
772.812
772.832
772.854
772.771
772.749
772.729
772.72
772.715
772.71
772.706
772.702
772.7
772.698
772.697
772.697
772.697
772.699
772.704
772.712
772.725
772.741
772.765
772.795
772.75
772.724
772.701
772.692
772.688
772.686
772.686
772.688
772.692
772.698
772.704
772.712
772.721
772.731
772.742
772.756
772.773
772.792
772.815
772.844
772.73
772.703
772.678
772.667
772.658
772.651
772.642
772.637
772.631
772.628
772.624
772.622
772.621
772.621
772.628
772.631
772.65
772.666
772.694
772.73
772.737
772.7
772.667
772.655
772.653
772.654
772.658
772.662
772.672
772.68
772.691
772.701
772.715
772.728
772.745
772.762
772.786
772.809
772.839
772.876
772.985
772.966
772.961
772.96
772.96
772.959
772.957
772.954
772.952
772.951
772.951
772.954
772.986
773.197
774.304
777.355
779.849
780.94
781.057
780.379
777.402
774.193
772.453
771.783
771.679
771.815
772.254
772.586
772.767
772.858
772.901
772.921
772.93
772.935
772.937
772.938
772.938
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.939
772.939
772.939
772.938
772.937
772.937
772.936
772.935
772.933
772.932
772.93
772.929
772.927
772.925
772.923
772.92
772.918
772.916
772.914
772.911
772.909
772.907
772.905
772.904
772.902
772.901
772.9
772.899
772.899
772.899
772.899
772.9
772.901
772.902
772.904
772.905
772.908
772.91
772.912
772.915
772.918
772.92
772.923
772.926
772.929
772.932
772.934
772.937
772.939
772.942
772.944
772.946
772.948
772.949
772.951
772.952
772.954
772.955
772.956
772.957
772.958
772.958
772.959
772.959
772.96
772.96
772.961
772.961
772.961
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.961
772.961
772.96
772.96
772.959
772.958
772.957
772.956
772.954
772.953
772.951
772.949
772.947
772.945
772.943
772.941
772.938
772.936
772.934
772.931
772.929
772.927
772.926
772.924
772.923
772.921
772.921
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.926
772.928
772.93
772.933
772.935
772.938
772.941
772.943
772.946
772.949
772.952
772.954
772.957
772.959
772.962
772.964
772.966
772.968
772.97
772.971
772.973
772.974
772.975
772.976
772.977
772.978
772.979
772.979
772.98
772.98
772.981
772.981
772.982
772.982
772.982
772.982
772.982
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.984
772.984
772.984
772.984
772.984
772.984
772.984
772.984
772.984
772.985
772.985
772.985
772.985
772.986
772.986
772.986
772.987
772.987
772.988
772.988
772.989
772.99
772.991
772.992
772.993
772.994
772.995
772.996
772.998
772.999
773.001
773.002
773.004
773.006
773.008
773.011
773.013
773.016
773.018
773.021
773.024
773.027
773.031
773.034
773.038
773.041
773.045
773.05
773.054
773.058
773.063
773.068
773.072
773.078
773.083
773.088
773.094
773.1
773.106
773.112
773.118
773.124
773.131
773.138
773.145
773.152
773.159
773.167
773.174
773.182
773.19
773.198
773.206
773.214
773.222
773.231
773.239
773.248
773.256
773.264
773.273
773.281
773.29
773.298
773.307
773.315
773.324
773.332
773.341
773.35
773.359
773.368
773.378
773.387
773.397
773.408
773.418
773.43
773.441
773.453
773.466
773.479
773.493
773.507
773.521
773.536
773.552
773.568
773.585
773.601
773.618
773.636
773.654
773.672
773.69
773.708
773.727
773.746
773.764
773.783
773.802
773.821
773.84
773.859
773.878
773.898
773.917
773.936
773.955
773.974
773.994
774.013
774.032
774.052
774.071
774.091
774.111
774.13
774.15
774.17
774.191
774.211
774.231
774.252
774.272
774.293
774.314
774.335
774.356
774.378
774.399
774.421
774.443
774.465
774.487
774.509
774.532
774.554
774.577
774.6
774.623
774.646
774.669
774.693
774.716
774.74
774.764
774.788
774.812
774.836
774.861
774.885
774.91
774.935
774.96
774.985
775.011
775.036
775.062
775.087
775.113
775.139
775.165
775.191
775.218
775.244
775.271
775.297
775.324
775.351
775.378
775.406
775.433
775.46
775.488
775.516
775.543
775.571
775.599
775.627
775.656
775.684
775.713
775.741
775.77
775.799
775.827
775.856
775.885
775.915
775.944
775.973
776.003
776.032
776.062
776.092
776.122
776.152
776.182
776.212
776.242
776.272
776.302
776.333
776.363
776.394
776.425
776.455
776.486
776.517
776.548
776.579
776.61
776.641
776.673
776.704
776.735
776.767
776.798
776.83
776.861
776.893
776.925
776.956
776.988
777.02
777.052
777.084
777.116
777.148
777.18
777.212
777.244
777.276
777.309
777.341
777.373
777.406
777.438
777.47
777.503
777.535
777.568
777.6
777.633
777.665
777.698
777.731
777.763
777.796
777.828
777.861
777.894
777.926
777.959
777.992
778.024
778.057
778.09
778.122
778.155
778.188
778.22
778.253
778.286
778.318
778.351
778.384
778.416
778.449
778.481
778.514
778.547
778.579
778.612
778.644
778.677
778.709
778.741
778.774
778.806
778.838
778.871
778.903
778.935
778.967
779
779.032
779.064
779.096
779.128
779.16
779.191
779.223
779.255
779.287
779.318
779.35
779.382
779.413
779.444
779.476
779.507
779.539
779.569
779.601
779.631
779.664
779.693
779.726
779.754
779.788
779.815
779.85
779.875
779.911
779.936
779.972
779.996
780.032
772.961
772.944
772.94
772.938
772.936
772.936
772.936
772.937
772.937
772.936
772.928
772.911
772.901
772.898
772.907
773.002
773.446
774.148
774.583
774.728
774.687
774.296
773.567
773.111
772.904
772.843
772.84
772.858
772.89
772.909
772.919
772.925
772.929
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.913
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.162
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.741
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.989
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.975
772.956
772.951
772.951
772.951
772.949
772.947
772.945
772.944
772.944
772.943
772.943
772.936
772.897
772.744
772.553
772.46
772.446
772.493
772.772
773.186
773.396
773.449
773.441
773.357
773.181
773.06
772.989
772.953
772.937
772.931
772.93
772.93
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.968
772.951
772.946
772.945
772.945
772.945
772.945
772.942
772.939
772.938
772.938
772.938
772.936
772.924
772.85
772.601
772.363
772.257
772.244
772.308
772.62
772.997
773.195
773.252
773.245
773.168
773.056
772.988
772.952
772.937
772.931
772.93
772.93
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.973
772.956
772.951
772.95
772.95
772.95
772.95
772.947
772.944
772.943
772.943
772.943
772.942
772.933
772.873
772.642
772.383
772.255
772.231
772.271
772.508
772.847
773.039
773.111
773.118
773.09
773.018
772.969
772.944
772.933
772.93
772.929
772.93
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.971
772.955
772.95
772.95
772.95
772.95
772.95
772.948
772.946
772.945
772.945
772.945
772.945
772.938
772.892
772.7
772.453
772.322
772.291
772.316
772.49
772.775
772.946
773.017
773.03
773.021
772.983
772.951
772.936
772.93
772.928
772.929
772.93
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.977
772.963
772.959
772.957
772.957
772.957
772.956
772.954
772.952
772.951
772.951
772.951
772.951
772.948
772.924
772.816
772.65
772.554
772.526
772.537
772.629
772.8
772.906
772.953
772.965
772.963
772.949
772.936
772.93
772.928
772.928
772.929
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.974
772.962
772.958
772.957
772.958
772.959
772.959
772.959
772.959
772.957
772.956
772.956
772.956
772.955
772.95
772.917
772.827
772.759
772.732
772.731
772.755
772.828
772.885
772.914
772.926
772.928
772.928
772.927
772.927
772.928
772.929
772.931
772.932
772.933
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.978
772.972
772.972
772.97
772.969
772.969
772.969
772.969
772.968
772.968
772.968
772.968
772.969
772.969
772.966
772.946
772.889
772.843
772.824
772.822
772.83
772.862
772.893
772.91
772.919
772.923
772.925
772.927
772.929
772.93
772.931
772.932
772.933
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.98
772.976
772.975
772.975
772.976
772.977
772.978
772.979
772.979
772.979
772.978
772.978
772.979
772.979
772.979
772.973
772.943
772.896
772.867
772.856
772.855
772.864
772.886
772.903
772.915
772.922
772.926
772.929
772.931
772.932
772.933
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.98
772.982
772.984
772.982
772.982
772.982
772.982
772.982
772.982
772.983
772.984
772.987
772.99
772.991
772.991
772.988
772.968
772.918
772.879
772.859
772.854
772.855
772.868
772.891
772.908
772.92
772.927
772.931
772.933
772.934
772.935
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.986
772.992
772.994
772.995
772.996
772.998
772.999
772.999
772.999
772.999
773
773.001
773.004
773.005
773.005
773.001
772.979
772.918
772.867
772.84
772.833
772.834
772.848
772.879
772.903
772.919
772.928
772.933
772.936
772.936
772.936
772.936
772.935
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.972
772.987
772.991
772.99
772.99
772.99
772.99
772.991
772.992
772.993
772.995
773.001
773.006
773.008
773.007
773.001
772.968
772.888
772.828
772.799
772.791
772.795
772.819
772.863
772.895
772.916
772.928
772.934
772.937
772.938
772.938
772.937
772.936
772.935
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
773.009
773.025
773.03
773.032
773.033
773.035
773.036
773.036
773.036
773.036
773.036
773.038
773.041
773.041
773.037
773.013
772.915
772.802
772.742
772.721
772.72
772.735
772.791
772.85
772.889
772.914
772.928
772.936
772.939
772.939
772.939
772.938
772.937
772.936
772.935
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.962
772.98
772.986
772.987
772.987
772.987
772.987
772.988
772.99
772.992
772.993
772.995
773.002
773.007
773.007
772.997
772.935
772.794
772.699
772.659
772.654
772.671
772.742
772.82
772.873
772.906
772.924
772.934
772.938
772.939
772.939
772.939
772.937
772.936
772.935
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.965
772.982
772.987
772.989
772.99
772.989
772.989
772.989
772.991
772.993
772.994
772.996
773.001
773.015
773.019
773.015
772.972
772.836
772.723
772.673
772.664
772.677
772.737
772.816
772.87
772.904
772.924
772.934
772.938
772.94
772.94
772.939
772.937
772.936
772.935
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.934
772.957
772.964
772.966
772.967
772.967
772.966
772.967
772.968
772.974
772.977
772.979
772.983
773.006
773.049
773.063
773.056
772.99
772.849
772.764
772.733
772.734
772.76
772.825
772.875
772.907
772.925
772.935
772.939
772.94
772.94
772.939
772.937
772.936
772.936
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.973
772.991
772.997
772.999
772.999
772.999
772.998
772.998
772.999
773.003
773.006
773.007
773.01
773.029
773.122
773.251
773.3
773.298
773.23
773.065
772.958
772.911
772.9
772.903
772.916
772.931
772.939
772.942
772.943
772.943
772.941
772.939
772.938
772.936
772.936
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.912
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.161
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.74
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.988
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
772.905
772.935
772.942
772.946
772.947
772.947
772.947
772.948
772.948
772.953
772.96
772.962
772.962
772.962
772.968
773.04
773.373
773.78
773.962
773.993
773.956
773.759
773.48
773.281
773.149
773.065
773.013
772.982
772.963
772.951
772.945
772.94
772.938
772.937
772.936
772.935
772.935
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.934
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.935
772.934
772.934
772.934
772.933
772.933
772.932
772.931
772.93
772.929
772.928
772.927
772.925
772.923
772.922
772.92
772.917
772.915
772.913
772.911
772.908
772.906
772.904
772.902
772.9
772.898
772.897
772.896
772.895
772.894
772.894
772.893
772.894
772.894
772.895
772.897
772.898
772.9
772.902
772.905
772.907
772.91
772.913
772.915
772.918
772.921
772.924
772.926
772.929
772.932
772.934
772.936
772.939
772.941
772.942
772.944
772.946
772.947
772.948
772.95
772.951
772.952
772.952
772.953
772.954
772.954
772.955
772.955
772.955
772.956
772.956
772.956
772.956
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.957
772.956
772.956
772.956
772.955
772.954
772.954
772.953
772.952
772.95
772.949
772.948
772.946
772.944
772.942
772.94
772.938
772.935
772.933
772.931
772.928
772.926
772.924
772.922
772.92
772.919
772.917
772.916
772.915
772.915
772.915
772.915
772.915
772.916
772.918
772.919
772.921
772.923
772.925
772.927
772.93
772.933
772.935
772.938
772.941
772.944
772.946
772.949
772.952
772.954
772.956
772.959
772.961
772.963
772.964
772.966
772.967
772.969
772.97
772.971
772.972
772.973
772.974
772.974
772.975
772.975
772.976
772.976
772.976
772.977
772.977
772.977
772.977
772.977
772.977
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.978
772.979
772.979
772.979
772.979
772.979
772.979
772.979
772.98
772.98
772.98
772.98
772.981
772.981
772.982
772.982
772.983
772.983
772.984
772.985
772.985
772.986
772.987
772.988
772.99
772.991
772.992
772.994
772.995
772.997
772.999
773.001
773.003
773.005
773.008
773.01
773.013
773.016
773.019
773.022
773.025
773.029
773.032
773.036
773.04
773.044
773.049
773.053
773.058
773.062
773.067
773.072
773.078
773.083
773.089
773.094
773.1
773.106
773.113
773.119
773.126
773.133
773.14
773.147
773.154
773.162
773.169
773.177
773.185
773.193
773.201
773.209
773.217
773.226
773.234
773.242
773.251
773.259
773.268
773.276
773.285
773.293
773.301
773.31
773.319
773.327
773.336
773.345
773.354
773.363
773.372
773.382
773.392
773.403
773.413
773.424
773.436
773.448
773.461
773.474
773.487
773.502
773.516
773.531
773.547
773.563
773.579
773.596
773.613
773.631
773.649
773.667
773.685
773.703
773.722
773.741
773.759
773.778
773.797
773.816
773.835
773.854
773.873
773.892
773.912
773.931
773.95
773.969
773.989
774.008
774.027
774.047
774.066
774.086
774.106
774.125
774.145
774.165
774.185
774.206
774.226
774.247
774.267
774.288
774.309
774.33
774.351
774.373
774.394
774.416
774.438
774.46
774.482
774.504
774.526
774.549
774.572
774.595
774.618
774.641
774.664
774.688
774.711
774.735
774.759
774.783
774.807
774.831
774.856
774.88
774.905
774.93
774.955
774.98
775.006
775.031
775.057
775.082
775.108
775.134
775.16
775.186
775.213
775.239
775.266
775.293
775.319
775.346
775.374
775.401
775.428
775.456
775.483
775.511
775.539
775.567
775.595
775.623
775.651
775.679
775.708
775.736
775.765
775.794
775.823
775.852
775.881
775.91
775.939
775.969
775.998
776.028
776.057
776.087
776.117
776.147
776.177
776.207
776.237
776.267
776.298
776.328
776.359
776.389
776.42
776.451
776.482
776.513
776.543
776.575
776.606
776.637
776.668
776.699
776.731
776.762
776.794
776.825
776.857
776.888
776.92
776.952
776.984
777.016
777.047
777.079
777.111
777.144
777.176
777.208
777.24
777.272
777.304
777.337
777.369
777.401
777.434
777.466
777.499
777.531
777.564
777.596
777.629
777.661
777.694
777.726
777.759
777.792
777.824
777.857
777.89
777.922
777.955
777.988
778.02
778.053
778.086
778.118
778.151
778.184
778.216
778.249
778.282
778.314
778.347
778.38
778.412
778.445
778.478
778.51
778.543
778.575
778.608
778.64
778.673
778.705
778.738
778.77
778.802
778.835
778.867
778.899
778.931
778.964
778.996
779.028
779.06
779.092
779.124
779.156
779.188
779.22
779.251
779.283
779.315
779.346
779.378
779.41
779.441
779.472
779.504
779.535
779.566
779.598
779.628
779.66
779.689
779.723
779.75
779.785
779.811
779.846
779.872
779.908
779.932
779.969
779.993
780.029
773.031
773.049
773.053
773.053
773.053
773.054
773.056
773.058
773.057
773.046
772.988
772.933
772.924
772.961
773.228
774.109
774.988
775.489
775.678
775.693
775.574
775.046
774.36
773.852
773.502
773.272
773.13
773.045
772.997
772.971
772.956
772.949
772.944
772.942
772.941
772.94
772.94
772.94
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.939
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.94
772.939
772.939
772.939
772.938
772.937
772.937
772.936
772.935
772.933
772.932
772.93
772.929
772.927
772.925
772.923
772.92
772.918
772.916
772.914
772.911
772.909
772.907
772.905
772.904
772.902
772.901
772.9
772.899
772.899
772.899
772.899
772.9
772.901
772.902
772.904
772.905
772.908
772.91
772.912
772.915
772.918
772.92
772.923
772.926
772.929
772.932
772.934
772.937
772.939
772.942
772.944
772.946
772.948
772.949
772.951
772.952
772.954
772.955
772.956
772.957
772.958
772.958
772.959
772.959
772.96
772.96
772.961
772.961
772.961
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.962
772.961
772.961
772.96
772.96
772.959
772.958
772.957
772.956
772.954
772.953
772.951
772.949
772.947
772.945
772.943
772.941
772.938
772.936
772.934
772.931
772.929
772.927
772.926
772.924
772.923
772.921
772.921
772.92
772.92
772.92
772.921
772.922
772.923
772.924
772.926
772.928
772.93
772.933
772.935
772.938
772.941
772.943
772.946
772.949
772.952
772.954
772.957
772.959
772.962
772.964
772.966
772.968
772.97
772.971
772.973
772.974
772.975
772.976
772.977
772.978
772.979
772.979
772.98
772.98
772.981
772.981
772.982
772.982
772.982
772.982
772.982
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.983
772.984
772.984
772.984
772.984
772.984
772.984
772.984
772.984
772.984
772.985
772.985
772.985
772.985
772.986
772.986
772.986
772.987
772.987
772.988
772.988
772.989
772.99
772.991
772.992
772.993
772.994
772.995
772.996
772.998
772.999
773.001
773.002
773.004
773.006
773.008
773.011
773.013
773.016
773.018
773.021
773.024
773.027
773.031
773.034
773.038
773.041
773.045
773.05
773.054
773.058
773.063
773.068
773.072
773.078
773.083
773.088
773.094
773.1
773.106
773.112
773.118
773.124
773.131
773.138
773.145
773.152
773.159
773.167
773.174
773.182
773.19
773.198
773.206
773.214
773.222
773.231
773.239
773.248
773.256
773.264
773.273
773.281
773.29
773.298
773.307
773.315
773.324
773.332
773.341
773.35
773.359
773.368
773.378
773.387
773.397
773.408
773.418
773.43
773.441
773.453
773.466
773.479
773.493
773.507
773.521
773.536
773.552
773.568
773.585
773.601
773.618
773.636
773.654
773.672
773.69
773.708
773.727
773.746
773.764
773.783
773.802
773.821
773.84
773.859
773.878
773.898
773.917
773.936
773.955
773.974
773.994
774.013
774.032
774.052
774.071
774.091
774.111
774.13
774.15
774.17
774.191
774.211
774.231
774.252
774.272
774.293
774.314
774.335
774.356
774.378
774.399
774.421
774.443
774.465
774.487
774.509
774.532
774.554
774.577
774.6
774.623
774.646
774.669
774.693
774.716
774.74
774.764
774.788
774.812
774.836
774.861
774.885
774.91
774.935
774.96
774.985
775.011
775.036
775.062
775.087
775.113
775.139
775.165
775.191
775.218
775.244
775.271
775.297
775.324
775.351
775.378
775.406
775.433
775.46
775.488
775.516
775.543
775.571
775.599
775.627
775.656
775.684
775.713
775.741
775.77
775.799
775.827
775.856
775.885
775.915
775.944
775.973
776.003
776.032
776.062
776.092
776.122
776.152
776.182
776.212
776.242
776.272
776.302
776.333
776.363
776.394
776.425
776.455
776.486
776.517
776.548
776.579
776.61
776.641
776.673
776.704
776.735
776.767
776.798
776.83
776.861
776.893
776.925
776.956
776.988
777.02
777.052
777.084
777.116
777.148
777.18
777.212
777.244
777.276
777.309
777.341
777.373
777.406
777.438
777.47
777.503
777.535
777.568
777.6
777.633
777.665
777.698
777.731
777.763
777.796
777.828
777.861
777.894
777.926
777.959
777.992
778.024
778.057
778.09
778.122
778.155
778.188
778.22
778.253
778.286
778.318
778.351
778.384
778.416
778.449
778.481
778.514
778.547
778.579
778.612
778.644
778.677
778.709
778.741
778.774
778.806
778.838
778.871
778.903
778.935
778.967
779
779.032
779.064
779.096
779.128
779.16
779.191
779.223
779.255
779.287
779.318
779.35
779.382
779.413
779.444
779.476
779.507
779.539
779.569
779.601
779.631
779.664
779.693
779.726
779.754
779.788
779.815
779.85
779.875
779.911
779.936
779.972
779.996
780.032
)
;
boundaryField
{
inlet
{
type zeroGradient;
}
outlet
{
type zeroGradient;
}
sides
{
type empty;
}
walls
{
type zeroGradient;
}
}
// ************************************************************************* //
|
|
8a50b06870274809cc2a9887d92cea59d6cd7af3
|
f17a88ddef74abe099a0c9d9d9aa91b90075959c
|
/Code/Runtime/Asset/Ops/AssetDeleteOp.h
|
ad8385a4237a63ecdfbc3b2ea631bcde1f782074
|
[
"MIT",
"Apache-2.0"
] |
permissive
|
NathanSaidas/LiteForgeMirror
|
bf4b0feb9702b590b510f98f32a3cc1d472f9bb0
|
dcb7f690378dd0abe0d1dc3e2783510ce9462fde
|
refs/heads/master
| 2022-06-12T11:55:06.321048
| 2022-05-30T04:37:59
| 2022-05-30T04:37:59
| 184,840,363
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 2,989
|
h
|
AssetDeleteOp.h
|
#pragma once
// ********************************************************************
// Copyright (c) 2020 Nathan Hanlan
//
// 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 "Runtime/Asset/AssetOp.h"
namespace lf {
DECLARE_MANAGED_CPTR(AssetTypeInfo);
// This asset operation is started on the main thread and has the job of
// making it impossible to start other asset operations on target 'AssetTypeInfo'
//
// Threads: [ Main Thread ]
// Supported Modes: [ Developer Mode, Modder Mode ]
//
// 1. Acquire the 'write' lock of the asset type
// 2. Mark deleted
// 3. Remove from data controller (Find=null)
// 4. Delete Source
// 5. Delete Cache
// 6. Update Cache Map
//
// 1. Mark the 'AssetTypeInfo' as deleted,
// 2. Remove the 'AssetTypeInfo' from the DataController
// 3. Unload the asset runtime from the AssetPrototype
// 4. Remove the asset data from the cache
// 5. Optionally move asset source to 'tmp' or delete
//
// This operation is not expected to be complete after 'Execute' is called
//
// Creators of 'Asset Instances' should gracefully cleanup the instances and destroy them.
class LF_RUNTIME_API AssetDeleteOp : public AssetOp
{
public:
using Super = AssetOp;
AssetDeleteOp(const AssetTypeInfoCPtr& type, const AssetOpDependencyContext& context);
~AssetDeleteOp() override = default;
AssetOpThread::Value GetExecutionThread() const override;
protected:
void OnUpdate() override;
void OnCancelled() override;
void OnFailure() override;
void OnComplete() override;
private:
void Unlock();
enum DeleteOpState
{
Validate,
AcquireWriteLock,
UpdateDataController,
UpdateSourceController,
UpdateCacheController,
ReleaseWriteLock,
Done
};
DeleteOpState mDeleteState;
AssetTypeInfoCPtr mType;
bool mLocked;
};
} // namespace lf
|
251aee31190f522ce53e03e4b797b51394a65f02
|
785073523bf04e66432ac7c99af628362e0b9732
|
/selective/HardeningUtils.cpp
|
9caafdc33c2d2e4420d1287bf9df487a1baea15e
|
[] |
no_license
|
gabrielseibel1/DIANA-FT
|
69a73c6bb57f593fcbe9066ac36a36e2493d7280
|
930591a7bf31b4c2b89f0ebde3ace21a88dbb91c
|
refs/heads/master
| 2020-03-20T01:52:50.460631
| 2018-10-04T01:13:55
| 2018-10-04T01:13:55
| 137,091,852
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 911
|
cpp
|
HardeningUtils.cpp
|
//
// Created by gabriel on 7/7/18.
//
#include <fstream>
#include "HardeningUtils.h"
void onSDCDetected() {
int previousSDCs;
//open file as `in` to read it
std::ifstream fileIn(sdcDetectionsFilename);
//get SDCs reported until now
if (!fileIn.is_open())
previousSDCs = 0;
else {
fileIn >> previousSDCs;
fileIn.close();
}
//open file as `out` to write to it
std::ofstream fileOut(sdcDetectionsFilename, std::ofstream::trunc);
if (!fileOut.is_open()) {
fprintf(stderr, "Can't open %s as ofstream to report SDC\n", sdcDetectionsFilename);
exit(EXIT_FAILURE);
}
fileOut << previousSDCs + 1;
fileOut.close();
//infinite loop and wait to be killed
for (int j = 0; j < 42; j++) {
printf(".");
j--;
}
}
bool assertEqual(int a, int b) {
if (a == b) return true;
onSDCDetected();
}
|
7a172b82473d12b173275313acfa46c0e5642205
|
6471a4d0df9c5ed9a7d1fd9cb64e3306366c3dee
|
/FinalProject/parser.cpp
|
0b6eb3f2313e078e3180ec7af4ee2bd4db95c340
|
[] |
no_license
|
argnsoccer/Final-Project
|
d69f973ec83059d1e6e049b31a768522beabe578
|
f03757a6be741656eb03bf3128970ecf652b41a4
|
refs/heads/master
| 2021-01-10T19:20:50.945858
| 2014-12-08T11:08:14
| 2014-12-08T11:08:14
| 26,942,946
| 0
| 1
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,074
|
cpp
|
parser.cpp
|
#include "parser.h"
Parser::Parser()
{
}
AVLTree *Parser::parse(char *fileName)
{
xml_document<> doc;
inputFile = new file<>(fileName);
doc.parse<0>((*inputFile).data());//creates the DOM tree
char* start;
char* endWord;
char* pageStart;
bool stopWord;
curNode = doc.first_node()->first_node("page");//goes to first <page> marking
xml_node<>* titleNode;
AVLIndex = new AVLTree();
int page = 1;
int stemEnd;
char* buffer;
bool hasWord = false;
int length;
while(curNode != nullptr)
{
titleNode = curNode->first_node("title");
start = titleNode->next_sibling("revision")->first_node("text")->value();//takes iterator to first text in page
pageStart = start;
endWord = strchr(start, ' ');//gets first word
while(endWord != nullptr)
{
string inputWord(start, endWord);//creates string to be indexed
prepWord(inputWord);//preps the word to be indexed
start = endWord+1;//moves the char pointer to the start of the next word
endWord = strchr(start,' ');//gets the ending of the word
stopWord = removeStopWords(inputWord);//removes if stop word
buffer = const_cast<char*>(inputWord.c_str());//casts as non-const to pass in
length = strlen(buffer)-1;//sets to length minus 1 to be pointing to the last char
stemEnd = stem(buffer, 0, length);//gets the end of the new string
inputWord = inputWord.substr(0, stemEnd);//creates a new truncated (stemmed) string
if(stopWord == false)
{
hasWord = AVLIndex->search(page, inputWord, AVLIndex->getRoot());//checks to see if word is already in index
if(hasWord == false)
{
AVLIndex->setRoot(AVLIndex->insert(inputWord, page, AVLIndex->getRoot()));
}
}
}
curNode = curNode->next_sibling("page");
webPage.setPage(page);//sets page number
webPage.setText(pageStart);//sets the pageText
webPage.setTitle(titleNode->value());
pages.push_back(webPage);//adds the page to the vector of pages
page++;
cout << page << endl;//poor man's loading bar
}
return AVLIndex;
}
bool Parser::removeStopWords(string& word)
{
ifstream fileReader;
set<string> StopWords;
string temp;
fileReader.open("stopwords_en.txt");
while(fileReader.eof() == false)
{
getline(fileReader,temp);//puts all the stop words in a set
StopWords.insert(temp);
}
if(StopWords.find(word) == StopWords.end())//checks if set contains word (if stop word)
{
return false;
}
else
{
return true;
}
}
void Parser::prepWord(string &word)
{
word.erase(std::remove_if(word.begin(), word.end(), std::not1(std::ptr_fun(::isalnum))), word.end());//removes non alphanumeric chars
transform(word.begin(), word.end(), word.begin(), ::tolower);//forces to lowercase
}
|
b49b24c175239a0767854d285f60593e1577f113
|
4418f86b56eb89e0bf83d1cb61d67e30fbf0cab9
|
/helperfiles/misc/QuadControl-cpp-master/Ground_station/src/vicon_data_custom.h
|
80be18bdc09a773d3fb1eaf18b5d786f7a9e897b
|
[] |
no_license
|
nadurthi/ros_roverbot_ws
|
95441893610d64010e4f4c44b94dc6300e77c6fb
|
9f1330d30c170b817a8df3d229d63082eec6697d
|
refs/heads/master
| 2020-12-29T21:53:00.650936
| 2020-02-10T16:41:02
| 2020-02-10T16:41:02
| 238,745,801
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 11,107
|
h
|
vicon_data_custom.h
|
///////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) OMG Plc 2009.
// All rights reserved. This software is protected by copyright
// law and international treaties. No part of this software / document
// may be reproduced or distributed in any form or by any means,
// whether transiently or incidentally to some other use of this software,
// without the written permission of the copyright owner.
//
///////////////////////////////////////////////////////////////////////////////
#ifndef _VICONMODULE_H_
#define _VICONMODULE_H_
#include "Client.h"
#include <iostream>
#include <string>
#include <time.h>
#include <sys/time.h>
#include <unistd.h>
using namespace std;
using namespace ViconDataStreamSDK::CPP;
namespace
{
std::string Adapt( const bool i_Value )
{
return i_Value ? "True" : "False";
}
std::string Adapt( const Direction::Enum i_Direction )
{
switch( i_Direction )
{
case Direction::Forward:
return "Forward";
case Direction::Backward:
return "Backward";
case Direction::Left:
return "Left";
case Direction::Right:
return "Right";
case Direction::Up:
return "Up";
case Direction::Down:
return "Down";
default:
return "Unknown";
}
}
std::string Adapt( const DeviceType::Enum i_DeviceType )
{
switch( i_DeviceType )
{
case DeviceType::ForcePlate:
return "ForcePlate";
case DeviceType::Unknown:
default:
return "Unknown";
}
}
std::string Adapt( const Unit::Enum i_Unit )
{
switch( i_Unit )
{
case Unit::Meter:
return "Meter";
case Unit::Volt:
return "Volt";
case Unit::NewtonMeter:
return "NewtonMeter";
case Unit::Newton:
return "Newton";
case Unit::Unknown:
default:
return "Unknown";
}
}
}
class Vicon_data {
string Quadname,Marker1,Marker2,Marker3,Marker4,Marker5,Marker6,Marker7,Marker8,Marker9;
Client MyClient;
double Data[8]; //[t,x,y,z,q0,q1,q2,q3] t is from start
std::string HostName;
struct timeval tv;
struct timezone tz;
double Tsec,T0sec;
public:
void initialize(int delay){
Quadname="ryan";
Marker1="backup";
Marker2="rightdown";
Marker3="frontdown2";
Marker4="frontdown1";
Marker5="rightup";
Marker6="leftup";
Marker7="leftdown";
Marker8="backdown";
Marker9="center";
HostName="10.0.0.1";
bool TransmitMulticast = false;
while( !MyClient.IsConnected().Connected )
{ MyClient.Connect( HostName );
sleep(delay);
}
MyClient.EnableSegmentData();
MyClient.EnableMarkerData();
MyClient.EnableUnlabeledMarkerData();
MyClient.EnableDeviceData();
//MyClient.SetStreamMode( ViconDataStreamSDK::CPP::StreamMode::ServerPush );
//MyClient.SetStreamMode( ViconDataStreamSDK::CPP::StreamMode::ClientPullPreFetch );
MyClient.SetStreamMode( ViconDataStreamSDK::CPP::StreamMode::ClientPull );
MyClient.SetAxisMapping( Direction::Forward,Direction::Left,Direction::Up );
//read some values to stabilize
for(int i=0;i<25;i++){
while( MyClient.GetFrame().Result != Result::Success )
{ sleep(1);}
usleep(9000);//sleep for 9 ms
}
gettimeofday(&tv,&tz);
T0sec=(double)tv.tv_sec+(double)(tv.tv_usec)/1000000;
cout<<"ready"<<endl;
}
/*
* Get the vicon body data and the marker data too
*/
double * GetData(double * X,double * MarkerX){
while( MyClient.GetFrame().Result != Result::Success )
{ sleep(1);}
//timestamping
gettimeofday(&tv,&tz);
Tsec=(double)tv.tv_sec+(double)(tv.tv_usec)/1000000-T0sec;
unsigned int SubjectCount = MyClient.GetSubjectCount().SubjectCount;
for( unsigned int SubjectIndex = 0 ; SubjectIndex < SubjectCount ; ++SubjectIndex )
{
// Get the subject name
std::string SubjectName = MyClient.GetSubjectName( SubjectIndex ).SubjectName;
if(SubjectName.compare(Quadname)!=0){
continue;
}
// Count the number of segments
unsigned int SegmentCount = MyClient.GetSegmentCount( SubjectName ).SegmentCount;
for( unsigned int SegmentIndex = 0 ; SegmentIndex < SegmentCount ; ++SegmentIndex )
{
// Get the segment name
std::string SegmentName = MyClient.GetSegmentName( SubjectName, SegmentIndex ).SegmentName;
if(SegmentName.compare(Quadname)!=0){
continue;
}
X[0]=Tsec;
Output_GetSegmentGlobalTranslation _Output_GetSegmentGlobalTranslation = MyClient.GetSegmentGlobalTranslation( SubjectName, SegmentName );
X[1]=_Output_GetSegmentGlobalTranslation.Translation[ 0 ]/1000;
X[2]=_Output_GetSegmentGlobalTranslation.Translation[ 1 ]/1000;
X[3]=_Output_GetSegmentGlobalTranslation.Translation[ 2 ]/1000;
Output_GetSegmentGlobalRotationQuaternion _Output_GetSegmentGlobalRotationQuaternion =MyClient.GetSegmentGlobalRotationQuaternion( SubjectName, SegmentName );
X[4]=_Output_GetSegmentGlobalRotationQuaternion.Rotation[ 3 ];
X[5]=_Output_GetSegmentGlobalRotationQuaternion.Rotation[ 0 ];
X[6]=_Output_GetSegmentGlobalRotationQuaternion.Rotation[ 1 ];
X[7]=_Output_GetSegmentGlobalRotationQuaternion.Rotation[ 2 ];
}
// Count the number of markers for this subject
unsigned int MarkerCount = MyClient.GetMarkerCount( SubjectName ).MarkerCount;
// std::cout << " Markers (" << MarkerCount << "):" << std::endl;
for( unsigned int MarkerIndex = 0 ; MarkerIndex < MarkerCount ; ++MarkerIndex )
{
// Get the marker name
std::string MarkerName = MyClient.GetMarkerName( SubjectName, MarkerIndex ).MarkerName;
// Get the marker parent
std::string MarkerParentName = MyClient.GetMarkerParentName( SubjectName, MarkerName ).SegmentName;
// Get the global marker translation
Output_GetMarkerGlobalTranslation _Output_GetMarkerGlobalTranslation =
MyClient.GetMarkerGlobalTranslation( SubjectName, MarkerName );
if(MarkerName.compare(Marker1)==0){
MarkerX[0]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[1]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[2]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker2)==0){
MarkerX[3]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[4]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[5]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker3)==0){
MarkerX[6]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[7]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[8]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker4)==0){
MarkerX[9]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[10]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[11]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker5)==0){
MarkerX[12]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[13]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[14]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker6)==0){
MarkerX[15]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[16]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[17]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker7)==0){
MarkerX[18]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[19]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[20]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker8)==0){
MarkerX[21]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[22]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[23]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
if(MarkerName.compare(Marker9)==0){
MarkerX[24]=_Output_GetMarkerGlobalTranslation.Translation[ 0 ]/1000;
MarkerX[25]=_Output_GetMarkerGlobalTranslation.Translation[ 1 ]/1000;
MarkerX[26]=_Output_GetMarkerGlobalTranslation.Translation[ 2 ]/1000;
}
/*
* std::cout << " Marker #" << MarkerIndex << ": "
<< MarkerName << " ("
<< _Output_GetMarkerGlobalTranslation.Translation[ 0 ] << ", "
<< _Output_GetMarkerGlobalTranslation.Translation[ 1 ] << ", "
<< _Output_GetMarkerGlobalTranslation.Translation[ 2 ] << ") "
<< Adapt( _Output_GetMarkerGlobalTranslation.Occluded ) << std::endl;
*/
}
}
return X;
}
void SetT0sec(){
gettimeofday(&tv,&tz);
T0sec=(double)tv.tv_sec+(double)(tv.tv_usec)/1000000;
}
void disconnect(){
MyClient.DisableSegmentData();
MyClient.DisableMarkerData();
MyClient.DisableUnlabeledMarkerData();
MyClient.DisableDeviceData();
MyClient.Disconnect();
}
};
#endif
|
227696081df6b653f6297fbcf756ec80f7b6d968
|
214dbcc732e0f6a49336164c793bd4af4754a6f7
|
/Algorithmics/Problems from various contests/bile3.cpp
|
61cde53b13756930d21f41b103d13182b9563f87
|
[] |
no_license
|
IrinaMBejan/Personal-work-contests
|
f878c25507a8bfdab3f7af8d55b780d7632efecb
|
4ab2841244a55d074d25e721aefa56431e508c43
|
refs/heads/master
| 2021-01-20T08:24:47.492233
| 2017-05-03T12:22:26
| 2017-05-03T12:22:26
| 90,142,452
| 1
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 791
|
cpp
|
bile3.cpp
|
#include <fstream>
#define Nmax 2005
using namespace std;
ifstream fin("bile3.in");
ofstream fout("bile3.out");
int N;
int A[Nmax],C[Nmax], B[Nmax];
char S[Nmax*2];
int main()
{
fin>>N;
int i;
for(i=1; i<=N; i++)
fin>>A[i];
for(i=1; i<=N; i++)
fin>>C[i];
int k=1, ok=1, j=0;
int lg=-1;
i=1;
while(k<=N && ok)
{
ok=0;
if(B[j]==C[k])
{
ok=1;
S[++lg]='O';
k++;
j--;
}
else
for(; i<=N && !ok ; i++)
{
B[++j]=A[i];
S[++lg]='I';
if(B[j] ==C[k])
ok=1;
}
}
if(ok==0)
fout<<"imposibil";
else fout<<S;
fout<<'\n';
return 0;
}
|
7db706cd21e68597fbaf9f6c6f5e2e580aa0246f
|
cc2d24f86650c1cec87e05ffe9e14f661eb7dcb3
|
/signal_SPGR_DE.h
|
414da39a4a880c8eb49b2067aee18b86a36bf71d
|
[] |
no_license
|
mriphysics/mcDESPOT
|
ea10e64669b1533888f39f3c8a6c7f7fd7e52817
|
839ff041eeff6b01cd01e4811071e547ed99ba68
|
refs/heads/master
| 2021-06-16T08:29:23.488869
| 2021-03-09T13:10:50
| 2021-03-09T13:10:50
| 175,249,698
| 2
| 2
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 612
|
h
|
signal_SPGR_DE.h
|
#ifndef __signal_SPGR_DE_h__
#define __signal_SPGR_DE_h__
#include <Eigen/Core>
#include <limits>
#include "NaN.h"
class SPGR_steady_state_M0
{
public:
SPGR_steady_state_M0 () :
params (5)
{
params = Eigen::VectorXd::Constant(5,1,NaN);
}
void compute ();
double& T1_F() { return params[0]; }
double& T1_S() { return params[1]; }
double& M0_F() { return params[2]; }
double& k_FS() { return params[3]; }
double& TR() { return params[4]; }
Eigen::VectorXd params;
Eigen::VectorXd FA;
Eigen::MatrixXd Mss;
Eigen::VectorXd Mss_Sig;
};
#endif
|
3ee33c602d3a1e40073d3410a45a5fb9e91c8144
|
c728261f153d8ddd9fe96982e1a9c940fd314b71
|
/build/cpp/qtcore/QPoint_wrapper.cpp
|
7aee02240f272bcae254ec7643d0836a8bb1029b
|
[] |
no_license
|
alynch4047/sqt
|
7382f309721a266ceeea67e3cbbdf5f2da2a15eb
|
86c45e30b952bdaaee9326461ec65f0c1bf05143
|
refs/heads/master
| 2020-06-06T11:16:10.632432
| 2014-02-22T11:18:44
| 2014-02-22T11:18:44
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,004
|
cpp
|
QPoint_wrapper.cpp
|
/*
* CPP Wrapper for QPoint
*/
#include <instance_tracker.h>
#include <qpoint.h>
// These externs declare the functions in the D wrapper, used for virtual method calls
extern "C" void SMID_QPoint_destructor(void* wrappedObject);
// This class is used to wrap virtual and protected methods. All instances created
// from D will be instantiated using this class.
class QPoint_SMI: QPoint {
public:
bool inhibitDestructorCallbackToD;
// Constructors
public:
static QPoint_SMI* SMIMake_QPoint() {
QPoint_SMI* retVal = new QPoint_SMI();
registerDInstance(retVal);
return retVal;
};
private:
QPoint_SMI(): QPoint() {inhibitDestructorCallbackToD = false;};
public:
static QPoint_SMI* SMIMake_QPoint(int xpos, int ypos) {
QPoint_SMI* retVal = new QPoint_SMI(xpos, ypos);
registerDInstance(retVal);
return retVal;
};
private:
QPoint_SMI(int xpos, int ypos): QPoint(xpos, ypos) {inhibitDestructorCallbackToD = false;};
// Protected and virtual method calls
public:
// Destructor
~QPoint_SMI() {
if (! inhibitDestructorCallbackToD) {
deregisterDInstance(this);
SMID_QPoint_destructor(this);
}
}
};
//END VIRTUAL / PROTECTED CLASS
extern "C" int QPoint_manhattanLength_SMIX3(QPoint* self) {
int retValue = self->manhattanLength();
return retValue;
}
extern "C" QPoint_SMI* QPoint_QPoint_SMIX4() {
QPoint_SMI* obj = QPoint_SMI::SMIMake_QPoint();
return obj;
}
extern "C" QPoint_SMI* QPoint_QPoint_SMIX5(int xpos, int ypos) {
QPoint_SMI* obj = QPoint_SMI::SMIMake_QPoint(xpos, ypos);
return obj;
}
extern "C" bool QPoint_isNull_SMIX8(QPoint* self) {
bool retValue = self->isNull();
return retValue;
}
extern "C" int QPoint_x_SMIX11(QPoint* self) {
int retValue = self->x();
return retValue;
}
extern "C" int QPoint_y_SMIX12(QPoint* self) {
int retValue = self->y();
return retValue;
}
extern "C" void QPoint_setX_SMIX13(QPoint* self, int xpos) {
self->setX(xpos);
}
extern "C" void QPoint_setY_SMIX14(QPoint* self, int ypos) {
self->setY(ypos);
}
extern "C" QPoint& QPoint_operatorplusequals_SMIX15(QPoint* self, const QPoint& p) {
QPoint& retValue = self->operator+=(p);
return retValue;
}
extern "C" QPoint& QPoint_operatorminusequals_SMIX16(QPoint* self, const QPoint& p) {
QPoint& retValue = self->operator-=(p);
return retValue;
}
extern "C" QPoint& QPoint_operatortimesequals_SMIX17(QPoint* self, int c) {
QPoint& retValue = self->operator*=(c);
return retValue;
}
extern "C" QPoint& QPoint_operatortimesequals_SMIX18(QPoint* self, double c) {
QPoint& retValue = self->operator*=(c);
return retValue;
}
/*
* Function to delete CPP objects, called from D destructor
*/
extern "C" void SMI_delete_QPoint_CPPObject(QPoint* obj) {
delete obj;
}
/*
* Function to delete CPP Wrapper objects, called from D destructor
*/
extern "C" void SMI_delete_QPoint_SMI_CPPObject(QPoint_SMI* obj) {
deregisterDInstance(obj);
obj->inhibitDestructorCallbackToD = true;
delete obj;
}
// End CPP Wrapper for QPoint
|
04e69b32bd92a06a7747cf3dedab4320ff39feed
|
eefd00f309bcfad68e0f6cf7245d17cefe033c99
|
/秋招/8.27 2016/数据结构_逆序打印链表/数据结构_逆序打印链表/main.cpp
|
3b51aa1607c3343b71b3aa1160de2365df66c570
|
[] |
no_license
|
gujinyue1010/2016GraduationFindJob
|
a794b213784cb71d86735175a20ec1f30e9fa24f
|
1e61df1cf1df374219af59c24b9198aeb44c2586
|
refs/heads/master
| 2020-06-11T09:49:57.597426
| 2016-12-06T02:44:16
| 2016-12-06T02:44:16
| 75,686,502
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,338
|
cpp
|
main.cpp
|
//
// main.cpp
// 数据结构_逆序打印链表
//
// Created by 顾金跃 on 16/8/27.
// Copyright © 2016年 顾金跃. All rights reserved.
//
/*
链表逆序输出:
(1)借用栈:栈是先进后出的，链表前面的元素在栈底，后面的元素在栈顶。
(2)先逆置链表，再顺序输出。
(3)利用递归。
(4)利用数组。
*/
#include <iostream>
#include <stack>
using namespace std;
typedef struct ListNode
{
int data;
struct ListNode *next;
}ListNode,*List;
//创建链表
void CreateList(List head);
//打印链表
void PrintList(List head);
//逆序打印链表
void ReversePrintList(List head);
//逆置链表(前插法)
List ReverseList(List head);
//递归打印链表(使链表逆序输出)
void fun(List head);
int main(int argc, const char * argv[]) {
//分配链表头节点
ListNode *head;
head = (ListNode *)malloc(sizeof(ListNode));
head->data = -1;
head->next = NULL;
CreateList(head);
PrintList(head);
//ReversePrintList(head);
// cout<<"************************"<<endl;
// PrintList(ReverseList(head));
cout<<"递归实现链表的逆序输出:";
fun(head);
return 0;
}
void CreateList(List head)
{
ListNode *p,*q;
p = head;
for (int i=1;i<=10;i++)
{
q = (ListNode *)malloc(sizeof(ListNode));
q->data = i;
q->next = NULL;
p->next = q;
p = q;
}
}
void PrintList(List head)
{
ListNode *p = head->next;
while (p)
{
cout<<p->data<<" ";
p = p->next;
}
cout<<endl;
}
void ReversePrintList(List head)
{
//遍历链表，然后加入栈，利用栈先进后出的特性。
ListNode *p = head->next;
stack<int> stack;
while (p)
{
stack.push(p->data);
p = p->next;
}
while (!stack.empty())
{
cout<<stack.top()<<" ";
stack.pop();
}
cout<<endl;
}
List ReverseList(List head)
{
// ListNode *newHead = (ListNode *)malloc(sizeof(ListNode));
// newHead->data = -1;
// newHead->next = NULL;
ListNode *p = head->next;
ListNode *q = p;
head->next = NULL;
while (p)
{
q = q->next;
p->next = head->next;
head->next = p;
p = q;
}
return head;
}
void fun(List head)
{
ListNode *p = head;
if (!p)
{
return ;
}
fun(p->next);
cout<<p->data<<" ";
}
|
bac75eeaf6bcae21b78ff271438a08e6786ec895
|
4e62fa9da73e1a30773c6e589493a90bcbe7a31a
|
/IntelligentTransportation/Network/protocol.h
|
3abe28c17e651cf88475d797882b57994672680f
|
[] |
no_license
|
yeholdon/IntelligentTransportation
|
f7cd681b7d423a412f311770ac0f01a99e5886cb
|
c0367f2ce75a51c2739ec8c181e49f509317b656
|
refs/heads/master
| 2020-06-19T12:13:14.066682
| 2019-07-18T03:24:05
| 2019-07-18T03:24:05
| 196,702,073
| 8
| 3
| null | 2019-07-18T03:24:06
| 2019-07-13T09:14:20
|
C++
|
UTF-8
|
C++
| false
| false
| 823
|
h
|
protocol.h
|
#ifndef PROTOCOL_H
#define PROTOCOL_H
// 协议类
#include <QObject>
#include <QJsonObject> // json对象,以键值对形式
#include <QJsonDocument> // json文档，提供数据
#include <QJsonArray> // json数组，可以放json对象，也可放标准数据类型
class Protocol : public QObject
{
Q_OBJECT
public:
explicit Protocol(QObject *parent = nullptr);
// 1. 信息的唯一标识符 2. 之后每两个参数就是一个键值对。默认参数更灵活
static QByteArray packData(int type, QString key1 = "", QString value1 = "",
QString key2 = "", QString value2 = "",
QString key3 = "", QString value3 = "",
QString key4 = "", QString value4 = "");
signals:
public slots:
};
#endif // PROTOCOL_H
|
69fc0df1adbff254a22cfbeb405a0c6d50ed6846
|
398c971ecc11761bfe4296e038da7dcdc373cd61
|
/code/Queue.h
|
c001cb7027f6fc3fa1022a934d26dc0885e02eab
|
[] |
no_license
|
FuXin-1024/code
|
df3b17dd8f2d65e7e244c5eb5981a49474a56724
|
08dbeff97c1ffdc97ef56db4dd4a58aec5d35aa1
|
refs/heads/master
| 2021-01-17T09:12:58.950332
| 2017-09-29T02:26:32
| 2017-09-29T02:26:32
| 95,556,445
| 0
| 0
| null | null | null | null |
GB18030
|
C++
| false
| false
| 833
|
h
|
Queue.h
|
#pragma once
#include<iostream>
#include<stack>
#include<assert.h>
using namespace std;
//两个栈实现一个队列
template<class T>
class Queue
{
public:
void Push(const T& x)
{
s1.push(x);
}
void Pop()
{
if (s1.empty() && s2.empty())
{
cout << "Queue is NULL" << endl;
return;
}
if (s2.empty())
{
while (s1.size() > 1)
{
s2.push(s1.top());
s1.pop();
}
s1.pop();
}
else
s2.pop();
}
T front()
{
assert(s1.size() > 1 || s2.size() > 1);
if (s2.empty())
{
while (!s1.empty())
{
s2.push(s1.top());
s1.pop();
}
}
return s2.top();
}
private:
stack<T> s1;
stack<T> s2;
};
void QueueTest()
{
Queue<int> q;
//q.front();
q.Pop();
q.Push(1);
q.Push(2);
q.Push(3);
q.Push(4);
q.Pop();
q.Pop();
q.Push(5);
q.Push(6);
cout << q.front() << endl;
}
|
e5367495ad9e9900659c2127938cc8f2bd9e93b6
|
36d854a1b56213feba7fa2a4bde50ce56821f820
|
/src/continuum/continuum_import.hpp
|
e1013dabba1d5e22c40e76fc8137bb8a84b1c576
|
[] |
no_license
|
Slight-wpx/A-parallel-3D-lattice-Boltzmann-CFD-solver
|
893653981db196e09fa0e8b687f37649f4fbf5cb
|
d7a1d57fbcebb8784c89c3d7889c1cc4817a4a69
|
refs/heads/master
| 2023-04-11T14:27:57.821904
| 2021-04-25T17:08:48
| 2021-04-25T17:08:48
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,143
|
hpp
|
continuum_import.hpp
|
#ifndef LBT_CONTINUUM_IMPORT
#define LBT_CONTINUUM_IMPORT
/**
* \file continuum_import.hpp
* \mainpage Class members for importing macroscopic values
* \author Tobit Flatscher (github.com/2b-t)
*/
#include <iostream>
#include <filesystem>
#include <fstream>
#include <memory>
#include <sstream>
#include <string>
#include "../general/paths.hpp"
template <unsigned int NX, unsigned int NY, unsigned int NZ, typename T>
void Continuum<NX,NY,NZ,T>::importBin(std::string const& name, unsigned int const step) noexcept
{
std::filesystem::create_directories(path::outputBin);
std::string const fileName = path::outputBin + std::string("/") + name + std::string("_") + std::to_string(step) + std::string(".bin");
auto const importFile = std::unique_ptr<FILE, decltype(&fclose)>( fopen(fileName.c_str(), "rb+"), &fclose );
if(importFile != nullptr)
{
std::fread(M, 1, memorySize, importFile.get());
}
else
{
std::cerr << "Fatal Error: File '" << fileName << "' could not be opened." << std::endl;
std::exit(EXIT_FAILURE);
}
return;
}
#endif // LBT_CONTINUUM_IMPORT
|
1a9e0efd15ddd522b4d4cf913bc095188a45b866
|
c41b3f4d3b0c8a1098faa739f94e406b52661fed
|
/move zeroes to end .cpp
|
5b653dd7545cbea826e63cca3e3c8209cb51f2c9
|
[] |
no_license
|
sukhpreet-singh1/Algorithms
|
33b917bfb2ea7ef1c4279ff691744cdbfacc6ca0
|
65891610dc5bb677c8cce0bd7753efee483792ce
|
refs/heads/master
| 2023-04-28T23:28:21.816836
| 2021-05-25T16:01:17
| 2021-05-25T16:01:17
| 343,027,716
| 2
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 449
|
cpp
|
move zeroes to end .cpp
|
void moveZeroes(vector<int>& nums) {
int index=0;
int count=0;
for(int i=0;i<nums.size();++i)
{
if(nums[i]==0)
{
count++;
continue;
}
else
{
nums[index]=nums[i];
index++;
}
}
for(int i=0;i<count;++i)
{
nums[nums.size()-1-i]=0;
}
}
|
1d6aaa03beb62d1f54ffc4495828b57dbdbd3844
|
cba6468b4c297856e5f1f12f52063c1332d123d0
|
/COMP 371/Assignment 1/VS2017/src/Shader.cpp
|
5460272af8488252953e04a6f15f3a718adf1634
|
[] |
no_license
|
neoJINXD/Concordia-Projects
|
578595e65ecf098067d0013a4e09e957d44f3d3b
|
06fe93befa82c5ab22680012963005706a401dc8
|
refs/heads/master
| 2022-06-22T22:13:16.932278
| 2022-04-07T00:02:35
| 2022-04-07T00:02:35
| 171,685,283
| 1
| 2
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 2,647
|
cpp
|
Shader.cpp
|
#include "Shader.h"
#include <iostream>
#include <fstream>
#include <sstream>
#ifndef GLEW_STATIC
#define GLEW_STATIC 1
#endif
#include <GL/glew.h>
Shader::Shader(string vertFilePath, string fragFilePath) {
vertShader = readShaderFile(vertFilePath.c_str());
fragShader = readShaderFile(fragFilePath.c_str());
compileShader();
linkShader();
};
Shader::~Shader() {};
string Shader::readShaderFile(const char* fileName) {
string content;
std::ifstream input(fileName, std::ios::in);
//Kills program if file stream fails to initiate
if (!input.good()) {
std::cerr << "INVALID FILE" << std::endl;
exit(-1);//NOT GOOD PRACTICE
}
//Reads from file
if (input.is_open()) {
std::stringstream ss;
ss << input.rdbuf();
content = ss.str();
input.close();
}
return content;
};
void Shader::compileShader() {
// vertex shader
//int vertID = glCreateShader(GL_VERTEX_SHADER);
vertShaderID = glCreateShader(GL_VERTEX_SHADER);
const char* vertSource = vertShader.c_str();
glShaderSource(vertShaderID, 1, &vertSource, NULL);
glCompileShader(vertShaderID);
// check for shader compile errors
int success;
char infoLog[512];
glGetShaderiv(vertShaderID, GL_COMPILE_STATUS, &success);
if (!success)
{
glGetShaderInfoLog(vertShaderID, 512, NULL, infoLog);
std::cerr << "ERROR::SHADER::VERTEX::COMPILATION_FAILED\n" << infoLog << std::endl;
}
// fragment shader
fragShaderID = glCreateShader(GL_FRAGMENT_SHADER);
const char* fragSource = fragShader.c_str();
glShaderSource(fragShaderID, 1, &fragSource, NULL);
glCompileShader(fragShaderID);
// check for shader compile errors
glGetShaderiv(fragShaderID, GL_COMPILE_STATUS, &success);
if (!success)
{
glGetShaderInfoLog(fragShaderID, 512, NULL, infoLog);
std::cerr << "ERROR::SHADER::VERTEX::COMPILATION_FAILED\n" << infoLog << std::endl;
}
}
void Shader::linkShader() {
// link shaders
shaderProgram = glCreateProgram();
glAttachShader(shaderProgram, vertShaderID);
glAttachShader(shaderProgram, fragShaderID);
glLinkProgram(shaderProgram);
// check for linking errors
int success;
char infoLog[512];
glGetProgramiv(shaderProgram, GL_LINK_STATUS, &success);
if (!success) {
glGetProgramInfoLog(shaderProgram, 512, NULL, infoLog);
std::cerr << "ERROR::SHADER::PROGRAM::LINKING_FAILED\n" << infoLog << std::endl;
}
glDetachShader(shaderProgram, vertShaderID);
glDetachShader(shaderProgram, fragShaderID);
glDeleteShader(vertShaderID);
glDeleteShader(fragShaderID);
}
|
7e302b7bd2b91a2034971a715be2517d6a5a730e
|
3cd3e19b0d8bf6225ebff4a9b1545cb2b2ca4570
|
/flexvolume/windows/utils/iscsiHelper/iscsiHelper/iscsiHelper.cpp
|
e674eacc97f4f33dd885a953b8d97945c59bca6d
|
[
"LicenseRef-scancode-generic-cla",
"MIT"
] |
permissive
|
microsoft/K8s-Storage-Plugins
|
d0a6831ef24934bd126237b653c26c348b62af87
|
6628bdad1b79029b4194fbaff2f49f1f2222b976
|
refs/heads/master
| 2023-09-06T06:24:45.962915
| 2022-11-28T19:11:14
| 2022-11-28T19:11:14
| 130,767,566
| 28
| 17
|
MIT
| 2022-11-28T19:11:16
| 2018-04-23T23:16:55
|
PowerShell
|
UTF-8
|
C++
| false
| false
| 15,989
|
cpp
|
iscsiHelper.cpp
|
// iscsiHelper.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#define NOMINMAX
#include <windows.h>
#define _NTSCSI_USER_MODE_
#include "scsi.h"
#include "iscsierr.h"
#include "Iscsidsc.h"
#include <iostream>
#include <optional>
#include <variant>
#include <vector>
#include <array>
#include <sstream>
#include <locale>
#include <codecvt>
#include <string>
#include <algorithm>
#include <limits>
#include "iscsiutil.h"
using namespace std;
#define PhysicalLocationBaseName L"\\\\.\\PhysicalDrive"
void PrintRegistrationKeys(HANDLE hDevice)
{
auto keys = ReadKeys(hDevice);
if (!keys.IsError())
{
wcout << "We have read the registration keys, and there are " << keys.GetValue().size() << "\n";
for (const auto & key : keys.GetValue())
{
wcout << key << "\n";
}
}
else
{
wcout << L"Error reading keys " << keys.GetError() << "\n";
}
}
int PrintHelp()
{
cout << "Print Help\n";
cout << R"(#define RESERVATION_ACTION_READ_KEYS 0x00
#define RESERVATION_ACTION_READ_RESERVATIONS 0x01
#define RESERVATION_ACTION_REGISTER 0x00
#define RESERVATION_ACTION_RESERVE 0x01
#define RESERVATION_ACTION_RELEASE 0x02
#define RESERVATION_ACTION_CLEAR 0x03
#define RESERVATION_ACTION_PREEMPT 0x04
#define RESERVATION_ACTION_PREEMPT_ABORT 0x05
#define RESERVATION_ACTION_REGISTER_IGNORE_EXISTING 0x06
#define RESERVATION_SCOPE_LU 0x00
#define RESERVATION_SCOPE_ELEMENT 0x02
#define RESERVATION_TYPE_WRITE_EXCLUSIVE 0x01
#define RESERVATION_TYPE_EXCLUSIVE 0x03
#define RESERVATION_TYPE_WRITE_EXCLUSIVE_REGISTRANTS 0x05
#define RESERVATION_TYPE_EXCLUSIVE_REGISTRANTS 0x06)";
return 1;
}
int wmain(int argc, wchar_t * argv[])
{
std::optional<DWORD> diskNumber;
std::optional<ULONGLONG> key;
std::optional<ULONGLONG> serviceKey;
std::optional<DWORD> type;
std::optional<DWORD> scope;
std::optional<DWORD> offline;
std::optional<DWORD> readonly;
bool dumpCommand = false;
bool reserveCommand = false;
bool preemptCommand = false;
bool registerCommand = false;
bool releaseCommand = false;
bool clearCommand = false;
bool setAttributesCommand = false;
bool getReservations = false;
bool getSessions = false;
bool getRegistrations = false;
std::array<pair<bool&, std::wstring>, 10> commands{
pair<bool&, std::wstring> { dumpCommand, L"dump" }
,pair<bool&, std::wstring> { reserveCommand, L"reserve" }
,pair<bool&, std::wstring> { preemptCommand, L"preempt" }
,pair<bool&, std::wstring> { registerCommand, L"register" }
,pair<bool&, std::wstring> { releaseCommand, L"release" }
,pair<bool&, std::wstring> { clearCommand, L"clear" }
,pair<bool&, std::wstring> { setAttributesCommand, L"setAttributes" }
,pair<bool&, std::wstring> { getSessions, L"IscsiSessions" }
,pair<bool&, std::wstring> { getReservations, L"getReservations" }
,pair<bool&, std::wstring> { getRegistrations, L"getRegistrations" } };
bool foundCommand = false;
for (int i = 0; i < argc; ++i)
{
auto command = std::wstring(argv[i]);
if (command == L"-disk")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
diskNumber = std::stoul(std::wstring(argv[++i]));
continue;
}
if (command == L"-key")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
key = std::stoull(std::wstring(argv[++i]));
continue;
}
if (command == L"-type")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
type = std::stoul(std::wstring(argv[++i]));
continue;
}
if (command == L"-scope")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
scope = std::stoul(std::wstring(argv[++i]));
continue;
}
if (command == L"-servicekey")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
serviceKey = std::stoull(std::wstring(argv[++i]));
continue;
}
if (command == L"-offline")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
offline = std::stoul(std::wstring(argv[++i]));
continue;
}
if (command == L"-readonly")
{
if (i + 1 >= argc)
{
return PrintHelp();
}
readonly = std::stoul(std::wstring(argv[++i]));
continue;
}
for (auto & possibleCommand : commands)
{
if (command == possibleCommand.second)
{
possibleCommand.first = true;
if (foundCommand)
{
wcout << L"Extra parameter " << command << "\n";
return PrintHelp();
}
foundCommand = true;
}
}
}
if (getSessions)
{
ULONG sessionCount = 0;
TypedBuffer<ISCSI_SESSION_INFOW> sessions(50);
ULONG buffSize = (ULONG)(sessions.size());
HRESULT hr;
while ((hr = GetIScsiSessionListW(&buffSize, &sessionCount, sessions.GetPtr())) == ERROR_INSUFFICIENT_BUFFER)
{
sessions.resize(buffSize);
}
if (hr != ERROR_SUCCESS)
{
return hr;
}
wcout << L"Disk,Lun,TargetName";
vector<ISCSI_DEVICE_ON_SESSIONW> devices(10);
for (ULONG i = 0; i < sessionCount; ++i)
{
ISCSI_SESSION_INFOW & sessionInfo = sessions.GetPtr()[i];
ULONG deviceCount = (ULONG)devices.size();
while ((hr = GetDevicesForIScsiSessionW(&sessionInfo.SessionId, &deviceCount, devices.data())) == ERROR_INSUFFICIENT_BUFFER)
{
devices.resize(devices.size() * 2);
deviceCount = (ULONG)devices.size();
}
if (hr == ERROR_SUCCESS)
{
for (ULONG j = 0; j < deviceCount; ++j)
{
wcout << L"\n"
<< devices[j].StorageDeviceNumber.DeviceNumber << L","
<< ULONG(devices[j].ScsiAddress.Lun) << L","
<< sessionInfo.TargetName;
}
}
else
{
// we are just going to eat errors and have the caller determine if they couldn't find the lun
//return hr;
}
}
return 0;
}
if (!diskNumber.has_value())
{
cout << "No disk was specified \n";
return PrintHelp();
}
std::wstring driveLocation;
{
std::wstringstream command;
command << PhysicalLocationBaseName << diskNumber.value();
driveLocation = command.str();
}
HANDLE hDevice = CreateFileW(driveLocation.c_str(), // drive to open
0, // no access to the drive
FILE_SHARE_READ | FILE_SHARE_WRITE, //
NULL, // default security attributes
OPEN_EXISTING, // disposition
FILE_ATTRIBUTE_NORMAL, // file attributes
NULL); // do not copy file attributes
if (hDevice == INVALID_HANDLE_VALUE) // cannot open the drive
{
DWORD err = ::GetLastError();
cout << "Error opening drive with no access error " << err << "\n";
return EnsureError(err);
}
HANDLE readHandle = CreateFileW(driveLocation.c_str(), // drive to open
GENERIC_READ, // read/write
FILE_SHARE_READ | FILE_SHARE_WRITE, //
NULL, // default security attributes
OPEN_EXISTING, // disposition
FILE_ATTRIBUTE_NORMAL, // file attributes
NULL); // do not copy file attributes
if (readHandle == INVALID_HANDLE_VALUE) // cannot open the drive
{
DWORD err = ::GetLastError();
cout << "Error opening drive with read access error " << err << "\n";
return EnsureError(err);
}
HANDLE readWriteHandle = CreateFileW(driveLocation.c_str(), // drive to open
GENERIC_READ | GENERIC_WRITE, // read/write
FILE_SHARE_READ | FILE_SHARE_WRITE, //
NULL, // default security attributes
OPEN_EXISTING, // disposition
FILE_ATTRIBUTE_NORMAL, // file attributes
NULL); // do not copy file attributes
if (readWriteHandle == INVALID_HANDLE_VALUE) // cannot open the drive
{
DWORD err = ::GetLastError();
cout << "Error opening drive with read access error " << err << "\n";
return EnsureError(err);
}
if (dumpCommand)
{
wcout << L"Dumping registrations and reservations for disk " << driveLocation << L"\n\n";
auto keys = ReadKeys(readHandle);
auto reservations = ReadReservations(readHandle);
if (keys.IsError())
{
cout << "Error reading registration keys : " << keys.GetError() << "\n";
return keys.GetError();
}
cout << "Registration count : " << keys.GetValue().size() << "\n";
for (const auto & regKey : keys.GetValue())
{
cout << regKey << "\n";
}
cout << "\n";
if (reservations.IsError())
{
cout << "Error reading reservation keys : " << reservations.GetError() << "\n";
return reservations.GetError();
}
cout << "Reservation count : " << reservations.GetValue().size() << "\n";
if (reservations.GetValue().size() > 0)
{
cout << "key\ttype\tscope\taddress\n";
}
for (const auto & reservation : reservations.GetValue())
{
cout << reservation.key << "\t"
<< reservation.type << "\t"
<< reservation.scope << "\t"
<< reservation.address << "\n";
}
cout << "\n";
}
if (registerCommand)
{
if (!key.has_value())
{
cout << "missing parameter key\n";
return PrintHelp();
}
DWORD error = PRRegisterKey(readWriteHandle, key.value());
if (error != 0)
{
cout << "Registering key failed with error " << error << "\n";
return error;
}
}
if (preemptCommand)
{
if (!key.has_value())
{
cout << "missing parameter key\n";
return PrintHelp();
}
if (!scope.has_value())
{
cout << "missing parameter scope\n";
return PrintHelp();
}
if (!type.has_value())
{
cout << "missing parameter type\n";
return PrintHelp();
}
if (!serviceKey.has_value())
{
cout << "missing parameter servicekey\n";
return PrintHelp();
}
DWORD error = PRPreemptCommand(readWriteHandle,
key.value(),
serviceKey.value(),
scope.value(),
type.value());
if (error != 0)
{
cout << "Reservation failed with error " << error << "\n";
return error;
}
}
if (reserveCommand)
{
if (!key.has_value())
{
cout << "missing parameter key\n";
return PrintHelp();
}
if (!scope.has_value())
{
cout << "missing parameter scope\n";
return PrintHelp();
}
if (!type.has_value())
{
cout << "missing parameter type\n";
return PrintHelp();
}
DWORD error = PRReserveCommand(readWriteHandle,
key.value(),
scope.value(),
type.value());
if (error != 0)
{
cout << "Reservation failed with error " << error << "\n";
return error;
}
}
if (releaseCommand)
{
if (!key.has_value())
{
cout << "missing parameter key\n";
return PrintHelp();
}
if (!scope.has_value())
{
cout << "missing parameter scope\n";
return PrintHelp();
}
if (!type.has_value())
{
cout << "missing parameter type\n";
return PrintHelp();
}
DWORD error = PRReleaseKey(readWriteHandle,
key.value(),
scope.value(),
type.value());
if (error != 0)
{
cout << "Release failed with error " << error << "\n";
return error;
}
}
if (setAttributesCommand)
{
if (!readonly.has_value())
{
cout << "missing parameter readonly\n";
return PrintHelp();
}
if (!offline.has_value())
{
cout << "missing parameter offline\n";
return PrintHelp();
}
DWORD error = OfflineDisk(readWriteHandle,
offline.value() == 1,
readonly.value() == 1);
if (error != 0)
{
cout << "Offline disk failed with error " << error << "\n";
return error;
}
}
if (getReservations)
{
wcout << L"Reservations for disk " << driveLocation << L"";
auto reservations = ReadReservations(readHandle);
if (reservations.IsError())
{
cout << "\nError reading reservations keys : " << reservations.GetError() << "\n";
return reservations.GetError();
}
wcout << L"\nKey,Type,Scope,Address";
auto & reservs = reservations.GetValue();
for (size_t i = 0; i < reservs.size(); ++i)
{
auto & reservation = reservs[i];
cout << "\n"
<< reservation.key
<< "," << reservation.type
<< "," << reservation.scope
<< "," << reservation.address;
}
}
if (getRegistrations)
{
wcout << L"Registrations for disk " << driveLocation << L"";
auto keys = ReadKeys(readHandle);
if (keys.IsError())
{
cout << "\nError reading registration keys : " << keys.GetError() << "\n";
return keys.GetError();
}
for (const auto & regKey : keys.GetValue())
{
cout << "\n"
<< regKey;
}
}
return 0;
}
|
eeb3b8da23db035b651c06e660b67d15b027eb78
|
556b00634d0de073f8b0268c1d1d9922a0fddda8
|
/gl_testbench/DX12/VertexBufferDX12.h
|
4dc5de77082aa1dd00c7f7454859ee0edd4bd02c
|
[] |
no_license
|
henrikvik/DV2551-3D-Programmering-3
|
191a57c92162b20566ac65ab17857f2408e99bd3
|
f2ace085863d2173cbcdd890c069b1736cb60f9c
|
refs/heads/master
| 2021-04-29T12:11:45.149884
| 2018-02-16T14:05:38
| 2018-02-16T14:05:38
| 121,724,519
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 375
|
h
|
VertexBufferDX12.h
|
#pragma once
#include "../VertexBuffer.h"
class VertexBufferDX12 : public VertexBuffer
{
public:
// Inherited via VertexBuffer
virtual void setData(const void * data, size_t size, size_t offset) override;
virtual void bind(size_t offset, size_t size, unsigned int location) override;
virtual void unbind() override;
virtual size_t getSize() override;
};
|
e00ff3472c236afe34105836736b052ae2163bfe
|
dde479d03896b14c7e076f27cff68c3f496c0100
|
/Part Two/Тест прашања случајно извлекување/main.cpp
|
d67c743e380908e6748c7f72089b67ebc3ff8c0c
|
[] |
no_license
|
MarioTalevski/FICT
|
59404904cc62261db810f05f69157e8748925713
|
9ecdaa03426100fe044a25d9188b835f1dca3eb4
|
refs/heads/master
| 2020-03-29T19:05:37.251739
| 2017-01-18T09:00:55
| 2017-01-18T09:00:55
| 60,782,461
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 2,704
|
cpp
|
main.cpp
|
#include <cstdlib>
#include <iostream>
#include <ctime>
#include <iomanip>
#include <fstream>
using namespace std;
char prasanje [7][255]={"prasanje 1:\n a)a\n b)b\n","prasanje 2:\n a)a\n b)b\n","prasanje 3:\na)a\n b)b\n","prasanje 4:\na)a\n b)b\n","prasanje 5:\na)a\n b)b\n","prasanje 6:\na)a\n b)b\n","prasanje 7:\na)a\n b)b\n"};
char resenie [7][255]={"a", "b", "a","a","b","b","a"};
int main()
{
srand(time(NULL));
int br_tocni=0;
int br_gresni=0;
int br_prasanja=0;
cout<<"Test"<<endl;
ofstream out_file("rezultati.txt");
while(true)
{
int broj=rand()%6;
if(!strlen(prasanje[broj]))
{
while(!strlen(prasanje[broj]))
broj=rand()%6;
}
char odgovor [255];
cout<<"prasanje: \n"<<prasanje[broj]<<endl;
cin>>odgovor;
cout<<endl;
if(!strcmp(odgovor, resenie[broj]))
{
br_tocni++;
br_prasanja++;
strcpy(prasanje[broj], "");
strcpy(resenie[broj],"");
cout<<odgovor<<", tocen odgovor!"<<endl;
}
else
{
br_gresni++;
br_prasanja++;
cout<<odgovor<<"Greshka. Tocen odgovor"<<resenie[broj]<<endl;
}
if(br_prasanja==5)
{
cout<<"Kraj na testot, rezultatite se vo fajlot rezultati.txt. Ocena: ";
if(br_gresni==0)
{
cout<<"10"<<endl;
out_file<<"ocena: 10"<<endl<<"tocni: "<<br_tocni<<" gresni "<<br_gresni<<endl;
}
else if(br_gresni==1)
{
cout<<"8"<<endl;
out_file<<"ocena: 8"<<endl<<"tocni: "<<br_tocni<<" gresni "<<br_gresni<<endl;
}
else if(br_gresni==2)
{
cout<<"6"<<endl;
out_file<<"ocena: 6"<<endl<<"tocni: "<<br_tocni<<" gresni "<<br_gresni<<endl;
}
else if(br_gresni>=3)
{
cout<<"5"<<endl;
out_file<<"ocena: 5"<<endl<<"tocni: "<<br_tocni<<" gresni "<<br_gresni<<endl;
}
}
cout<<endl<<"Momentalen rezultat:"<<endl;
cout<<"tocni: "<<br_tocni<<" gresni "<<br_gresni<<endl;
}
system("PAUSE");
return EXIT_SUCCESS;
}
|
18c41d8522a4759dde3a6a3d3a5226f9164461aa
|
0a4effb210bcb83b8887e1c9b823e0c3abf36a0d
|
/Кузнецова/Лаба_№4/Лаба_№4.Обход_графа_в_ширину.cpp
|
af6e2a91da44f2b62588f51dcedf2bf9f327c49a
|
[] |
no_license
|
tapoton/PLT_2017_2sem_2c_61gr
|
c357f9779ea498c66c40efc1c8b5c1a6e6a66751
|
4de6967817dcef735209cb98224e00cecc1433db
|
refs/heads/master
| 2021-01-22T09:16:37.477863
| 2017-06-05T08:51:20
| 2017-06-05T08:51:20
| 81,943,007
| 6
| 20
| null | 2017-09-23T14:12:37
| 2017-02-14T12:27:26
|
C++
|
UTF-8
|
C++
| false
| false
| 1,680
|
cpp
|
Лаба_№4.Обход_графа_в_ширину.cpp
|
#include <iostream>
#include <queue>
#include <fstream>
using namespace std;
void Init_n(int *nodes, int N)
{
for (int i = 0; i < N; i++)
nodes[i] = 0;
}
bool BFS(queue<int> Queue, int *nodes, int **a, int N, int k)
{
int node = Queue.front();
if (nodes[node] < 2)
{
Queue.pop();
nodes[node] = 2;
k++;
for (int j = 0; j < N; j++)
{
if (a[node][j] == 1 && nodes[j] == 0)
{
Queue.push(j);
nodes[j] = 1;
}
}
if (k == N - 1)
{
cout << "ДА" << endl << endl;
return 1;
}
}
else
{
cout << "НЕТ" << endl << endl;
return 0;
}
if (!Queue.empty())
BFS(Queue, nodes, a, N, k);
else
{
cout << "НЕТ" << endl << endl;
return 0;
}
}
int main()
{
setlocale(LC_ALL, "RUSSIAN");
queue<int> Queue;
bool result;
ifstream fin("input.txt");
int N;
fin >> N;
int **a = new int*[N];
for (int i = 0; i < N; i++)
a[i] = new int[N];
int *nodes = new int[N];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
fin >> a[i][j];
Init_n(nodes, N);
Queue.push(0);
cout << "Количество вершин в графе = " << N << endl;
cout << endl << "Матрица смежности вершин:" << endl;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
cout << a[i][j] << " ";
cout << endl;
}
cout << endl << "Является ли граф деревом? ";
result = BFS(Queue, nodes, a, N, 0);
ofstream fout;
fout.open("output.txt");
if (result)
fout << "ДА";
else
fout << "НЕТ";
fin.close();
fout.close();
system("PAUSE");
return 0;
}
|
1249759f43ba897551e4b456cb935bd5998ca944
|
f3580f803b472d2326bac0d987860cca35137cad
|
/ms3/utils.h
|
8e5431c5f2ec6e0ced12e5274bfdab83cb54da54
|
[] |
no_license
|
tahsinr14/OOP244-GENERAL-HOSPITAL
|
53b663dfcc32d50552810c64d3e202e9d0ad2888
|
3d0284779e71df7699889f75dea0afad1bbb1e52
|
refs/heads/main
| 2023-04-02T13:06:42.522236
| 2021-04-09T00:58:19
| 2021-04-09T00:58:19
| 327,715,161
| 1
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 860
|
h
|
utils.h
|
/*
Final Project Milestone 3
Module: utils
Filename: utils.h
Version 1.0
Author John Doe
-----------------------------------------------------------
I have done all the coding by myself and only copied the code
that my professor provided to complete my workshops and assignments.
-----------------------------------------------------------
Name: Tahsin Rahman
Student ID:
Date: November 19, 2020
Email: trahman31@myseneca.ca
*/
//professor provided code
#ifndef SDDS_UTILS_H_
#define SDDS_UTILS_H_
#include <iostream>
namespace sdds {
int getInt();
int getTime(); // returns the time of day in minutes
extern bool debug; // this makes bool sdds::debug variable in utils.cpp global to
// all the files which include: "utils.h"
//(you will learn this in detail in oop345)
}
#endif // !SDDS_UTILS_H_
|
6a4a0e0bf8e59badc017e376bc3f88bc6c1a398f
|
f8fb8d52727b3279155de614dc750dc1fc066910
|
/include/nano-caf/core/actor/shutdown_notifier.h
|
3a4b4ed312f8067c9fc6ad7020d6108c2f1d7c1a
|
[] |
no_license
|
yanxicheung/nano-caf
|
f2b95d512b9573bd0d5b5fd741eaede70c489fe0
|
16d61b1341ddded55291618678e97c66534e74d2
|
refs/heads/master
| 2023-06-02T16:15:52.182536
| 2021-06-23T11:45:50
| 2021-06-23T11:47:25
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 552
|
h
|
shutdown_notifier.h
|
//
// Created by Darwin Yuan on 2020/8/26.
//
#ifndef NANO_CAF_SHUTDOWN_NOTIFIER_H
#define NANO_CAF_SHUTDOWN_NOTIFIER_H
#include <nano-caf/nano-caf-ns.h>
#include <atomic>
NANO_CAF_NS_BEGIN
struct shutdown_notifier {
inline auto shutdown_notified() const noexcept -> bool {
return shutdown_.load(std::memory_order_relaxed);
}
inline auto notify_shutdown() -> void {
shutdown_.store(true, std::memory_order_relaxed);
}
private:
std::atomic_bool shutdown_{false};
};
NANO_CAF_NS_END
#endif //NANO_CAF_SHUTDOWN_NOTIFIER_H
|
f48206d8f19c05653aa16ca58c2ad0619d93e940
|
10178cca8d88f0de374be48dc69757069992dc86
|
/problema2.cpp
|
7351f1858cd6ca5f53403f6a2cce333cf2abb132
|
[] |
no_license
|
MirunaRux/Divide-et-impera
|
7bf08844d9963173c4603c72d31d8a6589ba2851
|
e4e08ea2338ec217019a06cbc17dead63a8c1a56
|
refs/heads/master
| 2021-01-24T09:09:43.599960
| 2018-02-26T17:38:44
| 2018-02-26T17:38:44
| 123,002,864
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,304
|
cpp
|
problema2.cpp
|
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("date.in.txt");
ofstream g("date.out.txt");
struct nod
{
int data;
nod *stg,*dr;
};
nod* newNode(int nr) ///functie care returneaza un nod cu informatia nr
{
nod *aux=new nod;
aux->stg=aux->dr=NULL;
aux->data=nr;
return aux;
}
void preOrdine(nod *root) ///parcurgerea arborelui in preordine RSD
{
if(root)
{
g<<root->data<<" ";
preOrdine(root->stg);
preOrdine(root->dr);
}
}
void inOrdine(nod *root) ///parcurgerea arborelui in inordine SRD
{
if(root)
{
inOrdine(root->stg);
g<<root->data<<" ";
inOrdine(root->dr);
}
}
void postOrdine(nod *root) ///parcurgerea arborelui in postordine SDR
{
if(root)
{
postOrdine(root->stg);
postOrdine(root->dr);
g<<root->data<<" ";
}
}
nod* Build_Tree(vector<int> &inord, vector<int> &postord,vector <int> &poz, int inordStart, int inordEnd, int &pIndex, bool &valid)
{ ///functie care construieste arborele
if(!valid) ///daca nu e valid returneaza NULL
return NULL;
if(inordStart > inordEnd) /// daca pozitia de start > pozitia de final returneaza NULL
return NULL;
nod *node = newNode(postord[pIndex]); ///creeaza un nou nod - ultimul nod din parcurgerea in postordine = radacina arborelui mare
pIndex--;
if(inordStart == inordEnd)
return node;
int index=poz[node->data]; ///identific radacina in parcurgerea in inoridine si ii retin pozitia
if(index>=inordStart && index<=inordEnd)
{
node->dr=Build_Tree(inord,postord,poz,index+1,inordEnd,pIndex,valid); ///apelez functia pentru subarborele stang in inordine
node->stg=Build_Tree(inord,postord,poz,inordStart,index-1,pIndex,valid); ///apelez functia pentru subarborele drept in inordine
return node; /// returnez radacina daca arborele e valid
}
else
{
valid=0;
return NULL;
}
}
void checkTree(nod* root, int& nr, int n)
{
if(root)
{
nr++;
checkTree(root->stg,nr,n);
checkTree(root->dr,nr,n);
}
}
int main()
{
int n, x, pIndex, nr = 0;
vector<int> inord, postord; ///parcurgerile
bool valid = 1; ///verifica daca arborele format este valid sau nu
nod *root; ///radacina arborelui
f>>n; ///numarul de noduri
vector<int> poz(n,0); ///vector de pozitii ale nodurilor arborelui in parcurgerea in inordine
for(int i = 0;i < n; i++) ///se citeste parcurgerea in postordine
{
f>>x;
postord.push_back(x);
}
for(int i = 0;i < n; i++) ///se citeste parcurgerea in inordine
{
f>>x;
inord.push_back(x);
poz[x] = i; ///si pentru fiecare nod se retine pozitia in parcurgere
}
pIndex = n - 1;
root = Build_Tree(inord, postord, poz, 0, n - 1, pIndex, valid); ///se creaza arborele
if(valid) ///se verifica daca e valid
{ ///se afiseaza parcurgerile
preOrdine(root);
g<<endl;
inOrdine(root);
g<<endl;
postOrdine(root);
}
else g<<"nu";
return 0;
}
|
81274188238e9e060719ed39fcef1f8801f24a1b
|
00d712168ab09a7be4d77b0c2e0639df13fa2854
|
/CapsEngine/CAPS/Header/Debug/Debug.hpp
|
bf20409ea4c787dc115d85902343138163dec09d
|
[] |
no_license
|
Aladin-Saleh/Moteur-Graphique-Physique
|
4db381ce18b50aa65de4b05a7c1b72a7c1de513b
|
dcbc3e69b056c4d5deeff80575dc6cc811627416
|
refs/heads/main
| 2023-03-16T06:17:54.235711
| 2021-03-16T11:30:37
| 2021-03-16T11:30:37
| 348,312,327
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 1,102
|
hpp
|
Debug.hpp
|
#ifndef __CAPS_DEBUG__
#define __CAPS_DEBUG__
#include "termcolor/termcolor.hpp"
#include <iostream>
#include <cstdarg>
#include "I_Debug.hpp"
#include "PointeurFonction.hpp"
#include "Caps_Console_HUD.hpp"
#ifdef NDEBUG
#if defined(_WIN32) || defined(_WIN64)
#pragma comment(linker, "/subsystem:windows /ENTRY:mainCRTStartup")
#elif defined(__APPLE__)
#elif defined(__unix__) || defined(__unix)
#else
#error plate-forme non prise en charge
#endif
#endif
namespace Ge
{
class Debug : public I_Debug
{
public:
bool Initialize(ptrF * ptrf);
void Release();
static void Log(const char *format, ...);
static void Error(const char *format, ...);
static void Warn(const char *format, ...);
static void Info(const char *format, ...);
static void VLayer(const char *format, ...);
void log(const char *format, ...);
void error(const char *format, ...);
void warn(const char *format, ...);
void info(const char *format, ...);
void setConsoleDebug(ConsoleDebug * cd);
private:
static I_Debug * p_debug;
static ConsoleDebug * p_consoleDebug;
};
}
#endif // __CAPS_DEBUG__
|
e3b616dc6d422a7ccd160a45b27349f224468fe5
|
7da42b3291d205574642e8fba26bdb9e6c9d524a
|
/src/ib_port.cpp
|
d6dd437659852b445dc0aa41c789333cf4b21ca7
|
[
"BSD-3-Clause"
] |
permissive
|
NCAR/libibautils
|
a0c1b9ad615b717bb3a10b991c79e85ff18c2735
|
03efb1f567a8be3134377d0c92d0c09dc0842eeb
|
refs/heads/master
| 2021-05-31T22:57:05.159450
| 2015-10-27T20:05:12
| 2015-10-27T20:05:12
| 44,636,161
| 0
| 1
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 7,536
|
cpp
|
ib_port.cpp
|
/*
* Copyright (c) 2015, University Corporation for Atmospheric Research
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors
* may be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "ib_port.h"
#include "regex.h"
#include <re2/re2.h>
#include<cassert>
#include<map>
#include<sstream>
#include<cstdlib>
#include<cstdio>
namespace infiniband {
/**
* @brief regex to read first type of ports
*/
static re2::RE2 port_type1_regex(
"^\\s*"
"(?:\\'|)"
"(?:"
"(?P<hca_host_name>\\w+)\\s+" ///Host name
"[hcaHCA]+-(?P<hca_id>\\d+)" ///HCA number
"|"
"(?:MF0;|)" ///MF0 - ignored
"(?P<tca_host_name>\\w+)" ///TCA Name
"(?::(?:SX\\w+|NA)|)" ///Switch Type
"(?:\\/[hcaHCA]{1,3}(?P<hca_id2>\\d+)|)" ///HCA number
"(?:\\/[lLiIdD]+(?P<leaf>\\d+)|)" ///Leaf (sometimes called /LID in error)
"(?:\\/S(?P<spine>\\d+)|)" ///Spine
"(?:\\/U\\d+|)" ///U number (ignored since it always 1)
"(?:\\/P(?P<port1>\\d+)|)" ///Port
")"
"(?:" ///only for ports that have (LID/PORT) descriptor
"(?:\\'|)"
"\\("
"\\d+" ///LID: just assume it is outdated
"\\/"
"(?P<port2>\\d+)" ///Port
"\\)"
"|"
")"
"\\s*$"
);
/**
* @brief regex to read second type of ports
*/
static re2::RE2 port_type2_regex(
"^\\s*"
"(?P<name>\\w+)" ///name
"(?:"
"(?:\\s+"
"[hcaHCA]+(?:-|)(?P<hca>\\d+)" ///hca id
")"
"|"
")"
"(?:\\s+"
"[lLiIdD]+"
"(?P<leaf>\\d+)" ///leaf (called lid in error)
"|"
")"
"(?:\\s+U\\d+|)" ////U useless
"(?:"
"(?:\\s+[pP](?P<port>\\d+))" ///port number
"|"
")"
"\\s*$"
);
const size_t port_t::label_max_size = 1024;
bool port_t::parse(std::string str)
{
//http://en.cppreference.com/w/cpp/string/basic_string/stoul
using regex::map::find_defined;
using regex::map::find_defined_int;
using namespace port_type;
assert(port_type1_regex.ok());
assert(port_type2_regex.ok());
regex::map::map_t results;
///set type to unknown by default incase parse fails
type = UNKNOWN;
if(regex::match(str, port_type1_regex, results))
{
// for(regex_map::const_iterator itr = results.begin(); itr != results.end(); ++itr)
// std::cout << itr->first << " -> " << itr->second << std::endl;
if(find_defined(results, "hca_host_name", name))
{
if(!find_defined_int(results, "hca_id", hca))
return false;
type = HCA;
}
if(find_defined(results, "tca_host_name", name))
{
find_defined_int(results, "spine", spine);
find_defined_int(results, "hca_id2", hca);
find_defined_int(results, "leaf", leaf);
type = TCA;
}
find_defined_int(results, "port1", port);
find_defined_int(results, "port2", port);
}
else if(regex::match(str, port_type2_regex, results))
{
find_defined(results, "name", name);
find_defined_int(results, "hca", hca);
find_defined_int(results, "leaf", leaf);
find_defined_int(results, "port", port);
/**
* guess if port is HCA or TCA
* since this is usualy user sub string
*/
if(hca)
type = HCA;
else if(spine || leaf)
type = TCA;
}
else if(str.size())
{
/**
* String is an unknown format or just plain useless.
* @example 'SwitchX - Mellanox Technologies'
* this will count as a valid port name for parsing but basically useless
*/
name = str;
}
else ///empty unknown port
return false;
return true;
}
std::string port_t::label(port_t::label_t ltype) const
{
char buffer[label_max_size];
assert(name.size());
switch(ltype)
{
case port_t::LABEL_FULL:
if(spine)
std::snprintf(buffer, sizeof(buffer), "%s/S%02u/P%02u", name.c_str(), spine, port);
else if(leaf)
std::snprintf(buffer, sizeof(buffer), "%s/L%02u/P%02u", name.c_str(), leaf, port);
else if(hca)
std::snprintf(buffer, sizeof(buffer), "%s/H%02u/P%02u", name.c_str(), hca, port);
else if(port)
std::snprintf(buffer, sizeof(buffer), "%s/P%02u", name.c_str(), port);
else
std::snprintf(buffer, sizeof(buffer), "%s", name.c_str());
break;
case port_t::LABEL_ENTITY_ONLY:
if(spine)
std::snprintf(buffer, sizeof(buffer), "%s/S%02u", name.c_str(), spine);
else if(leaf)
std::snprintf(buffer, sizeof(buffer), "%s/L%02u", name.c_str(), leaf);
else if(hca)
std::snprintf(buffer, sizeof(buffer), "%s/H%02u", name.c_str(), hca);
else
std::snprintf(buffer, sizeof(buffer), "%s", name.c_str());
break;
default:
///Nothing to see here...not sure how you got here either
assert(false);
}
return std::string(buffer);
}
port_t::key_guid_port_t::key_guid_port_t(const port_t& _port)
: guid(_port.guid), port(_port.port)
{
assert(guid);
assert(port);
}
port_t::key_guid_port_t::key_guid_port_t(const port_t*const _port)
///since this is a pointer, always check for null pointer to avoid segfaults
: guid(_port ? _port->guid : 0), port(_port ? _port->port : 0)
{
assert(_port);
assert(guid);
assert(port);
}
port_t::key_guid_port_t::key_guid_port_t(const guid_t &_guid, const port_num_t &_port)
: guid(_guid), port(_port)
{
assert(guid);
assert(port);
}
///Strict Weak Ordering
bool port_t::key_guid_port_t::operator<(const port_t::key_guid_port_t& other) const
{
assert(guid); assert(port > 0);
assert(other.guid); assert(other.port > 0);
if(guid == other.guid)
return port < other.port;
else ///only compare guid if diff
return guid < other.guid;
}
}
|
e93dd1157da1c3257795538538ab7cb10cd0aeae
|
a585a7eda8a745e36ac43a8883b12708ee9bfc94
|
/test/input/arrowCall.cpp
|
db4ad4dfacd2598883fa7b46682fb1577c85117b
|
[
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] |
permissive
|
jplehr/InstRO
|
5aaa4ee70cf45ae5a335783973256e00841dda79
|
62a27e2c0cd24abc615e102c53bad08225aa8c0d
|
refs/heads/master
| 2020-04-19T06:07:34.871732
| 2016-10-19T15:04:04
| 2016-10-19T15:04:04
| 168,009,003
| 0
| 0
|
NOASSERTION
| 2019-01-28T17:57:09
| 2019-01-28T17:57:08
| null |
UTF-8
|
C++
| false
| false
| 115
|
cpp
|
arrowCall.cpp
|
struct A {
void b() {}
};
void foo() {
A a;
A *pa = &a;
pa->b();
}
int main(int argc, char **){
return 0;
}
|
292a9cb11c1c92f46ee478d97cb8566efa39fb24
|
c7257154dafc6ac70528c93c64c93a498edf9cdc
|
/IMatch.cpp
|
5b7618b7dbe07af159f5406d10767b7dd26f6fbe
|
[] |
no_license
|
springbarley/ttp
|
9574698ff41c4bb453eece657d9c4228e0f3083d
|
b678bd75638aafd570225f4425cbe66a92db59f8
|
refs/heads/master
| 2021-01-25T05:57:49.206813
| 2012-10-12T17:47:10
| 2012-10-12T17:47:10
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 86
|
cpp
|
IMatch.cpp
|
#include "IMatch.h"
IMatch::IMatch(void)
{
}
IMatch::~IMatch(void)
{
}
|
ad440b857c4b123fe84098de120c26af2711f06f
|
99fca07461b704d7293205c0b218393dbc2bf06a
|
/EBRqueue.cpp
|
663a9514367312008325972339df9367d4cacf9a
|
[] |
no_license
|
dachshu/Lock-FreeStructureMemoryReclamationTest
|
82c34f9f1616f1e63d9b65e10398b8a88c07e18a
|
2f5a1c1401fbc1703d8f81d2c3e52d3a95154f48
|
refs/heads/main
| 2023-03-30T01:33:44.925769
| 2021-04-04T13:02:57
| 2021-04-04T13:02:57
| 305,433,312
| 0
| 0
| null | null | null | null |
UHC
|
C++
| false
| false
| 4,268
|
cpp
|
EBRqueue.cpp
|
#include <iostream>
#include <thread>
#include <chrono>
#include <atomic>
#include <mutex>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using namespace std::chrono;
class NODE {
public:
int key;
NODE* next;
NODE() { next = nullptr; }
NODE(int key_value) {
next = nullptr;
key = key_value;
}
~NODE() {}
};
struct EBR {
NODE* node;
unsigned int retire_epoch;
EBR(NODE* n, unsigned int e) : node(n), retire_epoch(e) {}
};
const int MAX_THREADS = 16;
thread_local queue<EBR> retired;
atomic_uint reservations[MAX_THREADS];
atomic_uint epoch = 0;
thread_local int counter = 0;
const unsigned int epoch_freq = 2;
const unsigned int empty_freq = 10;
int num_threads;
thread_local int tid;
unsigned int get_min_reservation() {
unsigned int min_re = 0xffffffff;
for (int i = 0; i < num_threads; ++i) {
min_re = min(min_re, reservations[i].load(memory_order_acquire));
}
return min_re;
}
void empty() {
unsigned int max_safe_epoch = get_min_reservation();
// queue에 오래된것부터 쌓인다
while (false == retired.empty())
{
if (retired.front().retire_epoch < max_safe_epoch) {
delete retired.front().node;
retired.pop();
}
break;
}
}
void retire(NODE* ptr) {
retired.push({ ptr, epoch.load(memory_order_acquire) });
counter++;
if (counter % epoch_freq == 0)
epoch.fetch_add(1, memory_order_release);
if (retired.size() % empty_freq == 0)
empty();
}
void start_op() {
//reservations[tid].store(epoch.fetch_add(1, memory_order_relaxed), memory_order_relaxed);
reservations[tid].store(epoch.load(memory_order_acquire), memory_order_release);
}
void end_op() {
reservations[tid].store(0xffffffff, memory_order_release);
}
class LFQUEUE {
NODE* volatile head;
NODE* volatile tail;
public:
LFQUEUE()
{
head = tail = new NODE(0);
}
~LFQUEUE() {}
void Init()
{
NODE* ptr;
while (head->next != nullptr) {
ptr = head->next;
head->next = head->next->next;
delete ptr;
}
tail = head;
}
bool CAS(NODE* volatile* addr, NODE* old_node, NODE* new_node)
{
return atomic_compare_exchange_strong(reinterpret_cast<volatile atomic_int*>(addr),
reinterpret_cast<int*>(&old_node),
reinterpret_cast<int>(new_node));
}
void Enq(int key)
{
start_op();
NODE* e = new NODE(key);
while (true) {
NODE* last = tail;
NODE* next = last->next;
if (last != tail) continue;
if (next != nullptr) {
CAS(&tail, last, next);
continue;
}
if (false == CAS(&last->next, nullptr, e)) continue;
CAS(&tail, last, e);
end_op();
return;
}
}
int Deq()
{
start_op();
while (true) {
NODE* first = head;
NODE* next = first->next;
NODE* last = tail;
NODE* lastnext = last->next;
if (first != head) continue;
if (last == first) {
if (lastnext == nullptr) {
cout << "EMPTY!!!\n";
this_thread::sleep_for(1ms);
end_op();
return -1;
}
else
{
CAS(&tail, last, lastnext);
continue;
}
}
if (nullptr == next) continue;
int result = next->key;
if (false == CAS(&head, first, next)) continue;
first->next = nullptr;
//delete first;
retire(first);
end_op();
return result;
}
}
void display20()
{
int c = 20;
NODE* p = head->next;
while (p != nullptr)
{
cout << p->key << ", ";
p = p->next;
c--;
if (c == 0) break;
}
cout << endl;
}
};
const auto NUM_TEST = 10000000;
LFQUEUE my_queue;
void ThreadFunc(int num_thread, int t)
{
tid = t;
for (int i = 0; i < NUM_TEST / num_thread; i++) {
if ((rand() % 2 == 0) || (i < (10000 / num_thread))) {
my_queue.Enq(i);
}
else {
int key = my_queue.Deq();
}
}
}
int main()
{
for (auto n = 1; n <= 16; n *= 2) {
my_queue.Init();
for (int r = 0; r < MAX_THREADS; ++r)
reservations[r] = 0xffffffff;
num_threads = n;
epoch.store(1);
vector <thread> threads;
auto s = high_resolution_clock::now();
for (int i = 0; i < n; ++i)
threads.emplace_back(ThreadFunc, n, i);
for (auto& th : threads) th.join();
auto d = high_resolution_clock::now() - s;
my_queue.display20();
//my_queue.recycle_freelist();
cout << n << "Threads, ";
cout << ", Duration : " << duration_cast<milliseconds>(d).count() << " msecs.\n";
}
system("pause");
}
|
b7cde2bdd20460d4c86a19720a91aa23d3f0daf1
|
fec1e3d99fc7de1f76e25945c3cdd38bd37c62a5
|
/CPP_04/ex00/Peon.cpp
|
069be9df13c9e1f0e47528debdc85b131c007fbf
|
[] |
no_license
|
Nath-G/CPP_Module
|
1282ab7c98266e194d7b88a31d03c166cd19a27c
|
af11de2498204fd92c48d1636175de302c5fa919
|
refs/heads/main
| 2023-08-03T03:58:21.561340
| 2021-09-26T18:30:42
| 2021-09-26T18:30:42
| 329,921,343
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 766
|
cpp
|
Peon.cpp
|
# include "Peon.hpp"
// Parametric constructor (std::string
Peon::Peon(std::string name) : Victim(name)
{
std::cout << GREY << "Zog zog." << C_RES << std::endl;
return ;
}
// Copy constructor
Peon::Peon(const Peon& src) : Victim(src)
{
std::cout << GREY << "Copy Peon creation..." << C_RES << std::endl;
*this = src;
return;
}
// Destructor
Peon::~Peon(void)
{
std::cout << GREY << "Bleuark..." << C_RES << std::endl;
return;
}
// Assignation operator
Peon & Peon::operator=(const Peon& rhs)
{
std::cout << GREY << "Peon Assignation operator called" << C_RES << std::endl;
this->getName() = rhs.getName();
return (*this);
}
void Peon::getPolymorphed() const
{
std::cout << this->getName() << " has been turned into a pink pony!" << std::endl;
}
|
335fd740c60fb9edc79c8d7174df97821f799562
|
a65c77b44164b2c69dfe4bfa2772d18ae8e0cce2
|
/catagories/QTREES/QTREE2.cpp
|
f4350898e1969d78b6c64ba4710283a4ee9e9af8
|
[] |
no_license
|
dl8sd11/online-judge
|
553422b55080e49e6bd9b38834ccf1076fb95395
|
5ef8e3c5390e54381683f62f88d03629e1355d1d
|
refs/heads/master
| 2021-12-22T15:13:34.279988
| 2021-12-13T06:45:49
| 2021-12-13T06:45:49
| 111,268,306
| 1
| 6
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 3,362
|
cpp
|
QTREE2.cpp
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"#%d: %s = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
template<typename It> ostream& _printRng(ostream &os,It bg,It ed)
{
os<<"{";
for(It it=bg;it!=ed;it++) {
os<<(it==bg?"":",")<<*it;
}
os<<"}";
return os;
}
template<typename T> ostream &operator << (ostream &os,vector<T> &v){return _printRng(os,v.begin(), v.end());}
template<typename T> void pary(T bg, T ed){_printRng(cerr,bg,ed);cerr<<endl;}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#define pary(...)
#endif
const int MAXN = 10005;
const int MAXLG = __lg(MAXN) + 2;
const ll MOD = 1000000007;
int t;
int n;
vector<pii> edge[MAXN];
int ndep[MAXN], ddep[MAXN], anc[MAXLG][MAXN];
void dfs (int nd, int par) {
ndep[nd] = ndep[par] + 1;
anc[0][nd] = par;
for (auto e : edge[nd]) {
if (e.X != par) {
ddep[e.X] = ddep[nd] + e.Y;
dfs(e.X, nd);
}
}
}
void buildANC () {
for (int i=1; i<MAXLG; i++) {
for (int j=1; j<=n; j++) {
anc[i][j] = anc[i-1][anc[i-1][j]];
}
}
}
int lca (int u, int v) {
if (ndep[u] > ndep[v]) {
swap(u, v);
}
for (int i=MAXLG-1; i>=0; i--) {
if (ndep[anc[i][v]] >= ndep[u]) {
v = anc[i][v];
}
}
if (u == v) {
return u;
}
for (int i=MAXLG-1; i>=0; i--) {
if (anc[i][u] != anc[i][v]) {
u = anc[i][u];
v = anc[i][v];
}
}
return anc[0][u];
}
int kth (int v, int k) {
for (int i=MAXLG-1; i>=0; i--) {
if ((k>>i) & 1) {
v = anc[i][v];
}
}
return v;
}
/*********************GoodLuck***********************/
signed main () {
IOS();
cin >> t;
while (t--) {
cin >> n;
for (int i=0; i<n-1; i++) {
int u, v, w;
cin >> u >> v >> w;
edge[u].eb(v, w);
edge[v].eb(u, w);
}
dfs(1, 0);
buildANC();
string cmd;
while (cin >> cmd) {
if (cmd[1] == 'O') {
for (int i=1; i<=n; i++) {
edge[i].clear();
}
break;
} else if (cmd[1] == 'I') {
int u, v;
cin >> u >> v;
int ca = lca(u, v);
cout << ddep[u] + ddep[v] - 2*ddep[ca] << endl;
} else {
int u, v, k;
cin >> u >> v >> k;
int ca = lca(u, v);
if (ndep[u] - ndep[ca] + 1 >= k) {
cout << kth(u, k-1) << endl;
} else {
int sum = ndep[u] + ndep[v] - 2*ndep[ca];
cout << kth(v, sum-k+1) << endl;
}
}
}
cout << endl;
}
}
|
4541acdf0b22618fe56aee786302c5712f4d3abc
|
496948edf435619772d2aa1683d7bd0df75eeed9
|
/testing/batch_triangular/test_Xgeqrf_batch.cpp
|
a47aeb02da02f5f06358ba59ecf9de2d440595d1
|
[
"BSD-3-Clause"
] |
permissive
|
ecrc/kblas-gpu
|
aeb4174951f9ae5c2a7e5275d34fd40182be9924
|
8af76dc862c74cbe880569ff2ccf6e5e54245430
|
refs/heads/master
| 2023-04-04T02:05:47.981475
| 2023-03-27T13:20:24
| 2023-03-27T13:20:24
| 66,200,952
| 53
| 15
|
BSD-3-Clause
| 2023-03-27T13:20:27
| 2016-08-21T13:45:35
|
Cuda
|
UTF-8
|
C++
| false
| false
| 12,094
|
cpp
|
test_Xgeqrf_batch.cpp
|
/**
* @copyright (c) 2012- King Abdullah University of Science and
* Technology (KAUST). All rights reserved.
**/
/**
* @file testing/batch_triangular/test_Xgeqrf_batch.cpp
* KBLAS is a high performance CUDA library for subset of BLAS
* and LAPACK routines optimized for NVIDIA GPUs.
* KBLAS is provided by KAUST.
*
* @version 3.0.0
* @author Wajih Halim Boukaram
* @date 2018-11-14
**/
#include <stdio.h>
#include <string.h>
#include "testing_helper.h"
#ifdef PREC_d
typedef double Real;
#define generateArrayOfPointers generateDArrayOfPointers
#define cublasXgeqrf_batched cublasDgeqrfBatched
#define magmaXgeqrf_batched magma_dgeqrf_batched
#define kblasXgeqrf_batched kblasDgeqrf_batch_strided
#define kblasXtsqrf_batched kblasDtsqrf_batch_strided
#define LAPACKE_Xgeqrf LAPACKE_dgeqrf
#else
typedef float Real;
#define generateArrayOfPointers generateSArrayOfPointers
#define cublasXgeqrf_batched cublasSgeqrfBatched
#define magmaXgeqrf_batched magma_sgeqrf_batched
#define kblasXgeqrf_batched kblasSgeqrf_batch_strided
#define kblasXtsqrf_batched kblasStsqrf_batch_strided
#define LAPACKE_Xgeqrf LAPACKE_sgeqrf
#endif
typedef Real* RealArray;
typedef Real** RealPtrArray;
typedef int* IntArray;
#define COPY_DATA_UP() \
for(int g = 0; g < num_gpus; g++) \
{ \
cudaSetDevice(opts.devices[g]); \
int entries = batchCount_gpu * rows * cols; \
check_error( cudaMemcpy(d_m[g], m_original + entries * g, entries * sizeof(Real), cudaMemcpyHostToDevice) ); \
} \
syncGPUs(&opts);
#define SYNC_TIMERS(timers, run_time) \
max_time = -1; \
for(int g = 0; g < num_gpus; g++) \
{ \
cudaSetDevice(opts.devices[g]); \
double gpu_time = gpuTimerToc(timers[g]); \
if(max_time < gpu_time) \
max_time = gpu_time; \
} \
run_time[i] = max_time;
#define COPY_DATA_DOWN() \
for(int g = 0; g < num_gpus; g++) \
{ \
cudaSetDevice(opts.devices[g]); \
int entries = batchCount_gpu * rows * cols; \
check_error( cudaMemcpy(gpu_results + entries * g, d_m[g], entries * sizeof(Real), cudaMemcpyDeviceToHost ) ); \
} \
syncGPUs(&opts);
double batch_qr_cpu(Real* m, Real* tau, int rows, int cols, int num_ops, int num_threads)
{
double total_time = gettime();
int rank = (rows < cols ? rows : cols);
#pragma omp parallel for num_threads(num_threads)
for(int i = 0; i < num_ops; i++)
{
Real* m_op = m + i * rows * cols;
Real* tau_op = tau + i * rank;
LAPACKE_Xgeqrf(LAPACK_COL_MAJOR, rows, cols, m_op, rows, tau_op);
}
total_time = gettime() - total_time;
return total_time;
}
Real compare_results_R(Real* m1, Real* m2, int rows, int cols, int num_ops)
{
Real err = 0;
for(int op = 0; op < num_ops; op++)
{
Real* m1_op = m1 + op * rows * cols;
Real* m2_op = m2 + op * rows * cols;
Real err_op = 0, norm_f_op = 0;
for(int i = 0; i < rows; i++)
{
for(int j = i; j < cols; j++)
{
Real diff_entry = fabs(fabs(m1_op[i + j * rows]) - fabs(m2_op[i + j * rows]));
err_op += diff_entry * diff_entry;
norm_f_op += m1_op[i + j * rows] * m1_op[i + j * rows];
}
}
err += sqrt(err_op / norm_f_op);
}
return err / num_ops;
}
void syncGPUs(kblas_opts* opts)
{
for(int g = 0; g < opts->ngpu; g++)
{
cudaSetDevice(opts->devices[g]);
cudaDeviceSynchronize();
}
}
int main(int argc, char** argv)
{
kblas_opts opts;
int num_gpus, warmup, nruns, num_omp_threads, info;
int batchCount, batchCount_gpu;
int rows, cols, rank;
double max_time, hh_ops;
double avg_cpu_time, sdev_cpu_time;
double avg_kblas_time, sdev_kblas_time;
double avg_magma_time, sdev_magma_time;
double avg_cublas_time, sdev_cublas_time;
// Host arrays
RealArray m, m_original, tau, gpu_results;
parse_opts(argc, argv, &opts);
num_gpus = opts.ngpu;
warmup = opts.warmup;
nruns = opts.nruns;
num_omp_threads = opts.omp_numthreads;
// Device arrays
RealArray d_m[num_gpus], d_tau[num_gpus];
RealPtrArray d_m_ptrs[num_gpus], d_tau_ptrs[num_gpus];
IntArray d_info[num_gpus];
// Handles and timers
#ifdef USE_MAGMA
magma_init();
magma_queue_t queues[num_gpus];
#endif
cublasHandle_t cublas_handles[num_gpus];
kblasHandle_t kblas_handles[num_gpus];
GPU_Timer_t magma_timers[num_gpus], cublas_timers[num_gpus], kblas_timers[num_gpus];
double cpu_time[nruns], kblas_time[nruns], magma_time[nruns], cublas_time[nruns];
for(int g = 0; g < num_gpus; g++)
{
cudaSetDevice(opts.devices[g]);
#ifdef PREC_d
cudaDeviceSetSharedMemConfig(cudaSharedMemBankSizeEightByte);
#endif
#ifdef USE_MAGMA
// Init magma queue and timer
magma_queue_create(opts.devices[g], &queues[g]);
magma_timers[g] = newGPU_Timer(magma_queue_get_cuda_stream(queues[g]));
#endif
// Init cublas handle and timer
check_cublas_error( cublasCreate(&cublas_handles[g]) );
cudaStream_t cublas_stream;
check_cublas_error( cublasGetStream(cublas_handles[g], &cublas_stream) );
cublas_timers[g] = newGPU_Timer(cublas_stream);
// Init kblas handle and timer
kblasCreate(&kblas_handles[g]);
kblas_timers[g] = newGPU_Timer(kblasGetStream(kblas_handles[g]));
}
printf("%-15s%-10s%-10s%-15s%-15s%-15s%-15s%-15s%-15s\n", "batchCount", "N", "K", "kblasQERF", "magmaQERF", "cublasQERF", "kblasErr", "magmaErr", "cublasErr");
printf("============================================================================================================================\n");
for(int itest = 0; itest < opts.ntest; ++itest)
{
for(int iter = 0; iter < opts.niter; ++iter)
{
for(int btest = 0; btest < opts.btest; ++btest)
{
batchCount = opts.batchCount;
if(opts.btest > 1)
batchCount = opts.batch[btest];
batchCount_gpu = batchCount / num_gpus;
rows = opts.msize[itest];
cols = opts.nsize[itest];
rank = (rows < cols ? rows : cols);
hh_ops = (double)(2.0 * rows * cols * cols - (2.0 / 3.0) * cols * cols * cols) * batchCount * 1e-9;
////////////////////////////////////////////////////////////////////////
// Set up the data
////////////////////////////////////////////////////////////////////////
TESTING_MALLOC_CPU(m, Real, batchCount * rows * cols);
TESTING_MALLOC_CPU(m_original, Real, batchCount * rows * cols);
TESTING_MALLOC_CPU(tau, Real, batchCount * rank);
TESTING_MALLOC_CPU(gpu_results, Real, batchCount * rows * cols);
for(int i = 0; i < batchCount * rows * cols; i++)
m[i] = m_original[i] = (Real)rand() / RAND_MAX;
// Allocate the data
for(int g = 0; g < num_gpus; g++)
{
cudaSetDevice(opts.devices[g]);
TESTING_MALLOC_DEV(d_m[g], Real, batchCount_gpu * rows * cols);
TESTING_MALLOC_DEV(d_tau[g], Real, batchCount_gpu * rank);
// Generate array of pointers for the cublas and magma routines
TESTING_MALLOC_DEV(d_m_ptrs[g], Real*, batchCount_gpu);
TESTING_MALLOC_DEV(d_tau_ptrs[g], Real*, batchCount_gpu);
TESTING_MALLOC_DEV(d_info[g], int, batchCount_gpu);
generateArrayOfPointers(d_m[g], d_m_ptrs[g], rows * cols, batchCount_gpu, 0);
generateArrayOfPointers(d_tau[g], d_tau_ptrs[g], rank, batchCount_gpu, 0);
}
////////////////////////////////////////////////////////////////////////
// Time the runs
////////////////////////////////////////////////////////////////////////
// Keep track of the times for each run
double kblas_err = 0, magma_err = 0, cublas_err = 0;
for(int i = 0; i < nruns; i++)
{
memcpy(m, m_original, sizeof(Real) * batchCount * rows * cols);
cpu_time[i] = batch_qr_cpu(m, tau, rows, cols, batchCount, num_omp_threads);
////////////////////////////////////////////////////////////////////////
// KBLAS
////////////////////////////////////////////////////////////////////////
// Reset the GPU data and sync
COPY_DATA_UP();
// Launch all kernels
for(int g = 0; g < num_gpus; g++)
{
cudaSetDevice(opts.devices[g]);
gpuTimerTic(kblas_timers[g]);
/*
check_kblas_error(
kblasXgeqrf_batched(kblas_handles[g], rows, cols, d_m[g], rows, rows * cols, d_tau[g], cols, batchCount_gpu)
);
*/
check_kblas_error( kblasXtsqrf_batched(
kblas_handles[g], rows, cols, d_m[g], rows, rows * cols, d_tau[g], rank, batchCount_gpu
) );
gpuTimerRecordEnd(kblas_timers[g]);
}
// The time all gpus finish at is the max of all the individual timers
SYNC_TIMERS(kblas_timers, kblas_time);
// Copy the data down from all the GPUs and compare with the CPU results
COPY_DATA_DOWN();
kblas_err += compare_results_R(gpu_results, m, rows, cols, batchCount);
#ifdef USE_MAGMA
////////////////////////////////////////////////////////////////////////
// MAGMA
////////////////////////////////////////////////////////////////////////
// Reset the GPU data and sync
COPY_DATA_UP();
// Launch all kernels
for(int g = 0; g < num_gpus; g++)
{
cudaSetDevice(opts.devices[g]);
gpuTimerTic(magma_timers[g]);
magmaXgeqrf_batched(
rows, cols, d_m_ptrs[g], rows, d_tau_ptrs[g], d_info[g],
batchCount_gpu, queues[g]
);
gpuTimerRecordEnd(magma_timers[g]);
}
// The time all gpus finish at is the max of all the individual timers
SYNC_TIMERS(magma_timers, magma_time);
// Copy the data down from all the GPUs and compare with the CPU results
COPY_DATA_DOWN();
magma_err += compare_results_R(gpu_results, m, rows, cols, batchCount);
#endif
////////////////////////////////////////////////////////////////////////
// CUBLAS
////////////////////////////////////////////////////////////////////////
// Reset the GPU data and sync
COPY_DATA_UP();
// Launch all kernels
for(int g = 0; g < num_gpus; g++)
{
cudaSetDevice(opts.devices[g]);
gpuTimerTic(cublas_timers[g]);
check_cublas_error(
cublasXgeqrf_batched(
cublas_handles[g], rows, cols, d_m_ptrs[g], rows,
d_tau_ptrs[g], &info, batchCount_gpu
)
);
gpuTimerRecordEnd(cublas_timers[g]);
}
// The time all gpus finish at is the max of all the individual timers
SYNC_TIMERS(cublas_timers, cublas_time);
// Copy the data down from all the GPUs and compare with the CPU results
COPY_DATA_DOWN();
cublas_err += compare_results_R(gpu_results, m, rows, cols, batchCount);
}
avg_and_stdev(cpu_time, nruns, &avg_cpu_time, &sdev_cpu_time, warmup);
avg_and_stdev(kblas_time, nruns, &avg_kblas_time, &sdev_kblas_time, warmup);
avg_and_stdev(magma_time, nruns, &avg_magma_time, &sdev_magma_time, warmup);
avg_and_stdev(cublas_time, nruns, &avg_cublas_time, &sdev_cublas_time, warmup);
printf(
"%-15d%-10d%-10d%-15.3f%-15.3f%-15.3f%-15.3e%-15.3e%-15.3e\n",
batchCount, rows, cols, hh_ops / avg_kblas_time, (avg_magma_time == 0 ? 0 : hh_ops / avg_magma_time), hh_ops / avg_cublas_time,
kblas_err / nruns, magma_err / nruns, cublas_err / nruns
);
////////////////////////////////////////////////////////////////////////
// Free up the data
////////////////////////////////////////////////////////////////////////
TESTING_FREE_CPU(m); TESTING_FREE_CPU(m_original);
TESTING_FREE_CPU(tau); TESTING_FREE_CPU(gpu_results);
// Allocate the data
for(int g = 0; g < num_gpus; g++)
{
cudaSetDevice(opts.devices[g]);
TESTING_FREE_DEV(d_m[g]); TESTING_FREE_DEV(d_tau[g]);
TESTING_FREE_DEV(d_m_ptrs[g]); TESTING_FREE_DEV(d_tau_ptrs[g]);
TESTING_FREE_DEV(d_info[g]);
}
}
}
}
return 0;
}
|
665043c0f9a250e214a3412e8fe41673c38e7424
|
c73ffb0f08ff3c786fb656c83e3c968090bc9c0a
|
/src/debug.h
|
a5030c8e19c1a57cdd4999537bf4f41657bdc5e9
|
[] |
no_license
|
kotborealis/mokou
|
5c1d8b027a49b06873d92cab29ea46db831438d4
|
e303d8c9fbdedde461b58d851cb54dc04e751aac
|
refs/heads/master
| 2021-01-21T13:52:30.041575
| 2016-05-29T21:07:08
| 2016-05-29T21:07:08
| 51,956,589
| 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 188
|
h
|
debug.h
|
#pragma once
#include <string>
#include <iostream>
#include <ctime>
#include <iomanip>
namespace debug{
std::string get_time();
void i_log(std::string s);
void e_log(std::string s);
}
|
aacaab0bad2a1eeec29790765e45bcdc72b343c3
|
1501f50acc22b9e915d04df435210d68e2a907ee
|
/include/System/ComponentModel/Component.hpp
|
3507314ffe0376df43132f9ddcba81befe0dba3f
|
[
"Unlicense"
] |
permissive
|
sc2ad/BeatSaber-Quest-Codegen
|
cd944128d6c7b61f2014f13313d2d6cf424df811
|
4bfd0c0f705e7a302afe6ec1ef996b5b2e3f4600
|
refs/heads/master
| 2023-03-11T11:07:22.074423
| 2023-02-28T22:15:16
| 2023-02-28T22:15:16
| 285,669,750
| 31
| 25
|
Unlicense
| 2023-02-28T22:15:18
| 2020-08-06T20:56:01
|
C++
|
UTF-8
|
C++
| false
| false
| 11,309
|
hpp
|
Component.hpp
|
// Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
// Including type: System.MarshalByRefObject
#include "System/MarshalByRefObject.hpp"
// Including type: System.ComponentModel.IComponent
#include "System/ComponentModel/IComponent.hpp"
#include "beatsaber-hook/shared/utils/il2cpp-utils-methods.hpp"
#include "beatsaber-hook/shared/utils/il2cpp-utils-properties.hpp"
#include "beatsaber-hook/shared/utils/il2cpp-utils-fields.hpp"
#include "beatsaber-hook/shared/utils/utils.h"
#include "beatsaber-hook/shared/utils/typedefs-string.hpp"
// Completed includes
// Begin forward declares
// Forward declaring namespace: System::ComponentModel
namespace System::ComponentModel {
// Forward declaring type: ISite
class ISite;
// Forward declaring type: EventHandlerList
class EventHandlerList;
}
// Forward declaring namespace: System
namespace System {
// Forward declaring type: Type
class Type;
}
// Completed forward declares
// Type namespace: System.ComponentModel
namespace System::ComponentModel {
// Forward declaring type: Component
class Component;
}
#include "beatsaber-hook/shared/utils/il2cpp-type-check.hpp"
NEED_NO_BOX(::System::ComponentModel::Component);
DEFINE_IL2CPP_ARG_TYPE(::System::ComponentModel::Component*, "System.ComponentModel", "Component");
// Type namespace: System.ComponentModel
namespace System::ComponentModel {
// Size: 0x28
#pragma pack(push, 1)
// Autogenerated type: System.ComponentModel.Component
// [TokenAttribute] Offset: FFFFFFFF
// [ComVisibleAttribute] Offset: 1088FE8
// [DesignerCategoryAttribute] Offset: 1088FE8
// [ClassInterfaceAttribute] Offset: 1088FE8
class Component : public ::System::MarshalByRefObject/*, public ::System::ComponentModel::IComponent*/ {
public:
public:
// private System.ComponentModel.ISite site
// Size: 0x8
// Offset: 0x18
::System::ComponentModel::ISite* site;
// Field size check
static_assert(sizeof(::System::ComponentModel::ISite*) == 0x8);
// private System.ComponentModel.EventHandlerList events
// Size: 0x8
// Offset: 0x20
::System::ComponentModel::EventHandlerList* events;
// Field size check
static_assert(sizeof(::System::ComponentModel::EventHandlerList*) == 0x8);
public:
// Creating interface conversion operator: operator ::System::ComponentModel::IComponent
operator ::System::ComponentModel::IComponent() noexcept {
return *reinterpret_cast<::System::ComponentModel::IComponent*>(this);
}
// Creating interface conversion operator: i_IComponent
inline ::System::ComponentModel::IComponent* i_IComponent() noexcept {
return reinterpret_cast<::System::ComponentModel::IComponent*>(this);
}
// Deleting conversion operator: operator ::Il2CppObject*
constexpr operator ::Il2CppObject*() const noexcept = delete;
// Get static field: static private readonly System.Object EventDisposed
static ::Il2CppObject* _get_EventDisposed();
// Set static field: static private readonly System.Object EventDisposed
static void _set_EventDisposed(::Il2CppObject* value);
// Get instance field reference: private System.ComponentModel.ISite site
[[deprecated("Use field access instead!")]] ::System::ComponentModel::ISite*& dyn_site();
// Get instance field reference: private System.ComponentModel.EventHandlerList events
[[deprecated("Use field access instead!")]] ::System::ComponentModel::EventHandlerList*& dyn_events();
// protected System.Boolean get_CanRaiseEvents()
// Offset: 0x1E5F3DC
bool get_CanRaiseEvents();
// System.Boolean get_CanRaiseEventsInternal()
// Offset: 0x1E5F3E4
bool get_CanRaiseEventsInternal();
// public System.ComponentModel.ISite get_Site()
// Offset: 0x1E5F3F0
::System::ComponentModel::ISite* get_Site();
// protected System.Boolean get_DesignMode()
// Offset: 0x1E5F864
bool get_DesignMode();
// public System.Void .ctor()
// Offset: 0x1E5FA4C
template<::il2cpp_utils::CreationType creationType = ::il2cpp_utils::CreationType::Temporary>
static Component* New_ctor() {
static auto ___internal__logger = ::Logger::get().WithContext("::System::ComponentModel::Component::.ctor");
return THROW_UNLESS((::il2cpp_utils::New<Component*, creationType>()));
}
// static private System.Void .cctor()
// Offset: 0x1E5FA54
static void _cctor();
// public System.Void Dispose()
// Offset: 0x1E5F3F8
void Dispose();
// protected System.Void Dispose(System.Boolean disposing)
// Offset: 0x1E5F474
void Dispose(bool disposing);
// protected System.Object GetService(System.Type service)
// Offset: 0x1E5F794
::Il2CppObject* GetService(::System::Type* service);
// protected override System.Void Finalize()
// Offset: 0x1E5F368
// Implemented from: System.Object
// Base method: System.Void Object::Finalize()
void Finalize();
// public override System.String ToString()
// Offset: 0x1E5F924
// Implemented from: System.Object
// Base method: System.String Object::ToString()
::StringW ToString();
}; // System.ComponentModel.Component
#pragma pack(pop)
static check_size<sizeof(Component), 32 + sizeof(::System::ComponentModel::EventHandlerList*)> __System_ComponentModel_ComponentSizeCheck;
static_assert(sizeof(Component) == 0x28);
}
#include "beatsaber-hook/shared/utils/il2cpp-utils-methods.hpp"
// Writing MetadataGetter for method: System::ComponentModel::Component::get_CanRaiseEvents
// Il2CppName: get_CanRaiseEvents
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<bool (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::get_CanRaiseEvents)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "get_CanRaiseEvents", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::get_CanRaiseEventsInternal
// Il2CppName: get_CanRaiseEventsInternal
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<bool (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::get_CanRaiseEventsInternal)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "get_CanRaiseEventsInternal", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::get_Site
// Il2CppName: get_Site
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<::System::ComponentModel::ISite* (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::get_Site)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "get_Site", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::get_DesignMode
// Il2CppName: get_DesignMode
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<bool (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::get_DesignMode)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "get_DesignMode", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::New_ctor
// Il2CppName: .ctor
// Cannot get method pointer of value based method overload from template for constructor!
// Try using FindMethod instead!
// Writing MetadataGetter for method: System::ComponentModel::Component::_cctor
// Il2CppName: .cctor
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<void (*)()>(&System::ComponentModel::Component::_cctor)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), ".cctor", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::Dispose
// Il2CppName: Dispose
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<void (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::Dispose)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "Dispose", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::Dispose
// Il2CppName: Dispose
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<void (System::ComponentModel::Component::*)(bool)>(&System::ComponentModel::Component::Dispose)> {
static const MethodInfo* get() {
static auto* disposing = &::il2cpp_utils::GetClassFromName("System", "Boolean")->byval_arg;
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "Dispose", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{disposing});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::GetService
// Il2CppName: GetService
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<::Il2CppObject* (System::ComponentModel::Component::*)(::System::Type*)>(&System::ComponentModel::Component::GetService)> {
static const MethodInfo* get() {
static auto* service = &::il2cpp_utils::GetClassFromName("System", "Type")->byval_arg;
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "GetService", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{service});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::Finalize
// Il2CppName: Finalize
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<void (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::Finalize)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "Finalize", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
// Writing MetadataGetter for method: System::ComponentModel::Component::ToString
// Il2CppName: ToString
template<>
struct ::il2cpp_utils::il2cpp_type_check::MetadataGetter<static_cast<::StringW (System::ComponentModel::Component::*)()>(&System::ComponentModel::Component::ToString)> {
static const MethodInfo* get() {
return ::il2cpp_utils::FindMethod(classof(System::ComponentModel::Component*), "ToString", std::vector<Il2CppClass*>(), ::std::vector<const Il2CppType*>{});
}
};
|
882ce3a7b4b4838df39a13fcc38f37a618e77315
|
e4fe8fa7d29e293afd38870a44d42f163133813e
|
/cpp_backend/record.cpp
|
78ab149f1bc93a859f1e1a765d425f196672040b
|
[
"MIT"
] |
permissive
|
chengxuanying/MapSystem
|
27c0f75c5a68e3f0540dab38a0b4af83c83d2294
|
7da7c6c4952ff181eafc2569b9ac49ab4cbbab2f
|
refs/heads/master
| 2023-03-27T19:12:45.078973
| 2020-09-13T05:17:02
| 2020-09-13T05:17:02
| 220,892,860
| 0
| 0
| null | 2021-03-31T04:01:47
| 2019-11-11T03:22:45
|
C++
|
UTF-8
|
C++
| false
| false
| 2,998
|
cpp
|
record.cpp
|
//
// Created by 派星星 on 2019/11/11.
//
#include <codecvt>
#include <utility>
#include "record.h"
#include "utils.h"
void endianChange(struct _struct_record &t) {
// change the endian mode
t._struct_size = swap_uint16(t._struct_size);
t._id = swap_uint32(t._id);
t._name_size = swap_uint16(t._name_size);
t._info = swap_uint32(t._info);
}
int readDat(Record *rows) {
// create tmp struct
struct _struct_record _tmp_record;
int _string_size = 0;
string _tmp_string;
FILE *fptr = fopen("GTBL.dat", "rb");
// if not have file than raise error
if (fptr == NULL) {
printf("Cannot find GTBL.dat!");
exit(1);
}
int cnt = 0;
while (fread(&_tmp_record, sizeof(_struct_record), 1, fptr) == 1) {
// till eof
endianChange(_tmp_record);
_string_size = _tmp_record._struct_size - 12; // 12 = 2 + 4 + 2 + 4
char _tmp_char[100];
fread(_tmp_char, _string_size * sizeof(char), 1, fptr);
_tmp_char[_string_size] = 0;
_tmp_string = gbk2utf8(_tmp_char);
rows[cnt++] = Record(_tmp_record._id,
_tmp_record._name_size,
_tmp_record._info,
_tmp_string);
}
fclose(fptr);
return cnt;
}
Record::Record(uint32_t _id, uint16_t _name_size, uint32_t _info) {
this->_id = _id;
this->_name_size = _name_size;
this->_info = _info;
}
Record::Record(uint32_t _id, uint16_t _name_size, uint32_t _info, string _name) {
this->_id = _id;
this->_name_size = _name_size;
this->_info = _info;
this->_name = string();
// save memory
this->_name = std::move(_name);
}
Record::Record() {
}
uint32_t Record::getid() {
return this->_id;
}
string *Record::getname() {
return &this->_name;
}
uint8_t Record::getchalu() {
return (this->_info & 0x0070) >> 4;
}
uint8_t Record::getflag() {
return (this->_info & 0x0080) >> 7;
}
uint8_t Record::getfanhao() {
return (this->_info & 0x000F);
}
uint32_t Record::get_info() {
return this->_info;
}
int writeDat(Record **ptr, int cnt) {
// create tmp struct
struct _struct_record _tmp_record;
Record *t;
int _string_size = 0;
string _tmp_string;
FILE *fptr = fopen("GTBL.dat", "wb+");
// if not have file than raise error
if (fptr == NULL) {
printf("Cannot open GTBL_.dat!");
exit(1);
}
for (int i = 0; i < cnt; ++i) {
t = ptr[i];
const char *_name = utf82gbk(*t->getname()).c_str();
_tmp_record._struct_size = 12 + strlen(_name);
_tmp_record._id = t->getid();
_tmp_record._name_size = 0;
_tmp_record._info = t->get_info();
// restore
// cout << strlen(_name) << endl;
endianChange(_tmp_record);
fwrite(&_tmp_record, sizeof(_tmp_record), 1, fptr);
fwrite(_name, strlen(_name), 1, fptr);
}
fclose(fptr);
return cnt;
}
|
9ccad9f67422b5df371efae1bf0623582eff89da
|
c32ee8ade268240a8064e9b8efdbebfbaa46ddfa
|
/Libraries/m2sdk/ue/sys/memorymanager/C_ComposerAllocatorAndStatistics_TPL_61175C1B.h
|
781fcf10c8a4fbd1eae8b331e9c84601b313976f
|
[] |
no_license
|
hopk1nz/maf2mp
|
6f65bd4f8114fdeb42f9407a4d158ad97f8d1789
|
814cab57dc713d9ff791dfb2a2abeb6af0e2f5a8
|
refs/heads/master
| 2021-03-12T23:56:24.336057
| 2015-08-22T13:53:10
| 2015-08-22T13:53:10
| 41,209,355
| 19
| 21
| null | 2015-08-31T05:28:13
| 2015-08-22T13:56:04
|
C++
|
UTF-8
|
C++
| false
| false
| 1,069
|
h
|
C_ComposerAllocatorAndStatistics_TPL_61175C1B.h
|
// auto-generated file (rttidump-exporter by h0pk1nz)
#pragma once
#include <ue/sys/memorymanager/I_ResetableAllocator.h>
namespace ue
{
namespace sys
{
namespace memorymanager
{
/** ue::sys::memorymanager::C_ComposerAllocatorAndStatistics<ue::sys::memorymanager::C_IncrementalAllocator<ue::sys::memorymanager::I_Allocator,4l,ue::sys::threads::C_SingleThread,ue::NullType>,ue::sys::memorymanager::C_AllocationStatistics,ue::sys::threads::C_SingleThread,ue::NullType,ue::sys::memorymanager::I_ResetableAllocator,ue::NullType> (VTable=0x01E8C740) */
class C_ComposerAllocatorAndStatistics_TPL_61175C1B : public I_ResetableAllocator
{
public:
virtual void vfn_0001_85E85291() = 0;
virtual void vfn_0002_85E85291() = 0;
virtual void vfn_0003_85E85291() = 0;
virtual void vfn_0004_85E85291() = 0;
virtual void vfn_0005_85E85291() = 0;
virtual void vfn_0006_85E85291() = 0;
virtual void vfn_0007_85E85291() = 0;
virtual void vfn_0008_85E85291() = 0;
virtual void vfn_0009_85E85291() = 0;
};
} // namespace memorymanager
} // namespace sys
} // namespace ue
|
8d3e5918a816686a3f266b136d3ccdcf42f544b7
|
647ffb9d3e077ae75deaf9fbec6e0a5fa72253ae
|
/cppcore/include/detail/config.hpp
|
12df9dab516df744f919bb07d723ba2c432b0a0a
|
[
"BSD-2-Clause"
] |
permissive
|
Yukee/pybinding
|
365e8e08bc43b5a2f0f53e0225b7a98455d88377
|
823dacee421e7d1cf99fe31751ff9a308b61e0aa
|
refs/heads/master
| 2021-01-12T20:07:04.165783
| 2016-05-15T19:36:05
| 2016-05-15T20:20:11
| null | 0
| 0
| null | null | null | null |
UTF-8
|
C++
| false
| false
| 190
|
hpp
|
config.hpp
|
#pragma once
#ifdef TBM_USE_MKL
#define EIGEN_USE_MKL_ALL
#define TBM_USE_FEAST
#endif
// disable Eigen's internal multi-threading (doesn't do much anyway)
#define EIGEN_DONT_PARALLELIZE
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.