blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 4 201 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 7 100 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 260
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 11.4k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 17
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 80
values | src_encoding stringclasses 28
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 8 9.86M | extension stringclasses 52
values | content stringlengths 8 9.86M | authors listlengths 1 1 | author stringlengths 0 119 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ead74f7cc86442eddae3f1c37f7eda134d61df7c | f6e40c810e1d262d23ca103a128408f9863d1e3c | /PubSub/adevs-code-323-trunk/include/adevs_fmi.h | 39be47908c5dd8eee75169788dda4775f2e33b69 | [
"BSD-2-Clause-Views"
] | permissive | gregorylm/MSaaS | 0e455d9f85947074c2e4a69346ff3a560fb4dfeb | 119420f5cce29ef38d9318d9b07869398c5096dd | refs/heads/master | 2020-12-24T01:27:02.409945 | 2016-06-06T14:30:42 | 2016-06-06T14:30:42 | 60,371,570 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,394 | h | /**
* Copyright (c) 2014, James Nutaro
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* The views and conclusions contained in the software and documentation are those
* of the authors and should not be interpreted as representing official policies,
* either expressed or implied, of the FreeBSD Project.
*
* Bugs, comments, and questions can be sent to nutaro@gmail.com
*/
#ifndef _adevs_fmi_h_
#define _adevs_fmi_h_
#include <algorithm>
#include <cmath>
#include <iostream>
#include <dlfcn.h>
#include <cstdlib>
#include "adevs_hybrid.h"
#include "fmi2Functions.h"
#include "fmi2FunctionTypes.h"
#include "fmi2TypesPlatform.h"
namespace adevs
{
/**
* Load an FMI wrapped continuous system model for use in a
* discrete event simulation. The FMI can then be attached
* to any of the ODE solvers and event detectors in adevs
* for simulation with the Hybrid class. This FMI loader
* does not automatically extract model information from the
* description XML, and so that information must be provided
* explicitly by the end-user, but you probably need to know
* this information regardless if you are using the FMI inside
* of a larger discrete event simulation.
*/
template <typename X> class FMI:
public ode_system<X>
{
public:
/**
* This constructs a wrapper around an FMI. The constructor
* must be provided with the FMI's GUID, the number of state variables,
* number of event indicators, and the path to the .so file
* that contains the FMI functions for this model.
*/
FMI(const char* modelname,
const char* guid,
int num_state_variables,
int num_event_indicators,
const char* shared_lib_name,
const double tolerance = 1E-8,
int num_extra_event_indicators = 0);
/// Copy the initial state of the model to q
virtual void init(double* q);
/// Compute the derivative for state q and put it in dq
virtual void der_func(const double* q, double* dq);
/// Compute the state event functions for state q and put them in z
virtual void state_event_func(const double* q, double* z);
/// Compute the time event function using state q
virtual double time_event_func(const double* q);
/**
* This method is invoked immediately following an update of the
* continuous state variables and signal to the FMI the end
* of an integration state.
*/
virtual void postStep(double* q);
/**
* The internal transition function. This function will process all events
* required by the FMI. Any derived class should call this method for the
* parent class, then set or get any variables as appropriate, and then
* call the base class method again to account for these changes.
*/
virtual void internal_event(double* q,
const bool* state_event);
/**
* The external transition See the notes on the internal_event function for
* derived classes.
*/
virtual void external_event(double* q, double e,
const Bag<X>& xb);
/**
* The confluent transition function. See the notes on the internal_event function for
* derived classes.
*/
virtual void confluent_event(double *q, const bool* state_event,
const Bag<X>& xb);
/**
* The output function. This can read variables for the FMI, but should
* not make any modifications to those variables.
*/
virtual void output_func(const double *q, const bool* state_event,
Bag<X>& yb);
/**
* Garbage collection function. This works just like the Atomic gc_output method.
* The default implementation does nothing.
*/
virtual void gc_output(Bag<X>& gb);
/// Destructor
virtual ~FMI();
// Get the current time
double get_time() const { return t_now; }
// Get the value of a real variable
double get_real(int k);
// Set the value of a real variable
void set_real(int k, double val);
// Get the value of an integer variable
int get_int(int k);
// Set the value of an integer variable
void set_int(int k, int val);
// Get the value of a boolean variable
bool get_bool(int k);
// Set the value of a boolean variable
void set_bool(int k, bool val);
private:
// Reference to the FMI
fmi2Component c;
// Pointer to the FMI interface
fmi2Component (*_fmi2Instantiate)(fmi2String, fmi2Type,
fmi2String, fmi2String, const fmi2CallbackFunctions*,
fmi2Boolean, fmi2Boolean);
void (*_fmi2FreeInstance)(fmi2Component);
fmi2Status (*_fmi2SetupExperiment)(fmi2Component, fmi2Boolean,
fmi2Real, fmi2Real, fmi2Boolean, fmi2Real);
fmi2Status (*_fmi2EnterInitializationMode)(fmi2Component);
fmi2Status (*_fmi2ExitInitializationMode)(fmi2Component);
fmi2Status (*_fmi2GetReal)(fmi2Component, const fmi2ValueReference*, size_t, fmi2Real*);
fmi2Status (*_fmi2GetInteger)(fmi2Component, const fmi2ValueReference*, size_t, fmi2Integer*);
fmi2Status (*_fmi2GetBoolean)(fmi2Component, const fmi2ValueReference*, size_t, fmi2Boolean*);
fmi2Status (*_fmi2GetString)(fmi2Component, const fmi2ValueReference*, size_t, fmi2String*);
fmi2Status (*_fmi2SetReal)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2Real*);
fmi2Status (*_fmi2SetInteger)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2Integer*);
fmi2Status (*_fmi2SetBoolean)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2Boolean*);
fmi2Status (*_fmi2SetString)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2String*);
fmi2Status (*_fmi2EnterEventMode)(fmi2Component);
fmi2Status (*_fmi2NewDiscreteStates)(fmi2Component,fmi2EventInfo*);
fmi2Status (*_fmi2EnterContinuousTimeMode)(fmi2Component);
fmi2Status (*_fmi2CompletedIntegratorStep)(fmi2Component, fmi2Boolean, fmi2Boolean*, fmi2Boolean*);
fmi2Status (*_fmi2SetTime)(fmi2Component, fmi2Real);
fmi2Status (*_fmi2SetContinuousStates)(fmi2Component, const fmi2Real*, size_t);
fmi2Status (*_fmi2GetDerivatives)(fmi2Component, fmi2Real*, size_t);
fmi2Status (*_fmi2GetEventIndicators)(fmi2Component, fmi2Real*, size_t);
fmi2Status (*_fmi2GetContinuousStates)(fmi2Component, fmi2Real*, size_t);
// Instant of the next time event
double next_time_event;
// Current time
double t_now;
// so library handle
void* so_hndl;
// Are we in continuous time mode?
bool cont_time_mode;
// Number of event indicators that are not governed by the FMI
int num_extra_event_indicators;
static void fmilogger(
fmi2ComponentEnvironment componentEnvironment,
fmi2String instanceName,
fmi2Status status,
fmi2String category,
fmi2String message, ...)
{
std::cerr << message << std::endl;
}
fmi2CallbackFunctions* callbackFuncs;
void iterate_events();
};
template <typename X>
FMI<X>::FMI(const char* modelname,
const char* guid,
int num_state_variables,
int num_event_indicators,
const char* so_file_name,
const double tolerance,
int num_extra_event_indicators):
// One extra variable at the end for time
ode_system<X>(num_state_variables+1,num_event_indicators+num_extra_event_indicators),
next_time_event(adevs_inf<double>()),
t_now(0.0),
so_hndl(NULL),
cont_time_mode(false),
num_extra_event_indicators(num_extra_event_indicators)
{
fmi2CallbackFunctions tmp = {adevs::FMI<X>::fmilogger,calloc,free,NULL,NULL};
callbackFuncs = new fmi2CallbackFunctions(tmp);
so_hndl = dlopen(so_file_name, RTLD_LAZY);
if (!so_hndl)
{
throw adevs::exception("Could not load so file",this);
}
// This only works with a POSIX compliant compiler/system
_fmi2Instantiate = (fmi2Component (*)(fmi2String, fmi2Type,
fmi2String, fmi2String, const fmi2CallbackFunctions*,
fmi2Boolean, fmi2Boolean))dlsym(so_hndl,"fmi2Instantiate");
assert(_fmi2Instantiate != NULL);
_fmi2FreeInstance = (void (*)(fmi2Component))dlsym(so_hndl,"fmi2FreeInstance");
assert(_fmi2FreeInstance != NULL);
_fmi2SetupExperiment = (fmi2Status (*)(fmi2Component, fmi2Boolean,
fmi2Real, fmi2Real, fmi2Boolean, fmi2Real))dlsym(so_hndl,"fmi2SetupExperiment");
assert(_fmi2SetupExperiment != NULL);
_fmi2EnterInitializationMode = (fmi2Status (*)(fmi2Component))dlsym(so_hndl,"fmi2EnterInitializationMode");
assert(_fmi2EnterInitializationMode != NULL);
_fmi2ExitInitializationMode = (fmi2Status (*)(fmi2Component))dlsym(so_hndl,"fmi2ExitInitializationMode");
assert(_fmi2ExitInitializationMode != NULL);
_fmi2GetReal = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, fmi2Real*))
dlsym(so_hndl,"fmi2GetReal");
assert(_fmi2GetReal != NULL);
_fmi2GetInteger = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, fmi2Integer*))
dlsym(so_hndl,"fmi2GetInteger");
assert(_fmi2GetInteger != NULL);
_fmi2GetBoolean = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, fmi2Boolean*))
dlsym(so_hndl,"fmi2GetBoolean");
assert(_fmi2GetBoolean != NULL);
_fmi2GetString = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, fmi2String*))
dlsym(so_hndl,"fmi2GetString");
assert(_fmi2GetString != NULL);
_fmi2SetReal = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2Real*))
dlsym(so_hndl,"fmi2SetReal");
assert(_fmi2SetReal != NULL);
_fmi2SetInteger = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2Integer*))
dlsym(so_hndl,"fmi2SetInteger");
assert(_fmi2SetInteger != NULL);
_fmi2SetBoolean = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2Boolean*))
dlsym(so_hndl,"fmi2SetBoolean");
assert(_fmi2SetBoolean != NULL);
_fmi2SetString = (fmi2Status (*)(fmi2Component, const fmi2ValueReference*, size_t, const fmi2String*))
dlsym(so_hndl,"fmi2SetString");
assert(_fmi2SetString != NULL);
_fmi2EnterEventMode = (fmi2Status (*)(fmi2Component))dlsym(so_hndl,"fmi2EnterEventMode");
assert(_fmi2EnterEventMode != NULL);
_fmi2NewDiscreteStates = (fmi2Status (*)(fmi2Component,fmi2EventInfo*))dlsym(so_hndl,"fmi2NewDiscreteStates");
assert(_fmi2NewDiscreteStates != NULL);
_fmi2EnterContinuousTimeMode = (fmi2Status (*)(fmi2Component))dlsym(so_hndl,"fmi2EnterContinuousTimeMode");
assert(_fmi2EnterContinuousTimeMode != NULL);
_fmi2CompletedIntegratorStep = (fmi2Status (*)(fmi2Component, fmi2Boolean, fmi2Boolean*, fmi2Boolean*))
dlsym(so_hndl,"fmi2CompletedIntegratorStep");
assert(_fmi2CompletedIntegratorStep != NULL);
_fmi2SetTime = (fmi2Status (*)(fmi2Component, fmi2Real))dlsym(so_hndl,"fmi2SetTime");
assert(_fmi2SetTime != NULL);
_fmi2SetContinuousStates = (fmi2Status (*)(fmi2Component, const fmi2Real*, size_t))
dlsym(so_hndl,"fmi2SetContinuousStates");
assert(_fmi2SetContinuousStates != NULL);
_fmi2GetDerivatives = (fmi2Status (*)(fmi2Component, fmi2Real*, size_t))dlsym(so_hndl,"fmi2GetDerivatives");
assert(_fmi2GetDerivatives != NULL);
_fmi2GetEventIndicators = (fmi2Status (*)(fmi2Component, fmi2Real*, size_t))dlsym(so_hndl,"fmi2GetEventIndicators");
assert(_fmi2GetEventIndicators != NULL);
_fmi2GetContinuousStates = (fmi2Status (*)(fmi2Component, fmi2Real*, size_t))dlsym(so_hndl,"fmi2GetContinuousStates");
assert(_fmi2GetContinuousStates != NULL);
// Create the FMI component
c = _fmi2Instantiate(modelname,fmi2ModelExchange,guid,"",callbackFuncs,fmi2False,fmi2False);
assert(c != NULL);
_fmi2SetupExperiment(c,fmi2True,tolerance,-1.0,fmi2False,-1.0);
}
template <typename X>
void FMI<X>::iterate_events()
{
fmi2Status status;
// Put into consistent initial state
fmi2EventInfo eventInfo;
do
{
status = _fmi2NewDiscreteStates(c,&eventInfo);
assert(status == fmi2OK);
}
while (eventInfo.newDiscreteStatesNeeded == fmi2True);
if (eventInfo.nextEventTimeDefined == fmi2True)
next_time_event = eventInfo.nextEventTime;
assert(status == fmi2OK);
}
template <typename X>
void FMI<X>::init(double* q)
{
fmi2Status status;
// Set initial value for time
status = _fmi2SetTime(c,t_now);
assert(status == fmi2OK);
// Initialize all variables
status = _fmi2EnterInitializationMode(c);
assert(status == fmi2OK);
// Done with initialization
status = _fmi2ExitInitializationMode(c);
assert(status == fmi2OK);
// Put into consistent initial state
iterate_events();
// Enter continuous time mode to start integration
status = _fmi2EnterContinuousTimeMode(c);
assert(status == fmi2OK);
status = _fmi2GetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
q[this->numVars()-1] = t_now;
cont_time_mode = true;
}
template <typename X>
void FMI<X>::der_func(const double* q, double* dq)
{
fmi2Status status;
if (!cont_time_mode)
{
status = _fmi2EnterContinuousTimeMode(c);
assert(status == fmi2OK);
cont_time_mode = true;
}
status =_fmi2SetTime(c,q[this->numVars()-1]);
assert(status == fmi2OK);
status = _fmi2SetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
status = _fmi2GetDerivatives(c,dq,this->numVars()-1);
assert(status == fmi2OK);
dq[this->numVars()-1] = 1.0;
}
template <typename X>
void FMI<X>::state_event_func(const double* q, double* z)
{
fmi2Status status;
if (!cont_time_mode)
{
status = _fmi2EnterContinuousTimeMode(c);
assert(status == fmi2OK);
cont_time_mode = true;
}
status = _fmi2SetTime(c,q[this->numVars()-1]);
assert(status == fmi2OK);
status = _fmi2SetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
status = _fmi2GetEventIndicators(c,z,this->numEvents()-num_extra_event_indicators);
assert(status == fmi2OK);
}
template <typename X>
double FMI<X>::time_event_func(const double* q)
{
return next_time_event-q[this->numVars()-1];
}
template <typename X>
void FMI<X>::postStep(double* q)
{
assert(cont_time_mode);
// Don't advance the FMI state by zero units of time
// when in continuous mode
if (q[this->numVars()-1] <= t_now)
return;
// Try to complete the integration step
fmi2Status status;
fmi2Boolean enterEventMode;
fmi2Boolean terminateSimulation;
t_now = q[this->numVars()-1];
status = _fmi2SetTime(c,t_now);
assert(status == fmi2OK);
status = _fmi2SetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
status = _fmi2CompletedIntegratorStep(c,fmi2True,&enterEventMode,&terminateSimulation);
assert(status == fmi2OK);
// Force an event if one is indicated
if (enterEventMode == fmi2True)
next_time_event = t_now;
}
template <typename X>
void FMI<X>::internal_event(double* q, const bool* state_event)
{
fmi2Status status;
// postStep will have updated the continuous variables, so
// we just process discrete events here.
if (cont_time_mode)
{
status = _fmi2EnterEventMode(c);
assert(status == fmi2OK);
cont_time_mode = false;
}
// Process events
iterate_events();
// Update the state variable array
status = _fmi2GetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
}
template <typename X>
void FMI<X>::external_event(double* q, double e, const Bag<X>& xb)
{
fmi2Status status;
// Go to event mode if we have not yet done so
if (cont_time_mode)
{
status = _fmi2EnterEventMode(c);
assert(status == fmi2OK);
cont_time_mode = false;
}
// process any events that need processing
iterate_events();
status = _fmi2GetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
}
template <typename X>
void FMI<X>::confluent_event(double *q, const bool* state_event, const Bag<X>& xb)
{
fmi2Status status;
// postStep will have updated the continuous variables, so
// we just process discrete events here.
if (cont_time_mode)
{
status = _fmi2EnterEventMode(c);
assert(status == fmi2OK);
cont_time_mode = false;
}
iterate_events();
status = _fmi2GetContinuousStates(c,q,this->numVars()-1);
assert(status == fmi2OK);
}
template <typename X>
void FMI<X>::output_func(const double *q, const bool* state_event, Bag<X>& yb)
{
}
template <typename X>
void FMI<X>::gc_output(Bag<X>& gb)
{
}
template <typename X>
FMI<X>::~FMI()
{
_fmi2FreeInstance(c);
delete callbackFuncs;
dlclose(so_hndl);
}
template <typename X>
double FMI<X>::get_real(int k)
{
const fmi2ValueReference ref = k;
fmi2Real val;
fmi2Status status = _fmi2GetReal(c,&ref,1,&val);
assert(status == fmi2OK);
return val;
}
template <typename X>
void FMI<X>::set_real(int k, double val)
{
const fmi2ValueReference ref = k;
fmi2Real fmi_val = val;
fmi2Status status = _fmi2SetReal(c,&ref,1,&fmi_val);
assert(status == fmi2OK);
}
template <typename X>
int FMI<X>::get_int(int k)
{
const fmi2ValueReference ref = k;
fmi2Integer val;
fmi2Status status = _fmi2GetInteger(c,&ref,1,&val);
assert(status == fmi2OK);
return val;
}
template <typename X>
void FMI<X>::set_int(int k, int val)
{
const fmi2ValueReference ref = k;
fmi2Integer fmi_val = val;
fmi2Status status = _fmi2SetInteger(c,&ref,1,&fmi_val);
assert(status == fmi2OK);
}
template <typename X>
bool FMI<X>::get_bool(int k)
{
const fmi2ValueReference ref = k;
fmi2Boolean val;
fmi2Status status = _fmi2GetBoolean(c,&ref,1,&val);
assert(status == fmi2OK);
return (val == fmi2True);
}
template <typename X>
void FMI<X>::set_bool(int k, bool val)
{
const fmi2ValueReference ref = k;
fmi2Boolean fmi_val = fmi2False;
if (val) fmi_val = fmi2True;
fmi2Status status = _fmi2SetBoolean(c,&ref,1,&fmi_val);
assert(status == fmi2OK);
}
} // end of namespace
#endif
| [
"greg@spawar.navy.mil"
] | greg@spawar.navy.mil |
641e79a9c8138f91e8c7ba8b51c267600bb9d366 | 18476e38d4f7b5183b02a489103188fc81ba27a3 | /readNas/readNas/GEntity.h | 5a9e1e240d699589f239b1c7a1092d7b695b733d | [] | no_license | chapman2014/ioNas | e1a0870aa66331f3bb14f335c05e229b29b26bb9 | 9fb0ee33c17debe6c7e863fdc2c1d456698ffa94 | refs/heads/master | 2020-12-14T13:25:00.912105 | 2015-08-29T03:54:17 | 2015-08-29T03:54:17 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,768 | h | #ifndef _GENTITY_H_
#define _GENTITY_H_
class MVertex;
class GVertex;
class GEdge;
class GModel;
class GEntity{
private:
// all entities are owned by a GModel
GModel *_model;
// the tag (the number) of this entity
int _tag;
// gives the number of the master entity in periodic mesh, gives _tag
// if non-periodic
int _meshMaster;
public:
//尚未添加到cpp文件中
GEntity(GModel *m, int t): _model(m), _tag(t), _meshMaster(t){};
// these will become protected at some point
// the mesh vertices uniquely owned by the entity
std::vector<MVertex*> mesh_vertices;
// the model owning this entity
GModel *model() const { return _model; }
// get/set the tag of the entity
int tag() const { return _tag; }
void setTag(int tag) { _tag = tag; }
enum MeshGenerationStatus {
PENDING,
DONE,
FAILED
};
// all known entity types
enum GeomType {
Unknown,
Point,
BoundaryLayerPoint,
Line,
Circle,
Ellipse,
Conic,
Parabola,
Hyperbola,
TrimmedCurve,
OffsetCurve,
BSpline,
Bezier,
ParametricCurve,
BoundaryLayerCurve,
CompoundCurve,
DiscreteCurve,
Plane,
Nurb,
Cylinder,
Sphere,
Cone,
Torus,
RuledSurface,
ParametricSurface,
ProjectionFace,
BSplineSurface,
BezierSurface,
SurfaceOfRevolution,
BoundaryLayerSurface,
DiscreteSurface,
CompoundSurface,
Volume,
DiscreteVolume,
CompoundVolume,
PartitionVertex,
PartitionCurve,
PartitionSurface,
HiddenSurface
};
virtual int dim() const { return -1; }
// underlying geometric representation of this entity.
virtual GeomType geomType() const { return Unknown; }
};
class GEntityLessThan {
public:
bool operator()(const GEntity *ent1, const GEntity *ent2) const
{
return ent1->tag() < ent2->tag();
}
};
#endif | [
"pointfly@163.com"
] | pointfly@163.com |
aa9115c02c634c939ce63ed5ff10da097df95eb2 | 45ffbc53f20e3bb6d093e9d5307d753fe98f616b | /Source/WeatherSystem/WeatherSystem.cpp | e3dab314123bab2010bd4725be3b2fa81e9b6b0c | [] | no_license | Hengle/WeatherSystem | 324fa1a8b0e396137506bdedfaa03bd9dcfa42ff | ec0689056e42e5a9d39abadad7b1af7bec845420 | refs/heads/master | 2020-08-18T02:37:51.017535 | 2019-09-12T07:47:45 | 2019-09-12T07:47:45 | 215,737,866 | 2 | 0 | null | 2019-10-17T08:10:24 | 2019-10-17T08:10:24 | null | UTF-8 | C++ | false | false | 232 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "WeatherSystem.h"
#include "Modules/ModuleManager.h"
IMPLEMENT_PRIMARY_GAME_MODULE( FDefaultGameModuleImpl, WeatherSystem, "WeatherSystem" );
| [
"yantingchao@pwrd.com"
] | yantingchao@pwrd.com |
733dd0e532894cb2a1da9675bccd5c552c169562 | a79cfb5e4152b8853c144afa36ada470f593f6bc | /src/damselfish_variable_list.cpp | f98665b3518adf1daf20a99656ba183f6b6b4c7d | [
"MIT"
] | permissive | microwerx/damselfish | c8ffd3bde681a83a7b1526d91ce216b549fad32b | 361114017fbc1141520568dcefcca15eb180593b | refs/heads/master | 2021-07-05T05:04:48.730297 | 2020-12-07T18:28:46 | 2020-12-07T18:28:46 | 207,009,829 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,941 | cpp | #include "damselfish_pch.hpp"
#include <damselfish_base.hpp>
#include <damselfish_variable_list.hpp>
#include <damselfish_lexer.hpp>
namespace Df {
VariableList::VariableList() {}
VariableList::~VariableList() {
variables.clear();
}
bool VariableList::is_var(const std::string& name) const {
auto it = variables.find(name);
if (it == variables.end())
return false;
return true;
}
void VariableList::set_var(const std::string& name, double dval) {
Df::Token token;
token.type = Df::TokenType::TT2_DOUBLE;
token.dval = dval;
token.ival = (int)std::floor(dval);
variables[name] = token;
}
void VariableList::set_var(const std::string& name, int ival) {
Df::Token token;
token.type = Df::TokenType::TT2_INTEGER;
token.dval = ival;
token.ival = ival;
variables[name] = token;
}
void VariableList::set_var(const std::string& name, const std::string& sval) {
Df::Token token;
token.type = Df::TokenType::TT2_STRING;
token.sval = sval;
variables[name] = token;
}
int VariableList::get_var_integer(const std::string& name) const {
auto it = get_var(name);
if (it == get_var_end() || it->second.IsIntegerOrDouble() == false)
return 0;
return it->second.ival;
}
double VariableList::get_var_double(const std::string& name) const {
auto it = get_var(name);
if (it == get_var_end() || it->second.IsIntegerOrDouble() == false)
return 0.0;
return it->second.dval;
}
const std::string& VariableList::get_var_string(const std::string& name) const {
auto it = get_var(name);
if (it == get_var_end() || it->second.IsStringOrIdentifier() == false)
return blankString;
return it->second.sval;
}
std::map<std::string, Df::Token>::const_iterator VariableList::get_var(const std::string& name) const {
return variables.find(name);
}
std::map<std::string, Df::Token>::const_iterator VariableList::get_var_end() const {
return variables.cend();
}
} // namespace Df
| [
"jmetzgar@outlook.com"
] | jmetzgar@outlook.com |
da00065c409ef9c0418db8eb51b5edc613c57ab9 | d5483dcd99880d12517c1517e20a2100bc4c1cc7 | /SampleHelloUI/Classes/CocosGUIScene.cpp | 2f60e9761dc2a6fcb8065566310e2eb6ae2ac45f | [] | no_license | zhouhailiangdegithub/CocoStudioSamplesBasedOnCocos2d-x3.0 | 7e1a197b4a37da0b16d802aa351a1c1582003206 | 7ac2a95dc875462716b6ebb599aa83e51aed03a2 | refs/heads/master | 2021-05-03T10:59:48.020716 | 2016-04-07T09:14:07 | 2016-04-07T09:14:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,030 | cpp | #include "CocosGUIScene.h"
#include "VisibleRect.h"
#include "UISceneManager.h"
#include "cocostudio/CocoStudio.h"
enum
{
LINE_SPACE = 40,
kItemTagBasic = 1000,
};
static struct
{
const char *name;
std::function<void(Ref* sender)> callback;
}
g_guisTests[] =
{
{
"gui ButtonTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIButtonTest);
pManager->setMinUISceneId(kUIButtonTest);
pManager->setMaxUISceneId(kUIButtonTest_Title);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui CheckBoxTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUICheckBoxTest);
pManager->setMinUISceneId(kUICheckBoxTest);
pManager->setMaxUISceneId(kUICheckBoxTest);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui SliderTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUISliderTest);
pManager->setMinUISceneId(kUISliderTest);
pManager->setMaxUISceneId(kUISliderTest_Scale9);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
/*
{
"gui PotentiometerTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIPotentiometerTest);
pManager->setMinUISceneId(kUIPotentiometerTest);
pManager->setMaxUISceneId(kUIPotentiometerTest);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui SwitchTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUISwitchTest_Horizontal);
pManager->setMinUISceneId(kUISwitchTest_Horizontal);
pManager->setMaxUISceneId(kUISwitchTest_VerticalAndTitleVertical);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
*/
{
"gui ImageViewTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIImageViewTest);
pManager->setMinUISceneId(kUIImageViewTest);
pManager->setMaxUISceneId(kUIImageViewTest_Scale9);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui LoadingBarTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUILoadingBarTest_Left);
pManager->setMinUISceneId(kUILoadingBarTest_Left);
pManager->setMaxUISceneId(kUILoadingBarTest_Right_Scale9);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
/*
{
"gui ProgressTimerTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIProgressTimerTest_Radial);
pManager->setMinUISceneId(kUIProgressTimerTest_Radial);
pManager->setMaxUISceneId(kUIProgressTimerTest_WithSpriteFrame);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
*/
{
"gui TextAtalsTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUILabelAtlasTest);
pManager->setMinUISceneId(kUILabelAtlasTest);
pManager->setMaxUISceneId(kUILabelAtlasTest);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui TextTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUILabelTest);
pManager->setMinUISceneId(kUILabelTest);
pManager->setMaxUISceneId(kUILabelTest_TTF);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui TextBMFontTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUILabelBMFontTest);
pManager->setMinUISceneId(kUILabelBMFontTest);
pManager->setMaxUISceneId(kUILabelBMFontTest);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui TextFieldTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUITextFieldTest);
pManager->setMinUISceneId(kUITextFieldTest);
pManager->setMaxUISceneId(kUITextFieldTest_Password);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui LayoutTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUILayoutTest);
pManager->setMinUISceneId(kUILayoutTest);
pManager->setMaxUISceneId(kUILayoutTest_Layout_Relative_Location);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui ScrollViewTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIScrollViewTest_Vertical);
pManager->setMinUISceneId(kUIScrollViewTest_Vertical);
pManager->setMaxUISceneId(kUIScrollViewTest_ScrollToPercentBothDirection_Bounce);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui PageViewTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIPageViewTest);
pManager->setMinUISceneId(kUIPageViewTest);
pManager->setMaxUISceneId(kUIPageViewTest);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui ListViewTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIListViewTest_Vertical);
pManager->setMinUISceneId(kUIListViewTest_Vertical);
pManager->setMaxUISceneId(kUIListViewTest_Horizontal);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
/*
{
"gui GridViewTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIGridViewTest_Mode_Column);
pManager->setMinUISceneId(kUIGridViewTest_Mode_Column);
pManager->setMaxUISceneId(kUIGridViewTest_Mode_Row);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
{
"gui PickerViewTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIPickerViewTest_Vertical);
pManager->setMinUISceneId(kUIPickerViewTest_Vertical);
pManager->setMaxUISceneId(kUIPickerViewTest_Horizontal);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
*/
{
"gui WidgetAddNodeTest",
[](Ref* sender)
{
UISceneManager* pManager = UISceneManager::sharedUISceneManager();
pManager->setCurrentUISceneId(kUIWidgetAddNodeTest);
pManager->setMinUISceneId(kUIWidgetAddNodeTest);
pManager->setMaxUISceneId(kUIWidgetAddNodeTest);
Scene* pScene = pManager->currentUIScene();
Director::getInstance()->replaceScene(pScene);
}
},
};
static const int g_maxTests = sizeof(g_guisTests) / sizeof(g_guisTests[0]);
static Point s_tCurPos = Point::ZERO;
////////////////////////////////////////////////////////
//
// CocosGUITestMainLayer
//
////////////////////////////////////////////////////////
void CocosGUITestMainLayer::onEnter()
{
Layer::onEnter();
auto s = Director::getInstance()->getWinSize();
_itemMenu = Menu::create();
_itemMenu->setPosition( s_tCurPos );
MenuItemFont::setFontName("Arial");
MenuItemFont::setFontSize(24);
for (int i = 0; i < g_maxTests; ++i)
{
auto pItem = MenuItemFont::create(g_guisTests[i].name, g_guisTests[i].callback);
pItem->setPosition(Point(s.width / 2, s.height - (i + 1) * LINE_SPACE));
_itemMenu->addChild(pItem, kItemTagBasic + i);
}
auto listener = EventListenerTouchAllAtOnce::create();
listener->onTouchesBegan = CC_CALLBACK_2(CocosGUITestMainLayer::onTouchesBegan, this);
listener->onTouchesMoved = CC_CALLBACK_2(CocosGUITestMainLayer::onTouchesMoved, this);
_eventDispatcher->addEventListenerWithSceneGraphPriority(listener, this);
addChild(_itemMenu);
}
void CocosGUITestMainLayer::onTouchesBegan(const std::vector<Touch*>& touches, Event *event)
{
auto touch = static_cast<Touch*>(touches[0]);
_beginPos = touch->getLocation();
}
void CocosGUITestMainLayer::onTouchesMoved(const std::vector<Touch*>& touches, Event *event)
{
auto touch = static_cast<Touch*>(touches[0]);
auto touchLocation = touch->getLocation();
float nMoveY = touchLocation.y - _beginPos.y;
auto curPos = _itemMenu->getPosition();
auto nextPos = Point(curPos.x, curPos.y + nMoveY);
if (nextPos.y < 0.0f)
{
_itemMenu->setPosition(Point::ZERO);
return;
}
if (nextPos.y > ((g_maxTests + 1)* LINE_SPACE - VisibleRect::getVisibleRect().size.height))
{
_itemMenu->setPosition(Point(0, ((g_maxTests + 1)* LINE_SPACE - VisibleRect::getVisibleRect().size.height)));
return;
}
_itemMenu->setPosition(nextPos);
_beginPos = touchLocation;
s_tCurPos = nextPos;
}
////////////////////////////////////////////////////////
//
// CocosGUITestScene
//
////////////////////////////////////////////////////////
void CocosGUITestScene::onEnter()
{
Scene::onEnter();
auto layer = new CocosGUITestMainLayer();
addChild(layer);
layer->release();
// add close menu
auto closeItem = MenuItemImage::create("CloseNormal.png",
"CloseSelected.png",
CC_CALLBACK_1(CocosGUITestScene::closeCallback, this) );
auto menu =Menu::create(closeItem, NULL);
menu->setPosition( Point::ZERO );
closeItem->setPosition(Point( VisibleRect::right().x - 30, VisibleRect::top().y - 30));
addChild(menu);
}
void CocosGUITestScene::closeCallback(Ref *pSender)
{
Director::getInstance()->end();
#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)
exit(0);
#endif
} | [
"c.ever.fallen@gmail.com"
] | c.ever.fallen@gmail.com |
2fe96c6f73c312693b3d993d27fbb6cfd228d98a | 3212e9ed57d9979ae1f8aeef748fe75ccf03a676 | /src/GrainViewer/Behavior/QuadMeshData.cpp | 72b5f1eb13676ea169ecf6cd9d810ada65f2da93 | [
"MIT"
] | permissive | eliemichel/GrainViewer | b10ef4aa3007b27e6f9e63c96b1992a3add72f66 | 2c08409dc7717f75a653f05437344f4a868835ed | refs/heads/main | 2023-05-25T06:00:11.045957 | 2023-05-11T15:06:30 | 2023-05-11T15:06:30 | 308,387,434 | 13 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,098 | cpp | /**
* This file is part of GrainViewer, the reference implementation of:
*
* Michel, Élie and Boubekeur, Tamy (2020).
* Real Time Multiscale Rendering of Dense Dynamic Stackings,
* Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.
* https://doi.org/10.1111/cgf.14135
*
* Copyright (c) 2017 - 2020 -- Télécom Paris (Élie Michel <elie.michel@telecom-paris.fr>)
*
* 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 non-infringement. 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 "QuadMeshData.h"
#include "utils/behaviorutils.h"
void QuadMeshData::start()
{
m_vbo = std::make_unique<GlBuffer>(GL_ARRAY_BUFFER);
m_vbo->importBlock(std::vector<glm::vec2>{
{ 0, 0 },
{ 1, 0 },
{ 0, 1 },
{ 1, 1 }
});
m_vbo->addBlockAttribute(0, 2); // uv
glCreateVertexArrays(1, &m_vao);
glBindVertexArray(m_vao);
m_vbo->bind();
m_vbo->enableAttributes(m_vao);
glBindVertexArray(0);
m_vbo->finalize();
}
void QuadMeshData::onDestroy()
{
glDeleteVertexArrays(1, &m_vao);
}
void QuadMeshData::draw() const
{
glBindVertexArray(m_vao);
glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);
}
| [
"elie.michel@exppad.com"
] | elie.michel@exppad.com |
22026901ff2a35bd68baee0e31b388e6513b941a | 6d2413a01ed681a1d9652a98090ae3fe77ca0cca | /Contoh1.ino | e3759fc14f8c060014f4cbadf2173fedbe9e357b | [] | no_license | rakaiqbalsy/Arduino-potensio | bbd09d604c724f1d4ef6ba75777177f1f558d0aa | 1c4892db9c62fd7543240c16138b34634b08f06b | refs/heads/master | 2020-04-04T03:50:48.613128 | 2018-11-01T14:33:42 | 2018-11-01T14:33:42 | 155,728,220 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 315 | ino | int potPin = 2;
int ledPin = 13;
int val =0;
void setup() {
// put your setup code here, to run once:
pinMode(ledPin, OUTPUT);
}
void loop() {
// put your main code here, to run repeatedly:
val = analogRead(potPin);
digitalWrite(ledPin, HIGH);
delay(val);
digitalWrite(ledPin, LOW);
delay(val);
}
| [
"rakaiqbalsy@gmail.com"
] | rakaiqbalsy@gmail.com |
a15802c32c36458a3a1be5e91a0e4de88ae68735 | ba4c3796ffc7154e1e0d2efa920281cd776cf596 | /sort/anasort2.cc | 45c1abf0b332712c9aecee17676d57718a8384b5 | [] | no_license | monut/algo | 2d8e87ad601d8b8bc72f61f81c7985434e2752be | 92639bc8cd88d2f87b213af60bb6b6db80dce299 | refs/heads/master | 2022-01-26T22:00:12.462390 | 2022-01-20T19:31:44 | 2022-01-20T19:31:44 | 123,608,678 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,442 | cc | /*
* Find the anagrams in a list of srings
* letters. case sensitive
* frequency map
*/
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
ostream&
operator<<(ostream& os, vector<string>& v) {
for(auto val : v) {
os << val << " ";
}
return os;
}
map<vector<int>, vector<string>> myresult(const vector<string>& v);
vector<int> str_frequency(string ss);
int
main(){
vector<string> vec = {"stop", "post", "got", "top", "shot", "hots", "tosh"};
auto rslt = myresult(vec);
// ?? write a generic map container printer
if(!rslt.empty()){
for(auto pr : rslt) {
cout << rslt[pr.first];
cout << endl;
}
} else {
cout << "empty resut set" << endl;
}
}
map<vector<int>, vector<string> >
myresult(const vector<string>& v) {
map<vector<int>, vector<string> > m;
for( auto st : v) {
// need to make a copy of the original
// string
// find frequency graph
auto freq = str_frequency(st);
// find runnung time
auto it = m.find(freq);
if(it != m.end()){
it->second.push_back(st);
} else {
m[freq] = {st};
}
}
return m;
}
namespace {
size_t maxsize = 26;
};
vector<int>
str_frequency(string ss) {
vector<int> freq(maxsize,0);
for( auto v : ss) {
freq[v -'a']++;
}
return freq;
}
| [
"monut20018@gmail.com"
] | monut20018@gmail.com |
f5641155399874cb905030091eed1a862a4c3a11 | feac2f72d50c654e6ed6ea9a9f9c24fa1b8bdb6b | /head_first_design_patterns/02_Observer/inc/WeatherData.h | 8a3681da67d41a8ab247ff3cf5b6aea40c7fae20 | [] | no_license | anonymouss/cpp_notes | e211e25a3eebd4d25dd4336f86da972d542f143a | b7ccf53e5a4bea03980c5956cc622dbfdebb20c6 | refs/heads/master | 2023-07-24T02:25:55.537904 | 2022-11-29T11:39:24 | 2022-11-29T11:39:24 | 200,767,620 | 4 | 0 | null | 2023-07-06T21:45:47 | 2019-08-06T03:13:49 | C++ | UTF-8 | C++ | false | false | 561 | h | #ifndef __WEATHER_DATA_H__
#define __WEATHER_DATA_H__
#include "IObserver.h"
#include "ISubject.h"
#include <list>
class WeatherData : public ISubject {
public:
void registerObserver(IObserver *observer) final;
void removeObserver(IObserver *observer) final;
void notifyObserverAll() final;
void measurementsChanged();
void setMeasurements(float temperature, float humidity, float pressure);
private:
std::list<IObserver *> mObservers;
float temperature;
float humidity;
float pressure;
};
#endif // __WEATHER_DATA_H__ | [
"jjcong@outlook.com"
] | jjcong@outlook.com |
ee5213669eb4d792ac0e30b5f226c39e0c66d7d4 | 67025245693ec6fc4c85e707b0d500e5d80ad4ae | /PlatformIO ESP8266 Program/lib/third-party/arduino-json-5.6.7/include/ArduinoJson/TypeTraits/IsUnsignedIntegral.hpp | 690c6a34d42b9a93fdefeb192f559b97f58aa182 | [
"MIT"
] | permissive | alex-mathew/Swatch-Bharath-Smart-Dustbin | adcd84576b1304f468a559e87e882125f2e0f6d3 | 8a7ae9648f91c42de6e241eaeeb330ea27e4ec95 | refs/heads/master | 2023-01-12T03:58:08.812290 | 2020-06-08T02:39:56 | 2020-06-08T02:39:56 | 240,839,725 | 2 | 0 | null | 2022-12-12T01:59:15 | 2020-02-16T05:54:38 | C++ | UTF-8 | C++ | false | false | 1,008 | hpp | // Copyright Benoit Blanchon 2014-2016
// MIT License
//
// Arduino JSON library
// https://github.com/bblanchon/ArduinoJson
// If you like this project, please add a star!
#pragma once
#include "../Configuration.hpp"
#include "IsSame.hpp"
namespace ArduinoJson {
namespace TypeTraits {
// A meta-function that returns true if T is an integral type.
template <typename T>
struct IsUnsignedIntegral {
static const bool value = TypeTraits::IsSame<T, unsigned char>::value ||
TypeTraits::IsSame<T, unsigned short>::value ||
TypeTraits::IsSame<T, unsigned int>::value ||
TypeTraits::IsSame<T, unsigned long>::value ||
#if ARDUINOJSON_USE_LONG_LONG
TypeTraits::IsSame<T, unsigned long long>::value ||
#endif
#if ARDUINOJSON_USE_INT64
TypeTraits::IsSame<T, unsigned __int64>::value ||
#endif
false;
};
}
}
| [
"pingalex94@gmail.com"
] | pingalex94@gmail.com |
57ba7414bd9fc0d289cb809979904f6361eaa698 | 1ae555d3088dc123836060371fc520bf0ff13e52 | /atcoder/abc106/c.cpp | 892d617ce1a968e8b960d2f95390680b15062fd1 | [] | no_license | knagakura/procon | a87b9a1717674aeb5ee3da0301d465e95c758fde | c6ac49dbaaa908ff13cb0d9af439efe5439ec691 | refs/heads/master | 2022-01-31T19:46:33.535685 | 2022-01-23T11:59:02 | 2022-01-23T11:59:02 | 161,764,993 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 498 | cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end() //sort(all(vi S)) sort(all(string S))
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9+7;
const int INF = 1e9;
int main() {
string S;
cin>>S;
char ans = '1';
int K;
cin>>K;
rep(i,K){
if(S[i]!='1'){
ans = S[i];
break;
}
}
cout<<ans<<endl;
} | [
"ngkrkzy03@gmail.com"
] | ngkrkzy03@gmail.com |
7de7238d69764748a4bbff6ac84ff01570821af5 | 661bb25db192b744bd10d6c3ca702a7e307c602d | /TribesAscendSDK/HeaderDump/Engine.OnlineSubsystem.ELoginStatus.h | 9b4bc3035f37760dc886f9158e49cf1f76f8fe7d | [] | no_license | Orvid/TASDK | 9582682f0f60a6f6fce5caea3cdd978f401565b3 | 6057c26b8185b08bc47c58ddecefe0f14becf566 | refs/heads/master | 2020-12-25T01:06:16.876697 | 2013-08-02T16:26:25 | 2013-08-02T16:26:25 | 11,539,096 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 173 | h | #pragma once
namespace UnrealScript
{
enum OnlineSubsystem__ELoginStatus : byte
{
LS_NotLoggedIn = 0,
LS_UsingLocalProfile = 1,
LS_LoggedIn = 2,
LS_MAX = 3,
};
}
| [
"blah38621@gmail.com"
] | blah38621@gmail.com |
248c09103f322990207819e0069019a3f9cb3af0 | af82ac6b0bc30678f9bff06ffea9148b44b10f02 | /src/graphicsbackgrounditem.h | b10e1833869d18290caafb66b34e14e1dbc4ba7e | [] | no_license | jsfdez/1942 | f6a3441ee38d2f88d7c24cfd4c3fc5f8c3f26ac6 | d9dc660b073d1c4a787d5898a422de8b1fbd6889 | refs/heads/master | 2021-01-10T09:25:22.389949 | 2015-09-25T10:10:11 | 2015-09-25T10:17:41 | 52,103,203 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 534 | h | #ifndef GRAPHICSBACKGROUNDITEM_H
#define GRAPHICSBACKGROUNDITEM_H
#include <QGraphicsItem>
class GraphicsBackgroundItem : public QGraphicsItem
{
public:
GraphicsBackgroundItem(QGraphicsItem* parent = nullptr);
virtual QRectF boundingRect() const override;
virtual void paint(QPainter *painter,
const QStyleOptionGraphicsItem *option, QWidget *widget) override;
virtual void advance(int phase);
virtual int type() const override;
private:
quint8 m_offset = 0;
};
#endif // GRAPHICSBACKGROUNDITEM_H
| [
"jsfdez@gmail.com"
] | jsfdez@gmail.com |
1b396dea453962659a55567d9d66a886303a21f4 | 6d7ea0644846eefac0c13f5310fd4cd0cebb782a | /taskServer/taskServer/ConfigurationPage.h | dfa84ac394d0ca787f201be9aa800bef026cc232 | [] | no_license | loyoen/Jet | a54a7120a8b8cafdb361fd68abe70204fe801bc0 | 37b64513a54a04d1803c2a9cc0803ba2ebf79a73 | refs/heads/master | 2016-09-06T11:44:16.061983 | 2014-09-22T13:37:44 | 2014-09-22T13:37:44 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 959 | h | #pragma once
#include "DialogResize.h"
#include "Resource.h"
// CConfigurationPage 对话框
class CConfigurationPage : public CDialogResize
{
DECLARE_DYNAMIC(CConfigurationPage)
public:
CConfigurationPage(CWnd* pParent = NULL); // 标准构造函数
virtual ~CConfigurationPage();
public:
//{{AFX_DATA(CConfigurationPage)
enum { IDD = IDD_PROPPAGE_CONFIGURATION };
UINT m_nPort;
CString m_strWorkProgressFilePath;
UINT m_nTaskID;
UINT m_nHeartBeatInterval;
UINT m_nClientTimeout;
UINT m_nJobGroupExpected;
UINT m_nJobGroupMax;
//}}AFX_DATA
// 对话框数据
protected:
BOOL m_bModified;
protected:
virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV 支持
DECLARE_MESSAGE_MAP()
DECLARE_DLGRESIZE_MAP;
public:
virtual BOOL OnInitDialog();
afx_msg void OnDestroy();
afx_msg void OnApply();
afx_msg void OnBnClickedButtonBrowse();
afx_msg void OnSomethingChanged();
afx_msg void OnUpdateApply(CCmdUI* pCmdUI);
};
| [
"loyoen@loyoen-PC.(none)"
] | loyoen@loyoen-PC.(none) |
c3fdfdfeb4acaa01e629f92e98d6a16195b18635 | 602d427c0a5b27bfdcb84fbe3af65b7d65a50fe1 | /src/Canvas.cpp | 0cd99354d732bd1d1dcfad4b6573782613aa501f | [] | no_license | wpro428416/Canvas | 2ab2a06dad50ece52e7d3abe850b3342c1c5b63e | 932774d63c82922c393996f9d24a9f47fff932e5 | refs/heads/master | 2021-03-12T20:26:58.182908 | 2015-05-16T04:40:29 | 2015-05-16T04:40:29 | 35,709,996 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 436 | cpp | #include "Canvas.h"
#include "Shape.h"
#include <iostream>
using namespace std;
Canvas::Canvas(){
shape = new Shape*[100];
n=0;
i=0;
area=0;
}
Canvas::~Canvas(){}
void Canvas::append(Shape * object){
shape[n++]=object;
i++;
}
void Canvas::draw(){
for(n=0;n<i;n++){
shape[n]->draw();
}
}
double Canvas::totalAreas(){
for(n=0;n<i;n++){
area+=shape[n]->area();
}
return area;
}
| [
"wpro428416@gmail.com"
] | wpro428416@gmail.com |
1f74ed9fadc967b5def8c48a69f445b92dfd9fa4 | 6c996ca5146bd307a062f38819acec16d710656f | /workspace/iw8/code_source/src/universal/com_float8_unittest.cpp | ac04d405d0cc9af87cef55d0ef3ec9800b0a2869 | [] | no_license | Omn1z/OpenIW8 | d46f095d4d743d1d8657f7e396e6d3cf944aa562 | 6c01a9548e4d5f7e1185369a62846f2c6f8304ba | refs/heads/main | 2023-08-15T22:43:01.627895 | 2021-10-10T20:44:57 | 2021-10-10T20:44:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 61,156 | cpp | /*
==============
Float8UnitTest
==============
*/
void Float8UnitTest(void)
{
?Float8UnitTest@@YAXXZ();
}
/*
==============
Float8LoadStoreTest
==============
*/
void Float8LoadStoreTest()
{
__m256i *v0;
__m128 v10;
__int64 v16;
__int64 v17;
char v18[112];
v0 = (__m256i *)((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64);
v0[2].m256i_i64[0] = (unsigned __int64)&v16 ^ _security_cookie;
_YMM0 = _ymm;
__asm { vextractf128 xmm6, ymm0, 0 }
*v0 = _ymm;
if ( _XMM6.m128_f32[0] != 1.0 )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect X0 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 85).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 4) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Y0 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 170).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 8) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Z0 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 255).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect W0 component", "Float8Set", v17) )
__debugbreak();
}
_YMM0 = _ymm;
__asm { vextractf128 xmm6, ymm0, 1 }
if ( _XMM6.m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect X1 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 85).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Y1 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 170).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x18) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Z1 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 255).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x1C) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect W1 component", "Float8Set", v17) )
__debugbreak();
}
*v0 = _ymm;
_YMM0 = (__m256i)(unsigned __int128)_xmm;
__asm
{
vinsertf128 ymm0, ymm0, cs:__xmm@4100000040e0000040c0000040a00000, 1
vextractf128 xmm6, ymm0, 0
}
*(__m256i *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20) = _YMM0;
if ( _XMM6.m128_f32[0] != 1.0 )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect X0 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 85).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 4) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Y0 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 170).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 8) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Z0 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 255).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect W0 component", "Float8Set", v17) )
__debugbreak();
}
_YMM0 = *(__m256i *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20);
__asm { vextractf128 xmm6, ymm0, 1 }
if ( _XMM6.m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect X1 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 85).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Y1 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 170).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x18) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Z1 component", "Float8Set", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 255).m128_f32[0] != *(float *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x1C) )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect W1 component", "Float8Set", v17) )
__debugbreak();
}
v10 = (__m128)LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)v10.m128_u64 = I_flrand(-8.0, 8.0);
_YMM0 = (__m256i)*(unsigned __int128 *)&_mm_shuffle_ps(v10, v10, 0);
__asm
{
vinsertf128 ymm0, ymm0, xmm0, 1
vextractf128 xmm6, ymm0, 0
}
*(__m256i *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20) = _YMM0;
if ( _XMM6.m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect X0 component", "Float8LoadFloat", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 85).m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Y0 component", "Float8LoadFloat", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 170).m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Z0 component", "Float8LoadFloat", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 255).m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect W0 component", "Float8LoadFloat", v17) )
__debugbreak();
}
_YMM0 = *(__m256i *)(((unsigned __int64)v18 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20);
__asm { vextractf128 xmm6, ymm0, 1 }
if ( _XMM6.m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect X1 component", "Float8LoadFloat", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 85).m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Y1 component", "Float8LoadFloat", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 170).m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect Z1 component", "Float8LoadFloat", v17) )
__debugbreak();
}
if ( _mm_shuffle_ps(_XMM6, _XMM6, 255).m128_f32[0] != v10.m128_f32[0] )
{
LODWORD(v17) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect W1 component", "Float8LoadFloat", v17) )
__debugbreak();
}
}
/*
==============
Float8LogicalTest
==============
*/
char Float8LogicalTest()
{
float *v0;
unsigned __int128 v1;
unsigned __int128 v2;
float v3;
float v4;
float v5;
__int128 v6;
__int128 v7;
unsigned __int128 v8;
unsigned __int128 v9;
float v10;
float v11;
float v12;
__int128 v13;
__int128 v14;
int v25;
int v37;
int v38;
int v39;
int v40;
int v41;
int v42;
int v43;
int v44;
unsigned __int128 v45;
unsigned __int128 v46;
float v47;
float v48;
float v49;
__int128 v50;
__int128 v51;
unsigned __int128 v52;
unsigned __int128 v53;
float v54;
float v55;
float v56;
__int128 v57;
__int128 v58;
int v80;
int v81;
int v82;
int v83;
int v84;
int v85;
int v86;
int v87;
unsigned __int128 v88;
unsigned __int128 v89;
float v90;
float v91;
float v92;
__int128 v93;
__int128 v94;
unsigned __int128 v105;
unsigned __int128 v106;
float v107;
float v108;
float v109;
__int128 v110;
__int128 v111;
int v124;
int v125;
int v126;
int v127;
int v128;
int v129;
int v130;
float v131;
int v132;
unsigned __int128 v135;
unsigned __int128 v136;
float v137;
float v138;
float v139;
__int128 v140;
__int128 v141;
unsigned __int128 v152;
unsigned __int128 v153;
float v154;
float v155;
float v156;
__int128 v157;
__int128 v158;
int v171;
int v172;
int v173;
int v174;
int v175;
int v176;
int v177;
float v178;
int v179;
unsigned __int128 v182;
unsigned __int128 v183;
float v184;
float v185;
float v186;
__int128 v187;
__int128 v188;
unsigned __int128 v189;
unsigned __int128 v190;
float v191;
float v192;
float v193;
__int128 v194;
__int128 v195;
int v217;
int v218;
int v219;
int v220;
int v221;
int v222;
int v223;
int v224;
unsigned __int128 v225;
unsigned __int128 v226;
float v227;
float v228;
float v229;
__int128 v230;
__int128 v231;
unsigned __int128 v232;
unsigned __int128 v233;
float v234;
float v235;
float v236;
__int128 v237;
__int128 v238;
int v260;
int v261;
int v262;
int v263;
int v264;
int v265;
int v266;
__int64 v268;
__int64 v269;
char v270[272];
v0 = (float *)((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64);
*(_QWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x60) = (unsigned __int64)&v268 ^ _security_cookie;
v1 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v1 = I_flrand(-8.0, 8.0);
v2 = v1;
*(double *)&v1 = I_flrand(-8.0, 8.0);
v3 = *(float *)&v1;
*(double *)&v1 = I_flrand(-8.0, 8.0);
v4 = *(float *)&v1;
*(double *)&v1 = I_flrand(-8.0, 8.0);
v5 = *(float *)&v1;
v6 = LODWORD(FLOAT_N8_0);
*(double *)&v6 = I_flrand(-8.0, 8.0);
v7 = v6;
*(double *)&v6 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) = *(float *)&v6;
*(double *)&v6 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) = *(float *)&v6;
*(double *)&v6 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) = *(float *)&v6;
v8 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v8 = I_flrand(-8.0, 8.0);
v9 = v8;
*(double *)&v8 = I_flrand(-8.0, 8.0);
v10 = *(float *)&v8;
*(double *)&v8 = I_flrand(-8.0, 8.0);
v11 = *(float *)&v8;
*(double *)&v8 = I_flrand(-8.0, 8.0);
v12 = *(float *)&v8;
v13 = LODWORD(FLOAT_N8_0);
*(double *)&v13 = I_flrand(-8.0, 8.0);
v14 = v13;
*(double *)&v13 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) = *(float *)&v13;
*(double *)&v13 = I_flrand(-8.0, 8.0);
*(float *)((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) = *(float *)&v13;
*(double *)&v13 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) = *(float *)&v13;
_XMM0 = v14;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+0Ch], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+0], 20h ; ' '
}
_XMM1 = v9;
_YMM1 = (__m256i)v9;
__asm
{
vinsertps xmm1, xmm1, xmm9, 10h
vinsertps xmm1, xmm1, xmm11, 20h ; ' '
vinsertps xmm0, xmm0, xmm4, 30h ; '0'
vinsertps xmm1, xmm1, xmm13, 30h ; '0'
vinsertf128 ymm3, ymm1, xmm0, 1
}
v25 = 0;
_XMM0 = v7;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+8], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+10h], 20h ; ' '
vinsertps xmm0, xmm0, dword ptr [rbp+4], 30h ; '0'
}
_XMM2 = v2;
_YMM2 = (__m256i)v2;
__asm
{
vinsertps xmm2, xmm2, xmm8, 10h
vinsertps xmm2, xmm2, xmm10, 20h ; ' '
vinsertps xmm2, xmm2, xmm12, 30h ; '0'
vinsertf128 ymm0, ymm2, xmm0, 1
vcmpgt_oqps ymm1, ymm0, ymm3
}
v37 = 0;
if ( *(float *)&v2 > *(float *)&v9 )
v37 = -1;
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM1;
if ( (_DWORD)_XMM1 != v37 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (1)", v269) )
__debugbreak();
}
v38 = 0;
if ( v3 > v10 )
v38 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != v38 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (2)", v269) )
__debugbreak();
}
v39 = 0;
if ( v4 > v11 )
v39 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != v39 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (3)", v269) )
__debugbreak();
}
v40 = 0;
if ( v5 > v12 )
v40 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != v40 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (4)", v269) )
__debugbreak();
}
v41 = 0;
if ( *(float *)&v7 > *(float *)&v14 )
v41 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != v41 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (5)", v269) )
__debugbreak();
}
v42 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) > *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) )
v42 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != v42 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (6)", v269) )
__debugbreak();
}
v43 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) > *v0 )
v43 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != v43 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (7)", v269) )
__debugbreak();
}
v44 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) > *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) )
v44 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != v44 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGtfp (8)", v269) )
__debugbreak();
}
v45 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v45 = I_flrand(-8.0, 8.0);
v46 = v45;
*(double *)&v45 = I_flrand(-8.0, 8.0);
v47 = *(float *)&v45;
*(double *)&v45 = I_flrand(-8.0, 8.0);
v48 = *(float *)&v45;
*(double *)&v45 = I_flrand(-8.0, 8.0);
v49 = *(float *)&v45;
v50 = LODWORD(FLOAT_N8_0);
*(double *)&v50 = I_flrand(-8.0, 8.0);
v51 = v50;
*(double *)&v50 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) = *(float *)&v50;
*(double *)&v50 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) = *(float *)&v50;
*(double *)&v50 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) = *(float *)&v50;
v52 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v52 = I_flrand(-8.0, 8.0);
v53 = v52;
*(double *)&v52 = I_flrand(-8.0, 8.0);
v54 = *(float *)&v52;
*(double *)&v52 = I_flrand(-8.0, 8.0);
v55 = *(float *)&v52;
*(double *)&v52 = I_flrand(-8.0, 8.0);
v56 = *(float *)&v52;
v57 = LODWORD(FLOAT_N8_0);
*(double *)&v57 = I_flrand(-8.0, 8.0);
v58 = v57;
*(double *)&v57 = I_flrand(-8.0, 8.0);
*v0 = *(float *)&v57;
*(double *)&v57 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) = *(float *)&v57;
*(double *)&v57 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) = *(float *)&v57;
_XMM0 = v58;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+0], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+0Ch], 20h ; ' '
}
_XMM1 = v53;
_YMM1 = (__m256i)v53;
__asm
{
vinsertps xmm1, xmm1, xmm9, 10h
vinsertps xmm1, xmm1, xmm11, 20h ; ' '
vinsertps xmm0, xmm0, xmm4, 30h ; '0'
vinsertps xmm1, xmm1, xmm13, 30h ; '0'
vinsertf128 ymm3, ymm1, xmm0, 1
}
_XMM0 = v51;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+4], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+10h], 20h ; ' '
vinsertps xmm0, xmm0, dword ptr [rbp+8], 30h ; '0'
}
_XMM2 = v46;
_YMM2 = (__m256i)v46;
__asm
{
vinsertps xmm2, xmm2, xmm8, 10h
vinsertps xmm2, xmm2, xmm10, 20h ; ' '
vinsertps xmm2, xmm2, xmm12, 30h ; '0'
vinsertf128 ymm0, ymm2, xmm0, 1
vcmpge_oqps ymm1, ymm0, ymm3
}
v80 = 0;
if ( *(float *)&v46 >= *(float *)&v53 )
v80 = -1;
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM1;
if ( (_DWORD)_XMM1 != v80 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (1)", v269) )
__debugbreak();
}
v81 = 0;
if ( v47 >= v54 )
v81 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != v81 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (2)", v269) )
__debugbreak();
}
v82 = 0;
if ( v48 >= v55 )
v82 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != v82 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (3)", v269) )
__debugbreak();
}
v83 = 0;
if ( v49 >= v56 )
v83 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != v83 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (4)", v269) )
__debugbreak();
}
v84 = 0;
if ( *(float *)&v51 >= *(float *)&v58 )
v84 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != v84 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (5)", v269) )
__debugbreak();
}
v85 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) >= *v0 )
v85 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != v85 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (6)", v269) )
__debugbreak();
}
v86 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) >= *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) )
v86 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != v86 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (7)", v269) )
__debugbreak();
}
v87 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) >= *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) )
v87 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != v87 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpGefp (8)", v269) )
__debugbreak();
}
v88 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v88 = I_flrand(-8.0, 8.0);
v89 = v88;
*(double *)&v88 = I_flrand(-8.0, 8.0);
v90 = *(float *)&v88;
*(double *)&v88 = I_flrand(-8.0, 8.0);
v91 = *(float *)&v88;
*(double *)&v88 = I_flrand(-8.0, 8.0);
v92 = *(float *)&v88;
v93 = LODWORD(FLOAT_N8_0);
*(double *)&v93 = I_flrand(-8.0, 8.0);
v94 = v93;
*(double *)&v93 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) = *(float *)&v93;
*(double *)&v93 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) = *(float *)&v93;
*(double *)&v93 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) = *(float *)&v93;
_XMM0 = v94;
__asm { vinsertps xmm0, xmm0, xmm6, 10h }
_XMM1 = v89;
_YMM1 = (__m256i)v89;
__asm
{
vinsertps xmm1, xmm1, xmm8, 10h
vinsertps xmm0, xmm0, xmm9, 20h ; ' '
vinsertps xmm1, xmm1, xmm10, 20h ; ' '
vinsertps xmm0, xmm0, xmm2, 30h ; '0'
vinsertps xmm1, xmm1, xmm12, 30h ; '0'
vinsertf128 ymm0, ymm1, xmm0, 1
}
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20) = _YMM0;
v105 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v105 = I_flrand(-8.0, 8.0);
v106 = v105;
*(double *)&v105 = I_flrand(-8.0, 8.0);
v107 = *(float *)&v105;
*(double *)&v105 = I_flrand(-8.0, 8.0);
v108 = *(float *)&v105;
*(double *)&v105 = I_flrand(-8.0, 8.0);
v109 = *(float *)&v105;
v110 = LODWORD(FLOAT_N8_0);
*(double *)&v110 = I_flrand(-8.0, 8.0);
v111 = v110;
*(double *)&v110 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) = *(float *)&v110;
*(double *)&v110 = I_flrand(-8.0, 8.0);
*v0 = *(float *)&v110;
*(double *)&v110 = I_flrand(-8.0, 8.0);
_YMM2 = *(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) = *(float *)&v110;
_XMM1 = v106;
_YMM1 = (__m256i)v106;
__asm
{
vinsertps xmm1, xmm1, xmm9, 10h
vinsertps xmm1, xmm1, xmm11, 20h ; ' '
}
_XMM0 = v111;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+4], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+0], 20h ; ' '
vinsertps xmm1, xmm1, xmm13, 30h ; '0'
vinsertps xmm0, xmm0, xmm4, 30h ; '0'
vinsertf128 ymm0, ymm1, xmm0, 1
vcmpeqps ymm1, ymm2, ymm0
}
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM1;
v124 = -1;
if ( *(float *)&v89 != *(float *)&v106 )
v124 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) != v124 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (1)", v269) )
__debugbreak();
}
v125 = -1;
if ( v90 != v107 )
v125 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != v125 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (2)", v269) )
__debugbreak();
}
v126 = -1;
if ( v91 != v108 )
v126 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != v126 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (3)", v269) )
__debugbreak();
}
v127 = -1;
if ( v92 != v109 )
v127 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != v127 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (4)", v269) )
__debugbreak();
}
v128 = -1;
if ( *(float *)&v94 != *(float *)&v111 )
v128 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != v128 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (5)", v269) )
__debugbreak();
}
v129 = -1;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) != *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) )
v129 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != v129 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (6)", v269) )
__debugbreak();
}
v130 = -1;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) != *v0 )
v130 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != v130 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (7)", v269) )
__debugbreak();
}
v131 = *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC);
v132 = -1;
if ( v131 != *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) )
v132 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != v132 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (8)", v269) )
__debugbreak();
}
_YMM0 = *(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20);
__asm { vcmpeqps ymm0, ymm0, ymm0 }
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM0;
if ( v131 != NAN )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (1)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (2)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (3)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (4)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (5)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (6)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (7)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != -1 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpEqfp (8)", v269) )
__debugbreak();
}
v135 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v135 = I_flrand(-8.0, 8.0);
v136 = v135;
*(double *)&v135 = I_flrand(-8.0, 8.0);
v137 = *(float *)&v135;
*(double *)&v135 = I_flrand(-8.0, 8.0);
v138 = *(float *)&v135;
*(double *)&v135 = I_flrand(-8.0, 8.0);
v139 = *(float *)&v135;
v140 = LODWORD(FLOAT_N8_0);
*(double *)&v140 = I_flrand(-8.0, 8.0);
v141 = v140;
*(double *)&v140 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) = *(float *)&v140;
*(double *)&v140 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) = *(float *)&v140;
*(double *)&v140 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) = *(float *)&v140;
_XMM0 = v141;
__asm { vinsertps xmm0, xmm0, xmm6, 10h }
_XMM1 = v136;
_YMM1 = (__m256i)v136;
__asm
{
vinsertps xmm1, xmm1, xmm8, 10h
vinsertps xmm0, xmm0, xmm9, 20h ; ' '
vinsertps xmm1, xmm1, xmm10, 20h ; ' '
vinsertps xmm0, xmm0, xmm2, 30h ; '0'
vinsertps xmm1, xmm1, xmm12, 30h ; '0'
vinsertf128 ymm0, ymm1, xmm0, 1
}
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20) = _YMM0;
v152 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v152 = I_flrand(-8.0, 8.0);
v153 = v152;
*(double *)&v152 = I_flrand(-8.0, 8.0);
v154 = *(float *)&v152;
*(double *)&v152 = I_flrand(-8.0, 8.0);
v155 = *(float *)&v152;
*(double *)&v152 = I_flrand(-8.0, 8.0);
v156 = *(float *)&v152;
v157 = LODWORD(FLOAT_N8_0);
*(double *)&v157 = I_flrand(-8.0, 8.0);
v158 = v157;
*(double *)&v157 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) = *(float *)&v157;
*(double *)&v157 = I_flrand(-8.0, 8.0);
*v0 = *(float *)&v157;
*(double *)&v157 = I_flrand(-8.0, 8.0);
_YMM2 = *(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) = *(float *)&v157;
_XMM1 = v153;
_YMM1 = (__m256i)v153;
__asm
{
vinsertps xmm1, xmm1, xmm9, 10h
vinsertps xmm1, xmm1, xmm11, 20h ; ' '
}
_XMM0 = v158;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+4], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+0], 20h ; ' '
vinsertps xmm1, xmm1, xmm13, 30h ; '0'
vinsertps xmm0, xmm0, xmm4, 30h ; '0'
vinsertf128 ymm0, ymm1, xmm0, 1
vcmpneq_oqps ymm1, ymm2, ymm0
}
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM1;
v171 = -1;
if ( *(float *)&v136 == *(float *)&v153 )
v171 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) != v171 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (1)", v269) )
__debugbreak();
}
v172 = -1;
if ( v137 == v154 )
v172 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != v172 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (2)", v269) )
__debugbreak();
}
v173 = -1;
if ( v138 == v155 )
v173 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != v173 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (3)", v269) )
__debugbreak();
}
v174 = -1;
if ( v139 == v156 )
v174 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != v174 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (4)", v269) )
__debugbreak();
}
v175 = -1;
if ( *(float *)&v141 == *(float *)&v158 )
v175 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != v175 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (5)", v269) )
__debugbreak();
}
v176 = -1;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) == *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) )
v176 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != v176 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (6)", v269) )
__debugbreak();
}
v177 = -1;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) == *v0 )
v177 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != v177 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (7)", v269) )
__debugbreak();
}
v178 = *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC);
v179 = -1;
if ( v178 == *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) )
v179 = 0;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != v179 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (8)", v269) )
__debugbreak();
}
_YMM0 = *(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x20);
__asm { vcmpneq_oqps ymm0, ymm0, ymm0 }
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM0;
if ( v178 != 0.0 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (1)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (2)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (3)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (4)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (5)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (6)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (7)", v269) )
__debugbreak();
}
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpNeqfp (8)", v269) )
__debugbreak();
}
v182 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v182 = I_flrand(-8.0, 8.0);
v183 = v182;
*(double *)&v182 = I_flrand(-8.0, 8.0);
v184 = *(float *)&v182;
*(double *)&v182 = I_flrand(-8.0, 8.0);
v185 = *(float *)&v182;
*(double *)&v182 = I_flrand(-8.0, 8.0);
v186 = *(float *)&v182;
v187 = LODWORD(FLOAT_N8_0);
*(double *)&v187 = I_flrand(-8.0, 8.0);
v188 = v187;
*(double *)&v187 = I_flrand(-8.0, 8.0);
*v0 = *(float *)&v187;
*(double *)&v187 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) = *(float *)&v187;
*(double *)&v187 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) = *(float *)&v187;
v189 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v189 = I_flrand(-8.0, 8.0);
v190 = v189;
*(double *)&v189 = I_flrand(-8.0, 8.0);
v191 = *(float *)&v189;
*(double *)&v189 = I_flrand(-8.0, 8.0);
v192 = *(float *)&v189;
*(double *)&v189 = I_flrand(-8.0, 8.0);
v193 = *(float *)&v189;
v194 = LODWORD(FLOAT_N8_0);
*(double *)&v194 = I_flrand(-8.0, 8.0);
v195 = v194;
*(double *)&v194 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) = *(float *)&v194;
*(double *)&v194 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) = *(float *)&v194;
*(double *)&v194 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) = *(float *)&v194;
_XMM0 = v195;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+4], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+10h], 20h ; ' '
}
_XMM1 = v190;
_YMM1 = (__m256i)v190;
__asm
{
vinsertps xmm1, xmm1, xmm9, 10h
vinsertps xmm1, xmm1, xmm11, 20h ; ' '
vinsertps xmm0, xmm0, xmm4, 30h ; '0'
vinsertps xmm1, xmm1, xmm13, 30h ; '0'
vinsertf128 ymm3, ymm1, xmm0, 1
}
_XMM0 = v188;
__asm
{
vinsertps xmm0, xmm0, dword ptr [rbp+0], 10h
vinsertps xmm0, xmm0, dword ptr [rbp+0Ch], 20h ; ' '
vinsertps xmm0, xmm0, dword ptr [rbp+8], 30h ; '0'
}
_XMM2 = v183;
_YMM2 = (__m256i)v183;
__asm
{
vinsertps xmm2, xmm2, xmm8, 10h
vinsertps xmm2, xmm2, xmm10, 20h ; ' '
vinsertps xmm2, xmm2, xmm12, 30h ; '0'
vinsertf128 ymm0, ymm2, xmm0, 1
vcmple_oqps ymm1, ymm0, ymm3
}
v217 = 0;
if ( *(float *)&v190 >= *(float *)&v183 )
v217 = -1;
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM1;
if ( (_DWORD)_XMM1 != v217 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (1)", v269) )
__debugbreak();
}
v218 = 0;
if ( v191 >= v184 )
v218 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != v218 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (2)", v269) )
__debugbreak();
}
v219 = 0;
if ( v192 >= v185 )
v219 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != v219 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (3)", v269) )
__debugbreak();
}
v220 = 0;
if ( v193 >= v186 )
v220 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != v220 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (4)", v269) )
__debugbreak();
}
v221 = 0;
if ( *(float *)&v195 >= *(float *)&v188 )
v221 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != v221 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (5)", v269) )
__debugbreak();
}
v222 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) >= *v0 )
v222 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != v222 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (6)", v269) )
__debugbreak();
}
v223 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) >= *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) )
v223 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != v223 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (7)", v269) )
__debugbreak();
}
v224 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) >= *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) )
v224 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != v224 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLefp (8)", v269) )
__debugbreak();
}
v225 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v225 = I_flrand(-8.0, 8.0);
v226 = v225;
*(double *)&v225 = I_flrand(-8.0, 8.0);
v227 = *(float *)&v225;
*(double *)&v225 = I_flrand(-8.0, 8.0);
v228 = *(float *)&v225;
*(double *)&v225 = I_flrand(-8.0, 8.0);
v229 = *(float *)&v225;
v230 = LODWORD(FLOAT_N8_0);
*(double *)&v230 = I_flrand(-8.0, 8.0);
v231 = v230;
*(double *)&v230 = I_flrand(-8.0, 8.0);
*v0 = *(float *)&v230;
*(double *)&v230 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) = *(float *)&v230;
*(double *)&v230 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) = *(float *)&v230;
v232 = LODWORD(FLOAT_N8_0);
g_unitSavedSeed = *GetRandSeed();
*(double *)&v232 = I_flrand(-8.0, 8.0);
v233 = v232;
*(double *)&v232 = I_flrand(-8.0, 8.0);
v234 = *(float *)&v232;
*(double *)&v232 = I_flrand(-8.0, 8.0);
v235 = *(float *)&v232;
*(double *)&v232 = I_flrand(-8.0, 8.0);
v236 = *(float *)&v232;
v237 = LODWORD(FLOAT_N8_0);
*(double *)&v237 = I_flrand(-8.0, 8.0);
v238 = v237;
*(double *)&v237 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) = *(float *)&v237;
*(double *)&v237 = I_flrand(-8.0, 8.0);
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) = *(float *)&v237;
*(double *)&v237 = I_flrand(-8.0, 8.0);
_XMM2 = v233;
_YMM2 = (__m256i)v233;
__asm
{
vinsertps xmm2, xmm2, xmm9, 10h
vinsertps xmm2, xmm2, xmm11, 20h ; ' '
}
_XMM1 = v238;
__asm
{
vinsertps xmm1, xmm1, dword ptr [rbp+4], 10h
vinsertps xmm1, xmm1, dword ptr [rbp+10h], 20h ; ' '
vinsertps xmm2, xmm2, xmm13, 30h ; '0'
vinsertps xmm1, xmm1, xmm0, 30h ; '0'
vinsertf128 ymm4, ymm2, xmm1, 1
}
*(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) = *(float *)&v237;
_XMM3 = v226;
_YMM3 = (__m256i)v226;
__asm
{
vinsertps xmm3, xmm3, xmm8, 10h
vinsertps xmm3, xmm3, xmm10, 20h ; ' '
}
_XMM1 = v231;
__asm
{
vinsertps xmm1, xmm1, dword ptr [rbp+0], 10h
vinsertps xmm1, xmm1, dword ptr [rbp+0Ch], 20h ; ' '
vinsertps xmm1, xmm1, dword ptr [rbp+8], 30h ; '0'
vinsertps xmm3, xmm3, xmm12, 30h ; '0'
vinsertf128 ymm0, ymm3, xmm1, 1
vcmplt_oqps ymm2, ymm0, ymm4
}
v260 = 0;
if ( *(float *)&v233 > *(float *)&v226 )
v260 = -1;
*(__m256i *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x40) = _YMM2;
if ( (_DWORD)_XMM2 != v260 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (1)", v269) )
__debugbreak();
}
v261 = 0;
if ( v234 > v227 )
v261 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x44) != v261 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (2)", v269) )
__debugbreak();
}
v262 = 0;
if ( v235 > v228 )
v262 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x48) != v262 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (3)", v269) )
__debugbreak();
}
v263 = 0;
if ( v236 > v229 )
v263 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x4C) != v263 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (4)", v269) )
__debugbreak();
}
v264 = 0;
if ( *(float *)&v238 > *(float *)&v231 )
v264 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x50) != v264 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (5)", v269) )
__debugbreak();
}
v265 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 4) > *v0 )
v265 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x54) != v265 )
{
LODWORD(v269) = g_unitSavedSeed;
if ( CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (6)", v269) )
__debugbreak();
}
v266 = 0;
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x10) > *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0xC) )
v266 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x58) != v266 )
{
LODWORD(v269) = g_unitSavedSeed;
LOBYTE(v266) = CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (7)", v269);
if ( (_BYTE)v266 )
__debugbreak();
}
if ( *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x14) > *(float *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 8) )
v25 = -1;
if ( *(_DWORD *)(((unsigned __int64)v270 & 0xFFFFFFFFFFFFFFE0ui64) + 0x5C) != v25 )
{
LODWORD(v269) = g_unitSavedSeed;
LOBYTE(v266) = CoreAssert_Handler("c:\\workspace\\iw8\\code_source\\src\\universal\\com_float8_unittest.cpp", 15, ASSERT_TYPE_ASSERT, (const char *)&queryFormat.fmt + 3, "Unit test failure: %s for test '%s' (seed = 0x%x).\n", "Incorrect result", "Float8CmpLtfp (8)", v269);
if ( (_BYTE)v266 )
__debugbreak();
}
return v266;
}
/*
==============
Float8MathTest
==============
*/
void Float8MathTest
{
//Failed decompiling
}
/*
==============
Float8UnitTest
==============
*/
void Float8UnitTest(void)
{
unsigned __int64 v0;
unsigned __int64 v1;
v0 = Sys_Microseconds();
Float8LoadStoreTest();
Float8MathTest();
Float8LogicalTest();
v1 = Sys_Microseconds();
Com_Printf(16, "Float8 unit tests calculated in %zd ticks.\n", v1 - v0);
}
| [
"zkitx@zkitx.jp"
] | zkitx@zkitx.jp |
84016978fb6ff3a328562a981ae32932e4124029 | 5e5d78973d56c097cbc199f35cffaf751a5d7109 | /gpu/command_buffer/service/raster_decoder_context_state.h | daaf1640c490de7ebfa79806bb9748f1fa4324bd | [
"BSD-3-Clause"
] | permissive | gubaojian/chromium-1 | 25b3ea8072afcf826c2a179fddaf174c506609df | a8944dc9781df692dde4e0e49acf5b7605080a58 | refs/heads/master | 2023-03-07T08:27:32.715980 | 2018-07-24T17:10:31 | 2018-07-24T17:10:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,483 | h | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef GPU_COMMAND_BUFFER_SERVICE_RASTER_DECODER_CONTEXT_STATE_H_
#define GPU_COMMAND_BUFFER_SERVICE_RASTER_DECODER_CONTEXT_STATE_H_
#include "base/memory/memory_pressure_listener.h"
#include "base/memory/ref_counted.h"
#include "base/trace_event/memory_dump_provider.h"
#include "gpu/command_buffer/common/skia_utils.h"
#include "gpu/gpu_gles2_export.h"
#include "third_party/skia/include/gpu/GrContext.h"
namespace gl {
class GLContext;
class GLShareGroup;
class GLSurface;
} // namespace gl
namespace gpu {
class GpuDriverBugWorkarounds;
class ServiceTransferCache;
namespace raster {
struct GPU_GLES2_EXPORT RasterDecoderContextState
: public base::RefCounted<RasterDecoderContextState>,
public base::trace_event::MemoryDumpProvider {
public:
RasterDecoderContextState(scoped_refptr<gl::GLShareGroup> share_group,
scoped_refptr<gl::GLSurface> surface,
scoped_refptr<gl::GLContext> context,
bool use_virtualized_gl_contexts);
void InitializeGrContext(const GpuDriverBugWorkarounds& workarounds,
GrContextOptions::PersistentCache* cache);
void PurgeMemory(
base::MemoryPressureListener::MemoryPressureLevel memory_pressure_level);
scoped_refptr<gl::GLShareGroup> share_group;
scoped_refptr<gl::GLSurface> surface;
scoped_refptr<gl::GLContext> context;
sk_sp<GrContext> gr_context;
std::unique_ptr<ServiceTransferCache> transfer_cache;
bool use_virtualized_gl_contexts = false;
bool context_lost = false;
size_t glyph_cache_max_texture_bytes = 0u;
// |need_context_state_reset| is set whenever Skia may have altered the
// driver's GL state. It signals the need to restore driver GL state to
// |state_| before executing commands that do not
// PermitsInconsistentContextState.
bool need_context_state_reset = false;
// base::trace_event::MemoryDumpProvider implementation.
bool OnMemoryDump(const base::trace_event::MemoryDumpArgs& args,
base::trace_event::ProcessMemoryDump* pmd) override;
private:
friend class base::RefCounted<RasterDecoderContextState>;
~RasterDecoderContextState() override;
};
} // namespace raster
} // namespace gpu
#endif // GPU_COMMAND_BUFFER_SERVICE_RASTER_DECODER_CONTEXT_STATE_H_
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
6e191bcfa4fa175dd5b57bf610d73960a39b5e4c | 402fd9923927581e29e6edee1086aa1bfc2c832a | /lib/SimpleBigNum/src/reciprocalEstimator/reciprocalEstimator.h | 1ed10c22836cce79a8f57c815a6d963a96c153cd | [] | no_license | m1kron/SimpleBigNum | 69fd9cf7296877467a8736ad2dd11bd09d71e7ea | bf1bf783f0a5fdd9b128f340603d93517fe39536 | refs/heads/master | 2021-07-13T01:43:20.408436 | 2020-07-25T10:01:39 | 2020-07-25T10:01:39 | 185,238,262 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 291 | h | #pragma once
#include "../../include/bigNum.h"
namespace sbn
{
namespace internal
{
// Class estimaties (1/number) << shift using Newton's method.
class ReciprocalEstimator
{
public:
static SimpleBigNum Estimate( const SimpleBigNum& number, uint32_t shift, uint32_t maxSteps );
};
}
} | [
"piotr.kowalczyk102+github@gmail.com"
] | piotr.kowalczyk102+github@gmail.com |
548452b7ed02129a1d5e2f8462799f11a6bd7135 | f18afbcb574ccba6145d7c5a5b9101c0b94369df | /offer/05用两个栈来实现一个队列/main.cpp | 59858cb1b2a60b4bbd69e3b30c3f4dcaf12dc982 | [] | no_license | MAhaitao999/LeetCode | 73c7e2d790dbec56714dc5409c869535043b9829 | 7ed0f7731793c852f06bfe1944e6e35452a09b67 | refs/heads/master | 2023-04-03T22:23:37.556091 | 2021-04-12T14:43:11 | 2021-04-12T14:43:11 | 265,850,321 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,204 | cpp | /*************************************************************************
> File Name: main.cpp
> Author: Henry Ma
> Mail: iloveicRazavi@gmail.com
> Created Time: 2020年05月27日 星期三 09时00分54秒
************************************************************************/
#include <iostream>
#include <stack>
using namespace std;
class Solution {
public:
void push(int node) {
stack1.push(node);
}
int pop() {
// 如果两个栈都是为空的话, 说明队列为空.
if (stack1.empty() && stack2.empty()) {
cout << "the queue is empty!" << endl;
}
if (!stack2.empty()) {
int res1 = stack2.top();
stack2.pop();
return res1;
}
while(!stack1.empty()) {
stack2.push(stack1.top());
stack1.pop();
}
int res = stack2.top();
stack2.pop();
return res;
}
private:
stack<int> stack1;
stack<int> stack2;
};
int main(int argc, char* argv[]) {
Solution sol;
return 0;
}
/*
用例:
["PSH1","PSH2","PSH3","POP","POP","PSH4","POP","PSH5","POP","POP"]
对应输出应该为:
1,2,3,4,5
*/
| [
"769413715@qq.com"
] | 769413715@qq.com |
49ba27a6baaab726ed69317d0e9fa6f916f950ad | d35415caca84baf61d5d8e3f37f9298948119192 | /BlendWndDll/Register.cpp | fdae57d942c84469ca6b85f5b45ca6ac1c1b3471 | [] | no_license | radtek/Passcal-VOC | fee7ceb341f2f559cb1dcb2fb9920ff82fa13b57 | bb834251a36c04a5c6cd3b0da29f1ddf62355bec | refs/heads/master | 2020-05-29T12:59:46.003867 | 2018-11-25T12:31:50 | 2018-11-25T12:31:50 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,726 | cpp | // RegLayer.cpp : 实现文件
//
#include "stdafx.h"
#include "Register.h"
#include "afxdialogex.h"
// CRegister 对话框
IMPLEMENT_DYNAMIC(CRegister, CTpLayerWnd)
CRegister::CRegister(CWnd* pParent /*=NULL*/)
: CTpLayerWnd(CRegister::IDD, pParent)
{
}
CRegister::CRegister(UINT nIDTemplate, CWnd * pParent/* = nullptr*/)
: CTpLayerWnd(nIDTemplate, pParent)
{
}
CRegister::~CRegister()
{
}
void CRegister::DoDataExchange(CDataExchange* pDX)
{
CTpLayerWnd::DoDataExchange(pDX);
}
BEGIN_MESSAGE_MAP(CRegister, CTpLayerWnd)
END_MESSAGE_MAP()
BEGIN_EVENTSINK_MAP(CRegister, CTpLayerWnd)
ON_EVENT(CRegister, IDC_EDIT_REGWND_PSD, 2, CRegister::EnterPressedEditRegwndpsd, VTS_BSTR)
END_EVENTSINK_MAP()
// CRegister 消息处理程序
BOOL CRegister::OnInitDialog()
{
CTpLayerWnd::OnInitDialog();
// TODO: 在此添加额外的初始化
m_strId = ReadSoftwareId();
_ReadKeyWord();
CAES Aes;
const CString strLeft = m_strId.Left(5);
const CString strRight = m_strId.Right(5);
const CString strId = Aes.Cipher(strLeft + strRight);
if (strId == m_strPsd)
{
((CBL_Edit *)(GetDlgItem(IDC_EDIT_REGWND_PSD)))->SetValueText(_T("此软件已注册！"));
m_BtBaseOk.ShowWindow(SW_HIDE);
m_BtBaseCancel.SetWindowText(_T("退出"));
}
((CBL_Edit *)(GetDlgItem(IDC_EDIT_REGWND_ID)))->SetValueText(m_strId);
return TRUE; // return TRUE unless you set the focus to a control
// 异常: OCX 属性页应返回 FALSE
}
void CRegister::OnOK()
{
// TODO: 在此添加专用代码和/或调用基类
const CString strPsd = ((CBL_Edit *)(GetDlgItem(IDC_EDIT_REGWND_PSD)))->GetValueText();
if (strPsd.IsEmpty())
{
ShowMsgBox(_T("密钥不能为空！"), _T("注册"), MB_OK | MB_ICONERROR);
return;
}
CAES Aes;
const CString strLeft = m_strId.Left(5);
const CString strRight = m_strId.Right(5);
const CString strId = Aes.Cipher(strLeft + strRight);
if (strId == strPsd)
{
CRegKey regKey;
CString strKeyName;
const CString strPath = Aes.Cipher(_T("Register"));
strKeyName.Format(_T("Software\\%s\\%s"), AfxGetAppName(), strPath);
const LONG nRes = regKey.Open(HKEY_LOCAL_MACHINE, strKeyName);
const CString strRegKeyHex = Aes.Cipher(_T("SerialNumber"));
if (ERROR_SUCCESS == nRes)
{
regKey.SetStringValue(strRegKeyHex, strPsd);
}
else if (ERROR_SUCCESS == regKey.Create(HKEY_LOCAL_MACHINE, strKeyName))
{
regKey.SetStringValue(strRegKeyHex, strPsd);
}
else
{
ShowMsgBox(_T("访问注册文件失败！"), _T("注册"), MB_OK | MB_ICONERROR);
return;
}
regKey.Close();
ShowMsgBox(_T("注册成功"), _T("注册"), MB_OK | MB_ICONINFORMATION);
((CBL_Edit *)(GetDlgItem(IDC_EDIT_REGWND_PSD)))->SetValueText(_T("此软件已注册！"));
m_BtBaseOk.ShowWindow(SW_HIDE);
m_BtBaseCancel.SetWindowText(_T("退出"));
return;
}
else
{
ShowMsgBox(_T("密钥错误，注册失败！"), _T("注册"), MB_OK | MB_ICONINFORMATION);
return;
}
CTpLayerWnd::OnOK();
}
BOOL CRegister::IsRegistred(void)
{
m_strId = ReadSoftwareId();
_ReadKeyWord();
CAES Aes;
const CString strLeft = m_strId.Left(5);
const CString strRight = m_strId.Right(5);
const CString strId = Aes.Cipher(strLeft + strRight);
return (strId == m_strPsd);
}
CString CRegister::ReadSoftwareId(void)
{
CHardwareInfo Devinfo;
DRIVEINFO DiskInfo;
CString strId;
BOOL bRes = Devinfo.GetDriveInfo(0, &DiskInfo);
if (bRes)
{
strId = DiskInfo.sSerialNumber;
if (strId.GetLength() < 8)
{
bRes = FALSE;
}
}
if (FALSE == bRes)
{
std::vector<CString> vMacAdd;
Devinfo.GetMacAdd(&vMacAdd);
strId = vMacAdd[0];
const int nLen = strId.GetLength();
for (int i = nLen - 1; i >= 0; i--)
{
if ('-' == strId[i])
{
strId.Delete(i, 1);
}
}
}
CAES Aes;
strId = Aes.Cipher(strId);
if (strId.GetLength() > 32)
{
const CString strLeft = strId.Left(16);
const CString strRight = strId.Right(16);
strId = strLeft + strRight;
}
return strId;
}
void CRegister::_ReadKeyWord(void)
{
CRegKey regKey;
CString strKeyName;
CAES Aes;
const CString strPath = Aes.Cipher(_T("Register"));
strKeyName.Format(_T("Software\\%s\\%s"), AfxGetAppName(), strPath);
BOOL bOpenSuccess = ERROR_SUCCESS == regKey.Open(HKEY_LOCAL_MACHINE, strKeyName);
if (bOpenSuccess)
{
DWORD dwChars = 1024;
const CString strRegKeyHex = Aes.Cipher(_T("SerialNumber"));
if (ERROR_SUCCESS == regKey.QueryStringValue(strRegKeyHex, m_strPsd.GetBufferSetLength(MAX_PATH + 1), &dwChars))
{
m_strPsd.ReleaseBuffer();
}
else
{
m_strPsd = strRegKeyHex;
}
regKey.Close();
}
}
void CRegister::EnterPressedEditRegwndpsd(LPCTSTR strValue)
{
// TODO: 在此处添加消息处理程序代码
OnOK();
}
| [
"snrytnh@126.com"
] | snrytnh@126.com |
8c905ce1107d2b708c4550629eeaab95ccfbd5d3 | 27b1be9ece5642f4c2d5b3930745508c2069888a | /src/libtsduck/base/windows/tsWebRequestGuts.cpp | 24fa77efe5b7f76dca5c98370ab0a6a4198f2d06 | [
"BSD-2-Clause"
] | permissive | vacing/tsduck | 26dbe9e0a39e6c15e0364d59433eec9466fef18b | ac01b88a8052419bfce9715886d597419fc5fef6 | refs/heads/master | 2020-11-30T00:57:35.128901 | 2019-12-20T22:34:25 | 2019-12-20T22:34:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,380 | cpp | //----------------------------------------------------------------------------
//
// TSDuck - The MPEG Transport Stream Toolkit
// Copyright (c) 2005-2019, Thierry Lelegard
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
// THE POSSIBILITY OF SUCH DAMAGE.
//
//----------------------------------------------------------------------------
//
// Perform a simple Web request - Windows specific parts.
//
// IMPLEMENTATION ISSUE:
// If we allow redirection, we need to get notified of the final redirected
// URL. To do this, we must use InternetSetStatusCallback and specify a
// callback which will be notified of various events, including redirection.
// This works fine with Win64. However, this crashes on Win32. To be honest,
// the code does not even compile in Win32 even though the profile of the
// callback is directly copied/pasted from INTERNET_STATUS_CALLBACK in
// wininet.h (and it compiles in Win64). Using a type cast, the compilation
// works but the execution crashes. The reason for this is a complete
// mystery. As a workaround, we disable the automatic redirection and
// we handle the redirection manually. Thus, we do not need a callback.
//
//----------------------------------------------------------------------------
#include "tsWebRequest.h"
#include "tsSysUtils.h"
#include "tsWinUtils.h"
#include <WinInet.h>
TSDUCK_SOURCE;
//----------------------------------------------------------------------------
// System-specific parts are stored in a private structure.
//----------------------------------------------------------------------------
class ts::WebRequest::SystemGuts
{
TS_NOBUILD_NOCOPY(SystemGuts);
public:
// Constructor with a reference to parent WebRequest.
SystemGuts(WebRequest& request);
// Destructor.
~SystemGuts();
// Initialize, clear, start Web transfer.
bool init();
void clear();
bool start();
// Report an error message.
void error(const UChar* message, ::DWORD code = ::GetLastError());
private:
WebRequest& _request; // Parent request.
::HINTERNET _inet; // Handle to all Internet operations.
::HINTERNET _url; // Handle to URL operations.
int _redirectCount; // Current number of redirections.
UString _previousURL; // Previous URL, before getting a redirection.
// Transmit response headers to the WebRequest.
void transmitResponseHeaders();
};
//----------------------------------------------------------------------------
// System-specific constructor and destructor.
//----------------------------------------------------------------------------
ts::WebRequest::SystemGuts::SystemGuts(WebRequest& request) :
_request(request),
_inet(0),
_url(0),
_redirectCount(0)
{
}
ts::WebRequest::SystemGuts::~SystemGuts()
{
clear();
}
void ts::WebRequest::allocateGuts()
{
_guts = new SystemGuts(*this);
}
void ts::WebRequest::deleteGuts()
{
delete _guts;
}
//----------------------------------------------------------------------------
// Download operations from the WebRequest class.
//----------------------------------------------------------------------------
bool ts::WebRequest::downloadInitialize()
{
return _guts->init();
}
void ts::WebRequest::downloadClose()
{
_guts->clear();
}
bool ts::WebRequest::download()
{
return _guts->start();
}
//----------------------------------------------------------------------------
// Report an error message.
//----------------------------------------------------------------------------
void ts::WebRequest::SystemGuts::error(const UChar* message, ::DWORD code)
{
if (code == ERROR_SUCCESS) {
_request._report.error(u"Web error: %s", {message});
}
else {
_request._report.error(u"Web error: %s (%s)", {message, WinErrorMessage(code, u"Wininet.dll", INTERNET_ERROR_BASE, INTERNET_ERROR_LAST)});
}
}
//----------------------------------------------------------------------------
// Initialize Web transfer.
//----------------------------------------------------------------------------
bool ts::WebRequest::SystemGuts::init()
{
// Make sure we start from a clean state.
clear();
// Prepare proxy name.
const bool useProxy = !_request.proxyHost().empty();
::DWORD access = INTERNET_OPEN_TYPE_PRECONFIG;
const ::WCHAR* proxy = 0;
UString proxyName(_request.proxyHost());
if (useProxy) {
access = INTERNET_OPEN_TYPE_PROXY;
if (_request.proxyPort() != 0) {
proxyName += UString::Format(u":%d", {_request.proxyPort()});
}
proxy = proxyName.wc_str();
}
// Open the main Internet handle.
_inet = ::InternetOpenW(_request._userAgent.wc_str(), access, proxy, 0, 0);
if (_inet == 0) {
error(u"error accessing Internet handle");
return false;
}
// Specify the proxy authentication, if provided.
if (useProxy) {
UString user(_request.proxyUser());
UString pass(_request.proxyPassword());
if (!user.empty() && !::InternetSetOptionW(_inet, INTERNET_OPTION_PROXY_USERNAME, &user[0], ::DWORD(user.size()))) {
error(u"error setting proxy username");
clear();
return false;
}
if (!pass.empty() && !::InternetSetOptionW(_inet, INTERNET_OPTION_PROXY_PASSWORD, &pass[0], ::DWORD(pass.size()))) {
error(u"error setting proxy password");
clear();
return false;
}
}
// Specify the various timeouts.
if (_request._connectionTimeout > 0) {
::DWORD timeout = ::DWORD(_request._connectionTimeout);
if (!::InternetSetOptionW(_inet, INTERNET_OPTION_CONNECT_TIMEOUT, &timeout, ::DWORD(sizeof(timeout)))) {
error(u"error setting connection timeout");
clear();
return false;
}
}
if (_request._receiveTimeout > 0) {
::DWORD timeout = ::DWORD(_request._receiveTimeout);
if (!::InternetSetOptionW(_inet, INTERNET_OPTION_RECEIVE_TIMEOUT, &timeout, ::DWORD(sizeof(timeout))) ||
!::InternetSetOptionW(_inet, INTERNET_OPTION_DATA_RECEIVE_TIMEOUT, &timeout, ::DWORD(sizeof(timeout))))
{
error(u"error setting receive timeout");
clear();
return false;
}
}
// URL connection flags.
const ::DWORD urlFlags =
INTERNET_FLAG_KEEP_CONNECTION | // Use keep-alive.
INTERNET_FLAG_NO_UI | // Disable popup windows.
(_request._useCookies ? 0 : INTERNET_FLAG_NO_COOKIES) | // Don't store cookies, don't send stored cookies.
INTERNET_FLAG_PASSIVE | // Use passive mode with FTP (less NAT issues).
INTERNET_FLAG_NO_AUTO_REDIRECT | // Disable redirections (see comment on top of file).
INTERNET_FLAG_NO_CACHE_WRITE; // Don't save downloaded data to local disk cache.
// Build the list of request headers.
::WCHAR* headerAddress = 0;
::DWORD headerLength = 0;
UString headers;
if (!_request._requestHeaders.empty()) {
for (HeadersMap::const_iterator it = _request._requestHeaders.begin(); it != _request._requestHeaders.end(); ++it) {
if (!headers.empty()) {
headers.append(u"\r\n");
}
headers.append(it->first);
headers.append(u": ");
headers.append(it->second);
}
headerAddress = headers.wc_str();
headerLength = ::DWORD(headers.size());
}
// Loop on redirections.
for (;;) {
// Keep track of current URL to fetch.
_previousURL = _request._finalURL;
// Now open the URL.
_url = ::InternetOpenUrlW(_inet, _previousURL.wc_str(), headerAddress, headerLength, urlFlags, 0);
if (_url == 0) {
error(u"error opening URL");
clear();
return false;
}
// Send the response headers to the WebRequest object.
// Do not expect any response header from file: URL.
if (_previousURL.startWith(u"file:")) {
// Pass empty headers to the WebRequest.
_request.processReponseHeaders(u"");
}
else {
// Get actual response headers and pass them to the WebRequest.
transmitResponseHeaders();
}
// If redirections are not allowed or no redirection occured, stop now.
// Redirection codes are 3xx (eg. "HTTP/1.1 301 Moved Permanently").
if (!_request._autoRedirect || _request._httpStatus / 100 != 3 || _request._finalURL == _previousURL) {
break;
}
// Close this URL, we need to redirect to _finalURL.
::InternetCloseHandle(_url);
_url = 0;
// Limit the number of redirections to avoid "looping sites".
if (++_redirectCount > 16) {
error(u"too many HTTP redirections");
clear();
return false;
}
};
return true;
}
//----------------------------------------------------------------------------
// Abort / clear the Web transfer.
//----------------------------------------------------------------------------
void ts::WebRequest::SystemGuts::clear()
{
// Close Internet handles.
if (_url != 0 && !::InternetCloseHandle(_url)) {
error(u"error closing URL handle");
}
if (_inet != 0 && !::InternetCloseHandle(_inet)) {
error(u"error closing main Internet handle");
}
_url = _inet = 0;
_redirectCount = 0;
}
//----------------------------------------------------------------------------
// Perform the Web transfer.
// The URL is open, the response headers have been received, now receive data.
//----------------------------------------------------------------------------
bool ts::WebRequest::SystemGuts::start()
{
bool success = true;
std::array<uint8_t, 1024> data;
while (success) {
::DWORD gotSize = 0;
if (!::InternetReadFile(_url, data.data(), ::DWORD(data.size()), &gotSize)) {
error(u"download error");
success = false;
}
else if (gotSize == 0) {
// Successfully reading zero bytes means end of file.
break;
}
else {
// Get real data, transmit them to the WebRequest object.
success = _request.copyData(data.data(), size_t(gotSize));
}
}
return success;
}
//----------------------------------------------------------------------------
// Transmit response headers to the WebRequest.
//----------------------------------------------------------------------------
void ts::WebRequest::SystemGuts::transmitResponseHeaders()
{
// Query the response headers from the URL handle.
// First try with an arbitrary buffer size.
UString headers(1024, CHAR_NULL);
::DWORD headersSize = ::DWORD(headers.size());
::DWORD index = 0;
if (!::HttpQueryInfoW(_url, HTTP_QUERY_RAW_HEADERS_CRLF, &headers[0], &headersSize, &index)) {
// Process actual error.
if (::GetLastError() != ERROR_INSUFFICIENT_BUFFER) {
error(u"error getting HTTP response headers");
return;
}
// The buffer was too small, reallocate one.
headers.resize(size_t(headersSize));
headersSize = ::DWORD(headers.size());
index = 0;
if (!::HttpQueryInfoW(_url, HTTP_QUERY_RAW_HEADERS_CRLF, &headers[0], &headersSize, &index)) {
error(u"error getting HTTP response headers");
return;
}
}
// Adjust actual string length.
headers.resize(std::min(std::max<::DWORD>(0, headersSize), ::DWORD(headers.size() - 1)));
// Pass the headers to the WebRequest.
_request.processReponseHeaders(headers);
}
//----------------------------------------------------------------------------
// Get the version of the underlying HTTP library.
//----------------------------------------------------------------------------
ts::UString ts::WebRequest::GetLibraryVersion()
{
// Do not know which version...
return u"WinInet";
}
| [
"thierry@lelegard.fr"
] | thierry@lelegard.fr |
188ef698b5eb10046894eaad1179fcee7d8a0d04 | b2403cabbb2ccf30d3ca71135f17fb65f1a5f199 | /Library/Il2cppBuildCache/iOS/il2cppOutput/System.Core_Attr.cpp | 8d483a4e3ed97068bf84ff699cf8b05cd6e48ff3 | [] | no_license | Shreyash045/AR-Home-Decor | acf0748b6d0f2b588bfae6ee16a5715f7105022b | d48376d9cb5c94c890e14b418d9912c97a973d44 | refs/heads/main | 2023-09-02T13:26:23.446579 | 2021-11-20T14:19:40 | 2021-11-20T14:19:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 82,036 | cpp | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <limits>
#include <stdint.h>
// System.Char[]
struct CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34;
// System.Type[]
struct TypeU5BU5D_t85B10489E46F06CEC7C4B1CCBD0E01FAB6649755;
// System.Reflection.AssemblyCompanyAttribute
struct AssemblyCompanyAttribute_t642AAB097D7DEAAB623BEBE4664327E9B01D1DE4;
// System.Reflection.AssemblyCopyrightAttribute
struct AssemblyCopyrightAttribute_tA6A09319EF50B48D962810032000DEE7B12904EC;
// System.Reflection.AssemblyDefaultAliasAttribute
struct AssemblyDefaultAliasAttribute_tBED24B7B2D875CB2BD712ABC4099024C2505B7AA;
// System.Reflection.AssemblyDelaySignAttribute
struct AssemblyDelaySignAttribute_tB66445498441723DC06E545FAA1CF0F128A1FE38;
// System.Reflection.AssemblyDescriptionAttribute
struct AssemblyDescriptionAttribute_tF4460CCB289F6E2F71841792BBC7E6907DF612B3;
// System.Reflection.AssemblyFileVersionAttribute
struct AssemblyFileVersionAttribute_tCC1036D0566155DC5688D9230EF3C07D82A1896F;
// System.Reflection.AssemblyInformationalVersionAttribute
struct AssemblyInformationalVersionAttribute_t962229DBE84C4A66FB0B542E9AEBC510F55950D0;
// System.Reflection.AssemblyKeyFileAttribute
struct AssemblyKeyFileAttribute_tEF26145AA8A5F35C218FE543113825F133CC6253;
// System.Reflection.AssemblyProductAttribute
struct AssemblyProductAttribute_t6BB0E0F76C752E14A4C26B4D1E230019068601CA;
// System.Reflection.AssemblyTitleAttribute
struct AssemblyTitleAttribute_tABB894D0792C7F307694CC796C8AE5D6A20382E7;
// System.Reflection.Binder
struct Binder_t2BEE27FD84737D1E79BC47FD67F6D3DD2F2DDA30;
// System.CLSCompliantAttribute
struct CLSCompliantAttribute_tA28EF6D4ADBD3C5C429DE9A70DD1E927C8906249;
// System.Runtime.InteropServices.ComVisibleAttribute
struct ComVisibleAttribute_tCE3DF5E341F3ECE4C81FE85C15B3D782AB302A2A;
// System.Runtime.CompilerServices.CompilationRelaxationsAttribute
struct CompilationRelaxationsAttribute_t661FDDC06629BDA607A42BD660944F039FE03AFF;
// System.Runtime.CompilerServices.CompilerGeneratedAttribute
struct CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C;
// System.Diagnostics.DebuggableAttribute
struct DebuggableAttribute_tA8054EBD0FC7511695D494B690B5771658E3191B;
// System.Diagnostics.DebuggerDisplayAttribute
struct DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F;
// System.Diagnostics.DebuggerHiddenAttribute
struct DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88;
// System.Diagnostics.DebuggerTypeProxyAttribute
struct DebuggerTypeProxyAttribute_t20C961369DAE0E16D87B752F1C04F16FC3B90014;
// System.Runtime.CompilerServices.ExtensionAttribute
struct ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC;
// System.Runtime.CompilerServices.IteratorStateMachineAttribute
struct IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830;
// System.Reflection.MemberFilter
struct MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81;
// System.Resources.NeutralResourcesLanguageAttribute
struct NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2;
// System.Runtime.CompilerServices.RuntimeCompatibilityAttribute
struct RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80;
// System.Resources.SatelliteContractVersionAttribute
struct SatelliteContractVersionAttribute_tA77BDC45FEEFE11823E95476FC8AE60B007906D2;
// System.String
struct String_t;
// System.Type
struct Type_t;
// System.Void
struct Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5;
IL2CPP_EXTERN_C const RuntimeType* ICollectionDebugView_1_t91F2BD45904FD84600887E6D4852BF7B6472F1D8_0_0_0_var;
IL2CPP_EXTERN_C const RuntimeType* U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_0_0_0_var;
IL2CPP_EXTERN_C const RuntimeType* U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_0_0_0_var;
IL2CPP_EXTERN_C const RuntimeType* U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_0_0_0_var;
IL2CPP_EXTERN_C_BEGIN
IL2CPP_EXTERN_C_END
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Object
// System.Attribute
struct Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71 : public RuntimeObject
{
public:
public:
};
// System.Reflection.MemberInfo
struct MemberInfo_t : public RuntimeObject
{
public:
public:
};
// System.String
struct String_t : public RuntimeObject
{
public:
// System.Int32 System.String::m_stringLength
int32_t ___m_stringLength_0;
// System.Char System.String::m_firstChar
Il2CppChar ___m_firstChar_1;
public:
inline static int32_t get_offset_of_m_stringLength_0() { return static_cast<int32_t>(offsetof(String_t, ___m_stringLength_0)); }
inline int32_t get_m_stringLength_0() const { return ___m_stringLength_0; }
inline int32_t* get_address_of_m_stringLength_0() { return &___m_stringLength_0; }
inline void set_m_stringLength_0(int32_t value)
{
___m_stringLength_0 = value;
}
inline static int32_t get_offset_of_m_firstChar_1() { return static_cast<int32_t>(offsetof(String_t, ___m_firstChar_1)); }
inline Il2CppChar get_m_firstChar_1() const { return ___m_firstChar_1; }
inline Il2CppChar* get_address_of_m_firstChar_1() { return &___m_firstChar_1; }
inline void set_m_firstChar_1(Il2CppChar value)
{
___m_firstChar_1 = value;
}
};
struct String_t_StaticFields
{
public:
// System.String System.String::Empty
String_t* ___Empty_5;
public:
inline static int32_t get_offset_of_Empty_5() { return static_cast<int32_t>(offsetof(String_t_StaticFields, ___Empty_5)); }
inline String_t* get_Empty_5() const { return ___Empty_5; }
inline String_t** get_address_of_Empty_5() { return &___Empty_5; }
inline void set_Empty_5(String_t* value)
{
___Empty_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___Empty_5), (void*)value);
}
};
// System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52 : public RuntimeObject
{
public:
public:
};
// Native definition for P/Invoke marshalling of System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52_marshaled_pinvoke
{
};
// Native definition for COM marshalling of System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52_marshaled_com
{
};
// System.Reflection.AssemblyCompanyAttribute
struct AssemblyCompanyAttribute_t642AAB097D7DEAAB623BEBE4664327E9B01D1DE4 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyCompanyAttribute::m_company
String_t* ___m_company_0;
public:
inline static int32_t get_offset_of_m_company_0() { return static_cast<int32_t>(offsetof(AssemblyCompanyAttribute_t642AAB097D7DEAAB623BEBE4664327E9B01D1DE4, ___m_company_0)); }
inline String_t* get_m_company_0() const { return ___m_company_0; }
inline String_t** get_address_of_m_company_0() { return &___m_company_0; }
inline void set_m_company_0(String_t* value)
{
___m_company_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_company_0), (void*)value);
}
};
// System.Reflection.AssemblyCopyrightAttribute
struct AssemblyCopyrightAttribute_tA6A09319EF50B48D962810032000DEE7B12904EC : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyCopyrightAttribute::m_copyright
String_t* ___m_copyright_0;
public:
inline static int32_t get_offset_of_m_copyright_0() { return static_cast<int32_t>(offsetof(AssemblyCopyrightAttribute_tA6A09319EF50B48D962810032000DEE7B12904EC, ___m_copyright_0)); }
inline String_t* get_m_copyright_0() const { return ___m_copyright_0; }
inline String_t** get_address_of_m_copyright_0() { return &___m_copyright_0; }
inline void set_m_copyright_0(String_t* value)
{
___m_copyright_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_copyright_0), (void*)value);
}
};
// System.Reflection.AssemblyDefaultAliasAttribute
struct AssemblyDefaultAliasAttribute_tBED24B7B2D875CB2BD712ABC4099024C2505B7AA : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyDefaultAliasAttribute::m_defaultAlias
String_t* ___m_defaultAlias_0;
public:
inline static int32_t get_offset_of_m_defaultAlias_0() { return static_cast<int32_t>(offsetof(AssemblyDefaultAliasAttribute_tBED24B7B2D875CB2BD712ABC4099024C2505B7AA, ___m_defaultAlias_0)); }
inline String_t* get_m_defaultAlias_0() const { return ___m_defaultAlias_0; }
inline String_t** get_address_of_m_defaultAlias_0() { return &___m_defaultAlias_0; }
inline void set_m_defaultAlias_0(String_t* value)
{
___m_defaultAlias_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_defaultAlias_0), (void*)value);
}
};
// System.Reflection.AssemblyDelaySignAttribute
struct AssemblyDelaySignAttribute_tB66445498441723DC06E545FAA1CF0F128A1FE38 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Boolean System.Reflection.AssemblyDelaySignAttribute::m_delaySign
bool ___m_delaySign_0;
public:
inline static int32_t get_offset_of_m_delaySign_0() { return static_cast<int32_t>(offsetof(AssemblyDelaySignAttribute_tB66445498441723DC06E545FAA1CF0F128A1FE38, ___m_delaySign_0)); }
inline bool get_m_delaySign_0() const { return ___m_delaySign_0; }
inline bool* get_address_of_m_delaySign_0() { return &___m_delaySign_0; }
inline void set_m_delaySign_0(bool value)
{
___m_delaySign_0 = value;
}
};
// System.Reflection.AssemblyDescriptionAttribute
struct AssemblyDescriptionAttribute_tF4460CCB289F6E2F71841792BBC7E6907DF612B3 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyDescriptionAttribute::m_description
String_t* ___m_description_0;
public:
inline static int32_t get_offset_of_m_description_0() { return static_cast<int32_t>(offsetof(AssemblyDescriptionAttribute_tF4460CCB289F6E2F71841792BBC7E6907DF612B3, ___m_description_0)); }
inline String_t* get_m_description_0() const { return ___m_description_0; }
inline String_t** get_address_of_m_description_0() { return &___m_description_0; }
inline void set_m_description_0(String_t* value)
{
___m_description_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_description_0), (void*)value);
}
};
// System.Reflection.AssemblyFileVersionAttribute
struct AssemblyFileVersionAttribute_tCC1036D0566155DC5688D9230EF3C07D82A1896F : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyFileVersionAttribute::_version
String_t* ____version_0;
public:
inline static int32_t get_offset_of__version_0() { return static_cast<int32_t>(offsetof(AssemblyFileVersionAttribute_tCC1036D0566155DC5688D9230EF3C07D82A1896F, ____version_0)); }
inline String_t* get__version_0() const { return ____version_0; }
inline String_t** get_address_of__version_0() { return &____version_0; }
inline void set__version_0(String_t* value)
{
____version_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&____version_0), (void*)value);
}
};
// System.Reflection.AssemblyInformationalVersionAttribute
struct AssemblyInformationalVersionAttribute_t962229DBE84C4A66FB0B542E9AEBC510F55950D0 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyInformationalVersionAttribute::m_informationalVersion
String_t* ___m_informationalVersion_0;
public:
inline static int32_t get_offset_of_m_informationalVersion_0() { return static_cast<int32_t>(offsetof(AssemblyInformationalVersionAttribute_t962229DBE84C4A66FB0B542E9AEBC510F55950D0, ___m_informationalVersion_0)); }
inline String_t* get_m_informationalVersion_0() const { return ___m_informationalVersion_0; }
inline String_t** get_address_of_m_informationalVersion_0() { return &___m_informationalVersion_0; }
inline void set_m_informationalVersion_0(String_t* value)
{
___m_informationalVersion_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_informationalVersion_0), (void*)value);
}
};
// System.Reflection.AssemblyKeyFileAttribute
struct AssemblyKeyFileAttribute_tEF26145AA8A5F35C218FE543113825F133CC6253 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyKeyFileAttribute::m_keyFile
String_t* ___m_keyFile_0;
public:
inline static int32_t get_offset_of_m_keyFile_0() { return static_cast<int32_t>(offsetof(AssemblyKeyFileAttribute_tEF26145AA8A5F35C218FE543113825F133CC6253, ___m_keyFile_0)); }
inline String_t* get_m_keyFile_0() const { return ___m_keyFile_0; }
inline String_t** get_address_of_m_keyFile_0() { return &___m_keyFile_0; }
inline void set_m_keyFile_0(String_t* value)
{
___m_keyFile_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_keyFile_0), (void*)value);
}
};
// System.Reflection.AssemblyProductAttribute
struct AssemblyProductAttribute_t6BB0E0F76C752E14A4C26B4D1E230019068601CA : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyProductAttribute::m_product
String_t* ___m_product_0;
public:
inline static int32_t get_offset_of_m_product_0() { return static_cast<int32_t>(offsetof(AssemblyProductAttribute_t6BB0E0F76C752E14A4C26B4D1E230019068601CA, ___m_product_0)); }
inline String_t* get_m_product_0() const { return ___m_product_0; }
inline String_t** get_address_of_m_product_0() { return &___m_product_0; }
inline void set_m_product_0(String_t* value)
{
___m_product_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_product_0), (void*)value);
}
};
// System.Reflection.AssemblyTitleAttribute
struct AssemblyTitleAttribute_tABB894D0792C7F307694CC796C8AE5D6A20382E7 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Reflection.AssemblyTitleAttribute::m_title
String_t* ___m_title_0;
public:
inline static int32_t get_offset_of_m_title_0() { return static_cast<int32_t>(offsetof(AssemblyTitleAttribute_tABB894D0792C7F307694CC796C8AE5D6A20382E7, ___m_title_0)); }
inline String_t* get_m_title_0() const { return ___m_title_0; }
inline String_t** get_address_of_m_title_0() { return &___m_title_0; }
inline void set_m_title_0(String_t* value)
{
___m_title_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_title_0), (void*)value);
}
};
// System.Boolean
struct Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37
{
public:
// System.Boolean System.Boolean::m_value
bool ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37, ___m_value_0)); }
inline bool get_m_value_0() const { return ___m_value_0; }
inline bool* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(bool value)
{
___m_value_0 = value;
}
};
struct Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields
{
public:
// System.String System.Boolean::TrueString
String_t* ___TrueString_5;
// System.String System.Boolean::FalseString
String_t* ___FalseString_6;
public:
inline static int32_t get_offset_of_TrueString_5() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields, ___TrueString_5)); }
inline String_t* get_TrueString_5() const { return ___TrueString_5; }
inline String_t** get_address_of_TrueString_5() { return &___TrueString_5; }
inline void set_TrueString_5(String_t* value)
{
___TrueString_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___TrueString_5), (void*)value);
}
inline static int32_t get_offset_of_FalseString_6() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields, ___FalseString_6)); }
inline String_t* get_FalseString_6() const { return ___FalseString_6; }
inline String_t** get_address_of_FalseString_6() { return &___FalseString_6; }
inline void set_FalseString_6(String_t* value)
{
___FalseString_6 = value;
Il2CppCodeGenWriteBarrier((void**)(&___FalseString_6), (void*)value);
}
};
// System.CLSCompliantAttribute
struct CLSCompliantAttribute_tA28EF6D4ADBD3C5C429DE9A70DD1E927C8906249 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Boolean System.CLSCompliantAttribute::m_compliant
bool ___m_compliant_0;
public:
inline static int32_t get_offset_of_m_compliant_0() { return static_cast<int32_t>(offsetof(CLSCompliantAttribute_tA28EF6D4ADBD3C5C429DE9A70DD1E927C8906249, ___m_compliant_0)); }
inline bool get_m_compliant_0() const { return ___m_compliant_0; }
inline bool* get_address_of_m_compliant_0() { return &___m_compliant_0; }
inline void set_m_compliant_0(bool value)
{
___m_compliant_0 = value;
}
};
// System.Runtime.InteropServices.ComVisibleAttribute
struct ComVisibleAttribute_tCE3DF5E341F3ECE4C81FE85C15B3D782AB302A2A : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Boolean System.Runtime.InteropServices.ComVisibleAttribute::_val
bool ____val_0;
public:
inline static int32_t get_offset_of__val_0() { return static_cast<int32_t>(offsetof(ComVisibleAttribute_tCE3DF5E341F3ECE4C81FE85C15B3D782AB302A2A, ____val_0)); }
inline bool get__val_0() const { return ____val_0; }
inline bool* get_address_of__val_0() { return &____val_0; }
inline void set__val_0(bool value)
{
____val_0 = value;
}
};
// System.Runtime.CompilerServices.CompilationRelaxationsAttribute
struct CompilationRelaxationsAttribute_t661FDDC06629BDA607A42BD660944F039FE03AFF : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Int32 System.Runtime.CompilerServices.CompilationRelaxationsAttribute::m_relaxations
int32_t ___m_relaxations_0;
public:
inline static int32_t get_offset_of_m_relaxations_0() { return static_cast<int32_t>(offsetof(CompilationRelaxationsAttribute_t661FDDC06629BDA607A42BD660944F039FE03AFF, ___m_relaxations_0)); }
inline int32_t get_m_relaxations_0() const { return ___m_relaxations_0; }
inline int32_t* get_address_of_m_relaxations_0() { return &___m_relaxations_0; }
inline void set_m_relaxations_0(int32_t value)
{
___m_relaxations_0 = value;
}
};
// System.Runtime.CompilerServices.CompilerGeneratedAttribute
struct CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
public:
};
// System.Diagnostics.DebuggerDisplayAttribute
struct DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Diagnostics.DebuggerDisplayAttribute::name
String_t* ___name_0;
// System.String System.Diagnostics.DebuggerDisplayAttribute::value
String_t* ___value_1;
// System.String System.Diagnostics.DebuggerDisplayAttribute::type
String_t* ___type_2;
public:
inline static int32_t get_offset_of_name_0() { return static_cast<int32_t>(offsetof(DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F, ___name_0)); }
inline String_t* get_name_0() const { return ___name_0; }
inline String_t** get_address_of_name_0() { return &___name_0; }
inline void set_name_0(String_t* value)
{
___name_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___name_0), (void*)value);
}
inline static int32_t get_offset_of_value_1() { return static_cast<int32_t>(offsetof(DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F, ___value_1)); }
inline String_t* get_value_1() const { return ___value_1; }
inline String_t** get_address_of_value_1() { return &___value_1; }
inline void set_value_1(String_t* value)
{
___value_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___value_1), (void*)value);
}
inline static int32_t get_offset_of_type_2() { return static_cast<int32_t>(offsetof(DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F, ___type_2)); }
inline String_t* get_type_2() const { return ___type_2; }
inline String_t** get_address_of_type_2() { return &___type_2; }
inline void set_type_2(String_t* value)
{
___type_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___type_2), (void*)value);
}
};
// System.Diagnostics.DebuggerHiddenAttribute
struct DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
public:
};
// System.Diagnostics.DebuggerTypeProxyAttribute
struct DebuggerTypeProxyAttribute_t20C961369DAE0E16D87B752F1C04F16FC3B90014 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Diagnostics.DebuggerTypeProxyAttribute::typeName
String_t* ___typeName_0;
public:
inline static int32_t get_offset_of_typeName_0() { return static_cast<int32_t>(offsetof(DebuggerTypeProxyAttribute_t20C961369DAE0E16D87B752F1C04F16FC3B90014, ___typeName_0)); }
inline String_t* get_typeName_0() const { return ___typeName_0; }
inline String_t** get_address_of_typeName_0() { return &___typeName_0; }
inline void set_typeName_0(String_t* value)
{
___typeName_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___typeName_0), (void*)value);
}
};
// System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA : public ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52
{
public:
public:
};
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_StaticFields
{
public:
// System.Char[] System.Enum::enumSeperatorCharArray
CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* ___enumSeperatorCharArray_0;
public:
inline static int32_t get_offset_of_enumSeperatorCharArray_0() { return static_cast<int32_t>(offsetof(Enum_t23B90B40F60E677A8025267341651C94AE079CDA_StaticFields, ___enumSeperatorCharArray_0)); }
inline CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* get_enumSeperatorCharArray_0() const { return ___enumSeperatorCharArray_0; }
inline CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34** get_address_of_enumSeperatorCharArray_0() { return &___enumSeperatorCharArray_0; }
inline void set_enumSeperatorCharArray_0(CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* value)
{
___enumSeperatorCharArray_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___enumSeperatorCharArray_0), (void*)value);
}
};
// Native definition for P/Invoke marshalling of System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_marshaled_pinvoke
{
};
// Native definition for COM marshalling of System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_marshaled_com
{
};
// System.Runtime.CompilerServices.ExtensionAttribute
struct ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
public:
};
// System.IntPtr
struct IntPtr_t
{
public:
// System.Void* System.IntPtr::m_value
void* ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(IntPtr_t, ___m_value_0)); }
inline void* get_m_value_0() const { return ___m_value_0; }
inline void** get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(void* value)
{
___m_value_0 = value;
}
};
struct IntPtr_t_StaticFields
{
public:
// System.IntPtr System.IntPtr::Zero
intptr_t ___Zero_1;
public:
inline static int32_t get_offset_of_Zero_1() { return static_cast<int32_t>(offsetof(IntPtr_t_StaticFields, ___Zero_1)); }
inline intptr_t get_Zero_1() const { return ___Zero_1; }
inline intptr_t* get_address_of_Zero_1() { return &___Zero_1; }
inline void set_Zero_1(intptr_t value)
{
___Zero_1 = value;
}
};
// System.Runtime.CompilerServices.RuntimeCompatibilityAttribute
struct RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Boolean System.Runtime.CompilerServices.RuntimeCompatibilityAttribute::m_wrapNonExceptionThrows
bool ___m_wrapNonExceptionThrows_0;
public:
inline static int32_t get_offset_of_m_wrapNonExceptionThrows_0() { return static_cast<int32_t>(offsetof(RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80, ___m_wrapNonExceptionThrows_0)); }
inline bool get_m_wrapNonExceptionThrows_0() const { return ___m_wrapNonExceptionThrows_0; }
inline bool* get_address_of_m_wrapNonExceptionThrows_0() { return &___m_wrapNonExceptionThrows_0; }
inline void set_m_wrapNonExceptionThrows_0(bool value)
{
___m_wrapNonExceptionThrows_0 = value;
}
};
// System.Resources.SatelliteContractVersionAttribute
struct SatelliteContractVersionAttribute_tA77BDC45FEEFE11823E95476FC8AE60B007906D2 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Resources.SatelliteContractVersionAttribute::_version
String_t* ____version_0;
public:
inline static int32_t get_offset_of__version_0() { return static_cast<int32_t>(offsetof(SatelliteContractVersionAttribute_tA77BDC45FEEFE11823E95476FC8AE60B007906D2, ____version_0)); }
inline String_t* get__version_0() const { return ____version_0; }
inline String_t** get_address_of__version_0() { return &____version_0; }
inline void set__version_0(String_t* value)
{
____version_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&____version_0), (void*)value);
}
};
// System.Runtime.CompilerServices.StateMachineAttribute
struct StateMachineAttribute_tA6E77C77F821508E405473BA1C4C08A69FDA0AC3 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Type System.Runtime.CompilerServices.StateMachineAttribute::<StateMachineType>k__BackingField
Type_t * ___U3CStateMachineTypeU3Ek__BackingField_0;
public:
inline static int32_t get_offset_of_U3CStateMachineTypeU3Ek__BackingField_0() { return static_cast<int32_t>(offsetof(StateMachineAttribute_tA6E77C77F821508E405473BA1C4C08A69FDA0AC3, ___U3CStateMachineTypeU3Ek__BackingField_0)); }
inline Type_t * get_U3CStateMachineTypeU3Ek__BackingField_0() const { return ___U3CStateMachineTypeU3Ek__BackingField_0; }
inline Type_t ** get_address_of_U3CStateMachineTypeU3Ek__BackingField_0() { return &___U3CStateMachineTypeU3Ek__BackingField_0; }
inline void set_U3CStateMachineTypeU3Ek__BackingField_0(Type_t * value)
{
___U3CStateMachineTypeU3Ek__BackingField_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___U3CStateMachineTypeU3Ek__BackingField_0), (void*)value);
}
};
// System.Void
struct Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5
{
public:
union
{
struct
{
};
uint8_t Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5__padding[1];
};
public:
};
// System.Reflection.BindingFlags
struct BindingFlags_tAAAB07D9AC588F0D55D844E51D7035E96DF94733
{
public:
// System.Int32 System.Reflection.BindingFlags::value__
int32_t ___value___2;
public:
inline static int32_t get_offset_of_value___2() { return static_cast<int32_t>(offsetof(BindingFlags_tAAAB07D9AC588F0D55D844E51D7035E96DF94733, ___value___2)); }
inline int32_t get_value___2() const { return ___value___2; }
inline int32_t* get_address_of_value___2() { return &___value___2; }
inline void set_value___2(int32_t value)
{
___value___2 = value;
}
};
// System.Runtime.CompilerServices.IteratorStateMachineAttribute
struct IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 : public StateMachineAttribute_tA6E77C77F821508E405473BA1C4C08A69FDA0AC3
{
public:
public:
};
// System.RuntimeTypeHandle
struct RuntimeTypeHandle_tC33965ADA3E041E0C94AF05E5CB527B56482CEF9
{
public:
// System.IntPtr System.RuntimeTypeHandle::value
intptr_t ___value_0;
public:
inline static int32_t get_offset_of_value_0() { return static_cast<int32_t>(offsetof(RuntimeTypeHandle_tC33965ADA3E041E0C94AF05E5CB527B56482CEF9, ___value_0)); }
inline intptr_t get_value_0() const { return ___value_0; }
inline intptr_t* get_address_of_value_0() { return &___value_0; }
inline void set_value_0(intptr_t value)
{
___value_0 = value;
}
};
// System.Resources.UltimateResourceFallbackLocation
struct UltimateResourceFallbackLocation_tA4EBEA627CD0C386314EBB60D7A4225C435D0F0B
{
public:
// System.Int32 System.Resources.UltimateResourceFallbackLocation::value__
int32_t ___value___2;
public:
inline static int32_t get_offset_of_value___2() { return static_cast<int32_t>(offsetof(UltimateResourceFallbackLocation_tA4EBEA627CD0C386314EBB60D7A4225C435D0F0B, ___value___2)); }
inline int32_t get_value___2() const { return ___value___2; }
inline int32_t* get_address_of_value___2() { return &___value___2; }
inline void set_value___2(int32_t value)
{
___value___2 = value;
}
};
// System.Diagnostics.DebuggableAttribute/DebuggingModes
struct DebuggingModes_t279D5B9C012ABA935887CB73C5A63A1F46AF08A8
{
public:
// System.Int32 System.Diagnostics.DebuggableAttribute/DebuggingModes::value__
int32_t ___value___2;
public:
inline static int32_t get_offset_of_value___2() { return static_cast<int32_t>(offsetof(DebuggingModes_t279D5B9C012ABA935887CB73C5A63A1F46AF08A8, ___value___2)); }
inline int32_t get_value___2() const { return ___value___2; }
inline int32_t* get_address_of_value___2() { return &___value___2; }
inline void set_value___2(int32_t value)
{
___value___2 = value;
}
};
// System.Diagnostics.DebuggableAttribute
struct DebuggableAttribute_tA8054EBD0FC7511695D494B690B5771658E3191B : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.Diagnostics.DebuggableAttribute/DebuggingModes System.Diagnostics.DebuggableAttribute::m_debuggingModes
int32_t ___m_debuggingModes_0;
public:
inline static int32_t get_offset_of_m_debuggingModes_0() { return static_cast<int32_t>(offsetof(DebuggableAttribute_tA8054EBD0FC7511695D494B690B5771658E3191B, ___m_debuggingModes_0)); }
inline int32_t get_m_debuggingModes_0() const { return ___m_debuggingModes_0; }
inline int32_t* get_address_of_m_debuggingModes_0() { return &___m_debuggingModes_0; }
inline void set_m_debuggingModes_0(int32_t value)
{
___m_debuggingModes_0 = value;
}
};
// System.Resources.NeutralResourcesLanguageAttribute
struct NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
// System.String System.Resources.NeutralResourcesLanguageAttribute::_culture
String_t* ____culture_0;
// System.Resources.UltimateResourceFallbackLocation System.Resources.NeutralResourcesLanguageAttribute::_fallbackLoc
int32_t ____fallbackLoc_1;
public:
inline static int32_t get_offset_of__culture_0() { return static_cast<int32_t>(offsetof(NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2, ____culture_0)); }
inline String_t* get__culture_0() const { return ____culture_0; }
inline String_t** get_address_of__culture_0() { return &____culture_0; }
inline void set__culture_0(String_t* value)
{
____culture_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&____culture_0), (void*)value);
}
inline static int32_t get_offset_of__fallbackLoc_1() { return static_cast<int32_t>(offsetof(NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2, ____fallbackLoc_1)); }
inline int32_t get__fallbackLoc_1() const { return ____fallbackLoc_1; }
inline int32_t* get_address_of__fallbackLoc_1() { return &____fallbackLoc_1; }
inline void set__fallbackLoc_1(int32_t value)
{
____fallbackLoc_1 = value;
}
};
// System.Type
struct Type_t : public MemberInfo_t
{
public:
// System.RuntimeTypeHandle System.Type::_impl
RuntimeTypeHandle_tC33965ADA3E041E0C94AF05E5CB527B56482CEF9 ____impl_9;
public:
inline static int32_t get_offset_of__impl_9() { return static_cast<int32_t>(offsetof(Type_t, ____impl_9)); }
inline RuntimeTypeHandle_tC33965ADA3E041E0C94AF05E5CB527B56482CEF9 get__impl_9() const { return ____impl_9; }
inline RuntimeTypeHandle_tC33965ADA3E041E0C94AF05E5CB527B56482CEF9 * get_address_of__impl_9() { return &____impl_9; }
inline void set__impl_9(RuntimeTypeHandle_tC33965ADA3E041E0C94AF05E5CB527B56482CEF9 value)
{
____impl_9 = value;
}
};
struct Type_t_StaticFields
{
public:
// System.Reflection.MemberFilter System.Type::FilterAttribute
MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * ___FilterAttribute_0;
// System.Reflection.MemberFilter System.Type::FilterName
MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * ___FilterName_1;
// System.Reflection.MemberFilter System.Type::FilterNameIgnoreCase
MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * ___FilterNameIgnoreCase_2;
// System.Object System.Type::Missing
RuntimeObject * ___Missing_3;
// System.Char System.Type::Delimiter
Il2CppChar ___Delimiter_4;
// System.Type[] System.Type::EmptyTypes
TypeU5BU5D_t85B10489E46F06CEC7C4B1CCBD0E01FAB6649755* ___EmptyTypes_5;
// System.Reflection.Binder System.Type::defaultBinder
Binder_t2BEE27FD84737D1E79BC47FD67F6D3DD2F2DDA30 * ___defaultBinder_6;
public:
inline static int32_t get_offset_of_FilterAttribute_0() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___FilterAttribute_0)); }
inline MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * get_FilterAttribute_0() const { return ___FilterAttribute_0; }
inline MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 ** get_address_of_FilterAttribute_0() { return &___FilterAttribute_0; }
inline void set_FilterAttribute_0(MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * value)
{
___FilterAttribute_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___FilterAttribute_0), (void*)value);
}
inline static int32_t get_offset_of_FilterName_1() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___FilterName_1)); }
inline MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * get_FilterName_1() const { return ___FilterName_1; }
inline MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 ** get_address_of_FilterName_1() { return &___FilterName_1; }
inline void set_FilterName_1(MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * value)
{
___FilterName_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___FilterName_1), (void*)value);
}
inline static int32_t get_offset_of_FilterNameIgnoreCase_2() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___FilterNameIgnoreCase_2)); }
inline MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * get_FilterNameIgnoreCase_2() const { return ___FilterNameIgnoreCase_2; }
inline MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 ** get_address_of_FilterNameIgnoreCase_2() { return &___FilterNameIgnoreCase_2; }
inline void set_FilterNameIgnoreCase_2(MemberFilter_t48D0AA10105D186AF42428FA532D4B4332CF8B81 * value)
{
___FilterNameIgnoreCase_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___FilterNameIgnoreCase_2), (void*)value);
}
inline static int32_t get_offset_of_Missing_3() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___Missing_3)); }
inline RuntimeObject * get_Missing_3() const { return ___Missing_3; }
inline RuntimeObject ** get_address_of_Missing_3() { return &___Missing_3; }
inline void set_Missing_3(RuntimeObject * value)
{
___Missing_3 = value;
Il2CppCodeGenWriteBarrier((void**)(&___Missing_3), (void*)value);
}
inline static int32_t get_offset_of_Delimiter_4() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___Delimiter_4)); }
inline Il2CppChar get_Delimiter_4() const { return ___Delimiter_4; }
inline Il2CppChar* get_address_of_Delimiter_4() { return &___Delimiter_4; }
inline void set_Delimiter_4(Il2CppChar value)
{
___Delimiter_4 = value;
}
inline static int32_t get_offset_of_EmptyTypes_5() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___EmptyTypes_5)); }
inline TypeU5BU5D_t85B10489E46F06CEC7C4B1CCBD0E01FAB6649755* get_EmptyTypes_5() const { return ___EmptyTypes_5; }
inline TypeU5BU5D_t85B10489E46F06CEC7C4B1CCBD0E01FAB6649755** get_address_of_EmptyTypes_5() { return &___EmptyTypes_5; }
inline void set_EmptyTypes_5(TypeU5BU5D_t85B10489E46F06CEC7C4B1CCBD0E01FAB6649755* value)
{
___EmptyTypes_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___EmptyTypes_5), (void*)value);
}
inline static int32_t get_offset_of_defaultBinder_6() { return static_cast<int32_t>(offsetof(Type_t_StaticFields, ___defaultBinder_6)); }
inline Binder_t2BEE27FD84737D1E79BC47FD67F6D3DD2F2DDA30 * get_defaultBinder_6() const { return ___defaultBinder_6; }
inline Binder_t2BEE27FD84737D1E79BC47FD67F6D3DD2F2DDA30 ** get_address_of_defaultBinder_6() { return &___defaultBinder_6; }
inline void set_defaultBinder_6(Binder_t2BEE27FD84737D1E79BC47FD67F6D3DD2F2DDA30 * value)
{
___defaultBinder_6 = value;
Il2CppCodeGenWriteBarrier((void**)(&___defaultBinder_6), (void*)value);
}
};
#ifdef __clang__
#pragma clang diagnostic pop
#endif
// System.Void System.Reflection.AssemblyDelaySignAttribute::.ctor(System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyDelaySignAttribute__ctor_mD4A5A4EE506801F8BFE4E8F313FD421AE3003A7A (AssemblyDelaySignAttribute_tB66445498441723DC06E545FAA1CF0F128A1FE38 * __this, bool ___delaySign0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyCompanyAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyCompanyAttribute__ctor_m435C9FEC405646617645636E67860598A0C46FF0 (AssemblyCompanyAttribute_t642AAB097D7DEAAB623BEBE4664327E9B01D1DE4 * __this, String_t* ___company0, const RuntimeMethod* method);
// System.Void System.Resources.NeutralResourcesLanguageAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void NeutralResourcesLanguageAttribute__ctor_mF2BB52FC7FE116CCA2AEDD08A2DA1DF7055B56AF (NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2 * __this, String_t* ___cultureName0, const RuntimeMethod* method);
// System.Void System.Runtime.InteropServices.ComVisibleAttribute::.ctor(System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void ComVisibleAttribute__ctor_mBDE8E12A0233C07B98D6D5103511F4DD5B1FC172 (ComVisibleAttribute_tCE3DF5E341F3ECE4C81FE85C15B3D782AB302A2A * __this, bool ___visibility0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyKeyFileAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyKeyFileAttribute__ctor_mCCE9180B365E9EB7111D5061069A5F73E1690CC3 (AssemblyKeyFileAttribute_tEF26145AA8A5F35C218FE543113825F133CC6253 * __this, String_t* ___keyFile0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyFileVersionAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyFileVersionAttribute__ctor_mF855AEBC51CB72F4FF913499256741AE57B0F13D (AssemblyFileVersionAttribute_tCC1036D0566155DC5688D9230EF3C07D82A1896F * __this, String_t* ___version0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyInformationalVersionAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyInformationalVersionAttribute__ctor_m9BF349D8F980B0ABAB2A6312E422915285FA1678 (AssemblyInformationalVersionAttribute_t962229DBE84C4A66FB0B542E9AEBC510F55950D0 * __this, String_t* ___informationalVersion0, const RuntimeMethod* method);
// System.Void System.Resources.SatelliteContractVersionAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void SatelliteContractVersionAttribute__ctor_m561BB905628D77D6D09110E2C1427B313E8A3215 (SatelliteContractVersionAttribute_tA77BDC45FEEFE11823E95476FC8AE60B007906D2 * __this, String_t* ___version0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyDefaultAliasAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyDefaultAliasAttribute__ctor_m0C9991C32ED63B598FA509F3AF74554A5C874EB0 (AssemblyDefaultAliasAttribute_tBED24B7B2D875CB2BD712ABC4099024C2505B7AA * __this, String_t* ___defaultAlias0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyCopyrightAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyCopyrightAttribute__ctor_mB0B5F5C1A7A8B172289CC694E2711F07A37CE3F3 (AssemblyCopyrightAttribute_tA6A09319EF50B48D962810032000DEE7B12904EC * __this, String_t* ___copyright0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyProductAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyProductAttribute__ctor_m26DF1EBC1C86E7DA4786C66B44123899BE8DBCB8 (AssemblyProductAttribute_t6BB0E0F76C752E14A4C26B4D1E230019068601CA * __this, String_t* ___product0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyDescriptionAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyDescriptionAttribute__ctor_m3A0BD500FF352A67235FBA499FBA58EFF15B1F25 (AssemblyDescriptionAttribute_tF4460CCB289F6E2F71841792BBC7E6907DF612B3 * __this, String_t* ___description0, const RuntimeMethod* method);
// System.Void System.Reflection.AssemblyTitleAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AssemblyTitleAttribute__ctor_mE239F206B3B369C48AE1F3B4211688778FE99E8D (AssemblyTitleAttribute_tABB894D0792C7F307694CC796C8AE5D6A20382E7 * __this, String_t* ___title0, const RuntimeMethod* method);
// System.Void System.Diagnostics.DebuggableAttribute::.ctor(System.Diagnostics.DebuggableAttribute/DebuggingModes)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void DebuggableAttribute__ctor_m7FF445C8435494A4847123A668D889E692E55550 (DebuggableAttribute_tA8054EBD0FC7511695D494B690B5771658E3191B * __this, int32_t ___modes0, const RuntimeMethod* method);
// System.Void System.Runtime.CompilerServices.RuntimeCompatibilityAttribute::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void RuntimeCompatibilityAttribute__ctor_m551DDF1438CE97A984571949723F30F44CF7317C (RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80 * __this, const RuntimeMethod* method);
// System.Void System.Runtime.CompilerServices.RuntimeCompatibilityAttribute::set_WrapNonExceptionThrows(System.Boolean)
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR void RuntimeCompatibilityAttribute_set_WrapNonExceptionThrows_m8562196F90F3EBCEC23B5708EE0332842883C490_inline (RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80 * __this, bool ___value0, const RuntimeMethod* method);
// System.Void System.Runtime.CompilerServices.CompilationRelaxationsAttribute::.ctor(System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void CompilationRelaxationsAttribute__ctor_mAC3079EBC4EEAB474EED8208EF95DB39C922333B (CompilationRelaxationsAttribute_t661FDDC06629BDA607A42BD660944F039FE03AFF * __this, int32_t ___relaxations0, const RuntimeMethod* method);
// System.Void System.Runtime.CompilerServices.ExtensionAttribute::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * __this, const RuntimeMethod* method);
// System.Void System.CLSCompliantAttribute::.ctor(System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void CLSCompliantAttribute__ctor_m340EDA4DA5E45506AD631FE84241ADFB6B3F0270 (CLSCompliantAttribute_tA28EF6D4ADBD3C5C429DE9A70DD1E927C8906249 * __this, bool ___isCompliant0, const RuntimeMethod* method);
// System.Void System.Runtime.CompilerServices.IteratorStateMachineAttribute::.ctor(System.Type)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void IteratorStateMachineAttribute__ctor_m019CD62C4E5301F55EDF4723107B608AE8F12481 (IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 * __this, Type_t * ___stateMachineType0, const RuntimeMethod* method);
// System.Void System.Runtime.CompilerServices.CompilerGeneratedAttribute::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void CompilerGeneratedAttribute__ctor_m9DC3E4E2DA76FE93948D44199213E2E924DCBE35 (CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C * __this, const RuntimeMethod* method);
// System.Void System.Diagnostics.DebuggerHiddenAttribute::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3 (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * __this, const RuntimeMethod* method);
// System.Void System.Diagnostics.DebuggerTypeProxyAttribute::.ctor(System.Type)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void DebuggerTypeProxyAttribute__ctor_mF05A9CF9DC4A3F95F05938CF6CBF45CC32CF5167 (DebuggerTypeProxyAttribute_t20C961369DAE0E16D87B752F1C04F16FC3B90014 * __this, Type_t * ___type0, const RuntimeMethod* method);
// System.Void System.Diagnostics.DebuggerDisplayAttribute::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void DebuggerDisplayAttribute__ctor_m870C3A98DA4C9FA7FD4411169AF30C55A90B9988 (DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F * __this, String_t* ___value0, const RuntimeMethod* method);
static void System_Core_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
AssemblyDelaySignAttribute_tB66445498441723DC06E545FAA1CF0F128A1FE38 * tmp = (AssemblyDelaySignAttribute_tB66445498441723DC06E545FAA1CF0F128A1FE38 *)cache->attributes[0];
AssemblyDelaySignAttribute__ctor_mD4A5A4EE506801F8BFE4E8F313FD421AE3003A7A(tmp, true, NULL);
}
{
AssemblyCompanyAttribute_t642AAB097D7DEAAB623BEBE4664327E9B01D1DE4 * tmp = (AssemblyCompanyAttribute_t642AAB097D7DEAAB623BEBE4664327E9B01D1DE4 *)cache->attributes[1];
AssemblyCompanyAttribute__ctor_m435C9FEC405646617645636E67860598A0C46FF0(tmp, il2cpp_codegen_string_new_wrapper("\x4D\x6F\x6E\x6F\x20\x64\x65\x76\x65\x6C\x6F\x70\x6D\x65\x6E\x74\x20\x74\x65\x61\x6D"), NULL);
}
{
NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2 * tmp = (NeutralResourcesLanguageAttribute_t14C9436446C8E9EB3C2244D386AF1C84ADC80FB2 *)cache->attributes[2];
NeutralResourcesLanguageAttribute__ctor_mF2BB52FC7FE116CCA2AEDD08A2DA1DF7055B56AF(tmp, il2cpp_codegen_string_new_wrapper("\x65\x6E\x2D\x55\x53"), NULL);
}
{
ComVisibleAttribute_tCE3DF5E341F3ECE4C81FE85C15B3D782AB302A2A * tmp = (ComVisibleAttribute_tCE3DF5E341F3ECE4C81FE85C15B3D782AB302A2A *)cache->attributes[3];
ComVisibleAttribute__ctor_mBDE8E12A0233C07B98D6D5103511F4DD5B1FC172(tmp, false, NULL);
}
{
AssemblyKeyFileAttribute_tEF26145AA8A5F35C218FE543113825F133CC6253 * tmp = (AssemblyKeyFileAttribute_tEF26145AA8A5F35C218FE543113825F133CC6253 *)cache->attributes[4];
AssemblyKeyFileAttribute__ctor_mCCE9180B365E9EB7111D5061069A5F73E1690CC3(tmp, il2cpp_codegen_string_new_wrapper("\x2E\x2E\x2F\x73\x69\x6C\x76\x65\x72\x6C\x69\x67\x68\x74\x2E\x70\x75\x62"), NULL);
}
{
AssemblyFileVersionAttribute_tCC1036D0566155DC5688D9230EF3C07D82A1896F * tmp = (AssemblyFileVersionAttribute_tCC1036D0566155DC5688D9230EF3C07D82A1896F *)cache->attributes[5];
AssemblyFileVersionAttribute__ctor_mF855AEBC51CB72F4FF913499256741AE57B0F13D(tmp, il2cpp_codegen_string_new_wrapper("\x34\x2E\x30\x2E\x33\x30\x33\x31\x39\x2E\x31\x37\x30\x32\x30"), NULL);
}
{
AssemblyInformationalVersionAttribute_t962229DBE84C4A66FB0B542E9AEBC510F55950D0 * tmp = (AssemblyInformationalVersionAttribute_t962229DBE84C4A66FB0B542E9AEBC510F55950D0 *)cache->attributes[6];
AssemblyInformationalVersionAttribute__ctor_m9BF349D8F980B0ABAB2A6312E422915285FA1678(tmp, il2cpp_codegen_string_new_wrapper("\x34\x2E\x30\x2E\x33\x30\x33\x31\x39\x2E\x31\x37\x30\x32\x30"), NULL);
}
{
SatelliteContractVersionAttribute_tA77BDC45FEEFE11823E95476FC8AE60B007906D2 * tmp = (SatelliteContractVersionAttribute_tA77BDC45FEEFE11823E95476FC8AE60B007906D2 *)cache->attributes[7];
SatelliteContractVersionAttribute__ctor_m561BB905628D77D6D09110E2C1427B313E8A3215(tmp, il2cpp_codegen_string_new_wrapper("\x34\x2E\x30\x2E\x30\x2E\x30"), NULL);
}
{
AssemblyDefaultAliasAttribute_tBED24B7B2D875CB2BD712ABC4099024C2505B7AA * tmp = (AssemblyDefaultAliasAttribute_tBED24B7B2D875CB2BD712ABC4099024C2505B7AA *)cache->attributes[8];
AssemblyDefaultAliasAttribute__ctor_m0C9991C32ED63B598FA509F3AF74554A5C874EB0(tmp, il2cpp_codegen_string_new_wrapper("\x53\x79\x73\x74\x65\x6D\x2E\x43\x6F\x72\x65\x2E\x64\x6C\x6C"), NULL);
}
{
AssemblyCopyrightAttribute_tA6A09319EF50B48D962810032000DEE7B12904EC * tmp = (AssemblyCopyrightAttribute_tA6A09319EF50B48D962810032000DEE7B12904EC *)cache->attributes[9];
AssemblyCopyrightAttribute__ctor_mB0B5F5C1A7A8B172289CC694E2711F07A37CE3F3(tmp, il2cpp_codegen_string_new_wrapper("\x28\x63\x29\x20\x56\x61\x72\x69\x6F\x75\x73\x20\x4D\x6F\x6E\x6F\x20\x61\x75\x74\x68\x6F\x72\x73"), NULL);
}
{
AssemblyProductAttribute_t6BB0E0F76C752E14A4C26B4D1E230019068601CA * tmp = (AssemblyProductAttribute_t6BB0E0F76C752E14A4C26B4D1E230019068601CA *)cache->attributes[10];
AssemblyProductAttribute__ctor_m26DF1EBC1C86E7DA4786C66B44123899BE8DBCB8(tmp, il2cpp_codegen_string_new_wrapper("\x4D\x6F\x6E\x6F\x20\x43\x6F\x6D\x6D\x6F\x6E\x20\x4C\x61\x6E\x67\x75\x61\x67\x65\x20\x49\x6E\x66\x72\x61\x73\x74\x72\x75\x63\x74\x75\x72\x65"), NULL);
}
{
AssemblyDescriptionAttribute_tF4460CCB289F6E2F71841792BBC7E6907DF612B3 * tmp = (AssemblyDescriptionAttribute_tF4460CCB289F6E2F71841792BBC7E6907DF612B3 *)cache->attributes[11];
AssemblyDescriptionAttribute__ctor_m3A0BD500FF352A67235FBA499FBA58EFF15B1F25(tmp, il2cpp_codegen_string_new_wrapper("\x53\x79\x73\x74\x65\x6D\x2E\x43\x6F\x72\x65\x2E\x64\x6C\x6C"), NULL);
}
{
AssemblyTitleAttribute_tABB894D0792C7F307694CC796C8AE5D6A20382E7 * tmp = (AssemblyTitleAttribute_tABB894D0792C7F307694CC796C8AE5D6A20382E7 *)cache->attributes[12];
AssemblyTitleAttribute__ctor_mE239F206B3B369C48AE1F3B4211688778FE99E8D(tmp, il2cpp_codegen_string_new_wrapper("\x53\x79\x73\x74\x65\x6D\x2E\x43\x6F\x72\x65\x2E\x64\x6C\x6C"), NULL);
}
{
DebuggableAttribute_tA8054EBD0FC7511695D494B690B5771658E3191B * tmp = (DebuggableAttribute_tA8054EBD0FC7511695D494B690B5771658E3191B *)cache->attributes[13];
DebuggableAttribute__ctor_m7FF445C8435494A4847123A668D889E692E55550(tmp, 2LL, NULL);
}
{
RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80 * tmp = (RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80 *)cache->attributes[14];
RuntimeCompatibilityAttribute__ctor_m551DDF1438CE97A984571949723F30F44CF7317C(tmp, NULL);
RuntimeCompatibilityAttribute_set_WrapNonExceptionThrows_m8562196F90F3EBCEC23B5708EE0332842883C490_inline(tmp, true, NULL);
}
{
CompilationRelaxationsAttribute_t661FDDC06629BDA607A42BD660944F039FE03AFF * tmp = (CompilationRelaxationsAttribute_t661FDDC06629BDA607A42BD660944F039FE03AFF *)cache->attributes[15];
CompilationRelaxationsAttribute__ctor_mAC3079EBC4EEAB474EED8208EF95DB39C922333B(tmp, 8LL, NULL);
}
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[16];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
{
CLSCompliantAttribute_tA28EF6D4ADBD3C5C429DE9A70DD1E927C8906249 * tmp = (CLSCompliantAttribute_tA28EF6D4ADBD3C5C429DE9A70DD1E927C8906249 *)cache->attributes[17];
CLSCompliantAttribute__ctor_m340EDA4DA5E45506AD631FE84241ADFB6B3F0270(tmp, true, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Where_mA05D6D232FDEEDAC4017DF69D23289072EA51608(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Select_m0F832C2EBFF8FDF03BC950473E3A184C78CB03AD(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_OrderBy_mFE3C75D26357FC2121A7A0F64909BA5C56972FAC(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Concat_mD6D66AA2C70C3E046DEDB9C1895E5EBF2AC9FB2B(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_ConcatIterator_m0ABD08999B5F1594730A641FB2EDD1761978C99F(CustomAttributesCache* cache)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_runtime_metadata((uintptr_t*)&U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_0_0_0_var);
s_Il2CppMethodInitialized = true;
}
{
IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 * tmp = (IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 *)cache->attributes[0];
IteratorStateMachineAttribute__ctor_m019CD62C4E5301F55EDF4723107B608AE8F12481(tmp, il2cpp_codegen_type_get_object(U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_0_0_0_var), NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Distinct_m382C44CCF7E547ECC8EA30153F94DCEC8A65709E(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_DistinctIterator_m5A9FA359C9D229F79CD1409F5EB51026F5464DF5(CustomAttributesCache* cache)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_runtime_metadata((uintptr_t*)&U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_0_0_0_var);
s_Il2CppMethodInitialized = true;
}
{
IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 * tmp = (IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 *)cache->attributes[0];
IteratorStateMachineAttribute__ctor_m019CD62C4E5301F55EDF4723107B608AE8F12481(tmp, il2cpp_codegen_type_get_object(U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_0_0_0_var), NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_ToArray_mEF57EC6EFED0A3887E18C8D72F1513FE9677B51A(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_First_m6DCB83ABC7A3DBCDC1C16AA0F6E8E7E871AE6FE9(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_FirstOrDefault_m967D3977A2E14F6C12363EE55D8900436F70B4D7(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_FirstOrDefault_mA1868B8D9A31FE682F5F3AD1210F5D3E7EAA1B1A(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_SingleOrDefault_m40E15CE75D867123BC871FDACD02DF4AC846243B(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Any_mAFDE090D70A59A02D5892E965432BB6B2D95DEAE(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Any_mB2DC189193A9DC979508864A926562F1781FAB9B(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_All_m1624980E27755E17033CBB3B20992596DBD056A6(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Count_m0A24EF6E16C4ED19CE4E097B16B0E6865B7C9E38(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Contains_m90E70EBC12EBD84C16887012D9C9C0C0C2076CCC(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Contains_m0EE5D3F4AAA5B7A92D12E27C08502F1DE081A4DC(CustomAttributesCache* cache)
{
{
ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC * tmp = (ExtensionAttribute_t917F3F92E717DC8B2D7BC03967A9790B1B8EF7CC *)cache->attributes[0];
ExtensionAttribute__ctor_mB331519C39C4210259A248A4C629DF934937C1FA(tmp, NULL);
}
}
static void U3CU3Ec__DisplayClass6_0_1_t29ECACEBF8EBA80C4C38A326FA7DED849E3A7C8C_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C * tmp = (CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C *)cache->attributes[0];
CompilerGeneratedAttribute__ctor_m9DC3E4E2DA76FE93948D44199213E2E924DCBE35(tmp, NULL);
}
}
static void U3CU3Ec__DisplayClass7_0_3_t8973425B5DD9808F4413BBE99605370FE1C396C7_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C * tmp = (CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C *)cache->attributes[0];
CompilerGeneratedAttribute__ctor_m9DC3E4E2DA76FE93948D44199213E2E924DCBE35(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C * tmp = (CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C *)cache->attributes[0];
CompilerGeneratedAttribute__ctor_m9DC3E4E2DA76FE93948D44199213E2E924DCBE35(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1__ctor_m0BE6C852A5A7F006B27A688ACF0261501E795703(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_IDisposable_Dispose_m20AE6B0375A8F0FF5B427661A31C73EA55C994F0(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_Generic_IEnumeratorU3CTSourceU3E_get_Current_m1EB1515147485EC98498FFE77802AF634A9651CD(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_IEnumerator_Reset_m8C476C8BF2746F6A8338F365101E61E2E8DAFC91(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_IEnumerator_get_Current_m831ACB6FA7273731811F7F7759129C743856930F(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_Generic_IEnumerableU3CTSourceU3E_GetEnumerator_m9F4D73BCC61503F1F9D128CB9F71EBEE0AF04F2B(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_IEnumerable_GetEnumerator_m1CE0AD7946F319A8135273D940011A819346A0F9(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C * tmp = (CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C *)cache->attributes[0];
CompilerGeneratedAttribute__ctor_m9DC3E4E2DA76FE93948D44199213E2E924DCBE35(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1__ctor_m514095C0832A011B5A4E7DA3C9FD0A035FF1FA15(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_IDisposable_Dispose_mC755BB6B8165235701E4CE8BBAAE6E2FAFA5AA88(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_Generic_IEnumeratorU3CTSourceU3E_get_Current_m548974CDCE6260589CEEC66B652C87E4CCECAB0C(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_IEnumerator_Reset_m601A43E654209DD757F11E906CA9A3277CA1DCA3(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_IEnumerator_get_Current_mE9B8CDD10C82BEB8745F9CCBF1D49B681F76AC83(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_Generic_IEnumerableU3CTSourceU3E_GetEnumerator_m96C24F840A8C1CCEE5E4B8BFBD362F00F25D6226(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_IEnumerable_GetEnumerator_mA3C8F093418E360E30448ABD8BDBB0924EC83CF7(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void OrderedEnumerable_1_tBB5DA0680F27796F93167FD5895C19D11B3F56A3_CustomAttributesCacheGenerator_OrderedEnumerable_1_GetEnumerator_m8F345EA8377852340D424B912E1D3E8741AC5111(CustomAttributesCache* cache)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_runtime_metadata((uintptr_t*)&U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_0_0_0_var);
s_Il2CppMethodInitialized = true;
}
{
IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 * tmp = (IteratorStateMachineAttribute_t6C72F3EC15FB34D08D47727AA7A86AB7FEA27830 *)cache->attributes[0];
IteratorStateMachineAttribute__ctor_m019CD62C4E5301F55EDF4723107B608AE8F12481(tmp, il2cpp_codegen_type_get_object(U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_0_0_0_var), NULL);
}
}
static void U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
{
CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C * tmp = (CompilerGeneratedAttribute_t39106AB982658D7A94C27DEF3C48DB2F5F7CD75C *)cache->attributes[0];
CompilerGeneratedAttribute__ctor_m9DC3E4E2DA76FE93948D44199213E2E924DCBE35(tmp, NULL);
}
}
static void U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1__ctor_mB0FF58153A4C153B7EC134E02ACD0B27861D6EE7(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_IDisposable_Dispose_m83B579641C31ACB3F8F9C2ACBCE85918ADE2D446(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_Collections_Generic_IEnumeratorU3CTElementU3E_get_Current_m770C7E54C01D4DA89645142C180756A37BA30E17(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_Collections_IEnumerator_Reset_m2FCE0A011A9372A24E96F56F256DB212B78FA591(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_Collections_IEnumerator_get_Current_m31D7687B2ECE3992F417CE86C3115846C82B2D48(CustomAttributesCache* cache)
{
{
DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 * tmp = (DebuggerHiddenAttribute_tD84728997C009D6F540FB29D88F032350E046A88 *)cache->attributes[0];
DebuggerHiddenAttribute__ctor_mB40799BB5DAFE439BEFE895836CF792B8DBEA7F3(tmp, NULL);
}
}
static void HashSet_1_t7366A48A7E46B2A1E050EA9D62BC9FCA32AFF80B_CustomAttributesCacheGenerator(CustomAttributesCache* cache)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_runtime_metadata((uintptr_t*)&ICollectionDebugView_1_t91F2BD45904FD84600887E6D4852BF7B6472F1D8_0_0_0_var);
s_Il2CppMethodInitialized = true;
}
{
DebuggerTypeProxyAttribute_t20C961369DAE0E16D87B752F1C04F16FC3B90014 * tmp = (DebuggerTypeProxyAttribute_t20C961369DAE0E16D87B752F1C04F16FC3B90014 *)cache->attributes[0];
DebuggerTypeProxyAttribute__ctor_mF05A9CF9DC4A3F95F05938CF6CBF45CC32CF5167(tmp, il2cpp_codegen_type_get_object(ICollectionDebugView_1_t91F2BD45904FD84600887E6D4852BF7B6472F1D8_0_0_0_var), NULL);
}
{
DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F * tmp = (DebuggerDisplayAttribute_tA5070C1A6CAB579DAC66A469530D946F6F42727F *)cache->attributes[1];
DebuggerDisplayAttribute__ctor_m870C3A98DA4C9FA7FD4411169AF30C55A90B9988(tmp, il2cpp_codegen_string_new_wrapper("\x43\x6F\x75\x6E\x74\x20\x3D\x20\x7B\x43\x6F\x75\x6E\x74\x7D"), NULL);
}
}
IL2CPP_EXTERN_C const CustomAttributesCacheGenerator g_System_Core_AttributeGenerators[];
const CustomAttributesCacheGenerator g_System_Core_AttributeGenerators[46] =
{
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator,
U3CU3Ec__DisplayClass6_0_1_t29ECACEBF8EBA80C4C38A326FA7DED849E3A7C8C_CustomAttributesCacheGenerator,
U3CU3Ec__DisplayClass7_0_3_t8973425B5DD9808F4413BBE99605370FE1C396C7_CustomAttributesCacheGenerator,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator,
U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator,
HashSet_1_t7366A48A7E46B2A1E050EA9D62BC9FCA32AFF80B_CustomAttributesCacheGenerator,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Where_mA05D6D232FDEEDAC4017DF69D23289072EA51608,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Select_m0F832C2EBFF8FDF03BC950473E3A184C78CB03AD,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_OrderBy_mFE3C75D26357FC2121A7A0F64909BA5C56972FAC,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Concat_mD6D66AA2C70C3E046DEDB9C1895E5EBF2AC9FB2B,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_ConcatIterator_m0ABD08999B5F1594730A641FB2EDD1761978C99F,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Distinct_m382C44CCF7E547ECC8EA30153F94DCEC8A65709E,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_DistinctIterator_m5A9FA359C9D229F79CD1409F5EB51026F5464DF5,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_ToArray_mEF57EC6EFED0A3887E18C8D72F1513FE9677B51A,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_First_m6DCB83ABC7A3DBCDC1C16AA0F6E8E7E871AE6FE9,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_FirstOrDefault_m967D3977A2E14F6C12363EE55D8900436F70B4D7,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_FirstOrDefault_mA1868B8D9A31FE682F5F3AD1210F5D3E7EAA1B1A,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_SingleOrDefault_m40E15CE75D867123BC871FDACD02DF4AC846243B,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Any_mAFDE090D70A59A02D5892E965432BB6B2D95DEAE,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Any_mB2DC189193A9DC979508864A926562F1781FAB9B,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_All_m1624980E27755E17033CBB3B20992596DBD056A6,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Count_m0A24EF6E16C4ED19CE4E097B16B0E6865B7C9E38,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Contains_m90E70EBC12EBD84C16887012D9C9C0C0C2076CCC,
Enumerable_t928C505614FDD67F6D61FB58BED73235DF569B0E_CustomAttributesCacheGenerator_Enumerable_Contains_m0EE5D3F4AAA5B7A92D12E27C08502F1DE081A4DC,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1__ctor_m0BE6C852A5A7F006B27A688ACF0261501E795703,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_IDisposable_Dispose_m20AE6B0375A8F0FF5B427661A31C73EA55C994F0,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_Generic_IEnumeratorU3CTSourceU3E_get_Current_m1EB1515147485EC98498FFE77802AF634A9651CD,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_IEnumerator_Reset_m8C476C8BF2746F6A8338F365101E61E2E8DAFC91,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_IEnumerator_get_Current_m831ACB6FA7273731811F7F7759129C743856930F,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_Generic_IEnumerableU3CTSourceU3E_GetEnumerator_m9F4D73BCC61503F1F9D128CB9F71EBEE0AF04F2B,
U3CConcatIteratorU3Ed__59_1_t12FC875588A430A3883A1FE0561F6904E32D8532_CustomAttributesCacheGenerator_U3CConcatIteratorU3Ed__59_1_System_Collections_IEnumerable_GetEnumerator_m1CE0AD7946F319A8135273D940011A819346A0F9,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1__ctor_m514095C0832A011B5A4E7DA3C9FD0A035FF1FA15,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_IDisposable_Dispose_mC755BB6B8165235701E4CE8BBAAE6E2FAFA5AA88,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_Generic_IEnumeratorU3CTSourceU3E_get_Current_m548974CDCE6260589CEEC66B652C87E4CCECAB0C,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_IEnumerator_Reset_m601A43E654209DD757F11E906CA9A3277CA1DCA3,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_IEnumerator_get_Current_mE9B8CDD10C82BEB8745F9CCBF1D49B681F76AC83,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_Generic_IEnumerableU3CTSourceU3E_GetEnumerator_m96C24F840A8C1CCEE5E4B8BFBD362F00F25D6226,
U3CDistinctIteratorU3Ed__68_1_tA775BA9D26F000C826D0930DB25EFFA9130816D7_CustomAttributesCacheGenerator_U3CDistinctIteratorU3Ed__68_1_System_Collections_IEnumerable_GetEnumerator_mA3C8F093418E360E30448ABD8BDBB0924EC83CF7,
OrderedEnumerable_1_tBB5DA0680F27796F93167FD5895C19D11B3F56A3_CustomAttributesCacheGenerator_OrderedEnumerable_1_GetEnumerator_m8F345EA8377852340D424B912E1D3E8741AC5111,
U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1__ctor_mB0FF58153A4C153B7EC134E02ACD0B27861D6EE7,
U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_IDisposable_Dispose_m83B579641C31ACB3F8F9C2ACBCE85918ADE2D446,
U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_Collections_Generic_IEnumeratorU3CTElementU3E_get_Current_m770C7E54C01D4DA89645142C180756A37BA30E17,
U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_Collections_IEnumerator_Reset_m2FCE0A011A9372A24E96F56F256DB212B78FA591,
U3CGetEnumeratorU3Ed__1_t88F7A7F40A0F49035BD30A5ECC998BF0DDBC4F1A_CustomAttributesCacheGenerator_U3CGetEnumeratorU3Ed__1_System_Collections_IEnumerator_get_Current_m31D7687B2ECE3992F417CE86C3115846C82B2D48,
System_Core_CustomAttributesCacheGenerator,
};
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR void RuntimeCompatibilityAttribute_set_WrapNonExceptionThrows_m8562196F90F3EBCEC23B5708EE0332842883C490_inline (RuntimeCompatibilityAttribute_tFF99AB2963098F9CBCD47A20D9FD3D51C17C1C80 * __this, bool ___value0, const RuntimeMethod* method)
{
{
bool L_0 = ___value0;
__this->set_m_wrapNonExceptionThrows_0(L_0);
return;
}
}
| [
"huzaifamomin49@gmail.com"
] | huzaifamomin49@gmail.com |
2453e0cce99a88498b382d31916c796c7d58d87d | 466208b91b187ca5b97f20bd2436da7eaa40f829 | /muut/MIT 6.837/zero/main.cpp | 037ff866d2e37555e271ab27502d96883a56ef25 | [] | no_license | toeesamp/public | 9d5b6fbf3cfd3ca13bc11c2a1742ea84a770b7d5 | f9c646761c7c8fddc0185f4a1ac8edf364fffa52 | refs/heads/master | 2021-04-26T23:01:59.930095 | 2019-09-11T19:51:03 | 2019-09-11T19:51:03 | 123,917,973 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,569 | cpp | #include "GL/freeglut.h"
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include "vecmath.h"
using namespace std;
// @author Tommi Sampo
// Itsearvio 5
// Toteutetut lisäominaisuudet:
// -Kappaleen pyörittäminen r-näppäimellä
// -Kappaleen esittäminen display listillä
// -Sulava värinvaihto
// -Kameran kontrollointi hiirellä (kääntäminen ja zoomaus)
//Jos tekisin uudestaan niin ensinäkin tekisin vektorien erotuksen
//sille tarkoitetulla valmiilla funktiolla, normalisoisin sen //erotuksen ja käyttäisin vaihtamiseen lerppiä.
// Globals
// Maximum buffer size for lines in the .obj file
CONST int MAX_BUFFER_SIZE = 256;
// This is the list of points (3D vectors)
vector<Vector3f> vecv;
// This is the list of normals (also 3D vectors)
vector<Vector3f> vecn;
// This is the list of faces (indices into vecv and vecn)
// a / b / c d / e / f g / h / i
// vecf[i][0] / vecf[i][1] / vecf[i][2] vecf[i][3] / vecf[i][4] / vecf[i][5] vecf[i][6] / vecf[i][7] / vecf[i][8]
vector<vector<unsigned> > vecf;
// You will need more global variables to implement color and position changes
// Offset for the light source from original position
GLfloat Lt0posOffset[] = { 0.0f, 0.0f };
int timerInterval = 20;
// Globals for color transition
// Index for the diffColors table
int colorIndex = 0;
// Amount of different colors (rows in diffColors table)
int colorsAmount = 0;
// Components for single step of color transition
GLfloat colorTransitionStep[3] = { 0, 0, 0 };
int firstRun = true;
int colorTransition = false;
int colorTransitionStarted = false;
float colorTransitionSteps = 30;
int colorTransitionStepsTaken = 0;
// Next color to be displayed
GLfloat nextColor[4] = { 0, 0, 0 , 1 };
// Globals for rotation
int rotating = false;
float rotateAngle = 0;
float rotateAngleIncrement = 1;
// Globals for camera position
float cameraDistanceOffset = 0.0f;
// The previous x-coordinate of the mouse (used for mouse rotation)
int previousX = 0;
// Draws triangles from vecv, vecn and vecf (not used in final version)
void drawInput()
{
for (size_t i = 0; i < vecf.size(); i++)
{
glBegin(GL_TRIANGLES);
glNormal3d(vecn[(vecf[i][2]) - 1][0], vecn[(vecf[i][2]) - 1][1], vecn[(vecf[i][2]) - 1][2]);
glVertex3d(vecv[(vecf[i][0]) - 1][0], vecv[(vecf[i][0]) - 1][1], vecv[(vecf[i][0]) - 1][2]);
glNormal3d(vecn[(vecf[i][5]) - 1][0], vecn[(vecf[i][5]) - 1][1], vecn[(vecf[i][5]) - 1][2]);
glVertex3d(vecv[(vecf[i][3]) - 1][0], vecv[(vecf[i][3]) - 1][1], vecv[(vecf[i][3]) - 1][2]);
glNormal3d(vecn[(vecf[i][8]) - 1][0], vecn[(vecf[i][8]) - 1][1], vecn[(vecf[i][8]) - 1][2]);
glVertex3d(vecv[(vecf[i][6]) - 1][0], vecv[(vecf[i][6]) - 1][1], vecv[(vecf[i][6]) - 1][2]);
glEnd();
}
}
// Generates a display list from vecv, vecn and vecf
void generateDisplayList()
{
GLuint index = glGenLists(1);
glNewList(index, GL_COMPILE);
for (size_t i = 0; i < vecf.size(); i++)
{
glBegin(GL_TRIANGLES);
glNormal3d(vecn[(vecf[i][2]) - 1][0], vecn[(vecf[i][2]) - 1][1], vecn[(vecf[i][2]) - 1][2]);
glVertex3d(vecv[(vecf[i][0]) - 1][0], vecv[(vecf[i][0]) - 1][1], vecv[(vecf[i][0]) - 1][2]);
glNormal3d(vecn[(vecf[i][5]) - 1][0], vecn[(vecf[i][5]) - 1][1], vecn[(vecf[i][5]) - 1][2]);
glVertex3d(vecv[(vecf[i][3]) - 1][0], vecv[(vecf[i][3]) - 1][1], vecv[(vecf[i][3]) - 1][2]);
glNormal3d(vecn[(vecf[i][8]) - 1][0], vecn[(vecf[i][8]) - 1][1], vecn[(vecf[i][8]) - 1][2]);
glVertex3d(vecv[(vecf[i][6]) - 1][0], vecv[(vecf[i][6]) - 1][1], vecv[(vecf[i][6]) - 1][2]);
glEnd();
}
glEndList();
}
// Timer function for smooth color transition
void changeColor(int t)
{
glutPostRedisplay();
}
// Rotates the model every timerInterval by rotateAngleIncrement
void rotateModel(int t)
{
if (rotating)
{
if (rotateAngle < 360)
{
rotateAngle = rotateAngle + rotateAngleIncrement;
}
else
{
rotateAngle = 0;
}
glutTimerFunc(timerInterval, rotateModel, 0);
}
glutPostRedisplay();
}
// These are convenience functions which allow us to call OpenGL
// methods on Vec3d objects
inline void glVertex(const Vector3f &a)
{
glVertex3fv(a);
}
inline void glNormal(const Vector3f &a)
{
glNormal3fv(a);
}
// This function is called whenever a "Normal" key press is received.
void keyboardFunc(unsigned char key, int x, int y)
{
switch (key)
{
case 27: // Escape key
exit(0);
break;
case'r':
rotating = !rotating;
rotateModel(0);
break;
case 'c':
if (!colorTransition)
{
colorTransition = true;
colorTransitionStarted = false;
}
break;
default:
cout << "Unhandled key press " << key << "." << endl;
}
// this will refresh the screen so that the user sees the color change
glutPostRedisplay();
}
// This function is called whenever a "Special" key press is received.
// Right now, it's handling the arrow keys.
void specialFunc(int key, int x, int y)
{
switch (key)
{
case GLUT_KEY_UP:
Lt0posOffset[1] = Lt0posOffset[1] - 0.5;
break;
case GLUT_KEY_DOWN:
Lt0posOffset[1] = Lt0posOffset[1] + 0.5;
break;
case GLUT_KEY_LEFT:
Lt0posOffset[0] = Lt0posOffset[0] + 0.5;
break;
case GLUT_KEY_RIGHT:
Lt0posOffset[0] = Lt0posOffset[0] - 0.5;
break;
}
// this will refresh the screen so that the user sees the light position
glutPostRedisplay();
}
// Allows model rotation using mouse
void motionFunc(int x, int y)
{
rotateAngle = rotateAngle - ((previousX - x) * 0.2f);
previousX = x;
glutPostRedisplay();
}
// Saves the x-coordinate where the left mouse button is first pressed
void mouseFunc(int button, int state, int x, int y)
{
if (state == GLUT_DOWN)
{
previousX = x;
}
}
// Changes the distance of the camera from the object depending
// on mouse scroll wheel direction
void mouseWheelFunc(int wheel, int direction, int x, int y)
{
if (wheel == 0)
{
switch (direction)
{
case 1:
if (cameraDistanceOffset > -3.0f)
{
cameraDistanceOffset = cameraDistanceOffset - 0.5f;
}
glutPostRedisplay();
break;
case -1:
if (cameraDistanceOffset < 10.0f)
{
cameraDistanceOffset = cameraDistanceOffset + 0.5f;
}
glutPostRedisplay();
break;
}
}
}
// This function is responsible for displaying the object.
void drawScene(void)
{
int i;
// Clear the rendering window
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
// Rotate the image
glMatrixMode(GL_MODELVIEW); // Current matrix affects objects positions
glLoadIdentity(); // Initialize to the identity
// Position the camera at [0,0,5], looking at [0,0,0],
// with [0,1,0] as the up direction.
gluLookAt(0.0, 0.0, 5.0 + cameraDistanceOffset,
0.0, 0.0, 0.0,
0.0, 1.0, 0.0);
// Set material properties of object
// Here are some colors you might use - feel free to add more
GLfloat diffColors[4][4] = { {0.5, 0.5, 0.9, 1.0},
{0.9, 0.5, 0.5, 1.0},
{0.5, 0.9, 0.3, 1.0},
{0.3, 0.8, 0.9, 1.0} };
// Things that only need to be set on the first run
if (firstRun)
{
for (size_t i = 0; i <= 2; i++)
{
nextColor[i] = diffColors[0][i];
}
// Number of rows in diffColors
colorsAmount = sizeof diffColors / sizeof diffColors[0];
firstRun = false;
}
if (colorTransition)
{
if (!colorTransitionStarted)
{
int nextColorIndex = 0;
if (colorIndex < colorsAmount - 1)
{
nextColorIndex = colorIndex + 1;
}
else
{
nextColorIndex = 0;
}
// Divide transition into steps
for (size_t i = 0; i <= 2; i++)
{
colorTransitionStep[i] = (diffColors[nextColorIndex][i] - diffColors[colorIndex][i]) / colorTransitionSteps;
}
colorIndex = nextColorIndex;
colorTransitionStarted = true;
}
if (colorTransitionStepsTaken < colorTransitionSteps)
{
// The color change itself
for (size_t i = 0; i <= 2; i++)
{
nextColor[i] = nextColor[i] + colorTransitionStep[i];
}
colorTransitionStepsTaken++;
}
else
{
// Ensuring that the final color is the one defined in diffColors (eliminating floating point errors)
for (size_t i = 0; i <= 2; i++)
{
nextColor[i] = diffColors[colorIndex][i];
}
colorTransitionStepsTaken = 0;
colorTransition = false;
}
glutTimerFunc(timerInterval, changeColor, 0);
}
// Here we use the first color entry as the diffuse color
//glMaterialfv(GL_FRONT_AND_BACK, GL_AMBIENT_AND_DIFFUSE, diffColors[colorIndex]);
glMaterialfv(GL_FRONT_AND_BACK, GL_AMBIENT_AND_DIFFUSE, nextColor);
// Define specular color and shininess
GLfloat specColor[] = { 1.0, 1.0, 1.0, 1.0 };
GLfloat shininess[] = { 100.0 };
// Note that the specular color and shininess can stay constant
glMaterialfv(GL_FRONT_AND_BACK, GL_SPECULAR, specColor);
glMaterialfv(GL_FRONT_AND_BACK, GL_SHININESS, shininess);
// Set light properties
// Light color (RGBA)
GLfloat Lt0diff[] = { 1.0,1.0,1.0,1.0 };
// Light position
GLfloat Lt0pos[] = { 1.0f - Lt0posOffset[0], 1.0f - Lt0posOffset[1], 5.0f, 1.0f };
glLightfv(GL_LIGHT0, GL_DIFFUSE, Lt0diff);
glLightfv(GL_LIGHT0, GL_POSITION, Lt0pos);
// Rotate object
glRotated(rotateAngle, 0, 1, 0);
// This GLUT method draws a teapot. You should replace
// it with code which draws the object you loaded.
//glutSolidTeapot(1.0);
//drawInput();
// Draw from the display list
glCallList(1);
// Dump the image to the screen.
glutSwapBuffers();
}
// Initialize OpenGL's rendering modes
void initRendering()
{
glEnable(GL_DEPTH_TEST); // Depth testing must be turned on
glEnable(GL_LIGHTING); // Enable lighting calculations
glEnable(GL_LIGHT0); // Turn on light #0.
}
// Called when the window is resized
// w, h - width and height of the window in pixels.
void reshapeFunc(int w, int h)
{
// Always use the largest square viewport possible
if (w > h) {
glViewport((w - h) / 2, 0, h, h);
}
else {
glViewport(0, (h - w) / 2, w, w);
}
// Set up a perspective view, with square aspect ratio
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
// 50 degree fov, uniform aspect ratio, near = 1, far = 100
gluPerspective(50.0, 1.0, 1.0, 100.0);
}
// Reads vertices, normals and faces from an obj-file and places them in
// vecv, vecn and vecf, respectively.
void loadInput()
{
char buffer[MAX_BUFFER_SIZE];
int i = 1;
while (cin.getline(buffer, MAX_BUFFER_SIZE)) {
stringstream ss(buffer);
Vector3f v;
string s;
ss >> s;
if (s == "v")
{
ss >> v[0] >> v[1] >> v[2];
vecv.push_back(v);
}
else if (s == "vn")
{
ss >> v[0] >> v[1] >> v[2];
vecn.push_back(v);
}
else if (s == "f")
{
vector<unsigned> vf(9);
// a / b / c d / e / f g / h / i
sscanf(buffer, "f %i/%i/%i %i/%i/%i %i/%i/%i", &vf[0], &vf[1], &vf[2], &vf[3], &vf[4], &vf[5], &vf[6], &vf[7], &vf[8]);
vecf.push_back(vf);
}
}
}
// Main routine.
// Set up OpenGL, define the callbacks and start the main loop
int main(int argc, char** argv)
{
loadInput();
glutInit(&argc, argv);
// We're going to animate it, so double buffer
glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);
// Initial parameters for window position and size
glutInitWindowPosition(200, 200);
glutInitWindowSize(720, 720);
glutCreateWindow("Assignment 0");
// Initialize OpenGL parameters.
initRendering();
// Create display list
generateDisplayList();
// Set up callback functions for key presses
glutKeyboardFunc(keyboardFunc); // Handles "normal" ascii symbols
glutSpecialFunc(specialFunc); // Handles "special" keyboard keys
glutMouseFunc(mouseFunc); // Handles mouse buttons
glutMouseWheelFunc(mouseWheelFunc); // Handles mouse wheel scrolling
glutMotionFunc(motionFunc); // Handles mouse movement
// Set up the callback function for resizing windows
glutReshapeFunc(reshapeFunc);
// Call this whenever window needs redrawing
glutDisplayFunc(drawScene);
// Start the main loop. glutMainLoop never returns.
glutMainLoop();
return 0; // This line is never reached.
}
| [
"noreply@github.com"
] | noreply@github.com |
cc91ae0715de9ce27d1f54dc8052aa83ebad4708 | 902c38753580796b38443a48c807db531eb18d60 | /My C++ Programs/sum class.cpp | 2e65afd55bf9930bef5fd56ba34113a28cf8d136 | [] | no_license | ibadeeCodes/All-About-C-plus | b6b189f4f2fb09b6ca85e2789de8da4a93997d39 | fe286f4cf93ea8a6c091baba8fba7d226e312c25 | refs/heads/master | 2020-04-14T13:29:40.232570 | 2019-01-02T18:32:27 | 2019-01-02T18:32:27 | 163,870,040 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 481 | cpp | #include<iostream>
using namespace std;
class add
{
public:
float x,y,sum;
public:
add():x(0),y(0),sum(0)
{
}
add(float a,float b): x(a),y(b)
{ float sum;
sum=a + b;
cout<<sum;
}
void get_values()
{
cout<<"enter value of x:";
cin>>x;
cout<<"enter value of y:";
cin>>y;
}
void display()
{
cout<<"x="<<x;
cout<<"y="<<y;
sum=x+y;
cout<<sum;
}
};
main()
{
add dis1,dis2,dis3;
dis1(23,45.4);
dis2(dis1);
dist3=dis2;
dis1.display();
dis2.display();
dis3.display();
}
| [
"ibadeeshaikh@gmail.com"
] | ibadeeshaikh@gmail.com |
f38f7f8c4f7a427c94b70aba9ccab558795d091c | fd2b37c9956289c6161b648d47a14a430af678bd | /algorithms_coursera/week2_algorithmic_warmup/4_least_common_multiple.cpp | 6486ac38eaaea90fc4563d448e0f32edc41ab97b | [] | no_license | Deven-14/DataStructures-and-Algorithms | 6a8ccc1cd6474cb9985a39639baed37867ce3720 | dbca4bb3c644e98cf1e994481725cce904e8cfeb | refs/heads/main | 2023-04-20T00:57:34.892807 | 2021-05-11T19:40:49 | 2021-05-11T19:40:49 | 354,130,449 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 380 | cpp | #include <iostream>
using namespace std;
int gcd(int a, int b)
{
int temp;
while(b > 0)
{
temp = b;
b = a % b;
a = temp;
}
return a;
}
long long lcm(int a, int b)
{
int gcd_ = gcd(a, b);
long long lcm_ = (static_cast<long long>(a) * b) / static_cast<long long>(gcd_);
return lcm_;
}
int main()
{
int a, b;
cin >> a >> b;
cout << lcm(a, b) << endl;
return 0;
} | [
"devenparamaj.is19@bmsce.ac.in"
] | devenparamaj.is19@bmsce.ac.in |
4c110f2ce6563f2180e90fbc87467b475fe5a60d | a80685058f41d29f7e0a28d8816736f6d6221579 | /source/rotators/g5500rotator.cpp | a4722c63742ce324a8bb4b47f269c03678138d47 | [] | no_license | horvathp/gndapp | add41283719fdc83998feb57429eb9c5c05bb33e | 258acd565f77e9aa2a4f78a6edf875f2cdfbfeed | refs/heads/master | 2020-11-27T01:32:47.557532 | 2019-12-23T23:38:44 | 2019-12-23T23:38:44 | 229,257,595 | 0 | 0 | null | 2019-12-20T12:04:18 | 2019-12-20T12:04:18 | null | UTF-8 | C++ | false | false | 1,105 | cpp | #include "g5500rotator.h"
G5500Rotator::G5500Rotator(PredicterController *predicter) : Rotator(predicter, 10) {
}
void G5500Rotator::setAZEL(unsigned int azimuth, unsigned int elevation) {
emit newCommand(
QString("W%1 %2\n").arg(azimuth, 3, 10, QChar('0')).arg(elevation, 3, 10, QChar('0')).toLocal8Bit());
}
void G5500Rotator::setPortSettingsBasedOnBaudRate(int baudRate) {
switch (baudRate) {
case 1200:
portSettings_prot.BaudRate = QSerialPort::Baud1200;
break;
case 2400:
portSettings_prot.BaudRate = QSerialPort::Baud2400;
break;
case 4800:
portSettings_prot.BaudRate = QSerialPort::Baud4800;
break;
case 9600:
portSettings_prot.BaudRate = QSerialPort::Baud9600;
break;
default:
portSettings_prot.BaudRate = QSerialPort::Baud9600;
break;
}
portSettings_prot.FlowControl = QSerialPort::NoFlowControl;
portSettings_prot.Parity = QSerialPort::NoParity;
portSettings_prot.StopBits = QSerialPort::OneStop;
}
void G5500Rotator::initialization() {
// does nothing
}
| [
"tibor.kalman@avatao.com"
] | tibor.kalman@avatao.com |
20e6d59e4cf7faa8e7faa2171c4494fb41feff85 | ff83da74011e8552a5390317fb3a189a4e8ced4d | /Iniciante/URI 2143.cpp | b5cb02b34f8acfd6582c95e53fb8289c791d01b1 | [] | no_license | AnaA-Rocha/URI-solution-cpp | 2f0b0e3a736686257e5751e31129dbbd7aa53eba | 6622603dc08d04285432c4dbf3a4e6656fbbd724 | refs/heads/master | 2023-01-22T01:44:15.974598 | 2020-12-04T14:00:26 | 2020-12-04T14:00:26 | 290,502,769 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 235 | cpp | #include <iostream>
using namespace std;
int main(){
int t,n;
cin>>t;
while(t){
while(t--){
int soma = 1;
cin>>n;
n--;
if(n%2){
soma++;
n--;
}
soma += (n*2);
cout<<soma<<endl;
}
cin>>t;
}
}
| [
"noreply@github.com"
] | noreply@github.com |
6c1c40949c3855e8e7f20cc5ae519f8ed8829300 | c804e678a44cafc47088dded86f4493a2401ed24 | /A. Omkar and Bad Story.cpp | 66bee5a906c48ce0ba878263c6b077d3bdfad402 | [] | no_license | siddhantgupta385/leetcode | e300c1342a4fdb587564da476bca0b55a362320a | daadf7315dada6169dd4cf2094cbeb61485f7a13 | refs/heads/main | 2023-08-26T18:01:56.132614 | 2021-11-10T09:17:21 | 2021-11-10T09:17:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 481 | cpp | #include<bits/stdc++.h>
using namespace std;
void solve(){
int n; cin>>n;
int arr[n]; int flag=false;
for(int i=0;i<n;i++){
cin>>arr[i];
if(arr[i]<0) flag=true;
}
if(flag) {cout<<"NO"<<endl; return;}
else{ cout<<"YES"<<endl;cout<<101<<endl;
for(int i=0;i<=100;i++) cout<<i<<" "; cout<<endl;return;
}
}
int main(){
int t; cin>>t;
while(t--){
solve();
}
}
| [
"siddhantgupta384@gmail.com"
] | siddhantgupta384@gmail.com |
512904f6e49ed4536541c1e80cea8f65899101da | af06cd7ec1150e6c035369066bc63e6122019e1e | /include/boost/numeric/ublas/df/column_algorithm.hpp | c0f2ebe23809215eaf237a1c6a85ccd7e8346101 | [
"BSL-1.0"
] | permissive | BoostGSoC20/df | 57115e6f19ecf0218e3529ce8e6ebf9603a2c3b0 | 18e33bcadce47f588ad34343f14fdd37dfab12d5 | refs/heads/master | 2022-11-22T13:24:18.025231 | 2020-07-16T16:50:55 | 2020-07-16T16:50:55 | 272,902,741 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 486 | hpp | // Copyright (c) 2020 Tom Kwok
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
/// \file column_algorithm.hpp Definition for operations on the column class for data frame
#ifndef BOOST_UBLAS_DF_COLUMN_ALGORITHM_HPP
#define BOOST_UBLAS_DF_COLUMN_ALGORITHM_HPP
#include "column.hpp"
namespace boost {
namespace numeric {
namespace ublas {
namespace df {
}
}
}
}
#endif
| [
"tom@tomkwok.com"
] | tom@tomkwok.com |
46c99c2c650f249d5d3bd01c12c64833c447f3b3 | 24c0706621133b3056c5558191118164dfa0873b | /train.h | 79f30af631daaabe8b7f7760f1bce6a131d6610e | [] | no_license | erikthe-viking/NeuralNetwork | 43cd93026464170d3f53e015bd1588c95adc4fcb | f59aeb3346c4a567037d16beac862cccfd818be9 | refs/heads/master | 2020-03-17T12:25:38.233277 | 2018-05-16T00:29:04 | 2018-05-16T00:29:04 | 133,588,044 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 196 | h | #include <vector>
using namespace std;
class train
{
public:
train();
std::vector<vector<double>> alphabet;
vector<vector <double>> target_list;
vector<unsigned> dimensions;
}; | [
"ekirkegaard12@gmail.com"
] | ekirkegaard12@gmail.com |
d5f7ca92dbbb6f6ddb2d3a90e17ccf755b6fe0fd | f8b043b42b0be6159db8099e8289cd4fd671722d | /STAMPS.cpp | 478a88a5b9a71a37b2669becfd3fa7c54865dbbe | [] | no_license | priyanshu-28/Spoj-Solutions | 251c332f7d7292fa45af73ec01acd3349a43913a | 78a2104ddc73cf315245645640242825dc92b7af | refs/heads/master | 2023-03-20T05:34:55.257835 | 2017-04-25T13:45:22 | 2017-04-25T13:45:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 603 | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int test;
scanf("%d",&test);
for(int t=1;t<=test;t++)
{
int re,n;
scanf("%d%d",&re,&n);
vector< int > arr(n);
for(int i=0;i<n;i++)
scanf("%d",&arr[i]);
printf("Scenario #%d:\n",t);
if(re==0)
{
printf("0\n");
}
else
{
sort(arr.begin(),arr.end());
int result=0;
int cal=0;
for(int i=n-1;i>=0;i--)
{
cal+=arr[i];
result++;
if(cal>=re)
break;
}
if(cal<re)
{
printf("impossible\n");
}
else
printf("%d\n",result);
}
if(t!=test)
printf("\n");
}
return 0;
}
| [
"Vengatesh"
] | Vengatesh |
7d4c0a28caa17ac7d38f47114295c306fb0fa3da | 13c5d132225bcff7bddf06e061670f921aba98b0 | /clusterRelated/i_clusterSimilarityMeasure.h | b92bd11df23c77d93b0bdd36b8cbfcb3e02db949 | [] | no_license | Tomev/interfaces | a132551d79826453080f756417f83ce73319e54a | 8e9acc335387776b0dc8a99f994f75205a807f58 | refs/heads/master | 2020-03-21T09:29:46.836387 | 2018-10-22T06:40:22 | 2018-10-22T06:40:22 | 138,402,582 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 492 | h | #ifndef INTERFACES_I_CLUSTERSIMILARITYMEASURE_H
#define INTERFACES_I_CLUSTERSIMILARITYMEASURE_H
#include "i_cluster.h"
#include "i_objectSimilarityMeasure.h"
/**
* Basic interface for general inter cluster similarity measures.
*/
class clusterSimilarityMeasure {
public:
virtual double getClustersSimilarity(clusterPtr c1, clusterPtr c2) = 0;
protected:
std::shared_ptr<i_objectSimilarityMeasure> objectSimilarityMeasure;
};
#endif //INTERFACES_I_CLUSTERSIMILARITYMEASURE_H
| [
"rybotycki.tomasz@gmail.com"
] | rybotycki.tomasz@gmail.com |
1bf65b9dcc45c5deffe35b1fcd4dabece739ae17 | 97e53e8028ffb9d3f736a0999cc470f9942ddcd0 | /01 窗体与界面设计/02 弹出菜单应用实例/001 在控件上单击右键弹出菜单-例1/FloatMenu/FloatMenuDoc.h | b00dd493201bf0f6a0bb76798d96c80c4257d1d2 | [] | no_license | BambooMa/VC_openSource | 3da1612ca8285eaba9b136fdc2c2034c7b92f300 | 8c519e73ef90cdb2bad3de7ba75ec74115aab745 | refs/heads/master | 2021-05-14T15:22:10.563149 | 2017-09-11T07:59:18 | 2017-09-11T07:59:18 | 115,991,286 | 1 | 0 | null | 2018-01-02T08:12:01 | 2018-01-02T08:12:00 | null | UTF-8 | C++ | false | false | 1,451 | h | // FloatMenuDoc.h : interface of the CFloatMenuDoc class
//
/////////////////////////////////////////////////////////////////////////////
#if !defined(AFX_FLOATMENUDOC_H__33607166_2BF2_4771_B4BA_E6C21EB61B71__INCLUDED_)
#define AFX_FLOATMENUDOC_H__33607166_2BF2_4771_B4BA_E6C21EB61B71__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
class CFloatMenuDoc : public CDocument
{
protected: // create from serialization only
CFloatMenuDoc();
DECLARE_DYNCREATE(CFloatMenuDoc)
// Attributes
public:
// Operations
public:
// Overrides
// ClassWizard generated virtual function overrides
//{{AFX_VIRTUAL(CFloatMenuDoc)
public:
virtual BOOL OnNewDocument();
virtual void Serialize(CArchive& ar);
//}}AFX_VIRTUAL
// Implementation
public:
virtual ~CFloatMenuDoc();
#ifdef _DEBUG
virtual void AssertValid() const;
virtual void Dump(CDumpContext& dc) const;
#endif
protected:
// Generated message map functions
protected:
//{{AFX_MSG(CFloatMenuDoc)
// NOTE - the ClassWizard will add and remove member functions here.
// DO NOT EDIT what you see in these blocks of generated code !
//}}AFX_MSG
DECLARE_MESSAGE_MAP()
};
/////////////////////////////////////////////////////////////////////////////
//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
#endif // !defined(AFX_FLOATMENUDOC_H__33607166_2BF2_4771_B4BA_E6C21EB61B71__INCLUDED_)
| [
"xiaohuh421@qq.com"
] | xiaohuh421@qq.com |
10475ac7c139b449c819c8039e369240d20ffa76 | dea577b36d0ac4ebbd3b7b0ed36c2738cf4b3462 | /pathfinder.hxx | cc97232df15cf892ac3258438de852c04d48d301 | [
"BSD-2-Clause"
] | permissive | alzwded/school-rsff | cc645fe388ea67cd925f02c11ce2599d397cea17 | 6383a0b3c51bd48e178b3ce089202576173e10b8 | refs/heads/master | 2021-01-23T03:08:22.252058 | 2014-05-20T10:40:05 | 2014-05-20T10:40:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 651 | hxx | #ifndef PATHFINDER_HXX
#define PATHFINDER_HXX
#include "core.hxx"
#include <vector>
#include <utility>
#include <map>
class Path {
public:
typedef std::vector<Edge> Edges_t;
private:
std::vector<Edges_t> path_;
public:
Path& operator++() {
path_.push_back(Edges_t());
return *this;
}
Edges_t& operator[](size_t frame) {
return path_[frame];
}
size_t size() const {
return path_.size();
}
void clear() {
path_.clear();
}
};
namespace Pathfinder {
void SetStartingSensor(Sensor const& s);
Path ComputePath(Sensor::vector const& sensors);
} // namespace
#endif
| [
"alzwded@gmail.com"
] | alzwded@gmail.com |
5a64a21a52e9174954b3d5b8e1d779fcae36d199 | 3b74581630e7f3f9f379b633a8cfa4e622c0dd0b | /Old/Builds/JuceLibraryCode/modules/juce_gui_basics/filebrowser/juce_FilenameComponent.cpp | 47a67c3117873a80aad019cb5ab848e4973c91f2 | [
"BSD-2-Clause"
] | permissive | stpope/CSL6 | eb3aee1a4bd13d6cb8e6985949bbfb12d4cd3782 | 5855a91fe8fc928753d180d8d5260a3ed3a1460b | refs/heads/master | 2022-11-23T17:43:17.957644 | 2020-08-03T18:31:30 | 2020-08-03T18:31:30 | 256,130,061 | 35 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 7,365 | cpp | /*
==============================================================================
This file is part of the JUCE library - "Jules' Utility Class Extensions"
Copyright 2004-11 by Raw Material Software Ltd.
------------------------------------------------------------------------------
JUCE can be redistributed and/or modified under the terms of the GNU General
Public License (Version 2), as published by the Free Software Foundation.
A copy of the license is included in the JUCE distribution, or can be found
online at www.gnu.org/licenses.
JUCE 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.
------------------------------------------------------------------------------
To release a closed-source product which uses JUCE, commercial licenses are
available: visit www.rawmaterialsoftware.com/juce for more information.
==============================================================================
*/
FilenameComponent::FilenameComponent (const String& name,
const File& currentFile,
const bool canEditFilename,
const bool isDirectory,
const bool isForSaving,
const String& fileBrowserWildcard,
const String& enforcedSuffix_,
const String& textWhenNothingSelected)
: Component (name),
maxRecentFiles (30),
isDir (isDirectory),
isSaving (isForSaving),
isFileDragOver (false),
wildcard (fileBrowserWildcard),
enforcedSuffix (enforcedSuffix_)
{
addAndMakeVisible (&filenameBox);
filenameBox.setEditableText (canEditFilename);
filenameBox.addListener (this);
filenameBox.setTextWhenNothingSelected (textWhenNothingSelected);
filenameBox.setTextWhenNoChoicesAvailable (TRANS ("(no recently selected files)"));
setBrowseButtonText ("...");
setCurrentFile (currentFile, true);
}
FilenameComponent::~FilenameComponent()
{
}
//==============================================================================
void FilenameComponent::paintOverChildren (Graphics& g)
{
if (isFileDragOver)
{
g.setColour (Colours::red.withAlpha (0.2f));
g.drawRect (0, 0, getWidth(), getHeight(), 3);
}
}
void FilenameComponent::resized()
{
getLookAndFeel().layoutFilenameComponent (*this, &filenameBox, browseButton);
}
void FilenameComponent::setBrowseButtonText (const String& newBrowseButtonText)
{
browseButtonText = newBrowseButtonText;
lookAndFeelChanged();
}
void FilenameComponent::lookAndFeelChanged()
{
browseButton = nullptr;
addAndMakeVisible (browseButton = getLookAndFeel().createFilenameComponentBrowseButton (browseButtonText));
browseButton->setConnectedEdges (Button::ConnectedOnLeft);
resized();
browseButton->addListener (this);
}
void FilenameComponent::setTooltip (const String& newTooltip)
{
SettableTooltipClient::setTooltip (newTooltip);
filenameBox.setTooltip (newTooltip);
}
void FilenameComponent::setDefaultBrowseTarget (const File& newDefaultDirectory)
{
defaultBrowseFile = newDefaultDirectory;
}
void FilenameComponent::buttonClicked (Button*)
{
#if JUCE_MODAL_LOOPS_PERMITTED
FileChooser fc (isDir ? TRANS ("Choose a new directory")
: TRANS ("Choose a new file"),
getCurrentFile() == File::nonexistent ? defaultBrowseFile
: getCurrentFile(),
wildcard);
if (isDir ? fc.browseForDirectory()
: (isSaving ? fc.browseForFileToSave (false)
: fc.browseForFileToOpen()))
{
setCurrentFile (fc.getResult(), true);
}
#else
jassertfalse; // needs rewriting to deal with non-modal environments
#endif
}
void FilenameComponent::comboBoxChanged (ComboBox*)
{
setCurrentFile (getCurrentFile(), true);
}
bool FilenameComponent::isInterestedInFileDrag (const StringArray&)
{
return true;
}
void FilenameComponent::filesDropped (const StringArray& filenames, int, int)
{
isFileDragOver = false;
repaint();
const File f (filenames[0]);
if (f.exists() && (f.isDirectory() == isDir))
setCurrentFile (f, true);
}
void FilenameComponent::fileDragEnter (const StringArray&, int, int)
{
isFileDragOver = true;
repaint();
}
void FilenameComponent::fileDragExit (const StringArray&)
{
isFileDragOver = false;
repaint();
}
//==============================================================================
File FilenameComponent::getCurrentFile() const
{
File f (filenameBox.getText());
if (enforcedSuffix.isNotEmpty())
f = f.withFileExtension (enforcedSuffix);
return f;
}
void FilenameComponent::setCurrentFile (File newFile,
const bool addToRecentlyUsedList,
const bool sendChangeNotification)
{
if (enforcedSuffix.isNotEmpty())
newFile = newFile.withFileExtension (enforcedSuffix);
if (newFile.getFullPathName() != lastFilename)
{
lastFilename = newFile.getFullPathName();
if (addToRecentlyUsedList)
addRecentlyUsedFile (newFile);
filenameBox.setText (lastFilename, true);
if (sendChangeNotification)
triggerAsyncUpdate();
}
}
void FilenameComponent::setFilenameIsEditable (const bool shouldBeEditable)
{
filenameBox.setEditableText (shouldBeEditable);
}
StringArray FilenameComponent::getRecentlyUsedFilenames() const
{
StringArray names;
for (int i = 0; i < filenameBox.getNumItems(); ++i)
names.add (filenameBox.getItemText (i));
return names;
}
void FilenameComponent::setRecentlyUsedFilenames (const StringArray& filenames)
{
if (filenames != getRecentlyUsedFilenames())
{
filenameBox.clear();
for (int i = 0; i < jmin (filenames.size(), maxRecentFiles); ++i)
filenameBox.addItem (filenames[i], i + 1);
}
}
void FilenameComponent::setMaxNumberOfRecentFiles (const int newMaximum)
{
maxRecentFiles = jmax (1, newMaximum);
setRecentlyUsedFilenames (getRecentlyUsedFilenames());
}
void FilenameComponent::addRecentlyUsedFile (const File& file)
{
StringArray files (getRecentlyUsedFilenames());
if (file.getFullPathName().isNotEmpty())
{
files.removeString (file.getFullPathName(), true);
files.insert (0, file.getFullPathName());
setRecentlyUsedFilenames (files);
}
}
//==============================================================================
void FilenameComponent::addListener (FilenameComponentListener* const listener)
{
listeners.add (listener);
}
void FilenameComponent::removeListener (FilenameComponentListener* const listener)
{
listeners.remove (listener);
}
void FilenameComponent::handleAsyncUpdate()
{
Component::BailOutChecker checker (this);
listeners.callChecked (checker, &FilenameComponentListener::filenameComponentChanged, this);
}
| [
"stephen@heaveneverywhere.com"
] | stephen@heaveneverywhere.com |
2f118bab2610c398369a55f7ae6f5270d2aedaf0 | f70c3429485713e6d81979f3829b68ab28ea371a | /src/tcp/Socket.cpp | 086482870e85d81950ffa41e95b6d3c8517a8b38 | [] | no_license | spineight/highload | 1bc4d47fb66f8db04cb72af4953382f21f6b3f7e | 36a442bcc94952dd191d1d90f815a69ff7e38b95 | refs/heads/master | 2021-06-23T21:17:29.563383 | 2017-09-05T04:17:02 | 2017-09-05T04:17:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,213 | cpp | #include <sys/types.h>
#include <sys/un.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <common/Profiler.h>
#include "Socket.h"
namespace tcp
{
Socket::Socket(int sock):
SocketWrapper(sock)
{}
Socket::~Socket()
{
//shutdown();
close();
}
Socket::Socket(const SocketWrapper& rhs):
SocketWrapper(rhs)
{}
SocketWrapper::SocketWrapper(int sock):
sock_(sock)
{}
SocketWrapper::SocketWrapper(SocketWrapper&& rhs):
sock_(rhs.sock_)
{
rhs.sock_ = -1;
}
SocketWrapper& SocketWrapper::operator=(SocketWrapper&& rhs)
{
sock_ = rhs.sock_;
rhs.sock_ = -1;
return *this;
}
int SocketWrapper::create()
{
if (sock_ >= 0) {
return sock_;
}
int tmp_sock = ::socket(AF_INET, SOCK_STREAM, 0);
sock_ = tmp_sock;
return sock_;
}
int SocketWrapper::bind(const uint16_t port)
{
if (sock_ < 0) {
return -1;
}
struct sockaddr_in addr = {0};
addr.sin_family = AF_INET;
addr.sin_port = htons(port);
addr.sin_addr.s_addr = htonl(INADDR_ANY);
return ::bind(sock_, (struct sockaddr *)&addr, sizeof(addr));
}
int SocketWrapper::listen(int backlog)
{
return ::listen(sock_, backlog);
}
SocketWrapper SocketWrapper::accept()
{
START_PROFILER("accept");
return ::accept(sock_, nullptr, nullptr);
}
SocketWrapper SocketWrapper::accept4(int flags)
{
START_PROFILER("accept4");
return ::accept4(sock_, nullptr, nullptr, flags);
}
int SocketWrapper::shutdown(int how)
{
START_PROFILER("shutdown");
return ::shutdown(sock_, how);
}
int SocketWrapper::close()
{
START_PROFILER("close");
int res = ::close(sock_);
sock_ = -1;
return res;
}
int SocketWrapper::send(const char* buffer, size_t size, int flags)
{
START_PROFILER("send");
return ::send(sock_, buffer, size, flags);
}
int SocketWrapper::recv(char* buffer, size_t size, int flags)
{
START_PROFILER("recv");
return ::recv(sock_, buffer, size, flags);
}
int SocketWrapper::setsockopt(int level, int optname, const void *optval, socklen_t optlen)
{
return ::setsockopt(sock_, level, optname, optval, optlen);
}
int SocketWrapper::getsockopt(int level, int optname, void *optval, socklen_t *optlen)
{
return ::getsockopt(sock_, level, optname, optval, optlen);
}
} // namespace tcp | [
"egor@retailnext.net"
] | egor@retailnext.net |
8b9ee2bef6b17be2963d2b2cfda597d449d056fa | 1ad2232b1d415f8ac20ed29dcd3624d0f21ee217 | /cperlmulti.cpp | fe127538f450464cd01dee544b1a5a538ab06393 | [] | no_license | shurshur/vh_perl | fd4830a357791e6d4f26f355f8b4e004b0e88407 | cb899bb1b66ed666901cc981411dd5fe42ad3964 | refs/heads/master | 2016-09-05T20:23:37.360258 | 2013-05-25T15:41:38 | 2013-05-25T15:41:38 | 2,302,711 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,696 | cpp | /**************************************************************************
* Copyright (C) 2011 by Shurik *
* shurik at sbin.ru *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
#include <iostream>
#include <vector>
#include "cperlmulti.h"
#include "cperlinterpreter.h"
namespace nVerliHub {
namespace nPerlPlugin {
cPerlMulti::cPerlMulti()
{
}
cPerlMulti::~cPerlMulti()
{
for(std::vector<cPerlInterpreter*>::const_iterator i = mPerl.begin(); i != mPerl.end(); i++)
delete *i;
}
int cPerlMulti::Parse(int argc, char*argv[]) {
cPerlInterpreter *perl = new cPerlInterpreter();
int ret = perl->Parse(argc, argv);
mPerl.push_back(perl);
return ret;
}
bool cPerlMulti::CallArgv(const char *Function, char * Args [] ) {
int s=0;
for(std::vector<cPerlInterpreter*>::const_iterator i = mPerl.begin(); i != mPerl.end(); i++) {
// Push scriptname and cPerlInterpreter (required for vh::ScriptCommand)
mScriptStack.push_back((*i)->mScriptName);
mIntStack.push_back(*i);
s++;
bool ret = (*i)->CallArgv(Function, Args);
//std::cerr << "Call " << Function << " " << Args[0] << " " << " on script " << (*i)->mScriptName << " returns " << ret << std::endl;
mScriptStack.pop_back();
mIntStack.pop_back();
// Restore previous context for vh::ScriptCommand
if(mIntStack.size()) mIntStack.back()->SetMyContext();
if(!ret) return false;
}
return true;
}
}; // namespace nPerlPlugin
}; // namespace nVerlihub
| [
"zeinalov@nm.ru"
] | zeinalov@nm.ru |
4e957464a51fe79b2434b9817b646175836ab63f | 2e81f94516d55c445ab8cb005b245a22fac89d62 | /simutrans/utils/log.cc | 3f1f84977ea7f1cc7848a52dab800a9793315a42 | [] | no_license | tmndroid/android | daed70bc4948628721476e8642907b33f64fda53 | a610a53f812e753d78b0d4f1e1c45346c7543468 | refs/heads/master | 2021-01-10T02:40:07.827135 | 2013-03-02T07:44:52 | 2013-03-02T07:44:52 | 8,517,329 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 10,068 | cc | /*
* Copyright (c) 1997 - 2001 Hj. Malthaner
*
* This file is part of the Simutrans project under the artistic license.
*/
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <stdarg.h>
#ifdef SYSLOG
#include <syslog.h>
#endif //SYSLOG
#include "log.h"
#include "../simdebug.h"
#include "../simsys.h"
#ifdef MAKEOBJ
#define debuglevel (3)
#else
#ifdef NETTOOL
#define debuglevel (0)
#else
#define debuglevel (umgebung_t::verbose_debug)
// for display ...
#include "../gui/messagebox.h"
#include "../simgraph.h"
#include "../simwin.h"
#include "../dataobj/umgebung.h"
#endif
#endif
/**
* writes important messages to stdout/logfile
* use instead of printf()
*/
void log_t::important(const char* format, ...)
{
va_list argptr;
va_start( argptr, format );
if ( log ) {
// If logfile, output there
vfprintf( log, format, argptr );
fprintf( log, "\n" );
if ( force_flush ) { fflush( log ); }
}
va_end(argptr);
#ifdef SYSLOG
va_start( argptr, format );
if ( syslog ) {
// Send to syslog if available
vsyslog( LOG_NOTICE, format, argptr );
}
va_end(argptr);
#endif //SYSLOG
va_start( argptr, format );
// Print to stdout for important messages
vfprintf( stdout, format, argptr );
fprintf( stdout, "\n" );
if ( force_flush ) { fflush( stdout ); }
va_end( argptr );
}
/**
* writes a debug message into the log.
* @author Hj. Malthaner
*/
void log_t::debug(const char *who, const char *format, ...)
{
if(log_debug && debuglevel==4) {
va_list argptr;
va_start(argptr, format);
if( log ) { /* nur loggen wenn schon ein log */
fprintf(log ,"Debug: %s:\t",who); /* geoeffnet worden ist */
vfprintf(log, format, argptr);
fprintf(log,"\n");
if( force_flush ) {
fflush(log);
}
}
va_end(argptr);
va_start(argptr, format);
if( tee ) { /* nur loggen wenn schon ein log */
fprintf(tee, "Debug: %s:\t",who); /* geoeffnet worden ist */
vfprintf(tee, format, argptr);
fprintf(tee,"\n");
}
va_end(argptr);
#ifdef SYSLOG
va_start( argptr, format );
if ( syslog ) {
// Replace with dynamic memory allocation
char buffer[256];
sprintf( buffer, "Debug: %s\t%s", who, format );
vsyslog( LOG_DEBUG, buffer, argptr );
}
va_end( argptr );
#endif //SYSLOG
}
}
/**
* writes a message into the log.
* @author Hj. Malthaner
*/
void log_t::message(const char *who, const char *format, ...)
{
if(debuglevel>2) {
va_list argptr;
va_start(argptr, format);
if( log ) { /* nur loggen wenn schon ein log */
fprintf(log ,"Message: %s:\t",who); /* geoeffnet worden ist */
vfprintf(log, format, argptr);
fprintf(log,"\n");
if( force_flush ) {
fflush(log);
}
}
va_end(argptr);
va_start(argptr, format);
if( tee ) { /* nur loggen wenn schon ein log */
fprintf(tee, "Message: %s:\t",who); /* geoeffnet worden ist */
vfprintf(tee, format, argptr);
fprintf(tee,"\n");
}
va_end(argptr);
#ifdef SYSLOG
va_start( argptr, format );
if ( syslog ) {
// Replace with dynamic memory allocation
char buffer[256];
sprintf( buffer, "Message: %s\t%s", who, format );
vsyslog( LOG_INFO, buffer, argptr );
}
va_end( argptr );
#endif //SYSLOG
}
}
/**
* writes a warning into the log.
* @author Hj. Malthaner
*/
void log_t::warning(const char *who, const char *format, ...)
{
if(debuglevel>1) {
va_list argptr;
va_start(argptr, format);
if( log ) { /* nur loggen wenn schon ein log */
fprintf(log ,"Warning: %s:\t",who); /* geoeffnet worden ist */
vfprintf(log, format, argptr);
fprintf(log,"\n");
if( force_flush ) {
fflush(log);
}
}
va_end(argptr);
va_start(argptr, format);
if( tee ) { /* nur loggen wenn schon ein log */
fprintf(tee, "Warning: %s:\t",who); /* geoeffnet worden ist */
vfprintf(tee, format, argptr);
fprintf(tee,"\n");
}
va_end(argptr);
#ifdef SYSLOG
va_start( argptr, format );
if ( syslog ) {
// Replace with dynamic memory allocation
char buffer[256];
sprintf( buffer, "Warning: %s\t%s", who, format );
vsyslog( LOG_WARNING, buffer, argptr );
}
va_end( argptr );
#endif //SYSLOG
}
}
/**
* writes an error into the log.
* @author Hj. Malthaner
*/
void log_t::error(const char *who, const char *format, ...)
{
if(debuglevel>0) {
va_list argptr;
va_start(argptr, format);
if( log ) { /* nur loggen wenn schon ein log */
fprintf(log ,"ERROR: %s:\t",who); /* geoeffnet worden ist */
vfprintf(log, format, argptr);
fprintf(log,"\n");
if( force_flush ) {
fflush(log);
}
fprintf(log ,"For help with this error or to file a bug report please see the Simutrans forum:\n");
fprintf(log ,"http://forum.simutrans.com\n");
}
va_end(argptr);
va_start(argptr, format);
if( tee ) { /* nur loggen wenn schon ein log */
fprintf(tee, "ERROR: %s:\t",who); /* geoeffnet worden ist */
vfprintf(tee, format, argptr);
fprintf(tee,"\n");
fprintf(tee ,"For help with this error or to file a bug report please see the Simutrans forum:\n");
fprintf(tee ,"http://forum.simutrans.com\n");
}
va_end(argptr);
#ifdef SYSLOG
va_start( argptr, format );
if ( syslog ) {
// Replace with dynamic memory allocation
char buffer[256];
sprintf( buffer, "ERROR: %s\t%s", who, format );
vsyslog( LOG_ERR, buffer, argptr );
}
va_end( argptr );
#endif //SYSLOG
}
}
/**
* writes an error into the log, aborts the program.
* @author Hj. Malthaner
*/
void log_t::fatal(const char *who, const char *format, ...)
{
va_list argptr;
va_start(argptr, format);
static char formatbuffer[512];
sprintf( formatbuffer, "FATAL ERROR: %s - %s\nAborting program execution ...\n\nFor help with this error or to file a bug report please see the Simutrans forum:\nhttp://forum.simutrans.com\n", who, format );
static char buffer[8192];
int n = sprintf( buffer, formatbuffer, argptr );
if ( log ) {
fputs( buffer, log );
if ( force_flush ) {
fflush( log );
}
}
if ( tee ) {
fputs( buffer, tee );
}
#ifdef SYSLOG
if ( syslog ) {
::syslog( LOG_ERR, buffer );
}
#endif //SYSLOG
if ( tee == NULL && log == NULL && tag == NULL ) {
fputs( buffer, stderr );
}
va_end(argptr);
#if defined MAKEOBJ || defined NETTOOL
// no display available
puts( buffer );
#else
# ifdef DEBUG
int old_level = umgebung_t::verbose_debug;
# endif
umgebung_t::verbose_debug = 0; // no more window concerning messages
if(is_display_init()) {
// show notification
destroy_all_win( true );
strcpy( buffer+n+1, "PRESS ANY KEY\n" );
news_img* sel = new news_img(buffer,IMG_LEER);
sel->extend_window_with_component( NULL, koord(display_get_width()/2,120) );
koord xy( display_get_width()/2 - sel->get_fenstergroesse().x/2, display_get_height()/2 - sel->get_fenstergroesse().y/2 );
event_t ev;
create_win( xy.x, xy.y, sel, w_info, magic_none );
while(win_is_top(sel)) {
// do not move, do not close it!
dr_sleep(50);
dr_prepare_flush();
sel->zeichnen( xy, sel->get_fenstergroesse() );
dr_flush();
display_poll_event(&ev);
// main window resized
check_pos_win(&ev);
if(ev.ev_class==EVENT_KEYBOARD) {
break;
}
}
}
else {
// use OS means, if there
dr_fatal_notify(buffer);
}
#ifdef DEBUG
if (old_level > 4) {
// generate a division be zero error, if the user request it
static int make_this_a_division_by_zero = 0;
printf("%i", 15 / make_this_a_division_by_zero);
make_this_a_division_by_zero &= 0xFF;
}
#endif
#endif
abort();
}
void log_t::vmessage(const char *what, const char *who, const char *format, va_list args )
{
if(debuglevel>0) {
va_list args2;
#ifdef __va_copy
__va_copy(args2, args);
#else
// HACK: this is undefined behavior but should work ... hopefully ...
args2 = args;
#endif
if( log ) { /* nur loggen wenn schon ein log */
fprintf(log ,"%s: %s:\t", what, who); /* geoeffnet worden ist */
vfprintf(log, format, args);
fprintf(log,"\n");
if( force_flush ) {
fflush(log);
}
}
if( tee ) { /* nur loggen wenn schon ein log */
fprintf(tee,"%s: %s:\t", what, who); /* geoeffnet worden ist */;
vfprintf(tee, format, args2);
fprintf(tee,"\n");
}
va_end(args2);
}
}
// create a logfile for log_debug=true
log_t::log_t( const char *logfilename, bool force_flush, bool log_debug, bool log_console, const char *greeting, const char* syslogtag )
{
log = NULL;
syslog = false;
this->force_flush = force_flush; /* wenn true wird jedesmal geflusht */
/* wenn ein Eintrag ins log geschrieben wurde */
this->log_debug = log_debug;
if(logfilename == NULL) {
log = NULL; /* kein log */
tee = NULL;
} else if(strcmp(logfilename,"stdio") == 0) {
log = stdout;
tee = NULL;
} else if(strcmp(logfilename,"stderr") == 0) {
log = stderr;
tee = NULL;
#ifdef SYSLOG
} else if( strcmp( logfilename, "syslog" ) == 0 ) {
syslog = true;
if ( syslogtag ) {
tag = syslogtag;
// Set up syslog
openlog( tag, LOG_PID, LOG_DAEMON );
}
log = NULL;
tee = NULL;
#endif //SYSLOG
} else {
log = fopen(logfilename,"wb");
if(log == NULL) {
fprintf(stderr,"log_t::log_t: can't open file '%s' for writing\n", logfilename);
}
tee = stderr;
}
if (!log_console) {
tee = NULL;
}
if( greeting ) {
if( log ) {
fputs( greeting, log );
// message("log_t::log_t","Starting logging to %s", logfilename);
}
if( tee ) {
fputs( greeting, tee );
}
#ifdef SYSLOG
if ( syslog ) {
::syslog( LOG_NOTICE, greeting );
}
#endif //SYSLOG
}
}
void log_t::close()
{
message("log_t::~log_t","stop logging, closing log file");
if( log ) {
fclose(log);
log = NULL;
}
}
// close all logs during cleanup
log_t::~log_t()
{
if( log ) {
close();
}
}
| [
"none@gmail.com"
] | none@gmail.com |
f1b9f742b45037de0ea69cee3e37682223d74297 | 5e9d97b7ebb378a351c77f805cf467a314295e57 | /B. All About The Base.cpp | c964ceea377ce4e26692eebd88abf1d38ee25e23 | [] | no_license | mjannat/Online-Judge-Problems-Solution-in-Cpp | bd62157ee39ebc997f8cdbacd26abb0401aea600 | ce0defaee9c2bffbc3e5d5b67b0a2ae529507b80 | refs/heads/master | 2020-12-20T11:36:07.916260 | 2020-04-28T10:04:24 | 2020-04-28T10:04:24 | 236,060,998 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,140 | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int test,cs = 1;
scanf("%d",&test);
while(test--)
{
int n,base;
string str = "";
scanf("%d %d",&base,&n);
if(n == 0) str = '0';
else if(base < 10)
{
while(n > 0)
{
str += (n % base) + '0';
n /= base;
}
}
else if(base > 9)
{
while(n > 0)
{
int val = n % base;
if(val < 10)str += (n % base) + '0';
else
{
if(val == 10)str +='A';
else if(val == 11)str += 'B';
else if(val == 12)str += 'C';
else if(val == 13)str += 'D';
else if(val == 14)str += 'E';
else if(val == 15)str += 'F';
}
n /= base;
}
}
reverse(str.begin(),str.end());
printf("Case %d: ",cs++);
cout << str;
printf("\n");
}
}
| [
"noreply@github.com"
] | noreply@github.com |
195a18657ee0f10bb2fa85ea1251033dfac9d905 | 4e52fde73d3efb61490efe9bb250b59b8f0e7d9d | /source/uwp/Renderer/lib/AdaptiveSubmitActionParser.h | 237157f701b34935890f9c2fd5907da10e9ad764 | [
"MIT"
] | permissive | wdynju/AdaptiveCards | fcc13d3bb483344c56224adce948db6a4446cce3 | e0853bc161348f10532581c09ac594c0adc375e0 | refs/heads/master | 2020-04-16T13:22:26.385348 | 2019-02-25T05:17:59 | 2019-02-26T01:57:04 | 165,624,155 | 1 | 0 | MIT | 2019-01-14T08:30:23 | 2019-01-14T08:30:23 | null | UTF-8 | C++ | false | false | 1,090 | h | #pragma once
#include "AdaptiveCards.Rendering.Uwp.h"
namespace AdaptiveNamespace
{
class AdaptiveSubmitActionParser
: public Microsoft::WRL::RuntimeClass<Microsoft::WRL::RuntimeClassFlags<Microsoft::WRL::RuntimeClassType::WinRtClassicComMix>, ABI::AdaptiveNamespace::IAdaptiveActionParser>
{
AdaptiveRuntime(AdaptiveSubmitActionParser);
public:
HRESULT RuntimeClassInitialize() noexcept;
IFACEMETHODIMP FromJson(_In_ ABI::Windows::Data::Json::IJsonObject* jsonObject,
_In_ ABI::AdaptiveNamespace::IAdaptiveElementParserRegistration* elementParserRegistration,
_In_ ABI::AdaptiveNamespace::IAdaptiveActionParserRegistration* actionParserRegistration,
_In_ ABI::Windows::Foundation::Collections::IVector<ABI::AdaptiveNamespace::AdaptiveWarning*>* adaptiveWarnings,
_COM_Outptr_ ABI::AdaptiveNamespace::IAdaptiveActionElement** element) noexcept override;
};
ActivatableClass(AdaptiveSubmitActionParser);
}
| [
"noreply@github.com"
] | noreply@github.com |
7fa5e170060bd000b69dc42cf93b65c813922554 | 0022ef7abce11fd355f11d61d7cecbea2fd66798 | /dataCollection/arduino/lib/SPMSatRx/SPMSatRx.h | bc150dcf9a9ff6457495649012825e29bda68c15 | [] | no_license | fynsta/Intelliplane | 525843148e0f07141154c1dc65c0a771bb0886bb | b6a8107486a0a2a29a5b0c273ceaacdb147215f9 | refs/heads/master | 2022-12-21T06:29:05.083438 | 2020-10-05T11:35:16 | 2020-10-05T11:35:16 | 284,273,996 | 4 | 0 | null | 2020-08-01T17:16:09 | 2020-08-01T14:18:19 | C++ | UTF-8 | C++ | false | false | 3,172 | h | /*
Reciever library for Spektrum-comatible satellite recievers
Author: Ole Petersen
Email: peteole2707@gmail.com
Wireing:
Connect the power cables to 3.3V (orange) and GND (black). The grey cable must be connected to the RX channel of any serial port.
Binding procedure:
Right after startup, a few pulses must be sent to the rx via its data cable to make it enter bind mode. Depending on the number of pulses it uses the following modes:
DSMX Bind Modes:
Pulses Mode Protocol Type
7 Internal DSMx 22ms
8 External DSMx 22ms
9 Internal DSMx 11ms
10 External DSMx 11ms
DSM2 Bind Modes (not recommended):
Pulses Mode Protocol Type
3 Internal DSM2 22ms
4 External DSM2 22ms
5 Internal DSM2 11ms
6 External DSM2 11ms
Recieving data:
Every 22 or 11ms a data package is sent with a baud rate of 115200bps. It consists of 16 bytes. The first two are metadata and the last 14 contain the channel value information.
Information about one channel are coded into two bytes:
metadata channel information
xx xx xx xx xx xx xx xx
The channel values are not necessarily in the right order, so each channel data package consisting of two bytes contains the channel ID and its value. The data format depends on the binding type:
DSM2:
The two bytes contain 16 bits. Bits 0-9 encode the channel position and bits 10-15 the channel ID:
servo position channel ID
xxxxxxxxxx xxxxxx
Both values are binary integer numbers, meaning that there are 2^10=1024 possible servo positions and 2^6=64 possible channels.
DSMX:
The two bytes contain 16 bits. Bits 0-10 encode the channel position, bits 11-14 the channel ID and bit 16 sth called "servo phase", which you can ignore.
servo position channel ID Servo phase
xxxxxxxxxxx xxxx x
Both values are binary integer numbers, meaning that there are 2^11=2048 possible servo positions and 2^4=16 possible channels.
Note that these data formats do not necessarily correspond to the selected mode even though they should, so if you only get correct values for the throttle, just try selecting the other data format.
*/
#ifndef SPM_SAT_RX_H
#define SPM_SAT_RX_H
#include <Arduino.h>
#include "RX.h"
#define NUM_OF_BIND_PULSES 9
enum ProtocolMode
{
DSM2_22 = 3,
DSM2_11 = 5,
DSMX_22 = 7,
DSMX_11 = 9
};
enum DataFormat
{
DSM2,
DSMX
};
class SPMSatRx : public RX
{
public:
SPMSatRx(int pin, Stream *input, int numOfChannels, ProtocolMode protocolMode = ProtocolMode::DSMX_11, DataFormat dataFormat = DataFormat::DSMX);
void bind();
bool read();
float getChannel(int channelId);
const int numOfChannels;
private:
ProtocolMode protocolMode;
DataFormat dataFormat;
class DSMXServoValue
{
public:
static uint8_t getChannel(const uint16_t &value);
static float getValue(const uint16_t &value);
};
class DSM2ServoValue
{
public:
static uint8_t getChannel(const uint16_t &value);
static float getValue(const uint16_t &value);
};
int pin;
Stream *input;
bool getTrans();
short inData[16];
uint8_t inByte;
unsigned long time;
float *channelValues;
};
#endif | [
"peteole2707@gmail.com"
] | peteole2707@gmail.com |
e93dafa3fc0c8faaa09155fa3330812d805b0d85 | 385cb811d346a4d7a285fc087a50aaced1482851 | /codeforces/1409/D.cpp | 5348632c5be863dbb79bd4db1ee063643ed2c867 | [] | no_license | NoureldinYosri/competitive-programming | aa19f0479420d8d1b10605536e916f0f568acaec | 7739344404bdf4709c69a97f61dc3c0b9deb603c | refs/heads/master | 2022-11-22T23:38:12.853482 | 2022-11-10T20:32:28 | 2022-11-10T20:32:28 | 40,174,513 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,634 | cpp | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define loop(i,n) for(int i = 0;i < (n);i++)
#define all(A) A.begin(),A.end()
#define pb push_back
#define mp make_pair
#define sz(A) ((int)A.size())
typedef std::vector<int> vi;
typedef std::pair<int,int> pi;
typedef std::vector<pi> vp;
typedef long long ll;
#define popcnt(x) __builtin_popcount(x)
#define LSOne(x) ((x) & (-(x)))
#define print(A,t) cerr << #A << ": "; copy(all(A),ostream_iterator<t>(cerr," " )); cerr << endl
#define prArr(A,n,t) cerr << #A << ": "; copy(A,A + n,ostream_iterator<t>(cerr," " )); cerr << endl
#define PRESTDIO() cin.tie(0),cerr.tie(0),ios_base::sync_with_stdio(0)
#define what_is(x) cerr << #x << " is " << x << endl
#define bit_lg(x) (assert(x > 0),__builtin_ffsll(x) - 1)
const double PI = acos(-1);
template<class A,class B>
std::ostream& operator << (std::ostream& st,const std::pair<A,B> p) {
st << "(" << p.first << ", " << p.second << ")";
return st;
}
using namespace std;
void tc(){
ll n; int ts;
scanf("%lld %d", &n, &ts);
string N = "0" + to_string(n);
int s = 0;
for(char c : N) s += c - '0';
if(s <= ts) {
puts("0");
} else {
ll ans = 0;
ll p10 = 1;
for(int i = sz(N)-1; i > 0; i--, p10 *= 10){
int d = N[i] - '0';
ans += (10 - d)*p10;
N[i] = '0';
s = 0;
for(int j = i-1; j >= 0; j--){
if(N[j] == '9') N[j] = '0';
else {
N[j]++;
break;
}
}
loop(j, i) s += N[j] - '0';
if(s <= ts){
printf("%lld\n", ans);
return;
}
}
assert(0);
}
}
int main(){
#ifdef HOME
freopen("in.in", "r", stdin);
#endif
int T; scanf("%d", &T);
while(T--) tc();
return 0;
}
| [
"noureldinyosri@gmail.com"
] | noureldinyosri@gmail.com |
7059a5aa9030f39348318df3aeda019794c7af16 | abf33a8ac46fd7d18e4055ca34f6d10cd3e0c588 | /src/fix/fix_parser.hxx | f18addf5aaa412dd229d5557d714b4f1a8104de0 | [
"MIT"
] | permissive | garywlx/fix2xml | 1377e0b8c9e3bd5afa5ed8c207e5559046c894a3 | fa781b747a8e40ed4c2d3dee8294fb51654f7428 | refs/heads/master | 2021-09-22T07:32:29.032591 | 2018-09-06T13:02:11 | 2018-09-06T13:02:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,266 | hxx | // MIT License
//
// Copyright 2018 Abdelkader Amar
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#pragma once
#include "fix_component_parser.hxx"
#include "fix_dico_container.hxx"
#include "fix_field_parser.hxx"
#include "fix_message_parser.hxx"
#include <xercesc/framework/psvi/XSConstants.hpp>
#include <xercesc/util/XercesVersion.hpp>
#include <memory>
namespace XERCES_CPP_NAMESPACE {
class XercesDOMParser;
class DOMElement;
}
namespace fix2xml {
class fix_parser {
public:
fix_parser();
~fix_parser();
bool parse(const char *fix_dico_filename);
bool parse(const char *fix_dico_filename, const bool messages_parsing,
const bool components_parsing, const bool field_parsing);
std::shared_ptr<fix_dico_container> dico() { return _fix_dico; }
protected:
void parse_messages(XERCES_CPP_NAMESPACE::DOMElement *messages_elt);
void parse_components(XERCES_CPP_NAMESPACE::DOMElement *components_elt);
void parse_fields(XERCES_CPP_NAMESPACE::DOMElement *fields_elt);
XERCES_CPP_NAMESPACE::XercesDOMParser *_parser;
std::shared_ptr<fix_dico_container> _fix_dico;
fix_message_parser _message_parser;
fix_component_parser _component_parser;
fix_field_parser _field_parser;
private:
};
};
| [
"abdelkader.amar@gmail.com"
] | abdelkader.amar@gmail.com |
4aac01871d58f82cfcb9457b56505ba6c6ab9c85 | b6585a17a40d458c040d4811b79a42c64f6ce5f2 | /owRender/RenderDevice.h | 67bc3d7f38c34c8d2add0548050c917dbc1d1222 | [
"Apache-2.0"
] | permissive | Tormund/OpenWow | 1409e22a5a0530b7aab1ec12c318a29718398f2e | 44a554bf3b55b939ba64cd63363fdb64cf28131e | refs/heads/master | 2021-05-04T14:38:51.863688 | 2017-11-19T18:50:38 | 2017-11-19T18:50:38 | 120,205,859 | 2 | 0 | null | 2018-02-04T17:18:33 | 2018-02-04T17:18:33 | null | UTF-8 | C++ | false | false | 12,769 | h | #pragma once
#include "GPUTimer.h"
const uint32 MaxNumVertexLayouts = 64;
const uint32 MaxComputeImages = 8;
// ---------------------------------------------------------
// General
// ---------------------------------------------------------
template<class T>
class R_Objects
{
public:
uint32 add(const T &obj)
{
/*if (!_freeList.empty())
{
uint32 index = _freeList.back();
_freeList.pop_back();
_objects[index] = obj;
return index + 1;
}
else
{*/
_objects.push_back(obj);
return (uint32)_objects.size();
/*}*/
}
void remove(uint32 handle)
{
assert1(handle > 0 && handle <= _objects.size());
assert1(find(_freeList.begin(), _freeList.end(), handle - 1) == _freeList.end());
_objects[handle - 1] = T(); // Destruct and replace with default object
_freeList.push_back(handle - 1);
}
T& getRef(uint32 handle)
{
assert1(handle > 0 && handle <= _objects.size());
return _objects[handle - 1];
}
private:
vector< T > _objects;
vector< uint32 > _freeList;
};
#include "RenderEnums.h"
#include "RenderTypes.h"
// =================================================================================================
class RenderDevice
{
public:
RenderDevice();
~RenderDevice();
void initStates();
bool init();
// Vertex layouts
uint32 registerVertexLayout(uint32 numAttribs, R_VertexLayoutAttrib *attribs);
// Rendering
void beginRendering();
uint32 beginCreatingGeometry(uint32 vlObj);
void finishCreatingGeometry(uint32 geoObj);
void setGeomVertexParams(uint32 geoObj, uint32 vbo, R_DataType type, uint32 offset, uint32 stride, bool needNorm = false);
void setGeomIndexParams(uint32 geoObj, uint32 indBuf, R_IndexFormat format);
void destroyGeometry(uint32 &geoObj, bool destroyBindedBuffers);
// Buffers
uint32 createVertexBuffer(uint32 size, const void *data, bool _isDynamic = true);
uint32 createIndexBuffer(uint32 size, const void *data, bool _isDynamic = true);
uint32 createTextureBuffer(R_TextureFormats::List format, uint32 bufSize, const void *data, bool _isDynamic = true);
uint32 createShaderStorageBuffer(uint32 size, const void *data, bool _isDynamic = true);
void destroyBuffer(uint32 &bufObj);
void destroyTextureBuffer(uint32& bufObj);
void updateBufferData(uint32 bufObj, uint32 offset, uint32 size, const void *data);
void* mapBuffer(uint32 geoObj, uint32 bufObj, uint32 offset, uint32 size, R_BufferMappingTypes mapType);
void unmapBuffer(uint32 geoObj, uint32 bufObj);
uint32 getBufferMem() const
{
return _bufferMem;
}
// Textures
uint32 calcTextureSize(R_TextureFormats::List format, int width, int height, int depth);
uint32 createTexture(R_TextureTypes::List type, int width, int height, int depth, R_TextureFormats::List format, bool hasMips, bool genMips, bool compress, bool sRGB);
void uploadTextureData(uint32 texObj, int slice, int mipLevel, const void *pixels);
void destroyTexture(uint32 &texObj);
bool getTextureData(uint32 texObj, int slice, int mipLevel, void *buffer);
void bindImageToTexture(uint32 texObj, void* eglImage);
uint32 getTextureMem() const
{
return _textureMem;
}
// Shaders
uint32 createShader(const char *vertexShaderSrc, const char *fragmentShaderSrc, const char *geometryShaderSrc, const char *tessControlShaderSrc, const char *tessEvaluationShaderSrc, const char *computeShaderSrc);
void destroyShader(uint32 &shaderId);
void bindShader(uint32 shaderId);
int getShaderConstLoc(uint32 shaderId, const char *name);
int getShaderSamplerLoc(uint32 shaderId, const char *name);
int getShaderBufferLoc(uint32 shaderId, const char *name);
void setShaderConst(int loc, R_ShaderConstType type, const void *values, uint32 count = 1);
void setShaderSampler(int loc, uint32 texUnit);
void runComputeShader(uint32 shaderId, uint32 xDim, uint32 yDim, uint32 zDim);
string getShaderLog() const
{
return _shaderLog;
}
// Renderbuffers
uint32 createRenderBuffer(uint32 width, uint32 height, R_TextureFormats::List format, bool depth, uint32 numColBufs, uint32 samples);
void destroyRenderBuffer(uint32 &rbObj);
uint32 getRenderBufferTex(uint32 rbObj, uint32 bufIndex);
void setRenderBuffer(uint32 rbObj);
bool getRenderBufferData(uint32 rbObj, int bufIndex, int *width, int *height, int *compCount, void *dataBuffer, int bufferSize);
void getRenderBufferDimensions(uint32 rbObj, int *width, int *height);
// Queries
uint32 createOcclusionQuery();
void destroyQuery(uint32 queryObj);
void beginQuery(uint32 queryObj);
void endQuery(uint32 queryObj);
uint32 getQueryResult(uint32 queryObj);
// Render Device dependent GPU Timer
GPUTimer* createGPUTimer()
{
return new GPUTimer();
}
// -----------------------------------------------------------------------------
// Commands
// -----------------------------------------------------------------------------
void setViewport(int x, int y, int width, int height)
{
_vpX = x;
_vpY = y;
_vpWidth = width;
_vpHeight = height;
_pendingMask |= PM_VIEWPORT;
}
void setScissorRect(int x, int y, int width, int height)
{
_scX = x;
_scY = y;
_scWidth = width;
_scHeight = height;
_pendingMask |= PM_SCISSOR;
}
void setGeometry(uint32 geoIndex)
{
_curGeometryIndex = geoIndex;
_pendingMask |= PM_GEOMETRY;
}
void setTexture(uint32 slot, uint32 texObj, uint16 samplerState, uint16 usage)
{
assert1(slot < 16);
_texSlots[slot] = R_TexSlot(texObj, samplerState, usage);
_pendingMask |= PM_TEXTURES;
}
void setMemoryBarrier(R_DrawBarriers barrier)
{
_memBarriers = barrier;
_pendingMask |= PM_BARRIER;
}
void setStorageBuffer(uint8 slot, uint32 bufObj)
{
assert1(slot < _maxComputeBufferAttachments && _storageBufs.size() < _maxComputeBufferAttachments);
R_Buffer &buf = _buffers.getRef(bufObj);
_storageBufs.push_back(R_ShaderStorage(slot, buf.glObj));
_pendingMask |= PM_COMPUTE;
}
// Render states
void setColorWriteMask(bool enabled)
{
_newRasterState.renderTargetWriteMask = enabled;
_pendingMask |= PM_RENDERSTATES;
}
void getColorWriteMask(bool &enabled) const
{
enabled = _newRasterState.renderTargetWriteMask;
}
void setFillMode(R_FillMode fillMode)
{
_newRasterState.fillMode = fillMode;
_pendingMask |= PM_RENDERSTATES;
}
void getFillMode(R_FillMode &fillMode) const
{
fillMode = (R_FillMode)_newRasterState.fillMode;
}
void setCullMode(R_CullMode cullMode)
{
_newRasterState.cullMode = cullMode;
_pendingMask |= PM_RENDERSTATES;
}
void getCullMode(R_CullMode &cullMode) const
{
cullMode = (R_CullMode)_newRasterState.cullMode;
}
void setScissorTest(bool enabled)
{
_newRasterState.scissorEnable = enabled;
_pendingMask |= PM_RENDERSTATES;
}
void getScissorTest(bool &enabled) const
{
enabled = _newRasterState.scissorEnable;
}
void setMulisampling(bool enabled)
{
_newRasterState.multisampleEnable = enabled;
_pendingMask |= PM_RENDERSTATES;
}
void getMulisampling(bool &enabled) const
{
enabled = _newRasterState.multisampleEnable;
}
void setAlphaToCoverage(bool enabled)
{
_newBlendState.alphaToCoverageEnable = enabled;
_pendingMask |= PM_RENDERSTATES;
}
void getAlphaToCoverage(bool &enabled) const
{
enabled = _newBlendState.alphaToCoverageEnable;
}
void setBlendMode(bool enabled, R_BlendFunc srcRGBBlendFunc = BS_BLEND_ZERO, R_BlendFunc destRGBBlendFunc = BS_BLEND_ZERO)
{
_newBlendState.blendEnable = enabled;
_newBlendState.srcRGBBlendFunc = srcRGBBlendFunc;
_newBlendState.destRGBBlendFunc = destRGBBlendFunc;
_newBlendState.srcABlendFunc = srcRGBBlendFunc;
_newBlendState.destABlendFunc = destRGBBlendFunc;
_pendingMask |= PM_RENDERSTATES;
}
void setBlendModeEx(bool enabled, R_BlendFunc srcRGBBlendFunc = BS_BLEND_ZERO, R_BlendFunc destRGBBlendFunc = BS_BLEND_ZERO, R_BlendFunc srcABlendFunc = BS_BLEND_ZERO, R_BlendFunc destABlendFunc = BS_BLEND_ZERO)
{
_newBlendState.blendEnable = enabled;
_newBlendState.srcRGBBlendFunc = srcRGBBlendFunc;
_newBlendState.destRGBBlendFunc = destRGBBlendFunc;
_newBlendState.srcABlendFunc = srcABlendFunc;
_newBlendState.destABlendFunc = destABlendFunc;
_pendingMask |= PM_RENDERSTATES;
}
void getBlendMode(bool &enabled, R_BlendFunc &srcRGBBlendFunc, R_BlendFunc &destRGBBlendFunc) const
{
enabled = _newBlendState.blendEnable;
srcRGBBlendFunc = (R_BlendFunc)_newBlendState.srcRGBBlendFunc;
destRGBBlendFunc = (R_BlendFunc)_newBlendState.destRGBBlendFunc;
}
void setDepthMask(bool enabled)
{
_newDepthStencilState.depthWriteMask = enabled;
_pendingMask |= PM_RENDERSTATES;
}
void getDepthMask(bool &enabled) const
{
enabled = _newDepthStencilState.depthWriteMask;
}
void setDepthTest(bool enabled)
{
_newDepthStencilState.depthEnable = enabled;
_pendingMask |= PM_RENDERSTATES;
}
void getDepthTest(bool &enabled) const
{
enabled = _newDepthStencilState.depthEnable;
}
void setDepthFunc(R_DepthFunc depthFunc)
{
_newDepthStencilState.depthFunc = depthFunc;
_pendingMask |= PM_RENDERSTATES;
}
void getDepthFunc(R_DepthFunc &depthFunc) const
{
depthFunc = (R_DepthFunc)_newDepthStencilState.depthFunc;
}
void setTessPatchVertices(uint16 verts)
{
_tessPatchVerts = verts;
_pendingMask |= PM_RENDERSTATES;
}
protected:
bool commitStates(uint32 filter = 0xFFFFFFFF);
void resetStates();
public:
// Draw calls and clears
void clear(uint32 flags = CLR_COLOR_RT0 | CLR_COLOR_RT1 | CLR_COLOR_RT2 | CLR_COLOR_RT3 | CLR_DEPTH, float* colorRGBA = 0x0, float depth = 1.0f);
void draw(R_PrimitiveType primType, uint32 firstVert, uint32 numVerts);
void drawIndexed(R_PrimitiveType primType, uint32 firstIndex, uint32 numIndices, uint32 firstVert, uint32 numVerts, bool _softReset = true);
// WARNING: Modifying internal states may lead to unexpected behavior and/or crashes
const R_Buffer& getBuffer(uint32 bufObj) { return _buffers.getRef(bufObj); }
const R_Texture& getTexture(uint32 texObj) { return _textures.getRef(texObj); }
const R_RenderBuffer& getRenderBuffer(uint32 rbObj) { return _rendBufs.getRef(rbObj); }
protected:
// Buffer helper
inline uint32 createBuffer(uint32 type, uint32 size, const void *data, bool _isDynamic = true);
inline void decreaseBufferRefCount(uint32 bufObj);
// Shader helper
uint32 createShaderProgram(const char *vertexShaderSrc, const char *fragmentShaderSrc, const char *geometryShaderSrc, const char *tessControlShaderSrc, const char *tessEvalShaderSrc, const char *computeShaderSrc);
bool linkShaderProgram(uint32 programObj);
// RenderBuffer helper
void resolveRenderBuffer(uint32 rbObj);
void checkError();
bool applyVertexLayout(R_GeometryInfo &geo);
void applySamplerState(R_Texture &tex);
void applyRenderStates();
protected:
enum RDIPendingMask
{
PM_VIEWPORT = 0x00000001,
//PM_INDEXBUF = 0x00000002,
//PM_VERTLAYOUT = 0x00000004,
PM_TEXTUREBUFFER = 0x00000004,
PM_TEXTURES = 0x00000008,
PM_SCISSOR = 0x00000010,
PM_RENDERSTATES = 0x00000020,
PM_GEOMETRY = 0x00000040,
PM_BARRIER = 0x00000080,
PM_COMPUTE = 0x00000100
};
protected:
R_VertexLayout _vertexLayouts[MaxNumVertexLayouts];
R_Objects< R_Buffer > _buffers;
R_Objects< R_Texture > _textures;
R_Objects< R_TextureBuffer > _textureBuffs;
R_Objects< R_Shader > _shaders;
R_Objects< R_RenderBuffer > _rendBufs;
R_Objects< R_GeometryInfo > _vaos;
vector< R_ShaderStorage > _storageBufs;
R_TexSlot _texSlots[16];
R_RasterState _curRasterState, _newRasterState;
R_BlendState _curBlendState, _newBlendState;
R_DepthStencilState _curDepthStencilState, _newDepthStencilState;
R_DrawBarriers _memBarriers;
bool m_IsIndexFormat32;
uint32 _activeVertexAttribsMask;
uint16 _lastTessPatchVertsValue;
uint16 _maxComputeBufferAttachments;
bool _doubleBuffered;
//--------------------------------------------------
// DEFAULT
//--------------------------------------------------
// 8 ssbo
string _shaderLog;
uint32 _depthFormat;
int _vpX, _vpY, _vpWidth, _vpHeight;
int _scX, _scY, _scWidth, _scHeight;
int _fbWidth, _fbHeight;
uint32 _curRendBuf;
int _outputBufferIndex; // Left and right eye for stereo rendering
uint32 _textureMem, _bufferMem;
uint32 _numVertexLayouts;
uint32 _curShaderId;
uint32 _pendingMask;
uint32 _curGeometryIndex;
uint32 _maxTexSlots; // specified in inherited render devices
uint32 _tessPatchVerts; // number of vertices in patch. Used for tesselation.
int _defaultFBO;
bool _defaultFBOMultisampled;
};
| [
"alexstenfard@gmail.com"
] | alexstenfard@gmail.com |
d342e6c6f2a6cacfc2f9739a06fbc5affcd19276 | 2adda151850459529b7706b87ac643161a945022 | /src/time.cc | 5af806ac14a7dd386e634795b0f9d682b6340fe1 | [] | no_license | zentelfong/ThreadLib | 8a806a669d2614aeb8f732a64b6c072f3ca6c26c | 6430cc5e691986d93dfeea80309d59bad36f1a0a | refs/heads/master | 2021-01-10T01:42:05.192716 | 2015-05-21T14:16:40 | 2015-05-21T14:16:40 | 36,017,110 | 2 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,375 | cc |
#include <iostream>
#include <cstdlib>
#include <cstring>
#include "time.h"
namespace base {
#ifdef POSIX
#include <sys/time.h>
uint32 Time() {
struct timeval tv;
gettimeofday(&tv, 0);
return tv.tv_sec * 1000 + tv.tv_usec / 1000;
}
#endif
#ifdef WIN32
#include <windows.h>
uint32_t Time() {
return GetTickCount();
}
#endif
uint32_t StartTime() {
// Close to program execution time
static const uint32_t g_start = Time();
return g_start;
}
// Make sure someone calls it so that it gets initialized
static uint32_t ignore = StartTime();
uint32_t ElapsedTime() {
return TimeDiff(Time(), StartTime());
}
bool TimeIsBetween(uint32_t later, uint32_t middle, uint32_t earlier) {
if (earlier <= later) {
return ((earlier <= middle) && (middle <= later));
} else {
return !((later < middle) && (middle < earlier));
}
}
int32_t TimeDiff(uint32_t later, uint32_t earlier) {
uint32_t LAST = 0xFFFFFFFF;
uint32_t HALF = 0x80000000;
if (TimeIsBetween(earlier + HALF, later, earlier)) {
if (earlier <= later) {
return static_cast<long>(later - earlier);
} else {
return static_cast<long>(later + (LAST - earlier) + 1);
}
} else {
if (later <= earlier) {
return -static_cast<long>(earlier - later);
} else {
return -static_cast<long>(earlier + (LAST - later) + 1);
}
}
}
} // namespace base
| [
"fzt2009@163.com"
] | fzt2009@163.com |
fc46191f681fa6e3126ba983a222632635ca5a61 | 77b6c3e0c7c85ce941e893df236f647ed68fa7fe | /Light Oj solution Zico vai/LightOJ/LOJ-1135.cpp | 6d6b921a77c3286b8516b00db1f4839face83c7a | [] | no_license | Anik-Roy/LightOj-Solution | 05fc9efcbb1eeb4641af3268251feae5be318f44 | 1a8c401b3fd011459b51bcc26fa1175ab4bb7658 | refs/heads/master | 2021-04-12T10:52:43.196029 | 2017-08-31T19:07:04 | 2017-08-31T19:07:04 | 94,535,504 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,109 | cpp | #include<bits/stdc++.h>
using namespace std;
inline int RI() {
int ret = 0, flag = 1,ip = getchar_unlocked();
for(; ip < 48 || ip > 57; ip = getchar_unlocked()) {
if(ip == 45) {
flag = -1;
ip = getchar_unlocked();
break;
}
}
for(; ip > 47 && ip < 58; ip = getchar_unlocked())
ret = ret * 10 + ip - 48 ;
return flag * ret;
}
struct node{
int o,t,z,ppg;
node(){};
node(int _z,int _o,int _t,int _ppg){o=_o,t=_t,z=_z,ppg=_ppg;}
void rot(){
int a=z;
z=t;
t=o;
o=a;
}
void add(node a,node b){
z=a.z+b.z;
o=a.o+b.o;
t=a.t+b.t;
}
}tree[4*100000+2];
void init(int nd,int bb,int ee){
if(bb==ee){
tree[nd]=node(1,0,0,0);
return;
}
int mid=((bb+ee)>>1),ll=(nd<<1),rr=((nd<<1)+1);
init(ll,bb,mid);
init(rr,mid+1,ee);
tree[nd]=node(tree[ll].z+tree[rr].z,0,0,0);
}
void update(int nd,int bb,int ee,int ii,int jj){
if(bb>=ii && ee<=jj){
tree[nd].ppg++;
tree[nd].rot();
return;
}
if(bb>jj || ee<ii)return;
int mid=((bb+ee)>>1),ll=(nd<<1),rr=((nd<<1)+1);
update(ll,bb,mid,ii,jj);
update(rr,mid+1,ee,ii,jj);
tree[nd].add(tree[ll],tree[rr]);
if(tree[nd].ppg%3==1){
tree[nd].rot();
}else if(tree[nd].ppg%3==2){
tree[nd].rot();
tree[nd].rot();
}
return;
}
int query(int nd,int bb,int ee,int ii,int jj,int cr){
if(bb>=ii && ee<=jj){
node a=tree[nd];
if(cr%3==1){
a.rot();
}else if(cr%3==2){
a.rot();
a.rot();
}
return a.z;
}
if(bb>jj || ee<ii)return 0;
int mid=((bb+ee)>>1),ll=(nd<<1),rr=((nd<<1)+1);
return (query(ll,bb,mid,ii,jj,f fcr+tree[nd].ppg)+query(rr,mid+1,ee,ii,jj,cr+tree[nd].ppg));
}
int main(){
int t;
int n,q,x,xx,yy;
t=RI();
//scanf("%d",&t);
for(int z=1;z<=t;z++){
n=RI();q=RI();
//scanf("%d%d",&n,&q);
cout<<"Case "<<z<<":\n";
init(1,1,n);
while(q--){
x=RI();xx=RI();yy=RI();
//scanf("%d%d%d",&x,&xx,&yy);
xx++;
yy++;
if(x==0){
update(1,1,n,xx,yy);
}else {
cout<<query(1,1,n,xx,yy,0)<<"\n";
}
}
}
return 0;
}
| [
"anik96lu@gmail.com"
] | anik96lu@gmail.com |
ee4d6db004800da52a5be71f8857755b75d64e8e | c466c487e1d1e743d4e3bfbe7168358c0787d5f3 | /src/engine/client/gfx/Panel.h | d4fb8e78ac70969305f1bea19f0204f3a9654365 | [] | no_license | jucham/rouage | 686a0905cf198cf735dcec7dc28577756e3e321f | 33160fb4c44fb1320a33d893d36397075beeb223 | refs/heads/master | 2022-11-18T09:16:25.104931 | 2020-07-10T10:18:53 | 2020-07-10T10:18:53 | 278,144,034 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 752 | h | #ifndef PANEL_H
#define PANEL_H
#include <base/DetectPlatform.h>
#include <engine/client/gfx/GFXAsset.h>
#if PLATFORM == PLATFORM_MAC
#include <OpenGL/gl.h>
#else
#include <GL/gl.h>
#endif
class Panel
{
public:
Panel( float wCenter,
float hCenter,
float wCorner,
float hCorner);
void Render(float x,
float y,
float r,
float g,
float b,
float a);
float Width() const;
float Height() const;
protected:
void Quad(float w, float h, float mx1, float my1, float mx2, float my2);
GLuint m_displayList;
float m_fWidth;
float m_fHeight;
};
inline float Panel::Width() const { return m_fWidth;}
inline float Panel::Height() const { return m_fHeight; }
#endif // PANEL_H
| [
"julien.champalbert@gmail.com"
] | julien.champalbert@gmail.com |
184243cc2d91ca2c1ae177dfd6af65ce224bb31f | 2af6cd77013844234c2dca0e34cb44dcd25cba20 | /atcoder/abc183d.cpp | 840ecf0bfd8d73955c8421680510239e1b58c2bc | [] | no_license | SwampertX/judge_adventures | d593c8090b78a4aee6e467b3a5492c7b6e019fd1 | 7838eb6249f23f48da7ae0b2714a3bcd1e0fb721 | refs/heads/master | 2021-06-30T05:53:08.361556 | 2020-12-08T15:57:17 | 2020-12-08T15:57:17 | 165,352,481 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 435 | cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int n, s, t, w, p;
map<int, int> timeUsage;
int main() {
cin >> n >> w;
timeUsage.insert(ii(0, 0));
for (int i = 0; i < n; i++) {
cin >> s >> t;
int first = (timeUsage.upper_bound(s) - timeUsage.begin()) - 1;
/* for (first; first < timeUsage.size(); first++) { */
/* int startTime = (timeUsage.begin() + first) */
/* } */
}
}
| [
"tanyeejian@gmail.com"
] | tanyeejian@gmail.com |
cf33bbd89ae5815a821648360ec100314defd84e | 01eb5e83aaff8f8bf2481c8343d119d2944a424e | /src/opencv/features2d/DescriptorMatcher.cc | a2a53985b25f66ca8b224032b8954151a3cd3686 | [
"BSD-3-Clause",
"MIT"
] | permissive | drorgl/node-alvision | 4d68814a9c6b778df68664884548a9a43f797194 | 5498cc6fb56b40326e1686f407f12c119744ae94 | refs/heads/master | 2021-01-10T12:22:35.062497 | 2017-03-30T18:48:37 | 2017-03-30T18:48:37 | 45,723,280 | 3 | 0 | null | 2017-03-30T18:48:38 | 2015-11-07T05:02:00 | C++ | UTF-8 | C++ | false | false | 17,540 | cc | #include "DescriptorMatcher.h"
#include "../IOArray.h"
#include "../types/DMatch.h"
#include "../persistence/FileNode.h"
#include "../persistence/FileStorage.h"
namespace descriptormatcher_general_callback {
std::shared_ptr<overload_resolution> overload;
NAN_METHOD(callback) {
if (overload == nullptr) {
throw std::runtime_error("descriptormatcher_general_callback is empty");
}
return overload->execute("descriptormatcher", info);
}
}
Nan::Persistent<FunctionTemplate> DescriptorMatcher::constructor;
std::string DescriptorMatcher::name;
void DescriptorMatcher::Init(Handle<Object> target, std::shared_ptr<overload_resolution> overload) {
DescriptorMatcher::name = "DescriptorMatcher";
descriptormatcher_general_callback::overload = overload;
Local<FunctionTemplate> ctor = Nan::New<FunctionTemplate>(descriptormatcher_general_callback::callback);
constructor.Reset(ctor);
auto itpl = ctor->InstanceTemplate();
itpl->SetInternalFieldCount(1);
ctor->SetClassName(Nan::New(DescriptorMatcher::name).ToLocalChecked());
ctor->Inherit(Nan::New(Algorithm::constructor));
overload->register_type<DescriptorMatcher>(ctor, "descriptormatcher", "DescriptorMatcher");
//
//
// /****************************************************************************************\
// * DescriptorMatcher *
// \****************************************************************************************/
//
// //! @addtogroup features2d_match
// //! @{
//
// /** @brief Abstract base class for matching keypoint descriptors.
//
// It has two groups of match methods: for matching descriptors of an image with another image or with
// an image set.
// */
// class CV_EXPORTS_W DescriptorMatcher : public Algorithm
// {
// public:
// virtual ~DescriptorMatcher();
//
// /** @brief Adds descriptors to train a CPU(trainDescCollectionis) or GPU(utrainDescCollectionis) descriptor
// collection.
//
// If the collection is not empty, the new descriptors are added to existing train descriptors.
//
// @param descriptors Descriptors to add. Each descriptors[i] is a set of descriptors from the same
// train image.
// */
// CV_WRAP virtual void add(InputArrayOfArrays descriptors);
overload->addOverload("descriptormatcher", "DescriptorMatcher", "add", {make_param<IOArray*>("descriptors","IOArray")}, add);
//
// /** @brief Returns a constant link to the train descriptor collection trainDescCollection .
// */
// CV_WRAP const std::vector<Mat>& getTrainDescriptors() const;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "getTrainDescriptors", {}, getTrainDescriptors);
//
// /** @brief Clears the train descriptor collections.
// */
// CV_WRAP virtual void clear();
overload->addOverload("descriptormatcher", "DescriptorMatcher", "clear", {}, clear);
//
// /** @brief Returns true if there are no train descriptors in the both collections.
// */
// CV_WRAP virtual bool empty() const;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "empty", {}, empty);
//
// /** @brief Returns true if the descriptor matcher supports masking permissible matches.
// */
// CV_WRAP virtual bool isMaskSupported() const = 0;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "isMaskSupported", {}, isMaskSupported);
//
// /** @brief Trains a descriptor matcher
//
// Trains a descriptor matcher (for example, the flann index). In all methods to match, the method
// train() is run every time before matching. Some descriptor matchers (for example, BruteForceMatcher)
// have an empty implementation of this method. Other matchers really train their inner structures (for
// example, FlannBasedMatcher trains flann::Index ).
// */
// CV_WRAP virtual void train();
overload->addOverload("descriptormatcher", "DescriptorMatcher", "train", {}, train);
//
// /** @brief Finds the best match for each descriptor from a query set.
//
// @param queryDescriptors Query set of descriptors.
// @param trainDescriptors Train set of descriptors. This set is not added to the train descriptors
// collection stored in the class object.
// @param matches Matches. If a query descriptor is masked out in mask , no match is added for this
// descriptor. So, matches size may be smaller than the query descriptors count.
// @param mask Mask specifying permissible matches between an input query and train matrices of
// descriptors.
//
// In the first variant of this method, the train descriptors are passed as an input argument. In the
// second variant of the method, train descriptors collection that was set by DescriptorMatcher::add is
// used. Optional mask (or masks) can be passed to specify which query and training descriptors can be
// matched. Namely, queryDescriptors[i] can be matched with trainDescriptors[j] only if
// mask.at\<uchar\>(i,j) is non-zero.
// */
// CV_WRAP void match(InputArray queryDescriptors, InputArray trainDescriptors,
// CV_OUT std::vector<DMatch>& matches, InputArray mask = noArray()) const;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "match", {
make_param<IOArray*>("queryDescriptors","IOArray"),
make_param<IOArray*>("trainDescriptors","IOArray"),
make_param<std::shared_ptr<std::vector<DMatch*>>>("matches","Array<DMatch>"),
make_param<IOArray*>("mask","IOArray",IOArray::noArray())
}, match_train);
//
// /** @brief Finds the k best matches for each descriptor from a query set.
//
// @param queryDescriptors Query set of descriptors.
// @param trainDescriptors Train set of descriptors. This set is not added to the train descriptors
// collection stored in the class object.
// @param mask Mask specifying permissible matches between an input query and train matrices of
// descriptors.
// @param matches Matches. Each matches[i] is k or less matches for the same query descriptor.
// @param k Count of best matches found per each query descriptor or less if a query descriptor has
// less than k possible matches in total.
// @param compactResult Parameter used when the mask (or masks) is not empty. If compactResult is
// false, the matches vector has the same size as queryDescriptors rows. If compactResult is true,
// the matches vector does not contain matches for fully masked-out query descriptors.
//
// These extended variants of DescriptorMatcher::match methods find several best matches for each query
// descriptor. The matches are returned in the distance increasing order. See DescriptorMatcher::match
// for the details about query and train descriptors.
// */
// CV_WRAP void knnMatch(InputArray queryDescriptors, InputArray trainDescriptors,
// CV_OUT std::vector<std::vector<DMatch> >& matches, int k,
// InputArray mask = noArray(), bool compactResult = false) const;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "knnMatch", {
make_param<IOArray*>("queryDescriptors","IOArray"),
make_param<IOArray*>("trainDescriptors","IOArray"),
make_param<std::shared_ptr<std::vector<DMatch*>>>("matches","Array<DMatch>"),
make_param<int>("k","int"),
make_param<IOArray*>("mask","IOArray",IOArray:: noArray()),
make_param<bool>("compactResult","bool", false)
}, knnMatch_train);
//
// /** @brief For each query descriptor, finds the training descriptors not farther than the specified distance.
//
// @param queryDescriptors Query set of descriptors.
// @param trainDescriptors Train set of descriptors. This set is not added to the train descriptors
// collection stored in the class object.
// @param matches Found matches.
// @param compactResult Parameter used when the mask (or masks) is not empty. If compactResult is
// false, the matches vector has the same size as queryDescriptors rows. If compactResult is true,
// the matches vector does not contain matches for fully masked-out query descriptors.
// @param maxDistance Threshold for the distance between matched descriptors. Distance means here
// metric distance (e.g. Hamming distance), not the distance between coordinates (which is measured
// in Pixels)!
// @param mask Mask specifying permissible matches between an input query and train matrices of
// descriptors.
//
// For each query descriptor, the methods find such training descriptors that the distance between the
// query descriptor and the training descriptor is equal or smaller than maxDistance. Found matches are
// returned in the distance increasing order.
// */
// void radiusMatch(InputArray queryDescriptors, InputArray trainDescriptors,
// std::vector<std::vector<DMatch> >& matches, float maxDistance,
// InputArray mask = noArray(), bool compactResult = false) const;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "radiusMatch", {
make_param<IOArray*>("queryDescriptors","IOArray"),
make_param<IOArray*>("trainDescriptors","IOArray"),
make_param<std::shared_ptr<std::vector<DMatch*>>>("matches","Array<DMatch>"),
make_param<float>("maxDistance","float"),
make_param<IOArray*>("mask","IOArray",IOArray::noArray()),
make_param<bool>("compactResult","bool", false)
}, radiusMatch_train);
//
// /** @overload
// @param queryDescriptors Query set of descriptors.
// @param matches Matches. If a query descriptor is masked out in mask , no match is added for this
// descriptor. So, matches size may be smaller than the query descriptors count.
// @param masks Set of masks. Each masks[i] specifies permissible matches between the input query
// descriptors and stored train descriptors from the i-th image trainDescCollection[i].
// */
// CV_WRAP void match(InputArray queryDescriptors, CV_OUT std::vector<DMatch>& matches,
// InputArrayOfArrays masks = noArray());
overload->addOverload("descriptormatcher", "DescriptorMatcher", "match", {
make_param<IOArray*>("queryDescriptors","IOArray"),
make_param<std::shared_ptr<std::vector<DMatch*>>>("matches","Array<DMatch>"),
make_param<IOArray*>("mask","IOArray",IOArray::noArray())
}, match);
// /** @overload
// @param queryDescriptors Query set of descriptors.
// @param matches Matches. Each matches[i] is k or less matches for the same query descriptor.
// @param k Count of best matches found per each query descriptor or less if a query descriptor has
// less than k possible matches in total.
// @param masks Set of masks. Each masks[i] specifies permissible matches between the input query
// descriptors and stored train descriptors from the i-th image trainDescCollection[i].
// @param compactResult Parameter used when the mask (or masks) is not empty. If compactResult is
// false, the matches vector has the same size as queryDescriptors rows. If compactResult is true,
// the matches vector does not contain matches for fully masked-out query descriptors.
// */
// CV_WRAP void knnMatch(InputArray queryDescriptors, CV_OUT std::vector<std::vector<DMatch> >& matches, int k,
// InputArrayOfArrays masks = noArray(), bool compactResult = false);
overload->addOverload("descriptormatcher", "DescriptorMatcher", "knnMatch", {
make_param<IOArray*>("queryDescriptors","IOArray"),
make_param<std::shared_ptr<std::vector<DMatch*>>>("matches","Array<DMatch>"),
make_param<int>("k","int"),
make_param<IOArray*>("mask","IOArray",IOArray::noArray()),
make_param<bool>("compactResult","bool", false)
}, knnMatch);
// /** @overload
// @param queryDescriptors Query set of descriptors.
// @param matches Found matches.
// @param maxDistance Threshold for the distance between matched descriptors. Distance means here
// metric distance (e.g. Hamming distance), not the distance between coordinates (which is measured
// in Pixels)!
// @param masks Set of masks. Each masks[i] specifies permissible matches between the input query
// descriptors and stored train descriptors from the i-th image trainDescCollection[i].
// @param compactResult Parameter used when the mask (or masks) is not empty. If compactResult is
// false, the matches vector has the same size as queryDescriptors rows. If compactResult is true,
// the matches vector does not contain matches for fully masked-out query descriptors.
// */
// void radiusMatch(InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, float maxDistance,
// InputArrayOfArrays masks = noArray(), bool compactResult = false);
overload->addOverload("descriptormatcher", "DescriptorMatcher", "radiusMatch", {
make_param<IOArray*>("queryDescriptors","IOArray"),
make_param<std::shared_ptr<std::vector<DMatch*>>>("matches","Array<DMatch>"),
make_param<float>("maxDistance","float"),
make_param<IOArray*>("mask","IOArray",IOArray::noArray()),
make_param<bool>("compactResult","bool", false)
}, radiusMatch);
//
// // Reads matcher object from a file node
// virtual void read(const FileNode&);
overload->addOverload("descriptormatcher", "DescriptorMatcher", "read", {make_param<FileNode*>("fn","FileNode")}, read);
// // Writes matcher object to a file storage
// virtual void write(FileStorage&) const;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "write", {make_param<FileStorage*>("fs","FileStorage")}, write);
//
// /** @brief Clones the matcher.
//
// @param emptyTrainData If emptyTrainData is false, the method creates a deep copy of the object,
// that is, copies both parameters and train data. If emptyTrainData is true, the method creates an
// object copy with the current parameters but with empty train data.
// */
// virtual Ptr<DescriptorMatcher> clone(bool emptyTrainData = false) const = 0;
overload->addOverload("descriptormatcher", "DescriptorMatcher", "clone", { make_param<bool>("emptyTrainData","bool", false) }, clone);
//
// /** @brief Creates a descriptor matcher of a given type with the default parameters (using default
// constructor).
//
// @param descriptorMatcherType Descriptor matcher type. Now the following matcher types are
// supported:
// - `BruteForce` (it uses L2 )
// - `BruteForce-L1`
// - `BruteForce-Hamming`
// - `BruteForce-Hamming(2)`
// - `FlannBased`
// */
// CV_WRAP static Ptr<DescriptorMatcher> create(const String& descriptorMatcherType);
overload->addStaticOverload("descriptormatcher", "DescriptorMatcher", "create", {make_param<std::string>("descriptorMatcherType","String")}, create);
// protected:
// /**
// * Class to work with descriptors from several images as with one merged matrix.
// * It is used e.g. in FlannBasedMatcher.
// */
//
// //! In fact the matching is implemented only by the following two methods. These methods suppose
// //! that the class object has been trained already. Public match methods call these methods
// //! after calling train().
// virtual void knnMatchImpl(InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, int k,
// InputArrayOfArrays masks = noArray(), bool compactResult = false) = 0;
// virtual void radiusMatchImpl(InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, float maxDistance,
// InputArrayOfArrays masks = noArray(), bool compactResult = false) = 0;
//
// static bool isPossibleMatch(InputArray mask, int queryIdx, int trainIdx);
// static bool isMaskedOut(InputArrayOfArrays masks, int queryIdx);
//
// static Mat clone_op(Mat m) { return m.clone(); }
// void checkMasks(InputArrayOfArrays masks, int queryDescriptorsCount) const;
//
// //! Collection of descriptors from train images.
// std::vector<Mat> trainDescCollection;
// std::vector<UMat> utrainDescCollection;
// };
target->Set(Nan::New("DescriptorMatcher").ToLocalChecked(), ctor->GetFunction());
}
v8::Local<v8::Function> DescriptorMatcher::get_constructor() {
assert(!constructor.IsEmpty() && "constructor is empty");
return Nan::New(constructor)->GetFunction();
}
POLY_METHOD(DescriptorMatcher::add){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::getTrainDescriptors){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::clear){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::empty){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::isMaskSupported){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::train){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::match_train){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::knnMatch_train){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::radiusMatch_train){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::match){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::knnMatch){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::radiusMatch){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::read){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::write){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::clone){throw std::runtime_error("not implemented");}
POLY_METHOD(DescriptorMatcher::create){throw std::runtime_error("not implemented");}
| [
"drorgl@yahoo.com"
] | drorgl@yahoo.com |
dd761ad12c04659bebc73f6cccb9b89241ee574a | adcf9402c5acb7dedc59fcfd6cde4cf509488185 | /include/djp/graph/undirected_graph.hpp | fa509ba1a4a38f8791ffe623aa37c4b3d7e724d3 | [
"BSL-1.0"
] | permissive | mtavano/CP-utils | 208f08966accee9ac0b2749e7ebc65bdcfcbfaff | 9e7ccb8c38db3d92b001c614fd3b2560f0a9e78f | refs/heads/master | 2021-01-18T11:21:03.566953 | 2015-09-01T02:34:40 | 2015-09-01T02:34:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,551 | hpp | // Copyright Diego Ramírez August 2015
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef DJP_GRAPH_UNDIRECTED_GRAPH_HPP
#define DJP_GRAPH_UNDIRECTED_GRAPH_HPP
#include <utility> // for std::pair
#include <vector> // for std::vector
#include <cstddef> // for std::size_t
namespace djp {
/// \brief Adjacency list which represents undirected graphs.
///
class undirected_graph {
std::vector<std::vector<size_t>> adj_edges;
std::vector<std::pair<size_t, size_t>> edge_list;
public:
undirected_graph(size_t num_vertices) : adj_edges(num_vertices) {}
size_t add_edge(size_t u, size_t v) {
edge_list.emplace_back(u, v);
const size_t edge_id = edge_list.size() - 1;
adj_edges[u].push_back(edge_id);
adj_edges[v].push_back(edge_id);
return edge_id;
}
size_t num_vertices() const { return adj_edges.size(); }
size_t num_edges() const { return edge_list.size(); }
size_t source(size_t e) const { return edge_list[e].first; }
size_t target(size_t e) const { return edge_list[e].second; }
const std::vector<size_t> &out_edges(size_t v) const { return adj_edges[v]; }
const std::vector<size_t> &in_edges(size_t v) const { return adj_edges[v]; }
size_t degree(size_t v) const { return adj_edges[v].size(); }
size_t out_degree(size_t v) const { return degree(v); }
size_t in_degree(size_t v) const { return degree(v); }
};
} // end namespace djp
#endif // Header guard
| [
"diego_rd93@hotmail.com"
] | diego_rd93@hotmail.com |
50b1416d78c8eb6b99dea8dc58327f2424f99d08 | bd93d57417ebf127212f228ee91786a4caf75a01 | /BitMap.cpp | ead0570fa16e4498b0714b14c901203ff63c5019 | [] | no_license | manishjha5410/Algorithms-1 | 32ae384b00ced0f2c48186abfb6aaef3381d296f | 03db75f0707f13797a462556878d71a1752c810f | refs/heads/master | 2023-07-09T14:10:09.190860 | 2021-08-13T05:25:21 | 2021-08-13T05:25:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,843 | cpp | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
bool isOdd(ll x)
{
return (x & 1)?true:false;
}
vector<string> split(const string& str, char delim) {
vector<string> strings;
size_t start;
size_t end = 0;
while ((start = str.find_first_not_of(delim, end)) != string::npos) {
end = str.find(delim, start);
strings.push_back(str.substr(start, end - start));
}
return strings;
}
//get ith bit
ll getBit(ll x,ll i)
{
return (x & (1<<i))?1:0;
}
void setBit(ll &x,ll i)
{
x= (x | (1<<i)) ;
return;
}
void clearBit(ll &x, ll i)
{
ll mask = ~(1<<i);
x = (x & mask);
return ;
}
void updateBit(ll &n,ll i, ll v)
{
clearBit(n,i);
ll mask = v<<i;
n = (n | mask);
return;
}
ll clearLastIBits(ll n,ll i)
{ // i equals no of bits cleared
ll allOnes = ~0;
return (n & (allOnes<<i));
}
ll clearItoJBits(ll n,ll i,ll j)
{ //i<j and indexinf from 0 starting from right
ll allOnes = ~0;
ll OnesAfterJ = allOnes<<(j+1); //111100000
ll OnesBeforeI = (1<<i)-1; //000000011 where i is 2;
ll mask = (OnesBeforeI | OnesAfterJ );//111100011
return n & mask;
}
int countSetBits(ll n)
{
int ans=0;
while(n>0)
{
ans += (n & 1);
n=n>>1;
}
return ans;
}
int countSetBitsFast(ll n)
{
int ans=0;
while(n>0)
{
n = n & (n-1);//will remove the LSB
ans++;
}
return ans;
//__builtin_popcount() can also be used;
}
ll decimalToBin(ll n)
{
ll ans=0,p=1;
while(n>0)
{
ll currBit = n & 1;
n=n>>1;
ans+=p*currBit;
p*=10;
}
return ans;
}
ll fast_expo(int a,int n)
{
ll ans=1;
while(n>0)
{
int last_bit = n & 1;
if(last_bit)
{
ans*=a;
}
n = n>>1;
a = a*a;
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("opps.txt","w",stdout);
#endif
int n,a;
cin>>a>>n;
cout<<fast_expo(a,n)<<endl;
return 0;
} | [
"tejasghone73@gmail.com"
] | tejasghone73@gmail.com |
66d2c4ac3776394bf1a14633697755bded2be163 | 5908c584b22d8f152deeb4082ff6003d841deaa9 | /Physics_RT/Havok/Source/Common/Serialize/Version/hkVersionPatchManager.inl | c9ef3ea715d1daf750ce9eaa192ff397942b333c | [] | no_license | imengyu/Physics_RT | 1e7b71912e54b14679e799e7327b7d65531811f5 | b8411b4bc483d6ce5c240ae4c004f3872c64d073 | refs/heads/main | 2023-07-17T20:55:39.303641 | 2021-08-28T18:25:01 | 2021-08-28T18:25:01 | 399,414,182 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,538 | inl | /*
*
* Confidential Information of Telekinesys Research Limited (t/a Havok). Not for disclosure or distribution without Havok's
* prior written consent. This software contains code, techniques and know-how which is confidential and proprietary to Havok.
* Product and Trade Secret source code contains trade secrets of Havok. Havok Software (C) Copyright 1999-2013 Telekinesys Research Limited t/a Havok. All Rights Reserved. Use of this software is subject to the terms of an end user license agreement.
*
*/
HK_FORCE_INLINE int hkVersionPatchManager::getPatchIndex( hkUint64 uid ) const
{
return m_patchIndexFromUid.getWithDefault(uid, -1);
}
HK_FORCE_INLINE const hkVersionPatchManager::PatchInfo* hkVersionPatchManager::getPatch( int patchIndex ) const
{
return m_patchInfos[patchIndex];
}
HK_FORCE_INLINE int hkVersionPatchManager::getNumPatches() const
{
return m_patchInfos.getSize();
}
/*
* Havok SDK - Base file, BUILD(#20131218)
*
* Confidential Information of Havok. (C) Copyright 1999-2013
* Telekinesys Research Limited t/a Havok. All Rights Reserved. The Havok
* Logo, and the Havok buzzsaw logo are trademarks of Havok. Title, ownership
* rights, and intellectual property rights in the Havok software remain in
* Havok and/or its suppliers.
*
* Use of this software for evaluation purposes is subject to and indicates
* acceptance of the End User licence Agreement for this product. A copy of
* the license is included with this software and is also available from salesteam@havok.com.
*
*/
| [
"1501076885@qq.com"
] | 1501076885@qq.com |
1ccc1ef5d7e045e4557af465accec8c545b642fe | 5b74e0809eeccf18a8714177c5728b7eb600aac8 | /prebuilts/ComputeLibrary/include/arm_compute/graph/nodes/SoftmaxLayer.h | 2e1bd98c8db099f9bec42a2f11c99ece3e636d71 | [] | no_license | DLT1995/CaffeOnACL-Android | 63276b93ca1895b2598649b9fc0ffc5f9ac22618 | 648321aaafe83cb10a9307466ebd9da8fcc15d0b | refs/heads/master | 2020-08-03T01:43:52.128884 | 2017-11-22T00:56:41 | 2017-11-22T00:56:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,775 | h | /*
* Copyright (c) 2017 ARM Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef __ARM_COMPUTE_GRAPH_SOFTMAX_LAYER_H__
#define __ARM_COMPUTE_GRAPH_SOFTMAX_LAYER_H__
#include "arm_compute/graph/GraphContext.h"
#include "arm_compute/graph/INode.h"
#include "arm_compute/graph/Tensor.h"
#include "arm_compute/graph/Types.h"
namespace arm_compute
{
namespace graph
{
/** Softmax layer node */
class SoftmaxLayer : public INode
{
public:
// Inherited methods overriden:
std::unique_ptr<arm_compute::IFunction> instantiate_node(GraphContext &ctx, ITensor *input, ITensor *output) override;
};
} // namespace graph
} // namespace arm_compute
#endif /* __ARM_COMPUTE_GRAPH_SOFTMAX_LAYER_H__ */
| [
"felix.zeng@rock-chips.com"
] | felix.zeng@rock-chips.com |
bfe86eda5a6c7f409c6ad0799354d7555691833d | c2478ca4f0dd344a9939c6826606572475ade61c | /ga/tspinfo.hpp | a8915bb96cb51fcce974c4337da20701a3e97c22 | [] | no_license | mcassiano/tp-paa | aec915eaeb3320dcf666f17be41fd1b7b20d1d59 | 497350ed2c6ab748f122ecf3841f62ca9a9e6732 | refs/heads/master | 2021-01-10T07:29:20.713631 | 2015-11-22T22:29:49 | 2015-11-22T22:29:49 | 45,957,854 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 392 | hpp | #ifndef tspinfo_hpp
#define tspinfo_hpp
#import <stdio.h>
#import <stdlib.h>
#import <string.h>
#define MAX_CITY 100
class TSPInfo {
private:
static int problemSize;
static double **distances;
TSPInfo();
TSPInfo(TSPInfo const&);
void operator=(TSPInfo const&);
public:
static void init(double **, int);
static double getDistance(int, int);
static int getSize();
};
#endif | [
"matheus@mcassiano.com"
] | matheus@mcassiano.com |
b78526b271386e2e65fe9a5def123ed9264f908a | 948f4e13af6b3014582909cc6d762606f2a43365 | /testcases/juliet_test_suite/testcases/CWE415_Double_Free/s01/CWE415_Double_Free__new_delete_array_char_73a.cpp | 0e6bf030bf8ef426d27e39639843d215deaea235 | [] | no_license | junxzm1990/ASAN-- | 0056a341b8537142e10373c8417f27d7825ad89b | ca96e46422407a55bed4aa551a6ad28ec1eeef4e | refs/heads/master | 2022-08-02T15:38:56.286555 | 2022-06-16T22:19:54 | 2022-06-16T22:19:54 | 408,238,453 | 74 | 13 | null | 2022-06-16T22:19:55 | 2021-09-19T21:14:59 | null | UTF-8 | C++ | false | false | 3,181 | cpp | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE415_Double_Free__new_delete_array_char_73a.cpp
Label Definition File: CWE415_Double_Free__new_delete_array.label.xml
Template File: sources-sinks-73a.tmpl.cpp
*/
/*
* @description
* CWE: 415 Double Free
* BadSource: Allocate data using new and Deallocae data using delete
* GoodSource: Allocate data using new
* Sinks:
* GoodSink: do nothing
* BadSink : Deallocate data using delete
* Flow Variant: 73 Data flow: data passed in a list from one function to another in different source files
*
* */
#include "std_testcase.h"
#include <list>
#include <wchar.h>
using namespace std;
namespace CWE415_Double_Free__new_delete_array_char_73
{
#ifndef OMITBAD
/* bad function declaration */
void badSink(list<char *> dataList);
void bad()
{
char * data;
list<char *> dataList;
/* Initialize data */
data = NULL;
data = new char[100];
/* POTENTIAL FLAW: delete the array data in the source - the bad sink deletes the array data as well */
delete [] data;
/* Put data in a list */
dataList.push_back(data);
dataList.push_back(data);
dataList.push_back(data);
badSink(dataList);
}
#endif /* OMITBAD */
#ifndef OMITGOOD
/* goodG2B uses the GoodSource with the BadSink */
void goodG2BSink(list<char *> dataList);
static void goodG2B()
{
char * data;
list<char *> dataList;
/* Initialize data */
data = NULL;
data = new char[100];
/* FIX: Do NOT delete the array data in the source - the bad sink deletes the array data */
/* Put data in a list */
dataList.push_back(data);
dataList.push_back(data);
dataList.push_back(data);
goodG2BSink(dataList);
}
/* goodB2G uses the BadSource with the GoodSink */
void goodB2GSink(list<char *> dataList);
static void goodB2G()
{
char * data;
list<char *> dataList;
/* Initialize data */
data = NULL;
data = new char[100];
/* POTENTIAL FLAW: delete the array data in the source - the bad sink deletes the array data as well */
delete [] data;
dataList.push_back(data);
dataList.push_back(data);
dataList.push_back(data);
goodB2GSink(dataList);
}
void good()
{
goodG2B();
goodB2G();
}
#endif /* OMITGOOD */
} /* close namespace */
/* Below is the main(). It is only used when building this testcase on
its own for testing or for building a binary to use in testing binary
analysis tools. It is not used when compiling all the testcases as one
application, which is how source code analysis tools are tested. */
#ifdef INCLUDEMAIN
using namespace CWE415_Double_Free__new_delete_array_char_73; /* so that we can use good and bad easily */
int main(int argc, char * argv[])
{
/* seed randomness */
srand( (unsigned)time(NULL) );
#ifndef OMITGOOD
printLine("Calling good()...");
good();
printLine("Finished good()");
#endif /* OMITGOOD */
#ifndef OMITBAD
printLine("Calling bad()...");
bad();
printLine("Finished bad()");
#endif /* OMITBAD */
return 0;
}
#endif
| [
"yzhang0701@gmail.com"
] | yzhang0701@gmail.com |
c99dbaa11871bd39208587830db214b52157cccc | 6bcf531ea19da4d090db09823a99bb7000bcd59a | /unusedcode/unusedcode.ino | 2402979cf909dcfdaff551abb38158a819c3ff4b | [] | no_license | DThirman/dc | 2f29e3fb5e8d2205845011930fd3310ea44fd5ab | 77af0faedcfc0a5a53e3ed603b97dc3db91c322e | refs/heads/master | 2021-01-19T07:41:01.832279 | 2015-05-23T15:35:54 | 2015-05-23T15:35:54 | 35,647,059 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,556 | ino |
/*
Serial.print("\n");
int frontLaserThresh = 500;
int backBreakBeamThresh = 500;
//frontLaserArr[iter%NUM_AVG] = analogRead(frontLaser);
int frontLaserVal = analogRead(frontLaser);//getValue(frontLaserArr);
int backBreakBeamVal = analogRead(backBreakBeam);
Serial.print("LaserVal:\t");
Serial.print(frontLaserVal);
if(frontLaserVal + frontLaserThresh < prevFrontVal)
{
blockCount++;
Serial.print(" NumBlocks:\t");
Serial.print(blockCount);
}
if(blockCount >=MAX_BLOCKS)
{
delay(1000);
s.write(BIN_INVERTED);
blockCount = 0;
}
if(prevBackVal < (backBreakBeamVal - backBreakBeamThresh))
{
s.write(BIN_DOWN);
}
prevBackVal = backBreakBeamVal;
prevFrontVal = frontLaserVal;
iter++;
}
*/
// put your main code here, to run repeatedly:
//s.write(0);
//delay(1000);
//s.write(180);
//delay(1000);
//distR = sonarR.ping_in();
//distL = sonarL.ping_in();
//Serial.print(distR);
//Serial.print("\t");
//Serial.println(distL);
//driveForward(50);
//driveLeft(100);
//driveRight(100);
//driveBack(100);
/*
int sum1 = 0;
int sum2 = 0;
int sum3 = 0;
int sum4 = 0;
sensor1 = analogRead(colorSense1);
sensor2 = analogRead(colorSense2);
sensor3 = analogRead(colorSense3);
sensor4 = analogRead(colorSense4);
Serial.print(analogRead(frontLaser));
Serial.print("\t");
Serial.println(analogRead(backBreakBeam));
*/
/*
colorArr1[iter%NUM_AVG] = sensor1;
colorArr2[iter%NUM_AVG] = sensor2;
colorArr3[iter%NUM_AVG] = sensor3;
colorArr4[iter%NUM_AVG] = sensor4;
iter++;
for(int i = 0; i < NUM_AVG; i++)
{
sum1 = sum1 + colorArr1[i];
sum2 = sum2 + colorArr2[i];
sum3 = sum3 + colorArr3[i];
sum4 = sum4 + colorArr4[i];
}
val1 = sum1 / min(iter, NUM_AVG);
val2 = sum2 / min(iter, NUM_AVG);
val3 = sum3 / min(iter, NUM_AVG);
val4 = sum4 / min(iter, NUM_AVG);
//printColors();
int count = 0;
int thresh = 75;
/*
if (abs((sensor1 - homeColor1)*100/homeColor1) < thresh)
{
count ++;
}
if (abs((sensor2 - homeColor2)*100/homeColor2) < thresh)
{
count ++;
}
if (abs((sensor3 - homeColor3)*100/homeColor3) < thresh)
{
count ++;
}
if (abs((sensor4 - homeColor4)*100/homeColor4) < thresh)
{
count ++;
}
*/
/*
if (sensor1 > thresh)
{
count++;
}
if (sensor2 > thresh)
{
count++;
}
if (sensor3 > thresh)
{
count++;
}
if (sensor4 > thresh)
{
count++;
}
if (count >=2 )
{
s.write(180);
}
else
{
s.write(0);
}
*/
//delay(100);
/*
distR = sonarR.ping_in();
distL = sonarL.ping_in();
if(distR == 0)
{
distR = 50;
}
if(distL == 0)
{
distL = 50;
}
Serial.print(distR);
Serial.print("\t");
Serial.println(distL);
if(distR < 8 && distL < 8)
{
driveBack(100);
}
else if(distR < 8)
{
driveLeft(100);
}
else if(distL < 8)
{
driveRight(100);
}
else
{
driveForward(100);
}
*/
/*
driveForward(100);
delay(1500);
delay(1500);
driveStop();
driveLeft(100);
delay(800);
driveStop();
driveForward(100);
delay(1500);
delay(1500);
delay(1500);
delay(1500);
driveStop();
driveRight(100);
delay(800);
driveStop();
driveForward(100);
delay(1500);
driveStop();
driveRight(100);
delay(800);
driveStop();
driveForward(100);
delay(1500);
delay(1500);
delay(1500);
delay(1500);
driveStop();
*/
| [
"Dthirman@gmail.com"
] | Dthirman@gmail.com |
59fdba97213bcaa87df70deebb3326a1932adcdd | 87938c470a5a42286ded0fdffadc1f98c1e2380d | /final.cpp | 840ddfcb9196a5eb02f842f37aae863442f06a14 | [] | no_license | hassaanali723/Dictionary-using-Trie | 59ace8381dee90a72c46c3deb206adba4f111f60 | 05984562acb29cf12a567a2bb48df451ee35a6a7 | refs/heads/master | 2022-12-06T16:25:20.367366 | 2020-08-28T16:45:02 | 2020-08-28T16:45:02 | 291,081,074 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 326,587 | cpp | #include<iostream>
#include<vector>
#include<windows.h>
#include<iostream>
#include<conio.h> //colsole i/o
#include<string.h>
//for sleep function in blinkig & loading
#include<fstream>
using namespace std;
using std::cout; using std::endl;
void cover() //Name of Project
{
system("color 07"); // you can also change the color by adding b6 instead of 07
char x=175;
char y=174;
char z=240;
cout<<endl<<endl<<endl<<endl;
for(int n=0;n<122;n++)
{
cout<<z;
}
for(int n=0;n<61;n++)
{
cout<<" "<<x;
cout<<" "<<y;
}
cout<<endl;
cout<<"\t\t\t\t\t\t______________________\n\n";
cout<<"\t\t\t\t\t\t DIGITAL DICTIONARY";
cout<<"\n\t\t\t\t\t\t______________________";
cout<<endl<<endl;
for(int n=0;n<61;n++)
{
cout<<" "<<x;
cout<<" "<<y;
}
for(int n=0;n<122;n++)
{
cout<<z;
}
cout<<endl;
cout<<"\n\n\n\n\n\n\n\t\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved.";
for(int n=0;n<28;n++)
{
cout<<".";
Sleep(350);
}
}
void load()
{
cout<<endl<<endl<<endl;
cout<<"\n\n\n\n\n\n\n\t\t\t\t\t\t______________________\n\n";
cout<<"\t\t\t\t\t\tDIGITAL DICTIONARY";
cout<<"\n\t\t\t\t\t\t______________________";
cout<<endl<<endl;
system("color 70");
cout<<"\n\t\t\t\t\t\t LOADING Please Wait\n";
cout<<"\t\t\t\t\t\t ___________________\n\n\n";
for (int i=0;i<=99;i++)
{
cout<<"\t\t\t\t\t\t\t "<<i<<"%\r";
Sleep(80);
}
system("cls");
}//loading function
void search()
{
cout<<"\t\tSEARCHING";
for(int n=0;n<15;n++)
{
cout<<".";
Sleep(150);
}
system("cls");
}//loading function end
void loading()
{
cout<<"\t\tLOADING";
for(int n=0;n<10;n++)
{
cout<<".";
Sleep(150);
}
system("cls");
}//exiting function end
void exiting()
{
cout<<"\t\tEXITING";
for(int n=0;n<13;n++)
{
cout<<".";
Sleep(150);
}
system("cls");
}//exiting function end
//-------------------------------------------------------------------------------------------------------------//
const int ALPHABET_SIZE = 26;
const int CASE = 'a';
struct Node{
Node* parent_ = NULL ;
Node* children_[ALPHABET_SIZE]={};
int occurrences_=0;
string synonyms;
string antonyms;
bool flag;
};
Node* search_trie( Node* current,char* word){
while(*word!='\0'){
if(current->children_[*word-'a']!=NULL){
current=current->children_[*word-'a'];
++word;
}
else
break;
}
if(*word=='\0'){
return current;
}
else
return NULL;
}
void InsertNode(Node* trieTree,char* word1){
Node* currentNode = trieTree;
while(*word1!='\0'){
if(currentNode->children_[*word1-CASE] == NULL){
currentNode->children_[*word1-CASE]=new Node();
currentNode->children_[*word1-CASE]->parent_=currentNode;
}
currentNode=currentNode->children_[*word1-CASE];
++word1;
}
++currentNode->occurrences_;
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n_______________________________________________________________________________________________________________________";
cout<<"\n\n\n\t\t\t\t\t\t\tRESULT";
cout<<"\n\t\t\t\t\t\t\t______\n\n\n\n\n";
cout<<"\t\t\t\tWord entered successfully in the dictionary :\t \n";
cout<<"\n\n_______________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
//goto menue;
};
void InsertNode1(Node* trieTree,char* word1){
Node* currentNode = trieTree;
while(*word1!='\0'){
if(currentNode->children_[*word1-CASE] == NULL){
currentNode->children_[*word1-CASE]=new Node();
currentNode->children_[*word1-CASE]->parent_=currentNode;
}
currentNode=currentNode->children_[*word1-CASE];
++word1;
}
++currentNode->occurrences_;
// cout<<"Word is successfully entered in the dictionary\n";
};
void InsertNode2(Node* trieTree,string word, string syn, string ant){
int n = word.length();
char array[20 + 1];
strcpy(array, word.c_str());
char * word1 = array;
Node* currentNode = trieTree;
while(*word1!='\0'){
if(currentNode->children_[*word1-CASE] == NULL){
currentNode->children_[*word1-CASE]=new Node();
currentNode->children_[*word1-CASE]->parent_=currentNode;
}
currentNode=currentNode->children_[*word1-CASE];
++word1;
}
currentNode->synonyms = syn;
currentNode->antonyms = ant;
++currentNode->occurrences_;
};
Node* Search(Node* trieTree,char* abc)
{
while(*abc!='\0')
{
if (trieTree->children_[*abc - CASE]!=NULL){
trieTree=trieTree->children_[*abc - CASE];
++abc;
}
else return NULL;
}
if (trieTree->occurrences_!=0){
return trieTree;
}
else
{
return NULL;
}
}
Node* main_Search(Node* trieTree,char* abc)
{
while(*abc!='\0')
{
if (trieTree->children_[*abc - CASE]!=NULL){
trieTree=trieTree->children_[*abc - CASE];
++abc;
}
else return NULL;
}
//return (trieTree->occurrences_!=0) ? trieTree : NULL;
if (trieTree->occurrences_!=0){
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n_______________________________________________________________________________________________________________________";
cout<<"\n\n\n\t\t\t\t\t\t\tRESULT";
cout<<"\n\t\t\t\t\t\t\t______\n\n\n\n\n";
cout<<"\t\t\t\tWord exists in the dictionary :\t \n";
cout<<"\n\n_______________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
}
else
{
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n____________________________________________________________________________________________________________________";
cout<<"\n\n\n\t\t\t\t\t\t\tRESULT";
cout<<"\n\t\t\t\t\t\t\t______\n\n\n\n\n";
cout<<"\t\t\t\tWord does not exists in the dictionary :\t \n";
cout<<"\n\n____________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
}
}
void history()
{
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n________________________________________________________________________________________________________________________";
cout<<"\n\n\n\n\t\t\t\t\t\t\tHistory\n";
cout<<"\t\t\t\t\t\t\t_______\n\n";
char hist[10];
int X=1;
ifstream file("history.txt",ios::out);
cout<<"\t\t\t\t\t\tHistory of last searches is:";
while(!file.eof())
{
file>>hist;
cout<<"\n\t\t\t\t\t\t"<<X++<<"-"<<" "<<hist;
}
file.close();
cout<<"\n\n__________________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
}//making history function end
void meaning(Node* trieTree,char* abc){
int x=1;
// ifstream file("history.txt",ios::out);
Node* currentNode=Search(trieTree,abc);
if(currentNode!=NULL){
char *abc2[4803][2]={ {"a","(ay) the first letter of the English alphabet."},
{"b","(be) the second letter of the English alphabet."},
{"c","(see) the third letter of the English alphabet."},
{"d","(de) the fourth letter of the English alphabet."},
{"e","(ei) the fifth letter of the English alphabet."},
{"f","(eff) the sixth letter of the English alphabet."},
{"g","(gee) the seventh letter of the English alphabet."},
{"h","(aich) the eigtth letter of the English alphabet."},
{"i","(aye) the ninth letter of the English alphabet."},
{"j","(jay) the tenth letter of the English alphabet."},
{"k","(kay) the eleventh letter of the English alphabet."},
{"l","(ell) the twelveth letter of the English alphabet."},
{"m","(aym) the thirteenth letter of the English alphabet."},
{"n","(ayn) the fourteenth letter of the English alphabet."},
{"o","(oo) the fifteenth letter of the English alphabet."},
{"p","(pe) the sixteenth letter of the English alphabet."},
{"q","(qeu) the seventeenth letter of the English alphabet."},
{"r","(aar) the eigteenth letter of the English alphabet."},
{"s","(ess) the ninteenth letter of the English alphabet."},
{"t","(tee) the twenteenth letter of the English alphabet."},
{"u","(yu) the twenty one letter of the English alphabet."},
{"v","(vee) the twenty two letter of the English alphabet."},
{"w","(dublew) the twenty three letter of the English alphabet."},
{"x","(ax) the twenty four letter of the English alphabet."},
{"y","(wayee) the twenty fifth letter of the English alphabet."},
{"z","(zee or zed) twenty sixth letter of the English alphabet."},
//****************************AAAAAAA
{"abide","To wait; to pause; to delay."},
{"abider","One who abides, or continues."},
{"abidingly","Permanently."},
{"abies", "A genus of coniferous trees, properly called Fir, as the balsam fir and the silver fir. The spruces are sometimes also referred to this genus."},
{"abietic","Of or pertaining to the fir tree or its products; as, abietic acid, called also sylvic acid."},
{"abietin","Alt. of Abietine"},
{"abietine"," A resinous obtained from Strasburg turpentine or Canada balsam. It is without taste or smell, is insoluble in water, but soluble in alcohol (especially at the boiling point), in strong acetic acid, and in ether."},
{"abietinic"," Of or pertaining to abietin; as, abietinic acid."},
{"abietite","A substance resembling mannite, found in the needles of the common silver fir of Europe (Abies pectinata)."},
{"abigail"," A lady's waiting-maid."},
{"abiliment"," Habiliment."},
{"abilities"," of Ability"},
{"ability"," The quality or state of being able; power to perform, whether physical, moral, intellectual, conventional, or legal; capacity; skill or competence in doing; sufficiency of strength, skill, resources, etc.; -- in the plural, faculty, talent."},
{"abime"," Alt. of Abyme"},
{"abyme"," A abyss."},
{"abiogenesis"," The supposed origination of living organisms from lifeless matter; such genesis as does not involve the action of living parents; spontaneous generation; -- called also abiogeny, and opposed to biogenesis."},
{"abiogenetic"," Of or pertaining to abiogenesis."},
{"abiogenist"," One who believes that life can be produced independently of antecedent."},
{"abiogenous"," Produced by spontaneous generation."},
{"abiogeny"," Same as Abiogenesis."},
{"abiological"," Pertaining to the study of inanimate things."},
{"abirritant"," A medicine that diminishes irritation."},
{"abirritate","To diminish the sensibility of; to debilitate"},
{"abirritation","A pathological condition opposite to that of irritation; debility; want of strength; asthenia."},
{"abirritative","Characterized by abirritation or debility."},
{"abject", "Cast down; low-lying."},
{"bjection", "The state of being rejected or cast out."},
{"Abjectly"," Meanly; servilely."},
{"abjectness"," The state of being abject; abasement; meanness; servility."},
{"abjudge"," To take away by judicial decision."},
{"abjudicate"," To reject by judicial sentence; also, to abjudge."},
{"abjudication"," Rejection by judicial sentence."},
{"abjugate"," To unyoke."},
{"abjunctive"," Exceptional."},
{"abjuration"," The act of abjuring or forswearing; a renunciation upon oath; as, abjuration of the realm, a sworn banishment, an oath taken to leave the country and never to return."},
{"abjuratory"," Containing abjuration."},
{"abjured"," of Abjure"},
{"abjuring"," of Abjure"},
{"abjure"," To renounce upon oath; to forswear; to disavow; as, to abjure allegiance to a prince. To abjure the realm, is to swear to abandon it forever."},
{"abjurement"," Renunciation."},
{"abjurer"," One who abjures."},
{"ablactate"," To wean."},
{"ablactation"," The weaning of a child from the breast, or of young beasts from their dam."},
{"ablaqueation"," The act or process of laying bare the roots of trees to expose them to the air and water."},
{"ablastemic"," Non-germinal."},
{"ablation"," A carrying or taking away; removal."},
{"ablative"," Taking away or removing."},
{"able"," Fit; adapted; suitable."},
{"abler"," comp. of Able."},
{"abligate"," To tie up so as to hinder from."},
{"abloom"," In or into bloom; in a blooming state."},
{"ablude"," To be unlike; to differ."},
{"abluent"," Washing away; carrying off impurities; detergent."},
{"ablush"," Blushing; ruddy."},
{"abnodate"," To clear (tress) from knots."},
{"abnormal"," Not conformed to rule or system; deviating from the type; anomalous; irregular."},
{"abnormity"," Departure from the ordinary type; irregularity; monstrosity."},
{"aboard"," On board; into or within a ship or boat; hence, into or within a railway car."},
{"abodance"," An omen; a portending."},
{"abode"," pret. of Abide."},
{"abodement"," A foreboding; an omen."},
{"aborsive"," Abortive."},
{"abort"," To miscarry; to bring forth young prematurely."},
{"abase"," v. To lower in position, estimation, or the like; degrade."},
{"abbess"," n. The lady superior of a nunnery."},
{"abbey"," n. The group of buildings which collectively form the dwelling-place of a society of monks or nuns."},
{"abbot"," n. The superior of a community of monks."},
{"abdicate"," v. To give up (royal power or the like)."},
{"abdomen","n. In mammals, the visceral cavity between the diaphragm and the pelvic floor the belly."},
{"abdominal"," n. Of, pertaining to, or situated on the abdomen."},
{"abduction"," n. A carrying away of a person against his will, or illegally."},
{"abed"," adv. In bed; on a bed."},
{"aberration"," n. Deviation from a right, customary, or prescribed course."},
{"abet"," v. To aid, promote, or encourage the commission of (an offense)."},
{"abeyance"," n. A state of suspension or temporary inaction."},
{"abhorrence"," n. The act of detesting extremely."},
{"abhorrent"," adj. Very repugnant; hateful."},
{"abidance"," n. An abiding."},
{"abject"," adj. Sunk to a low condition."},
{"abjure"," v. To recant, renounce, repudiate under oath."},
{"able-bodied"," adj. Competent for physical service."},
{"ablution"," n. A washing or cleansing, especially of the body."},
{"abnegate"," v. To renounce (a right or privilege)."},
{"abnormal"," adj. Not conformed to the ordinary rule or standard."},
{"abominable"," adj. Very hateful."},
{"abominate"," v. To hate violently."},
{"abomination"," n. A very detestable act or practice."},
{"aboriginal"," adj. Primitive; unsophisticated."},
{"aborigines"," n. The original of earliest known inhabitants of a country."},
{"aboveboard","adv. & adj. Without concealment, fraud, or trickery."},
{"abrade"," v. To wear away the surface or some part of by friction."},
{"abrasion"," n. That which is rubbed off."},
{"abridge"," v. To make shorter in words, keeping the essential features, leaning out minor particles."},
{"abridgment"," n. A condensed form as of a book or play."},
{"abrogate"," v. To abolish, repeal."},
{"abrupt"," adj. Beginning, ending, or changing suddenly or with a break."},
{"abscess"," n. A Collection of pus in a cavity formed within some tissue of the body."},
{"abscission"," n. The act of cutting off, as in a surgical operation."},
{"abscond"," v. To depart suddenly and secretly, as for the purpose of escaping arrest."},
{"absence"," n. The fact of not being present or available."},
{"absent-minded"," adj. Lacking in attention to immediate surroundings or business."},
{"absolution"," n. Forgiveness, or passing over of offenses."},
{"absolve"," v. To free from sin or its penalties."},
{"absorb"," v. To drink in or suck up, as a sponge absorbs water."},
{"absorption"," n. The act or process of absorbing."},
{"abstain"," v. To keep oneself back (from doing or using something)."},
{"abstemious"," adj. Characterized by self denial or abstinence, as in the use of drink, food."},
{"abstinence"," n. Self denial."},
{"abstruse"," adj. Dealing with matters difficult to be understood."},
{"absurd"," adj. Inconsistent with reason or common sense."},
{"abundant"," adj. Plentiful."},
{"abusive"," adj. Employing harsh words or ill treatment."},
{"abut"," v. To touch at the end or boundary line."},
{"abyss"," n. Bottomless gulf."},
{"academic"," adj. Of or pertaining to an academy, college, or university."},
{"academician"," n. A member of an academy of literature, art, or science."},
{"academy"," n. Any institution where the higher branches of learning are taught."},
{"accede"," v. To agree."},
{"accelerate"," v. To move faster."},
{"accept"," v. To take when offered."},
{"access"," n. A way of approach or entrance; passage."},
{"accessible"," adj. Approachable."},
{"accession"," n. Induction or elevation, as to dignity, office, or government."},
{"accessory"," n. A person or thing that aids the principal agent."},
{"acclaim"," v. To utter with a shout."},
{"accommodate"," v. To furnish something as a kindness or favor."},
{"accompaniment"," n. A subordinate part or parts, enriching or supporting the leading part."},
{"accompanist"," n. One who or that which accompanies."},
{"accompany"," v. To go with, or be associated with, as a companion."},
{"accomplice"," n. An associate in wrong-doing."},
{"accomplish"," v. To bring to pass."},
{"accordion"," n. A portable free-reed musical instrument."},
{"accost"," v. To speak to."},
{"account"," n. A record or statement of receipts and expenditures, or of business transactions."},
{"accouter"," v. To dress."},
{"accredit"," v. To give credit or authority to."},
{"accumulate"," v. To become greater in quantity or number."},
{"accuracy"," n. Exactness."},
{"accurate"," adj. Conforming exactly to truth or to a standard."},
{"accursed"," adj. Doomed to evil, misery, or misfortune."},
{"accusation"," n. A charge of crime, misdemeanor, or error."},
{"accusatory"," adj. Of, pertaining to, or involving an accusation."},
{"accuse"," v. To charge with wrong doing, misconduct, or error."},
{"accustom"," v. To make familiar by use."},
{"acerbity"," n. Sourness, with bitterness and astringency."},
{"acetate"," n. A salt of acetic acid."},
{"acetic"," adj. Of, pertaining to, or of the nature of vinegar."},
{"ache"," v. To be in pain or distress."},
{"achillean"," adj. Invulnerable."},
{"achromatic"," adj. Colorless,"},
{"acid"," n. A sour substance."},
{"acidify"," v. To change into acid."},
{"acknowledge"," v. To recognize; to admit the genuineness or validity of."},
{"acknowledgment"," n. Recognition."},
{"acme"," n. The highest point, or summit."},
{"acoustic"," adj. Pertaining to the act or sense of hearing."},
{"acquaint"," v. To make familiar or conversant."},
{"acquiesce"," v. To comply; submit."},
{"acquiescence"," n. Passive consent."},
{"acquire"," v. To get as one's own."},
{"acquisition"," n. Anything gained, or made one's own, usually by effort or labor."},
{"acquit"," v. To free or clear, as from accusation."},
{"acquittal"," n. A discharge from accusation by judicial action."},
{"acquittance"," n. Release or discharge from indebtedness, obligation, or responsibility."},
{"acreage"," n. Quantity or extent of land, especially of cultivated land."},
{"acrid"," adj. Harshly pungent or bitter."},
{"acrimonious"," adj. Full of bitterness."},
{"acrimony"," n. Sharpness or bitterness of speech or temper."},
{"actionable"," adj. Affording cause for instituting an action, as trespass, slanderous words."},
{"actuality"," n. Any reality."},
{"actuary"," n. An officer, as of an insurance company, who calculates and states the risks and premiums."},
{"actuate"," v. To move or incite to action."},
{"acumen"," n. Quickness of intellectual insight, or discernment; keenness of discrimination."},
{"acute"," adj. Having fine and penetrating discernment."},
{"adamant"," n. Any substance of exceeding hardness or impenetrability."},
{"addendum"," n. Something added, or to be added."},
{"addle"," v. To make inefficient or worthless; muddle."},
{"adduce"," v. To bring forward or name for consideration."},
{"adhere"," v. To stick fast or together."},
{"adherence"," n. Attachment."},
{"adherent"," adj. Clinging or sticking fast."},
{"adhesion"," n. The state of being attached or joined."},
{"adjacency"," n. The state of being adjacent."},
{"adjacent"," n. That which is near or bordering upon."},
{"adjudge"," v. To award or bestow by formal decision."},
{"adjunct"," n. Something joined to or connected with another thing, but holding a subordinate place."},
{"adjuration"," n. A vehement appeal."},
{"adjutant"," adj. Auxiliary."},
{"administrator"," n. One who manages affairs of any kind."},
{"admissible"," adj. Having the right or privilege of entry."},
{"admittance"," n. Entrance, or the right or permission to enter."},
{"admonish"," v. To warn of a fault."},
{"admonition","n. Gentle reproof."},
{"ado"," n. unnecessary activity or ceremony."},
{"adoration"," n. Profound devotion."},
{"adroit"," adj. Having skill in the use of the bodily or mental powers."},
{"adulterant"," n. An adulterating substance."},
{"adulterate"," v. To make impure by the admixture of other or baser ingredients."},
{"adumbrate"," v. To represent beforehand in outline or by emblem."},
{"advent"," n. The coming or arrival, as of any important change, event, state, or personage."},
{"adverse"," adj. Opposing or opposed."},
{"adversity"," n. Misfortune."},
{"advert"," v. To refer incidentally."},
{"advertiser"," n. One who advertises, especially in newspapers."},
{"advisory"," adj. Not mandatory."},
{"advocacy"," n. The act of pleading a cause."},
{"advocate"," n. One who pleads the cause of another, as in a legal or ecclesiastical court."},
{"aerial"," adj. Of, pertaining to, or like the air."},
{"aeronaut"," n. One who navigates the air, a balloonist."},
{"aeronautics"," n. the art or practice of flying aircraft"},
{"aerostat"," n. A balloon or other apparatus floating in or sustained by the air."},
{"aerostatics"," n. The branch of pneumatics that treats of the equilibrium, pressure, and mechanical properties."},
{"affable"," adj. Easy to approach."},
{"affect"," v. To act upon"},
{"affectation"," n. A studied or ostentatious pretense or attempt."},
{"affiliate"," n. Some auxiliary person or thing."},
{"affirmative"," adj. Answering yes; to a question at issue."},
{"affix"," v. To fasten."},
{"affluence"," n. A profuse or abundant supply of riches."},
{"affront"," n. An open insult or indignity."},
{"afire"," adv. & adj. On fire, literally or figuratively."},
{"afoot"," adv. In progress."},
{"aforesaid"," adj. Said in a preceding part or before."},
{"afresh"," adv. Once more, after rest or interval."},
{"afterthought"," n. A thought that comes later than its appropriate or expected time."},
{"agglomerate"," v. To pile or heap together."},
{"aggrandize"," v. To cause to appear greatly."},
{"aggravate"," v. To make heavier, worse, or more burdensome."},
{"aggravation"," n. The fact of being made heavier or more heinous, as a crime , offense, misfortune, etc."},
{"aggregate"," n. The entire number, sum, mass, or quantity of something."},
{"aggress"," v. To make the first attack."},
{"aggression"," n. An unprovoked attack."},
{"aggrieve"," v. To give grief or sorrow to."},
{"aghast"," adj. Struck with terror and amazement."},
{"agile"," adj. Able to move or act quickly, physically, or mentally."},
{"agitate"," v. To move or excite (the feelings or thoughts)."},
{"agrarian"," adj. Pertaining to land, especially agricultural land."},
{"aide-de-camp"," n. An officer who receives and transmits the orders of the general."},
{"ailment"," n. Slight sickness."},
{"airy"," adj. Delicate, ethereal."},
{"akin"," adj. Of similar nature or qualities."},
{"alabaster"," n. A white or delicately tinted fine-grained gypsum."},
{"alacrity"," n. Cheerful willingness."},
{"albeit"," conj. Even though."},
{"albino"," n. A person with milky white skin and hair, and eyes with bright red pupil and usually pink iris."},
{"album"," n. A book whose leaves are so made to form paper frames for holding photographs or the like."},
{"alchemy"," n. Chemistry of the middle ages, characterized by the pursuit of changing base metals to gold."},
{"alcohol"," n. A volatile, inflammable, colorless liquid of a penetrating odor and burning taste."},
{"alcoholism"," n. A condition resulting from the inordinate or persistent use of alcoholic beverages."},
{"alcove"," n. A covered recess connected with or at the side of a larger room."},
{"alder"," n. Any shrub or small tree of the genus Alumnus, of the oak family."},
{"alderman"," n. A member of a municipal legislative body, who usually exercises also certain judicial functions."},
{"aldermanship"," n. The dignity, condition, office, or term of office of an alderman."},
{"alias"," n. An assumed name."},
{"alien"," n. One who owes allegiance to a foreign government."},
{"alienable"," adj. Capable of being aliened or alienated, as lands."},
{"alienate"," v. To cause to turn away."},
{"alienation"," n. Estrangement."},
{"aliment"," n. That which nourishes."},
{"alkali"," n. Anything that will neutralize an acid, as lime, magnesia, etc."},
{"allay ","v. To calm the violence or reduce the intensity of; mitigate."},
{"allege"," v. To assert to be true, especially in a formal manner, as in court."},
{"allegory"," n. The setting forth of a subject under the guise of another subject of aptly suggestive likeness."},
{"alleviate"," v. To make less burdensome or less hard to bear."},
{"alley"," n. A narrow street, garden path, walk, or the like."},
{"alliance"," n. Any combination or union for some common purpose."},
{"allot"," v. To assign a definite thing or part to a certain person."},
{"allotment"," n. Portion."},
{"allude"," v. To refer incidentally, or by suggestion."},
{"allusion"," n. An indirect and incidental reference to something without definite mention of it."},
{"alluvion"," n. Flood."},
{"ally"," n. A person or thing connected with another, usually in some relation of helpfulness."},
{"almanac"," n. A series of tables giving the days of the week together with certain"},
{"astronomical"," information."},
{"aloof"," adv. Not in sympathy with or desiring to associate with others."},
{"altar"," n. Any raised place or structure on which sacrifices may be offered or incense burned."},
{"alter"," v. To make change in."},
{"alteration"," n. Change or modification."},
{"altercate"," v. To contend angrily or zealously in words."},
{"alternate"," n. One chosen to act in place of another, in case of the absence or incapacity of that other."},
{"alternative"," n. Something that may or must exist, be taken or chosen, or done instead of something else."},
{"altitude"," n. Vertical distance or elevation above any point or base-level, as the sea."},
{"alto"," n. The lowest or deepest female voice or part."},
{"altruism"," n. Benevolence to others on subordination to self-interest."},
{"altruist"," n. One who advocates or practices altruism."},
{"amalgam"," n. An alloy or union of mercury with another metal."},
{"amalgamate"," v. To mix or blend together in a homogeneous body."},
{"amateur"," adj. Practicing an art or occupation for the love of it, but not as a profession."},
{"amatory"," adj. Designed to excite love."},
{"ambidextrous"," adj. Having the ability of using both hands with equal skill or ease."},
{"ambiguous"," adj. Having a double meaning."},
{"ambitious"," adj. Eagerly desirous and aspiring."},
{"ambrosial"," adj. Divinely sweet, fragrant, or delicious."},
{"ambulance"," n. A vehicle fitted for conveying the sick and wounded."},
{"ambulate"," v. To walk about"},
{"ambush"," n. The act or state of lying concealed for the purpose of surprising or attacking the enemy."},
{"ameliorate"," v. To relieve, as from pain or hardship"},
{"amenable"," adj. Willing and ready to submit."},
{"Americanism"," n. A peculiar sense in which an English word or phrase is used in the United States."},
{"amicable"," adj. Done in a friendly spirit."},
{"amity"," n. Friendship."},
{"amorous"," adj. Having a propensity for falling in love."},
{"amorphous"," adj. Without determinate shape."},
{"amour"," n. A love-affair, especially one of an illicit nature."},
{"ampere"," n. The practical unit of electric-current strength."},
{"ampersand"," n. The character &; and."},
{"amphibious"," adj. Living both on land and in water."},
{"amphitheater"," n. An edifice of elliptical shape, constructed about a central open space or arena."},
{"amplitude"," n. Largeness."},
{"amply"," adv. Sufficiently."},
{"amputate"," v. To remove by cutting, as a limb or some portion of the body."},
{"amusement"," n. Diversion."},
{"anachronism"," n. Anything occurring or existing out of its proper time."},
{"anagram"," n. The letters of a word or phrase so transposed as to make a different word or phrase."},
{"analogous"," adj. Corresponding (to some other) in certain respects, as in form, proportion, relations."},
{"analogy","n. Reasoning in which from certain and known relations or resemblance others are formed."},
{"analyst"," n. One who analyzes or makes use of the analytical method."},
{"analyze"," v. To examine minutely or critically."},
{"anarchy"," n. Absence or utter disregard of government."},
{"anathema"," n. Anything forbidden, as by social usage."},
{"anatomy"," n. That branch of morphology which treats of the structure of organisms."},
{"ancestry"," n. One's ancestors collectively."},
{"anecdote"," n. A brief account of some interesting event or incident."},
{"anemia"," n. Deficiency of blood or red corpuscles."},
{"anemic"," adj. Affected with anemia."},
{"anemometer"," n. An instrument for measuring the force or velocity of wind."},
{"anesthetic"," adj. Pertaining to or producing loss of sensation."},
{"anew"," adv. Once more."},
{"angelic"," adj. Saintly."},
{"anglophobia"," n. Hatred or dread of England or of what is English."},
{"anglo-Saxon"," n. The entire English race wherever found, as in Europe, the United States, or India."},
{"angular"," adj. Sharp-cornered."},
{"anhydrous"," adj. Withered."},
{"animadversion"," n. The utterance of criticism or censure."},
{"animadvert"," v. To pass criticism or censure."},
{"animalcule"," n. An animal of microscopic smallness."},
{"animate"," v. To make alive."},
{"animosity"," n. Hatred."},
{"annalist"," n. Historian."},
{"annals"," n. A record of events in their chronological order, year by year."},
{"annex"," v. To add or affix at the end."},
{"annihilate"," v. To destroy absolutely."},
{"annotate"," v. To make explanatory or critical notes on or upon."},
{"annual"," adj. Occurring every year."},
{"annuity n. An annual allowance, payment, or income."},
{"annunciation"," n. Proclamation."},
{"anode"," n. The point where or path by which a voltaic current enters an electrolyte or the like."},
{"anonymous"," adj. Of unknown authorship."},
{"antagonism"," n. Mutual opposition or resistance of counteracting forces, principles, or persons."},
{"antarctic"," adj. Pertaining to the south pole or the regions near it."},
{"ante"," v. In the game of poker, to put up a stake before the cards are dealt."},
{"antecede"," v. To precede."},
{"antecedent"," n. One who or that which precedes or goes before, as in time, place, rank, order, or causality."},
{"antechamber"," n. A waiting room for those who seek audience."},
{"antedate"," v. To assign or affix a date to earlier than the actual one."},
{"antediluvian"," adj. Of or pertaining to the times, things, events before the great flood in the days of Noah."},
{"antemeridian"," adj. Before noon."},
{"antemundane"," adj. Pertaining to time before the world's creation."},
{"antenatal"," adj. Occurring or existing before birth."},
{"anterior"," adj. Prior."},
{"anteroom"," n. A room situated before and opening into another, usually larger."},
{"anthology"," n. A collection of extracts from the writings of various authors."},
{"anthracite"," n. Hard coal."},
{"anthropology"," n. The science of man in general."},
{"anthropomorphous"," adj. Having or resembling human form."},
{"antic"," n. A grotesque, ludicrous, or fantastic action."},
{"antichrist"," n. Any opponent or enemy of Christ, whether a person or a power."},
{"anticlimax"," n. A gradual or sudden decrease in the importance or impressiveness of what is said."},
{"anticyclone"," n. An atmospheric condition of high central pressure, with currents flowing outward."},
{"antidote"," n. Anything that will counteract or remove the effects of poison, disease, or the like."},
{"apology"," n. A disclaimer of intentional error or offense."},
{"apostasy"," n. A total departure from one's faith or religion."},
{"apostate"," adj. False."},
{"apostle"," n. Any messenger commissioned by or as by divine authority."},
{"apothecary"," n. One who keeps drugs for sale and puts up prescriptions."},
{"apotheosis"," n. Deification."},
{"appall"," v. To fill with dismay or horror."},
{"apparent"," adj. Easily understood."},
{"apparition"," n. Ghost."},
{"appease"," v. To soothe by quieting anger or indignation."},
{"appellate"," adj. Capable of being appealed to."},
{"appellation"," n. The name or title by which a particular person, class, or thing is called."},
{"append"," v. To add or attach, as something accessory, subordinate, or supplementary."},
{"appertain"," v. To belong, as by right, fitness, association, classification, possession, or natural relation."},
{"apposite"," adj. Appropriate."},
{"apposition"," n. The act of placing side by side, together, or in contact."},
{"appraise"," v. To estimate the money value of."},
{"appreciable"," adj. Capable of being discerned by the senses or intellect."},
{"apprehend"," v. To make a prisoner of (a person) in the name of the law."},
{"apprehensible"," adj. Capable of being conceived."},
{"approbation"," n. Sanction."},
{"appropriate"," adj. Suitable for the purpose and circumstances."},
{"aqueduct"," n. A water-conduit, particularly one for supplying a community from a distance."},
{"aqueous"," adj. Of, pertaining to, or containing water."},
{"arbiter"," n. One chosen or appointed, by mutual consent of parties in dispute, to decide matters."},
{"arbitrary"," adj. Fixed or done capriciously."},
{"arbitrate"," v. To act or give judgment as umpire."},
{"arbor"," n. A tree."},
{"arboreal"," adj. Of or pertaining to a tree or trees."},
{"arborescent"," adj. Having the nature of a tree."},
{"arboretum"," n. A botanical garden or place devoted to the cultivation of trees or shrubs."},
{"arboriculture"," n. The cultivation of trees or shrubs."},
//*****************************BBBBBBBBBBBBBBBBBBBBBBBB
{"badger"," v. To pester"},
{"baffle"," v. To foil or frustrate."},
{"bailiff"," n. An officer of court having custody of prisoners under arraignment."},
{"baize"," n. A single-colored napped woolen fabric used for table-covers, curtains, etc"},
{"bale"," n. A large package prepared for transportation or storage."},
{"baleful"," adj. Malignant."},
{"ballad"," n. Any popular narrative poem, often with epic subject and usually in lyric form."},
{"balsam"," n. A medical preparation, aromatic and oily, used for healing."},
{"banal"," adj. Commonplace."},
{"barcarole"," n. A boat-song of Venetian gondoliers"},
{"barograph"," n. An instrument that registers graphically and continuously the atmospheric spressure."},
{"barometer"," n. An instrument for indicating the atmospheric pressure per unit of surface."},
{"barring"," prep. Apart from."},
{"baritone"," adj. Having a register higher than bass and lower than tenor."},
{"bask"," v. To make warm by genial heat."},
{"bass"," adj. Low in tone or compass."},
{"baste"," v. To cover with melted fat, gravy, while cooking."},
{"baton"," n. An official staff borne either as a weapon or as an emblem of authority or privilege."},
{"battalion"," n. A body of infantry composed of two or more companies, forming a part of a regiment."},
{"batten"," n. A narrow strip of wood."},
{"batter"," n. A thick liquid mixture of two or more materials beaten together, to be used in cookery."},
{"bauble"," n. A trinket."},
{"bawl"," v. To proclaim by outcry."},
{"beatify"," v. To make supremely happy."},
{"beatitude"," n. Any state of great happiness."},
{"beau"," n. An escort or lover."},
{"becalm"," v. To make quiet."},
{"beck"," v. To give a signal to, by nod or gesture."},
{"bedaub"," v. To smear over, as with something oily or sticky."},
{"bedeck"," v. To cover with ornament."},
{"bedlam"," n. Madhouse."},
{"befog"," v. To confuse."},
{"befriend"," v. To be a friend to, especially when in need."},
{"beget"," v. To produce by sexual generation."},
{"begrudge"," v. To envy one of the possession of."},
{"belate"," v. To delay past the proper hour."},
{"belay"," v. To make fast, as a rope, by winding round a cleat."},
{"belie"," v. To misrepresent."},
{"believe"," v. To accept as true on the testimony or authority of others."},
{"belittle"," v. To disparage."},
{"belle"," n. A woman who is a center of attraction because of her beauty, accomplishments, etc."},
{"bellicose"," adj. Warlike."},
{"belligerent"," adj. Manifesting a warlike spirit."},
{"bemoan"," v. To lament"},
{"benediction"," n. a solemn invocation of the divine blessing."},
{"benefactor"," n. A doer of kindly and charitable acts."},
{"benefice"," n. A church office endowed with funds or property for the maintenance of divine service."},
{"beneficent"," adj. Characterized by charity and kindness."},
{"beneficial"," adj. Helpful."},
{"beneficiary"," n. One who is lawfully entitled to the profits and proceeds of an estate or property."},
{"benefit"," n. Helpful result."},
{"benevolence"," n. Any act of kindness or well-doing."},
{"benevolent"," adj. Loving others and actively desirous of their well-being."},
{"benign"," adj. Good and kind of heart."},
{"benignant"," adj. Benevolent in feeling, character, or aspect."},
{"benignity"," n. Kindness of feeling, disposition, or manner."},
{"benison"," n. Blessing.'"},
{"bequeath"," v. To give by will.,"},
{"bereave"," v. To make desolate with loneliness and grief."},
{"berth"," n. A bunk or bed in a vessel, sleeping-car, etc."},
{"beseech"," v. To implore."},
{"beset"," v. To attack on all sides."},
{"besmear"," v. To smear over, as with any oily or sticky substance."},
{"bestial"," adj. Animal."},
{"bestrew"," v. To sprinkle or cover with things strewn."},
{"bestride"," v. To get or sit upon astride, as a horse."},
{"bethink"," v. To remind oneself."},
{"betide"," v. To happen to or befall."},
{"betimes"," adv. In good season or time."},
{"betroth"," v. To engage to marry."},
{"betrothal"," n. Engagement to marry."},
{"bevel"," n. Any inclination of two surfaces other than 90 degrees."},
{"bewilder"," v. To confuse the perceptions or judgment of."},
{"bibliomania"," n. The passion for collecting books."},
{"bibliography"," n. A list of the words of an author, or the literature bearing on a particular subject."},
{"bibliophile"," n. One who loves books."},
{"bibulous"," adj. Fond of drinking."},
{"bide"," v. To await."},
{"biennial"," n. A plant that produces leaves and roots the first year and flowers and fruit the second."},
{"bier"," n. A horizontal framework with two handles at each end for carrying a corpse to the grave."},
{"bigamist"," n. One who has two spouses at the same time."},
{"bigamy"," n. The crime of marrying any other person while having a legal spouse living."},
{"bight"," n. A slightly receding bay between headlands, formed by a long curve of a coast-line."},
{"bilateral"," adj. Two-sided."},
{"bilingual"," adj. Speaking two languages."},
{"biograph"," n. A bibliographical sketch or notice."},
{"biography"," n. A written account of one's life, actions, and character."},
{"biology"," n. The science of life or living organisms."},
{"biped"," n. An animal having two feet."},
{"birthright"," n. A privilege or possession into which one is born."},
{"bitterness"," n. Acridity, as to the taste."},
{"blase"," adj. Sated with pleasure."},
{"blaspheme","v. To indulge in profane oaths"},
{"blatant"," adj. Noisily or offensively loud or clamorous."},
{"blaze"," n. A vivid glowing flame."},
{"blazon"," v. To make widely or generally known."},
{"bleak"," adj. Desolate."},
{"blemish"," n. A mark that mars beauty."},
{"blithe"," adj. Joyous."},
{"blithesome"," adj. Cheerful."},
{"blockade"," n. The shutting up of a town, a frontier, or a line of coast by hostile forces."},
{"boatswain"," n. A subordinate officer of a vessel, who has general charge of the rigging, anchors, etc."},
{"bodice"," n. A women's ornamental corset-shaped laced waist."},
{"bodily"," adj. Corporeal."},
{"boisterous"," adj. Unchecked merriment or animal spirits."},
{"bole"," n. The trunk or body of a tree."},
{"bolero"," n. A Spanish dance, illustrative of the passion of love, accompanied by caste nets and singing."},
{"boll"," n. A round pod or seed-capsule, as a flax or cotton."},
{"bolster"," v. To support, as something wrong."},
{"bomb"," n. A hollow projectile containing an explosive material."},
{"bombard"," v. To assail with any missile or with abusive speech."},
{"bombardier"," n. A person who has charge of mortars, bombs, and shells."},
{"bombast"," n. Inflated or extravagant language, especially on unimportant subjects."},
{"boorish"," adj. Rude."},
{"bore"," v. To weary by tediousness or dullness."},
{"borough"," n. An incorporated village or town."},
{"bosom"," n. The breast or the upper front of the thorax of a human being, especially of a woman."},
{"botanical"," adj. Connected with the study, or cultivation of plants."},
{"botanize"," v. To study plant-life."},
{"botany"," n. The science that treats of plants."},
{"bountiful"," adj. Showing abundance."},
{"Bowdlerize"," v. To expurgate in editing (a literary composition) by omitting words or passages."},
{"bowler"," n. In cricket, the player who delivers the ball."},
{"boycott"," v. To place the products or merchandise of under a ban."},
{"brae"," n. Hillside."},
{"braggart"," n. A vain boaster."},
{"brandish"," v. To wave, shake, or flourish triumphantly or defiantly, as a sword or spear."},
{"bravado n. An aggressive display of boldness."},
{"bravo"," interj. Well done."},
{"bray"," n. A loud harsh sound, as the cry of an ass or the blast of a horn."},
{"braze"," v. To make of or ornament with brass."},
{"brazier"," n. An open pan or basin for holding live coals."},
{"breach"," n. The violation of official duty, lawful right, or a legal obligation."},
{"breaker"," n. One who trains horses, dogs, etc."},
{"breech"," n. The buttocks."},
{"brethren"," n. pl. Members of a brotherhood, gild, profession, association, or the like."},
{"brevity"," n. Shortness of duration."},
{"bric-a-brac"," n. Objects of curiosity or for decoration."},
{"bridle"," n. The head-harness of a horse consisting of a head-stall, a bit, and the reins."},
{"brigade"," n. A body of troops consisting of two or more regiments."},
{"brigadier"," n. General officer who commands a brigade, ranking between a colonel and a major-general."},
{"brigand"," n. One who lives by robbery and plunder."},
{"brimstone"," n. Sulfur."},
{"brine"," n. Water saturated with salt."},
{"bristle"," n. One of the coarse, stiff hairs of swine: used in brush-making, etc."},
{"britannia"," n. The United Kingdom of Great Britain."},
{"briticism"," n. A word, idiom, or phrase characteristic of Great Britain or the British."},
{"brittle"," adj. Fragile."},
{"broach"," v. To mention, for the first time."},
{"broadcast"," adj. Disseminated far and wide."},
{"brogan"," n. A coarse, heavy shoe."},
{"brogue"," n. Any dialectic pronunciation of English, especially that of the Irish people."},
{"brokerage"," n. The business of making sales and purchases for a commission; a broker."},
{"bromine"," n. A dark reddish-brown, non-metallic liquid element with a suffocating odor."},
{"bronchitis"," n. Inflammation of the bronchial tubes."},
{"bronchus"," n. Either of the two subdivisions of the trachea conveying air into the lungs."},
{"brooch"," n. An article of jewelry fastened by a hinged pin and hook on the underside."},
{"brotherhood"," n. Spiritual or social fellowship or solidarity."},
{"browbeat"," v. To overwhelm, or attempt to do so, by stern, haughty, or rude address or manner."},
{"brusque"," adj. Somewhat rough or rude in manner or speech."},
{"buffoon"," n. A clown."},
{"buffoonery"," n. Low drollery, coarse jokes, etc."},
{"bulbous"," adj. Of, or pertaining to, or like a bulb."},
{"bullock"," n. An ox."},
{"bulrush"," n. Any one of various tall rush-like plants growing in damp ground or water."},
{"bulwark"," n. Anything that gives security or defense."},
{"bumper"," n. A cup or glass filled to the brim, especially one to be drunk as a toast or health."},
{"bumptious"," adj. Full of offensive and aggressive self-conceit."},
{"bungle"," v. To execute clumsily."},
{"buoyancy"," n. Power or tendency to float on or in a liquid or gas."},
{"buoyant"," adj. Having the power or tendency to float or keep afloat."},
{"bureau"," n. A chest of drawers for clothing, etc."},
{"bureaucracy"," n. Government by departments of men transacting particular branches of public business."},
{"burgess"," n. In colonial times, a member of the lower house of the legislature of Maryland or Virginia."},
{"burgher"," n. An inhabitant, citizen or freeman of a borough burgh, or corporate town."},
{"burnish"," v. To make brilliant or shining."},
{"bursar"," n. A treasurer."},
{"bustle"," v. To hurry."},
{"butt"," v. To strike with or as with the head, or horns."},
{"butte"," n. A conspicuous hill, low mountain, or natural turret, generally isolated."},
{"buttress"," n. Any support or prop."},
//****************************CCCCCCCCCCCCCCC
{"cabal"," n. A number of persons secretly united for effecting by intrigue some private purpose."},
{"cabalism"," n. Superstitious devotion to one's religion."},
{"cabinet"," n. The body of men constituting the official advisors of the executive head of a nation."},
{"cacophony"," n. A disagreeable, harsh, or discordant sound or combination of sounds or tones."},
{"cadaverous"," adj. Resembling a corpse."},
{"cadenza"," n. An embellishment or flourish, prepared or improvised, for a solo voice or instrument."},
{"caitiff"," adj. Cowardly."},
{"cajole"," v. To impose on or dupe by flattering speech."},
{"cajolery"," n. Delusive speech."},
{"calculable"," adj. That may be estimated by reckoning."},
{"calculus"," n. A concretion formed in various parts of the body resembling a pebble in hardness."},
{"callosity"," n. The state of being hard and insensible."},
{"callow"," adj. Without experience of the world."},
{"calorie"," n. Amount of heat needed to raise the temperature of 1 kilogram of water 1 degree centigrade."},
{"calumny"," n. Slander."},
{"Calvary"," n. The place where Christ was crucified."},
{"Calvinism"," n. The system of doctrine taught by John Calvin."},
{"Calvinize"," v. To teach or imbue with the doctrines of Calvinism."},
{"came"," n. A leaden sash-bar or grooved strip for fastening panes in stained-glass windows."},
{"cameo"," n. Any small engraved or carved work in relief."},
{"campaign"," n. A complete series of connected military operations."},
{"Canaanite"," n. A member of one of the three tribes that dwelt in the land of Canaan, or western Palestine."},
{"canary"," adj. Of a bright but delicate yellow."},
{"candid"," adj. Straightforward."},
{"candor"," n. The quality of frankness or outspokenness."},
{"canine"," adj. Characteristic of a dog."},
{"canon"," n. Any rule or law."},
{"cant"," v. To talk in a singsong, preaching tone with affected solemnity."},
{"cantata"," n. A choral composition."},
{"canto"," n. One of the divisions of an extended poem."},
{"cantonment"," n. The part of the town or district in which the troops are quartered."},
{"capacious"," adj. Roomy."},
{"capillary"," n. A minute vessel having walls composed of a single layer of cells."},
{"capitulate"," v. To surrender or stipulate terms."},
{"caprice"," n. A whim."},
{"caption"," n. A heading, as of a chapter, section, document, etc."},
{"captious"," adj. Hypercritical."},
{"captivate"," v. To fascinate, as by excellence. eloquence, or beauty."},
{"carcass"," n. The dead body of an animal."},
{"cardiac"," adj. Pertaining to the heart."},
{"cardinal"," adj. Of prime or special importance."},
{"caret"," n. A sign (^) placed below a line, indicating where omitted words, etc., should be inserted."},
{"caricature"," n. a picture or description in which natural characteristics are exaggerated or distorted."},
{"carnage"," n. Massacre."},
{"carnal"," adj. Sensual."},
{"carnivorous"," adj. Eating or living on flesh."},
{"carouse"," v. To drink deeply and in boisterous or jovial manner."},
{"carrion"," n. Dead and putrefying flesh."},
{"cartilage"," n. An elastic animal tissue of firm consistence."},
{"cartridge"," n. A charge for a firearm, or for blasting."},
{"caste"," n. The division of society on artificial grounds."},
{"castigate"," v. To punish."},
{"casual"," adj. Accidental, by chance."},
{"casualty"," n. A fatal or serious accident or disaster."},
{"cataclysm"," n. Any overwhelming flood of water."},
{"cataract"," n. Opacity of the lens of the eye resulting in complete or partial blindness."},
{"catastrophe"," n. Any great and sudden misfortune or calamity."},
{"cathode"," n. The negative pole or electrode of a galvanic battery."},
{"Catholicism"," n. The system, doctrine, and practice of the Roman Catholic Church."},
{"catholicity"," n. Universal prevalence or acceptance."},
{"cat-o-nine-tails"," n. An instrument consisting of nine pieces of cord, formerly used for flogging in the army and navy."},
{"caucus"," n. A private meeting of members of a political party to select candidates."},
{"causal"," adj. Indicating or expressing a cause."},
{"caustic"," adj. Sarcastic and severe."},
{"cauterize"," v. To burn or sear as with a heated iron."},
{"cede"," v. To pass title to."},
{"censor"," n. An official examiner of manuscripts empowered to prohibit their publication."},
{"censorious"," adj. Judging severely or harshly."},
{"census"," n. An official numbering of the people of a country or district."},
{"centenary"," adj. Pertaining to a hundred years or a period of a hundred years."},
{"centiliter"," n. A hundredth of a liter."},
{"centimeter"," n. A length of one hundredth of a meter."},
{"centurion"," n. A captain of a company of one hundred infantry in the ancient Roman army."},
{"cereal"," adj. Pertaining to edible grain or farinaceous seeds."},
{"ceremonial"," adj. Characterized by outward form or ceremony."},
{"ceremonious"," adj. Observant of ritual."},
{"cessation"," n. Discontinuance, as of action or motion."},
{"cession"," n. Surrender, as of possessions or rights."},
{"chagrin"," n. Keen vexation, annoyance, or mortification, as at one's failures or errors."},
{"chameleon"," adj. Changeable in appearance."},
{"chancery"," n. A court of equity, as distinguished from a common-law court."},
{"chaos"," n. Any condition of which the elements or parts are in utter disorder and confusion."},
{"characteristic"," n. A distinctive feature."},
{"characterize"," v. To describe by distinctive marks or peculiarities."},
{"charlatan"," n. A quack."},
{"chasm"," n. A yawning hollow, as in the earth's surface."},
{"chasten"," v. To purify by affliction."},
{"chastise"," v. To subject to punitive measures."},
{"chastity"," n. Sexual or moral purity."},
{"chateau"," n. A castle or manor-house."},
{"chattel"," n. Any article of personal property."},
{"check"," v. To hold back."},
{"chiffon"," n. A very thin gauze used for trimmings, evening dress, etc."},
{"chivalry"," n. The knightly system of feudal times with its code, usages and practices."},
{"cholera"," n. An acute epidemic disease."},
{"choleric"," adj. Easily provoked to anger."},
{"choral"," adj. Pertaining to, intended for, or performed by a chorus or choir."},
{"Christ"," n. A title of Jesus"},
{"christen"," v. To name in baptism."},
{"Christendom"," n. That part of the world where Christianity is generally professed."},
{"chromatic"," adj. Belonging, relating to, or abounding in color."},
{"chronology"," n. The science that treats of computation of time or of investigation and arrangement of events."},
{"chronometer"," n. A portable timekeeper of the highest attainable precision."},
{"cipher"," v. To calculate arithmetically. (also a noun meaning zero or nothing)"},
{"circulate"," v. To disseminate."},
{"circumference"," n. The boundary-line of a circle."},
{"circumlocution"," n. Indirect or roundabout expression."},
{"circumnavigate"," v. To sail quite around."},
{"circumscribe"," v. To confine within bounds."},
{"circumspect"," adj. Showing watchfulness, caution, or careful consideration."},
{"citadel"," n. Any strong fortress."},
{"cite"," v. To refer to specifically."},
{"claimant"," n. One who makes a claim or demand, as of right."},
{"clairvoyance"," n. Intuitive sagacity or perception."},
{"clamorous"," adj. Urgent in complaint or demand."},
{"clan"," n. A tribe."},
{"clandestine"," adj. Surreptitious."},
{"clangor"," n. Clanking or a ringing, as of arms, chains, or bells; clamor."},
{"clarify"," v. To render intelligible."},
{"clarion"," n. A small shrill trumpet or bugle."},
{"classify"," v. To arrange in a class or classes on the basis of observed resemblance; and differences."},
{"clearance"," n. A certificate from the proper authorities that a vessel has complied with the law and may sail."},
{"clemency"," n. Mercy."},
{"clement"," adj. Compassionate."},
{"close-hauled"," adj. Having the sails set for sailing as close to the wind as possible."},
{"clothier"," n. One who makes or sells cloth or clothing."},
{"clumsy"," adj. Awkward of movement."},
{"coagulate"," v. To change into a clot or a jelly, as by heat, by chemical action, or by a ferment."},
{"coagulant"," adj. Producing coagulation."},
{"coalescence"," n. The act or process of coming together so as to form one body,"},
{"combination",", or product."},
{"coalition"," n. Combination in a body or mass."},
{"coddle"," v. To treat as a baby or an invalid."},
{"codicil"," n. A supplement adding to, revoking, or explaining in the body of a will."},
{"coerce"," v. To force."},
{"coercion"," n. Forcible constraint or restraint, moral or physical."},
{"coercive"," adj. Serving or tending to force."},
{"cogent"," adj. Appealing strongly to the reason or conscience."},
{"cognate"," adj. Akin."},
{"cognizant"," adj. Taking notice."},
{"cohere"," v. To stick together."},
{"cohesion"," n. Consistency."},
{"cohesive"," adj. Having the property of consistency."},
{"coincide"," v. To correspond."},
{"coincidence"," n. A circumstance so agreeing with another: often implying accident."},
{"coincident"," adj. Taking place at the same time."},
{"collaborate"," v. To labor or cooperate with another or others, especially in literary or scientific pursuits."},
{"collapse"," v. To cause to shrink, fall in, or fail."},
{"collapsible"," adj. That may or can collapse."},
{"colleague"," n. An associate in professional employment."},
{"collective"," adj. Consisting of a number of persons or objects considered as gathered into a mass, or sum."},
{"collector"," n. One who makes a collection, as of objects of art, books, or the like."},
{"collegian"," n. A college student."},
{"collide"," v. To meet and strike violently."},
{"collier"," n. One who works in a coal-mine."},
{"collision"," n. Violent contact."},
{"colloquial"," adj. Pertaining or peculiar to common speech as distinguished from literary."},
{"colloquialism"," n. Form of speech used only or chiefly in conversation."},
{"colloquy"," n. Conversation."},
{"collusion"," n. A secret agreement for a wrongful purpose."},
{"colossus"," n. Any strikingly great person or object."},
{"comely"," adj. Handsome."},
{"comestible"," adj. Fit to be eaten."},
{"comical"," adj. Funny."},
{"commemorate"," v. To serve as a remembrance of."},
{"commentary"," n. A series of illustrative or explanatory notes on any important work."},
{"commingle"," v. To blend."},
{"commissariat"," n. The department of an army charged with the provision of its food and water and daily needs."},
{"commission"," v. To empower."},
{"commitment"," n. The act or process of entrusting or consigning for safe-keeping."},
{"committal"," n. The act, fact, or result of committing, or the state of being"},
{"commodity"," n. Something that is bought and sold."},
{"commotion"," n. A disturbance or violent agitation."},
{"commute"," v. To put something, especially something less severe, in place of."},
{"comparable"," adj. Fit to be compared."},
{"comparative"," adj. Relative."},
{"comparison"," n. Examination of two or more objects with reference to their likeness or unlikeness."},
{"compensate"," v. To remunerate."},
{"competence"," n. Adequate qualification or capacity."},
{"competent"," adj. Qualified."},
{"competitive"," adj. characterized by rivalry."},
{"competitor"," n. A rival."},
{"complacence"," n. Satisfaction with one's acts or surroundings."},
{"complacent"," adj. Pleased or satisfied with oneself."},
{"complaisance"," n. Politeness."},
{"complaisant"," adj. Agreeable."},
{"complement"," v. To make complete."},
{"complex"," adj. Complicated."},
{"compliant"," adj. Yielding."},
{"complicate"," v. To make complex, difficult, or hard to deal with."},
{"complication"," n. An intermingling or combination of things or parts, especially in a perplexing manner."},
{"complicity"," n. Participation or partnership, as in wrong-doing or with a wrong-doer."},
{"compliment"," v. To address or gratify with expressions of delicate praise."},
{"component"," n. A constituent element or part."},
{"comport"," v. To conduct or behave (oneself)."},
{"composure"," n. Calmness."},
{"comprehensible"," adj. Intelligible."},
{"comprehension"," n. Ability to know."},
{"comprehensive"," adj. Large in scope or content."},
{"compress"," v. To press together or into smaller space."},
{"compressible"," adj. Capable of being pressed into smaller compass."},
{"compression"," n. Constraint, as by force or authority."},
{"comprise"," v. To consist of."},
{"compulsion"," n. Coercion."},
{"compulsory"," adj. Forced."},
{"compunction"," n. Remorseful feeling."},
{"compute"," v. To ascertain by mathematical calculation."},
{"concede"," v. To surrender."},
{"conceit"," n. Self-flattering opinion."},
{"conceive"," v. To form an idea, mental image or thought of."},
{"concerto"," n. A musical composition."},
{"concession"," n. Anything granted or yielded, or admitted in response to a demand, petition, or claim."},
{"conciliate"," v. To obtain the friendship of."},
{"conciliatory"," adj. Tending to reconcile."},
{"conclusive"," adj. Sufficient to convince or decide."},
{"concord"," n. Harmony."},
{"concordance"," n. Harmony."},
{"concur"," v. To agree."},
{"concurrence"," n. Agreement."},
{"concurrent"," adj. Occurring or acting together."},
{"concussion"," n. A violent shock to some organ by a fall or a sudden blow."},
{"condensation"," n. The act or process of making dense or denser."},
{"condense"," v. To abridge."},
{"condescend"," v. To come down voluntarily to equal terms with inferiors."},
{"condolence"," n. Expression of sympathy with a person in pain, sorrow, or misfortune."},
{"conduce"," v. To bring about."},
{"conducive"," adj. Contributing to an end."},
{"conductible"," adj. Capable of being conducted or transmitted."},
{"conduit"," n. A means for conducting something, particularly a tube, pipe, or passageway for a fluid."},
{"confectionery"," n. The candy collectively that a confectioner makes or sells, as candy."},
{"confederacy"," n. A number of states or persons in compact or league with each other, as for mutual aid."},
{"confederate"," n. One who is united with others in a league, compact, or agreement."},
{"confer"," v. To bestow."},
{"conferee"," n. A person with whom another confers."},
{"confessor"," n. A spiritual advisor."},
{"confidant"," n. One to whom secrets are entrusted."},
{"confide"," v. To reveal in trust or confidence."},
{"confidence"," n. The state or feeling of trust in or reliance upon another."},
{"confident"," adj. Assured."},
{"confinement"," n. Restriction within limits or boundaries."},
{"confiscate"," v. To appropriate (private property) as forfeited to the public use or treasury."},
{"conflagration"," n. A great fire, as of many buildings, a forest, or the like."},
{"confluence"," n. The place where streams meet."},
{"confluent"," n. A stream that unites with another."},
{"conformance"," n. The act or state or conforming."},
{"conformable"," adj. Harmonious."},
{"conformation"," n. General structure, form, or outline."},
{"conformity"," n. Correspondence in form, manner, or use."},
{"confront"," v. To encounter, as difficulties or obstacles."},
{"congeal"," v. To coagulate."},
{"congenial"," adj. Having kindred character or tastes."},
{"congest"," v. To collect into a mass."},
{"congregate"," v. To bring together into a crowd."},
{"coniferous"," adj. Cone-bearing trees."},
{"conjecture"," n. A guess."},
{"conjoin"," v. To unite."},
{"conjugal"," adj. Pertaining to marriage, marital rights, or married persons."},
{"conjugate"," adj. Joined together in pairs."},
{"conjugation"," n. The state or condition of being joined together."},
{"conjunction"," n. The state of being joined together, or the things so joined."},
{"connive"," v. To be in collusion."},
{"connoisseur"," n. A critical judge of art, especially one with thorough knowledge and sound judgment of art."},
{"connote"," v. To mean; signify."},
{"connubial"," adj. Pertaining to marriage or matrimony."},
{"conquer"," v. To overcome by force."},
{"consanguineous"," adj. Descended from the same parent or ancestor."},
{"conscience"," n. The faculty in man by which he distinguishes between right and wrong in character and conduct."},
{"conscientious"," adj. Governed by moral standard."},
{"conscious"," adj. Aware that one lives, feels, and thinks."},
{"conscript"," v. To force into military service."},
{"consecrate"," v. To set apart as sacred."},
{"consecutive"," adj. Following in uninterrupted succession."},
{"consensus"," n. A collective unanimous opinion of a number of persons."},
{"conservatism"," n. Tendency to adhere to the existing order of things."},
{"conservative"," adj. Adhering to the existing order of things."},
{"conservatory"," n. An institution for instruction and training in music and declamation."},
{"consign"," v. To entrust."},
{"consignee"," n. A person to whom goods or other property has been entrusted."},
{"consigno","r n. One who entrusts."},
{"consistency"," n. A state of permanence."},
{"console"," v. To comfort."},
{"consolidate"," v. To combine into one body or system."},
{"consonance"," n. The state or quality of being in accord with."},
{"consonant"," adj. Being in agreement or harmony with."},
{"consort"," n. A companion or associate."},
{"conspicuous"," adj. Clearly visible."},
{"conspirator"," n. One who agrees with others to cooperate in accomplishing some unlawful purpose."},
{"conspire"," v. To plot."},
{"constable"," n. An officer whose duty is to maintain the peace."},
{"constellation"," n. An arbitrary assemblage or group of stars."},
{"consternation"," n. Panic."},
{"constituency"," n. The inhabitants or voters in a district represented in a legislative body."},
{"constituent"," n. One who has the right to vote at an election."},
{"constrict"," v. To bind."},
{"consul"," n. An officer appointed to reside in a foreign city, chiefly to represent his country."},
{"consulate"," n. The place in which a consul transacts official business."},
{"consummate"," v. To bring to completion."},
{"consumption"," n. Gradual destruction, as by burning, eating, etc., or by using up, wearing out, etc."},
{"consumptive"," adj. Designed for gradual destruction."},
{"contagion"," n. The communication of disease from person to person."},
{"contagious"," adj. Transmitting disease."},
{"contaminate"," v. To pollute."},
{"contemplate"," v. To consider thoughtfully."},
{"contemporaneous"," adj. Living, occurring, or existing at the same time."},
{"contemporary"," adj. Living or existing at the same time."},
{"contemptible"," adj. Worthy of scorn or disdain."},
{"contemptuous"," adj. Disdainful."},
{"contender"," n. One who exerts oneself in opposition or rivalry."},
{"contiguity"," n. Proximity."},
{"contiguous"," adj. Touching or joining at the edge or boundary."},
{"continence"," n. Self-restraint with respect to desires, appetites, and passion."},
{"contingent"," adj. Not predictable."},
{"continuance"," n. Permanence."},
{"continuation"," n. Prolongation."},
{"continuity"," n. Uninterrupted connection in space, time, operation, or development."},
{"continuous"," adj. Connected, extended, or prolonged without separation or interruption of sequence."},
{"contort"," v. To twist into a misshapen form."},
{"contraband"," n. Trade forbidden by law or treaty."},
{"contradiction"," n. The assertion of the opposite of that which has been said."},
{"contradictory"," adj. Inconsistent with itself."},
{"contraposition"," n. A placing opposite."},
{"contravene"," v. To prevent or obstruct the operation of."},
{"contribution"," n. The act of giving for a common purpose."},
{"contributor"," n. One who gives or furnishes, in common with others, for a common purpose."},
{"contrite"," adj. Broken in spirit because of a sense of sin."},
{"contrivance"," n. The act planning, devising, inventing, or adapting something to or for a special purpose."},
{"contrive"," v. To manage or carry through by some device or scheme."},
{"control"," v. To exercise a directing, restraining, or governing influence over."},
{"controller"," n. One who or that which regulates or directs."},
{"contumacious"," adj. Rebellious."},
{"contumacy"," n. Contemptuous disregard of the requirements of rightful authority."},
{"contuse"," v. To bruise by a blow, either with or without the breaking of the skin."},
{"contusion"," n. A bruise."},
{"convalesce"," v. To recover after a sickness."},
{"convalescence"," n. The state of progressive restoration to health and strength after the cessation of disease."},
{"convalescent"," adj. Recovering health after sickness."},
{"convene"," v. To summon or cause to assemble."},
{"convenience"," n. Fitness, as of time or place."},
{"converge"," v. To cause to incline and approach nearer together."},
{"convergent"," adj. Tending to one point."},
{"conversant"," adj. Thoroughly informed."},
{"conversion"," n. Change from one state or position to another, or from one form to another."},
{"convertible"," adj. Interchangeable."},
{"convex"," adj. Curving like the segment of the globe or of the surface of a circle."},
{"conveyance"," n. That by which anything is transported."},
{"convivial"," adj. Devoted to feasting, or to good-fellowship in eating or drinking."},
{"convolution"," n. A winding motion."},
{"convolve"," v. To move with a circling or winding motion."},
{"convoy"," n. A protecting force accompanying property in course of transportation."},
{"convulse"," v. To cause spasms in."},
{"convulsion"," n. A violent and abnormal muscular contraction of the body."},
{"copious"," adj. Plenteous."},
{"coquette"," n. A flirt."},
{"cornice"," n. An ornamental molding running round the walls of a room close to the ceiling."},
{"cornucopia"," n. The horn of plenty, symbolizing peace and prosperity."},
{"corollary"," n. A proposition following so obviously from another that it requires little demonstration."},
{"coronation"," n. The act or ceremony of crowning a monarch."},
{"coronet"," n. Inferior crown denoting, according to its form, various degrees of noble rank less than sovereign."},
{"corporal"," adj. Belonging or relating to the body as opposed to the mind."},
{"corporate"," adj. Belonging to a corporation."},
{"corporeal"," adj. Of a material nature; physical."},
{"corps"," n. A number or body of persons in some way associated or acting together."},
{"corpse"," n. A dead body."},
{"corpulent"," adj. Obese."},
{"corpuscle"," n. A minute particle of matter."},
{"correlate"," v. To put in some relation of connection or correspondence."},
{"correlative"," adj. Mutually involving or implying one another."},
{"corrigible"," adj. Capable of reformation."},
{"corroborate"," v. To strengthen, as proof or conviction."},
{"corroboration"," n. Confirmation."},
{"corrode"," v. To ruin or destroy little by little."},
{"corrosion"," n. Gradual decay by crumbling or surface disintegration."},
{"corrosive"," n. That which causes gradual decay by crumbling or surface disintegration."},
{"corruptible"," adj. Open to bribery."},
{"corruption"," n. Loss of purity or integrity."},
{"cosmetic"," adj. Pertaining to the art of beautifying, especially the complexion."},
{"cosmic"," adj. Pertaining to the universe."},
{"cosmogony"," n. A doctrine of creation or of the origin of the universe."},
{"cosmography"," n. The science that describes the universe, including astronomy, geography, and geology."},
{"cosmology"," n. The general science of the universe."},
{"cosmopolitan"," adj. Common to all the world."},
{"cosmopolitanism"," n. A cosmopolitan character."},
{"cosmos"," n. The world or universe considered as a system, perfect in order and arrangement."},
{"counter","-claim n. A cross-demand alleged by a defendant in his favor against the plaintiff."},
{"counteract"," v. To act in opposition to."},
{"counterbalance"," v. To oppose with an equal force."},
{"countercharge"," v. To accuse in return."},
{"counterfeit"," adj. Made to resemble something else."},
{"counterpart"," n. Something taken with another for the completion of either."},
{"countervail"," v. To offset."},
{"counting-house"," n. A house or office used for transacting business, bookkeeping,"},
{"countryman"," n. A rustic."},
{"courageous"," adj. Brave."},
{"course"," n. Line of motion or direction."},
{"courser"," n. A fleet and spirited horse."},
{"courtesy"," n. Politeness originating in kindness and exercised habitually."},
{"covenant"," n. An agreement entered into by two or more persons or parties."},
{"covert"," adj. Concealed, especially for an evil purpose."},
{"covey"," n. A flock of quails or partridges."},
{"cowe","r v. To crouch down tremblingly, as through fear or shame."},
{"coxswain"," n. One who steers a rowboat, or one who has charge of a ship's boat and its crew under an officer."},
{"crag"," n. A rugged, rocky projection on a cliff or ledge."},
{"cranium"," n. The skull of an animal, especially that part enclosing the brain."},
{"crass"," adj. Coarse or thick in nature or structure, as opposed to thin or fine."},
{"craving","n. A vehement desire."},
{"creak"," n. A sharp, harsh, squeaking sound."},
{"creamery"," n. A butter-making establishment."},
{"creamy"," adj. Resembling or containing cream."},
{"credence"," n. Belief."},
{"credible"," adj. Believable."},
{"credulous"," adj. Easily deceived."},
{"creed"," n. A formal summary of fundamental points of religious belief."},
{"crematory"," adj. A place for cremating dead bodies."},
{"crevasse"," n. A deep crack or fissure in the ice of a glacier."},
{"crevice"," n. A small fissure, as between two contiguous surfaces."},
{"criterion"," n. A standard by which to determine the correctness of a judgment or conclusion."},
{"critique"," n. A criticism or critical review."},
{"crockery"," n. Earthenware made from baked clay."},
{"crucible"," n. A trying and purifying test or agency."},
{"crusade"," n. Any concerted movement, vigorously prosecuted, in behalf of an idea or principle."},
{"crustacean"," adj. Pertaining to a division of arthropods, containing lobsters, crabs, crawfish, etc."},
{"crustaceous"," adj. Having a crust-like shell."},
{"cryptogram"," n. Anything written in characters that are secret or so arranged as to have hidden meaning."},
{"crystallize"," v. To bring together or give fixed shape to."},
{"cudgel"," n. A short thick stick used as a club."},
{"culinary"," adj. Of or pertaining to cooking or the kitchen."},
{"cull"," v. To pick or sort out from the rest."},
{"culpable"," adj. Guilty."},
{"culprit"," n. A guilty person."},
{"culvert"," n. Any artificial covered channel for the passage of water through a bank or under a road, canal."},
{"cupidity"," n. Avarice."},
{"curable"," adj. Capable of being remedied or corrected."},
{"curator"," n. A person having charge as of a library or museum."},
{"curio"," n. A piece of bric-a-brac."},
{"cursive"," adj. Writing in which the letters are joined together."},
{"cursory"," adj. Rapid and superficial."},
{"curt"," adj. Concise, compressed, and abrupt in act or expression."},
{"curtail"," v. To cut off or cut short."},
{"curtsy"," n. A downward movement of the body by bending the knees."},
{"cycloid"," adj. Like a circle."},
{"cygnet"," n. A young swan."},
{"cynical"," adj. Exhibiting moral skepticism."},
{"cynicism"," n. Contempt for the opinions of others and of what others value."},
{"cynosure"," n. That to which general interest or attention is directed."},
//****************************DDDDDDDDDDDDDDDDDD
{"darkling"," adv. Blindly."},
{"darwinism"," n. The doctrine that natural selection has been the prime cause of evolution of higher forms."},
{"dastard"," n. A base coward."},
{"datum"," n. A premise, starting-point, or given fact."},
{"dauntless"," adj. Fearless."},
{"day-man"," n. A day-laborer."},
{"dead-heat"," n. A race in which two or more competitors come out even, and there is no winner."},
{"dearth"," n. Scarcity, as of something customary, essential ,or desirable."},
{"death's-head"," n. A human skull as a symbol of death."},
{"debase"," v. To lower in character or virtue."},
{"debatable"," adj. Subject to contention or dispute."},
{"debonair"," adj. Having gentle or courteous bearing or manner."},
{"debut"," n. A first appearance in society or on the stage."},
{"decagon"," n. A figure with ten sides and ten angles."},
{"decagram"," n. A weight of 10 grams."},
{"decaliter"," n. A liquid and dry measure of 10 liters."},
{"decalogue"," n. The ten commandments."},
{"decameron"," n. A volume consisting of ten parts or books."},
{"decameter"," n. A length of ten meters."},
{"decamp"," v. To leave suddenly or unexpectedly."},
{"decapitate"," v. To behead."},
{"decapod"," adj. Ten-footed or ten-armed."},
{"decasyllable"," n. A line of ten syllables."},
{"deceit"," n. Falsehood."},
{"deceitful"," adj. Fraudulent."},
{"deceive"," v. To mislead by or as by falsehood."},
{"decency"," n. Moral fitness."},
{"decent"," adj. Characterized by propriety of conduct, speech, manners, or dress."},
{"deciduous"," adj. Falling off at maturity as petals after flowering, fruit when ripe, etc."},
{"decimal"," adj. Founded on the number 10."},
{"decimate"," v. To destroy a measurable or large proportion of."},
{"decipher"," v. To find out the true words or meaning of, as something hardly legible."},
{"decisive"," ad. Conclusive."},
{"declamation"," n. A speech recited or intended for recitation from memory in public."},
{"declamatory"," adj. A full and formal style of utterance."},
{"declarative"," adj. Containing a formal, positive, or explicit statement or affirmation."},
{"declension"," n. The change of endings in nouns and adj. to express their different relations of gender."},
{"decorate"," v. To embellish."},
{"decorous"," adj. Suitable for the occasion or circumstances."},
{"decoy"," n. Anything that allures, or is intended to allures into danger or temptation."},
{"decrepit"," adj. Enfeebled, as by old age or some chronic infirmity."},
{"dedication"," n. The voluntary consecration or relinquishment of something to an end or cause."},
{"deduce"," v. To derive or draw as a conclusion by reasoning from given premises or principles."},
{"deface"," v. To mar or disfigure the face or external surface of."},
{"defalcate"," v. To cut off or take away, as a part of something."},
{"defamation"," n. Malicious and groundless injury done to the reputation or good name of another."},
{"defame"," v. To slander."},
{"default"," n. The neglect or omission of a legal requirement."},
{"defendant"," n. A person against whom a suit is brought."},
{"defensible"," adj. Capable of being maintained or justified."},
{"defensive"," adj. Carried on in resistance to aggression."},
{"defer"," v. To delay or put off to some other time."},
{"deference"," n. Respectful submission or yielding, as to another's opinion, wishes, or judgment."},
{"defiant"," adj. Characterized by bold or insolent opposition."},
{"deficiency"," n. Lack or insufficiency."},
{"deficient"," adj. Not having an adequate or proper supply or amount."},
{"definite"," adj. Having an exact signification or positive meaning."},
{"deflect"," v. To cause to turn aside or downward."},
{"deforest"," v. To clear of forests."},
{"deform"," v. To disfigure."},
{"deformity"," n. A disfigurement."},
{"defraud"," v. To deprive of something dishonestly."},
{"defray"," v. To make payment for."},
{"degeneracy"," n. A becoming worse."},
{"degenerate"," v. To become worse or inferior."},
{"degradation"," n. Diminution, as of strength or magnitude."},
{"degrade"," v. To take away honors or position from."},
{"dehydrate"," v. To deprive of water."},
{"deify"," v. To regard or worship as a god."},
{"deign"," v. To deem worthy of notice or account."},
{"deist"," n. One who believes in God, but denies supernatural revelation."},
{"deity"," n. A god, goddess, or divine person."},
{"deject"," v. To dishearten."},
{"dejection"," n. Melancholy."},
{"delectable"," adj. Delightful to the taste or to the senses."},
{"delectation"," n. Delight."},
{"deleterious"," adj. Hurtful, morally or physically."},
{"delicacy"," n. That which is agreeable to a fine taste."},
{"delineate"," v. To represent by sketch or diagram."},
{"deliquesce"," v. To dissolve gradually and become liquid by absorption of moisture from the air."},
{"delirious"," adj. Raving."},
{"delude"," v. To mislead the mind or judgment of."},
{"deluge"," v. To overwhelm with a flood of water."},
{"delusion"," n. Mistaken conviction, especially when more or less enduring."},
{"demagnetize"," v. To deprive (a magnet) of magnetism."},
{"demagogue"," n. An unprincipled politician."},
{"demeanor"," n. Deportment."},
{"demented"," adj. Insane."},
{"demerit"," n. A mark for failure or bad conduct."},
{"demise"," n. Death."},
{"demobilize"," v. To disband, as troops."},
{"demolish"," v. To annihilate."},
{"demonstrable"," adj. Capable of positive proof."},
{"demonstrate"," v. To prove indubitably."},
{"demonstrative"," adj. Inclined to strong exhibition or expression of feeling or thoughts."},
{"demonstrator"," n. One who proves in a convincing and conclusive manner."},
{"demulcent"," n. Any application soothing to an irritable surface"},
{"demurrage"," n. the detention of a vessel beyond the specified time of sailing."},
{"dendroid"," adj. Like a tree."},
{"dendrology"," n. The natural history of trees."},
{"denizen"," n. Inhabitant."},
{"denominate"," v. To give a name or epithet to."},
{"denomination"," n. A body of Christians united by a common faith and form of worship and discipline."},
{"denominator"," n. Part of a fraction which expresses the number of equal parts into which the unit is divided."},
{"denote"," v. To designate by word or mark."},
{"denouement"," n. That part of a play or story in which the mystery is cleared up."},
{"denounce"," v. To point out or publicly accuse as deserving of punishment, censure, or odium."},
{"dentifrice"," n. Any preparation used for cleaning the teeth."},
{"denude"," v. To strip the covering from."},
{"denunciation"," n. The act of declaring an action or person worthy of reprobation or punishment."},
{"deplete"," v. To reduce or lessen, as by use, exhaustion, or waste."},
{"deplorable"," adj. Contemptible."},
{"deplore"," v. To regard with grief or sorrow."},
{"deponent"," adj. Laying down."},
{"depopulate"," v. To remove the inhabitants from."},
{"deport"," v. To take or send away forcibly, as to a penal colony."},
{"deportment"," n. Demeanor."},
{"deposition"," n. Testimony legally taken on interrogatories and reduced to writing, for use as evidence in court."},
{"depositor"," n. One who makes a deposit, or has an amount deposited."},
{"depository"," n. A place where anything is kept in safety."},
{"deprave"," v. To render bad, especially morally bad."},
{"deprecate"," v. To express disapproval or regret for, with hope for the opposite."},
{"depreciate"," v. To lessen the worth of."},
{"depreciation"," n. A lowering in value or an underrating in worth."},
{"depress"," v. To press down."},
{"depression"," n. A falling of the spirits."},
{"depth"," n. Deepness."},
{"derelict"," adj. Neglectful of obligation."},
{"deride"," v. To ridicule."},
{"derisible"," adj. Open to ridicule."},
{"derision"," n. Ridicule."},
{"derivation"," n. That process by which a word is traced from its original root or primitive form and meaning."},
{"derivative"," adj. Coming or acquired from some origin."},
{"derive"," v. To deduce, as from a premise."},
{"dermatology"," n. The branch of medical science which relates to the skin and its diseases."},
{"derrick"," n. An apparatus for hoisting and swinging great weights."},
{"descendent"," adj. Proceeding downward."},
{"descent"," n. The act of moving or going downward."},
{"descry"," v. To discern."},
{"desert"," v. To abandon without regard to the welfare of the abandoned"},
{"desiccant"," n. Any remedy which, when applied externally, dries up or absorbs moisture, as that of wounds."},
{"designate"," v. To select or appoint, as by authority."},
{"desist"," v. To cease from action."},
{"desistance"," n. Cessation."},
{"despair"," n. Utter hopelessness and despondency."},
{"desperado"," n. One without regard for law or life."},
{"desperate"," adj. Resorted to in a last extremity, or as if prompted by utter despair."},
{"despicable"," adj. Contemptible."},
{"despite"," prep. In spite of."},
{"despond"," v. To lose spirit, courage, or hope."},
{"despondent"," adj. Disheartened."},
{"despot"," n. An absolute and irresponsible monarch."},
{"despotism"," n. Any severe and strict rule in which the judgment of the governed has little or no part."},
{"destitute"," adj. Poverty-stricken."},
{"desultory"," adj. Not connected with what precedes."},
{"deter"," v. To frighten away."},
{"deteriorate"," v. To grow worse."},
{"determinate"," adj. Definitely limited or fixed."},
{"determination"," n. The act of deciding."},
{"deterrent"," adj. Hindering from action through fear."},
{"detes","t v. To dislike or hate with intensity."},
{"detract"," v. To take away in such manner as to lessen value or estimation."},
{"detriment"," n. Something that causes damage, depreciation, or loss."},
{"detrude"," v. To push down forcibly."},
{"deviate"," v. To take a different course."},
{"devilry"," n. Malicious mischief."},
{"deviltry"," n. Wanton and malicious mischief."},
{"devious"," adj. Out of the common or regular track."},
{"devise"," v. To invent."},
{"devout"," adj. Religious."},
{"dexterity"," n. Readiness, precision, efficiency, and ease in any physical activity or in any mechanical work."},
{"diabolic"," adj. Characteristic of the devil."},
{"diacritical"," adj. Marking a difference."},
{"diagnose"," v. To distinguish, as a disease, by its characteristic phenomena."},
{"diagnosis"," n. Determination of the distinctive nature of a disease."},
{"dialect"," n. Forms of speech collectively that are peculiar to the people of a particular district."},
{"dialectician"," n. A logician."},
{"dialogue"," n. A formal conversation in which two or more take part."},
{"diaphanous"," adj. Transparent."},
{"diatomic"," adj. Containing only two atoms."},
{"diatribe"," n. A bitter or malicious criticism."},
{"dictum"," n. A positive utterance."},
{"didactic"," adj. Pertaining to teaching."},
{"difference"," n. Dissimilarity in any respect."},
{"differentia"," n. Any essential characteristic of a species by reason of which it differs from other species."},
{"differential"," adj. Distinctive."},
{"differentiate"," v. To acquire a distinct and separate character."},
{"diffidence"," n. Self-distrust."},
//****************************EEEEEEEEEEEE
{"earnest","adj.Ardent in spirit and speech."},
{"earthenware","n.Anything made of clay and baked in a kiln or dried in the sun."},
{"eatable","adj.Edible."},
{"ebullient","adj.Showing enthusiasm or exhilaration of feeling."},
{"eccentric","adj.Peculiar."},
{"eccentricity","n.Idiosyncrasy."},
{"eclipse","n.The obstruction of a heavenly body by its entering into the shadow of another body."},
{"economize","v.To spend sparingly."},
{"ecstasy","n.Rapturous excitement or exaltation."},
{"ecstatic","adj.Enraptured."},
{"edible","adj.Suitable to be eaten."},
{"edict","n.That which is uttered or proclaimed by authority as a rule of action."},
{"edify","v.To build up, or strengthen, especially in morals or religion."},
{"editorial","n.An article in a periodical written by the editor and published as an official argument."},
{"educe","v.To draw out."},
{"efface","v.To obliterate."},
{"effect","n.A consequence."},
{"effective","adj.Fit for a destined purpose."},
{"effectual","adj.Efficient."},
{"effeminacy","n.Womanishness."},
{"effeminate","adj.Having womanish traits or qualities."},
{"effervesce","v.To bubble up."},
{"effervescent","adj.Giving off bubbles of gas."},
{"effete","adj.Exhausted, as having performed its functions."},
{"efficacious","adj.Effective."},
{"efficacy","n.The power to produce an intended effect as shown in the production of it."},
{"efficiency","n.The state of possessing adequate skill or knowledge for the performance of a duty."},
{"efficient","adj.Having and exercising the power to produce effects or results."},
{"efflorescence","n.The state of being flowery, or a flowery appearance."},
{"efflorescent","adj.Opening in flower."},
{"effluvium","n.A noxious or ill-smelling exhalation from decaying or putrefying matter."},
{"effrontery","n.Unblushing impudence."},
{"effulgence","n.Splendor."},
{"effuse","v.To pour forth."},
{"effusion","n.an outpouring."},
{"egoism","n.The theory that places man's chief good in the completeness of self."},
{"egoist","n.One who advocates or practices egoism."},
{"egotism","n.Self-conceit."},
{"egotist","n.One given to self-mention or who is constantly telling of his own views and experiences."},
{"egregious","adj.Extreme."},
{"egress","n.Any place of exit."},
{"eject","v.To expel."},
{"elapse","v.To quietly terminate: said of time."},
{"elasticity","n.That property of matter by which a body tends to return to a former shape afterbeing changed."},
{"electrolysis","n.The process of decomposing a chemical compound by the passage of anelectric current."},
{"electrotype","n.A metallic copy of any surface, as a coin."},
{"elegy","n.A lyric poem lamenting the dead."},
{"element","n.A component or essential part."},
{"elicit","v.To educe or extract gradually or without violence."},
{"eligible","adj.Qualified for selection."},
{"eliminate","v.To separate and cast aside."},
{"Elizabethan","adj.Relating to Elizabeth, queen of England, or to her era."},
{"elocution","n.The art of correct intonation, inflection, and gesture in public speaking or reading."},
{"eloquent","adj.Having the ability to express emotion or feeling in lofty and impassioned speech."},
{"elucidate"," v.To bring out more clearly the facts concerning."},
{"elude","v.To evade the search or pursuit of by dexterity or artifice."},
{"elusion","n.Evasion."},
{"emaciate","v.To waste away in flesh."},
{"emanate","v.To flow forth or proceed, as from some source."},
{"emancipate","v.To release from bondage."},
{"embargo","n.Authoritative stoppage of foreign commerce or of any special trade."},
{"embark","v.To make a beginning in some occupation or scheme."},
{"embarrass","v.To render flustered or agitated."},
{"embellish","v.To make beautiful or elegant by adding attractive or ornamental features."},
{"embezzle","v.To misappropriate secretly."},
{"emblazon","v.To set forth publicly or in glowing terms."},
{"emblem"," n. A symbol."},
{"embody","v.To express, formulate, or exemplify in a concrete, compact or visible form."},
{"embolden","v.To give courage to."},
{"embolism","n.An obstruction or plugging up of an artery or other blood-vessel."},
{"embroil","v.To involve in dissension or strife."},
{"emerge"," v. To come into view or into existence."},
{"emergence","n. A coming into view."},
{"emergent adj.Coming into view."},
{"emeritus","adj. Retired from active service but retained to an honorary position."},
{"emigrant","n.One who moves from one place to settle in another."},
{"emigrate","v.To go from one country, state, or region for the purpose of settling or residing in another."},
{"eminence","n. An elevated position with respect to rank, place, character, condition, etc."},
{"eminent","adj.High in station, merit, or esteem."},
{"emit","v.To send or give out."},
{"emphasis","n.Any special impressiveness added to an utterance or act, or stress laid upon some word."},
{"emphasize","v.To articulate or enunciate with special impressiveness upon a word, or a group of words."},
{"emphatic","adj.Spoken with any special impressiveness laid upon an act, word, or set of words."},
{"employee","n.One who works for wages or a salary."},
{"employer","n.One who uses or engages the services of other persons for pay."},
{"emporium","n.A bazaar or shop."},
{"empower","v.To delegate authority to."},
{"emulate","v.To imitate with intent to equal or surpass."},
{"enact","v.To make into law, as by legislative act."},
{"enamor","v.To inspire with ardent love."},
{"encamp","v.To pitch tents for a resting-place."},
{"encomium","n. A formal or discriminating expression of praise."},
{"encompass","v.To encircle."},
{"encore","n.The call for a repetition, as of some part of a play or performance."},
{"encourage","v.To inspire with courage, hope, or strength of mind."},
{"encroach","v.To invade partially or insidiously and appropriate the possessions of another."},
{"encumber","v.To impede with obstacles."},
{"encyclical","adj.Intended for general circulation."},
{"encyclopedia","n. A work containing information on subjects, or exhaustive of one subject."},
{"endanger","v.To expose to peril."},
{"endear","v.To cause to be loved."},
{"endemic","adj.Peculiar to some specified country or people."},
{"endue"," v. To endow with some quality, gift, or grace, usually spiritual."},
{"endurable","adj.Tolerable."},
{"endurance","n.The ability to suffer pain, distress, hardship, or stress of any kind without succumbing."},
{"energetic","adj.Working vigorously."},
{"enervate","v.To render ineffective or inoperative."},
{"enfeeble","v.To debilitate."},
{"enfranchise","v.To endow with a privilege, especially with the right to vote."},
{"engender","n.To produce."},
{"engrave","v.To cut or carve in or upon some surface."},
{"engross","v.To occupy completely."},
{"enhance","v.To intensify."},
{"enigma","n.A riddle."},
{"enjoin v. To command."},
{"enkindle","v.To set on fire."},
{"enlighten","v. To cause to see clearly."},
{"enlist","v.To enter voluntarily the military service by formal enrollment."},
{"enmity","n.Hatred."},
{"ennoble","v.To dignify."},
{"enormity","n.Immensity."},
{"enormous","adj.Gigantic."},
{"enrage","v.To infuriate."},
{"enrapture","v.To delight extravagantly or intensely."},
{"enshrine","v.To keep sacred."},
{"ensnare","v.To entrap."},
{"entail","v.To involve; necessitate."},
{"entangle","v.To involve in difficulties, confusion, or complications."},
{"enthrall","v.To bring or hold under any overmastering influence."},
{"enthrone","v.To invest with sovereign power."},
{"enthuse","v.To yield to or display intense and rapturous feeling."},
{"enthusiastic","adj.Full of zeal and fervor."},
{"entirety","n.A complete thing."},
{"entomology","n.The branch of zoology that treats of insects."},
{"entrails","n.The internal parts of an animal."},
{"entreaty","n. An earnest request."},
{"entrée","n.The act of entering."},
{"entrench","v.To fortify or protect, as with a trench or ditch and wall."},
{"entwine","v.To interweave."},
{"enumerate","v.To name one by one."},
{"epic","n.A poem celebrating in formal verse the mythical achievements of great personages, heroes, etc."},
{"epicure","n.One who cultivates a delicate taste for eating and drinking."},
{"Epicurean","adj.Indulging, ministering, or pertaining to daintiness of appetite."},
{"epicycle","n.A circle that rolls upon the external or internal circumference of another circle."},
{"epicycloid","n.A curve traced by a point on the circumference of a circle which rolls upon another circle."},
{"epidemic","n.Wide-spread occurrence of a disease in a certain region."},
{"epidermis","n.The outer skin."},
{"epigram","n.A pithy phrasing of a shrewd observation."},
{"epilogue","n.The close of a narrative or dramatic poem."},
{"epiphany","n.Any appearance or bodily manifestation of a deity."},
{"episode","n.An incident or story in a literary work, separable from yet growing out of it."},
{"epitaph","n.An inscription on a tomb or monument in honor or in memory of the dead."},
{"epithet","n.Word used adjectivally to describe some quality or attribute of is objects, as in Father Aeneas."},
{"epitome","n.A simplified representation."},
{"epizootic","adj.Prevailing among animals."},
{"epoch","n.A interval of time, memorable for extraordinary events."},
{"epode","n.A species of lyric poems."},
{"equalize","v.To render uniform."},
{"equanimity","n.Evenness of mind or temper."},
{"equestrian","adj.Pertaining to horses or horsemanship."},
{"equilibrium","n.A state of balance."},
{"equitable","adj.Characterized by fairness."},
{"equity","n.Fairness or impartiality."},
{"equivalent","adj.Equal in value, force, meaning, or the like."},
{"equivocal","adj.Ambiguous."},
{"equivocate","v.To use words of double meaning."},
{"eradicate","v.To destroy thoroughly."},
{"errant","adj.Roving or wandering, as in search of adventure or opportunity for gallant deeds."},
{"erratic","adj.Irregular."},
{"erroneous","adj.Incorrect."},
{"erudite","adj.Very-learned."},
{"erudition","n.Extensive knowledge of literature, history, language, etc."},
{"eschew","v.To keep clear of."},
{"espy","v.To keep close watch."},
{"esquire","n.A title of dignity, office, or courtesy."},
{"essence","n.That which makes a thing to be what it is."},
{"esthetic","adj.Pertaining to beauty, taste, or the fine arts."},
{"estimable","adj.Worthy of respect."},
{"estrange","v.To alienate."},
{"estuary","n.A wide lower part of a tidal river."},
{"etcetera","Latin.And so forth."},
{"eugenic","adj.Relating to the development and improvement of race."},
{"eulogize","v.To speak or write a laudation of a person's life or character."},
{"eulogy","n.A spoken or written laudation of a person's life or character."},
{"euphemism","n.A figure of speech by which a phrase less offensive is substituted."},
{"euphonious","adj.Characterized by agreeableness of sound."},
{"euphony","n.Agreeableness of sound."},
{"eureka","Greek.I have found it."},
{"evade","v.To avoid by artifice."},
{"evanesce","v.To vanish gradually."},
{"evanescent","adj.Fleeting."},
{"evangelical","adj.Seeking the conversion of sinners."},
{"evangelist","n.A preacher who goes from place to place holding services."},
{"evasion","n.Escape."},
{"eventual","adj.Ultimate."},
{"evert","v.To turn inside out."},
{"evict","v.To dispossess pursuant to judicial decree."},
{"evidential","adj.Indicative."},
{"evince","v.To make manifest or evident."},
{"evoke","v.To call or summon forth."},
{"evolution","n.Development or growth."},
{"evolve","v.To unfold or expand."},
{"exacerbate","v.To make more sharp, severe, or virulent."},
{"exaggerate","v.To overstate."},
{"exasperate","v.To excite great anger in."},
{"excavate","v.To remove by digging or scooping out."},
{"exceed","v.To go beyond, as in measure, quality, value, action, power, skill, etc."},
{"excel","v.To be superior or distinguished."},
{"excellence","n.Possession of eminently or unusually good qualities."},
{"excellency","n.A title of honor bestowed upon various high officials."},
{"excellent","adj.Possessing distinguished merit."},
{"excerpt","n.An extract or selection from written or printed matter."},
{"excess","n.That which passes the ordinary, proper, or required limit, measure, or experience."},
{"excitable","adj.Nervously high-strung."},
{"excitation","n.Intensified emotion or action."},
{"exclamation","n.An abrupt or emphatic expression of thought or of feeling."},
{"exclude","v.To shut out purposely or forcibly."},
{"exclusion","n.Non-admission."},
{"excrescence","n.Any unnatural addition, outgrowth, or development."},
{"excretion","n.The getting rid of waste matter."},
{"excruciate","v.To inflict severe pain or agony upon."},
{"excursion","n.A journey."},
{"excusable","adj.Justifiable."},
{"execrable","adj.Abominable."},
{"execration","n.An accursed thing."},
{"executor","n.A person nominated by the will of another to execute the will."},
{"exegesis","n.Biblical exposition or interpretation."},
{"exemplar","n.A model, pattern, or original to be copied or imitated."},
{"exemplary","adj.Fitted to serve as a model or example worthy of imitation."},
{"exemplify","v.To show by example."},
{"exempt","adj.Free, clear, or released, as from some liability, or restriction affecting others."},
{"exert","v.To make an effort."},
{"exhale","v.To breathe forth."},
{"exhaust","v.To empty by draining off the contents."},
{"exhaustible","adj.Causing or tending to cause exhaustion."},
{"exhaustion","n.Deprivation of strength or energy."},
{"exhaustive","adj.Thorough and complete in execution."},
{"exhilarate","v.To fill with high or cheerful spirits."},
{"exhume","v.To dig out of the earth (what has been buried)."},
{"exigency","n.A critical period or condition."},
{"exigent","adj.Urgent."},
{"existence","n.Possession or continuance of being."},
{"exit","n.A way or passage out."},
{"exodus","n.A going forth or departure from a place or country, especially of many people."},
{"exonerate","v.To relieve or vindicate from accusation, imputation, or blame."},
{"exorbitance","n.Extravagance or enormity."},
{"exorbitant","adj.Going beyond usual and proper limits."},
{"exorcise","v.To cast or drive out by religious or magical means."},
{"exotic","adj.Foreign."},
{"expand","v.To increase in range or scope."},
{"expanse","n.A continuous area or stretch."},
{"expansion","n.Increase of amount, size, scope, or the like."},
{"expatriate","v.To drive from one's own countr"},
{"expect","v.To look forward to as certain or probable."},
{"expectancy","n.The act or state of looking forward to as certain or probable."},
{"expectorate","v.To cough up and spit forth."},
{"expediency","n.Fitness to meet the requirements of a particular case."},
{"expedient","adj.Contributing to personal advantage."},
{"expedite","v.To hasten the movement or progress of."},
{"expeditious","adj.Speedy."},
{"expend","v.To spend."},
{"expense","n.The laying out or expending or money or other resources, as time or strength."},
{"expiate","v.To make satisfaction or amends for."},
{"explicate","v.To clear from involvement."},
{"explicit","adj.Definite."},
{"explode","v.To cause to burst in pieces by force from within."},
{"explosion","n.A sudden and violent outbreak."},
{"explosive","adj.Pertaining to a sudden and violent outbreak."},
{"exposition","n.Formal presentation."},
{"expository","adj.Pertaining to a formal presentation."},
{"expostulate","v.To discuss."},
{"exposure","n.An open situation or position in relation to the sun, elements, or points of the compass."},
{"expressive","adj.Full of meaning."},
{"expulsion","n.Forcible ejection."},
{"extant","adj.Still existing and known."},
{"extemporaneous","adj.Done or made without much or any preparation."},
{"extempore","adv.Without studied or special preparation."},
{"extensible","adj.Capable of being thrust out."},
{"extension","n.A reaching or stretching out, as in space, time or scope."},
{"extensive","adj.Extended widely in space, time, or scope."},
{"extensor","n.muscle that causes extension."},
{"extenuate","v.To diminish the gravity or importance of."},
{"exterior","n.That which is outside."},
{"external","n.Anything relating or belonging to the outside."},
{"extinct","adj.Being no longer in existence."},
{"extinguish","v.To render extinct."},
{"extol","v.To praise in the highest terms."},
{"extort","v.To obtain by violence, threats, compulsion, or the subjection of another to some necessity."},
{"extortion","n.The practice of obtaining by violence or compulsion."},
{"extradite","v.To surrender the custody of."},
{"extradition","n.The surrender by a government of a person accused of crime to the justice of another government."},
{"extrajudicial","adj.Happening out of court."},
{"extraneous","adj.Having no essential relation to a subject."},
{"extraordinary","adj.Unusual."},
{"extravagance","n.Undue expenditure of money."},
{"extravagant","adj.Needlessly free or lavish in expenditure."},
{"extremist","n.One who supports extreme measures or holds extreme views."},
{"extremity","n.The utmost point, side, or border, or that farthest removed from a mean position."},
{"extricate","v.Disentangle."},
{"extrude","v.To drive out or away."},
{"exuberance","n.Rich supply."},
{"exuberant","adj.Marked by great plentifulness."},
//****************************FFFFFFFFFFFFFF
{"fabricate","v.To invent fancifully or falsely."},
{"fabulous","adj.Incredible."},
{"facet","n.One of the small triangular plane surfaces of a diamond or other gem."},
{"facetious","adj.Amusing."},
{"facial","adj.Pertaining to the face."},
{"facile","adj.Not difficult to do."},
{"facilitate","v.To make more easy."},
{"facility","n.Ease."},
{"facsimile","n.An exact copy or reproduction."},
{"faction","n.A number of persons combined for a common purpose."},
{"factious","adj.Turbulent."},
{"fallacious","adj.Illogical."},
{"fallacy","n.Any unsound or delusive mode of reasoning, or anything based on such reasoning."},
{"fallible","adj.Capable of erring."},
{"fallow","n.Land broken up and left to become mellow or to rest."},
{"famish","v.To suffer extremity of hunger or thirst."},
{"fanatic","n.A religious zealot."},
{"fancier","n.One having a taste for or interest in special objects."},
{"fanciless","adj.Unimaginative."},
{"fastidious","adj.Hard to please."},
{"fathom","n.A measure of length, 6 feet."},
{"fatuous","adj.Idiotic"},
{"faulty","adj.Imperfect."},
{"faun","n.One of a class of deities of the woods and herds represented as half human, with goats feet."},
{"fawn","n.A young deer."},
{"fealty","n.Loyalty."},
{"feasible","adj.That may be done, performed, or effected, practicable."},
{"federate","v.To league together."},
{"feint","n.Any sham, pretense, or deceptive movement."},
{"felicitate","v.To wish joy or happiness to, especially in view of a coming event."},
{"felicity","n.A state of well-founded happiness."},
{"felon","n.A criminal or depraved person."},
{"felonious","adj.Showing criminal or evil purpose."},
{"felony","n.One of the highest class of offenses, and punishable with death or imprisonment."},
{"feminine","adj.Characteristic of woman or womankind."},
{"fernery","n.A place in which ferns are grown."},
{"ferocious","adj.Of a wild, fierce, and savage nature."},
{"ferocity","n.Savageness."},
{"fervent","adj.Ardent in feeling."},
{"fervid","adj.Intense."},
{"fervor","n.Ardor or intensity of feeling."},
{"festal","adj.Joyous."},
{"festive","adj.Merry."},
{"fete","n.A festival or feast."},
{"fetus","n.The young in the womb or in the egg."},
{"feudal","adj.Pertaining to the relation of lord and vassal."},
{"feudalism","n.The feudal system."},
{"fez","n.A brimless felt cap in the shape of a truncated cone, usually red with a black tassel."},
{"fiasco","n.A complete or humiliating failure."},
{"fickle","adj.Unduly changeable in feeling, judgment, or purpose."},
{"fictitious","adj.Created or formed by the imagination."},
{"fidelity","n.Loyalty."},
{"fiducial","adj.Indicative of faith or trust."},
{"fief","n.A landed estate held under feudal tenure."},
{"filibuster","n.One who attempts to obstruct legislation."},
{"finale","n.Concluding performance."},
{"finality","n.The state or quality of being final or complete."},
{"finally","adv.At last."},
{"financial","adj.Monetary."},
{"financier","n.One skilled in or occupied with financial affairs or operations."},
{"finery","n.That which is used to decorate the person or dress."},
{"finesse","n.Subtle contrivance used to gain a point."},
{"finite","adj.Limited."},
{"fiscal","adj.Pertaining to the treasury or public finances of a government."},
{"fishmonger","n.One who sells fish."},
{"fissure","n.A crack or crack-like depression."},
{"fitful","adj.Spasmodic."},
{"fixture","n.One who or that which is expected to remain permanently in its position."},
{"flag-officer","n.The captain of a flag-ship."},
{"flagrant","adj.Openly scandalous."},
{"flamboyant","adj.Characterized by extravagance and in general by want of good taste."},
{"flatulence","n.Accumulation of gas in the stomach and bowels."},
{"flection","n.The act of bending."},
{"fledgling","n.A young bird."},
{"flexible","adj.Pliable."},
{"flimsy","adj.Thin and weak."},
{"flippant","adj.Having a light, pert, trifling disposition."},
{"floe","n.A collection of tabular masses of floating polar ice."},
{"flora","n.The aggregate of plants growing without cultivation in a district."},
{"floral","adj.Pertaining to flowers."},
{"florid","adj.Flushed with red."},
{"florist","n.A dealer in flowers."},
{"fluctuate","v.To pass backward and forward irregularly from one state or degree to another."},
{"fluctuation","n.Frequent irregular change back and forth from one state or degree to another."},
{"flue","n.A smoke-duct in a chimney."},
{"fluent","adj.Having a ready or easy flow of words or ideas."},
{"fluential","adj.Pertaining to streams."},
{"flux","n.A state of constant movement, change, or renewal."},
{"foggy","adj.Obscure."},
{"foible","n.A personal weakness or failing."},
{"foist","v.To palm off."},
{"foliage","n.Any growth of leaves."},
{"folio","n.A sheet of paper folded once, or of a size adapted to folding once."},
{"folklore","n.The traditions, beliefs, and customs of the common people."},
{"fondle","v.To handle tenderly and lovingly."},
{"foolery","n.Folly."},
{"foot-note","n.A note of explanation or comment at the foot of a page or column."},
{"foppery","n.Dandyism."},
{"foppish","adj.Characteristic of one who is unduly devoted to dress and the niceties of manners."},
{"forbearance","n.Patient endurance or toleration of offenses."},
{"forby","adv.Besides."},
{"forcible","adj.Violent."},
{"forecourt","n.A court opening directly from the street."},
{"forejudge","v.To judge of before hearing evidence."},
{"forepeak","n.The extreme forward part of a ship's hold, under the lowest deck."},
{"foreshore","n.That part of a shore uncovered at low tide."},
{"forebode","v.To be an omen or warning sign of especially of evil."},
{"forecast","v.To predict."},
{"forecastle","n.That part of the upper deck of a ship forward of the after fore-shrouds."},
{"foreclose","v.Tobar by judicial proceedings the equitable right of a mortgagor to redeem property."},
{"forefather","n.An ancestor."},
{"forego","v.To deny oneself the pleasure or profit of."},
{"foreground","n.That part of a landscape or picture situated or represented as nearest the spectator."},
{"forehead","n.The upper part of the face, between the eyes and the hair."},
{"foreign","adj.Belonging to, situated in, or derived from another country."},
{"foreigner","n.A citizen of a foreign country."},
{"foreknowledge","n.Prescience."},
{"foreman","n.The head man."},
{"foreordain","v.To predetermine."},
{"foreordination","n.Predestination."},
{"forerun","v.To go before as introducing or ushering in."},
{"foresail","n.A square sail."},
{"foresee","v.To discern beforehand."},
{"foresight","n.Provision against harm or need."},
{"foretell","v.To predict."},
{"forethought","n.Premeditation."},
{"forfeit","v.To lose possession of through failure to fulfill some obligation."},
{"forfend","v.To ward off."},
{"forgery","n.Counterfeiting."},
{"forgo","v.To deny oneself."},
{"formation","n.Relative disposition of parts."},
{"formidable","adj.Difficult to accomplish."},
{"formula","n.Fixed rule or set form."},
{"forswear","v.To renounce upon oath."},
{"forte","n.A strong point."},
{"forth","adv.Into notice or view."},
{"forthright","adv.With directness."},
{"fortify","v.To provide with defensive works."},
{"fortitude","n.Patient courage."},
{"foursome","adj.Consisting of four."},
{"fracture","n.A break."},
{"fragile","adj.Easily broken."},
{"frailty","n.Liability to be broken or destroyed."},
{"fragile","adj.Capable of being broken."},
{"frankincense","n.A gum or resin which on burning yields aromatic fumes."},
{"frantic","adj.Frenzied."},
{"fraternal","adj.Brotherly."},
{"fraudulence","n.Deceitfulness."},
{"fraudulent","adj.Counterfeit."},
{"fray","v.To fret at the edge so as to loosen or break the threads."},
{"freemason","n.A member of an ancient secret fraternity originally confined to skilled artisans."},
{"freethinker","n.One who rejects authority or inspiration in religion."},
{"free trade","n.Commerce unrestricted by tariff or customs."},
{"frequency","n.The comparative number of any kind of occurrences within a given time or space."},
{"fresco","n.The art of painting on a surface of plaster, particularly on walls and ceilings."},
{"freshness","n.The state, quality, or degree of being fresh."},
{"fretful","adj.Disposed to peevishness."},
{"frightful","adj.Apt to induce terror or alarm."},
{"frigid","adj.Lacking warmth."},
{"frigidarium","n.A room kept at a low temperature for preserving fruits, meat, etc."},
{"frivolity","n.A trifling act, thought, saying, or practice."},
{"frivolous","adj.Trivial."},
{"frizz","v.To give a crinkled, fluffy appearance to."},
{"frizzle","v.To cause to crinkle or curl, as the hair."},
{"frolicsome","adj.Prankish."},
{"frontier","n.The part of a nation's territory that abuts upon another country."},
{"frowzy","adj.Slovenly in appearance."},
{"frugal","adj.Economical."},
{"fruition","n.Fulfillment."},
{"fugacious","adj.Fleeting."},
{"fulcrum","n.The support on or against which a lever rests, or the point about which it turns."},
{"fulminate","v.To cause to explode."},
{"fulsome","adj.Offensive from excess of praise or commendation."},
{"fumigate","v.To subject to the action of smoke or fumes, especially for disinfection."},
{"functionary","n.An official."},
{"fundamental","adj.Basal."},
{"fungible","adj.That may be measured, counted, or weighed."},
{"fungous","adj.Spongy."},
{"fungus","n.A plant destitute of chlorophyll, as a mushroom."},
{"furbish","v.To restore brightness or beauty to."},
{"furlong","n.A measure, one-eighth of a mile."},
{"furlough","n.A temporary absence of a soldier or sailor by permission of the commanding officer."},
{"furrier","n.A dealer in or maker of fur goods."},
{"further","adj.More distant or advanced."},
{"furtherance","n.Advancement."},
{"furtive","adj.Stealthy or sly, like the actions of a thief."},
{"fuse","v.To unite or blend as by melting together."},
{"fusible","adj.Capable of being melted by heat."},
{"futile","adj.Of no avail or effect."},
{"futurist","n.A person of expectant temperament."},
//****************************GGGGGGGGGGGGG
{"gauge","n.An instrument for measuring."},
{"gaiety","n.Festivity."},
{"gaily","adv. Merrily."},
{"gait","n.Carriage of the body in going."},
{"gallant","adj. Possessing a brave or chivalrous spirit."},
{"galore","adj. Abundant."},
{"galvanic","adj. Pertaining or relating to electricity produced by chemical action."},
{"galvanism","n.Current electricity, especially that arising from chemical action."},
{"galvanize","v.To imbue with life or animation."},
{"gamble","v.To risk money or other possession on an event, chance, or contingency."},
{"gambol","n.Playful leaping or frisking."},
{"gamester","n.A gambler."},
{"gamut","n.The whole range or sequence."},
{"garnish","v.In cookery, to surround with additions for embellishment."},
{"garrison","n.The military force stationed in a fort, town, or other place for its defense."},
{"garrote","v.To execute by strangling."},
{"garrulous","adj.Given to constant trivial talking."},
{"gaseous","adj.Light and unsubstantial."},
{"gastric","adj.Of, pertaining to, or near the stomach."},
{"gastritis","n.Inflammation of the stomach."},
{"gastronomy","n.The art of preparing and serving appetizing food."},
{"gendarme","n.In continental Europe, particularly in France, a uniformed and armed police officer."},
{"genealogy","n.A list, in the order of succession, of ancestors and their descendants."},
{"genealogist","n.A tracer of pedigrees."},
{"generality","n.The principal portion."},
{"generalize","v.To draw general inferences."},
{"generally","adv.Ordinarily."},
{"generate","v.To produce or cause to be."},
{"generic","adj. Noting a genus or kind; opposed to specific."},
{"generosity","n.A disposition to give liberally or to bestow favors heartily."},
{"genesis","n.Creation."},
{"geniality","n.Warmth and kindliness of disposition."},
{"genital","adj. Of or pertaining to the animal reproductive organs."},
{"genitive","adj.Indicating source, origin, possession, or the like."},
{"genteel","adj.Well-bred or refined."},
{"gentile","adj.Belonging to a people not Jewish."},
{"geology","n.The department of natural science that treats of the constitution and structure of the earth."},
{"germane","adj.Relevant."},
{"germinate","v.To begin to develop into an embryo or higher form."},
{"gestation","n.Pregnancy."},
{"gesticulate","v.To make gestures or motions, as in speaking, or in place of speech."},
{"gesture","n.A movement or action of the hands or face, expressive of some idea or emotion."},
{"ghastly","adj.Hideous."},
{"gibe","v.To utter taunts or reproaches."},
{"giddy","adj.Affected with a whirling or swimming sensation in the head."},
{"gigantic","adj.Tremendous."},
{"giver","n.One who gives, in any sense."},
{"glacial","adj.Icy, or icily cold."},
{"glacier","n.A field or stream of ice."},
{"gladden","v.To make joyous."},
{"glazier","n.One who cuts and fits panes of glass, as for windows."},
{"glimmer","n.A faint, wavering, unsteady light."},
{"glimpse","n.A momentary look."},
{"globose","adj.Spherical."},
{"globular","adj.Spherical."},
{"glorious","adj.Of excellence and splendor."},
{"glutinous","adj.Sticky."},
{"gluttonous","adj.Given to excess in eating."},
{"gnash","v.To grind or strike the teeth together, as from rage."},
{"Gordian","knot n. Any difficulty the only issue out of which is by bold or unusual manners."},
{"gourmand","n.A connoisseur in the delicacies of the table."},
{"gosling","n.A young goose."},
{"gossamer","adj.Flimsy."},
{"gourd","n.A melon, pumpkin, squash, or some similar fruit having a hard rind."},
{"graceless","adj.Ungracious."},
{"gradation","n.A step, degree, rank, or relative position in an order or series."},
{"gradient","adj.Moving or advancing by steps."},
{"granary","n.A storehouse for grain after it is thrashed or husked."},
{"grandeur","n.The quality of being grand or admirably great."},
{"grandiloquent","adj.Speaking in or characterized by a pompous or bombastic style."},
{"grandiose","adj.Having an imposing style or effect."},
{"grantee","n.The person to whom property is transferred by deed."},
{"grantor","n.The maker of a deed."},
{"granular","adj.Composed of small grains or particles."},
{"granulate","v.To form into grains or small particles."},
{"granule","n.A small grain or particle."},
{"grapple","v.To take hold of."},
{"gratification","n.Satisfaction."},
{"gratify","v.To please, as by satisfying a physical or mental desire or need."},
{"gratuitous","adj.Voluntarily."},
{"gratuity","n.That which is given without demand or claim."},
{"gravity","n.Seriousness."},
{"gregarious","adj.Not habitually solitary or living alone."},
{"grenadier","n.A member of a regiment composed of men of great stature."},
{"grief","n.Sorrow."},
{"grievance","n.That which oppresses, injures, or causes grief and at the same time a sense of wrong."},
{"grievous","adj.Creating affliction."},
{"grimace","n.A distortion of the features, occasioned by some feeling of pain, disgust, etc."},
{"grindstone","n.A flat circular stone, used for sharpening tools."},
{"grisly","adj.Fear-inspiring."},
{"grotesque","adj.Incongruously composed or ill-proportioned."},
{"grotto","n.A small cavern."},
{"ground","n.A pavement or floor or any supporting surface on which one may walk."},
{"guess","n.Surmise."},
{"guile n. Duplicity."},
{"guileless","adj.Frank."},
{"guinea","n.An English monetary unit."},
{"guise","n.The external appearance as produced by garb or costume."},
{"gullible","adj.Credulous."},
{"gumption","n.Common sense."},
{"gusto","n.Keen enjoyment."},
{"guy","n.Stay-rope."},
{"guzzle","v.To swallow greedily or hastily; gulp."},
{"gynecocracy ","n.Female supremacy."},
{"gynecology"," n. The science that treats of the functions and diseases peculiar to women."},
{"gyrate","v.To revolve."},
{"gyroscope","n.An instrument for illustrating the laws of rotation"},
//****************************HHHHHHHHHHHHHHHHHHHHHHH
{"habitable","adj.Fit to be dwelt in."},
{"habitant","n.Dweller."},
{"habitual","adj.According to usual practice."},
{"habitude","n.Customary relation or association."},
{"hackney","v.To make stale or trite by repetition."},
{"haggard","adj.Worn and gaunt in appearance."},
{"halcyon","adj.Calm."},
{"hale","adj.Of sound and vigorous health."},
{"handwriting","n.Penmanship."},
{"hanger-on","n.A parasite."},
{"happy-go-lucky","adj.Improvident."},
{" harangue","n. A tirade."},
{"harass","v.To trouble with importunities, cares, or annoyances."},
{"harbinger","n.One who or that which foreruns and announces the coming of any person or thing."},
{"hard-hearted","adj.Lacking pity or sympathy."},
{"hardihood","n.Foolish daring."},
{"harmonious","adj.Concordant in sound."},
{"havoc","n.Devastation."},
{"hawthorn","n.A thorny shrub much used in England for hedges."},
{"hazard"," n. Risk."},
{"head first","adv.Precipitately, as in diving."},
{"head foremost","adv.Precipitately, as in diving."},
{"heartrending","adj.Very depressing."},
{"heathenish","adj.Irreligious."},
{"heedless","adj.Thoughtless."},
{"heifer","n.A young cow."},
{"heinous","adj.Odiously sinful."},
{"hemorrhage","n.Discharge of blood from a ruptured or wounded blood-vessel."},
{"hemorrhoids","n.pl. Tumors composed of enlarged and thickened blood-vessels, at the lower end of the rectum."},
{"henchman","n.A servile assistant and subordinate."},
{"henpeck","v.To worry or harass by ill temper and petty annoyances."},
{"heptagon","n.A figure having seven sides and seven angles."},
{"heptarchy","n.A group of seven governments."},
{"herbaceous","adj.Having the character of a herb."},
{"herbarium","n.A collection of dried plants scientifically arranged for study."},
{"herbivorous","adj.Feeding on herbs or other vegetable matter, as animals."},
{"hereditary","adj.Passing naturally from parent to child."},
{"heredity","n.Transmission of physical or mental qualities, diseases, etc., from parent to offspring."},
{"heresy","n.An opinion or doctrine subversive of settled beliefs or accepted principles."},
{"heretic","n.One who holds opinions contrary to the recognized standards or tenets of any philosophy."},
{"heritage","n.Birthright."},
{"hernia","n.Protrusion of any internal organ in whole or in part from its normal position."},
{"hesitancy","n.A pausing to consider."},
{"hesitant","adj.Vacillating."},
{"hesitation","n.Vacillation."},
{"heterodox","adj.At variance with any commonly accepted doctrine or opinion."},
{"heterogeneity","n.Unlikeness of constituent parts."},
{"heterogeneous","adj.Consisting of dissimilar elements or ingredients of different kinds."},
{"heteromorphic","adj.Deviating from the normal form or standard type."},
{"hexangular","adj.Having six angles."},
{"hexapod","adj.Having six feet."},
{"hexagon","n.A figure with six angles."},
{"hiatus","n.A break or vacancy where something necessary to supply the connection is wanting."},
{"hibernal","adj.Pertaining to winter."},
{"Hibernian","adj.Pertaining to Ireland, or its people."},
{"hideous","adj.Appalling."},
{"hilarious","adj.Boisterously merry."},
{"hillock","n.A small hill or mound."},
{"hinder","v.To obstruct."},
{"hindmost","adj.Farthest from the front."},
{"hindrance","n.An obstacle."},
{"hirsute","adj.Having a hairy covering."},
{"hoard","v.To gather and store away for the sake of accumulation."},
{"hoarse","adj.Having the voice harsh or rough, as from a cold or fatigue."},
{"homage","n.Reverential regard or worship."},
{"homogeneity","n.Congruity of the members or elements or parts."},
{"homogeneous","adj.Made up of similar parts or elements."},
{"homologous","adj.Identical in nature, make-up, or relation."},
{"homonym","n.A word agreeing in sound with but different in meaning from another."},
{"homophone","n.A word agreeing in sound with but different in meaning from another."},
{"honorarium","n.A token fee or payment to a professional man for services."},
{"hoodwink","v.To deceive."},
{"horde","n.A gathered multitude of human beings."},
{"hosiery","n.A stocking."},
{"hospitable","adj.Disposed to treat strangers or guests with generous kindness."},
{"hospitality","n.The practice of receiving and entertaining strangers and guests with kindness."},
{"hostility","n.Enmity."},
{"huckster","n.One who retails small wares."},
{"humane","adj.Compassionate."},
{"humanitarian","n.A philanthropist."},
{"humanize","v.To make gentle or refined."},
{"humiliate","v.To put to shame."},
{"hussar","n.A light-horse trooper armed with saber and carbine."},
{"hustle","v.To move with haste and promptness."},
{"hybrid","adj.Cross-bred."},
{"hydra","n.The seven- or nine-headed water-serpent slain by Hercules."},
{"hydraulic","adj.Involving the moving of water, of the force exerted by water in motion."},
{"hydrodynamics","n.The branch of mechanics that treats of the dynamics of fluids."},
{"hydroelectric","adj.Pertaining to electricity developed water or steam."},
{"hydromechanics","n.The mechanics of fluids."},
{"hydrometer","n.An instrument for determining the density of solids and liquids by flotation."},
{"hydrostatics","n.The branch of science that treats of the pressure and equilibrium of fluids."},
{"hydrous","adj.Watery."},
{"hygiene","n.The branch of medical science that relates to improving health."},
{"hypercritical","adj.Faultfinding."},
{"hypnosis","n.An artificial trance-sleep."},
{"hypnotic","adj.Tending to produce sleep."},
{"hypnotism","n.An artificially induced somnambulistic state in which the mind readily acts on suggestion."},
{"hypnotize","v.To produce a somnambulistic state in which the mind readily acts on suggestions."},
{"hypocrisy","n.Extreme insincerity."},
{"hypocrite","n.One who makes false professions of his views or beliefs."},
{"hypodermic","adj.Pertaining to the area under the skin."},
{"hypotenuse","n.The side of a right-angled triangle opposite the right angle."},
{"hypothesis","n.A proposition taken for granted as a premise from which to reach a conclusion."},
{"hysteria","n.A nervous affection occurring typically in paroxysms of laughing and crying."},
//****************************IIIIIIIIIIIIIIIIIIII
{"ichthyic","adj.Fish-like."},
{"ichthyology","n.The branch of zoology that treats of fishes."},
{"ichthyosaurs"," n. A fossil reptile."},
{"icily"," adv. Frigidly."},
{"iciness"," n. The state of being icy."},
{"icon"," n. An image or likeness."},
{"iconoclast"," n. An image-breaker"},
{"idealize"," v. To make to conform to some mental or imaginary standard."},
{"idiom"," n. A use of words peculiar to a particular language."},
{"idiosyncrasy"," n. A mental quality or habit peculiar to an individual."},
{"idolize"," v. To regard with inordinate love or admiration."},
{"ignoble"," adj. Low in character or purpose."},
{"ignominious"," adj. Shameful."},
{"Iliad"," n. A Greek epic poem describing scenes from the siege of Troy"},
{"illegal"," adj. Not according to law."},
{"illegible"," adj. Undecipherable."},
{"illegitimate"," adj. Unlawfully begotten."},
{"illiberal"," adj. Stingy"},
{"illicit"," adj. Unlawful."},
{"illimitable"," adj. Boundless."},
{"illiterate"," adj. Having little or no book-learning."},
{"ill-natured"," adj. Surly."},
{"illogical"," adj. Contrary to the rules of sound thought."},
{"illuminant"," n. That which may be used to produce light"},
{"illuminate"," v. To supply with light."},
{"illumine"," v. To make bright or clear."},
{"illusion"," n. An unreal image presented to the senses."},
{"illusive"," adj. Deceptive."},
{"illusory"," adj. Deceiving or tending to deceive, as by false appearance"},
{"imaginable"," adj. That can be imagined or conceived in the mind."},
{"imaginary"," adj. Fancied."},
{"imbibe"," v. To drink or take in."},
{"imbroglio"," n. A misunderstanding attended by ill feeling, perplexity, or strife."},
{"imbrue"," v. To wet or moisten."},
{"imitation"," n. That which is made as a likeness or copy."},
{"imitator"," n. One who makes in imitation."},
{"immaculate"," adj. Without spot or blemish"},
{"immaterial"," adj. Of no essential consequence."},
{"immature"," adj. Not full-grown."},
{"immeasurable"," adj. Indefinitely extensive."},
{"immense"," adj. Very great in degree, extent, size, or quantity"},
{"immerse"," v. To plunge or dip entirely under water or other fluid."},
{"immersion"," n. The act of plunging or dipping entirely under water or another fluid."},
{"immigrant"," n. A foreigner who enters a country to settle there."},
{"immigrate"," v. To come into a country or region from a former habitat."},
{"imminence"," n. Impending evil or danger."},
{"imminent"," adj. Dangerous and close at hand."},
{"immiscible"," adj. Separating, as oil and water."},
{"immoral","adj. Habitually engaged in licentious or lewd practices."},
{"immortalize"," v. To cause to last or to be known or remembered throughout a great or indefinite length of time."},
{"immovable"," adj. Steadfast."},
{"immune"," adj. Exempt, as from disease"},
{"immutable"," adj. Unchangeable."},
{"impair"," v. To cause to become less or worse."},
{"impalpable"," adj. Imperceptible to the touch."},
{"impartial"," adj. Unbiased."},
{"impassable"," adj. That can not be passed through or over."},
{"impassible"," adj. Not moved or affected by feeling."},
{"impassive"," adj. Unmoved by or not exhibiting feeling."},
{"impatience"," n. Unwillingness to brook delays or wait the natural course of things."},
{"impeccable"," adj. Blameless."},
{"impecunious"," adj. Having no money."},
{"impede"," v. To be an obstacle or to place obstacles in the way of."},
{"impel"," v. To drive or urge forward."},
{"impend"," v. To be imminent."},
{"imperative"," adj. Obligatory."},
{"imperceptible"," adj. Indiscernible."},
{"imperfectible"," adj. That can not be perfected."},
{"imperil"," v. To endanger."},
{"imperious"," adj. Insisting on obedience."},
{"impermissible"," adj. Not permissible."},
{"impersonal"," adj. Not relating to a particular person or thing."},
{"impersonate"," v. To appear or act in the character of."},
{"impersuadable"," adj. Unyielding."},
{"impertinence"," n. Rudeness."},
{"imperturbable"," adj. Calm."},
{"impervious"," adj. Impenetrable"},
{"impetuosity"," n. Rashness."},
{"impetuous"," adj. Impulsive."},
{"impetus"," n. Any impulse or incentive."},
{"impiety"," n. Irreverence toward God."},
{"impious"," adj. Characterized by irreverence or irreligion."},
{"implausible"," adj. Not plausible."},
{"impliable"," adj. Capable of being inferred."},
{"implicate"," v. To show or prove to be involved in or concerned"},
{"implicit"," adj. Implied."},
{"imply","v. To signify."},
{"impolitic"," adj. Inexpedient."},
{"importation"," n. The act or practice of bringing from one country into another."},
{"importunate"," adj. Urgent in character, request, or demand."},
{"importune"," v. To harass with persistent demands or entreaties."},
{"impotent"," adj. Destitute of or lacking in power, physical, moral, or intellectual."},
{"impoverish"," v. To make indigent or poor."},
{"impracticable"," adj. Not feasible"},
{"impregnable"," adj. That can not be taken by assault."},
{"impregnate"," v. To make pregnant."},
{"impromptu"," n. Anything done or said on the impulse of the moment."},
{"improper"," adj. Not appropriate, suitable, or becoming."},
{"impropriety"," n. The state or quality of being unfit, unseemly, or inappropriate."},
{"improvident"," adj. Lacking foresight or thrift."},
{"improvise"," v. To do anything extemporaneously or offhand."},
{"imprudent"," adj. Heedless."},
{"impudence"," n. Insolent disrespect."},
{"impugn"," v. To assail with arguments, insinuations, or accusations."},
{"impulsion"," n. Impetus."},
{"impulsive"," adj. Unpremeditated."},
{"impunity"," n. Freedom from punishment."},
{"impure"," adj. Tainted."},
{"impute"," v. To attribute."},
{"inaccessible"," adj. Difficult of approach."},
{"inaccurate"," adj. Not exactly according to the facts."},
{"inactive"," adj. Inert."},
{"inadequate"," adj. Insufficient"},
{"inadmissible"," adj. Not to be approved, considered, or allowed, as testimony."},
{"inadvertent ","adj. Accidental."},
{"inadvisable"," adj. Unadvisable."},
{"inane"," adj. Silly."},
{"inanimate"," adj. Destitute of animal life."},
{"inapprehensible"," adj. Not to be understood."},
{"inapt"," adj. Awkward or slow."},
{"inarticulate"," adj. Speechless."},
{"inaudible","adj. That can not be heard."},
{"inborn"," adj. Implanted by nature."},
{"inbred"," adj. Innate."},
{"incandescence"," n. The state of being white or glowing with heat."},
{"incandescent"," adj. White or glowing with heat."},
{"incapacitate"," v. To deprive of power, capacity, competency, or qualification."},
{"incapacity"," n. Want of power to apprehend, understand, and manage."},
{"incarcerate"," v. To imprison."},
{"incendiary"," n. Chemical or person who starts a fire-literally or figuratively."},
{"incentive"," n. That which moves the mind or inflames the passions."},
{"inception"," n. The beginning."},
{"inceptive"," adj. Beginning."},
{"incessant"," adj. Unceasing."},
{"inchmeal"," adv. Piecemeal."},
{"inchoate"," adj. Incipient."},
{"inchoative"," n. That which begins, or expresses beginning."},
{"incidence"," n. Casual occurrence."},
{"incident"," n. A happening in general, especially one of little importance."},
{"incidentally"," adv. Without intention."},
{"incinerate"," v. To reduce to ashes."},
{"incipience"," n. Beginning."},
{"incipient"," adj. Initial."},
{"incisor"," n. A front or cutting tooth."},
{"incite"," v. To rouse to a particular action."},
{"incitement"," n. That which moves to action, or serves as an incentive or stimulus."},
{"incoercible"," adj. Incapable of being forced, constrained, or compelled."},
{"incoherence"," n. Want of connection, or agreement, as of parts or ideas in thought, speech, etc"},
{"incoherent"," adj. Not logically coordinated, as to parts, elements, or details."},
{"incombustible"," adj. That can not be burned."},
{"incomparable"," adj. Matchless."},
{"incompatible"," adj. Discordant."},
{"incompetence"," n. General lack of capacity or fitness."},
{"incompetent"," adj. Not having the abilities desired or necessary for any purpose"},
{"incomplete"," adj. Lacking some element, part, or adjunct necessary or required."},
{"incomprehensible"," adj. Not understandable."},
{"incompressible"," adj. Resisting all attempts to reduce volume by pressure"},
{"inconceivable"," adj. Incomprehensible."},
{"incongruous"," adj. Unsuitable for the time, place, or occasion."},
{"inconsequential"," adj. Valueless."},
{"inconsiderable"," adj. Small in quantity or importance."},
{"inconsistent","adj. Contradictory."},
{"inconstant"," adj. Changeable."},
{"incontrovertible"," adj. Indisputable."},
{"inconvenient"," adj. Interfering with comfort or progress."},
{"indefensible"," adj. Untenable."},
{"indefinitely"," adv. In a vague or uncertain way."},
{"indelible"," adj. That can not be blotted out, effaced, destroyed, or removed."},
{"indescribable"," adj. That can not be described."},
{"indestructible"," adj. That can not be destroyed."},
{"indicant"," adj. That which points out."},
{"indicator"," n. One who or that which points out."},
{"indict"," v. To find and declare chargeable with crime."},
{"indigence"," n. Poverty."},
{"indigenous"," adj. Native."},
{"indigent"," adj. Poor."},
{"indigestible"," adj. Not digestible, or difficult to digest."},
{"indigestion"," n. Difficulty or failure in the alimentary canal in changing food into absorptive nutriment."},
{"indignant"," adj. Having such anger and scorn as is aroused by meanness or wickedness."},
{"indignity"," n. Unmerited contemptuous conduct or treatment."},
{"indiscernible"," adj. Not perceptible."},
{"indiscreet"," adj. Lacking wise judgment."},
{"indiscriminate"," adj. Promiscuous."},
{"indispensable"," adj. Necessary or requisite for the purpose."},
{"indistinct"," adj. Vague."},
{"indivertible"," adj. That can not be turned aside."},
{"indivisible"," adj. Not separable into parts."},
{"indolence"," n. Laziness."},
{"indolent"," adj. Habitually inactive or idle."},
{"indomitable"," adj. Unconquerable."},
{"induct"," v. To bring in."},
{"indulgence"," n. The yielding to inclination, passion, desire, or propensity in oneself or another."},
{"indulgent"," adj. Yielding to the desires or humor of oneself or those under one's care."},
{"inebriate"," v. To intoxicate."},
{"inedible"," adj. Not good for food."},
{"ineffable"," adj. Unutterable."},
{"inefficient"," adj. Not accomplishing an intended purpose."},
{"inefficiency"," n. That which does not accomplish an intended purpose."},
{"ineligible"," adj. Not suitable to be selected or chosen."},
{"inept"," adj. Not fit or suitable."},
{"inert"," adj. Inanimate."},
{"inestimable"," adj. Above price."},
{"inevitable"," adj. Unavoidable."},
{"inexcusable"," adj. Not to be justified."},
{"inexhaustible"," adj. So large or furnishing so great a supply as not to be emptied, wasted, or spent."},
{"inexorable"," adj. Unrelenting."},
{"inexpedient"," adj. Unadvisable."},
{"inexpensive"," adj. Low-priced."},
{"inexperience"," n. Lack of or deficiency in experience."},
{"inexplicable"," adj. Such as can not be made plain"},
{"inexpressible"," adj. Unutterable."},
{"inextensible"," adj. Of unchangeable length or area."},
{"infallible"," adj. Exempt from error of judgment, as in opinion or statement."},
{"infamous"," adj. Publicly branded or notorious, as for vice, or crime."},
{"infamy"," n. Total loss or destitution of honor or reputation."},
{"inference"," n. The derivation of a judgment from any given material of knowledge on the ground of law."},
{"infernal"," adj. Akin to or befitting hell or its occupants."},
{"infest"," v. To be present in such numbers as to be a source of annoyance, trouble, or danger."},
{"infidel"," n. One who denies the existence of God."},
{"infidelity"," n. Disloyalty."},
{"infinite"},{" adj. Measureless."},
{"infinity"," n. Boundless or immeasurable extension or duration."},
{"infirm"," adj. Lacking in bodily or mental strength."},
{"infirmary"," n. A place for the reception or treatment of the sick."},
{"infirmity"," n. A physical, mental, or moral weakness or flaw."},
{"inflammable"," adj. Easily set on fire or excited."},
{"inflammation"," n. A morbid process in some part of the body characterized by heat, swelling, and pain."},
{"inflexible","adj. That can not be altered or varied."},
{"influence"," n. Ability to sway the will of another."},
{"influential"," adj. Having the power to sway the will of another. influx n. Infusion."},
{"infrequence"," n. Rareness."},
{"infrequent"," adj. Uncommon."},
{"infringe"," v. To trespass upon."},
{"infuse"," v. To instill, introduce, or inculcate, as principles or qualities."},
{"infusion"," n. The act of imbuing, or pouring in."},
{"ingenious"," adj. Evincing skill, originality, or cleverness, as in contrivance or arrangement."},
{"ingenuity"," n. Cleverness in contriving, combining, or originating."},
{"ingenuous"," adj. Candid, frank, or open in character or quality."},
{"inglorious"," adj. Shameful."},
{"ingraft"," v. To set or implant deeply and firmly."},
{"ingratiate"," v. To win confidence or good graces for oneself."},
{"ingratitude"," n. Insensibility to kindness."},
{"ingredient"," n. Component."},
{"inherence"," n. The state of being permanently existing in something."},
{"inherent"," adj. Intrinsic."},
{"inhibit"," v. To hold back or in."},
{"inhospitable"," adj. Not disposed to entertain strangers gratuitously."},
{"inhuman"," adj. Savage."},
{"inhume"," v. To place in the earth, as a dead body."},
{"inimical"," adj. Adverse."},
{"iniquity"," n. Gross wrong or injustice."},
{"initiate"," v. To perform the first act or rite."},
{"inject"," v. To introduce, as a fluid, by injection."},
{"injunction"," n. Mandate."},
{"inkling"," n. A hint."},
{"inland"," adj. Remote from the sea."},
{"inlet"," n. A small body of water leading into a larger."},
{"inmost","adj. Deepest within."},
{"innocuous"," adj. Harmless."},
{"innovate"," v. To introduce or strive to introduce new things."},
{"innuendo"," n. Insinuation."},
{"innumerable"," adj. Countless."},
{"inoffensive","adj. Causing nothing displeasing or disturbing."},
{"inopportune","adj. Unsuitable or inconvenient, especially as to time."},
{"inquire","v. To ask information about."},
{"inquisition","n. A court or tribunal for examination and punishment of heretics."},
{"inquisitive","adj. Given to questioning, especially out of curiosity."},
{"inquisitor","n. One who makes an investigation."},
{"inroad","n. Forcible encroachment or trespass."},
{"insatiable","adj. That desires or craves immoderately or unappeasably"},
{"inscribe","v. To enter in a book, or on a list, roll, or document, by writing"},
{"inscrutable","adj. Impenetrably mysterious or profound."},
{"insecure","adj. Not assured of safety."},
{"insensible","adj. Imperceptible."},
{"insentient","adj. Lacking the power of feeling or perceiving"},
{"inseparable","adj. That can not be separated."},
{"insidious","adj. Working ill by slow and stealthy means."},
{"insight","n. Intellectual discernment."},
{"insignificance","n. Lack of import or of importance."},
{"insignificant","adj. Without importance, force, or influence."},
{"insinuate","v. To imply."},
{"insipid","adj. Tasteless."},
{"insistence","n. Urgency."},
{"insistent","adj. Urgent."},
{"insolence","n. Pride or haughtiness exhibited in contemptuous and overbearing treatment of others."},
{"insolent","adj. Impudent."},
{"insomnia","n. Sleeplessness."},
{"inspector","n. An official appointed to examine or oversee any matter of public interest or importance."},
{"instance","n. A single occurrence or happening of a given kind."},
{"instant","n. A very brief portion of time."},
{"instantaneous","adj. Done without perceptible lapse of time."},
{"instigate","v. To provoke."},
{"instigator","n. One who incites to evil."},
{"instill"," v. To infuse."},
{"instructive","adj. Conveying knowledge."},
{"insufficiency","n. Inadequacy."},
{"insufficient","adj. Inadequate for some need, purpose, or use."},
{"insular","adj. Pertaining to an island"},
{"insulate","v. To place in a detached state or situation."},
{"insuperable","adj. Invincible."},
{"insuppressible","adj. Incapable of being concealed."},
{"insurgence","n. Uprising."},
{"insurgent","n. One who takes part in forcible opposition to the constituted authorities of a place."},
{"insurrection","n. The state of being in active resistance to authority."},
{"intangible","adj. Not perceptible to the touch."},
{"integrity","n. Uprightness of character and soundness of moral principle."},
{"intellect","n. The faculty of perception or thought."},
{"intellectual","adj. Characterized by intelligence."},
{"ntelligence","n. Capacity to know or understand."},
{"intelligible","adj. Comprehensible."},
{"intemperance","n. Immoderate action or indulgence, as of the appetites"},
{"intension","n. The act of stringing or stretching, or state of being strained."},
{"intensive","adj. Adding emphasis or force."},
{"intention","That upon which the mind is set"},
{"interact","v. To act reciprocally."},
{"intercede","v. To mediate between persons."},
{"intercept","v. To interrupt the course of"},
{"intercession","n. Entreaty in behalf of others."},
{"intercessor","n. A mediator."},
{"interdict","n. Authoritative act of prohibition."},
{"interim","n. Time between acts or periods."},
{"interlocutor","n. One who takes part in a conversation or oral discussion."},
{"interlude","n. An action or event considered as coming between others of greater length."},
{"intermediate","adj. Being in a middle place or degree or between extremes"},
{"interminable","adj. Having no limit or end."},
{"intermission","n. A recess."},
{"intermit","v. To cause to cease temporarily."},
{"intermittent","adj. A temporary discontinuance."},
{"interpolation","n. Verbal interference."},
{"interpose","v. To come between other things or persons."},
{"interposition","n. A coming between"},
{"interpreter","n. A person who makes intelligible the speech of a foreigner by oral translation."},
{"interrogate","v. To examine formally by questioning."},
{"interrogative","adj. Having the nature or form of a question."},
{"interrogatory","n. A question or inquiry."},
{"interrupt","v. To stop while in progress."},
{"intersect","v. To cut through or into so as to divide."},
{"interval","n. A low tract of land between hills, especially along a river."},
{"intervene","v. To interfere for some end."},
{"intestacy","n. The condition resulting from one's dying not having made a valid will."},
{"intestate","adj. Not having made a valid will."},
{"intestine","n. That part of the digestive tube below or behind the stomach, extending to the anus."},
{"intimacy","n. Close or confidential friendship."},
{"intimidate","v. To cause to become frightened."},
{"intolerable","adj. Insufferable."},
{"intolerance","n. Inability or unwillingness to bear or endure."},
{"intolerant","adj. Bigoted."},
{"intoxicant","n. Anything that unduly exhilarates or excites."},
{"intoxicate","v. To make drunk."},
{"intracellular","adj. Occurring or situated within a cell."},
{"intramural","adj. Situated within the walls of a city."},
{"intrepid","adj. Fearless and bold."},
{"intricacy","n. Perplexity."},
{"intricate","adj. Difficult to follow or understand."},
{"intrigue","n. A plot or scheme, usually complicated and intended to accomplish something by secret ways."},
{"intrinsic", "adj. Inherent"},
{"introductory","adj. Preliminary."},
{"introgression","n. Entrance."},
{"intromit","v. To insert"},
{"introspect"," v. To look into."},
{"introspection","n. The act of observing and analyzing one's own thoughts and feelings."},
{"introversion","n. The act of turning or directing inward, physically or mentally."},
{"introvert","v. To turn within."},
{"intrude","v. To come in without leave or license."},
{"intrusion","n. The act of entering without warrant or invitation; encroachment."},
{"intuition","n. Instinctive knowledge or feeling."},
{"inundate","v. To fill with an overflowing abundance."},
{"inundation","n. Flood."},
{"inure","v. To harden or toughen by use, exercise, or exposure."},
{"invalid","adj. Having no force, weight, or cogency"},
{"invalid","n. One who is disabled by illness or injury."},
{"invalidate","v. To render of no force or effect"},
{"invaluable","adj. Exceedingly precious."},
{"invariable","adj. Unchangeable."},
{"invasion","n. Encroachment, as by an act of intrusion or trespass."},
{"invective","n. An utterance intended to cast censure, or reproach."},
{"inveigh","v. To utter vehement censure or invective."},
{"inventive","adj. Quick at contrivance."},
{"inverse","adj. Contrary in tendency or direction."},
{"inversion","n. Change of order so that the first shall become last and the last first."},
{"invert","v. To turn inside out, upside down, or in opposite direction."},
{"investigator","n. One who investigates."},
{"investor","n. One who invests money."},
{"inveterate","adj. Habitual"},
{"invidious","adj. Showing or feeling envy."},
{"invigorate","v. To animate."},
{"invincible","adj. Not to be conquered, subdued, or overcome."},
{"inviolable","adj. Incapable of being injured or disturbed."},
{"invoke","v. To call on for assistance or protection."},
{"involuntary","adj. Unwilling."},
{"involution","n. Complication."},
{"involve","v. To draw into entanglement, literally or figuratively."},
{"invulnerable","adj. That can not be wounded or hurt."},
{"inwardly","adv. With no outward manifestation."},
{"iota","n. A small or insignificant mark or part."},
{"irascible","adj. Prone to anger."},
{"irate","adj. Moved to anger."},
{"ire","n. Wrath."},
{"iridescence","n. A many-colored appearance."},
{"iridescent","adj. Exhibiting changing rainbow-colors due to the interference of the light."},
{"irk","v. To afflict with pain, vexation, or fatigue."},
{"irksome","adj. Wearisome."},
{"irony","n. Censure or ridicule under cover of praise or compliment"},
{"irradiance","n. Luster."},
{"irradiate","v. To render clear and intelligible."},
{"irrational","adj. Not possessed of reasoning powers or understanding."},
{"irreducible","adj. That can not be lessened."},
{"irrefragable","adj. That can not be refuted or disproved."},
{"irrefrangible","adj. That can not be broken or violated."},
{"irrelevant","adj. Inapplicable."},
{"irreligious","adj. Indifferent or opposed to religion."},
{"irreparable","adj. That can not be rectified or made amends for."},
{"irrepressible","adj. That can not be restrained or kept down."},
{"irresistible","adj. That can not be successfully withstood or opposed."},
{"irresponsible","adj. Careless of or unable to meet responsibilities."},
{"irreverence","n. The quality showing or expressing a deficiency of veneration, especially for sacred things."},
{"irreverent","adj. Showing or expressing a deficiency of veneration, especially for sacred things."},
{"irreverential","adj. Showing or expressing a deficiency of veneration, especially for sacred things."},
{"irreversible","adj. Irrevocable"},
{"irrigant","adj. Serving to water lands by artificial means"},
{"irrigate","v. To water, as land, by ditches or other artificial means."},
{"irritable","adj. Showing impatience or ill temper on little provocation."},
{"irritancy","n. The quality of producing vexation."},
{"irritant"," n. A mechanical, chemical, or pathological agent of inflammation, pain, or tension."},
{"irritate","v. To excite ill temper or impatience in."},
{"irruption","n. Sudden invasion."},
{"isle","n. An island."},
{"islet","n. A little island."},
{"isobar","n. A line joining points at which the barometric pressure is the same at a specified moment."},
{"isochronous","adj. Relating to or denoting equal intervals of time."},
{"isolate","v. To separate from others of its kind."},
{"isothermal","adj. Having or marking equality of temperature."},
{"itinerant","adj. Wandering."},
{"itinerary","n. A detailed account or diary of a journey"},
{"itinerate","v. To wander from place to place."},
//****************************JJJJJJJJJJJJJJJJJJJ
{"jargon","n. Confused, unintelligible speech or highly technical speech."},
{"jaundice","n. A morbid condition, due to obstructed excretion of bile or characterized by yellowing of the skin"},
{"jeopardize","v. To imperil."},
{"Jingo","n. One of a party in Great Britain in favor of spirited and demonstrative foreign policy."},
{"jocose","adj. Done or made in jest."},
{"jocular","adj. Inclined to joke."},
{"joggle","n. A sudden irregular shake or a push causing such a shake."},
{"journalize","v. To keep a diary"},
{"jovial","adj. Merry."},
{"jubilation","n. Exultation."},
{"judgment","n. The faculty by the exercise of which a deliberate conclusion is reached."},
{"judicature","n. Distribution and administration of justice by trial and judgment."},
{"judicial","adj. Pertaining to the administration of justice."},
{"judiciary","n. That department of government which administers the law relating to civil and criminal justice."},
{"judicious","adj. Prudent."},
{"juggle","v. To play tricks of sleight of hand."},
{"jugglery","n. The art or practice of sleight of hand."},
{"jugular","adj. Pertaining to the throat."},
{"juicy","adj. Succulent."},
{"junction","n. The condition of being joined."},
{"juncture","n. An articulation, joint, or seam."},
{"junta","n. A council or assembly that deliberates in secret upon the affairs of government."},
{"juridical","adj. Assumed by law to exist."},
{"jurisdiction","n. Lawful power or right to exercise official authority."},
{"jurisprudence","n. The science of rights in accordance with positive law."},
{"juror","n. One who serves on a jury or is sworn in for jury duty in a court of justice."},
{"joust","v. To engage in a tilt with lances on horseback."},
{"justification","n. Vindication."},
{"juvenile","adj. Characteristic of youth."},
{"juxtapose","v. To place close together."},
//****************************KKKKKKKKKKKKK
{"keepsake","n. Anything kept or given to be kept for the sake of the giver."},
{"kerchief","n. A square of linen, silk, or other material, used as a covering for the head or neck."},
{"kernel","n. A grain or seed."},
{"kiln","n. An oven or furnace for baking, burning, or drying industrial products."},
{"kiloliter","n. One thousand liters."},
{"kilometer","n. A length of 1,000 meters."},
{"kilowatt","n. One thousand watts."},
{"kimono","n. A loose robe, fastening with a sash, the principal outer garment in Japan."},
{"kindhearted","adj. Having a kind and sympathetic nature."},
{"kingling","n. A petty king."},
{"kingship","n. Royal state."},
{"kinsfolk","n. pl. Relatives."},
{"knavery","n. Deceitfulness in dealing."},
{"knead","v. To mix and work into a homogeneous mass, especially with the hands."},
{"knickknack","n. A small article, more for ornament that use."},
{"knight-errant","n. One of the wandering knights who in the middle ages went forth in search of adventure."},
{"knighthood","n. Chivalry."},
//****************************LLLLLLLLLLLLLLLL
{"lol"," lots of love"},
{"laborious","adj. Toilsome."},
{"labyrinth","n. A maze."},
{"lacerate","v. To tear rudely or raggedly."},
{"lackadaisical","adj. Listless."},
{"lactation","n. The secretion of milk."},
{"lacteal","adj. Milky."},
{"lactic","adj. Pertaining to milk."},
{"laddie","n. A lad."},
{"ladle","n. A cup-shaped vessel with a long handle, intended for dipping up and pouring liquids."},
{"laggard","adj. Falling behind."},
{"landholder","n. Landowner."},
{"landlord","n. A man who owns and lets a tenement or tenements."},
{"landmark","n. A familiar object in the landscape serving as a guide to an area otherwise easily lost track of."},
{"landscape","n. A rural view, especially one of picturesque effect, as seen from a distance or an elevation."},
{"languid","adj. Relaxed."},
{"languor","n. Lassitude of body or depression."},
{"lapse","n. A slight deviation from what is right, proper, or just."},
{"lascivious","adj. Lustful."},
{"lassie","n. A little lass."},
{"latent","adj. Dormant."},
{"latency","n. The state of being dormant."},
{"later","adv. At a subsequent time"},
{"lateral","adj. Directed toward the side."},
{"latish","adj. Rather late."},
{"lattice","n. Openwork of metal or wood, formed by crossing or interlacing strips or bars."},
{"laud","v. To praise in words or song."},
{"laudable","adj. Praiseworthy."},
{"laudation","n. High praise."},
{"laudatory","adj. Pertaining to, expressing, or containing praise."},
{"laundress","n. Washerwoman."},
{"laureate","adj. Crowned with laurel, as a mark of distinction."},
{"lave","v. To wash or bathe."},
{"lawgiver","n. A legislator."},
{"lawmaker","n. A legislator."},
{"lax","adj. Not stringent or energetic."},
{"laxative","adj. Having power to open or loosen the bowels. lea n. A field."},
{"leaflet","n. A little leaf or a booklet."},
{"leaven","v. To make light by fermentation, as dough."},
{"leeward","n. That side or direction toward which the wind blows."},
{"left-handed","adj. Using the left hand or arm more dexterously than the right."},
{"legacy","n. A bequest."},
{"legalize","v. To give the authority of law to."},
{"legging","n. A covering for the leg"},
{"legible","adj. That may be read with ease."},
{"legionary","n. A member of an ancient Roman legion or of the modern French Legion of Honor."},
{"legislate","v. To make or enact a law or laws."},
{"legislative","adj. That makes or enacts laws."},
{"egislator"," n. A lawgiver."},
{"legitimacy","n. Accordance with law."},
{"legitimate","adj. Having the sanction of law or established custom."},
{"leisure","n. Spare time."},
{"leniency","n. Forbearance."},
{"lenient","adj. Not harsh."},
{"leonine","adj. Like a lion."},
{"lethargy","n. Prolonged sluggishness of body or mind."},
{"levee","n. An embankment beside a river or stream or an arm of the sea, to prevent overflow"},
{"lever","n. That which exerts, or through which one may exert great power."},
{"leviathan","n. Any large animal, as a whale."},
{"levity","n. Frivolity."},
{"levy","v. To impose and collect by force or threat of force."},
{"lewd","adj. Characterized by lust or lasciviousness."},
{"lexicographer","n. One who makes dictionaries."},
{"lexicography","n. The making of dictionaries."},
{"lexicon","n. A dictionary."},
{"liable","adj. Justly or legally responsible."},
{"libel","n. Defamation."},
{"liberalism","n. Opposition to conservatism."},
{"liberate","v. To set free or release from bondage."},
{"licentious","adj. Wanton."},
{"licit","adj. Lawful."},
{"liege","adj. Sovereign."},
{"lien","n. A legal claim or hold on property, as security for a debt or charge."},
{"lieu"," n. Stead."},
{"lifelike","adj. Realistic."},
{"lifelong","adj. Lasting or continuous through life."},
{"lifetime","n. The time that life continues."},
{"ligament","n. That which binds objects together."},
{"ligature","n. Anything that constricts, or serves for binding or tying."},
{"light-hearted","adj. Free from care."},
{"ligneous","adj. Having the texture of appearance of wood."},
{"likelihood","n. A probability."},
{"likely","adj. Plausible."},
{"liking","n. Fondness."},
{"limitation","n. A restriction."},
{"linear","adj. Of the nature of a line."},
{"liner","n. A vessel belonging to a steamship-line."},
{"lingo","n. Language."},
{"lingua","n. The tongue."},
{"lingual","adj. Pertaining to the use of the tongue in utterance."},
{"linguist","n. One who is acquainted with several languages."},
{"linguistics","n. The science of languages, or of the origin, history, and significance of words."},
{"liniment","n. A liquid preparation for rubbing on the skin in cases of bruises, inflammation, etc."},
{"liquefacient","adj. Possessing a liquefying nature or power."},
{"liquefy","v. To convert into a liquid or into liquid form."},
{"liqueur","n. An alcoholic cordial sweetened and flavored with aromatic substances."},
{"liquidate","v. To deliver the amount or value of."},
{"liquor","n. Any alcoholic or intoxicating liquid."},
{"listless","adj. Inattentive."},
{"literacy","n. The state or condition of knowing how to read and write."},
{"literal","adj. Following the exact words"},
{"literature","n. The written or printed productions of the human mind collectively."},
{"lithe"," adj. Supple"},
{"lithesome","adj. Nimble."},
{"lithograph","n. A print made by printing from stone."},
{"lithotype","n. In engraving, an etched stone surface for printing."},
{"litigant","n. A party to a lawsuit."},
{"litigate","v. To cause to become the subject-matter of a suit at law."},
{"litigious","adj. Quarrelsome."},
{"littoral","adj. Of, pertaining to, or living on a shore"},
{"liturgy","n. A ritual."},
{"livelihood","n. Means of subsistence."},
{"livid","adj. Black-and-blue, as contused flesh"},
{"loam","n. A non-coherent mixture of sand and clay."},
{"loath","adj. Averse."},
{"loathe","v. To abominate."},
{"locative","adj. Indicating place, or the place where or wherein an action occurs."},
{"loch"," n. A lake."},
{"locomotion","n. The act or power of moving from one place to another."},
{"lode","n. A somewhat continuous unstratified metal- bearing vein."},
{"lodgment","n. The act of furnishing with temporary quarters."},
{"logic","n. The science of correct thinking."},
{"logical","adj. Capable of or characterized by clear reasoning."},
{"logician","n. An expert reasoner."},
{"loiterer","n. One who consumes time idly."},
{"loneliness","n. Solitude."},
{"longevity","n. Unusually prolonged life."},
{"loot", "v. To plunder"},
{"loquacious","adj. Talkative."},
{"lordling","n. A little lord."},
{"lough","n. A lake or loch"},
{"louse","n. A small insect parasitic on and sucking the blood of mammals."},
{"lovable","adj. Amiable."},
{"low-spirited","adj. Despondent."},
{"lowly","adv. Rudely."},
{"lucid","adj. Mentally sound."},
{"lucrative","adj. Highly profitable."},
{"ludicrous","adj. Laughable."},
{"luminary","n. One of the heavenly bodies as a source of light."},
{"luminescent","adj. Showing increase of light."},
{"luminescence","n. Showing increase."},
{"luminosity","n. The quality of giving or radiating light."},
{"luminous","adj. Giving or radiating light."},
{"lunacy","n. Mental unsoundness."},
{"lunar","adj. Pertaining to the moon."},
{"lunatic","n. An insane person."},
{"lune","n. The moon."},
{"lurid","adj. Ghastly and sensational."},
{"luscious","adj. Rich, sweet, and delicious."},
{"lustrous","adj. Shining"},
{"luxuriance","n. Excessive or superfluous growth or quantity."},
{"luxuriant","adj. Abundant or superabundant in growth."},
{"luxuriate","v. To live sumptuously."},
{"lying","n. Untruthfulness."},
{"lyre","n. One of the most ancient of stringed instruments of the harp class."},
{"lyric"," adj. Fitted for expression in song."},
//****************************MMMMMMMMMMMMMMMMMM
{"mam-madiha"," the best P.F teacher in the history of K.F.U.E.I.T."},
{"macadamize","v. To cover or pave, as a path or roadway, with small broken stone."},
{"machinery","n. The parts of a machine or engine, taken collectively."},
{"machinist","n. One who makes or repairs machines, or uses metal-working tools."},
{"macrocosm","n. The whole of any sphere or department of nature or knowledge to which man is related."},
{"madden","v. To inflame with passion."},
{"Madonna","n. A painted or sculptured representation of the Virgin, usually with the infant Jesus."},
{"magician","n. A sorcerer."},
{"magisterial","adj. Having an air of authority."},
{"magistracy","n. The office or dignity of a magistrate."},
{"magnanimous","adj. Generous in treating or judging others."},
{"magnate","n. A person of rank or importance."},
{"magnet","n. A body possessing that peculiar form of polarity found in nature in the lodestone."},
{"magnetize","v. To make a magnet of, permanently, or temporarily."},
{"magnificence","n. The exhibition of greatness of action, character, intellect, wealth, or power."},
{"magnificent","adj. Grand or majestic in appearance, quality, or action."},
{"magnitude","n. Importance."},
{"maharaja","n. A great Hindu prince."},
{"maidenhood","n. Virginity."},
{"maintain","v. To hold or preserve in any particular state or condition."},
{"maintenance","n. That which supports or sustains."},
{"maize","n. Indian corn: usually in the United States called simply corn."},
{"makeup","n. The arrangements or combination of the parts of which anything is composed."},
{"malady","n. Any physical disease or disorder, especially a chronic or deep-seated one."},
{"malaria","n. A fever characterized by alternating chills, fever, and sweating."},
{"malcontent","n. One who is dissatisfied with the existing state of affairs."},
{"malediction","n. The calling down of a curse or curses."},
{"malefactor","n. One who injures another."},
{"maleficent","adj. Mischievous"},
{"malevolence","n. Ill will."},
{"malevolent","adj. Wishing evil to others."},
{"malign","v. To speak evil of, especially to do so falsely and severely."},
{"malignant","adj. Evil in nature or tending to do great harm or mischief."},
{"malleable","adj. Pliant."},
{"mallet","n. A wooden hammer."},
{"maltreat","v. To treat ill, unkindly, roughly, or abusively."},
{"man-trap","n. A place or structure dangerous to human life."},
{"mandate","n. A command."},
{"mandatory","adj. Expressive of positive command, as distinguished from merely directory."},
{"mane","n. The long hair growing upon and about the neck of certain animals, as the horse and the lion."},
{"maneater","n. An animal that devours human beings."},
{"maneuver","v. To make adroit or artful moves: manage affairs by strategy."},
{"mania","n. Insanity."},
{"maniac","n. a person raving with madness."},
{"manifesto","n. A public declaration, making announcement, explanation or defense of intentions, or motives."},
{"manlike","adj. Like a man."},
{"manliness","n. The qualities characteristic of a true man, as bravery, resolution, etc."},
{"mannerism","n. Constant or excessive adherence to one manner, style, or peculiarity, as of action or conduct."},
{"manor","n. The landed estate of a lord or nobleman"},
{"mantel","n. The facing, sometimes richly ornamented, about a fireplace, including the usual shelf above it."},
{"mantle","n. A cloak."},
{"manufacture"," n. A person engaged in manufacturing as a business."},
{"manumission","n. Emancipation."},
{"manumit","v. To set free from bondage."},
{"marine","adj. Of or pertaining to the sea or matters connected with the sea."},
{"maritime","adj. Situated on or near the sea."},
{"maroon","v. To put ashore and abandon (a person) on a desolate coast or island."},
{"martial","adj. Pertaining to war or military operations."},
{"Martian","adj. Pertaining to Mars, either the Roman god of war or the planet."},
{"martyrdom""n. Submission to death or persecution for the sake of faith or principle."},
{"marvel","v. To be astonished and perplexed because of (something)."},
{"masonry","n. The art or work of constructing, as buildings, walls, etc., with regularly arranged stones."},
{"masquerade","n. A social party composed of persons masked and costumed so as to be disguised"},
{"massacre","n. The unnecessary and indiscriminate killing of human beings"},
{"massive","adj. Of considerable bulk and weight."},
{"masterpiece","n. A superior production."},
{"mastery","n. The attainment of superior skill."},
{"material","n. That of which anything is composed or may be constructed."},
{"materialize","v. To take perceptible or substantial form."},
{"maternal","adj. Pertaining or peculiar to a mother or to motherhood."},
{"matinee","n. An entertainment (especially theatrical) held in the daytime."},
{"matricide","n. The killing, especially the murdering, of one's mother."},
{"matrimony","n. The union of a man and a woman in marriage."},
{"matrix","n. That which contains and gives shape or form to anything."},
{"matter","of fact n. Something that has actual and undeniable existence or reality"},
{"maudlin","adj. Foolishly and tearfully affectionate."},
{"mausoleum","n. A tomb of more than ordinary size or architectural pretensions."},
{"mawkish","adj. Sickening or insipid."},
{"maxim","n. A principle accepted as true and acted on as a rule or guide."},
{"maze","n. A labyrinth."},
{"mead","n. A meadow."},
{"meager","adj. scanty."},
{"mealymouthed","adj. Afraid to express facts or opinions plainly."},
{"meander","v. To wind and turn while proceeding in a course."},
{"mechanics","n. The branch of physics that treats the phenomena caused by the action of forces."},
{"medallion","n. A large medal."},
{"meddlesome","adj. Interfering."},
{"medial","adj. Of or pertaining to the middle."},
{"mediate","v. To effect by negotiating as an agent between parties."},
{"medicine","n. A substance possessing or reputed to possess curative or remedial properties"},
{"medieval","adj. Belonging or relating to or descriptive of the middle ages."},
{"mediocre","adj. Ordinary."},
{"meditation","n. The turning or revolving of a subject in the mind."},
{"medley","n. A composition of different songs or parts of songs arranged to run as a continuous whole."},
{"meliorate","v. To make better or improve, as in quality or social or physical condition."},
{"mellifluous","adj. Sweetly or smoothly flowing."},
{"melodious","adj. Characterized by a sweet succession of sounds"},
{"melodrama","n. A drama with a romantic story or plot and sensational situation and incidents."},
{"memento","n. A souvenir."},
{"memorabl"," adj. Noteworthy"},
{"menace","n. A threat."},
{"menagerie","n. A collection of wild animals, especially when kept for exhibition."},
{"mendacious","adj. Untrue"},
{"mendicant","n. A beggar."},
{"mentality","n. Intellectuality."},
{"mentor","n. A wise and faithful teacher, guide, and friend."},
{"mercantile","adj. Conducted or acting on business principles; commercial."},
{"mercenary","adj. Greedy"},
{"merciful","adj. Disposed to pity and forgive."},
{"merciless","adj. Cruel."},
{"meretricious","adj. Alluring by false or gaudy show."},
{"mesmerize","v. To hypnotize."},
{"messieurs","n. pl. Gentlemen."},
{"metal","n. An element that forms a base by combining with oxygen, is usually hard, heavy, and lustrous."},
{"metallurgy","n. The art or science of extracting a metal from ores, as by smelting."},
{"metamorphosis","n. A passing from one form or shape into another."},
{"metaphor","n. A figure of speech in which one object is likened to another, by speaking as if the other."},
{"metaphysical","adj. Philosophical."},
{"metaphysician","n. One skilled in metaphysics."},
{"metaphysics","n. The principles of philosophy as applied to explain the methods of any particular science"},
{"mete","v. To apportion."},
{"metempsychosis","n. Transition of the soul of a human being at death into another body, whether human or beast."},
{"meticulous","adj. Over-cautious."},
{"metonymy","n. A figure of speech that consists in the naming of a thing by one of its attributes."},
{"metric","adj. Relating to measurement."},
{"metronome","n. An instrument for indicating and marking exact time in music."},
{"metropolis","n. A chief city, either the capital or the largest or most important city of a state."},
{"metropolitan","adj. Pertaining to a chief city."},
{"mettle","n. Courage."},
{"mettlesome","adj. Having courage or spirit."},
{"microcosm","n. The world or universe on a small scale."},
{"micrometer","n. An instrument for measuring very small angles or dimensions."},
{"microphone","n. An apparatus for magnifying faint sounds."},
{"microscope","n. An instrument for assisting the eye in the vision of minute objects or features of objects."},
{"microscopic","adj. Adapted to or characterized by minute observation."},
{"microscopy","n. The art of examing objects with the microscope."},
{"midsummer","n. The middle of the summer."},
{"midwife","n. A woman who makes a business of assisting at childbirth."},
{"mien","n. The external appearance or manner of a person."},
{"migrant","adj. Wandering."},
{"migrate","v. To remove or pass from one country, region, or habitat to another."},
{"migratory","adj. Wandering."},
{"mileage","n. A distance in miles."},
{"militant","adj. Of a warlike or combative disposition or tendency."},
{"militarism","n. A policy of maintaining great standing armies."},
{"militate","v. To have weight or influence (in determining a question)."},
{"militia","n. Those citizens, collectively, who are enrolled and drilled in temporary military Organizations"},
{"Milky","Way n. The galaxy."},
{"millet","n. A grass cultivated for forage and cereal."},
{"mimic","v. To imitate the speech or actions of."},
{"miniature","adj. Much smaller than reality or that the normal size."},
{"minimize","v. To reduce to the smallest possible amount or degree."},
{"minion","n. A servile favorite."},
{"ministration","n. Any religious ceremonial."},
{"ministry","n. A service."},
{"minority","n. The smaller in number of two portions into which a number or a group is divided."},
{"minute","adj. Exceedingly small in extent or quantity."},
{"minutia","n. A small or unimportant particular or detail."},
{"mirage","n. An optical effect looking like a sheet of water in the desert."},
{"misadventure","n. An unlucky accident."},
{"misanthropic","adj. Hating mankind."},
{"misanthropy","n. Hatred of mankind."},
{"misapprehend","v. To misunderstand."},
{"misbehave","v. To behave ill."},
{"misbehavior","n. Ill or improper behavior."},
{"mischievous","adj. Fond of tricks."},
{"miscount","v. To make a mistake in counting."},
{"miscreant","n. A villain."},
{"misdeed", "n. A wrong or improper act."},
{"misdemeanor","n. Evil conduct, small crime."},
{"miser","n. A person given to saving and hoarding unduly."},
{"mishap","n. Misfortune."},
{"misinterpret","v. To misunderstand."},
{"mislay","v. To misplace."},
{"mismanage","v. To manage badly, improperly, or unskillfully."},
{"misnomer","n. A name wrongly or mistakenly applied."},
{"misogamy","n. Hatred of marriage."},
{"misogyny","n. Hatred of women."},
{"misplace","v. To put into a wrong place."},
{"misrepresent","v. To give a wrong impression."},
{"misrule","v. To misgovern."},
{"missal","n. The book containing the service for the celebration of mass."},
{"missile","n. Any object, especially a weapon, thrown or intended to be thrown."},
{"missive","n. A message in writing."},
{"mistrust","v. To regard with suspicion or jealousy."},
{"misty","adj. Lacking clearness"},
{"misunderstand","v. To Take in a wrong sense."},
{"misuse","v. To maltreat."},
{"mite","n. A very small amount, portion, or particle."},
{"miter","n. The junction of two bodies at an equally divided angle."},
{"mitigate","v. To make milder or more endurable."},
{"mnemonics","n. A system of principles and formulas designed to assist the recollection in certain instances."},
{"moat","n. A ditch on the outside of a fortress wall."},
{"mobocracy","n. Lawless control of public affairs by the mob or populace."},
{"moccasin","n. A foot-covering made of soft leather or buckskin."},
{"mockery","n. Ridicule."},
{"moderation","n. Temperance."},
{"moderator","n. The presiding officer of a meeting."},
{"modernity","n. The state or character of being modern."},
{"modernize","v. To make characteristic of the present or of recent times."},
{"modification","n. A change."},
{"modify","v. To make somewhat different."},
{"modish","adj. Fashionable."},
{"modulate","v. To vary in tone, inflection, pitch or other quality of sound."},
{"mollify","v. To soothe."},
{"molt","v. To cast off, as hair, feathers, etc."},
{"momentary","adj. Lasting but a short time."},
{"momentous","adj. Very significant."},
{"momentum","n. An impetus."},
{"monarchy","n. Government by a single, sovereign ruler."},
{"monastery","n. A dwelling-place occupied in common by persons under religious vows of seclusion."},
{"monetary","adj. Financial."},
{"mongrel","n. The progeny resulting from the crossing of different breeds or varieties."},
{"monition","n. Friendly counsel given by way of warning and implying caution or reproof."},
{"monitory","n. Admonition or warning."},
{"monocracy","n. Government by a single person."},
{"monogamy","n. The habit of pairing, or having but one mate."},
{"monogram","n. A character consisting of two or more letters interwoven into one, usually initials of a name"},
{"monograph","n. A treatise discussing a single subject or branch of a subject."},
{"monolith","n. Any structure or sculpture in stone formed of a single piece."},
{"monologue","n. A story or drama told or performed by one person."},
{"monomania","n. The unreasonable pursuit of one idea."},
{"monopoly","n. The control of a thing, as a commodity, to enable a person to raise its price."},
{"monosyllable","n. A word of one syllable."},
{"monotone","n. The sameness or monotony of utterance."},
{"monotonous","adj. Unchanging and tedious."},
{"monotony","n. A lack of variety."},
{"monsieur","n. A French title of respect, equivalent to Mr. and sir."},
{"monstrosity","Anything unnaturally huge or distorted."},
{"moonbeam","n. A ray of moonlight."},
{"morale","n. A state of mind with reference to confidence, courage, zeal, and the like."},
{"moralist", "n. A writer on ethics."},
{"morality","n. Virtue."},
{"moralize","v. To render virtuous."},
{"moratorium","n. An emergency legislation authorizing a government suspend some action temporarily."},
{"morbid","adj. Caused by or denoting a diseased or unsound condition of body or mind."},
{"mordacious","adj. Biting or giving to biting."},
{"mordant","adj. Biting."},
{"moribund","adj. On the point of dying."},
{"morose","adj. Gloomy."},
{"morphology","n. the science of organic forms."},
{"motley","adj. Composed of heterogeneous or inharmonious elements."},
{"motto","n. An expressive word or pithy sentence enunciating some guiding rule of life, or faith."},
{"mountaineer","n. One who travels among or climbs mountains for pleasure or exercise."},
{"mountainous","adj. Full of or abounding in mountains."},
{"mouthful","n. As much as can be or is usually put into the or exercise."},
{"muddle","v. To confuse or becloud, especially with or as with drink."},
{"muffle","v. To deaden the sound of, as by wraps."},
{"mulatto","n. The offspring of a white person and a black person."},
{"muleteer","n. A mule-driver."},
{"multiform","adj. Having many shapes, or appearances."},
{"multiplicity","n. the condition of being manifold or very various."},
{"mundane","adj. Worldly, as opposed to spiritual or celestial."},
{"municipal","adj. Of or pertaining to a town or city, or to its corporate or local government."},
{"municipality","n. A district enjoying municipal government."},
{"munificence","n. A giving characterized by generous motives and extraordinary liberality."},
{"munificent","adj. Extraordinarily generous."},
{"muster","n. An assemblage or review of troops for parade or inspection, or for numbering off."},
{"mutation","n. The act or process of change."},
{"mutilate","v. To disfigure."},
{"mutiny","n. Rebellion against lawful or constituted authority."},
{"myriad","n. A vast indefinite number."},
{"mystic","n. One who professes direct divine illumination, or relies upon meditation to acquire truth."},
{"mystification","n. The act of artfully perplexing."},
{"myth","n. A fictitious narrative presented as historical, but without any basis of fact."},
{"mythology","n. The whole body of legends cherished by a race concerning gods and heroes."},
//****************************NNNNNNNNNNNNNN
{"nameless","adj. Having no fame or reputation."},
{"naphtha","n. A light, colorless, volatile, inflammable oil used as a solvent, as in manufacture of paints."},
{"Narcissus","n. The son of the Athenian river-god Cephisus, fabled to have fallen in love with his reflection."},
{"narrate","v. To tell a story."},
{"narration","n. The act of recounting the particulars of an event in the order of time or occurrence."},
{"narrative","n. An orderly continuous account of the successive particulars of an event."},
{"narrator","n. One who narrates anything."},
{"narrowminded","adj. Characterized by illiberal views or sentiments."},
{"nasal","adj. Pertaining to the nose."},
{"natal","adj. Pertaining to one's birth."},
{"nationality","n. A connection with a particular nation."},
{"naturally","adv. According to the usual order of things."},
{"nausea","n. An affection of the stomach producing dizziness and usually an impulse to vomit"},
{"nauseate","v. To cause to loathe."},
{"nauseous","adj. Loathsome."},
{"nautical","adj. Pertaining to ships, seamen, or navigation."},
{"naval","adj. Pertaining to ships."},
{"navel","n. The depression on the abdomen where the umbilical cord of the fetus was attached."},
{"navigable","adj. Capable of commercial navigation."},
{"navigate","v. To traverse by ship."},
{"nebula","n. A gaseous body of unorganized stellar substance."},
{"necessary","adj. Indispensably requisite or absolutely needed to accomplish a desired result."},
{"necessitate","v. To render indispensable."},
{"necessity","n. That which is indispensably requisite to an end desired."},
{"necrology","n. A list of persons who have died in a certain place or time."},
{"necromancer","n. One who practices the art of foretelling the future by means of communication with the dead."},
{"necropolis","n. A city of the dead."},
{"necrosis","n. the death of part of the body."},
{"nectar","n. Any especially sweet and delicious drink."},
{"nectarine","n. A variety of the peach."},
{"needlework","n. Embroidery."},
{"needy","adj. Being in need, want, or poverty."},
{"nefarious","adj. Wicked in the extreme."},
{"negate","v. To deny."},
{"negation","n. The act of denying or of asserting the falsity of a proposition."},
{"neglectful","adj. Exhibiting or indicating omission."},
{"negligee","n. A loose gown worn by women."},
{"negligence","n. Omission of that which ought to be done."},
{"negligent","adj. Apt to omit what ought to be done."},
{"negligible","adj. Transferable by assignment, endorsement, or delivery."},
{"negotiable","v. To bargain with others for an agreement, as for a treaty or transfer of property."},
{"Nemesis","n. A goddess; divinity of chastisement and vengeance."},
{"neocracy","n. Government administered by new or untried persons."},
{"neo-Darwinsim","n. Darwinism as modified and extended by more recent students."},
{"neo-Latin","n. Modernized Latin."},
{"neopaganism","n. A new or revived paganism."},
{"Neolithic","adj. Pertaining to the later stone age."},
{"neology","n. The coining or using of new words or new meanings of words."},
{"neophyte","adj. Having the character of a beginner."},
{"nestle","v. To adjust cozily in snug quarters."},
{"nestling","adj. Recently hatched."},
{"nettle","v. To excite sensations of uneasiness or displeasure in."},
{"network","n. Anything that presents a system of cross- lines."},
{"neural","adj. Pertaining to the nerves or nervous system."},
{"neurology","n. The science of the nervous system."},
{"neuter","adj. Neither masculine nor feminine."},
{"neutral","adj. Belonging to or under control of neither of two contestants."},
{"nevertheless","conj. Notwithstanding."},
{"Newtonian","adj. Of or pertaining to Sir Isaac Newton, the English philosopher."},
{"niggardly","adj. Stingy. (no longer acceptable to use)"},
{"nihilist","n. An advocate of the doctrine that nothing either exists or can be known."},
{"nil"," n. Nothing"},
{"nimble","adj. Light and quick in motion or action."},
{"nit","n. The egg of a louse or some other insect."},
{"nocturnal","adj. Of or pertaining to the night."},
{"noiseless","adj. Silent."},
{"noisome","adj. Very offensive, particularly to the sense of smell."},
{"noisy","adj. Clamorous."},
{"nomad","adj. Having no fixed abode."},
{"nomic","adj. Usual or customary."},
{"nominal","adj. Trivial."},
{"nominate","v. To designate as a candidate for any office."},
{"nomination","n. The act or ceremony of naming a man or woman for office."},
{"nominee","n. One who receives a nomination."},
{"nonexistent","n. That which does not exist."},
{"nonresident","adj. Not residing within a given jurisdiction."},
{"nonchalance","n. A state of mind indicating lack of interest."},
{"noncombatant","n. One attached to the army or navy, but having duties other than that of fighting."},
{"nondescript","adj. Indescribable."},
{"nonentity","n. A person or thing of little or no account."},
{"nonpareil","n. One who or that which is of unequaled excellence."},
{"norm","n. A model."},
{"normalcy","n. The state of being normal."},
{"Norman","adj. Of or peculiar to Normandy, in northern France."},
{"nostrum","n. Any scheme or recipe of a charlatan character."},
{"noticeable","adj. Perceptible."},
{"notorious","adj. Unfavorably known to the general public."},
{"novelette","n. A short novel."},
{"novice","n. A beginner in any business or occupation."},
{"nowadays","adv. In the present time or age."},
{"nowhere","adv. In no place or state."},
{"noxious","adj. Hurtful."},
{"nuance","n. A slight degree of difference in anything perceptible to the sense of the mind."},
{"nucleus","n. A central point or part about which matter is aggregated."},
{"nude","adj. Naked."},
{"nugatory","adj. Having no power or force."},
{"nuisance","n. That which annoys, vexes, or irritates."},
{"numeration","n. The act or art of reading or naming numbers."},
{"numerical","adj. Of or pertaining to number."},
{"nunnery","n. A convent for nuns."},
{"nuptial","adj. Of or pertaining to marriage, especially to the marriage ceremony."},
{"nurture","n. The process of fostering or promoting growth."},
{"nutriment","n. That which nourishes."},
{"nutritive","adj. Having nutritious properties."},
//****************************OOOOOOOOOOOOOOOO
{"oaken","adj. Made of or from oak."},
{"oakum","n. Hemp-fiber obtained by untwisting and picking out loosely the yarns of old hemp rope."},
{"obdurate","adj. Impassive to feelings of humanity or pity."},
{"obelisk","n. A square shaft with pyramidal top, usually monumental or commemorative."},
{"obese","adj. Exceedingly fat."},
{"obesity","n. Excessive fatness."},
{"obituary","adj. A published notice of a death."},
{"objective","adj. Grasping and representing facts as they are."},
{"objector","n. One who objects, as to a proposition, measure, or ruling."},
{"obligate","v. To hold to the fulfillment of duty."},
{"obligatory","adj. Binding in law or conscience."},
{"oblique","adj. Slanting; said of lines."},
{"obliterate","v. To cause to disappear."},
{"oblivion","n. The state of having passed out of the memory or of being utterly forgotten."},
{"oblong","adj. Longer than broad: applied most commonly to rectangular objects considerably elongated"},
{"obnoxious","adj. Detestable."},
{"obsequies","n. Funeral rites."},
{"obsequious","adj. Showing a servile readiness to fobservance n. A traditional form or customary act."},
{"observant","adj. Quick to notice."},
{"observatory","n. A building designed for systematic astronomical observations."},
{"obsolescence","n. The condition or process of gradually falling into disuse."},
{"obsolescent","adj. Passing out of use, as a word."},
{"obsolete","adj. No longer practiced or accepted."},
{"obstetrician","n. A practitioner of midwifery."},
{"obstetrics","n. The branch of medical science concerned with the treatment and care of women during pregnancy."},
{"obstinacy","n. Stubborn adherence to opinion, arising from conceit or the desire to have one's own way."},
{"obstreperous","adj. Boisterous."},
{"obstruct","v. To fill with impediments so as to prevent passage, either wholly or in part."},
{"obstruction","n. Hindrance."},
{"obtrude","v. To be pushed or to push oneself into undue prominence."},
{"obtrusive","adj. Tending to be pushed or to push oneself into undue prominence."},
{"obvert","v. To turn the front or principal side of (a thing) toward any person or object."},
{"obviate","v. To clear away or provide for, as an objection or difficulty."},
{"occasion","n. An important event or celebration."},
{"Occident","n. The countries lying west of Asia and the Turkish dominions."},
{"occlude","v. To absorb, as a gas by a metal."},
{"occult","adj. Existing but not immediately perceptible."},
{"occupant","n. A tenant in possession of property, as distinguished from the actual owner."},
{"occurrence","n. A happening."},
{"octagon","n. A figure with eight sides and eight angles."},
{"octave","n. A note at this interval above or below any other, considered in relation to that other."},
{"octavo","n. A book, or collection of paper in which the sheets are so folded as to make eight leaves."},
{"octogenarian","adj. A person of between eighty and ninety years."},
{"ocular","adj. Of or pertaining to the eye."},
{"oculist","n. One versed or skilled in treating diseases of the eye."},
{"oddity","n. An eccentricity."},
{"ode","n. The form of lyric poetry anciently intended to be sung."},
{"odious","adj. Hateful."},
{"odium","n. A feeling of extreme repugnance, or of dislike and disgust."},
{"odoriferous","adj. Having or diffusing an odor or scent, especially an agreeable one."},
{"odorous","adj. Having an odor, especially a fragrant one."},
{"off","adj. Farther or more distant."},
{"offhand","adv. Without preparation."},
{"officiate","v. To act as an officer or leader."},
{"officious","adj. Intermeddling with what is not one's concern."},
{"offshoot","n. Something that branches off from the parent stock."},
{"ogre","n. A demon or monster that was supposed to devour human beings."},
{"ointment","n. A fatty preparation with a butter-like consistency in which a medicinal substance exists."},
{"olfactory","adj. of or pertaining to the sense of smell."},
{"olivebranch","n. A branch of the olive-tree, as an emblem of peace."},
{"ominous","adj. Portentous."},
{"omission","n. Exclusion."},
{"omnipotence","n. Unlimited and universal power."},
{"Omnipotent","adj. Possessed of unlimited and universal power."},
{"omniscience","n. Unlimited or infinite knowledge."},
{"omniscient","adj. Characterized by unlimited or infinite knowledge."},
{"omnivorous","adj. Eating or living upon food of all kinds indiscriminately."},
{"onerous","adj. Burdensome or oppressive."},
{"onrush","n. Onset."},
{"onset","n. An assault, especially of troops, upon an enemy or fortification."},
{"onslaught",". A violent onset."},
{"onus","n. A burden or responsibility."},
{"opalescence","n. The property of combined refraction and reflection of light, resulting in smoky tints."},
{"opaque","adj. Impervious to light."},
{"operate","v. To put in action and supervise the working of."},
{"operative","adj. Active."},
{"operator","n. One who works with or controls some machine or scientific apparatus."},
{"operetta","n. A humorous play in dialogue and music, of more than one act."},
{"opinion","n. A conclusion or judgment held with confidence, but falling short of positive Knowledge"},
{"opponent","n. One who supports the opposite side in a debate, discussion, struggle, or Sport"},
{"opportune","adj. Especially fit as occurring, said, or done at the right moment."},
{"opportunist","n. One who takes advantage of circumstances to gain his ends."},
{"opportunity","n. Favorable or advantageous chance or opening."},
{"opposite","adj. Radically different or contrary in action or movement."},
{"opprobrium","n. The state of being scornfully reproached or accused of evil."},
{"optic","n. Pertaining to the eye or vision."},
{"optician","n. One who makes or deals in optical instruments or eye-glasses."},
{"optics","n. The science that treats of light and vision, and all that is connected with sight."},
{"optimism","n. The view that everything in nature and the history of mankind is ordered for the best."},
{"option","n. The right, power, or liberty of choosing."},
{"optometry","n. Measurement of the powers of vision."},
{"opulence","n. Affluence."},
{"opulent","adj. Wealthy."},
{"oral","adj. Uttered through the mouth."},
{"orate","v. To deliver an elaborate or formal public speech."},
{"oration","n. An elaborate or formal public speech."},
{"orator","n. One who delivers an elaborate or formal speech."},
{"oratorio","n. A composition for solo voices, chorus, and orchestra, generally taken from the Scriptures."},
{"oratory","n. The art of public speaking."},
{"ordeal","n. Anything that severely tests courage, strength, patience, conscience, etc."},
{"ordinal","n. That form of the numeral that shows the order of anything in a series, as first, second, third."},
{"ordination","n. A consecration to the ministry."},
{"ordnance","n. A general name for all kinds of weapons and their appliances used in war."},
{"orgies","n. Wild or wanton revelry."},
{"origin","n. The beginning of that which becomes or is made to be."},
{"original","adj. Not copied nor produced by imitation."},
{"originate","v. To cause or constitute the beginning or first stage of the existence of."},
{"ornate","adj. Ornamented to a marked degree."},
{"orthodox","adj. Holding the commonly accepted faith."},
{"orthodoxy","n. Acceptance of the common faith."},
{"orthogonal","adj. Having or determined by right angles."},
{"orthopedic","adj. Relating to the correcting or preventing of deformity"},
{"orthopedist","n. One who practices the correcting or preventing of deformity"},
{"oscillate","v. To swing back and forth."},
{"osculate","v. To kiss."},
{"ossify"" v. to convert into bone."},
{"ostentation","n. A display dictated by vanity and intended to invite applause or flattery."},
{"ostracism","n. Exclusion from intercourse or favor, as in society or politics."},
{"ostracize","v. To exclude from public or private favor."},
{"ought","v. To be under moral obligation to be or do."},
{"oust","v. To eject."},
{"outandout","adv. Genuinely."},
{"outbreak","n. A sudden and violent breaking forth, as of something that has been pent up or restrained."},
{"outburst","n. A violent issue, especially of passion in an individual."},
{"outcast","n. One rejected and despised, especially socially."},
{"outcry","n. A vehement or loud cry or clamor."},
{"outdo","v. To surpass."},
{"outlandish","adj. Of barbarous, uncouth, and unfamiliar aspect or action."},
{"outlast","v. To last longer than."},
{"outlaw","n. A habitual lawbreaker."},
{"outlive","v. To continue to exist after."},
{"outoftheway","adj. Remotely situated."},
{"outpost","n. A detachment of troops stationed at a distance from the main body to guard against surprise."},
{"outrage","n. A gross infringement of morality or decency."},
{"outrageous","adj. Shocking in conduct."},
{"outreach","v. To reach or go beyond."},
{"outride","v. To ride faster than."},
{"outrigger","n. A part built or arranged to project beyond a natural outline for support."},
{"outright","adv. Entirely."},
{"outskirt","n. A border region."},
{"outstretch","v. To extend."},
{"outstrip","v. To go beyond."},
{"outweigh","v. To surpass in importance or excellence."},
{"overdo","v. To overtax the strength of."},
{"overdose","n. An excessive dose, usually so large a dose of a medicine that its effect is toxic."},
{"overeat","v. To eat to excess."},
{"overhang","n. A portion of a structure which projects or hangs over."},
{"overleap","v. To leap beyond."},
{"overlord","n. One who holds supremacy over another."},
{"overpass","v. To pass across or over, as a river."},
{"overpay","v. To pay or reward in excess."},
{"overpower","v. To gain supremacy or victory over by superior power."},
{"overproduction","n. Excessive production.all in with the wishes or will of another."},
{"overreach","v. To stretch out too far."},
{"overrun","v. To infest or ravage."},
{"oversee","v. To superintend."},
{"overseer","n. A supervisor."},
{"overshadow","v. To cast into the shade or render insignificant by comparison."},
{"overstride","v. To step beyond."},
{"overthrow","v. To vanquish an established ruler or government."},
{"overtone","n. A harmonic."},
{"overture","n. An instrumental prelude to an opera, oratorio, or ballet."},
{"overweight","n. Preponderance."},
//****************************PPPPPPPPPPPPPPP
{"pacify","v. To bring into a peaceful state."},
{"packet","n. A bundle, as of letters."},
{"pact","n. A covenant."},
{"pagan","n. A worshiper of false gods."},
{"pageant","n. A dramatic representation, especially a spectacular one."},
{"palate","n. The roof of the mouth."},
{"palatial","adj. Magnificent."},
{"paleontology","n. The branch of biology that treats of ancient life and fossil organisms."},
{"palette","n. A thin tablet, with a hole for the thumb, upon which artists lay their colors for painting."},
{"palinode","n. A retraction."},
{"pall","v. To make dull by satiety."},
{"palliate","v. To cause to appear less guilty."},
{"pallid","adj. Of a pale or wan appearance."},
{"palpable","n. perceptible by feeling or touch."},
{"palsy","n. Paralysis."},
{"paly","adj. Lacking color or brilliancy."},
{"pamphlet","n. A brief treatise or essay, usually on a subject of current interest."},
{"pamphleteer","v. To compose or issue pamphlets, especially controversial ones."},
{"panacea","n. A remedy or medicine proposed for or professing to cure all diseases."},
{"Panamerican","adj. Including or pertaining to the whole of America, both North and South."},
{"pandemic","adj. Affecting a whole people or all classes, as a disease."},
{"pandemonium","n. A fiendish or riotous uproar."},
{"panegyric"," n. A formal and elaborate eulogy, written or spoken, of a person or of an act."},
{"panel","n. A rectangular piece set in or as in a frame."},
{"panic","n. A sudden, unreasonable, overpowering fear."},
{"panoply","n. A full set of armor."},
{"panorama","n. A series of large pictures representing a continuous scene."},
{"pantheism","n. The worship of nature for itself or its beauty."},
{"Pantheon","n. A circular temple at Rome with a fine Corinthian portico and a great domed roof."},
{"pantomime","n. Sign-language."},
{"pantoscope","n. A very wide-angled photographic lens."},
{"papacy","n. The official head of the Roman Catholic Church."},
{"papyrus","n. The writing-paper of the ancient Egyptians, and later of the Romans."},
{"parable","n. A brief narrative founded on real scenes or events usually with a moral."},
{"paradox","n. A statement or doctrine seemingly in contradiction to the received belief."},
{"paragon","n. A model of excellence."},
{"parallel","v. To cause to correspond or lie in the same direction and equidistant in all parts."},
{"parallelism","n. Essential likeness."},
{"paralysis","n. Loss of the power of contractility in the voluntary or involuntary muscles."},
{"paralyze","v. To deprive of the power to act."},
{"paramount","adj. Supreme in authority."},
{"paramour","n. One who is unlawfully and immorally a lover or a mistress."},
{"paraphernalia","n. Miscellaneous articles of equipment or adornment."},
{"paraphrase","v. Translate freely."},
{"pare","v. To cut, shave, or remove (the outside) from anything."},
{"parentage","n. The relation of parent to child, of the producer to the produced, or of cause to effect."},
{"Pariah","n. A member of a degraded class; a social outcast."},
{"parish","n. The ecclesiastical district in charge of a pastor."},
{"Parisian","adj. Of or pertaining to the city of Paris."},
{"parity","n. Equality, as of condition or rank."},
{"parlance","n. Mode of speech."},
{"parley","v. To converse in."},
{"parliament","n. A legislative body."},
{"parlor","n. A room for reception of callers or entertainment of guests."},
{"parody","v. To render ludicrous by imitating the language of."},
{"paronymous","adj. Derived from the same root or primitive word."},
{"paroxysm","n. A sudden outburst of any kind of activity."},
{"parricide","n. The murder of a parent."},
{"parse","v. To describe, as a sentence, by separating it into its elements and describing each word."},
{"parsimonious","adj. Unduly sparing in the use or expenditure of money."},
{"partible","adj. Separable."},
{"participant","n. One having a share or part."},
{"participate","v. To receive or have a part or share of."},
{"partition","n. That which separates anything into distinct parts."},
{"partisan","adj. Characterized by or exhibiting undue or unreasoning devotion to a party."},
{"passible","adj. Capable of feeling of suffering."},
{"passive","adj. Unresponsive."},
{"pastoral","adj. Having the spirit or sentiment of rural life."},
{"paternal","adj. Fatherly."},
{"paternity","n. Fatherhood."},
{"pathos","n. The quality in any form of representation that rouses emotion or sympathy."},
{"patriarch","n. The chief of a tribe or race who rules by paternal right."},
{"patrician","adj. Of senatorial or noble rank."},
{"patrimony","n. An inheritance from an ancestor, especially from one's father."},
{"patriotism","n. Love and devotion to one's country."},
{"patronize","v. To exercise an arrogant condescension toward."},
{"patronymic","adj. Formed after one's father's name."},
{"patter","v. To mumble something over and over."},
{"paucity","n. Fewness."},
{"pauper","n. One without means of support."},
{"pauperism","n. Dependence on charity."},
{"pavilion","n. An open structure for temporary shelter."},
{"payee","n. A person to whom money has been or is to be paid."},
{"peaceable","adj. Tranquil."},
{"peaceful","adj. Tranquil."},
{"peccable","adj. Capable of sinning."},
{"peccadillo","n. A small breach of propriety or principle."},
{"peccant","adj. Guilty."},
{"pectoral","adj. Pertaining to the breast or thorax."},
{"pecuniary","adj. Consisting of money."},
{"pedagogics","n. The science and art of teaching."},
{"pedagogue","n. A schoolmaster."},
{"pedagogy","n. The science and art of teaching"},
{"pedal","n. A lever for the foot usually applied only to musical instruments, cycles, and other machines."},
{"pedant","n. A scholar who makes needless and inopportune display of his learning."},
{"peddle","v. To go about with a small stock of goods to sell."},
{"pedestal","n. A base or support as for a column, statue, or vase."},
{"pedestrian","n. One who journeys on foot."},
{"pediatrics","n. The department of medical science that relates to the treatment of diseases of childhood."},
{"pedigree","n. One's line of ancestors."},
{"peddler","n. One who travels from house to house with an assortment of goods for retail."},
{"peerage","n. The nobility."},
{"peerless","adj. Of unequaled excellence or worth."},
{"peevish","adj. Petulant. (irritable)"},
{"pellucid","adj. Translucent."},
{"penalty","n. The consequences that follow the transgression of natural or divine law."},
{"penance","n. Punishment to which one voluntarily submits or subjects himself as an expression of penitence."},
{"penchant","n. A bias in favor of something."},
{"pendant","n. Anything that hangs from something else, either for ornament or for use."},
{"pendulous","adj. Hanging, especially so as to swing by an attached end or part."},
{"pendulum","n. A weight hung on a rod, serving by its oscillation to regulate the rate of a clock."},
{"penetrable","adj. That may be pierced by physical, moral, or intellectual force."},
{"penetrate","v. To enter or force a way into the interior parts of."},
{"penetration","n. Discernment."},
{"peninsular","adj. Pertaining to a piece of land almost surrounded by water."},
{"penitence","n. Sorrow for sin with desire to amend and to atone."},
{"penitential","adj. Pertaining to sorrow for sin with desire to amend and to atone."},
{"pennant" "n. A small flag."},
{"pension","n. A periodical allowance to an individual on account of past service done by him/her."},
{"pentagram","n. A figure having five points or lobes."},
{"pentavalent","adj. Quinqeuvalent."},
{"pentad","n. The number five."},
{"pentagon","n. A figure, especially, with five angles and five sides."},
{"pentahedron","n. A solid bounded by five plane faces."},
{"pentameter","n. In prosody, a line of verse containing five units or feet."},
{"pentathlon","n. The contest of five associated exercises in the great games and the same contestants."},
{"penultimate","adj. A syllable or member of a series that is last but one."},
{"penurious","adj. Excessively sparing in the use of money."},
{"penury","n. Indigence."},
{"perambulate","v. To walk about."},
{"perceive","v. To have knowledge of, or receive impressions concerning, through the medium of the body senses."},
{"perceptible","adj. Cognizable."},
{"perception","n. Knowledge through the senses of the existence and properties of matter or the external world."},
{"percipience","n. The act of perceiving."},
{"percipient","n. One who or that which perceives."},
{"percolate","v. To filter."},
{"percolator","n. A filter."},
{"percussion","n. The sharp striking of one body against another."},
{"peremptory","adj. Precluding question or appeal."},
{"perennial","adj. Continuing though the year or through many years."},
{"perfectible","adj. Capable of being made perfect."},
{"perfidy","n. Treachery."},
{"perforate","v. To make a hole or holes through."},
{"perform","v. To accomplish."},
{"perfumery","n. The preparation of perfumes."},
{"perfunctory","adj. Half-hearted."},
{"perhaps","adv. Possibly."},
{"perigee","n. The point in the orbit of the moon when it is nearest the earth."},
{"periodicity","n. The habit or characteristic of recurrence at regular intervals."},
{"peripatetic","adj. Walking about."},
{"perjure","v. To swear falsely to."},
{"perjury","n. A solemn assertion of a falsity."},
{"permanence","n. A continuance in the same state, or without any change that destroys the essential form or nature."},
{"permanent","adj. Durable."},
{"permeate","v. To pervade."},
{"permissible","adj. That may be allowed."},
{"permutation","n. Reciprocal change, different ordering of same items."},
{"pernicious","adj. Tending to kill or hurt."},
{"perpendicular","adj. Straight up and down."},
{"perpetrator","n. The doer of a wrong or a criminal act."},
{"perpetuate","v. To preserve from extinction or oblivion."},
{"perquisite","n. Any profit from service beyond the amount fixed as salary or wages."},
{"persecution","n. Harsh or malignant oppression."},
{"perseverance","n. A persistence in purpose and effort."},
{"persevere","v. To continue striving in spite of discouragements."},
{"persiflage","n. Banter."},
{"persist","v. To continue steadfast against opposition."},
{"persistence","n. A fixed adherence to a resolve, course of conduct, or the like."},
{"personage","n. A man or woman as an individual, especially one of rank or high station."},
{"personal","adj. Not general or public."},
{"personality","n. The attributes, taken collectively, that make up the character and nature of an individual."},
{"personnel","n. The force of persons collectively employed in some service."},
{"perspective","n. The relative importance of facts or matters from any special point of view."},
{"perspicacious","adj. Astute."},
{"perspicacity","n. Acuteness or discernment."},
{"perspicuous","adj. Lucid."},
{"perspiration","n. Sweat."},
{"perspire","v. To excrete through the pores of the skin."},
{"persuade","v. To win the mind of by argument, eloquence, evidence, or reflection."},
{"persuadable","adj. capable of influencing to action by entreaty, statement, or anything that moves the feelings."},
{"pertinacious","adj. Persistent or unyielding."},
{"pertinacity","n. Unyielding adherence."},
{"pertinent","adj. Relevant."},
{"perturb","v. To disturb greatly."},
{"perturbation","n. Mental excitement or confusion."},
{"perusal","n. The act of reading carefully or thoughtfully."},
{"pervade","v. To pass or spread through every part."},
{"pervasion","n. The state of spreading through every part."},
{"pervasive","adj. Thoroughly penetrating or permeating."},
{"perverse","adj. Unreasonable."},
{"perversion","n. Diversion from the true meaning or proper purpose."},
{"perversity","n. Wickedness."},
{"pervert","n. One who has forsaken a doctrine regarded as true for one esteemed false."},
{"pervious","adj. Admitting the entrance or passage of another substance."},
{"pestilence","n. A raging epidemic."},
{"pestilent","adj. Having a malign influence or effect."},
{"pestilential","adj. having the nature of or breeding pestilence."},
{"peter","v. To fail or lose power, efficiency, or value."},
{"petrify","v. To convert into a substance of stony hardness and character."},
{"petulance","n. The character or condition of being impatient, capricious or petulant"},
{"petulant","adj. Displaying impatience."},
{"pharmacopoeia","n. A book containing the formulas and methods of preparation of medicines for the use of druggists."},
{"pharmacy","n. The art or business of compounding and dispensing medicines."},
{"phenomenal","adj. Extraordinary or marvelous."},
{"phenomenon","n. Any unusual occurrence."},
{"philander","v. To play at courtship with a woman."},
{"philanthropic","adj. Benevolent."},
{"philanthropist","n. One who endeavors to help his fellow men."},
{"philanthropy","n. Active humanitarianism."},
{"philately","n. The study and collection of stamps."},
{"philharmonic","adj. Fond of music."},
{"philogynist","n. One who is fond of women."},
{"philologist","n. An expert in linguistics."},
{"philology","n. The study of language in connection with history and literature."},
{"philosophize","v. To seek ultimate causes and principles."},
{"philosophy","n. The general principles, laws, or causes that furnish the rational explanation of anything."},
{"phlegmatic","adj. Not easily roused to feeling or action."},
{"phonetic","adj. Representing articulate sounds or speech."},
{"phonic","adj. Pertaining to the nature of sound."},
{"phonogram","n. A graphic character symbolizing an articulate sound."},
{"phonology","n. The science of human vocal sounds."},
{"phosphorescence","n. The property of emitting light."},
{"photoelectric","adj. Pertaining to the combined action of light and electricity."},
{"photometer","n. Any instrument for measuring the intensity of light or comparing the intensity of two lights."},
{"photometry","n. The art of measuring the intensity of light."},
{"physicist","n. A specialist in the science that treats of the phenomena associated with matter and energy."},
{"physics","n. The science that treats of the phenomena associated with matter and energy."},
{"physiocracy","n. The doctrine that land and its products are the only true wealth."},
{"physiognomy","n. The external appearance merely."},
{"physiography","n. Description of nature."},
{"physiology","n. The science of organic functions."},
{"physique","n. The physical structure or organization of a person."},
{"picayune","adj. Of small value."},
{"piccolo","n. A small flute."},
{"piece","n. A loose or separated part, as distinguished from the whole or the mass."},
{"piecemeal","adv. Gradually."},
{"pillage","n. Open robbery, as in war."},
{"pillory","n. A wooden framework in which an offender is fastened to boards and is exposed to public scorn."},
{"pincers","n. An instrument having two lever-handles and two jaws working on a pivot."},
{"pinchers","n. An instrument having two jaws working on a pivot."},
{"pinnacle","n. A high or topmost point, as a mountain-peak."},
{"pioneer","n. One among the first to explore a country."},
{"pious","adj. Religious."},
{"pique","v. To excite a slight degree of anger in."},
{"piteous","adj. Compassionate."},
{"pitiable","adj. Contemptible."},
{"pitiful","adj. Wretched."},
{"placate","v. To bring from a state of angry or hostile feeling to one of patience or friendliness."},
{"placid","adj. Serene."},
{"plagiarism","n. The stealing of passages from the writings of another and publishing them as one's own."},
{"planisphere","n. A polar projection of the heavens on a chart."},
{"plasticity","n. The property of some substances through which the form of the mass can readily be changed."},
{"platitude","n. A written or spoken statement that is flat, dull, or commonplace."},
{"plaudit","n. An expression of applause."},
{"plausible","adj. Seeming likely to be true, though open to doubt."},
{"playful","adj. Frolicsome."},
{"playwright","n. A maker of plays for the stage."},
{"plea","n. An argument to obtain some desired action."},
{"pleasant","adj. Agreeable."},
{"pleasurable","adj. Affording gratification."},
{"plebeian","adj. Common."},
{"pledgee","n. The person to whom anything is pledged."},
{"pledgeor","n. One who gives a pledge."},
{"plenary","adj. Entire."},
{"plenipotentiary","n. A person fully empowered to transact any business."},
{"plenitude","n. Abundance."},
{"plenteous","adj. Abundant."},
{"plumb","n. A weight suspended by a line to test the verticality of something."},
{"plummet","n. A piece of lead for making soundings, adjusting walls to the vertical."},
{"pluperfect","adj. Expressing past time or action prior to some other past time or action."},
{"plural","adj. Containing or consisting of more than one."},
{"plurality","n. A majority."},
{"plutocracy","n. A wealthy class in a political community who control the government by means of their money."},
{"pneumatic","adj. Pertaining to or consisting of air or gas."},
{"poesy","n. Poetry."},
{"poetaster","n. An inferior poet."},
{"poetic","adj. Pertaining to poetry."},
{"poetics","n. The rules and principles of poetry."},
{"poignancy","n. Severity or acuteness, especially of pain or grief."},
{"poignant","adj. Severely painful or acute to the spirit."},
{"poise","n. Equilibrium."},
{"polar","adj. Pertaining to the poles of a sphere, especially of the earth."},
{"polemics","n. The art of controversy or disputation."},
{"pollen","n. The fine dust-like grains or powder formed within the anther of a flowering plant."},
{"pollute","v. To contaminate."},
{"polyarchy","n. Government by several or many persons of what- ever class."},
{"polycracy","n. The rule of many."},
{"polygamy","n. the fact or condition of having more than one wife or husband at once."},
{"polyglot","adj. Speaking several tongues."},
{"polygon","n. A figure having many angles."},
{"polyhedron","n. A solid bounded by plane faces, especially by more than four."},
{"polysyllable","adj. Having several syllables, especially more than three syllables."},
{"polytechnic","adj. Pertaining to, embracing, or practicing many arts."},
{"polytheism","n. The doctrine or belief that there are more gods than one."},
{"pommel","v. To beat with something thick or bulky."},
{"pomposity","n. The quality of being marked by an assumed stateliness and impressiveness of manner."},
{"pompous","adj. Marked by an assumed stateliness and impressiveness of manner."},
{"ponder","v. To meditate or reflect upon."},
{"ponderous","adj. Unusually weighty or forcible."},
{"pontiff","n. The Pope."},
{"populace","n. The common people."},
{"populous","adj. Containing many inhabitants, especially in proportion to the territory."},
{"portend","v. To indicate as being about to happen, especially by previous signs."},
{"portent","n. Anything that indicates what is to happen."},
{"portfolio","n. A portable case for holding writing-materials, drawings, etc."},
{"posit","v. To present in an orderly manner."},
{"position","n. The manner in which a thing is placed."},
{"positive","adj. Free from doubt or hesitation."},
{"posse","n. A force of men."},
{"possess","v. To own."},
{"possession","n. The having, holding, or detention of property in one's power or command."},
{"possessive","adj. Pertaining to the having, holding, or detention of property in one's power or command."},
{"possessor","n. One who owns, enjoys, or controls anything, as property."},
{"possible","adj. Being not beyond the reach of power natural, moral, or supernatural."},
{"postdate","v. To make the date of any writing later than the real date."},
{"posterior","n. The hinder part."},
{"postgraduate","adj. Pertaining to studies that are pursued after receiving a degree."},
{"postscript","n. Something added to a letter after the writer's signature."},
{"potency","n. Power."},
{"potent","adj. Physically powerful."},
{"potentate","n. One possessed of great power or sway."},
{"potential","n. Anything that may be possible."},
{"potion","n. A dose of liquid medicine."},
{"powerless","adj. Impotent."},
{"practicable","adj. Feasible."},
{"prate","v. To talk about vainly or foolishly."},
{"prattle","v. To utter in simple or childish talk."},
{"preamble","n. A statement introductory to and explanatory of what follows."},
{"precarious","adj. Perilous."},
{"precaution","n. A provision made in advance for some possible emergency or danger."},
{"precede","v. To happen first."},
{"precedence","n. Priority in place, time, or rank."},
{"precedent","n. An instance that may serve as a guide or basis for a rule."},
{"precedential","adj. Of the nature of an instance that may serve as a guide or basis for a rule."},
{"precession","n. The act of going forward."},
{"precipice","n. A high and very steep or approximately vertical cliff."},
{"precipitant","adj. Moving onward quickly and heedlessly."},
{"precipitate","v. To force forward prematurely."},
{"precise","adj. Exact."},
{"precision","n. Accuracy of limitation, definition, or adjustment."},
{"preclude","v. To prevent."},
{"precocious","adj. Having the mental faculties prematurely developed."},
{"precursor","n. A forerunner or herald."},
{"predatory","adj. Prone to pillaging."},
{"predecessor","n. An incumbent of a given office previous to another."},
{"predicament","n. A difficult, trying situation or plight."},
{"predicate","v. To state as belonging to something."},
{"predict","v. To foretell."},
{"prediction","n. A prophecy."},
{"predominance","n. Ascendancy or preponderance."},
{"predominant","adj. Superior in power, influence, effectiveness, number, or degree."},
{"predominate","v. To be chief in importance, quantity, or degree."},
{"preeminenc"," n. Special eminence."},
{"preempt","v. To secure the right of preference in the purchase of public land."},
{"preemption","n. The right or act of purchasing before others."},
{"preengage","v. To preoccupy."},
{"preestablish","v. To settle or arrange beforehand."},
{"preexist","v. To exist at a period or in a state earlier than something else."},
{"preexistence","n. Existence antecedent to something."},
{"preface","n. A brief explanation or address to the reader, at the beginning of a book."},
{"prefatory","adj. Pertaining to a brief explanation to the reader at the beginning of a book."},
{"prefer","v. To hold in higher estimation."},
{"preferable","adj. More desirable than others."},
{"preference","n. An object of favor or choice."},
{"preferential","adj. Possessing, giving, or constituting preference or priority."},
{"preferment","n. Preference."},
{"prefix","To attach at the beginning."},
{"prehensible","adj. Capable of being grasped."},
{"prehensile","adj. Adapted for grasping or holding."},
{"prehension","n. The act of laying hold of or grasping."},
{"prejudice","n. A judgment or opinion formed without due examination of the facts."},
{"prelacy","n. A system of church government."},
{"prelate","n. One of a higher order of clergy having direct authority over other clergy."},
{"prelude","n. An introductory or opening performance."},
{"premature","adj. Coming too soon."},
{"premier","adj. First in rank or position."},
{"premise","n. A judgment as a conclusion."},
{"premonition","n. Foreboding."},
{"preoccupation","n. The state of having the mind, attention, or inclination preoccupied."},
{"preoccupy","v. To fill the mind of a person to the exclusion of other subjects."},
{"preordain","v. To foreordain."},
{"preparation","n. An act or proceeding designed to bring about some event."},
{"preparatory","adj. Having to do with what is preliminary."},
{"preponderant","adj. Prevalent."},
{"preponderate","v. To exceed in influence or power."},
{"prepossession","n. A preconceived liking."},
{"preposterous","adj. Utterly ridiculous or absurd."},
{"prerogative","adj. Having superior rank or precedence."},
{"presage","v. To foretell."},
{"prescience","n. Knowledge of events before they take place."},
{"prescient","adj. Foreknowing."},
{"prescript","adj. Prescribed as a rule or model."},
{"prescriptible","adj. Derived from authoritative direction."},
{"prescription","n. An authoritative direction."},
{"presentient","adj. Perceiving or feeling beforehand."},
{"presentiment","n. Foreboding."},
{"presentment","n. Semblance."},
{"preservation","n. Conservation."},
{"presumption","n. That which may be logically assumed to be true until disproved."},
{"presumptuous","adj. Assuming too much."},
{"pretension","n. A bold or presumptuous assertion."},
{"pretentious","adj. Marked by pretense, conceit, or display."},
{"preternatural","adj. Extraordinary."},
{"pretext","n. A fictitious reason or motive."},
{"prevalence","n. Frequency."},
{"prevalent","adj. Of wide extent or frequent occurrence."},
{"prevaricate","v. To use ambiguous or evasive language for the purpose of deceiving or diverting attention."},
{"prevention","n. Thwarting."},
{"prickle","v. To puncture slightly with fine, sharp points."},
{"priggish","adj. Conceited."},
{"prim","adj. Stiffly proper."},
{"prima","adj. First."},
{"primer","n. An elementary reading-book for children."},
{"primeval","adj. Belonging to the first ages."},
{"primitive","adj. Pertaining to the beginning or early times."},
{"principal","adj. Most important."},
{"principality","n. The territory of a reigning prince."},
{"principle","n. A general truth or proposition."},
{"priory","n. A monastic house."},
{"pristine","adj. Primitive."},
{"privateer","n. A vessel owned and officered by private persons, but carrying on maritime war."},
{"privilege","n. A right or immunity not enjoyed by all, or that may be enjoyed only under special conditions."},
{"privity","n. Knowledge shared with another or others regarding a private matter."},
{"privy","adj. Participating with another or others in the knowledge of a secret transaction."},
{"probate","adj. Relating to making proof, as of a will."},
{"probation","n. Any proceeding designed to ascertain or test character, qualification, or the like."},
{"probe","v. To search through and through."},
{"probity","n. Virtue or integrity tested and confirmed."},
{"procedure","n. A manner or method of acting."},
{"proceed","v. To renew motion or action, as after rest or interruption."},
{"proclamation","n. Any announcement made in a public manner."},
{"procrastinate","v. To put off till tomorrow or till a future time."},
{"procrastination","n. Delay."},
{"proctor","n. An agent acting for another."},
{"prodigal","n. One wasteful or extravagant, especially in the use of money or property."},
{"prodigious","adj. Immense."},
{"prodigy","n. A person or thing of very remarkable gifts or qualities."},
{"productive","adj. Yielding in abundance."},
{"profession","n. Any calling or occupation involving special mental or other special disciplines."},
{"professor","n. A public teacher of the highest grade in a university or college."},
{"proffer","v. To offer to another for acceptance."},
{"proficiency","n. An advanced state of acquirement, as in some knowledge, art, or science."},
{"proficient","adj. Possessing ample and ready knowledge or of skill in any art, science, or industry."},
{"profile","n. An outline or contour."},
{"profiteer","n. One who profits."},
{"profligacy","n. Shameless viciousness."},
{"profligate","adj. Abandoned to vice."},
{"profuse","adj. Produced or displayed in overabundance."},
{"progeny","n. Offspring."},
{"progression","n. A moving forward or proceeding in course."},
{"prohibition","n. A decree or an order forbidding something."},
{"prohibitionist","n. One who favors the prohibition by law of the manufacture and sale of alcoholic beverages"},
{"prohibitory","adj. Involving or equivalent to prohibition, especially of the sale of alcoholic beverages."},
{"projection","n. A prominence."},
{"proletarian","n. A person of the lowest or poorest class."},
{"prolific","adj. Producing offspring or fruit."},
{"prolix","adj. Verbose."},
{"prologue","n. A prefatory statement or explanation to a poem, discourse, or performance."},
{"prolong","v. To extend in time or duration."},
{"promenade","v. To walk for amusement or exercise."},
{"prominence","n. The quality of being noticeable or distinguished."},
{"prominent","adj. Conspicuous in position, character, or importance."},
{"promiscuous","adj. Brought together without order, distinction, or design (for sex)."},
{"promissory","adj. Expressing an engagement to pay."},
{"promontory","n. A high point of land extending outward from the coastline into the sea."},
{"promoter","n. A furtherer, forwarder, or encourager."},
{"promulgate","v. To proclaim."},
{"propaganda","n. Any institution or systematic scheme for propagating a doctrine or system."},
{"propagate","v. To spread abroad or from person to person."},
{"propel","v. To drive or urge forward."},
{"propellant","adj. Propelling."},
{"propeller","n. One who or that which propels."},
{"prophecy","n. Any prediction or foretelling."},
{"prophesy","v. To predict or foretell, especially under divine inspiration and guidance."},
{"propitious","adj. Kindly disposed."},
{"proportionate","adj. Being in proportion."},
{"propriety","n. Accordance with recognized usage, custom, or principles."},
{"propulsion","n. A driving onward or forward."},
{"prosaic","adj. Unimaginative."},
{"proscenium","n. That part of the stage between the curtain and the orchestra."},
{"proscribe","v. To reject, as a teaching or a practice, with condemnation or denunciation."},
{"proscription","n. Any act of condemnation and rejection from favor and privilege."},
{"proselyte","n. One who has been won over from one religious belief to another."},
{"prosody","n. The science of poetical forms."},
{"prospector","n. One who makes exploration, search, or examination, especially for minerals."},
{"prospectus","n. A paper or pamphlet containing information of a proposed undertaking."},
{"prostrate","adj. Lying prone, or with the head to the ground."},
{"protagonist","n. A leader in any enterprise or contest."},
{"protection","n. Preservation from harm, danger, annoyance, or any other evil."},
{"protective","adj. Sheltering."},
{"protector","n. A defender."},
{"protégé","n. One specially cared for and favored by another usually older person."},
{"Protestant","n. A Christian who denies the authority of the Pope and holds the right of special judgment."},
{"protomartyr","n. The earliest victim in any cause."},
{"protocol","n. A declaration or memorandum of agreement less solemn and formal than a treaty."},
{"protoplasm","n. The substance that forms the principal portion of an animal or vegetable cell."},
{"prototype","n. A work, original in character, afterward imitated in form or spirit."},
{"protract","v. To prolong."},
{"protrude","v. To push out or thrust forth."},
{"protrusion","n. The act of protruding."},
{"protuberance","n. Something that swells out from a surrounding surface."},
{"protuberant","adj. Bulging."},
{"protuberate","v. To swell or bulge beyond the surrounding surface."},
{"proverb","n. A brief, pithy saying, condensing in witty or striking form the wisdom of experience."},
{"provident","adj. Anticipating and making ready for future wants or emergencies."},
{"providential","adj. Effected by divine guidance."},
{"provincial","adj. Uncultured in thought and manner."},
{"proviso","n. A clause in a contract, will, etc., by which its operation is rendered conditional."},
{"provocation","n. An action or mode of conduct that excites resentment."},
{"prowess","n. Strength, skill, and intrepidity in battle."},
{"proximately","adv. Immediately."},
{"proxy","n. A person who is empowered by another to represent him or her in a given matter."},
{"prudence","n. Caution."},
{"prudential","adj. Proceeding or marked by caution."},
{"prudery","n. An undue display of modesty or delicacy."},
{"prurient","adj. Inclined to lascivious thoughts and desires."},
{"pseudapostle","n. A pretended or false apostle."},
{"pseudonym","n. A fictitious name, especially when assumed by a writer."},
{"pseudonymity","n. The state or character of using a fictitious name."},
{"psychiatry","n. The branch of medicine that relates to mental disease."},
{"psychic","adj. Pertaining to the mind or soul."},
{"psychopathic","adj. Morally irresponsible."},
{"psychotherapy","n. The treatment of mental disease."},
{"pudgy","adj. Small and fat."},
{"puerile","adj. Childish."},
{"pugnacious","adj. Quarrelsome."},
{"puissant","adj. Possessing strength."},
{"pulmonary","adj. Pertaining to the lungs."},
{"punctilious","adj. Strictly observant of the rules or forms prescribed by law or custom."},
{"punctual","adj. Observant and exact in points of time."},
{"pungent","adj. Affecting the sense of smell."},
{"pungency","n. The quality of affecting the sense of smell."},
{"punitive","adj. Pertaining to punishment."},
{"pupilage","n. The state or period of being a student."},
{"purgatory","n. An intermediate state where souls are made fit for paradise or heaven by expiatory suffering."},
{"purl","v. To cause to whirl, as in an eddy."},
{"purloin","v. To steal."},
{"purport","n. Intent."},
{"purveyor","n. one who supplies"},
{"pusillanimous","adj. Without spirit or bravery."},
{"putrescent","adj. Undergoing decomposition of animal or vegetable matter accompanied by fetid odors."},
{"pyre","n. A heap of combustibles arranged for burning a dead body."},
{"pyromania","n. An insane propensity to set things on fire."},
{"pyrotechnic","adj. Pertaining to fireworks or their manufacture."},
{"pyx","n. A vessel or casket, usually of precious metal, in which the host is preserved."},
//****************************QQQQQQQQQQQQ
{"quackery","n.Charlatanry"},
{"quadrate","v.To divide into quarters."},
{"quadruple","v.To multiply by four."},
{"qualification","n.A requisite for an employment, position, right, or privilege."},
{"qualify","v.To endow or furnish with requisite ability, character, knowledge, skill, or possessions."},
{"qualm","n.A fit of nausea."},
{"quandary","n.A puzzling predicament."},
{"quantity","n.Magnitude."},
{"quarantine","n.The enforced isolation of any person or place infected with contagious disease."},
{"quarrelsome","adj.Irascible."},
{"quarter","n.One of four equal parts into which anything is or may be divided."},
{"quarterly","adj.Occurring or made at intervals of three months."},
{"quartet","n.A composition for four voices or four instruments."},
{"quarto","n.An eight-page newspaper of any size."},
{"quay","n.A wharf or artificial landing-place on the shore of a harbor or projecting into it."},
{"querulous","adj.Habitually complaining."},
{"query","v.To make inquiry."},
{"queue","n.A file of persons waiting in order of their arrival, as for admittance."},
{"quibble","n.An utterly trivial distinction or objection."},
{"quiescence","n.Quiet."},
{"quiescent","adj.Being in a state of repose or inaction."},
{"quiet","adj.Making no noise."},
{"quietus","n.A silencing, suppressing, or ending."},
{"quintessence","n.The most essential part of anything."},
{"quintet","n.Musical composition arranged for five voices or instruments."},
{"quite","adv.Fully."},
{"quixotic","adj.Chivalrous or romantic to a ridiculous or extravagant degree."},
//****************************RRRRRRRRRRRR
{"rabid","adj.Affected with rabies or hydrophobia."},
{"racy","adj.Exciting or exhilarating to the mind."},
{"radiance","n.Brilliant or sparkling luster."},
{"radiate","v.To extend in all directions, as from a source or focus."},
{"radical","n.One who holds extreme views or advocates extreme measures."},
{"radix","n.That from or on which something is developed."},
{"raillery","n.Good-humored satire."},
{"ramify","v.To divide or subdivide into branches or subdivisions."},
{"ramose","adj.Branch-like."},
{"rampant","adj.Growing,climbing,or running without check or restraint."},
{"rampart","n.A bulwark or construction to oppose assault or hostile entry."},
{"rancor","n.Malice."},
{"rankle","v.To produce irritation or festering."},
{"rapacious","adj.Disposed to seize by violence or by unlawful or greedy methods."},
{"rapid","adj.Having great speed."},
{"rapine","n.The act of seizing and carrying off property by superior force, as in war."},
{"rapt","adj.Enraptured."},
{"raptorial","adj.Seizing and devouring living prey."},
{"ration","v.To provide with a fixed allowance or portion, especially of food."},
{"rationalism","n.The formation of opinions by relying upon reason alone, independently of authority."},
{"raucous","adj.Harsh."},
{"ravage","v.To lay waste by pillage, rapine, devouring, or other destructive methods."},
{"ravenous","adj.Furiously voracious or hungry."},
{"ravine","n.A deep gorge or hollow, especially one worn by a stream or flow of water."},
{"reaction","n.Tendency towards a former, or opposite state of things, as after reform,revolution, or inflation."},
{"reactionary","adj.Pertaining to, of the nature of, causing, or favoring reaction."},
{"readily","adv.Without objection or reluctance."},
{"readjust","v.To put in order after disarrangement."},
{"ready","adj.In a state of preparedness for any given purpose or occasion."},
{"realism","n.The principle and practice of depicting persons and scenes as they are believed really to exist."},
{"rearrange","v.To arrange again or in a different order."},
{"reassure","v.To give new confidence."},
{"rebellious","adj.Insubordinate."},
{"rebuff","n.A peremptory or unexpected rejection of advances or approaches."},
{"rebuild","v.To build again or a new."},
{"rebut","v.To oppose by argument or a sufficient answer."},
{"recant","v.To withdraw formally one's belief (in something previously believed or maintained)."},
{"recapitulate","v.To repeat again the principal points of."},
{"recapture","v.To capture again."},
{"recede","v.To move back or away."},
{"receivable","adj.Capable of being or fit to be received - often money."},
{"receptive","adj.Having the capacity, quality, or ability of receiving, as truths or impressions."},
{"recessive","adj.Having a tendency to go back."},
{"recidivist","n.A confirmed criminal."},
{"reciprocal","adj.Mutually interchangeable or convertible."},
{"reciprocate","v.To give and take mutually."},
{"reciprocity","n.Equal mutual rights and benefits granted and enjoyed."},
{"recitation","n.The act of reciting or repeating, especially in public and from memory."},
{"reck","v.To have a care or thought for."},
{"reckless","adj.Foolishly headless of danger."},
{"reclaim","v.To demand or to obtain the return or restoration of."},
{"recline","v.To cause to assume a leaning or recumbent attitude or position."},
{"recluse","n.One who lives in retirement or seclusion."},
{"reclusory","n.A hermitage."},
{"recognizance","n.An acknowledgment entered into before a court with condition to do some particular act."},
{"recognize","v.To recall the identity of (a person or thing)."},
{"recoil","v.To start back as in dismay, loathing, or dread."},
{"recollect","v.To recall the knowledge of."},
{"reconcilable","adj.Capable of being adjusted or harmonized."},
{"reconnoiter","v.To make a preliminary examination of for military, surveying, or geological purposes."},
{"reconsider","v.To review with care, especially with a view to a reversal of previous action."},
{"reconstruct","v.To rebuild."},
{"recourse","n.Resort to or application for help in exigency or trouble."},
{"recover","v.To regain."},
{"recreant","n.A cowardly or faithless person."},
{"recreate","v.To refresh after labor."},
{"recrudescence","n.The state of becoming raw or sore again."},
{"recrudescent","adj.Becoming raw or sore again."},
{"recruit","v.To enlist men for military or naval service."},
{"rectify","v.To correct."},
{"rectitude","n.The quality of being upright in principles and conduct."},
{"recuperate","v.To recover."},
{"recur","v.To happen again or repeatedly, especially at regular intervals."},
{"recure","v.To cure again."},
{"recurrent","adj.Returning from time to time, especially at regular or stated intervals."},
{"redemption","n.The recovery of what is mortgaged or pledged, by paying the debt."},
{"redolent","adj.Smelling sweet and agreeable."},
{"redolence","n.Smelling sweet and agreeable."},
{"redoubtable","adj.Formidable."},
{"redound","n.Rebound."},
{"redress","v.To set right, as a wrong by compensation or the punishment of the wrong-doer."},
{"reducible","adj.That may be reduced."},
{"redundance","n.Excess."},
{"redundant","adj.Constituting an excess."},
{"reestablish","v.To restore."},
{"refer","v.To direct or send for information or other purpose."},
{"referrer","n.One who refers."},
{"referable","adj.Ascribable."},
{"referee","n.An umpire."},
{"refinery","n.A place where some crude material, as sugar or petroleum, is purified."},
{"reflectible","adj.Capable of being turned back."},
{"reflection","n.The throwing off or back of light, heat, sound, or any form of energy that travels in waves."},
{"reflector","n.A mirror, as of metal, for reflecting light, heat, or sound in a particular direction."},
{"reflexible","adj.Capable of being reflected."},
{"reform","n.Change for the better."},
{"reformer","n.One who carries out a reform."},
{"refract","v.To bend or turn from a direct course."},
{"refractory","adj.Not amenable to control."},
{"refragable","adj.Capable of being refuted."},
{"refringency","n.Power to refract."},
{"refringent","adj.Having the power to refract."},
{"refusal","n.Denial of what is asked."},
{"refute","v.To prove to be wrong."},
{"regale","v.To give unusual pleasure."},
{"regalia","n.The emblems of royalty."},
{"regality","n.Royalty."},
{"regenerate","v.To reproduce."},
{"regent","n.One who is lawfully deputized to administer the government for the time being in the name of the ruler."},
{"regicide","n.The killing of a king or sovereign."},
{"regime","n.Particular conduct or administration of affairs."},
{"regimen","n.A systematized order or course of living with reference to food, clothing and personal habits."},
{"regiment","n.A body of soldiers."},
{"regnant","adj.Exercising royal authority in one's own right."},
{"regress","v.To return to a former place or condition."},
{"regretful","adj.Feeling, expressive of, or full of regret."},
{"rehabilitate","v.To restore to a former status, capacity, right rank, or privilege."},
{"reign","v.To hold and exercise sovereign power."},
{"reimburse","v.To pay back as an equivalent of what has been expended."},
{"rein","n.A step attached to the bit for controlling a horse or other draft-animal."},
{"reinstate","v.To restore to a former state, station, or authority."},
{"reiterate","v.To say or do again and again."},
{"rejoin","v.To reunite after separation."},
{"rejuvenate","v.To restore to youth."},
{"rejuvenescence","n.A renewal of youth."},
{"relapse","v.To suffer a return of a disease after partial recovery."},
{"relegate","v.To send off or consign, as to an obscure position or remote destination."},
{"relent","v.To yield."},
{"relevant","adj.Bearing upon the matter in hand."},
{"reliance","n.Dependence."},
{"reliant","adj.Having confidence."},
{"relinquish","v.To give up using or having."},
{"reliquary","n.A casket, coffer, or repository in which relics are kept."},
{"relish","v.To like the taste or savor of."},
{"reluctance","n.Unwillingness."},
{"reluctant","adj.Unwilling."},
{"remembrance","n.Recollection."},
{"reminiscence","n.The calling to mind of incidents within the range of personal knowledge or experience."},
{"reminiscent","adj.Pertaining to the recollection of matters of personal interest."},
{"remiss","adj.Negligent."},
{"remission","n.Temporary diminution of a disease."},
{"remodel","v.Reconstruct."},
{"remonstrance","n.Reproof."},
{"remonstrant","adj.Having the character of a reproof."},
{"remonstrate","v.To present a verbal or written protest to those who have power to right or prevent a wrong."},
{"remunerate","v.To pay or pay for."},
{"remuneration","n.Compensation."},
{"renaissance","n.The revival of letters, and then of art, which marks the transition from medieval to modern time."},
{"rendezvous","n.A prearranged place of meeting."},
{"rendition","n.Interpretation."},
{"renovate","v.To restore after deterioration, as a building."},
{"renunciation","n.An explicit disclaimer of a right or privilege."},
{"reorganize","v.To change to a more satisfactory form of organization."},
{"reparable","adj.Capable of repair."},
{"reparation","n.The act of making amends, as for an injury, loss, or wrong."},
{"repartee","n.A ready, witty, or apt reply."},
{"repeal","v.To render of no further effect."},
{"repel","v.To force or keep back in a manner, physically or mentally."},
{"repellent","adj.Having power to force back in a manner, physically or mentally."},
{"repentance","n.Sorrow for something done or left undone, with desire to make things right by undoing the wrong."},
{"repertory","n.A place where things are stored or gathered together."},
{"repetition","n.The act of repeating."},
{"repine","v.To indulge in fretfulness and faultfinding."},
{"replenish","v.To fill again, as something that has been emptied."},
{"replete","adj.Full to the uttermost."},
{"replica","n.A duplicate executed by the artist himself, and regarded, equally with the first, as an original."},
{"repository","n.A place in which goods are stored."},
{"reprehend","v.To find fault with."},
{"reprehensible","adj.Censurable."},
{"reprehension","n.Expression of blame."},
{"repress","v.To keep under restraint or control."},
{"repressible","adj.Able to be kept under restraint or control."},
{"reprieve","v.To grant a respite from punishment to."},
{"reprimand","v.To chide or rebuke for a fault."},
{"reprisal","n.Any infliction or act by way of retaliation on an enemy."},
{"reprobate","n.One abandoned to depravity and sin."},
{"reproduce","v.To make a copy of."},
{"reproduction","n.The process by which an animal or plant gives rise to another of its kind."},
{"reproof","n.An expression of disapproval or blame personally addressed to one censured."},
{"repudiate","v.To refuse to have anything to do with."},
{"repugnance","n.Thorough dislike."},
{"repugnant","adj.Offensive to taste and feeling."},
{"repulse","n.The act of beating or driving back, as an attacking or advancing enemy."},
{"repulsive","adj.Grossly offensive."},
{"repute","v.To hold in general opinion."},
{"requiem","n.A solemn mass sung for the repose of the souls of the dead."},
{"requisite","adj.Necessary."},
{"requital","n.Adequate return for good or ill."},
{"requite","v.To repay either good or evil to, as to a person."},
{"rescind","v.To make void, as an act, by the enacting authority or a superior authority."},
{"reseat","v.To place in position of office again."},
{"resemblance","n.Similarity in quality or form."},
{"resent","v.To be indignant at, as an injury or insult."},
{"reservoir","n.A receptacle where a quantity of some material, especially of a liquid or gas, may be kept."},
{"residue","n.A remainder or surplus after a part has been separated or otherwise treated."},
{"resilience","n.The power of springing back to a former position."},
{"resilient","adj.Having the quality of springing back to a former position."},
{"resistance","n.The exertion of opposite effort or effect."},
{"resistant","adj.Offering or tending to produce resistance."},
{"resistive","adj.Having or exercising the power of resistance."},
{"resistless","adj.Powerless."},
{"resonance","n.The quality of being able to reinforce sound by sympathetic vibrations."},
{"resonance","adj.Able to reinforce sound by sympathetic vibrations."},
{"resonate","v.To have or produce resonance."},
{"resource","n.That which is restored to, relied upon, or made available for aid or support."},
{"respite","n.Interval of rest."},
{"resplendent","adj.Very bright."},
{"respondent","adj.Answering."},
{"restitution","n.Restoration of anything to the one to whom it properly belongs."},
{"resumption","n.The act of taking back, or taking again."},
{"resurgent","adj.Surging back or again."},
{"resurrection","n.A return from death to life."},
{"resuscitate","v.To restore from apparent death."},
{"retaliate","v.To repay evil with a similar evil."},
{"retch","v.To make an effort to vomit."},
{"retention","n.The keeping of a thing within one's power or possession."},
{"reticence","n.The quality of habitually keeping silent or being reserved in utterance."},
{"reticent","adj.Habitually keeping silent or being reserved in utterance."},
{"retinue","n.The body of persons who attend a person of importance in travel or public appearance."},
{"retort","n.A retaliatory speech."},
{"retouch","v.To modify the details of."},
{"retrace","v.To follow backward or toward the place of beginning, as a track or marking."},
{"retract","v.To recall or take back (something that one has said)."},
{"retrench","v.To cut down or reduce in extent or quantity."},
{"retrieve","v.To recover something by searching."},
{"retroactive","adj.Operative on, affecting, or having reference to past events, transactions, responsibilities."},
{"retrograde","v.To cause to deteriorate or to move backward."},
{"retrogression","n.A going or moving backward or in a reverse direction."},
{"retrospect","n.A view or contemplation of something past."},
{"retrospective","adj.Looking back on the past."},
{"reunite","v.To unite or join again, as after separation."},
{"revelation","n.A disclosing, discovering, or making known of what was before secret,private, or unknown."},
{"revere","v.To regard with worshipful veneration."},
{"reverent","adj.Humble."},
{"reversion","n.A return to or toward some former state or condition."},
{"revert","v.To return, or turn or look back, as toward a former position or the like."},
{"revile","v.To heap approach or abuse upon."},
{"revisal","n.Revision."},
{"revise","v.To examine for the correction of errors, or for the purpose of making changes."},
{"revocation","n.Repeal."},
{"revoke","v.To rescind."},
{"rhapsody","n.Rapt or rapturous utterance."},
{"rhetoric","n.The art of discourse."},
{"rhetorician","n.A showy writer or speaker."},
{"ribald","adj.Indulging in or manifesting coarse indecency or obscenity."},
{"riddance","n.The act or ridding or delivering from something undesirable."},
{"ridicule","n.Looks or acts expressing amused contempt."},
{"ridiculous","adj.Laughable and contemptible."},
{"rife","adj.Abundant."},
{"righteousness","n.Rectitude."},
{"rightful","adj.Conformed to a just claim according to established laws or usage."},
{"rigmarole","n.Nonsense."},
{"rigor","n.Inflexibility."},
{"rigorous","adj.Uncompromising."},
{"ripplet","n.A small ripple, as of water."},
{"risible","adj.capable of exciting laughter."},
{"rivulet","n.A small stream or brook."},
{"robust","adj.Characterized by great strength or power of endurance."},
{"rondo","n.A musical composition during which the first part or subject is repeated several times."},
{"rookery","n.A place where crows congregate to breed."},
{"rotary","adj.Turning around its axis, like a wheel, or so constructed as to turn thus."},
{"rotate","v.To cause to turn on or as on its axis, as a wheel."},
{"rote","n.Repetition of words or sounds as a means of learning them, with slight attention."},
{"rotund","adj.Round from fullness or plumpness."},
{"rudimentary","adj.Being in an initial, early, or incomplete stage of development."},
{"rue","v.To regret extremely."},
{"ruffian","adj.A lawless or recklessly brutal fellow."},
{"ruminant","adj.Chewing the cud."},
{"ruminate","v.To chew over again, as food previously swallowed and regurgitated."},
{"rupture","v.To separate the parts of by violence."},
{"rustic","adj.Characteristic of dwelling in the country."},
{"ruth","n.Sorrow for another's misery"},
//****************************SSSSSSSSSSSSS
{"sacrifice","v.To make an offering of to deity, especially by presenting on an altar."},
{"sacrificial","adj.Offering or offered as an atonement for sin."},
{"sacrilege","n.The act of violating or profaning anything sacred."},
{"sacrilegious","adj.Impious."},
{"safeguard","v.To protect."},
{"sagacious","adj.Able to discern and distinguish with wise perception."},
{"salacious","adj.Having strong sexual desires."},
{"salience","n.The condition of standing out distinctly."},
{"salient","adj.Standing out prominently."},
{"saline","adj.Constituting or consisting of salt."},
{"salutary","adj.Beneficial."},
{"salutation","n.Any form of greeting, hailing, or welcome, whether by word or act."},
{"salutatory","n.The opening oration at the commencement in American colleges."},
{"salvage","n.Any act of saving property."},
{"salvo","n.A salute given by firing all the guns, as at the funeral of an officer."},
{"sanctimonious","adj.Making an ostentatious display or hypocritical pretense of holiness or piety."},
{"sanction","v.To approve authoritatively."},
{"sanctity","n.Holiness."},
{"sanguinary","adj.Bloody."},
{"sanguine","adj.Having the color of blood."},
{"sanguineous","adj.Consisting of blood."},
{"sapid","adj.Affecting the sense of taste."},
{"sapience","n.Deep wisdom or knowledge."},
{"sapient","adj.Possessing wisdom."},
{"sapiential","adj.Possessing wisdom."},
{"saponaceous","adj.Having the nature or quality of soap."},
{"sarcasm","n.Cutting and reproachful language."},
{"sarcophagus","n.A stone coffin or a chest-like tomb."},
{"sardonic","adj.Scornfully or bitterly sarcastic."},
{"satiate","v.To satisfy fully the appetite or desire of."},
{"satire","n.The employment of sarcasm, irony, or keenness of wit in ridiculing vices."},
{"satiric","adj.Resembling poetry, in which vice, incapacity ,or corruption is held up to ridicule."},
{"satirize","v.To treat with sarcasm or derisive wit."},
{"satyr","n.A very lascivious person."},
{"savage","n.A wild and uncivilized human being."},
{"savor","v.To perceive by taste or smell."},
{"scabbard","n.The sheath of a sword or similar bladed weapon."},
{"scarcity","n.Insufficiency of supply for needs or ordinary demands."},
{"scholarly","adj.Characteristic of an erudite person."},
{"scholastic","adj.Pertaining to education or schools."},
{"scintilla","n.The faintest ray."},
{"scintillate","v.To emit or send forth sparks or little flashes of light."},
{"scope","n.A range of action or view."},
{"scoundrel","n.A man without principle."},
{"scribble","n.Hasty, careless writing."},
{"scribe","n.One who writes or is skilled in writing."},
{"script","n.Writing or handwriting of the ordinary cursive form."},
{"scriptural","adj.Pertaining to, contained in, or warranted by the Holy Scriptures."},
{"scruple","n.Doubt or uncertainty regarding a question of moral right or duty."},
{"scrupulous","adj.Cautious in action for fear of doing wrong."},
{"scurrilous","adj.Grossly indecent or vulgar."},
{"scuttle","v.To sink (a ship) by making holes in the bottom."},
{"scythe","n.A long curved blade for mowing, reaping, etc."},
{"séance","n.A meeting of spirituals for consulting spirits."},
{"sear","v.To burn on the surface."},
{"sebaceous","adj.Pertaining to or appearing like fat."},
{"secant","adj.Cutting, especially into two parts."},
{"secede","v.To withdraw from union or association, especially from a political or religious body."},
{"secession","n.Voluntary withdrawal from fellowship, especially from political or religious bodies."},
{"seclude","v.To place, keep, or withdraw from the companionship of others."},
{"seclusion","n.Solitude."},
{"secondary","adj.Less important or effective than that which is primary."},
{"secondly","adv.In the second place in order or succession."},
{"second-rate","adj.Second in quality, size, rank, importance, etc."},
{"secrecy","n.Concealment."},
{"secretary","n.One who attends to correspondence, keeps records. or does other writing for others."},
{"secretive","adj.Having a tendency to conceal."},
{"sedate","adj.Even-tempered."},
{"sedentary","adj. Involving or requiring much sitting."},
{"sediment","n.Matter that settles to the bottom of a liquid."},
{"sedition","n.Conduct directed against public order and the tranquility of the state."},
{"seditious","adj.Promotive of conduct directed against public order and the tranquility of the state."},
{"seduce","v.To entice to surrender chastity."},
{"sedulous","adj.Persevering in effort or endeavor."},
{"seer","n.A prophet."},
{"seethe","v.To be violently excited or agitated."},
{"seignior","n.A title of honor or respectful address, equivalent to sir."},
{"seismograph","n.An instrument for recording the phenomena of earthquakes."},
{"seize","v.To catch or take hold of suddenly and forcibly."},
{"selective","adj.Having the power of choice."},
{"self-respect","n.Rational self-esteem."},
{"semblance","n.Outward appearance."},
{"semicivilized","adj.Half-civilized."},
{"semiconscious","adj.Partially conscious."},
{"semiannual","adj.Recurring at intervals of six months."},
{"semicircle","n.A half-circle."},
{"seminar","n.Any assemblage of pupils for real research in some specific study under a teacher."},
{"seminary","n.A special school, as of theology or pedagogics."},
{"senile adj.","Peculiar to or proceeding from the weakness or infirmity of old age."},
{"sensation","n.A condition of mind resulting from spiritual or inherent feeling."},
{"sense","n.The signification conveyed by some word, phrase, or action."},
{"sensibility","n.Power to perceive or feel."},
{"sensitive","adj.Easily affected by outside operations or influences."},
{"sensorium","n.The sensory apparatus."},
{"sensual","adj.Pertaining to the body or the physical senses."},
{"sensuous","adj.Having a warm appreciation of the beautiful or of the refinements of luxury."},
{"sentence","n.A related group of words containing a subject and a predicate and expressing a complete thought."},
{"sentience","n.Capacity for sensation or sense-perception."},
{"sentient","adj.Possessing the power of sense or sense-perception."},
{"sentinel","n.Any guard or watch stationed for protection."},
{"separable","adj.Capable of being disjoined or divided."},
{"separate","v.To take apart."},
{"separatist","n.A seceder."},
{"septennial","adj.Recurring every seven years."},
{"sepulcher","n.A burial-place."},
{"sequacious","adj.Ready to be led."},
{"sequel","n.That which follows in consequence of what has previously happened."},
{"sequence","n.The order in which a number or persons, things, or events follow one another in space or time."},
{"sequent","adj.Following in the order of time."},
{"sequester","v.To cause to withdraw or retire, as from society or public life."},
{"sequestrate","v.To confiscate."},
{"sergeant","n.A non-commissioned military officer ranking next above a corporal."},
{"sergeant-at-arms","n.An executive officer in legislative bodies who enforces the orders of the presiding officer."},
{"sergeant-major","n.The highest non-commissioned officer in a regiment."},
{"service","n.Any work done for the benefit of another."},
{"serviceable","adj.Durable."},
{"servitude","n.Slavery"},
{"severance","n.Separation."},
{"severely","adv.Extremely."},
{"sextet","n.A band of six singers or players."},
{"sextuple","adj.Multiplied by six."},
{"sheer","adj.Absolute."},
{"shiftless","adj.Wanting in resource, energy, or executive ability."},
{"shrewd","adj.Characterized by skill at understanding and profiting by circumstances."},
{"shriek","n.A sharp, shrill outcry or scream, caused by agony or terror."},
{"shrinkage","n.A contraction of any material into less bulk or dimension."},
{"shrivel","v.To draw or be drawn into wrinkles."},
{"shuffle","n.A mixing or changing the order of things."},
{"sibilance","n.A hissing sound."},
{"sibilant","adj.Made with a hissing sound."},
{"sibilate","v.To give a hissing sound to, as in pronouncing the letters."},
{"sidelong","adj.Inclining or tending to one side."},
{"sidereal","adj.Pertaining to stars or constellations."},
{"siege","n.A beleaguerment."},
{"significance","n.Importance."},
{"significant","adj.Important, especially as pointing something out."},
{"signification","n.The meaning conveyed by language, actions, or signs."},
{"similar","adj.Bearing resemblance to one another or to something else."},
{"simile","n.A comparison which directs the mind to the representative object itself."},
{"similitude","n.Similarity."},
{"simplify","v.To make less complex or difficult."},
{"simulate","v.Imitate."},
{"simultaneous","adj.Occurring, done, or existing at the same time."},
{"sinecure","n.Any position having emoluments with few or no duties."},
{"singe","v.To burn slightly or superficially."},
{"sinister","adj.Evil."},
{"sinuosity","n.The quality of curving in and out."},
{"sinuous","adj.Curving in and out."},
{"sinus","n.An opening or cavity."},
{"siren","n.A sea-nymph, described by Homer as dwelling between the island of Circe and Scylla."},
{"sirocco","n.hot winds from Africa."},
{"sisterhood","n.A body of sisters united by some bond of sympathy or by a religious vow."},
{"skeptic","n.One who doubts any statements."},
{"skepticism","n.The entertainment of doubt concerning something."},
{"skiff","n.Usually, a small light boat propelled by oars."},
{"skirmish","n.Desultory fighting between advanced detachments of two armies."},
{"sleight","n.A trick or feat so deftly done that the manner of performance escapes observation."},
{"slight","adj.Of a small importance or significance."},
{"slothful","adj.Lazy."},
{"sluggard","n.A person habitually lazy or idle."},
{"sociable","adj.Inclined to seek company."},
{"socialism","n.A theory of civil polity that aims to secure the reconstruction of society."},
{"socialist","adj.One who advocates reconstruction of society by collective ownership of land and capital."},
{"sociology","n.The philosophical study of society."},
{"solace","n.Comfort in grief, trouble, or calamity."},
{"solar","adj.Pertaining to the sun."},
{"solder","n.A fusible alloy used for joining metallic surfaces or margins."},
{"soldier","n.A person engaged in military service."},
{"solecism","n.Any violation of established rules or customs."},
{"solicitor","n.One who represents a client in court of justice; an attorney."},
{"solicitude","n.Uneasiness of mind occasioned by desire, anxiety, or fear."},
{"soliloquy","n.A monologue."},
{"solstice","n.The time of year when the sun is at its greatest declination."},
{"soluble","adj.Capable of being dissolved, as in a fluid."},
{"solvent","adj.Having sufficient funds to pay all debts."},
{"somber","adj.Gloomy."},
{"somniferous","adj.Tending to produce sleep."},
{"somnolence","n.Oppressive drowsiness."},
{"somnolent","adj.Sleepy."},
{"sonata","n.An instrumental composition."},
{"sonnet","n.A poem of fourteen decasyllabic or octosyllabiclines expressing two successive phrases."},
{"sonorous","adj.Resonant."},
{"soothsayer n. One who claims to have supernatural insight or foresight."},
{"sophism","n.A false argument understood to be such by the reasoner himself and intentionally used to deceive."},
{"sophistical","adj.Fallacious."},
{"sophisticate","v.To deprive of simplicity of mind or manner."},
{"sophistry","n.Reasoning sound in appearance only, especially when designedly deceptive."},
{"soprano","n.A woman's or boy's voice of high range."},
{"sorcery","n.Witchcraft."},
{"sordid","adj.Of degraded character or nature."},
{"souvenir","n.A token of remembrance."},
{"sparse","adj.Thinly diffused."},
{"Spartan","adj.Exceptionally brave; rigorously severe."},
{"spasmodic","adj.Convulsive."},
{"specialize","v.To assume an individual or specific character, or adopt a singular or special course."},
{"specialty","n.An employment limited to one particular line of work."},
{"specie","n.A coin or coins of gold, silver, copper, or other metal."},
{"species","n.A classificatory group of animals or plants subordinate to a genus."},
{"specimen","n.One of a class of persons or things regarded as representative of the class."},
{"specious","adj.Plausible."},
{"spectator","n.One who beholds or looks on."},
{"specter","n.Apparition."},
{"spectrum","n.An image formed by rays of light or other radiant energy."},
{"speculate","v.To pursue inquiries and form conjectures."},
{"speculator","n.One who makes an investment that involves a risk of loss, but also a chance of profit."},
{"sphericity","n.The state or condition of being a sphere."},
{"spheroid","n.A body having nearly the form of a sphere."},
{"spherometer","n.An instrument for measuring curvature or radii of spherical surfaces."},
{"spinous","adj.Having spines."},
{"spinster","n.A woman who has never been married."},
{"spontaneous","adj.Arising from inherent qualities or tendencies without external efficient cause."},
{"sprightly","adj.Vivacious."},
{"spurious","adj.Not genuine."},
{"squabble","v.To quarrel."},
{"squalid","adj.Having a dirty, mean, poverty-stricken appearance."},
{"squatter","n.One who settles on land without permission or right."},
{"stagnant","adj.Not flowing: said of water, as in a pool."},
{"stagnate","v.To become dull or inert."},
{"stagnation","n.The condition of not flowing or not changing."},
{"stagy","adj.Having a theatrical manner."},
{"staid","adj.Of a steady and sober character."},
{"stallion","n.An uncastrated male horse, commonly one kept for breeding."},
{"stanchion","n.A vertical bar, or a pair of bars, used to confine cattle in a stall."},
{"stanza","n.A group of rimed lines, usually forming one of a series of similar divisions in a poem."},
{"statecraft","n.The art of conducting state affairs."},
{"static","adj.Pertaining to or designating bodies at rest or forces in equilibrium."},
{"statics","n.The branch of mechanics that treats of the relations that subsist among forces in order."},
{"stationary","adj.Not moving."},
{"statistician","n.One who is skilled in collecting and tabulating numerical facts."},
{"statuesque","adj.Having the grace, pose, or quietude of a statue."},
{"statuette","n.A figurine."},
{"stature","n.The natural height of an animal body."},
{"statute","n.Any authoritatively declared rule, ordinance, decree, or law."},
{"stealth","n.A concealed manner of acting."},
{"stellar","adj.Pertaining to the stars."},
{"steppe","n.One of the extensive plains in Russia and Siberia."},
{"sterling","adj.Genuine."},
{"stifle","v.To smother."},
{"stigma","n.A mark of infamy or token of disgrace attaching to a person as the result of evildoing."},
{"stiletto","n.A small dagger."},
{"stimulant n. Anything that rouses to activity or to quickened action."},
{"stimulate","v.To rouse to activity or to quickened action."},
{"stimulus","n.Incentive."},
{"stingy","adj.Cheap, unwilling to spend money."},
{"stipend","n.A definite amount paid at stated periods in compensation for services or as an allowance."},
{"stoicism","n.The principles or the practice of the Stoics-being very even tempered in success and failure."},
{"stolid","adj.Expressing no power of feeling or perceiving."},
{"strait","n.A narrow passage of water connecting two larger bodies of water."},
{"stratagem","n.Any clever trick or device for obtaining an advantage."},
{"stratum","n.A natural or artificial layer, bed, or thickness of any substance or material."},
{"streamlet","n.Rivulet."},
{"stringency","n.Strictness."},
{"stringent","adj.Rigid."},
{"stripling","n.A mere youth."},
{"studious","adj.Having or showing devotion to the acquisition of knowledge."},
{"stultify","v.To give an appearance of foolishness to."},
{"stupendous","adj.Of prodigious size, bulk, or degree."},
{"stupor","n.Profound lethargy."},
{"suasion","n.The act of persuading."},
{"suave","adj.Smooth and pleasant in manner."},
{"subacid","adj.Somewhat sharp or biting."},
{"subaquatic","adj.Being, formed, or operating under water."},
{"subconscious","adj.Being or occurring in the mind, but without attendant consciousness or conscious perception."},
{"subjacent","adj.Situated directly underneath."},
{"subjection","n.The act of bringing into a state of submission."},
{"subjugate","v.To conquer."},
{"subliminal","adj.Being beneath the threshold of consciousness."},
{"sublingual","adj.Situated beneath the tongue."},
{"submarine","adj.Existing, done, or operating beneath the surface of the sea."},
{"submerge","v.To place or plunge under water."},
{"submergence","n.The act of submerging."},
{"submersible","adj.Capable of being put underwater."},
{"submersion","n.The act of submerging."},
{"submission","n.A yielding to the power or authority of another."},
{"submittal","n.The act of submitting."},
{"subordinate","adj.Belonging to an inferior order in a classification."},
{"subsequent","adj.Following in time."},
{"subservience","n.The quality, character, or condition of being servilely following another's behests."},
{"subservient","adj.Servilely following another's behests."},
{"subside","v.To relapse into a state of repose and tranquility."},
{"subsist","v.To be maintained or sustained."},
{"subsistence","n.Sustenance."},
{"substantive","adj.Solid."},
{"subtend","v.To extend opposite to."},
{"subterfuge","n.Evasion."},
{"subterranean","adj.Situated or occurring below the surface of the earth."},
{"subtle","adj.Discriminating."},
{"subtrahend","n.That which is to be subtracted."},
{"subversion","n.An overthrow, as from the foundation."},
{"subvert","v.To bring to ruin."},
{"succeed","v.To accomplish what is attempted or intended."},
{"success","n.A favorable or prosperous course or termination of anything attempted."},
{"successful","adj.Having reached a high degree of worldly prosperity."},
{"successor","n.One who or that which takes the place of a predecessor or preceding thing."},
{"succinct","adj.Concise."},
{"succulent","adj.Juicy."},
{"succumb","v.To cease to resist."},
{"sufferance","n.Toleration."},
{"sufficiency","n.An ample or adequate supply."},
{"suffrage","n.The right or privilege of voting."},
{"suffuse","v.To cover or fill the surface of."},
{"suggestible","adj.That can be suggested."},
{"suggestive","adj.Stimulating to thought or reflection."},
{"summary","n.An abstract."},
{"sumptuous","adj.Rich and costly."},
{"superabundance","n.An excessive amount."},
{"superadd","v.To add in addition to what has been added."},
{"superannuate","v.To become deteriorated or incapacitated by long service."},
{"superb","adj.Sumptuously elegant."},
{"supercilious","adj.Exhibiting haughty and careless contempt."},
{"superficial","adj.Knowing and understanding only the ordinary and the obvious."},
{"superfluity","n.That part of anything that is in excess of what is needed."},
{"superfluous","adj.Being more than is needed."},
{"superheat","v.To heat to excess."},
{"superintend","v.To have the charge and direction of, especially of some work or movement."},
{"superintendence","n.Direction and management."},
{"superintendent","n.One who has the charge and direction of, especially of some work or movement."},
{"superlative","n.That which is of the highest possible excellence or eminence."},
{"supernatural","adj.Caused miraculously or by the immediate exercise of divine power."},
{"supernumerary","adj.Superfluous."},
{"supersede","v.To displace."},
{"supine","adj.Lying on the back."},
{"supplant","v.To take the place of."},
{"supple","adj.Easily bent."},
{"supplementary","adj.Being an addition to."},
{"supplicant","n.One who asks humbly and earnestly."},
{"supplicate","v.To beg."},
{"supposition","n.Conjecture."},
{"suppress","v.To prevent from being disclosed or punished."},
{"suppressible","adj.Capable of being suppressed."},
{"suppression","n.A forcible putting or keeping down."},
{"supramundane","adj.Supernatural."},
{"surcharge","n.An additional amount charged."},
{"surety","n.Security for payment or performance."},
{"surfeit","v.To feed to fullness or to satiety."},
{"surmise","v.To conjecture."},
{"surmount","v.To overcome by force of will."},
{"surreptitious","adj.Clandestine."},
{"surrogate","n.One who or that which is substituted for or appointed to act in place of another."},
{"surround","v.To encircle."},
{"surveyor","n.A land-measurer."},
{"susceptibility","n.A specific capability of feeling or emotion."},
{"susceptible","adj.Easily under a specified power or influence."},
{"suspense","n.Uncertainty."},
{"suspension","n.A hanging from a support."},
{"suspicious","adj.Inclined to doubt or mistrust."},
{"sustenance","n.Food."},
{"swarthy","adj.Having a dark hue, especially a dark or sunburned complexion."},
{"sybarite","n.A luxurious person."},
{"sycophant","n.A servile flatterer, especially of those in authority or influence."},
{"syllabic","adj.Consisting of that which is uttered in a single vocal impulse."},
{"syllabication","n.Division of words into that which is uttered in a single vocal impulse."},
{"syllable","n.That which is uttered in a single vocal impulse."},
{"syllabus","n.Outline of a subject, course, lecture, or treatise."},
{"sylph","n.A slender, graceful young woman or girl."},
{"symmetrical","adj.Well-balanced."},
{"symmetry","n.Relative proportion and harmony."},
{"sympathetic","adj.Having a fellow-feeling for or like feelings with another or others."},
{"sympathize","v.To share the sentiments or mental states of another."},
{"symphonic adj. Characterized by a harmonious or agreeable mingling of sounds."},
{"symphonious","adj.Marked by a harmonious or agreeable mingling of sounds."},
{"symphony","n.A harmonious or agreeable mingling of sounds."},
{"synchronism","n.Simultaneousness."},
{"syndicate","n.An association of individuals united for the prosecution of some enterprise."},
{"syneresis","n.The coalescence of two vowels or syllables, as e'er for ever."},
{"synod","n.An ecclesiastical council."},
{"synonym","n.A word having the same or almost the same meaning as some other."},
{"synopsis","n.A syllabus or summary."},
{"systematic","adj.Methodical."},
//****************************TTTTTTTTTTTTT
{"tableau","n.An arrangement of inanimate figures representing a scene from real life."},
{"tacit","adj.Understood."},
{"taciturn","adj.Disinclined to conversation."},
{"tack","n.A small sharp-pointed nail."},
{"tact","n.Fine or ready mental discernment shown in saying or doing the proper thing."},
{"tactician","n.One who directs affairs with skill and shrewdness."},
{"tangency","n.The state of touching."},
{"tangent","adj.Touching."},
{"tangible","adj.Perceptible by touch."},
{"tannery","n. A place where leather is tanned."},
{"tantalize","v.To tease."},
{"tantamount","adj. Having equal or equivalent value, effect, or import."},
{"tapestry","n. A fabric to which a pattern is applied with a needle, designed for ornamental hangings."},
{"tarnish","v.To lessen or destroy the luster of in any way."},
{"taut","adj. Stretched tight."},
{"taxation","n. A levy, by government, of a fixed contribution."},
{"taxidermy","n.The art or process of preserving dead animals or parts of them."},
{"technic","adj.Technical."},
{"technicality","n.Something peculiar to a particular art, trade, or the like."},
{"technique","n. Manner of performance."},
{"technography","n.The scientific description or study of human arts and industries in their historic development."},
{"technology","n.The knowledge relating to industries and manufactures."},
{"teem","v. To be full to overflowing."},
{"telepathy"," n.The art or process of communicating by telephone."},
{"telescope", "v.To drive together so that one slides into the another like the sections of a spyglass."},
{"telltale","adj.That gives warning or information."},
{"temerity","n.Recklessness."},
{"temporal","adj. Pertaining to or concerned with the affairs of the present life."},
{"temporary","adj.Lasting for a short time only."},
{"temporize","v.To pursue a policy of delay."},
{"tempt","v.To offer to (somebody) an inducement to do wrong."},
{"tempter","n. An allurer or enticer to evil."},
{"tenacious","adj.Unyielding."},
{"tenant","n. An occupant."},
{"tendency","n. Direction or inclination, as toward some objector end."},
{"tenet","n. Any opinion, principle, dogma, or doctrine that a person believes or maintains as true."},
{"tenor","n. A settled course or manner of progress."},
{"tense"," adj. Strained to stiffness."},
{"tentative","adj. Done as an experiment."},
{"tenure","n.The term during which a thing is held."},
{"tercentenary","adj. Pertaining to a period of 300 years."},
{"termagant", "adj.Violently abusive and quarrelsome."},
{"terminal","adj. Pertaining to or creative of a boundary, limit."},
{"terminate","v.To put an end or stop to."},
{"termination","n.The act of ending or concluding."},
{"terminus","n.The final point or goal."},
{"terrify","v. To fill with extreme fear."},
{"territorial","adj.Pertaining to the domain over which a sovereign state exercises jurisdiction."},
{"terse","adj. Pithy."},
{"testament"," n. A will."},
{"testator"," n.The maker of a will."},
{"testimonial","n. A formal token of regard, often presented in public."},
{"thearchy","n.Government by a supreme deity."},
{"theism","n.Belief in God."},
{"theocracy","n. A government administered by ecclesiastics."},
{"theocracy"," n.The mixed worship of polytheism."},
{"theologian","n. A professor of divinity."},
{"theological","adj. Based on or growing out of divine revelation."},
{"theology"," n.The branch of theological science that treats of God."},
{"theoretical","adj. Directed toward knowledge for its own sake without respect to applications."},
{"theorist","n. One given to speculating."},
{"theorize","v.To speculate."},
{"thereabout"," adv.Near that number, quantity, degree, place, or time, approximately."},
{"therefor","adv. For that or this."},
{"thermal","adj.Of or pertaining to heat."},
{"thermoelectric","adj. Denoting electricity produced by heat."},
{"thermoelectricity","n. Electricity generated by differences of temperature."},
{"thesis","n.An essay or treatise on a particular subject."},
{"thoroughbred","adj.Bred from the best or purest blood or stock."},
{"thoroughfare","n.A public street or road."},
{"thrall","n.One controlled by an appetite or a passion."},
{"tilth","n.Cultivation."},
{"timbre","n.The quality of a tone, as distinguished from intensity and pitch."},
{"timorous","adj.Lacking courage."},
{"tincture","n.A solution, usually alcoholic, of some principle used in medicine."},
{"tinge","n. A faint trace of color."},
{"tipsy","adj. Befuddled with drinks."},
{"tireless","adj.Untiring."},
{"tiresome","adj. Wearisome."},
{"Titanic","adj.Of vast size or strength."},
{"toilsome","adj.Laborious."},
{"tolerable","adj.Moderately good."},
{"tolerance"," n. Forbearance in judging of the acts or opinions of others."},
{"tolerant","adj. Indulgent."},
{"tolerate","v. To passively permit or put up with."},
{"toleration","n.A spirit of charitable leniency."},
{"topography","n.The art of representing on a map the physical features of any locality."},
{"torpor","n.Apathy."},
{"torrid","adj. Excessively hot."},
{"tortious","adj.Wrongful."},
{"torturous","adj.Marked by extreme suffering."},
{"tractable","adj. Easily led or controlled."},
{"trait","n. A distinguishing feature or quality."},
{"trajectory","n.The path described by a projectile moving under given forces."},
{"trammel","n. An impediment."},
{"tranquilize","v.To soothe."},
{"tranquility","n.Calmness."},
{"transalpine","adj.Situated on the other side of the Alps."},
{"transact"," v.To do business."},
{"transatlantic","adj.Situated beyond or on the other side of the Atlantic."},
{"transcend","v.To surpass."},
{"transcendent","adj. Surpassing."},
{"transcontinental","adj. Extending or passing across a continent."},
{"transcribe","v.To write over again (something already written)."},
{"transcript","n. A copy made directly from an original."},
{"transfer","v.To convey, remove, or cause to pass from one person or place to another."},
{"transferable","adj.Capable of being conveyed from one person or place to another."},
{"transference"," n.The act of conveying from one person or place to another."},
{"transferrer","n.One who or that which conveys from one person or place to another."},
{"transfigure","v.To give an exalted meaning or glorified appearance to."},
{"transfuse","v.To pour or cause to pass, as a fluid, from one vessel to another."},
{"transfusible","adj.Capable of being poured from one vessel to another."},
{"transfusion","n.The act of pouring from one vessel to another."},
{"transgress","v.To break a law."},
{"transience","n. Something that is of short duration."},
{"transient","n.One who or that which is only of temporary existence."},
{"transition","n.Passage from one place, condition, or action to another."},
{"transitory","adj. Existing for a short time only."},
{"translate","v. To give the sense or equivalent of in another language or dialect."},
{"translator","n. An interpreter."},
{"translucence","n.The property or state of allowing the passage of light."},
{"translucent","adj. Allowing the passage of light."},
{"transmissible","adj.That may e sent through or across."},
{"transmission","n.The act of sending through or across."},
{"transmit","v.To send trough or across."},
{"transmute","v.To change in nature, substance, or form."},
{"transparent","adj. Easy to see through or understand."},
{"transpire","v.To come to pass."},
{"transplant","v.To remove and plant in another place."},
{"transposition","n.The act of reversing the order or changing the place of."},
{"transverse","adj. Lying or being across or in a crosswise direction."},
{"travail","n.Hard or agonizing labor."},
{"travesty","n. A grotesque imitation."},
{"treacherous","adj. Perfidious."},
{"treachery","n.Violation of allegiance, confidence, or plighted faith."},
{"treasonable","adj. Of the nature of betrayal, treachery, or breech of allegiance."},
{"treatise","n. An elaborate literary composition presenting a subject in all its parts."},
{"treble","adj. Multiplied by three."},
{"trebly","adv.Triply."},
{"tremendous","adj. Awe-inspiring."},
{"tremor","n. An involuntary trembling or shivering."},
{"tremulous","adj.Characterized by quivering or unsteadiness."},
{"trenchant","adj. Cutting deeply and quickly."},
{"trepidation","n. Nervous uncertainty of feeling."},
{"trestle","n. An open braced framework for supporting the horizontal stringers of a railwaybridge."},
{"triad","n. A group of three persons of things."},
{"tribune","n. Any champion of the rights and liberties of the people: often used as the name for a newspaper."},
{"trickery","n.Artifice."},
{"tricolor","adj. Of three colors."},
{"tricycle","n.A three-wheeled vehicle."},
{"trident","n. The three-pronged fork that was the emblem of Neptune."},
{"triennial","adj.Taking place every third year."},
{"trimness","n. Neatness."},
{"trinity","n.A threefold personality existing in the one divine being or substance."},
{"trio","n.Three things grouped or associated together."},
{"triple","adj.Threefold."},
{"triplicate","adj. Composed of or pertaining to three related things or parts."},
{"triplicity","n.The state of being triple or threefold."},
{"tripod","n. A three-legged stand, usually hinged near the top, for supporting some instrument."},
{"trisect","v. To divide into three parts, especially into three equal parts."},
{"triumvir","n.One of three men united coordinately in public office or authority."},
{"trivial","adj. Of little importance or value."},
{"troublesome","adj. Burdensome."},
{"truculence","n.Ferocity."},
{"truculent","adj.Having the character or the spirit of a savage."},
{"truism","n. A statement so plainly true as hardly to require statement or proof."},
{"truthful","adj.Veracious."},
{"turgid","adj. Swollen."},
{"turpitude","n.Depravity."},
{"tutelary","adj.Protective."},
{"tutorship","n.The office of a guardian."},
{"twinge","n. A darting momentary local pain."},
{"typical","adj.Characteristic."},
{"typify","v.To serve as a characteristic example of."},
{"typographical","adj. Pertaining to typography or printing."},
{"typography","n. The arrangement of composed type, or the appearance of printed matter."},
{"tyrannical","adj.Despotic."},
{"tyranny","n. Absolute power arbitrarily or unjustly administrated."},
{"tyro","n. One slightly skilled in or acquainted with any trade or profession"},
//****************************UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU
{"uzair"," The C.R"},
{"ulterior","adj.Not so pertinent as something else to the matter spoken of."},
{"ultimate","adj.Beyond which there is nothing else."},
{"ultimatum","n.A final statement or proposal, as concerning terms or conditions."},
{"ultramundane","adj.Pertaining to supernatural things or to another life."},
{"ultramontane","adj.Beyond the mountains, especially beyond the Alps (that is, on their talian side)."},
{"umbrage","n.A sense of injury."},
{"unaccountable","adj.Inexplicable."},
{"unaffected","adj.Sincere."},
{"unanimous","adj.Sharing the same views or sentiments."},
{"unanimity","n.The state or quality of being of one mind."},
{"unavoidable","adj.Inevitable."},
{"unbearable","adj.Unendurable."},
{"unbecoming","adj.Unsuited to the wearer, place, or surroundings."},
{"unbelief","n.Doubt."},
{"unbiased","adj.Impartial, as judgment."},
{"unbridled","adj.Being without restraint."},
{"uncommon","adj.Rare."},
{"unconscionable","adj.Ridiculously or unjustly excessive."},
{"unconscious","adj.Not cognizant of objects, actions, etc."},
{"unction","n.The art of anointing as with oil."},
{"unctuous","adj.Oily."},
{"undeceive","v.To free from deception, as by apprising of the real state of affairs."},
{"undercharge","v.To make an inadequate charge for."},
{"underexposed","adj.Insufficiently exposed for proper or full development, as negatives in Photograpyh"},
{"undergarment","n.A garment to be worn under the ordinary outer garments."},
{"underman","v. To equip with less than the full complement of men."},
{"undersell","v.To sell at a lower price than."},
{"undersized","adj.Of less than the customary size."},
{"underhanded","adj.Clandestinely carried on."},
{"underlie","v.To be the ground or support of."},
{"underling","n.A subordinate."},
{"undermine","v.To subvert in an underhand way."},
{"underrate","v.To undervalue."},
{"understate","v.To fail to put strongly enough, as a case."},
{"undervalue","v.To underestimate."},
{"underworld","n.Hades."},
{"underwrite","v.To issue or be party to the issue of a policy of insurance."},
{"undue","adj.More than sufficient."},
{"undulate","v.To move like a wave or in waves."},
{"undulous","adj.Resembling waves."},
{"unfavorable","adj.Adverse."},
{"ungainly","adj.Clumsy."},
{"unguent"," n. Any ointment or lubricant for local application."},
{"unicellular adj. Consisting of a single cell."},
{"univalence","n.Monovalency."},
{"unify","v.To cause to be one."},
{"unique","adj.Being the only one of its kind."},
{"unison","n.A condition of perfect agreement and accord."},
{"unisonant","adj.Being in a condition of perfect agreement and accord."},
{"Unitarian","adj.Pertaining to a religious body that rejects the doctrine of the Trinity."},
{"unlawful","adj.Illegal."},
{"unlimited"," adj. Unconstrained."},
{"unnatural","adj.Artificial."},
{"unnecessary","adj.Not essential under the circumstances."},
{"unsettle","v.To put into confusion."},
{"unsophisticated","adj.Showing inexperience."},
{"unspeakable","adj.Abominable."},
{"untimely","adj.Unseasonable."},
{"untoward","adj.Causing annoyance or hindrance."},
{"unutterable","adj.Inexpressible."},
{"unwieldy","adj.Moved or managed with difficulty, as from great size or awkward shape."},
{"unwise","adj.Foolish."},
{"unyoke","v.To separate."},
{"up-keep","n.Maintenance."},
{"upbraid","v.To reproach as deserving blame."},
{"upcast","n.A throwing upward."},
{"upheaval","n.Overthrow or violent disturbance of established order or condition."},
{"upheave","v.To raise or lift with effort."},
{"uppermost","adj.First in order of precedence."},
{"uproarious","adj.Noisy."},
{"uproot","v.To eradicate."},
{"upturn","v.To throw into confusion."},
{"urban","adj.Of, or pertaining to, or like a city."},
{"urbanity","n.Refined or elegant courtesy."},
{"urchin","n.A roguish, mischievous boy."},
{"urgency","n.The pressure of necessity."},
{"usage","n.Treatment."},
{"usurious","adj.Taking unlawful or exorbitant interest on money loaned."},
{"usurp","v.To take possession of by force."},
{"usury","n. he demanding for the use of money as a loan, a rate of interest beyond what is allowed by law."},
{"utilitarianism","n.The ethical doctrine that actions are right because they are useful or of beneficial tendency."},
{"utility","n.Fitness for some desirable practical purpose."},
{"utmost","n.The greatest possible extent."},
//*******************VVVVVVVVVVVVVVV
{"vacate"," v. To leave."},
{"vaccinate"," v. To inoculate with vaccine virus or virus of cowpox."},
{"vacillate"," v. To waver."},
{"vacuous"," adj. Empty."},
{"vacuum"," n. A space entirely devoid of matter."},
{"vagabond"," n. A wanderer."},
{"vagrant"," n. An idle wanderer."},
{"vainglory"," n. Excessive, pretentious, and demonstrative vanity."},
{"vale"," n. Level or low land between hills."},
{"valediction"," n. A bidding farewell."},
{"valedictorian"," n. Student who delivers an address at graduating exercises of an educational institution."},
{"valedictory"," n. A parting address."},
{"valid"," adj. Founded on truth."},
{"valorous"," adj. Courageous."},
{"vapid"," adj. Having lost sparkling quality and flavor."},
{"vaporizer"," n. An atomizer."},
{"variable"," adj. Having a tendency to change."},
{"variance"," n. Change."},
{"variant"," n. A thing that differs from another in form only, being the same in essence or substance."},
{"variation"," n. Modification."},
{"variegate"," v. To mark with different shades or colors."},
{"vassal"," n. A slave or bondman."},
{"vaudeville"," n. A variety show."},
{"vegetal"," adj. Of or pertaining to plants."},
{"vegetarian"," n. One who believes in the theory that man's food should be exclusively vegetable."},
{"vegetate"," v. To live in a monotonous, passive way without exercise of the mental faculties."},
{"vegetation"," n. Plant-life in the aggregate."},
{"vegetative"," adj. Pertaining to the process of plant-life."},
{"vehement"," adj. Very eager or urgent."},
{"velocity"," n. Rapid motion."},
{"velvety"," adj. Marked by lightness and softness."},
{"venal"," adj. Mercenary, corrupt."},
{"vendible"," adj. Marketable."},
{"vendition"," n. The act of selling."},
{"vendor"," n. A seller."},
{"veneer"," n. Outside show or elegance."},
{"venerable"," adj. Meriting or commanding high esteem."},
{"venereal"," adj. Pertaining to or proceeding from sexual intercourse."},
{"venial"," adj. That may be pardoned or forgiven, a forgivable sin."},
{"venison"," n. The flesh of deer."},
{"venom"," n. The poisonous fluid that certain animals secrete."},
{"venous"," adj. Of, pertaining to, or contained or carried in a vein or veins."},
{"veracious"," adj. Habitually disposed to speak the truth."},
{"veracity"," n. Truthfulness."},
{"verbatim"," adv. Word for word."},
{"verbiage"," n. Use of many words without necessity."},
{"verbose"," adj. Wordy."},
{"verdant"," adj. Green with vegetation."},
{"verification"," n. The act of proving to be true, exact, or accurate."},
{"verify"," v. To prove to be true, exact, or accurate."},
{"verily"," adv. In truth."},
{"verity"," n. Truth."},
{"vermin"," n. A noxious or troublesome animal."},
{"vernacular"," n. The language of one's country."},
{"vernal"," adj. Belonging to or suggestive of the spring."},
{"versatile adj. Having an aptitude for applying oneself to new and varied tasks or to various subjects."},
{"version"," n. A description or report of something as modified by one's character or opinion."},
{"vertex"," n. Apex."},
{"vertical"," adj. Lying or directed perpendicularly to the horizon."},
{"vertigo"," n. Dizziness."},
{"vestige"," n. A visible trace, mark, or impression, of something absent, lost, or gone."},
{"vestment"," n. Clothing or covering."},
{"veto"," n. The constitutional right in a chief executive of refusing to approve an enactment."},
{"vicarious"," adj. Suffered or done in place of or for the sake of another."},
{"viceroy"," n. A ruler acting with royal authority in place of the sovereign in a colony or province."},
{"vicissitude"," n. A change, especially a complete change, of condition or circumstances, as of fortune."},
{"vie"," v. To contend."},
{"vigilance"," n. Alert and intent mental watchfulness in guarding against danger."},
{"vigilant"," adj. Being on the alert to discover and ward off danger or insure safety."},
{"vignette"," n. A picture having a background or that is shaded off gradually."},
{"vincible"," adj. Conquerable."},
{"vindicate"," v. To prove true, right, or real."},
{"vindicatory"," adj. Punitive."},
{"vindicative"," adj. Revengeful."},
{"vinery"," n. A greenhouse for grapes."},
{"viol"," n. A stringed instrument of the violin class."},
{"viola"," n. A musical instrument somewhat larger than a violin."},
{"violator"," n. One who transgresses."},
{"violation"," n. Infringement."},
{"violoncello"," n. A stringed instrument held between the player's knees."},
{"virago"," n. A bold, impudent, turbulent woman."},
{"virile"," adj. Masculine."},
{"virtu"," n. Rare, curious, or beautiful quality."},
{"virtual"," adj. Being in essence or effect, but not in form or appearance."},
{"virtuoso"," n. A master in the technique of some particular fine art."},
{"virulence"," n. Extreme poisonousness."},
{"virulent"," adj. Exceedingly noxious or deleterious."},
{"visage"," n. The face, countenance, or look of a person."},
{"viscount"," n. In England, a title of nobility, ranking fourth in the order of British peerage."},
{"vista"," n. A view or prospect."},
{"visual"," adj. Perceptible by sight."},
{"visualize"," v. To give pictorial vividness to a mental representation."},
{"vitality"," n. The state or quality of being necessary to existence or continuance."},
{"vitalize"," v. To endow with life or energy."},
{"vitiate"," v. To contaminate."},
{"vituperable"," adj. Deserving of censure."},
{"vivacity"," n. Liveliness."},
{"vivify"," v. To endue with life."},
{"vivisection"," n. The dissection of a living animal."},
{"vocable"," n. a word, especially one regarded in relation merely to its qualities of sound."},
{"vocative"," adj. Of or pertaining to the act of calling."},
{"vociferance"," n. The quality of making a clamor."},
{"vociferate"," v. To utter with a loud and vehement voice."},
{"vociferous"," adj. Making a loud outcry."},
{"vogue"," n. The prevalent way or fashion."},
{"volant"," adj. Flying or able to fly."},
{"volatile"," adj. Changeable."},
{"volition"," n. An act or exercise of will."},
{"volitive"," adj. Exercising the will."},
{"voluble"," adj. Having great fluency in speaking."},
{"voluptuous adj. having fullness of beautiful form, as a woman, with or without sensuous or sensual quality."},
{"voracious"," adj. Eating with greediness or in very large quantities."},
{"vortex"," n. A mass of rotating or whirling fluid, especially when sucked spirally toward the center."},
{"votary"," adj. Consecrated by a vow or promise."},
{"votive"," adj. Dedicated by a vow."},
{"vulgarity"," n. Lack of refinement in conduct or speech."},
{"vulnerable"," adj. Capable of receiving injuries."},
//*****************WWWWWWWWWWWWWWW
{"waif"," n. A homeless, neglected wanderer."},
{"waistcoat"," n. A vest."},
{"waive"," v. To relinquish, especially temporarily, as a right or claim."},
{"wampum"," n. Beads strung on threads, formerly used among the American Indians as currency."},
{"wxane"," v. To diminish in size and brilliancy."},
{"wantonness"," n. Recklessness."},
{"warlike"," adj. Belligerent."},
{"wavelet"," n. A ripple."},
{"weak-kneed"," adj. Without resolute purpose or energy."},
{"weal"," n. Well-being."},
{"wean"," v. To transfer (the young) from dependence on mother's milk to another form of nourishment."},
{"wearisome"," adj. Fatiguing."},
{"wee"," adj. Very small."},
{"well-bred"," adj. Of good ancestry."},
{"well-doer"," n. A performer of moral and social duties."},
{"well-to-do"," adj. In prosperous circumstances."},
{"whereabouts"," n. The place in or near which a person or thing is."},
{"whereupon"," adv. After which."},
{"wherever"," adv. In or at whatever place."},
{"wherewith"," n. The necessary means or resources."},
{"whet"," v. To make more keen or eager."},
{"whimsical"," adj. Capricious."},
{"whine"," v. To utter with complaining tone."},
{"wholly"," adv. Completely."},
{"wield"," v. To use, control, or manage, as a weapon, or instrument, especially with full command."},
{"wile"," n. An act or a means of cunning deception."},
{"winsome"," adj. Attractive."},
{"wintry"," adj. Lacking warmth of manner."},
{"wiry"," adj. Thin, but tough and sinewy."},
{"witchcraft"," n. Sorcery."},
{"witless"," adj. Foolish, indiscreet, or silly."},
{"witling"," n. A person who has little understanding."},
{"witticism"," n. A witty, brilliant, or original saying or sentiment."},
{"wittingly"," adv. With knowledge and by design."},
{"wizen"," v. To become or cause to become withered or dry."},
{"wizen-faced"," adj. Having a shriveled face."},
{"working-man"," n. One who earns his bread by manual labor."},
{"workmanlike"," adj. Like or befitting a skilled workman."},
{"workmanship"," n. The art or skill of a workman."},
{"wrangle"," v. To maintain by noisy argument or dispute."},
{"wreak"," v. To inflict, as a revenge or punishment."},
{"wrestv",". To pull or force away by or as by violent twisting or wringing."},
{"wretchedness"," n. Extreme misery or unhappiness."},
{"writhe"," v. To twist the body, face, or limbs or as in pain or distress."},
{"writing","n. The act or art of tracing or inscribing on a surface letters or ideographs."},
{"wry"," adj. Deviating from that which is proper or right."},
//****************************XXXXXXXXXXXXXXXXXXXXX
{"xanthelasma"," (n.) see xanthoma."},
{"xanthian"," (a.) of or pertaining to xanthus, an ancient town on asia minor; -- applied especially to certain marbles found near that place, and now in the british museum."},
{"xanthic"," (a.) tending toward a yellow color, or to one of those colors, green being excepted, in which yellow is a constituent, as scarlet, orange, etc."},
{"xanthide"," (n.) a compound or derivative of xanthogen."},
{"xanthidia"," (pl. ) of xanthidium"},
{"xanthidium","(n.) a genus of minute unicellular algae of the desmids. these algae have a rounded shape and are armed with glochidiate or branched aculei. several species occur in ditches, and others are found fossil in flint or hornstone."},
{"xanthin"," (n.) a crystalline nitrogenous body closely related to both uric acid and hypoxanthin, present in muscle tissue, and occasionally found in the urine and in some urinary calculi. it is also present in guano. so called from the yellow color of certain of its salts (nitrates)."},
{"xanthin"," (n.) a yellow insoluble coloring matter extracted from yellow flowers; specifically, the coloring matter of madder."},
{"xanthin"," (n.) one of the gaseous or volatile decomposition products of the xanthates, and probably identical with carbon disulphide."},
{"xanthinine"," (n.) a complex nitrogenous substance related to urea and uric acid, produced as a white powder; -- so called because it forms yellow salts, and because its solution forms a blue fluorescence like quinine."},
{"xanthium"," (n.) a genus of composite plants in which the scales of the involucre are united so as to form a kind of bur; cocklebur; clotbur."},
{"xantho"," () a combining form from gr. xanqo`s yellow; as in xanthocobaltic salts. used also adjectively in chemistry."},
{"xanthocarpous"," (a.) having yellow fruit."},
{"xanthochroi"," (n. pl.) a division of the caucasian races, comprising the lighter-colored members."},
{"xanthochroic"," (a.) having a yellowish or fair complexion; of or pertaining to the xanthochroi."},
{"xanthodontous"," (a.) having yellow teeth."},
{"xanthogen"," (n.) the hypothetical radical supposed to be characteristic of xanthic acid."},
{"xanthogenate"," (n.) a salt of xanthic acid."},
{"xanthogenic"," (a.) producing a yellow color or compound; xanthic. see xanthic acid, under xanthic."},
{"xanthoma"," (n.) a skin disease marked by the development or irregular yellowish patches upon the skin, especially upon the eyelids; -- called also xanthelasma."},
{"xanthophane"," (n.) the yellow pigment present in the inner segments of the retina in animals. see chromophane."},
{"xanthophyll"," (n.) a yellow coloring matter found in yellow autumn leaves, and also produced artificially from chlorophyll; -- formerly called also phylloxanthin."},
{"xanthopous"," (a.) having a yellow stipe, or stem."},
{"xanthoproteic"," (a.) pertaining to, or derived from, xanthoprotein; showing the characters of xanthoprotein; as, xanthoproteic acid; the xanthoproteic reaction for albumin."},
{"xanthoprotein"," (n.) a yellow acid substance formed by the action of hot nitric acid on albuminous or proteid matter. it is changed to a deep orange-yellow color by the addition of ammonia."},
{"xanthopuccine"," (n.) one of three alkaloids found in the root of the yellow puccoon (hydrastis canadensis). it is a yellow crystalline substance, and resembles berberine."},
{"xanthorhamnin"," (n.) a glucoside extracted from persian berries as a yellow crystalline powder, used as a dyestuff."},
{"xanthorhiza"," (n.) a genus of shrubby ranunculaceous plants of north america, including only the species xanthorhiza apiifolia, which has roots of a deep yellow color; yellowroot. the bark is intensely bitter, and is sometimes used as a tonic."},
{"xanthorhoea"," (n.) a genus of endogenous plants, native to australia, having a thick, sometimes arborescent, stem, and long grasslike leaves. see grass tree."},
{"xanthose"," (n.) an orange-yellow substance found in pigment spots of certain crabs."},
{"xanthosis"," (n.) the yellow discoloration often observed in cancerous tumors."},
{"xanthospermous"," (a.) having yellow seeds."},
{"xanthous"," (a.) yellow; specifically (ethnol.), of or pertaining to those races of man which have yellowish, red, auburn, or brown hair."},
{"xanthoxylene"," (n.) a liquid hydrocarbon of the terpene series extracted from the seeds of a japanese prickly ash (xanthoxylum pipertium) as an aromatic oil."},
{"xanthoxylum"," (n.) a genus of prickly shrubs or small trees, the bark and rots of which are of a deep yellow color; prickly ash."},
{"xebec ","(n.) a small three-masted vessel, with projecting bow stern and convex decks, used in the mediterranean for transporting merchandise, etc. it carries large square sails, or both. xebecs were formerly armed and used by corsairs."},
{"xeme"," (n.) an arctic fork-tailed gull (xema sabinii)."},
{"xenelasia"," (n.) a spartan institution which prohibited strangers from residing in sparta without permission, its object probably being to preserve the national simplicity of manners."},
{"xenia"," (pl. ) of xenium"},
{"xenium"," (n.) a present given to a guest or stranger, or to a foreign ambassador."},
//**********************YYYYYYYYYYYYYYYYYY
//**********************ZZZZZZZZZZZZZZZZZ
{"yearling"," n. A young animal past its first year and not yet two years old."},
{"zealot"," n. One who espouses a cause or pursues an object in an immoderately partisan manner."},
{"zeitgeist"," n. The intellectual and moral tendencies that characterize any age or epoch."},
{"zenith"," n. The culminating-point of prosperity, influence, or greatness."},
{"zephyr"," n. Any soft, gentle wind."},
{"zodiac"," n. An imaginary belt encircling the heavens within which are the larger planets."},
{"zia-ahmed"," Zi.."}
};
int length,main,m=0;
length=strlen(abc)-1;
for(main=0;main<4803;main++)
{
for(int n=0;n<1;n++)
{
for(int k=0;k<=length;k++)
{
if(abc2[main][n][k]==(NULL))
{
k=length;
}
else if(abc[k]==abc2[main][n][k])
{
m++;
}
else
{
m=0;
}
if(m==length+1)
{
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n_______________________________________________________________________________________________________________________";
cout<<"\n\n\n\t\t\t\t\t\t\tRESULT";
cout<<"\n\t\t\t\t\t\t\t______\n\n\n\n\n";
cout<<"\t\t\t "<<abc<<":"<<abc2[main][n+1]<<"\n";
cout<<"\n\n_______________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
k=length;main=4803;
}
if(main==4803 && m==0)
{
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n__________________________________________________________________________________________________________________________";
cout<<"\n\n\n\n\t\t\t\t\t\t Oops! No Results found.\n";
cout<<"\n\n__________________________________________________________________________________________________________________________";
cout<<"\t\t\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
}
// goto menue;
}//if else bracket
}
}
}
}
////synonyms//////
void Synonyms(Node* trieTree,char* abc){
int x=1;
Node* currentNode=Search(trieTree,abc);
if(currentNode!=NULL){
//cout<<"Synonyms of the word are:\n";
//cout<<currentNode->synonyms;
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n_______________________________________________________________________________________________________________________";
cout<<"\n\n\n\t\t\t\t\t\t\tRESULT";
cout<<"\n\t\t\t\t\t\t\t______\n\n\n\n\n";
cout<<"Synonyms of the given word are :\t "<<currentNode->synonyms<<"\n";
cout<<"\n\n_______________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
}
}
//AutoComplete
void autocomplete( Node* trieTree, vector <char> word,char* prefix){
bool nochild=true;
int X=1;
int x=1;
if(x=1){// if word.size() is not kept here , it gonna print the prefix so keep this check
// first print what is given as prefix
cout<<prefix;// now after this print the things uu got in vector word
for(int i=0;i<word.size();i++){
cout<<word[i];
}
cout<<endl;
}
for(int i=0;i<ALPHABET_SIZE;i++){
if(trieTree->children_[i]!=NULL){
// nochild=false;// it has a child
word.push_back(i+'a');
autocomplete(trieTree->children_[i],word,prefix);
word.pop_back();
}
}
word.pop_back();
}
////Antonyms//////
void Antonyms(Node* trieTree,char* abc){
int x=1;
Node* currentNode=Search(trieTree,abc);
if(currentNode!=NULL){
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n_______________________________________________________________________________________________________________________";
cout<<"\n\n\n\t\t\t\t\t\t\tRESULT";
cout<<"\n\t\t\t\t\t\t\t______\n\n\n\n\n";
cout<<"Antonyms of the given word are :\t "<<currentNode->antonyms<<"\n";
cout<<"\n\n_______________________________________________________________________________________________________________________";
cout<<"\t\tCopyrights 2019, DIGITAL Dictionary, All Rights Reserved\t Press ENTER to continue";
getch();
}
}
void PreOrderPrint(Node* trieTree,vector<char>word){
int x=0;
if(trieTree->occurrences_>0){
x++;
for(vector<char>::iterator it = word.begin(); it !=word.end(); ++it){
//cout<<*it;
}
// cout<<endl<<endl;
// cout<<trieTree->synonyms<<endl;
// cout<<trieTree->antonyms<<endl;
}
for (int i=0;i<ALPHABET_SIZE;++i){
if(trieTree->children_[i] !=NULL){
word.push_back(CASE+i);
PreOrderPrint(trieTree->children_[i],word);
word.pop_back();
}
}
}
int main(){
load();
cover();
system("color 75");
Node* trieTree=new Node();
vector<char> word;
vector<char> ch;
InsertNode2(trieTree,"tumid","swollen, distended, protuberant, inflated, turgid, bombastic, pompous, high-flown, stilted, grandiloquent","smooth, flat, level, plane, equable, uninflated, subdued");
InsertNode2(trieTree,"tumult","uproar, ferment, disturbance, turbulence, mutiny, insubordination, excitement, outbreak, fray, bustle, distraction, turmoil, disorder, confusion, noise, bluster, brawl, riot","peace, pacification, subsidence, quiet, tranquillity, order, orderliness");
InsertNode2(trieTree,"turbid","foul, thick, muddy, impure, unsettled, disordered, roiled","clear, limpid, crystalline");
InsertNode2(trieTree,"tutor","guardian, governor, instructor, teacher, preceptor, professor, master, savant","ward, pupil, scholar, student, disciple, learner, tyro");
InsertNode2(trieTree,"twine","twist, wind, embrace, entwine, wreath, bind, unite, braid, bend, meander","untwist, unwind, separate, disunite, detach, unwreath, unravel, disentwine, continue, straighten");
InsertNode2(trieTree,"twist","contort, convolve, complicate, pervert, distort, wrest, wreath, wind, encircle, form, weave, insinuate, unite, interpenetrate","straighten, untwist, rectify, verify, represent, reflect, render, preserve, express, substantiate, unwreath, unwind, detach, disengage, separate, disunite, disentangle, disincorporation, unravel,");
InsertNode2(trieTree,"type","mark, stamp, emblem, kind, character, sign, symbol, pattern, archetype, form, model, idea, image, likeness, expression, cast, mold, fashion","non-description, non-classification, inexpression, misrepresentation, misindication, falsification, abnormity, deviation, caricature, monstrosity");
InsertNode2(trieTree,"typify","prefigure, adumbrate, predelineate, prerepresent, foreshow, predemonstrate, foreshadow","verify, fulfill, realize");
InsertNode2(trieTree,"ugly","loathsome, hideous, hateful, frightful, uncouth, ill-favored, unsightly, ill-looking, plain, homely, deformed, monstrous, ungainly","attractive, fair, seemly, shapely, beautiful, handsome");
InsertNode2(trieTree,"umpire","judge, referee, arbiter, arbitrator","litigant, disputant");
InsertNode2(trieTree,"union","junction, coalition, combination, agreement, harmony, conjunction, concert, league, connection, alliance, confederacy, concord, confederation, consolidation","disjunction, separation, severance, divorce, disagreement, discord, disharmony, secession, disruption, multiplication, diversification, division");
InsertNode2(trieTree,"unison","harmony, agreement, concord, union","discord, disharmony, disagreement, disunion, variance");
InsertNode2(trieTree,"unit","ace, item, part, individual","total, aggregate, collection, sum, mass");
InsertNode2(trieTree,"unite","join, combine, link, attach, amalgamate, associate, coalesce, embody, merge, be_mixed, conjoin, connect, couple, add, incorporate, with, cohere, concatenate, integrate, converge","disjoin, sever, dissociate, separate, disamalgamate, resolve, disconnect, disintegrate, disunite, disrupt, divide, multiply, part, sunder, diverge");
InsertNode2(trieTree,"unity","oneness, singleness, individuality, concord, conjunction, agreement, uniformity, indivisibility","plurality, multitude, complexity, multiplicity, discord, disjunction, separation, severance, variety, heterogeneity, diversity, incongruity, divisibility");
InsertNode2(trieTree,"uphold","support, sustain, elevate, raise, countenance, advocate, sanction, encourage, defend, maintain, vindicate, stand_by","subvert, drop, discard, betray, discountenance, oppose, discourage, attack, repudiate, abandon, abjure, renounce");
InsertNode2(trieTree,"uproot","eradicate, extirpate, weed, deracinate, exterminate, destroy","implant, sow, foster, nurture, cultivate");
InsertNode2(trieTree,"upset","overturn, overthrow, capsize, overbalance, subvert, disestablish","establish, plant, stabilitate, corroborate, confirm");
InsertNode2(trieTree,"urbane","affable, courteous, refined, polite","boorish, discourteous, fined, coarse");
InsertNode2(trieTree,"urgent","pressing, imperative, immediate, importunate, forcible, strenuous, serious, grave, momentous, indeferrible","unimportant, insignificant, trifling, trivial, deferrable");
InsertNode2(trieTree,"useful","advantageous, profitable, helpful, serviceable, beneficial, available, adapted, suited, conducive","disadvantageous, unprofitable, obstructive, retardative, preventative, antagonistic, hostile, cumbersome, burdensome, unbeneficial, unavailable, inconducive, useless, fruitless, ineffectual");
InsertNode2(trieTree,"usher","herald, introduce, precede, announce","follow, attend, succeed");
InsertNode2(trieTree,"usual","common, customary, ordinary, normal, regular, habitual, wonted, accustomed, general","uncommon, rare, exceptional, uncustomary, extraordinary, abnormal, irregular, unusual");
InsertNode2(trieTree,"usurp","seize, arrogate, appropriate, assume","receive, inherit, accept");
InsertNode2(trieTree,"vacant","empty, leisure, unemployed, unencumbered, unoccupied, void, unfilled, mindless, exhausted","full, replenished, business, employed, engaged, occupied, filled, thoughtful");
InsertNode2(trieTree,"vacate","resign, surrender, annul, invalidate, abrogate, neutralize","hold, retain, fill, occupy, substantiate");
InsertNode2(trieTree,"vagary","whim, fancy, crotchet, freak, caprice","purpose, determination, judgment, conviction, seriousness");
InsertNode2(trieTree,"vague","general, lax, indefinite, undetermined, popular, intangible, equivocal, unsettled, uncertain, ill-defined, pointless","strict, definite, determined, limited, scientific, pointed, specific");
InsertNode2(trieTree,"vain","empty, worthless, fruitless, unsatisfying, unavailing, idle, ineffectual, egotistic, showy, unreal, conceited, arrogant","solid, substantial, sound, worthy, efficient, effectual, cogent, potent, unconceited, modest, real");
InsertNode2(trieTree,"valid","strong, powerful, cogent, weighty, sound, substantial, available, efficient, sufficient, operative, conclusive","weak, invalid, powerless, unsound, unsubstantial, unavailable, inefficient, insufficient, inoperative, obsolete, effete, superseded, inconclusive");
InsertNode2(trieTree,"vanish","disappear, dissolve, melt, fade_away","appear, approach, loom");
InsertNode2(trieTree,"vanity","emptiness, unsubstantiality, unreality, falsity, conceit, self-sufficiency, ostentation, pride, worthlessness, triviality","substance, solidity, substantiality, reality, truth, modesty, selfdistrust, simplicity, unostentatiousness, humility");
InsertNode2(trieTree,"vary","alter, dissimilate, change, modify, variegate, diversify, differ, deviate, disagree","perpetuate, stabilitate, assimilate, stereotype, harmonize, conform");
InsertNode2(trieTree,"vast","waste, wild, desolate, extensive, spacious, wide_spread, gigantic, wide, boundless, measureless, enormous, mighty, huge, immense, colossal, prodigious, far-reaching","narrow, close, confined, frequented, populated, cultivated, tended, tilled, limited, bounded, circumscribed, moderate");
InsertNode2(trieTree,"vere","shift, tergiversate, trim, temporize","stand, stick, persist, remain, adhere");
InsertNode2(trieTree,"veil","intercept, hide, screen, disguise, palliate, mask, cover, conceal","expose, unveil, strip, denude, exaggerate");
InsertNode2(trieTree,"venial","pardonable, excusable, remissible, justifiable","unpardonable, inexcusable, irremissible, mortal");
InsertNode2(trieTree,"verbal","oral, spoken, parole, vocal, unwritten, unrecorded","written, documentary, epistolary, recorded");
InsertNode2(trieTree,"verify","establish, confirm, fulfill, authenticate, substantiate, identify, realize, test, warrant, demonstrate","disestablish, subvert, fail, falsify, mistake, misrepresent, misstate, disappoint, misdemonstrate");
InsertNode2(trieTree,"verity","truth, reality, actuality, in_existence","falsity, unreality, supposition, hypothesis, conjecture, chimera, dream, delusion, fancy, phantasy");
InsertNode2(trieTree,"vernal","spring, youthful, genial, balmy, nascent","wintry, aged, brumal, hibernal, harsh, ungenial, cutting, autumnal, decadent, declining");
InsertNode2(trieTree,"vest","kobe, clothe, furnish, endow","divest, strip, unrobe, denude, deprive");
InsertNode2(trieTree,"vex","tease, irritate, provoke, plague, torment, tantalize, bother, worry, pester, trouble, disquiet, afflict, harass, annoy","soothe, appease, gratify, quiet, please");
InsertNode2(trieTree,"vice","corruption, fault, defect, evil, crime, immorality, sin, badness","purity, faultlessness, perfection, virtue, immaculateness, goodness, soundness");
InsertNode2(trieTree,"victim","sufferer, prey, sacrifice, martyr, dupe, grill","sacrificer, seducer");
InsertNode2(trieTree,"view","behold, examine, inspect, explore, survey, consider, contemplate, reconnoitre, observe, regard, estimate, judge","ignore, overlook, disregard, misconsider, misinspect, misobserve, misestimate, misjudge");
InsertNode2(trieTree,"view","sight, vision, survey, examination, inspection, judgment, estimate, scene, representation, apprehension, sentiment, conception, opinion, object, aim, intention, purpose, design, end, light, aspect","blindness, occultation, obscuration, darkness, misexamination, deception, error, delusion, misjudgment, misrepresentation, misconception, airlessness, nonintention");
InsertNode2(trieTree,"vile","cheap, worthier, valueless, low, base, mean, despicable, hateful, bad, impure, vicious, abandoned, abject, sinful, sordid, ignoble, wicked, villainous, degraded, wretched","costly, rare, precious, valuable, high, exulted, noble, honorable, lofty, venerable");
InsertNode2(trieTree,"vilify","debase, degrade, spoil, deteriorate, mar, defame, traduce, asperse, stigmatize, slander, upbraid, abuse, decry, cheapen","purify, refine, exalt, raise, improve, enhance, eulogize, praise, laud, panegyrize, commend");
InsertNode2(trieTree,"virile","manly, masculine, robust, nervous, vigorous","feeble, debile, puerile, effeminate, emasculate");
InsertNode2(trieTree,"virtue","power, capacity, strength, force, efficacy, excellence, value, morality, goodness, uprightness, purity, chastity, salubrity","weakness, incapacity, inability, inefficacy, badness, corruption, vice, immorality, impurity, unchastity, virulence, malignancy");
InsertNode2(trieTree,"viscid","glutinous, ropy, gelatinous, sticky, cohesive","watery, limpid, tenacious, incohesive");
InsertNode2(trieTree,"vital","living, animate, life-supporting, life-containing, essential, necessary, important, indispensable, inseparable, paramount, material","mortal, lethal, cadaverous, lifeless, inanimate, unessential, unimportant, secondary, separable, immaterial");
InsertNode2(trieTree,"vogue","way, custom, fashion, repute, use, usage, practice","desuetude, disuse, disesteem, unfashionableness, disrepute, abolition");
InsertNode2(trieTree,"voice","tone, utterance, language, articulation, words, expression, signification, opinion, vote, suffrage, say, control","aphony, muteness, obmutescence, voicelessness, silence, inarticulation, inexpression, dumbness, inauthoritativeness");
InsertNode2(trieTree,"void","wanting, empty, vacant, useless, nugatory, destitute, bereft, unoccupied, unfilled, unsubstantial, lacking, invalid, null","possessed, endued, furnished, full, occupied, solid, substantial, rich, valid, operative, good, efficacious");
InsertNode2(trieTree,"volume","size, body, bulk, dimensions, book, work, tome, capacity, magnitude, compass, quantity","diminutiveness, tenuity, minuteness, smallness");
InsertNode2(trieTree,"vouch","attest, undertake, promise, assure, warrant, vow","demur, repudiate, decline, abnegate, abjure, renounce, protest");
InsertNode2(trieTree,"vulgar","popular, general, loose, ordinary, public, vernacular, plebeian, uncultivated, unrefined, low, mean, coarse, underbred","strict, scientific, philosophical, restricted, technical, accurate, patrician, select, choice, cultivated, refined, polite, high-bred, stylish, aristocratic");
InsertNode2(trieTree,"wag","joker, jester, droll_fellow, humorist","sober_fellow, serious_fellow");
InsertNode2(trieTree,"wages","remuneration, hire, compensation, stipend, salary, allowance","gratuity, douceur, premium, bonus, grace");
InsertNode2(trieTree,"walt","stay, tarry, rest, stop, bide, expect","speed, hasten, press");
InsertNode2(trieTree,"wake","rouse, suscitate, excite, reanimate, revive, awake, watch, revel, evoke, summon, provoke, call","soothe, allay, appease, lay, hush, lullaby, mesmerize, tranquilize, quiet");
InsertNode2(trieTree,"walk","step, stride, march, stalk, plod, tread, tramp, trudge","halt, stop, stand_still, ride");
InsertNode2(trieTree,"wider","ramble, range, stroll, rove, expatiate, roam, deviate, stray, depart, err, swerve, straggle, saunter, navigate, circumnavigate, travel","rest, stop, perch, bivouac, halt, lie, anchor, alight, settle, moor, pause, repose");
InsertNode2(trieTree,"wane","fade, pale, decrease, diminish, decline, fail, sink, ebb, deteriorate, recede, pine, droop, attenuate, contract","brighten, increase, improve, mend, advance, rally, develop, recover, expand");
InsertNode2(trieTree,"want","deficiency, lack, failure, insufficiency, scantiness, shortness, omission, neglect, nonproduction, absence","supply, sufficiency, provision, abundance, production, allowance, supplement, adequacy");
InsertNode2(trieTree,"wanton","wandering, roving, sportive, playful, frolicsome, loose, unbridled, uncurbed, reckless, unrestrained, irregular, licentious, dissolute, inconsiderate, heedless, gratuitous","stationary, unrovlng, unsportive, unplayful, unfrolicsome, joyless, thoughtful, demure, sedate, discreet, staid, self-controlled, well-regulated, formal, austere, purposed, deliberate, cold-blooded, determined");
InsertNode2(trieTree,"ward","watch, avert, defend, parry, guard, fend, repel","betray, surrender, admit");
InsertNode2(trieTree,"warm","blood-warm, thermal, genial, irascible, hot, ardent, affectionate, fervid, fervent, fiery, glowing, enthusiastic, zealous, eager, excited, interested, animated","frigid, cold, tepid, starved, indifferent, cool, unexcited, passionless");
InsertNode2(trieTree,"warmth","ardor, glow, fervor, zeal, heat, excitement, intensity, earnestness, cordiality, animation, eagerness, vehemence, geniality, sincerity, passion, irascibility, emotion, life","frigidity, frost, congelation, iciness, coldness, calmness, coolness, indifference, torpidity, insensitiveness, apathy, slowness, ungeniality, insincerity, passionlessness, hypocrisy, good-temper, death");
InsertNode2(trieTree,"warn","premonish, monish, admonish, notify, dissuade, deter, alarm","encourage, incite, instigate, induce");
InsertNode2(trieTree,"warp","turn, twist, shrink, give, contort, bias, unhinge, distort, prejudice, corrupt, narrow, pervert","stand, hold, direct, guide, control, correct, regulate, train, conduct, rectify, expand");
InsertNode2(trieTree,"wary","suspicious, cautious, watchful, guarded, circumspect, prudent, vigilant","unwary, unsuspecting, incautious, invigilant, unwatchful, unguarded, uncircumspect, heedless");
InsertNode2(trieTree,"wash","lave, cleanse, bathe, rinse, absterge","soil, foul, contaminate");
InsertNode2(trieTree,"washy","weak, vapid, diluted, spiritless, pointless","vigorous, nervous, forcible, pregnant, trenchant, pungent");
InsertNode2(trieTree,"waste","ruin, destroy, devastate, impair, consume, squander, dissipate, throw_away, diminish, impair, lavish, desolate, pine, decay, attenuate, dwindle, shrivel, wither, wane","restore, repair, conserve, preserve, perpetuate, protect, husband, economize, utilize, hoard, treasure, accumulate, enrich, flourish, luxuriate, multiply, augment, develop");
InsertNode2(trieTree,"watch","wait, wake, contemplate, observe, note, tend, guard","disregard, overlook, misobserve");
InsertNode2(trieTree,"waver","hesitate, dubitate, halt, fluctuate, vacillate, alternate, scruple, be_undetermined, totter","determine, decide, rest, repose, settle");
InsertNode2(trieTree,"weak","feeble, infirm, enfeebled, powerless, debile, fragile, incompact, inadhesive, pliant, frail, oft, tender, milk_and_water, flabby, flimsy, wishy_washy, destructible, watery, diluted, imbecile, inefficient, spiritless, foolish, injudicious, unsound, undecided, unconfirmed, irrepressible, wavering, ductile, easy, malleable, unconvincing, inconclusive, vapid, pointless","strong, vigorous, robust, muscular, nervous, powerful, tough, stout, lusty, sturdy, compact, adhesive, resistant, fibrous, hard, indistructible, potent, intoxicating, efficient, spirited, animated, wise, sound, judicious, cogent, valid, decided, determined, unwavering, stubborn, unyielding, inexorable, conclusive, irresistible, forcible, telling");
InsertNode2(trieTree,"weaken","debilitate, enfeeble, enervate, dilute, impair, paralyze, attenuate, sap","strengthen, invigorate, empower, corroborate, confirm");
InsertNode2(trieTree,"wealth","influence, riches, mammon, lucre, plenty, affluence, abundance, opulence","indigence, poverty, scarcity, impecuniosity");
InsertNode2(trieTree,"weapon","instrument, implement, utensil, arm","shift, makeshift, contrivance");
InsertNode2(trieTree,"wear","carry, bear, exhibit, sport, consume, dou, waste, impair, rub, channel, groove, excavate, hollow, diminish","doff, abandon, repair, renovate, renew, increase, swell, augment");
InsertNode2(trieTree,"weazen","wizened, withered, dried_up","fresh, plump, fair, rounded_out, full");
InsertNode2(trieTree,"wed","link, marry, espouse","separate, divorce");
InsertNode2(trieTree,"weight","gravity, ponderosity, heaviness, pressure, burden, importance, power, influence, efficacy, consequence, moment, impressiveness","lightness, levity, portableness, alleviation, unimportance, insignificance, weakness, inefficacy, unimpressiveness, triviality, worthlessness");
InsertNode2(trieTree,"whole","total, entire, all, well, complete, sound, healthy, perfect, unimpaired, undiminished, integral, undivided, gross","partial, imperfect, incomplete, unsound, sick, impaired, diminished, fractional, divided, sectional");
InsertNode2(trieTree,"wicked","evil, bad, godless, sinful, immoral, iniquitous, criminal, unjust, unrighteous, irreligious, profane, ungodly, vicious, atrocious, black, dark, foul, unhallowed, nefarious, naughty, heinous, flagitious, abandoned, corrupt","good, virtuous, just, godly, moral, religious, upright, honest, pure, honorable, incorrupt, sinless, spotless, immaculate, stainless");
InsertNode2(trieTree,"wield","manage, handle, employ, sway, brandish","mismanage, misemploy, discard, resign, depose, surrender, deposit, abdicate");
InsertNode2(trieTree,"wife","consort, spouse, helpmeet, helpmate","mistress, husband");
InsertNode2(trieTree,"wild","untamed, undomesticated, uncultivated, uninhabited, desert, savage, uncivilized, unrefined, rude, ferocious, untrained, violent, ferine, loose, disorderly, turbulent, ungoverned, inordinate, disorderly, chimerical, visionary, incoherent, raving, distracted, haggard","tame, domesticated, cultivated, inhabited, frequented, populous, civilized, polite, refined, reclaimed, gentle, mild, subdued, regulated, orderly, rational, collected, coherent, sane, sober, sensible, calm, trim");
InsertNode2(trieTree,"wile","guile, craft, cunning, artifice, art, device, machination, plot, design, stratagem","openness, candor, ingenuousness, friendliness, frankness, artlessness");
InsertNode2(trieTree,"will","allure, procure, gain, obtain, conciliate, earn, succeed, get, achieve, accomplish, conquer","repel, forfeit, miss, alienate, fail");
InsertNode2(trieTree,"winnow","sift, simplify, eliminate, disencumber, sort","confuse, amalgamate, confound, intermix");
InsertNode2(trieTree,"wisdom","knowledge, erudition, learning, enlightenment, attainment, information, discernment, judgment, sagacity, prudence, light","ignorance, illiterateness, sciolism, indiscernment, injudiciousness, folly, imprudence, darkness, empiricism, smattering, inacquaintance");
InsertNode2(trieTree,"wit","mind, intellect, sense, reason, understanding, humor, ingenuity, imagination","mindlessness, senselessness, irrationality, dulness, stolidity, stupidity, inanity, doltishness, wash, vapidity, platitude, commonplace");
InsertNode2(trieTree,"wither","shrivel, dry, collapse, shrink, blast, blight","swell, grow, freshen, luxuriate, wanton, refresh, expand, develop");
InsertNode2(trieTree,"witty","jocose, humorous, facetious, acute","stupid, sober, dull, stolid");
InsertNode2(trieTree,"woe","grief, sorrow, misery, calamity, affliction, distress, disaster, trouble, malediction, curse","joy, gladness, comfort, boon, happiness, prosperity, weal, benediction, blessing");
InsertNode2(trieTree,"wonder","amazement, astonishment, surprise, admiration, phenomenon, prodigy, portent, miracle, sign, marvel","astonishment, indifference, apathy, unamazement, anticipation, expectation, familiarity, triviality");
InsertNode2(trieTree,"wont","rule, custom, use, habit","exception, deviation, disuse, desuetude");
InsertNode2(trieTree,"wood","thicket, grove, forest, cope","open_place");
InsertNode2(trieTree,"word","term, expression, message, account, tidings, order, vocable, signal, engagement, promise","idea, conception");
InsertNode2(trieTree,"work","exertion, effort, toil, labor, employment, performance, production, product, effect, result, composition, achievement, operation, is_sue, fruit","effortlessness, inertia, rest, inoperativeness, non-employment, nonperformance, non-production, abortion, miscarriage, frustration, neutralization, fruitlessness");
InsertNode2(trieTree,"worry","harass, irritate, tantalize, importune, vex, molest, annoy, tease, torment, disquiet, plague, fret","soothe, calm, gratify, please, amuse, quiet");
InsertNode2(trieTree,"wound","rend, cut, hurt, injure, harm, damage, pain, mortify, annoy, gall, irritate, lacerate","heal, soothe, allay, repair, mollify, soften, gratify, please");
InsertNode2(trieTree,"wrap","wind, fold, muffle, cover, involve, infold, envelop, encumber","unwind, unfold, develop, unwrap, eliminate");
InsertNode2(trieTree,"wrath","ire, passion, rage, fury, anger, exasperation, indignation, resentment","gratification, approval, delight, appeasement, pacification, reconciliation, compassion, leniency, mercy");
InsertNode2(trieTree,"wrong","unfit, unsuitable, improper, mistaken, incorrect, erroneous, unjust, illegal, inequitable, immoral, injurious, awry","fit, suitable, proper, correct, accurate, right, just, legal, equitable, fair, moral, beneficial, straight");
InsertNode2(trieTree,"wry","atwist, askew, contorted, distorted, deformed, deranged","straight, right, just, fit, proper, shapely, comely");
InsertNode2(trieTree,"yield","furnish, produce, afford, bear, render, relinquish, give_in, let_go, forego, accede, acquiesce, resign, surrender, concede, allow, grant, submit, succumb, comply, consent, agree","withdraw, withhold, retain, deny, refuse, vindicate, assert, claim, disallow, appropriate, resist, dissent, protest, recalcitrate, struggle, strive");
InsertNode2(trieTree,"zealot","partisan, bigot, enthusiast, fanatic, devotee, visionary","renegade, traitor, deserter");
InsertNode2(trieTree,"zenith","height, highest_point, pinnacle, acme, summit, culmination, maximum","nadir, lowest_point, depth, minimum");
InsertNode2(trieTree,"zephyr","west_wind, mild_breeze, gentle_wind","gale, furious_wind");
InsertNode2(trieTree,"zero","naught, cipher, nothing","something, an_existence, creature");
InsertNode2(trieTree,"zest","flavor, appetizer, gusto, gust, pleasure, enjoyment, relish, sharpener, recommendation, enhancement","distaste, disrelish, detriment");
char abc[50];
char word1[50];
ofstream file("history.txt",ios::trunc);
int choice, flag=1, value;
menue:
int X;
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tMAIN MENU";
cout<<"\n\t\t\t\t\t\t\t_________\n";
cout<<"\n\t\t1 Enter the new word in the dictionary :"<<endl;
cout<<"\t\t2 Search the meaning of word in the dictionary :"<<endl;
cout<<"\t\t3 Search Word from the dictionary :"<<endl;
cout<<"\t\t4 Search the synonyms of word in the dictionary :"<<endl;
cout<<"\t\t5 Search the antonyms of word in the dictionary :"<<endl;
cout<<"\t\t6 History of last searches is:"<<endl;
cout<<"\t\t7 Print all the words of the dictionary :"<<endl;
cout<<"\t\t8 Auto Complete :"<<endl;
cout<<"\t\t9 Exit"<<endl;
cin>>choice;
switch(choice){
case 1:
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tDICTIONARY";
cout<<"\n\t\t\t\t\t\t\t__________\n\n";
cout<<"\n\t\t\t\t\t For correct result enter the word in lowercase";
cout<<"\n\t\t\t\t\t Enter a word to insert:\n\t\t\t\t\t\t\t";
cin>>word1;
InsertNode(trieTree,word1);
goto menue;
// meaning(trieTree,abc);
break;
case 2:
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tDICTIONARY";
cout<<"\n\t\t\t\t\t\t\t__________\n\n";
cout<<"\n\t\t\t\t\t For correct result enter the word in lowercase";
cout<<"\n\t\t\t\t\t Enter a word to search:\n\t\t\t\t\t\t\t";
cin>>abc;
file<<abc<<'\n';
search();
meaning(trieTree,abc);
goto menue;
break;
case 3:
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tDICTIONARY";
cout<<"\n\t\t\t\t\t\t\t__________\n\n";
cout<<"\n\t\t\t\t\t For correct result enter the word in lowercase";
cout<<"\n\t\t\t\t\t Enter a word to search:\n\t\t\t\t\t\t\t";
cin>>abc;
search();
main_Search( trieTree, abc);
goto menue;
break;
case 4:
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tDICTIONARY";
cout<<"\n\t\t\t\t\t\t\t__________\n\n";
cout<<"\n\t\t\t\t\t For correct result enter the word in lowercase";
cout<<"\n\t\t\t\t\t Enter a word to search:\n\t\t\t\t\t\t\t";
cin>>abc;
search();
Synonyms(trieTree,abc);
goto menue;
break;
case 5:
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tDICTIONARY";
cout<<"\n\t\t\t\t\t\t\t__________\n\n";
cout<<"\n\t\t\t\t\t For correct result enter the word in lowercase";
cout<<"\n\t\t\t\t\t Enter a word to search:\n\t\t\t\t\t\t\t\t\t";
cin>>abc;
search();
Antonyms(trieTree,abc);
goto menue;
break;
case 6:
file.close(); //Input file closed there
cout<<"\n\n\n\n\n\t\t\t";loading();
history();
goto menue;
break;
case 7:
//cout<<"All words that exists in the dictionary are :";
search();
PreOrderPrint(trieTree,word);
goto menue;
break;
case 8:
system("cls");
cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\t\t\t\tDICTIONARY";
cout<<"\n\t\t\t\t\t\t\t__________\n\n";
cout<<"\n\t\t\t\t\t For correct result enter the word in lowercase";
cout<<"\n\t\t\t\ Enter a word to search:\n\t\t\t\t\t\t";
cin>>abc;
Node* temp=search_trie(trieTree,abc);
if(temp==NULL)
{
cout<<"NO word with this prefix in dictionary "<<endl;
goto menue;}
else
autocomplete(temp,ch,abc);
break;
// file.close();
// cout<<"\n\n\n\n\t\t\t\t";exiting();
//break;
}
return 0;
}
| [
"58141711+hassaanali723@users.noreply.github.com"
] | 58141711+hassaanali723@users.noreply.github.com |
cc6666d802e4f9cc2e81d841f8fbd20c24bcb604 | 006ff11fd8cfd5406c6f4318f1bafa1542095f2a | /L1Trigger/L1TGlobal/src/L1TMenuEditor/xsd/cxx/tree/parsing/unsigned-short.hxx | f08e4742fbe51014a460b76cff1d8a7e1c6b4034 | [] | permissive | amkalsi/cmssw | 8ac5f481c7d7263741b5015381473811c59ac3b1 | ad0f69098dfbe449ca0570fbcf6fcebd6acc1154 | refs/heads/CMSSW_7_4_X | 2021-01-19T16:18:22.857382 | 2016-08-09T16:40:50 | 2016-08-09T16:40:50 | 262,608,661 | 0 | 0 | Apache-2.0 | 2020-05-09T16:10:07 | 2020-05-09T16:10:07 | null | UTF-8 | C++ | false | false | 2,393 | hxx | // file : xsd/cxx/tree/parsing/unsigned-short.hxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2005-2010 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#ifndef XSD_CXX_TREE_PARSING_UNSIGNED_SHORT_HXX
#define XSD_CXX_TREE_PARSING_UNSIGNED_SHORT_HXX
#include <L1Trigger/L1TGlobal/src/L1TMenuEditor/xsd/cxx/ro-string.hxx>
#include <L1Trigger/L1TGlobal/src/L1TMenuEditor/xsd/cxx/zc-istream.hxx>
#include <L1Trigger/L1TGlobal/src/L1TMenuEditor/xsd/cxx/xml/string.hxx> // xml::transcode
#include <L1Trigger/L1TGlobal/src/L1TMenuEditor/xsd/cxx/tree/text.hxx> // text_content
namespace xsd
{
namespace cxx
{
namespace tree
{
template <typename C>
struct traits<unsigned short, C, schema_type::other>
{
typedef unsigned short type;
static type
create (const xercesc::DOMElement& e, flags f, container* c);
static type
create (const xercesc::DOMAttr& a, flags f, container* c);
static type
create (const std::basic_string<C>& s,
const xercesc::DOMElement*,
flags,
container*);
};
template <typename C>
unsigned short traits<unsigned short, C, schema_type::other>::
create (const xercesc::DOMElement& e, flags f, container* c)
{
return create (text_content<C> (e), 0, f, c);
}
template <typename C>
unsigned short traits<unsigned short, C, schema_type::other>::
create (const xercesc::DOMAttr& a, flags f, container* c)
{
return create (xml::transcode<C> (a.getValue ()), 0, f, c);
}
template <typename C>
unsigned short traits<unsigned short, C, schema_type::other>::
create (const std::basic_string<C>& s,
const xercesc::DOMElement*,
flags,
container*)
{
// This type cannot have whitespaces in its values. As result we
// don't need to waste time collapsing whitespaces. All we need to
// do is trim the string representation which can be done without
// copying.
//
ro_string<C> tmp (s);
trim (tmp);
zc_istream<C> is (tmp);
type t;
is >> t;
return t;
}
}
}
}
#endif // XSD_CXX_TREE_PARSING_UNSIGNED_SHORT_HXX
| [
"darren.michael.puigh@cern.ch"
] | darren.michael.puigh@cern.ch |
b31f41b1cfbde0aae607ebe9b0b288fb7a629bed | 567b6ec9778d8bda5dfb43ee7139ed06e5d72af7 | /trunk/private/net/sockets/winsock2/dll/dt_dll/dt_dll.cpp | b47696d69d387b3a43aec3594c242cbea5fc8890 | [] | no_license | mfkiwl/win2k | 5542bce486d5b827d47a9fb4770fae7cd0a77718 | 074be7e4bf30a5f67672382fa5c9e34765949da1 | refs/heads/master | 2023-01-11T08:52:03.896046 | 2020-11-10T06:22:50 | 2020-11-10T06:22:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 43,909 | cpp | /*++
Copyright (c) 1995 Intel Corp
File Name:
dt_dll.cpp
Abstract:
Contains main and supporting functions for a Debug/Trace DLL for the WinSock2 DLL.
See the design spec for more information.
Author:
Michael A. Grafton
--*/
// Include Files
#include "nowarn.h" /* turn off benign warnings */
#ifndef _WINSOCKAPI_
#define _WINSOCKAPI_ /* Prevent inclusion of winsock.h in windows.h */
#endif
#include <windows.h>
#include "nowarn.h" /* some warnings may have been turned back on */
#include <winsock2.h>
#include <stdarg.h>
#include <ws2spi.h>
#include <commdlg.h>
#include <cderr.h>
#include "dt_dll.h"
#include "cstack.h"
#include "dt.h"
#include "handlers.h"
// Forward References for Functions
LRESULT APIENTRY DTMainWndProc(IN HWND WindowHandle, IN UINT Message, IN WPARAM WParam, IN LPARAM LParam);
LRESULT APIENTRY DTEditWndProc(IN HWND WindowHandle, IN UINT Message, IN WPARAM WParam, IN LPARAM LParam);
BOOL WINAPI DllMain(HINSTANCE DllInstHandle, DWORD Reason, LPVOID Reserved);
DWORD WindowThreadFunc(LPDWORD TheParam);
BOOL APIENTRY DebugDlgProc(IN HWND hwndDlg, IN UINT message, IN WPARAM wParam, IN LPARAM lParam);
BOOL GetFile(IN HWND OwnerWindow, OUT LPSTR Buffer, IN DWORD BufSize);
VOID GetComdlgErrMsg(LPTSTR Buffer, LPTSTR Fmt);
void AbortAndClose(IN HANDLE FileHandle, IN HWND WindowHandle);
// Externally Visible Global Variables
HWND DebugWindow = NULL; // handle to the child edit control
HANDLE LogFileHandle = INVALID_HANDLE_VALUE;// handle to the log file
DWORD OutputStyle = NO_OUTPUT; // where to put output
char Buffer[TEXT_LEN]; // buffer for building output strings
// Static Global Variables
// name for my window class
static char DTWndClass[] = "DTWindow";
static HWND FrameWindow = NULL; // handle to frame of debug window
static WNDPROC EditWndProc; // the edit control's window proc
static HINSTANCE DllInstHandle; // handle to the dll instance
static DWORD TlsIndex = -1; // tls index for this module
static CRITICAL_SECTION CrSec; // critical section for text output
static BOOL DllInitialized = FALSE; // Flag to trigger dynamic
// initialization of first API call
static HANDLE TextOutEvent; // set when debug window is ready
static char LogFileName[MAX_PATH + 1]; // name of the log file
static char ModuleFileName[MAX_PATH + 1]; // name of the application
// handle to and id of the main thread of the DLL which initializes
// and creates windows, etc
static HANDLE WindowThread = NULL;
static DWORD WindowThreadId;
// function pointer tables for handler functions.
static LPFNDTHANDLER HdlFuncTable[MAX_DTCODE + 1];
// Input desktop to communicate to the user
static HDESK HDesk;
typedef
HDESK(*LPFN_OPENINPUTDESKTOP) (
DWORD dwFlags, // flags to control interaction with other
// applications
BOOL fInherit, // specifies whether returned handle is
// inheritable
DWORD dwDesiredAccess // specifies access of returned handle);
);
typedef
BOOL(*LPFN_CLOSEDESKTOP) (
HDESK hDesktop // handle to desktop to close
);
static LPFN_OPENINPUTDESKTOP lpfnOpenInputDesktop;
static LPFN_CLOSEDESKTOP lpfnCloseDesktop;
// static strings
static char ErrStr2[] = "An error occurred while trying to get a log"
" filename (%s). Debug output will go to the window only.";
static char ErrStr3[] = "Had problems writing to file. Aborting file"
" output -- all debug output will now go to the debugger.";
static char sCDERR_USERCANCEL[] = "Operation was cancelled.";
static char sCDERR_FINDRESFAILURE[] = "The common dialog box function failed"
" to find a specified resource.";
static char sCDERR_INITIALIZATION[] = "The common dialog box function failed"
" during initialization. This error often occurs when sufficient memory"
" is not available.";
static char sCDERR_LOCKRESFAILURE[] = "The common dialog box function failed"
" to load a specified resource.";
static char sCDERR_LOADRESFAILURE[] = "The common dialog box function failed"
" to load a specified string.";
static char sCDERR_LOADSTRFAILURE[] = "The common dialog box function failed"
" to lock a specified resource.";
static char sCDERR_MEMALLOCFAILURE[] = "The common dialog box function was"
" unable to allocate memory for internal structures.";
static char sCDERR_MEMLOCKFAILURE[] = "The common dialog box function was"
" unable to lock the memory associated with a handle.";
static char sCDERR_NOHINSTANCE[] = "The ENABLETEMPLATE flag was set in the"
" Flags member of the initialization structure for the corresponding"
" common dialog box, but you failed to provide a corresponding instance"
" handle.";
static char sCDERR_NOHOOK[] = "The ENABLEHOOK flag was set in the Flags member"
" of the initialization structure for the corresponding common dialog box,"
" but you failed to provide a pointer to a corresponding hook procedure.";
static char sCDERR_NOTEMPLATE[] = "The ENABLETEMPLATE flag was set in the Flags"
" member of the initialization structure for the corresponding common"
" dialog box, but you failed to provide a corresponding template.";
static char sCDERR_STRUCTSIZE[] = "The lStructSize member of the initialization"
" structure for the corresponding common dialog box is invalid.";
static char sFNERR_BUFFERTOOSMALL[] = "The buffer pointed to by the lpstrFile"
" member of the OPENFILENAME structure is too small for the file name"
" specified by the user.";
static char sFNERR_INVALIDFILENAME[] = "A file name is invalid.";
static char sFNERR_SUBCLASSFAILURE[] = "An attempt to subclass a list box failed"
" because sufficient memory was not available.";
// Function Definitions
BOOL WINAPI DllMain(HINSTANCE InstanceHandle, DWORD dwReason, LPVOID lpvReserved)
/*++
DllMain()
Function Description:
Please see Windows documentation for DllEntryPoint.
Arguments:
Please see windows documentation.
Return Value:
Please see windows documentation.
--*/
{
Cstack_c* ThreadCstack; // points to Cstack objects in tls
switch (dwReason) {
// Determine the reason for the call and act accordingly.
case DLL_PROCESS_ATTACH:
if (GetModuleFileName(NULL, ModuleFileName, sizeof(ModuleFileName)) == 0)
return FALSE;
// Allocate a TLS index.
TlsIndex = TlsAlloc();
if (TlsIndex == 0xFFFFFFFF)
return FALSE;
DllInstHandle = InstanceHandle;
InitializeCriticalSection(&CrSec);
TextOutEvent = CreateEvent(NULL, TRUE, FALSE, NULL);
if (TextOutEvent == NULL)
return FALSE;
// Fill in the handler function table.
DTHandlerInit(HdlFuncTable, MAX_DTCODE);
// flow through...
case DLL_THREAD_ATTACH:
// Store a pointer to a new Cstack_c in the slot for this
// thread.
ThreadCstack = new Cstack_c();
TlsSetValue(TlsIndex, (LPVOID)ThreadCstack);
break;
case DLL_PROCESS_DETACH:
// Note that lpvReserved will be NULL if the detach is due to
// a FreeLibrary() call, and non-NULL if the detach is due to
// process cleanup.
if (lpvReserved == NULL) {
// Free up some resources. This is like cleaning up your room
// before the tornado strikes, but hey, it's good practice.
TlsFree(TlsIndex);
DeleteCriticalSection(&CrSec);
if ((OutputStyle == FILE_ONLY) || (OutputStyle == FILE_AND_WINDOW)) {
if (LogFileHandle != INVALID_HANDLE_VALUE) {
CloseHandle(LogFileHandle);
}
}
if (WindowThread != NULL)
CloseHandle(WindowThread);
if ((lpfnCloseDesktop != NULL) && (HDesk != NULL)) {
lpfnCloseDesktop(HDesk);
HDesk = NULL;
}
}
break;
case DLL_THREAD_DETACH:
// Get the pointer to this thread's Cstack, and delete the object.
ThreadCstack = (Cstack_c*)TlsGetValue(TlsIndex);
delete ThreadCstack;
break;
default:
break;
} // switch (dwReason)
return TRUE;
} // DllMain()
VOID InitializeDll(VOID)
{
PINITDATA InitDataPtr; // to pass to the window creation thread
HMODULE hUser32;
DWORD sz;
BOOLEAN outputStyleSet = FALSE;
HKEY hkeyAppData;
INT err;
EnterCriticalSection(&CrSec);
if (!DllInitialized) {
DllInitialized = TRUE;
if (RegOpenKeyEx(HKEY_LOCAL_MACHINE,
"System\\CurrentControlSet\\Services\\WinSock2\\Parameters\\DT_DLL_App_Data",
0,
MAXIMUM_ALLOWED,
&hkeyAppData) == NO_ERROR) {
DWORD value, sz, type;
sz = sizeof(value);
if ((RegQueryValueEx(hkeyAppData, ModuleFileName, NULL, &type, (PUCHAR)&value, &sz) == NO_ERROR) &&
(type == REG_DWORD) &&
(sz == sizeof(value))) {
switch (value) {
case FILE_ONLY:
case FILE_AND_WINDOW:
strcpy(LogFileName, ModuleFileName);
strcat(LogFileName, ".log");
case NO_OUTPUT:
case WINDOW_ONLY:
case DEBUGGER:
OutputStyle = value;
outputStyleSet = TRUE;
break;
}
}
RegCloseKey(hkeyAppData);
}
hUser32 = GetModuleHandle("user32.dll");
if (hUser32 != NULL) {
if (!outputStyleSet || (OutputStyle == FILE_AND_WINDOW) || (OutputStyle == WINDOW_ONLY)) {
lpfnOpenInputDesktop = (LPFN_OPENINPUTDESKTOP)GetProcAddress(hUser32, "OpenInputDesktop");
lpfnCloseDesktop = (LPFN_CLOSEDESKTOP)GetProcAddress(hUser32, "CloseDesktop");
if ((lpfnOpenInputDesktop != NULL) && (lpfnCloseDesktop != NULL)) {
HDesk = lpfnOpenInputDesktop(0, FALSE, MAXIMUM_ALLOWED);
if (HDesk != NULL) {
if (GetThreadDesktop(GetCurrentThreadId()) == NULL) {
if (SetThreadDesktop(HDesk)) {
if (!outputStyleSet) {
// Pop up a dialog box for the user to choose output method.
OutputStyle = DialogBox(DllInstHandle,
MAKEINTRESOURCE(IDD_DIALOG1),
NULL,
(DLGPROC)DebugDlgProc);
}
} else {
err = GetLastError();
lpfnCloseDesktop(HDesk);
HDesk = NULL;
// Can't set input desktop, force debugger output.
OutputStyle = NO_OUTPUT;
wsprintf(Buffer, "Could not set input desktop in the process (err: %ld),"
" setting output style to NO_OUTPUT.\n", err);
DTTextOut(NULL, NULL, Buffer, DEBUGGER);
wsprintf(Buffer,
"Edit '%s' value (REG_DWORD) under 'HKEY_LOCAL_MACHINE\\System\\CurrentControlSet\\Services\\WinSock2\\Parameters\\DT_DLL_App_Data' key"
" in the registry to set output style to DEBUGGER(%ld) or FILE_ONLY(%ld).\n",
ModuleFileName, DEBUGGER, FILE_ONLY);
DTTextOut(NULL, NULL, Buffer, DEBUGGER);
}
} else {
lpfnCloseDesktop(HDesk);
HDesk = NULL;
if (!outputStyleSet) {
// Pop up a dialog box for the user to choose output method.
OutputStyle = DialogBox(DllInstHandle, MAKEINTRESOURCE(IDD_DIALOG1), NULL, (DLGPROC)DebugDlgProc);
}
}
} else {
// No desktop, force debugger output.
err = GetLastError();
OutputStyle = NO_OUTPUT;
wsprintf(Buffer, "Could not open input desktop in the process (err: %ld),"
" setting output style to NO_OUTPUT.\n", err);
DTTextOut(NULL, NULL, Buffer, DEBUGGER);
wsprintf(Buffer,
"Edit %s value under 'HKEY_LOCAL_MACHINE\\System\\CurrentControlSet\\Services\\WinSock2\\Parameters\\DT_DLL_App_Data' key"
" in the registry to set output style to DEBUGGER(%ld) or FILE_ONLY(%ld).\n",
ModuleFileName, DEBUGGER, FILE_ONLY);
DTTextOut(NULL, NULL, Buffer, DEBUGGER);
}
} else {
lpfnCloseDesktop = NULL;
HDesk = NULL;
if (!outputStyleSet) {
// Pop up a dialog box for the user to choose output method.
OutputStyle = DialogBox(DllInstHandle,
MAKEINTRESOURCE(IDD_DIALOG1),
NULL,
(DLGPROC)DebugDlgProc);
}
}
}
if ((OutputStyle == FILE_ONLY) || (OutputStyle == FILE_AND_WINDOW)) {
LogFileHandle = CreateFile(LogFileName,
GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_WRITE,
NULL,
CREATE_ALWAYS,
FILE_ATTRIBUTE_NORMAL,
NULL);
if (LogFileHandle == INVALID_HANDLE_VALUE) {
if (OutputStyle == FILE_AND_WINDOW) {
DWORD rc = GetLastError();
if (FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,
NULL, rc, 0, Buffer, sizeof(Buffer), NULL) != 0) {
} else {
wsprintf(Buffer, "Error %ld.", rc);
}
MessageBox(NULL, Buffer, "Creating log file", MB_OK | MB_ICONSTOP);
} else {
OutputStyle = NO_OUTPUT;
wsprintf(Buffer, "Couldn't open log file %ls!"
" No output will be generated.\n",
LogFileName);
DTTextOut(NULL, NULL, Buffer, DEBUGGER);
}
}
}
// Get some information for later output to the debug window
// or file -- get the time, PID, and TID of the calling
// process and put into a INITDATA struct. This memory will
// be freed by the thread it is passed to.
InitDataPtr = (PINITDATA)LocalAlloc(0, sizeof(INITDATA));
GetLocalTime(&(InitDataPtr->LocalTime));
InitDataPtr->TID = GetCurrentThreadId();
InitDataPtr->PID = GetCurrentProcessId();
// Create the initialization/window handling thread.
if ((OutputStyle == WINDOW_ONLY) || (OutputStyle == FILE_AND_WINDOW)) {
WindowThread =
CreateThread(NULL,
0,
(LPTHREAD_START_ROUTINE)WindowThreadFunc,
(LPVOID)InitDataPtr,
0,
&WindowThreadId);
} else {
// Normally the window thread does a DTTextOut of the time
// and process info that we saved just above. But in this
// case, there is no window thread so spit it out to the
// file or debugger.
wsprintf(Buffer, "Log initiated: %d-%d-%d, %d:%d:%d\r\n",
InitDataPtr->LocalTime.wMonth,
InitDataPtr->LocalTime.wDay,
InitDataPtr->LocalTime.wYear,
InitDataPtr->LocalTime.wHour,
InitDataPtr->LocalTime.wMinute,
InitDataPtr->LocalTime.wSecond);
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
wsprintf(Buffer, "Process ID: 0x%X Thread ID: 0x%X\r\n", InitDataPtr->PID, InitDataPtr->TID);
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
// Setting this event allows {Pre|Post}ApiNotify to proceed. This event isn't really needed in this case
// (because there is only one thread, and we know the code above has been executed before WSAPre|PostApiNotify).
SetEvent(TextOutEvent);
}
} else {
DTTextOut(NULL, NULL, " Could not load user32.dll\n", DEBUGGER);
}
}
LeaveCriticalSection(&CrSec);
}
BOOL WINAPIV WSAPreApiNotify(IN INT NotificationCode, OUT LPVOID ReturnCode, IN LPSTR LibraryName, ...)
/*++
Function Description:
Builds a string for output and passes it, along with information about the call, to a handler function.
Arguments:
NotificationCode -- specifies which API function called us.
ReturnCode -- a generic pointer to the return value of the API
function. Can be used to change the return value in the
case of a short-circuit (see how the return value from PreApiNotify works for more information on short-circuiting the API function).
LibraryName -- a string pointing to the name of the library that called us.
... -- variable number argument list. These are pointers
to the actual parameters of the API functions.
Return Value:
Returns TRUE if we want to short-circuit the API function;
in other words, returning non-zero here forces the API function to return immediately before any other actions take place.
Returns FALSE if we want to proceed with the API function.
--*/
{
va_list vl; // used for variable arg-list parsing
Cstack_c* ThreadCstack; // the Cstack_c object for this thread
int Index = 0; // index into string we are creating
BOOL ReturnValue; // value to return
LPFNDTHANDLER HdlFunc; // pointer to handler function
int Counter; // counter popped off the cstack
int OriginalError; // any pending error is saved
if (!DllInitialized) {
InitializeDll();
}
if (OutputStyle == NO_OUTPUT)
return FALSE;
OriginalError = GetLastError();
EnterCriticalSection(&CrSec);
// Wait until the debug window is ready to receive text for output.
WaitForSingleObject(TextOutEvent, INFINITE);
va_start(vl, LibraryName);
// Get the Cstack_c object for this thread.
ThreadCstack = (Cstack_c*)TlsGetValue(TlsIndex);
if (!ThreadCstack) {
ThreadCstack = new Cstack_c();
TlsSetValue(TlsIndex, (LPVOID)ThreadCstack);
wsprintf(Buffer, "0x%X Foriegn thread\n", GetCurrentThreadId());
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
} //if
// Start building an output string with some info that's
// independent of which API function called us.
Index = wsprintf(Buffer, "Function call: %d ", ThreadCstack->CGetCounter());
// Push the counter & increment.
ThreadCstack->CPush();
// Reset the error to what it was when the function started.
SetLastError(OriginalError);
// Call the appropriate handling function, output the buffer.
if ((NotificationCode < MAX_DTCODE) && HdlFuncTable[NotificationCode]) {
HdlFunc = HdlFuncTable[NotificationCode];
ReturnValue = (*HdlFunc)(vl, ReturnCode, LibraryName, Buffer, Index, TEXT_LEN, TRUE);
} else {
wsprintf(Buffer + Index, "Unknown function called!\r\n");
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
ReturnValue = FALSE;
}
// If we are returning TRUE, then the API/SPI function will be
// short-circuited. We must pop the thread stack, since no
// corresponding WSAPostApiNotify will be called.
if (ReturnValue) {
ThreadCstack->CPop(Counter);
}
LeaveCriticalSection(&CrSec);
// In case the error has changed since the handler returned, we
// want to set it back.
SetLastError(OriginalError);
return(ReturnValue);
} // WSAPreApiNotify()
BOOL WINAPIV WSAPostApiNotify(IN INT NotificationCode, OUT LPVOID ReturnCode, IN LPSTR LibraryName, ...)
/*++
PostApiNotify()
Function Description:
Like PreApiNotify, builds a string and passes it,
along with information about the call, to a handler function.
Arguments:
NotificationCode -- specifies which API function called us.
ReturnCode -- a generic pointer to the return value of the API function.
... -- variable number argument list. These are pointers to the actual parameters of the API functions.
Return Value:
Returns value is currently meaningless.
--*/
{
va_list vl; // used for variable arg-list parsing
Cstack_c* ThreadCstack; // the Cstack_c object for this thread
int Index = 0; // index into string we are creating
int Counter; // counter we pop off the cstack
LPFNDTHANDLER HdlFunc; // pointer to handler function
int OriginalError; // any pending error is saved
if (!DllInitialized) {
InitializeDll();
}
if (OutputStyle == NO_OUTPUT)
return FALSE;
OriginalError = GetLastError();
EnterCriticalSection(&CrSec);
// Wait until it's ok to send output.
WaitForSingleObject(TextOutEvent, INFINITE);
va_start(vl, LibraryName);
// Get the cstack object from TLS, pop the Counter.
ThreadCstack = (Cstack_c*)TlsGetValue(TlsIndex);
if (!ThreadCstack) {
ThreadCstack = new Cstack_c();
TlsSetValue(TlsIndex, (LPVOID)ThreadCstack);
wsprintf(Buffer, "0x%X Foriegn thread\n", GetCurrentThreadId());
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
} //if
ThreadCstack->CPop(Counter);
Index = wsprintf(Buffer, "Function Call: %d ", Counter);
// Set the error to what it originally was.
SetLastError(OriginalError);
// Call the appropriate handling function, output the buffer.
if ((NotificationCode < MAX_DTCODE) && HdlFuncTable[NotificationCode]) {
HdlFunc = HdlFuncTable[NotificationCode];
(*HdlFunc)(vl, ReturnCode, LibraryName, Buffer, Index, TEXT_LEN, FALSE);
} else {
wsprintf(Buffer + Index, "Unknown function returned!\r\n");
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
}
LeaveCriticalSection(&CrSec);
// In case the error has changed since the handler returned, we
// want to set it back.
SetLastError(OriginalError);
return(FALSE);
} // WSAPostApiNotify()
LRESULT APIENTRY DTMainWndProc(IN HWND WindowHandle, IN UINT Message, IN WPARAM WParam, IN LPARAM LParam)
/*
DTMainWndProc()
Function Description:
Window procedure for the main window of the Dll.
This function processes WM_CREATE messages in order to create a child edit control,
which does most of the dirty work.
Also processes WM_COMMAND to trap notification messages from the edit control,
as well as WM_SIZE and WM_DESTROY messages.
Arguments:
WindowHandle -- the window.
Message -- the message.
WParam -- first parameter.
LParam -- second parameter.
Return Value:
Message dependent.
--*/
{
HFONT FixedFontHandle; // self-explanatory
RECT Rect; // specifies client area of frame window
DWORD CharIndex1;
DWORD CharIndex2;
DWORD LineIndex; // indices into edit control text
char NullString[] = ""; // self-explanatory
DWORD OldOutputStyle; // temporary storage for OutputStyle
switch (Message) {
case WM_CREATE:
// Create the debug window as a multiline edit control.
GetClientRect(WindowHandle, &Rect);
DebugWindow = CreateWindow("EDIT",
NULL,
WS_CHILD | WS_VISIBLE |
WS_VSCROLL | ES_LEFT |
ES_MULTILINE | ES_AUTOVSCROLL,
0,
0,
Rect.right,
Rect.bottom,
WindowHandle,
(HMENU)EC_CHILD,
DllInstHandle,
NULL);
// Subclass the edit control's window procedure to be
// DTEditWndProc.
EditWndProc = (WNDPROC)SetWindowLongPtr(DebugWindow, GWLP_WNDPROC, (UINT_PTR)DTEditWndProc);
// Set the edit control's text size to the maximum.
SendMessage(DebugWindow, EM_LIMITTEXT, 0, 0);
// Set the edit control's font
FixedFontHandle = (HFONT)GetStockObject(ANSI_FIXED_FONT);
SendMessage(DebugWindow, WM_SETFONT, (WPARAM)FixedFontHandle, MAKELPARAM(TRUE, 0));
return(0);
case WM_COMMAND:
if (LOWORD(WParam) == EC_CHILD) {
// The notification is coming from the edit-control child.
// Determine which notification it is and act appropriately.
switch (HIWORD(WParam)) {
case EN_ERRSPACE:
// Flow through
case EN_MAXTEXT:
// There's too much text in the edit control. This is
// a hack to eliminate approximately the first half of
// the text, so we can then add more...
CharIndex1 = GetWindowTextLength(DebugWindow) / 2;
LineIndex = (DWORD)SendMessage(DebugWindow, EM_LINEFROMCHAR, (WPARAM)CharIndex1, 0);
CharIndex2 = (DWORD)SendMessage(DebugWindow, EM_LINEINDEX, (WPARAM)LineIndex, 0);
SendMessage(DebugWindow, EM_SETSEL, 0, CharIndex2);
SendMessage(DebugWindow, EM_REPLACESEL, 0, (LPARAM)NullString);
// send this text to the window only...
OldOutputStyle = OutputStyle;
OutputStyle = WINDOW_ONLY;
DTTextOut(DebugWindow, LogFileHandle, "-Buffer Overflow...Resetting-\r\n", OutputStyle);
OutputStyle = OldOutputStyle;
break;
case EN_CHANGE:
case EN_UPDATE:
// Ignore these notification codes
return 0;
break;
default:
// Let the default window procedure handle it.
return DefWindowProc(WindowHandle, Message, WParam, LParam);
} // switch (HIWORD(WParam))
} // if (LOWORD(WParam) == EC_CHILD)
else {
// The notification is coming from somewhere else!!!
return DefWindowProc(WindowHandle, Message, WParam, LParam);
}
return(0);
break;
case WM_DESTROY:
PostQuitMessage(0);
return(0);
case WM_SIZE:
// Make the edit control the size of the window's client area.
MoveWindow(DebugWindow, 0, 0, LOWORD(LParam), HIWORD(LParam), TRUE);
return(0);
default:
// All other messages are taken care of by the default.
return(DefWindowProc(WindowHandle, Message, WParam, LParam));
} // switch
} // DTMainWndProc()
LRESULT APIENTRY DTEditWndProc(IN HWND WindowHandle, IN UINT Message, IN WPARAM WParam, IN LPARAM LParam)
/*++
Function Description:
Subclassed window procedure for the debug window.
This function disables some edit control functionality,
and also responds to a user-defined message to print out text in the window.
Arguments:
WindowHandle -- the window.
Message -- the message.
WParam -- first parameter.
LParam -- second parameter.
Return Value:
Message dependent.
--*/
{
switch (Message) {
case WM_CHAR:
// Handle control-c so that copy works. Sorry about the magic
// number!
if (WParam == 3) {
return (CallWindowProc(EditWndProc, WindowHandle, Message, WParam, LParam));
} // else flows through
case WM_KEYDOWN: // Flow through
case WM_UNDO: // Flow through
case WM_PASTE: // Flow through
case WM_CUT:
return (0); // Effectively disables the above messages
default:
return (CallWindowProc(EditWndProc, WindowHandle, Message, WParam, LParam));
} // switch
} // DTEditWndProc()
DWORD WindowThreadFunc(LPDWORD TheParam)
/*
Function Description:
Thread function for WindowThread created in DllMain during process attachment.
Registers a window class, creates an instance of that class,
and goes into a message loop to retrieve messages for that window or it's child edit control.
Arguments:
TheParam -- Pointer to the parameter passed in by the function that called CreateThread.
Return Value:
Returns the wParam of the quit message that forced us out of the message loop.
--*/
{
WNDCLASS wnd_class; // window class structure to register
MSG msg; // retrieved message
PINITDATA InitDataPtr; // casts TheParam into a INITDATA pointer
if ((HDesk != NULL) && (HDesk != GetThreadDesktop(GetCurrentThreadId()))) {
SetThreadDesktop(HDesk);
}
// Register a window class for the frame window.
wnd_class.style = CS_HREDRAW | CS_VREDRAW;
wnd_class.lpfnWndProc = DTMainWndProc;
wnd_class.cbClsExtra = 0;
wnd_class.cbWndExtra = 0;
wnd_class.hInstance = DllInstHandle;
wnd_class.hIcon = LoadIcon(NULL, IDI_APPLICATION);
wnd_class.hCursor = LoadCursor(NULL, IDC_ARROW);
wnd_class.hbrBackground = (HBRUSH)(COLOR_APPWORKSPACE + 1);
wnd_class.lpszMenuName = NULL;
wnd_class.lpszClassName = DTWndClass;
RegisterClass(&wnd_class);
wsprintf(Buffer, "%s - DT_DLL", ModuleFileName);
// Create a frame window
FrameWindow = CreateWindow(DTWndClass,
Buffer,
WS_OVERLAPPEDWINDOW | WS_CLIPCHILDREN | WS_VISIBLE,
CW_USEDEFAULT,
CW_USEDEFAULT,
CW_USEDEFAULT,
CW_USEDEFAULT,
NULL,
NULL,
DllInstHandle,
NULL);
// Send the initialization data to the debug window and/or file.
InitDataPtr = (PINITDATA)TheParam;
wsprintf(Buffer, "Log initiated: %d-%d-%d, %d:%d:%d\r\n",
InitDataPtr->LocalTime.wMonth,
InitDataPtr->LocalTime.wDay,
InitDataPtr->LocalTime.wYear,
InitDataPtr->LocalTime.wHour,
InitDataPtr->LocalTime.wMinute,
InitDataPtr->LocalTime.wSecond);
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
wsprintf(Buffer, "Process ID: 0x%X Thread ID: 0x%X\r\n", InitDataPtr->PID, InitDataPtr->TID);
DTTextOut(DebugWindow, LogFileHandle, Buffer, OutputStyle);
LocalFree(InitDataPtr);
// Setting this event allows {Pre|Post}ApiNotify to proceed. This
// insures (ensures? what's the difference) that any debugging
// output by other threads is held up until after this statement.
SetEvent(TextOutEvent);
// Go into a message loop.
while (GetMessage(&msg, NULL, 0, 0)) {
TranslateMessage(&msg);
DispatchMessage(&msg);
}
return((DWORD)msg.wParam);
} // WindowThreadFunc()
BOOL APIENTRY DebugDlgProc(HWND DialogWindow, UINT Message, WPARAM WParam, LPARAM LParam)
/*++
Function Description:
Window function for the dialog box IDC_DIALOG1,
the dialog box that pops up when the dll is loaded and prompts the user for the output style of his/her choice.
Arguments:
DialogWindow -- handle to the dialog box window.
Message -- the message being received.
WParam -- first parameter.
LParam -- second parameter.
Return Value:
Returns TRUE to indicate message was handled, FALSE otherwise.
--*/
{
DWORD LogFNSize = sizeof(LogFileName); // size of the file name buffer
DWORD disposition;
DWORD outputStyle = OutputStyle;
switch (Message) {
case WM_COMMAND:
switch (LOWORD(WParam)) {
case IDOK:
// The user clicked the OK button...figure out his choice
// and act appropriately.
if (IsDlgButtonChecked(DialogWindow, IDC_RADIO4)) {
outputStyle = NO_OUTPUT;
} else if (IsDlgButtonChecked(DialogWindow, IDC_RADIO5)) {
// Radio Button 1 was clicked.
if (!GetFile(DialogWindow, LogFileName, LogFNSize)) {
TCHAR strBuf[1024];
GetComdlgErrMsg(strBuf, ErrStr2);
outputStyle = WINDOW_ONLY;
// Error -- OutputStyle stays WINDOW_ONLY.
MessageBox(DialogWindow, strBuf, "Error.", MB_OK | MB_ICONSTOP);
} else {
outputStyle = FILE_ONLY;
}
} else if (IsDlgButtonChecked(DialogWindow, IDC_RADIO6)) {
// Radio Button 2 was clicked.
outputStyle = WINDOW_ONLY;
} else if (IsDlgButtonChecked(DialogWindow, IDC_RADIO7)) {
// Radio Button 3 was clicked.
if (!GetFile(DialogWindow, LogFileName, LogFNSize)) {
TCHAR strBuf[1024];
GetComdlgErrMsg(strBuf, ErrStr2);
outputStyle = WINDOW_ONLY;
// Error -- OutputStyle stays WINDOW_ONLY.
MessageBox(DialogWindow, strBuf, "Error", MB_OK | MB_ICONSTOP);
} else {
outputStyle = FILE_AND_WINDOW;
}
} else if (IsDlgButtonChecked(DialogWindow, IDC_RADIO8)) {
// Radio Button 4 was clicked.
outputStyle = DEBUGGER;
} else {
// No radio buttons were clicked -- pop up a Message box.
MessageBox(DialogWindow,
"You must choose one output method.",
"Choose or Die.",
MB_OK | MB_ICONSTOP);
break;
}
// Store setting to the registry if requested.
if (IsDlgButtonChecked(DialogWindow, IDC_CHECK)) {
DWORD rc, disposition;
HKEY hkeyAppData;
rc = RegCreateKeyEx(HKEY_LOCAL_MACHINE,
"System\\CurrentControlSet\\Services\\WinSock2\\Parameters\\DT_DLL_App_Data",
0,
NULL,
REG_OPTION_NON_VOLATILE, KEY_SET_VALUE, NULL,
&hkeyAppData,
&disposition);
if (rc == NO_ERROR) {
rc = RegSetValueEx(hkeyAppData,
ModuleFileName,
0,
REG_DWORD,
(BYTE*)&outputStyle,
sizeof(outputStyle));
RegCloseKey(hkeyAppData);
}
if (rc != NO_ERROR) {
if (FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,
NULL, rc, 0, Buffer, sizeof(Buffer), NULL) != 0) {
} else {
wsprintf(Buffer, "Error %ld.", rc);
}
MessageBox(NULL, Buffer, "Storing application settings", MB_OK | MB_ICONINFORMATION);
}
}
// flow through
case IDCANCEL:
EndDialog(DialogWindow, (int)outputStyle);
return TRUE;
}
case WM_INITDIALOG:
wsprintf(Buffer, "%s - DT_DLL", ModuleFileName);
SetWindowText(DialogWindow, Buffer);
return TRUE;
}
return FALSE;
} // DebugDlgProc()
BOOL DTTextOut(IN HWND WindowHandle, IN HANDLE FileHandle, IN char* String, DWORD Style)
/*++
Function Description:
This function outputs a string to a debug window and/or file.
Arguments:
WindowHandle -- handle to an edit control for debug output.
FileHandle -- handle to an open file for debug output.
String -- the string to output.
Style -- specifies whether the output should go to the window, the file, or both.
Return Value:
Returns TRUE if the output succeeds, FALSE otherwise.
--*/
{
DWORD NumWritten; // WriteFile takes an address to this
DWORD Index; // index of end of edit control text
BOOL Result; // result of WriteFile
char Output[TEXT_LEN + 60]; // scratch buffer
static DWORD LineCount = 0; // text output line number
DWORD BufIndex = 0; // index into output string
if (Style == NO_OUTPUT)
return TRUE;
// Build a new string with the line-number and pid.tid in front.
if (Style == DEBUGGER)
BufIndex += wsprintf(Output, "DT_DLL(%d-%X.%X @%8.8lX) ",
LineCount++,
GetCurrentProcessId(),
GetCurrentThreadId(),
GetTickCount());
else
BufIndex += wsprintf(Output,
"(%d-%X.%X @%8.8lX) ",
LineCount++,
GetCurrentProcessId(),
GetCurrentThreadId(),
GetTickCount());
strcpy(Output + BufIndex, String);
switch (Style) {
case WINDOW_ONLY:
Index = GetWindowTextLength(WindowHandle);
SendMessage(WindowHandle, EM_SETSEL, Index, Index);
SendMessage(WindowHandle, EM_REPLACESEL, 0, (LPARAM)Output);
break;
case FILE_ONLY:
Result = WriteFile(FileHandle, (LPCVOID)Output, strlen(Output), &NumWritten, NULL);
if (!Result) {
AbortAndClose(FileHandle, WindowHandle);
return FALSE;
}
break;
case FILE_AND_WINDOW:
Index = GetWindowTextLength(WindowHandle);
SendMessage(WindowHandle, EM_SETSEL, Index, Index);
SendMessage(WindowHandle, EM_REPLACESEL, 0, (LPARAM)Output);
Result = WriteFile(FileHandle, (LPCVOID)Output, strlen(Output), &NumWritten, NULL);
if (!Result) {
AbortAndClose(FileHandle, WindowHandle);
return FALSE;
}
break;
case DEBUGGER:
OutputDebugString(Output);
}
return TRUE;
} // DTTextOut()
void AbortAndClose(IN HANDLE FileHandle, IN HWND WindowHandle)
/*
Function Description:
Closes a file handle, informs the user via a message box,
and changes the global variable OutputStyle to WINDOW_ONLY
Arguments:
FileHandle -- handle to a file that caused the error.
WindowHandle -- handle to a window to be the parent of the Message Box.
--*/
{
CloseHandle(FileHandle);
MessageBox(WindowHandle, ErrStr3, "Error", MB_OK | MB_ICONSTOP);
OutputStyle = DEBUGGER;
} // AbortAndClose()
BOOL GetFile(IN HWND OwnerWindow, OUT LPSTR FileName, IN DWORD FileNameSize)
/*
Function Description:
Uses the predefined "Save As" dialog box style to retrieve a file name from the user.
The file name the user selects is stored in LogFileName.
Arguments:
OwnerWindow -- window which will own the dialog box.
FileName -- address of a buffer in which to store the string.
FileNameSize -- size of the FileName buffer.
Return Value:
Returns whatever GetSaveFileName returns; see documentation for that function.
--*/
{
OPENFILENAME OpenFileName; // common dialog box structure
char DirName[256]; // directory string
char FileTitle[256]; // file-title string
FileName[0] = '\0';
FillMemory((PVOID)&OpenFileName, sizeof(OPENFILENAME), 0);
// Retrieve the system directory name and store it in DirName.
GetCurrentDirectory(sizeof(DirName), DirName);
// Set the members of the OPENFILENAME structure.
#if (_WIN32_WINNT >= 0x0500)
if (LOBYTE(LOWORD(GetVersion())) < 5)
OpenFileName.lStructSize = OPENFILENAME_SIZE_VERSION_400;
else
#endif
OpenFileName.lStructSize = sizeof(OpenFileName);
OpenFileName.hwndOwner = OwnerWindow;
OpenFileName.lpstrFilter = OpenFileName.lpstrCustomFilter = NULL;
OpenFileName.nFilterIndex = 0;
OpenFileName.lpstrFile = FileName;
OpenFileName.nMaxFile = FileNameSize;
OpenFileName.lpstrFileTitle = FileTitle;
OpenFileName.nMaxFileTitle = sizeof(FileTitle);
OpenFileName.lpstrInitialDir = DirName;
OpenFileName.Flags = OFN_SHOWHELP | OFN_OVERWRITEPROMPT;
// Pop up the dialog box to get the file name.
return GetSaveFileName(&OpenFileName);
} // GetFile()
VOID GetComdlgErrMsg(LPTSTR Buffer, LPTSTR Fmt)
{
LPTSTR str;
DWORD err;
TCHAR numBuf[256];
switch (err = CommDlgExtendedError()) {
case 0:
str = sCDERR_USERCANCEL;
break;
case CDERR_FINDRESFAILURE:
str = sCDERR_FINDRESFAILURE;
break;
case CDERR_INITIALIZATION:
str = sCDERR_INITIALIZATION;
break;
case CDERR_LOCKRESFAILURE:
str = sCDERR_LOCKRESFAILURE;
break;
case CDERR_LOADRESFAILURE:
str = sCDERR_LOADRESFAILURE;
break;
case CDERR_LOADSTRFAILURE:
str = sCDERR_LOADSTRFAILURE;
break;
case CDERR_MEMALLOCFAILURE:
str = sCDERR_MEMALLOCFAILURE;
break;
case CDERR_MEMLOCKFAILURE:
str = sCDERR_MEMLOCKFAILURE;
break;
case CDERR_NOHINSTANCE:
str = sCDERR_NOHINSTANCE;
break;
case CDERR_NOHOOK:
str = sCDERR_NOHOOK;
break;
case CDERR_NOTEMPLATE:
str = sCDERR_NOTEMPLATE;
break;
case CDERR_STRUCTSIZE:
str = sCDERR_STRUCTSIZE;
break;
case FNERR_BUFFERTOOSMALL:
str = sFNERR_BUFFERTOOSMALL;
break;
case FNERR_INVALIDFILENAME:
str = sFNERR_INVALIDFILENAME;
break;
case FNERR_SUBCLASSFAILURE:
str = sFNERR_SUBCLASSFAILURE;
break;
default:
wsprintf(numBuf, "Unknown common dialog error: %ld", err);
str = numBuf;
break;
}
wsprintf(Buffer, Fmt, str);
} | [
"112426112@qq.com"
] | 112426112@qq.com |
35fef0512b9d7261fd1699af9a8a57a34b36d5d1 | e50ac350b6ea75ea728074e173a0450afda05318 | /ACM/Prictise/CodeForces/Educational Codeforces Round 74 (Rated for Div. 2)/C - Standard Free2play.cpp | ac006442181697a1f0dbc3155191cbeab0acec47 | [] | no_license | G-CR/acm-solution | 9cd95e4a6d6d25937a7295364e52fa70af4b3731 | 7026428ed5a2f7afd6785a922e1d8767226a05e8 | refs/heads/master | 2021-07-23T14:30:18.107128 | 2021-07-15T14:54:57 | 2021-07-15T14:54:57 | 226,522,759 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 463 | cpp | #include <bits/stdc++.h>
using namespace std;
int q;
long long h,n,a[200005];
int main() {
scanf("%d", &q);
while(q--) {
scanf("%lld %lld", &h, &n);
for(int i = 1;i <= n; i++) {
scanf("%lld", &a[i]);
}
int ans = 0;
for(int i = 1;i <= n;) {
if(i == n) break;
if(i == n-1){
if(a[n] > 1) {
ans++;
}
break;
}
if(a[i+1] - a[i+2] == 1) {
i+=2;
} else {
i++;
ans++;
}
}
printf("%d\n", ans);
}
} | [
"47514055+O-Bus@users.noreply.github.com"
] | 47514055+O-Bus@users.noreply.github.com |
ccda1f3c9ca8662f82eb45637b14d4c2409b2cbd | f79dec3c4033ca3cbb55d8a51a748cc7b8b6fbab | /multimedia/subtitleeditor/patches/patch-plugins_subtitleformats_substationalpha_substationalpha.cc | fc8e83503b8e1bcdf90fc47a0b2674cd4797a0c8 | [] | no_license | jsonn/pkgsrc | fb34c4a6a2d350e8e415f3c4955d4989fcd86881 | c1514b5f4a3726d90e30aa16b0c209adbc276d17 | refs/heads/trunk | 2021-01-24T09:10:01.038867 | 2017-07-07T15:49:43 | 2017-07-07T15:49:43 | 2,095,004 | 106 | 47 | null | 2016-09-19T09:26:01 | 2011-07-23T23:49:04 | Makefile | UTF-8 | C++ | false | false | 451 | cc | $NetBSD: patch-plugins_subtitleformats_substationalpha_substationalpha.cc,v 1.1 2011/12/05 22:53:45 joerg Exp $
--- plugins/subtitleformats/substationalpha/substationalpha.cc.orig 2011-12-05 21:10:29.000000000 +0000
+++ plugins/subtitleformats/substationalpha/substationalpha.cc
@@ -23,6 +23,7 @@
#include <extension/subtitleformat.h>
#include <utility.h>
#include <iomanip>
+#include <cstdio>
class SubStationAlpha : public SubtitleFormatIO
| [
"joerg"
] | joerg |
2e3dd29dfbf7b19f37e1a03c2d30a73a9310837d | aedb5d78cbe6acaf9becea0ea7b43c46a9584f5e | /framework/core/pluginmanager/mailbox/abstractmailbox.h | 93a654bb85bae562db7439cef4009fcab801db03 | [] | no_license | wey580231/Framewrok | 60a922d4cc868b0d0b7f87a529eab2724ca3c18f | 1050b079997a975dcc7b64e1bfa5eb8acb72d8c4 | refs/heads/develop | 2023-03-15T04:36:18.608430 | 2021-03-23T14:30:51 | 2021-03-23T14:30:51 | 326,935,482 | 0 | 1 | null | 2021-03-23T14:30:52 | 2021-01-05T08:31:30 | C++ | UTF-8 | C++ | false | false | 1,262 | h | /*!
* @brief 通信数据邮箱
* @details 本系统将网络数据、插件间信息、系统信息转换成统一数据格式PluginMessage(邮件);
* 1.系统拥有全局邮箱用于系统<->插件、插件<->插件间数据通信；
* 2.每个插件拥有数据自己的接收邮箱；
* 在传递数据时，将产生的邮件投递至接全局邮箱，由全局邮箱根据目的地投递至接收方的邮箱内
* @author wey
* @version 1.0
* @date 2019.01.18
* @warning
* @copyright NanJing RenGu.
* @note
*/
#ifndef ABSTRACTMAILBOX_H
#define ABSTRACTMAILBOX_H
#include <base/util/rblockingqueue.h>
#include "core/network/rtask.h"
#include "core/protocol/datastruct.h"
namespace Core{
class AbstractMailBox : public RTask
{
Q_OBJECT
public:
explicit AbstractMailBox(QObject * parent = 0);
virtual ~AbstractMailBox();
virtual void recvMail(Datastruct::PluginMessage *mail,Base::ElementPriority pty = Base::NormalPriority) = 0;
void startMe();
void stopMe();
protected:
typedef QQueue<Datastruct::PluginMessage * > MailBox;
Base::RBlockingQueque<Datastruct::PluginMessage *> m_recvMailBox;
};
} //namespace Core
#endif // ABSTRACTMAILBOX_H
| [
"407859345@qq.com"
] | 407859345@qq.com |
f7a98f76ef2362853c1d99fba1541f1c1f971ce5 | 3ea829b5ad3cf1cc9e6eb9b208532cf57b7ba90f | /obsoletes/VPVM/src/widgets/ScenePlayer.cc | e2fe16dc6e01118332303533f62559db54cf27d4 | [] | no_license | hkrn/MMDAI | 2ae70c9be7301e496e9113477d4a5ebdc5dc0a29 | 9ca74bf9f6f979f510f5355d80805f935cc7e610 | refs/heads/master | 2021-01-18T21:30:22.057260 | 2016-05-10T16:30:41 | 2016-05-10T16:30:41 | 1,257,502 | 74 | 22 | null | 2013-07-13T21:28:16 | 2011-01-15T12:05:26 | C++ | UTF-8 | C++ | false | false | 8,426 | cc | /**
Copyright (c) 2010-2013 hkrn
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 MMDAI project team nor the names of
its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#include "ScenePlayer.h"
#include "SceneLoader.h"
#include "SceneWidget.h"
#include "PlaySettingDialog.h"
#include <vpvl2/vpvl2.h>
#include <vpvl2/extensions/AudioSource.h>
#include <QApplication>
namespace vpvm
{
using namespace vpvl2;
ScenePlayer::ScenePlayer(SceneWidget *sceneWidget, const PlaySettingDialog *dialog, QObject *parent)
: QObject(parent),
m_dialogRef(dialog),
m_audioSource(new AudioSource()),
m_sceneWidgetRef(sceneWidget),
m_format(QApplication::tr("Playing scene frame %1 of %2...")),
m_prevSceneFPS(0),
m_lastCurrentTimeIndex(0),
m_restoreState(false),
m_cancelled(false)
{
}
ScenePlayer::~ScenePlayer()
{
}
void ScenePlayer::start()
{
if (isActive()) {
return;
}
float sceneFPS = m_dialogRef->sceneFPS();
SceneLoader *loader = m_sceneWidgetRef->sceneLoaderRef();
Scene *scene = loader->sceneRef();
m_selectedModelRef = loader->selectedModelRef();
m_prevSceneFPS = scene->preferredFPS();
m_lastCurrentTimeIndex = m_sceneWidgetRef->currentTimeIndex();
/* 再生用のタイマーからのみレンダリングを行わせるため、SceneWidget のタイマーを止めておく */
m_sceneWidgetRef->stopAutomaticRendering();
/* FPS を設定してから物理エンジンを有効にする(FPS設定を反映させるため) */
m_sceneWidgetRef->setPreferredFPS(sceneFPS);
loader->startPhysicsSimulation();
/* 場面を開始位置にシーク */
m_sceneWidgetRef->resetMotion();
m_sceneWidgetRef->seekMotion(m_dialogRef->fromIndex(), true, true);
/* ハンドルも情報パネルも消す */
m_sceneWidgetRef->setHandlesVisible(false);
m_sceneWidgetRef->setInfoPanelVisible(false);
m_sceneWidgetRef->setBoneWireFramesVisible(m_dialogRef->isBoneWireframesVisible());
if (!m_dialogRef->isModelSelected()) {
m_sceneWidgetRef->revertSelectedModel();
}
/* 進捗ダイアログ作成 */
emit playerDidPlay(tr("Playing scene"), true);
/* 音声出力準備 */
const QString &backgroundAudio = loader->backgroundAudio();
if (!backgroundAudio.isEmpty()) {
if (!m_audioSource->isLoaded() && !m_audioSource->load(backgroundAudio.toUtf8().constData())) {
qWarning("Cannot load audio file %s: %s", qPrintable(backgroundAudio), m_audioSource->errorString());
}
else if (!m_audioSource->play()) {
qWarning("Cannot play audio file %s: %s", qPrintable(backgroundAudio), m_audioSource->errorString());
}
}
/* 再生用タイマー起動 */
m_timeHolder.setUpdateInterval(btSelect(quint32(sceneFPS), sceneFPS / 1.0f, 60.0f));
m_timeHolder.start();
m_updateTimer.start(int(btSelect(quint32(sceneFPS), 1000.0f / sceneFPS, 0.0f)), this);
emit renderFrameDidStart();
}
void ScenePlayer::stop()
{
/* タイマーと音声出力オブジェクトの停止 */
m_audioSource->stop();
m_updateTimer.stop();
emit playerDidStop();
/* ハンドルと情報パネルを復帰させる */
m_sceneWidgetRef->setHandlesVisible(true);
m_sceneWidgetRef->setInfoPanelVisible(true);
m_sceneWidgetRef->setBoneWireFramesVisible(true);
m_sceneWidgetRef->setSelectedModel(m_selectedModelRef, SceneWidget::kSelect);
/* 再生が終わったら物理を無効にする */
m_sceneWidgetRef->sceneLoaderRef()->stopPhysicsSimulation();
m_sceneWidgetRef->resetMotion();
m_sceneWidgetRef->setPreferredFPS(m_prevSceneFPS);
/* フレーム位置を再生前に戻す */
m_sceneWidgetRef->seekMotion(m_lastCurrentTimeIndex, true, true);
/* SceneWidget を常時レンダリング状態に戻しておく */
m_sceneWidgetRef->startAutomaticRendering();
m_counter.reset();
m_cancelled = false;
if (m_restoreState) {
m_restoreState = false;
emit renderFrameDidStopAndRestoreState();
}
else {
emit renderFrameDidStop();
}
}
bool ScenePlayer::isActive() const
{
return m_updateTimer.isActive();
}
void ScenePlayer::timerEvent(QTimerEvent * /* event */)
{
int64 elapsed = 0;
if (m_audioSource->isRunning()) {
double offset, latency;
m_audioSource->getOffsetLatency(offset, latency);
elapsed = qRound64(offset + latency);
}
/*
* 現在の経過時間位置を保存し、timeIndex/delta が返す値が呼び出し毎に変わらないようにする
* また、現在の経過時間位置より音源の現在の再生位置が大きい場合は音源の位置を採用するように調整する
*/
m_timeHolder.saveElapsed(elapsed);
renderScene(m_timeHolder.timeIndex());
emit renderFrameDidUpdate(m_timeHolder.delta());
}
void ScenePlayer::cancel()
{
m_cancelled = true;
}
void ScenePlayer::renderScene(const IKeyframe::TimeIndex &timeIndex)
{
Scene *scene = m_sceneWidgetRef->sceneLoaderRef()->sceneRef();
bool isReached = scene->isReachedTo(m_dialogRef->toIndex());
/* 再生完了かつループではない、またはユーザによってキャンセルされた場合再生用のタイマーイベントを終了する */
if ((!m_dialogRef->isLoopEnabled() && isReached) || m_cancelled) {
stop();
}
else {
int fromIndex = m_dialogRef->fromIndex(), value = fromIndex;
if (isReached) {
/* ループする場合はモーションと物理演算をリセットしてから開始位置に移動する */
SceneLoader *loader = m_sceneWidgetRef->sceneLoaderRef();
loader->stopPhysicsSimulation();
m_sceneWidgetRef->resetMotion();
m_sceneWidgetRef->seekMotion(value, true, true);
loader->startPhysicsSimulation();
m_timeHolder.reset();
}
else {
/* 開始位置に現在のフレーム値を加算してモーションをシークする */
value += timeIndex;
m_sceneWidgetRef->seekMotion(value, true, true);
}
/* FPS とウィンドウのタイトルと物理演算をシグナル経由で更新する */
bool flushed;
m_counter.update(m_timeHolder.elapsed(), flushed);
int toIndex = m_dialogRef->toIndex() - fromIndex,
currentFPS = qMin(m_counter.value(), int(m_dialogRef->sceneFPS()));
emit playerDidUpdate(value - fromIndex, toIndex, m_format.arg(int(timeIndex)).arg(toIndex));
emit playerDidUpdateTitle(tr("Current FPS: %1")
.arg(currentFPS > 0 ? QVariant(currentFPS).toString() : "N/A"));
/* 音源のバッファを更新する（OpenAL+ALURE の特性上定期的に呼び出さないといけない） */
m_audioSource->update();
if (m_dialogRef->isModelSelected()) {
emit motionDidSeek(value);
}
}
}
} /* namespace vpvm */
| [
"hikarin.jp@gmail.com"
] | hikarin.jp@gmail.com |
89348d855876f812f9a1063eccdc5ce3e07cbc48 | b58cb2c1f8dd04edf29e37d4a12d086a48c4cff7 | /src/gui/Application/DataWidgets/FieldDataWidget.cpp | ad512704a76deaa070b1086ce97850961c8638ec | [] | no_license | SCIInstitute/cleaver2-cuda | 210c9695f9fb677d4f752b6e14fdec0e25058fe7 | b3e05aa1365d6dfdd506a09330095ed3c3c6259f | refs/heads/master | 2020-04-13T02:50:03.625950 | 2016-08-08T18:36:56 | 2016-08-08T18:36:56 | 20,309,814 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,652 | cpp | #include "FieldDataWidget.h"
#include "ui_FieldDataWidget.h"
#include <sstream>
#include "MainWindow.h"
#include <Cleaver/ScalarField.h>
#include <Cleaver/BoundingBox.h>
FieldDataWidget::FieldDataWidget(QWidget *parent) :
QWidget(parent),
ui(new Ui::FieldDataWidget),
field(NULL)
{
ui->setupUi(this);
this->ui->infoWidget->hide();
QObject::connect(this->ui->detailViewButton, SIGNAL(clicked(bool)),
this, SLOT(showInfoClicked(bool)));
openStyle =
"QWidget { background-color:rgb(177, 177, 177); \n"
" border: 1px solid black;\n "
" border-top-left-radius: 10px;\n "
" border-top-right-radius: 10px;\n "
" } ";
closedStyle =
"QWidget { background-color:rgb(177, 177, 177); \n"
" border: 1px solid black;\n "
" border-top-left-radius: 10px;\n "
" border-top-right-radius: 10px;\n\n\n "
" border-bottom-left-radius: 10px;\n "
" border-bottom-right-radius: 10px;\n "
" } ";
ui->headerWidget->setStyleSheet(closedStyle.c_str());
selected = false;
open = false;
}
FieldDataWidget::FieldDataWidget(Cleaver::AbstractScalarField *field, QWidget *parent) :
QWidget(parent),
ui(new Ui::FieldDataWidget),
field(field)
{
ui->setupUi(this);
ui->dimensionsWidget->layout()->setMargin(0);
ui->dimensionsWidget->layout()->setSpacing(4);
ui->originWidget->layout()->setMargin(0);
ui->originWidget->layout()->setSpacing(4);
ui->spacingWidget->layout()->setMargin(0);
ui->spacingWidget->layout()->setSpacing(4);
ui->infoWidget->layout()->setMargin(4);
ui->infoWidget->layout()->setSpacing(4);
this->ui->infoWidget->hide();
//QObject::connect(this->ui->infoButton, SIGNAL(clicked(bool)),
// this, SLOT(showInfoClicked(bool)));
QObject::connect(this->ui->detailViewButton, SIGNAL(clicked(bool)),
this, SLOT(showInfoClicked(bool)));
//-------------------------------------------------//
// Construct The Styles //
//-------------------------------------------------//
openStyle =
"QWidget { background-color:rgb(177, 177, 177); \n"
" border: 1px solid black;\n "
" border-top-left-radius: 10px;\n "
" border-top-right-radius: 10px;\n "
" } ";
closedStyle =
"QWidget { background-color:rgb(177, 177, 177); \n"
" border: 1px solid black;\n "
" border-top-left-radius: 10px;\n "
" border-top-right-radius: 10px;\n\n\n "
" border-bottom-left-radius: 10px;\n "
" border-bottom-right-radius: 10px;\n "
" } ";
selectedOpenStyle =
//"QWidget { background-color:rgb(109, 124, 152); \n"
"QWidget { background-color:rgb(137, 156, 191); \n"
" border: 1px solid black;\n "
" border-top-left-radius: 10px;\n "
" border-top-right-radius: 10px;\n "
" } ";
selectedClosedStyle =
//"QWidget { background-color:rgb(109, 124, 152); \n"
"QWidget { background-color:rgb(137, 156, 191); \n"
" border: 1px solid black;\n "
" border-top-left-radius: 10px;\n "
" border-top-right-radius: 10px;\n\n\n "
" border-bottom-left-radius: 10px;\n "
" border-bottom-right-radius: 10px;\n "
" } ";
normalInfoStyle =
"QWidget { background-color: rgb(228, 228, 228);"
" border: 1px solid black; "
" border-top: none; "
" border-bottom-left-radius: 10px; "
#ifdef __APPLE__
" font-size: 13; "
#endif
" border-bottom-right-radius: 10px; "
" } ";
selectedInfoStyle =
"QWidget { background-color: rgb(205, 220, 255);"
" border: 1px solid black; "
" border-top: none; "
" border-bottom-left-radius: 10px; "
" border-bottom-right-radius: 10px; "
" } ";
ui->headerWidget->setStyleSheet(closedStyle.c_str());
//-------------------------------------------------//
// Set Widget Title //
//-------------------------------------------------//
setTitle(field->name());
//-------------------------------------------------//
// Set Dimensions Label //
//-------------------------------------------------//
std::stringstream ss;
ss << "[" << field->bounds().size.x << ", " << field->bounds().size.y << ", " << field->bounds().size.z << "]";
std::string dimensionsString = ss.str();
ui->dimensionsValueLabel->setText(dimensionsString.c_str());
//-------------------------------------------------//
// Set Spacing Label //
//-------------------------------------------------//
Cleaver::FloatField *floatField = dynamic_cast<Cleaver::FloatField*>(field);
ss.clear();
ss.str("");
if(floatField)
ss << floatField->scale().toString();
else
ss << "Custom";
std::string spacingString = ss.str();
ui->spacingValueLabel->setText(spacingString.c_str());
selected = false;
open = false;
}
FieldDataWidget::~FieldDataWidget()
{
delete ui;
}
void FieldDataWidget::showInfoClicked(bool checked)
{
open = checked;
updateStyleSheet();
if(checked)
ui->infoWidget->show();
else
ui->infoWidget->hide();
}
void FieldDataWidget::setSelected(bool value)
{
selected = value;
updateStyleSheet();
}
void FieldDataWidget::setDataName(const QString &name)
{
field->setName(std::string(name.toLatin1()));
MainWindow::dataManager()->update();
}
void FieldDataWidget::setTitle(const std::string &title)
{
ui->dataLabel->setText(title.c_str());
}
void FieldDataWidget::updateStyleSheet()
{
if(!open)
{
// update header
if(selected)
ui->headerWidget->setStyleSheet(selectedClosedStyle.c_str());
else
ui->headerWidget->setStyleSheet(closedStyle.c_str());
}
else{
if(selected)
{
// update header
ui->headerWidget->setStyleSheet(selectedOpenStyle.c_str());
// update info
ui->infoWidget->setStyleSheet(selectedInfoStyle.c_str());
}
else
{
// update header
ui->headerWidget->setStyleSheet(openStyle.c_str());
// update info
ui->infoWidget->setStyleSheet(normalInfoStyle.c_str());
}
}
}
//============================================
// Event Handlers
//============================================
void FieldDataWidget::mouseDoubleClickEvent(QMouseEvent *event)
{
if(!event->modifiers().testFlag(Qt::ControlModifier))
ui->detailViewButton->click();
}
void FieldDataWidget::mousePressEvent(QMouseEvent *event)
{
if (event->button() == Qt::LeftButton)
{
if(event->modifiers().testFlag(Qt::ControlModifier))
MainWindow::dataManager()->toggleAddSelection(reinterpret_cast<ulong>(field));
else
MainWindow::dataManager()->setSelection(reinterpret_cast<ulong>(field));
updateStyleSheet();
}
else if(event->button() == Qt::RightButton)
{
QMenu contextMenu;
QAction *exportAction = contextMenu.addAction("Export Field");
QAction *deleteAction = contextMenu.addAction("Delete Field");
QAction *renameAction = contextMenu.addAction("Rename Field");
Cleaver::FloatField *floatField = dynamic_cast<Cleaver::FloatField*>(field);
if(!floatField)
exportAction->setDisabled(true);
QAction *selectedItem = contextMenu.exec(mapToGlobal(event->pos()));
if(selectedItem)
{
if(selectedItem == deleteAction){
MainWindow::dataManager()->removeField(field);
}
else if(selectedItem == renameAction){
QDialog dialog;
dialog.setWindowTitle("Rename Field");
dialog.resize(250,30);
QVBoxLayout layout(&dialog);
layout.setMargin(0);
QLineEdit lineEdit;
lineEdit.setText(ui->dataLabel->text());
lineEdit.resize(ui->dataLabel->size().width(), ui->headerWidget->width() - 55);
layout.addWidget(&lineEdit);
QObject::connect(&lineEdit, SIGNAL(returnPressed()), &dialog, SLOT(accept()));
if(dialog.exec() == QDialog::Accepted){
field->setName(std::string(lineEdit.text().toLatin1()));
ui->dataLabel->setText(lineEdit.text());
MainWindow::dataManager()->update();
}
}
else if(selectedItem == exportAction){
Cleaver::FloatField *floatField = dynamic_cast<Cleaver::FloatField*>(field);
if(!floatField)
{
// give error
}
MainWindow::instance()->exportField(floatField);
}
}
else
{
std::cout << "Canceled" << std::endl;
}
}
}
void FieldDataWidget::mouseReleaseEvent(QMouseEvent *event)
{
}
void FieldDataWidget::mouseMoveEvent(QMouseEvent *event)
{
quint64 field_ptr = reinterpret_cast<quint64>(field);
QByteArray itemData;
QDataStream dataStream(&itemData, QIODevice::WriteOnly);
dataStream << field_ptr;
QMimeData *mimeData = new QMimeData;
mimeData->setData("data/scalar-field", itemData);
QDrag *drag = new QDrag(this);
drag->setMimeData(mimeData);
QPixmap pixmap(this->size());
this->render(&pixmap); // offset, region);
drag->setPixmap(pixmap);
Qt::DropAction dropAction = drag->exec();
}
void FieldDataWidget::startDrag(Qt::DropActions /*supportedActions*/)
{
std::cout << "HAHAHA" << std::endl;
}
| [
"brig@sci.utah.edu"
] | brig@sci.utah.edu |
9cc85554ba1097547d62b490d8ca502018261e82 | 6d77e738c66bdf8809e47ad9be85f9c7361a1bd9 | /src/server/scripts/Northrend/zone_dalaran.cpp | f198b600a2c4b2e112f9c4fc5814fea2d45dc3bf | [] | no_license | Ramys/Hooaahcore | e768e8b8a2b2c1dba7501495161cf6c0419b9de2 | dad11ee863d34a9f02186936b1dbbca168912ecd | refs/heads/main | 2023-02-27T16:18:27.916812 | 2021-02-07T23:38:52 | 2021-02-07T23:38:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,569 | cpp | /*
* Copyright (C) 2021 Hooaahcore
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/* Script Data Start
SDName: Dalaran
SDAuthor: WarHead, MaXiMiUS
SD%Complete: 99%
SDComment: For what is 63990+63991? Same function but don't work correct...
SDCategory: Dalaran
Script Data End */
#include "ScriptMgr.h"
#include "DatabaseEnv.h"
#include "Mail.h"
#include "Map.h"
#include "MotionMaster.h"
#include "ScriptedCreature.h"
#include "ScriptedGossip.h"
#include "Player.h"
/*******************************************************
* npc_mageguard_dalaran
*******************************************************/
enum Spells
{
SPELL_TRESPASSER_A = 54028,
SPELL_TRESPASSER_H = 54029,
SPELL_SUNREAVER_DISGUISE_FEMALE = 70973,
SPELL_SUNREAVER_DISGUISE_MALE = 70974,
SPELL_SILVER_COVENANT_DISGUISE_FEMALE = 70971,
SPELL_SILVER_COVENANT_DISGUISE_MALE = 70972,
};
enum NPCs // All outdoor guards are within 35.0f of these NPCs
{
NPC_APPLEBOUGH_A = 29547,
NPC_SWEETBERRY_H = 29715,
NPC_SILVER_COVENANT_GUARDIAN_MAGE = 29254,
NPC_SUNREAVER_GUARDIAN_MAGE = 29255,
};
class npc_mageguard_dalaran : public CreatureScript
{
public:
npc_mageguard_dalaran() : CreatureScript("npc_mageguard_dalaran") { }
struct npc_mageguard_dalaranAI : public ScriptedAI
{
npc_mageguard_dalaranAI(Creature* creature) : ScriptedAI(creature)
{
creature->AddUnitFlag(UNIT_FLAG_NON_ATTACKABLE);
creature->ApplySpellImmune(0, IMMUNITY_DAMAGE, SPELL_SCHOOL_NORMAL, true);
creature->ApplySpellImmune(0, IMMUNITY_DAMAGE, SPELL_SCHOOL_MASK_MAGIC, true);
}
void Reset() override { }
void EnterCombat(Unit* /*who*/) override { }
void AttackStart(Unit* /*who*/) override { }
void MoveInLineOfSight(Unit* who) override
{
if (!who || !who->IsInWorld() || who->GetZoneId() != ZONE_DALARAN_WOTLK)
return;
if (!me->IsWithinDist(who, 65.0f, false))
return;
Player* player = who->GetCharmerOrOwnerPlayerOrPlayerItself();
if (!player || player->IsGameMaster() || player->IsBeingTeleported() ||
// If player has Disguise aura for quest A Meeting With The Magister or An Audience With The Arcanist, do not teleport it away but let it pass
player->HasAura(SPELL_SUNREAVER_DISGUISE_FEMALE) || player->HasAura(SPELL_SUNREAVER_DISGUISE_MALE) ||
player->HasAura(SPELL_SILVER_COVENANT_DISGUISE_FEMALE) || player->HasAura(SPELL_SILVER_COVENANT_DISGUISE_MALE))
return;
switch (me->GetEntry())
{
case NPC_SILVER_COVENANT_GUARDIAN_MAGE:
if (player->GetTeam() == HORDE) // Horde unit found in Alliance area
{
if (GetClosestCreatureWithEntry(me, NPC_APPLEBOUGH_A, 32.0f))
{
if (me->isInBackInMap(who, 12.0f)) // In my line of sight, "outdoors", and behind me
DoCast(who, SPELL_TRESPASSER_A); // Teleport the Horde unit out
}
else // In my line of sight, and "indoors"
DoCast(who, SPELL_TRESPASSER_A); // Teleport the Horde unit out
}
break;
case NPC_SUNREAVER_GUARDIAN_MAGE:
if (player->GetTeam() == ALLIANCE) // Alliance unit found in Horde area
{
if (GetClosestCreatureWithEntry(me, NPC_SWEETBERRY_H, 32.0f))
{
if (me->isInBackInMap(who, 12.0f)) // In my line of sight, "outdoors", and behind me
DoCast(who, SPELL_TRESPASSER_H); // Teleport the Alliance unit out
}
else // In my line of sight, and "indoors"
DoCast(who, SPELL_TRESPASSER_H); // Teleport the Alliance unit out
}
break;
}
return;
}
void UpdateAI(uint32 /*diff*/) override { }
};
CreatureAI* GetAI(Creature* creature) const override
{
return new npc_mageguard_dalaranAI(creature);
}
};
enum MinigobData
{
SPELL_MANABONKED = 61834,
SPELL_TELEPORT_VISUAL = 51347,
SPELL_IMPROVED_BLINK = 61995,
EVENT_SELECT_TARGET = 1,
EVENT_BLINK = 2,
EVENT_DESPAWN_VISUAL = 3,
EVENT_DESPAWN = 4,
MAIL_MINIGOB_ENTRY = 264,
MAIL_DELIVER_DELAY_MIN = 5*MINUTE,
MAIL_DELIVER_DELAY_MAX = 15*MINUTE
};
class npc_minigob_manabonk : public CreatureScript
{
public:
npc_minigob_manabonk() : CreatureScript("npc_minigob_manabonk") {}
struct npc_minigob_manabonkAI : public ScriptedAI
{
npc_minigob_manabonkAI(Creature* creature) : ScriptedAI(creature)
{
me->setActive(true);
}
void Reset() override
{
me->SetVisible(false);
events.ScheduleEvent(EVENT_SELECT_TARGET, IN_MILLISECONDS);
}
Player* SelectTargetInDalaran()
{
std::vector<Player*> PlayerInDalaranList;
PlayerInDalaranList.clear();
Map::PlayerList const &players = me->GetMap()->GetPlayers();
for (Map::PlayerList::const_iterator itr = players.begin(); itr != players.end(); ++itr)
if (Player* player = itr->GetSource()->ToPlayer())
if (player->GetZoneId() == ZONE_DALARAN_WOTLK && !player->IsFlying() && !player->IsMounted() && !player->IsGameMaster())
PlayerInDalaranList.push_back(player);
if (PlayerInDalaranList.empty())
return nullptr;
return Trinity::Containers::SelectRandomContainerElement(PlayerInDalaranList);
}
void SendMailToPlayer(Player* player)
{
CharacterDatabaseTransaction trans = CharacterDatabase.BeginTransaction();
int16 deliverDelay = irand(MAIL_DELIVER_DELAY_MIN, MAIL_DELIVER_DELAY_MAX);
MailDraft(MAIL_MINIGOB_ENTRY, true).SendMailTo(trans, MailReceiver(player), MailSender(MAIL_CREATURE, uint64(me->GetEntry())), MAIL_CHECK_MASK_NONE, deliverDelay);
CharacterDatabase.CommitTransaction(trans);
}
void UpdateAI(uint32 diff) override
{
events.Update(diff);
while (uint32 eventId = events.ExecuteEvent())
{
switch (eventId)
{
case EVENT_SELECT_TARGET:
me->SetVisible(true);
DoCast(me, SPELL_TELEPORT_VISUAL);
if (Player* player = SelectTargetInDalaran())
{
me->NearTeleportTo(player->GetPositionX(), player->GetPositionY(), player->GetPositionZ(), 0.0f);
DoCast(player, SPELL_MANABONKED);
SendMailToPlayer(player);
}
events.ScheduleEvent(EVENT_BLINK, 3*IN_MILLISECONDS);
break;
case EVENT_BLINK:
{
DoCast(me, SPELL_IMPROVED_BLINK);
Position pos = me->GetRandomNearPosition(frand(15, 40));
me->GetMotionMaster()->MovePoint(0, pos.m_positionX, pos.m_positionY, pos.m_positionZ);
events.ScheduleEvent(EVENT_DESPAWN, 3 * IN_MILLISECONDS);
events.ScheduleEvent(EVENT_DESPAWN_VISUAL, 2.5*IN_MILLISECONDS);
break;
}
case EVENT_DESPAWN_VISUAL:
DoCast(me, SPELL_TELEPORT_VISUAL);
break;
case EVENT_DESPAWN:
me->DespawnOrUnsummon();
break;
default:
break;
}
}
}
private:
EventMap events;
};
CreatureAI* GetAI(Creature* creature) const override
{
return new npc_minigob_manabonkAI(creature);
}
};
void AddSC_dalaran()
{
new npc_mageguard_dalaran();
new npc_minigob_manabonk();
}
| [
"43292003+Hooaah@users.noreply.github.com"
] | 43292003+Hooaah@users.noreply.github.com |
cf41b54ada955d9bbfb0dd170d6e5e1da2b08ab4 | 894aa5ef1845e02a5934320cad0d34e69a1a4619 | /Analyzer/src/BaseHists.cc | d9334a31ac7ca2dc1c077445959e0ab551f06a75 | [] | no_license | thaarres/LEAF | 352a266ba056532b7e8553f8050bdfbeb7b268cb | 88c2d48d230a790b5d42c38e4f6b588cdafcb1a0 | refs/heads/master | 2023-03-29T19:00:03.572276 | 2021-04-01T17:28:10 | 2021-04-01T17:28:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | cc | #include "Analyzer/include/BaseHists.h"
#include "Analyzer/include/constants.h"
#include "Analyzer/include/useful_functions.h"
#include <TH1F.h>
#include <TFile.h>
#include <TGraphAsymmErrors.h>
#include <TCanvas.h>
#include <TLegend.h>
#include <TLine.h>
#include <TStyle.h>
#include <TKey.h>
#include <TTree.h>
#include <TLatex.h>
#include <TTreeReader.h>
#include <TTreeReaderValue.h>
#include <iostream>
#include <sys/stat.h>
using namespace std;
BaseHists::BaseHists(TString dir_){
dir = dir_;
}
void BaseHists::save(TFile* outfile){
outfile->cd();
outfile->mkdir(dir);
outfile->cd(dir);
for(const TString & n : histnames){
hists[n]->Write();
}
outfile->cd();
}
| [
"arne.reimers@physik.uzh.ch"
] | arne.reimers@physik.uzh.ch |
eba4bb4d39a470a5b6fe16531b961f4878ea3fff | 44f7368e321571b6f943ffd7a0e77659725f648d | /source/genshin_mini_map.cpp | 67572ad79337af80fb75cb8c34b85624c90eac3f | [
"Apache-2.0"
] | permissive | tmarenko/GenshinImpact_HideMap | ed23a3254dfc359e7435bcae47ed9166783d05c1 | 03d8cbf46743554a8256fef722a1cfa0db1ca017 | refs/heads/main | 2023-06-24T12:52:51.305191 | 2021-07-21T15:13:46 | 2021-07-21T15:13:46 | 387,375,516 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,831 | cpp | #include "genshin_mini_map.h"
#include "windows.h"
#include <iostream>
#define PW_RENDERFULLCONTENT 0x00000002 // Properly capture DirectComposition window content
cv::Scalar_<uint8_t> escCharColor = {255, 255, 255, 0}; // White color of character icon near minimap
/**
* Enumerator for window's handlers. Finds window with given name and class then stores it.
* @param hwnd iterated window's handler.
* @param lParam GenshinWindowInfo struction to store information about found handler.
*/
BOOL CALLBACK EnumWindowsFunc(HWND hwnd, LPARAM lParam) {
auto *gwi = (GenshinWindowInfo *) lParam;
TCHAR buf[1024]{};
GetClassName(hwnd, buf, 100);
if (!lstrcmp(buf, gwi->windowClass)) {
GetWindowText(hwnd, buf, 100);
if (!lstrcmp(buf, gwi->windowName)) {
gwi->hwnd = hwnd;
RECT windowRect;
GetWindowRect(hwnd, &windowRect);
gwi->width = windowRect.right - windowRect.left;
gwi->height = windowRect.bottom - windowRect.top;
std::cout << buf << " " << hwnd << " " << gwi->width << " " << gwi->height << std::endl;
}
}
return TRUE;
}
/**
* Class for working with Genshin Impact screen.
* @param windowName name of Genshin's window.
* @param windowClass class of Genshin's window handler.
* @param updateMs update time in milliseconds for capturing screen.
*/
GenshinImpactMiniMap::GenshinImpactMiniMap(std::string const &windowName, std::string const &windowClass,
int updateMs) {
this->updateMs = updateMs;
GenshinWindowInfo gwi;
gwi.windowName = windowName.c_str();
gwi.windowClass = windowClass.c_str();
EnumWindows(EnumWindowsFunc, reinterpret_cast<LPARAM>(&gwi));
this->window = gwi.hwnd;
this->width = gwi.width;
this->height = gwi.height;
createMiniMapMask();
}
/**
* Gets frame from Genshin Impact using WinAPI print function.
* @param screenWidth width of result screen.
* @param screenHeight height of result screen.
*/
void GenshinImpactMiniMap::getFrame(int screenWidth, int screenHeight) {
frame.create(screenHeight, screenWidth, CV_8UC4);
BITMAPINFOHEADER bi;
bi.biSize = sizeof(BITMAPINFOHEADER); //http://msdn.microsoft.com/en-us/library/windows/window/dd183402%28v=vs.85%29.aspx
bi.biWidth = screenWidth;
bi.biHeight = -screenHeight; //this is the line that makes it draw upside down or not
bi.biPlanes = 1;
bi.biBitCount = 32;
bi.biCompression = BI_RGB;
bi.biSizeImage = 0;
bi.biXPelsPerMeter = 0;
bi.biYPelsPerMeter = 0;
bi.biClrUsed = 0;
bi.biClrImportant = 0;
auto hwndDC = GetWindowDC(window);
auto saveDC = CreateCompatibleDC(hwndDC);
auto bitMap = CreateCompatibleBitmap(hwndDC, screenWidth, screenHeight);
SelectObject(saveDC, bitMap);
PrintWindow(window, saveDC, PW_RENDERFULLCONTENT);
GetDIBits(saveDC, bitMap, 0, screenHeight, frame.data, (BITMAPINFO *) &bi, DIB_RGB_COLORS);
DeleteObject(bitMap);
DeleteDC(saveDC);
DeleteObject(hwndDC);
ReleaseDC(window, hwndDC);
cv::cvtColor(frame, frame, cv::COLOR_RGBA2RGB);
}
/**
* Creates ellipse mask for minimap.
*/
void GenshinImpactMiniMap::createMiniMapMask() {
mask.create(height, width, CV_8UC1);
mask = cv::Scalar(0, 0, 0);
cv::ellipse(mask, cv::Point(165, 125),
cv::Size(ellipse_size / 2 - 2, ellipse_size / 2 - 2), 0, 0,
360, cv::Scalar(255, 255, 255),
-1, cv::LINE_AA);
mask = mask(miniMapRect);
}
/**
* Inpaints frame from Genshin Impact to remove minimap from the screen then blur image to remove distortion.
* @return inpainted and blurred image
*/
cv::Mat GenshinImpactMiniMap::getInpaintedMiniMap() {
getFrame(270, 270);
cv::Mat miniMapImage = frame(miniMapRect);
cv::inpaint(miniMapImage, mask, miniMapImage, 0, cv::INPAINT_TELEA);
cv::medianBlur(miniMapImage, miniMapImage, 85);
return miniMapImage;
}
/**
* Gets color from given image by given coordinates
*/
cv::Scalar_<uint8_t> GenshinImpactMiniMap::getColor(cv::Mat *image, int x, int y) {
cv::Scalar_<uint8_t> bgrPixel;
auto* pixelPtr = (uint8_t*)image->data;
int cn = image->channels();
bgrPixel.val[0] = pixelPtr[x*image->cols*cn + y*cn + 0]; // B
bgrPixel.val[1] = pixelPtr[x*image->cols*cn + y*cn + 1]; // G
bgrPixel.val[2] = pixelPtr[x*image->cols*cn + y*cn + 2]; // R
return bgrPixel;
}
/**
* Returns info whether there is minimap on Genshin Impact screen or not.
*/
bool GenshinImpactMiniMap::isMapOnScreen() {
getFrame(41, 41);
auto color = getColor(&frame, 40, 40);
if (color.val[0] == escCharColor.val[0] && color.val[1] == escCharColor.val[1] && color.val[2] == escCharColor.val[2]){
return true;
}
return false;
}
| [
"nkrayner@gmail.com"
] | nkrayner@gmail.com |
c49ac465eee72ea7cd85ce0d29d5f73c7f327af6 | f33876f335f3bdc9d51b0f37930b4fe4a7827ee7 | /CommonApp/CommonWindow/TopLabelViewer.cpp | b0d7280d9c22c815d02494d97c8ed424f7155fc0 | [] | no_license | andreyV512/pump_rods | 003f7e81d8d911fdcf2dba4e553a5c67b508df60 | f22ee534429151ca79df945636e5c3b94ec6380b | refs/heads/master | 2021-07-08T14:09:41.754902 | 2020-10-06T05:29:41 | 2020-10-06T05:29:41 | 188,955,859 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,199 | cpp | #include "TopLabelViewer.h"
#include "tools_debug\DebugMess.h"
#include "window_tool\Emptywindow.h"
#include "Graphics\Color.h"
//------------------------------------------------------------------------------------------------------
using namespace Gdiplus;
TopLabelViewer::TopLabelViewer()
: backScreen(NULL)
{
label.fontHeight = 16;
label.top = 0;
}
TopLabelViewer::~TopLabelViewer(){delete backScreen;}
//----------------------------------------------------------------------------------------------------
LRESULT TopLabelViewer::operator()(TSize &l)
{
if(l.resizing == SIZE_MINIMIZED) return 0;
if(NULL != backScreen)
{
if(backScreen->GetWidth() < l.Width || backScreen->GetHeight() < l.Height)
{
delete backScreen;
backScreen = new Bitmap(l.Width, l.Height);
}
}
else if(l.Width > 0 && l.Height > 0)
{
backScreen = new Bitmap(l.Width, l.Height);
}
else
{
return 0;
}
Graphics g(backScreen);
g.FillRectangle(&SolidBrush(Color((ARGB)BACK_GROUND)), 0, 0, l.Width, l.Height);
label.Draw(g);
return 0;
}
//----------------------------------------------------------------------------------------------------
LRESULT TopLabelViewer::operator()(TPaint &l)
{
PAINTSTRUCT p;
HDC hdc = BeginPaint(l.hwnd, &p);
{
Graphics g(hdc);
g.DrawCachedBitmap(&CachedBitmap(backScreen, &g), 0, 0);
}
EndPaint(l.hwnd, &p);
return 0;
}
//---------------------------------------------------------------------------------------------------
LRESULT TopLabelViewer::operator()(TUser &l)
{
label = (wchar_t *)l.data;
Graphics g(backScreen);
label.Draw(g);
RepaintWindow(hWnd);
return 0;
}
//---------------------------------------------------------------------------------------------------
void TopLabelViewer::SetMessage(wchar_t *text)
{
SendMessage(hWnd, WM_USER, 0, (LPARAM)text);
}
//----------------------------------------------------------------------------------------------------
void TopLabelViewer::operator()(TDestroy &m)
{
SetWindowLongPtr(m.hwnd, GWLP_USERDATA, NULL);
}
//------------------------------------------------------------------------------------------------
| [
"jdoe@email.com"
] | jdoe@email.com |
07f7f5254b4cc66e2c9d9c46b6a17e6393b643fc | 3c4075f8add4620a7468159f6b26183655331535 | /Volt3D/Volt3D/Engine/Preference.cpp | e4f07cfda323a93c0c06990d1e836424cdd6b6f1 | [] | no_license | bsy6766/Volt3D | 1332710fe613e9fb43cfd50eb6eb43ec9888b47c | a137e303ec0c9af01a416c4573f070d6c11e7e9c | refs/heads/master | 2021-06-02T22:27:51.553556 | 2021-03-19T07:31:32 | 2021-03-19T07:31:32 | 125,877,237 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,360 | cpp | /**
* @file Preference.cpp
*
* @author Seung Youp Baek
* @copyright Copyright (c) 2019 Seung Youp Baek
*/
#include <PreCompiled.h>
#include "Preference.h"
#include <WinBase.h> // GetUserName
#include <Lmcons.h> // UNLEN
#include <ShlObj.h> // SHGetFolderPath
#include "Utils/FileSystem.h"
#include "Utils/Logger.h"
#include "Engine/WindowMode.h"
using json = nlohmann::json;
v3d::Preference::Preference()
: path()
, data()
{}
bool v3d::Preference::init(const std::wstring& folderName)
{
// buffer
wchar_t documentsPath[MAX_PATH];
// Get ducments path
auto result = SHGetFolderPathW(NULL, CSIDL_PERSONAL, NULL, SHGFP_TYPE_CURRENT, documentsPath);
// Check result
if (result != S_OK)
{
v3d::Logger::getInstance().critical("Failed to get My Documents folder path");
return false;
}
path = std::wstring(documentsPath) + L"\\my games\\" + folderName;
if (!v3d::FileSystem::exists(path) && !v3d::FileSystem::createDirectory(path)) return false;
path += L"\\preference.json";
v3d::Logger::getInstance().info(L"Preference file path: " + path);
return load();
}
bool v3d::Preference::readJson()
{
std::ifstream file(path);
if (!file.is_open()) return false;
try { file >> data; }
catch (...) { return false; }
file.close();
return true;
}
v3d::Preference::~Preference() {}
int v3d::Preference::getInt(const char* key)
{
if (data.empty()) return 0;
try
{
const auto& value = data[key];
return value;
}
catch (...)
{
return 0;
}
}
bool v3d::Preference::reset()
{
if (v3d::FileSystem::exists(path)) v3d::FileSystem::removeFile(path);
data.clear();
data["display_monitor_index"] = 0; // primary monitor
data["display_resolution_width"] = 1280; // HD
data["display_resolution_height"] = 720; // HD
data["display_vsync"] = 0; // Vsync disabled
data["display_window_mode"] = static_cast<unsigned int>(v3d::WindowMode::eWindowed);
return true;
}
bool v3d::Preference::load()
{
if (path.empty()) return false;
if (v3d::FileSystem::exists(path))
{
return readJson();
}
else
{
return reset() && save();
}
}
bool v3d::Preference::save()
{
if (path.empty()) return false;
if (v3d::FileSystem::exists(path)) v3d::FileSystem::removeFile(path);
std::ofstream file(path);
if (!file.is_open()) return false;
file << std::setw(4) << data << std::endl;
file.close();
return true;
}
| [
"bsy6766@gmail.com"
] | bsy6766@gmail.com |
d5a0e0ac81931dd34f2d38d4ab27bcfcbb943f5b | b52232f841eca8a321924216a4e862d82ce33f81 | /lib/src/filter.cpp | 48930bcdfe82c76677adc7448fdbc6683d48434b | [
"MIT"
] | permissive | akowalew/cpu-image-filters | 7f53c81e7971cc218289202412ea20daceed8a86 | 6f81b9c15a6817f52aecabc8823668abe2579da8 | refs/heads/master | 2020-09-28T01:38:12.961452 | 2019-12-17T15:33:02 | 2019-12-17T15:33:02 | 226,657,708 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 413 | cpp | ///////////////////////////////////////////////////////////////////////////////
// filter.cpp
//
// Contains definitions of functions related to image filtering
//
// Author: akowalew (ram.techen@gmail.com)
// Date: 8.12.2019 13:12 CEST
///////////////////////////////////////////////////////////////////////////////
#include "filter.hpp"
void filter2d_8(const Image& src, Image& dst, const Image& kernel)
{
}
| [
"ram.techen@gmail.com"
] | ram.techen@gmail.com |
ab7ffa2e5fe5341d675225ac500ab209e552bc82 | 8a363d876cfe7bd0a39db63e0fc88c326db587d8 | /source/plugins/org.custusx.webserver/cxWebServerWidget.h | 5bea731e1298b01912692c60ef724a7b1f4bffc5 | [
"BSD-3-Clause"
] | permissive | SINTEFMedtek/CustusX | 07c3df5ee388040c0ee1c5225221b688bed1f929 | 8a9561f3461534bce8039ab10aa61d85fde4de31 | refs/heads/develop | 2023-07-06T07:17:16.709351 | 2023-06-27T09:21:06 | 2023-06-27T09:21:06 | 980,970 | 62 | 22 | NOASSERTION | 2023-02-16T00:55:29 | 2010-10-12T11:32:57 | C++ | UTF-8 | C++ | false | false | 1,434 | h | /*=========================================================================
This file is part of CustusX, an Image Guided Therapy Application.
Copyright (c) SINTEF Department of Medical Technology.
All rights reserved.
CustusX is released under a BSD 3-Clause license.
See Lisence.txt (https://github.com/SINTEFMedtek/CustusX/blob/master/License.txt) for details.
=========================================================================*/
#ifndef CXWEBSERVERWIDGET_H_
#define CXWEBSERVERWIDGET_H_
#include "cxWebServerWidgetBase.h"
class QHttpServer;
class QHttpRequest;
class QHttpResponse;
namespace cx
{
typedef boost::shared_ptr<class RemoteAPI> RemoteAPIPtr;
typedef boost::shared_ptr<class HttpRequestHandler> HttpRequestHandlerPtr;
/**
* Widget for use by the Webserver plugin
*
* \ingroup org_custusx_webserver
*
* \date 2019-03-29
* \author Ole Vegard Solberg
*/
class WebServerWidget : public WebServerWidgetBase
{
// Q_OBJECT
public:
WebServerWidget(cx::VisServicesPtr services, QWidget* parent = nullptr);
virtual ~WebServerWidget();
protected:
virtual void startServer();
virtual void stopServer();
private:
HttpRequestHandlerPtr mRequestHandler;
RemoteAPIPtr mAPI;
QHttpServer *mServer;
quint16 mPort;
void initServer();
void shutdownServer();
QString defaultWhatsThis() const;
};
} /* namespace cx */
#endif /* CXWEBSERVERWIDGET_H_ */
| [
"OleVegard.Solberg@sintef.no"
] | OleVegard.Solberg@sintef.no |
678ecaa98db60409c2e7d6529bdc8962689f62dc | 6e7d89d6982b77e0b3bfd3b08daf9b5937cc16c1 | /Parking_Meter_GE_Coordinator_2/Parking_Meter_GE_Coordinator_2.ino | 4b56e754ef4ccdfe97f2037f33935785bf8fbb92 | [] | no_license | Blitz72/Arduino-Projects | 77bab39fc5653174c3490512a9224c4862fa46b3 | 1e00e669c4f62137b6fa7b7a44af4acabf9d749a | refs/heads/master | 2020-05-31T00:30:19.441695 | 2019-06-03T15:46:00 | 2019-06-03T15:46:00 | 190,035,959 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,675 | ino | /******************************************************************
This is an example for the Adafruit RA8875 Driver board for TFT displays
---------------> http://www.adafruit.com/products/1590
The RA8875 is a TFT driver for up to 800x480 dotclock'd displays
It is tested to work with displays in the Adafruit shop. Other displays
may need timing adjustments and are not guanteed to work.
Adafruit invests time and resources providing this open
source code, please support Adafruit and open-source hardware
by purchasing products from Adafruit!
Written by Limor Fried/Ladyada for Adafruit Industries.
BSD license, check license.txt for more information.
All text above must be included in any redistribution.
******************************************************************/
#include <SPI.h>
#include "Adafruit_GFX.h"
#include "Adafruit_RA8875.h"
#include <EEPROM.h>
//#include "font.h"
//#include "font2.h"
#include "bitmaps.h"
//#include "megaBitmaps.h"
//using namespace std;
// Library only supports hardware SPI at this time
// Connect SCLK to UNO Digital #13 (Hardware SPI clock)
// Connect MISO to UNO Digital #12 (Hardware SPI MISO)
// Connect MOSI to UNO Digital #11 (Hardware SPI MOSI)
// Connect SCLK to MEGA Digital #52 (Hardware SPI clock)
// Connect MISO to MEGA Digital #50 (Hardware SPI MISO)
// Connect MOSI to MEGA Digital #51 (Hardware SPI MOSI)
#define RA8875_INT 21 // MEGA 2560 R3 interrupt pins 2, 3, 18, 19, 20, 21; UNO R3 = 2, 3
#define RA8875_CS 53 // MEGA 2560 R3 = 53; UNO R3 = 10
#define RA8875_RESET 49 // MEGA 2560 R3 reset used is 49 which next to hardware SPI; UNO R3 reset was 9 next to hardware SPI
#define eePromAddress 0
#define red RA8875_RED
//#define green RA8875_GREEN
#define green 0x07a0 // just a bit darker than RA8875_GREEN
#define blue RA8875_BLUE
#define yellow RA8875_YELLOW
#define white RA8875_WHITE
#define black RA8875_BLACK
#define gray 0xe71c
Adafruit_RA8875 tft = Adafruit_RA8875(RA8875_CS, RA8875_RESET);
uint16_t tx, ty;
tsPoint_t _tsLCDPoints[3];
tsPoint_t _tsTSPoints[3];
tsMatrix_t _tsMatrix;
struct CalibrationObject {
int32_t An;
int32_t Bn;
int32_t Cn;
int32_t Dn;
int32_t En;
int32_t Fn;
int32_t divider;
boolean calibrated;
};
//class ParkinMeter {
// public:
// byte address[4];
// char mins[2];
// char secs[2];
// char status;
// char latitude[5];
// char longitude[5];
// byte id;
// void printInfo() {
//
// };
// void updateInfo() {
//
// }
//};
//
//ParkingMeter meterArray[10] = {ParkingMeter(0), ParkingMeter(1), ParkingMeter(2)};
CalibrationObject cal;
// ================================================================= SETUP ============================================================================
void setup()
{
Serial.begin(115200);
Serial1.begin(115200); // Xbee serial port
Serial.println(F("RA8875 start"));
/* Initialise the display using 'RA8875_480x272' or 'RA8875_800x480' */
if (!tft.begin(RA8875_800x480)) {
Serial.println(F("RA8875 Not Found!"));
while (1);
}
Serial.println(F("Found RA8875"));
tft.displayOn(true);
tft.GPIOX(true); // Enable TFT - display enable tied to GPIOX
tft.PWM1config(true, RA8875_PWM_CLK_DIV1024); // PWM output for backlight
tft.PWM1out(255);
pinMode(RA8875_INT, INPUT);
digitalWrite(RA8875_INT, HIGH);
tft.touchEnable(true);
EEPROM.get(eePromAddress, cal);
// Serial.println(cal.An);
// Serial.println(cal.Bn);
// Serial.println(cal.Cn);
// Serial.println(cal.Dn);
// Serial.println(cal.En);
// Serial.println(cal.Fn);
// Serial.println(cal.divider);
// Serial.println(cal.calibrated);
for (int i = 0; i < 11; i++) {
tft.drawRect(0, i*40, tft.width() - 1, 40, RA8875_WHITE);
}
// tft.drawRect(0, 0, tft.width() - 1, 40, RA8875_WHITE);
tft.drawRect(0, 440, tft.width() - 1, 39, RA8875_WHITE);
tft.fillRect(1, 1, tft.width() - 3, 38, gray);
tft.fillRect(1, 441, tft.width() - 3, 37, gray);
tft.textMode();
tft.textEnlarge(1);
tft.textSetCursor(20, 3);
const char string[] = "LOCATION SERIAL # TIME LEFT";
tft.textTransparent(RA8875_BLACK);
tft.textWrite(string);
// // drawArray(x position, y position, height, width, name of uint16_t array stored in flash);
// uint32_t startTime = millis();
// drawArray(650, 442, 36, 36, menuButton);
// drawArray(700, 442, 36, 36, settingsButton);
// drawArray(750, 442, 36, 36, closeButton);
// uint32_t endTime = millis();
// Serial.print("drawArray elapsed time: ");
// Serial.println(endTime - startTime); // 878 mS for menuButton, settingsButton, and closeButton
// // drawArray2(x position, y position, height, width, name of uint16_t array stored in flash);
// startTime = millis();
drawArray2(10, 442, 36, 48, GE_Logo);
drawArray2(700, 2, 36, 36, menuButton);
drawArray2(750, 2, 36, 36, settingsButton);
// drawArray2(750, 2, 36, 36, closeButton);
// drawArray2(650, 442, 36, 36, lowBattIcon);
// drawArray2(700, 442, 36, 36, medBattIcon);
// drawArray2(750, 442, 36, 36, highBattIcon);
// endTime = millis();
// Serial.print("drawArray2 elapsed time: ");
// Serial.println(endTime - startTime); // 55 mS for menuButton, settingsButton, and closeButton
// drawArray2(0, 0, 40, 800, NELA_Park_1); // 800 x 480 array crashes compiler
}
// ================================================================== LOOP ============================================================================
void loop() {
delay(250);
} // end of loop()
// ================================================================ FUNCTIONS =========================================================================
void serialEvent1() {
// noInterrupts();
byte address[4] = {0};
char minArray[2] = "";
char secArray[2] = "";
char _status = 'R';
char latArray[5] = "";
char lonArray[5] = "";
char battStatus = 'L';
byte inByte;
while (Serial1.available() > 0) { // should be a receive packet frame 0x90
inByte = Serial1.read();
// (inByte == 0) ? Serial.print('0') : Serial.print(inByte, HEX);
// Serial.print(", ");
if (inByte == 0x7e) {
for (int i = 0; i < 2; i++) {
Serial1.read(); // discard length bytes
}
inByte = Serial1.read();
if (inByte == 0x90) {
for (int i = 0; i < 4; i++) {
Serial1.read(); // discard bytes 4 - 7, first half of 64-bit address
}
for (int i = 0; i < 4; i++) {
address[i] = Serial1.read(); // read offset 8 - 11, second half of 64-bit address
}
for (int i = 0; i < 3; i++) {
Serial1.read(); // discard offset 12 - 14
}
minArray[0] = Serial1.read(); // time left from parking meter, offset 15
minArray[1] = Serial1.read();
secArray[0] = Serial1.read();
secArray[1] = Serial1.read();
_status = Serial1.read();
for (int i = 0; i < 5; i++) {
latArray[i] = Serial1.read();
}
for (int i = 0; i < 5; i++) {
lonArray[i] = Serial1.read();
}
battStatus = Serial1.read();
}
}
}
Serial.println();
// interrupts();
printInfo(address, minArray, secArray, _status, latArray, lonArray, battStatus);
if (minArray[0] > 0x20 && minArray[0] < 0x7f && latArray[0] > 0x20 and latArray[0] < 0x7f &&
lonArray[0] > 0x20 && lonArray[0] < 0x7f && lonArray[5] > 0x20 && lonArray[5] < 0x7f ) {
updateInfo(address, minArray, secArray, _status, latArray, lonArray, battStatus);
}
}
void printInfo(byte address[], char minutes[], char seconds[], char _status, char latitude[], char longitude[], char battStatus) {
Serial.print(F("Address: "));
for (int i = 0; i < 4; i++) {
Serial.print(address[i], HEX);
}
Serial.println();
Serial.print(F("Time left: ")); Serial.print(minutes[0]); Serial.print(minutes[1]);
Serial.print(F(":")); Serial.print(seconds[0]); Serial.println(seconds[1]);
Serial.print(F("Status: ")); Serial.println(_status);
Serial.print(F("Position: 41."));
for (int i = 0; i < 5; i++) {
Serial.print(latitude[i]);
}
Serial.print(", -81.");
for (int i = 0; i < 5; i++) {
Serial.print(longitude[i]);
}
Serial.println();
Serial.print("Battery Status: ");
Serial.println(battStatus);
Serial.println();
}
void updateInfo(byte address[], char minutes[], char seconds[], char _status, char latitude[], char longitude[], char battStatus) {
uint16_t bgColor;
uint16_t textColor;
int mins = (minutes[0] - 0x30) * 10;
mins += minutes[1] - 0x30;
int secs = (seconds[0] - 0x30) * 10;
secs += seconds[1] - 0x30;
int timer = mins * 100 + secs;
if (_status == 'R') {
bgColor = blue;
textColor = white;
} else if (_status == 'A') {
if (timer > 500) {
bgColor = green;
textColor = black;
}
if (timer > 0 && timer <= 500) {
bgColor = yellow;
textColor = black;
}
if (timer <= 0) {
bgColor = red;
textColor = white;
}
} else if (_status == 'X') {
bgColor = red;
textColor = white;
}
uint16_t _latitude = (latitude[0] - 0x30) * 10000; // convert latitude char array into uinsigned integer
_latitude += (latitude[1] - 0x30) * 1000;
_latitude += (latitude[2] - 0x30) * 100;
_latitude += (latitude[3] - 0x30) * 10;
_latitude += (latitude[4] - 0x30);
uint16_t _longitude = (longitude[0] - 0x30) * 10000; // convert longitude char array into uinsigned integer
_longitude += (longitude[1] - 0x30) * 1000;
_longitude += (longitude[2] - 0x30) * 100;
_longitude += (longitude[3] - 0x30) * 10;
_longitude += (longitude[4] - 0x30);
tft.drawRect(0, 40, tft.width() - 1, 40, white);
tft.fillRect(1, 41, tft.width() - 3, 38, bgColor);
tft.textSetCursor(20, 43);
tft.textTransparent(textColor);
if (_latitude >= 54036 && _latitude <= 54056 && _longitude >= 56060 && _longitude <= 56141) {
tft.textWrite("SECURITY");
} else {
tft.textWrite("NELA PARK");
}
tft.textSetCursor(290, 43);
tft.textTransparent(textColor);
// convert hex values of the address to ascii for easy prining in the tft.textWrite() function
byte add[8] = {0};
// ((address[0] >> 4) < 10) ? add[0] = (address[0] >> 4) + 0x30 : add[0] = (address[0] >> 4) + 0x37;
// ((address[0] & 0x0f) < 10) ? add[1] = (address[0] & 0x0f) + 0x30 : add[1] = (address[0] & 0x0f) + 0x37;
// ((address[1] >> 4) < 10) ? add[2] = (address[1] >> 4) + 0x30 : add[2] = (address[1] >> 4) + 0x37;
// ((address[1] & 0x0f) < 10) ? add[3] = (address[1] & 0x0f) + 0x30 : add[3] = (address[1] & 0x0f) + 0x37;
// ((address[2] >> 4) < 10) ? add[4] = (address[2] >> 4) + 0x30 : add[4] = (address[2] >> 4) + 0x37;
// ((address[2] & 0x0f) < 10) ? add[5] = (address[2] & 0x0f) + 0x30 : add[5] = (address[2] & 0x0f) + 0x37;
// ((address[3] >> 4) < 10) ? add[6] = (address[3] >> 4) + 0x30 : add[6] = (address[3] >> 4) + 0x37;
// ((address[3] & 0x0f) < 10) ? add[7] = (address[3] & 0x0f) + 0x30 : add[7] = (address[3] & 0x0f) + 0x37;
for (int i = 0; i < 4; i++) {
((address[i] >> 4) < 10) ? add[i*2] = (address[i] >> 4) + 0x30 : add[i*2] = (address[i] >> 4) + 0x37;
((address[i] & 0x0f) < 10) ? add[i*2+1] = (address[i] & 0x0f) + 0x30 : add[i*2+1] = (address[i] & 0x0f) + 0x37;
}
tft.textWrite(add, 8);
tft.textSetCursor(520, 43);
tft.fillRect(520, 43, 100, 35, bgColor);
tft.textTransparent(textColor);
if (_status == 'A' || _status == 'X') {
tft.textWrite(minutes, 2);
tft.textWrite(":");
tft.textWrite(seconds, 2);
} else if (_status == 'R') {
tft.textWrite("INACTIVE");
}
switch (battStatus) {
case 'H':
drawArray2(435, 48, 24, 36, highBattIcon);
break;
case 'M':
drawArray2(435, 48, 24, 36, medBattIcon);
break;
case 'L':
drawArray2(435, 48, 24, 36, lowBattIcon);
break;
}
}
//void drawArray(int x, int y, int h, int w, uint16_t * file) {
//
// tft.graphicsMode();
//
// for (int row = y; row < y + h; row++) {
// for (int col = x; col < x + w; col++) {
// tft.drawPixel(col, row, pgm_read_word(file));
// file++;
// }
// }
//
// tft.textMode();
//
//}
void drawArray2(int x, int y, int h, int w, uint16_t * file) {
uint16_t buff[w] = {};
tft.graphicsMode();
for (int row = y; row < y + h; row++) {
for (int i = 0; i < w; i++) {
buff[i] = pgm_read_word(file);
file++;
}
tft.drawPixels(buff, w, x, row);
}
tft.textMode();
}
| [
"bauer.david@att.net"
] | bauer.david@att.net |
3aae49e3f30110014ade72a91bb1470567abf8cc | 5ae08f3bc4f9d56e2c686f1613c1ec62b154856f | /Ray-Tracer/Ray-Tracer/Scene.h | 4539b7591f91206c47d6f3bd3b8b48d64de26d26 | [] | no_license | dastyk/Ray-Tracer | 653e00e7ef3be463a248b7e4eca6b9092a3addb8 | 06689feccc1c992f031658ab576c024d4508c8b5 | refs/heads/master | 2020-12-24T06:12:14.439710 | 2017-03-13T09:47:26 | 2017-03-13T09:47:26 | 73,169,062 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,152 | h | #ifndef _SCENE_H_
#define _SCENE_H_
#pragma once
#include "ComputeShaderDataStructs.h"
#include "Input.h"
#include "Camera.h"
#include <ArfData.h>
#include <vector>
#include <Parsers.h>
class Scene
{
public:
Scene(uint32_t width, uint32_t height, Input& input);
~Scene();
uint8_t Update(float deltaTime);
const SceneData::CountData& GetCounts()const;
const SceneData::Sphere& GetSpheres()const;
const SceneData::Triangle& GetTriangles()const;
const SceneData::PointLight& GetPointLights()const;
const SceneData::SpotLights& GetSpotLights()const;
const SceneData::TexturedTriangle& GetTexturedTriangles()const;
const void UpdateSphere(uint32_t ID);
const void UpdateTriangle(uint32_t ID);
const void UpdateTexTriangle(const DirectX::XMFLOAT3& pos);
const DirectX::XMFLOAT4X4* GetTranslations(uint32_t& numMesh);
Camera* GetCamera();
private:
const void _AddSphere(const DirectX::XMFLOAT3& pos, float radius, const DirectX::XMFLOAT3& color);
const void _AddTriangle(const DirectX::XMFLOAT3& p0, const DirectX::XMFLOAT3& p1, const DirectX::XMFLOAT3& p2, const DirectX::XMFLOAT3& color);
const void _AddRandomSphere();
const void _AddRandomPointLight();
const void _AddPointLight(const DirectX::XMFLOAT3& pos, float luminosity);
const void _AddSpotLight(const DirectX::XMFLOAT3& pos, const DirectX::XMFLOAT3& dir, float range, float theta, float phi, float luminosity);
const void _Rotate(DirectX::XMFLOAT4& pos, float amount);
uint32_t _width, _height;
Input& _input;
Camera _camera;
SceneData::Sphere _spheres;
SceneData::Triangle _triangles;
SceneData::PointLight _pointLights;
SceneData::TexturedTriangle _textureTriangles;
SceneData::SpotLights _spotLights;
SceneData::CountData _numObjects;
DirectX::XMFLOAT4X4* _translations;
uint32_t _numMesh;
void _Interleave(std::vector<std::pair<ArfData::Data, ArfData::DataPointers>>& data, const std::vector<uint32_t>& textureIDs);
void _LoadMeshes(const std::vector<const char*>& files, std::vector<std::pair<ArfData::Data, ArfData::DataPointers>>& data);
void _LoadMesh(const char* filename, std::pair<ArfData::Data, ArfData::DataPointers>& data);
};
#endif | [
"peva13@student.bth.se"
] | peva13@student.bth.se |
9d52bb6fc3c8ca7170da3158cd7c2c11bb131c8a | 49e125a9e43d22706cea8f304e88c96dd20197ae | /Codeforces/tokitsukaze and mahjong.cpp | 64e3c4cb1f0c30437e1f305d2b2ff6f7f94bf2cf | [] | no_license | tahsinsoha/Problem-solving- | b0382b7afa539715dafb1fbc40666e4051b5f7db | 7049dcc7ab9e4a59977787c2e9052055bff560a8 | refs/heads/master | 2023-01-06T02:35:56.822736 | 2020-11-04T12:15:43 | 2020-11-04T12:15:43 | 280,789,760 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,304 | cpp | #include<bits/stdc++.h>
using namespace std;
vector<int>v[4];
int main()
{
int n;
char c;
int maxx=0;
//int arr[4];
for(int i=1; i<=3; i++)
{
cin>>n;
cin>>c;
if(c=='m')
v[0].push_back(n);
if(c=='p')
v[1].push_back(n);
if(c=='s')
v[2].push_back(n);
//if(c=='m') v[0].push_back(n);
}
if(v[0].size()>v[1].size()&&v[0].size()>v[2].size())
{
sort(v[0].begin(),v[0].end());
int cont1=1;//shoman
int cont2=1;
int cont3=1;
int maxo=0;
for(int i=0; i<v[0].size()-1; i++)
{
if(v[0][i]==v[0][i+1])
cont1++;
else if(v[0][i+1]==v[0][i]+1)
cont2++;
else if(v[0][i+1]==v[0][i]+2){
if(cont3==2) continue;
cont3++;
}
}
maxo=max(cont1,cont2);
cout<<3-max(maxo,cont3)<<endl;
return 0;
}
else if(v[1].size()>v[0].size()&&v[1].size()>v[2].size())
{
sort(v[1].begin(),v[1].end());
int cont1=1;//shoman
int cont2=1;
int cont3=1;//diff 2
int maxo = 0;
for(int i=0; i<v[1].size()-1; i++)
{
if(v[1][i]==v[1][i+1])
cont1++;
else if(v[1][i+1]==v[1][i]+1)
cont2++;
else if(v[1][i+1]==v[1][i]+2){
if(cont3==2) continue;
cont3++;
}
}
maxo=max(cont1,cont2);
cout<<3-max(maxo,cont3)<<endl;
return 0;
}
else if(v[2].size()>v[0].size()&&v[2].size()>v[1].size())
{
sort(v[2].begin(),v[2].end());
int cont1=1;//shoman
int cont2=1;
int cont3=1;
int maxo=0;
for(int i=0; i<v[2].size()-1; i++)
{
if(v[2][i]==v[2][i+1])
cont1++;
else if(v[2][i+1]==v[2][i]+1)
cont2++;
else if(v[2][i+1]==v[2][i]+2){
if(cont3==2) continue;
cont3++;
}
}
maxo=max(cont1,cont2);
cout<<3-max(maxo,cont3)<<endl;
return 0;
}
else cout<<2<<endl;
return 0;
}
| [
"soha97368@gmail.com"
] | soha97368@gmail.com |
abe3b5e3630f96e465061a00528d76a3ab26575c | f252f75a66ff3ff35b6eaa5a4a28248eb54840ee | /external/opencore/codecs_v2/omx/omx_m4venc/include/mpeg4_enc.h | ccced6159a718df291ceb36e28bc2bc1e438ff6e | [
"MIT",
"LicenseRef-scancode-other-permissive",
"Artistic-2.0",
"LicenseRef-scancode-philippe-de-muyter",
"Apache-2.0",
"LicenseRef-scancode-mpeg-iso",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | abgoyal-archive/OT_4010A | 201b246c6f685cf35632c9a1e1bf2b38011ff196 | 300ee9f800824658acfeb9447f46419b8c6e0d1c | refs/heads/master | 2022-04-12T23:17:32.814816 | 2015-02-06T12:15:20 | 2015-02-06T12:15:20 | 30,410,715 | 0 | 1 | null | 2020-03-07T00:35:22 | 2015-02-06T12:14:16 | C | UTF-8 | C++ | false | false | 3,218 | h |
#ifndef MPEG4_ENC_H_INCLUDED
#define MPEG4_ENC_H_INCLUDED
#ifndef OSCL_MEM_H_INCLUDED
#include "oscl_mem.h"
#endif
#ifndef OMX_Component_h
#include "OMX_Component.h"
#endif
#ifndef _MP4ENC_API_H_
#include "mp4enc_api.h"
#endif
#ifndef CCRGB24TOYUV420_H_INCLUDED
#include "ccrgb24toyuv420.h"
#endif
#ifndef CCRGB12TOYUV420_H_INCLUDED
#include "ccrgb12toyuv420.h"
#endif
#ifndef CCYUV420SEMITOYUV420_H_INCLUDED
#include "ccyuv420semitoyuv420.h"
#endif
#ifndef OSCL_INT64_UTILS_H_INCLUDED
#include "oscl_int64_utils.h"
#endif
const uint32 DEFAULT_VOL_HEADER_LENGTH = 28;
enum
{
MODE_H263 = 0,
MODE_MPEG4
};
class Mpeg4Encoder_OMX
{
public:
Mpeg4Encoder_OMX();
OMX_ERRORTYPE Mp4EncInit(OMX_S32 iEncMode,
OMX_VIDEO_PORTDEFINITIONTYPE aInputParam,
OMX_CONFIG_ROTATIONTYPE aInputOrientationType,
OMX_VIDEO_PORTDEFINITIONTYPE aEncodeParam,
OMX_VIDEO_PARAM_MPEG4TYPE aEncodeMpeg4Param,
OMX_VIDEO_PARAM_ERRORCORRECTIONTYPE aErrorCorrection,
OMX_VIDEO_PARAM_BITRATETYPE aRateControlType,
OMX_VIDEO_PARAM_QUANTIZATIONTYPE aQuantType,
OMX_VIDEO_PARAM_MOTIONVECTORTYPE aSearchRange,
OMX_VIDEO_PARAM_INTRAREFRESHTYPE aIntraRefresh,
OMX_VIDEO_PARAM_H263TYPE aH263Type,
OMX_VIDEO_PARAM_PROFILELEVELTYPE* aProfileLevel);
OMX_BOOL Mp4EncodeVideo(OMX_U8* aOutBuffer,
OMX_U32* aOutputLength,
OMX_BOOL* aBufferOverRun,
OMX_U8** aOverBufferPointer,
OMX_U8* aInBuffer,
OMX_U32 aInBufSize,
OMX_TICKS aInTimeStamp,
OMX_TICKS* aOutTimeStamp,
OMX_BOOL* aSyncFlag);
OMX_ERRORTYPE Mp4RequestIFrame();
OMX_BOOL Mp4UpdateBitRate(OMX_U32 aEncodedBitRate);
OMX_BOOL Mp4UpdateFrameRate(OMX_U32 aEncodeFramerate);
OMX_ERRORTYPE Mp4EncDeinit();
private:
void CopyToYUVIn(uint8* YUV, int width, int height, int width_16, int height_16);
/* RGB->YUV conversion */
ColorConvertBase *ccRGBtoYUV;
VideoEncControls iEncoderControl;
OMX_BOOL iInitialized;
OMX_COLOR_FORMATTYPE iVideoFormat;
int iSrcWidth;
int iSrcHeight;
int iFrameOrientation;
uint32 iSrcFrameRate;
uint8* iYUVIn;
uint8* iVideoIn;
uint8* iVideoOut;
OMX_TICKS iNextModTime;
MP4HintTrack iHintTrack;
MP4EncodingMode ENC_Mode;
OMX_U8 iVolHeader[DEFAULT_VOL_HEADER_LENGTH]; /** Vol header */
OMX_U32 iVolHeaderSize;
OMX_BOOL iVolHeaderFlag;
#ifdef MT6516_MP4_HW_ENCODER
void *my_tid;
OMX_U32 u4OutputCnt;
ULong u4OutTS;
#endif
};
#endif ///#ifndef MPEG4_ENC_H_INCLUDED
| [
"abgoyal@gmail.com"
] | abgoyal@gmail.com |
a197c6091b90ed11ef30b92b963a64a5f5cab17b | 6eb7ee57fa5082a12c77c5028197b41befdea009 | /MachineDemo/MachineDemoDlg.h | 98745d281c0970decb2fba3b52ef3cba17856f06 | [] | no_license | shreyjindal81/CSE335-Project-2 | 78fbe49f05c37caaaf4845799ff9bc4e2b876347 | f22e7498a2e25cb99db8043b9cba93b88da709c8 | refs/heads/master | 2023-05-22T11:24:14.781008 | 2021-06-14T08:11:16 | 2021-06-14T08:11:16 | 357,864,061 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,010 | h | /**
* \file MachineDemoDlg.h
* The machine demostration dialog box class
* \author Charles Owen
*/
#pragma once
#include "afxcmn.h"
#include "afxwin.h"
#include "MachineDemoView.h"
/**
* The machine demonstration dialog box class
*/
class CMachineDemoDlg : public CDialogEx
{
public:
CMachineDemoDlg(CWnd* pParent = NULL); // standard constructor
/// Dialog box ID
enum { IDD = IDD_MACHINEDEMO_DIALOG };
protected:
virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV support
// Implementation
protected:
HICON m_hIcon; ///< Icon handle
// Generated message map functions
virtual BOOL OnInitDialog();
afx_msg void OnPaint();
afx_msg HCURSOR OnQueryDragIcon();
DECLARE_MESSAGE_MAP()
public:
afx_msg void OnHScroll(UINT nSBCode, UINT nPos, CScrollBar* pScrollBar);
afx_msg void OnSize(UINT nType, int cx, int cy);
afx_msg void OnBnClickedButtonNewMachine();
private:
int mFrameNum = 0; ///< Frame number, assumed 30 frames per second
double mScale = 1.0; ///< Amount to scale
void UpdateUI();
CSliderCtrl mTimeSlider; ///< The time/frame slider
CStatic mFrame; ///< Current frame
CMachineDemoView mMachineView; ///< The machine viewer window
CStatic mMachineNumberView; ///< View were we put the machine number
CButton mPlayButton; ///< The Play button control
CButton mStopButton; ///< The Stop button control
CButton mRwButton; ///< The Rewind button control
public:
afx_msg void OnBnClickedPlay();
afx_msg void OnBnClickedStop();
afx_msg void OnTimer(UINT_PTR nIDEvent);
afx_msg void OnBnClickedRw();
afx_msg void OnTRBNThumbPosChangingScaleslider(NMHDR* pNMHDR, LRESULT* pResult);
/** \cond */
UINT_PTR mTimer = 0; ///< The ID for the timer that controls playback
long long mLastTime; ///< Last time we read the timer
double mTimeFreq; ///< Rate the timer updates
double mTime = 0; ///< Running time
CStatic mControls;
CSliderCtrl mScaleSlider;
/** \endcond */
};
| [
"shreyjindal81@gmail.com"
] | shreyjindal81@gmail.com |
872d5f67fa721674ea50f72343d1d069bcc53535 | 8b370736fb939cf8b2c916c9aac2ad1105c705b9 | /topologicalSort.cpp | f5b9238af3ba8e389e64f69278b92fc27aadab49 | [] | no_license | viditk9/snippets | 78a987c016bd9a40f219662a4d88c3e450ae4d19 | 3fb7f9839b34d6085540596e528829cd6bb1d304 | refs/heads/main | 2023-06-18T13:12:03.068664 | 2021-06-30T08:03:23 | 2021-06-30T08:03:23 | 339,652,779 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 350 | cpp | vi topo(vi v[],ll n)
{
vi indeg(n+1,0);
vi res;
rep1(i,n)
{
for(auto j:v[i])
{
indeg[j]++:
}
}
queue<ll> q;
rep1(i,n)
{
if(indeg[i]==0) q.push(i);
}
while(!q.empty())
{
ll x=q.front();
q.pop();
res.pb(x);
for(auto i:v[x])
{
indeg[i]--;
if(indeg[i]==0) q.push(i);
}
}
return res;
} | [
"noreply@github.com"
] | noreply@github.com |
97850be1d498c39fdb2963b27e6c08663ed63519 | 6697cd726d4cd3744ae52a7d5618f4ad107befba | /CP/84D.cpp | 2491accf953ef9d26d1d68dbcfd63de38d42f516 | [] | no_license | Saifu0/Competitive-Programming | 4385777115d5d83ba5140324c309db1e6c16f4af | ecc1c05f1a85636c57f7f6609dd6a002f220c0b0 | refs/heads/master | 2022-12-15T09:11:53.907652 | 2020-09-08T08:20:44 | 2020-09-08T08:20:44 | 293,743,953 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,542 | cpp | #include<bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define vi vector<int>
#define ii pair<int,int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#define mp map<int,int>
#define F first
#define S second
#define sz(v) (int)v.size()
#define mod 1000000007
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main(){
c_p_c();
int t; cin >> t;
while(t--){
int n; cin >> n;
int p[n+1]; int c[n+1];
Fo(i,1,n+1) cin >> p[i];
Fo(i,1,n+1) cin >> c[i];
vector<bool> vis(n+1);
map<int,vi> m;
Fo(i,1,n+1){
if(vis[i]) continue;
vis[i] = 1;
m[i].pb(i);
int curr = i;
while(p[curr] != i){
curr = p[curr];
vis[curr] = 1;
m[i].pb(curr);
}
}
int ans = n;
for(auto el: m){
int s = el.S.size();
for(int i=1;i*i<=s;i++){
int k = i;
if(s%k!=0) continue;
vector<bool> poss(k,1);
fo(i,s){
if(c[el.S[i]] != c[el.S[i%k]]) poss[i%k] = 0;
}
for(auto it : poss){
if(it){
ans = min(k,ans);
break;
}
}
k = s/k;
poss.resize(k);
poss.assign(k,1);
fo(i,s){
if(c[el.S[i]] != c[el.S[i%k]]) poss[i%k] = 0;
}
for(auto it : poss){
if(it){
ans = min(k,ans);
break;
}
}
}
}
cout << ans << endl;
}
return 0;
} | [
"43892879+Saifu0@users.noreply.github.com"
] | 43892879+Saifu0@users.noreply.github.com |
1b7c52d984d3c9c059134563f6de50bf5e3ed32f | fb508e0c2349001eb8e1bc3896c7b6eedf56b37b | /hitable_list.h | bbd0d91785ab0296e842ab131b7692923e0ad15d | [] | no_license | DMinsky/ray_tracing_in_one_weekend | b7d053b548b0c874a4662ff51a3ffd5abb5347b1 | a7630499cbc073b6079ed712e4ded2b7f0bce3df | refs/heads/master | 2020-04-17T15:15:42.725701 | 2019-02-16T22:13:02 | 2019-02-16T22:13:02 | 166,691,603 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | h | #ifndef HITABLELISTH
#define HITABLELISTH
#include "hitable.h"
class hitable_list: public hitable {
public:
hitable_list() {}
hitable_list(hitable **l, int n) { list = l; list_size = n; }
virtual bool hit(const ray& r, float tmin, float tmax, hit_record& rec) const;
hitable **list;
int list_size;
};
bool hitable_list::hit(const ray& r, float t_min, float t_max, hit_record& rec) const {
hit_record temp_rec;
bool hit_anything = false;
double closest_so_far = t_max;
for (int i = 0; i < list_size; i++) {
if (list[i]->hit(r, t_min, closest_so_far, temp_rec)) {
hit_anything = true;
closest_so_far = temp_rec.t;
rec = temp_rec;
}
}
return hit_anything;
}
#endif
| [
"me@dminsky.com"
] | me@dminsky.com |
ee768aff44a7da8f116fcbb9627a775e0c6049e4 | 4a1aca3d31e88570fe58e04b5c318fd4bd230155 | /src/p2p/net_peerlist.h | 993f8a7f38c596c0054407196913c2894f7b549c | [
"BSD-3-Clause"
] | permissive | techqc/sizaeon | 9562a51481a2003c23ccecd64f855c51aba4b75c | d3e30571515ff17ed12167420ee764185fb2d1c9 | refs/heads/master | 2021-04-06T19:42:13.926369 | 2018-03-15T18:08:46 | 2018-03-15T18:08:46 | 125,289,266 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,166 | h | // Copyright (c) 2018, SiZ, Based on AEON The Monero Project
//
// 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.
//
// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
#pragma once
#include <list>
#include <set>
#include <map>
#include <boost/foreach.hpp>
//#include <boost/bimap.hpp>
//#include <boost/bimap/multiset_of.hpp>
#include <boost/archive/binary_oarchive.hpp>
#include <boost/archive/binary_iarchive.hpp>
#include <boost/serialization/version.hpp>
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/multi_index/identity.hpp>
#include <boost/multi_index/member.hpp>
#include "syncobj.h"
#include "net/local_ip.h"
#include "p2p_protocol_defs.h"
#include "cryptonote_config.h"
#include "net_peerlist_boost_serialization.h"
#define CURRENT_PEERLIST_STORAGE_ARCHIVE_VER 4
namespace nodetool
{
/************************************************************************/
/* */
/************************************************************************/
class peerlist_manager
{
public:
bool init(bool allow_local_ip);
bool deinit();
size_t get_white_peers_count(){CRITICAL_REGION_LOCAL(m_peerlist_lock); return m_peers_white.size();}
size_t get_gray_peers_count(){CRITICAL_REGION_LOCAL(m_peerlist_lock); return m_peers_gray.size();}
bool merge_peerlist(const std::list<peerlist_entry>& outer_bs);
bool get_peerlist_head(std::list<peerlist_entry>& bs_head, uint32_t depth = P2P_DEFAULT_PEERS_IN_HANDSHAKE);
bool get_peerlist_full(std::list<peerlist_entry>& pl_gray, std::list<peerlist_entry>& pl_white);
bool get_white_peer_by_index(peerlist_entry& p, size_t i);
bool get_gray_peer_by_index(peerlist_entry& p, size_t i);
bool append_with_peer_white(const peerlist_entry& pr);
bool append_with_peer_gray(const peerlist_entry& pr);
bool set_peer_just_seen(peerid_type peer, uint32_t ip, uint32_t port);
bool set_peer_just_seen(peerid_type peer, const net_address& addr);
bool set_peer_unreachable(const peerlist_entry& pr);
bool is_ip_allowed(uint32_t ip);
void trim_white_peerlist();
void trim_gray_peerlist();
private:
struct by_time{};
struct by_id{};
struct by_addr{};
struct modify_all_but_id
{
modify_all_but_id(const peerlist_entry& ple):m_ple(ple){}
void operator()(peerlist_entry& e)
{
e.id = m_ple.id;
}
private:
const peerlist_entry& m_ple;
};
struct modify_all
{
modify_all(const peerlist_entry& ple):m_ple(ple){}
void operator()(peerlist_entry& e)
{
e = m_ple;
}
private:
const peerlist_entry& m_ple;
};
struct modify_last_seen
{
modify_last_seen(time_t last_seen):m_last_seen(last_seen){}
void operator()(peerlist_entry& e)
{
e.last_seen = m_last_seen;
}
private:
time_t m_last_seen;
};
typedef boost::multi_index_container<
peerlist_entry,
boost::multi_index::indexed_by<
// access by peerlist_entry::net_adress
boost::multi_index::ordered_unique<boost::multi_index::tag<by_addr>, boost::multi_index::member<peerlist_entry,net_address,&peerlist_entry::adr> >,
// sort by peerlist_entry::last_seen<
boost::multi_index::ordered_non_unique<boost::multi_index::tag<by_time>, boost::multi_index::member<peerlist_entry,int64_t,&peerlist_entry::last_seen> >
>
> peers_indexed;
typedef boost::multi_index_container<
peerlist_entry,
boost::multi_index::indexed_by<
// access by peerlist_entry::id<
boost::multi_index::ordered_unique<boost::multi_index::tag<by_id>, boost::multi_index::member<peerlist_entry,uint64_t,&peerlist_entry::id> >,
// access by peerlist_entry::net_adress
boost::multi_index::ordered_unique<boost::multi_index::tag<by_addr>, boost::multi_index::member<peerlist_entry,net_address,&peerlist_entry::adr> >,
// sort by peerlist_entry::last_seen<
boost::multi_index::ordered_non_unique<boost::multi_index::tag<by_time>, boost::multi_index::member<peerlist_entry,int64_t,&peerlist_entry::last_seen> >
>
> peers_indexed_old;
public:
template <class Archive, class t_version_type>
void serialize(Archive &a, const t_version_type ver)
{
if(ver < 3)
return;
CRITICAL_REGION_LOCAL(m_peerlist_lock);
if(ver < 4)
{
//loading data from old storage
peers_indexed_old pio;
a & pio;
peers_indexed_from_old(pio, m_peers_white);
return;
}
a & m_peers_white;
a & m_peers_gray;
}
private:
bool peers_indexed_from_old(const peers_indexed_old& pio, peers_indexed& pi);
friend class boost::serialization::access;
epee::critical_section m_peerlist_lock;
std::string m_config_folder;
bool m_allow_local_ip;
peers_indexed m_peers_gray;
peers_indexed m_peers_white;
};
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::init(bool allow_local_ip)
{
m_allow_local_ip = allow_local_ip;
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::deinit()
{
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::peers_indexed_from_old(const peers_indexed_old& pio, peers_indexed& pi)
{
for(auto x: pio)
{
auto by_addr_it = pi.get<by_addr>().find(x.adr);
if(by_addr_it == pi.get<by_addr>().end())
{
pi.insert(x);
}
}
return true;
}
//--------------------------------------------------------------------------------------------------
inline void peerlist_manager::trim_white_peerlist()
{
while(m_peers_gray.size() > P2P_LOCAL_GRAY_PEERLIST_LIMIT)
{
peers_indexed::index<by_time>::type& sorted_index=m_peers_gray.get<by_time>();
sorted_index.erase(sorted_index.begin());
}
}
//--------------------------------------------------------------------------------------------------
inline void peerlist_manager::trim_gray_peerlist()
{
while(m_peers_white.size() > P2P_LOCAL_WHITE_PEERLIST_LIMIT)
{
peers_indexed::index<by_time>::type& sorted_index=m_peers_white.get<by_time>();
sorted_index.erase(sorted_index.begin());
}
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::merge_peerlist(const std::list<peerlist_entry>& outer_bs)
{
CRITICAL_REGION_LOCAL(m_peerlist_lock);
BOOST_FOREACH(const peerlist_entry& be, outer_bs)
{
append_with_peer_gray(be);
}
// delete extra elements
trim_gray_peerlist();
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::get_white_peer_by_index(peerlist_entry& p, size_t i)
{
CRITICAL_REGION_LOCAL(m_peerlist_lock);
if(i >= m_peers_white.size())
return false;
peers_indexed::index<by_time>::type& by_time_index = m_peers_white.get<by_time>();
p = *epee::misc_utils::move_it_backward(--by_time_index.end(), i);
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::get_gray_peer_by_index(peerlist_entry& p, size_t i)
{
CRITICAL_REGION_LOCAL(m_peerlist_lock);
if(i >= m_peers_gray.size())
return false;
peers_indexed::index<by_time>::type& by_time_index = m_peers_gray.get<by_time>();
p = *epee::misc_utils::move_it_backward(--by_time_index.end(), i);
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::is_ip_allowed(uint32_t ip)
{
//never allow loopback ip
if(epee::net_utils::is_ip_loopback(ip))
return false;
if(!m_allow_local_ip && epee::net_utils::is_ip_local(ip))
return false;
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::get_peerlist_head(std::list<peerlist_entry>& bs_head, uint32_t depth)
{
CRITICAL_REGION_LOCAL(m_peerlist_lock);
peers_indexed::index<by_time>::type& by_time_index=m_peers_white.get<by_time>();
uint32_t cnt = 0;
BOOST_REVERSE_FOREACH(const peers_indexed::value_type& vl, by_time_index)
{
if(!vl.last_seen)
continue;
bs_head.push_back(vl);
if(cnt++ > depth)
break;
}
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::get_peerlist_full(std::list<peerlist_entry>& pl_gray, std::list<peerlist_entry>& pl_white)
{
CRITICAL_REGION_LOCAL(m_peerlist_lock);
peers_indexed::index<by_time>::type& by_time_index_gr=m_peers_gray.get<by_time>();
BOOST_REVERSE_FOREACH(const peers_indexed::value_type& vl, by_time_index_gr)
{
pl_gray.push_back(vl);
}
peers_indexed::index<by_time>::type& by_time_index_wt=m_peers_white.get<by_time>();
BOOST_REVERSE_FOREACH(const peers_indexed::value_type& vl, by_time_index_wt)
{
pl_white.push_back(vl);
}
return true;
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::set_peer_just_seen(peerid_type peer, uint32_t ip, uint32_t port)
{
net_address addr;
addr.ip = ip;
addr.port = port;
return set_peer_just_seen(peer, addr);
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::set_peer_just_seen(peerid_type peer, const net_address& addr)
{
TRY_ENTRY();
CRITICAL_REGION_LOCAL(m_peerlist_lock);
//find in white list
peerlist_entry ple;
ple.adr = addr;
ple.id = peer;
ple.last_seen = time(NULL);
return append_with_peer_white(ple);
CATCH_ENTRY_L0("peerlist_manager::set_peer_just_seen()", false);
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::append_with_peer_white(const peerlist_entry& ple)
{
TRY_ENTRY();
if(!is_ip_allowed(ple.adr.ip))
return true;
CRITICAL_REGION_LOCAL(m_peerlist_lock);
//find in white list
auto by_addr_it_wt = m_peers_white.get<by_addr>().find(ple.adr);
if(by_addr_it_wt == m_peers_white.get<by_addr>().end())
{
//put new record into white list
m_peers_white.insert(ple);
trim_white_peerlist();
}else
{
//update record in white list
m_peers_white.replace(by_addr_it_wt, ple);
}
//remove from gray list, if need
auto by_addr_it_gr = m_peers_gray.get<by_addr>().find(ple.adr);
if(by_addr_it_gr != m_peers_gray.get<by_addr>().end())
{
m_peers_gray.erase(by_addr_it_gr);
}
return true;
CATCH_ENTRY_L0("peerlist_manager::append_with_peer_white()", false);
}
//--------------------------------------------------------------------------------------------------
inline
bool peerlist_manager::append_with_peer_gray(const peerlist_entry& ple)
{
TRY_ENTRY();
if(!is_ip_allowed(ple.adr.ip))
return true;
CRITICAL_REGION_LOCAL(m_peerlist_lock);
//find in white list
auto by_addr_it_wt = m_peers_white.get<by_addr>().find(ple.adr);
if(by_addr_it_wt != m_peers_white.get<by_addr>().end())
return true;
//update gray list
auto by_addr_it_gr = m_peers_gray.get<by_addr>().find(ple.adr);
if(by_addr_it_gr == m_peers_gray.get<by_addr>().end())
{
//put new record into white list
m_peers_gray.insert(ple);
trim_gray_peerlist();
}else
{
//update record in white list
m_peers_gray.replace(by_addr_it_gr, ple);
}
return true;
CATCH_ENTRY_L0("peerlist_manager::append_with_peer_gray()", false);
return true;
}
//--------------------------------------------------------------------------------------------------
}
BOOST_CLASS_VERSION(nodetool::peerlist_manager, CURRENT_PEERLIST_STORAGE_ARCHIVE_VER)
| [
"37153171+techqc@users.noreply.github.com"
] | 37153171+techqc@users.noreply.github.com |
8f808f39284292dd692fb1d8103033ea492b167b | f6ed941b1f93bbcb4994372209ea472c98358ac8 | /pageReplacementAlgorithms/FIFOReplacement.cpp | 1616253c8e1641ae125cd2cb729ddb1bfe4279e0 | [] | no_license | KyleGullicksen/Assignment5 | 12ad987fa35c0f4790d790e9b9b19be3500a0e5a | 52d7db24edafdc498781c10eb2d5873652ca409e | refs/heads/master | 2021-03-24T09:43:59.711661 | 2017-12-07T04:07:36 | 2017-12-07T04:07:36 | 112,535,386 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 198 | cpp | //
// Created by stoffel on 12/4/17.
//
#include "FIFOReplacement.h"
bool FIFOReplacement::read(int address)
{
return true;
}
bool FIFOReplacement::write(int address) {
return false;
}
| [
"gulli003@cougars.csusm.edu"
] | gulli003@cougars.csusm.edu |
f5b89bea7e7c63182a51a1bffc74764bba3d90fe | 6ffd23679939f59f0a09c9507a126ba056b239d7 | /dnn/test/cuda/local/local.h | f54c2abd31808ea51dc8fd9c10ff75c103aea56b | [
"LicenseRef-scancode-generic-cla",
"Apache-2.0"
] | permissive | MegEngine/MegEngine | 74c1c9b6022c858962caf7f27e6f65220739999f | 66b79160d35b2710c00befede0c3fd729109e474 | refs/heads/master | 2023-08-23T20:01:32.476848 | 2023-08-01T07:12:01 | 2023-08-11T06:04:12 | 248,175,118 | 5,697 | 585 | Apache-2.0 | 2023-07-19T05:11:07 | 2020-03-18T08:21:58 | C++ | UTF-8 | C++ | false | false | 172 | h | #pragma once
#include <cuda_runtime_api.h>
namespace megdnn {
namespace test {
void pollute_shared_mem(cudaStream_t stream);
} // namespace test
} // namespace megdnn
| [
"megengine@megvii.com"
] | megengine@megvii.com |
cf44963cb28f9475225bcb6f75adf7d808898e17 | 66acaef21d8bc3d03e8fabbf33155f9de84d78df | /src/Simplex.h | d2fe061c8d44ef237f1876dc6e5aa33ff9c5e72d | [] | no_license | QuentinDuval/Algorithms | e68a60f9f926460f5aaa7cf8580f0799934b216e | ba8f8dc53c4d1451ab819025cc8a21165ace2710 | refs/heads/master | 2021-01-02T08:57:30.403501 | 2015-03-19T20:13:34 | 2015-03-19T20:13:34 | 28,277,061 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 600 | h | #pragma once
#include "utils/Matrix.h"
#include <exception>
#include <vector>
namespace algorithm
{
struct Simplex
{
using Vector = std::vector<double>;
using Matrix = utils::Matrix<double>;
//TODO - Return the allocation with the solution
static double solve(Vector const& maxCoef, Matrix const& constraintsMatrix, Vector const& constraintsMaxValues);
//-----------------------------------------------------------------------
class InvalidInputs
: std::domain_error
{
InvalidInputs();
friend Simplex;
};
};
}
| [
"senmenty@gmail.com"
] | senmenty@gmail.com |
1ac501b9a6d229e631cc43735f24e2851a957c96 | 49cd461df8d5acb80f578202e534a1a07ae16806 | /demo/zfsrc/ZFFramework_test/ZFCore_test/ZFCore_ZFSerializable_test.cpp | 8ad72a89371b6466b3cbe8d366315fc8eeed8d17 | [
"MIT"
] | permissive | deepblueparticle/ZFFramework | 695a9adba01bba37e22f20b6242af17716182c39 | f65caed122a9ee273eb41f9dca31c1d10298216f | refs/heads/master | 2020-03-20T18:42:10.503495 | 2018-06-15T10:47:34 | 2018-06-15T10:47:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,062 | cpp | /* ====================================================================== *
* Copyright (c) 2010-2018 ZFFramework
* Github repo: https://github.com/ZFFramework/ZFFramework
* Home page: http://ZFFramework.com
* Blog: http://zsaber.com
* Contact: master@zsaber.com (Chinese and English only)
* Distributed under MIT license:
* https://github.com/ZFFramework/ZFFramework/blob/master/LICENSE
* ====================================================================== */
#include "ZFCore_test.h"
ZF_NAMESPACE_GLOBAL_BEGIN
zfclass _ZFP_ZFCore_ZFSerializable_test_TestClass : zfextends ZFObject, zfimplements ZFSerializable
{
ZFOBJECT_DECLARE(_ZFP_ZFCore_ZFSerializable_test_TestClass, ZFObject)
ZFIMPLEMENTS_DECLARE(ZFSerializable)
public:
ZFPROPERTY_ASSIGN(zfstring, stringInParent)
protected:
zfoverride
virtual void objectInfoOnAppend(ZF_IN_OUT zfstring &ret)
{
zfsuper::objectInfoOnAppend(ret);
ZFClassUtil::objectPropertyInfo(ret, this);
}
};
zfclass _ZFP_ZFCore_ZFSerializable_test_TestClassChild : zfextends _ZFP_ZFCore_ZFSerializable_test_TestClass
{
ZFOBJECT_DECLARE(_ZFP_ZFCore_ZFSerializable_test_TestClassChild, _ZFP_ZFCore_ZFSerializable_test_TestClass)
ZFPROPERTY_ASSIGN(zfstring, stringInChild)
};
zfclass _ZFP_ZFCore_ZFSerializable_test_TestClassContainer : zfextends ZFObject, zfimplements ZFSerializable
{
ZFOBJECT_DECLARE(_ZFP_ZFCore_ZFSerializable_test_TestClassContainer, ZFObject)
ZFIMPLEMENTS_DECLARE(ZFSerializable)
public:
ZFPROPERTY_RETAIN(ZFObject *, serializableMember)
protected:
zfoverride
virtual void objectInfoOnAppend(ZF_IN_OUT zfstring &ret)
{
ret += this->classData()->className();
ZFClassUtil::objectPropertyInfo(ret, this);
}
};
// ============================================================
zfclass ZFCore_ZFSerializable_test : zfextends ZFFramework_test_TestCase
{
ZFOBJECT_DECLARE(ZFCore_ZFSerializable_test, ZFFramework_test_TestCase)
protected:
zfoverride
virtual void testCaseOnStart(void)
{
zfsuper::testCaseOnStart();
this->testCaseOutputSeparator();
this->testCaseOutput(zfText("ZFSerializable: normal serializable object"));
this->test(this->obj);
this->testCaseOutputSeparator();
this->testCaseOutput(zfText("ZFSerializable: inherit serializable object"));
this->test(this->objChild);
this->testCaseOutputSeparator();
this->testCaseOutput(zfText("ZFSerializable: serializable object that contains another serializable object"));
this->test(this->objContainer);
this->testCaseStop();
}
protected:
virtual void objectOnInit(void)
{
zfsuper::objectOnInit();
this->memberPrepare();
}
virtual void objectOnDealloc(void)
{
this->memberDestroy();
zfsuper::objectOnDealloc();
}
private:
_ZFP_ZFCore_ZFSerializable_test_TestClass *obj;
_ZFP_ZFCore_ZFSerializable_test_TestClassChild *objChild;
_ZFP_ZFCore_ZFSerializable_test_TestClassContainer *objContainer;
void memberPrepare(void)
{
this->obj = zfAlloc(_ZFP_ZFCore_ZFSerializable_test_TestClass);
this->obj->stringInParentSet(zfText("base's string, with unicode chars: \"啊哦\""));
this->objChild = zfAlloc(_ZFP_ZFCore_ZFSerializable_test_TestClassChild);
this->objChild->stringInParentSet(zfText("child's string"));
this->objChild->stringInChildSet(zfText("child's string in child"));
this->objContainer = zfAlloc(_ZFP_ZFCore_ZFSerializable_test_TestClassContainer);
_ZFP_ZFCore_ZFSerializable_test_TestClassChild *objTmp = zfAlloc(_ZFP_ZFCore_ZFSerializable_test_TestClassChild);
objTmp->stringInParentSet(zfText("container's string"));
objTmp->stringInChildSet(zfText("container's string"));
this->objContainer->serializableMemberSet(objTmp);
zfRelease(objTmp);
}
void memberDestroy(void)
{
zfRelease(this->obj);
this->obj = zfnull;
zfRelease(this->objChild);
this->objChild = zfnull;
zfRelease(this->objContainer);
this->objContainer = zfnull;
}
void test(ZFSerializable *serializableObj)
{
zfstring encodedData;
this->testCaseOutput(zfText("object:\n%s\n"), serializableObj->toObject()->objectInfo().cString());
ZFObjectToString(encodedData, serializableObj->toObject());
this->testCaseOutput(zfText("encodedData:\n%s\n"), encodedData.cString());
ZFSerializableData serializableData;
serializableObj->serializeToData(serializableData);
this->testCaseOutput(zfText("serializableData:\n%s\n"), serializableData.objectInfo().cString());
zfautoObject newSerializableObj = ZFObjectFromString(encodedData.cString());
this->testCaseOutput(zfText("re-serialize from encodedData, result:\n%s\n"), newSerializableObj.toObject()->objectInfo().cString());
}
};
ZFOBJECT_REGISTER(ZFCore_ZFSerializable_test)
ZF_NAMESPACE_GLOBAL_END
| [
"z@zsaber.com"
] | z@zsaber.com |
a51d115bb9c4cf2bee96aeda254a78d3ed5ea9bb | de104c9e74b5eebf35b0449a6082198e364af50c | /MathGame/RandGen.cpp | 119be273c549a3ecc291d4266660ffd7a28060d5 | [] | no_license | bitsVincent/MathGame | 829fadcdb2b05230c22e77ce1ab8a0f4cf32bc7c | 803ca9a01e917a7c03cd5115c0a391e45c8a3941 | refs/heads/master | 2020-03-25T11:38:40.103386 | 2018-08-10T04:40:08 | 2018-08-10T04:40:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,259 | cpp | #include "stdafx.h"
#include "RandGen.h"
#include <time.h>
#include <stdlib.h>
RandGen::RandGen()
{
srand((unsigned int)(time(NULL)));
}
void RandGen::genRandNum(int MODE)
{
switch (MODE) {
case 0:
RandGen::randNum1 = rand() % 9;
RandGen::randNum2 = rand() % 9;
RandGen::total = getNum1() + getNum2();
break;
case 1:
RandGen::randNum1 = 10 + rand() % 90;
RandGen::randNum2 = 10 + rand() % 90;
RandGen::total = getNum1() + getNum2();
break;
case 2:
RandGen::randNum1 = 100 + rand() % 900;
RandGen::randNum2 = 100 + rand() % 900;
RandGen::total = getNum1() + getNum2();
break;
case 3:
RandGen::randNum1 = 1000 + rand() % 9000;
RandGen::randNum2 = 1000 + rand() % 9000;
RandGen::total = getNum1() + getNum2();
break;
case 4:
RandGen::randNum1 = 10000 + rand() % 90000;
RandGen::randNum2 = 10000 + rand() % 90000;
RandGen::total = getNum1() + getNum2();
break;
case 5:
RandGen::randNum1 = 100000 + rand() % 900000;
RandGen::randNum2 = 100000 + rand() % 900000;
RandGen::total = getNum1() + getNum2();
break;
default:
;
}
}
int RandGen::getNum1()
{
return this->randNum1;
}
int RandGen::getNum2()
{
return this->randNum2;
}
int RandGen::getTotal()
{
return this->total;
}
RandGen::~RandGen()
{
}
| [
"1541372584@qq.com"
] | 1541372584@qq.com |
addbffeda2f034970fae9abf3b6864584c4e7dce | 7afa82da6ce4a4fb6b625b12cbcc9c20acf128d1 | /src/main/headers/Dirt.h | 3ff955b52f666f6b580c6aa0a6396c3fcf7f90d7 | [] | no_license | RobKortowski/Dungeon | 47bb3f2f21b161946e291191d59d266e1045c073 | 9a8cf6ff47c0116964d7d90f6b5469f953aa6120 | refs/heads/master | 2021-01-20T02:15:49.248836 | 2017-08-19T20:46:24 | 2017-08-19T20:46:24 | 101,311,620 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 448 | h | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: Dirt.h
* Author: Robert Kortowski robjudo@wp.pl
*
* Created on March 28, 2017, 12:45 AM
*/
#ifndef DIRT_H
#define DIRT_H
#include "Block.h"
struct Dirt : Block {
Dirt();
std::string to_string() override;
};
#endif /* DIRT_H */
| [
"robjudo@wp.pl"
] | robjudo@wp.pl |
6e0cf393fbf5e331ed85179875d1abb7742e925e | bd062ba413f4c425c8ce662fa5a63f639cee0511 | /src/tracker/HModel/Model.cpp | 1866505c90e8bb147eb41cdea103980a324f37e4 | [] | no_license | TuringKi/hmodel | 11cb03babeb2399ec978585081c0cf82e6ad3de1 | 630e26a71bf143ac11d029549903e74b3e148224 | refs/heads/master | 2022-03-13T15:07:03.945981 | 2017-09-27T05:35:22 | 2017-09-27T05:35:22 | 104,976,945 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 26,808 | cpp | #include "Model.h"
#include <vector>
#include <map>
#include <iostream>
#include <fstream>
#include <Eigen/Geometry>
#include "DataLoader.h"
#include "ModelSemantics.h";
#include "tracker/OpenGL/DebugRenderer/DebugRenderer.h"
#include "tracker/Data/Camera.h"
Model::Model() :outline_finder(this), serializer(this), semantics(this) {
centers = std::vector<glm::vec3>();
radii = std::vector<float>();
blocks = std::vector<glm::ivec3>();
theta = std::vector<float>(num_thetas, 0);
phalanges = std::vector<Phalange>(num_phalanges + 2, Phalange());
dofs = std::vector<Dof>(num_thetas, Dof());
host_pointer_centers = NULL;
host_pointer_radii = NULL;
host_pointer_blocks = NULL;
host_pointer_tangent_points = NULL;
host_pointer_outline = NULL;
host_pointer_blockid_to_jointid_map = NULL;
camera_ray = glm::vec3(0, 0, 1);
rendered_pixels = new int[upper_bound_num_rendered_outline_points];
rendered_points = new float[3 * upper_bound_num_rendered_outline_points];
rendered_block_ids = new int[upper_bound_num_rendered_outline_points];
}
Model::~Model() {
if (host_pointer_centers) delete[] host_pointer_centers;
if (host_pointer_radii) delete[] host_pointer_radii;
if (host_pointer_blocks) delete[] host_pointer_blocks;
if (host_pointer_tangent_points) delete[] host_pointer_tangent_points;
if (host_pointer_outline) delete[] host_pointer_outline;
if (host_pointer_blockid_to_jointid_map) delete[] host_pointer_blockid_to_jointid_map;
delete[] rendered_pixels;
delete[] rendered_points;
delete[] rendered_block_ids;
}
void Model::init(int user_name, std::string data_path) {
model_type = HMODEL;
this->user_name = (UserName)user_name;
this->data_path = data_path;
if (model_type == HMODEL_OLD || model_type == HMODEL) {
load_model_from_file();
semantics.setup_topology();
semantics.setup_outline();
semantics.setup_dofs();
semantics.setup_phalanges();
move(std::vector<float>(num_thetas, 0));
initialize_offsets();
}
semantics.setup_kinematic_chain();
for (size_t i = 0; i < num_phalanges - 1; i++) jointid_to_phalangeid_map[phalanges[i].segment_id] = i;
cout << "minus one in jointid_to_phalangeid_map" << endl;
jointid_to_phalangeid_map[7] = 3;
jointid_to_phalangeid_map[11] = 6;
jointid_to_phalangeid_map[15] = 9;
jointid_to_phalangeid_map[19] = 12;
jointid_to_phalangeid_map[23] = 15;
/*for (size_t i = 0; i < num_phalanges; i++) {
Phalange phalange = phalanges[i];
cout << "id = " << i << endl;
cout << "init_local: " << endl << phalange.init_local << endl;
cout << endl << endl;
}*/
//print_model();
}
void Model::initialize_offsets() {
for (size_t i = 0; i < num_phalanges; i++) {
//cout << endl << i << endl;
if (phalanges[i].attachments.empty()) continue;
phalanges[i].offsets.resize(phalanges[i].attachments.size());
for (size_t j = 0; j < phalanges[i].attachments.size(); j++) {
Vec3f c = Eigen::Vector3f(centers[phalanges[i].attachments[j]][0], centers[phalanges[i].attachments[j]][1], centers[phalanges[i].attachments[j]][2]);
Mat3d inverse = (phalanges[i].global.block(0, 0, 3, 3).cast<double>()).inverse();
Vec3d offset = inverse * (c - phalanges[i].global.block(0, 3, 3, 1)).cast<double>();
phalanges[i].offsets[j] = offset;
//phalanges[i].offsets[j] = phalanges[i].global.block(0, 0, 3, 3).inverse() * (c - phalanges[i].global.block(0, 3, 3, 1));
//cout << "attachment_id = " << phalanges[i].attachments[j] << endl;
//cout << " center = " << centers[phalanges[i].center_id][0] << ", " << centers[phalanges[i].center_id][1] << ", " << centers[phalanges[i].center_id][2] << endl;
//cout << "R = " << phalanges[i].global.block(0, 0, 3, 3) << endl;
//cout << " offset = " << phalanges[i].offsets[j][0] << ", " << phalanges[i].offsets[j][1] << ", " << phalanges[i].offsets[j][2] << endl;
}
}
}
void Model::reindex() {
for (size_t i = 0; i < blocks.size(); i++) {
if (blocks[i][2] == RAND_MAX) {
if (radii[blocks[i][0]] < radii[blocks[i][1]]) {
std::swap(blocks[i][0], blocks[i][1]);
}
}
else {
if (radii[blocks[i][0]] <= radii[blocks[i][1]] && radii[blocks[i][1]] <= radii[blocks[i][2]]) {
blocks[i] = glm::ivec3(blocks[i][2], blocks[i][1], blocks[i][0]);
}
if (radii[blocks[i][0]] <= radii[blocks[i][2]] && radii[blocks[i][2]] <= radii[blocks[i][1]]) {
blocks[i] = glm::ivec3(blocks[i][1], blocks[i][2], blocks[i][0]);
}
if (radii[blocks[i][1]] <= radii[blocks[i][0]] && radii[blocks[i][0]] <= radii[blocks[i][2]]) {
blocks[i] = glm::ivec3(blocks[i][2], blocks[i][0], blocks[i][1]);
}
if (radii[blocks[i][1]] <= radii[blocks[i][2]] && radii[blocks[i][2]] <= radii[blocks[i][0]]) {
blocks[i] = glm::ivec3(blocks[i][0], blocks[i][2], blocks[i][1]);
}
if (radii[blocks[i][2]] <= radii[blocks[i][0]] && radii[blocks[i][0]] <= radii[blocks[i][1]]) {
blocks[i] = glm::ivec3(blocks[i][1], blocks[i][0], blocks[i][2]);
}
}
}
}
void Model::compute_outline() {
outline_finder.find_outline();
//outline_finder.write_outline();
//outline_finder.compute_projections_outline(centers, radii, data_points, camera_ray);
}
void Model::compute_tangent_point(const glm::vec3 & camera_ray, glm::vec3 & c1, const glm::vec3 & c2, const glm::vec3 & c3, float r1, float r2, float r3,
glm::vec3 & v1, glm::vec3 & v2, glm::vec3 & v3, glm::vec3 & u1, glm::vec3 & u2, glm::vec3 & u3, glm::vec3 & n, glm::vec3 & m) {
/*std::cout << "c1 = (" << c1[0] << ", " << c1[1] << ", " << c1[2] << ")" << std::endl;
std::cout << "c2 = (" << c2[0] << ", " << c2[1] << ", " << c2[2] << ")" << std::endl;
std::cout << "c3 = (" << c3[0] << ", " << c3[1] << ", " << c3[2] << ")" << std::endl;
std::cout << "r1 = " << r1 << std::endl;
std::cout << "r2 = " << r2 << std::endl;
std::cout << "r3 = " << r3 << std::endl;*/
float epsilon = 1e-2;
if (r1 - r2 < epsilon && r1 - r3 < epsilon) {
n = cross(c1 - c2, c1 - c3); n = n / length(n);
if (dot(camera_ray, n) < 0) {
m = -n;
}
else {
m = n;
n = -m;
}
v1 = c1 + r1 * n;
v2 = c2 + r2 * n;
v3 = c3 + r3 * n;
u1 = c1 + r1 * m;
u2 = c2 + r2 * m;
u3 = c3 + r3 * m;
/*std::cout << "n = (" << n[0] << ", " << n[1] << ", " << n[2] << ")" << std::endl;
std::cout << "v1 = (" << v1[0] << ", " << v1[1] << ", " << v1[2] << ")" << std::endl;
std::cout << "v2 = (" << v2[0] << ", " << v2[1] << ", " << v2[2] << ")" << std::endl;
std::cout << "v3 = (" << v3[0] << ", " << v3[1] << ", " << v3[2] << ")" << std::endl;
std::cout << std::endl << std::endl;*/
return;
}
glm::vec3 z12 = c1 + (c2 - c1) * r1 / (r1 - r2);
glm::vec3 z13 = c1 + (c3 - c1) * r1 / (r1 - r3);
glm::vec3 l = (z12 - z13) / length(z12 - z13);
float projection = dot(c1 - z12, l);
glm::vec3 z = z12 + projection * l;
float eta = length(c1 - z);
float sin_beta = r1 / eta;
float nu = sqrt(eta * eta - r1 * r1);
float cos_beta = nu / eta;
glm::vec3 f = (c1 - z) / eta;
glm::vec3 h = cross(l, f);
normalize(h);
glm::vec3 g;
g = sin_beta * h + cos_beta * f;
v1 = z + nu * g;
n = (v1 - c1) / length(v1 - c1);
v2 = c2 + r2 * n;
v3 = c3 + r3 * n;
g = -sin_beta * h + cos_beta * f;
u1 = z + nu * g;
m = (u1 - c1) / length(u1 - c1);
u2 = c2 + r2 * m;
u3 = c3 + r3 * m;
if (dot(camera_ray, n) > 0) {
std::swap(v1, u1);
std::swap(v2, u2);
std::swap(v3, u3);
std::swap(n, m);
}
}
void Model::compute_tangent_points() {
//cout << "centers.size() = " << centers.size() << endl;
//cout << "radii.size() = " << radii.size() << endl;
//cout << "blocks.size() = " << blocks.size() << endl;
tangent_points = std::vector<Tangent>(blocks.size(), Tangent());
for (size_t i = 0; i < blocks.size(); i++) {
if (blocks[i][2] > centers.size()) continue;
//cout << "c1 = " << centers[blocks[i][0]][0] << endl;
//cout << "c2 = " << centers[blocks[i][1]][0] << endl;
//cout << "c3 = " << centers[blocks[i][2]][0] << endl;
compute_tangent_point(camera_ray, centers[blocks[i][0]], centers[blocks[i][1]], centers[blocks[i][2]],
radii[blocks[i][0]], radii[blocks[i][1]], radii[blocks[i][2]],
tangent_points[i].v1, tangent_points[i].v2, tangent_points[i].v3,
tangent_points[i].u1, tangent_points[i].u2, tangent_points[i].u3,
tangent_points[i].n, tangent_points[i].m);
//std::cout << "in model: (" << tangent_points[i].v1[0] << ", " << tangent_points[i].v1[1] << ", " << tangent_points[i].v1[2] << " ); " << std::endl;
}
}
void Model::print_model() {
std::cout << "CENTERS" << std::endl;
for (size_t i = 0; i < centers.size(); i++) {
for (size_t j = 0; j < d; j++) {
std::cout << centers[i][j] << " ";
}
std::cout << std::endl;
}
std::cout << "RADII" << std::endl;
for (size_t i = 0; i < radii.size(); i++) {
std::cout << radii[i] << std::endl;
}
std::cout << "BLOCKS" << std::endl;
for (size_t i = 0; i < blocks.size(); i++) {
for (size_t j = 0; j < d; j++) {
if (blocks[i][j] < centers.size())
std::cout << blocks[i][j] << " ";
}
std::cout << std::endl;
}
std::cout << "TANGENT POINTS" << std::endl;
for (size_t i = 0; i < tangent_points.size(); i++) {
if (blocks[i][2] > centers.size()) continue;
std::cout << "block " << i << std::endl;
std::cout << " v1: "; for (size_t j = 0; j < d; j++) std::cout << tangent_points[i].v1[j] << " "; std::cout << std::endl;
std::cout << " v2: "; for (size_t j = 0; j < d; j++) std::cout << tangent_points[i].v2[j] << " "; std::cout << std::endl;
std::cout << " v3: "; for (size_t j = 0; j < d; j++) std::cout << tangent_points[i].v3[j] << " "; std::cout << std::endl;
std::cout << " u1: "; for (size_t j = 0; j < d; j++) std::cout << tangent_points[i].u1[j] << " "; std::cout << std::endl;
std::cout << " u2: "; for (size_t j = 0; j < d; j++) std::cout << tangent_points[i].u2[j] << " "; std::cout << std::endl;
std::cout << " u3: "; for (size_t j = 0; j < d; j++) std::cout << tangent_points[i].u3[j] << " "; std::cout << std::endl;
}
}
void Model::render_outline() {
DebugRenderer::instance().clear();
std::vector<std::pair<Vector3, Vector3>> segments;
std::vector<std::pair<Vector3, Vector3>> arc_endpoints;
std::vector<Vector3> arc_centers;
std::vector<float> arc_radii;
for (size_t i = 0; i < outline_finder.outline3D.size(); i++) {
glm::vec3 s = outline_finder.outline3D[i].start;
glm::vec3 e = outline_finder.outline3D[i].end;
if (outline_finder.outline3D[i].indices[1] != RAND_MAX) {
segments.push_back(std::pair<Vector3, Vector3>(Vector3(s[0], s[1], s[2]), Vector3(e[0], e[1], e[2])));
}
else {
glm::vec3 c = centers[outline_finder.outline3D[i].indices[0]];
arc_centers.push_back(Vector3(c[0], c[1], c[2]));
arc_radii.push_back(radii[outline_finder.outline3D[i].indices[0]]);
arc_endpoints.push_back(std::pair<Vector3, Vector3>(Vector3(s[0], s[1], s[2]), Vector3(e[0], e[1], e[2])));
}
}
DebugRenderer::instance().add_segments(segments, Vector3(0.673, 0.286, 0.406));
DebugRenderer::instance().add_arcs(arc_endpoints, arc_centers, arc_radii, Vector3(0.673, 0.286, 0.406));
}
int Model::compute_rendered_indicator_helper(int row, int col, Vector3 p, int block, int num_rendered_points, bool display,
cv::Mat & image, const cv::Mat & sensor_silhouette, Camera * camera) {
row = camera->height() - row - 1;
if (col < 1 || col >= camera->width() || row < 1 || row >= camera->height()) return num_rendered_points;
if (sensor_silhouette.at<uchar>(row, col) == 255) return num_rendered_points;
rendered_pixels[num_rendered_points] = row * camera->width() + col;
rendered_points[3 * num_rendered_points] = p[0];
rendered_points[3 * num_rendered_points + 1] = p[1];
rendered_points[3 * num_rendered_points + 2] = p[2];
rendered_block_ids[num_rendered_points] = block;
num_rendered_points++;
if (display) {
image.at<cv::Vec3b>(cv::Point(2 * col - 1, 2 * row - 1)) = cv::Vec3b(200, 200, 0);
image.at<cv::Vec3b>(cv::Point(2 * col - 1, 2 * row)) = cv::Vec3b(200, 200, 0);
image.at<cv::Vec3b>(cv::Point(2 * col, 2 * row - 1)) = cv::Vec3b(200, 200, 0);
image.at<cv::Vec3b>(cv::Point(2 * col, 2 * row)) = cv::Vec3b(200, 200, 0);
}
return num_rendered_points;
}
void Model::compute_rendered_indicator(const cv::Mat & sensor_silhouette, Camera * camera) {
bool display = false;
cv::Mat image;
if (display) {
cv::Scalar color = cv::Scalar(100, 0, 230);
cv::Mat in[] = { sensor_silhouette, sensor_silhouette, sensor_silhouette };
cv::merge(in, 3, image);
cv::resize(image, image, cv::Size(640, 480));
}
num_rendered_points = 0;
for (size_t i = 0; i < outline_finder.outline3D.size(); i++) {
glm::vec3 s_glm = outline_finder.outline3D[i].start;
glm::vec3 e_glm = outline_finder.outline3D[i].end;
Vector3 s = Vector3(s_glm[0], s_glm[1], s_glm[2]);
Vector3 e = Vector3(e_glm[0], e_glm[1], e_glm[2]);
int block = outline_finder.outline3D[i].block;
if (outline_finder.outline3D[i].indices[1] != RAND_MAX) {
Vector2 s_image = camera->world_to_image(s);
Vector2 e_image = camera->world_to_image(e);
float x1 = s_image[0]; float y1 = s_image[1];
float x2 = e_image[0]; float y2 = e_image[1];
float X1 = s[0]; float Y1 = s[1]; float Z1 = s[2];
float X2 = e[0]; float Y2 = e[1]; float Z2 = e[2];
int num_samples = 1.2 * (e_image - s_image).norm();
for (int n = 0; n < num_samples; n++) {
float t = (float)n / (num_samples - 1);
float x = x1 + t * (x2 - x1);
float y = y1 + t * (y2 - y1);
Vector3 p = Vector3(X1 + t * (X2 - X1), Y1 + t * (Y2 - Y1), Z1 + t * (Z2 - Z1));
int col = (int)x;
int row = (int)y;
num_rendered_points = compute_rendered_indicator_helper(row, col, p, block, num_rendered_points, display, image, sensor_silhouette, camera);
}
}
else {
glm::vec3 c_glm = centers[outline_finder.outline3D[i].indices[0]];
float r = radii[outline_finder.outline3D[i].indices[0]];
Vector3 c = Vector3(c_glm[0], c_glm[1], c_glm[2]);
Vector2 c_image = camera->world_to_image(c);
Vector2 s_image = camera->world_to_image(s);
float r_image = (c_image - s_image).norm();
Vector3 v1 = s - c;
Vector3 v2 = e - c;
float phi;
Vector2 u = Vector2(1, 0); Vector2 v = Vector2(0, 1);
Vector3 U = Vector3(1, 0, 0); Vector3 V = Vector3(0, 1, 0);
float alpha = atan2(v1[0], v1[1]);
float beta = atan2(v2[0], v2[1]);
if (beta > alpha) alpha = alpha + 2 * M_PI;
int num_samples = 1.2 * (alpha - beta) * r_image;
for (int n = 0; n < num_samples; n++) {
phi = alpha + n * (beta - alpha) / (num_samples - 1);
Vector2 x = c_image + r_image * (u * sin(phi) + v * cos(phi));
Vector3 p = c + r * (U * sin(phi) + V * cos(phi));
int col = (int)x[0];
int row = (int)x[1];
num_rendered_points = compute_rendered_indicator_helper(row, col, p, block, num_rendered_points, display, image, sensor_silhouette, camera);
}
}
}
if (display) cv::imshow("sensor_silhouette", image);
/*num_rendered_points = 0;
for (int row = 0; row < rendered_silhouette.rows; ++row) {
for (int col = 0; col < rendered_silhouette.cols; ++col) {
if (rendered_silhouette.at<uchar>(row, col) != 255 && sensor_silhouette.at<uchar>(row, col) != 255) {
rendered_indicator[num_rendered_points] = row * camera->width() + col;
num_rendered_points++;
}
}
}*/
}
void Model::write_model(std::string data_path, int frame_number) {
std::ofstream centers_file;
centers_file.open(data_path + "C-" + std::to_string(frame_number) + ".txt");
centers_file << centers.size() << " ";
for (size_t i = 0; i < centers.size(); i++) {
for (size_t j = 0; j < 3; j++) {
centers_file << centers[i][j] << " ";
}
}
centers_file.close();
std::ofstream radii_file;
radii_file.open(data_path + "R-" + std::to_string(frame_number) + ".txt");
radii_file << radii.size() << " ";
for (size_t i = 0; i < radii.size(); i++) {
radii_file << radii[i] << " ";
}
radii_file.close();
std::ofstream blocks_file;
blocks_file.open(data_path + "B-" + std::to_string(frame_number) + ".txt");
blocks_file << blocks.size() << " ";
for (size_t i = 0; i < blocks.size(); i++) {
for (size_t j = 0; j < 3; j++) {
blocks_file << blocks[i][j] << " ";
}
}
blocks_file.close();
std::ofstream theta_file;
theta_file.open(data_path + "T-" + std::to_string(frame_number) + ".txt");
theta_file << theta.size() << " ";
for (size_t i = 0; i < theta.size(); i++) {
theta_file << theta[i] << " ";
}
theta_file.close();
std::ofstream transformations_file;
transformations_file.open(data_path + "I-" + std::to_string(frame_number) + ".txt");
transformations_file << num_phalanges << endl;
for (size_t i = 0; i < num_phalanges; i++) {
for (size_t u = 0; u < 4; u++) {
for (size_t v = 0; v < 4; v++) {
//transformations_file << phalanges[i].global(u, v) << " ";
transformations_file << phalanges[i].init_local(u, v) << " ";
}
}
}
transformations_file.close();
}
void Model::load_model_from_file() {
blocks.clear();
std::string model_folder_path = "models/anastasia/";
read_float_matrix(data_path + model_folder_path, "C", centers);
read_float_vector(data_path + model_folder_path, "R", radii);
read_int_matrix(data_path + model_folder_path, "B", blocks);
// Read initial transformations
FILE *fp = fopen((data_path + model_folder_path + "I.txt").c_str(), "r");
int N;
fscanf(fp, "%d", &N);
for (int i = 0; i < N; ++i) {
phalanges[i].init_local = Mat4f::Zero(d + 1, d + 1);
for (size_t u = 0; u < d + 1; u++) {
for (size_t v = 0; v < d + 1; v++) {
fscanf(fp, "%f", &phalanges[i].init_local(v, u));
}
}
}
fclose(fp);
/*for (size_t i = 0; i < centers.size(); i++) {
centers[i] += glm::vec3(0, -70, 400);
}*/
}
// Inverse kinematics
Matrix_3xN Model::jacobian(const Vector3 & s, size_t id) {
Matrix_3xN J = Matrix_3xN::Zero(d, num_thetas);
for (size_t i = 0; i < phalanges[id].kinematic_chain.size(); i++) {
size_t dof_id = phalanges[id].kinematic_chain[i];
size_t phalange_id = dofs[dof_id].phalange_id;
Vector3 u = dofs[dof_id].axis;
Vector3 p = phalanges[phalange_id].global.block(0, 3, 3, 1);
Transform3f T = Transform3f(phalanges[phalange_id].global);
Vector3 v = T * u - p; // rotated axis
switch (dofs[dof_id].type) {
case TRANSLATION_AXIS:
//J.col(dof_id) = T * u;
J.col(dof_id) = u;
break;
case ROTATION_AXIS:
J.col(dof_id) = v.cross(s - p);
break;
}
/*std::cout << endl << "i = " << i << std::endl;
std::cout << "axis = " << u.transpose() << std::endl;
std::cout << "p = " << p.transpose() << std::endl;
std::cout << "s = " << s.transpose() << std::endl;
std::cout << "T = " << endl << phalanges[phalange_id].global << std::endl;
std::cout << "v = " << v.transpose() << std::endl;*/
}
return J;
}
void Model::update(Phalange & phalange) {
if (phalange.parent_id >= 0)
phalange.global = phalanges[phalange.parent_id].global * phalange.local;
else phalange.global = phalange.local;
for (size_t i = 0; i < phalange.children_ids.size(); i++) update(phalanges[phalange.children_ids[i]]);
}
void Model::translate(Phalange & phalange, const Vec3f & t) {
phalange.local(0, 3) += t[0];
phalange.local(1, 3) += t[1];
phalange.local(2, 3) += t[2];
update(phalange);
//cout << phalange.local << endl;
}
void Model::rotate(Phalange & phalange, const Vec3f &axis, float angle) {
phalange.local = phalange.local * Transform3f(Eigen::AngleAxisf(angle, axis)).matrix();
update(phalange);
}
void Model::transform_joints(const std::vector<float> & theta) {
//cout << "transform_joints" << endl;
for (size_t i = 0; i < dofs.size(); ++i) {
if (dofs[i].phalange_id == -1) continue;
switch (dofs[i].type) {
case TRANSLATION_AXIS:
translate(phalanges[dofs[i].phalange_id], dofs[i].axis * theta[i]);
break;
case ROTATION_AXIS:
rotate(phalanges[dofs[i].phalange_id], dofs[i].axis, theta[i]);
break;
}
}
}
void Model::move(const std::vector<float> & theta) {
for (size_t i = 0; i < num_thetas; i++) {
this->theta[i] = theta[i];
}
for (size_t i = 0; i < num_phalanges + 1; i++) {
phalanges[i].local = phalanges[i].init_local;
}
//cout << "move" << endl;
vector<float> rotateX(num_thetas, 0); // flexion
vector<float> rotateZ(num_thetas, 0); // abduction
vector<float> rotateY(num_thetas, 0); // twist
vector<float> globals(num_thetas, 0); // pose
for (size_t i = 0; i < num_thetas; ++i) {
if (dofs[i].phalange_id < num_phalanges && dofs[i].type == ROTATION_AXIS) {
if (dofs[i].axis == Vec3f(1, 0, 0))
rotateX[i] = theta[i];
else if (dofs[i].axis == Vec3f(0, 1, 0))
rotateY[i] = theta[i];
else if (dofs[i].axis == Vec3f(0, 0, 1))
rotateZ[i] = theta[i];
else
cout << "wrong axis" << endl;
}
else
globals[i] = theta[i];
}
//transform joints separately
transform_joints(globals); // pose
transform_joints(rotateX); // flexion
transform_joints(rotateZ); // abduction
transform_joints(rotateY); // twist
}
void Model::update_centers() {
for (size_t i = 0; i < num_phalanges; i++) {
Vec3f p = phalanges[i].global.block(0, 3, 3, 1);
centers[phalanges[i].center_id] = glm::vec3(p[0], p[1], p[2]);
/*//cout << endl << phalanges[i].global.block(0, 3, 3, 1).transpose() << endl;
cout << endl << endl << endl << "i = " << i << endl;
cout << "name = " << phalanges[i].name << endl;
cout << "center_id = " << phalanges[i].center_id << endl;
cout << " center = " << centers[phalanges[i].center_id][0] << ", " << centers[phalanges[i].center_id][1] << ", " << centers[phalanges[i].center_id][2] << endl;
//cout << phalanges[i].global << endl << endl;*/
for (size_t j = 0; j < phalanges[i].attachments.size(); j++) {
Vec3d t = phalanges[i].global.block(0, 0, 3, 3).cast<double>() * phalanges[i].offsets[j];
centers[phalanges[i].attachments[j]] = glm::vec3(p[0], p[1], p[2]) + glm::vec3(t[0], t[1], t[2]);
/*cout << endl << "attachment_id = " << phalanges[i].attachments[j] << endl;
cout << "offset = " << phalanges[i].offsets[j][0] << ", " << phalanges[i].offsets[j][1] << ", " << phalanges[i].offsets[j][2] << endl;
cout << " center = " << centers[phalanges[i].attachments[j]][0] << ", " << centers[phalanges[i].attachments[j]][1] << ", " << centers[phalanges[i].attachments[j]][2] << endl;
//cout << "R = " << phalanges[i].global.block(0, 0, 3, 3) << endl;
//cout << "p = " << p[0] << ", " << p[1] << ", " << p[2] << endl;
cout << "t = " << t[0] << ", " << t[1] << ", " << t[2] << endl;*/
}
}
reindex();
compute_tangent_points();
}
std::vector<float> Model::get_updated_parameters(const vector<float> & theta, const vector<float> &delta_theta) {
size_t rx = 3;
size_t ry = 4;
size_t rz = 5;
std::vector<float> updated(num_thetas);
for (size_t i = 0; i < num_thetas; ++i)
updated[i] = theta[i] + (i < delta_theta.size() ? delta_theta[i] : 0);
Vec3f axisX(1, 0, 0);
Vec3f axisY(0, 1, 0);
Vec3f axisZ(0, 0, 1);
Transform3f rX(Eigen::Quaternionf(Eigen::AngleAxisf(delta_theta[rx], axisX)));
Transform3f rY(Eigen::Quaternionf(Eigen::AngleAxisf(delta_theta[ry], axisY)));
Transform3f rZ(Eigen::Quaternionf(Eigen::AngleAxisf(delta_theta[rz], axisZ)));
Mat3f r = (rZ * rX * rY).rotation();
r = phalanges[17].global.block(0, 0, 3, 3) * r;
Vec3f e = r.eulerAngles(0, 1, 2);
updated[rx] = e[0];
updated[ry] = e[1];
updated[rz] = e[2];
return updated;
}
const std::vector<float>& Model::get_theta() {
return theta;
}
Vec3f Model::get_palm_center() {
glm::vec3 palm_center = glm::vec3(0, 0, 0);
if (model_type == HTRACK) {
palm_center += centers[centers_name_to_id_map["palm_top_left"]];
palm_center += centers[centers_name_to_id_map["palm_top_right"]];
palm_center += centers[centers_name_to_id_map["palm_bottom_left"]];
palm_center += centers[centers_name_to_id_map["palm_bottom_right"]];
palm_center = palm_center / 4.0f;
}
if (model_type == HMODEL || model_type == HMODEL_OLD) {
palm_center += centers[centers_name_to_id_map["palm_right"]];
palm_center += centers[centers_name_to_id_map["palm_left"]];
palm_center += centers[centers_name_to_id_map["palm_pinky"]];
palm_center += centers[centers_name_to_id_map["palm_ring"]];
palm_center += centers[centers_name_to_id_map["palm_middle"]];
palm_center += centers[centers_name_to_id_map["palm_index"]];
palm_center = palm_center / 6.0f;
}
return Vec3f(palm_center[0], palm_center[1], palm_center[2]);
}
float Model::get_palm_length() {
float length = 0;
if (model_type == HTRACK) {
length = glm::length(centers[centers_name_to_id_map["palm_top_left"]] - centers[centers_name_to_id_map["palm_bottom_left"]]);
}
if (model_type == HMODEL || model_type == HMODEL_OLD) {
glm::vec3 c = (centers[centers_name_to_id_map["ring_membrane"]] + centers[centers_name_to_id_map["middle_membrane"]]) / 2.0f;
length = glm::length(centers[centers_name_to_id_map["palm_back"]] - c);
}
return length;
}
Mat3f Model::build_rotation_matrix(Vec3f euler_angles) {
float alpha = euler_angles(0);
float beta = euler_angles(1);
float gamma = euler_angles(2);
Mat3f Rx, Ry, Rz;
Rx << 1, 0, 0, 0, cos(alpha), -sin(alpha), 0, sin(alpha), cos(alpha);
Ry << cos(beta), 0, sin(beta), 0, 1, 0, -sin(beta), 0, cos(beta);
Rz << cos(gamma), -sin(gamma), 0, sin(gamma), cos(gamma), 0, 0, 0, 1;
return Rz * Ry * Rx;
}
void Model::manually_adjust_initial_transformations() {
Mat3f R;
// thumb
R = build_rotation_matrix(Vec3f(-1.45, 0.6, -1.95));
phalanges[1].init_local.block(0, 0, 3, 3) = R;
//R = build_rotation_matrix(Vec3f(-1.45, 0.6, -1));
//phalanges[1].init_local.block(0, 0, 3, 3) = R;
// index
R = build_rotation_matrix(Vec3f(0, 0, -0.08));
phalanges[15].init_local.block(0, 0, 3, 3) = R;
//R = build_rotation_matrix(Vec3f(3.1126, 0, 3.6));
//phalanges[13].init_local.block(0, 0, 3, 3) = R;
//middle
R = build_rotation_matrix(Vec3f(3.1067, -0.12, -3.1215));
phalanges[10].init_local.block(0, 0, 3, 3) = R;
// ring
R = build_rotation_matrix(Vec3f(-3.054, 0.0, -2.9823));
phalanges[7].init_local.block(0, 0, 3, 3) = R;
std::vector<float> theta = std::vector<float>(num_thetas, 0);
theta[1] = -70; theta[2] = 400;
theta[9] = 0.7; theta[10] = 0.6;
move(theta);
update_centers();
initialize_offsets();
}
void Model::resize_model(float uniform_scaling_factor, float width_scaling_factor, float thickness_scaling_factor) {
Mat3d scaling_matrix = Mat3d::Identity();
scaling_matrix(0, 0) = uniform_scaling_factor * width_scaling_factor;
scaling_matrix(1, 1) = uniform_scaling_factor;
scaling_matrix(2, 2) = uniform_scaling_factor;
for (size_t i = 0; i < radii.size(); i++) {
radii[i] *= uniform_scaling_factor * thickness_scaling_factor;
}
for (size_t i = 0; i < num_phalanges; i++) {
phalanges[i].init_local.col(3).segment(0, 3) = scaling_matrix.cast <float>() * phalanges[i].init_local.col(3).segment(0, 3);
for (size_t j = 0; j < phalanges[i].attachments.size(); j++) {
phalanges[i].offsets[j] = scaling_matrix * phalanges[i].offsets[j];
}
}
} | [
"Xiao.ma"
] | Xiao.ma |
86fbed0a2115b1053a3f7816961fcd0e576963c1 | 739c8e734139471bfc5d6fd9eaef28ac7f7b8a75 | /Graph - Adjacency List and BFS, Finding Shortest Path.cpp | 86baa8e75d79e9d6fee59a68ce6408280bd80aa2 | [] | no_license | v9the/DataStructure-Algorithms | 0e9bef8d739ff6b604854764e1a2bea478e9bd43 | 9210a67a223f48af7c5ff0e7b9a0a4bb121d8313 | refs/heads/master | 2023-02-23T10:06:32.600327 | 2021-01-29T18:15:18 | 2021-01-29T18:15:18 | 171,965,560 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 956 | cpp | #include <bits/stdc++.h>
using namespace std;
template<typename T>
class Graph {
public:
map<T, vector<T>> adjList;
void addEdge(T u, T v, bool isBiDir = true) {
adjList[u].push_back(v);
if (isBiDir) {
adjList[v].push_back(u);
}
}
void bfs(T src, T dest) {
queue<T> q;
q.push(src);
unordered_map<T, bool> visited;
unordered_map<T, T> dist, parent;
visited[src] = true;
parent[src] = -1;
dist[src] = 0;
while (!q.empty()) {
T node = q.front();
q.pop();
cout << node << ' ';
for (auto a : adjList[node]) {
if (!visited[a]) {
q.push(a);
visited[a] = true;
parent[a] = node;
dist[a] = dist[node] + 1;
}
}
}
cout << '\n';
cout << dest << ' ' << dist[dest] << '\n';
while (dest != -1) {
cout << dest << "<--";
dest = parent[dest];
}
}
};
int main() {
Graph<int> g;
g.addEdge(1, 2);
g.addEdge(1, 3);
g.addEdge(2, 4);
g.addEdge(3, 4);
g.addEdge(4, 5);
g.bfs(1, 5);
} | [
"v9the@outlook.com"
] | v9the@outlook.com |
fa395eace86b1a941a4907c24a664e26bb92205c | 9ef9b07ce3324492dbbb47b8cd99e5e8321370f9 | /BigInt/main.cpp | 18c7fc20c945d561ffc3b28e501620acb997ac3d | [] | no_license | b0gdan0v-bagi/BigInt | 75c74d69eb7612dcd7d0aa3a4e400f714bba7ce4 | 6912d6c5b30dc607c3a872849b0af511553a9aeb | refs/heads/master | 2023-01-09T20:35:07.652716 | 2020-11-06T21:29:49 | 2020-11-06T21:29:49 | 308,058,989 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,753 | cpp | //#include <bits/stdc++.h>
//#include "bigint.h"
#include "bigInt2.h"
#include <iostream>
#include <list>
#include <chrono>
#include <future>
#include <thread>
#include <algorithm>
#include <fstream>
BigInt simpleMulti(BigInt a, BigInt b)
{
return a * b; // make lambda in future!
}
BigInt vectorParralelMultipicator(std::vector<BigInt> v)
{
BigInt ans;
std::cout << "Multiplicating vector with size " << v.size() << "\n";
switch (v.size())
{
case 0: return BIGINT_ONE;
case 1: return v[0];
case 2: return v[0] * v[1];
default:
int size = v.size();
std::vector<std::future<BigInt>> results;
if (size % 2 == 0)
{
ans = BIGINT_ONE;
for (int i = 0; i < size; i += 2) results.push_back(std::async(std::launch::async, simpleMulti, v[i], v[i + 1]));
}
else
{
ans = v.back();
for (int i = 0; i < size - 1; i += 2) results.push_back(std::async(std::launch::async, simpleMulti, v[i], v[i + 1]));
}
std::vector<BigInt> calc(results.size());
for (std::size_t i = 0; i < calc.size(); i++) calc[i] = results[i].get();
ans = ans * vectorParralelMultipicator(calc);
break;
}
// ans = BIGINT_ONE;
return ans;
}
BigInt factorialPartial(int s, int a)
{
std::cout << "Worker " << s << " " << a << " started\n";
auto tp1 = std::chrono::high_resolution_clock::now();
if (a < s) return BIGINT_ONE;
if (a == s) return BigInt(a);
BigInt ans = BIGINT_ONE;
if (a > s)
{
for (int i = s; i <= a; i++) ans = ans * BigInt(i);
}
auto tp2 = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsedTime = tp2 - tp1;
std::cout <<"Worker " << s << " " << a << " ended in " + std::to_string(elapsedTime.count()) + "s\n";
return ans;
}
BigInt factorialP(int a, int nThreads = 10)
{
BigInt ans;
int startPos, lBound, uBound;
if (a % nThreads == 0)
{
startPos = 0;
ans = BIGINT_ONE;
}
else
{
startPos = a % nThreads;
ans = factorial(startPos);
}
//std::cout << "start pos " << startPos << " " << ans << "\n";
std::vector<std::future<BigInt>> par;
for (int i = 0; i < nThreads; i++)
{
lBound = startPos + 1 + a * i / nThreads;
if (i != nThreads - 1) uBound = startPos + a * (i + 1) / nThreads;
else uBound = a;
if (lBound > a) lBound = a;
if (uBound > a) uBound = a;
if (lBound == a && uBound == a) { lBound = 1; uBound = 1; }
//std::cout << "Workers pos " << lBound << " " << uBound << "\n";
par.push_back(std::async(std::launch::async, factorialPartial, lBound, uBound));
}
std::vector<BigInt> calc(par.size());
for (int i = 0; i < calc.size(); i++) calc[i] = par[i].get();
ans = vectorParralelMultipicator(calc);
//for (auto i = par.begin(); i != par.end(); i++) ans = ans * (*i).get();
return ans;
}
BigInt factorialP2(int a, int nThreads = 10)
{
BigInt ans;
int startPos, lBound, uBound;
if (a % nThreads == 0)
{
startPos = 0;
ans = BIGINT_ONE;
}
else
{
startPos = a % nThreads;
ans = factorial(startPos);
}
//std::cout << "start pos " << startPos << " " << ans << "\n";
std::vector<std::future<BigInt>> par;
for (int i = 0; i < nThreads; i++)
{
lBound = startPos + 1 + a * i / nThreads;
if (i != nThreads - 1) uBound = startPos + a * (i + 1) / nThreads;
else uBound = a;
if (lBound > a) lBound = a;
if (uBound > a) uBound = a;
if (lBound == a && uBound == a) { lBound = 1; uBound = 1; }
//std::cout << "Workers pos " << lBound << " " << uBound << "\n";
par.push_back(std::async(std::launch::async, factorialPartial, lBound, uBound));
}
for (auto i = par.begin(); i != par.end(); i++) ans = ans * (*i).get();
return ans;
}
BigInt factorialPartial_Parrallel(int s, int a, int nThreads = 10)
{
BigInt ans;
int startPos, lBound, uBound;
a -= s;
if (a % nThreads == 0)
{
startPos = 0;
ans = BIGINT_ONE;
}
else
{
startPos = a % nThreads;
ans = factorial(startPos);
}
//std::cout << "start pos " << startPos << " " << ans << "\n";
std::vector<std::future<BigInt>> par;
for (int i = 0; i < nThreads; i++)
{
lBound = startPos + 1 + a * i / nThreads;
if (i != nThreads - 1) uBound = startPos + a * (i + 1) / nThreads;
else uBound = a;
if (lBound > a) lBound = a;
if (uBound > a) uBound = a;
if (lBound == a && uBound == a) { lBound = 1; uBound = 1; }
//std::cout << "Workers pos " << lBound << " " << uBound << "\n";
par.push_back(std::async(std::launch::async, factorialPartial, lBound+s, uBound+s));
}
for (auto i = par.begin(); i != par.end(); i++) ans = ans * (*i).get();
return ans;
}
int main()
{
/*int number = 150000;
auto tpT = std::chrono::high_resolution_clock::now();
auto aa = factorialP(number);
auto tp2T = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsedTimeT = tp2T - tpT;
std::cout << "\nDone in " + std::to_string(elapsedTimeT.count()) + "s\n";
tpT = std::chrono::high_resolution_clock::now();
auto bb = factorialP2(number);
tp2T = std::chrono::high_resolution_clock::now();
elapsedTimeT = tp2T - tpT;
std::cout << "\nDone in " + std::to_string(elapsedTimeT.count()) + "s\n";
std::cout << aa - bb;
system("pause");*/
std::string line;
std::ifstream input("input.txt");
if (input.is_open())
{
while (std::getline(input, line))
{
std::cout << line << '\n';
}
input.close();
}
int number = 110000;
number = std::stoi(line);
std::cout << "calculating factorial for " << number << "\n";
auto tp1 = std::chrono::high_resolution_clock::now();
auto veryBigFactorial = factorialP(number);
auto tp2 = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsedTime = tp2 - tp1;
std::cout << "\nDone in " + std::to_string(elapsedTime.count()) + "s\n";
std::cout << "Factorial have " << veryBigFactorial.BigIntToStr().size() << " digigits!\n";
std::cout << "We will try to write it in file!\n";
std::ofstream log("log_factorial_" + std::to_string(number) + ".txt");
if (log.is_open())
{
log << "\nDone in " + std::to_string(elapsedTime.count()) + "s\n";
log << "Factorial have " << veryBigFactorial.BigIntToStr().size() << " digigits!\n";
}
else std::cout << "Unable to create log file\n";
log.close();
tp1 = std::chrono::high_resolution_clock::now();
std::ofstream output("output_factorial_" + std::to_string(number) + ".txt");
if (output.is_open())
{
output << veryBigFactorial.BigIntToStr();
}
else std::cout << "Unable to create output file\n";
output.close();
tp2 = std::chrono::high_resolution_clock::now();
elapsedTime = tp2 - tp1;
std::cout << "\nDone in " + std::to_string(elapsedTime.count()) + "s\nPress any key to exit!\n";
system("pause");
/*
auto tp1 = std::chrono::high_resolution_clock::now();
auto test = factorial(number);
auto tp2 = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsedTime = tp2 - tp1;
std::cout << "\nDone in " + std::to_string(elapsedTime.count()) + "s\n";
int const nThreads_MAX = 30;
//auto testP = factorialP(number, 7);
//std::cout << test - testP << "\n";
//system("pause");
std::vector<std::string> resStr;
for (int i = 3; i <= nThreads_MAX; i++)
{
tp1 = std::chrono::high_resolution_clock::now();
auto testP = factorialP(number, i);
tp2 = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> elapsedTimeP = tp2 - tp1;
std::cout << "\nFor nTreads = " << i << " done in " + std::to_string(elapsedTimeP.count()) + "s\n";
std::cout << "Ratio is " + std::to_string(elapsedTime.count() / elapsedTimeP.count()) + "s\n";
std::cout << "Correct? " << test - testP << "\n";
resStr.push_back(std::to_string(i) + " " + std::to_string(elapsedTime.count() / elapsedTimeP.count()) + " " +
std::to_string(elapsedTimeP.count()) + " " + std::to_string(i * elapsedTime.count()));
}
std::ofstream output("output.txt");
if (output.is_open())
{
for (auto const& i : resStr) output << i << "\n";
output.close();
}
else std::cout << "Unable to create config.cfg file\n";*/
} | [
"bagizara@gmail.com"
] | bagizara@gmail.com |
6efe3a29c4733a9a0bc6a30009d6f51dc9799648 | bfe1cf47350946257122dc2117cdcb58421898e9 | /Yu-Gi-Oh/Source.cpp | 5bace03fc163a0ee143f4bea64cb1fb113d7338a | [] | no_license | DelyanaR/OOP_20_21 | 6f2b57b9b4f425d25c371fd865c01e95227021d4 | bff8647a5bf5ed3b2c581bebb8dd7a1336fa85fd | refs/heads/main | 2023-05-14T21:02:24.419422 | 2021-06-07T15:48:34 | 2021-06-07T15:48:34 | 374,708,910 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,219 | cpp | /**
* Solution to homework assignment 4
* Object Oriented Programming Course
* Faculty of Mathematics and Informatics of Sofia University
* Summer semester 2020/2021
*
* @author Delyana Raykova
* @idnumber 62533
* @task 1
* @compiler VC
*/
#include <iostream>
#include "duelist.hpp"
using namespace std;
int main() {
MonsterCard dragon("Blue-Eyes White Dragon", "This legendary dragon is a powerful engine of destruction.", 0, 3000, 2500);
MonsterCard magician("Dark Magician", "The ultimate wizard.", 23, 2500, 2100);
MagicCard swords("Swords of Revealing Light", "Your opponent's monsters cannot declare an attack.", 123, CardType::SPELL);
MagicCard cylinder("Magic Cylinder", "Inflict damage to your opponent equal to its ATK.", 9, CardType::TRAP);
PendulumCard timegazer("Timegazer Magician", "Your opponent cannot activate Trap Magic Cards", 3, 1200, 600, 8, CardType::BUFF);
Duelist firstDuelist("Zhehcko Popov");
firstDuelist.getDeck().setName("Magician Deck");
firstDuelist.getDeck().addCard(&dragon);
firstDuelist.getDeck().addCard(&swords);
firstDuelist.getDeck().addCard(&magician);
firstDuelist.getDeck().addCard(&cylinder);
firstDuelist.getDeck().addCard(&timegazer);
firstDuelist.getDeck().shuffle();
cout << firstDuelist.getDeck().getNumberofAllCards() << endl;
cout << firstDuelist.getDeck().getNumberofMagicCards() << endl;
cout << firstDuelist.getDeck().getNumberofMonsterCards() << endl;
cout << firstDuelist.getDeck().getNumberofPendulumCards() << endl;
/*firstDuelist.writeFromFile("ex.txt");*/
MagicCard box("Mystic Box", "Destroy one monster.", 0, CardType::SPELL);
firstDuelist.getDeck().changeCard(2, &box);//it won't be able to change the card because the types don't match
firstDuelist.getDeck().changeCard(4, &box);
Duelist secondDuelist("Gosho Goshev");
secondDuelist.getDeck().addCard(&dragon);
secondDuelist.getDeck().addCard(&swords);
secondDuelist.getDeck().addCard(&magician);
secondDuelist.getDeck().addCard(&cylinder);
secondDuelist.getDeck().addCard(&timegazer);
firstDuelist.duel(secondDuelist);
firstDuelist.writeToFile("new.txt");
secondDuelist.writeToFile("new.txt");
return 0;
} | [
"noreply@github.com"
] | noreply@github.com |
bf7e737cb88a1e9d8b2b7bed7fdade25a73d949a | d37ddf5ec835ca95bc3cb17c0231bfdee677071e | /application/qml_search/main.cpp | aaa44781eac3fb6b42b6203f78642c53eb52214b | [
"Apache-2.0"
] | permissive | nnnlife/trader | 6191c088435d32b8772628e13d198231d7b2c894 | 79a2fa934b5229fb42efc558d2e0b6cb8e83cdc6 | refs/heads/main | 2023-03-15T19:05:07.212235 | 2022-07-18T04:17:58 | 2022-07-18T04:17:58 | 160,435,608 | 1 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 428 | cpp | #include <QGuiApplication>
#include <QQmlEngine>
#include <QQuickView>
#include <QQmlApplicationEngine>
#include <QScopedPointer>
#include <QFont>
int main(int argc, char *argv[]) {
QCoreApplication::setAttribute(Qt::AA_EnableHighDpiScaling);
QGuiApplication app(argc, argv);
QFont f = app.font();
f.setPointSize(10);
app.setFont(f);
QQmlApplicationEngine engine("main.qml");
return app.exec();
}
| [
"nnnlife@gmail.com"
] | nnnlife@gmail.com |
a77b4aa57fbd32b839bc34b47691298a57d87ee1 | aabe8cf0784bcf850c353e6ee5012285a7a4091a | /Classes/IngameObject/SkillConstructor.h | faf902e2297819ef78938a415c6ac04af1c9c7e7 | [] | no_license | ImaginysLight/CodingTD | fda402e8c08e9806ed0a31604ba465c94967226e | d6d773f316054011f81df680993c17d4d08579ee | refs/heads/master | 2020-05-16T18:18:13.226060 | 2019-09-07T05:47:58 | 2019-09-07T05:47:58 | 183,215,615 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 426 | h | #pragma once
#include"Skill/BaseSkillClass.h"
#include"Skill/CoolBlooded.h"
#include"Skill/IceAge.h"
#include"Skill/BurningEnthusiasm.h"
#include"Skill/HellFire.h"
#include"Skill/NaturalWind.h"
#include"Skill/HeavenBless.h"
#include"Skill/PassiveSkill.h"
class BaseUnitClass;
class SkillConstructor {
public:
static BaseSkillClass* InitializeSkill(string skillName, int line, bool isOwned, int playerId, int targetId);
};
| [
"ImaginysLight@gmail.com"
] | ImaginysLight@gmail.com |
f392eb66096b0d54a11618b8b900558785b4ca50 | f08c2848f63c988c1d3f4e80f07d45f732a6e029 | /76.minimum-window-substring.cpp | 5a63a9ec463a884e42ba4c0a93850a58c732ebf3 | [] | no_license | pqros/leetcode-exercices | 42ecd7fa994af0f4f44b66413becf825c70b4004 | c374ae2d5cfbc2767ff38aca170481ce53c35030 | refs/heads/master | 2020-07-26T06:12:56.042230 | 2019-09-21T14:29:00 | 2019-09-21T14:29:00 | 208,560,989 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,764 | cpp | /*
* @lc app=leetcode id=76 lang=cpp
*
* [76] Minimum Window Substring
*
* https://leetcode.com/problems/minimum-window-substring/description/
*
* algorithms
* Hard (31.76%)
* Likes: 2705
* Dislikes: 181
* Total Accepted: 269K
* Total Submissions: 846.1K
* Testcase Example: '"ADOBECODEBANC"\n"ABC"'
*
* Given a string S and a string T, find the minimum window in S which will
* contain all the characters in T in complexity O(n).
*
* Example:
*
*
* Input: S = "ADOBECODEBANC", T = "ABC"
* Output: "BANC"
*
*
* Note:
*
*
* If there is no such window in S that covers all characters in T, return the
* empty string "".
* If there is such window, you are guaranteed that there will always be only
* one unique minimum window in S.
*
*
*/
#include <iostream>
using namespace std;
class Solution {
public:
string minWindow(string s, string t) {
if (s.empty() || t.empty()) return "";
int a[256]; memset(a, 0, sizeof(a));
int cnt = 0;
for(auto& c : t) {
if(!a[c]) {++cnt;}
--a[c];
}
int left = 0;
int minlen = 0x7fffffff;
int minleft = 0;
for(int i = 0; i < s.size(); ++i) {
if (!(++a[s[i]])) --cnt;
// cout << cnt << endl;
if (!cnt) {
// printf("i = %d, left = %d, minlen = %d\n", i, left, minlen);
while(a[s[left]] > 0){
--a[s[left]];
++left;
}
if (i - left + 1 < minlen) {
minlen = i - left + 1;
minleft = left;
}
}
}
if (cnt) return "";
return s.substr(minleft, minlen);
}
};
| [
"1098877273@qq.com"
] | 1098877273@qq.com |
ddd582bd65285a24951c7d942340a37edf6f2c40 | 26f1cbf38afe77464f609e06dafac1e07b2ac047 | /C++/Core/Assignments/Set2/Fraction/pch.cpp | b3d03daf7133eea43e99b85096c522c58256aeaa | [] | no_license | 99002561/Genesis-Notebook | 1f9005898cc5c98bb4cc63f02514c50e7d927b6a | 65503f7c6fc4d388b674951f4b397987f732aeda | refs/heads/main | 2023-01-11T09:58:36.433835 | 2020-11-11T06:47:00 | 2020-11-11T06:47:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,481 | cpp | //
// pch.cpp
// Include the standard header and generate the precompiled header.
//
#include "pch.h"
using namespace std;
Fraction::Fraction() : m_numerator(0), m_denominator(0) {}
Fraction::Fraction(int num, int deno) : m_numerator(num), m_denominator(deno) {}
Fraction::Fraction(const Fraction& obj) : m_numerator(obj.m_numerator), m_denominator(obj.m_denominator) {}
Fraction Fraction:: operator + (const Fraction& obj)
{
int gcd{ 0 };
Fraction sum;
if (m_denominator == obj.m_denominator)
{
sum.m_numerator = m_numerator + obj.m_numerator;
sum.m_denominator = m_denominator;
}
else
{
sum.m_numerator = (m_numerator * obj.m_denominator) + (obj.m_numerator * m_denominator);
sum.m_denominator = m_denominator * obj.m_denominator;
}
for (int i = 1; i <= sum.m_numerator && i <= sum.m_denominator; ++i)
{
if (sum.m_numerator % i == 0 && sum.m_denominator % i == 0)
gcd = i;
}
sum.m_numerator = sum.m_numerator / gcd;
sum.m_denominator = sum.m_denominator / gcd;
return sum;
}
Fraction Fraction:: operator - (const Fraction& obj)
{
Fraction diff;
int gcd{ 0 };
if (m_denominator == obj.m_denominator)
{
diff.m_numerator = m_numerator - obj.m_numerator;
diff.m_denominator = m_denominator;
}
else
{
diff.m_numerator = (m_numerator * obj.m_denominator) - (obj.m_numerator * m_denominator);
diff.m_denominator = m_denominator * obj.m_denominator;
}
for (int i = 1; i <= diff.m_numerator && i <= diff.m_denominator; ++i)
{
if (diff.m_numerator % i == 0 && diff.m_denominator % i == 0)
gcd = i;
}
diff.m_numerator = diff.m_numerator / gcd;
diff.m_denominator = diff.m_denominator / gcd;
return diff;
}
Fraction Fraction:: operator*(const Fraction & obj)
{
Fraction prod;
prod.m_numerator = m_numerator * obj.m_numerator;
prod.m_denominator = m_denominator * obj.m_denominator;
return prod;
}
Fraction Fraction:: operator + (int incval)
{
Fraction inc;
inc.m_numerator = m_numerator + incval * m_denominator;
inc.m_denominator = m_denominator;
return inc;
}
Fraction Fraction:: operator - (int decval)
{
Fraction dec;
dec.m_numerator = m_numerator - decval * m_denominator;
dec.m_denominator = m_denominator;
return dec;
}
int Fraction:: operator == (const Fraction& obj)
{
if (m_numerator == obj.m_numerator && m_denominator == obj.m_denominator)
{
return 0;
}
else
{
return 1;
}
}
int Fraction:: operator > (const Fraction& obj)
{
int x;
x= (m_numerator * obj.m_denominator) - (obj.m_numerator * m_denominator);
if (x>0)
{
return 0;
}
else
{
return 1;
}
}
int Fraction:: operator < (const Fraction& obj)
{
int x;
x = (m_numerator * obj.m_denominator) - (obj.m_numerator * m_denominator);
if (x < 0)
{
return 0;
}
else
{
return 1;
}
}
void Fraction::display()
{
cout << "Fraction is = " << m_numerator << "/" << m_denominator << endl;
}
int Fraction::get_mnumerator()
{
return m_numerator;
}
int Fraction::get_mdenominator()
{
return m_denominator;
}
Fraction Fraction::simplify()
{
Fraction simp;
int gcd{0};
for (int i = 1; i <= m_numerator && i <= m_denominator; ++i)
{
if (m_numerator % i == 0 && m_denominator % i == 0)
gcd = i;
}
simp.m_numerator = simp.m_numerator / gcd;
simp.m_denominator = simp.m_denominator / gcd;
return simp;
}
/*
bool Fraction::isSimplest()
{
}
*/ | [
"nagaakhil.es@ltts.com"
] | nagaakhil.es@ltts.com |
25e41ec11c6d22231c6c094da140937683fdf597 | b18adf09556fa66a9db188684c69ea48849bb01b | /Elsov/SkyFrame/HardwareTest/HardwareTest.h | df2f4ba6336d237b0479b3a27f7cfd4e16232693 | [] | no_license | zzfd97/projects | d78e3fa6418db1a5a2580edcaef1f2e197d5bf8c | f8e7ceae143317d9e8461f3de8cfccdd7627c3ee | refs/heads/master | 2022-01-12T19:56:48.014510 | 2019-04-05T05:30:31 | 2019-04-05T05:30:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,154 | h | // HardwareTest.h : main header file for the HARDWARETEST application
//
#ifndef __HARDWARETEST_H_INCLUDED__
#define __HARDWARETEST_H_INCLUDED__
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#ifndef __AFXWIN_H__
#error include 'stdafx.h' before including this file for PCH
#endif
#include "resource.h" // main symbols
////////////////////////////////////////////////////////////////////////////
// CHardwareTestApp:
// See HardwareTest.cpp for the implementation of this class
//
class CHardwareTestApp : public CWinApp
{
public:
CHardwareTestApp();
// Overrides
//{{AFX_VIRTUAL(CHardwareTestApp)
public:
virtual BOOL InitInstance();
//}}AFX_VIRTUAL
// Public members
public:
// Protected members
protected:
// Implementation
//{{AFX_MSG(CHardwareTestApp)
afx_msg void OnAppAbout();
//}}AFX_MSG
DECLARE_MESSAGE_MAP()
};
/////////////////////////////////////////////////////////////////////////////
//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
#endif // __HARDWARETEST_H_INCLUDED__
| [
"hp@kozhevnikov.org"
] | hp@kozhevnikov.org |
363a971a88ca6dc79919938c75bd965a2f297cad | f9ad496cf96e02a690a5f41e5758c92388fb2b76 | /include/server/asio/tcp_session.inl | 7fcc5801880528531a6cea2438c6720401af6325 | [
"MIT"
] | permissive | coolniu/CppServer | 90b338383e920cf29e56ab5fffccf981b7bd7160 | da272e324a4fb8fb7a85b8bf3bf5758a48ee07ce | refs/heads/master | 2020-12-30T11:28:58.062254 | 2017-05-15T18:17:57 | 2017-05-15T18:17:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,737 | inl | /*!
\file tcp_session.inl
\brief TCP session inline implementation
\author Ivan Shynkarenka
\date 14.12.2016
\copyright MIT License
*/
namespace CppServer {
namespace Asio {
template <class TServer, class TSession>
inline TCPSession<TServer, TSession>::TCPSession(std::shared_ptr<TCPServer<TServer, TSession>> server, asio::ip::tcp::socket&& socket)
: _id(CppCommon::UUID::Generate()),
_server(server),
_socket(std::move(socket)),
_connected(false),
_bytes_sent(0),
_bytes_received(0),
_reciving(false),
_sending(false),
_recive_buffer(CHUNK + 1),
_send_buffer_flush_offset(0)
{
}
template <class TServer, class TSession>
inline void TCPSession<TServer, TSession>::Connect()
{
// Reset statistic
_bytes_sent = 0;
_bytes_received = 0;
// Update the connected flag
_connected = true;
// Call the session connected handler
onConnected();
// Call the empty send buffer handler
onEmpty();
// Try to receive something from the client
TryReceive();
}
template <class TServer, class TSession>
inline bool TCPSession<TServer, TSession>::Disconnect(bool dispatch)
{
if (!IsConnected())
return false;
auto self(this->shared_from_this());
auto disconnect = [this, self]()
{
if (!IsConnected())
return;
// Close the session socket
_socket.close();
// Clear receive/send buffers
ClearBuffers();
// Update the connected flag
_connected = false;
// Call the session disconnected handler
onDisconnected();
// Unregister the session
_server->UnregisterSession(id());
};
// Dispatch or post the disconnect routine
if (dispatch)
service()->Dispatch(disconnect);
else
service()->Post(disconnect);
return true;
}
template <class TServer, class TSession>
inline size_t TCPSession<TServer, TSession>::Send(const void* buffer, size_t size)
{
assert((buffer != nullptr) && "Pointer to the buffer should not be equal to 'nullptr'!");
assert((size > 0) && "Buffer size should be greater than zero!");
if ((buffer == nullptr) || (size == 0))
return 0;
if (!IsConnected())
return 0;
size_t result;
{
std::lock_guard<std::mutex> locker(_send_lock);
// Fill the main send buffer
const uint8_t* bytes = (const uint8_t*)buffer;
_send_buffer_main.insert(_send_buffer_main.end(), bytes, bytes + size);
result = _send_buffer_main.size();
}
// Dispatch the send routine
auto self(this->shared_from_this());
service()->Dispatch([this, self]()
{
// Try to send the main buffer
TrySend();
});
return result;
}
template <class TServer, class TSession>
inline void TCPSession<TServer, TSession>::TryReceive()
{
if (_reciving)
return;
if (!IsConnected())
return;
_reciving = true;
auto self(this->shared_from_this());
_socket.async_read_some(asio::buffer(_recive_buffer.data(), _recive_buffer.size()), [this, self](std::error_code ec, std::size_t size)
{
_reciving = false;
if (!IsConnected())
return;
// Received some data from the client
if (size > 0)
{
// Update statistic
_bytes_received += size;
_server->_bytes_received += size;
// Call the buffer received handler
onReceived(_recive_buffer.data(), size);
// If the receive buffer is full increase its size
if (_recive_buffer.size() == size)
_recive_buffer.resize(2 * size);
}
// Try to receive again if the session is valid
if (!ec)
TryReceive();
else
{
SendError(ec);
Disconnect(true);
}
});
}
template <class TServer, class TSession>
inline void TCPSession<TServer, TSession>::TrySend()
{
if (_sending)
return;
if (!IsConnected())
return;
// Swap send buffers
if (_send_buffer_flush.empty())
{
std::lock_guard<std::mutex> locker(_send_lock);
// Swap flush and main buffers
_send_buffer_flush.swap(_send_buffer_main);
_send_buffer_flush_offset = 0;
}
// Check if the flush buffer is empty
if (_send_buffer_flush.empty())
{
// Nothing to send...
return;
}
_sending = true;
auto self(this->shared_from_this());
asio::async_write(_socket, asio::buffer(_send_buffer_flush.data() + _send_buffer_flush_offset, _send_buffer_flush.size() - _send_buffer_flush_offset), [this, self](std::error_code ec, std::size_t size)
{
_sending = false;
if (!IsConnected())
return;
bool resume = true;
// Send some data to the client
if (size > 0)
{
// Update statistic
_bytes_sent += size;
_server->_bytes_sent += size;
// Call the buffer sent handler
onSent(size, _send_buffer_flush.size() - size);
// Increase the flush buffer offset
_send_buffer_flush_offset += size;
// Successfully send the whole flush buffer
if (_send_buffer_flush_offset == _send_buffer_flush.size())
{
// Clear the flush buffer
_send_buffer_flush.clear();
_send_buffer_flush_offset = 0;
// Stop sending operation
resume = false;
}
}
// Try to send again if the session is valid
if (!ec)
{
if (resume)
TrySend();
else
onEmpty();
}
else
{
SendError(ec);
Disconnect(true);
}
});
}
template <class TServer, class TSession>
inline void TCPSession<TServer, TSession>::ClearBuffers()
{
// Clear send buffers
{
std::lock_guard<std::mutex> locker(_send_lock);
_send_buffer_main.clear();
_send_buffer_flush.clear();
_send_buffer_flush_offset = 0;
}
}
template <class TServer, class TSession>
inline void TCPSession<TServer, TSession>::SendError(std::error_code ec)
{
// Skip Asio disconnect errors
if ((ec == asio::error::connection_aborted) ||
(ec == asio::error::connection_refused) ||
(ec == asio::error::connection_reset) ||
(ec == asio::error::eof) ||
(ec == asio::error::operation_aborted))
return;
onError(ec.value(), ec.category().name(), ec.message());
}
} // namespace Asio
} // namespace CppServer
| [
"chronoxor@gmail.com"
] | chronoxor@gmail.com |
9611aeeeaba3cbee8cc005e5b3fdab7ad755366a | 3a35c69692e7cdce902e36c6eb6c78f462334777 | /train/Condition.h | 7ff926631aac750e5bdcbf6c1f1c90385dabdc2b | [] | no_license | yszc-wy/learn_np | 551d9312ec501542f4db9fcc31b90c09a436c4b8 | 40719e5ae8b4a41a163f7187e3ea5cf53650e194 | refs/heads/master | 2023-03-12T05:17:51.094318 | 2021-03-01T02:44:37 | 2021-03-01T02:44:37 | 339,382,118 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 639 | h | /*
* Encoding: utf-8
* Description:
*/
#pragma once
// C系统库头文件
// C++系统库头文件
// 第三方库头文件
// 本项目头文件
#include "train/Mutex.h"
namespace train
{
class Condition
{
public:
Condition(MutexLock& mutex)
: mutex_(mutex)
{
pthread_cond_init(&cond_,NULL);
}
~Condition(){
pthread_cond_destroy(&cond_);
}
void wait(){
pthread_cond_wait(&cond_,mutex_.getLock());
}
void notify(){
pthread_cond_signal(&cond_);
}
void notifyAll(){
pthread_cond_broadcast(&cond_);
}
private:
MutexLock& mutex_;
pthread_cond_t cond_;
};
}
| [
"yszc-wy@foxmail.com"
] | yszc-wy@foxmail.com |
c9b6a60114b3f339977667ac1dc9bc3b3d9f851f | 14627037079b58030ef084b11805dddb58046cbb | /SolveEquation/vc/dllATL/src/Equation.h | 74791252543bca1ad041656a0d49028197c9dd63 | [] | no_license | hzwong/Exercise | 2e813bceaf25d703f9b198f362dcf7ae4848c211 | d11b3c161f4bcdc895fda52cabf4f550d33f0dfd | refs/heads/master | 2020-12-07T09:52:19.641865 | 2016-12-05T12:49:45 | 2016-12-05T12:49:45 | 232,697,705 | 1 | 0 | null | 2020-01-09T01:45:57 | 2020-01-09T01:45:56 | null | GB18030 | C++ | false | false | 1,471 | h | //Equation.h
#pragma once
class ATL_NO_VTABLE CEquation
: public ATL::CComObjectRootEx<ATL::CComSingleThreadModel>
, public ATL::CComCoClass<CEquation, &CLSID_Equation>
, public ATL::IDispatchImpl<IEquation, &IID_IEquation, &LIBID_SolveEquationLib,/*wMajor =*/1,/*wMinor =*/ 0>
{
public:
CEquation()
{
m_nRootCount = 0;
}
DECLARE_REGISTRY_RESOURCEID(IDR_REG_EQUATION)
BEGIN_COM_MAP(CEquation)
COM_INTERFACE_ENTRY(IEquation)
COM_INTERFACE_ENTRY(IDispatch)
END_COM_MAP()
DECLARE_PROTECT_FINAL_CONSTRUCT()
#if _MSC_VER >= 1300 //VC++7.0(2002) 及其以上的版本
HRESULT FinalConstruct()
{
return S_OK;
}
void FinalRelease()
{
}
#endif
// ISolveEquation
public:
STDMETHOD(get_RootCount)(/*[out, retval]*/ long *pVal);
STDMETHOD(diff)(/*[in]*/ long i,/*[out,retval]*/ double*v);
STDMETHOD(imag)(/*[in]*/ long i,/*[out,retval]*/ double*v);
STDMETHOD(real)(/*[in]*/ long i,/*[out,retval]*/ double*v);
STDMETHOD(Solve)(/*[in]*/ VARIANT*z,/*[out,retval]*/long*n);
protected:
static bool GetZ(VARIANT *z,double dz[10]);
static bool GetZ_VBA (VARIANT *z,double dz[10],SAFEARRAY*sa);
static bool GetZ_VBS (VARIANT *z,double dz[10],SAFEARRAY*sa);
static bool GetZ_JS (VARIANT *z,double dz[10],IDispatch*p );
static bool GetZ_BSTR(VARIANT *z,double dz[10],const wchar_t*s);
protected:
long m_nRootCount; //根的个数
double m_x[12]; //求出的根
};
| [
"sea_peak@sina.com"
] | sea_peak@sina.com |
a84af4157845adadfed3a976204fec3d69bbe042 | 0177ee7c9145bf016736c90a60199cc66b697848 | /src/PowerInMath_UPSYM.cpp | f067bc54ffb9026f6adc4a46725ce5f9f6ec3d12 | [] | no_license | ricklii/TSEC_ASA_IDAS_KLU | 32a0567ea9c7d854e47e4fca0b92dbda75cab20c | 21e971159bb34c326b27610b2db9520206ce1ea9 | refs/heads/master | 2021-01-19T16:51:45.417365 | 2015-05-12T13:53:19 | 2015-05-12T13:53:19 | 35,491,281 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 34,776 | cpp | //This C++ file is generated from SymAdjointSA.
//for Adjoint Sensitivity Analysis by IDAS in Sundials
#include "TSECConfig.h"
namespace TSEC
{
int PowerInMath::Get_nDAE(void) { return 24; }
//int PowerInMath::Get_nDAE(void) { return 3; }
int PowerInMath::Get_nDAEd(void) { return 6; }
int PowerInMath::Get_nDAEa(void) { return 18; }
double PowerInMath::Get_t1(void) { return 0.200000; }
double PowerInMath::Get_t2(void) { return 0.400000; }
int PowerInMath::Get_Jacnnz(void) {return 90; }
//int PowerInMath::Get_Jacnnz(void) {return 9; }
int PowerInMath::Get_nGenerator(void) {return 3;}
int PowerInMath::Get_nControlPara(void) {return 5;}//number of generator-tripping and load-shedding nodes
//int PowerInMath::Get_nControlPara(void) {return 3;}
void PowerInMath::Set_y0(double* y0) {
y0[0] = 0.065010;
y0[1] = 1.000000;
y0[2] = 0.407630;
y0[3] = 1.000000;
y0[4] = 0.325601;
y0[5] = 1.000000;
y0[6] = 1.062742;
y0[7] = 1.036353;
y0[8] = 1.048839;
y0[9] = 0.993471;
y0[10] = 0.973305;
y0[11] = 1.019841;
y0[12] = 0.997553;
y0[13] = 0.999665;
y0[14] = 0.909881;
y0[15] = 0.000000;
y0[16] = 0.179815;
y0[17] = 0.144178;
y0[18] = -0.069840;
y0[19] = -0.080878;
y0[20] = 0.066423;
y0[21] = 0.020014;
y0[22] = 0.059402;
y0[23] = -0.162703;
}
/*void PowerInMath::Set_y0(double* y0) {
y0[0] = 1;
y0[1] = 0;
y0[2] = 0;
}*/
//DAE key coefficient change(related to line-fault)
void PowerInMath::YmatrixRefresh0(void) {
Gii = 0.0;
Bii = -23.8095238095;
Gij = 0.0;
Bij = 13.8888888889;
Gji = 0.0;
Bji = 13.8888888889;
Gjj = 0.0;
Bjj = -36.1000690131;
}
void PowerInMath::YmatrixRefresh1(void) {
Gii = 50000000.0;
Bii = -50000009.9206;
Gij = -5e-11;
Bij = 5e-11;
Gji = -5e-11;
Bji = 5e-11;
Gjj = 5e-11;
Bjj = -22.2111801243;
}
void PowerInMath::YmatrixRefresh2(void) {
Gii = 5e-11;
Bii = -9.92063492068;
Gij = -5e-11;
Bij = 5e-11;
Gji = -5e-11;
Bji = 5e-11;
Gjj = 5e-11;
Bjj = -22.2111801243;
}
/*
int PowerInMath::res(double t, double *y, double *d, double *rval, void *user_data)
{
double y1,y2,y3,yp1,yp2,yp3;
double p1,p2,p3;
y1 = y[0]; y2 = y[1]; y3 = y[2];
yp1 = d[0]; yp2 = d[1]; yp3 = d[2];
//rval = NV_DATA_S(resval);
DAEUserData* data;
double *u;
data = (DAEUserData*) user_data;
//data = (UserData) user_data;
p1 = data->p[0]; p2 = data->p[1]; p3 = data->p[2];
rval[0] = p1*y1-p2*y2*y3;
rval[1] = -rval[0] + p3*y2*y2 + yp2;
rval[0]+= yp1;
rval[2] = y1+y2+y3-1;
return 0;
}
int PowerInMath::JacSparse(double tt, double cj,
double *y, double *d, double *resvec,
SlsMat JacMat, void *user_data,
double *tempv1, double *tempv2, double *tempv3)
{
double y1,y2,y3,yp1,yp2,yp3;
double p1,p2,p3;
y1 = y[0]; y2 = y[1]; y3 = y[2];
yp1 = d[0]; yp2 = d[1]; yp3 = d[2];
//rval = NV_DATA_S(resval);
DAEUserData* data;
double *u;
data = (DAEUserData*) user_data;
//data = (UserData) user_data;
p1 = data->p[0]; p2 = data->p[1]; p3 = data->p[2];
JacMat->colptrs[0] = 0;
JacMat->colptrs[1] = 3;
JacMat->colptrs[2] = 6;
JacMat->colptrs[3] = 9;
JacMat->data[0] = p1+cj;
JacMat->rowvals[0] = 0;
JacMat->data[1] = -p1;
JacMat->rowvals[1] = 1;
JacMat->data[2] = 1.0;
JacMat->rowvals[2] = 2;
JacMat->data[3] = -p2*y3;
JacMat->rowvals[3] = 0;
JacMat->data[4] = p2*y3+2*p3*y2+cj;
JacMat->rowvals[4] = 1;
JacMat->data[5] = 1.0;
JacMat->rowvals[5] = 2;
JacMat->data[6] = -p2*y2;
JacMat->rowvals[6] = 0;
JacMat->data[7] = p2*y2;
JacMat->rowvals[7] = 1;
JacMat->data[8] = 1.0;
JacMat->rowvals[8] = 2;
return 0;
}*/
int PowerInMath::res(double t, double *y, double *d, double *out_2308655140238706424, void *user_data)
{
//realtype *out_2308655140238706424,*y,*d;
DAEUserData* data;
double *u;
//out_2308655140238706424=N_VGetArrayPointer(resval);
//y=N_VGetArrayPointer(yy);
//d=N_VGetArrayPointer(yp);
data = (DAEUserData*) user_data;
u=data->p;
out_2308655140238706424[0] = d[0] - 376.991118430775*y[1] + 376.991118430775;
out_2308655140238706424[1] = d[1] - 0.394755732099167*y[15]*cos(y[0]) + 0.394755732099167*y[6]*sin(y[0]) - 0.0272539654028846;
out_2308655140238706424[2] = d[2] - 376.991118430775*y[3] + 376.991118430775;
out_2308655140238706424[3] = d[3] - 0.601148164672177*y[16]*cos(y[2]) + 0.601148164672177*y[7]*sin(y[2]) - 0.147741125349634;
out_2308655140238706424[4] = d[4] - 376.991118430775*y[5] + 376.991118430775;
out_2308655140238706424[5] = d[5] - 1.10271188187982*y[17]*cos(y[4]) + 1.10271188187982*y[8]*sin(y[4]) - 0.219326596557525;
out_2308655140238706424[6] = 17.3611111111111*y[15] - 17.3611111111111*y[18] - (-u[0] + 1.0)*(-16.3934426229508*y[15] + 18.6640510136486*sin(y[0]));
out_2308655140238706424[7] = 22.25*y[16] - 16.0*y[22] - 7.69469650780387*sin(y[2]);
out_2308655140238706424[8] = 17.0648464163823*y[17] - 17.0648464163823*y[20] - (-u[1] + 1.0)*(-5.52486187845304*y[17] + 6.63832552891652*sin(y[4]));
out_2308655140238706424[9] = -17.3611111111111*y[15] + 39.9953822108554*y[18] - 10.8695652173913*y[19] - 11.7647058823529*y[23];
out_2308655140238706424[10] = -10.8695652173913*y[18] + 16.7519181585678*y[19] - 5.88235294117647*y[20] - (-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/(pow(y[10], 2) + pow(y[19], 2));
out_2308655140238706424[11] = -17.0648464163823*y[17] - 5.88235294117647*y[19] + 32.8678342781936*y[20] - 9.92063492063492*y[21];
out_2308655140238706424[12] = -Bii*y[21] - Bij*y[22] + Gii*y[12] + Gij*y[13] - 9.92063492063492*y[20] - (-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/(pow(y[12], 2) + pow(y[21], 2));
out_2308655140238706424[13] = -Bji*y[21] - Bjj*y[22] + Gji*y[12] + Gjj*y[13] - 16.0*y[16] - 6.2111801242236*y[23];
out_2308655140238706424[14] = -11.7647058823529*y[18] - 6.2111801242236*y[22] + 17.9758860065765*y[23] - (-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/(pow(y[14], 2) + pow(y[23], 2));
out_2308655140238706424[15] = -17.3611111111111*y[6] + 17.3611111111111*y[9] - (-u[0] + 1.0)*(16.3934426229508*y[6] - 18.6640510136486*cos(y[0]));
out_2308655140238706424[16] = 16.0*y[13] - 22.25*y[7] + 7.69469650780387*cos(y[2]);
out_2308655140238706424[17] = 17.0648464163823*y[11] - 17.0648464163823*y[8] - (-u[1] + 1.0)*(5.52486187845304*y[8] - 6.63832552891652*cos(y[4]));
out_2308655140238706424[18] = 10.8695652173913*y[10] + 11.7647058823529*y[14] + 17.3611111111111*y[6] - 39.9953822108554*y[9];
out_2308655140238706424[19] = -16.7519181585678*y[10] + 5.88235294117647*y[11] + 10.8695652173913*y[9] - (-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/(pow(y[10], 2) + pow(y[19], 2));
out_2308655140238706424[20] = 5.88235294117647*y[10] - 32.8678342781936*y[11] + 9.92063492063492*y[12] + 17.0648464163823*y[8];
out_2308655140238706424[21] = Bii*y[12] + Bij*y[13] + Gii*y[21] + Gij*y[22] + 9.92063492063492*y[11] - (-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/(pow(y[12], 2) + pow(y[21], 2));
out_2308655140238706424[22] = Bji*y[12] + Bjj*y[13] + Gji*y[21] + Gjj*y[22] + 6.2111801242236*y[14] + 16.0*y[7];
out_2308655140238706424[23] = 6.2111801242236*y[13] - 17.9758860065765*y[14] + 11.7647058823529*y[9] - (-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/(pow(y[14], 2) + pow(y[23], 2));
/*
std::cout<<"t: "<<t<<std::endl;
double maxxx=0;
for(int i=0;i<24;i++)
{
if(abs(out_2308655140238706424[i])>maxxx)
maxxx=abs(out_2308655140238706424[i]);
//std::cout<<out_2308655140238706424[i]<<std::endl;
}
std::cout<<maxxx<<std::endl;
std::cout<<std::endl;*/
return 0;
}
void PowerInMath::Jac_PointerIndices(SlsMat JacMat)
{
JacMat->colptrs[0] = 0;
JacMat->colptrs[1] = 4;
JacMat->colptrs[2] = 6;
JacMat->colptrs[3] = 10;
JacMat->colptrs[4] = 12;
JacMat->colptrs[5] = 16;
JacMat->colptrs[6] = 18;
JacMat->colptrs[7] = 21;
JacMat->colptrs[8] = 24;
JacMat->colptrs[9] = 27;
JacMat->colptrs[10] = 31;
JacMat->colptrs[11] = 35;
JacMat->colptrs[12] = 39;
JacMat->colptrs[13] = 44;
JacMat->colptrs[14] = 50;
JacMat->colptrs[15] = 54;
JacMat->colptrs[16] = 57;
JacMat->colptrs[17] = 60;
JacMat->colptrs[18] = 63;
JacMat->colptrs[19] = 67;
JacMat->colptrs[20] = 71;
JacMat->colptrs[21] = 75;
JacMat->colptrs[22] = 80;
JacMat->colptrs[23] = 86;
JacMat->colptrs[24] = 90;
JacMat->rowvals[0] = 0;
JacMat->rowvals[1] = 1;
JacMat->rowvals[2] = 6;
JacMat->rowvals[3] = 15;
JacMat->rowvals[4] = 0;
JacMat->rowvals[5] = 1;
JacMat->rowvals[6] = 2;
JacMat->rowvals[7] = 3;
JacMat->rowvals[8] = 7;
JacMat->rowvals[9] = 16;
JacMat->rowvals[10] = 2;
JacMat->rowvals[11] = 3;
JacMat->rowvals[12] = 4;
JacMat->rowvals[13] = 5;
JacMat->rowvals[14] = 8;
JacMat->rowvals[15] = 17;
JacMat->rowvals[16] = 4;
JacMat->rowvals[17] = 5;
JacMat->rowvals[18] = 1;
JacMat->rowvals[19] = 15;
JacMat->rowvals[20] = 18;
JacMat->rowvals[21] = 3;
JacMat->rowvals[22] = 16;
JacMat->rowvals[23] = 22;
JacMat->rowvals[24] = 5;
JacMat->rowvals[25] = 17;
JacMat->rowvals[26] = 20;
JacMat->rowvals[27] = 15;
JacMat->rowvals[28] = 18;
JacMat->rowvals[29] = 19;
JacMat->rowvals[30] = 23;
JacMat->rowvals[31] = 10;
JacMat->rowvals[32] = 18;
JacMat->rowvals[33] = 19;
JacMat->rowvals[34] = 20;
JacMat->rowvals[35] = 17;
JacMat->rowvals[36] = 19;
JacMat->rowvals[37] = 20;
JacMat->rowvals[38] = 21;
JacMat->rowvals[39] = 12;
JacMat->rowvals[40] = 13;
JacMat->rowvals[41] = 20;
JacMat->rowvals[42] = 21;
JacMat->rowvals[43] = 22;
JacMat->rowvals[44] = 12;
JacMat->rowvals[45] = 13;
JacMat->rowvals[46] = 16;
JacMat->rowvals[47] = 21;
JacMat->rowvals[48] = 22;
JacMat->rowvals[49] = 23;
JacMat->rowvals[50] = 14;
JacMat->rowvals[51] = 18;
JacMat->rowvals[52] = 22;
JacMat->rowvals[53] = 23;
JacMat->rowvals[54] = 1;
JacMat->rowvals[55] = 6;
JacMat->rowvals[56] = 9;
JacMat->rowvals[57] = 3;
JacMat->rowvals[58] = 7;
JacMat->rowvals[59] = 13;
JacMat->rowvals[60] = 5;
JacMat->rowvals[61] = 8;
JacMat->rowvals[62] = 11;
JacMat->rowvals[63] = 6;
JacMat->rowvals[64] = 9;
JacMat->rowvals[65] = 10;
JacMat->rowvals[66] = 14;
JacMat->rowvals[67] = 9;
JacMat->rowvals[68] = 10;
JacMat->rowvals[69] = 11;
JacMat->rowvals[70] = 19;
JacMat->rowvals[71] = 8;
JacMat->rowvals[72] = 10;
JacMat->rowvals[73] = 11;
JacMat->rowvals[74] = 12;
JacMat->rowvals[75] = 11;
JacMat->rowvals[76] = 12;
JacMat->rowvals[77] = 13;
JacMat->rowvals[78] = 21;
JacMat->rowvals[79] = 22;
JacMat->rowvals[80] = 7;
JacMat->rowvals[81] = 12;
JacMat->rowvals[82] = 13;
JacMat->rowvals[83] = 14;
JacMat->rowvals[84] = 21;
JacMat->rowvals[85] = 22;
JacMat->rowvals[86] = 9;
JacMat->rowvals[87] = 13;
JacMat->rowvals[88] = 14;
JacMat->rowvals[89] = 23;
}
int PowerInMath::JacSparse(double tt, double alpha,
double *y, double *d, double *resvec,
SlsMat JacMat, void *user_data,
double *tempv1, double *tempv2, double *tempv3)
{
double *out_6745007630235635912;
out_6745007630235635912=JacMat->data;
Jac_PointerIndices(JacMat);
//y=N_VGetArrayPointer(yy);
//d=N_VGetArrayPointer(yp);
//u=(double*)user_data;
DAEUserData* data;
double *u;
data = (DAEUserData*) user_data;
u=data->p;
out_6745007630235635912[0] = alpha;
out_6745007630235635912[1] = 0.394755732099167*y[15]*sin(y[0]) + 0.394755732099167*y[6]*cos(y[0]);
out_6745007630235635912[2] = -18.6640510136486*(-u[0] + 1.0)*cos(y[0]);
out_6745007630235635912[3] = -18.6640510136486*(-u[0] + 1.0)*sin(y[0]);
out_6745007630235635912[4] = -376.991118430775;
out_6745007630235635912[5] = alpha;
out_6745007630235635912[6] = alpha;
out_6745007630235635912[7] = 0.601148164672177*y[16]*sin(y[2]) + 0.601148164672177*y[7]*cos(y[2]);
out_6745007630235635912[8] = -7.69469650780387*cos(y[2]);
out_6745007630235635912[9] = -7.69469650780387*sin(y[2]);
out_6745007630235635912[10] = -376.991118430775;
out_6745007630235635912[11] = alpha;
out_6745007630235635912[12] = alpha;
out_6745007630235635912[13] = 1.10271188187982*y[17]*sin(y[4]) + 1.10271188187982*y[8]*cos(y[4]);
out_6745007630235635912[14] = -6.63832552891652*(-u[1] + 1.0)*cos(y[4]);
out_6745007630235635912[15] = -6.63832552891652*(-u[1] + 1.0)*sin(y[4]);
out_6745007630235635912[16] = -376.991118430775;
out_6745007630235635912[17] = alpha;
out_6745007630235635912[18] = 0.394755732099167*sin(y[0]);
out_6745007630235635912[19] = 16.3934426229508*u[0] - 33.7545537340619;
out_6745007630235635912[20] = 17.3611111111111;
out_6745007630235635912[21] = 0.601148164672177*sin(y[2]);
out_6745007630235635912[22] = -22.25;
out_6745007630235635912[23] = 16.0;
out_6745007630235635912[24] = 1.10271188187982*sin(y[4]);
out_6745007630235635912[25] = 5.52486187845304*u[1] - 22.5897082948353;
out_6745007630235635912[26] = 17.0648464163823;
out_6745007630235635912[27] = 17.3611111111111;
out_6745007630235635912[28] = -39.9953822108554;
out_6745007630235635912[29] = 10.8695652173913;
out_6745007630235635912[30] = 11.7647058823529;
out_6745007630235635912[31] = 2*y[10]*(-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 1.0*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2));
out_6745007630235635912[32] = 10.8695652173913;
out_6745007630235635912[33] = 2*y[10]*(-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) - 0.4*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2)) - 16.7519181585678;
out_6745007630235635912[34] = 5.88235294117647;
out_6745007630235635912[35] = 17.0648464163823;
out_6745007630235635912[36] = 5.88235294117647;
out_6745007630235635912[37] = -32.8678342781936;
out_6745007630235635912[38] = 9.92063492063492;
out_6745007630235635912[39] = Gii + 2*y[12]*(-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 1.0*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_6745007630235635912[40] = Gji;
out_6745007630235635912[41] = 9.92063492063492;
out_6745007630235635912[42] = Bii + 2*y[12]*(-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) - 0.27*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_6745007630235635912[43] = Bji;
out_6745007630235635912[44] = Gij;
out_6745007630235635912[45] = Gjj;
out_6745007630235635912[46] = 16.0;
out_6745007630235635912[47] = Bij;
out_6745007630235635912[48] = Bjj;
out_6745007630235635912[49] = 6.2111801242236;
out_6745007630235635912[50] = 2*y[14]*(-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 2.5*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2));
out_6745007630235635912[51] = 11.7647058823529;
out_6745007630235635912[52] = 6.2111801242236;
out_6745007630235635912[53] = 2*y[14]*(-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) - 1.0*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2)) - 17.9758860065765;
out_6745007630235635912[54] = -0.394755732099167*cos(y[0]);
out_6745007630235635912[55] = -16.3934426229508*u[0] + 33.7545537340619;
out_6745007630235635912[56] = -17.3611111111111;
out_6745007630235635912[57] = -0.601148164672177*cos(y[2]);
out_6745007630235635912[58] = 22.25;
out_6745007630235635912[59] = -16.0;
out_6745007630235635912[60] = -1.10271188187982*cos(y[4]);
out_6745007630235635912[61] = -5.52486187845304*u[1] + 22.5897082948353;
out_6745007630235635912[62] = -17.0648464163823;
out_6745007630235635912[63] = -17.3611111111111;
out_6745007630235635912[64] = 39.9953822108554;
out_6745007630235635912[65] = -10.8695652173913;
out_6745007630235635912[66] = -11.7647058823529;
out_6745007630235635912[67] = -10.8695652173913;
out_6745007630235635912[68] = 2*y[19]*(-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 0.4*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2)) + 16.7519181585678;
out_6745007630235635912[69] = -5.88235294117647;
out_6745007630235635912[70] = 2*y[19]*(-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 1.0*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2));
out_6745007630235635912[71] = -17.0648464163823;
out_6745007630235635912[72] = -5.88235294117647;
out_6745007630235635912[73] = 32.8678342781936;
out_6745007630235635912[74] = -9.92063492063492;
out_6745007630235635912[75] = -9.92063492063492;
out_6745007630235635912[76] = -Bii + 2*y[21]*(-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 0.27*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_6745007630235635912[77] = -Bji;
out_6745007630235635912[78] = Gii + 2*y[21]*(-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 1.0*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_6745007630235635912[79] = Gji;
out_6745007630235635912[80] = -16.0;
out_6745007630235635912[81] = -Bij;
out_6745007630235635912[82] = -Bjj;
out_6745007630235635912[83] = -6.2111801242236;
out_6745007630235635912[84] = Gij;
out_6745007630235635912[85] = Gjj;
out_6745007630235635912[86] = -11.7647058823529;
out_6745007630235635912[87] = -6.2111801242236;
out_6745007630235635912[88] = 2*y[23]*(-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 1.0*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2)) + 17.9758860065765;
out_6745007630235635912[89] = 2*y[23]*(-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 2.5*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2));
return 0;
}
void PowerInMath::Get_GeneratorInfo(void)
{
indexDelta[0] = 0;
Tj[0] = 47;
indexgentrip[0]=0;
indexDelta[1] = 2;
Tj[1] = 12;
indexgentrip[1]=-1;
indexDelta[2] = 4;
Tj[2] = 6;
indexgentrip[2]=1;
}
/*Jacobian for backward problem. */
int PowerInMath::res_Back(double tt,
double *y, double *yp,
double *lamda, double *lamdap, double *out_59027570521894825,
void *user_data)
{
//realtype *out_59027570521894825,*y,*lamda,*lamdap;
//double *u;
//out_59027570521894825=N_VGetArrayPointer(resB);
//y=N_VGetArrayPointer(yy);
//lamda=N_VGetArrayPointer(yyB);
//lamdap=N_VGetArrayPointer(ypB);
DAEUserData* data;
double *u;
data = (DAEUserData*) user_data;
u=data->p;
double alpha=0.0;//Because alpha is passed from JacMatrix(dF/dy+alpha*dF/dyp), and is redundant here
out_59027570521894825[0] = -alpha*lamda[0] + 18.6640510136486*lamda[15]*(-u[0] + 1.0)*sin(y[0]) - lamda[1]*(0.394755732099167*y[15]*sin(y[0]) + 0.394755732099167*y[6]*cos(y[0])) + 18.6640510136486*lamda[6]*(-u[0] + 1.0)*cos(y[0]) + lamdap[0];
out_59027570521894825[1] = -alpha*lamda[1] + 376.991118430775*lamda[0] + lamdap[1];
out_59027570521894825[2] = -alpha*lamda[2] + 7.69469650780387*lamda[16]*sin(y[2]) - lamda[3]*(0.601148164672177*y[16]*sin(y[2]) + 0.601148164672177*y[7]*cos(y[2])) + 7.69469650780387*lamda[7]*cos(y[2]) + lamdap[2];
out_59027570521894825[3] = -alpha*lamda[3] + 376.991118430775*lamda[2] + lamdap[3];
out_59027570521894825[4] = -alpha*lamda[4] + 6.63832552891652*lamda[17]*(-u[1] + 1.0)*sin(y[4]) - lamda[5]*(1.10271188187982*y[17]*sin(y[4]) + 1.10271188187982*y[8]*cos(y[4])) + 6.63832552891652*lamda[8]*(-u[1] + 1.0)*cos(y[4]) + lamdap[4];
out_59027570521894825[5] = -alpha*lamda[5] + 376.991118430775*lamda[4] + lamdap[5];
out_59027570521894825[6] = -lamda[15]*(16.3934426229508*u[0] - 33.7545537340619) - 17.3611111111111*lamda[18] - 0.394755732099167*lamda[1]*sin(y[0]);
out_59027570521894825[7] = 22.25*lamda[16] - 16.0*lamda[22] - 0.601148164672177*lamda[3]*sin(y[2]);
out_59027570521894825[8] = -lamda[17]*(5.52486187845304*u[1] - 22.5897082948353) - 17.0648464163823*lamda[20] - 1.10271188187982*lamda[5]*sin(y[4]);
out_59027570521894825[9] = -17.3611111111111*lamda[15] + 39.9953822108554*lamda[18] - 10.8695652173913*lamda[19] - 11.7647058823529*lamda[23];
out_59027570521894825[10] = -lamda[10]*(2*y[10]*(-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 1.0*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2))) - 10.8695652173913*lamda[18] - lamda[19]*(2*y[10]*(-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) - 0.4*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2)) - 16.7519181585678) - 5.88235294117647*lamda[20];
out_59027570521894825[11] = -17.0648464163823*lamda[17] - 5.88235294117647*lamda[19] + 32.8678342781936*lamda[20] - 9.92063492063492*lamda[21];
out_59027570521894825[12] = -Bji*lamda[22] - Gji*lamda[13] - lamda[12]*(Gii + 2*y[12]*(-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 1.0*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2))) - 9.92063492063492*lamda[20] - lamda[21]*(Bii + 2*y[12]*(-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) - 0.27*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2)));
out_59027570521894825[13] = -Bij*lamda[21] - Bjj*lamda[22] - Gij*lamda[12] - Gjj*lamda[13] - 16.0*lamda[16] - 6.2111801242236*lamda[23];
out_59027570521894825[14] = -lamda[14]*(2*y[14]*(-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 2.5*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2))) - 11.7647058823529*lamda[18] - 6.2111801242236*lamda[22] - lamda[23]*(2*y[14]*(-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) - 1.0*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2)) - 17.9758860065765);
out_59027570521894825[15] = 0.394755732099167*lamda[1]*cos(y[0]) - lamda[6]*(-16.3934426229508*u[0] + 33.7545537340619) + 17.3611111111111*lamda[9];
out_59027570521894825[16] = 16.0*lamda[13] + 0.601148164672177*lamda[3]*cos(y[2]) - 22.25*lamda[7];
out_59027570521894825[17] = 17.0648464163823*lamda[11] + 1.10271188187982*lamda[5]*cos(y[4]) - lamda[8]*(-5.52486187845304*u[1] + 22.5897082948353);
out_59027570521894825[18] = 10.8695652173913*lamda[10] + 11.7647058823529*lamda[14] + 17.3611111111111*lamda[6] - 39.9953822108554*lamda[9];
out_59027570521894825[19] = -lamda[10]*(2*y[19]*(-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 0.4*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2)) + 16.7519181585678) + 5.88235294117647*lamda[11] - lamda[19]*(2*y[19]*(-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 1.0*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2))) + 10.8695652173913*lamda[9];
out_59027570521894825[20] = 5.88235294117647*lamda[10] - 32.8678342781936*lamda[11] + 9.92063492063492*lamda[12] + 17.0648464163823*lamda[8];
out_59027570521894825[21] = Bji*lamda[13] - Gji*lamda[22] + 9.92063492063492*lamda[11] - lamda[12]*(-Bii + 2*y[21]*(-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 0.27*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2))) - lamda[21]*(Gii + 2*y[21]*(-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 1.0*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2)));
out_59027570521894825[22] = Bij*lamda[12] + Bjj*lamda[13] - Gij*lamda[21] - Gjj*lamda[22] + 6.2111801242236*lamda[14] + 16.0*lamda[7];
out_59027570521894825[23] = 6.2111801242236*lamda[13] - lamda[14]*(2*y[23]*(-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 1.0*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2)) + 17.9758860065765) - lamda[23]*(2*y[23]*(-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 2.5*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2))) + 11.7647058823529*lamda[9];
adddgdy(y, out_59027570521894825);//see attachfunc.cpp
return 0;
}
void PowerInMath::Jac_PointerIndices_Back(SlsMat JacMat)
{
JacMat->colptrs[0] = 0;
JacMat->colptrs[1] = 2;
JacMat->colptrs[2] = 6;
JacMat->colptrs[3] = 8;
JacMat->colptrs[4] = 12;
JacMat->colptrs[5] = 14;
JacMat->colptrs[6] = 18;
JacMat->colptrs[7] = 21;
JacMat->colptrs[8] = 24;
JacMat->colptrs[9] = 27;
JacMat->colptrs[10] = 31;
JacMat->colptrs[11] = 35;
JacMat->colptrs[12] = 39;
JacMat->colptrs[13] = 44;
JacMat->colptrs[14] = 50;
JacMat->colptrs[15] = 54;
JacMat->colptrs[16] = 57;
JacMat->colptrs[17] = 60;
JacMat->colptrs[18] = 63;
JacMat->colptrs[19] = 67;
JacMat->colptrs[20] = 71;
JacMat->colptrs[21] = 75;
JacMat->colptrs[22] = 80;
JacMat->colptrs[23] = 86;
JacMat->colptrs[24] = 90;
JacMat->rowvals[0] = 0;
JacMat->rowvals[1] = 1;
JacMat->rowvals[2] = 0;
JacMat->rowvals[3] = 1;
JacMat->rowvals[4] = 6;
JacMat->rowvals[5] = 15;
JacMat->rowvals[6] = 2;
JacMat->rowvals[7] = 3;
JacMat->rowvals[8] = 2;
JacMat->rowvals[9] = 3;
JacMat->rowvals[10] = 7;
JacMat->rowvals[11] = 16;
JacMat->rowvals[12] = 4;
JacMat->rowvals[13] = 5;
JacMat->rowvals[14] = 4;
JacMat->rowvals[15] = 5;
JacMat->rowvals[16] = 8;
JacMat->rowvals[17] = 17;
JacMat->rowvals[18] = 0;
JacMat->rowvals[19] = 15;
JacMat->rowvals[20] = 18;
JacMat->rowvals[21] = 2;
JacMat->rowvals[22] = 16;
JacMat->rowvals[23] = 22;
JacMat->rowvals[24] = 4;
JacMat->rowvals[25] = 17;
JacMat->rowvals[26] = 20;
JacMat->rowvals[27] = 15;
JacMat->rowvals[28] = 18;
JacMat->rowvals[29] = 19;
JacMat->rowvals[30] = 23;
JacMat->rowvals[31] = 10;
JacMat->rowvals[32] = 18;
JacMat->rowvals[33] = 19;
JacMat->rowvals[34] = 20;
JacMat->rowvals[35] = 17;
JacMat->rowvals[36] = 19;
JacMat->rowvals[37] = 20;
JacMat->rowvals[38] = 21;
JacMat->rowvals[39] = 12;
JacMat->rowvals[40] = 13;
JacMat->rowvals[41] = 20;
JacMat->rowvals[42] = 21;
JacMat->rowvals[43] = 22;
JacMat->rowvals[44] = 12;
JacMat->rowvals[45] = 13;
JacMat->rowvals[46] = 16;
JacMat->rowvals[47] = 21;
JacMat->rowvals[48] = 22;
JacMat->rowvals[49] = 23;
JacMat->rowvals[50] = 14;
JacMat->rowvals[51] = 18;
JacMat->rowvals[52] = 22;
JacMat->rowvals[53] = 23;
JacMat->rowvals[54] = 0;
JacMat->rowvals[55] = 6;
JacMat->rowvals[56] = 9;
JacMat->rowvals[57] = 2;
JacMat->rowvals[58] = 7;
JacMat->rowvals[59] = 13;
JacMat->rowvals[60] = 4;
JacMat->rowvals[61] = 8;
JacMat->rowvals[62] = 11;
JacMat->rowvals[63] = 6;
JacMat->rowvals[64] = 9;
JacMat->rowvals[65] = 10;
JacMat->rowvals[66] = 14;
JacMat->rowvals[67] = 9;
JacMat->rowvals[68] = 10;
JacMat->rowvals[69] = 11;
JacMat->rowvals[70] = 19;
JacMat->rowvals[71] = 8;
JacMat->rowvals[72] = 10;
JacMat->rowvals[73] = 11;
JacMat->rowvals[74] = 12;
JacMat->rowvals[75] = 11;
JacMat->rowvals[76] = 12;
JacMat->rowvals[77] = 13;
JacMat->rowvals[78] = 21;
JacMat->rowvals[79] = 22;
JacMat->rowvals[80] = 7;
JacMat->rowvals[81] = 12;
JacMat->rowvals[82] = 13;
JacMat->rowvals[83] = 14;
JacMat->rowvals[84] = 21;
JacMat->rowvals[85] = 22;
JacMat->rowvals[86] = 9;
JacMat->rowvals[87] = 13;
JacMat->rowvals[88] = 14;
JacMat->rowvals[89] = 23;
}
int PowerInMath::JacSparse_Back(double tt, double cjB,
double *y, double *yp,
double *lamda, double *lamdap, double *out_8226810114989392549,
SlsMat JacMatB, void *user_data,
double *tmp1B, double *tmp2B, double *tmp3B)
{
//realtype *out_8226810114989392549,*y,*lamda,*lamdap;
//double *u;
out_8226810114989392549=JacMatB->data;
Jac_PointerIndices_Back(JacMatB);
//y=N_VGetArrayPointer(yy);
//lamda=N_VGetArrayPointer(yyB);
//lamdap=N_VGetArrayPointer(ypB);
DAEUserData* data;
double *u;
data = (DAEUserData*) user_data;
u=data->p;
double alpha= - cjB;
out_8226810114989392549[0] = -alpha;
out_8226810114989392549[1] = 376.991118430775;
out_8226810114989392549[2] = -0.394755732099167*y[15]*sin(y[0]) - 0.394755732099167*y[6]*cos(y[0]);
out_8226810114989392549[3] = -alpha;
out_8226810114989392549[4] = -0.394755732099167*sin(y[0]);
out_8226810114989392549[5] = 0.394755732099167*cos(y[0]);
out_8226810114989392549[6] = -alpha;
out_8226810114989392549[7] = 376.991118430775;
out_8226810114989392549[8] = -0.601148164672177*y[16]*sin(y[2]) - 0.601148164672177*y[7]*cos(y[2]);
out_8226810114989392549[9] = -alpha;
out_8226810114989392549[10] = -0.601148164672177*sin(y[2]);
out_8226810114989392549[11] = 0.601148164672177*cos(y[2]);
out_8226810114989392549[12] = -alpha;
out_8226810114989392549[13] = 376.991118430775;
out_8226810114989392549[14] = -1.10271188187982*y[17]*sin(y[4]) - 1.10271188187982*y[8]*cos(y[4]);
out_8226810114989392549[15] = -alpha;
out_8226810114989392549[16] = -1.10271188187982*sin(y[4]);
out_8226810114989392549[17] = 1.10271188187982*cos(y[4]);
out_8226810114989392549[18] = 18.6640510136486*(-u[0] + 1.0)*cos(y[0]);
out_8226810114989392549[19] = 16.3934426229508*u[0] - 33.7545537340619;
out_8226810114989392549[20] = 17.3611111111111;
out_8226810114989392549[21] = 7.69469650780387*cos(y[2]);
out_8226810114989392549[22] = -22.25;
out_8226810114989392549[23] = 16.0;
out_8226810114989392549[24] = 6.63832552891652*(-u[1] + 1.0)*cos(y[4]);
out_8226810114989392549[25] = 5.52486187845304*u[1] - 22.5897082948353;
out_8226810114989392549[26] = 17.0648464163823;
out_8226810114989392549[27] = 17.3611111111111;
out_8226810114989392549[28] = -39.9953822108554;
out_8226810114989392549[29] = 10.8695652173913;
out_8226810114989392549[30] = 11.7647058823529;
out_8226810114989392549[31] = -2*y[10]*(-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) - 1.0*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2));
out_8226810114989392549[32] = 10.8695652173913;
out_8226810114989392549[33] = -2*y[19]*(-u[2] + 1.0)*(-1.0*y[10] - 0.4*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) - 0.4*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2)) - 16.7519181585678;
out_8226810114989392549[34] = 5.88235294117647;
out_8226810114989392549[35] = 17.0648464163823;
out_8226810114989392549[36] = 5.88235294117647;
out_8226810114989392549[37] = -32.8678342781936;
out_8226810114989392549[38] = 9.92063492063492;
out_8226810114989392549[39] = -Gii - 2*y[12]*(-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) - 1.0*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_8226810114989392549[40] = -Gij;
out_8226810114989392549[41] = 9.92063492063492;
out_8226810114989392549[42] = Bii - 2*y[21]*(-u[3] + 1.0)*(-1.0*y[12] - 0.27*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) - 0.27*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_8226810114989392549[43] = Bij;
out_8226810114989392549[44] = -Gji;
out_8226810114989392549[45] = -Gjj;
out_8226810114989392549[46] = 16.0;
out_8226810114989392549[47] = Bji;
out_8226810114989392549[48] = Bjj;
out_8226810114989392549[49] = 6.2111801242236;
out_8226810114989392549[50] = -2*y[14]*(-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) - 2.5*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2));
out_8226810114989392549[51] = 11.7647058823529;
out_8226810114989392549[52] = 6.2111801242236;
out_8226810114989392549[53] = -2*y[23]*(-u[4] + 1.0)*(-2.5*y[14] - 1.0*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) - 1.0*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2)) - 17.9758860065765;
out_8226810114989392549[54] = 18.6640510136486*(-u[0] + 1.0)*sin(y[0]);
out_8226810114989392549[55] = -16.3934426229508*u[0] + 33.7545537340619;
out_8226810114989392549[56] = -17.3611111111111;
out_8226810114989392549[57] = 7.69469650780387*sin(y[2]);
out_8226810114989392549[58] = 22.25;
out_8226810114989392549[59] = -16.0;
out_8226810114989392549[60] = 6.63832552891652*(-u[1] + 1.0)*sin(y[4]);
out_8226810114989392549[61] = -5.52486187845304*u[1] + 22.5897082948353;
out_8226810114989392549[62] = -17.0648464163823;
out_8226810114989392549[63] = -17.3611111111111;
out_8226810114989392549[64] = 39.9953822108554;
out_8226810114989392549[65] = -10.8695652173913;
out_8226810114989392549[66] = -11.7647058823529;
out_8226810114989392549[67] = -10.8695652173913;
out_8226810114989392549[68] = -2*y[10]*(-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) + 0.4*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2)) + 16.7519181585678;
out_8226810114989392549[69] = -5.88235294117647;
out_8226810114989392549[70] = -2*y[19]*(-u[2] + 1.0)*(0.4*y[10] - 1.0*y[19])/pow(pow(y[10], 2) + pow(y[19], 2), 2) - 1.0*(-u[2] + 1.0)/(pow(y[10], 2) + pow(y[19], 2));
out_8226810114989392549[71] = -17.0648464163823;
out_8226810114989392549[72] = -5.88235294117647;
out_8226810114989392549[73] = 32.8678342781936;
out_8226810114989392549[74] = -9.92063492063492;
out_8226810114989392549[75] = -9.92063492063492;
out_8226810114989392549[76] = -Bii - 2*y[12]*(-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) + 0.27*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_8226810114989392549[77] = -Bij;
out_8226810114989392549[78] = -Gii - 2*y[21]*(-u[3] + 1.0)*(0.27*y[12] - 1.0*y[21])/pow(pow(y[12], 2) + pow(y[21], 2), 2) - 1.0*(-u[3] + 1.0)/(pow(y[12], 2) + pow(y[21], 2));
out_8226810114989392549[79] = -Gij;
out_8226810114989392549[80] = -16.0;
out_8226810114989392549[81] = -Bji;
out_8226810114989392549[82] = -Bjj;
out_8226810114989392549[83] = -6.2111801242236;
out_8226810114989392549[84] = -Gji;
out_8226810114989392549[85] = -Gjj;
out_8226810114989392549[86] = -11.7647058823529;
out_8226810114989392549[87] = -6.2111801242236;
out_8226810114989392549[88] = -2*y[14]*(-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) + 1.0*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2)) + 17.9758860065765;
out_8226810114989392549[89] = -2*y[23]*(-u[4] + 1.0)*(1.0*y[14] - 2.5*y[23])/pow(pow(y[14], 2) + pow(y[23], 2), 2) - 2.5*(-u[4] + 1.0)/(pow(y[14], 2) + pow(y[23], 2));
return 0;
}
void PowerInMath::rhsQ_Back(double tt,
double *y, double *yp,
double *lamda, double *ypB,
double *out_4658068923000172945, void *user_dataB)
{
//realtype *y,*out_4658068923000172945,*lamda;
//double *u;
//out_4658068923000172945=N_VGetArrayPointer(resQB);
//y=N_VGetArrayPointer(yy);
//lamda=N_VGetArrayPointer(yyB);
DAEUserData* data;
double *u;
data = (DAEUserData*) user_dataB;
u=data->p;
out_4658068923000172945[0] = -lamda[15]*(16.3934426229508*y[6] - 18.6640510136486*cos(y[0])) - lamda[6]*(-16.3934426229508*y[15] + 18.6640510136486*sin(y[0]));
out_4658068923000172945[1] = -lamda[17]*(5.52486187845304*y[8] - 6.63832552891652*cos(y[4])) - lamda[8]*(-5.52486187845304*y[17] + 6.63832552891652*sin(y[4]));
out_4658068923000172945[2] = -lamda[10]*(-1.0*y[10] - 0.4*y[19])/(pow(y[10], 2) + pow(y[19], 2)) - lamda[19]*(0.4*y[10] - 1.0*y[19])/(pow(y[10], 2) + pow(y[19], 2));
out_4658068923000172945[3] = -lamda[12]*(-1.0*y[12] - 0.27*y[21])/(pow(y[12], 2) + pow(y[21], 2)) - lamda[21]*(0.27*y[12] - 1.0*y[21])/(pow(y[12], 2) + pow(y[21], 2));
out_4658068923000172945[4] = -lamda[14]*(-2.5*y[14] - 1.0*y[23])/(pow(y[14], 2) + pow(y[23], 2)) - lamda[23]*(1.0*y[14] - 2.5*y[23])/(pow(y[14], 2) + pow(y[23], 2));
adddgdp(y, out_4658068923000172945);//see attachfunc.cpp
}
} | [
"lizhh9017@gmail.com"
] | lizhh9017@gmail.com |
6bcafbd6c987341cfcf75275a31d284c287aed46 | 0b44be610de6cdc96d908d96b1106c52802ed374 | /code/group3/ll/Intercepting Filter Pattern/FilterManager.h | 0a07f335921e92428d4eddb6587a57a052a58667 | [] | no_license | DOGGY-SAINT/designPatternClassDesign | 1daa43fa3162d309bdec9e2e87366845adf96c7e | 4dfbd073567227188ecf4aadde849cf1b278fc56 | refs/heads/master | 2023-01-19T11:32:03.013166 | 2020-11-25T07:14:22 | 2020-11-25T07:14:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 238 | h | #pragma once
#include"FilterChain.h"
class FilterManager
{
public:
FilterManager() {};
FilterManager(Target target);
void setFilter(Filter* filter);
void filterRequest(string request);
private:
FilterChain* chain;
};
| [
"1227678132@qq.com"
] | 1227678132@qq.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.