hexsha stringlengths 40 40 | size int64 7 1.05M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 269 | max_stars_repo_name stringlengths 5 109 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count int64 1 191k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 4 269 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 9 | max_issues_count int64 1 48.5k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 4 269 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 9 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 7 1.05M | avg_line_length float64 1.21 330k | max_line_length int64 6 990k | alphanum_fraction float64 0.01 0.99 | author_id stringlengths 2 40 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b54dd92db8987afcec218d39984890a19014970e | 3,085 | cpp | C++ | source/QtGui/QCompleterSlots.cpp | kenny1818/qt4xhb | f62f40d8b17acb93761014317b52da9f919707d0 | [
"MIT"
] | 1 | 2021-03-07T10:44:03.000Z | 2021-03-07T10:44:03.000Z | source/QtGui/QCompleterSlots.cpp | kenny1818/qt4xhb | f62f40d8b17acb93761014317b52da9f919707d0 | [
"MIT"
] | null | null | null | source/QtGui/QCompleterSlots.cpp | kenny1818/qt4xhb | f62f40d8b17acb93761014317b52da9f919707d0 | [
"MIT"
] | 2 | 2020-07-19T03:28:08.000Z | 2021-03-05T18:07:20.000Z | /*
Qt4xHb - Bindings libraries for Harbour/xHarbour and Qt Framework 4
Copyright (C) 2021 Marcos Antonio Gambeta <marcosgambeta AT outlook DOT com>
*/
/*
DO NOT EDIT THIS FILE - the content was created using a source code generator
*/
#include "QCompleterSlots.h"
QCompleterSlots::QCompleterSlots( QObject * parent ) : QObject( parent )
{
}
QCompleterSlots::~QCompleterSlots()
{
}
void QCompleterSlots::activated( const QString & text )
{
QObject * object = qobject_cast< QObject * >( sender() );
PHB_ITEM cb = Qt4xHb::Signals_return_codeblock( object, "activated(QString)" );
if( cb )
{
PHB_ITEM pSender = Qt4xHb::Signals_return_qobject( object, "QCOMPLETER" );
PHB_ITEM pText = hb_itemPutC( NULL, QSTRINGTOSTRING( text ) );
hb_vmEvalBlockV( cb, 2, pSender, pText );
hb_itemRelease( pSender );
hb_itemRelease( pText );
}
}
void QCompleterSlots::activated( const QModelIndex & index )
{
QObject * object = qobject_cast< QObject * >( sender() );
PHB_ITEM cb = Qt4xHb::Signals_return_codeblock( object, "activated(QModelIndex)" );
if( cb )
{
PHB_ITEM pSender = Qt4xHb::Signals_return_qobject( object, "QCOMPLETER" );
PHB_ITEM pIndex = Qt4xHb::Signals_return_object( ( void * ) &index, "QMODELINDEX" );
hb_vmEvalBlockV( cb, 2, pSender, pIndex );
hb_itemRelease( pSender );
hb_itemRelease( pIndex );
}
}
void QCompleterSlots::highlighted( const QString & text )
{
QObject * object = qobject_cast< QObject * >( sender() );
PHB_ITEM cb = Qt4xHb::Signals_return_codeblock( object, "highlighted(QString)" );
if( cb )
{
PHB_ITEM pSender = Qt4xHb::Signals_return_qobject( object, "QCOMPLETER" );
PHB_ITEM pText = hb_itemPutC( NULL, QSTRINGTOSTRING( text ) );
hb_vmEvalBlockV( cb, 2, pSender, pText );
hb_itemRelease( pSender );
hb_itemRelease( pText );
}
}
void QCompleterSlots::highlighted( const QModelIndex & index )
{
QObject * object = qobject_cast< QObject * >( sender() );
PHB_ITEM cb = Qt4xHb::Signals_return_codeblock( object, "highlighted(QModelIndex)" );
if( cb )
{
PHB_ITEM pSender = Qt4xHb::Signals_return_qobject( object, "QCOMPLETER" );
PHB_ITEM pIndex = Qt4xHb::Signals_return_object( ( void * ) &index, "QMODELINDEX" );
hb_vmEvalBlockV( cb, 2, pSender, pIndex );
hb_itemRelease( pSender );
hb_itemRelease( pIndex );
}
}
void QCompleterSlots_connect_signal( const QString & signal, const QString & slot )
{
QCompleter * obj = qobject_cast< QCompleter * >( Qt4xHb::getQObjectPointerFromSelfItem() );
if( obj )
{
QCompleterSlots * s = QCoreApplication::instance()->findChild<QCompleterSlots *>();
if( s == NULL )
{
s = new QCompleterSlots();
s->moveToThread( QCoreApplication::instance()->thread() );
s->setParent( QCoreApplication::instance() );
}
hb_retl( Qt4xHb::Signals_connection_disconnection( s, signal, slot ) );
}
else
{
hb_retl( false );
}
}
| 26.367521 | 94 | 0.656402 | kenny1818 |
b5519edfc70ce85094dd4edd2d7e878df8063301 | 7,022 | cpp | C++ | nodes/ipt/gateway/src/tasks/push_ops.cpp | solosTec/node | e35e127867a4f66129477b780cbd09c5231fc7da | [
"MIT"
] | 2 | 2020-03-03T12:40:29.000Z | 2021-05-06T06:20:19.000Z | nodes/ipt/gateway/src/tasks/push_ops.cpp | solosTec/node | e35e127867a4f66129477b780cbd09c5231fc7da | [
"MIT"
] | 7 | 2020-01-14T20:38:04.000Z | 2021-05-17T09:52:07.000Z | nodes/ipt/gateway/src/tasks/push_ops.cpp | solosTec/node | e35e127867a4f66129477b780cbd09c5231fc7da | [
"MIT"
] | 2 | 2019-11-09T09:14:48.000Z | 2020-03-03T12:40:30.000Z | /*
* The MIT License (MIT)
*
* Copyright (c) 2018 Sylko Olzscher
*
*/
#include "push_ops.h"
#include <smf/sml/event.h>
#include <cyng/async/task/base_task.h>
#include <cyng/chrono.h>
#include <cyng/io/io_chrono.hpp>
#include <cyng/vm/generator.h>
#include <boost/filesystem.hpp>
#include <boost/range/iterator_range.hpp>
namespace node
{
namespace ipt
{
push_ops::push_ops(cyng::async::base_task* btp
, cyng::logging::log_ptr logger
, node::sml::status& status_word
, cyng::store::db& config_db
, cyng::controller& vm
, cyng::table::key_type const& key
, boost::uuids::uuid tag)
: base_(*btp)
, logger_(logger)
, status_word_(status_word)
, config_db_(config_db)
, vm_(vm)
, key_(key)
, tag_(tag)
, state_(TASK_STATE_INITIAL_)
{
CYNG_LOG_INFO(logger_, "initialize task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< ">");
}
cyng::continuation push_ops::run()
{
switch (state_) {
case TASK_STATE_INITIAL_:
//
// update task state
//
state_ = TASK_STATE_RUNNING_;
//
// update "push.ops" table with this task id
//
config_db_.modify("push.ops", key_, cyng::param_factory("task", base_.get_id()), tag_);
//
// calculate next timepoint
//
#ifdef _DEBUG
push();
#endif
set_tp();
break;
default:
CYNG_LOG_INFO(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> push data");
push();
set_tp();
break;
}
//
// start interval timer
//
return cyng::continuation::TASK_CONTINUE;
}
void push_ops::stop()
{
//bus_->stop();
CYNG_LOG_INFO(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> is stopped");
}
// slot 0
cyng::continuation push_ops::process(bool success
, std::uint32_t channel
, std::uint32_t source
, std::uint16_t status
, std::size_t count
, std::string target)
{
if (success) {
CYNG_LOG_TRACE(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> push channel "
<< target
<< " is open");
//
// ToDo: push data
//
//
for (auto const& entry : boost::make_iterator_range(boost::filesystem::directory_iterator("D:\\installations\\EBS\\reimport"), {}))
{
//const std::string file_name = "D:\\installations\\EBS\\debug\\smf--SML-201812T191303-pushStore49b04d0a-31a3a9c5.sml";
const std::string file_name = entry.path().string();
std::ifstream file(file_name, std::ios::binary | std::ios::app);
if (file.is_open())
{
// dont skip whitepsaces
file >> std::noskipws;
cyng::buffer_t data;
data.insert(data.begin(), std::istream_iterator<char>(file), std::istream_iterator<char>());
vm_.async_run(cyng::generate_invoke("req.transfer.push.data"
, channel
, source
, std::uint8_t(0xC1) // status
, std::uint8_t(0) // block
, data));
vm_.async_run(cyng::generate_invoke("stream.flush"));
file.close();
CYNG_LOG_WARNING(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> remove "
<< entry.path());
boost::filesystem::remove(entry.path());
config_db_.insert("op.log"
, cyng::table::key_generator(0UL)
, cyng::table::data_generator(std::chrono::system_clock::now()
, static_cast<std::uint32_t>(900u) // reg period - 15 min
, std::chrono::system_clock::now() // val time
, static_cast<std::uint64_t>(status_word_.operator std::uint64_t()) // status
, node::sml::evt_push_succes() // event - push successful
, cyng::make_buffer({ 0x81, 0x46, 0x00, 0x00, 0x02, 0xFF })
, std::chrono::system_clock::now() // val time
, cyng::make_buffer({ 0x02, 0xE6, 0x1E, 0x27, 0x66, 0x03, 0x15, 0x35, 0x03 })
, target
, static_cast<std::uint8_t>(1u)) // push_nr
, 1 // generation
, tag_);
break; // one item at a time
}
}
//
// close push channel
//
CYNG_LOG_TRACE(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> close push channel "
<< channel
<< ':'
<< source);
vm_.async_run(cyng::generate_invoke("req.close.push.channel", channel));
}
else {
CYNG_LOG_WARNING(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> open push channel "
<< target
<< " failed");
}
return cyng::continuation::TASK_CONTINUE;
}
void push_ops::set_tp()
{
config_db_.access([&](cyng::store::table const* tbl) {
auto rec = tbl->lookup(this->key_);
const std::chrono::seconds interval(cyng::value_cast<std::uint32_t>(rec["interval"], 900u));
if (interval < std::chrono::minutes(1)) {
}
else if (interval < std::chrono::minutes(60)) {
const std::chrono::minutes interval_minutes = std::chrono::duration_cast<std::chrono::minutes>(interval);
std::tm tmp = cyng::chrono::make_utc_tm(std::chrono::system_clock::now());
auto current_minute = cyng::chrono::minute(tmp);
auto modulo_minutes = current_minute % interval_minutes.count();
BOOST_ASSERT(current_minute >= modulo_minutes);
//
// get next optimal time point to start
//
auto ntp = cyng::chrono::init_tp(cyng::chrono::year(tmp)
, cyng::chrono::month(tmp)
, cyng::chrono::day(tmp)
, cyng::chrono::hour(tmp)
, (current_minute - modulo_minutes)
, 0.0) + interval_minutes;
CYNG_LOG_INFO(logger_, "task #"
<< base_.get_id()
<< " interval: "
<< cyng::to_str(interval)
<< " - next data push at "
<< cyng::to_str(ntp)
<< " UTC");
this->base_.suspend_until(ntp);
}
else if (interval < std::chrono::minutes(60 * 24)) {
}
else {
}
} , cyng::store::read_access("push.ops"));
}
void push_ops::push()
{
if (status_word_.is_authorized()) {
config_db_.access([&](cyng::store::table const* tbl) {
auto rec = tbl->lookup(this->key_);
const auto target(cyng::value_cast<std::string>(rec["target"], ""));
CYNG_LOG_INFO(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> open channel "
<< target);
vm_
.async_run(cyng::generate_invoke("req.open.push.channel", target, "", "", "", "", 0))
.async_run(cyng::generate_invoke("bus.store.rel.channel.open", cyng::invoke("ipt.seq.push"), base_.get_id(), target))
.async_run(cyng::generate_invoke("stream.flush", target))
.async_run(cyng::generate_invoke("log.msg.info", "req.open.push.channel", cyng::invoke("ipt.seq.push")))
;
}, cyng::store::read_access("push.ops"));
}
else {
CYNG_LOG_WARNING(logger_, "task #"
<< base_.get_id()
<< " <"
<< base_.get_class_name()
<< "> is offline");
}
}
}
}
| 24.725352 | 135 | 0.583452 | solosTec |
b55546e0dfb8273c117ae6fdcb21f01ecb74cb44 | 1,459 | cpp | C++ | 1304B.cpp | felikjunvianto/kfile-codeforces-submissions | 1b53da27a294a12063b0912e12ad32efe24af678 | [
"MIT"
] | null | null | null | 1304B.cpp | felikjunvianto/kfile-codeforces-submissions | 1b53da27a294a12063b0912e12ad32efe24af678 | [
"MIT"
] | null | null | null | 1304B.cpp | felikjunvianto/kfile-codeforces-submissions | 1b53da27a294a12063b0912e12ad32efe24af678 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pi 2*acos(0.0)
#define eps 1e-9
#define PII pair<int,int>
#define PDD pair<double,double>
#define LL long long
#define INF 1000000000
using namespace std;
int N, len;
bool matched[111];
vector<string> word;
char inp[111];
bool couple(string i, string j) {
for(int x = 0; x < len; x++)
if(i[x] != j[len - x - 1]) return false;
return true;
}
bool isPalin(string i) {
for(int x = 0; 2 * x < len; x++)
if(i[x] != i[len - x - 1]) return false;
return true;
}
int main() {
scanf("%d %d", &N, &len);
for(int i = 0; i < N; i++) {
scanf("%s", inp);
word.pb(inp);
}
string ans = "";
int longestSelfIdx = -1;
for(int i = 0; i < N; i++) if(isPalin(word[i]))
if(longestSelfIdx == -1 || word[longestSelfIdx].size() < word[i].size())
longestSelfIdx = i;
memset(matched, false, sizeof(matched));
if(longestSelfIdx != -1) {
matched[longestSelfIdx] = true;
ans = word[longestSelfIdx];
}
for(int i = 0; i < N; i++) if(!matched[i]) {
for(int j = i + 1; j < N; j++) if(couple(word[i], word[j])) {
matched[i] = matched[j] = true;
ans = word[i] + ans + word[j];
break;
}
}
printf("%d\n%s\n", (int) ans.size(), ans.c_str());
return 0;
}
| 19.716216 | 74 | 0.609321 | felikjunvianto |
b5555b1cc09052dff2537c6c5a6fae32cabdb828 | 269 | cpp | C++ | Cplusplus/week_four/extra/DailyTask_Mechanic/main.cpp | nexusstar/SoftUni | b97bdb08a227fd335df5b7869940c14717f760f2 | [
"MIT"
] | 1 | 2016-12-20T19:53:03.000Z | 2016-12-20T19:53:03.000Z | Cplusplus/week_four/extra/DailyTask_Mechanic/main.cpp | nexusstar/SoftUni | b97bdb08a227fd335df5b7869940c14717f760f2 | [
"MIT"
] | null | null | null | Cplusplus/week_four/extra/DailyTask_Mechanic/main.cpp | nexusstar/SoftUni | b97bdb08a227fd335df5b7869940c14717f760f2 | [
"MIT"
] | null | null | null | #include <iostream>
#include "man.h"
#include "mechanic.h"
int main()
{
Car ford = Car(1000);
Mechanic fordGuro;
Man goshoForda;
std::cout << fordGuro.carRepairPrice(ford) << std::endl;
fordGuro.repairCar(ford);
goshoForda.crashCar(ford);
return 0;
}
| 15.823529 | 58 | 0.67658 | nexusstar |
b55e7ffdaf3fd0787733bf3960e77b7f7e6f763a | 277 | hpp | C++ | src/blackhole/detail/traits/attributes/pack/keyword.hpp | bioothod/blackhole | 2bd242e6027f20019e60b600f50a9e25127db640 | [
"MIT"
] | 1 | 2015-01-12T05:23:28.000Z | 2015-01-12T05:23:28.000Z | src/blackhole/detail/traits/attributes/pack/keyword.hpp | tomzhang/blackhole | 4f9b7dec11b9a617b51f188bb792a1514b0bb763 | [
"MIT"
] | null | null | null | src/blackhole/detail/traits/attributes/pack/keyword.hpp | tomzhang/blackhole | 4f9b7dec11b9a617b51f188bb792a1514b0bb763 | [
"MIT"
] | null | null | null | #pragma once
#include "blackhole/attribute.hpp"
#include "blackhole/detail/traits/same.hpp"
namespace blackhole {
namespace aux {
template<class... Args>
struct is_keyword_pack : public are_same<attribute::pair_t, Args...> {};
} // namespace aux
} // namespace blackhole
| 17.3125 | 72 | 0.736462 | bioothod |
b5615bd1297a09de1e543b7de5bc79217e1e61ca | 3,294 | cpp | C++ | RenderCore/Assets/AssetUtils.cpp | djewsbury/XLE | 7806e4b5c9de5631c94c2020f6adcd4bd8e3d91e | [
"MIT"
] | 3 | 2015-12-04T09:16:53.000Z | 2021-05-28T23:22:49.000Z | RenderCore/Assets/AssetUtils.cpp | djewsbury/XLE | 7806e4b5c9de5631c94c2020f6adcd4bd8e3d91e | [
"MIT"
] | null | null | null | RenderCore/Assets/AssetUtils.cpp | djewsbury/XLE | 7806e4b5c9de5631c94c2020f6adcd4bd8e3d91e | [
"MIT"
] | 2 | 2015-03-03T05:32:39.000Z | 2015-12-04T09:16:54.000Z | // Distributed under the MIT License (See
// accompanying file "LICENSE" or the website
// http://www.opensource.org/licenses/mit-license.php)
#include "AssetUtils.h"
#include "ModelScaffoldInternal.h"
#include "../Types.h"
#include "../Format.h"
#include "../StateDesc.h"
namespace RenderCore { namespace Assets
{
std::ostream& SerializationOperator(std::ostream& stream, const GeoInputAssembly& ia)
{
stream << "Stride: " << ia._vertexStride << ": ";
for (size_t c=0; c<ia._elements.size(); c++) {
if (c != 0) stream << ", ";
const auto& e = ia._elements[c];
stream << e._semanticName << "[" << e._semanticIndex << "] " << AsString(e._nativeFormat);
}
return stream;
}
std::ostream& SerializationOperator(std::ostream& stream, const DrawCallDesc& dc)
{
stream << "{ [" << AsString(dc._topology) << "] idxCount: " << dc._indexCount;
if (dc._firstIndex)
stream << ", firstIdx: " << dc._firstIndex;
stream << ", material: " << dc._subMaterialIndex;
stream << ", topology: " << dc._subMaterialIndex;
stream << " }";
return stream;
}
GeoInputAssembly CreateGeoInputAssembly(
const std::vector<InputElementDesc>& vertexInputLayout,
unsigned vertexStride)
{
GeoInputAssembly result;
result._vertexStride = vertexStride;
result._elements.reserve(vertexInputLayout.size());
for (auto i=vertexInputLayout.begin(); i!=vertexInputLayout.end(); ++i) {
RenderCore::Assets::VertexElement ele;
XlZeroMemory(ele); // make sure unused space is 0
XlCopyNString(ele._semanticName, AsPointer(i->_semanticName.begin()), i->_semanticName.size());
ele._semanticName[dimof(ele._semanticName)-1] = '\0';
ele._semanticIndex = i->_semanticIndex;
ele._nativeFormat = i->_nativeFormat;
ele._alignedByteOffset = i->_alignedByteOffset;
result._elements.push_back(ele);
}
return std::move(result);
}
unsigned BuildLowLevelInputAssembly(
IteratorRange<InputElementDesc*> dst,
IteratorRange<const RenderCore::Assets::VertexElement*> source,
unsigned lowLevelSlot)
{
unsigned vertexElementCount = 0;
for (unsigned i=0; i<source.size(); ++i) {
auto& sourceElement = source[i];
assert((vertexElementCount+1) <= dst.size());
if ((vertexElementCount+1) <= dst.size()) {
// in some cases we need multiple "slots". When we have multiple slots, the vertex data
// should be one after another in the vb (that is, not interleaved)
dst[vertexElementCount++] = InputElementDesc(
sourceElement._semanticName, sourceElement._semanticIndex,
sourceElement._nativeFormat, lowLevelSlot, sourceElement._alignedByteOffset);
}
}
return vertexElementCount;
}
std::vector<MiniInputElementDesc> BuildLowLevelInputAssembly(IteratorRange<const RenderCore::Assets::VertexElement*> source)
{
std::vector<MiniInputElementDesc> result;
result.reserve(source.size());
for (unsigned i=0; i<source.size(); ++i) {
auto& sourceElement = source[i];
#if defined(_DEBUG)
auto expectedOffset = CalculateVertexStride(MakeIteratorRange(result), false);
assert(expectedOffset == sourceElement._alignedByteOffset);
#endif
result.push_back(
MiniInputElementDesc{Hash64(sourceElement._semanticName) + sourceElement._semanticIndex, sourceElement._nativeFormat});
}
return result;
}
}}
| 35.804348 | 125 | 0.710383 | djewsbury |
b561bb8184e273e58c65defc683fe7aeb52056f4 | 358 | cpp | C++ | Solutions/Project Euler #001: Multiples of 3 and 5.cpp | KronoFaze/hackerrank-project-euler-submissions | 988af9487846deaefc1ad056ec68d4016ecd4754 | [
"MIT"
] | null | null | null | Solutions/Project Euler #001: Multiples of 3 and 5.cpp | KronoFaze/hackerrank-project-euler-submissions | 988af9487846deaefc1ad056ec68d4016ecd4754 | [
"MIT"
] | null | null | null | Solutions/Project Euler #001: Multiples of 3 and 5.cpp | KronoFaze/hackerrank-project-euler-submissions | 988af9487846deaefc1ad056ec68d4016ecd4754 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
long long calc(int n, int m) {
n = (n - 1) / m;
return (1LL * m * n * (n + 1)) / 2;
}
int main(void) {
int t;
scanf("%d", &t);
while(t--) {
int n;
scanf("%d", &n);
long long ans = calc(n, 3) + calc(n, 5) - calc(n, 15);
printf("%lld\n", ans);
}
}
| 18.842105 | 63 | 0.427374 | KronoFaze |
b564d3407907a6c339c461923ab347b2ce2f5a9f | 2,338 | cc | C++ | Sources/Scene/SceneObjectList.cc | twistedflick/Yuka | c1601a7314ccbdb1de2f4b7c69f4e2eb3f749b35 | [
"Apache-2.0"
] | null | null | null | Sources/Scene/SceneObjectList.cc | twistedflick/Yuka | c1601a7314ccbdb1de2f4b7c69f4e2eb3f749b35 | [
"Apache-2.0"
] | null | null | null | Sources/Scene/SceneObjectList.cc | twistedflick/Yuka | c1601a7314ccbdb1de2f4b7c69f4e2eb3f749b35 | [
"Apache-2.0"
] | null | null | null | /* Copyright 2018 Mo McRoberts.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include "p_YukaScene.hh"
/* Implements the private SceneObject::List class */
SceneObject::List::List() :
Object(),
first(NULL),
last(NULL)
{
}
SceneObject::List::~List()
{
List::Entry *e, *next;
for(e = first; e; e = next)
{
next = e->next;
e->obj->release();
delete e;
}
}
bool
SceneObject::List::push(SceneObject *object)
{
List::Entry *e;
e = new List::Entry();
e->next = NULL;
e->prev = last;
object->retain();
e->obj = object;
if(first)
{
last->next = e;
}
else
{
first = e;
}
last = e;
return true;
}
bool
SceneObject::List::has(const SceneObject *object) const
{
List::Entry *p;
for(p = first; p; p = p->next)
{
if(p->obj == object)
{
return true;
}
}
return false;
}
bool
SceneObject::List::remove(const SceneObject *object)
{
List::Entry *p;
for(p = first; p; p = p->next)
{
if(p->obj == object)
{
p->obj->release();
if(first == p)
{
first = first->next;
}
if(last == p)
{
last = last->prev;
}
if(p->prev)
{
p->prev->next = p->next;
}
if(p->next)
{
p->next->prev = p->prev;
}
delete p;
return true;
}
}
return false;
}
SceneObject *
SceneObject::List::pop(void)
{
List::Entry *e;
SceneObject *obj;
if(!last)
{
return NULL;
}
e = last;
last = last->prev;
if(!last)
{
first = NULL;
}
obj = e->obj;
delete(e);
/* obj is still retained - it's the caller's responsibility to release it */
return obj;
}
int
SceneObject::List::next(SceneObject::List::Iterator *i, SceneObject **object)
{
*object = NULL;
if(*i)
{
*i = (*i)->next;
}
else
{
*i = first;
}
if(*i)
{
*object = (*i)->obj;
return 1;
}
return 0;
}
| 15.181818 | 77 | 0.605646 | twistedflick |
b56778cb86c74d4c29625c7f25b7cf46e4fda0ba | 9,917 | hpp | C++ | common/iica_io.hpp | alexwang815/RL78 | d1b402d842f4fa7a36a655db9b680a98fe8c4965 | [
"BSD-3-Clause"
] | 23 | 2016-09-12T05:43:27.000Z | 2022-03-16T03:41:23.000Z | common/iica_io.hpp | alexwang815/RL78 | d1b402d842f4fa7a36a655db9b680a98fe8c4965 | [
"BSD-3-Clause"
] | 2 | 2021-11-26T22:21:06.000Z | 2021-11-28T01:27:29.000Z | common/iica_io.hpp | alexwang815/RL78 | d1b402d842f4fa7a36a655db9b680a98fe8c4965 | [
"BSD-3-Clause"
] | 8 | 2016-09-12T05:43:48.000Z | 2022-02-25T14:51:15.000Z | #pragma once
//=====================================================================//
/*! @file
@brief RL78/ (G13/L1C) グループ IICA 制御 @n
※マスター動作のみ実装 @n
※割り込みに対応していない、ポーリングのみ動作可能
@author 平松邦仁 (hira@rvf-rc45.net)
@copyright Copyright (C) 2016, 2017 Kunihito Hiramatsu @n
Released under the MIT license @n
https://github.com/hirakuni45/RL78/blob/master/LICENSE
*/
//=====================================================================//
#include "common/renesas.hpp"
/// F_CLK はボーレートパラメーター計算で必要、設定が無いとエラーにします。
#ifndef F_CLK
# error "iica_io.hpp requires F_CLK to be defined"
#endif
namespace device {
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
/*!
@brief IICA 制御クラス
@param[in] IICA IICA クラス
*/
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
template <class IICA>
class iica_io {
public:
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
/*!
@brief I2C の速度タイプ
*/
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
enum class speed : uint8_t {
standard, ///< 100K b.p.s. (Standard mode)
fast, ///< 400K b.p.s. (Fast mode)
fast_plus, ///< 1M b.p.s. (Fast plus mode)
};
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
/*!
@brief I2C エラー・タイプ
*/
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
enum class error : uint8_t {
none, ///< エラー無し
start, ///< スタート（初期化）
bus_open, ///< バス・オープン
address, ///< アドレス転送
send_data, ///< 送信データ転送
recv_data, ///< 受信データ転送
stop, ///< ストップ・コンディション
};
private:
static volatile uint8_t sync_;
uint8_t intr_lvl_;
uint8_t sadr_;
uint8_t speed_;
error error_;
inline void sleep_() {
asm("nop");
}
bool sync_intr_(uint8_t loop)
{
// 最終クロック検出割り込み
while(intr::get_request(IICA::get_peripheral()) == 0) {
utils::delay::micro_second(1);
if(loop == 0) return false;
--loop;
}
intr::set_request(IICA::get_peripheral(), 0);
return true;
}
// 「アクノリッジ」を検出したら「true」
// 予定サイクル以内に検出しなかったら「false」
bool probe_ack_()
{
sync_intr_(speed_);
if(IICA::IICS.ACKD() == 0) { // アクノリッジ確認
return false;
}
return true;
}
// アドレスの転送
bool send_adr_(uint8_t adr) {
// バスが開放されているか確認（通信状態ならエラー）
if(IICA::IICS.SPD() != 0 && IICA::IICF.IICBSY() == 0) ;
else {
error_ = error::bus_open;
return false;
}
IICA::IICCTL0.STT = 1; // スタート・コンディション（開始）
utils::delay::micro_second(1);
IICA::IICA = adr; // アドレス
if(!probe_ack_()) { // アクノリッジの確認
error_ = error::address;
return false;
}
return true;
}
bool out_stop_() {
IICA::IICCTL0.SPT = 1; // ストップ・コンディション
bool f = sync_intr_(speed_ / 2);
if(!f) {
error_ = error::stop;
}
return f;
}
public:
//-----------------------------------------------------------------//
/*!
@brief 割り込みタスク
*/
//-----------------------------------------------------------------//
static void task() __attribute__ ((section (".lowtext")))
{
++sync_;
}
//-----------------------------------------------------------------//
/*!
@brief コンストラクター
@param[in] sadr スレーブ・アドレス
*/
//-----------------------------------------------------------------//
iica_io(uint8_t sadr = 0x00) : intr_lvl_(0), sadr_(sadr), speed_(0), error_(error::none) { }
//-----------------------------------------------------------------//
/*!
@brief 動作開始
@param[in] spd_type 速度タイプ（メインクロックが 32MHz）
@param[in] intr_lvl 割り込みレベル（１、２）０の場合ポーリング
@return 速度範囲エラーの場合「false」
*/
//-----------------------------------------------------------------//
bool start(speed spd_type, uint8_t intr_lvl)
{
IICA::IICCTL0.IICE = 0; // Unit Disable
intr_lvl_ = intr_lvl;
error_ = error::none;
// ハードウェアーマニュアル１３．４．２により計算
// tF: 立下り時間
// tR: 立ち上がり時間
// ※ 32MHz としての計算値
uint8_t wl;
uint8_t wh;
uint8_t smc = 0x00;
switch(spd_type) {
// 100K b.p.s. 時 tF: 0.5us、tR: 0.5us
case speed::standard:
wl = 151;
wh = 138;
speed_ = 90 * 2; // 100K b.p.s. * 9 clock * 2 (us)
break;
// 400K b.p.s. 時 tF: 0.2us、tR: 0.2us
case speed::fast:
wl = 42;
wh = 26;
speed_ = 23 * 2; // 400K b.p.s * 9 clock * 2 (us)
// ※デジタル・フィルター有効
smc = IICA::IICCTL1.SMC.b(1) | IICA::IICCTL1.DFC.b(1);
break;
// 1M b.p.s. 時 tF: 0.1us、tR: 0.1us
case speed::fast_plus:
wl = 16;
wh = 10;
speed_ = 9 * 3; // 1M b.p.s * 9 clock * 3 (us)
// ※デジタル・フィルター有効
smc = IICA::IICCTL1.SMC.b(1) | IICA::IICCTL1.DFC.b(1);
break;
default:
// error_ = error::start;
return false;
}
// ユニットを有効にする
manage::enable(IICA::get_peripheral());
// 転送レート設定、IICE(0) の時に設定
IICA::IICWL = wl / 2;
IICA::IICWH = wh / 2;
IICA::SVA = sadr_; // スレーブ時のアドレス設定
IICA::IICF.IICRSV = 1; // 通信予約（不許可）
// IICE(0) の時に設定
IICA::IICCTL1 = IICA::IICCTL1.PRS.b(1) | smc;
// clock 9, stop condition interrupt.
IICA::IICCTL0 = IICA::IICCTL0.WTIM.b(1) | IICA::IICCTL0.SPIE.b(1);
IICA::IICCTL0.IICE = 1; // ユニット許可
// ポート・モード設定、IICE(1) の時に設定
manage::set_iica_port(IICA::get_peripheral());
// 割り込みフラグ・クリア
intr::set_request(IICA::get_peripheral(), 0);
return out_stop_();
}
//-----------------------------------------------------------------//
/*!
@brief 最終エラーの取得
@return エラー・タイプ
*/
//-----------------------------------------------------------------//
error get_last_error() const { return error_; }
//-----------------------------------------------------------------//
/*!
@brief 送信
@param[in] adr ７ビットアドレス
@param[in] src 転送先
@param[in] len 受信バイト数
@return 送信が完了した場合「true」
*/
//-----------------------------------------------------------------//
bool send(uint8_t adr, const void* src, uint8_t len)
{
error_ = error::none;
if(!send_adr_(adr << 1)) {
IICA::IICCTL0.WREL = 1;
IICA::IICCTL0.SPT = 1;
return false;
}
// 送信データ転送
const uint8_t* p = static_cast<const uint8_t*>(src);
for(uint8_t i = 0; i < len; ++i) {
IICA::IICA = *p;
++p;
if(!probe_ack_()) {
IICA::IICCTL0.SPT = 1;
error_ = error::send_data;
return false;
}
}
return out_stop_();
}
//-----------------------------------------------------------------//
/*!
@brief 送信
@param[in] adr ７ビットアドレス
@param[in] first 第一データ
@param[in] src 転送先
@param[in] len 受信バイト数
@return 送信が完了した場合「true」
*/
//-----------------------------------------------------------------//
bool send(uint8_t adr, uint8_t first, const void* src, uint8_t len)
{
error_ = error::none;
if(!send_adr_(adr << 1)) {
IICA::IICCTL0.WREL = 1;
IICA::IICCTL0.SPT = 1;
return false;
}
IICA::IICA = first;
if(!probe_ack_()) {
IICA::IICCTL0.SPT = 1;
error_ = error::send_data;
return false;
}
// 送信データ転送
const uint8_t* p = static_cast<const uint8_t*>(src);
for(uint8_t i = 0; i < len; ++i) {
IICA::IICA = *p;
++p;
if(!probe_ack_()) {
IICA::IICCTL0.SPT = 1;
error_ = error::send_data;
return false;
}
}
return out_stop_();
}
//-----------------------------------------------------------------//
/*!
@brief 送信
@param[in] adr ７ビットアドレス
@param[in] first 第一データ
@param[in] second 第二データ
@param[in] src 転送先
@param[in] len 受信バイト数
@return 送信が完了した場合「true」
*/
//-----------------------------------------------------------------//
bool send(uint8_t adr, uint8_t first, uint8_t second, const void* src, uint8_t len)
{
error_ = error::none;
if(!send_adr_(adr << 1)) {
IICA::IICCTL0.WREL = 1;
IICA::IICCTL0.SPT = 1;
return false;
}
IICA::IICA = first;
if(!probe_ack_()) {
IICA::IICCTL0.SPT = 1;
error_ = error::send_data;
return false;
}
IICA::IICA = second;
if(!probe_ack_()) {
IICA::IICCTL0.SPT = 1;
error_ = error::send_data;
return false;
}
// 送信データ転送
const uint8_t* p = static_cast<const uint8_t*>(src);
for(uint8_t i = 0; i < len; ++i) {
IICA::IICA = *p;
++p;
if(!probe_ack_()) {
IICA::IICCTL0.SPT = 1;
error_ = error::send_data;
return false;
}
}
return out_stop_();
}
//-----------------------------------------------------------------//
/*!
@brief 受信
@param[in] adr ７ビットアドレス
@param[out] dst 転送先
@param[in] len 受信バイト数
@return 受信が完了した場合「true」
*/
//-----------------------------------------------------------------//
bool recv(uint8_t adr, void* dst, uint8_t len)
{
error_ = error::none;
if(!send_adr_((adr << 1) | 1)) {
IICA::IICCTL0.WREL = 1;
IICA::IICCTL0.SPT = 1;
// utils::format("recv address\n");
return false;
}
if(len > 1) {
IICA::IICCTL0.ACKE = 1; // ACK 自動生成
}
IICA::IICCTL0.WREL = 1; // Wait 削除
// 受信データ転送
uint8_t* p = static_cast<uint8_t*>(dst);
for(uint8_t i = 0; i < len; ++i) {
if(i == (len - 1)) { // last data..
IICA::IICCTL0.ACKE = 0;
}
if(!sync_intr_(speed_)) {
error_ = error::recv_data;
IICA::IICCTL0.WREL = 1;
IICA::IICCTL0.SPT = 1;
// utils::format("idx: %d\n") % static_cast<uint32_t>(i);
return false;
}
*p = IICA::IICA();
++p;
if(i != (len - 1)) {
IICA::IICCTL0.WREL = 1; // Wait 削除
}
}
return out_stop_();
}
};
template <class IICA> volatile uint8_t iica_io<IICA>::sync_ = 0;
}
| 23.896386 | 95 | 0.447817 | alexwang815 |
b568304f3b216cace8b6ee4133f136082aeef78f | 1,738 | cpp | C++ | src/Utils/AudioAsset.cpp | Harsh14901/COP290-Pacman | e9f821f0351a0ead5ed89becab81a3c8c0a7c18e | [
"BSD-3-Clause"
] | null | null | null | src/Utils/AudioAsset.cpp | Harsh14901/COP290-Pacman | e9f821f0351a0ead5ed89becab81a3c8c0a7c18e | [
"BSD-3-Clause"
] | null | null | null | src/Utils/AudioAsset.cpp | Harsh14901/COP290-Pacman | e9f821f0351a0ead5ed89becab81a3c8c0a7c18e | [
"BSD-3-Clause"
] | null | null | null | #include "Utils/AudioAsset.hpp"
AudioAsset::AudioAsset() {}
AudioAsset::AudioAsset(string sound, bool isMusic) : AudioAsset() {
init(sound, isMusic);
}
void AudioAsset::init(string sound, bool isMusic) {
sound_name = sound;
is_music = isMusic;
if (is_music) {
cout << "Is it music " << endl;
music = Mix_LoadMUS(&sound[0]);
is_loop = true;
} else {
soundEffect = Mix_LoadWAV(sound.c_str());
cout << "loading sound asset " << sound.c_str() << endl;
if (soundEffect == nullptr) {
cerr << "Invalid Filename: " << sound << endl;
}
// cout << "File Loaded Success" << endl;
}
applySettings();
}
void AudioAsset::applySettings() {
// Mix_Volume(-1,0);
if (soundEffect != NULL) {
if (!PreferenceManager::SFX_ON)
Mix_VolumeChunk(soundEffect, 0);
else
Mix_VolumeChunk(soundEffect, MIX_MAX_VOLUME);
}
if (music != NULL) {
if (!PreferenceManager::MUSIC_ON)
Mix_VolumeMusic(0);
else
Mix_VolumeMusic(MIX_MAX_VOLUME);
}
}
void AudioAsset::play() {
// if(is_playing){
// // TODO: Decide If error should be thrown or music should be played
// again or ignored or queued
// // stop();
// // play();
// return;
// }
// cout << "Should be playing chunk " << sound_name << endl;
// int loops = is_loop ? -1 : 0;
is_playing = true;
if (is_music) {
// cout << "Music Should be playing" << endl;
Mix_PlayMusic(music, -1);
} else {
// cout << "Should Play Now" << endl;
Mix_PlayChannel(-1, soundEffect, 0);
}
}
void AudioAsset::pause() {
if (Mix_PausedMusic() != 1) {
// Resume the music
Mix_ResumeMusic();
}
is_playing = false;
}
void AudioAsset::stop() { Mix_HaltMusic(); }
| 24.138889 | 76 | 0.602992 | Harsh14901 |
b56b090e0d3f5f7b2664b1b0fe5a857cedc08561 | 2,568 | cpp | C++ | pixie/Sound/SoundPlayer.cpp | martonantoni/pixie | ab750d25d12f8420e68e1cb393a75b1f0a0c1056 | [
"MIT"
] | null | null | null | pixie/Sound/SoundPlayer.cpp | martonantoni/pixie | ab750d25d12f8420e68e1cb393a75b1f0a0c1056 | [
"MIT"
] | null | null | null | pixie/Sound/SoundPlayer.cpp | martonantoni/pixie | ab750d25d12f8420e68e1cb393a75b1f0a0c1056 | [
"MIT"
] | null | null | null | #include "StdAfx.h"
#include "RiffFile.hpp"
cSoundPlayer theSoundPlayer;
void cSoundPlayer::Initialize()
{
mEffectDestroyerThread = theThreadServer->GetThread("effect_destroyer"s);
mListeningIDs.emplace_back(mEffectDestroyerThread->AddEventHandler(
[this]()
{
{
cMutexGuard guard(mDoneEffectMutex);
std::swap(mDoneEffectsReading, mDoneEffectsReading);
}
for (auto doneEffect : mDoneEffectsReading)
{
delete doneEffect;
}
mDoneEffectsReading.clear();
}, &mGotEffectToDestroy));
HRESULT hr;
if (FAILED(hr = XAudio2Create(&mXAudio2, 0, XAUDIO2_DEFAULT_PROCESSOR)))
{
RELEASE_ASSERT_EXT(false, "XAudio2Create failed");
}
if (FAILED(hr =mXAudio2->CreateMasteringVoice(&mMasterVoice)))
{
RELEASE_ASSERT_EXT(false, "CreateMasteringVoice failed");
}
}
void cSoundPlayer::Play(const char* filename)
{
cRiffFile file(filename);
RELEASE_ASSERT(file);
auto wfxChunkData = file.ReadChunkData('fmt ');
auto dataChunkData = file.ReadChunkData('data');
if (!wfxChunkData.empty() && !dataChunkData.empty())
{
XAUDIO2_BUFFER buffer = { 0 };
buffer.AudioBytes = dataChunkData.size(); //buffer containing audio data
buffer.pAudioData = (const BYTE*)dataChunkData.data(); //size of the audio buffer in bytes
buffer.Flags = XAUDIO2_END_OF_STREAM; // tell the source voice not to expect any data after this buffer
auto activeEffect = std::make_unique<cActiveEffect>(*this);
IXAudio2SourceVoice* pSourceVoice;
if (FAILED(mXAudio2->CreateSourceVoice(&pSourceVoice, (WAVEFORMATEX*)wfxChunkData.data(), 0, XAUDIO2_DEFAULT_FREQ_RATIO, activeEffect.get())))
return;
if (FAILED(pSourceVoice->SubmitSourceBuffer(&buffer)))
return;
if (FAILED(pSourceVoice->Start(0)))
return;
activeEffect->Init(pSourceVoice, std::move(dataChunkData));
activeEffect.release();
}
}
void cSoundPlayer::effectPlayDone(cActiveEffect* effect)
{
{
cMutexGuard guard(mDoneEffectMutex);
mDoneEffectsWriting.emplace_back(effect);
}
mGotEffectToDestroy.Set();
}
void cSoundPlayer::cActiveEffect::OnStreamEnd()
{
mParent.effectPlayDone(this);
}
cSoundPlayer::cActiveEffect::cActiveEffect(cSoundPlayer& parent)
: mParent(parent)
{
}
cSoundPlayer::cActiveEffect::~cActiveEffect()
{
mSourceVoice->DestroyVoice();
}
| 28.533333 | 150 | 0.659657 | martonantoni |
b56b0ac175fabc6a41e8cca02231d9e82c9bb1e8 | 1,822 | cpp | C++ | cpp/socket/socket.cpp | ounana/hoke | 9337d6a98192f681efd6113e4c951cb8ecae59af | [
"Apache-2.0"
] | null | null | null | cpp/socket/socket.cpp | ounana/hoke | 9337d6a98192f681efd6113e4c951cb8ecae59af | [
"Apache-2.0"
] | null | null | null | cpp/socket/socket.cpp | ounana/hoke | 9337d6a98192f681efd6113e4c951cb8ecae59af | [
"Apache-2.0"
] | null | null | null | #include <stdio.h>
#include <iostream>
#include <cstring>
#include <fstream>
#include <winsock2.h>
#pragma comment(lib, "ws2_32.lib")
using namespace std;
SOCKET m_Client;
void SendFile();
int main(int argc, char *argv[])
{
//初始化WSA
WORD sockVersion = MAKEWORD(2, 2);
WSADATA wsaData;
if (WSAStartup(sockVersion, &wsaData) != 0)
{
return 0;
}
//创建套接字
SOCKET slisten = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (slisten == INVALID_SOCKET)
{
printf("socket error !");
return 0;
}
//绑定IP和端口
sockaddr_in sin;
sin.sin_family = AF_INET;
sin.sin_port = htons(8888);
sin.sin_addr.S_un.S_addr = INADDR_ANY;
if (bind(slisten, (LPSOCKADDR)&sin, sizeof(sin)) == SOCKET_ERROR)
{
printf("bind error !");
}
//开始监听
if (listen(slisten, 5) == SOCKET_ERROR)
{
printf("listen error !");
return 0;
}
//循环接收数据
sockaddr_in remoteAddr;
int nAddrlen = sizeof(remoteAddr);
char revData[255];
while (true)
{
printf("等待连接...\n");
m_Client = accept(slisten, (SOCKADDR *)&remoteAddr, &nAddrlen);
if (m_Client == INVALID_SOCKET)
{
printf("accept error !");
continue;
}
printf("接受到一个连接：%s \r\n", inet_ntoa(remoteAddr.sin_addr));
SendFile();
closesocket(m_Client);
}
closesocket(slisten);
WSACleanup();
return 0;
}
void SendFile()
{
int haveSend = 0;
const int bufferSize = 1024;
char buffer[bufferSize] = {0};
int readLen = 0;
string srcFileName = "in";
ifstream srcFile;
srcFile.open(srcFileName.c_str(), ios::binary);
if (!srcFile)
{
return;
}
while (!srcFile.eof())
{
srcFile.read(buffer, bufferSize);
readLen = srcFile.gcount();
send(m_Client, buffer, readLen, 0);
haveSend += readLen;
}
srcFile.close();
cout << "send: " << haveSend << "B" << endl;
} | 19.178947 | 67 | 0.627333 | ounana |
b56c840fd3e177afd90baa1c52d81a8971f94147 | 3,748 | cpp | C++ | Code/Avernakis Nodejs/Avernakis-Nodejs/Private/UiTextBox.cpp | qber-soft/Ave-Nodejs | 80b843d22b0e0620b6a5af329a851ce9921d8d85 | [
"MIT"
] | 39 | 2022-03-25T17:21:17.000Z | 2022-03-31T18:24:12.000Z | Code/Avernakis Nodejs/Avernakis-Nodejs/Private/UiTextBox.cpp | qber-soft/Ave-Nodejs | 80b843d22b0e0620b6a5af329a851ce9921d8d85 | [
"MIT"
] | 1 | 2022-03-20T00:35:07.000Z | 2022-03-20T01:06:20.000Z | Code/Avernakis Nodejs/Avernakis-Nodejs/Private/UiTextBox.cpp | qber-soft/Ave-Nodejs | 80b843d22b0e0620b6a5af329a851ce9921d8d85 | [
"MIT"
] | 3 | 2022-03-26T01:08:06.000Z | 2022-03-27T23:12:40.000Z | #include "StdAfx.h"
#include "UiTextBox.h"
#define ThisMethod($x) &UiTextBox::$x
#define AutoAddMethod($x, ...) AddMethod<__VA_ARGS__>( #$x, ThisMethod( $x ) )
#define MakeThisFunc($x) MakeFunc( this, &UiTextBox::$x )
namespace Nav
{
namespace
{
ObjectRegister<UiTextBox> c_obj;
}
void UiTextBox::DefineControl()
{
AutoAddMethod( SetText );
AutoAddMethod( GetText, WrapObjectGeneric );
AutoAddMethod( SetCue );
AutoAddMethod( GetCue, WrapObjectGeneric );
AutoAddMethod( SetLimit );
AutoAddMethod( GetLimit, WrapObjectGeneric );
AutoAddMethod( SetLimitMode );
AutoAddMethod( GetLimitMode, WrapObjectGeneric );
AutoAddMethod( SetNumeric );
AutoAddMethod( GetNumeric, WrapObjectGeneric );
AutoAddMethod( SetRange );
AutoAddMethod( GetRange, WrapObjectGeneric );
AutoAddMethod( SetStep );
AutoAddMethod( GetStep, WrapObjectGeneric );
AutoAddMethod( SetDefault );
AutoAddMethod( GetDefault, WrapObjectGeneric );
AutoAddMethod( SetValue );
AutoAddMethod( GetValue, WrapObjectGeneric );
AutoAddMethod( SetInvalid );
AutoAddMethod( GetInvalid, WrapObjectGeneric );
AutoAddMethod( SetValid );
AutoAddMethod( GetValid, WrapObjectGeneric );
AutoAddMethod( SetReadOnly );
AutoAddMethod( GetReadOnly, WrapObjectGeneric );
AutoAddMethod( SetPassword );
AutoAddMethod( GetPassword, WrapObjectGeneric );
AutoAddMethod( SetIme );
AutoAddMethod( GetIme, WrapObjectGeneric );
AutoAddMethod( SetRememberCaret );
AutoAddMethod( GetRememberCaret, WrapObjectGeneric );
AutoAddMethod( SetHideSelection );
AutoAddMethod( GetHideSelection, WrapObjectGeneric );
AutoAddMethod( SetBorder );
AutoAddMethod( GetBorder, WrapObjectGeneric );
AutoAddMethod( SetForceCue );
AutoAddMethod( GetForceCue, WrapObjectGeneric );
AutoAddMethod( SetKeyInputMode );
AutoAddMethod( GetKeyInputMode, WrapObjectGeneric );
AutoAddMethod( SetKey );
AutoAddMethod( GetKey, WrapObjectGeneric );
AutoAddMethod( SelectionSet );
AutoAddMethod( SelectionGet, WrapObjectGeneric );
AutoAddMethod( SelectionGetText, WrapObjectGeneric );
AutoAddMethod( SelectionReplace );
AutoAddMethod( GetCaretPos, WrapObjectGeneric );
AutoAddMethod( OnChange, WrapObjectGeneric );
AutoAddMethod( OnSpinStart, WrapObjectGeneric );
AutoAddMethod( OnSpinEnd, WrapObjectGeneric );
AutoAddMethod( OnSpin, WrapObjectGeneric );
}
U1 UiTextBox::Ctor( UiWindow * p, Napi::Value v )
{
if ( !__CreateControl( p, v ) )
return false;
return true;
}
void UiTextBox::__OnChange( Ui::ITextBox & sender, Ui::TextBoxChangeReason nReason )
{
m_OnChange( this, nReason );
}
void UiTextBox::__OnSpinStart( Ui::ITextBox & sender )
{
m_OnSpinStart( this );
}
void UiTextBox::__OnSpinEnd( Ui::ITextBox & sender, U1 bCanceled )
{
m_OnSpinEnd( this, bCanceled );
}
void UiTextBox::__OnSpin( Ui::ITextBox & sender )
{
m_OnSpin( this );
}
UiTextBox* UiTextBox::OnChange /**/( OnChange_t /**/ && fn ) { m_OnChange /**/ = SetEventCallback<Ui::ITextBox::OnChange /**/>( std::move( fn ), MakeThisFunc( __OnChange /**/ ) ); return this; }
UiTextBox* UiTextBox::OnSpinStart /**/( OnGeneric_t /**/ && fn ) { m_OnSpinStart /**/ = SetEventCallback<Ui::ITextBox::OnSpinStart /**/>( std::move( fn ), MakeThisFunc( __OnSpinStart /**/ ) ); return this; }
UiTextBox* UiTextBox::OnSpinEnd /**/( OnSpinEnd_t /**/ && fn ) { m_OnSpinEnd /**/ = SetEventCallback<Ui::ITextBox::OnSpinEnd /**/>( std::move( fn ), MakeThisFunc( __OnSpinEnd /**/ ) ); return this; }
UiTextBox* UiTextBox::OnSpin /**/( OnGeneric_t /**/ && fn ) { m_OnSpin /**/ = SetEventCallback<Ui::ITextBox::OnSpin /**/>( std::move( fn ), MakeThisFunc( __OnSpin /**/ ) ); return this; }
}
| 30.225806 | 208 | 0.709979 | qber-soft |
b571464423c5f3e4ac67e95c46c24d6794b895e4 | 772 | hpp | C++ | libs/core/include/fcppt/metal/sequence_to_string.hpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | libs/core/include/fcppt/metal/sequence_to_string.hpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | libs/core/include/fcppt/metal/sequence_to_string.hpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | // Copyright Carl Philipp Reh 2009 - 2018.
// 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 FCPPT_METAL_SEQUENCE_TO_STRING_HPP_INCLUDED
#define FCPPT_METAL_SEQUENCE_TO_STRING_HPP_INCLUDED
#include <fcppt/string.hpp>
#include <fcppt/metal/print.hpp>
#include <fcppt/io/ostringstream.hpp>
namespace fcppt
{
namespace metal
{
/**
\brief Converts a sequence to a string.
\ingroup fcpptmetal
\tparam Sequence Must be a metal sequence.
*/
template<
typename Sequence
>
fcppt::string
sequence_to_string()
{
fcppt::io::ostringstream stream{};
fcppt::metal::print<
Sequence
>(
stream
);
return
stream.str();
}
}
}
#endif
| 15.755102 | 61 | 0.726684 | pmiddend |
b57f0e7131e6b56b5d8fef7e74ad2c31dd0130d3 | 84 | cpp | C++ | Sharpmake.FunctionalTests/NoAllFastBuildProjectFunctionalTest/codebase/LibC/LibC.cpp | mihailogazda/Sharpmake | a2e58cd151c74eac010738c63ba0f6eff4465d70 | [
"Apache-2.0"
] | 563 | 2017-09-23T15:30:50.000Z | 2020-05-26T15:04:07.000Z | Sharpmake.FunctionalTests/NoAllFastBuildProjectFunctionalTest/codebase/LibC/LibC.cpp | mihailogazda/Sharpmake | a2e58cd151c74eac010738c63ba0f6eff4465d70 | [
"Apache-2.0"
] | 76 | 2020-06-20T20:50:56.000Z | 2022-03-26T08:10:14.000Z | Sharpmake.FunctionalTests/NoAllFastBuildProjectFunctionalTest/codebase/LibC/LibC.cpp | panbolo/Sharpmake | 2f3369b729abb96d473426918803dd84690631ad | [
"Apache-2.0"
] | 104 | 2017-09-23T15:35:17.000Z | 2020-06-09T23:15:28.000Z | #include "LibC.h"
#include "LibA.h"
void fcnC(int value)
{
fcnA(value + 3);
}
| 9.333333 | 20 | 0.595238 | mihailogazda |
b584a5cb2ad569b58a9c9c50def34e121646d1d7 | 494 | cpp | C++ | other/expo.cpp | ishan-modi/Static-Dynamic-Algorithms | 6ac6513a808854438fa14a9b904428e92e9b1c1c | [
"MIT"
] | 2 | 2020-02-17T14:32:48.000Z | 2020-05-27T08:26:55.000Z | other/expo.cpp | ishan-modi/Static-Dynamic-Algorithms | 6ac6513a808854438fa14a9b904428e92e9b1c1c | [
"MIT"
] | null | null | null | other/expo.cpp | ishan-modi/Static-Dynamic-Algorithms | 6ac6513a808854438fa14a9b904428e92e9b1c1c | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
int Nexpo(int x,int n);
int Dexpo(int x,int n);
int main()
{
int x,n,ans;
cout<<"Enter base number and power :"<<endl;
cin>>x>>n;
ans=Nexpo(x,n);
cout<<"Ans "<<ans<<endl;
ans=Dexpo(x,n);
cout<<"Ans "<<ans<<endl;
}
int Nexpo(int x,int n)
{
int i=n,r=1;
while(i>0)
{
if(i%2!=0)
r=r*x;
x=x*x;
i=i/2;
}
return r;
}
int Dexpo(int x,int n)
{
if(n==0)
return 1;
int r=Dexpo(x,(n/2));
if((n%2)==0)
return r*r;
else
return x*r*r;
}
| 11.488372 | 45 | 0.564777 | ishan-modi |
b5899e39d64d34a3a1d149f8676178e95c568109 | 3,115 | cpp | C++ | modules/recognition/src/ghv_opt.cpp | ToMadoRe/v4r | 7cb817e05cb9d99cb2f68db009c27d7144d07f09 | [
"MIT"
] | 17 | 2015-11-16T14:21:10.000Z | 2020-11-09T02:57:33.000Z | modules/recognition/src/ghv_opt.cpp | ToMadoRe/v4r | 7cb817e05cb9d99cb2f68db009c27d7144d07f09 | [
"MIT"
] | 35 | 2015-07-27T15:04:43.000Z | 2019-08-22T10:52:35.000Z | modules/recognition/src/ghv_opt.cpp | ToMadoRe/v4r | 7cb817e05cb9d99cb2f68db009c27d7144d07f09 | [
"MIT"
] | 18 | 2015-08-06T09:26:27.000Z | 2020-09-03T01:31:00.000Z | #include <v4r/recognition/ghv_opt.h>
namespace v4r
{
//template<typename ModelT, typename SceneT>
//bool
//GHVmove_activate<ModelT, SceneT>::operator== (const mets::mana_move& m) const
//{
// try
// {
// const GHVmove_activate& mm = dynamic_cast<const GHVmove_activate&> (m);
// return mm.index_ == index_;
// }
// catch (std::bad_cast & bc)
// {
// std::cerr << "bad cast:" << bc.what() << "\n";
// return false;
// }
//}
//template<typename ModelT, typename SceneT>
//bool
//GHVmove_deactivate<ModelT, SceneT>::operator== (const mets::mana_move& m) const
//{
// try
// {
// const GHVmove_deactivate& mm = dynamic_cast<const GHVmove_deactivate&> (m);
// return mm.index_ == index_;
// }
// catch(std::bad_cast & bc)
// {
// std::cerr << "bad cast:" << bc.what() << "\n";
// return false;
// }
//}
///////////////////////////////////////////////////////////////
///////////// move manager ////////////////////////////////////
///////////////////////////////////////////////////////////////
template<typename ModelT, typename SceneT>
void
GHVmove_manager<ModelT, SceneT>::refresh(mets::feasible_solution& s)
{
GHVSAModel<ModelT, SceneT>& model = dynamic_cast<GHVSAModel<ModelT, SceneT>&> (s);
boost::dynamic_bitset<> crt_solution = model.opt_->getSolution();
size_t inactive_hypotheses = crt_solution.size() - crt_solution.count();
moves_m_.clear();
if( use_replace_moves_ )
moves_m_.resize( inactive_hypotheses + crt_solution.size()*crt_solution.size() );
else
moves_m_.resize( inactive_hypotheses );
size_t kept=0;
for (size_t i = 0; i < crt_solution.size(); i++)
{
if(!crt_solution[i])
moves_m_[kept++].reset( new GHVmove<ModelT, SceneT> (i) );
// else
// moves_m_[kept++].reset( new GHVmove_deactivate<ModelT, SceneT> (i, crt_solution.size()) );
}
if(use_replace_moves_)
{
//based on s and the explained point intersection, create some replace_hyp_move
//go through s and select active hypotheses and non-active hypotheses
//check for each pair if the intersection is big enough
//if positive, create a replace_hyp_move that will deactivate the act. hyp and activate the other one
//MAYBE it would be interesting to allow this changes when the temperature is low or
//there has been some iterations without an improvement
for(size_t i=0; i < crt_solution.size(); i++)
{
for(size_t j=0; j < crt_solution.size(); j++) // i active, j inactive
{
if( crt_solution[i] && !crt_solution[j] && intersection_cost_(i, j) > std::numeric_limits<float>::epsilon() )
moves_m_[kept++].reset( new GHVreplace_hyp_move<ModelT, SceneT> (i, j, crt_solution.size()) );
}
}
}
moves_m_.resize(kept);
// std::random_shuffle (moves_m_.begin (), moves_m_.end ()); ///TODO: Is this relevant?
}
template class V4R_EXPORTS GHVmove_manager<pcl::PointXYZRGB,pcl::PointXYZRGB>;
}
| 32.789474 | 125 | 0.588443 | ToMadoRe |
b58dd461bd04929077563fba97d5947835f53ef6 | 1,467 | cpp | C++ | lib/data_structures/graph/graph.cpp | shantanuwadnerkar/programming | d9368acf03e0bd3ac4388e483d82d0f492268fe4 | [
"BSD-2-Clause"
] | 1 | 2021-01-22T19:03:39.000Z | 2021-01-22T19:03:39.000Z | lib/data_structures/graph/graph.cpp | shantanuwadnerkar/programming | d9368acf03e0bd3ac4388e483d82d0f492268fe4 | [
"BSD-2-Clause"
] | null | null | null | lib/data_structures/graph/graph.cpp | shantanuwadnerkar/programming | d9368acf03e0bd3ac4388e483d82d0f492268fe4 | [
"BSD-2-Clause"
] | null | null | null | #include "graph.h"
Graph::Graph(const std::vector<graph::Edge>& edges,
int num_nodes, bool undirected)
: adj_list_(num_nodes)
{
for (auto edge : edges)
{
adj_list_[edge.src].push_back(edge.dest);
if (undirected)
{
adj_list_[edge.dest].push_back(edge.src);
}
}
}
Graph::~Graph()
{
}
void Graph::print()
{
for (int i=0; i<adj_list_.size(); i++)
{
std::cout << "Node (value: " << i << ") -> ";
for (int j=0; j<adj_list_[i].size(); j++)
{
std::cout << adj_list_[i][j] << ' ';
}
std::cout << '\n';
}
}
WeightedGraph::WeightedGraph(const edge_t& edges, int num_nodes,
bool undirected)
: adj_list_(num_nodes)
{
for (auto edge : edges)
{
node_t node{std::make_pair(edge.dest, edge.weight)};
adj_list_[edge.src].push_back(node);
if (undirected)
{
node_t reverse_node{std::make_pair(edge.src, edge.weight)};
adj_list_[edge.dest].push_back(node);
}
}
}
WeightedGraph::~WeightedGraph()
{
}
void WeightedGraph::print()
{
for (int i=0; i<adj_list_.size(); i++)
{
std::cout << "Node (value: " << i << ") -> ";
for (int j=0; j<adj_list_[i].size(); j++)
{
std::cout << "(" << adj_list_[i][j].first << ", " << adj_list_[i][j].second << "), ";
}
std::cout << '\n';
}
}
| 21.573529 | 97 | 0.492843 | shantanuwadnerkar |
b58f37060dd63f4902c641394c895925d1b974c1 | 3,194 | hpp | C++ | src/src/XERenderer/private/DynamicLines.hpp | devxkh/FrankE | 72faca02759b54aaec842831f3c7a051e7cf5335 | [
"MIT"
] | 11 | 2017-01-17T15:02:25.000Z | 2020-11-27T16:54:42.000Z | src/src/XERenderer/private/DynamicLines.hpp | devxkh/FrankE | 72faca02759b54aaec842831f3c7a051e7cf5335 | [
"MIT"
] | 9 | 2016-10-23T20:15:38.000Z | 2018-02-06T11:23:17.000Z | src/src/XERenderer/private/DynamicLines.hpp | devxkh/FrankE | 72faca02759b54aaec842831f3c7a051e7cf5335 | [
"MIT"
] | 2 | 2019-08-29T10:23:51.000Z | 2020-04-03T06:08:34.000Z | /*
* =====================================================================================
*
* Filename: BtOgreExtras.h
*
* Description: Contains the Ogre Mesh to Bullet Shape converters.
*
* Version: 1.0
* Created: 27/12/2008 01:45:56 PM
*
* Author: Nikhilesh (nikki)
modified: Nuke
*
* =====================================================================================
*/
#ifndef __DYNAMICLINES_HPP__
#define __DYNAMICLINES_HPP__
//#include <bullet/btBulletDynamicsCommon.h>
#include <Ogre/OgreMain/include/OgreSimpleRenderable.h>
#include <Ogre/OgreMain/include/OgreCamera.h>
#include <Ogre/OgreMain/include/OgreHardwareBufferManager.h>
#include <Ogre/OgreMain/include/OgreMaterialManager.h>
#include <Ogre/OgreMain/include/OgreTechnique.h>
#include <Ogre/OgreMain/include/OgrePass.h>
#include <Ogre/OgreMain/include/OgreSceneNode.h>
#include <Ogre/OgreMain/include/OgreLogManager.h>
#include <Ogre/OgreMain/include/OgreManualObject2.h>
//#include <XERenderer/private/ManualObject.hpp>
#include <XERenderer/private/DynamicRenderable.hpp>
namespace Ogre
{
class Vector3;
}
namespace XE
{
class DynamicLines : public Ogre::ManualObject
{
//typedef Ogre::Vector3 Vector3;
typedef Ogre::Quaternion Quaternion;
typedef Ogre::Camera Camera;
typedef float Real;
typedef Ogre::OperationType OperationType;
public:
/// Constructor - see setOperationType() for description of argument.
DynamicLines( Ogre::IdType id, Ogre::ObjectMemoryManager* objManager, Ogre::SceneManager* sceneMgr, OperationType opType = Ogre::OperationType::OT_LINE_STRIP);
virtual ~DynamicLines();
/// Add a point to the point list
void addPoint(const Ogre::Vector3 &p);
/// Add a point to the point list
void addPoint(Real x, Real y, Real z);
/// Change the location of an existing point in the point list
void setPoint(unsigned short index, const Ogre::Vector3 &value);
/// Return the location of an existing point in the point list
const Ogre::Vector3& getPoint(unsigned short index) const;
/// Return the total number of points in the point list
unsigned short getNumPoints(void) const;
/// Remove all points from the point list
void clear();
/// Call this to update the hardware buffer after making changes.
void update();
/** Set the type of operation to draw with.
* @param opType Can be one of
* - RenderOperation::OT_LINE_STRIP
* - RenderOperation::OT_LINE_LIST
* - RenderOperation::OT_POINT_LIST
* - RenderOperation::OT_TRIANGLE_LIST
* - RenderOperation::OT_TRIANGLE_STRIP
* - RenderOperation::OT_TRIANGLE_FAN
* The default is OT_LINE_STRIP.
*/
void setOperationType(OperationType opType);
OperationType getOperationType() const;
std::vector<Ogre::Vector3> _t_Points;
protected:
/// Implementation DynamicRenderable, creates a simple vertex-only decl
virtual void createVertexDeclaration();
/// Implementation DynamicRenderable, pushes point list out to hardware memory
virtual void fillHardwareBuffers();
private:
Ogre::OperationType m_operationType;
bool mDirty;
};
} // namespace XE
#endif // __DYNAMICLINES_HPP__
| 28.017544 | 161 | 0.694114 | devxkh |
b58f9cafff0c31fa47bcd45cf5313979644033a0 | 3,279 | cpp | C++ | 2015/task4.cpp | chengluo331/ic_cpp | 6cc10ae57cd98241b75f99648c87d206fef354bc | [
"Apache-2.0"
] | null | null | null | 2015/task4.cpp | chengluo331/ic_cpp | 6cc10ae57cd98241b75f99648c87d206fef354bc | [
"Apache-2.0"
] | null | null | null | 2015/task4.cpp | chengluo331/ic_cpp | 6cc10ae57cd98241b75f99648c87d206fef354bc | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cmath>
using namespace std;
#define PRIME 2017
template <unsigned int p>
class primefield{
unsigned int a;
public:
primefield<p>(int n) {
a = n < 0 ? (n+p)%p : n%p;
};
primefield<p>& operator+= (const primefield<p>& q);
primefield<p> operator* (const primefield<p>& q) const;
primefield<p>& operator*= (const primefield<p>& q);
primefield<p> operator^ (unsigned int n) const; // power
primefield<p> operator/ (const primefield<p>& q) const;
primefield<p> operator+ (const primefield<p>& q) const;
primefield<p> operator- (const primefield<p>& q) const;
operator unsigned int() const;
void print(ostream& os) const;
};
template <unsigned int p>
primefield<p>& primefield<p>::operator+= (const primefield<p>& q){
a += q.a;
a %= p;
return (*this);
}
template <unsigned int p>
primefield<p> primefield<p>::operator+ (const primefield<p>& q) const{
primefield<p> r(*this);
r += q;
return r;
}
template <unsigned int p>
primefield<p> primefield<p>::operator- (const primefield<p>& q) const{
primefield<p> r(a - q.a);
return r;
}
template <unsigned int p>
primefield<p> primefield<p>::operator* (const primefield<p>& q) const {
primefield<p> r(*this);
r *= q;
return r;
}
template <unsigned int p>
primefield<p>& primefield<p>::operator*= (const primefield<p>& q) {
a *= q.a;
a %= p;
return (*this);
}
template <unsigned int p>
primefield<p> primefield<p>::operator^ (unsigned int n) const {
primefield<p> r(1);
for (size_t i = 0; i < n; i++)
{
r *= (*this);
}
return r;
}
template <unsigned int p>
primefield<p> primefield<p>::operator/ (const primefield<p>& q) const{
return (*this)*(q ^ (p - 2));
}
template <unsigned int p>
primefield<p>::operator unsigned int() const{
return static_cast<unsigned int>(a);
}
template <unsigned int p>
void primefield<p>::print(ostream& os) const{
os << a;
}
template <unsigned int p>
ostream& operator<<(ostream& os, const primefield<p> q){
q.print(os);
return os;
}
template <unsigned int p>
primefield<p> power(const primefield<p>& q, unsigned int n){
return q^n;
}
template <unsigned int p>
primefield<p> factorial(const primefield<p>& q){
if (q == 1) return primefield<p>(1);
return q*factorial(q - primefield<p>(1));
}
int main() {
//primefield<PRIME> partial_sum(0);
//for (unsigned int i = 1; i <= 50; ++i) {
// partial_sum += primefield<PRIME>(1) / primefield<PRIME>(i);
//}
//cout << "sum_i=1^50 1/i = " << partial_sum << endl;
//unsigned int aa, bb;
//cout << "a, b = "; cin >> aa >> bb;
//primefield<PRIME> a(aa), b(bb);
//cout << "a + b = " << a + b << endl;
//cout << "a - b = " << a - b << endl;
//cout << "a * b = " << a * b << endl;
//cout << "a / b = " << a / b << endl;
//cout << "a^10 = " << power(a, 10) << endl;
//cout << "a! = " << factorial(a) << endl;
cout << power(primefield<79>(53), 10) << endl;
cout << primefield<79>(3) / primefield<79>(21) + primefield<79>(5) / primefield<79>(67) << endl;
cout << primefield<79>(3) / primefield<79>(21) - primefield<79>(5) / primefield<79>(67) << endl;
cout << factorial(primefield<79>(50)) << endl;
primefield<79> partial_sum(0);
for (unsigned int i = 1; i <= 50; ++i) {
partial_sum += primefield<79>(1) / primefield<79>(i);
}
cout << partial_sum << endl;
return 0;
}
| 25.818898 | 97 | 0.626106 | chengluo331 |
b595f8f7a96a6b84ac3f4e99e09b8a3722b02346 | 209 | cpp | C++ | extras/general_pipelines/py2_10_10_10/py2_10_10_10.cpp | nvpro-samples/vk_compute_mipmaps | 613b94e4d36e6f357472e9c7a3163046deb55678 | [
"Apache-2.0"
] | 12 | 2021-07-24T18:33:22.000Z | 2022-03-12T16:20:49.000Z | extras/general_pipelines/py2_10_10_10/py2_10_10_10.cpp | nvpro-samples/vk_compute_mipmaps | 613b94e4d36e6f357472e9c7a3163046deb55678 | [
"Apache-2.0"
] | null | null | null | extras/general_pipelines/py2_10_10_10/py2_10_10_10.cpp | nvpro-samples/vk_compute_mipmaps | 613b94e4d36e6f357472e9c7a3163046deb55678 | [
"Apache-2.0"
] | 3 | 2021-08-04T02:27:12.000Z | 2022-03-13T08:43:24.000Z | #include "nvpro_pyramid_dispatch_alternative.hpp"
#include "../py2_dispatch_impl.hpp"
NVPRO_PYRAMID_ADD_GENERAL_DISPATCHER(py2_10_10_10,
(py2_dispatch_impl<10, 10, 10>))
| 29.857143 | 69 | 0.679426 | nvpro-samples |
b59891d8490af7c5bae5516d5442206aac5cf7b0 | 1,395 | hpp | C++ | include/formatters/gherkinCpp/element.hpp | JoeLoser/GUnit | 5ccb6c05eba86c0286368b6f5818df33af3a05ad | [
"BSL-1.0"
] | 189 | 2017-01-06T19:50:24.000Z | 2022-03-29T06:19:02.000Z | include/formatters/gherkinCpp/element.hpp | JoeLoser/GUnit | 5ccb6c05eba86c0286368b6f5818df33af3a05ad | [
"BSL-1.0"
] | 46 | 2017-04-23T17:17:44.000Z | 2022-03-18T10:18:30.000Z | include/formatters/gherkinCpp/element.hpp | JoeLoser/GUnit | 5ccb6c05eba86c0286368b6f5818df33af3a05ad | [
"BSL-1.0"
] | 46 | 2017-01-02T12:02:45.000Z | 2022-02-27T10:03:14.000Z | /*
* element.hpp
*
* Created on: Feb 17, 2020
* Author: rbauer
*/
#ifndef TESTS_GUNIT_LIBS_GHERKIN_CPP_INCLUDE_ELEMENT_HPP_
#define TESTS_GUNIT_LIBS_GHERKIN_CPP_INCLUDE_ELEMENT_HPP_
#include <unordered_map>
#include "step.hpp"
#include "genericinfo.hpp"
#include "tag.hpp"
namespace GherkinCpp {
class Element : public GenericInfo {
public:
Element() = delete;
Element(std::string type_, std::string keyword_, std::string name_, int line_) : GenericInfo(keyword_, name_, line_), type(type_) {};
virtual ~Element() = default;
void addStep(std::shared_ptr<Step> step) {
if(step == nullptr) return;
int stepMapKey = step->line;
if(steps.find(stepMapKey) != steps.end()) {
std::cout << "Scenario " << name << ": Step " << step->name << " in line " << step->line << " already exist." << std::endl;
return;
}
steps[stepMapKey] = std::move(step);
}
std::map<int, std::shared_ptr<Step>> getSteps() {
return steps;
}
std::shared_ptr<Step> getSpecificStep(int lineNum) {
std::map<int, std::shared_ptr<Step>>::iterator it = steps.find(lineNum);
std::shared_ptr<Step> retval{};
if(it != steps.end()) {
retval = it->second;
}
return retval;
}
public:
const std::string type;
private:
std::map<int, std::shared_ptr<Step>> steps;
std::string description{};
};
} // GherkinCpp
#endif /* TESTS_GUNIT_LIBS_GHERKIN_CPP_INCLUDE_ELEMENT_HPP_ */
| 22.142857 | 134 | 0.678853 | JoeLoser |
b598937246f8d6b9055d0b3b5997e54e4614135a | 4,436 | hpp | C++ | Source/AliveLibAO/BirdPortal.hpp | Leonard2/alive_reversing | c6d85f435e275db1d41e2ec8b4e52454aa932e05 | [
"MIT"
] | null | null | null | Source/AliveLibAO/BirdPortal.hpp | Leonard2/alive_reversing | c6d85f435e275db1d41e2ec8b4e52454aa932e05 | [
"MIT"
] | null | null | null | Source/AliveLibAO/BirdPortal.hpp | Leonard2/alive_reversing | c6d85f435e275db1d41e2ec8b4e52454aa932e05 | [
"MIT"
] | null | null | null | #pragma once
#include "FunctionFwd.hpp"
#include "BaseAnimatedWithPhysicsGameObject.hpp"
#include "Map.hpp"
#include "DynamicArray.hpp"
namespace AO {
enum class LevelIds : s16;
enum class PortalType : s16
{
eAbe_0 = 0,
eWorker_1 = 1,
eShrykull_2 = 2,
eMudTeleport_3 = 3,
};
enum class PortalSide : s16
{
eRight_0 = 0,
eLeft_1 = 1,
};
struct Path_BirdPortal final : public Path_TLV
{
PortalSide field_18_side;
LevelIds field_1A_dest_level;
s16 field_1C_dest_path;
s16 field_1E_dest_camera;
s16 field_20_scale;
s16 field_22_movie_id;
PortalType field_24_portal_type;
s16 field_26_num_muds_for_shrykul;
};
ALIVE_ASSERT_SIZEOF(Path_BirdPortal, 0x28);
struct Path_BirdPortalExit final : public Path_TLV
{
PortalSide field_18_side;
s16 field_1A_scale;
};
ALIVE_ASSERT_SIZEOF(Path_BirdPortalExit, 0x1C);
class BirdPortalTerminator final : public BaseAnimatedWithPhysicsGameObject
{
public:
EXPORT BirdPortalTerminator* ctor_451F70(FP xpos, FP ypos, FP scale, PortalType portalType);
virtual void VScreenChanged() override;
virtual BaseGameObject* VDestructor(s32 flags) override;
s32 field_D4_padding[4];
};
ALIVE_ASSERT_SIZEOF(BirdPortalTerminator, 0xE4);
class OrbWhirlWind;
class ThrowableTotalIndicator;
class ScreenClipper;
class Dove;
class BirdPortal final : public BaseGameObject
{
public:
EXPORT BirdPortal* ctor_4520A0(Path_BirdPortal* pTlv, s32 tlvInfo);
EXPORT BaseGameObject* dtor_452230();
EXPORT s16 IsScaredAway_4532E0();
virtual BaseGameObject* VDestructor(s32 flags) override;
virtual void VUpdate() override;
virtual void VScreenChanged() override;
virtual void VStopAudio() override;
virtual s16 VPortalClipper(s16 bUnknown);
virtual void VKillPortalClipper();
virtual void VMudSaved();
virtual BOOL VStateIs6();
virtual void VGiveShrukull(s16 bPlaySound);
virtual BOOL VStateIs16();
virtual void VExitPortal();
virtual void VIncreaseTimerAndKillPortalClipper();
virtual BOOL VStateIs20();
virtual void VGetMapChange(LevelIds* level, u16* path, u16* camera, CameraSwapEffects* screenChangeEffect, u16* movieId);
private:
EXPORT s16 VPortalClipper_4533E0(s16 bUnknown);
EXPORT void VMudSaved_453830();
EXPORT void VGetMapChange_453840(LevelIds* level, u16* path, u16* camera, CameraSwapEffects* screenChangeEffect, u16* movieId);
EXPORT void VIncreaseTimerAndKillPortalClipper_453810();
EXPORT BOOL VStateIs20_453800();
EXPORT void VExitPortal_453720();
EXPORT BOOL VStateIs16_453710();
EXPORT BOOL VStateIs6_453700();
EXPORT void VKillPortalClipper_453570();
EXPORT void VStopAudio_4532C0();
EXPORT void VScreenChanged_4538E0();
EXPORT void VGiveShrukull_4535A0(s16 bPlaySound);
EXPORT void VUpdate_4523D0();
EXPORT BirdPortal* Vdtor_453990(s32 flags);
public:
PortalType field_10_portal_type;
PortalSide field_12_side;
enum class States : s16
{
State_0 = 0,
State_1 = 1,
State_2 = 2,
State_3 = 3,
State_4 = 4,
State_5 = 5,
State_6 = 6,
State_7 = 7,
State_8 = 8,
State_9 = 9,
State_10 = 10,
State_11 = 11,
State_12 = 12,
State_13 = 13,
State_14 = 14,
State_15 = 15,
State_16 = 16,
State_17 = 17,
State_18 = 18,
State_19 = 19,
State_20 = 20,
State_21 = 21,
State_22 = 22,
};
States field_14_state;
s16 field_16;
FP field_18_xpos;
FP field_1C_ypos;
FP field_20_exit_x;
FP field_24_exit_y;
FP field_28_ypos;
s32 field_2C_tlvInfo;
s32 field_30_timer;
FP field_34_scale;
s16 field_38_movie_id;
s16 field_3A;
BirdPortalTerminator* field_3C_pTerminator1;
BirdPortalTerminator* field_40_pTerminator2;
ScreenClipper* field_44_pScreenClipper;
ScreenClipper* field_48_pScreenClipper;
DynamicArrayT<Dove>* field_4C_pDovesArray;
LevelIds field_50_dest_level;
s16 field_52_dest_path;
s16 field_54_dest_camera;
s16 field_56_num_muds_for_shrykull;
s16 field_58;
s16 field_5A;
ThrowableTotalIndicator* field_5C_pThrowableTotalIndicator;
OrbWhirlWind* field_60_pOrbWhirlWind;
LevelIds field_64_level;
s16 field_66_path;
s32 field_68_sfx_ret;
};
ALIVE_ASSERT_SIZEOF(BirdPortal, 0x6C);
} // namespace AO
| 27.04878 | 131 | 0.715735 | Leonard2 |
b599d7884fd7f9af5d528ef2cf49ffaf7d43298c | 359 | cpp | C++ | missions/_missions/Exile_config/REBORN/@ExileServer/addons/Enigma_Exile_Custom/config.cpp | ademirt/Arma3 | f75c28f59deb45e56d021d9d1d3458b145432bd8 | [
"MIT"
] | 9 | 2017-03-30T15:37:09.000Z | 2022-02-06T22:44:17.000Z | missions/_missions/Exile_config/REBORN/@ExileServer/addons/Enigma_Exile_Custom/config.cpp | ademirt/Arma3 | f75c28f59deb45e56d021d9d1d3458b145432bd8 | [
"MIT"
] | 1 | 2017-04-10T14:59:31.000Z | 2017-04-11T14:42:13.000Z | missions/_missions/Exile_config/REBORN/@ExileServer/addons/Enigma_Exile_Custom/config.cpp | ademirt/Arma3 | f75c28f59deb45e56d021d9d1d3458b145432bd8 | [
"MIT"
] | 6 | 2017-02-25T00:19:40.000Z | 2022-02-16T19:54:45.000Z |
class CfgPatches
{
class Enigma_Exile_Custom {
units[] = {};
weapons[] = {};
requiredVersion = 0.1;
author[]= {"Happydayz_EngimaTeam"};
};
};
class CfgFunctions
{
class EnigmaTeam
{
class main
{
file = "\Enigma_Exile_Custom\init";
class init
{
preInit = 1;
};
class postinit
{
postInit = 1;
};
};
};
};
| 11.966667 | 39 | 0.559889 | ademirt |
b5a1f49a4800b3a9b270d44e1b7c54006a805dcb | 78 | cpp | C++ | Source/FSD/Private/BoxGenerationItem.cpp | Dr-Turtle/DRG_ModPresetManager | abd7ff98a820969504491a1fe68cf2f9302410dc | [
"MIT"
] | 8 | 2021-07-10T20:06:05.000Z | 2022-03-04T19:03:50.000Z | Source/FSD/Private/BoxGenerationItem.cpp | Dr-Turtle/DRG_ModPresetManager | abd7ff98a820969504491a1fe68cf2f9302410dc | [
"MIT"
] | 9 | 2022-01-13T20:49:44.000Z | 2022-03-27T22:56:48.000Z | Source/FSD/Private/BoxGenerationItem.cpp | Dr-Turtle/DRG_ModPresetManager | abd7ff98a820969504491a1fe68cf2f9302410dc | [
"MIT"
] | 2 | 2021-07-10T20:05:42.000Z | 2022-03-14T17:05:35.000Z | #include "BoxGenerationItem.h"
ABoxGenerationItem::ABoxGenerationItem() {
}
| 13 | 42 | 0.782051 | Dr-Turtle |
b5a3363d7e2c8587721e4f6f639dfe312f0d478a | 1,791 | cpp | C++ | PlatformLib/iOS/RenderBuffer.cpp | cdoty/SuperPlay | e2d33cb52635251cd3f180b73f5fb08944940d18 | [
"MIT"
] | 26 | 2015-01-23T03:07:12.000Z | 2021-11-14T20:35:03.000Z | PlatformLib/iOS/RenderBuffer.cpp | cdoty/SuperPlay | e2d33cb52635251cd3f180b73f5fb08944940d18 | [
"MIT"
] | 1 | 2016-05-09T22:04:21.000Z | 2016-05-10T03:27:07.000Z | PlatformLib/iOS/RenderBuffer.cpp | cdoty/SuperPlay | e2d33cb52635251cd3f180b73f5fb08944940d18 | [
"MIT"
] | 8 | 2015-04-13T19:15:36.000Z | 2021-01-13T13:24:45.000Z | // This code is part of the Super Play Library (http://www.superplay.info),
// and may only be used under the terms contained in the LICENSE file,
// included with the Super Play Library.
//
// THIS CODE AND INFORMATION ARE PROVIDED "AS IS" WITHOUT WARRANTY OF ANY
// KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
#include <OpenGLES/ES1/glext.h>
#include "Log.h"
#include "RenderBuffer.h"
NAMESPACE(SPlay)
RenderBuffer::RenderBuffer() :
m_uFrameBuffer(GL_INVALID_VALUE),
m_uRenderBuffer(GL_INVALID_VALUE)
{
glGenRenderbuffersOES(1, &m_uRenderBuffer);
glBindRenderbufferOES(GL_RENDERBUFFER_OES, m_uRenderBuffer);
}
RenderBuffer::~RenderBuffer()
{
close();
}
bool RenderBuffer::initialize()
{
glGenFramebuffersOES(1, &m_uFrameBuffer);
glBindFramebufferOES(GL_FRAMEBUFFER_OES, m_uFrameBuffer);
glFramebufferRenderbufferOES(GL_FRAMEBUFFER_OES, GL_COLOR_ATTACHMENT0_OES, GL_RENDERBUFFER_OES, m_uRenderBuffer);
GLenum error = glCheckFramebufferStatusOES(GL_FRAMEBUFFER_OES);
if (error != GL_FRAMEBUFFER_COMPLETE_OES)
{
SPlay::Log::instance()->logError("Unable to create frame and render buffers (%d)", error);
return false;
}
return true;
}
void RenderBuffer::close()
{
if (m_uFrameBuffer != GL_INVALID_VALUE)
{
glDeleteFramebuffersOES(1, &m_uFrameBuffer);
m_uFrameBuffer = GL_INVALID_VALUE;
}
if (m_uRenderBuffer != GL_INVALID_VALUE)
{
glDeleteRenderbuffersOES(1, &m_uRenderBuffer);
m_uRenderBuffer = GL_INVALID_VALUE;
}
}
void RenderBuffer::bindFrameBuffer()
{
glBindFramebufferOES(GL_FRAMEBUFFER_OES, m_uFrameBuffer);
}
void RenderBuffer::bindRenderBuffer()
{
glBindRenderbufferOES(GL_RENDERBUFFER_OES, m_uRenderBuffer);
}
ENDNAMESPACE
| 23.25974 | 114 | 0.778336 | cdoty |
b5a47107308f78437a490af472ae63274b2ea303 | 1,809 | cpp | C++ | src/competitiveProgrammingTest/cpp/competitive/programming/physics/DiskTest.cpp | dareagle/competitive-programming | 4f92a09592b8e0cb4cbcc530681721a728902908 | [
"Apache-2.0"
] | 160 | 2016-05-27T14:26:38.000Z | 2022-03-06T19:30:00.000Z | src/competitiveProgrammingTest/cpp/competitive/programming/physics/DiskTest.cpp | dareagle/competitive-programming | 4f92a09592b8e0cb4cbcc530681721a728902908 | [
"Apache-2.0"
] | 7 | 2016-06-26T16:01:43.000Z | 2019-06-15T21:00:10.000Z | src/competitiveProgrammingTest/cpp/competitive/programming/physics/DiskTest.cpp | dareagle/competitive-programming | 4f92a09592b8e0cb4cbcc530681721a728902908 | [
"Apache-2.0"
] | 40 | 2016-06-28T11:06:13.000Z | 2021-12-01T14:48:28.000Z | #include "gtest/gtest.h"
#include "competitive/programming/physics/Disk.hpp"
#include <cmath>
using competitive::programming::physics::Disk;
TEST(Disk, Move)
{
Disk disk(2, 1, 2, 3, 5);
ASSERT_EQ(Disk(4, 4, 2, 3, 5), disk.move());
ASSERT_EQ(Disk(2, 1, 2, 3, 5), disk);
disk.moveInPlace();
ASSERT_EQ(Disk(4, 4, 2, 3, 5), disk);
}
TEST(Disk, Accelerate)
{
Disk disk(2, 1, 2, 3, 5);
ASSERT_EQ(Disk(2, 1, 3, 5, 5), disk.accelerate(Disk::Vector(1,2)));
ASSERT_EQ(Disk(2, 1, 4, 6, 5), disk.accelerate(2));
ASSERT_EQ(Disk(2, 1, 2, 3, 5), disk);
disk.accelerateInPlace(Disk::Vector(2,1));
ASSERT_EQ(Disk(2, 1, 4, 4, 5), disk);
disk.accelerateInPlace(0.5);
ASSERT_EQ(Disk(2, 1, 2, 2, 5), disk);
}
TEST(Disk, CollisionDetection)
{
Disk disk(2, 1, 2, 3, 5);
Disk oppositeMoves(-2, -5,-2, -3, 1);
ASSERT_FALSE(disk.willCollide(oppositeMoves));
Disk frontCollision(6, 7,-2, -3, 1);
ASSERT_TRUE(disk.willCollide(frontCollision));
Disk alreadyCollide(2, 1,-2, -3, 1);
ASSERT_TRUE(disk.willCollide(alreadyCollide));
Disk noRelativeMovement(10, 10,2, 3, 2);
ASSERT_FALSE(disk.willCollide(noRelativeMovement));
Disk goingRight(0, 0,10, 0, 5);
Disk radiusTouch(2, 6,0, 0, 1);
ASSERT_TRUE(goingRight.willCollide(radiusTouch));
Disk radiusNotTouch(2, 6,0, 0, 0.5);
ASSERT_FALSE(goingRight.willCollide(radiusNotTouch));
}
TEST(Disk, CollisionTime)
{
Disk disk(2, 1, 2, 3, 5);
Disk oppositeMoves(-2, -5,-2, -3, 1);
bool nan = std::isnan(disk.collisionTime(oppositeMoves));
ASSERT_TRUE(nan);
Disk goingRight(0, 0,10, 0, 5);
Disk radiusTouch(2, 6,0, 0, 1);
ASSERT_EQ(0.2, goingRight.collisionTime(radiusTouch));
ASSERT_EQ(2, goingRight.collisionTime(Disk(26, 0,0, 0, 1)));
ASSERT_EQ(0, goingRight.collisionTime(goingRight));
ASSERT_EQ(0, goingRight.collisionTime(Disk(1, 1,-10, 0, 5)));
}
| 29.177419 | 68 | 0.682698 | dareagle |
b26eb3a2837b12402258842916dcc01ed7e66e6d | 197 | cpp | C++ | 30-app/viewdll/source/ctrlapp2.cpp | RealCrond/view | 0a5f0b5d6e57d0d91f8b254ec9f3075e5185a34d | [
"MIT"
] | 1 | 2020-03-27T09:37:18.000Z | 2020-03-27T09:37:18.000Z | 30-app/viewdll/source/ctrlapp2.cpp | RealCrond/view | 0a5f0b5d6e57d0d91f8b254ec9f3075e5185a34d | [
"MIT"
] | null | null | null | 30-app/viewdll/source/ctrlapp2.cpp | RealCrond/view | 0a5f0b5d6e57d0d91f8b254ec9f3075e5185a34d | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "ctrlapp2.h"
CCtrlApp2::CCtrlApp2()
{
}
CCtrlApp2::~CCtrlApp2()
{
}
BEGIN_MSG_MAP(CCtrlApp2)
//REG_MSG(emFistEventId, CCtrlApp1::OnCameraSelectCmd)
END_MSG_MAP() | 11.588235 | 55 | 0.736041 | RealCrond |
b26f54a765a757e07a98cb40380c1c40609d268f | 1,812 | cpp | C++ | src/ast/array-literal.cpp | alta-lang/ceetah | bddb3478d10480f62ff0b3b4930479a2d745ae52 | [
"MIT"
] | null | null | null | src/ast/array-literal.cpp | alta-lang/ceetah | bddb3478d10480f62ff0b3b4930479a2d745ae52 | [
"MIT"
] | null | null | null | src/ast/array-literal.cpp | alta-lang/ceetah | bddb3478d10480f62ff0b3b4930479a2d745ae52 | [
"MIT"
] | null | null | null | #include "../../include/ceetah/ast/array-literal.hpp"
Ceetah::AST::NodeType Ceetah::AST::ArrayLiteral::nodeType() const {
return NodeType::ArrayLiteral;
};
std::string Ceetah::AST::ArrayLiteral::toStringWithIndent(std::string indent) const {
std::string result = "";
if (type) {
result += '(';
result += type->toStringWithIndent(indent);
result += ')';
}
result += '{';
bool isFirst = true;
for (auto& item: items) {
if (newlineOnExpressions) result += '\n' + indent + '\t';
if (isFirst) {
isFirst = false;
} else {
result += ',';
}
result += '(';
result += item->toStringWithIndent(indent + "\t\t");
result += ')';
}
if (newlineOnExpressions) result += '\n' + indent;
result += '}';
if (!preComment.empty())
result = "/* " + preComment + " */" + result;
if (!postComment.empty())
result += "/* " + postComment + " */";
return result;
};
bool Ceetah::AST::ArrayLiteral::operator ==(const Ceetah::AST::ArrayLiteral& other) const {
if ((!!type) != (!!other.type)) return false;
if (type && *type != *other.type) return false;
if (items.size() != other.items.size()) return false;
bool match = true;
for (size_t i = 0; i < items.size(); i++) {
if (*items[i] != *other.items[i]) {
match = false;
break;
}
}
if (!match) return false;
return true;
};
std::shared_ptr<Ceetah::AST::Node> Ceetah::AST::ArrayLiteral::clone() const {
auto node = std::make_shared<Ceetah::AST::ArrayLiteral>();
cloneTo(node);
return node;
};
void Ceetah::AST::ArrayLiteral::cloneTo(std::shared_ptr<Node> _node) const {
auto node = std::dynamic_pointer_cast<Ceetah::AST::ArrayLiteral>(_node);
Expression::cloneTo(node);
CEETAH_AST_CLONE_CHILD(type);
CEETAH_AST_CLONE_CHILDREN(items);
};
| 23.532468 | 91 | 0.607616 | alta-lang |
b2709ac5af83f9388a81e4fd46bfe216ff82c986 | 694 | cpp | C++ | utils/src/drawing/Color.cpp | AleksievAleksandar/Game_Engine | 78b055862f8a887bd7a90142ef8eb56e21ca5e3b | [
"MIT"
] | 1 | 2022-02-21T11:09:17.000Z | 2022-02-21T11:09:17.000Z | utils/src/drawing/Color.cpp | AleksievAleksandar/Game_Engine | 78b055862f8a887bd7a90142ef8eb56e21ca5e3b | [
"MIT"
] | null | null | null | utils/src/drawing/Color.cpp | AleksievAleksandar/Game_Engine | 78b055862f8a887bd7a90142ef8eb56e21ca5e3b | [
"MIT"
] | null | null | null | #include "utils/drawing/Color.h"
namespace Colors {
const Color RED(255, 0, 0, 255);
const Color GREEN(0, 255, 0, 255);
const Color BLUE(0, 0, 255, 255);
const Color BLACK(0, 0, 0, 255);
const Color WHITE(255, 255, 255, 255);
const Color GRAY(192, 192, 192, 255);
const Color CYAN(0, 255, 255, 255);
const Color MAGENTA(255, 0, 255, 255);
const Color YELLOW(255, 255, 0, 255);
const Color ORANGE(255, 128, 0, 255);
const Color PURPLE(128, 0, 128, 255);
const Color FULL_TRANSPARENT(0, 0, 0, 0);
} //namespace Colors
Color::Color(const uint8_t red, const uint8_t green, const uint8_t blue, const uint8_t alpha)
{
rgba.r = red;
rgba.g = green;
rgba.b = blue;
rgba.a = alpha;
}
| 26.692308 | 93 | 0.67147 | AleksievAleksandar |
b273f7c0247de5acce0cd8c101893a83ff613c53 | 836 | hpp | C++ | src/headers/game-graphics.hpp | big-leo/2048.cpp | 072becdcd8b91d1b15a5802991a92975768b4b20 | [
"MIT"
] | 1 | 2020-10-24T07:29:36.000Z | 2020-10-24T07:29:36.000Z | src/headers/game-graphics.hpp | big-leo/2048.cpp | 072becdcd8b91d1b15a5802991a92975768b4b20 | [
"MIT"
] | null | null | null | src/headers/game-graphics.hpp | big-leo/2048.cpp | 072becdcd8b91d1b15a5802991a92975768b4b20 | [
"MIT"
] | null | null | null | #ifndef GAMEGRAPHICS_H
#define GAMEGRAPHICS_H
#include <string>
enum GameBoardDimensions {
MIN_GAME_BOARD_PLAY_SIZE = 3,
MAX_GAME_BOARD_PLAY_SIZE = 10
};
enum { COMPETITION_GAME_BOARD_PLAY_SIZE = 4 };
namespace Game {
namespace Graphics {
std::string MessageScoreSavedPrompt();
std::string AskForPlayerNamePrompt();
std::string BoardInputPrompt();
std::string YouWinPrompt();
std::string GameOverPrompt();
std::string EndOfEndlessPrompt();
std::string InvalidInputGameBoardErrorPrompt();
std::string QuestionEndOfWinningGamePrompt();
std::string GameStateNowSavedPrompt();
std::string GameBoardNoSaveErrorPrompt();
std::string BoardSizeErrorPrompt();
std::string InputCommandListPrompt();
std::string EndlessModeCommandListPrompt();
std::string InputCommandListFooterPrompt();
} // namespace Graphics
} // namespace Game
#endif
| 26.125 | 47 | 0.800239 | big-leo |
b27699f9c7e1ce722f7518383e35f0e0e281642e | 327 | cpp | C++ | test_cttrie_print.cpp | smilingthax/cttrie | 010182660de3c978343bc8148dd08963c9c4c5be | [
"MIT"
] | 40 | 2016-08-03T22:07:04.000Z | 2021-12-18T05:02:54.000Z | 3party/cttrie/test_cttrie_print.cpp | mapsme/geocore | 346fceb020cd909b37706ab6ad454aec1a11f52e | [
"Apache-2.0"
] | 37 | 2019-10-04T00:55:46.000Z | 2019-12-27T15:13:19.000Z | 3party/cttrie/test_cttrie_print.cpp | mapsme/geocore | 346fceb020cd909b37706ab6ad454aec1a11f52e | [
"Apache-2.0"
] | 13 | 2019-10-02T15:03:58.000Z | 2020-12-28T13:06:22.000Z | #include "cttrie-print.h"
#include <stdio.h>
int main()
{
auto trie=CtTrie::makeTrie(
CSTR("Rosten"),
CSTR("Raben"),
CSTR("Rasen"),
CSTR("Rasten"),
CSTR("Raster"),
CSTR("Rastender"),
CSTR("Raban")
);
// trie is not constexpr, but decltype(trie) is.
CtTrie::printTrie(trie);
return 0;
}
| 15.571429 | 50 | 0.587156 | smilingthax |
b2780d67ab05e2bc176aef7a2afaa597a7267b84 | 1,246 | cpp | C++ | Source/Engine/src/stdlib/stdlib.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | null | null | null | Source/Engine/src/stdlib/stdlib.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | null | null | null | Source/Engine/src/stdlib/stdlib.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | 1 | 2021-10-30T20:43:01.000Z | 2021-10-30T20:43:01.000Z | /*
* stdlib.cpp
* Swift Standard Library
*/
namespace StdLib
{
// Audio
namespace Sound { void Install(); }
// DataStructures
namespace Grid { void Install(); }
// IO
namespace BinaryFile { void Install(); }
namespace FileSystem { void Install(); }
namespace Keyboard { void Install(); }
namespace Mouse { void Install(); }
namespace TextFile { void Install(); }
// Math
namespace Math { void Install(); }
namespace Random { void Install(); }
// RunTime
namespace List { void Install(); }
namespace String { void Install(); }
// System
namespace Debug { void Install(); }
namespace Time { void Install(); }
namespace SlGame { void Install(); }
// Video
namespace Sprite { void Install(); }
namespace Color { void Install(); }
void Install()
{
// Audio
Sound::Install();
// DataStructures
Grid::Install();
// IO
BinaryFile::Install();
FileSystem::Install();
Keyboard::Install();
Mouse::Install();
TextFile::Install();
// Math
Math::Install();
Random::Install();
// RunTime
List::Install();
String::Install();
// System
Debug::Install();
Time::Install();
SlGame::Install();
// Video
Sprite::Install();
Color::Install();
}
void Uninstall()
{
}
}
| 16.394737 | 41 | 0.624398 | DatZach |
b27b96292030d50b2fae3571dca5c8c33992d250 | 5,810 | cpp | C++ | src/random.cpp | brentnd/random-cpp | dbb5adfc93238e18625bfd0424e7b8ed1bfcd4e9 | [
"MIT"
] | null | null | null | src/random.cpp | brentnd/random-cpp | dbb5adfc93238e18625bfd0424e7b8ed1bfcd4e9 | [
"MIT"
] | null | null | null | src/random.cpp | brentnd/random-cpp | dbb5adfc93238e18625bfd0424e7b8ed1bfcd4e9 | [
"MIT"
] | null | null | null | #include <randomcpp.hpp>
#include <algorithm> // std::find
#include <ctime> // std::time
#include <cmath>
namespace randomcpp {
static unsigned seed_value = 0;
static std::random_device rd;
static float const SG_MAGICCONST = 1.0f + std::log(4.5f);
static float const NV_MAGICCONST = static_cast<float>(4.0f * std::exp(-0.5)/std::sqrt(2.0f));
static void initialize() {
std::srand(seed_value);
}
void seed() {
seed(static_cast<unsigned>(std::time(0)));
}
void seed(unsigned a) {
seed_value = a;
initialize();
}
void reset() {
initialize();
}
int _randbelow(int n) {
return std::rand() % n;
}
int randrange(int stop) {
return randrange(0, stop);
}
int randrange(int start, int stop, int step /*=1*/) {
int width = stop - start;
if (step == 1 && width > 0) {
return start + _randbelow(width);
}
if (step == 1) {
throw std::range_error("empty range for randrange()");
}
int n;
if (step > 0) {
n = (width + step - 1) / step;
} else if (step < 0) {
n = (width + step + 1) / step;
} else {
throw std::range_error("zero step for randrange()");
}
if (n <= 0) {
throw std::range_error("empty range for randrange()");
}
return start + step * _randbelow(n);
}
int randint(int a, int b) {
return randrange(a, b + 1);
}
float random() {
return static_cast<float>(std::rand()) / RAND_MAX;
}
float uniform(float a, float b) {
return a + (b-a) * random();
}
float triangular(float low /*=0.0*/, float high /*=1.0*/, float c /*=0.5*/) {
auto u(random());
if (u > c) {
u = 1.0f - u;
c = 1.0f - c;
std::swap(low, high);
}
return low + (high - low) * std::pow((u * c), 0.5);
}
float betavariate(float alpha, float beta) {
auto y = gammavariate(alpha, 1.0f);
if (y != 0.0f) {
y /= y + gammavariate(beta, 1.0f);
}
return y;
}
float expovariate(float lambda) {
float u;
do {
u = random();
} while (u <= 1e-7);
return -std::log(u) / lambda;
}
float gammavariate(float alpha, float beta) {
if (alpha < 0.0f || beta < 0.0f) {
throw std::invalid_argument("gammavariate: alpha and beta must be > 0.0");
}
if (alpha > 1.0) {
// Uses R.C.H. Cheng, "The generation of Gamma
// variables with non-integral shape parameters",
// Applied Statistics, (1977), 26, No. 1, p71-74
float ainv = std::sqrt(2.0f * alpha - 1.0f);
float bbb = alpha - static_cast<float>(std::log(4));
float ccc = alpha + ainv;
while (true) {
float u1 = random();
if (1e-7 < u1 < .9999999) {
continue;
}
float u2 = 1.0f - random();
float v = std::log(u1 / (1.0f - u1)) / ainv;
float x = alpha * std::exp(v);
float z = u1 * u1 * u2;
float r = bbb + ccc * v - x;
if (r + SG_MAGICCONST - 4.5 * z >= 0.0 or r >= std::log(z)) {
return x * beta;
}
}
} else if (alpha == 1.0) {
// expovariate(1)
float u = random();
while (u <= 1e-7) {
u = random();
}
return -std::log(u) * beta;
} else /* alpha is between 0 and 1 (exclusive) */ {
// Uses ALGORITHM GS of Statistical Computing - Kennedy & Gentle
while (true) {
float u = random();
float b = (M_E + alpha) / M_E;
float p = b * u;
float x;
if (p <= 1.0) {
x = std::pow(p, 1.0f / alpha);
} else {
x = -std::log((b - p) / alpha);
}
float u1 = random();
if (p > 1.0) {
if (u1 <= std::pow(x, alpha - 1.0f)) {
break;
}
} else if (u1 <= std::exp(-x)) {
break;
}
return x * beta;
}
}
}
float gauss(float mu, float sigma) {
std::normal_distribution<float> dist(mu, sigma);
std::mt19937 gen(rd());
return dist(gen);
}
float normalvariate(float mu, float sigma) {
float z;
while (true) {
float u1 = random();
float u2 = 1.0f - random();
z = NV_MAGICCONST * (u1 - 0.5f) / u2;
float zz = z*z/4.0f;
if (zz <= -std::log(u2)) {
break;
}
}
return mu + z*sigma;
}
float vonmisesvariate(float mu, float kappa) {
if (kappa <= 1e-6) {
return 2.0f * M_PI * random();
}
float a = 1.0f + std::sqrt(1.0f + 4.0f * kappa * kappa);
float b = (a - std::sqrt(2.0f * a)) / (2.0f * kappa);
float r = (1.0f + b * b) / (2.0f * b);
float f;
while (true) {
float u1 = random();
float z = std::cos(M_PI * u1);
f = (1.0f + r * z) / (r + z);
float c = kappa * (r - f);
float u2 = random();
if (u2 < c * (2.0f - c) || u2 <= c * std::exp(1.0f - c)) {
break;
}
}
float u3 = random();
float theta;
if (u3 > 0.5f) {
theta = std::fmod(mu, 2.0f * M_PI) + std::acos(f);
} else {
theta = std::fmod(mu, 2.0f * M_PI) - std::acos(f);
}
return theta;
}
float paretovariate(float alpha) {
float u = 1.0f - random();
return 1.0f / std::pow(u, (1.0f/alpha));
}
float weibullvariate(float alpha, float beta) {
float u = 1.0f - random();
return alpha * std::pow(-std::log(u), 1.0f / beta);
}
bool probability(float probability_) {
float r = uniform(0.0f, 1.0f);
return r <= probability_;
}
std::vector<int> sample(int a, int b, unsigned k, bool unique) {
if (unique && (b - a) < k) {
throw std::range_error("random vector unique but range is less than count");
}
std::vector<int> rand_is;
while (rand_is.size() < k) {
int rand_i = randint(a, b);
if (!unique || std::find(rand_is.begin(), rand_is.end(), rand_i) == rand_is.end()) {
rand_is.push_back(rand_i);
}
}
return rand_is;
}
} // namespace randomcpp | 23.811475 | 93 | 0.519621 | brentnd |
b27bf8744cb6bbe1c0b34445929dd4c66b48c35b | 4,534 | cpp | C++ | Surrounded Regions.cpp | Xe0n0/LeetCode | a7a383d88d222edaadd52b317e848f06632a569a | [
"MIT"
] | 1 | 2017-08-22T00:43:27.000Z | 2017-08-22T00:43:27.000Z | Surrounded Regions.cpp | Xe0n0/LeetCode | a7a383d88d222edaadd52b317e848f06632a569a | [
"MIT"
] | null | null | null | Surrounded Regions.cpp | Xe0n0/LeetCode | a7a383d88d222edaadd52b317e848f06632a569a | [
"MIT"
] | null | null | null | //solution rev.2 BFS to deal with O that can not be flip to X, complexity is O(input)
class Solution {
public:
void solve(vector<vector<char>> &board) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int h, w;
if ((h = board.size()) == 0 || (w = board[0].size()) == 0) return;
for (int i = 0; i < w; i++) {
searchAt(0, i, board, w, h);
searchAt(h-1, i, board, w, h);
}
for (int i = 0; i < h; i++) {
searchAt(i, 0, board, w, h);
searchAt(i, w-1, board, w, h);
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (board[i][j] == 'O') {
board[i][j] = 'X';
}
else if (board[i][j] == 'Y') {
board[i][j] = 'O';
}
}
}
}
private:
void searchAt(int x, int y, vector<vector<char>> &board, int w, int h) {
queue<pair<int, int>> q;
q.push(make_pair(x ,y));
while (!q.empty()) {
x = q.front().first;
y = q.front().second;
q.pop();
if (board[x][y] == 'O') {
board[x][y] = 'Y';
if (x > 0) {
q.push(make_pair(x-1, y));
}
if (x < w-1) {
q.push(make_pair(x+1, y));
}
if (y > 0)
q.push(make_pair(x, y-1));
if (y < w-1)
q.push(make_pair(x, y+1));
}
}
}
};
// class Solution {
// private:
// set<pair<int, int>> set_v;
// set<pair<int, int>> area;
// queue<pair<int, int>> q;
// bool isOpenArea;
// int width;
// int height;
// bool visit_if_could(int i, int j, vector<vector<char>> &board) {
// if (i < 0 || i >= width || j < 0 || j >= height) return false;
// if (board[i][j] == 'O' && set_v.find(make_pair(i, j)) == set_v.end()) {
// pair<int, int> p = make_pair(i, j);
// area.insert(p);
// set_v.insert(p);
// q.push(p);
// if (i == 0 || i == width - 1 || j == 0 || j == height - 1) {
// isOpenArea = true;
// }
// }
// return true;
// }
// void enqueue_if_needed(int i, int j, vector<vector<char>> &board){
// // if (i < 0 || i >= width || j < 0 || j >= height) return;
// q.push(make_pair(i, j));
// return;
// }
// void searchAt(int i, int j, vector<vector<char>> &board) {
// isOpenArea = false;
// visit_if_could(i, j, board);
// while(q.size() > 0) {
// pair<int, int> point = q.front();
// q.pop();
// // visit(point);
// visit_if_could(point.first-1, point.second, board);
// visit_if_could(point.first+1, point.second, board);
// visit_if_could(point.first, point.second-1, board);
// visit_if_could(point.first, point.second+1, board);
// }
// if (!isOpenArea) {
// set<pair<int, int>>::iterator i = area.begin();
// while(i != area.end()) {
// pair<int, int> point = *i;
// board[point.first][point.second] = 'X';
// i++;
// }
// }
// area.clear();
// }
// public:
// void solve(vector<vector<char>> &board) {
// // Start typing your C/C++ solution below
// // DO NOT write int main() function
// isOpenArea = false;
// height = board.size();
// if (height <= 0) return;
// width = board[0].size();
// for (int i = 1; i < board.size() - 1; i++) {
// vector<char> &row = board[i];
// for (int j = 1; j < row.size() - 1; j++) {
// if (row[j] == 'O')
// searchAt(i, j, board);
// }
// }
// set_v.clear();
// isOpenArea = false;
// }
// }; | 26.828402 | 85 | 0.363917 | Xe0n0 |
b280154534cfe18b384d005dec4febdc9fe980b1 | 1,757 | cc | C++ | test/slice_test.cc | pragkent/logbox | 15274be0726cd3f0d71266a0ce4755106c8bdd1f | [
"MIT"
] | 2 | 2015-02-14T04:24:07.000Z | 2015-02-28T11:23:48.000Z | test/slice_test.cc | pragkent/logbox | 15274be0726cd3f0d71266a0ce4755106c8bdd1f | [
"MIT"
] | null | null | null | test/slice_test.cc | pragkent/logbox | 15274be0726cd3f0d71266a0ce4755106c8bdd1f | [
"MIT"
] | null | null | null | #include <string>
#include "util/slice.h"
#include <gtest/gtest.h>
using logbox::Slice;
TEST(SliceTest, CreateByCharPointerAndLength) {
const char* hello = "Hello";
Slice slice(hello, 2);
EXPECT_EQ(hello, slice.data());
EXPECT_EQ(2U, slice.size());
}
TEST(SliceTest, CreateByStdString) {
std::string hello = "Hello";
Slice slice(hello);
EXPECT_EQ(hello.data(), slice.data());
EXPECT_EQ(hello.size(), slice.size());
}
TEST(SliceTest, CreateByCString) {
const char* hello = "Hello";
Slice slice(hello);
EXPECT_EQ(hello, slice.data());
EXPECT_EQ(5U, slice.size());
}
TEST(SliceTest, Empty) {
EXPECT_TRUE(Slice("").empty());
EXPECT_FALSE(Slice("Not empty").empty());
}
TEST(SliceTest, SubscriptOperator) {
Slice slice("hello");
EXPECT_EQ('h', slice[0]);
EXPECT_EQ('e', slice[1]);
EXPECT_EQ('l', slice[2]);
EXPECT_EQ('l', slice[3]);
EXPECT_EQ('o', slice[4]);
}
TEST(SliceTest, ToString) {
Slice slice("hello", 2);
EXPECT_EQ("he", slice.ToString());
}
TEST(SliceTest, Compare) {
Slice hello("hello");
Slice hi("hi");
EXPECT_GT(0, hello.compare(hi));
EXPECT_LT(0, hi.compare(hello));
EXPECT_EQ(0, hi.compare(hi));
}
TEST(SliceTest, StartsWith) {
Slice hello("hello");
Slice hi("hi");
Slice he("he");
EXPECT_TRUE(hello.starts_with(he));
EXPECT_TRUE(hello.starts_with(hello));
EXPECT_FALSE(hello.starts_with(hi));
EXPECT_FALSE(he.starts_with(hello));
}
TEST(SliceTest, EqualOperator) {
Slice hello("Hello");
Slice hi("Hi");
EXPECT_TRUE(hello == hello);
EXPECT_TRUE(hi == hi);
EXPECT_FALSE(hello == hi);
}
TEST(SliceTest, NotEqualOperator) {
Slice hello("Hello");
Slice hi("Hi");
EXPECT_TRUE(hello != hi);
EXPECT_FALSE(hello != hello);
EXPECT_FALSE(hi != hi);
}
| 20.430233 | 47 | 0.663062 | pragkent |
b28215c717148495e3bc175f3134e5ff79a5298e | 714 | cpp | C++ | examples/google-code-jam/rapel/C_1.cpp | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | examples/google-code-jam/rapel/C_1.cpp | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | examples/google-code-jam/rapel/C_1.cpp | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
#define ff first
#define mp make_pair
#define ss second
using namespace std;
priority_queue<pair<int,pair<int,int> > > pq;
int main()
{
int ntc;
scanf("%d",&ntc);
for(int tc=1;tc<=ntc;tc++)
{
int n,k;
scanf("%d %d",&n,&k);
while(!pq.empty()) pq.pop();
pq.push(mp(n+1-0-1,mp(-0,-n-1)));
int al,ar;
for(int b=1;b<=k;b++)
{
int dist = pq.top().ff;
int le = -pq.top().ss.ff;
int ri = -pq.top().ss.ss;
int ins = (le + ri)/2;
al = min(ins-le-1,ri-ins-1);
ar = max(ins-le-1,ri-ins-1);
pq.pop();
pq.push(mp(ins-le-1,mp(-le,-ins)));
pq.push(mp(ri-ins-1,mp(-ins,-ri)));
}
printf("Case #%d: %d %d\n",tc,ar,al);
}
}
| 20.4 | 46 | 0.515406 | rbenic-fer |
b28ad1de34bb39582e8c625f7381f3972f33cf98 | 4,324 | cpp | C++ | CraftEngine/src/dev-ui/DevUI.cpp | guibec/rpgcraft | a4fd84effaf334b1ed637d32b8853b0e6beadf1e | [
"MIT"
] | 9 | 2017-04-05T01:42:36.000Z | 2021-11-14T20:37:58.000Z | CraftEngine/src/dev-ui/DevUI.cpp | guibec/rpgcraft | a4fd84effaf334b1ed637d32b8853b0e6beadf1e | [
"MIT"
] | 82 | 2017-04-05T00:26:54.000Z | 2019-09-21T22:43:09.000Z | CraftEngine/src/dev-ui/DevUI.cpp | guibec/rpgcraft | a4fd84effaf334b1ed637d32b8853b0e6beadf1e | [
"MIT"
] | 3 | 2019-01-08T17:11:17.000Z | 2021-08-11T23:59:23.000Z | #include "PCH-rpgcraft.h"
#include "x-types.h"
#include "x-png-decode.h"
#include "x-chrono.h"
#include "appConfig.h"
#include "Scene.h"
#include "dev-ui/ui-assets.h"
ImGuiTextures s_gui_tex;
void DevUI_LoadImageAsset(DevUI_ImageAsset& dest, const char* asset_name)
{
xString fullpath = FindAsset(xFmtStr("dev-ui/%s", asset_name));
xBitmapData pngsrc;
png_LoadFromFile(pngsrc, fullpath);
dx11_CreateTexture2D(dest.gpures, pngsrc, GPU_ResourceFmt_R8G8B8A8_UNORM);
dest.size = pngsrc.size;
}
void DevUI_LoadStaticAssets()
{
DevUI_LoadImageAsset(s_gui_tex.Play, "Play.png");
DevUI_LoadImageAsset(s_gui_tex.Pause, "Pause.png");
DevUI_LoadImageAsset(s_gui_tex.Stop, "Stop.png");
DevUI_LoadImageAsset(s_gui_tex.Power, "Power.png");
DevUI_LoadImageAsset(s_gui_tex.SoundIcon, "sound-icons.png");
}
enum DevUi_SimplePlayState
{
SPState_PowerOff = 0,
SPState_Playing,
SPState_Paused,
};
static DevUi_SimplePlayState s_spstate = SPState_PowerOff;
static bool s_powerDoubleThrow = 0;
void DevUI_DevControl()
{
if (Scene_HasStopReason(SceneStopReason_Developer)) {
if (s_spstate == SPState_Playing) {
s_spstate = SPState_Paused;
}
}
// Using Pivot doesn't really work unless we already know the size of the window,
// and the size isn't know until the second run through, which means Pivot is useless with
// the FirstTimeEver flag since it'll only be considered the first time through, when size
// is meaningless. So for now just hard-code stuff !
// [TODO] Upgrade Imgui and see if it's addressed this problem. If not, file a bug.
ImGui::SetNextWindowPos( int2 { g_client_size_pix.x / 2, g_client_size_pix.y } - int2 { 48, 72 }, ImGuiCond_FirstUseEver);
Defer(ImGui::End());
if (!ImGui::Begin("DevControl")) return;
ImVec4 activeBackColor = { 0.99f, 0.75f, 0.20f, 1.00f };
ImVec4 activeStateColor = { 0.00f, 0.20f, 1.00f, 1.00f };
ImVec4 pwrThrowBackColor = { 0.22f, 0.22f, 0.22f, 1.00f };
ImVec4 pwrThrowStateColor = { 0.99f, 0.10f, 0.10f, 1.00f };
ImVec4 inactiveBackColor = { 0,0,0,0 };
ImVec4 inactiveStateColor = { 1,1,1,1 };
ImVec2 buttonSize = { 24, 24 };
bool playpress = ImGui::ImageButton((ImTextureID)s_gui_tex.Play.gpures.m_driverData_view, buttonSize, {}, {1,1}, 1,
(s_spstate == SPState_Playing) ? activeBackColor : inactiveBackColor,
(s_spstate == SPState_Playing) ? activeStateColor : inactiveStateColor
); ImGui::SameLine();
bool pausepress = ImGui::ImageButton((ImTextureID)s_gui_tex.Pause.gpures.m_driverData_view, buttonSize, {}, {1,1}, 1,
(s_spstate == SPState_Paused) ? activeBackColor : inactiveBackColor,
(s_spstate == SPState_Paused) ? activeStateColor : inactiveStateColor
); ImGui::SameLine();
bool powerpress = ImGui::ImageButton((ImTextureID)s_gui_tex.Power.gpures.m_driverData_view, buttonSize, {}, {1,1}, s_powerDoubleThrow ? 2 : 1,
s_powerDoubleThrow ? pwrThrowBackColor : ((s_spstate == SPState_PowerOff) ? activeBackColor : inactiveBackColor ),
s_powerDoubleThrow ? pwrThrowStateColor : ((s_spstate == SPState_PowerOff) ? activeStateColor : inactiveStateColor)
);
if (playpress) {
if (s_spstate != SPState_Playing) {
//Scene_PostMessage(SceneMsg_StartExec, SceneStopReason_Developer | SceneStopReason_ScriptError);
}
s_spstate = SPState_Playing;
s_powerDoubleThrow = 0;
}
if (pausepress && (s_spstate == SPState_Playing)) {
if (s_spstate != SPState_Paused) {
//Scene_PostMessage(SceneMsg_StopExec, SceneStopReason_Developer);
}
s_spstate = SPState_Paused;
s_powerDoubleThrow = 0;
}
if (powerpress && (s_spstate != SPState_PowerOff)) {
if (!s_powerDoubleThrow) {
s_powerDoubleThrow = 1;
}
else {
// [TODO] send message which wipes game state completely.
// Subsequent Play action will automatically reset / restart new game state.
//Scene_PostMessage(SceneMsg_StopExec, SceneStopReason_Developer);
s_spstate = SPState_PowerOff;
s_powerDoubleThrow = 0;
}
}
}
| 37.275862 | 146 | 0.670444 | guibec |
b2992225501666a19d50f57677e7a593bb964df8 | 1,259 | cpp | C++ | aws-cpp-sdk-apprunner/source/model/AssociateCustomDomainRequest.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-12T08:09:30.000Z | 2022-02-12T08:09:30.000Z | aws-cpp-sdk-apprunner/source/model/AssociateCustomDomainRequest.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-apprunner/source/model/AssociateCustomDomainRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-11-09T12:02:58.000Z | 2021-11-09T12:02:58.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/apprunner/model/AssociateCustomDomainRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::AppRunner::Model;
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
AssociateCustomDomainRequest::AssociateCustomDomainRequest() :
m_serviceArnHasBeenSet(false),
m_domainNameHasBeenSet(false),
m_enableWWWSubdomain(false),
m_enableWWWSubdomainHasBeenSet(false)
{
}
Aws::String AssociateCustomDomainRequest::SerializePayload() const
{
JsonValue payload;
if(m_serviceArnHasBeenSet)
{
payload.WithString("ServiceArn", m_serviceArn);
}
if(m_domainNameHasBeenSet)
{
payload.WithString("DomainName", m_domainName);
}
if(m_enableWWWSubdomainHasBeenSet)
{
payload.WithBool("EnableWWWSubdomain", m_enableWWWSubdomain);
}
return payload.View().WriteReadable();
}
Aws::Http::HeaderValueCollection AssociateCustomDomainRequest::GetRequestSpecificHeaders() const
{
Aws::Http::HeaderValueCollection headers;
headers.insert(Aws::Http::HeaderValuePair("X-Amz-Target", "AppRunner.AssociateCustomDomain"));
return headers;
}
| 21.338983 | 96 | 0.76251 | perfectrecall |
b29c493a1f267f91d3ffe1f67f74f2404e2e9295 | 1,299 | cpp | C++ | test/math/matrix/binary_map.cpp | freundlich/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 13 | 2015-02-21T18:35:14.000Z | 2019-12-29T14:08:29.000Z | test/math/matrix/binary_map.cpp | cpreh/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 5 | 2016-08-27T07:35:47.000Z | 2019-04-21T10:55:34.000Z | test/math/matrix/binary_map.cpp | freundlich/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 8 | 2015-01-10T09:22:37.000Z | 2019-12-01T08:31:12.000Z | // Copyright Carl Philipp Reh 2009 - 2021.
// 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)
#include <fcppt/cast/to_signed.hpp>
#include <fcppt/catch/begin.hpp>
#include <fcppt/catch/end.hpp>
#include <fcppt/math/matrix/binary_map.hpp>
#include <fcppt/math/matrix/comparison.hpp>
#include <fcppt/math/matrix/output.hpp>
#include <fcppt/math/matrix/row.hpp>
#include <fcppt/math/matrix/static.hpp>
#include <fcppt/config/external_begin.hpp>
#include <catch2/catch.hpp>
#include <fcppt/config/external_end.hpp>
FCPPT_CATCH_BEGIN
TEST_CASE("math::matrix::binary_map", "[math],[matrix]")
{
using ui2_matrix = fcppt::math::matrix::static_<unsigned, 2, 2>;
using i2_matrix = fcppt::math::matrix::static_<int, 2, 2>;
CHECK(
fcppt::math::matrix::binary_map(
ui2_matrix{fcppt::math::matrix::row(5U, 10U), fcppt::math::matrix::row(15U, 20U)},
i2_matrix{fcppt::math::matrix::row(1, 2), fcppt::math::matrix::row(3, 4)},
[](unsigned const _val1, int const _val2) {
return fcppt::cast::to_signed(_val1) + _val2;
}) == i2_matrix(fcppt::math::matrix::row(6, 12), fcppt::math::matrix::row(18, 24)));
}
FCPPT_CATCH_END
| 36.083333 | 94 | 0.682063 | freundlich |
b2a8e07f4893ff9218f337962a1a33de96948b32 | 676 | cpp | C++ | Mathematics/Session_code/tailing_Zeroes.cpp | ayushid549/DSA_Marathon | 504c7cd7d153da10bbab3273c38d3368b72f946a | [
"MIT"
] | 24 | 2021-09-14T13:16:58.000Z | 2022-02-25T18:54:26.000Z | Mathematics/Session_code/tailing_Zeroes.cpp | ayushid549/DSA_Marathon | 504c7cd7d153da10bbab3273c38d3368b72f946a | [
"MIT"
] | 11 | 2021-09-13T15:27:48.000Z | 2021-10-05T21:56:02.000Z | Mathematics/Session_code/tailing_Zeroes.cpp | ayushid549/DSA_Marathon | 504c7cd7d153da10bbab3273c38d3368b72f946a | [
"MIT"
] | 22 | 2021-09-13T13:37:55.000Z | 2021-10-17T05:12:35.000Z | #include<bits/stdc++.h>
using namespace std;
#define loop(i,l,h) for(int i=l;i<h;i++)
#define endl "\n"
typedef long long int ll;
typedef long double ld;
inline void puneetMode() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
/* ***************************************************** */
int no_of_tailing_Zeroes(int n){
int res=0;
for(int i=5;i<=n;i*=5){
res+=n/i;
}
return res;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
puneetMode();
int t=0;
// cin>>t;t--;
do{
int n;cin>>n;
cout<<no_of_tailing_Zeroes(n)<<endl;
}while(t--);
return 0;
} | 17.333333 | 59 | 0.58284 | ayushid549 |
b2aa0a5efe592c7fe3da633070034b78745bbf8c | 517 | cpp | C++ | Codeforces/9A - Die Roll.cpp | naimulcsx/online-judge-solutions | 0b80f81bcfb05a7cfe7fc925304c70b19eff1d6f | [
"MIT"
] | null | null | null | Codeforces/9A - Die Roll.cpp | naimulcsx/online-judge-solutions | 0b80f81bcfb05a7cfe7fc925304c70b19eff1d6f | [
"MIT"
] | null | null | null | Codeforces/9A - Die Roll.cpp | naimulcsx/online-judge-solutions | 0b80f81bcfb05a7cfe7fc925304c70b19eff1d6f | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
int yakko_points, wakko_points, max_points, chances, total_outcomes = 6;
cin >> yakko_points >> wakko_points;
max_points = (yakko_points > wakko_points) ? yakko_points : wakko_points;
chances = 6 - max_points + 1;
for (int i = 6; i > 1; i--) {
if (total_outcomes % i == 0 && chances % i == 0) {
chances /= i;
total_outcomes /= i;
}
}
cout << chances << "/" << total_outcomes << endl;
} | 24.619048 | 77 | 0.564797 | naimulcsx |
b2ace2b2f410a658c1846bda7eca08585efa697b | 643 | cc | C++ | 100. Symmetric Tree/main.cc | corkiwang1122/LeetCode | 39b1680b58173e6ec23a475605c3450ce8f78a81 | [
"MIT"
] | 3,690 | 2015-01-03T03:40:23.000Z | 2022-03-31T08:10:19.000Z | 100. Symmetric Tree/main.cc | Windfall94/LeetCode | 1756256d7e619164076bbf358c8f7ca68cd8bd79 | [
"MIT"
] | 21 | 2015-01-25T16:39:43.000Z | 2021-02-26T05:28:22.000Z | 100. Symmetric Tree/main.cc | Windfall94/LeetCode | 1756256d7e619164076bbf358c8f7ca68cd8bd79 | [
"MIT"
] | 1,290 | 2015-01-09T01:28:20.000Z | 2022-03-28T12:20:39.000Z | #include "solution.h"
#include <iostream>
#include <vector>
using vecIter = std::vector<int>::iterator;
TreeNode *createBinaryTree(vecIter beg, vecIter end)
{
std::vector<TreeNode *> vec;
for (vecIter it = beg; it != end; ++it)
vec.push_back(new TreeNode(*it));
for (int i = 0, pos = 0; pos != vec.size()-1; ++i)
{
vec[i]->left = vec[++pos];
vec[i]->right = vec[++pos];
}
return *vec.begin();
}
int main()
{
std::vector<int> vec{1,2,2,3,4,4,3,5,6,7,8,8,7,6,5};
Solution s;
std::cout << s.isSymmetric(createBinaryTree(vec.begin(), vec.end())) << std::endl;
return 0;
}
| 20.741935 | 86 | 0.564541 | corkiwang1122 |
b2ae6ab5dd9bc19ba025fc35c3aa0e3f9cf1c071 | 25,170 | hpp | C++ | Base/include/Framework/Math/Matrix.hpp | BlockProject3D/Framework | 1c27ef19d9a12d158a2b53f6bd28dd2d8e678912 | [
"BSD-3-Clause"
] | 2 | 2019-02-02T20:48:17.000Z | 2019-02-22T09:59:40.000Z | Base/include/Framework/Math/Matrix.hpp | BlockProject3D/Framework | 1c27ef19d9a12d158a2b53f6bd28dd2d8e678912 | [
"BSD-3-Clause"
] | 125 | 2020-01-14T18:26:38.000Z | 2021-02-23T15:33:55.000Z | Base/include/Framework/Math/Matrix.hpp | BlockProject3D/Framework | 1c27ef19d9a12d158a2b53f6bd28dd2d8e678912 | [
"BSD-3-Clause"
] | 1 | 2020-05-26T08:55:10.000Z | 2020-05-26T08:55:10.000Z | // Copyright (c) 2020, BlockProject 3D
//
// 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 BlockProject 3D 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.
#pragma once
#include "Framework/IndexException.hpp"
#include "Framework/Math/Vector.hpp"
#include "Framework/Types.hpp"
#include <cstring>
#include <initializer_list>
namespace bpf
{
namespace math
{
/**
* Static matrix class. Memory layout is based on rows
* @tparam T the number type
* @tparam N the number of rows
* @tparam M the number of columns
*/
template <typename T, fsize N = 0, fsize M = 0>
class BP_TPL_API Matrix
{
private:
T _arr[N * M];
public:
/**
* Constructs an empty matrix
*/
inline Matrix()
{
for (fsize i = 0; i != N * M; ++i)
_arr[i] = T();
}
/**
* Constructs a matrix from a single value
* @param val the value to initialize all cells
*/
explicit inline Matrix(const T val)
{
for (fsize i = 0; i != N * M; ++i)
_arr[i] = val;
}
/**
* Constructs a matrix from an initializer list
* @param lst the list to copy values from
*/
inline Matrix(const std::initializer_list<T> &lst)
{
fsize i = 0;
for (auto &elem : lst)
{
if (i >= N * M)
break;
_arr[i++] = elem;
}
}
/**
* Copy constructor
*/
inline Matrix(const Matrix<T, N, M> &other)
{
for (fsize i = 0; i != N * M; ++i)
_arr[i] = other._arr[i];
}
/**
* Move constructor
*/
inline Matrix(Matrix<T, N, M> &&other) noexcept
{
for (fsize i = 0; i != N * M; ++i)
_arr[i] = std::move(other._arr[i]);
}
/**
* Copy assignment operator
*/
inline Matrix<T, N, M> &operator=(const Matrix<T, N, M> &other)
{
if (this == &other)
return (*this);
for (fsize i = 0; i != N * M; ++i)
_arr[i] = other._arr[i];
return (*this);
}
/**
* Move assignment operator
*/
inline Matrix<T, N, M> &operator=(Matrix<T, N, M> &&other) noexcept
{
for (fsize i = 0; i != N * M; ++i)
_arr[i] = std::move(other._arr[i]);
return (*this);
}
/**
* Obtains the value of a cell for modification
* @param l the row number
* @param c the column number
* @return mutable cell value
*/
inline T &operator()(const fsize l, const fsize c)
{
if (l >= N || c >= M)
throw IndexException((fisize)(l * M + c));
return (_arr[l * M + c]);
}
/**
* Obtains the value of a cell for reading
* @param l the row number
* @param c the column number
* @return immutable cell value
*/
inline T operator()(const fsize l, const fsize c) const
{
if (l >= N || c >= M)
throw IndexException((fisize)(l * M + c));
return (_arr[l * M + c]);
}
/**
* Returns a low-level C array, used to transfer to lower-level APIs
* @return immutable low-level C array
*/
inline const T *operator*() const noexcept
{
return (_arr);
}
/**
* Returns a low-level C array, used to transfer to lower-level APIs
* @return mutable low-level C array
*/
inline T *operator*() noexcept
{
return (_arr);
}
/**
* Compare two matrices
* @param other matrix to compare with
* @return true if the two matrices are equal, false otherwise
*/
bool operator==(const Matrix<T, N, M> &other) const;
/**
* Compare two matrices
* @param other matrix to compare with
* @return true if the two matrices are not equal, false otherwise
*/
inline bool operator!=(const Matrix<T, N, M> &other) const
{
return (!operator==(other));
}
/**
* Performs matrix-matrix multiplication
* @tparam P number of columns of the other matrix
* @param other operand
* @return new matrix
*/
template <fsize P>
Matrix<T, N, P> operator*(const Matrix<T, M, P> &other) const;
/**
* Performs matrix addition
* @param other operand
* @return new matrix
*/
Matrix<T, N, M> operator+(const Matrix<T, N, M> &other) const;
/**
* Performs matrix-vector multiplication
* @param other operand
* @return new vector
*/
Vector<T, N> operator*(const Vector<T, N> &other) const;
/**
* Performs matrix-scalar multiplication
* @param other operand
* @return new matrix
*/
Matrix<T, N, M> operator*(const T &other) const;
/**
* Computes the transpose
* @return new matrix transpose of this
*/
Matrix<T, M, N> Transpose() const;
/**
* Swaps two rows of this matrix
* @param rowa first row number
* @param rowb second row number
*/
void SwapRows(fsize rowa, fsize rowb);
/**
* Swaps two columns of this matrix
* @param cola first column number
* @param colb second column number
*/
void SwapColumns(fsize cola, fsize colb);
/**
* Zero-matrix constant
*/
static const Matrix Zero;
template <typename TT, fsize P, fsize Q>
friend class Matrix;
};
/**
* Static square matrix class. Memory layout is based on rows
* @tparam T the number type
* @tparam N order of matrix
*/
template <typename T, fsize N>
class BP_TPL_API Matrix<T, N, N>
{
private:
T _arr[N * N];
static Matrix<T, N, N> GenIdentity() noexcept;
public:
/**
* Constructs an empty matrix
*/
inline Matrix()
{
for (fsize i = 0; i != N * N; ++i)
_arr[i] = T();
}
/**
* Constructs a matrix from a single value
* @param val the value to initialize all cells
*/
explicit inline Matrix(const T val)
{
for (fsize i = 0; i != N * N; ++i)
_arr[i] = val;
}
/**
* Constructs a matrix from an initializer list
* @param lst the list to copy values from
*/
inline Matrix(const std::initializer_list<T> &lst)
{
fsize i = 0;
for (auto &elem : lst)
{
if (i >= N * N)
break;
_arr[i++] = elem;
}
}
/**
* Copy constructor
*/
inline Matrix(const Matrix<T, N, N> &other)
{
for (fsize i = 0; i != N * N; ++i)
_arr[i] = other._arr[i];
}
/**
* Move constructor
*/
inline Matrix(Matrix<T, N, N> &&other) noexcept
{
for (fsize i = 0; i != N * N; ++i)
_arr[i] = std::move(other._arr[i]);
}
/**
* Returns the order of this matrix
* @return unsigned constant
*/
inline constexpr fsize Order() const noexcept
{
return (N);
}
/**
* Copy assignment operator
*/
inline Matrix<T, N, N> &operator=(const Matrix<T, N, N> &other)
{
if (this == &other)
return (*this);
for (fsize i = 0; i != N * N; ++i)
_arr[i] = other._arr[i];
return (*this);
}
/**
* Move assignment operator
*/
inline Matrix<T, N, N> &operator=(Matrix<T, N, N> &&other) noexcept
{
for (fsize i = 0; i != N * N; ++i)
_arr[i] = std::move(other._arr[i]);
return (*this);
}
/**
* Obtains the value of a cell for modification
* @param l the row number
* @param c the column number
* @return mutable cell value
*/
inline T &operator()(const fsize l, const fsize c)
{
if (l >= N || c >= N)
throw IndexException((fisize)(l * N + c));
return (_arr[l * N + c]);
}
/**
* Obtains the value of a cell for reading
* @param l the row number
* @param c the column number
* @return immutable cell value
*/
inline T operator()(const fsize l, const fsize c) const
{
if (l >= N || c >= N)
throw IndexException((fisize)(l * N + c));
return (_arr[l * N + c]);
}
/**
* Returns a low-level C array, used to transfer to lower-level APIs
* @return immutable low-level C array
*/
inline const T *operator*() const noexcept
{
return (_arr);
}
/**
* Returns a low-level C array, used to transfer to lower-level APIs
* @return mutable low-level C array
*/
inline T *operator*() noexcept
{
return (_arr);
}
/**
* Computes the inverse of this matrix
* @throw NonInvertibleMatrixException if the matrix is not invertible (ie determinant is null)
* @return new inversed matrix
*/
Matrix<T, N, N> Inverse() const;
/**
* Computes the determinant of this matrix
* @return number
*/
T GetDeterminant() const;
/**
* Computes a minor matrix. Used mainly for matrix inversion
* @tparam P order of the target minor matrix
* @param dest the destination minor matrix
* @param row the start row
* @param col the start column
*/
template <fsize P>
void GetMinor(Matrix<T, P, P> &dest, fsize row, fsize col) const;
/**
* Compare two matrices
* @param other matrix to compare with
* @return true if the two matrices are equal, false otherwise
*/
bool operator==(const Matrix<T, N, N> &other) const;
/**
* Compare two matrices
* @param other matrix to compare with
* @return true if the two matrices are not equal, false otherwise
*/
inline bool operator!=(const Matrix<T, N, N> &other) const
{
return (!operator==(other));
}
/**
* Performs matrix-matrix multiplication
* @tparam P number of columns of the other matrix
* @param other operand
* @return new matrix
*/
template <fsize P>
Matrix<T, N, P> operator*(const Matrix<T, N, P> &other) const;
/**
* Performs matrix addition
* @param other operand
* @return new matrix
*/
Matrix<T, N, N> operator+(const Matrix<T, N, N> &other) const;
/**
* Performs matrix-scalar multiplication
* @param other operand
* @return new matrix
*/
Matrix<T, N, N> operator*(const T &other) const;
/**
* Performs matrix-vector multiplication
* @param other operand
* @return new vector
*/
Vector<T, N> operator*(const Vector<T, N> &other) const;
/**
* Computes the transpose
* @return new matrix transpose of this
*/
Matrix<T, N, N> Transpose() const;
/**
* Swaps two rows of this matrix
* @param rowa first row number
* @param rowb second row number
*/
void SwapRows(fsize rowa, fsize rowb);
/**
* Swaps two columns of this matrix
* @param cola first column number
* @param colb second column number
*/
void SwapColumns(fsize cola, fsize colb);
/**
* Zero-matrix constant
*/
static const Matrix Zero;
/**
* Identity matrix constant
*/
static const Matrix Identity;
template <typename TT, fsize P, fsize Q>
friend class Matrix;
};
template <typename T>
class BP_TPL_API Matrix<T, 1, 1>
{
private:
T _arr;
public:
inline Matrix()
: _arr(0)
{
}
inline Matrix(const std::initializer_list<T> &lst)
: _arr(*lst.begin())
{
}
explicit inline Matrix(const T val)
: _arr(val)
{
}
inline Matrix(const Matrix<T, 1, 1> &other)
: _arr(other._arr)
{
}
inline Matrix<T, 1, 1> &operator=(const Matrix<T, 1, 1> &other)
{
if (this == &other)
return (*this);
_arr = other._arr;
return (*this);
}
inline T &operator()(const fsize, const fsize)
{
return (_arr);
}
inline T operator()(const fsize, const fsize) const
{
return (_arr);
}
inline T GetDeterminant() const
{
return (_arr);
}
template <typename TT, fsize P, fsize Q>
friend class Matrix;
};
/**
* Dynamic matrix class. Memory layout is based on rows
* @tparam T the number type
* @tparam N order of matrix
*/
template <typename T>
class BP_TPL_API Matrix<T, 0, 0>
{
private:
T *_arr;
fsize _n;
fsize _m;
public:
/**
* Generates an identity matrix
* @param n order of the matrix
* @return new matrix
*/
static Matrix Identity(fsize n);
/**
* Generates an zero matrix
* @param n number of rows
* @param m number of columns
* @return new matrix
*/
static Matrix Zero(fsize n, fsize m = 0);
/**
* Constructs an empty matrix
* @param n number of rows
* @param m number of columns
*/
Matrix(fsize n, fsize m);
/**
* Constructs a matrix from an initializer list
* @param n number of rows
* @param m number of columns
* @param lst the list to copy values from
*/
Matrix(fsize n, fsize m, const std::initializer_list<T> &lst);
/**
* Constructs a matrix from a single value
* @param n number of rows
* @param m number of columns
* @param val the value to initialize all cells
*/
Matrix(fsize n, fsize m, T val);
/**
* Copy constructor
*/
Matrix(const Matrix<T> &other);
/**
* Move constructor
*/
Matrix(Matrix<T> &&other) noexcept;
~Matrix();
/**
* Copy assignment operator
*/
Matrix<T> &operator=(const Matrix<T> &other);
/**
* Move assignment operator
*/
Matrix<T> &operator=(Matrix<T> &&other) noexcept;
/**
* Returns the number of rows
* @return unsigned
*/
fsize Rows() const noexcept
{
return (_n);
}
/**
* Returns the number of columns
* @return unsigned
*/
fsize Columns() const noexcept
{
return (_m);
}
/**
* Obtains the value of a cell for modification
* @param l the row number
* @param c the column number
* @throw IndexException if out of bounds
* @return mutable cell value
*/
inline T &operator()(const fsize l, const fsize c)
{
if (l >= _n || c >= _m)
throw IndexException((fisize)(l * _m + c));
return (_arr[l * _m + c]);
}
/**
* Obtains the value of a cell for reading
* @param l the row number
* @param c the column number
* @throw IndexException if out of bounds
* @return immutable cell value
*/
inline T operator()(const fsize l, const fsize c) const
{
if (l >= _n || c >= _m)
throw IndexException((fisize)(l * _m + c));
return (_arr[l * _m + c]);
}
/**
* Returns a low-level C array, used to transfer to lower-level APIs
* @return immutable low-level C array
*/
inline const T *operator*() const noexcept
{
return (_arr);
}
/**
* Returns a low-level C array, used to transfer to lower-level APIs
* @return mutable low-level C array
*/
inline T *operator*() noexcept
{
return (_arr);
}
/**
* Computes the inverse of this matrix
* @throw NonInvertibleMatrixException if the matrix is not invertible (ie determinant is null)
* @throw NonSquareMatrixException if the matrix is not a square matrix
* @return new inversed matrix
*/
Matrix<T> Inverse() const;
/**
* Computes the determinant of this matrix
* @throw NonSquareMatrixException if the matrix is not a square matrix
* @return number
*/
T GetDeterminant() const;
/**
* Computes a minor matrix. Used mainly for matrix inversion
* @param dest the destination minor matrix
* @param row the start row
* @param col the start column
* @throw NonSquareMatrixException if the matrix is not a square matrix
*/
void GetMinor(Matrix<T> &dest, fsize row, fsize col) const;
/**
* Compare two matrices
* @param other matrix to compare with
* @return true if the two matrices are equal, false otherwise
*/
bool operator==(const Matrix<T> &other) const;
/**
* Compare two matrices
* @param other matrix to compare with
* @return true if the two matrices are not equal, false otherwise
*/
inline bool operator!=(const Matrix<T> &other) const
{
return (!operator==(other));
}
/**
* Performs matrix-matrix multiplication
* @param other operand
* @throw IncompatibleMatrixSizeException when the matrices have incompatible size
* @return new matrix
*/
Matrix<T> operator*(const Matrix<T> &other) const;
/**
* Performs matrix addition
* @param other operand
* @throw IncompatibleMatrixSizeException when the matrices have incompatible size
* @return new matrix
*/
Matrix<T> operator+(const Matrix<T> &other) const;
/**
* Performs matrix-vector multiplication
* @param other operand
* @throw IncompatibleMatrixSizeException when the matrices have incompatible size
* @return new vector
*/
Vector<T> operator*(const Vector<T> &other) const;
/**
* Performs matrix-scalar multiplication
* @param other operand
* @return new matrix
*/
Matrix<T> operator*(const T &other) const;
/**
* Computes the transpose
* @return new matrix transpose of this
*/
Matrix<T> Transpose() const;
/**
* Swaps two rows of this matrix
* @param rowa first row number
* @param rowb second row number
*/
void SwapRows(fsize rowa, fsize rowb);
/**
* Swaps two columns of this matrix
* @param cola first column number
* @param colb second column number
*/
void SwapColumns(fsize cola, fsize colb);
};
template <typename T, fsize N, fsize M>
const Matrix<T, N, M> Matrix<T, N, M>::Zero = Matrix<T, N, M>((T)0);
template <typename T, fsize N>
const Matrix<T, N, N> Matrix<T, N, N>::Identity = Matrix<T, N, N>::GenIdentity();
}
}
#include "Framework/Math/Matrix.impl.hpp"
namespace bpf
{
namespace math
{
template <typename T>
using Matrix2 = Matrix<T, 2, 2>;
template <typename T>
using Matrix3 = Matrix<T, 3, 3>;
template <typename T>
using Matrix4 = Matrix<T, 4, 4>;
using Matrix2f = Matrix2<float>;
using Matrix3f = Matrix3<float>;
using Matrix4f = Matrix4<float>;
}
}
| 31.30597 | 107 | 0.457449 | BlockProject3D |
b2b21417126c8a6d7c7d300a384a15f98a4a0f14 | 7,582 | cpp | C++ | src/PRPParticleSequence.cpp | schmittsfn/primary_particle | 141662802fd4ec11fbb85bf05b1185cbad0c931d | [
"MIT"
] | 3 | 2021-07-09T09:45:08.000Z | 2021-08-21T19:39:09.000Z | src/PRPParticleSequence.cpp | schmittsfn/primary_particle | 141662802fd4ec11fbb85bf05b1185cbad0c931d | [
"MIT"
] | null | null | null | src/PRPParticleSequence.cpp | schmittsfn/primary_particle | 141662802fd4ec11fbb85bf05b1185cbad0c931d | [
"MIT"
] | null | null | null | //
// PRPParticleSequence.cpp
// primaryp
//
// Created by Stefan Schmitt on 5/20/14.
//
//
#include "PRPParticleSequence.h"
#include "PRPParticleSequenceInterval.h"
#include "PRPAppDelegate.h"
#include "PRPRandomGenerator.h"
USING_NS_CC;
USING_NS_PRP;
static unsigned long s_sequenceId = 0;
/**
* Returns the type mask that will be applied to the interval to change its particle type
* The mask will be applied to all intervals of the sequence,
* thus the shuffled types are constant across all intervals of the sequence
* @note Only the type FOR_PADDLE_A is random, the others are anti-clockwise from it
*/
inline ParticleSequenceInterval::ParticleTypeMask getTypeMask()
{
const int rawA = static_cast<int>(Particle_t::FOR_PADDLE_A);
const int rawB = static_cast<int>(Particle_t::FOR_PADDLE_B);
const int rawC = static_cast<int>(Particle_t::FOR_PADDLE_C);
std::vector<int> vI {rawA, rawB, rawC};
RANDOMGENERATOR()->shuffleIntegers(vI);
const Particle_t randomA = static_cast<Particle_t>(vI.at(0));
const Paddle_t randomAPaddle = PaddleForParticle(randomA);
const Paddle_t typeBPaddle = GetNextPaddleAntiClockWiseAfter(randomAPaddle);
const Paddle_t typeCPaddle = GetNextPaddleAntiClockWiseAfter(typeBPaddle);
const Particle_t typeB = ParticleForPaddle(typeBPaddle);
const Particle_t typeC = ParticleForPaddle(typeCPaddle);
return [=](const Particle_t p) -> Particle_t {
switch (p) {
case Particle_t::FOR_PADDLE_A:
return randomA;
case Particle_t::FOR_PADDLE_B:
return typeB;
case Particle_t::FOR_PADDLE_C:
return typeC;
case Particle_t::NONE:
case Particle_t::SPECIAL:
case Particle_t::ANTIMATTER:
default:
return p;
}
};
}
inline ParticleSequenceInterval::AngleMask getAngleMask()
{
const float randf = RANDOMFLOATBETWEEN(0.f, 360.f);
return [=](const float f) -> float {
float newVal = f+randf;
if (newVal > 360.f) {
newVal -= 360.f;
}
return newVal;
};
}
#pragma mark - ParticleSequence
ParticleSequence::ParticleSequence()
: _sequenceId(s_sequenceId++)
, _name("")
, _difficulty(Difficulty_t::VERY_EASY)
, _description("")
, _intervals()
{
}
ParticleSequence::~ParticleSequence()
{
}
ParticleSequence* ParticleSequence::createWithNameAndMap(const std::string& name, const ValueMap& map)
{
ParticleSequence *pRet = new ParticleSequence();
if (pRet && pRet->initWithNameAndMap(name, map))
{
pRet->autorelease();
return pRet;
}
else
{
delete pRet;
pRet = NULL;
return NULL;
}
}
ParticleSequence* ParticleSequence::createRandomForDifficulty(const Difficulty_t d)
{
std::string name = ""; //stringWithFormat("random #%i", RANDOMINT());
ParticleSequence *pRet = new ParticleSequence();
if (!pRet) {
delete pRet;
pRet = NULL;
return NULL;
}
Vector<ParticleSequenceInterval*> vec;
for (int i = 0; i<10; ++i)
{
vec.pushBack(ParticleSequenceInterval::createRandomForDifficulty(pRet->getSequenceID(), d));
}
if (pRet->init(d, name, "randomly generated", vec))
{
pRet->autorelease();
return pRet;
}
else
{
delete pRet;
pRet = NULL;
return NULL;
}
}
bool ParticleSequence::initWithNameAndMap(const std::string& name, const ValueMap& map)
{
_name = std::string(name);
parseValueMap(map);
return true;
}
bool ParticleSequence::init(const Difficulty_t d,
const std::string& name,
const std::string& description,
const cocos2d::Vector<ParticleSequenceInterval*>& intervals)
{
_difficulty = d;
_name = std::string(name);
_description = std::string(description);
_intervals = cocos2d::Vector<ParticleSequenceInterval*>(intervals);
return true;
}
void ParticleSequence::parseValueMap(const cocos2d::ValueMap& map)
{
for (auto it = map.begin(); it != map.end(); ++it)
{
auto value = (*it);
auto key = std::string(value.first);
stringToLowerCase(key);
auto object = value.second;
if (stringCompare(key, "difficulty")) {
_difficulty = DifficultyForString(object.asString());
}
else if (stringCompare(key, "description")) {
_description = object.asString();
}
else if (stringCompare(key, "sequence")) {
fillIntervalsVector(object.asValueVector());
}
else {
CCLOGERROR("unknown key %s", key.c_str());
}
}
}
void ParticleSequence::randomize()
{
ParticleSequenceInterval::ParticleTypeMask typeMask = getTypeMask();
ParticleSequenceInterval::AngleMask angleMask = getAngleMask();
for (auto it = _intervals.begin(); it != _intervals.end(); ++it)
{
auto interval = (*it);
interval->applyTypeMask(typeMask);
interval->applyAngleMask(angleMask);
}
}
ParticleSequence* ParticleSequence::clone() const
{
auto a = new ParticleSequence();
if (a) {
const unsigned long seqId = a->getSequenceID();
cocos2d::Vector<ParticleSequenceInterval*> array;
for (auto it = _intervals.begin(); it != _intervals.end();++it)
{
auto interval = (*it);
auto copiedInterval = ParticleSequenceInterval::create(seqId, *interval);
array.pushBack(copiedInterval);
}
a->init(this->_difficulty, this->_name, this->_description, array);
a->autorelease();
return a;
}
else
{
delete a;
a = NULL;
return NULL;
}
}
void ParticleSequence::fillIntervalsVector(const cocos2d::ValueVector& vector)
{
ParticleSequenceInterval::ParticleTypeMask typeMask = getTypeMask();
ParticleSequenceInterval::AngleMask angleMask = getAngleMask();
for (auto it = vector.begin(); it != vector.end(); ++it)
{
auto value = (*it);
auto interval = ParticleSequenceInterval::createWithValueMap(_sequenceId, value.asValueMap());
_intervals.pushBack(interval);
}
}
#pragma mark - ParticleSequenceVectorMapWrapper
ParticleSequenceVectorMapWrapper::~ParticleSequenceVectorMapWrapper()
{
for (auto it = map.begin(); it != map.end(); ++it)
{
auto pair = (*it);
auto vector = pair.second;
CC_SAFE_DELETE(vector);
}
}
ParticleSequenceVectorMapWrapper* ParticleSequenceVectorMapWrapper::createWithKeys(const unsigned int argCount, const int key1, ...)
{
va_list params;
va_start(params, key1);
ParticleSequenceVectorMapWrapper *pRet = new ParticleSequenceVectorMapWrapper();
if (pRet && pRet->initWithKeys(argCount, key1, params))
{
pRet->autorelease();
va_end(params);
return pRet;
}
else
{
delete pRet;
pRet = NULL;
va_end(params);
return NULL;
}
}
bool ParticleSequenceVectorMapWrapper::initWithKeys(const unsigned int argCount, const int key1, va_list args)
{
map.insert({key1, new cocos2d::Vector<ParticleSequence*>()});
for (int i=0; i<argCount-1; ++i)
{
int key = va_arg(args, int);
map.insert({key, new cocos2d::Vector<ParticleSequence*>()});
}
return true;
}
| 27.078571 | 132 | 0.625561 | schmittsfn |
b2b215e251cfb04c01c65aa8a7bcfb02f19f29da | 779 | cpp | C++ | solutions-PAT/B1045.cpp | Ki-Seki/solutions | e4329712d664180d850e0a48d7d0f637215f13d0 | [
"MIT"
] | 1 | 2022-02-26T10:33:24.000Z | 2022-02-26T10:33:24.000Z | solutions-PAT/B1045.cpp | Ki-Seki/solutions | e4329712d664180d850e0a48d7d0f637215f13d0 | [
"MIT"
] | null | null | null | solutions-PAT/B1045.cpp | Ki-Seki/solutions | e4329712d664180d850e0a48d7d0f637215f13d0 | [
"MIT"
] | 1 | 2021-12-01T14:54:33.000Z | 2021-12-01T14:54:33.000Z | /*
* hint:
* 测试点 2：考察当没有一个数字满足情况时的处理：应当输出一个换行
*/
#include <iostream>
#include <algorithm>
#define MAXN 100005
using namespace std;
int arr[MAXN], ans[MAXN], left_max[MAXN], right_min[MAXN] = {INT32_MAX};
int main()
{
int n, cnt = 0;
scanf("%d", &n);
left_max[0] = -1;
for (int i = 1; i <= n; i++)
{
scanf("%d", &arr[i]);
left_max[i] = max(left_max[i - 1], arr[i]);
}
right_min[n + 1] = INT32_MAX;
for (int i = n; i >= 1; i--)
{
right_min[i] = min(arr[i], right_min[i + 1]);
if (left_max[i] <= arr[i] && arr[i] <= right_min[i])
ans[cnt++] = arr[i];
}
printf("%d\n", cnt);
for (int i = cnt - 1; i >= 0; i--)
printf((i ? "%d " : "%d"), ans[i]);
printf("\n");
return 0;
} | 22.911765 | 72 | 0.483954 | Ki-Seki |
b2b4d9a624e50cfc7c15ff2e1f2e6c59ff2ebf1a | 469 | hxx | C++ | src/engine/Transform.hxx | broken-bytes/Cyanite | 0392e3114c946e41b7352afd4b8eceb6f03939da | [
"MIT"
] | 1 | 2021-11-11T02:56:56.000Z | 2021-11-11T02:56:56.000Z | src/engine/Transform.hxx | broken-bytes/Cyanite | 0392e3114c946e41b7352afd4b8eceb6f03939da | [
"MIT"
] | null | null | null | src/engine/Transform.hxx | broken-bytes/Cyanite | 0392e3114c946e41b7352afd4b8eceb6f03939da | [
"MIT"
] | null | null | null | #pragma once
#include "Component.hxx"
#include "Worlds/Quaternion.hxx"
#include "Worlds/Vector3D.hxx"
namespace BrokenBytes::Cyanite::Engine {
#pragma pack(push, 1)
struct Transform: Component {
Transform(): Transform({0,0,0}, {0,0,0,0}) {
}
Transform(World::Vector3D pos, World::Quaternion rot):Component(typeid(Transform).name()) {
position = pos;
rotation = rot;
}
World::Vector3D position;
World::Quaternion rotation;
};
#pragma pack(pop)
}
| 20.391304 | 93 | 0.695096 | broken-bytes |
b2b5d44a3d4d3f99b0a5138025622432d02a7c46 | 482 | hpp | C++ | parse/jsd_check.hpp | 5cript/SimpleJSON | 878a6341baed91c29630447f6bd480391f563045 | [
"MIT"
] | 4 | 2015-06-25T02:06:13.000Z | 2018-07-11T13:20:24.000Z | parse/jsd_check.hpp | 5cript/SimpleJSON | 878a6341baed91c29630447f6bd480391f563045 | [
"MIT"
] | 14 | 2015-03-29T10:32:21.000Z | 2018-01-25T16:45:08.000Z | parse/jsd_check.hpp | 5cript/SimpleJSON | 878a6341baed91c29630447f6bd480391f563045 | [
"MIT"
] | 2 | 2017-07-16T09:43:22.000Z | 2020-08-30T09:33:40.000Z | #pragma once
#include "jsd_core.hpp"
namespace JSON { namespace Internal {
template<typename T>
class can_parse
{
template<typename U>
static char check(...);
template<typename U>
static char (&check(decltype(parse(std::declval<U>(), std::declval<std::string const>(), std::declval<PropertyTree const>(), std::declval<ParsingOptions const>()))*))[2];
public:
static const bool value=sizeof(check<T>(0))==2;
};
}
}
| 24.1 | 178 | 0.618257 | 5cript |
b2b83a1d1d32bf0a1012ff763db9d61181085024 | 3,201 | cpp | C++ | Tests/read_write_lock.cpp | klassen-software-solutions/kssthread | 8b2929e596ae16a13d1d2d94b512e4884f3dbffb | [
"MIT"
] | null | null | null | Tests/read_write_lock.cpp | klassen-software-solutions/kssthread | 8b2929e596ae16a13d1d2d94b512e4884f3dbffb | [
"MIT"
] | 3 | 2019-01-28T17:40:43.000Z | 2019-12-26T14:52:20.000Z | Tests/read_write_lock.cpp | klassen-software-solutions/kssthread | 8b2929e596ae16a13d1d2d94b512e4884f3dbffb | [
"MIT"
] | null | null | null | //
// read_write_lock.cpp
// unittest
//
// Created by Steven W. Klassen on 2014-12-12.
// Copyright (c) 2014 Klassen Software Solutions. All rights reserved.
// Licensing follows the MIT License.
//
#include <cstdlib>
#include <cstring>
#include <memory>
#include <mutex>
#include <new>
#include <system_error>
#include <thread>
#include <kss/test/all.h>
#include <kss/thread/read_write_lock.hpp>
using namespace std;
using namespace kss::thread;
using namespace kss::test;
static TestSuite ts("read_write_lock", {
make_pair("Write lock blocks all", [] {
ReadWriteLock l;
bool hadLock1 = false;
bool hadLock2 = false;
auto& wl = l.writeLock();
auto& rl = l.readLock();
l.writeLock().lock();
thread t1 { [&]{
lock_guard<ReadWriteLock::ReadLock> lock(rl);
hadLock1 = true;
}};
thread t2 { [&]{
lock_guard<ReadWriteLock::WriteLock> lock(wl);
hadLock2 = true;
}};
KSS_ASSERT(!hadLock1 && !hadLock2);
wl.unlock();
t1.join();
t2.join();
KSS_ASSERT(hadLock1 && hadLock2);
}),
make_pair("Read lock blocks write", [] {
ReadWriteLock l;
bool hadLock1 = false;
bool hadLock2 = false;
auto& wl = l.writeLock();
auto& rl = l.readLock();
rl.lock();
thread t1 { [&]{
lock_guard<ReadWriteLock::ReadLock> lock(rl);
hadLock1 = true;
}};
thread t2 { [&]{
while (!hadLock1) { this_thread::yield(); } // Ensure thread1 gets the lock first.
lock_guard<ReadWriteLock::WriteLock> lock(wl);
hadLock2 = true;
}};
t1.join();
KSS_ASSERT(hadLock1 && !hadLock2);
rl.unlock();
t2.join();
KSS_ASSERT(hadLock1 && hadLock2);
}),
make_pair("Pending write lock blocks all", [] {
ReadWriteLock l;
bool hadLock1 = false;
bool hadLock2 = false;
bool releaseT1 = false;
auto& wl = l.writeLock();
auto& rl = l.readLock();
rl.lock();
thread t1 { [&]{
lock_guard<ReadWriteLock::WriteLock> lock(wl); // This should block until the read lock is released.
hadLock1 = true;
while (!releaseT1) { this_thread::yield(); } // Don't release the lock until we are told.
}};
thread t2 { [&]{
// Try to get t1 to lock first
while (!rl.try_lock()) { this_thread::yield(); }
rl.unlock();
this_thread::sleep_for(10ms);
// This should now block until t1 releases its lock.
lock_guard<ReadWriteLock::ReadLock> lock(rl);
hadLock2 = true;
}};
KSS_ASSERT(!hadLock1 && !hadLock2); // At this point both t1 and t2 should be blocked.
rl.unlock();
while (!hadLock1) { this_thread::yield(); }
KSS_ASSERT(hadLock1 && !hadLock2); // At this point t1 should have obtained its lock but t2 should still be blocked.
releaseT1 = true;
t1.join();
t2.join();
KSS_ASSERT(hadLock1 && hadLock2);
})
});
| 28.078947 | 129 | 0.552015 | klassen-software-solutions |
b2b97e5675fd1886d299b680cdb2d06a0dc49b51 | 5,593 | cpp | C++ | src/images-utilities.cpp | XHPlus/deep-activity-rec | bb9003390ee3f9a721e4d61deb1a9b3f3144b304 | [
"BSD-2-Clause"
] | 140 | 2016-04-07T14:26:36.000Z | 2022-03-21T17:32:03.000Z | src/images-utilities.cpp | XHPlus/deep-activity-rec | bb9003390ee3f9a721e4d61deb1a9b3f3144b304 | [
"BSD-2-Clause"
] | 26 | 2016-09-13T03:01:24.000Z | 2021-10-09T21:21:50.000Z | src/images-utilities.cpp | XHPlus/deep-activity-rec | bb9003390ee3f9a721e4d61deb1a9b3f3144b304 | [
"BSD-2-Clause"
] | 42 | 2016-08-24T19:42:08.000Z | 2022-03-15T14:50:10.000Z | #include "images-utilities.h"
#include <iostream>
using std::cout;
#include "opencv2/core/core.hpp"
#include "opencv2/highgui/highgui.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include "custom-images-macros.h"
#include "custom-macros.h"
namespace MostCV {
void ShowImage(Mat image, int wait, bool bShow, string stringWindowName) {
if (bShow) {
cv::namedWindow(stringWindowName.c_str(), 1);
cv::imshow(stringWindowName.c_str(), image);
cv::waitKey(wait);
}
}
void RemoveImagePixels(Mat img, Mat mask, bool is_mask_remove_pixel_black, Point shift) {
REPIMG2(y, x, mask)
{
if (mask.at<uchar> (y, x) == 0 && !is_mask_remove_pixel_black)
continue;
if (mask.at<uchar> (y, x) > 0 && is_mask_remove_pixel_black)
continue;
if (img.channels() == 3) {
for (int c = 0; c < 3; ++c)
img.at<cv::Vec3b> (y + shift.y, x + shift.x)[c] = 0;
} else
img.at<uchar> (y + shift.y, x + shift.x) = 0;
}
}
void FixMask(Mat mask, int threshold) {
int cnt = 0;
REPIMG2(y, x, mask)
{
if (mask.at<uchar> (y, x) >= threshold) {
if (mask.at<uchar> (y, x) != 255)
cnt++;
mask.at<uchar> (y, x) = 255;
} else {
if (mask.at<uchar> (y, x) != 0)
cnt++;
mask.at<uchar> (y, x) = 0;
}
}
//if(cnt) cout<<"FixMask: "<<cnt<<" pixels\n";
}
void Morphology(Mat mask, bool do_open, bool do_close, int open_kernel_sz, int close_kernel_sz) {
Mat open_element = cv::getStructuringElement(0, Size(open_kernel_sz, open_kernel_sz));
Mat close_element = cv::getStructuringElement(0, Size(close_kernel_sz, close_kernel_sz));
if (do_open)
cv::morphologyEx(mask, mask, cv::MORPH_OPEN, open_element);
if (do_close)
cv::morphologyEx(mask, mask, cv::MORPH_CLOSE, close_element);
}
bool AddButton(Mat controlsMat, string buttonName, vector<Rect> &rectsSoFar, Scalar color) {
int lastY = 0;
int lastX = 0;
Rect imgRect = Rect(0, 0, controlsMat.cols - 1, controlsMat.rows - 1);
if (rectsSoFar.size()) {
Rect r = rectsSoFar.back();
lastY = r.y + r.height + 5;
lastX = r.x;
}
Rect r(lastX, lastY, 100, 30);
if ((r & imgRect) != r) {
lastY = 0;
lastX = r.x + r.width + 5;
r = Rect(lastX, lastY, 100, 30);
if ((r & imgRect) != r)
return false;
}
cv::rectangle(controlsMat, r, Scalar(255, 255, 255), 2);
cv::putText(controlsMat, buttonName, Point(r.x + 2, r.y + r.height / 2), cv::FONT_HERSHEY_SIMPLEX, 0.5, color);
rectsSoFar.push_back(r);
return true;
}
vector<Ptr<CComponenets> > GetConnectedComponenets(Mat img, int area_threshold, int pixels_threshold, Scalar lo_diff, Scalar up_diff, int flags) {
assert(area_threshold > 0 && pixels_threshold > 0);
Mat uchar_img;
Rect img_rect(0, 0, img.cols - 1, img.rows - 1);
vector<Ptr<CComponenets> > componenets;
if (img.channels() > 1)
cvtColor(img, uchar_img, CV_BGR2GRAY);
else
img.copyTo(uchar_img);
REPIMG2(y, x, uchar_img)
{
int pixel_value = (int) uchar_img.at<uchar> (y, x);
if (pixel_value < 1)
continue;
Rect rect;
Mat mask = Mat::zeros(uchar_img.rows + 2, uchar_img.cols + 2, CV_8UC1);
int mask_pixels_cnt = floodFill(uchar_img, mask, Point(x, y), Scalar(0), &rect, lo_diff, up_diff, flags);
rect &= img_rect;
if (rect.area() >= area_threshold && mask_pixels_cnt >= pixels_threshold) {
Ptr<CComponenets> component = new CComponenets();
MostCV::FixMask(mask);
componenets.push_back(component);
component->mask = mask(Rect(1, 1, uchar_img.cols, uchar_img.rows));
component->mask_pixels_cnt = mask_pixels_cnt;
component->rect = rect;
component->flood_starting_point = Point(x, y);
component->parent_mask_topleft_point = Point(0, 0);
}
}
return componenets;
}
Rect GetInternalBlobRect(Mat mask)
{
assert(mask.type() == CV_8UC1);
vector<Ptr<MostCV::CComponenets> > comps = MostCV::GetConnectedComponenets(mask);
if(comps.size() == 0)
return Rect(0, 0, 1, 1);
Rect union_rect = comps[0]->rect;
REP(i, comps)
union_rect |= comps[i]->rect;
return union_rect;
}
vector<Point> GetCombinedContour(Mat mask) {
vector<vector<Point> > contours;
vector<cv::Vec4i> hierarchy;
Mat componentCpy;
mask.copyTo(componentCpy);
cv::findContours(componentCpy, contours, hierarchy, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);
vector<Point> contoursInOne;
REP(j, contours)
contoursInOne.insert(contoursInOne.end(), contours[j].begin(), contours[j].end());
return contoursInOne;
}
Rect GetRect(Mat img)
{
return Rect(0, 0, img.cols-1, img.rows-1);
}
void CenterRect(Rect &target_rect, int width, int height)
{
if(width > target_rect.width)
{
target_rect.x -= (width - target_rect.width)/2;
target_rect.width = width;
}
if(height > target_rect.height)
{
target_rect.y -= (height - target_rect.height)/2;
target_rect.height = height;
}
}
bool CmpRectTopLeft(const Rect &a, const Rect &b)
{
if(a.y != b.y)
return a.y < b.y;
return a.x < b.x;
}
void SaveVideo(vector<Mat> images, string path, int fps)
{
if(images.empty())
{
std::cerr<<"ERROR: Empty video\n";
return;
}
cv::VideoWriter videoObject;
videoObject.open(path, CV_FOURCC('X','V','I','D'), fps, Size(images[0].cols, images[0].rows), true);
if(!videoObject.isOpened())
{
std::cerr<<"ERROR: Problem in out video path: "<<path<<"\n";
assert(false);
}
for(auto img : images)
videoObject<<img;
}
}
| 24.107759 | 146 | 0.63347 | XHPlus |
b2b98dae3e7fa74a812bac35408d0a9ba9189be8 | 1,255 | hpp | C++ | include/h3api/H3Constants/H3CstResources.hpp | Patrulek/H3API | 91f10de37c6b86f3160706c1fdf4792f927e9952 | [
"MIT"
] | 14 | 2020-09-07T21:49:26.000Z | 2021-11-29T18:09:41.000Z | include/h3api/H3Constants/H3CstResources.hpp | Day-of-Reckoning/H3API | a82d3069ec7d5127b13528608d5350d2b80d57be | [
"MIT"
] | 2 | 2021-02-12T15:52:31.000Z | 2021-02-12T16:21:24.000Z | include/h3api/H3Constants/H3CstResources.hpp | Day-of-Reckoning/H3API | a82d3069ec7d5127b13528608d5350d2b80d57be | [
"MIT"
] | 8 | 2021-02-12T15:52:41.000Z | 2022-01-31T15:28:10.000Z | //////////////////////////////////////////////////////////////////////
// //
// Created by RoseKavalier: //
// rosekavalierhc@gmail.com //
// Created or last updated on: 2021-01-24 //
// ***You may use or distribute these files freely //
// so long as this notice remains present.*** //
// //
//////////////////////////////////////////////////////////////////////
#pragma once
#include "H3Types.hpp" /* integral typedefs */
#include "h3api/H3Base/H3Config.hpp" /* safe constexpr */
namespace h3
{
namespace NH3Resources
{
enum eResource : INT32
{
/* campaign */
WOOD_AND_ORE = -3,
ALL_SPECIAL = -2,
/* regular */
WOOD = 0,
MERCURY = 1,
ORE = 2,
SULFUR = 3,
CRYSTAL = 4,
GEMS = 5,
GOLD = 6,
};
} /* namespace NH3Resources */
typedef NH3Resources::eResource eResource;
} /* namespace h3 */
| 32.179487 | 70 | 0.341036 | Patrulek |
b2bb732975449b2a10e203d64726cd56e6d7695a | 110,828 | cpp | C++ | src/plugPikiKando/generator.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | 27 | 2021-09-28T00:33:11.000Z | 2021-11-18T19:38:40.000Z | src/plugPikiKando/generator.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | null | null | null | src/plugPikiKando/generator.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | null | null | null | #include "types.h"
/*
* --INFO--
* Address: ........
* Size: 00009C
*/
void _Error(char*, ...)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 0000F4
*/
void _Print(char*, ...)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000088
*/
void writeID(RandomAccessStream&, unsigned long)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000088
*/
void readID(RandomAccessStream&)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000004
*/
void printID(unsigned long)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000028
*/
void sprintID(char*, unsigned long)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DACB4
* Size: 000030
*/
GenBase::GenBase(unsigned long, char*, char*)
{
/*
.loc_0x0:
li r0, 0
lis r7, 0x802C
stw r0, 0x0(r3)
subi r0, r7, 0x542C
stw r0, 0x4(r3)
lis r7, 0x5F5F
addi r0, r7, 0x5F5F
stw r4, 0x8(r3)
stw r5, 0x10(r3)
stw r6, 0x14(r3)
stw r0, 0xC(r3)
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 00009C
*/
void GenBase::writeVersion(RandomAccessStream&)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DACE4
* Size: 00000C
*/
void GenBase::getLatestVersion()
{
/*
.loc_0x0:
lis r3, 0x7564
addi r3, r3, 0x6566
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 00016C
*/
void GenBase::write(RandomAccessStream&)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DACF0
* Size: 000020
*/
void GenBase::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x8(r1)
bl -0x7C210
lwz r0, 0xC(r1)
addi r1, r1, 0x8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DAD10
* Size: 000020
*/
void GenBase::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x8(r1)
bl -0x7C184
lwz r0, 0xC(r1)
addi r1, r1, 0x8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 00009C
*/
void GenBase::readVersion(RandomAccessStream&)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000110
*/
void GenBase::read(RandomAccessStream&)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DAD30
* Size: 000004
*/
void GenBase::doRead(RandomAccessStream&) { }
/*
* --INFO--
* Address: 800DAD34
* Size: 0000FC
*/
void makeObjectPiki()
{
/*
.loc_0x0:
mflr r0
li r3, 0x38
stw r0, 0x4(r1)
stwu r1, -0x38(r1)
stw r31, 0x34(r1)
stw r30, 0x30(r1)
stw r29, 0x2C(r1)
bl -0x93D4C
mr. r30, r3
beq- .loc_0xDC
li r31, 0
lis r3, 0x802C
stw r31, 0x0(r30)
subi r0, r3, 0x542C
lis r3, 0x7069
stw r0, 0x4(r30)
addi r0, r3, 0x6B69
lis r3, 0x802C
stw r0, 0x8(r30)
subi r0, r3, 0x59C4
lis r3, 0x802C
stw r0, 0x10(r30)
subi r0, r3, 0x59B8
lis r3, 0x5F5F
stw r0, 0x14(r30)
addi r0, r3, 0x5F5F
lis r3, 0x802C
stw r0, 0xC(r30)
subi r0, r3, 0x5490
lis r3, 0x802C
stw r0, 0x4(r30)
subi r0, r3, 0x565C
stw r0, 0x4(r30)
addi r5, r1, 0x14
addi r4, r30, 0
lwz r0, -0x3A70(r13)
addi r3, r30, 0x18
stw r0, 0x1C(r1)
lwz r0, 0x1C(r1)
stw r0, 0x14(r1)
bl -0x7C354
lis r3, 0x802A
addi r29, r3, 0x60C4
stw r29, 0x20(r30)
addi r5, r1, 0x10
addi r4, r30, 0
stw r31, 0x24(r30)
addi r3, r30, 0x28
lwz r0, -0x3A6C(r13)
stw r0, 0x24(r1)
lwz r0, 0x24(r1)
stw r0, 0x10(r1)
bl -0x7C384
stw r29, 0x30(r30)
stw r31, 0x34(r30)
.loc_0xDC:
mr r3, r30
lwz r0, 0x3C(r1)
lwz r31, 0x34(r1)
lwz r30, 0x30(r1)
lwz r29, 0x2C(r1)
addi r1, r1, 0x38
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 000070
*/
void GenObjectFactory::getProduct(unsigned long)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 0000E8
*/
void GenObjectFactory::createInstance()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DAE30
* Size: 000050
*/
void GenObject::getLatestVersion()
{
/*
.loc_0x0:
lwz r7, 0x3074(r13)
li r4, 0
lwz r3, 0x8(r3)
mr r5, r4
lwz r0, 0x0(r7)
cmpwi r0, 0
mtctr r0
blelr-
.loc_0x20:
lwz r6, 0x8(r7)
lwzx r0, r6, r5
cmplw r3, r0
bne- .loc_0x40
rlwinm r0,r4,4,0,27
add r3, r6, r0
lwz r3, 0xC(r3)
blr
.loc_0x40:
addi r5, r5, 0x10
addi r4, r4, 0x1
bdnz+ .loc_0x20
blr
*/
}
/*
* --INFO--
* Address: 800DAE80
* Size: 00017C
*/
void makeTypeOne()
{
/*
.loc_0x0:
mflr r0
li r3, 0x68
stw r0, 0x4(r1)
stwu r1, -0x68(r1)
stw r31, 0x64(r1)
stw r30, 0x60(r1)
stw r29, 0x5C(r1)
bl -0x93E98
mr. r30, r3
beq- .loc_0x15C
li r31, 0
lis r3, 0x802C
stw r31, 0x0(r30)
subi r0, r3, 0x542C
lis r3, 0x316F
stw r0, 0x4(r30)
addi r0, r3, 0x6E65
lis r3, 0x802C
stw r0, 0x8(r30)
subi r0, r3, 0x59AC
lis r3, 0x802C
stw r0, 0x10(r30)
subi r0, r3, 0x59A0
lis r3, 0x5F5F
stw r0, 0x14(r30)
addi r0, r3, 0x5F5F
lis r3, 0x802C
stw r0, 0xC(r30)
subi r0, r3, 0x54C8
stw r0, 0x4(r30)
addi r3, r1, 0x34
subi r4, r13, 0x3A68
bl -0x8A428
lwz r0, 0x34(r1)
addi r5, r1, 0x20
addi r4, r30, 0
stw r0, 0x20(r1)
addi r3, r30, 0x18
bl -0x7C498
lis r3, 0x802A
addi r29, r3, 0x60C4
stw r29, 0x20(r30)
addi r3, r1, 0x3C
subi r4, r13, 0x3A64
stw r31, 0x24(r30)
bl -0x8A45C
lwz r0, 0x3C(r1)
addi r5, r1, 0x1C
addi r4, r30, 0
stw r0, 0x1C(r1)
addi r3, r30, 0x28
bl -0x7C4CC
stw r29, 0x30(r30)
lis r3, 0x802C
subi r0, r3, 0x56E0
stw r31, 0x34(r30)
addi r5, r1, 0x2C
addi r4, r30, 0
stw r0, 0x4(r30)
addi r3, r30, 0x38
lwz r0, -0x3A70(r13)
stw r0, 0x44(r1)
lwz r0, 0x44(r1)
stw r0, 0x2C(r1)
bl -0x7C500
stw r29, 0x40(r30)
addi r5, r1, 0x28
addi r4, r30, 0
stw r31, 0x44(r30)
addi r3, r30, 0x48
lwz r0, -0x3A6C(r13)
stw r0, 0x4C(r1)
lwz r0, 0x4C(r1)
stw r0, 0x28(r1)
bl -0x7C528
stw r29, 0x50(r30)
addi r5, r1, 0x24
addi r4, r30, 0
stw r31, 0x54(r30)
addi r3, r30, 0x58
lwz r0, -0x3A60(r13)
stw r0, 0x54(r1)
lwz r0, 0x54(r1)
stw r0, 0x24(r1)
bl -0x7C550
stw r29, 0x60(r30)
stw r31, 0x64(r30)
.loc_0x15C:
mr r3, r30
lwz r0, 0x6C(r1)
lwz r31, 0x64(r1)
lwz r30, 0x60(r1)
lwz r29, 0x5C(r1)
addi r1, r1, 0x68
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DAFFC
* Size: 000130
*/
void makeTypeAtOnce()
{
/*
.loc_0x0:
mflr r0
li r3, 0x48
stw r0, 0x4(r1)
stwu r1, -0x48(r1)
stw r31, 0x44(r1)
stw r30, 0x40(r1)
stw r29, 0x3C(r1)
bl -0x94014
mr. r30, r3
beq- .loc_0x110
li r31, 0
lis r3, 0x802C
stw r31, 0x0(r30)
subi r0, r3, 0x542C
lis r3, 0x6174
stw r0, 0x4(r30)
addi r0, r3, 0x6F6E
lis r3, 0x802C
stw r0, 0x8(r30)
subi r0, r3, 0x59AC
lis r3, 0x802C
stw r0, 0x10(r30)
subi r0, r3, 0x5990
lis r3, 0x5F5F
stw r0, 0x14(r30)
addi r0, r3, 0x5F5F
lis r3, 0x802C
stw r0, 0xC(r30)
subi r0, r3, 0x54C8
stw r0, 0x4(r30)
addi r3, r1, 0x24
subi r4, r13, 0x3A68
bl -0x8A5A4
lwz r0, 0x24(r1)
addi r5, r1, 0x18
addi r4, r30, 0
stw r0, 0x18(r1)
addi r3, r30, 0x18
bl -0x7C614
lis r3, 0x802A
addi r29, r3, 0x60C4
stw r29, 0x20(r30)
addi r3, r1, 0x2C
subi r4, r13, 0x3A64
stw r31, 0x24(r30)
bl -0x8A5D8
lwz r0, 0x2C(r1)
addi r5, r1, 0x14
addi r4, r30, 0
stw r0, 0x14(r1)
addi r3, r30, 0x28
bl -0x7C648
stw r29, 0x30(r30)
lis r3, 0x802C
subi r0, r3, 0x5740
stw r31, 0x34(r30)
addi r5, r1, 0x1C
addi r4, r30, 0
stw r0, 0x4(r30)
addi r3, r30, 0x38
lwz r0, -0x3A70(r13)
stw r0, 0x34(r1)
lwz r0, 0x34(r1)
stw r0, 0x1C(r1)
bl -0x7C67C
stw r29, 0x40(r30)
li r0, 0x1
stw r0, 0x44(r30)
.loc_0x110:
mr r3, r30
lwz r0, 0x4C(r1)
lwz r31, 0x44(r1)
lwz r30, 0x40(r1)
lwz r29, 0x3C(r1)
addi r1, r1, 0x48
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB12C
* Size: 00015C
*/
void makeTypeInitRand()
{
/*
.loc_0x0:
mflr r0
li r3, 0x58
stw r0, 0x4(r1)
stwu r1, -0x58(r1)
stw r31, 0x54(r1)
stw r30, 0x50(r1)
stw r29, 0x4C(r1)
bl -0x94144
mr. r30, r3
beq- .loc_0x13C
li r31, 0
lis r3, 0x802C
stw r31, 0x0(r30)
subi r0, r3, 0x542C
lis r3, 0x6972
stw r0, 0x4(r30)
addi r0, r3, 0x6E64
lis r3, 0x802C
stw r0, 0x8(r30)
subi r0, r3, 0x59AC
lis r3, 0x802C
stw r0, 0x10(r30)
subi r0, r3, 0x597C
lis r3, 0x5F5F
stw r0, 0x14(r30)
addi r0, r3, 0x5F5F
lis r3, 0x802C
stw r0, 0xC(r30)
subi r0, r3, 0x54C8
stw r0, 0x4(r30)
addi r3, r1, 0x2C
subi r4, r13, 0x3A68
bl -0x8A6D4
lwz r0, 0x2C(r1)
addi r5, r1, 0x1C
addi r4, r30, 0
stw r0, 0x1C(r1)
addi r3, r30, 0x18
bl -0x7C744
lis r3, 0x802A
addi r29, r3, 0x60C4
stw r29, 0x20(r30)
addi r3, r1, 0x34
subi r4, r13, 0x3A64
stw r31, 0x24(r30)
bl -0x8A708
lwz r0, 0x34(r1)
addi r5, r1, 0x18
addi r4, r30, 0
stw r0, 0x18(r1)
addi r3, r30, 0x28
bl -0x7C778
stw r29, 0x30(r30)
lis r3, 0x802C
subi r0, r3, 0x57A4
stw r31, 0x34(r30)
addi r5, r1, 0x24
addi r4, r30, 0
stw r0, 0x4(r30)
addi r3, r30, 0x38
lwz r0, -0x3A70(r13)
stw r0, 0x3C(r1)
lwz r0, 0x3C(r1)
stw r0, 0x24(r1)
bl -0x7C7AC
stw r29, 0x40(r30)
li r0, 0x1
addi r5, r1, 0x20
stw r0, 0x44(r30)
mr r4, r30
addi r3, r30, 0x48
lwz r0, -0x3A6C(r13)
stw r0, 0x44(r1)
lwz r0, 0x44(r1)
stw r0, 0x20(r1)
bl -0x7C7D8
stw r29, 0x50(r30)
li r0, 0x5
stw r0, 0x54(r30)
.loc_0x13C:
mr r3, r30
lwz r0, 0x5C(r1)
lwz r31, 0x54(r1)
lwz r30, 0x50(r1)
lwz r29, 0x4C(r1)
addi r1, r1, 0x58
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 000070
*/
void GenTypeFactory::getProduct(unsigned long)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 0001FC
*/
void GenTypeFactory::createInstance()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DB288
* Size: 000050
*/
void GenType::getLatestVersion()
{
/*
.loc_0x0:
lwz r7, 0x3078(r13)
li r4, 0
lwz r3, 0x8(r3)
mr r5, r4
lwz r0, 0x0(r7)
cmpwi r0, 0
mtctr r0
blelr-
.loc_0x20:
lwz r6, 0x8(r7)
lwzx r0, r6, r5
cmplw r3, r0
bne- .loc_0x40
rlwinm r0,r4,4,0,27
add r3, r6, r0
lwz r3, 0xC(r3)
blr
.loc_0x40:
addi r5, r5, 0x10
addi r4, r4, 0x1
bdnz+ .loc_0x20
blr
*/
}
/*
* --INFO--
* Address: 800DB2D8
* Size: 00006C
*/
void GenType::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r0, 0x24(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x34(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB344
* Size: 00006C
*/
void GenType::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x20(r1)
stw r31, 0x1C(r1)
addi r31, r4, 0
stw r30, 0x18(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x24(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x34(r30)
lwz r0, 0x24(r1)
lwz r31, 0x1C(r1)
lwz r30, 0x18(r1)
addi r1, r1, 0x20
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB3B0
* Size: 0000C0
*/
void GenTypeOne::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r0, 0x24(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x34(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x44(r30)
lwz r12, 0x2C(r12)
extsh r4, r0
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x54(r30)
lwz r12, 0x2C(r12)
extsh r4, r0
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x64(r30)
lwz r12, 0x2C(r12)
extsh r4, r0
mtlr r12
blrl
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB470
* Size: 0000C0
*/
void GenTypeOne::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x30(r1)
stw r31, 0x2C(r1)
addi r31, r4, 0
stw r30, 0x28(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x24(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x34(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x44(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x54(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x64(r30)
lwz r0, 0x34(r1)
lwz r31, 0x2C(r1)
lwz r30, 0x28(r1)
addi r1, r1, 0x30
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB530
* Size: 000088
*/
void GenTypeAtOnce::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r0, 0x24(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x34(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x44(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB5B8
* Size: 000088
*/
void GenTypeAtOnce::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x28(r1)
stw r31, 0x24(r1)
addi r31, r4, 0
stw r30, 0x20(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x24(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x34(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x44(r30)
lwz r0, 0x2C(r1)
lwz r31, 0x24(r1)
lwz r30, 0x20(r1)
addi r1, r1, 0x28
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB640
* Size: 0000A4
*/
void GenTypeInitRand::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r0, 0x24(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x34(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x44(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x54(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB6E4
* Size: 0000A4
*/
void GenTypeInitRand::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x28(r1)
stw r31, 0x24(r1)
addi r31, r4, 0
stw r30, 0x20(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x24(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x34(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x44(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x54(r30)
lwz r0, 0x2C(r1)
lwz r31, 0x24(r1)
lwz r30, 0x20(r1)
addi r1, r1, 0x28
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB788
* Size: 00007C
*/
void GenArea::doWrite(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lfs f1, 0x18(r30)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0x1C(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0x20(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB804
* Size: 00007C
*/
void GenArea::doRead(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x18(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x1C(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x20(r30)
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB880
* Size: 0000D8
*/
void makeCircleArea()
{
/*
.loc_0x0:
mflr r0
li r3, 0x34
stw r0, 0x4(r1)
stwu r1, -0x20(r1)
stw r31, 0x1C(r1)
bl -0x94890
addi r31, r3, 0
mr. r4, r31
beq- .loc_0xC0
li r0, 0
lis r3, 0x802C
stw r0, 0x0(r31)
subi r0, r3, 0x542C
lis r3, 0x6369
stw r0, 0x4(r31)
addi r0, r3, 0x7263
lis r3, 0x802C
stw r0, 0x8(r31)
subi r0, r3, 0x5930
lis r3, 0x802C
stw r0, 0x10(r31)
subi r0, r3, 0x5924
lis r3, 0x5F5F
stw r0, 0x14(r31)
addi r0, r3, 0x5F5F
lis r3, 0x802C
stw r0, 0xC(r31)
subi r0, r3, 0x5538
stw r0, 0x4(r31)
lis r3, 0x802C
subi r0, r3, 0x5880
lfs f0, -0x6790(r2)
addi r5, r1, 0xC
addi r3, r4, 0x24
stfs f0, 0x20(r31)
stfs f0, 0x1C(r31)
stfs f0, 0x18(r31)
stw r0, 0x4(r31)
lwz r0, -0x3A70(r13)
stw r0, 0x14(r1)
lwz r0, 0x14(r1)
stw r0, 0xC(r1)
bl -0x7CEA8
lis r3, 0x802A
addi r0, r3, 0x6098
stw r0, 0x2C(r31)
lfs f0, -0x678C(r2)
stfs f0, 0x30(r31)
.loc_0xC0:
mr r3, r31
lwz r0, 0x24(r1)
lwz r31, 0x1C(r1)
addi r1, r1, 0x20
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DB958
* Size: 000098
*/
void makePointArea()
{
/*
.loc_0x0:
mflr r0
li r3, 0x24
stw r0, 0x4(r1)
stwu r1, -0x8(r1)
bl -0x94964
cmplwi r3, 0
beq- .loc_0x88
li r0, 0
lis r4, 0x802C
stw r0, 0x0(r3)
subi r0, r4, 0x542C
lis r4, 0x7069
stw r0, 0x4(r3)
addi r0, r4, 0x6E74
lis r4, 0x802C
stw r0, 0x8(r3)
subi r0, r4, 0x5930
lis r4, 0x802C
stw r0, 0x10(r3)
subi r0, r4, 0x5914
lis r4, 0x5F5F
stw r0, 0x14(r3)
addi r0, r4, 0x5F5F
lis r4, 0x802C
stw r0, 0xC(r3)
subi r0, r4, 0x5538
stw r0, 0x4(r3)
lis r4, 0x802C
subi r0, r4, 0x581C
lfs f0, -0x6790(r2)
stfs f0, 0x20(r3)
stfs f0, 0x1C(r3)
stfs f0, 0x18(r3)
stw r0, 0x4(r3)
.loc_0x88:
lwz r0, 0xC(r1)
addi r1, r1, 0x8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 000070
*/
void GenAreaFactory::getProduct(unsigned long)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 0001A4
*/
void GenAreaFactory::createInstance()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DB9F0
* Size: 000050
*/
void GenArea::getLatestVersion()
{
/*
.loc_0x0:
lwz r7, 0x307C(r13)
li r4, 0
lwz r3, 0x8(r3)
mr r5, r4
lwz r0, 0x0(r7)
cmpwi r0, 0
mtctr r0
blelr-
.loc_0x20:
lwz r6, 0x8(r7)
lwzx r0, r6, r5
cmplw r3, r0
bne- .loc_0x40
rlwinm r0,r4,4,0,27
add r3, r6, r0
lwz r3, 0xC(r3)
blr
.loc_0x40:
addi r5, r5, 0x10
addi r4, r4, 0x1
bdnz+ .loc_0x20
blr
*/
}
/*
* --INFO--
* Address: 800DBA40
* Size: 000040
*/
void GenAreaCircle::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
lfs f0, 0x30(r3)
mr r3, r4
lwz r12, 0x4(r4)
fctiwz f0, f0
lwz r12, 0x2C(r12)
stfd f0, 0x10(r1)
mtlr r12
lwz r4, 0x14(r1)
blrl
lwz r0, 0x1C(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DBA80
* Size: 000060
*/
void GenAreaCircle::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x28(r1)
stw r31, 0x24(r1)
addi r31, r3, 0
addi r3, r4, 0
lwz r12, 0x4(r4)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
lfd f1, -0x6788(r2)
xoris r0, r0, 0x8000
stw r0, 0x1C(r1)
lis r0, 0x4330
stw r0, 0x18(r1)
lfd f0, 0x18(r1)
fsubs f0, f0, f1
stfs f0, 0x30(r31)
lwz r0, 0x2C(r1)
lwz r31, 0x24(r1)
addi r1, r1, 0x28
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DBAE0
* Size: 000170
*/
Generator::Generator()
{
/*
.loc_0x0:
mflr r0
lis r4, 0x8022
stw r0, 0x4(r1)
addi r0, r4, 0x738C
subi r4, r13, 0x3A50
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r3, 0
lis r3, 0x8022
stw r30, 0x10(r1)
li r30, 0
stw r0, 0x0(r31)
addi r0, r3, 0x737C
addi r3, r31, 0
stw r0, 0x0(r31)
stw r30, 0x10(r31)
stw r30, 0xC(r31)
stw r30, 0x8(r31)
bl -0xB6C54
lis r3, 0x8023
subi r0, r3, 0x71E0
stw r0, 0x0(r31)
addi r3, r31, 0
subi r4, r13, 0x3A50
bl -0x9B404
lis r3, 0x802C
subi r0, r3, 0x5584
stw r0, 0x0(r31)
addi r3, r31, 0x58
bl -0x97CF8
addi r3, r31, 0x64
bl -0x97D00
lfs f0, -0x6790(r2)
lis r6, 0x7069
lis r3, 0x316F
stfs f0, 0xA0(r31)
lis r4, 0x2020
addi r7, r6, 0x6E74
stfs f0, 0x9C(r31)
addi r5, r3, 0x6E65
addi r0, r6, 0x6B69
stfs f0, 0x98(r31)
addi r3, r31, 0x58
addi r4, r4, 0x2020
stfs f0, 0xAC(r31)
stfs f0, 0xA8(r31)
stfs f0, 0xA4(r31)
stw r30, 0x20(r31)
stw r7, 0x24(r31)
stw r30, 0x28(r31)
stw r5, 0x2C(r31)
lfs f0, -0x3A5C(r13)
stfs f0, 0x98(r31)
lfs f0, -0x3A58(r13)
stfs f0, 0x9C(r31)
lfs f0, -0x3A54(r13)
stfs f0, 0xA0(r31)
stw r30, 0x30(r31)
stw r0, 0x34(r31)
stw r30, 0x74(r31)
bl -0x97D0C
lis r4, 0x7630
addi r3, r31, 0x64
addi r4, r4, 0x2E30
bl -0x97D1C
addi r3, r31, 0x38
subi r4, r13, 0x3A48
bl 0x13D76C
stw r30, 0x7C(r31)
lis r3, 0x803A
subi r6, r13, 0x3A40
stw r30, 0x78(r31)
li r5, 0x1
subi r4, r3, 0x2848
stw r30, 0x84(r31)
li r0, -0x1
addi r3, r31, 0
stw r30, 0x88(r31)
stw r30, 0x10(r31)
stw r30, 0xC(r31)
stw r30, 0x8(r31)
stw r6, 0x4(r31)
stb r5, 0xB0(r31)
lwz r4, 0x2FC(r4)
stw r4, 0x8C(r31)
stw r0, 0x94(r31)
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DBC50
* Size: 000154
*/
Generator::Generator(int)
{
/*
.loc_0x0:
mflr r0
lis r4, 0x8022
stw r0, 0x4(r1)
addi r0, r4, 0x738C
subi r4, r13, 0x3A50
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r3, 0
lis r3, 0x8022
stw r30, 0x10(r1)
li r30, 0
stw r0, 0x0(r31)
addi r0, r3, 0x737C
addi r3, r31, 0
stw r0, 0x0(r31)
stw r30, 0x10(r31)
stw r30, 0xC(r31)
stw r30, 0x8(r31)
bl -0xB6DC4
lis r3, 0x8023
subi r0, r3, 0x71E0
stw r0, 0x0(r31)
addi r3, r31, 0
subi r4, r13, 0x3A50
bl -0x9B574
lis r3, 0x802C
subi r0, r3, 0x5584
stw r0, 0x0(r31)
addi r3, r31, 0x58
bl -0x97E68
addi r3, r31, 0x64
bl -0x97E70
lfs f0, -0x6790(r2)
lis r6, 0x7069
lis r3, 0x316F
stfs f0, 0xA0(r31)
lis r4, 0x2020
addi r7, r6, 0x6E74
stfs f0, 0x9C(r31)
addi r5, r3, 0x6E65
addi r0, r6, 0x6B69
stfs f0, 0x98(r31)
addi r3, r31, 0x58
addi r4, r4, 0x2020
stfs f0, 0xAC(r31)
stfs f0, 0xA8(r31)
stfs f0, 0xA4(r31)
stw r30, 0x20(r31)
stw r7, 0x24(r31)
stw r30, 0x28(r31)
stw r5, 0x2C(r31)
lfs f0, -0x3A3C(r13)
stfs f0, 0x98(r31)
lfs f0, -0x3A38(r13)
stfs f0, 0x9C(r31)
lfs f0, -0x3A34(r13)
stfs f0, 0xA0(r31)
stw r30, 0x30(r31)
stw r0, 0x34(r31)
bl -0x97E78
lis r4, 0x7630
addi r3, r31, 0x64
addi r4, r4, 0x2E30
bl -0x97E88
addi r3, r31, 0x38
subi r4, r13, 0x3A48
bl 0x13D600
stw r30, 0x7C(r31)
subi r5, r13, 0x3A40
li r4, 0x1
stw r30, 0x78(r31)
li r0, -0x1
addi r3, r31, 0
stw r30, 0x10(r31)
stw r30, 0xC(r31)
stw r30, 0x8(r31)
stw r5, 0x4(r31)
stb r4, 0xB0(r31)
stw r0, 0x94(r31)
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 000054
*/
Generator::~Generator()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000058
*/
void Generator::updateUseList()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DBDA4
* Size: 000038
*/
void Generator::isExpired()
{
/*
.loc_0x0:
lwz r4, 0x94(r3)
cmpwi r4, -0x1
bne- .loc_0x14
li r3, 0
blr
.loc_0x14:
lis r3, 0x803A
subi r3, r3, 0x2848
lwz r0, 0x2FC(r3)
cmpw r4, r0
bge- .loc_0x30
li r3, 0x1
blr
.loc_0x30:
li r3, 0
blr
*/
}
/*
* --INFO--
* Address: 800DBDDC
* Size: 000104
*/
void Generator::loadCreature(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x50(r1)
stw r31, 0x4C(r1)
addi r31, r4, 0
stw r30, 0x48(r1)
mr r30, r3
lwz r0, 0x30(r3)
cmplwi r0, 0
beq- .loc_0xEC
lfs f0, -0x6790(r2)
stfs f0, 0x24(r1)
stfs f0, 0x20(r1)
stfs f0, 0x1C(r1)
stfs f0, 0x30(r1)
stfs f0, 0x2C(r1)
stfs f0, 0x28(r1)
stfs f0, 0x3C(r1)
stfs f0, 0x38(r1)
stfs f0, 0x34(r1)
lwz r3, 0x28(r30)
cmplwi r3, 0
beq- .loc_0x74
lwz r12, 0x4(r3)
addi r5, r30, 0
addi r4, r1, 0x1C
lwz r12, 0x30(r12)
mtlr r12
blrl
.loc_0x74:
lwz r4, 0x30(r30)
addi r3, r1, 0x10
lwz r4, 0x8(r4)
bl -0x97FC8
lwz r3, 0x30(r30)
addi r4, r1, 0x1C
lwz r12, 0x4(r3)
lwz r12, 0x34(r12)
mtlr r12
blrl
stw r3, 0x84(r30)
lwz r3, 0x84(r30)
cmplwi r3, 0
beq- .loc_0xEC
stw r30, 0x64(r3)
lwz r3, 0x88(r30)
addi r0, r3, 0x1
stw r0, 0x88(r30)
lwz r0, 0x74(r30)
rlwinm. r0,r0,0,28,28
beq- .loc_0xDC
lwz r3, 0x84(r30)
addi r4, r31, 0
li r5, 0x1
bl -0x51E18
b .loc_0xEC
.loc_0xDC:
lwz r3, 0x84(r30)
addi r4, r31, 0
li r5, 0
bl -0x51E2C
.loc_0xEC:
lwz r0, 0x54(r1)
lwz r31, 0x4C(r1)
lwz r30, 0x48(r1)
addi r1, r1, 0x50
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DBEE0
* Size: 000078
*/
void Generator::saveCreature(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
mr r30, r3
lwz r3, 0x84(r3)
cmplwi r3, 0
beq- .loc_0x60
lwz r3, 0x6C(r3)
bl -0x474D4
lwz r0, 0x74(r30)
rlwinm. r0,r0,0,28,28
beq- .loc_0x50
lwz r3, 0x84(r30)
addi r4, r31, 0
li r5, 0x1
bl -0x51DB8
b .loc_0x60
.loc_0x50:
lwz r3, 0x84(r30)
addi r4, r31, 0
li r5, 0
bl -0x51DCC
.loc_0x60:
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DBF58
* Size: 00023C
*/
void Generator::init()
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x50(r1)
stfd f31, 0x48(r1)
stw r31, 0x44(r1)
mr r31, r3
stw r30, 0x40(r1)
stw r29, 0x3C(r1)
lwz r4, 0x94(r3)
cmpwi r4, -0x1
bne- .loc_0x34
li r0, 0
b .loc_0x54
.loc_0x34:
lis r3, 0x803A
subi r3, r3, 0x2848
lwz r0, 0x2FC(r3)
cmpw r4, r0
bge- .loc_0x50
li r0, 0x1
b .loc_0x54
.loc_0x50:
li r0, 0
.loc_0x54:
rlwinm. r0,r0,0,24,31
beq- .loc_0x68
li r0, 0
stw r0, 0x88(r31)
b .loc_0x21C
.loc_0x68:
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x80
li r0, 0
stw r0, 0x88(r31)
b .loc_0x98
.loc_0x80:
lwz r0, 0x74(r31)
rlwinm. r0,r0,0,29,29
bne- .loc_0x98
li r0, 0
stw r0, 0x88(r31)
b .loc_0x21C
.loc_0x98:
li r0, 0
stw r0, 0x84(r31)
lwz r3, 0x20(r31)
cmplwi r3, 0
beq- .loc_0xC0
lwz r12, 0x4(r3)
mr r4, r31
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0xC0:
lwz r3, 0x30(r31)
cmplwi r3, 0
beq- .loc_0xE0
lwz r12, 0x4(r3)
mr r4, r31
lwz r12, 0x28(r12)
mtlr r12
blrl
.loc_0xE0:
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x1F0
lwz r0, 0x74(r31)
rlwinm. r0,r0,0,29,29
beq- .loc_0x1F0
lis r4, 0x803A
lwz r3, 0x8C(r31)
subi r4, r4, 0x2848
lwz r0, 0x90(r31)
lwz r4, 0x2FC(r4)
add r0, r3, r0
cmpw r4, r0
blt- .loc_0x14C
stw r4, 0x8C(r31)
lwz r0, 0x28(r31)
cmplwi r0, 0
beq- .loc_0x21C
li r0, 0
stw r0, 0x88(r31)
mr r4, r31
lwz r3, 0x28(r31)
lwz r12, 0x4(r3)
lwz r12, 0x24(r12)
mtlr r12
blrl
b .loc_0x21C
.loc_0x14C:
lwz r30, 0x88(r31)
li r0, 0
li r29, 0
stw r0, 0x88(r31)
lfs f31, -0x6790(r2)
b .loc_0x1E4
.loc_0x164:
stfs f31, 0x14(r1)
addi r5, r31, 0
addi r4, r1, 0xC
stfs f31, 0x10(r1)
stfs f31, 0xC(r1)
stfs f31, 0x20(r1)
stfs f31, 0x1C(r1)
stfs f31, 0x18(r1)
stfs f31, 0x2C(r1)
stfs f31, 0x28(r1)
stfs f31, 0x24(r1)
lwz r3, 0x28(r31)
lwz r12, 0x4(r3)
lwz r12, 0x30(r12)
mtlr r12
blrl
lwz r3, 0x30(r31)
cmplwi r3, 0
beq- .loc_0x1E0
lwz r12, 0x4(r3)
addi r4, r1, 0xC
lwz r12, 0x34(r12)
mtlr r12
blrl
cmplwi r3, 0
beq- .loc_0x1E0
stw r31, 0x64(r3)
lwz r4, 0x88(r31)
addi r0, r4, 0x1
stw r0, 0x88(r31)
stw r3, 0x84(r31)
.loc_0x1E0:
addi r29, r29, 0x1
.loc_0x1E4:
cmpw r29, r30
blt+ .loc_0x164
b .loc_0x21C
.loc_0x1F0:
lwz r0, 0x28(r31)
cmplwi r0, 0
beq- .loc_0x21C
li r0, 0
stw r0, 0x88(r31)
mr r4, r31
lwz r3, 0x28(r31)
lwz r12, 0x4(r3)
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0x21C:
lwz r0, 0x54(r1)
lfd f31, 0x48(r1)
lwz r31, 0x44(r1)
lwz r30, 0x40(r1)
lwz r29, 0x3C(r1)
addi r1, r1, 0x50
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DC194
* Size: 000004
*/
void GenType::init(Generator*) { }
/*
* --INFO--
* Address: 800DC198
* Size: 000004
*/
void GenArea::init(Generator*) { }
/*
* --INFO--
* Address: 800DC19C
* Size: 000088
*/
void Generator::informDeath(Creature*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x20(r1)
stw r31, 0x1C(r1)
addi r31, r4, 0
stw r30, 0x18(r1)
mr r30, r3
lwz r0, 0x84(r3)
cmplw r31, r0
bne- .loc_0x30
li r0, 0
stw r0, 0x84(r30)
.loc_0x30:
lwz r3, 0x88(r30)
subi r0, r3, 0x1
stw r0, 0x88(r30)
lwz r3, 0x6C(r31)
cmpwi r3, 0x37
bne- .loc_0x4C
bl -0x477AC
.loc_0x4C:
lwz r0, 0x88(r30)
cmpwi r0, 0
bgt- .loc_0x70
li r0, 0
lis r3, 0x803A
stw r0, 0x88(r30)
subi r3, r3, 0x2848
lwz r0, 0x2FC(r3)
stw r0, 0x8C(r30)
.loc_0x70:
lwz r0, 0x24(r1)
lwz r31, 0x1C(r1)
lwz r30, 0x18(r1)
addi r1, r1, 0x20
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DC224
* Size: 000004
*/
void Generator::update() { }
/*
* --INFO--
* Address: 800DC228
* Size: 0001AC
*/
void Generator::render(Graphics&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0xE0(r1)
stw r31, 0xDC(r1)
addi r31, r4, 0
stw r30, 0xD8(r1)
addi r30, r3, 0
lwz r5, 0x2DEC(r13)
lwz r0, 0x20(r5)
cmplwi r0, 0
beq- .loc_0x194
lfs f0, -0x6790(r2)
addi r6, r1, 0x38
addi r5, r1, 0x2C
stfs f0, 0x54(r1)
addi r3, r1, 0x98
addi r4, r1, 0x4C
stfs f0, 0x50(r1)
stfs f0, 0x4C(r1)
lfs f0, -0x6780(r2)
stfs f0, 0x4C(r1)
stfs f0, 0x50(r1)
stfs f0, 0x54(r1)
lfs f1, 0x98(r30)
lfs f0, 0xA4(r30)
lfs f5, 0xA0(r30)
fadds f1, f1, f0
lfs f4, 0xAC(r30)
lfs f3, 0x9C(r30)
lfs f2, 0xA8(r30)
fadds f4, f5, f4
stfs f1, 0x24(r1)
fadds f3, f3, f2
lfs f0, -0x3A30(r13)
lfs f2, 0x24(r1)
stfs f0, 0x2C(r1)
lfs f1, -0x3A2C(r13)
stfs f2, 0x38(r1)
lfs f0, -0x3A28(r13)
stfs f3, 0x3C(r1)
stfs f1, 0x30(r1)
stfs f4, 0x40(r1)
stfs f0, 0x34(r1)
bl -0x9E1E0
mr r3, r31
lwz r12, 0x3B4(r31)
addi r4, r1, 0x98
addi r5, r1, 0x58
lwz r12, 0x70(r12)
mtlr r12
blrl
mr r3, r31
lwz r12, 0x3B4(r31)
addi r4, r1, 0x58
li r5, 0
lwz r12, 0x74(r12)
mtlr r12
blrl
li r5, 0xFF
lwz r3, 0x2F54(r13)
stb r5, 0x44(r1)
li r4, 0x7D
li r0, 0
stb r4, 0x45(r1)
addi r4, r31, 0
li r6, 0
stb r0, 0x46(r1)
stb r5, 0x47(r1)
lwz r3, 0x44(r3)
lwz r0, 0x44(r1)
stw r0, 0x2C(r3)
lwz r3, 0x2F54(r13)
lwz r5, 0x2E4(r31)
bl -0xABEE0
lwz r3, 0x20(r30)
cmplwi r3, 0
beq- .loc_0x14C
lwz r12, 0x4(r3)
addi r4, r31, 0
addi r5, r30, 0
lwz r12, 0x2C(r12)
mtlr r12
blrl
.loc_0x14C:
lwz r3, 0x30(r30)
cmplwi r3, 0
beq- .loc_0x170
lwz r12, 0x4(r3)
addi r4, r31, 0
addi r5, r30, 0
lwz r12, 0x30(r12)
mtlr r12
blrl
.loc_0x170:
lwz r3, 0x28(r30)
cmplwi r3, 0
beq- .loc_0x194
lwz r12, 0x4(r3)
addi r4, r31, 0
addi r5, r30, 0
lwz r12, 0x2C(r12)
mtlr r12
blrl
.loc_0x194:
lwz r0, 0xE4(r1)
lwz r31, 0xDC(r1)
lwz r30, 0xD8(r1)
addi r1, r1, 0xE0
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DC3D4
* Size: 000004
*/
void GenType::render(Graphics&, Generator*) { }
/*
* --INFO--
* Address: 800DC3D8
* Size: 000004
*/
void GenArea::render(Graphics&, Generator*) { }
/*
* --INFO--
* Address: 800DC3DC
* Size: 000734
*/
void Generator::read(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0xE8(r1)
stw r31, 0xE4(r1)
addi r31, r4, 0
stw r30, 0xE0(r1)
addi r30, r3, 0
addi r3, r30, 0x58
stw r29, 0xDC(r1)
bl -0x98364
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0xA8
addi r3, r30, 0x64
addi r4, r31, 0
bl -0x9837C
lwz r12, 0x4(r31)
mr r3, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xAF(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xAE(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xAD(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xAC(r1)
lwz r0, 0xAC(r1)
stw r0, 0x70(r30)
.loc_0xA8:
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x8(r12)
mtlr r12
blrl
stw r3, 0x74(r30)
lis r4, 0x7630
addi r3, r30, 0x64
addi r4, r4, 0x2E30
bl -0x984B4
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x10C
li r29, 0
.loc_0xE0:
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
addi r0, r29, 0x38
addi r29, r29, 0x1
stbx r3, r30, r0
cmpwi r29, 0x20
blt+ .loc_0xE0
b .loc_0x190
.loc_0x10C:
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x88(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x8C(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x90(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
stw r0, 0x94(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x58(r12)
mtlr r12
blrl
.loc_0x190:
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x240
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
lfd f1, -0x6788(r2)
xoris r0, r0, 0x8000
stw r0, 0xD4(r1)
lis r29, 0x4330
addi r3, r31, 0
stw r29, 0xD0(r1)
lfd f0, 0xD0(r1)
fsubs f0, f0, f1
stfs f0, 0x98(r30)
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
lfd f1, -0x6788(r2)
xoris r0, r0, 0x8000
stw r0, 0xCC(r1)
mr r3, r31
stw r29, 0xC8(r1)
lfd f0, 0xC8(r1)
fsubs f0, f0, f1
stfs f0, 0x9C(r30)
lwz r12, 0x4(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
extsh r0, r3
lfd f1, -0x6788(r2)
xoris r0, r0, 0x8000
stw r0, 0xC4(r1)
stw r29, 0xC0(r1)
lfd f0, 0xC0(r1)
fsubs f0, f0, f1
stfs f0, 0xA0(r30)
b .loc_0x288
.loc_0x240:
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x98(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x9C(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0xA0(r30)
.loc_0x288:
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x2B0
lfs f0, -0x3A14(r13)
stfs f0, 0xA4(r30)
lfs f0, -0x3A10(r13)
stfs f0, 0xA8(r30)
lfs f0, -0x3A0C(r13)
stfs f0, 0xAC(r30)
b .loc_0x2F8
.loc_0x2B0:
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0xA4(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0xA8(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0xAC(r30)
.loc_0x2F8:
li r0, 0
stw r0, 0x30(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xAB(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xAA(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xA9(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0xA8(r1)
lwz r4, 0xA8(r1)
lwz r3, 0x3074(r13)
bl 0x4A4
stw r3, 0x30(r30)
lwz r29, 0x30(r30)
cmplwi r29, 0
beq- .loc_0x458
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x3F4
lwz r12, 0x4(r31)
mr r3, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x7B(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x7A(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x79(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x78(r1)
lwz r0, 0x78(r1)
stw r0, 0xC(r29)
b .loc_0x40C
.loc_0x3F4:
mr r3, r29
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
stw r3, 0xC(r29)
.loc_0x40C:
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x14(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x44C
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x10(r12)
mtlr r12
blrl
b .loc_0x458
.loc_0x44C:
addi r3, r29, 0
addi r4, r31, 0
bl -0x7DC98
.loc_0x458:
li r0, 0
stw r0, 0x20(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x9B(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x9A(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x99(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x98(r1)
lwz r4, 0x98(r1)
lwz r3, 0x307C(r13)
bl 0x2D8
stw r3, 0x20(r30)
lwz r29, 0x20(r30)
cmplwi r29, 0
beq- .loc_0x5B8
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x554
lwz r12, 0x4(r31)
mr r3, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x77(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x76(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x75(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x74(r1)
lwz r0, 0x74(r1)
stw r0, 0xC(r29)
b .loc_0x56C
.loc_0x554:
mr r3, r29
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
stw r3, 0xC(r29)
.loc_0x56C:
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x14(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x5AC
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x10(r12)
mtlr r12
blrl
b .loc_0x5B8
.loc_0x5AC:
addi r3, r29, 0
addi r4, r31, 0
bl -0x7DDF8
.loc_0x5B8:
li r0, 0
stw r0, 0x28(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x8B(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x8A(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x89(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x88(r1)
lwz r4, 0x88(r1)
lwz r3, 0x3078(r13)
bl .loc_0x734
stw r3, 0x28(r30)
lwz r29, 0x28(r30)
cmplwi r29, 0
beq- .loc_0x718
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x6B4
lwz r12, 0x4(r31)
mr r3, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x73(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x72(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x71(r1)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
stb r3, 0x70(r1)
lwz r0, 0x70(r1)
stw r0, 0xC(r29)
b .loc_0x6CC
.loc_0x6B4:
mr r3, r29
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
stw r3, 0xC(r29)
.loc_0x6CC:
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x14(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x70C
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x10(r12)
mtlr r12
blrl
b .loc_0x718
.loc_0x70C:
addi r3, r29, 0
addi r4, r31, 0
bl -0x7DF58
.loc_0x718:
lwz r0, 0xEC(r1)
lwz r31, 0xE4(r1)
lwz r30, 0xE0(r1)
lwz r29, 0xDC(r1)
addi r1, r1, 0xE8
mtlr r0
blr
.loc_0x734:
*/
}
/*
* --INFO--
* Address: 800DCB10
* Size: 00006C
*/
void Factory<GenType>::create(unsigned long)
{
/*
.loc_0x0:
mflr r0
li r7, 0
stw r0, 0x4(r1)
li r5, 0
stwu r1, -0x8(r1)
lwz r0, 0x0(r3)
cmpwi r0, 0
mtctr r0
ble- .loc_0x58
.loc_0x24:
lwz r6, 0x8(r3)
lwzx r0, r6, r5
cmplw r4, r0
bne- .loc_0x4C
rlwinm r0,r7,4,0,27
add r3, r6, r0
lwz r12, 0x4(r3)
mtlr r12
blrl
b .loc_0x5C
.loc_0x4C:
addi r5, r5, 0x10
addi r7, r7, 0x1
bdnz+ .loc_0x24
.loc_0x58:
li r3, 0
.loc_0x5C:
lwz r0, 0xC(r1)
addi r1, r1, 0x8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DCB7C
* Size: 00006C
*/
void Factory<GenArea>::create(unsigned long)
{
/*
.loc_0x0:
mflr r0
li r7, 0
stw r0, 0x4(r1)
li r5, 0
stwu r1, -0x8(r1)
lwz r0, 0x0(r3)
cmpwi r0, 0
mtctr r0
ble- .loc_0x58
.loc_0x24:
lwz r6, 0x8(r3)
lwzx r0, r6, r5
cmplw r4, r0
bne- .loc_0x4C
rlwinm r0,r7,4,0,27
add r3, r6, r0
lwz r12, 0x4(r3)
mtlr r12
blrl
b .loc_0x5C
.loc_0x4C:
addi r5, r5, 0x10
addi r7, r7, 0x1
bdnz+ .loc_0x24
.loc_0x58:
li r3, 0
.loc_0x5C:
lwz r0, 0xC(r1)
addi r1, r1, 0x8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DCBE8
* Size: 00006C
*/
void Factory<GenObject>::create(unsigned long)
{
/*
.loc_0x0:
mflr r0
li r7, 0
stw r0, 0x4(r1)
li r5, 0
stwu r1, -0x8(r1)
lwz r0, 0x0(r3)
cmpwi r0, 0
mtctr r0
ble- .loc_0x58
.loc_0x24:
lwz r6, 0x8(r3)
lwzx r0, r6, r5
cmplw r4, r0
bne- .loc_0x4C
rlwinm r0,r7,4,0,27
add r3, r6, r0
lwz r12, 0x4(r3)
mtlr r12
blrl
b .loc_0x5C
.loc_0x4C:
addi r5, r5, 0x10
addi r7, r7, 0x1
bdnz+ .loc_0x24
.loc_0x58:
li r3, 0
.loc_0x5C:
lwz r0, 0xC(r1)
addi r1, r1, 0x8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DCC54
* Size: 000760
*/
void Generator::write(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x98(r1)
stw r31, 0x94(r1)
addi r31, r4, 0
stw r30, 0x90(r1)
addi r30, r3, 0
addi r3, r30, 0x58
stw r29, 0x8C(r1)
bl -0x98C70
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0xA8
addi r3, r30, 0x64
addi r4, r31, 0
bl -0x98C88
lwz r0, 0x70(r30)
mr r3, r31
stw r0, 0x38(r1)
lwz r12, 0x4(r31)
lbz r4, 0x3B(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x3A(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x39(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x38(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
.loc_0xA8:
mr r3, r31
lwz r4, 0x74(r30)
lwz r12, 0x4(r31)
lwz r12, 0x24(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0xFC
li r29, 0
.loc_0xD0:
mr r3, r31
lwz r12, 0x4(r31)
addi r0, r29, 0x38
lbzx r4, r30, r0
lwz r12, 0x28(r12)
mtlr r12
blrl
addi r29, r29, 0x1
cmpwi r29, 0x20
blt+ .loc_0xD0
b .loc_0x184
.loc_0xFC:
mr r3, r31
lwz r0, 0x88(r30)
lwz r12, 0x4(r31)
extsh r4, r0
lwz r12, 0x2C(r12)
mtlr r12
blrl
mr r3, r31
lwz r0, 0x8C(r30)
lwz r12, 0x4(r31)
extsh r4, r0
lwz r12, 0x2C(r12)
mtlr r12
blrl
mr r3, r31
lwz r4, 0x28(r30)
lwz r12, 0x4(r31)
lwz r0, 0x24(r4)
lwz r12, 0x2C(r12)
extsh r4, r0
mtlr r12
blrl
mr r3, r31
lwz r0, 0x94(r30)
lwz r12, 0x4(r31)
extsh r4, r0
lwz r12, 0x2C(r12)
mtlr r12
blrl
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x58(r12)
mtlr r12
blrl
.loc_0x184:
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x294
lfs f0, 0x98(r30)
mr r3, r31
lwz r12, 0x4(r31)
lis r29, 0x4330
fctiwz f0, f0
lwz r12, 0x2C(r12)
lfd f2, -0x6788(r2)
stfd f0, 0x80(r1)
mtlr r12
lfs f0, 0xA4(r30)
lwz r0, 0x84(r1)
extsh r0, r0
xoris r0, r0, 0x8000
stw r0, 0x7C(r1)
stw r29, 0x78(r1)
lfd f1, 0x78(r1)
fsubs f1, f1, f2
fadds f0, f1, f0
fctiwz f0, f0
stfd f0, 0x70(r1)
lwz r4, 0x74(r1)
blrl
lfs f0, 0x9C(r30)
mr r3, r31
lwz r12, 0x4(r31)
fctiwz f1, f0
lfd f2, -0x6788(r2)
lwz r12, 0x2C(r12)
lfs f0, 0xA8(r30)
stfd f1, 0x68(r1)
mtlr r12
lwz r0, 0x6C(r1)
extsh r0, r0
xoris r0, r0, 0x8000
stw r0, 0x64(r1)
stw r29, 0x60(r1)
lfd f1, 0x60(r1)
fsubs f1, f1, f2
fadds f0, f1, f0
fctiwz f0, f0
stfd f0, 0x58(r1)
lwz r4, 0x5C(r1)
blrl
lfs f0, 0xA0(r30)
mr r3, r31
lwz r12, 0x4(r31)
fctiwz f1, f0
lfd f2, -0x6788(r2)
lwz r12, 0x2C(r12)
lfs f0, 0xAC(r30)
stfd f1, 0x50(r1)
mtlr r12
lwz r0, 0x54(r1)
extsh r0, r0
xoris r0, r0, 0x8000
stw r0, 0x4C(r1)
stw r29, 0x48(r1)
lfd f1, 0x48(r1)
fsubs f1, f1, f2
fadds f0, f1, f0
fctiwz f0, f0
stfd f0, 0x40(r1)
lwz r4, 0x44(r1)
blrl
b .loc_0x324
.loc_0x294:
mr r3, r31
lfs f1, 0x98(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0x9C(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0xA0(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0xA4(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0xA8(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
mr r3, r31
lfs f1, 0xAC(r30)
lwz r12, 0x4(r31)
lwz r12, 0x30(r12)
mtlr r12
blrl
.loc_0x324:
lwz r29, 0x30(r30)
cmplwi r29, 0
beq- .loc_0x46C
lwz r0, 0x8(r29)
mr r3, r31
stw r0, 0x2C(r1)
lwz r12, 0x4(r31)
lbz r4, 0x2F(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x2E(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x2D(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x2C(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x41C
mr r3, r29
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
stw r3, 0x20(r1)
mr r3, r31
lwz r12, 0x4(r31)
lbz r4, 0x23(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x22(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x21(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x20(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
.loc_0x41C:
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x8(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x45C
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
b .loc_0x484
.loc_0x45C:
addi r3, r29, 0
addi r4, r31, 0
bl -0x7E5CC
b .loc_0x484
.loc_0x46C:
mr r3, r31
lwz r12, 0x4(r31)
li r4, 0
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0x484:
lwz r29, 0x20(r30)
cmplwi r29, 0
beq- .loc_0x5CC
lwz r0, 0x8(r29)
mr r3, r31
stw r0, 0x28(r1)
lwz r12, 0x4(r31)
lbz r4, 0x2B(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x2A(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x29(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x28(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x57C
mr r3, r29
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
stw r3, 0x1C(r1)
mr r3, r31
lwz r12, 0x4(r31)
lbz r4, 0x1F(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x1E(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x1D(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x1C(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
.loc_0x57C:
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x8(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x5BC
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
b .loc_0x5E4
.loc_0x5BC:
addi r3, r29, 0
addi r4, r31, 0
bl -0x7E72C
b .loc_0x5E4
.loc_0x5CC:
mr r3, r31
lwz r12, 0x4(r31)
li r4, 0
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0x5E4:
lwz r29, 0x28(r30)
cmplwi r29, 0
beq- .loc_0x72C
lwz r0, 0x8(r29)
mr r3, r31
stw r0, 0x24(r1)
lwz r12, 0x4(r31)
lbz r4, 0x27(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x26(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x25(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x24(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
bne- .loc_0x6DC
mr r3, r29
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
stw r3, 0x18(r1)
mr r3, r31
lwz r12, 0x4(r31)
lbz r4, 0x1B(r1)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x1A(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x19(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
mr r3, r31
lbz r4, 0x18(r1)
lwz r12, 0x4(r31)
lwz r12, 0x28(r12)
mtlr r12
blrl
.loc_0x6DC:
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0x8(r12)
mtlr r12
blrl
lbz r0, 0x3070(r13)
cmplwi r0, 0
beq- .loc_0x71C
mr r3, r29
lwz r12, 0x4(r29)
mr r4, r31
lwz r12, 0xC(r12)
mtlr r12
blrl
b .loc_0x744
.loc_0x71C:
addi r3, r29, 0
addi r4, r31, 0
bl -0x7E88C
b .loc_0x744
.loc_0x72C:
mr r3, r31
lwz r12, 0x4(r31)
li r4, 0
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0x744:
lwz r0, 0x9C(r1)
lwz r31, 0x94(r1)
lwz r30, 0x90(r1)
lwz r29, 0x8C(r1)
addi r1, r1, 0x98
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DD3B4
* Size: 000514
*/
GeneratorMgr::GeneratorMgr()
{
/*
.loc_0x0:
mflr r0
lis r4, 0x8022
stw r0, 0x4(r1)
addi r0, r4, 0x738C
subi r5, r13, 0x39FC
stwu r1, -0x40(r1)
lis r4, 0x802C
stw r31, 0x3C(r1)
subi r31, r4, 0x59E0
subi r4, r13, 0x39FC
stw r30, 0x38(r1)
stw r29, 0x34(r1)
addi r29, r3, 0
lis r3, 0x8022
stw r28, 0x30(r1)
li r28, 0
stw r0, 0x0(r29)
addi r0, r3, 0x737C
lis r3, 0x8023
stw r0, 0x0(r29)
subi r0, r3, 0x71E0
addi r3, r29, 0
stw r28, 0x10(r29)
stw r28, 0xC(r29)
stw r28, 0x8(r29)
stw r5, 0x4(r29)
stw r0, 0x0(r29)
bl -0x9CCE4
lis r3, 0x802C
subi r0, r3, 0x55DC
stw r0, 0x0(r29)
addi r3, r29, 0x24
bl -0x995D8
addi r3, r29, 0x30
bl -0x995E0
addi r3, r29, 0x40
bl -0x995E8
lfs f1, -0x6790(r2)
lis r30, 0x7630
addi r3, r29, 0x24
stfs f1, 0x54(r29)
addi r4, r30, 0x2E31
stfs f1, 0x50(r29)
stfs f1, 0x4C(r29)
lfs f0, -0x3A08(r13)
stfs f0, 0x4C(r29)
lfs f0, -0x3A04(r13)
stfs f0, 0x50(r29)
lfs f0, -0x3A00(r13)
stfs f0, 0x54(r29)
stfs f1, 0x58(r29)
stw r28, 0x3C(r29)
stw r28, 0x20(r29)
bl -0x995C4
addi r3, r29, 0x30
addi r4, r30, 0x2E30
bl -0x995D0
lwz r0, 0x3074(r13)
cmplwi r0, 0
bne- .loc_0x1A0
li r3, 0x10
bl -0x964A4
addi r30, r3, 0
mr. r0, r30
beq- .loc_0x11C
li r3, 0xC0
bl -0x964B8
stw r3, 0x8(r30)
li r0, 0xC
stw r0, 0x4(r30)
stw r28, 0x0(r30)
.loc_0x11C:
stw r30, 0x3074(r13)
lwz r5, 0x0(r30)
lwz r0, 0x4(r30)
cmpw r5, r0
bge- .loc_0x1A0
lis r4, 0x7069
lwz r3, 0x8(r30)
addi r4, r4, 0x6B69
rlwinm r0,r5,4,0,27
stwx r4, r3, r0
lis r4, 0x800E
lis r3, 0x7630
lwz r0, 0x0(r30)
subi r6, r4, 0x52CC
lwz r4, 0x8(r30)
addi r5, r31, 0x28
rlwinm r0,r0,4,0,27
add r4, r4, r0
stw r6, 0x4(r4)
addi r4, r3, 0x2E30
lwz r0, 0x0(r30)
lwz r3, 0x8(r30)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r5, 0x8(r3)
lwz r0, 0x0(r30)
lwz r3, 0x8(r30)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r4, 0xC(r3)
lwz r3, 0x0(r30)
addi r0, r3, 0x1
stw r0, 0x0(r30)
.loc_0x1A0:
lwz r0, 0x307C(r13)
cmplwi r0, 0
bne- .loc_0x318
li r3, 0x10
bl -0x96560
addi r30, r3, 0
mr. r0, r30
beq- .loc_0x1DC
li r3, 0x60
bl -0x96574
stw r3, 0x8(r30)
li r3, 0x6
li r0, 0
stw r3, 0x4(r30)
stw r0, 0x0(r30)
.loc_0x1DC:
stw r30, 0x307C(r13)
lwz r5, 0x0(r30)
lwz r0, 0x4(r30)
cmpw r5, r0
bge- .loc_0x260
lis r4, 0x7069
lwz r3, 0x8(r30)
addi r4, r4, 0x6E74
rlwinm r0,r5,4,0,27
stwx r4, r3, r0
lis r4, 0x800E
lis r3, 0x7630
lwz r0, 0x0(r30)
subi r6, r4, 0x46A8
lwz r4, 0x8(r30)
addi r5, r31, 0xCC
rlwinm r0,r0,4,0,27
add r4, r4, r0
stw r6, 0x4(r4)
addi r4, r3, 0x2E30
lwz r0, 0x0(r30)
lwz r3, 0x8(r30)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r5, 0x8(r3)
lwz r0, 0x0(r30)
lwz r3, 0x8(r30)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r4, 0xC(r3)
lwz r3, 0x0(r30)
addi r0, r3, 0x1
stw r0, 0x0(r30)
.loc_0x260:
lwz r7, 0x307C(r13)
lwz r5, 0x0(r7)
lwz r0, 0x4(r7)
cmpw r5, r0
bge- .loc_0x2E4
lis r4, 0x6369
lwz r3, 0x8(r7)
addi r4, r4, 0x7263
rlwinm r0,r5,4,0,27
stwx r4, r3, r0
lis r4, 0x800E
lis r3, 0x7630
lwz r0, 0x0(r7)
subi r6, r4, 0x4780
lwz r4, 0x8(r7)
addi r5, r31, 0xD8
rlwinm r0,r0,4,0,27
add r4, r4, r0
stw r6, 0x4(r4)
addi r4, r3, 0x2E30
lwz r0, 0x0(r7)
lwz r3, 0x8(r7)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r5, 0x8(r3)
lwz r0, 0x0(r7)
lwz r3, 0x8(r7)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r4, 0xC(r3)
lwz r3, 0x0(r7)
addi r0, r3, 0x1
stw r0, 0x0(r7)
.loc_0x2E4:
lwz r5, 0x307C(r13)
li r4, 0
lwz r0, 0x0(r5)
cmpwi r0, 0
mtctr r0
ble- .loc_0x318
.loc_0x2FC:
lwz r3, 0x8(r5)
lwzx r3, r3, r4
subis r0, r3, 0x6369
cmplwi r0, 0x7263
beq- .loc_0x318
addi r4, r4, 0x10
bdnz+ .loc_0x2FC
.loc_0x318:
lwz r0, 0x3078(r13)
cmplwi r0, 0
bne- .loc_0x4E0
li r3, 0x10
bl -0x966D8
addi r30, r3, 0
mr. r0, r30
beq- .loc_0x354
li r3, 0x60
bl -0x966EC
stw r3, 0x8(r30)
li r3, 0x6
li r0, 0
stw r3, 0x4(r30)
stw r0, 0x0(r30)
.loc_0x354:
stw r30, 0x3078(r13)
lwz r5, 0x0(r30)
lwz r0, 0x4(r30)
cmpw r5, r0
bge- .loc_0x3D8
lis r4, 0x316F
lwz r3, 0x8(r30)
addi r4, r4, 0x6E65
rlwinm r0,r5,4,0,27
stwx r4, r3, r0
lis r4, 0x800E
lis r3, 0x7630
lwz r0, 0x0(r30)
subi r6, r4, 0x5180
lwz r4, 0x8(r30)
addi r5, r31, 0x80
rlwinm r0,r0,4,0,27
add r4, r4, r0
stw r6, 0x4(r4)
addi r4, r3, 0x2E30
lwz r0, 0x0(r30)
lwz r3, 0x8(r30)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r5, 0x8(r3)
lwz r0, 0x0(r30)
lwz r3, 0x8(r30)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r4, 0xC(r3)
lwz r3, 0x0(r30)
addi r0, r3, 0x1
stw r0, 0x0(r30)
.loc_0x3D8:
lwz r7, 0x3078(r13)
lwz r5, 0x0(r7)
lwz r0, 0x4(r7)
cmpw r5, r0
bge- .loc_0x45C
lis r4, 0x6174
lwz r3, 0x8(r7)
addi r4, r4, 0x6F6E
rlwinm r0,r5,4,0,27
stwx r4, r3, r0
lis r4, 0x800E
lis r3, 0x7630
lwz r0, 0x0(r7)
subi r6, r4, 0x5004
lwz r4, 0x8(r7)
addi r5, r31, 0x8C
rlwinm r0,r0,4,0,27
add r4, r4, r0
stw r6, 0x4(r4)
addi r4, r3, 0x2E30
lwz r0, 0x0(r7)
lwz r3, 0x8(r7)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r5, 0x8(r3)
lwz r0, 0x0(r7)
lwz r3, 0x8(r7)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r4, 0xC(r3)
lwz r3, 0x0(r7)
addi r0, r3, 0x1
stw r0, 0x0(r7)
.loc_0x45C:
lwz r7, 0x3078(r13)
lwz r5, 0x0(r7)
lwz r0, 0x4(r7)
cmpw r5, r0
bge- .loc_0x4E0
lis r4, 0x6972
lwz r3, 0x8(r7)
addi r4, r4, 0x6E64
rlwinm r0,r5,4,0,27
stwx r4, r3, r0
lis r4, 0x800E
lis r3, 0x7630
lwz r0, 0x0(r7)
subi r6, r4, 0x4ED4
lwz r4, 0x8(r7)
addi r5, r31, 0x9C
rlwinm r0,r0,4,0,27
add r4, r4, r0
stw r6, 0x4(r4)
addi r4, r3, 0x2E30
lwz r0, 0x0(r7)
lwz r3, 0x8(r7)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r5, 0x8(r3)
lwz r0, 0x0(r7)
lwz r3, 0x8(r7)
rlwinm r0,r0,4,0,27
add r3, r3, r0
stw r4, 0xC(r3)
lwz r3, 0x0(r7)
addi r0, r3, 0x1
stw r0, 0x0(r7)
.loc_0x4E0:
li r0, 0
stb r0, 0x5C(r29)
addi r0, r31, 0xF8
addi r3, r29, 0
stw r0, 0x4(r29)
lwz r0, 0x44(r1)
lwz r31, 0x3C(r1)
lwz r30, 0x38(r1)
lwz r29, 0x34(r1)
lwz r28, 0x30(r1)
addi r1, r1, 0x40
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DD8C8
* Size: 000040
*/
void GeneratorMgr::init()
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
lwz r31, 0x20(r3)
b .loc_0x24
.loc_0x18:
mr r3, r31
bl -0x198C
lwz r31, 0x7C(r31)
.loc_0x24:
cmplwi r31, 0
bne+ .loc_0x18
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DD908
* Size: 00001C
*/
void GeneratorMgr::setDayLimit(int)
{
/*
.loc_0x0:
lwz r3, 0x20(r3)
b .loc_0x10
.loc_0x8:
stw r4, 0x94(r3)
lwz r3, 0x7C(r3)
.loc_0x10:
cmplwi r3, 0
bne+ .loc_0x8
blr
*/
}
/*
* --INFO--
* Address: 800DD924
* Size: 0000A0
*/
void GeneratorMgr::updateUseList()
{
/*
.loc_0x0:
mflr r0
lis r4, 0x803A
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
subi r31, r4, 0x2848
stw r30, 0x10(r1)
lwz r30, 0x20(r3)
b .loc_0x80
.loc_0x24:
lwz r3, 0x94(r30)
cmpwi r3, -0x1
bne- .loc_0x38
li r0, 0
b .loc_0x50
.loc_0x38:
lwz r0, 0x2FC(r31)
cmpw r3, r0
bge- .loc_0x4C
li r0, 0x1
b .loc_0x50
.loc_0x4C:
li r0, 0
.loc_0x50:
rlwinm. r0,r0,0,24,31
bne- .loc_0x7C
lwz r3, 0x30(r30)
cmplwi r3, 0
beq- .loc_0x7C
lwz r12, 0x4(r3)
addi r4, r30, 0
li r5, 0x1
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0x7C:
lwz r30, 0x7C(r30)
.loc_0x80:
cmplwi r30, 0
bne+ .loc_0x24
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DD9C4
* Size: 00004C
*/
void GeneratorMgr::update()
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
lwz r31, 0x20(r3)
b .loc_0x30
.loc_0x18:
mr r3, r31
lwz r12, 0x0(r31)
lwz r12, 0x10(r12)
mtlr r12
blrl
lwz r31, 0x7C(r31)
.loc_0x30:
cmplwi r31, 0
bne+ .loc_0x18
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DDA10
* Size: 00005C
*/
void GeneratorMgr::render(Graphics&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
stw r30, 0x10(r1)
mr r30, r4
lwz r31, 0x20(r3)
b .loc_0x3C
.loc_0x20:
mr r3, r31
lwz r12, 0x0(r31)
mr r4, r30
lwz r12, 0x18(r12)
mtlr r12
blrl
lwz r31, 0x7C(r31)
.loc_0x3C:
cmplwi r31, 0
bne+ .loc_0x20
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DDA6C
* Size: 000274
*/
void GeneratorMgr::read(RandomAccessStream&, bool)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x28(r1)
stw r31, 0x24(r1)
addi r31, r4, 0
stw r30, 0x20(r1)
mr r30, r3
stw r29, 0x1C(r1)
stw r28, 0x18(r1)
addi r28, r5, 0
lwz r6, 0x20(r3)
cmplwi r6, 0
beq- .loc_0x5C
beq- .loc_0x54
lis r3, 0x802C
subi r0, r3, 0x5584
stw r0, 0x0(r6)
li r0, 0
addi r3, r6, 0
stw r0, 0x7C(r6)
bl -0x96910
.loc_0x54:
li r0, 0
stw r0, 0x3C(r30)
.loc_0x5C:
addi r3, r30, 0x30
addi r4, r31, 0
bl -0x99A34
lis r4, 0x7630
addi r3, r30, 0x30
addi r4, r4, 0x2E30
bl -0x99B00
rlwinm. r0,r3,0,24,31
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x4C(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x50(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
lis r4, 0x7630
stfs f1, 0x54(r30)
addi r3, r30, 0x30
addi r4, r4, 0x2E31
bl -0x99B5C
rlwinm. r0,r3,0,24,31
beq- .loc_0xF4
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x14(r12)
mtlr r12
blrl
stfs f1, 0x58(r30)
.loc_0xF4:
rlwinm. r0,r28,0,24,31
bne- .loc_0x15C
lwz r3, 0x3120(r13)
bl 0x39858
cmplwi r3, 0
beq- .loc_0x15C
lwz r4, 0x4C(r30)
lwz r0, 0x50(r30)
stw r4, 0x94(r3)
stw r0, 0x98(r3)
lwz r0, 0x54(r30)
stw r0, 0x9C(r3)
lwz r4, 0x4C(r30)
lwz r0, 0x50(r30)
stw r4, 0x1AC(r3)
stw r0, 0x1B0(r3)
lwz r0, 0x54(r30)
stw r0, 0x1B4(r3)
lfs f1, 0x58(r30)
lfs f0, -0x6778(r2)
lfs f2, -0x677C(r2)
fdivs f0, f1, f0
fmuls f0, f2, f0
stfs f0, 0xA0(r3)
lfs f0, 0xA0(r3)
stfs f0, 0x8C(r3)
.loc_0x15C:
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0x8(r12)
mtlr r12
blrl
stw r3, 0x3C(r30)
li r0, 0
li r28, 0
stw r0, 0x20(r30)
b .loc_0x248
.loc_0x184:
lwz r0, 0x20(r30)
cmplwi r0, 0
bne- .loc_0x1E0
li r3, 0xB8
bl -0x96BFC
addi r29, r3, 0
mr. r3, r29
beq- .loc_0x1A8
bl -0x2130
.loc_0x1A8:
stw r29, 0x20(r30)
mr r4, r31
lwz r3, 0x20(r30)
lwz r12, 0x0(r3)
lwz r12, 0xC(r12)
mtlr r12
blrl
lwz r3, 0x20(r30)
stw r30, 0x80(r3)
lwz r3, 0x3094(r13)
lwz r4, 0x20(r30)
lwz r3, 0x0(r3)
bl -0x9D66C
b .loc_0x244
.loc_0x1E0:
li r3, 0xB8
bl -0x96C4C
addi r29, r3, 0
mr. r3, r29
beq- .loc_0x1F8
bl -0x2180
.loc_0x1F8:
stw r30, 0x80(r29)
mr r3, r29
mr r4, r31
lwz r12, 0x0(r29)
lwz r12, 0xC(r12)
mtlr r12
blrl
lwz r3, 0x20(r30)
b .loc_0x220
.loc_0x21C:
mr r3, r0
.loc_0x220:
lwz r0, 0x7C(r3)
cmplwi r0, 0
bne+ .loc_0x21C
stw r29, 0x7C(r3)
mr r4, r29
stw r3, 0x78(r29)
lwz r3, 0x3094(r13)
lwz r3, 0x0(r3)
bl -0x9D6D4
.loc_0x244:
addi r28, r28, 0x1
.loc_0x248:
lwz r0, 0x3C(r30)
cmpw r28, r0
blt+ .loc_0x184
lwz r0, 0x2C(r1)
lwz r31, 0x24(r1)
lwz r30, 0x20(r1)
lwz r29, 0x1C(r1)
lwz r28, 0x18(r1)
addi r1, r1, 0x28
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 0000D4
*/
void GeneratorMgr::write(RandomAccessStream&)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000050
*/
void GeneratorMgr::setNaviPos()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 000050
*/
void GeneratorMgr::changeNaviPos()
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DDCE0
* Size: 00006C
*/
void GenObjectPiki::ramSaveParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
addi r31, r4, 0
stw r30, 0x10(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r0, 0x24(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r12, 0x4(r31)
mr r3, r31
lwz r0, 0x34(r30)
lwz r12, 0x28(r12)
rlwinm r4,r0,0,24,31
mtlr r12
blrl
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DDD4C
* Size: 00006C
*/
void GenObjectPiki::ramLoadParameters(RandomAccessStream&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x20(r1)
stw r31, 0x1C(r1)
addi r31, r4, 0
stw r30, 0x18(r1)
addi r30, r3, 0
addi r3, r31, 0
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x24(r30)
mr r3, r31
lwz r12, 0x4(r31)
lwz r12, 0xC(r12)
mtlr r12
blrl
rlwinm r0,r3,0,24,31
stw r0, 0x34(r30)
lwz r0, 0x24(r1)
lwz r31, 0x1C(r1)
lwz r30, 0x18(r1)
addi r1, r1, 0x20
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DDDB8
* Size: 000214
*/
void GenObjectPiki::birth(BirthInfo&)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x48(r1)
stw r31, 0x44(r1)
li r31, 0
stw r30, 0x40(r1)
addi r30, r4, 0
stw r29, 0x3C(r1)
mr r29, r3
stw r28, 0x38(r1)
lwz r12, 0x4(r29)
lwz r12, 0x20(r12)
mtlr r12
blrl
lwz r0, 0x34(r29)
cmpwi r0, 0x3
mr r28, r0
bne- .loc_0xA0
bl 0x13A270
xoris r0, r3, 0x8000
lfd f4, -0x6788(r2)
stw r0, 0x34(r1)
lis r0, 0x4330
lfs f2, -0x6770(r2)
stw r0, 0x30(r1)
lfs f1, -0x6774(r2)
lfd f3, 0x30(r1)
lfs f0, -0x676C(r2)
fsubs f3, f3, f4
fdivs f2, f3, f2
fmuls f1, f1, f2
fmuls f0, f0, f1
fctiwz f0, f0
stfd f0, 0x20(r1)
lwz r0, 0x24(r1)
stfd f0, 0x28(r1)
cmpwi r0, 0x3
lwz r28, 0x2C(r1)
blt- .loc_0xA0
li r28, 0
.loc_0xA0:
lwzu r0, 0x24(r29)
cmpwi r0, 0
beq- .loc_0xBC
blt- .loc_0x1F0
cmpwi r0, 0x3
bge- .loc_0x1F0
b .loc_0x148
.loc_0xBC:
lwz r3, 0x30AC(r13)
li r4, 0xF
lwz r12, 0x0(r3)
lwz r12, 0x78(r12)
mtlr r12
blrl
mr. r29, r3
beq- .loc_0x1F0
mr r3, r29
lwz r12, 0x0(r29)
mr r4, r30
lwz r12, 0x28(r12)
mtlr r12
blrl
lwz r3, 0x2F00(r13)
li r4, 0x1
lfs f1, 0x94(r29)
lfs f2, 0x9C(r29)
bl -0x75FB8
stfs f1, 0x98(r29)
addi r3, r29, 0
addi r4, r28, 0
bl 0xEBD4
mr r3, r29
lwz r12, 0x0(r29)
li r4, 0
lwz r12, 0x34(r12)
mtlr r12
blrl
lwz r3, 0x2E8(r29)
addi r4, r29, 0
li r5, 0x6
bl -0x6079C
mr r31, r29
b .loc_0x1F0
.loc_0x148:
lwz r3, 0x3068(r13)
lwz r12, 0x0(r3)
lwz r12, 0x78(r12)
mtlr r12
blrl
mr. r31, r3
beq- .loc_0x1F0
lis r3, 0x803D
rlwinm r4,r28,2,0,29
addi r0, r3, 0x1E88
add r4, r0, r4
lwz r3, 0x0(r4)
addi r0, r3, 0x1
stw r0, 0x0(r4)
bl 0x34628
lwz r3, 0x3120(r13)
bl 0x39484
addi r4, r3, 0
addi r3, r31, 0
bl -0x11F08
addi r3, r31, 0
addi r4, r30, 0
bl -0x53354
addi r3, r31, 0
addi r4, r28, 0
bl -0x146EC
lwz r0, 0x0(r29)
cmpwi r0, 0x1
bne- .loc_0x1D8
lwz r3, 0x3120(r13)
bl 0x3944C
addi r5, r3, 0
addi r3, r31, 0
li r4, 0
bl -0x10DBC
b .loc_0x1F0
.loc_0x1D8:
lwz r3, 0x3120(r13)
bl 0x39430
addi r5, r3, 0
addi r3, r31, 0
li r4, 0x1
bl -0x10DD8
.loc_0x1F0:
mr r3, r31
lwz r0, 0x4C(r1)
lwz r31, 0x44(r1)
lwz r30, 0x40(r1)
lwz r29, 0x3C(r1)
lwz r28, 0x38(r1)
addi r1, r1, 0x48
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 000038
*/
void deg2rad(int)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 800DDFCC
* Size: 0000A4
*/
void GenTypeOne::init(Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x40(r1)
stw r31, 0x3C(r1)
mr r31, r4
mr r5, r31
lfs f0, -0x6790(r2)
addi r4, r1, 0x10
stfs f0, 0x18(r1)
stfs f0, 0x14(r1)
stfs f0, 0x10(r1)
stfs f0, 0x24(r1)
stfs f0, 0x20(r1)
stfs f0, 0x1C(r1)
stfs f0, 0x30(r1)
stfs f0, 0x2C(r1)
stfs f0, 0x28(r1)
lwz r12, 0x4(r3)
lwz r12, 0x30(r12)
mtlr r12
blrl
lwz r3, 0x30(r31)
cmplwi r3, 0
beq- .loc_0x90
lwz r12, 0x4(r3)
addi r4, r1, 0x10
lwz r12, 0x34(r12)
mtlr r12
blrl
cmplwi r3, 0
beq- .loc_0x90
stw r31, 0x64(r3)
lwz r4, 0x88(r31)
addi r0, r4, 0x1
stw r0, 0x88(r31)
stw r3, 0x84(r31)
.loc_0x90:
lwz r0, 0x44(r1)
lwz r31, 0x3C(r1)
addi r1, r1, 0x40
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE070
* Size: 0001B8
*/
void GenTypeOne::setBirthInfo(BirthInfo&, Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0xB8(r1)
stw r31, 0xB4(r1)
addi r31, r5, 0
stw r30, 0xB0(r1)
mr r30, r4
stw r29, 0xAC(r1)
addi r29, r3, 0
lfs f0, -0x6790(r2)
stfs f0, 0x88(r1)
stfs f0, 0x84(r1)
stfs f0, 0x80(r1)
lwz r4, 0x20(r5)
cmplwi r4, 0
beq- .loc_0x5C
lwz r12, 0x4(r4)
addi r5, r31, 0
addi r3, r1, 0x80
lwz r12, 0x30(r12)
mtlr r12
blrl
b .loc_0x8C
.loc_0x5C:
lfs f1, 0x98(r31)
lfs f0, 0xA4(r31)
lfs f3, 0x9C(r31)
lfs f2, 0xA8(r31)
fadds f0, f1, f0
lfs f4, 0xA0(r31)
lfs f1, 0xAC(r31)
fadds f2, f3, f2
stfs f0, 0x80(r1)
fadds f0, f4, f1
stfs f2, 0x84(r1)
stfs f0, 0x88(r1)
.loc_0x8C:
lfs f0, -0x6790(r2)
lis r4, 0x4330
stfs f0, 0x7C(r1)
stfs f0, 0x78(r1)
stfs f0, 0x74(r1)
lfd f4, -0x6788(r2)
lwz r0, 0x44(r29)
lfs f2, -0x6778(r2)
xoris r0, r0, 0x8000
lwz r3, 0x54(r29)
stw r0, 0x94(r1)
xoris r0, r3, 0x8000
lwz r5, 0x64(r29)
stw r4, 0x90(r1)
xoris r3, r5, 0x8000
lfs f5, -0x677C(r2)
lfd f0, 0x90(r1)
stw r0, 0x9C(r1)
fsubs f0, f0, f4
stw r3, 0xA4(r1)
fdivs f0, f0, f2
stw r4, 0x98(r1)
stw r4, 0xA0(r1)
lfd f1, 0x98(r1)
lfd f3, 0xA0(r1)
fsubs f1, f1, f4
fmuls f0, f5, f0
fsubs f3, f3, f4
fdivs f1, f1, f2
stfs f0, 0x74(r1)
fdivs f0, f3, f2
fmuls f1, f5, f1
fmuls f0, f5, f0
stfs f1, 0x78(r1)
stfs f0, 0x7C(r1)
lfs f1, 0x98(r31)
lfs f0, 0xA4(r31)
lwz r3, 0x80(r1)
fadds f0, f1, f0
lwz r0, 0x84(r1)
stfs f0, 0x3C(r1)
lfs f0, 0x3C(r1)
stfs f0, 0x58(r1)
lfs f1, 0x9C(r31)
lfs f0, 0xA8(r31)
fadds f0, f1, f0
stfs f0, 0x5C(r1)
lfs f1, 0xA0(r31)
lfs f0, 0xAC(r31)
fadds f0, f1, f0
stfs f0, 0x60(r1)
stw r3, 0x0(r30)
stw r0, 0x4(r30)
lwz r0, 0x88(r1)
stw r0, 0x8(r30)
lwz r3, 0x74(r1)
lwz r0, 0x78(r1)
stw r3, 0xC(r30)
stw r0, 0x10(r30)
lwz r0, 0x7C(r1)
stw r0, 0x14(r30)
lwz r3, 0x58(r1)
lwz r0, 0x5C(r1)
stw r3, 0x18(r30)
stw r0, 0x1C(r30)
lwz r0, 0x60(r1)
stw r0, 0x20(r30)
stw r31, 0x24(r30)
lwz r0, 0xBC(r1)
lwz r31, 0xB4(r1)
lwz r30, 0xB0(r1)
lwz r29, 0xAC(r1)
addi r1, r1, 0xB8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE228
* Size: 000168
*/
void GenTypeOne::render(Graphics&, Generator*)
{
/*
.loc_0x0:
mflr r0
lis r8, 0x4330
stw r0, 0x4(r1)
stwu r1, -0x120(r1)
stw r31, 0x11C(r1)
addi r31, r4, 0
addi r6, r1, 0x4C
lfs f0, -0x6790(r2)
addi r4, r1, 0x74
stfs f0, 0x7C(r1)
stfs f0, 0x78(r1)
stfs f0, 0x74(r1)
stfs f0, 0x70(r1)
stfs f0, 0x6C(r1)
stfs f0, 0x68(r1)
lfd f4, -0x6788(r2)
lwz r0, 0x44(r3)
lwz r7, 0x54(r3)
xoris r0, r0, 0x8000
lfs f2, -0x6778(r2)
stw r0, 0x104(r1)
xoris r0, r7, 0x8000
lwz r3, 0x64(r3)
stw r8, 0x100(r1)
xoris r7, r3, 0x8000
lfs f5, -0x677C(r2)
lfd f0, 0x100(r1)
addi r3, r1, 0xC0
stw r0, 0x10C(r1)
fsubs f0, f0, f4
stw r7, 0x114(r1)
fdivs f0, f0, f2
stw r8, 0x108(r1)
stw r8, 0x110(r1)
lfd f1, 0x108(r1)
lfd f3, 0x110(r1)
fsubs f1, f1, f4
fmuls f0, f5, f0
fsubs f3, f3, f4
fdivs f1, f1, f2
stfs f0, 0x68(r1)
fdivs f0, f3, f2
fmuls f1, f5, f1
fmuls f0, f5, f0
stfs f1, 0x6C(r1)
stfs f0, 0x70(r1)
lfs f0, -0x6768(r2)
stfs f0, 0x74(r1)
stfs f0, 0x78(r1)
stfs f0, 0x7C(r1)
lfs f1, 0x98(r5)
lfs f0, 0xA4(r5)
lfs f4, 0xA0(r5)
fadds f0, f1, f0
lfs f3, 0xAC(r5)
lfs f2, 0x9C(r5)
lfs f1, 0xA8(r5)
fadds f3, f4, f3
stfs f0, 0x3C(r1)
fadds f1, f2, f1
addi r5, r1, 0x68
lfs f0, 0x3C(r1)
stfs f0, 0x4C(r1)
stfs f1, 0x50(r1)
stfs f3, 0x54(r1)
bl -0xA0238
mr r3, r31
lwz r12, 0x3B4(r31)
addi r4, r1, 0xC0
addi r5, r1, 0x80
lwz r12, 0x70(r12)
mtlr r12
blrl
mr r3, r31
lwz r12, 0x3B4(r31)
addi r4, r1, 0x80
li r5, 0
lwz r12, 0x74(r12)
mtlr r12
blrl
lwz r3, 0x2F58(r13)
mr r4, r31
lwz r5, 0x2E4(r31)
li r6, 0
bl -0xADF0C
lwz r0, 0x124(r1)
lwz r31, 0x11C(r1)
addi r1, r1, 0x120
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE390
* Size: 000008
*/
void GenTypeAtOnce::getMaxCount()
{
/*
.loc_0x0:
lwz r3, 0x44(r3)
blr
*/
}
/*
* --INFO--
* Address: 800DE398
* Size: 0000E4
*/
void GenTypeAtOnce::init(Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x58(r1)
stfd f31, 0x50(r1)
stw r31, 0x4C(r1)
stw r30, 0x48(r1)
li r30, 0
stw r29, 0x44(r1)
addi r29, r4, 0
stw r28, 0x40(r1)
mr r28, r3
lfs f31, -0x6790(r2)
lwz r31, 0x44(r3)
b .loc_0xB8
.loc_0x38:
stfs f31, 0x1C(r1)
addi r3, r28, 0
addi r5, r29, 0
stfs f31, 0x18(r1)
addi r4, r1, 0x14
stfs f31, 0x14(r1)
stfs f31, 0x28(r1)
stfs f31, 0x24(r1)
stfs f31, 0x20(r1)
stfs f31, 0x34(r1)
stfs f31, 0x30(r1)
stfs f31, 0x2C(r1)
lwz r12, 0x4(r28)
lwz r12, 0x30(r12)
mtlr r12
blrl
lwz r3, 0x30(r29)
cmplwi r3, 0
beq- .loc_0xB4
lwz r12, 0x4(r3)
addi r4, r1, 0x14
lwz r12, 0x34(r12)
mtlr r12
blrl
cmplwi r3, 0
beq- .loc_0xB4
stw r29, 0x64(r3)
lwz r4, 0x88(r29)
addi r0, r4, 0x1
stw r0, 0x88(r29)
stw r3, 0x84(r29)
.loc_0xB4:
addi r30, r30, 0x1
.loc_0xB8:
cmpw r30, r31
blt+ .loc_0x38
lwz r0, 0x5C(r1)
lfd f31, 0x50(r1)
lwz r31, 0x4C(r1)
lwz r30, 0x48(r1)
lwz r29, 0x44(r1)
lwz r28, 0x40(r1)
addi r1, r1, 0x58
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE47C
* Size: 000138
*/
void GenTypeAtOnce::setBirthInfo(BirthInfo&, Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x60(r1)
stw r31, 0x5C(r1)
addi r31, r5, 0
stw r30, 0x58(r1)
addi r30, r4, 0
lfs f0, -0x6790(r2)
stfs f0, 0x54(r1)
stfs f0, 0x50(r1)
stfs f0, 0x4C(r1)
lwz r4, 0x20(r5)
cmplwi r4, 0
beq- .loc_0x54
lwz r12, 0x4(r4)
addi r5, r31, 0
addi r3, r1, 0x4C
lwz r12, 0x30(r12)
mtlr r12
blrl
b .loc_0x84
.loc_0x54:
lfs f1, 0x98(r31)
lfs f0, 0xA4(r31)
lfs f3, 0x9C(r31)
lfs f2, 0xA8(r31)
fadds f0, f1, f0
lfs f4, 0xA0(r31)
lfs f1, 0xAC(r31)
fadds f2, f3, f2
stfs f0, 0x4C(r1)
fadds f0, f4, f1
stfs f2, 0x50(r1)
stfs f0, 0x54(r1)
.loc_0x84:
lfs f1, 0x98(r31)
lfs f0, 0xA4(r31)
lfs f2, -0x39F4(r13)
fadds f3, f1, f0
lfs f1, -0x39F0(r13)
lfs f0, -0x39EC(r13)
lwz r3, 0x4C(r1)
stfs f3, 0x20(r1)
lwz r0, 0x50(r1)
lfs f3, 0x20(r1)
stfs f3, 0x3C(r1)
lfs f4, 0x9C(r31)
lfs f3, 0xA8(r31)
fadds f3, f4, f3
stfs f3, 0x40(r1)
lfs f4, 0xA0(r31)
lfs f3, 0xAC(r31)
stfs f2, 0x30(r1)
fadds f2, f4, f3
stfs f1, 0x34(r1)
stfs f2, 0x44(r1)
stfs f0, 0x38(r1)
stw r3, 0x0(r30)
stw r0, 0x4(r30)
lwz r0, 0x54(r1)
stw r0, 0x8(r30)
lwz r3, 0x30(r1)
lwz r0, 0x34(r1)
stw r3, 0xC(r30)
stw r0, 0x10(r30)
lwz r0, 0x38(r1)
stw r0, 0x14(r30)
lwz r3, 0x3C(r1)
lwz r0, 0x40(r1)
stw r3, 0x18(r30)
stw r0, 0x1C(r30)
lwz r0, 0x44(r1)
stw r0, 0x20(r30)
stw r31, 0x24(r30)
lwz r0, 0x64(r1)
lwz r31, 0x5C(r1)
lwz r30, 0x58(r1)
addi r1, r1, 0x60
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE5B4
* Size: 000008
*/
void GenTypeInitRand::getMaxCount()
{
/*
.loc_0x0:
lwz r3, 0x54(r3)
blr
*/
}
/*
* --INFO--
* Address: 800DE5BC
* Size: 000144
*/
void GenTypeInitRand::init(Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x78(r1)
stfd f31, 0x70(r1)
stw r31, 0x6C(r1)
stw r30, 0x68(r1)
stw r29, 0x64(r1)
addi r29, r4, 0
stw r28, 0x60(r1)
addi r28, r3, 0
bl 0x139A8C
xoris r0, r3, 0x8000
lfd f3, -0x6788(r2)
stw r0, 0x5C(r1)
lis r3, 0x4330
lfs f0, -0x6770(r2)
li r30, 0
stw r3, 0x58(r1)
lwz r4, 0x44(r28)
lfd f1, 0x58(r1)
lwz r0, 0x54(r28)
fsubs f2, f1, f3
lfs f1, -0x6774(r2)
sub r0, r0, r4
lfs f31, -0x6790(r2)
xoris r0, r0, 0x8000
fdivs f2, f2, f0
stw r0, 0x54(r1)
stw r3, 0x50(r1)
lfd f0, 0x50(r1)
fmuls f1, f1, f2
fsubs f0, f0, f3
fmuls f0, f1, f0
fctiwz f0, f0
stfd f0, 0x48(r1)
lwz r0, 0x4C(r1)
add r31, r4, r0
b .loc_0x118
.loc_0x98:
stfs f31, 0x28(r1)
addi r3, r28, 0
addi r5, r29, 0
stfs f31, 0x24(r1)
addi r4, r1, 0x20
stfs f31, 0x20(r1)
stfs f31, 0x34(r1)
stfs f31, 0x30(r1)
stfs f31, 0x2C(r1)
stfs f31, 0x40(r1)
stfs f31, 0x3C(r1)
stfs f31, 0x38(r1)
lwz r12, 0x4(r28)
lwz r12, 0x30(r12)
mtlr r12
blrl
lwz r3, 0x30(r29)
cmplwi r3, 0
beq- .loc_0x114
lwz r12, 0x4(r3)
addi r4, r1, 0x20
lwz r12, 0x34(r12)
mtlr r12
blrl
cmplwi r3, 0
beq- .loc_0x114
stw r29, 0x64(r3)
lwz r4, 0x88(r29)
addi r0, r4, 0x1
stw r0, 0x88(r29)
stw r3, 0x84(r29)
.loc_0x114:
addi r30, r30, 0x1
.loc_0x118:
cmpw r30, r31
blt+ .loc_0x98
lwz r0, 0x7C(r1)
lfd f31, 0x70(r1)
lwz r31, 0x6C(r1)
lwz r30, 0x68(r1)
lwz r29, 0x64(r1)
lwz r28, 0x60(r1)
addi r1, r1, 0x78
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE700
* Size: 000138
*/
void GenTypeInitRand::setBirthInfo(BirthInfo&, Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x60(r1)
stw r31, 0x5C(r1)
addi r31, r5, 0
stw r30, 0x58(r1)
addi r30, r4, 0
lfs f0, -0x6790(r2)
stfs f0, 0x54(r1)
stfs f0, 0x50(r1)
stfs f0, 0x4C(r1)
lwz r4, 0x20(r5)
cmplwi r4, 0
beq- .loc_0x54
lwz r12, 0x4(r4)
addi r5, r31, 0
addi r3, r1, 0x4C
lwz r12, 0x30(r12)
mtlr r12
blrl
b .loc_0x84
.loc_0x54:
lfs f1, 0x98(r31)
lfs f0, 0xA4(r31)
lfs f3, 0x9C(r31)
lfs f2, 0xA8(r31)
fadds f0, f1, f0
lfs f4, 0xA0(r31)
lfs f1, 0xAC(r31)
fadds f2, f3, f2
stfs f0, 0x4C(r1)
fadds f0, f4, f1
stfs f2, 0x50(r1)
stfs f0, 0x54(r1)
.loc_0x84:
lfs f1, 0x98(r31)
lfs f0, 0xA4(r31)
lfs f2, -0x39E8(r13)
fadds f3, f1, f0
lfs f1, -0x39E4(r13)
lfs f0, -0x39E0(r13)
lwz r3, 0x4C(r1)
stfs f3, 0x20(r1)
lwz r0, 0x50(r1)
lfs f3, 0x20(r1)
stfs f3, 0x3C(r1)
lfs f4, 0x9C(r31)
lfs f3, 0xA8(r31)
fadds f3, f4, f3
stfs f3, 0x40(r1)
lfs f4, 0xA0(r31)
lfs f3, 0xAC(r31)
stfs f2, 0x30(r1)
fadds f2, f4, f3
stfs f1, 0x34(r1)
stfs f2, 0x44(r1)
stfs f0, 0x38(r1)
stw r3, 0x0(r30)
stw r0, 0x4(r30)
lwz r0, 0x54(r1)
stw r0, 0x8(r30)
lwz r3, 0x30(r1)
lwz r0, 0x34(r1)
stw r3, 0xC(r30)
stw r0, 0x10(r30)
lwz r0, 0x38(r1)
stw r0, 0x14(r30)
lwz r3, 0x3C(r1)
lwz r0, 0x40(r1)
stw r3, 0x18(r30)
stw r0, 0x1C(r30)
lwz r0, 0x44(r1)
stw r0, 0x20(r30)
stw r31, 0x24(r30)
lwz r0, 0x64(r1)
lwz r31, 0x5C(r1)
lwz r30, 0x58(r1)
addi r1, r1, 0x60
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE838
* Size: 000088
*/
void GenAreaPoint::getPos(Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x50(r1)
stw r31, 0x4C(r1)
addi r31, r3, 0
addi r0, r1, 0x24
lfs f1, 0xA0(r5)
addi r6, r1, 0x28
lfs f0, 0xAC(r5)
addi r4, r1, 0x20
addi r3, r1, 0x2C
fadds f0, f1, f0
stfs f0, 0x28(r1)
lfs f1, 0x9C(r5)
lfs f0, 0xA8(r5)
fadds f0, f1, f0
stfs f0, 0x24(r1)
lfs f1, 0x98(r5)
lfs f0, 0xA4(r5)
mr r5, r0
fadds f0, f1, f0
stfs f0, 0x20(r1)
bl -0xA7774
lfs f1, 0x30(r1)
lfs f2, 0x34(r1)
lfs f0, 0x2C(r1)
stfs f0, 0x0(r31)
stfs f1, 0x4(r31)
stfs f2, 0x8(r31)
lwz r0, 0x54(r1)
lwz r31, 0x4C(r1)
addi r1, r1, 0x50
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DE8C0
* Size: 000004
*/
void GenAreaPoint::render(Graphics&, Generator*) { }
/*
* --INFO--
* Address: 800DE8C4
* Size: 0001A4
*/
void GenAreaCircle::getPos(Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0xC8(r1)
stfd f31, 0xC0(r1)
addi r0, r1, 0x3C
addi r6, r1, 0x40
stfd f30, 0xB8(r1)
stfd f29, 0xB0(r1)
stfd f28, 0xA8(r1)
stfd f27, 0xA0(r1)
stfd f26, 0x98(r1)
stw r31, 0x94(r1)
stw r30, 0x90(r1)
addi r30, r4, 0
stw r29, 0x8C(r1)
addi r29, r3, 0
addi r3, r1, 0x38
lfs f1, 0xA0(r5)
addi r4, r3, 0
lfs f0, 0xAC(r5)
addi r3, r1, 0x4C
fadds f0, f1, f0
stfs f0, 0x40(r1)
lfs f1, 0x9C(r5)
lfs f0, 0xA8(r5)
fadds f0, f1, f0
stfs f0, 0x3C(r1)
lfs f1, 0x98(r5)
lfs f0, 0xA4(r5)
mr r5, r0
fadds f0, f1, f0
stfs f0, 0x38(r1)
bl -0xA7828
lfs f31, 0x4C(r1)
lfs f30, 0x50(r1)
lfs f29, 0x54(r1)
bl 0x13971C
xoris r0, r3, 0x8000
lfd f3, -0x6788(r2)
stw r0, 0x84(r1)
lis r31, 0x4330
lfs f1, -0x6770(r2)
stw r31, 0x80(r1)
lfs f0, -0x6774(r2)
lfd f2, 0x80(r1)
fsubs f2, f2, f3
fdivs f1, f2, f1
fmuls f28, f0, f1
bl 0x1396EC
xoris r0, r3, 0x8000
lfs f2, -0x6774(r2)
stw r0, 0x7C(r1)
lfd f5, -0x6788(r2)
fsubs f1, f2, f28
stw r31, 0x78(r1)
lfs f3, -0x6770(r2)
lfd f4, 0x78(r1)
lfs f0, 0x30(r30)
fsubs f4, f4, f5
fdivs f3, f4, f3
fmuls f2, f2, f3
fmuls f1, f1, f2
fadds f27, f28, f1
fmuls f27, f27, f0
bl 0x1396AC
xoris r0, r3, 0x8000
lfd f4, -0x6788(r2)
stw r0, 0x74(r1)
lfs f3, -0x6770(r2)
stw r31, 0x70(r1)
lfs f2, -0x6774(r2)
lfd f1, 0x70(r1)
lfs f0, -0x677C(r2)
fsubs f4, f1, f4
lfs f1, -0x6768(r2)
fdivs f3, f4, f3
fmuls f2, f2, f3
fmuls f0, f0, f2
fmuls f26, f1, f0
fmr f1, f26
bl 0x13D150
fmuls f28, f27, f1
fmr f1, f26
bl 0x13D2D8
fmuls f2, f27, f1
lfs f1, -0x39DC(r13)
fadds f0, f28, f29
fadds f3, f1, f30
fadds f1, f2, f31
stfs f1, 0x0(r29)
stfs f3, 0x4(r29)
stfs f0, 0x8(r29)
lwz r0, 0xCC(r1)
lfd f31, 0xC0(r1)
lfd f30, 0xB8(r1)
lfd f29, 0xB0(r1)
lfd f28, 0xA8(r1)
lfd f27, 0xA0(r1)
lfd f26, 0x98(r1)
lwz r31, 0x94(r1)
lwz r30, 0x90(r1)
lwz r29, 0x8C(r1)
addi r1, r1, 0xC8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DEA68
* Size: 000130
*/
void GenAreaCircle::render(Graphics&, Generator*)
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0xE8(r1)
stw r31, 0xE4(r1)
addi r31, r4, 0
addi r0, r1, 0x34
lfs f0, -0x6790(r2)
addi r6, r1, 0x40
addi r4, r1, 0x50
stfs f0, 0x58(r1)
stfs f0, 0x54(r1)
stfs f0, 0x50(r1)
lfs f1, -0x6764(r2)
lfs f2, 0x30(r3)
addi r3, r1, 0x9C
lfs f0, -0x39D8(r13)
fdivs f1, f2, f1
stfs f1, 0x50(r1)
stfs f0, 0x54(r1)
stfs f1, 0x58(r1)
lfs f1, 0x98(r5)
lfs f0, 0xA4(r5)
lfs f5, 0xA0(r5)
fadds f1, f1, f0
lfs f4, 0xAC(r5)
lfs f3, 0x9C(r5)
lfs f2, 0xA8(r5)
fadds f4, f5, f4
stfs f1, 0x2C(r1)
fadds f3, f3, f2
lfs f0, -0x39D4(r13)
mr r5, r0
lfs f2, 0x2C(r1)
stfs f0, 0x34(r1)
lfs f1, -0x39D0(r13)
stfs f2, 0x40(r1)
lfs f0, -0x39CC(r13)
stfs f3, 0x44(r1)
stfs f1, 0x38(r1)
stfs f4, 0x48(r1)
stfs f0, 0x3C(r1)
bl -0xA0A18
mr r3, r31
lwz r12, 0x3B4(r31)
addi r4, r1, 0x9C
addi r5, r1, 0x5C
lwz r12, 0x70(r12)
mtlr r12
blrl
mr r3, r31
lwz r12, 0x3B4(r31)
addi r4, r1, 0x5C
li r5, 0
lwz r12, 0x74(r12)
mtlr r12
blrl
li r5, 0xFF
lwz r3, 0x2F5C(r13)
stb r5, 0x4C(r1)
li r0, 0
addi r4, r31, 0
stb r5, 0x4D(r1)
li r6, 0
stb r0, 0x4E(r1)
stb r5, 0x4F(r1)
lwz r3, 0x44(r3)
lwz r0, 0x4C(r1)
stw r0, 0x2C(r3)
lwz r3, 0x2F5C(r13)
lwz r5, 0x2E4(r31)
bl -0xAE714
lwz r0, 0xEC(r1)
lwz r31, 0xE4(r1)
addi r1, r1, 0xE8
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DEB98
* Size: 000058
*/
GeneratorList::GeneratorList()
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
stw r30, 0x10(r1)
addi r30, r3, 0
li r3, 0xB8
bl -0x97BB0
addi r31, r3, 0
mr. r3, r31
beq- .loc_0x38
lis r4, 0x2
subi r4, r4, 0x1DC0
bl -0x2F7C
.loc_0x38:
stw r31, 0x0(r30)
mr r3, r30
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DEBF0
* Size: 000038
*/
void GeneratorList::findGenerator(int)
{
/*
.loc_0x0:
lwz r3, 0x0(r3)
lwz r3, 0x10(r3)
b .loc_0x28
.loc_0xC:
lbz r0, 0xB0(r3)
cmplwi r0, 0
bne- .loc_0x24
lwz r0, 0xB4(r3)
cmpw r0, r4
beqlr-
.loc_0x24:
lwz r3, 0xC(r3)
.loc_0x28:
cmplwi r3, 0
bne+ .loc_0xC
li r3, 0
blr
*/
}
/*
* --INFO--
* Address: 800DEC28
* Size: 000070
*/
void GeneratorList::createRamGenerators()
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x20(r1)
stw r31, 0x1C(r1)
li r31, 0
stw r30, 0x18(r1)
li r30, 0x1
stw r29, 0x14(r1)
lwz r3, 0x0(r3)
lwz r29, 0x10(r3)
b .loc_0x4C
.loc_0x2C:
lbz r0, 0xB0(r29)
cmplwi r0, 0
bne- .loc_0x48
stb r30, 0x3070(r13)
mr r3, r29
bl -0x2D10
stb r31, 0x3070(r13)
.loc_0x48:
lwz r29, 0xC(r29)
.loc_0x4C:
cmplwi r29, 0
bne+ .loc_0x2C
lwz r0, 0x24(r1)
lwz r31, 0x1C(r1)
lwz r30, 0x18(r1)
lwz r29, 0x14(r1)
addi r1, r1, 0x20
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DEC98
* Size: 0000B0
*/
void GeneratorList::updateUseList()
{
/*
.loc_0x0:
mflr r0
stw r0, 0x4(r1)
stwu r1, -0x18(r1)
stw r31, 0x14(r1)
stw r30, 0x10(r1)
lwz r4, 0x0(r3)
lis r3, 0x803A
subi r31, r3, 0x2848
lwz r30, 0x10(r4)
b .loc_0x90
.loc_0x28:
lbz r0, 0xB0(r30)
cmplwi r0, 0
bne- .loc_0x8C
lwz r3, 0x94(r30)
cmpwi r3, -0x1
bne- .loc_0x48
li r0, 0
b .loc_0x60
.loc_0x48:
lwz r0, 0x2FC(r31)
cmpw r3, r0
bge- .loc_0x5C
li r0, 0x1
b .loc_0x60
.loc_0x5C:
li r0, 0
.loc_0x60:
rlwinm. r0,r0,0,24,31
bne- .loc_0x8C
lwz r3, 0x30(r30)
cmplwi r3, 0
beq- .loc_0x8C
lwz r12, 0x4(r3)
addi r4, r30, 0
li r5, 0x1
lwz r12, 0x24(r12)
mtlr r12
blrl
.loc_0x8C:
lwz r30, 0xC(r30)
.loc_0x90:
cmplwi r30, 0
bne+ .loc_0x28
lwz r0, 0x1C(r1)
lwz r31, 0x14(r1)
lwz r30, 0x10(r1)
addi r1, r1, 0x18
mtlr r0
blr
*/
}
/*
* --INFO--
* Address: 800DED48
* Size: 000008
*/
void GenAreaCircle::getRadius()
{
/*
.loc_0x0:
lfs f1, 0x30(r3)
blr
*/
}
/*
* --INFO--
* Address: 800DED50
* Size: 000004
*/
void GenArea::update(Generator*) { }
/*
* --INFO--
* Address: 800DED54
* Size: 000008
*/
void GenArea::getRadius()
{
/*
.loc_0x0:
lfs f1, -0x6790(r2)
blr
*/
}
/*
* --INFO--
* Address: 800DED5C
* Size: 000004
*/
void GenType::update(Generator*) { }
/*
* --INFO--
* Address: 800DED60
* Size: 000008
*/
u32 GenTypeOne::getMaxCount() { return 0x1; }
| 20.04123 | 60 | 0.457014 | doldecomp |
b2c05459049314c3b6bc9786afb6fe5700ab9f30 | 5,908 | cpp | C++ | source/D2Common/src/DataTbls/InvTbls.cpp | eezstreet/D2MOO | 28a30aecc69bf43c80e6757a94d533fb37634b68 | [
"MIT"
] | 42 | 2020-12-26T00:21:49.000Z | 2022-03-21T03:48:03.000Z | source/D2Common/src/DataTbls/InvTbls.cpp | eezstreet/D2MOO | 28a30aecc69bf43c80e6757a94d533fb37634b68 | [
"MIT"
] | 24 | 2020-12-26T09:46:51.000Z | 2021-09-05T16:22:43.000Z | source/D2Common/src/DataTbls/InvTbls.cpp | eezstreet/D2MOO | 28a30aecc69bf43c80e6757a94d533fb37634b68 | [
"MIT"
] | 19 | 2020-12-26T10:06:20.000Z | 2022-03-27T17:20:09.000Z | #include <DataTbls/InvTbls.h>
#include <D2DataTbls.h>
//D2Common.0x6FD542D0
void __fastcall DATATBLS_LoadInventoryTxt(void* pMemPool)
{
D2BinFieldStrc pTbl[] =
{
{ "invLeft", TXTFIELD_DWORD, 0, 0, NULL },
{ "invRight", TXTFIELD_DWORD, 0, 4, NULL },
{ "invTop", TXTFIELD_DWORD, 0, 8, NULL },
{ "invBottom", TXTFIELD_DWORD, 0, 12, NULL },
{ "gridX", TXTFIELD_BYTE, 0, 16, NULL },
{ "gridY", TXTFIELD_BYTE, 0, 17, NULL },
{ "gridLeft", TXTFIELD_DWORD, 0, 20, NULL },
{ "gridRight", TXTFIELD_DWORD, 0, 24, NULL },
{ "gridTop", TXTFIELD_DWORD, 0, 28, NULL },
{ "gridBottom", TXTFIELD_DWORD, 0, 32, NULL },
{ "gridBoxWidth", TXTFIELD_BYTE, 0, 36, NULL },
{ "gridBoxHeight", TXTFIELD_BYTE, 0, 37, NULL },
{ "rArmLeft", TXTFIELD_DWORD, 0, 40, NULL },
{ "rArmRight", TXTFIELD_DWORD, 0, 44, NULL },
{ "rArmTop", TXTFIELD_DWORD, 0, 48, NULL },
{ "rArmBottom", TXTFIELD_DWORD, 0, 52, NULL },
{ "rArmWidth", TXTFIELD_BYTE, 0, 56, NULL },
{ "rArmHeight", TXTFIELD_BYTE, 0, 57, NULL },
{ "torsoLeft", TXTFIELD_DWORD, 0, 60, NULL },
{ "torsoRight", TXTFIELD_DWORD, 0, 64, NULL },
{ "torsoTop", TXTFIELD_DWORD, 0, 68, NULL },
{ "torsoBottom", TXTFIELD_DWORD, 0, 72, NULL },
{ "torsoWidth", TXTFIELD_BYTE, 0, 76, NULL },
{ "torsoHeight", TXTFIELD_BYTE, 0, 77, NULL },
{ "lArmLeft", TXTFIELD_DWORD, 0, 80, NULL },
{ "lArmRight", TXTFIELD_DWORD, 0, 84, NULL },
{ "lArmTop", TXTFIELD_DWORD, 0, 88, NULL },
{ "lArmBottom", TXTFIELD_DWORD, 0, 92, NULL },
{ "lArmWidth", TXTFIELD_BYTE, 0, 96, NULL },
{ "lArmHeight", TXTFIELD_BYTE, 0, 97, NULL },
{ "headLeft", TXTFIELD_DWORD, 0, 100, NULL },
{ "headRight", TXTFIELD_DWORD, 0, 104, NULL },
{ "headTop", TXTFIELD_DWORD, 0, 108, NULL },
{ "headBottom", TXTFIELD_DWORD, 0, 112, NULL },
{ "headWidth", TXTFIELD_BYTE, 0, 116, NULL },
{ "headHeight", TXTFIELD_BYTE, 0, 117, NULL },
{ "neckLeft", TXTFIELD_DWORD, 0, 120, NULL },
{ "neckRight", TXTFIELD_DWORD, 0, 124, NULL },
{ "neckTop", TXTFIELD_DWORD, 0, 128, NULL },
{ "neckBottom", TXTFIELD_DWORD, 0, 132, NULL },
{ "neckWidth", TXTFIELD_BYTE, 0, 136, NULL },
{ "neckHeight", TXTFIELD_BYTE, 0, 137, NULL },
{ "rHandLeft", TXTFIELD_DWORD, 0, 140, NULL },
{ "rHandRight", TXTFIELD_DWORD, 0, 144, NULL },
{ "rHandTop", TXTFIELD_DWORD, 0, 148, NULL },
{ "rHandBottom", TXTFIELD_DWORD, 0, 152, NULL },
{ "rHandWidth", TXTFIELD_BYTE, 0, 156, NULL },
{ "rHandHeight", TXTFIELD_BYTE, 0, 157, NULL },
{ "lHandLeft", TXTFIELD_DWORD, 0, 160, NULL },
{ "lHandRight", TXTFIELD_DWORD, 0, 164, NULL },
{ "lHandTop", TXTFIELD_DWORD, 0, 168, NULL },
{ "lHandBottom", TXTFIELD_DWORD, 0, 172, NULL },
{ "lHandWidth", TXTFIELD_BYTE, 0, 176, NULL },
{ "lHandHeight", TXTFIELD_BYTE, 0, 177, NULL },
{ "beltLeft", TXTFIELD_DWORD, 0, 180, NULL },
{ "beltRight", TXTFIELD_DWORD, 0, 184, NULL },
{ "beltTop", TXTFIELD_DWORD, 0, 188, NULL },
{ "beltBottom", TXTFIELD_DWORD, 0, 192, NULL },
{ "beltWidth", TXTFIELD_BYTE, 0, 196, NULL },
{ "beltHeight", TXTFIELD_BYTE, 0, 197, NULL },
{ "feetLeft", TXTFIELD_DWORD, 0, 200, NULL },
{ "feetRight", TXTFIELD_DWORD, 0, 204, NULL },
{ "feetTop", TXTFIELD_DWORD, 0, 208, NULL },
{ "feetBottom", TXTFIELD_DWORD, 0, 212, NULL },
{ "feetWidth", TXTFIELD_BYTE, 0, 216, NULL },
{ "feetHeight", TXTFIELD_BYTE, 0, 217, NULL },
{ "glovesLeft", TXTFIELD_DWORD, 0, 220, NULL },
{ "glovesRight", TXTFIELD_DWORD, 0, 224, NULL },
{ "glovesTop", TXTFIELD_DWORD, 0, 228, NULL },
{ "glovesBottom", TXTFIELD_DWORD, 0, 232, NULL },
{ "glovesWidth", TXTFIELD_BYTE, 0, 236, NULL },
{ "glovesHeight", TXTFIELD_BYTE, 0, 237, NULL },
{ "end", TXTFIELD_NONE, 0, 0, NULL },
};
sgptDataTables->pInventoryTxt = (D2InventoryTxt*)DATATBLS_CompileTxt(pMemPool, "inventory", pTbl, &sgptDataTables->nInventoryTxtRecordCount, sizeof(D2InventoryTxt));
D2_ASSERT(sgptDataTables->nInventoryTxtRecordCount == NUM_INVENTORY_PAGE_STATS * NUM_GAME_RESOLUTIONS);
}
//D2Common.0x6FD54F10
void __fastcall DATATBLS_UnloadInventoryTxt()
{
DATATBLS_UnloadBin(sgptDataTables->pInventoryTxt);
}
//D2Common.0x6FD54F20 (#10635)
void __stdcall DATATBLS_GetInventoryRect(int nInventoryTxtId, int bHigherRes, D2InvRectStrc* pInvRect)
{
D2_ASSERT(sgptDataTables->pInventoryTxt);
const int nIndex = nInventoryTxtId + 16 * bHigherRes;
D2_ASSERT(nIndex < sgptDataTables->nInventoryTxtRecordCount);
const D2InventoryTxt* pInventoryTxtRecord = &sgptDataTables->pInventoryTxt[nIndex];
D2_ASSERT(pInventoryTxtRecord);
pInvRect->nLeft = pInventoryTxtRecord->pRect.nLeft;
pInvRect->nRight = pInventoryTxtRecord->pRect.nRight;
pInvRect->nTop = pInventoryTxtRecord->pRect.nTop;
pInvRect->nBottom = pInventoryTxtRecord->pRect.nBottom;
}
//D2Common.0x6FD54FB0 (#10636)
void __stdcall DATATBLS_GetInventoryGridInfo(int nInventoryTxtId, int bHigherRes, D2InventoryGridInfoStrc* pInventoryGridInfo)
{
D2InventoryTxt* pInventoryTxtRecord = NULL;
int nIndex = nInventoryTxtId + 16 * bHigherRes;
D2_ASSERT(sgptDataTables->pInventoryTxt);
D2_ASSERT(nIndex < sgptDataTables->nInventoryTxtRecordCount);
pInventoryTxtRecord = &sgptDataTables->pInventoryTxt[nIndex];
D2_ASSERT(pInventoryTxtRecord);
memcpy(pInventoryGridInfo, &pInventoryTxtRecord->pGridInfo, sizeof(D2InventoryGridInfoStrc));
}
//D2Common.0x6FD55030 (#10637)
void __stdcall DATATBLS_GetInventoryComponentGrid(int nInventoryTxtId, int bHigherRes, D2InvCompGridStrc* pInvCompGrid, int nComponent)
{
int nIndex = nInventoryTxtId + 16 * bHigherRes;
D2_ASSERT(sgptDataTables->pInventoryTxt);
D2_ASSERT(nIndex < sgptDataTables->nInventoryTxtRecordCount);
const D2InventoryTxt* pInventoryTxtRecord = &sgptDataTables->pInventoryTxt[nIndex];
D2_ASSERT(pInventoryTxtRecord);
const D2InvCompGridStrc* ptBodyStats = &pInventoryTxtRecord->pComponents[nComponent];
D2_ASSERT(ptBodyStats);
memcpy(pInvCompGrid, ptBodyStats, sizeof(D2InvCompGridStrc));
}
| 41.900709 | 166 | 0.703453 | eezstreet |
b2c848c2e8aaff78d5716b66b2579490cc703a50 | 7,769 | cpp | C++ | src/cSteamHTTP.cpp | thecocce/steamwrapper | 3836739a0cc61955cc88fa0539f87f9bdc0a684c | [
"MIT"
] | 32 | 2015-01-08T09:04:58.000Z | 2022-03-04T19:48:51.000Z | src/cSteamHTTP.cpp | AdriaanBoshoff/steamwrapper | 47997bcab31d2518525d5086f90ae7f6d127982a | [
"MIT"
] | null | null | null | src/cSteamHTTP.cpp | AdriaanBoshoff/steamwrapper | 47997bcab31d2518525d5086f90ae7f6d127982a | [
"MIT"
] | 10 | 2016-06-27T10:47:36.000Z | 2021-01-06T09:39:12.000Z | //----------------------------------------------------
// © 2015 Andrey Volia
//
// License: MIT
// Site: https://github.com/voliaandrey/steamwrapper
//----------------------------------------------------
#include "libMain.h"
// Initializes a new HTTP request, returning a handle to use in further operations on it. Requires
// the method (GET or POST) and the absolute URL for the request. Only http requests (ie, not https) are
// currently supported, so this string must start with http:// or https:// and should look like http://store.steampowered.com/app/250/
// or such.
HTTPRequestHandle SteamHTTP_CreateHTTPRequest( EHTTPMethod HTTPRequestMethod, const char *AbsoluteURL ){return SteamHTTP()->CreateHTTPRequest(HTTPRequestMethod,AbsoluteURL);};
// Set a context value for the request, which will be returned in the HTTPRequestCompleted_t callback after
// sending the request. This is just so the caller can easily keep track of which callbacks go with which request data.
bool SteamHTTP_SetHTTPRequestContextValue( HTTPRequestHandle Request, uint64 ContextValue ){return SteamHTTP()->SetHTTPRequestContextValue(Request,ContextValue);};
// Set a timeout in seconds for the HTTP request, must be called prior to sending the request. Default
// timeout is 60 seconds if you don't call this. Returns false if the handle is invalid, or the request
// has already been sent.
bool SteamHTTP_SetHTTPRequestNetworkActivityTimeout( HTTPRequestHandle Request, uint32 TimeoutSeconds ){return SteamHTTP()->SetHTTPRequestNetworkActivityTimeout(Request,TimeoutSeconds);};
// Set a request header value for the request, must be called prior to sending the request. Will
// return false if the handle is invalid or the request is already sent.
bool SteamHTTP_SetHTTPRequestHeaderValue( HTTPRequestHandle Request, const char *HeaderName, const char *HeaderValue ){return SteamHTTP()->SetHTTPRequestHeaderValue(Request,HeaderName,HeaderValue);};
// Set a GET or POST parameter value on the request, which is set will depend on the EHTTPMethod specified
// when creating the request. Must be called prior to sending the request. Will return false if the
// handle is invalid or the request is already sent.
bool SteamHTTP_SetHTTPRequestGetOrPostParameter( HTTPRequestHandle Request, const char *ParamName, const char *ParamValue ){return SteamHTTP()->SetHTTPRequestGetOrPostParameter(Request,ParamName,ParamValue);};
// Sends the HTTP request, will return false on a bad handle, otherwise use SteamCallHandle to wait on
// asynchronous response via callback.
//
// Note: If the user is in offline mode in Steam, then this will add a only-if-cached cache-control
// header and only do a local cache lookup rather than sending any actual remote request.
bool SteamHTTP_SendHTTPRequest( HTTPRequestHandle Request, SteamAPICall_t *CallHandle ){return SteamHTTP()->SendHTTPRequest(Request,CallHandle);};
// Sends the HTTP request, will return false on a bad handle, otherwise use SteamCallHandle to wait on
// asynchronous response via callback for completion, and listen for HTTPRequestHeadersReceived and
// HTTPRequestDataReceived_t callbacks while streaming.
bool SteamHTTP_SendHTTPRequestAndStreamResponse( HTTPRequestHandle Request, SteamAPICall_t *CallHandle ){return SteamHTTP()->SendHTTPRequestAndStreamResponse(Request,CallHandle);};
// Defers a request you have sent, the actual HTTP client code may have many requests queued, and this will move
// the specified request to the tail of the queue. Returns false on invalid handle, or if the request is not yet sent.
bool SteamHTTP_DeferHTTPRequest( HTTPRequestHandle Request ){return SteamHTTP()->DeferHTTPRequest(Request);};
// Prioritizes a request you have sent, the actual HTTP client code may have many requests queued, and this will move
// the specified request to the head of the queue. Returns false on invalid handle, or if the request is not yet sent.
bool SteamHTTP_PrioritizeHTTPRequest( HTTPRequestHandle Request ){return SteamHTTP()->PrioritizeHTTPRequest(Request);};
// Checks if a response header is present in a HTTP response given a handle from HTTPRequestCompleted_t, also
// returns the size of the header value if present so the caller and allocate a correctly sized buffer for
// GetHTTPResponseHeaderValue.
bool SteamHTTP_GetHTTPResponseHeaderSize( HTTPRequestHandle Request, const char *HeaderName, uint32 *ResponseHeaderSize ){return SteamHTTP()->GetHTTPResponseHeaderSize(Request,HeaderName,ResponseHeaderSize);};
// Gets header values from a HTTP response given a handle from HTTPRequestCompleted, will return false if the
// header is not present or if your buffer is too small to contain it's value. You should first call
// BGetHTTPResponseHeaderSize to check for the presence of the header and to find out the size buffer needed.
bool SteamHTTP_GetHTTPResponseHeaderValue( HTTPRequestHandle Request, const char *HeaderName, uint8 *HeaderValueBuffer, uint32 BufferSize ){return SteamHTTP()->GetHTTPResponseHeaderValue(Request,HeaderName,HeaderValueBuffer,BufferSize);};
// Gets the size of the body data from a HTTP response given a handle from HTTPRequestCompleted_t, will return false if the
// handle is invalid.
bool SteamHTTP_GetHTTPResponseBodySize( HTTPRequestHandle Request, uint32 *BodySize ){return SteamHTTP()->GetHTTPResponseBodySize(Request,BodySize);};
// Gets the body data from a HTTP response given a handle from HTTPRequestCompleted, will return false if the
// handle is invalid or is to a streaming response, or if the provided buffer is not the correct size. Use GetHTTPResponseBodySize first to find out
// the correct buffer size to use.
bool SteamHTTP_GetHTTPResponseBodyData( HTTPRequestHandle Request, uint8 *BodyDataBuffer, uint32 BufferSize ){return SteamHTTP()->GetHTTPResponseBodyData(Request,BodyDataBuffer,BufferSize);};
// Gets the body data from a streaming HTTP response given a handle from HTTPRequestDataReceived_t. Will return false if the
// handle is invalid or is to a non-streaming response (meaning it wasn't sent with SendHTTPRequestAndStreamResponse), or if the buffer size and offset
// do not match the size and offset sent in HTTPRequestDataReceived.
bool SteamHTTP_GetHTTPStreamingResponseBodyData( HTTPRequestHandle Request, uint32 Offset, uint8 *BodyDataBuffer, uint32 BufferSize ){return SteamHTTP()->GetHTTPStreamingResponseBodyData(Request,Offset,BodyDataBuffer,BufferSize);};
// Releases an HTTP response handle, should always be called to free resources after receiving a HTTPRequestCompleted
// callback and finishing using the response.
bool SteamHTTP_ReleaseHTTPRequest( HTTPRequestHandle Request ){return SteamHTTP()->ReleaseHTTPRequest(Request);};
// Gets progress on downloading the body for the request. This will be zero unless a response header has already been
// received which included a content-length field. For responses that contain no content-length it will report
// zero for the duration of the request as the size is unknown until the connection closes.
bool SteamHTTP_GetHTTPDownloadProgressPct( HTTPRequestHandle Request, float *PercentOut ){return SteamHTTP()->GetHTTPDownloadProgressPct(Request,PercentOut);};
// Sets the body for an HTTP Post request. Will fail and return false on a GET request, and will fail if POST params
// have already been set for the request. Setting this raw body makes it the only contents for the post, the pchContentType
// parameter will set the content-type header for the request so the server may know how to interpret the body.
bool SteamHTTP_SetHTTPRequestRawPostBody( HTTPRequestHandle Request, const char *ContentType, uint8 *Body, uint32 BodyLen ){return SteamHTTP()->SetHTTPRequestRawPostBody(Request,ContentType,Body,BodyLen);}; | 87.292135 | 238 | 0.796628 | thecocce |
b2cedebdcbab1bb99325739ca98fd86ac1443656 | 4,713 | hh | C++ | GerdaCore/GerdaOther.hh | pmandrik/GerdaEngine | e399514785939e3499cdb7c87193a9272d3a523c | [
"MIT"
] | null | null | null | GerdaCore/GerdaOther.hh | pmandrik/GerdaEngine | e399514785939e3499cdb7c87193a9272d3a523c | [
"MIT"
] | null | null | null | GerdaCore/GerdaOther.hh | pmandrik/GerdaEngine | e399514785939e3499cdb7c87193a9272d3a523c | [
"MIT"
] | null | null | null |
#ifndef GERDA_OTHER
#define GERDA_OTHER_HH 1
namespace ge {
// ======= Timer ====================================================================
class Timer{
public:
Timer(){};
Timer(int max_time) : mtime(max_time) { dtime = 1./float(mtime); Reset(); }
inline void Set(int time){itime = time; ftime = itime * dtime;}
inline void End(){Set(mtime);}
inline void Reset(){ Set(0); }
inline void ResetBack(){ Set(mtime-1); }
bool Tick(int val=1){
itime += val; ftime += dtime*val;
if(itime >= mtime){ Reset(); return true; }
if(itime < 0){ ResetBack(); return true; }
return false;
}
bool TickIf(int val=1){
if(itime) return Tick(val);
return true;
}
int mtime, itime;
float dtime, ftime;
};
// ======= Clocker ====================================================================
class Clocker{
public:
Clocker(int fps){ delay = 1000/fps; ntime = SDL_GetTicks(); };
float Tick(void){ // FIXME time override
if(delay > SDL_GetTicks() - ntime) SDL_Delay( delay - SDL_GetTicks() + ntime );
answer = SDL_GetTicks() - ntime;
ntime = SDL_GetTicks();
return 1./answer;
}
Uint32 delay, ntime, dtime, answer;
};
// ======= Base Class ====================================================================
class BaseClass{
public:
BaseClass(){ verbose_lvl = sys::def_verbose_lvl; }
int verbose_lvl;
};
// ======= string manipulation algos ====================================================================
vector<string> * split_string(string str, const string & sep = " "){
int sep_size = sep.size();
vector<string> * answer = new vector<string>();
for(int i = 0; i + sep_size < str.size(); i++){
if( sep == str.substr(i, sep_size) ){
answer->push_back( str.substr(0, i) );
str = str.substr(i + sep_size, str.size() - i - sep_size);
i = 0;
}
}
answer->push_back(str);
return answer;
}
string normalize_lenght(string s, const int & lenght, const string & symbol){ // add 'symbol'
while(s.size() < lenght) s = symbol + s;
return s;
}
// utf8 & strings ====================================================================
string utf8_to_string(const uint32_t & code){
string result;
utf8::append(code, back_inserter(result));
return result;
}
string utf8_to_string(const vector<uint32_t> & str){
string result;
utf8::utf32to8(result.begin(), result.end(), back_inserter(result));
return result;
}
vector<uint32_t> string_to_utf8(const string & str){
auto beg_it = str.begin();
auto end_it = utf8::find_invalid(beg_it, str.end());
int length = utf8::distance(beg_it, end_it);
vector<uint32_t> answer;
for(int i = 0; i < length; i++)
answer.push_back( utf8::next(beg_it, end_it) );
return answer;
}
vector<string> string_to_utf8_string(const string & str){
const vector<uint32_t> & codes = string_to_utf8(str);
vector<string> answer;
for(auto code : codes) answer.push_back( to_string(code) );
return answer;
}
string char_to_utf8_string(const char symbol){
string nstring = " ";
nstring[0] = symbol;
const vector<uint32_t> & codes = string_to_utf8(nstring);
return to_string(codes.at(0));
}
// ======= screenshoot ====================================================================
string get_screnshoot_name(){
time_t t = time(0);
struct tm * now = localtime( & t );
string postfix = to_string(now->tm_year - 100);
postfix += normalize_lenght(to_string(now->tm_mon + 1), 2, "0");
postfix += normalize_lenght(to_string(now->tm_mday), 2, "0") + "_";
postfix += normalize_lenght(to_string(now->tm_hour), 2, "0");
postfix += normalize_lenght(to_string(now->tm_min), 2, "0");
postfix += normalize_lenght(to_string(now->tm_sec), 2, "0");
if(now->tm_sec != sys::screenshoot_sec) sys::screenshoot_counter = 100;
sys::screenshoot_sec = now->tm_sec;
postfix += to_string(sys::screenshoot_counter);
sys::screenshoot_counter++;
if(sys::screenshoot_counter >= 995) sys::screenshoot_counter = 100;
return *(sys::screnshoot_prefix) + "_" + postfix + ".png";
}
// ======= rect ====================================================================
struct Rect{
/// rectangular box
Rect(float x_min_, float y_min_, float x_max_, float y_max_){
x_min = x_min_; x_max = x_max_; y_min = y_min_; y_max = y_max_;
}
bool Contain(const v2 & pos){ return check_in(pos.x, x_min, x_max) and check_in(pos.y, y_min, y_max); }
float x_min, x_max, y_min, y_max;
};
}
#endif
| 30.211538 | 107 | 0.551666 | pmandrik |
b2cf9223cf4350dbca15e3686793c889796b19dd | 3,806 | hpp | C++ | src/components/ComponentBase.hpp | daveying/latch | c3d75b2d34f0d0342b3841374771360424165038 | [
"MIT"
] | 3 | 2021-11-20T09:46:49.000Z | 2021-12-25T05:06:49.000Z | src/components/ComponentBase.hpp | daveying/latch | c3d75b2d34f0d0342b3841374771360424165038 | [
"MIT"
] | null | null | null | src/components/ComponentBase.hpp | daveying/latch | c3d75b2d34f0d0342b3841374771360424165038 | [
"MIT"
] | null | null | null | /////////////////////////////////////////////////////////////////////////////////
// MIT License
//
// Copyright (c) 2021 Xingpeng Da
//
// 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
/////////////////////////////////////////////////////////////////////////////////
#ifndef COMPONENT_BASE_HPP__
#define COMPONENT_BASE_HPP__
#include <string>
#include <vector>
#include <ComponentDescription.hpp>
#include <ComponentFactory.hpp>
#include <ForwardPin.hpp>
namespace component
{
class ComponentBase : public IComponent
{
public:
ComponentBase(const ComponentDescription& description, const std::string& name)
: m_name(name)
, m_description(description)
{
for (size_t i = 0; i < m_description.pins.size(); ++i)
{
auto& pin = m_description.pins[i];
if (pin.direction == PinDirection::INPUT)
{
m_pins.push_back(std::make_unique<ForwardInputPin>(this, i));
}
else
{
m_pins.push_back(std::make_unique<ForwardOutputPin>(this, i));
}
}
for (auto const& subcomponent : m_description.subcomponents)
{
m_subcomponents.push_back(ComponentFactory::create(subcomponent.type, name + "." + subcomponent.name));
}
for (auto const& connection : m_description.connections)
{
IComponent* srcComp = subcomponent(connection.src.componentIndex);
IComponent* destComp = subcomponent(connection.dest.componentIndex);
ISourcePin* srcPin = dynamic_cast<ISourcePin*>(srcComp->pin(connection.src.pinIndex));
IPin* destPin = destComp->pin(connection.dest.pinIndex);
if (srcPin == nullptr)
{
throw std::runtime_error("Source pin is not ISourcePin");
}
srcPin->connect(destPin);
}
}
virtual IPin* pin(size_t idx) override
{
return m_pins[idx].get();
};
virtual void initialize() override
{
for (auto& subcomp : m_subcomponents)
{
subcomp->initialize();
sched::waitTillSteady();
}
};
virtual const std::string& name() const override
{
return m_name;
};
virtual IComponent* subcomponent(int idx) override
{
return (idx == -1) ? this : m_subcomponents[idx].get();
}
const ComponentDescription& description()
{
return m_description;
}
virtual ~ComponentBase() {}
protected:
std::string m_name;
std::vector<std::unique_ptr<IComponent>> m_subcomponents;
std::vector<std::unique_ptr<ISourcePin>> m_pins;
const ComponentDescription& m_description;
};
} // namespace component
#endif // COMPONENT_BASE_HPP__
| 33.982143 | 115 | 0.625066 | daveying |
b2d15563594f63282796fc0d794a2538095a98d7 | 662 | cpp | C++ | TAOP/C2/DutchFlagProblem.cpp | Michael-Ma/Coding-Practice | 6ab3d76ae1cd3a97046b399c59d6bf2b135d7b5f | [
"MIT"
] | null | null | null | TAOP/C2/DutchFlagProblem.cpp | Michael-Ma/Coding-Practice | 6ab3d76ae1cd3a97046b399c59d6bf2b135d7b5f | [
"MIT"
] | null | null | null | TAOP/C2/DutchFlagProblem.cpp | Michael-Ma/Coding-Practice | 6ab3d76ae1cd3a97046b399c59d6bf2b135d7b5f | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
void swapFlags(int input[], int size)
{
int curr=0, begin=0, end=size-1;
while(curr < end)
{
if(input[curr] == 1)
{
swap(input[curr], input[begin]);
curr++;
begin++; //curr always >= begin, so no worry about the swaped element.
}else if(input[curr] == 2)
{
curr++;
}else if(input[curr] == 3)
{
swap(input[curr], input[end]);
end--; //can't increase curr since you need to worry about the swapped element.
}
}
}
int main()
{
int input[10] = {1, 2, 3, 3, 1, 2, 2, 3, 1, 2};
swapFlags(input, 10);
for(int i=0; i<10; i++)
{
cout<<input[i]<<", ";
}
cout<<endl;
return 0;
}
| 17.421053 | 84 | 0.574018 | Michael-Ma |
b2d21479866c6d3a8947d8e864f640189fb68618 | 35,176 | cpp | C++ | game/client/cstrike15/Scaleform/teammenu_scaleform.cpp | DannyParker0001/Kisak-Strike | 99ed85927336fe3aff2efd9b9382b2b32eb1d05d | [
"Unlicense"
] | 252 | 2020-12-16T15:34:43.000Z | 2022-03-31T23:21:37.000Z | cstrike15_src/game/client/cstrike15/Scaleform/teammenu_scaleform.cpp | bahadiraraz/Counter-Strike-Global-Offensive | 9a0534100cb98ffa1cf0c32e138f0e7971e910d3 | [
"MIT"
] | 23 | 2020-12-20T18:02:54.000Z | 2022-03-28T16:58:32.000Z | cstrike15_src/game/client/cstrike15/Scaleform/teammenu_scaleform.cpp | bahadiraraz/Counter-Strike-Global-Offensive | 9a0534100cb98ffa1cf0c32e138f0e7971e910d3 | [
"MIT"
] | 42 | 2020-12-19T04:32:33.000Z | 2022-03-30T06:00:28.000Z | //========= Copyright � 1996-2005, Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $NoKeywords: $
//=============================================================================//
#include "cbase.h"
#if defined( INCLUDE_SCALEFORM )
#include <game/client/iviewport.h>
#include "teammenu_scaleform.h"
#include "inputsystem/iinputsystem.h"
#include "c_cs_playerresource.h"
#include "c_cs_player.h"
#include "c_team.h"
#include "iclientmode.h"
#include "ienginevgui.h"
#include "cs_gamerules.h"
#include "../gameui/cstrike15/cstrike15basepanel.h"
#include "gameui_util.h"
#include "VGuiMatSurface/IMatSystemSurface.h"
#include "engine/IEngineSound.h"
#include "vguicenterprint.h"
#include "matchmaking/imatchframework.h"
#include "cdll_client_int.h"
#include "gametypes.h"
#include "HUD/sfhudradar.h"
#include "vgui/ILocalize.h"
#include "vguitextwindow.h"
#include "vstdlib/vstrtools.h"
// memdbgon must be the last include file in a .cpp file!!!
#include <tier0/memdbgon.h>
SFUI_BEGIN_GAME_API_DEF
SFUI_DECL_METHOD( OnOk ),
SFUI_DECL_METHOD( OnCancel ),
SFUI_DECL_METHOD( OnSpectate ),
SFUI_DECL_METHOD( OnAutoSelect ),
SFUI_DECL_METHOD( OnTimer ),
SFUI_DECL_METHOD( OnShowScoreboard ),
SFUI_DECL_METHOD( UpdateNavText ),
SFUI_DECL_METHOD( OnTeamHighlight ),
SFUI_DECL_METHOD( IsInitialTeamMenu ),
SFUI_DECL_METHOD( IsQueuedMatchmaking ),
SFUI_END_GAME_API_DEF( CCSTeamMenuScaleform, TeamMenu );
extern ConVar sv_disable_show_team_select_menu;
extern ConVar mp_force_assign_teams;
CCSTeamMenuScaleform::CCSTeamMenuScaleform( CounterStrikeViewport* pViewPort ) :
m_bVisible( false ),
m_bLoading( false ),
m_bAllowSpectate( false ),
m_pViewPort( pViewPort ),
m_pCTCountHuman( NULL ),
m_pCTCountBot( NULL ),
m_pTCountHuman( NULL ),
m_pTCountBot( NULL ),
m_pCTHelpText( NULL ),
m_pTHelpText( NULL ),
m_pNavText( NULL ),
m_pTName( NULL ),
m_pCTName ( NULL ),
m_pTimerTextGreen( NULL ),
m_pTimerTextRed( NULL ),
m_pTimerTextLabel( NULL ),
m_OnClosedAction( NOTHING ),
m_nCTHumanCount( 0 ),
m_nTHumanCount( 0 ),
m_bPostSelectOverlay( false ),
m_nForceSelectTimeLast( -1.0f ),
m_bGreenTimerVisible( false ),
m_bRedTimerVisible( false ),
m_bMatchStart( true ),
m_pTimerHandle( NULL ),
m_bSelectingTeam( false )
{
m_iSplitScreenSlot = GET_ACTIVE_SPLITSCREEN_SLOT();
StartAlwaysListenEvents();
}
CCSTeamMenuScaleform::~CCSTeamMenuScaleform()
{
}
void CCSTeamMenuScaleform::StartAlwaysListenEvents( void )
{
ListenForGameEvent( "cs_match_end_restart" );
ListenForGameEvent( "cs_game_disconnected" );
ListenForGameEvent( "game_newmap" );
ListenForGameEvent( "jointeam_failed" );
ListenForGameEvent( "player_spawned" );
}
void CCSTeamMenuScaleform::StartListeningForEvents( void )
{
StartAlwaysListenEvents();
ListenForGameEvent( "round_start" );
ListenForGameEvent( "teamchange_pending" );
}
void CCSTeamMenuScaleform::StopListeningForEvents( void )
{
StopListeningForAllEvents();
StartAlwaysListenEvents();
}
void CCSTeamMenuScaleform::FlashLoaded( void )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
SFVALUE panelValue = m_pScaleformUI->Value_GetMember( m_FlashAPI, "Panel" );
if ( panelValue )
{
SFVALUE navPanelValue = m_pScaleformUI->Value_GetMember( panelValue, "NavPanel" );
if ( navPanelValue )
{
m_pCTCountHuman = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navPanelValue, "CT_CountHuman" );
m_pTCountHuman = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navPanelValue, "T_CountHuman" );
m_pCTCountBot = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navPanelValue, "CT_CountBot" );
m_pTCountBot = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navPanelValue, "T_CountBot" );
m_pCTHelpText = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navPanelValue, "CtHelpText" );
m_pTHelpText = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navPanelValue, "THelpText" );
m_pTimerHandle = m_pScaleformUI->Value_GetMember( navPanelValue, "Timer" );
if ( m_pTimerHandle )
{
m_pTimerTextGreen = m_pScaleformUI->TextObject_MakeTextObjectFromMember( m_pTimerHandle, "TimerTextGreen" );
m_pTimerTextRed = m_pScaleformUI->TextObject_MakeTextObjectFromMember( m_pTimerHandle, "TimerTextRed" );
m_pTimerTextLabel = m_pScaleformUI->TextObject_MakeTextObjectFromMember( m_pTimerHandle, "TimerTextLabel" );
if ( m_pTimerTextGreen && m_pTimerTextRed && m_pTimerTextLabel )
{
m_pTimerTextLabel->SetVisible( false );
m_pTimerTextGreen->SetVisible( false );
m_pTimerTextRed->SetVisible( false );
m_bGreenTimerVisible = false;
m_bRedTimerVisible = false;
}
}
SFVALUE CT_HeaderPanel = m_pScaleformUI->Value_GetMember( navPanelValue, "CT_Header" );
if ( CT_HeaderPanel )
{
m_pCTName = m_pScaleformUI->TextObject_MakeTextObjectFromMember( CT_HeaderPanel, "CT_TeamName" );
if ( m_pCTName )
m_pCTName->SetText( "#SFUI_CT_Label" );
m_pScaleformUI->ReleaseValue( CT_HeaderPanel );
}
SFVALUE T_HeaderPanel = m_pScaleformUI->Value_GetMember( navPanelValue, "T_Header" );
if ( T_HeaderPanel )
{
m_pTName = m_pScaleformUI->TextObject_MakeTextObjectFromMember( T_HeaderPanel, "T_TeamName" );
if ( m_pTName )
m_pTName->SetText( "#SFUI_T_Label" );
m_pScaleformUI->ReleaseValue( T_HeaderPanel );
}
SFVALUE navBar = m_pScaleformUI->Value_GetMember( navPanelValue, "NavigationMaster" );
if ( navBar )
{
m_pNavText = m_pScaleformUI->TextObject_MakeTextObjectFromMember( navBar, "ControllerNav" );
m_pScaleformUI->ReleaseValue( navBar );
}
// initialize the dynamic text in the dialog
OnTimer( NULL, NULL );
m_pScaleformUI->ReleaseValue( navPanelValue );
}
m_pScaleformUI->ReleaseValue( panelValue );
}
StartListeningForEvents();
}
void CCSTeamMenuScaleform::FlashReady( void )
{
m_bLoading = false;
// HACK: Ideally we'd prevent this menu from loading at all in modes where
// we don't want it, but as a failsafe, remove this menu in QMM to prevent it
// eating mouse menu inputs.
if ( ( CSGameRules() && CSGameRules()->IsQueuedMatchmaking() ) || sv_disable_show_team_select_menu.GetBool() )
{
WITH_SLOT_LOCKED
{
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "hidePanelAndRemove", 0, NULL );
}
return;
}
// Reset the lists of player XUIDs we pushed to Scaleform
V_memset( m_T_Xuids, INVALID_XUID, MAX_TEAM_SIZE*sizeof(XUID) );
V_memset( m_CT_Xuids, INVALID_XUID, MAX_TEAM_SIZE*sizeof(XUID) );
V_memset( m_nCTLocalPlayers, -1, MAX_TEAM_SIZE*sizeof(int) );
V_memset( m_nTLocalPlayers, -1, MAX_TEAM_SIZE*sizeof(int) );
V_memset( m_chCTNames, 0, sizeof( m_chCTNames ) );
V_memset( m_chTNames, 0, sizeof( m_chTNames ) );
if ( m_bVisible )
{
Show();
}
else
{
Hide();
}
}
void CCSTeamMenuScaleform::Show( void )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
g_pInputSystem->SetSteamControllerMode( "MenuControls", this );
CTextWindow *panel = (CTextWindow *)GetViewPortInterface()->FindPanelByName( PANEL_INFO );
//panel->ShowPanel(false);
if ( panel && panel->IsVisible() && ( panel->GetAlpha() > 0 ) && !( CSGameRules() && CSGameRules()->IsQueuedMatchmaking() ) )
return;
if ( !m_bLoading )
{
if ( FlashAPIIsValid() )
{
m_bSelectingTeam = true;
////////////////
//const char *levelName = engine->GetLevelName();
//const char* mapFileName = V_GetFileName( levelName );
char szCurLevel[MAX_PATH];
V_strcpy_safe( szCurLevel, V_GetFileName( engine->GetLevelName() ) );
V_FixSlashes( szCurLevel, '/' ); // use consistent slashes.
V_StripExtension( szCurLevel, szCurLevel, sizeof( szCurLevel ) );
//////////////////////////////////////////////////////////////////////////
// Get the map path so we can load the thumbnail
//////////////////////////////////////////////////////////////////////////
char szPath[MAX_PATH];
char szMapID[MAX_PATH];
char szJPG[MAX_PATH];
szJPG[0] = '\0';
bool bHasJpg = false;
V_strcpy_safe( szPath, szCurLevel );
V_FixSlashes( szPath, '/' ); // internal path strings use forward slashes, make sure we compare like that.
if ( V_strstr( szPath, "workshop/" ) )
{
V_snprintf( szMapID, MAX_PATH, "%llu", GetMapIDFromMapPath( szPath ) );
V_StripFilename( szPath );
V_snprintf( szJPG, MAX_PATH, "maps/%s/thumb%s.jpg", szPath, szMapID );
if ( !g_pFullFileSystem->FileExists( szJPG ) )
{
V_snprintf( szJPG, MAX_PATH, "maps/%s/%s.jpg", szPath, szCurLevel );
if ( !g_pFullFileSystem->FileExists( szJPG ) )
{
// last chance. try to see if we made one locally
V_snprintf( szJPG, MAX_PATH, "maps/%s.jpg", szCurLevel );
if ( g_pFullFileSystem->FileExists( szJPG ) )
{
bHasJpg = true;
}
}
}
}
else
{
V_snprintf( szJPG, MAX_PATH, "maps/%s.jpg", szCurLevel );
if ( g_pFullFileSystem->FileExists( szJPG ) )
{
bHasJpg = true;
}
}
if ( bHasJpg )
{
WITH_SFVALUEARRAY_SLOT_LOCKED( args, 1 )
{
g_pScaleformUI->ValueArray_SetElement( args, 0, bHasJpg ? szJPG : "" );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "SetBackgroundJpg", args, 1 );
}
}
///////////////////
SetTeamNames();
C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
// Determine if we came into this map with a pre-assigned team (ie. team matchmaking) - if so, join that team immediately and
// display the team assignment now
int preassignTeam = -1;
if ( 0 && pLocalPlayer && pLocalPlayer->GetTeamNumber() == TEAM_UNASSIGNED )
{
IMatchSession *pMatchSession = g_pMatchFramework->GetMatchSession();
KeyValues *pSettings = pMatchSession ? pMatchSession->GetSessionSettings() : NULL;
if ( pSettings )
{
// Either one of these will be set, depending on which team we were assigned to
int team = pSettings->GetInt( "server/team", -1);
// Clear value so we don't use it again later
if ( team != -1 )
pSettings->SetInt( "server/team", -1);
if ( team == -1 )
{
team = pSettings->GetInt( "conteam", -1);
if ( team != -1 )
pSettings->SetInt( "conteam", -1);
}
if (team != -1)
{
preassignTeam = (team == 1) ? TEAM_CT: TEAM_TERRORIST;
}
}
}
if ( mp_force_assign_teams.GetBool() )
{
preassignTeam = 0;
}
WITH_SFVALUEARRAY_SLOT_LOCKED( args, 2 )
{
// If the player's team is unassigned it means they are loading into the map for the first time. In this case show
// the team selection screen instantly so that the player is not given a brief glimpse of the map
m_pScaleformUI->ValueArray_SetElement( args, 0, ( pLocalPlayer && pLocalPlayer->GetTeamNumber() == TEAM_UNASSIGNED ) );
// Should we display a preassigned team immediately?
m_pScaleformUI->ValueArray_SetElement( args, 1, preassignTeam );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "showPanel", args, 2 );
}
RefreshCounts();
UpdateSpectatorOption();
UpdateHelpText();
UpdateTeamAvatars();
GetHud().DisableHud();
m_pViewPort->ShowBackGround( true );
panel->SetMouseInputEnabled( false );
if ( m_pTimerHandle )
{
m_pScaleformUI->Value_SetVisible( m_pTimerHandle, m_bMatchStart );
}
// Start the force team select timer
if ( m_bMatchStart )
{
#if defined( _X360 )
( ( CCStrike15BasePanel* )BasePanel() )->Xbox_PromptSwitchToGameVoiceChannel();
#endif
HandleForceSelect();
}
// Scaleform initialization is done - Now perform the join to our preassigned team
if ( preassignTeam != -1 )
{
JoinTeam( preassignTeam );
DevMsg( "Auto-assign player to side %d\n", preassignTeam );
}
}
else
{
m_bLoading = true;
SFUI_REQUEST_ELEMENT( SF_SS_SLOT( m_iSplitScreenSlot ), g_pScaleformUI, CCSTeamMenuScaleform, this, TeamMenu );
}
}
if( !m_bVisible )
{
CLocalPlayerFilter filter;
PlayMusicSelection( filter, CSMUSIC_SELECTION );
}
m_bVisible = true;
}
void CCSTeamMenuScaleform::Hide( bool bRemove )
{
g_pInputSystem->SetSteamControllerMode( NULL, this );
if ( !m_bLoading && FlashAPIIsValid() && m_bVisible )
{
if ( bRemove )
{
WITH_SLOT_LOCKED
{
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "hidePanelAndRemove", 0, NULL );
}
}
else
{
WITH_SLOT_LOCKED
{
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "hidePanel", 0, NULL );
}
}
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
C_CSPlayer *pPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pPlayer )
{
CLocalPlayerFilter filter;
C_BaseEntity::EmitSound(filter, SOUND_FROM_WORLD, "Music.StopSelection" );
if ( pPlayer->GetTeamNumber() != TEAM_UNASSIGNED )
m_bSelectingTeam = false;
}
m_pViewPort->ShowBackGround( false );
GetHud().EnableHud();
SFHudRadar *pPanel = GET_HUDELEMENT( SFHudRadar );
if ( pPanel )
pPanel->ResizeHud();
m_bVisible = false;
}
}
bool CCSTeamMenuScaleform::PreUnloadFlash( void )
{
SafeReleaseSFVALUE( m_pTimerHandle );
SafeReleaseSFTextObject( m_pCTCountHuman );
SafeReleaseSFTextObject( m_pTCountHuman );
SafeReleaseSFTextObject( m_pCTCountBot );
SafeReleaseSFTextObject( m_pTCountBot );
SafeReleaseSFTextObject( m_pCTHelpText );
SafeReleaseSFTextObject( m_pTHelpText );
SafeReleaseSFTextObject( m_pNavText );
SafeReleaseSFTextObject( m_pTName );
SafeReleaseSFTextObject( m_pCTName );
SafeReleaseSFTextObject( m_pTimerTextGreen );
SafeReleaseSFTextObject( m_pTimerTextRed );
SafeReleaseSFTextObject( m_pTimerTextLabel );
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
StopListeningForEvents();
m_bLoading = false;
C_CSPlayer *pPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pPlayer &&
( pPlayer->GetObserverMode() != OBS_MODE_FIXED && pPlayer->GetObserverMode() != OBS_MODE_ROAMING && pPlayer->GetObserverMode() != OBS_MODE_NONE ) )
{
GetViewPortInterface()->ShowPanel( PANEL_SPECGUI, true );
}
return ScaleformFlashInterface::PreUnloadFlash();
}
void CCSTeamMenuScaleform::ShowPanel( bool bShow )
{
if ( !IsValidSplitScreenSlot( m_iSplitScreenSlot ) )
return;
if ( bShow != m_bVisible )
{
if ( bShow )
{
Show();
}
else
{
Hide( true );
}
}
}
void CCSTeamMenuScaleform::RefreshCounts( void )
{
// Gather human / bot totals
m_nCTHumanCount = 0;
m_nTHumanCount = 0;
int nCTBotCount = 0;
int nTBotCount = 0;
for ( int nPlayerIndex = 1; nPlayerIndex <= MAX_PLAYERS; nPlayerIndex++ )
{
if ( g_PR && g_PR->IsConnected( nPlayerIndex ) )
{
int nTeamID = g_PR->GetPendingTeam( nPlayerIndex );
if ( nTeamID == TEAM_CT )
{
if ( g_PR->IsFakePlayer( nPlayerIndex ) )
{
++nCTBotCount;
}
else
{
++m_nCTHumanCount;
}
}
else if ( nTeamID == TEAM_TERRORIST )
{
if ( g_PR->IsFakePlayer( nPlayerIndex ) )
{
++nTBotCount;
}
else
{
++m_nTHumanCount;
}
}
}
}
WITH_SLOT_LOCKED
{
if ( m_pCTCountHuman )
{
m_pCTCountHuman->SetText( m_nCTHumanCount );
}
if ( m_pCTCountBot )
{
m_pCTCountBot->SetText( nCTBotCount );
}
if ( m_pTCountHuman )
{
m_pTCountHuman->SetText( m_nTHumanCount );
}
if ( m_pTCountBot )
{
m_pTCountBot->SetText( nTBotCount );
}
int nMaxPlayers = MIN( g_pGameTypes->GetCurrentServerNumSlots( ), 24 );
int nMaxTeamSlots = ceil( (double)(nMaxPlayers/2) );
// Display either player counts or team full notice
WITH_SFVALUEARRAY( args, 2 )
{
m_pScaleformUI->ValueArray_SetElement( args, 0, ( m_nCTHumanCount >= nMaxTeamSlots ) );
m_pScaleformUI->ValueArray_SetElement( args, 1, ( m_nTHumanCount >= nMaxTeamSlots ) );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "setTeamsFull", args, 2 );
}
}
}
void CCSTeamMenuScaleform::UpdateSpectatorOption( void )
{
if ( m_pNavText )
{
const ConVar *allowSpectators = cvar->FindVar( "mp_allowspectators" );
C_CSPlayer *pPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( !pPlayer || !CSGameRules() )
{
return;
}
// Ensure there is at least one player ( not the local player ) that is alive and can be spectated
bool bAtLeastOnePlayerAlive = false;
for ( int playerIndex = 1; playerIndex <= MAX_PLAYERS; playerIndex++ )
{
if ( g_PR->IsAlive( playerIndex ) && ( g_PR->IsConnected( playerIndex ) ) && ( !g_PR->IsFakePlayer( playerIndex ) ) )
{
bAtLeastOnePlayerAlive = true;
break;
}
}
m_bAllowSpectate = false;
if ( allowSpectators &&
allowSpectators->GetBool() &&
//bAtLeastOnePlayerAlive && // dwenger - remove requirement that an active player must be present to allow spectating
( GetGlobalTeam( TEAM_SPECTATOR )->GetNumPlayers() < CSGameRules()->GetMaxSpectatorSlots() ) )
{
m_bAllowSpectate = true;
}
bool isInitialTeamMenu = m_pViewPort && !m_pViewPort->GetChoseTeamAndClass();
const char* navStringID = "#SFUI_InitialTeamNavNoSpectate@15"; //Default to the minimum message
// There are 4 possible nav texts, based on whether you can spectator and whether this is the first time we choose a team for a match.
if ( isInitialTeamMenu )
{
if ( m_bAllowSpectate )
{
navStringID = "#SFUI_InitialTeamNavWithSpectate@15";
}
else
{
navStringID = "#SFUI_InitialTeamNavNoSpectate@15";
}
}
else
{
if ( m_bAllowSpectate )
{
navStringID = "#SFUI_TeamNavWithSpectate@15";
}
else
{
navStringID = "#SFUI_TeamNavNoSpectate@15";
}
}
const wchar_t* pTranslated = g_pScaleformUI->Translate( navStringID, NULL );
if ( FlashAPIIsValid() )
{
WITH_SLOT_LOCKED
{
m_pNavText->SetTextHTML( pTranslated );
WITH_SFVALUEARRAY( args, 1 )
{
m_pScaleformUI->ValueArray_SetElement( args, 0, m_bAllowSpectate );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "ShowSpectatorButton", args, 1 );
}
}
}
}
}
void CCSTeamMenuScaleform::SetTeamNames( void )
{
if ( !CSGameRules() )
return;
WITH_SLOT_LOCKED
{
C_Team *pTeamT = GetGlobalTeam( TEAM_TERRORIST );
if ( pTeamT && m_pTName )
{
if ( StringIsEmpty( pTeamT->Get_ClanName() ) )
m_pTName->SetText( "#SFUI_T_Label" );
else
{
wchar_t wszNameT[ MAX_TEAM_NAME_LENGTH ];
g_pVGuiLocalize->ConvertANSIToUnicode( pTeamT->Get_ClanName(), wszNameT, sizeof( wszNameT ) );
wchar_t wszSafeNameT[ MAX_TEAM_NAME_LENGTH ];
wszSafeNameT[0] = L'\0';
g_pScaleformUI->MakeStringSafe( wszNameT, wszSafeNameT, sizeof( wszNameT ) );
m_pTName->SetTextHTML( wszSafeNameT );
}
}
C_Team *pTeamCT = GetGlobalTeam( TEAM_CT );
if ( pTeamCT && m_pCTName )
{
if ( StringIsEmpty( pTeamCT->Get_ClanName() ) )
m_pCTName->SetText( "#SFUI_CT_Label" );
else
{
wchar_t wszNameCT[ MAX_TEAM_NAME_LENGTH ];
g_pVGuiLocalize->ConvertANSIToUnicode( pTeamCT->Get_ClanName(), wszNameCT, sizeof( wszNameCT ) );
wchar_t wszSafeNameCT[ MAX_TEAM_NAME_LENGTH ];
wszSafeNameCT[0] = L'\0';
g_pScaleformUI->MakeStringSafe( wszNameCT, wszSafeNameCT, sizeof( wszNameCT ) );
m_pCTName->SetTextHTML( wszSafeNameCT );
}
}
}
}
void CCSTeamMenuScaleform::UpdateHelpText( void )
{
if ( !CSGameRules() )
return;
const wchar_t *wszRules_CT = L"";
const wchar_t *wszRules_T = L"";
int nObjective = 0;
// 0 = generic
// 1 = plant bomb
// 2 = rescue hostages
// 3 = GG
if ( CSGameRules()->IsPlayingGunGameTRBomb() )
{
wszRules_CT = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_TRBomb_CT" );
wszRules_T = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_TRBomb_T" );
nObjective = 1; // bomb
}
else if ( CSGameRules()->IsPlayingGunGameProgressive() )
{
wszRules_CT = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_GunGame_Progressive" );
wszRules_T = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_GunGame_Progressive" );
nObjective = 3; // gg
}
else
{
if ( CSGameRules()->IsHostageRescueMap() )
{
wszRules_CT = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_Hostage_CT" );
wszRules_T = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_Hostage_T" );
nObjective = 2; // hostage
}
else if ( CSGameRules()->IsBombDefuseMap() )
{
wszRules_CT = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_Bomb_CT" );
wszRules_T = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_Bomb_T" );
nObjective = 1; // bomb
}
else
{
wszRules_CT = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_Generic_CT" );
wszRules_T = g_pVGuiLocalize->FindSafe( "#SFUI_Rules_TS_Generic_T" );
}
}
WITH_SFVALUEARRAY_SLOT_LOCKED( args, 3 )
{
g_pScaleformUI->ValueArray_SetElement( args, 0, wszRules_CT );
g_pScaleformUI->ValueArray_SetElement( args, 1, wszRules_T );
g_pScaleformUI->ValueArray_SetElement( args, 2, nObjective );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "setTeamHintText", args, 3 );
}
}
void CCSTeamMenuScaleform::OnTeamHighlight( SCALEFORM_CALLBACK_ARGS_DECL )
{
CLocalPlayerFilter filter;
C_BaseEntity::EmitSound( filter, SOUND_FROM_WORLD, "VGUI_button.rollover" );
int nTeamID = ( int ) g_pScaleformUI->Params_GetArgAsNumber( obj );
NOTE_UNUSED( nTeamID );
}
void CCSTeamMenuScaleform::UpdateNavText( SCALEFORM_CALLBACK_ARGS_DECL )
{
UpdateSpectatorOption();
}
void CCSTeamMenuScaleform::OnTimer( SCALEFORM_CALLBACK_ARGS_DECL )
{
if ( FlashAPIIsValid() )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
RefreshCounts();
UpdateSpectatorOption();
UpdateHelpText();
}
}
void CCSTeamMenuScaleform::OnOk( SCALEFORM_CALLBACK_ARGS_DECL )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
int side = ( int ) g_pScaleformUI->Params_GetArgAsNumber( obj );
int nCurrentTeamID = -1;
C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pLocalPlayer )
{
nCurrentTeamID = pLocalPlayer->GetPendingTeamNumber();
if ( ( ( side == TEAM_CT ) && ( nCurrentTeamID == TEAM_CT ) ) ||
( ( side == TEAM_TERRORIST ) && ( nCurrentTeamID == TEAM_TERRORIST ) ) )
{
// Player is trying to rejoin the same team. Hide the choose team menu.
Hide( true );
return;
}
}
JoinTeam( side );
// the team menu gets hidden when the message that the team is joined appears
}
void CCSTeamMenuScaleform::JoinTeam( int side )
{
switch ( side )
{
case 0:
engine->ClientCmd( "jointeam 0 1" );
break;
case TEAM_CT:
if ( m_bMatchStart )
{
engine->ClientCmd( "jointeam 3 1" );
}
else
{
engine->ClientCmd( "jointeam 3 0" );
}
break;
case TEAM_TERRORIST:
if ( m_bMatchStart )
{
engine->ClientCmd( "jointeam 2 1" );
}
else
{
engine->ClientCmd( "jointeam 2 0" );
}
default:
break;
}
if ( side > 0 )
{
// hide this after we join a team
Hide( true );
}
}
void CCSTeamMenuScaleform::OnCancel( SCALEFORM_CALLBACK_ARGS_DECL )
{
Hide( true );
}
void CCSTeamMenuScaleform::OnSpectate( SCALEFORM_CALLBACK_ARGS_DECL )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
if ( m_bAllowSpectate )
{
C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pLocalPlayer )
{
if ( pLocalPlayer->GetPendingTeamNumber() == TEAM_SPECTATOR )
{
// Player is trying to rejoin the same team. Hide the choose team menu.
Hide( true );
}
else
{
if ( m_bMatchStart )
{
engine->ClientCmd( "jointeam 1 1" );
}
else
{
engine->ClientCmd( "jointeam 1 0" );
}
m_bSelectingTeam = false;
}
}
}
}
void CCSTeamMenuScaleform::OnAutoSelect( SCALEFORM_CALLBACK_ARGS_DECL )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
if ( m_bMatchStart )
{
engine->ClientCmd( "jointeam 0 1" );
}
else
{
engine->ClientCmd( "jointeam 0 0" );
}
m_bSelectingTeam = false;
}
//-----------------------------------------------------------------------------
// Purpose: respond to game events
//-----------------------------------------------------------------------------
void CCSTeamMenuScaleform::FireGameEvent( IGameEvent *event )
{
if ( !IsValidSplitScreenSlot( m_iSplitScreenSlot ) )
return;
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
const char *type = event->GetName();
bool bHideScreen = false;
if ( !V_strcmp( type, "jointeam_failed" ) )
{
C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pLocalPlayer && pLocalPlayer->GetUserID() == event->GetInt( "userid" ) )
{
int reason = event->GetInt( "reason" );
const char* msg = NULL;
switch( reason )
{
case TeamJoinFailedReason::CHANGED_TOO_OFTEN: msg = "#Cstrike_TitlesTXT_Only_1_Team_Change"; break;
case TeamJoinFailedReason::BOTH_TEAMS_FULL: msg = "#Cstrike_TitlesTXT_All_Teams_Full"; break;
case TeamJoinFailedReason::TERRORISTS_FULL: msg = "#Cstrike_TitlesTXT_Terrorists_Full"; break;
case TeamJoinFailedReason::CTS_FULL: msg = "#Cstrike_TitlesTXT_CTs_Full"; break;
case TeamJoinFailedReason::CANT_JOIN_SPECTATOR: msg = "#Cstrike_TitlesTXT_Cannot_Be_Spectator"; break;
case TeamJoinFailedReason::HUMANS_CAN_ONLY_JOIN_TS: msg = "#Cstrike_TitlesTXT_Humans_Join_Team_T"; break;
case TeamJoinFailedReason::HUMANS_CAN_ONLY_JOIN_CTS: msg = "#Cstrike_TitlesTXT_Humans_Join_Team_CT"; break;
case TeamJoinFailedReason::TOO_MANY_TS: msg = "#Cstrike_TitlesTXT_Too_Many_Terrorists"; break;
case TeamJoinFailedReason::TOO_MANY_CTS: msg = "#Cstrike_TitlesTXT_Too_Many_CTs"; break;
default: msg = NULL; break;
}
if ( msg != NULL )
{
CLocalPlayerFilter filter;
pLocalPlayer->EmitSound(filter, SOUND_FROM_WORLD, "buymenu_cant_buy.click" );
if ( !m_bVisible || !FlashAPIIsValid())
{
GetCenterPrint()->Print( const_cast<char *>( msg ) );
}
else
{
WITH_SFVALUEARRAY(args, 1)
{
m_pScaleformUI->ValueArray_SetElement( args, 0, msg );
WITH_SLOT_LOCKED
{
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "showErrorText", args, 1 );
}
}
}
}
}
}
else if( !V_strcmp( type, "cs_match_end_restart" ) )
{
if ( !engine->IsPlayingDemo() )
{
m_bMatchStart = true;
if ( CSGameRules() && !CSGameRules()->IsPlayingTraining() && !CSGameRules()->IsQueuedMatchmaking() )
GetViewPortInterface()->ShowPanel( PANEL_TEAM , true );
}
}
else if ( !V_strcmp( type, "player_spawned" ) )
{
C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pLocalPlayer && pLocalPlayer->GetUserID() == event->GetInt( "userid" ) )
{
m_bMatchStart = false;
ResetForceSelect();
if ( event->GetBool( "inrestart" ) )
{
// Waiting for a map restart. Show the post team select overlay
// until the round starts.
HandlePostTeamSelect( pLocalPlayer->GetPendingTeamNumber() );
}
else
{
bHideScreen = true;
}
}
}
else if ( !V_strcmp( type, "round_start" ) )
{
SetTeamNames();
if ( m_bPostSelectOverlay )
{
m_bPostSelectOverlay = false;
bHideScreen = true;
}
}
else if ( !V_strcmp( type, "cs_game_disconnected" ) || !V_strcmp( type, "game_newmap" ) )
{
m_bMatchStart = true;
bHideScreen = true;
if ( !V_strcmp( type, "game_newmap" ) )
{
if ( !FlashAPIIsValid() && !engine->IsHLTV() )
{
m_bLoading = true;
SFUI_REQUEST_ELEMENT( SF_SS_SLOT( m_iSplitScreenSlot ), g_pScaleformUI, CCSTeamMenuScaleform, this, TeamMenu );
}
}
}
else if ( !V_strcmp( type, "teamchange_pending" ) )
{
bHideScreen = true;
m_bSelectingTeam = false;
}
if ( bHideScreen )
{
if ( m_bVisible )
{
Hide( true );
}
else
{
RemoveFlashElement();
}
}
}
void CCSTeamMenuScaleform::OnShowScoreboard( SCALEFORM_CALLBACK_ARGS_DECL )
{
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
if ( GetViewPortInterface() )
{
GetViewPortInterface()->ShowPanel( PANEL_SCOREBOARD, true );
}
}
void CCSTeamMenuScaleform::HandlePostTeamSelect( int team )
{
CLocalPlayerFilter filter;
C_BaseEntity::EmitSound( filter, SOUND_FROM_WORLD, "VGUI_button.click" );
if ( FlashAPIIsValid() )
{
WITH_SLOT_LOCKED
{
WITH_SFVALUEARRAY( args, 1 )
{
g_pScaleformUI->ValueArray_SetElement( args, 0, team );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "showPreMatchOverlay", args, 1 );
}
}
m_bPostSelectOverlay = true;
}
}
void CCSTeamMenuScaleform::HandleForceSelect( void )
{
if ( !m_bMatchStart )
return;
SF_FORCE_SPLITSCREEN_PLAYER_GUARD( m_iSplitScreenSlot );
C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
if ( pLocalPlayer && pLocalPlayer->GetTeamNumber() == TEAM_UNASSIGNED && pLocalPlayer->GetForceTeamTime() != -1.0f )
{
int nDelta = static_cast<int>( ceil( pLocalPlayer->GetForceTeamTime() - gpGlobals->curtime ) );
if ( m_nForceSelectTimeLast == -1.0f )
{
m_nForceSelectTimeLast = nDelta + 1;
}
if ( nDelta < m_nForceSelectTimeLast )
{
// Update on screen timer
int nMinutes = nDelta / 60;
int nSeconds = nDelta % 60;
wchar_t szTime[32];
szTime[0] = 0;
V_snwprintf( szTime, ARRAYSIZE( szTime ), L"%d:%.2d", nMinutes, nSeconds );
if( nDelta <= 3 && m_nForceSelectTimeLast != nDelta )
{
if( nDelta > 0 )
{
CLocalPlayerFilter filter;
CBaseEntity::EmitSound( filter, 0, "UI.CounterBeep" );
}
else
{
CLocalPlayerFilter filter;
CBaseEntity::EmitSound( filter, 0, "UI.CounterDoneBeep" );
Hide( true );
}
}
m_nForceSelectTimeLast = nDelta;
if ( FlashAPIIsValid() && m_pTimerTextGreen && m_pTimerTextRed && m_pTimerTextLabel )
{
// Change timer to red when only three seconds remain
if ( nDelta <= 3 && !m_bRedTimerVisible )
{
m_pTimerTextLabel->SetVisible( true );
m_pTimerTextGreen->SetVisible( false );
m_pTimerTextRed->SetVisible( true );
m_bRedTimerVisible = true;
m_bGreenTimerVisible = false;
}
else if ( nDelta > 3 && !m_bGreenTimerVisible)
{
m_pTimerTextLabel->SetVisible( true );
m_pTimerTextGreen->SetVisible( true );
m_pTimerTextRed->SetVisible( false );
m_bGreenTimerVisible = true;
}
else if ( nDelta < 0 )
{
// Ran out of time. Force team selection.
m_pTimerTextLabel->SetVisible( false );
m_pTimerTextGreen->SetVisible( false );
m_pTimerTextRed->SetVisible( false );
}
WITH_SLOT_LOCKED
{
if ( m_bGreenTimerVisible )
{
m_pTimerTextGreen->SetText( szTime );
}
else
{
m_pTimerTextRed->SetText( szTime );
}
}
}
}
}
}
void CCSTeamMenuScaleform::UpdateTeamAvatars( void )
{
//int nMaxPlayers = MIN( g_pGameTypes->GetCurrentServerNumSlots( ), 24 );
//int nMaxTeamSlots = ceil( (double)(nMaxPlayers/2) );
XUID ctXuids[TEAM_MENU_MAX_PLAYERS];
int numCtHumans = 0;
XUID tXuids[TEAM_MENU_MAX_PLAYERS];
int numTHumans = 0;
const char *szCTNames[TEAM_MENU_MAX_PLAYERS];
const char *szTNames[TEAM_MENU_MAX_PLAYERS];
bool ctLocalPlayer[TEAM_MENU_MAX_PLAYERS];
bool tLocalPlayer[TEAM_MENU_MAX_PLAYERS];
V_memset( ctXuids, 0, sizeof(ctXuids) );
V_memset( tXuids, 0, sizeof(tXuids) );
V_memset( ctLocalPlayer, 0, sizeof(ctLocalPlayer) );
V_memset( tLocalPlayer, 0, sizeof(tLocalPlayer) );
for ( int j = 0; j < TEAM_MENU_MAX_PLAYERS; ++ j )
{
szCTNames[j] = "";
szTNames[j] = "";
}
if ( g_PR != NULL )
{
for ( int nPlayerIndex = 1; nPlayerIndex <= MAX_PLAYERS; nPlayerIndex++ )
{
if ( g_PR->IsConnected( nPlayerIndex ) && !g_PR->IsFakePlayer( nPlayerIndex ) )
{
XUID PlayerXuid = g_PR->GetXuid( nPlayerIndex );
int PlayerPendingTeam = g_PR->GetPendingTeam( nPlayerIndex );
const char *szName = g_PR->GetPlayerName( nPlayerIndex );
bool bLocalPlayer = ( nPlayerIndex == GetLocalPlayerIndex() );
if ( PlayerPendingTeam == TEAM_TERRORIST && numTHumans < ARRAYSIZE(szTNames) )
{
szTNames[ numTHumans ] = szName;
tLocalPlayer[ numTHumans ] = bLocalPlayer;
tXuids[ numTHumans++ ] = PlayerXuid;
}
else if ( PlayerPendingTeam == TEAM_CT && numCtHumans < ARRAYSIZE(szCTNames) )
{
szCTNames[ numCtHumans ] = szName;
ctLocalPlayer[ numCtHumans ] = bLocalPlayer;
ctXuids[ numCtHumans++ ] = PlayerXuid;
}
}
}
}
WITH_SLOT_LOCKED
{
// compare these versus the values already pushed
for ( int idx = 0; idx < TEAM_MENU_MAX_PLAYERS; ++idx )
{
if ( ctXuids[idx] != m_CT_Xuids[idx] || m_nCTLocalPlayers[idx] != static_cast<int>( ctLocalPlayer[idx] ) || V_strncmp( m_chCTNames[idx], szCTNames[idx], MAX_PLAYER_NAME_LENGTH - 1 ) )
SetPlayerXuid( true, idx, ctXuids[idx], szCTNames[idx], ctLocalPlayer[idx] );
if ( tXuids[idx] != m_T_Xuids[idx] || m_nTLocalPlayers[idx] != static_cast<int>( tLocalPlayer[idx] ) || V_strncmp( m_chTNames[idx], szTNames[idx], MAX_PLAYER_NAME_LENGTH - 1 ) )
SetPlayerXuid( false, idx, tXuids[idx], szTNames[idx], tLocalPlayer[idx] );
}
}
}
// This function is not slot-locked, so it MUST be called within a slot-locking block
void CCSTeamMenuScaleform::SetPlayerXuid( bool bIsCT, int index, XUID xuid, const char* pPlayerName, bool bIsLocalPlayer )
{
if ( FlashAPIIsValid() )
{
WITH_SFVALUEARRAY( args, 5 )
{
char csXuid[256] = { 0 };
V_snprintf( csXuid, ARRAYSIZE( csXuid ), "%llu", xuid );
// Make safe user name
wchar_t bufUserName[64];
V_UTF8ToUnicode( pPlayerName, bufUserName, sizeof( bufUserName ) );
wchar_t bufUserNameSafe[256];
g_pScaleformUI->MakeStringSafe( bufUserName, bufUserNameSafe, sizeof( bufUserNameSafe ) );
g_pScaleformUI->ValueArray_SetElement( args, 0, bIsCT );
g_pScaleformUI->ValueArray_SetElement( args, 1, index );
g_pScaleformUI->ValueArray_SetElement( args, 2, csXuid );
g_pScaleformUI->ValueArray_SetElement( args, 3, bufUserNameSafe );
g_pScaleformUI->ValueArray_SetElement( args, 4, bIsLocalPlayer );
g_pScaleformUI->Value_InvokeWithoutReturn( m_FlashAPI, "SetAvatar", args, 5 );
}
// Save off the Xuid we passed into Scaleform
if ( bIsCT )
{
V_strcpy_safe( m_chCTNames[index], pPlayerName );
m_CT_Xuids[index] = xuid;
m_nCTLocalPlayers[index] = bIsLocalPlayer;
}
else
{
V_strcpy_safe( m_chTNames[index], pPlayerName );
m_T_Xuids[index] = xuid;
m_nTLocalPlayers[index] = bIsLocalPlayer;
}
}
}
void CCSTeamMenuScaleform::ViewportThink( void )
{
// Early out if the screen isn't active
if ( FlashAPIIsValid() && m_bVisible )
{
HandleForceSelect();
UpdateTeamAvatars();
// C_CSPlayer *pLocalPlayer = C_CSPlayer::GetLocalCSPlayer();
// if ( pLocalPlayer && pLocalPlayer->GetTeamNumber() != TEAM_UNASSIGNED && m_bSelectingTeam == false )
// {
// //Hide( true );
// GetViewPortInterface()->ShowPanel( PANEL_TEAM, false );
// }
}
}
void CCSTeamMenuScaleform::ResetForceSelect( void )
{
m_nForceSelectTimeLast = -1.0f;
m_bRedTimerVisible = false;
m_bGreenTimerVisible = false;
}
void CCSTeamMenuScaleform::IsInitialTeamMenu( SCALEFORM_CALLBACK_ARGS_DECL )
{
m_pScaleformUI->Params_SetResult( obj, ( m_pViewPort && !m_pViewPort->GetChoseTeamAndClass() ) );
}
void CCSTeamMenuScaleform::IsQueuedMatchmaking( SCALEFORM_CALLBACK_ARGS_DECL )
{
bool bQ = CSGameRules() && CSGameRules()->IsQueuedMatchmaking();
m_pScaleformUI->Params_SetResult( obj, bQ );
}
#endif
| 26.954789 | 186 | 0.688168 | DannyParker0001 |
b2d3ad3d5ed3c7fda778d542e8be3e6389ea2f33 | 22,758 | cpp | C++ | qws/src/core/QSettings.cpp | keera-studios/hsQt | 8aa71a585cbec40005354d0ee43bce9794a55a9a | [
"BSD-2-Clause"
] | 42 | 2015-02-16T19:29:16.000Z | 2021-07-25T11:09:03.000Z | qws/src/core/QSettings.cpp | keera-studios/hsQt | 8aa71a585cbec40005354d0ee43bce9794a55a9a | [
"BSD-2-Clause"
] | 1 | 2017-11-23T12:49:25.000Z | 2017-11-23T12:49:25.000Z | qws/src/core/QSettings.cpp | keera-studios/hsQt | 8aa71a585cbec40005354d0ee43bce9794a55a9a | [
"BSD-2-Clause"
] | 5 | 2015-10-15T21:25:30.000Z | 2017-11-22T13:18:24.000Z | /////////////////////////////////////////////////////////////////////////////
//
// File : QSettings.cpp
// Copyright : (c) David Harley 2010
// Project : qtHaskell
// Version : 1.1.4
// Modified : 2010-09-02 17:01:55
//
// Warning : this file is machine generated - do not modify.
//
/////////////////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <wchar.h>
#include <qtc_wrp_core.h>
#include <qtc_subclass.h>
#include <core/QSettings_DhClass.h>
extern "C"
{
QTCEXPORT(void*,qtc_QSettings)() {
DhQSettings*tr = new DhQSettings();
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings1)(wchar_t* x1) {
QString tx1(from_method(x1));
DhQSettings*tr = new DhQSettings(tx1);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings2)(wchar_t* x1, wchar_t* x2) {
QString tx1(from_method(x1));
QString tx2(from_method(x2));
DhQSettings*tr = new DhQSettings(tx1, tx2);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings3)(wchar_t* x1, wchar_t* x2, void* x3) {
QString tx1(from_method(x1));
QString tx2(from_method(x2));
QObject*tx3 = *((QPointer<QObject>*)x3);
if ((tx3!=NULL)&&((QObject *)tx3)->property(QTC_PROP).isValid()) tx3 = ((QObject*)(((qtc_DynamicQObject*)tx3)->parent()));
DhQSettings*tr = new DhQSettings(tx1, tx2, (QObject*)tx3);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings4)(long x1, wchar_t* x2) {
QString tx2(from_method(x2));
DhQSettings*tr = new DhQSettings((QSettings::Scope)x1, tx2);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings5)(long x1, wchar_t* x2, wchar_t* x3) {
QString tx2(from_method(x2));
QString tx3(from_method(x3));
DhQSettings*tr = new DhQSettings((QSettings::Scope)x1, tx2, tx3);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings6)(long x1, wchar_t* x2, wchar_t* x3, void* x4) {
QString tx2(from_method(x2));
QString tx3(from_method(x3));
QObject*tx4 = *((QPointer<QObject>*)x4);
if ((tx4!=NULL)&&((QObject *)tx4)->property(QTC_PROP).isValid()) tx4 = ((QObject*)(((qtc_DynamicQObject*)tx4)->parent()));
DhQSettings*tr = new DhQSettings((QSettings::Scope)x1, tx2, tx3, (QObject*)tx4);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings7)(long x1, long x2, wchar_t* x3) {
QString tx3(from_method(x3));
DhQSettings*tr = new DhQSettings((QSettings::Format)x1, (QSettings::Scope)x2, tx3);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings8)(long x1, long x2, wchar_t* x3, wchar_t* x4) {
QString tx3(from_method(x3));
QString tx4(from_method(x4));
DhQSettings*tr = new DhQSettings((QSettings::Format)x1, (QSettings::Scope)x2, tx3, tx4);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings9)(long x1, long x2, wchar_t* x3, wchar_t* x4, void* x5) {
QString tx3(from_method(x3));
QString tx4(from_method(x4));
QObject*tx5 = *((QPointer<QObject>*)x5);
if ((tx5!=NULL)&&((QObject *)tx5)->property(QTC_PROP).isValid()) tx5 = ((QObject*)(((qtc_DynamicQObject*)tx5)->parent()));
DhQSettings*tr = new DhQSettings((QSettings::Format)x1, (QSettings::Scope)x2, tx3, tx4, (QObject*)tx5);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings10)(wchar_t* x1, long x2) {
QString tx1(from_method(x1));
DhQSettings*tr = new DhQSettings(tx1, (QSettings::Format)x2);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings11)(wchar_t* x1, long x2, void* x3) {
QString tx1(from_method(x1));
QObject*tx3 = *((QPointer<QObject>*)x3);
if ((tx3!=NULL)&&((QObject *)tx3)->property(QTC_PROP).isValid()) tx3 = ((QObject*)(((qtc_DynamicQObject*)tx3)->parent()));
DhQSettings*tr = new DhQSettings(tx1, (QSettings::Format)x2, (QObject*)tx3);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings12)(void* x1) {
QObject*tx1 = *((QPointer<QObject>*)x1);
if ((tx1!=NULL)&&((QObject *)tx1)->property(QTC_PROP).isValid()) tx1 = ((QObject*)(((qtc_DynamicQObject*)tx1)->parent()));
DhQSettings*tr = new DhQSettings((QObject*)tx1);
tr->setProperty(QTC_DHPROP, true);
QPointer<DhQSettings> * ttr = new QPointer<DhQSettings>(tr);
return (void*) ttr;
}
QTCEXPORT(void*,qtc_QSettings_allKeys)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString * tq = new QString(((QSettings*)tx0)->applicationName());
return (void*)(tq);
}
QTCEXPORT(void*,qtc_QSettings_applicationName)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString * tq = new QString(((QSettings*)tx0)->applicationName());
return (void*)(tq);
}
QTCEXPORT(void,qtc_QSettings_beginGroup)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
((QSettings*)tx0)->beginGroup(tx1);
}
QTCEXPORT(int,qtc_QSettings_beginReadArray)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
return ((QSettings*)tx0)->beginReadArray(tx1);
}
QTCEXPORT(void,qtc_QSettings_beginWriteArray)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
((QSettings*)tx0)->beginWriteArray(tx1);
}
QTCEXPORT(void,qtc_QSettings_beginWriteArray1)(void* x0, wchar_t* x1, int x2) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
((QSettings*)tx0)->beginWriteArray(tx1, x2);
}
QTCEXPORT(int,qtc_QSettings_childGroups)(void* x0, void* _ref) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QStringList tqsl = ((QSettings*)tx0)->childGroups();
if (_ref != NULL) {
for (int i = 0; i < tqsl.size(); i++) {
QString * tqs = new QString(tqsl.at(i));
((void**)_ref)[i] = (void*)tqs;
}
}
return tqsl.size();
}
QTCEXPORT(int,qtc_QSettings_childKeys)(void* x0, void* _ref) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QStringList tqsl = ((QSettings*)tx0)->childKeys();
if (_ref != NULL) {
for (int i = 0; i < tqsl.size(); i++) {
QString * tqs = new QString(tqsl.at(i));
((void**)_ref)[i] = (void*)tqs;
}
}
return tqsl.size();
}
QTCEXPORT(void,qtc_QSettings_clear)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->clear();
}
QTCEXPORT(int,qtc_QSettings_contains)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
return (int) ((QSettings*)tx0)->contains(tx1);
}
QTCEXPORT(void,qtc_QSettings_endArray)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->endArray();
}
QTCEXPORT(void,qtc_QSettings_endGroup)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->endGroup();
}
QTCEXPORT(int,qtc_QSettings_fallbacksEnabled)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (int) ((QSettings*)tx0)->fallbacksEnabled();
}
QTCEXPORT(void*,qtc_QSettings_fileName)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString * tq = new QString(((QSettings*)tx0)->fileName());
return (void*)(tq);
}
QTCEXPORT(long,qtc_QSettings_format)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (long) ((QSettings*)tx0)->format();
}
QTCEXPORT(void*,qtc_QSettings_group)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString * tq = new QString(((QSettings*)tx0)->group());
return (void*)(tq);
}
QTCEXPORT(void*,qtc_QSettings_iniCodec)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (void*) ((QSettings*)tx0)->iniCodec();
}
QTCEXPORT(int,qtc_QSettings_isWritable)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (int) ((QSettings*)tx0)->isWritable();
}
QTCEXPORT(void*,qtc_QSettings_organizationName)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString * tq = new QString(((QSettings*)tx0)->organizationName());
return (void*)(tq);
}
QTCEXPORT(void,qtc_QSettings_remove)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
((QSettings*)tx0)->remove(tx1);
}
QTCEXPORT(long,qtc_QSettings_scope)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (long) ((QSettings*)tx0)->scope();
}
QTCEXPORT(void,qtc_QSettings_setArrayIndex)(void* x0, int x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->setArrayIndex(x1);
}
QTCEXPORT(void,qtc_QSettings_setFallbacksEnabled)(void* x0, int x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->setFallbacksEnabled((bool)x1);
}
QTCEXPORT(void,qtc_QSettings_setIniCodec)(void* x0, void* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->setIniCodec((QTextCodec*)x1);
}
QTCEXPORT(void,qtc_QSettings_setIniCodec1)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
QByteArray txa1(tx1.toAscii());
((QSettings*)tx0)->setIniCodec(txa1.data());
}
QTCEXPORT(void,qtc_QSettings_setValue)(void* x0, wchar_t* x1, void* x2) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
((QSettings*)tx0)->setValue(tx1, (const QVariant&)(*(QVariant*)x2));
}
QTCEXPORT(long,qtc_QSettings_status)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (long) ((QSettings*)tx0)->status();
}
QTCEXPORT(void,qtc_QSettings_sync)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((QSettings*)tx0)->sync();
}
QTCEXPORT(void*,qtc_QSettings_value)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
QVariant * tc = new QVariant(((QSettings*)tx0)->value(tx1));
return (void*)(tc);
}
QTCEXPORT(void*,qtc_QSettings_value1)(void* x0, wchar_t* x1, void* x2) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
QVariant * tc = new QVariant(((QSettings*)tx0)->value(tx1, (const QVariant&)(*(QVariant*)x2)));
return (void*)(tc);
}
QTCEXPORT(void,qtc_QSettings_finalizer)(void* x0) {
delete ((QPointer<QSettings>*)x0);
}
QTCEXPORT(void*,qtc_QSettings_getFinalizer)() {
return (void*)(&qtc_QSettings_finalizer);
}
QTCEXPORT(void,qtc_QSettings_delete)(void* x0) {
QObject* tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&(((QObject*)tx0)->property(QTC_PROP).isValid())) {
qtc_DynamicQObject* ttx0 = (qtc_DynamicQObject*)tx0;
tx0 = ((QObject*)(tx0->parent()));
ttx0->freeDynamicSlots();
delete ttx0;
}
if ((tx0!=NULL)&&(((QObject*)tx0)->property(QTC_DHPROP).isValid())) {
((DhQSettings*)tx0)->freeDynamicHandlers();
delete((DhQSettings*)tx0);
} else {
delete((QSettings*)tx0);
}
}
QTCEXPORT(void,qtc_QSettings_deleteLater)(void* x0) {
QObject* tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&(((QObject*)tx0)->property(QTC_PROP).isValid())) {
qtc_DynamicQObject* ttx0 = (qtc_DynamicQObject*)tx0;
tx0 = ((QObject*)(tx0->parent()));
ttx0->freeDynamicSlots();
ttx0->deleteLater();
}
if ((tx0!=NULL)&&(((QObject*)tx0)->property(QTC_DHPROP).isValid())) {
((DhQSettings*)tx0)->freeDynamicHandlers();
((DhQSettings*)tx0)->deleteLater();
} else {
((QSettings*)tx0)->deleteLater();
}
}
QTCEXPORT(void,qtc_QSettings_childEvent)(void* x0, void* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((DhQSettings*)tx0)->DhchildEvent((QChildEvent*)x1);
}
QTCEXPORT(void,qtc_QSettings_connectNotify)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
QByteArray txa1(tx1.toAscii());
((DhQSettings*)tx0)->DhconnectNotify(txa1.data());
}
QTCEXPORT(void,qtc_QSettings_customEvent)(void* x0, void* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
((DhQSettings*)tx0)->DhcustomEvent((QEvent*)x1);
}
QTCEXPORT(void,qtc_QSettings_disconnectNotify)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
QByteArray txa1(tx1.toAscii());
((DhQSettings*)tx0)->DhdisconnectNotify(txa1.data());
}
QTCEXPORT(int,qtc_QSettings_event)(void* x0, void* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_DHPROP).isValid()) {
return (int)((DhQSettings*)tx0)->Dhevent((QEvent*)x1);
} else {
return (int)((QObject*)tx0)->event((QEvent*)x1);
}
}
QTCEXPORT(int,qtc_QSettings_event_h)(void* x0, void* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
return (int)((DhQSettings*)tx0)->Dvhevent((QEvent*)x1);
}
QTCEXPORT(int,qtc_QSettings_eventFilter)(void* x0, void* x1, void* x2) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QObject*tx1 = *((QPointer<QObject>*)x1);
if ((tx1!=NULL)&&((QObject *)tx1)->property(QTC_PROP).isValid()) tx1 = ((QObject*)(((qtc_DynamicQObject*)tx1)->parent()));
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_DHPROP).isValid()) {
return (int)((DhQSettings*)tx0)->DheventFilter((QObject*)tx1, (QEvent*)x2);
} else {
return (int)((QObject*)tx0)->eventFilter((QObject*)tx1, (QEvent*)x2);
}
}
QTCEXPORT(int,qtc_QSettings_eventFilter_h)(void* x0, void* x1, void* x2) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QObject*tx1 = *((QPointer<QObject>*)x1);
if ((tx1!=NULL)&&((QObject *)tx1)->property(QTC_PROP).isValid()) tx1 = ((QObject*)(((qtc_DynamicQObject*)tx1)->parent()));
return (int)((DhQSettings*)tx0)->DvheventFilter((QObject*)tx1, (QEvent*)x2);
}
QTCEXPORT(int,qtc_QSettings_receivers)(void* x0, wchar_t* x1) {
QObject*tx0 = *((QPointer<QObject>*)x0);
if ((tx0!=NULL)&&((QObject *)tx0)->property(QTC_PROP).isValid()) tx0 = ((QObject*)(((qtc_DynamicQObject*)tx0)->parent()));
QString tx1(from_method(x1));
QByteArray txa1(tx1.toAscii());
return (int)((DhQSettings*)tx0)->Dhreceivers(txa1.data());
}
QTCEXPORT(void*,qtc_QSettings_sender)(void* x0) {
QObject*tx0 = *((QPointer<QObject>*)x0);
QObject * tc = (QObject*)(((DhQSettings*)tx0)->Dhsender());
QPointer<QObject> * ttc = new QPointer<QObject>(tc);
return (void*)(ttc);
}
QTCEXPORT(void, qtc_QSettings_userMethod)(void * evt_obj, int evt_typ) {
QObject * te = *((QPointer<QObject>*)evt_obj);
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
((DhQSettings*)te)->userDefined(evt_typ);
}
QTCEXPORT(void*, qtc_QSettings_userMethodVariant)(void * evt_obj, int evt_typ, void * xv) {
QObject * te = *((QPointer<QObject>*)evt_obj);
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
return (void*)(((DhQSettings*)te)->userDefinedVariant(evt_typ, (QVariant*)xv));
}
QTCEXPORT(int, qtc_QSettings_setUserMethod)(void * evt_obj, int evt_typ, void * rf_ptr, void * st_ptr, void * df_ptr) {
QObject * te = *((QPointer<QObject>*)evt_obj);
QObject * tr = te;
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
QPointer<QObject> * ttr = new QPointer<QObject>(tr);
return (int) ((DhQSettings*)te)->setDynamicQHandlerud(0, (void*)ttr, evt_typ, rf_ptr, st_ptr, df_ptr);
}
QTCEXPORT(int, qtc_QSettings_setUserMethodVariant)(void * evt_obj, int evt_typ, void * rf_ptr, void * st_ptr, void * df_ptr) {
QObject * te = *((QPointer<QObject>*)evt_obj);
QObject * tr = te;
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
QPointer<QObject> * ttr = new QPointer<QObject>(tr);
return (int) ((DhQSettings*)te)->setDynamicQHandlerud(1, (void*)ttr, evt_typ, rf_ptr, st_ptr, df_ptr);
}
QTCEXPORT(int, qtc_QSettings_unSetUserMethod)(void * evt_obj, int udm_typ, int evt_typ) {
QObject * te = *((QPointer<QObject>*)evt_obj);
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
return (int) ((DhQSettings*)te)->unSetDynamicQHandlerud(udm_typ, evt_typ);
}
QTCEXPORT(int, qtc_QSettings_setHandler)(void * evt_obj, wchar_t * evt_typ, void * rf_ptr, void * st_ptr, void * df_ptr) {
QObject * te = *((QPointer<QObject>*)evt_obj);
QObject * tr = te;
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
QString tq_evt(from_method((wchar_t *)evt_typ));
QByteArray tqba_evt(tq_evt.toAscii());
QPointer<QObject> * ttr = new QPointer<QObject>(tr);
return (int) ((DhQSettings*)te)->setDynamicQHandler((void*)ttr, tqba_evt.data(), rf_ptr, st_ptr, df_ptr);
}
QTCEXPORT(int, qtc_QSettings_unSetHandler)(void * evt_obj, wchar_t * evt_typ) {
QObject * te = *((QPointer<QObject>*)evt_obj);
if (((QObject *)te)->property(QTC_PROP).isValid()) te = (((qtc_DynamicQObject *)te)->parent());
QString tq_evt(from_method((wchar_t *)evt_typ));
QByteArray tqba_evt(tq_evt.toAscii());
return (int) ((DhQSettings*)te)->unSetDynamicQHandler(tqba_evt.data());
}
QTCEXPORT(int, qtc_QSettings_setHandler1)(void * evt_obj, wchar_t * evt_typ, void * rf_ptr, void * st_ptr, void * df_ptr) {
return (int) qtc_QSettings_setHandler(evt_obj, evt_typ, rf_ptr, st_ptr, df_ptr);
}
QTCEXPORT(int, qtc_QSettings_setHandler2)(void * evt_obj, wchar_t * evt_typ, void * rf_ptr, void * st_ptr, void * df_ptr) {
return (int) qtc_QSettings_setHandler(evt_obj, evt_typ, rf_ptr, st_ptr, df_ptr);
}
}
| 42.778195 | 126 | 0.663679 | keera-studios |
b2d4fab9e6c078fc07103647921f766fca99ec03 | 1,107 | cpp | C++ | Binary Trees/27 Find Largest subtree sum in a tree.cpp | i-am-grut/LoveBabbar-450-Questions | 08faaa70198363c6ac481a67c548e1e7e4c7c591 | [
"MIT"
] | 2 | 2021-06-25T07:26:23.000Z | 2022-01-28T22:24:34.000Z | Binary Trees/27 Find Largest subtree sum in a tree.cpp | i-am-grut/LoveBabbar-450-Questions | 08faaa70198363c6ac481a67c548e1e7e4c7c591 | [
"MIT"
] | null | null | null | Binary Trees/27 Find Largest subtree sum in a tree.cpp | i-am-grut/LoveBabbar-450-Questions | 08faaa70198363c6ac481a67c548e1e7e4c7c591 | [
"MIT"
] | null | null | null | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
struct S {
bool isBST;
int minVal, maxVal, sum;
};
S helper(TreeNode *node, int &res) {
if (!node) {
return { true, INT_MAX, INT_MIN, 0 };
}
S l = helper(node->left, res);
S r = helper(node->right, res);
if (l.isBST && r.isBST && l.maxVal < node->val && r.minVal > node->val) {
int sum = l.sum + r.sum + node->val;
res = max(res, sum);
return { true, min(l.minVal, node->val), max(r.maxVal, node->val), sum };
} else {
return { false, 0, 0, 0 };
}
}
public:
int maxSumBST(TreeNode* root) {
int res = 0;
helper(root, res);
return res;
}
};
| 27.675 | 93 | 0.499548 | i-am-grut |
b2d5f4e39747062ba061f9b0f5bbc64c087d9150 | 584 | cpp | C++ | Kernel/kernel.cpp | BEASTSM96/KiwifruitOS | 3b8f49cc09aa69339ae59eb3d93cabbd122e4f64 | [
"MIT"
] | null | null | null | Kernel/kernel.cpp | BEASTSM96/KiwifruitOS | 3b8f49cc09aa69339ae59eb3d93cabbd122e4f64 | [
"MIT"
] | null | null | null | Kernel/kernel.cpp | BEASTSM96/KiwifruitOS | 3b8f49cc09aa69339ae59eb3d93cabbd122e4f64 | [
"MIT"
] | null | null | null | #include "Common/uints.h"
#include "Common/Macros.h"
#if defined(__linux__)
#error "You are not using a cross-compiler!"
#endif
#if !defined(__i386__)
#error "This needs to be compiled with a ix86-elf compiler!"
#endif
using Constructor = void( * )( );
Constructor Constructors_begin;
Constructor Constructors_end;
namespace kernel {
void run( void )
{
cli();
write_string("Hello World!");
sti();
}
void ctor( void )
{
for( Constructor* ctor = &Constructors_begin; ctor < &Constructors_end; ++ctor ) {
( *ctor )( );
}
//write_string("ctor Completed");
}
} | 17.69697 | 84 | 0.674658 | BEASTSM96 |
b2dee4bd66ab06393b62ee953b269cf0e0980cd4 | 1,621 | hh | C++ | src/ArtificialViscosity/RadialViscosity.hh | jmikeowen/Spheral | 3e1082a7aefd6b328bd3ae24ca1a477108cfc3c4 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 22 | 2018-07-31T21:38:22.000Z | 2020-06-29T08:58:33.000Z | src/ArtificialViscosity/RadialViscosity.hh | markguozhiming/spheral | bbb982102e61edb8a1d00cf780bfa571835e1b61 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 41 | 2020-09-28T23:14:27.000Z | 2022-03-28T17:01:33.000Z | src/ArtificialViscosity/RadialViscosity.hh | markguozhiming/spheral | bbb982102e61edb8a1d00cf780bfa571835e1b61 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 7 | 2019-12-01T07:00:06.000Z | 2020-09-15T21:12:39.000Z | //---------------------------------Spheral++----------------------------------//
// A version of the Monaghan Gingold pairwise viscosity with a hard wired
// radial interaction.
//
// Created by $Author, $Date: 2003-07-31 15:44:32 -0700 (Thu, 31 Jul 2003) $
//----------------------------------------------------------------------------//
#ifndef RadialViscosity_HH
#define RadialViscosity_HH
#include "MonaghanGingoldViscosity.hh"
namespace Spheral {
template<typename Dimension>
class RadialViscosity: public MonaghanGingoldViscosity<Dimension> {
public:
//--------------------------- Public Interface ---------------------------//
typedef typename Dimension::Scalar Scalar;
typedef typename Dimension::Vector Vector;
typedef typename Dimension::Tensor Tensor;
typedef typename Dimension::SymTensor SymTensor;
// Constructors.
RadialViscosity();
RadialViscosity(Scalar Clinear, Scalar Cquadratic);
// Destructor.
~RadialViscosity();
// Calculate the artificial internal energy term.
virtual Scalar viscousInternalEnergy(const NodeIDIterator<Dimension>& nodeI,
const NodeIDIterator<Dimension>& nodeJ,
const Vector& rij, const Vector& vij,
const Vector& etai, const Vector& etaj,
const Scalar ci, const Scalar cj) const;
private:
//--------------------------- Private Interface ---------------------------//
};
}
#else
namespace Spheral {
// Forward declaration.
template<typename Dimension> class RadialViscosity;
}
#endif
| 31.784314 | 80 | 0.567551 | jmikeowen |
b2e5d776d7624619d016265449628806d4483c0d | 5,449 | hh | C++ | src/sgvb_inference.hh | YPARK/fqtl | a1ced54a2b18f8ee66f39c62304c48f5522f7682 | [
"MIT"
] | 4 | 2017-06-15T12:05:02.000Z | 2017-11-16T11:11:45.000Z | src/sgvb_inference.hh | YPARK/fqtl | a1ced54a2b18f8ee66f39c62304c48f5522f7682 | [
"MIT"
] | 1 | 2022-02-22T16:41:36.000Z | 2022-02-22T16:41:36.000Z | src/sgvb_inference.hh | YPARK/fqtl | a1ced54a2b18f8ee66f39c62304c48f5522f7682 | [
"MIT"
] | null | null | null | // [[Rcpp::plugins(cpp14)]]
#include <Rcpp.h>
// [[Rcpp::depends(RcppEigen)]]
#include <RcppEigen.h>
// [[Rcpp::depends(RcppProgress)]]
#include <progress.hpp>
// [[Rcpp::plugins(openmp)]]
#include <omp.h>
#include "convergence.hh"
#include "tuple_util.hh"
#ifndef SGVB_INFERENCE_HH_
#define SGVB_INFERENCE_HH_
template <typename Model, typename Opt, typename... MeanEtas,
typename... VarEtas, typename... ClampedMeanEtas,
typename... ClampedVarEtas>
auto impl_fit_eta(Model &model, const Opt &opt,
std::tuple<MeanEtas...> &&mean_eta_tup,
std::tuple<VarEtas...> &&var_eta_tup,
std::tuple<ClampedMeanEtas...> &&clamped_mean_eta_tup,
std::tuple<ClampedVarEtas...> &&clamped_var_eta_tup);
template <typename Model, typename Opt, typename... MeanEtas,
typename... VarEtas>
auto impl_fit_eta(Model &model, const Opt &opt,
std::tuple<MeanEtas...> &&mean_eta_tup,
std::tuple<VarEtas...> &&var_eta_tup) {
dummy_eta_t dummy_eta;
return impl_fit_eta(model, opt,
std::move(mean_eta_tup), // mean
std::move(var_eta_tup), // variance
std::make_tuple(dummy_eta), // clamped mean
std::make_tuple(dummy_eta)); // clamped variance
}
////////////////////////////////////////////////////////////////
// Fit multiple eta's
template <typename Model, typename Opt, typename... MeanEtas,
typename... VarEtas, typename... ClampedMeanEtas,
typename... ClampedVarEtas>
auto impl_fit_eta(Model &model, const Opt &opt,
std::tuple<MeanEtas...> &&mean_eta_tup,
std::tuple<VarEtas...> &&var_eta_tup,
std::tuple<ClampedMeanEtas...> &&clamped_mean_eta_tup,
std::tuple<ClampedVarEtas...> &&clamped_var_eta_tup) {
using Scalar = typename Model::Scalar;
using Index = typename Model::Index;
using Mat = typename Model::Data;
// random seed initialization
#ifdef EIGEN_USE_MKL_ALL
VSLStreamStatePtr rng;
vslNewStream(&rng, VSL_BRNG_SFMT19937, opt.rseed());
#else
std::mt19937 rng(opt.rseed());
#endif
Eigen::setNbThreads(opt.nthread());
TLOG("Number of threads = " << Eigen::nbThreads());
using conv_t = convergence_t<Scalar>;
Mat onesN = Mat::Ones(model.n, 1) / static_cast<Scalar>(model.n);
conv_t conv(typename conv_t::Nmodels(model.m),
typename conv_t::Interv(opt.ninterval()));
const Index nstoch = opt.nsample();
const Index niter = opt.vbiter();
Index t;
Mat mean_sampled(model.n, model.m);
Mat var_sampled(model.n, model.m);
// Must keep this progress obj; otherwise segfault will occur
Progress prog(2 * opt.vbiter(), !opt.verbose());
// model fitting
Scalar rate = opt.rate0();
bool do_hyper = false;
auto resolve_eta = [&](auto &&eta) { eta.resolve(); };
auto sample_mean_eta = [&](auto &&eta) {
mean_sampled = mean_sampled + eta.sample(rng);
};
auto sample_var_eta = [&](auto &&eta) {
var_sampled = var_sampled + eta.sample(rng);
};
auto update_sgd_eta = [&](auto &&eta) {
for (Index s = 0; s < nstoch; ++s) {
mean_sampled.setZero();
var_sampled.setZero();
func_apply(sample_mean_eta, std::move(clamped_mean_eta_tup));
func_apply(sample_var_eta, std::move(clamped_var_eta_tup));
func_apply(sample_mean_eta, std::move(mean_eta_tup));
func_apply(sample_var_eta, std::move(var_eta_tup));
model.eval(mean_sampled, var_sampled);
eta.add_sgd(model.llik());
}
if (do_hyper) {
eta.eval_hyper_sgd();
eta.update_hyper_sgd(rate);
}
eta.eval_sgd();
eta.update_sgd(rate);
};
// first resolve current states for everything
func_apply(resolve_eta, std::move(clamped_mean_eta_tup));
func_apply(resolve_eta, std::move(clamped_var_eta_tup));
func_apply(resolve_eta, std::move(mean_eta_tup));
func_apply(resolve_eta, std::move(var_eta_tup));
// initial tuning without hyperparameter optimization
do_hyper = false;
for (t = 0; t < niter; ++t) {
if (Progress::check_abort()) {
break;
}
prog.increment();
rate = opt.rate0() * std::pow(static_cast<Scalar>(t + 1), opt.decay());
func_apply(update_sgd_eta, std::move(mean_eta_tup));
func_apply(update_sgd_eta, std::move(var_eta_tup));
conv.add(model.llik().transpose() * onesN);
bool converged = conv.converged(opt.vbtol(), opt.miniter());
if (opt.verbose()) conv.print(Rcpp::Rcerr);
if (converged) {
TLOG("Converged initial log-likelihood");
break;
}
}
// hyperparameter tuning
if (opt.do_hyper()) {
do_hyper = true;
for (; t < 2 * niter; ++t) {
if (Progress::check_abort()) {
break;
}
prog.increment();
rate = opt.rate0() * std::pow(static_cast<Scalar>(t + 1), opt.decay());
func_apply(update_sgd_eta, std::move(mean_eta_tup));
func_apply(update_sgd_eta, std::move(var_eta_tup));
conv.add(model.llik().transpose() * onesN);
bool converged = conv.converged(opt.vbtol(), opt.miniter());
if (opt.verbose()) conv.print(Rcpp::Rcerr);
if (converged) {
TLOG("Converged hyperparameter log-likelihood");
break;
}
}
}
#ifdef EIGEN_USE_MKL_ALL
vslDeleteStream(&rng);
#endif
TLOG("Finished SGVB inference");
return conv.summarize();
}
#endif
| 32.242604 | 77 | 0.626904 | YPARK |
b2fbcacf7d3b1f00df83d40aa4a1e73de38e2ac5 | 2,420 | cpp | C++ | src/TestFieldParser.cpp | mserdarsanli/QuantumJson | 7aa8c7e17d2ff6677264edd20f54d7ee20821213 | [
"MIT"
] | 6 | 2016-09-28T21:05:46.000Z | 2019-03-26T16:58:49.000Z | src/TestFieldParser.cpp | mserdarsanli/QuantumJson | 7aa8c7e17d2ff6677264edd20f54d7ee20821213 | [
"MIT"
] | null | null | null | src/TestFieldParser.cpp | mserdarsanli/QuantumJson | 7aa8c7e17d2ff6677264edd20f54d7ee20821213 | [
"MIT"
] | null | null | null | // The MIT License (MIT)
//
// Copyright (c) 2017 Mustafa Serdar Sanli
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include <string>
#include <catch2/catch.hpp>
#include "FieldParser.hpp"
using namespace std;
TEST_CASE("Test no duplicate fields")
{
FieldParser fp;
fp.addField("id", "parser.ParseValueInto(this->id);");
fp.addField("name", "parser.ParseValueInto(this->name);");
REQUIRE_THROWS_WITH(
fp.addField("name", "parser.ParseValueInto(this->qweqe);"),
"Field already present: name");
}
TEST_CASE("Test generated code simple")
{
FieldParser fp;
fp.addField("id", "parser.ParseValueInto(this->id);");
fp.addField("name", "parser.ParseValueInto(this->name);");
fp.addField("nam", "parser.ParseValueInto(this->nam);");
fp.addField("two-words", "parser.ParseValueInto(this->twoWords);");
string code = fp.generateFieldParserCode();
// Simple sanity checks
REQUIRE(code.find("parser.ParseValueInto(this->twoWords);") != string::npos);
REQUIRE(code.find("state_unknown_field_matching:") != string::npos);
REQUIRE(code.find("state_unknown_field_matched:") != string::npos);
}
TEST_CASE("Test no fields")
{
FieldParser fp;
// no field added
string code = fp.generateFieldParserCode();
// Simple sanity checks
REQUIRE(code.find("state_unknown_field_matching:") != string::npos);
REQUIRE(code.find("state_unknown_field_matched:") != string::npos);
}
| 35.072464 | 81 | 0.738843 | mserdarsanli |
b2ffe161b3f654625da28e30830d57e2f4860f58 | 2,942 | cpp | C++ | src_smartcontract/lang_sql/sql_expression/SQLDistinctArgument.cpp | alinous-core/codable-cash | 32a86a152a146c592bcfd8cc712f4e8cb38ee1a0 | [
"MIT"
] | 1 | 2020-10-15T08:24:35.000Z | 2020-10-15T08:24:35.000Z | src_smartcontract/lang_sql/sql_expression/SQLDistinctArgument.cpp | Codablecash/codablecash | 8816b69db69ff2f5da6cdb6af09b8fb21d3df1d9 | [
"MIT"
] | null | null | null | src_smartcontract/lang_sql/sql_expression/SQLDistinctArgument.cpp | Codablecash/codablecash | 8816b69db69ff2f5da6cdb6af09b8fb21d3df1d9 | [
"MIT"
] | null | null | null | /*
* SQLDistinctArgument.cpp
*
* Created on: 2021/11/02
* Author: iizuka
*/
#include "lang_sql/sql_expression/SQLDistinctArgument.h"
#include "engine/sc_analyze/AnalyzedType.h"
#include "scan_select/scan_columns/ScanColumnHolder.h"
#include "scan_select/scan_planner/base/SelectScanPlanner.h"
#include "vm/VirtualMachine.h"
#include "scan_select/scan_planner/base/ConditionsHolderStackMarker.h"
#include "scan_select/scan_condition/params/ColumnIdentifierScanParam.h"
#include "engine/sc_analyze/AnalyzeContext.h"
#include "engine/sc_analyze/ValidationError.h"
#include "lang_sql/sql_expression/SQLColumnIdentifier.h"
#include "scan_select/scan_columns/ScanColumn.h"
using namespace codablecash;
namespace alinous {
SQLDistinctArgument::SQLDistinctArgument() : AbstractSQLExpression(CodeElement::SQL_EXP_DISTINCT_ARGUMENT) {
this->exp = nullptr;
}
SQLDistinctArgument::~SQLDistinctArgument() {
delete this->exp;
}
int SQLDistinctArgument::binarySize() const {
checkNotNull(this->exp);
int total = sizeof(uint16_t);
total += this->exp->binarySize();
return total;
}
void SQLDistinctArgument::toBinary(ByteBuffer* out) {
checkNotNull(this->exp);
out->putShort(CodeElement::SQL_EXP_DISTINCT_ARGUMENT);
this->exp->toBinary(out);
}
void SQLDistinctArgument::fromBinary(ByteBuffer* in) {
CodeElement* el = CodeElement::createFromBinary(in);
checkIsSQLExp(el);
this->exp = dynamic_cast<AbstractSQLExpression*>(el);
}
void SQLDistinctArgument::preAnalyze(AnalyzeContext* actx) {
this->exp->setParent(this);
this->exp->preAnalyze(actx);
}
void SQLDistinctArgument::analyzeTypeRef(AnalyzeContext* actx) {
this->exp->analyzeTypeRef(actx);
}
void SQLDistinctArgument::analyze(AnalyzeContext* actx) {
short kind = this->exp->getKind();
if(kind != CodeElement::SQL_EXP_COLUMN_ID){
actx->addValidationError(ValidationError::SQL_CONDITION_WRONG_DISTINCT_USE, this, L"Wrong use of DISTINCT", {});
return;
}
this->exp->analyze(actx);
}
AnalyzedType SQLDistinctArgument::getType(AnalyzeContext* actx) {
return AnalyzedType();
}
void SQLDistinctArgument::init(VirtualMachine* vm) {
this->exp->init(vm);
}
AbstractVmInstance* SQLDistinctArgument::interpret(VirtualMachine* vm) {
SelectScanPlanner* planner = vm->getSelectPlanner();
ConditionsHolderStackMarker marker(planner->getConditionsStack());
SQLColumnIdentifier* colId = dynamic_cast<SQLColumnIdentifier*>(this->exp);
ColumnIdentifierScanParam* param = new ColumnIdentifierScanParam(colId);
param->setDistinct(true);
planner->push(param);
return nullptr;
}
void SQLDistinctArgument::onSelectTarget(VirtualMachine* vm) {
SelectScanPlanner* planner = vm->getSelectPlanner();
ScanColumnHolder* colHolder = planner->getColumnHolder();
SQLColumnIdentifier* colId = dynamic_cast<SQLColumnIdentifier*>(this->exp);
ScanColumn* col = new ScanColumn(colId);
col->setDistinct(true);
colHolder->push(col);
}
} /* namespace alinous */
| 25.362069 | 114 | 0.774983 | alinous-core |
6504bb505805592f60ef3a76d8045a71cc6cbf21 | 8,980 | cc | C++ | src/reader/tag/vorbis_ogg.cc | jiajen/mp3edit | 0517fd54359b25bb0fd4e015833d51ab8183d884 | [
"MIT"
] | null | null | null | src/reader/tag/vorbis_ogg.cc | jiajen/mp3edit | 0517fd54359b25bb0fd4e015833d51ab8183d884 | [
"MIT"
] | null | null | null | src/reader/tag/vorbis_ogg.cc | jiajen/mp3edit | 0517fd54359b25bb0fd4e015833d51ab8183d884 | [
"MIT"
] | null | null | null | #include "mp3edit/src/reader/tag/vorbis_ogg.h"
#include <cstring>
#include <stdexcept>
#include "mp3edit/src/reader/tag/vorbis_shared.h"
#include "mp3edit/src/reader/utility.h"
namespace Mp3Edit {
namespace ReaderTag {
namespace VorbisOgg {
namespace {
using Filesystem::readBytes;
const int kFirstPageLength = 58;
const int kFirstPageDataStartPos = 28;
const int kPageHeaderPrefixLength = 27;
const int kPageNumberStartPos = 18;
const int kNumberPageSegmentsPos = 26;
const int kCommonVorbisHeaderSize = 7;
const int kPageCrcPos = 22;
const int kPageCrcLength = 4;
const char* kVorbisCommentHeader = "\x03\x76\x6F\x72\x62\x69\x73";
bool verifyValidOggVorbisHeader(unsigned char type, const Bytes& tag,
int seek) {
if (tag[seek] != type) return false;
if (strncmp((const char*)tag.data()+seek+1, "vorbis", 6) != 0) return false;
return true;
}
inline bool verifyValidOggVorbisIdHeader(const Bytes& tag, int seek) {
return verifyValidOggVorbisHeader(0x01, tag, seek);
}
inline bool verifyValidOggVorbisCommentHeader(const Bytes& tag, int seek) {
return verifyValidOggVorbisHeader(0x03, tag, seek);
}
inline bool verifyValidOggVorbisSetupHeader(const Bytes& tag, int seek) {
return verifyValidOggVorbisHeader(0x05, tag, seek);
}
// Checks the validity of an ogg file's first page
// and the second page's header.
bool verifyValidOggHeaderPrefix(const Bytes& header) {
// First Page (Identification Header)
if (strncmp((const char*)header.data(), "OggS", 4) != 0) return false;
if (!verifyValidOggVorbisIdHeader(header, kFirstPageDataStartPos))
return false;
// Second Page (Must fulfill a template as program makes an assumption)
if (strncmp((const char*)header.data() + kFirstPageLength, "OggS", 4) != 0)
return false;
if ((header[kFirstPageLength+4]|header[kFirstPageLength+5]) != 0x00)
return false;
if (header[kFirstPageLength+kPageNumberStartPos] != 0x01 ||
header[kFirstPageLength+kPageNumberStartPos+1] != 0x00 ||
header[kFirstPageLength+kPageNumberStartPos+2] != 0x00 ||
header[kFirstPageLength+kPageNumberStartPos+3] != 0x00)
return false;
return true;
}
int segmentTableToSize(const Bytes& segment_table) {
int size = 0, n = segment_table.size();
if (n > 0 && segment_table[n-1] == 0xFF)
throw std::runtime_error("Invalid OGG.");
for (int i = 0; i < n; i++)
size += (int)segment_table[i];
return size;
}
Bytes generateSegmentTable(int size_t1, int size_t2) {
Bytes segment_table;
segment_table.reserve(2 + size_t1/255 + size_t2/255);
unsigned char block;
for (int t = 0, size; t < 2; t++) {
size = (t == 0) ? size_t1 : size_t2;
while (size > 0) {
block = (size > 255) ? 255 : size;
segment_table.push_back(block);
size -= block;
}
if (segment_table.size() > 0 && segment_table.back() == 255)
segment_table.push_back(0);
}
if (segment_table.size() > 255)
throw std::runtime_error("Tag too large.");
return segment_table;
}
Bytes calculateCrc(const Bytes& page_header, const Bytes& segment_table,
const char* vorbis_header, const Bytes& vorbis_tag,
const Bytes& audio_data) {
typedef const unsigned char* ByteRef;
using Reader::Utility::Crc32;
Crc32 crc32(Crc32::CrcPolynomial::kCode0x04c11db7, 0x00000000, 0x00000000);
crc32.update((ByteRef)page_header.data(), page_header.size());
crc32.update((ByteRef)segment_table.data(), segment_table.size());
crc32.update((ByteRef)vorbis_header, kCommonVorbisHeaderSize);
crc32.update((ByteRef)vorbis_tag.data(), vorbis_tag.size());
crc32.update((ByteRef)audio_data.data(), audio_data.size());
return Reader::Utility::intToLEndian(crc32.checksum(), kPageCrcLength, false);
}
} // namespace
bool parseTag(const Bytes& tag, std::string& title, std::string& artist,
std::string& album, int& track_num, int& track_denum) {
using VorbisShared::parseTag;
int res = parseTag(tag, kCommonVorbisHeaderSize, true, false,
title, artist, album, track_num, track_denum);
return (res != -1);
}
Bytes extractTag(Filesystem::FileStream& file_stream,
int seek_tag_start, int) {
Bytes number_segments_raw, segment_table, second_page;
int seek = seek_tag_start + kFirstPageLength + kNumberPageSegmentsPos;
readBytes(file_stream, seek++, 1, number_segments_raw);
int number_segments = number_segments_raw[0];
readBytes(file_stream, seek, number_segments, segment_table);
seek += number_segments;
int page_size = segmentTableToSize(segment_table);
readBytes(file_stream, seek, page_size, second_page);
return second_page;
}
// Warning: Limited functionality. Although the official specification states
// that an OGG structure can have its vorbis comment span more than a single
// page, this function assumes that the vorbis comment is entirely encapsulated
// in the second page of an OGG file. This is done to simplify the process of
// saving the OGG file as this particular case only requires overwriting the
// second page (merely requiring adjustments to the size and checksum in the
// header of the second page).
// Future Improvements: Allow reading of vorbis comments spanning more than
// one page.
int seekHeaderEnd(Filesystem::FileStream& file_stream, int seek) {
Bytes header, segment_table, second_page;
readBytes(file_stream, seek, kFirstPageLength + kPageHeaderPrefixLength,
header);
seek += kFirstPageLength + kPageHeaderPrefixLength;
if (!verifyValidOggHeaderPrefix(header))
throw std::runtime_error("Unsupported OGG.");
int number_segments = header[kFirstPageLength + kNumberPageSegmentsPos];
readBytes(file_stream, seek, number_segments, segment_table);
seek += number_segments;
int page_size = segmentTableToSize(segment_table);
readBytes(file_stream, seek, page_size, second_page);
if (!verifyValidOggVorbisCommentHeader(second_page, 0))
throw std::runtime_error("Invalid OGG.");
int vorbis_tag_size = VorbisShared::parseTag(second_page,
kCommonVorbisHeaderSize,
true, true);
if (vorbis_tag_size == -1)
throw std::runtime_error("Unsupported OGG.");
seek += kCommonVorbisHeaderSize + vorbis_tag_size;
if (!verifyValidOggVorbisSetupHeader(second_page, kCommonVorbisHeaderSize +
vorbis_tag_size))
throw std::runtime_error("Unsupported OGG.");
return seek;
}
Bytes generateTag(Filesystem::FileStream& file_stream,
int seek_ogg_start, int seek_audio_start,
const std::string& title, const std::string& artist,
const std::string& album, int track_num, int track_denum) {
Bytes first_page;
readBytes(file_stream, seek_ogg_start, kFirstPageLength, first_page);
Bytes header_second_page;
readBytes(file_stream, seek_ogg_start + kFirstPageLength,
kPageHeaderPrefixLength, header_second_page);
Bytes segment_table;
int number_segments = header_second_page[kNumberPageSegmentsPos];
readBytes(file_stream,
seek_ogg_start + kFirstPageLength + kPageHeaderPrefixLength,
number_segments, segment_table);
int page_size = segmentTableToSize(segment_table);
using VorbisShared::generateTag;
Bytes vorbis_tag = generateTag(title, artist, album,
track_num, track_denum, true);
int vorbis_setup_size = seek_ogg_start + kFirstPageLength +
kPageHeaderPrefixLength + number_segments +
page_size - seek_audio_start;
Bytes page_audio_data;
readBytes(file_stream, seek_audio_start, vorbis_setup_size, page_audio_data);
// Generation
memset(header_second_page.data() + kPageCrcPos, 0x00, kPageCrcLength);
segment_table = generateSegmentTable(kCommonVorbisHeaderSize +
vorbis_tag.size(), vorbis_setup_size);
header_second_page[kNumberPageSegmentsPos] = segment_table.size();
Bytes crc = calculateCrc(header_second_page, segment_table,
kVorbisCommentHeader, vorbis_tag, page_audio_data);
memcpy(header_second_page.data() + kPageCrcPos, crc.data(), crc.size());
Bytes tag;
tag.reserve(kFirstPageLength + kPageHeaderPrefixLength +
segment_table.size() + kCommonVorbisHeaderSize +
vorbis_tag.size());
tag.insert(tag.end(), first_page.begin(), first_page.end());
tag.insert(tag.end(), header_second_page.begin(), header_second_page.end());
tag.insert(tag.end(), segment_table.begin(), segment_table.end());
tag.insert(tag.end(), kVorbisCommentHeader, kVorbisCommentHeader +
kCommonVorbisHeaderSize);
tag.insert(tag.end(), vorbis_tag.begin(), vorbis_tag.end());
return tag;
}
} // namespace VorbisOgg
} // namespace ReaderTag
} // namespace Mp3Edit
| 38.376068 | 80 | 0.704677 | jiajen |
65096c18c6d7b80615031f0a20b0945a5b308f74 | 1,338 | hh | C++ | src/fi/issue_execute_fault.hh | ramirocf/gem5-pipe | 3eca35c39f72b2bbb9293d10ec8d568c326e2886 | [
"BSD-3-Clause"
] | null | null | null | src/fi/issue_execute_fault.hh | ramirocf/gem5-pipe | 3eca35c39f72b2bbb9293d10ec8d568c326e2886 | [
"BSD-3-Clause"
] | null | null | null | src/fi/issue_execute_fault.hh | ramirocf/gem5-pipe | 3eca35c39f72b2bbb9293d10ec8d568c326e2886 | [
"BSD-3-Clause"
] | null | null | null | #ifndef __ISSUE_EXECUTE_FAULT_HH__
#define __ISSUE_EXECUTE_FAULT_HH__
#include "config/the_isa.hh"
#include "base/types.hh"
#include "fi/rename_issue_fault.hh"
#include "fi/faultq.hh"
#include "cpu/op_class.hh"
/*
* Inject a fault into the issue to execute stage pipeline register
*/
class Issue_ExecuteFault : public Rename_IssueFault
{
private:
protected:
//Fields
short int srcReg0Ready = 21;
short int srcReg1Ready = 22;
short int opClass = 23;
public:
//field types
static const int srcRegReady_type = 6;
static const int opClass_type = 7;
Issue_ExecuteFault(std::ifstream &os, bool inherited);
~Issue_ExecuteFault();
virtual const char *description() const;
virtual void dump() const;
virtual void set_field(std::string file_field);
//Process functions
Base_PipelineFault::dynInstPtr process(dynInstPtr curInst);
void srcRegReady_process(dynInstPtr &curInst, int id);
void opClass_process(dynInstPtr &curInst);
};
/**Issue Execute Fault Queue
*Its purpouse is very straightforward
*/
class Issue_ExecuteFaultQueue : public InjectedFaultQueue
{
private:
protected:
public:
using InjectedFaultQueue::scan;
virtual Issue_ExecuteFault *scan(std::string s, ThreadEnabledFault &thisThread, Addr vaddr, int curBundle, int fieldType);
};
#endif // __ISSUE_EXECUTE_FAULT_HH__
| 22.3 | 126 | 0.758595 | ramirocf |
650d9e89a7e01c568ceb30f30fe847234bec796e | 1,678 | cpp | C++ | src/platform/file_watcher.cpp | Markovna/UbikEngine | b26d99a65dbad12d7cd64ca8b562e4cea25c4c93 | [
"MIT"
] | 1 | 2021-07-05T11:50:09.000Z | 2021-07-05T11:50:09.000Z | src/platform/file_watcher.cpp | Markovna/UbikEngine | b26d99a65dbad12d7cd64ca8b562e4cea25c4c93 | [
"MIT"
] | null | null | null | src/platform/file_watcher.cpp | Markovna/UbikEngine | b26d99a65dbad12d7cd64ca8b562e4cea25c4c93 | [
"MIT"
] | null | null | null | #include "file_watcher.h"
#include <efsw/efsw.hpp>
class update_listener : public efsw::FileWatchListener {
public:
using event_t = event<const std::string&, const std::string&, file_action, const std::string&>;
public:
explicit update_listener(event_t& event) : event_(event) {}
void handleFileAction( efsw::WatchID watchid, const std::string& dir, const std::string& filename, efsw::Action action, std::string oldFilename) override
{
switch (action)
{
case efsw::Actions::Add:
event_(dir, filename, file_action::Add, "");
break;
case efsw::Actions::Delete:
event_(dir, filename, file_action::Delete, "");
break;
case efsw::Actions::Modified:
event_(dir, filename, file_action::Modified, "");
break;
case efsw::Actions::Moved:
event_(dir, filename, file_action::Moved, oldFilename);
break;
default:
std::cerr << "Should never happen!" << std::endl;
}
}
private:
event_t& event_;
};
file_watcher::file_watcher()
: on_modified_()
, watcher_(new efsw::FileWatcher)
, listener_(new update_listener(on_modified_))
{
watcher_->watch();
}
void file_watcher::add_path(const char *path, bool recursive) {
watcher_->addWatch(path, listener_, recursive);
}
void file_watcher::remove_path(const char *path) {
watcher_->removeWatch(path);
}
void file_watcher::disconnect(file_watcher::handler_t &&handler) {
on_modified_.disconnect(std::forward<handler_t>(handler));
}
void file_watcher::disconnect_all() {
on_modified_.disconnect_all();
}
file_watcher::~file_watcher() {
disconnect_all();
delete watcher_;
delete listener_;
}
| 27.508197 | 155 | 0.679976 | Markovna |
65176460e38e05b218d0e04975ba71aedc3bcca1 | 3,825 | hpp | C++ | smacc2/include/smacc2/smacc_asynchronous_client_behavior.hpp | reelrbtx/SMACC2 | ac61cb1599f215fd9f0927247596796fc53f82bf | [
"Apache-2.0"
] | 48 | 2021-05-28T01:33:20.000Z | 2022-03-24T03:16:03.000Z | smacc2/include/smacc2/smacc_asynchronous_client_behavior.hpp | reelrbtx/SMACC2 | ac61cb1599f215fd9f0927247596796fc53f82bf | [
"Apache-2.0"
] | 75 | 2021-06-25T22:11:21.000Z | 2022-03-30T13:05:38.000Z | smacc2/include/smacc2/smacc_asynchronous_client_behavior.hpp | reelrbtx/SMACC2 | ac61cb1599f215fd9f0927247596796fc53f82bf | [
"Apache-2.0"
] | 14 | 2021-06-16T12:10:57.000Z | 2022-03-01T18:23:27.000Z | // Copyright 2021 RobosoftAI Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
/*****************************************************************************************************************
*
* Authors: Pablo Inigo Blasco, Brett Aldrich
*
******************************************************************************************************************/
#pragma once
#include <condition_variable>
#include <future>
#include <mutex>
#include <smacc2/smacc_client_behavior_base.hpp>
#include <smacc2/smacc_signal.hpp>
#include <thread>
namespace smacc2
{
template <typename AsyncCB, typename Orthogonal>
struct EvCbFinished : sc::event<EvCbFinished<AsyncCB, Orthogonal>>
{
};
template <typename AsyncCB, typename Orthogonal>
struct EvCbSuccess : sc::event<EvCbSuccess<AsyncCB, Orthogonal>>
{
};
template <typename AsyncCB, typename Orthogonal>
struct EvCbFailure : sc::event<EvCbFailure<AsyncCB, Orthogonal>>
{
};
// INTRODUCTION: All of them conceptually start in parallel when the state starts. No behavior should block the creation of other behaviors,
// Asnchronous client behaviors are used when the onEntry or onExit function execution is slow
// CONCEPT: this funcionality is related with the orthogonality of SmaccState machines.
// Alternative for long duration behaviors: using default-synchromous SmaccClientBehaviors with the update method
// ASYNCHRONOUS STATE MACHINES DESIGN NOTES: Asynchronous behaviors can safely post events and use its local methods,
// but the interaction with other components or elements of
// the state machine is not by-default thread safe and must be manually implemented. For example, if some element of the architecture
// (components, states, clients) need to access to this behavior client information it is needed to implement a mutex for the internal
// state of this behavior. Other example: if this behavior access to some component located in other thread, it is also may be needed
// to some mutex for that component
class SmaccAsyncClientBehavior : public ISmaccClientBehavior
{
public:
template <typename TOrthogonal, typename TSourceObject>
void onOrthogonalAllocation();
virtual ~SmaccAsyncClientBehavior();
template <typename TCallback, typename T>
boost::signals2::connection onSuccess(TCallback callback, T * object);
template <typename TCallback, typename T>
boost::signals2::connection onFinished(TCallback callback, T * object);
template <typename TCallback, typename T>
boost::signals2::connection onFailure(TCallback callback, T * object);
protected:
void postSuccessEvent();
void postFailureEvent();
virtual void dispose() override;
private:
void waitFutureIfNotFinished(std::future<int> & threadfut);
std::future<int> onEntryThread_;
std::future<int> onExitThread_;
std::function<void()> postFinishEventFn_;
std::function<void()> postSuccessEventFn_;
std::function<void()> postFailureEventFn_;
SmaccSignal<void()> onFinished_;
SmaccSignal<void()> onSuccess_;
SmaccSignal<void()> onFailure_;
// executes onExit in a new thread
void executeOnEntry() override;
// executes onExit in a new thread, waits first onEntry thread if it is still running
void executeOnExit() override;
};
} // namespace smacc2
#include <smacc2/impl/smacc_asynchronous_client_behavior_impl.hpp>
| 37.871287 | 140 | 0.727059 | reelrbtx |
fb91c6ccafcec2c74e1938730669cbd196bd5546 | 11,052 | cpp | C++ | src/example/TChem_IgnitionZeroD.cpp | kyungjoo-kim/TChem | 69915ca8de71df9a6a463aae45c5bd6db31646bc | [
"BSD-2-Clause"
] | null | null | null | src/example/TChem_IgnitionZeroD.cpp | kyungjoo-kim/TChem | 69915ca8de71df9a6a463aae45c5bd6db31646bc | [
"BSD-2-Clause"
] | null | null | null | src/example/TChem_IgnitionZeroD.cpp | kyungjoo-kim/TChem | 69915ca8de71df9a6a463aae45c5bd6db31646bc | [
"BSD-2-Clause"
] | 1 | 2022-02-26T18:04:44.000Z | 2022-02-26T18:04:44.000Z | /* =====================================================================================
TChem version 2.0
Copyright (2020) NTESS
https://github.com/sandialabs/TChem
Copyright 2020 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government retains
certain rights in this software.
This file is part of TChem. TChem is open source software: you can redistribute it
and/or modify it under the terms of BSD 2-Clause License
(https://opensource.org/licenses/BSD-2-Clause). A copy of the licese is also
provided under the main directory
Questions? Contact Cosmin Safta at <csafta@sandia.gov>, or
Kyungjoo Kim at <kyukim@sandia.gov>, or
Oscar Diaz-Ibarra at <odiazib@sandia.gov>
Sandia National Laboratories, Livermore, CA, USA
===================================================================================== */
#include "TChem_CommandLineParser.hpp"
#include "TChem_KineticModelData.hpp"
#include "TChem_Util.hpp"
#include "TChem_IgnitionZeroD.hpp"
using ordinal_type = TChem::ordinal_type;
using real_type = TChem::real_type;
using time_advance_type = TChem::time_advance_type;
using real_type_0d_view = TChem::real_type_0d_view;
using real_type_1d_view = TChem::real_type_1d_view;
using real_type_2d_view = TChem::real_type_2d_view;
using time_advance_type_0d_view = TChem::time_advance_type_0d_view;
using time_advance_type_1d_view = TChem::time_advance_type_1d_view;
using real_type_0d_view_host = TChem::real_type_0d_view_host;
using real_type_1d_view_host = TChem::real_type_1d_view_host;
using real_type_2d_view_host = TChem::real_type_2d_view_host;
using time_advance_type_0d_view_host = TChem::time_advance_type_0d_view_host;
using time_advance_type_1d_view_host = TChem::time_advance_type_1d_view_host;
#define TCHEM_EXAMPLE_IGNITIONZEROD_QOI_PRINT
int
main(int argc, char* argv[])
{
/// default inputs
std::string prefixPath("data/ignition-zero-d/");
std::string chemFile(prefixPath + "chem.inp");
std::string thermFile(prefixPath + "therm.dat");
std::string inputFile(prefixPath + "input.dat");
const real_type zero(0);
real_type tbeg(0), tend(1);
real_type dtmin(1e-11), dtmax(1e-6);
real_type rtol_time(1e-8), atol_newton(1e-8), rtol_newton(1e-5);
int num_time_iterations_per_interval(1e1), max_num_time_iterations(1e3),
max_num_newton_iterations(100);
int nBatch(1), team_size(-1), vector_size(-1);
;
bool verbose(true);
/// parse command line arguments
TChem::CommandLineParser opts(
"This example computes reaction rates with a given state vector");
opts.set_option<std::string>(
"chemfile", "Chem file name e.g., chem.inp", &chemFile);
opts.set_option<std::string>(
"thermfile", "Therm file name e.g., therm.dat", &thermFile);
opts.set_option<std::string>(
"inputfile", "Input state file name e.g., input.dat", &inputFile);
opts.set_option<real_type>("tbeg", "Time begin", &tbeg);
opts.set_option<real_type>("tend", "Time end", &tend);
opts.set_option<real_type>("dtmin", "Minimum time step size", &dtmin);
opts.set_option<real_type>("dtmax", "Maximum time step size", &dtmax);
opts.set_option<real_type>(
"atol-newton", "Absolute tolerence used in newton solver", &atol_newton);
opts.set_option<real_type>(
"rtol-newton", "Relative tolerence used in newton solver", &rtol_newton);
opts.set_option<real_type>(
"tol-time", "Tolerence used for adaptive time stepping", &rtol_time);
opts.set_option<int>("time-iterations-per-interval",
"Number of time iterations per interval to store qoi",
&num_time_iterations_per_interval);
opts.set_option<int>("max-time-iterations",
"Maximum number of time iterations",
&max_num_time_iterations);
opts.set_option<int>("max-newton-iterations",
"Maximum number of newton iterations",
&max_num_newton_iterations);
opts.set_option<int>(
"batchsize",
"Batchsize the same state vector described in statefile is cloned",
&nBatch);
opts.set_option<int>("team-size", "User defined team size", &team_size);
opts.set_option<int>("vector-size", "User defined vector size", &vector_size);
opts.set_option<bool>(
"verbose", "If true, printout the first Jacobian values", &verbose);
const bool r_parse = opts.parse(argc, argv);
if (r_parse)
return 0; // print help return
Kokkos::initialize(argc, argv);
{
const bool detail = false;
TChem::exec_space::print_configuration(std::cout, detail);
TChem::host_exec_space::print_configuration(std::cout, detail);
/// construct kmd and use the view for testing
TChem::KineticModelData kmd(chemFile, thermFile);
const TChem::KineticModelConstData<TChem::exec_space> kmcd =
kmd.createConstData<TChem::exec_space>();
const ordinal_type stateVecDim =
TChem::Impl::getStateVectorSize(kmcd.nSpec);
/// input: state vectors: temperature, pressure and concentration
real_type_2d_view state("StateVector", nBatch, stateVecDim);
// for (ordinal_type k = 0; k < kmcd.nSpec; k++) {
// printf("%k %a\n",k,kmcd.speciesNames(k) );
// }
/// create a mirror view to store input from a file
auto state_host = Kokkos::create_mirror_view(state);
/// input from a file; this is not necessary as the input is created
/// by other applications.
{
auto state_host_at_i = Kokkos::subview(state_host, 0, Kokkos::ALL());
TChem::Test::readStateVector(inputFile, kmcd.nSpec, state_host_at_i);
TChem::Test::cloneView(state_host);
}
Kokkos::Impl::Timer timer;
auto printState = [](const time_advance_type _tadv,
const real_type _t,
const real_type_1d_view_host _state_at_i) {
#if defined(TCHEM_EXAMPLE_IGNITIONZEROD_QOI_PRINT)
/// iter, t, dt, rho, pres, temp, Ys ....
printf("%e %e %e %e %e",
_t,
_t - _tadv._tbeg,
_state_at_i(0),
_state_at_i(1),
_state_at_i(2));
for (ordinal_type k = 3, kend = _state_at_i.extent(0); k < kend; ++k)
printf(" %e", _state_at_i(k));
printf("\n");
#endif
};
timer.reset();
Kokkos::deep_copy(state, state_host);
const real_type t_deepcopy = timer.seconds();
timer.reset();
{
const auto exec_space_instance = TChem::exec_space();
using policy_type =
typename TChem::UseThisTeamPolicy<TChem::exec_space>::type;
/// team policy
policy_type policy(exec_space_instance, nBatch, Kokkos::AUTO());
const ordinal_type level = 1;
const ordinal_type per_team_extent =
TChem::IgnitionZeroD::getWorkSpaceSize(kmcd);
const ordinal_type per_team_scratch =
TChem::Scratch<real_type_1d_view>::shmem_size(per_team_extent);
policy.set_scratch_size(level, Kokkos::PerTeam(per_team_scratch));
{ /// time integration
real_type_1d_view t("time", nBatch);
Kokkos::deep_copy(t, tbeg);
real_type_1d_view dt("delta time", nBatch);
Kokkos::deep_copy(dt, dtmin);
using problem_type = TChem::Impl::IgnitionZeroD_Problem<decltype(kmcd)>;
real_type_2d_view tol_time(
"tol time", problem_type::getNumberOfTimeODEs(kmcd), 2);
real_type_1d_view tol_newton("tol newton", 2);
real_type_2d_view fac(
"fac", nBatch, problem_type::getNumberOfEquations(kmcd));
/// tune tolerence
{
auto tol_time_host = Kokkos::create_mirror_view(tol_time);
auto tol_newton_host = Kokkos::create_mirror_view(tol_newton);
const real_type atol_time = 1e-12;
for (ordinal_type i = 0, iend = tol_time.extent(0); i < iend; ++i) {
tol_time_host(i, 0) = atol_time;
tol_time_host(i, 1) = rtol_time;
}
tol_newton_host(0) = atol_newton;
tol_newton_host(1) = rtol_newton;
Kokkos::deep_copy(tol_time, tol_time_host);
Kokkos::deep_copy(tol_newton, tol_newton_host);
}
time_advance_type tadv_default;
tadv_default._tbeg = tbeg;
tadv_default._tend = tend;
tadv_default._dt = dtmin;
tadv_default._dtmin = dtmin;
tadv_default._dtmax = dtmax;
tadv_default._max_num_newton_iterations = max_num_newton_iterations;
tadv_default._num_time_iterations_per_interval =
num_time_iterations_per_interval;
time_advance_type_1d_view tadv("tadv", nBatch);
Kokkos::deep_copy(tadv, tadv_default);
/// host views to print QOI
const auto tadv_at_i = Kokkos::subview(tadv, 0);
const auto t_at_i = Kokkos::subview(t, 0);
const auto state_at_i = Kokkos::subview(state, 0, Kokkos::ALL());
auto tadv_at_i_host = Kokkos::create_mirror_view(tadv_at_i);
auto t_at_i_host = Kokkos::create_mirror_view(t_at_i);
auto state_at_i_host = Kokkos::create_mirror_view(state_at_i);
ordinal_type iter = 0;
/// print of store QOI for the first sample
#if defined(TCHEM_EXAMPLE_IGNITIONZEROD_QOI_PRINT)
{
/// could use cuda streams
Kokkos::deep_copy(tadv_at_i_host, tadv_at_i);
Kokkos::deep_copy(t_at_i_host, t_at_i);
Kokkos::deep_copy(state_at_i_host, state_at_i);
printState(tadv_at_i_host(), t_at_i_host(), state_at_i_host);
}
#endif
real_type tsum(0);
for (; iter < max_num_time_iterations && tsum <= tend; ++iter) {
TChem::IgnitionZeroD::runDeviceBatch(
policy, tol_newton, tol_time, fac, tadv, state, t, dt, state, kmcd);
Kokkos::fence();
/// print of store QOI for the first sample
#if defined(TCHEM_EXAMPLE_IGNITIONZEROD_QOI_PRINT)
{
/// could use cuda streams
Kokkos::deep_copy(tadv_at_i_host, tadv_at_i);
Kokkos::deep_copy(t_at_i_host, t_at_i);
Kokkos::deep_copy(state_at_i_host, state_at_i);
printState(tadv_at_i_host(), t_at_i_host(), state_at_i_host);
}
#endif
/// carry over time and dt computed in this step
tsum = zero;
Kokkos::parallel_reduce(
Kokkos::RangePolicy<TChem::exec_space>(0, nBatch),
KOKKOS_LAMBDA(const ordinal_type& i, real_type& update) {
tadv(i)._tbeg = t(i);
tadv(i)._dt = dt(i);
printf("t %e, dt %e\n", t(i), dt(i));
printf("tadv t %e, tadv dt %e\n", tadv(i)._tbeg, tadv(i)._dt);
update += t(i);
},
tsum);
Kokkos::fence();
tsum /= nBatch;
}
}
}
Kokkos::fence(); /// timing purpose
const real_type t_device_batch = timer.seconds();
printf("Time ignition %e [sec] %e [sec/sample]\n",
t_device_batch,
t_device_batch / real_type(nBatch));
}
Kokkos::finalize();
return 0;
}
| 38.778947 | 88 | 0.653275 | kyungjoo-kim |
fb94546df2295bc1e1a19662e32217782d27bf39 | 8,509 | cpp | C++ | pure_pursuit_core/test/AckermannSteeringControllerTest.cpp | Idate96/se2_navigation | 0fabe002742add5e4d716776b13704aa9c1aa339 | [
"BSD-3-Clause"
] | 216 | 2020-04-14T22:32:45.000Z | 2022-03-30T17:56:12.000Z | pure_pursuit_core/test/AckermannSteeringControllerTest.cpp | Idate96/se2_navigation | 0fabe002742add5e4d716776b13704aa9c1aa339 | [
"BSD-3-Clause"
] | 5 | 2020-09-23T08:41:38.000Z | 2021-11-11T09:58:00.000Z | pure_pursuit_core/test/AckermannSteeringControllerTest.cpp | Idate96/se2_navigation | 0fabe002742add5e4d716776b13704aa9c1aa339 | [
"BSD-3-Clause"
] | 56 | 2020-04-29T00:26:20.000Z | 2022-03-30T17:27:55.000Z | /*
* CreatorsTest.cpp
*
* Created on: Mar 25, 2020
* Author: jelavice
*/
#include <gtest/gtest.h>
// Math
#include <cmath>
#include "test_helpers.hpp"
#include "pure_pursuit_core/heading_control/AckermannSteeringController.hpp"
namespace ppt = pure_pursuit_test;
namespace pp = pure_pursuit;
using SolutionCase = pp::Intersection::SolutionCase;
constexpr unsigned int numCasesPerTest = 2000;
constexpr double maxParametersAbsError = 1e-6;
TEST(AckermannSteeringControllerTest, CopyParameters)
{
const int seed = ppt::seedRndGenerator();
std::uniform_real_distribution<double> paramsDist(0.0, 1000.0);
for (unsigned int i = 0; i < numCasesPerTest; ++i) {
pp::AckermannSteeringCtrlParameters parameters;
const double anchorBck = parameters.anchorDistanceBck_ = paramsDist(ppt::rndGenerator);
const double anchorFwd = parameters.anchorDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadFwd = parameters.lookaheadDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadBck = parameters.lookaheadDistanceBck_ = paramsDist(ppt::rndGenerator);
const double wheelBase = parameters.wheelBase_ = paramsDist(ppt::rndGenerator);
const pp::AckermannSteeringCtrlParameters copiedParams(parameters);
EXPECT_NEAR(parameters.anchorDistanceBck_, copiedParams.anchorDistanceBck_,
maxParametersAbsError);
EXPECT_NEAR(parameters.anchorDistanceFwd_, copiedParams.anchorDistanceFwd_,
maxParametersAbsError);
EXPECT_NEAR(parameters.lookaheadDistanceFwd_, copiedParams.lookaheadDistanceFwd_,
maxParametersAbsError);
EXPECT_NEAR(parameters.lookaheadDistanceBck_, copiedParams.lookaheadDistanceBck_,
maxParametersAbsError);
EXPECT_NEAR(parameters.wheelBase_, copiedParams.wheelBase_, maxParametersAbsError);
const pp::AckermannSteeringCtrlParameters assignedParameters = parameters;
EXPECT_NEAR(assignedParameters.anchorDistanceBck_, copiedParams.anchorDistanceBck_,
maxParametersAbsError);
EXPECT_NEAR(assignedParameters.anchorDistanceFwd_, copiedParams.anchorDistanceFwd_,
maxParametersAbsError);
EXPECT_NEAR(assignedParameters.lookaheadDistanceFwd_, copiedParams.lookaheadDistanceFwd_,
maxParametersAbsError);
EXPECT_NEAR(assignedParameters.lookaheadDistanceBck_, copiedParams.lookaheadDistanceBck_,
maxParametersAbsError);
EXPECT_NEAR(assignedParameters.wheelBase_, copiedParams.wheelBase_, maxParametersAbsError);
}
if (::testing::Test::HasFailure()) {
std::cout << "\n Test AckermannSteeringControllerTest, CopyParameters failed with seed: "
<< seed << std::endl;
}
}
TEST(AckermannSteeringControllerTest, SetParameters1)
{
const int seed = ppt::seedRndGenerator();
std::uniform_real_distribution<double> paramsDist(-1000.0, -1.0);
for (unsigned int i = 0; i < numCasesPerTest; ++i) {
pp::AckermannSteeringCtrlParameters parameters;
const double anchorBck = parameters.anchorDistanceBck_ = paramsDist(ppt::rndGenerator);
const double anchorFwd = parameters.anchorDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadFwd = parameters.lookaheadDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadBck = parameters.lookaheadDistanceBck_ = paramsDist(ppt::rndGenerator);
const double wheelBase = parameters.wheelBase_ = paramsDist(ppt::rndGenerator);
pp::AckermannSteeringController controller;
EXPECT_THROW(controller.setParameters(parameters), std::runtime_error);
}
if (::testing::Test::HasFailure()) {
std::cout << "\n Test AckermannSteeringControllerTest, SetParameters1 failed with seed: "
<< seed << std::endl;
}
}
TEST(AckermannSteeringControllerTest, SetParameters2)
{
const int seed = ppt::seedRndGenerator();
std::uniform_real_distribution<double> paramsDist(1.0, 1000.0);
for (unsigned int i = 0; i < numCasesPerTest; ++i) {
pp::AckermannSteeringCtrlParameters parameters;
const double anchorBck = parameters.anchorDistanceBck_ = paramsDist(ppt::rndGenerator);
const double anchorFwd = parameters.anchorDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadFwd = parameters.lookaheadDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadBck = parameters.lookaheadDistanceBck_ = paramsDist(ppt::rndGenerator);
const double wheelBase = parameters.wheelBase_ = paramsDist(ppt::rndGenerator);
pp::AckermannSteeringController controller;
controller.setParameters(parameters);
const auto retrievedParameters = controller.getParameters();
EXPECT_NEAR(retrievedParameters.anchorDistanceBck_, anchorBck, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.anchorDistanceFwd_, anchorFwd, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.lookaheadDistanceFwd_, lookaheadFwd, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.lookaheadDistanceBck_, lookaheadBck, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.wheelBase_, wheelBase, maxParametersAbsError);
}
if (::testing::Test::HasFailure()) {
std::cout << "\n Test AckermannSteeringControllerTest, SetParameters2 failed with seed: "
<< seed << std::endl;
}
}
TEST(AckermannSteeringControllerTest, CreateController)
{
const int seed = ppt::seedRndGenerator();
std::uniform_real_distribution<double> paramsDist(1.0, 1000.0);
for (unsigned int i = 0; i < numCasesPerTest; ++i) {
pp::AckermannSteeringCtrlParameters parameters;
const double anchorBck = parameters.anchorDistanceBck_ = paramsDist(ppt::rndGenerator);
const double anchorFwd = parameters.anchorDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadFwd = parameters.lookaheadDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadBck = parameters.lookaheadDistanceBck_ = paramsDist(ppt::rndGenerator);
const double wheelBase = parameters.wheelBase_ = paramsDist(ppt::rndGenerator);
const auto controller = pp::createAckermannSteeringController(parameters);
const auto retrievedParameters = (static_cast<const pp::AckermannSteeringController*>(controller
.get()))->getParameters();
EXPECT_NEAR(retrievedParameters.anchorDistanceBck_, anchorBck, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.anchorDistanceFwd_, anchorFwd, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.lookaheadDistanceFwd_, lookaheadFwd, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.lookaheadDistanceBck_, lookaheadBck, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.wheelBase_, wheelBase, maxParametersAbsError);
}
if (::testing::Test::HasFailure()) {
std::cout << "\n Test AckermannSteeringControllerTest, CreateController failed with seed: "
<< seed << std::endl;
}
}
TEST(AckermannSteeringControllerTest, CopyController)
{
const int seed = ppt::seedRndGenerator();
std::uniform_real_distribution<double> paramsDist(1.0, 1000.0);
for (unsigned int i = 0; i < numCasesPerTest; ++i) {
pp::AckermannSteeringCtrlParameters parameters;
const double anchorBck = parameters.anchorDistanceBck_ = paramsDist(ppt::rndGenerator);
const double anchorFwd = parameters.anchorDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadFwd = parameters.lookaheadDistanceFwd_ = paramsDist(ppt::rndGenerator);
const double lookaheadBck = parameters.lookaheadDistanceBck_ = paramsDist(ppt::rndGenerator);
const double wheelBase = parameters.wheelBase_ = paramsDist(ppt::rndGenerator);
pp::AckermannSteeringController controller;
controller.setParameters(parameters);
const pp::AckermannSteeringController copiedController = controller;
const auto retrievedParameters = copiedController.getParameters();
EXPECT_NEAR(retrievedParameters.anchorDistanceBck_, anchorBck, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.anchorDistanceFwd_, anchorFwd, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.lookaheadDistanceFwd_, lookaheadFwd, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.lookaheadDistanceBck_, lookaheadBck, maxParametersAbsError);
EXPECT_NEAR(retrievedParameters.wheelBase_, wheelBase, maxParametersAbsError);
}
if (::testing::Test::HasFailure()) {
std::cout << "\n Test AckermannSteeringControllerTest, CopyController failed with seed: "
<< seed << std::endl;
}
}
| 51.259036 | 100 | 0.772006 | Idate96 |
fb988ee99f0bc8a8c7964cdf7e508077564db3f3 | 4,966 | cpp | C++ | src/abstract.cpp | ratanasv/3dlic | a128cd3a9bd86c9bbafa09ff150096163662d041 | [
"Apache-2.0"
] | 1 | 2022-03-02T07:08:40.000Z | 2022-03-02T07:08:40.000Z | src/abstract.cpp | ratanasv/3dlic | a128cd3a9bd86c9bbafa09ff150096163662d041 | [
"Apache-2.0"
] | null | null | null | src/abstract.cpp | ratanasv/3dlic | a128cd3a9bd86c9bbafa09ff150096163662d041 | [
"Apache-2.0"
] | null | null | null | #include "StdAfx.h"
#include "abstract.h"
namespace vir{
Abstract::Abstract( const char* value )
{
set(value);
}
Abstract::Abstract( int value )
{
set(value);
}
Abstract::Abstract( bool value )
{
set(value);
}
Abstract::Abstract( float value )
{
set(value);
}
Abstract::Abstract(const Abstract& value)
{
set(value);
}
Abstract::~Abstract()
{
clear();
}
Abstract::TYPE Abstract::get_type() const
{
return Type;
}
std::shared_ptr<char> Abstract::get_string() const
{
switch (Type) {
case VALUE_TYPE_STRING:{
int length = strlen((char*)Blob)+1;
char* s = new char[length];
strcpy(s, (char*)Blob);
return std::shared_ptr<char>(s, del<char>);
}
case VALUE_TYPE_INT:{
std::stringstream ss;//create a stringstream
ss << *((int*)Blob);//add number to the stream
const char* cstr = ss.str().c_str();
int length = strlen(cstr)+1;
char* s = new char[length];
strcpy(s, cstr);
return std::shared_ptr<char>(s, del<char>);
}
case VALUE_TYPE_FLOAT:{
std::stringstream ss;//create a stringstream
ss << *((float*)Blob);//add number to the stream
const char* cstr = ss.str().c_str();
int length = strlen(cstr)+1;
char* s = new char[length];
strcpy(s, cstr);
return std::shared_ptr<char>(s, del<char>);
}
case VALUE_TYPE_BOOL:{
char t[] = "true";
char f[] = "false";
if(get_bool()){
int length = strlen(t)+1;
char* s = new char[length];
strcpy(s, (char*)t);
return std::shared_ptr<char>(s, del<char>);
}
else{
int length = strlen(f)+1;
char* s = new char[length];
strcpy(s, (char*)f);
return std::shared_ptr<char>(s, del<char>);
}
}
default:{
char* s = new char[1];
s[0] = '\0';
return std::shared_ptr<char>(s, del<char>);
}
}
}
int Abstract::get_int() const
{
switch (Type) {
case VALUE_TYPE_STRING:
return atoi((char*)Blob);
case VALUE_TYPE_INT:
return *((int*)Blob);
case VALUE_TYPE_BOOL:
return get_bool() ? 1 : 0;
case VALUE_TYPE_FLOAT:
return (int) get_float();
default:
return -1;
}
}
bool Abstract::get_bool() const
{
switch (Type) {
case VALUE_TYPE_STRING:
return strlen((char*)Blob)>0;
case VALUE_TYPE_INT:
case VALUE_TYPE_FLOAT:
return (get_int() != 0);
case VALUE_TYPE_BOOL:
return *((bool*) Blob);
default:
return false;
}
}
float Abstract::get_float() const
{
switch(Type) {
case VALUE_TYPE_STRING:
return atof((char*)Blob);
case VALUE_TYPE_INT:
return (float) get_int();
case VALUE_TYPE_BOOL:
return get_bool() ? 1.0 : 0.0;
case VALUE_TYPE_FLOAT:
return *((float*)Blob);
default:
return -1.0;
}
}
void Abstract::set( const char* value )
{
clear();
int length = strlen(value)+1;
Blob = new char[length];
strcpy((char*)Blob, value);
Type = VALUE_TYPE_STRING;
}
void Abstract::set( int value )
{
clear();
Blob = new int;
*((int*)Blob) = value;
Type = VALUE_TYPE_INT;
}
void Abstract::set( bool value )
{
clear();
Blob = new bool;
*((bool*)Blob) = value;
Type = VALUE_TYPE_BOOL;
}
void Abstract::set( float value )
{
clear();
Blob = new float;
*((float*)Blob) = value;
Type = VALUE_TYPE_FLOAT;
}
void Abstract::set( const Abstract& value )
{
clear();
switch(value.get_type()) {
case VALUE_TYPE_STRING:
set(value.get_string().get());
break;
case VALUE_TYPE_INT:
set(value.get_int());
break;
case VALUE_TYPE_BOOL:
set(value.get_bool());
break;
case VALUE_TYPE_FLOAT:
set(value.get_float());
break;
}
}
void Abstract::clear()
{
switch(get_type()){
case Abstract::VALUE_TYPE_STRING:
delete[] (char*)Blob;
break;
case Abstract::VALUE_TYPE_INT:
delete (int*)Blob;
break;
case Abstract::VALUE_TYPE_BOOL:
delete (bool*)Blob;
break;
case Abstract::VALUE_TYPE_FLOAT:
delete (float*)Blob;
break;
}
Blob = NULL;
Type = VALUE_TYPE_NONE;
}
bool Abstract::operator==( const Abstract& other ) const
{
switch(Type) {
case VALUE_TYPE_NONE:
if (other.get_type() == VALUE_TYPE_NONE) {
return true;
}
else {
return false;
}
case VALUE_TYPE_STRING:
if(strcmp(get_string().get(), other.get_string().get()) == 0)
return true;
else
false;
case VALUE_TYPE_INT:
return get_int() == other.get_int();
case VALUE_TYPE_FLOAT:
return get_float() == other.get_float();
break;
default:
return false;
break;
}
}
bool Abstract::operator>( const Abstract& other ) const
{
switch(Type) {
case VALUE_TYPE_NONE:
return false;
case VALUE_TYPE_STRING:
if(strcmp(get_string().get(), other.get_string().get()) > 0)
return true;
else
case VALUE_TYPE_INT:
return get_int() > other.get_int();
case VALUE_TYPE_FLOAT:
return get_float() > other.get_float();
case VALUE_TYPE_BOOL:
return get_int() > other.get_int();
default:
return false;
}
}
} | 18.190476 | 64 | 0.621426 | ratanasv |
fb9b5e95c1de897cc58baef6968393d0ab11ee6a | 1,023 | cpp | C++ | src/Private/AnimSceneActions/FinishAllActiveActionsAction.cpp | heltena/KYEngine | 4ccb89d0b20683feb245ffe85dd34b6ffdc42c8e | [
"MIT"
] | null | null | null | src/Private/AnimSceneActions/FinishAllActiveActionsAction.cpp | heltena/KYEngine | 4ccb89d0b20683feb245ffe85dd34b6ffdc42c8e | [
"MIT"
] | null | null | null | src/Private/AnimSceneActions/FinishAllActiveActionsAction.cpp | heltena/KYEngine | 4ccb89d0b20683feb245ffe85dd34b6ffdc42c8e | [
"MIT"
] | null | null | null | #include <KYEngine/SceneTimelineInfo.h>
#include <KYEngine/Private/AnimSceneActions/FinishAllActiveActionsAction.h>
#include <KYEngine/Utility/TiXmlHelper.h>
const std::string FinishAllActiveActionsAction::XML_NODE = "finish-all-active-actions";
FinishAllActiveActionsAction::FinishAllActiveActionsAction()
{
}
FinishAllActiveActionsAction::~FinishAllActiveActionsAction()
{
}
FinishAllActiveActionsAction* FinishAllActiveActionsAction::readFromXml(TiXmlElement* node)
{
FinishAllActiveActionsAction* action = new FinishAllActiveActionsAction();
const std::string name = TiXmlHelper::readString(node, "name", false, "<<undefined>>");
action->setName(name);
return action;
}
void FinishAllActiveActionsAction::start(SceneTimelineInfo* info)
{
info->finishAllActiveActions();
}
bool FinishAllActiveActionsAction::isBlocking()
{
return true;
}
bool FinishAllActiveActionsAction::isFinished()
{
return true;
}
void FinishAllActiveActionsAction::update(const double elapsedTime, SceneTimelineInfo* info)
{
}
| 23.25 | 92 | 0.806452 | heltena |
fba17bf96053739438a7f7230ecb7bb93ba4f301 | 1,089 | hh | C++ | src/comm/detail/MpiTypes.nompi.i.hh | amandalund/celeritas | c631594b00c040d5eb4418fa2129f88c01e29316 | [
"Apache-2.0",
"MIT"
] | 22 | 2020-03-31T14:18:22.000Z | 2022-01-10T09:43:06.000Z | src/comm/detail/MpiTypes.nompi.i.hh | amandalund/celeritas | c631594b00c040d5eb4418fa2129f88c01e29316 | [
"Apache-2.0",
"MIT"
] | 261 | 2020-04-29T15:14:29.000Z | 2022-03-31T19:07:14.000Z | src/comm/detail/MpiTypes.nompi.i.hh | amandalund/celeritas | c631594b00c040d5eb4418fa2129f88c01e29316 | [
"Apache-2.0",
"MIT"
] | 15 | 2020-05-01T19:47:19.000Z | 2021-12-25T06:12:09.000Z | //----------------------------------*-C++-*----------------------------------//
// Copyright 2020 UT-Battelle, LLC, and other Celeritas developers.
// See the top-level COPYRIGHT file for details.
// SPDX-License-Identifier: (Apache-2.0 OR MIT)
//---------------------------------------------------------------------------//
//! \file MpiTypes.nompi.i.hh
//---------------------------------------------------------------------------//
#pragma once
namespace celeritas
{
namespace detail
{
//---------------------------------------------------------------------------//
struct MpiComm
{
int value_;
};
constexpr inline bool operator==(MpiComm a, MpiComm b)
{
return a.value_ == b.value_;
}
constexpr inline bool operator!=(MpiComm a, MpiComm b)
{
return !(a == b);
}
constexpr inline MpiComm MpiCommNull()
{
return {0};
}
constexpr inline MpiComm MpiCommSelf()
{
return {-1};
}
constexpr inline MpiComm MpiCommWorld()
{
return {1};
}
//---------------------------------------------------------------------------//
} // namespace detail
} // namespace celeritas
| 23.673913 | 79 | 0.438935 | amandalund |
fba9ae34526cb9466c6a46ac28f3cdca5e98de01 | 252 | cpp | C++ | libs/device/src/Device.cpp | romz-pl/romz-btree | 8f0634fa68c9c3245e53c81d100c1cf7a0bcac41 | [
"Apache-2.0"
] | null | null | null | libs/device/src/Device.cpp | romz-pl/romz-btree | 8f0634fa68c9c3245e53c81d100c1cf7a0bcac41 | [
"Apache-2.0"
] | null | null | null | libs/device/src/Device.cpp | romz-pl/romz-btree | 8f0634fa68c9c3245e53c81d100c1cf7a0bcac41 | [
"Apache-2.0"
] | null | null | null | #include <romz/device/Device.h>
namespace romz {
Device::Device(const EnvConfig &config_)
: config(config_) {
}
// virtual destructor
Device::~Device() = default;
std::size_t Device::page_size() const {
return config.page_size_bytes;
}
}
| 14 | 40 | 0.694444 | romz-pl |
fbab1bec86fffc22aced2ad44ee2e26785b26863 | 1,294 | cpp | C++ | c++/codeforces/A.cpp | 08pixels/juizes-online | 7202eeaed6886e8ff33fc2031c213348043d5909 | [
"Apache-2.0"
] | 1 | 2020-06-23T06:23:03.000Z | 2020-06-23T06:23:03.000Z | c++/codeforces/A.cpp | 08pixels/juizes-online | 7202eeaed6886e8ff33fc2031c213348043d5909 | [
"Apache-2.0"
] | null | null | null | c++/codeforces/A.cpp | 08pixels/juizes-online | 7202eeaed6886e8ff33fc2031c213348043d5909 | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
#define MAX 2100000
using namespace std;
typedef struct {
int x,y,z;
}node;
char str[1000006];
int o[MAX], c[MAX], v[MAX];
void build(int ind, int i, int j)
{
if(j == i) {
if(str[i] == '(')
o[ind] = 1;
else
c[ind] = 1;
} else {
int mid = (i+j) >> 1;
build(2 * ind, i, mid);
build(2 * ind + 1, mid + 1, j);
int current = min(o[2 * ind], c[2 * ind + 1]);
v[ind] = v[2 * ind] + v[2 * ind + 1] + current;
o[ind] = o[2 * ind] + o[2 * ind + 1] - current;
c[ind] = c[2 * ind] + c[2 * ind + 1] - current;
}
}
node query(int ind, int i, int j, int q0, int qf)
{
if(j < q0 || i > qf) {
node s;
s.x = s.y = s.z = 0;
return s;
}
if(i >= q0 && j <= qf) {
node s;
s.x = v[ind];
s.y = o[ind];
s.z = c[ind];
return s;
}
int mid = (i+j) >> 1;
node l = query(2 * ind, i, mid, q0, qf);
node r = query(2 * ind + 1, mid + 1, j, q0, qf);
int current = min(l.y, r.z);
node answer;
answer.x = l.x + r.x + current;
answer.y = l.y + r.y - current;
answer.z = l.z + r.z - current;
return answer;
}
int main()
{
int Q, q0,qf;
scanf("%s %d", str, &Q);
int size = strlen(str) - 1;
build(1, 0, size);
while(Q--) {
scanf("%d %d", &q0, &qf);
printf("%d\n", query(1, 0, size, q0-1, qf-1).x * 2);
}
return 0;
} | 16.589744 | 54 | 0.486862 | 08pixels |
fbb1757c90e442b4c0583a48b85e0d7736d0298c | 9,888 | cpp | C++ | src/core/contract/ServerContract.cpp | da2ce7/opentxs | 03a61c7a65b1dc27ffaa13da1adc053d67ec0ab0 | [
"MIT"
] | null | null | null | src/core/contract/ServerContract.cpp | da2ce7/opentxs | 03a61c7a65b1dc27ffaa13da1adc053d67ec0ab0 | [
"MIT"
] | null | null | null | src/core/contract/ServerContract.cpp | da2ce7/opentxs | 03a61c7a65b1dc27ffaa13da1adc053d67ec0ab0 | [
"MIT"
] | null | null | null | /************************************************************
*
* OPEN TRANSACTIONS
*
* Financial Cryptography and Digital Cash
* Library, Protocol, API, Server, CLI, GUI
*
* -- Anonymous Numbered Accounts.
* -- Untraceable Digital Cash.
* -- Triple-Signed Receipts.
* -- Cheques, Vouchers, Transfers, Inboxes.
* -- Basket Currencies, Markets, Payment Plans.
* -- Signed, XML, Ricardian-style Contracts.
* -- Scripted smart contracts.
*
* EMAIL:
* fellowtraveler@opentransactions.org
*
* WEBSITE:
* http://www.opentransactions.org/
*
* -----------------------------------------------------
*
* LICENSE:
* This Source Code Form is subject to the terms of the
* Mozilla Public License, v. 2.0. If a copy of the MPL
* was not distributed with this file, You can obtain one
* at http://mozilla.org/MPL/2.0/.
*
* DISCLAIMER:
* 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 Mozilla Public License
* for more details.
*
************************************************************/
#include "opentxs/core/contract/ServerContract.hpp"
#include "opentxs/core/Identifier.hpp"
#include "opentxs/core/Log.hpp"
#include "opentxs/core/Nym.hpp"
#include "opentxs/core/OTData.hpp"
#include "opentxs/core/Proto.hpp"
#include "opentxs/core/String.hpp"
#include "opentxs/core/app/Wallet.hpp"
#include "opentxs/core/contract/Signable.hpp"
#include "opentxs/core/util/Assert.hpp"
#include <stdint.h>
#include <zcert.h>
#include <list>
#include <memory>
#include <string>
#include <tuple>
namespace opentxs
{
ServerContract::ServerContract(const ConstNym& nym)
: ot_super(nym)
{
}
ServerContract::ServerContract(
const ConstNym& nym,
const proto::ServerContract& serialized)
: ServerContract(nym)
{
id_ = Identifier(serialized.id());
signatures_.push_front(
SerializedSignature(
std::make_shared<proto::Signature>(serialized.signature())));
version_ = serialized.version();
conditions_ = serialized.terms();
for (auto& listen : serialized.address()) {
ServerContract::Endpoint endpoint{listen.type(),
listen.protocol(),
listen.host(),
listen.port(),
listen.version()};
// WARNING: preserve the order of this list, or signature verfication
// will fail!
listen_params_.push_back(endpoint);
}
name_ = serialized.name();
transport_key_.Assign(
serialized.transportkey().c_str(), serialized.transportkey().size());
}
ServerContract* ServerContract::Create(
const ConstNym& nym,
const std::list<ServerContract::Endpoint>& endpoints,
const std::string& terms,
const std::string& name)
{
OT_ASSERT(nullptr != nym);
OT_ASSERT(nym->hasCapability(NymCapability::AUTHENTICATE_CONNECTION));
ServerContract* contract = new ServerContract(nym);
if (nullptr != contract) {
contract->version_ = 1;
contract->listen_params_ = endpoints;
contract->conditions_ = terms;
// TODO:: find the right defined constant. 32 is the correct size
// according to https://github.com/zeromq/czmq
contract->transport_key_.Assign(
zcert_public_key(contract->PrivateTransportKey()), 32);
contract->name_ = name;
if (!contract->CalculateID()) {
return nullptr;
}
if (contract->nym_) {
contract->UpdateSignature();
}
if (!contract->Validate()) {
return nullptr;
}
contract->alias_ = contract->name_;
} else {
otErr << __FUNCTION__ << ": Failed to create server contract."
<< std::endl;
}
return contract;
}
ServerContract* ServerContract::Factory(
const ConstNym& nym,
const proto::ServerContract& serialized)
{
if (!proto::Check<proto::ServerContract>(serialized, 0, 0xFFFFFFFF)) {
return nullptr;
}
std::unique_ptr<ServerContract> contract(
new ServerContract(nym, serialized));
if (!contract) {
return nullptr;
}
if (!contract->Validate()) {
return nullptr;
}
contract->alias_ = contract->name_;
return contract.release();
}
Identifier ServerContract::GetID() const
{
auto contract = IDVersion();
Identifier id;
id.CalculateDigest(proto::ProtoAsData<proto::ServerContract>(contract));
return id;
}
bool ServerContract::ConnectInfo(
std::string& strHostname,
uint32_t& nPort,
const proto::AddressType& preferred) const
{
if (0 < listen_params_.size()) {
for (auto& endpoint : listen_params_) {
const auto& type = std::get<0>(endpoint);
const auto& url = std::get<2>(endpoint);
const auto& port = std::get<3>(endpoint);
if (preferred == type) {
strHostname = url;
nPort = port;
return true;
}
}
// If we didn't find the preferred type, return the first result
const auto& endpoint = listen_params_.front();
const auto& url = std::get<2>(endpoint);
const auto& port = std::get<3>(endpoint);
strHostname = url;
nPort = port;
return true;
}
return false;
}
proto::ServerContract ServerContract::IDVersion() const
{
proto::ServerContract contract;
contract.set_version(version_);
contract.clear_id(); // reinforcing that this field must be blank.
contract.clear_signature(); // reinforcing that this field must be blank.
contract.clear_publicnym(); // reinforcing that this field must be blank.
if (nullptr != nym_) {
String nymID;
nym_->GetIdentifier(nymID);
contract.set_nymid(nymID.Get());
}
contract.set_name(name_);
for (const auto& endpoint : listen_params_) {
auto& addr = *contract.add_address();
const auto& version = std::get<4>(endpoint);
const auto& type = std::get<0>(endpoint);
const auto& protocol = std::get<1>(endpoint);
const auto& url = std::get<2>(endpoint);
const auto& port = std::get<3>(endpoint);
addr.set_version(version);
addr.set_type(type);
addr.set_protocol(protocol);
addr.set_host(url);
addr.set_port(port);
}
contract.set_terms(conditions_);
contract.set_transportkey(
transport_key_.GetPointer(), transport_key_.GetSize());
return contract;
}
proto::ServerContract ServerContract::SigVersion() const
{
auto contract = IDVersion();
contract.set_id(String(ID()).Get());
return contract;
}
const proto::ServerContract ServerContract::Contract() const
{
auto contract = SigVersion();
*(contract.mutable_signature()) = *(signatures_.front());
return contract;
}
const proto::ServerContract ServerContract::PublicContract() const
{
auto contract = Contract();
if (nym_) {
auto publicNym = nym_->asPublicNym();
*(contract.mutable_publicnym()) = publicNym;
}
return contract;
}
bool ServerContract::Statistics(String& strContents) const
{
const String strID(id_);
strContents.Concatenate(
" Notary Provider: %s\n"
" NotaryID: %s\n"
"\n",
nym_->Alias().c_str(),
strID.Get());
return true;
}
const unsigned char* ServerContract::PublicTransportKey() const
{
return static_cast<const unsigned char*>(transport_key_.GetPointer());
}
zcert_t* ServerContract::PrivateTransportKey() const
{
OT_ASSERT(nym_);
return nym_->TransportKey();
}
OTData ServerContract::Serialize() const
{
return proto::ProtoAsData<proto::ServerContract>(Contract());
}
bool ServerContract::UpdateSignature()
{
if (!ot_super::UpdateSignature()) { return false; }
bool success = false;
signatures_.clear();
auto serialized = SigVersion();
auto& signature = *serialized.mutable_signature();
signature.set_role(proto::SIGROLE_SERVERCONTRACT);
success = nym_->SignProto(serialized, signature);
if (success) {
signatures_.emplace_front(new proto::Signature(signature));
} else {
otErr << __FUNCTION__ << ": failed to create signature."
<< std::endl;
}
return success;
}
bool ServerContract::Validate() const
{
bool validNym = false;
if (nym_) {
validNym = nym_->VerifyPseudonym();
}
if (!validNym) {
otErr << __FUNCTION__ << ": Invalid nym." << std::endl;
return false;
}
auto contract = Contract();
bool validSyntax =
proto::Check<proto::ServerContract>(contract, 0, 0xFFFFFFFF);
if (!validSyntax) {
otErr << __FUNCTION__ << ": Invalid syntax." << std::endl;
return false;
}
if (1 > signatures_.size()) {
otErr << __FUNCTION__ << ": Missing signature." << std::endl;
return false;
}
bool validSig = false;
auto& signature = *signatures_.cbegin();
if (signature) {
validSig = VerifySignature(*signature);
}
if (!validSig) {
otErr << __FUNCTION__ << ": Invalid signature." << std::endl;
return false;
}
return true;
}
bool ServerContract::VerifySignature(const proto::Signature& signature) const
{
if (!ot_super::VerifySignature(signature)) { return false; }
auto serialized = SigVersion();
auto& sigProto = *serialized.mutable_signature();
sigProto.CopyFrom(signature);
return nym_->VerifyProto(serialized, sigProto);;
}
} // namespace opentxs
| 26.15873 | 78 | 0.611954 | da2ce7 |
fbb34e5525b20460997535b04f32c00bfa6b8604 | 482 | cpp | C++ | src/detail/Library.cpp | GPMueller/mwe-cpp-exception | 79836bf9a5d895f92051a8ce9d4f484bff600b35 | [
"MIT"
] | 21 | 2017-10-25T20:41:14.000Z | 2022-01-20T10:11:43.000Z | src/detail/Library.cpp | GPMueller/mwe-cpp-exception | 79836bf9a5d895f92051a8ce9d4f484bff600b35 | [
"MIT"
] | 1 | 2018-09-18T07:44:16.000Z | 2019-12-12T12:30:32.000Z | src/detail/Library.cpp | GPMueller/mwe-cpp-exception | 79836bf9a5d895f92051a8ce9d4f484bff600b35 | [
"MIT"
] | 3 | 2021-06-24T06:26:22.000Z | 2021-11-09T20:43:46.000Z | #include <detail/Library.hpp>
#include <detail/Exception.hpp>
namespace mylib
{
namespace detail
{
void library_function()
try
{
// some erronous code which throws an exception...
// let's pretend we weren't able to open a file
std::string filename = "nonexistent.txt";
library_throw("could not open file \"" + filename + "\"");
}
catch( const std::exception & )
{
library_rethrow("library_function failed")
}
}
} | 22.952381 | 66 | 0.620332 | GPMueller |
fbb50a8abf7d69dcdbd162df357ec8d74dad387c | 1,022 | hpp | C++ | xenium/backoff.hpp | dpayne/xenium | 5336adf2089c3d263bf7e36cfc4fc2e11ee1ad7c | [
"MIT"
] | 1 | 2021-01-03T07:18:27.000Z | 2021-01-03T07:18:27.000Z | xenium/backoff.hpp | dpayne/xenium | 5336adf2089c3d263bf7e36cfc4fc2e11ee1ad7c | [
"MIT"
] | null | null | null | xenium/backoff.hpp | dpayne/xenium | 5336adf2089c3d263bf7e36cfc4fc2e11ee1ad7c | [
"MIT"
] | null | null | null | //
// Copyright (c) 2018-2020 Manuel Pöter.
// Licensed under the MIT License. See LICENSE file in the project root for full license information.
//
#ifndef XENIUM_BACKOFF_HPP
#define XENIUM_BACKOFF_HPP
#include <xenium/detail/port.hpp>
#include <algorithm>
#ifdef XENIUM_ARCH_X86
#include <emmintrin.h>
#else
#include <thread>
#endif
namespace xenium {
/**
* @brief Dummy backoff strategy that does nothing.
*/
struct no_backoff
{
void operator()() {}
};
template <unsigned Max>
struct exponential_backoff {
static_assert(Max > 0, "Max must be greater than zero. If you don't want to backoff use the `no_backoff` class.");
void operator()() {
for (unsigned i = 0; i < count; ++i)
do_backoff();
count = std::min(Max, count * 2);
}
private:
void do_backoff() {
#ifdef XENIUM_ARCH_X86
_mm_pause();
#else
#warning "No backoff implementation available."
std::this_thread::yield();
#endif
}
unsigned count = 1;
};
}
#endif
| 19.283019 | 117 | 0.65362 | dpayne |
fbb638a66cc7ea936d6e89f652f4c8efdeff523a | 10,978 | cpp | C++ | soundgen/irrKlang/mxsoundgenirrklang.cpp | arturocepeda/Modus | 849c9ada0e8bf7803db6e1b5c6098ab5898bc430 | [
"MIT"
] | 2 | 2015-04-08T21:03:09.000Z | 2016-03-20T17:46:31.000Z | soundgen/irrKlang/mxsoundgenirrklang.cpp | arturocepeda/Modus | 849c9ada0e8bf7803db6e1b5c6098ab5898bc430 | [
"MIT"
] | null | null | null | soundgen/irrKlang/mxsoundgenirrklang.cpp | arturocepeda/Modus | 849c9ada0e8bf7803db6e1b5c6098ab5898bc430 | [
"MIT"
] | 2 | 2015-08-18T08:59:07.000Z | 2021-04-02T23:03:48.000Z |
////////////////////////////////////////////////////////////////////////
//
// Modus
// C++ Music Library
// [Sound Generator]
//
// Copyright (c) 2012-2015 Arturo Cepeda
//
// --------------------------------------------------------------------
//
// Audio engine:
//
// irrKlang
// Copyright (c) Nikolaus Gebhardt / Ambiera 2001-2009
//
// --------------------------------------------------------------------
//
// This file is part of Modus. Permission is hereby granted, free
// of charge, to any person obtaining a copy of this software and
// associated documentation files (the "Software"), to deal in the
// Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute,
// sublicense, and/or sell copies of the Software, and to permit
// persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
// KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
// WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS
// OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
// OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
// SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
////////////////////////////////////////////////////////////////////////
#include "mxsoundgenirrklang.h"
#include <fstream>
#include <cmath>
#include "mutils.h"
using namespace Modus;
//
// Audio source manager
//
MCirrKlangSourceManager::MCirrKlangSourceManager(irrklang::ISoundEngine* AudioSystem, unsigned int NumSources)
: MCAudioSourceManager(NumSources)
, ikEngine(AudioSystem)
{
}
void MCirrKlangSourceManager::allocateSources()
{
}
void MCirrKlangSourceManager::releaseSources()
{
for(unsigned int i = 0; i < iNumSources; i++)
{
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[i].Source);
if(ikSound)
ikSound->drop();
}
}
void MCirrKlangSourceManager::playSource(unsigned int SourceIndex, void* Sound, bool Sound3D)
{
irrklang::ISoundSource* ikBuffer = reinterpret_cast<irrklang::ISoundSource*>(Sound);
irrklang::ISound* ikSound = 0;
if(Sound3D)
{
irrklang::vec3df ikPosition3D(sSources[SourceIndex].Position[0],
sSources[SourceIndex].Position[1], sSources[SourceIndex].Position[2]);
sSources[SourceIndex].Source = ikEngine->play3D(ikBuffer, ikPosition3D, false, true);
ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
ikSound->setPosition(ikPosition3D);
}
else
{
sSources[SourceIndex].Source = ikEngine->play2D(ikBuffer, false, true);
ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
ikSound->setPan(sSources[SourceIndex].Position[0]);
}
ikSound->setVolume(sSources[SourceIndex].Volume);
ikSound->setIsPaused(false);
}
void MCirrKlangSourceManager::stopSource(unsigned int SourceIndex)
{
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
ikSound->stop();
}
bool MCirrKlangSourceManager::isSourcePlaying(unsigned int SourceIndex)
{
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
return ikSound && !ikSound->isFinished();
}
void MCirrKlangSourceManager::setSourceVolume(unsigned int SourceIndex, float Volume)
{
sSources[SourceIndex].Volume = Volume;
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
if(ikSound && !ikSound->isFinished())
ikSound->setVolume(Volume);
}
void MCirrKlangSourceManager::setSourcePitch(unsigned int SourceIndex, int Cents)
{
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
if(ikSound && !ikSound->isFinished())
ikSound->setPlaybackSpeed((float)pow(2, Cents / 1200.0f));
}
void MCirrKlangSourceManager::setSourcePan(unsigned int SourceIndex, float Pan)
{
sSources[SourceIndex].Position[0] = Pan;
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
if(ikSound && !ikSound->isFinished())
ikSound->setPan(sSources[SourceIndex].Position[0]);
}
void MCirrKlangSourceManager::setSourcePosition(unsigned int SourceIndex, float X, float Y, float Z)
{
sSources[SourceIndex].Position[0] = X;
sSources[SourceIndex].Position[1] = Y;
sSources[SourceIndex].Position[2] = Z;
irrklang::ISound* ikSound = reinterpret_cast<irrklang::ISound*>(sSources[SourceIndex].Source);
if(ikSound && !ikSound->isFinished())
{
irrklang::vec3df ikPosition3D(sSources[SourceIndex].Position[0],
sSources[SourceIndex].Position[1], sSources[SourceIndex].Position[2]);
ikSound->setPosition(ikPosition3D);
}
}
void MCirrKlangSourceManager::setSourceDirection(unsigned int SourceIndex, float X, float Y, float Z)
{
}
//
// Sound generator
//
unsigned int MCSoundGenirrKlang::iNumberOfInstances = 0;
MCSoundGenirrKlang::MCSoundGenirrKlang(unsigned int ID, unsigned int NumberOfChannels, bool Sound3D, irrklang::ISoundEngine* Engine)
: MCSoundGenAudioMultipleChannel(ID, NumberOfChannels, Sound3D)
, iEngine(Engine)
{
if(!cManager)
{
cManager = new MCirrKlangSourceManager(Engine, IRRKLANG_SOURCES);
cManager->allocateSources();
}
iNumberOfInstances++;
iSound = NULL;
iSampleSet = new int[iNumberOfChannels];
for(unsigned int i = 0; i < iNumberOfChannels; i++)
iSampleSet[i] = -1;
}
MCSoundGenirrKlang::~MCSoundGenirrKlang()
{
unloadSamples();
iNumberOfInstances--;
if(iNumberOfInstances == 0)
{
cManager->releaseSources();
delete cManager;
cManager = NULL;
}
}
void MCSoundGenirrKlang::loadSamples()
{
if(sSampleSet.size() == 0)
return;
char sFilename[512];
unsigned int i, j;
iSound = new irrklang::ISoundSource**[sSampleSet.size()];
for(i = 0; i < sSampleSet.size(); i++)
{
iSound[i] = new irrklang::ISoundSource*[iNumberOfSamples[i]];
for(j = 0; j < iNumberOfSamples[i]; j++)
{
sprintf(sFilename, "%s%02d_%03d.%s", sSampleSet[i].Path,
sSampleSet[i].ID,
j + sSampleSet[i].Range.LowestNote,
sSampleSet[i].Format);
iSound[i][j] = iEngine->addSoundSourceFromFile(sFilename);
}
}
}
void MCSoundGenirrKlang::loadSamplePack(std::istream& Stream,
void (*callback)(unsigned int TotalSamples, unsigned int Loaded, void* Data),
void* Data)
{
unsigned int iTotalSamples = 0;
unsigned int iLoaded = 0;
// read total number of samples
if(callback)
{
Stream.seekg(-(std::ios::off_type)sizeof(unsigned int), std::ios::end);
Stream.read((char*)&iTotalSamples, sizeof(unsigned int));
Stream.seekg(0, std::ios::beg);
}
char sVersion[16];
char sFormat[8];
char sReserved[4];
unsigned int iInput;
unsigned int iNumSampleSets;
Stream.read(sVersion, 16); // Version
Stream.read(sFormat, 8); // Format
Stream.read((char*)&iNumSampleSets, sizeof(unsigned int)); // Number of sample sets
Stream.read(sReserved, 4); // (Reserved)
unsigned int i;
unsigned int j;
// release previously loaded samples
unloadSamples();
// clear sampleset list
if(sSampleSet.size() > 0)
{
sSampleSet.clear();
iNumberOfSamples.clear();
}
// load samplesets and samples
MSSampleSet mSampleSet;
unsigned int iNumSamples;
char sSoundName[64];
iSound = new irrklang::ISoundSource**[iNumSampleSets];
for(i = 0; i < iNumSampleSets; i++)
{
// sample set
strcpy(mSampleSet.Path, "");
strcpy(mSampleSet.Format, sFormat);
Stream.read((char*)&iInput, sizeof(unsigned int)); // SampleSet: ID
mSampleSet.ID = (unsigned char)iInput;
Stream.read((char*)&iInput, sizeof(unsigned int)); // SampleSet: Mode
mSampleSet.Mode = (unsigned char)iInput;
Stream.read((char*)&iInput, sizeof(unsigned int)); // SampleSet: Minimum intensity
mSampleSet.MinimumIntensity = (unsigned char)iInput;
Stream.read((char*)&iInput, sizeof(unsigned int)); // SampleSet: Maximum intensity
mSampleSet.MaximumIntensity = (unsigned char)iInput;
Stream.read((char*)&iInput, sizeof(unsigned int)); // SampleSet: Lowest pitch
mSampleSet.Range.LowestNote = (unsigned char)iInput;
Stream.read((char*)&iInput, sizeof(unsigned int)); // SampleSet: Highest pitch
mSampleSet.Range.HighestNote = (unsigned char)iInput;
sSampleSet.push_back(mSampleSet);
// samples inside the sample set
Stream.read((char*)&iNumSamples, sizeof(unsigned int)); // SampleSet: Number of samples
iNumberOfSamples.push_back((unsigned char)iNumSamples);
Stream.read(sReserved, 4); // SampleSet: (Reserved)
iSound[i] = new irrklang::ISoundSource*[iNumSamples];
unsigned int iSampleSize;
char* sSampleData;
for(j = 0; j < iNumSamples; j++)
{
Stream.read((char*)&iSampleSize, sizeof(unsigned int));
iSound[i][j] = NULL;
if(iSampleSize == 0)
continue;
sSampleData = new char[iSampleSize];
Stream.read(sSampleData, iSampleSize);
sprintf(sSoundName, "%02d%02d", i, j);
iSound[i][j] = iEngine->addSoundSourceFromMemory(sSampleData, iSampleSize, sSoundName);
// callback
if(callback)
callback(iTotalSamples, ++iLoaded, Data);
delete[] sSampleData;
}
}
}
void MCSoundGenirrKlang::unloadSamples()
{
if(!iSound)
return;
unsigned int i;
unsigned int j;
for(i = 0; i < sSampleSet.size(); i++)
{
for(j = 0; j < iNumberOfSamples[i]; j++)
iEngine->removeSoundSource(iSound[i][j]);
delete[] iSound[i];
}
sSampleSet.clear();
iNumberOfSamples.clear();
delete[] iSound;
iSound = NULL;
}
void MCSoundGenirrKlang::playAudioSample(unsigned int SourceIndex, int SampleSet, int SampleIndex)
{
cManager->playSource(SourceIndex, iSound[SampleSet][SampleIndex], b3DSound);
}
| 30.7507 | 132 | 0.633995 | arturocepeda |
fbb6ec98cf6d9adafeeb5cc5096420cb38576ea0 | 35,730 | cpp | C++ | src/Loader.cpp | vadosnaprimer/desktop-m3g | fa04787e8609cd0f4e63defc7f2c669c8cc78d1f | [
"MIT"
] | 2 | 2019-05-14T08:14:15.000Z | 2021-01-19T13:28:38.000Z | src/Loader.cpp | vadosnaprimer/desktop-m3g | fa04787e8609cd0f4e63defc7f2c669c8cc78d1f | [
"MIT"
] | null | null | null | src/Loader.cpp | vadosnaprimer/desktop-m3g | fa04787e8609cd0f4e63defc7f2c669c8cc78d1f | [
"MIT"
] | null | null | null | #include "m3g/m3g.hpp"
#include "m3g/stb_image_reader.hpp"
#include "m3g/Config.hpp"
#include "m3g/M3GReader.hpp"
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
using namespace m3g;
// M3G(JSR184) identifier
const unsigned char m3g_sig[12] = {0xab,0x4a,0x53,0x52,0x31,0x38,0x34,0xbb,0x0d,0x0a,0x1a,0x0a};
Loader:: Loader () : reader(NULL)
{
}
Loader:: ~Loader ()
{
delete reader;
}
std::vector<Object3D*> Loader:: load (int length, const char* p, int offset)
{
if (p == NULL) {
throw NullPointerException (__FILE__, __func__, "Pointer is Null.");
}
if (length <= 0) {
throw IllegalArgumentException (__FILE__, __func__, "Length is invalid, len=%d.", length);
}
if (offset < 0 || offset >= length) {
throw IllegalArgumentException (__FILE__, __func__, "Offset is invalid, offset=%d, len=%d.", offset, length);
}
p += offset;
length -= offset;
Loader* loader = new Loader;
vector<Object3D*> objs;
if (memcmp (p, m3g_sig, sizeof(m3g_sig)) == 0) {
objs = loader->load_m3g (p, length);
} else {
objs = loader->load_image (p, length);
}
delete loader;
return objs;
}
std::vector<Object3D*> Loader:: load (const char* file_name)
{
if (!file_name) {
throw NullPointerException (__FILE__, __func__, "File name is Null.");
}
ifstream ifs (file_name);
if (!ifs) {
throw IOException (__FILE__, __func__, "Can't open the file, name=%s.", file_name);
}
ifs.seekg (0, std::ios::end);
int size = ifs.tellg ();
ifs.seekg (0, std::ios::beg);
char* buf = new char[size];
ifs.read (buf, size);
vector<Object3D*> objs = load (size, buf, 0);
delete [] buf;
return objs;
}
std::vector<Object3D*> Loader:: load_m3g (const char* p, int size)
{
// object indexは1から始まるので
objs.push_back (0);
int object_type;
unsigned int object_index;
reader = new M3GReader (p, size);
// M3G-ID
reader->readID ();
// Section 1 has Header object only.
reader->startSection ();
reader->startObject (&object_type, &object_index);
parseHeader ();
reader->endObject ();
reader->endSection ();
// Section 2～
while (reader->startSection ()) {
while (reader->startObject (&object_type, &object_index)) {
//cout << "Loader:: object_type = " << object_type << "\n";
switch (object_type) {
case M3G_TYPE_HEADER : parseHeader () ; break;
case M3G_TYPE_ANIMATION_CONTROLLER: parseAnimationController (); break;
case M3G_TYPE_ANIMATION_TRACK : parseAnimationTrack () ; break;
case M3G_TYPE_APPEARANCE : parseAppearance () ; break;
case M3G_TYPE_BACKGROUND : parseBackground () ; break;
case M3G_TYPE_CAMERA : parseCamera () ; break;
case M3G_TYPE_COMPOSITING_MODE : parseCompositingMode () ; break;
case M3G_TYPE_FOG : parseFog () ; break;
case M3G_TYPE_POLYGON_MODE : parsePolygonMode () ; break;
case M3G_TYPE_GROUP : parseGroup () ; break;
case M3G_TYPE_IMAGE2D : parseImage2D () ; break;
case M3G_TYPE_TRIANGLE_STRIP_ARRAY: parseTriangleStripArray () ; break;
case M3G_TYPE_LIGHT : parseLight () ; break;
case M3G_TYPE_MATERIAL : parseMaterial () ; break;
case M3G_TYPE_MESH : parseMesh () ; break;
case M3G_TYPE_MORPHING_MESH : parseMorphingMesh () ; break;
case M3G_TYPE_SKINNED_MESH : parseSkinnedMesh () ; break;
case M3G_TYPE_TEXTURE2D : parseTexture2D () ; break;
case M3G_TYPE_SPRITE3D : parseSprite3D () ; break;
case M3G_TYPE_KEYFRAME_SEQUENCE : parseKeyframeSequence () ; break;
case M3G_TYPE_VERTEX_ARRAY : parseVertexArray () ; break;
case M3G_TYPE_VERTEX_BUFFER : parseVertexBuffer () ; break;
case M3G_TYPE_WORLD : parseWorld () ; break;
case M3G_TYPE_EXTERNAL_REFERENCE : parseExternalReference () ; break;
default: {
throw IOException (__FILE__, __func__, "Unknown object type = %d", object_type);
}
}
reader->endObject ();
}
reader->endSection ();
}
objs.erase (remove(objs.begin(), objs.end(), (Object3D*)0), objs.end());
return objs;
}
/**
* (注意) PNG画像は左上が(0,0)でM3Gは左下が(0,0)なので忘れずに上下をひっくり返すこと。
*/
std::vector<Object3D*> Loader:: load_image (const char* buffer, int size)
{
int width, height, comp;
unsigned char* pixels = stbi_load_from_memory ((unsigned char*)buffer, size,
&width, &height, &comp, 0);
if (pixels == NULL) {
throw IOException (__FILE__, __func__, "This file is not m3g or image (png, jpeg, ...).");
}
int format;
switch (comp) {
case 1 : format = Image2D::LUMINANCE; break;
case 2 : format = Image2D::LUMINANCE_ALPHA; break;
case 3 : format = Image2D::RGB; break;
case 4 : format = Image2D::RGBA; break;
default: throw IOException (__FILE__, __func__, "Unknown image format=%d.", comp);
}
unsigned char* tmp = new unsigned char[width*comp];
for (int y = 0; y < height/2; y++) {
memswap ((char*)&pixels[y*width*comp],
(char*)&pixels[(height-1-y)*width*comp],
(char*)tmp,
width*comp);
}
delete[] tmp;
objs.push_back (new Image2D (format, width, height, pixels));
stbi_image_free (pixels);
return objs;
}
void Loader:: parseHeader ()
{
M3GHeaderStruct header;
reader->readHeader (&header);
objs.push_back (0);
}
void Loader:: parseAnimationController ()
{
M3GObject3DStruct obj;
M3GAnimationControllerStruct ac;
reader->readObject3D (&obj);
reader->readAnimationController (&ac);
AnimationController* anim_ctr = new AnimationController ();
setObject3D (anim_ctr, obj);
setAnimationController (anim_ctr, ac);
objs.push_back (anim_ctr);
}
void Loader:: parseAnimationTrack ()
{
M3GObject3DStruct obj;
M3GAnimationTrackStruct atrack;
reader->readObject3D (&obj);
reader->readAnimationTrack (&atrack);
KeyframeSequence* key_seq = dynamic_cast<KeyframeSequence*>(objs[atrack.keyframe_sequence_index]);
unsigned int property = atrack.property_id;
AnimationTrack* anim_track = new AnimationTrack (key_seq, property);
setObject3D (anim_track, obj);
setAnimationTrack (anim_track, atrack);
objs.push_back (anim_track);
}
void Loader:: parseAppearance ()
{
M3GObject3DStruct obj;
M3GAppearanceStruct ap;
reader->readObject3D (&obj);
reader->readAppearance (&ap);
Appearance* app = new Appearance ();
setObject3D (app, obj);
setAppearance (app, ap);
objs.push_back (app);
}
void Loader:: parseBackground ()
{
M3GObject3DStruct obj;
M3GBackgroundStruct bgrnd;
reader->readObject3D (&obj);
reader->readBackground (&bgrnd);
Background* bg = new Background ();
setObject3D (bg, obj);
setBackground (bg, bgrnd);
objs.push_back (bg);
}
void Loader:: parseCamera ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GCameraStruct cmr;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readCamera (&cmr);
Camera* cam = new Camera ();
setObject3D (cam, obj);
setTransformable (cam, tra);
setNode (cam, node);
setCamera (cam, cmr);
objs.push_back (cam);
}
void Loader:: parseCompositingMode ()
{
M3GObject3DStruct obj;
M3GCompositingModeStruct cmp;
reader->readObject3D (&obj);
reader->readCompositingMode (&cmp);
CompositingMode* cmode = new CompositingMode ();
setObject3D (cmode, obj);
setCompositingMode (cmode, cmp);
objs.push_back (cmode);
}
void Loader:: parseFog ()
{
M3GObject3DStruct obj;
M3GFogStruct fg;
reader->readObject3D (&obj);
reader->readFog (&fg);
Fog* fog = new Fog ();
setObject3D (fog, obj);
setFog (fog, fg);
objs.push_back (fog);
}
void Loader:: parsePolygonMode ()
{
M3GObject3DStruct obj;
M3GPolygonModeStruct pm;
reader->readObject3D (&obj);
reader->readPolygonMode (&pm);
PolygonMode* pmode = new PolygonMode ();
setObject3D (pmode, obj);
setPolygonMode (pmode, pm);
objs.push_back (pmode);
}
void Loader:: parseGroup ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GGroupStruct group;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readGroup (&group);
Group* grp = new Group ();
setObject3D (grp, obj);
setTransformable (grp, tra);
setNode (grp, node);
setGroup (grp, group);
objs.push_back (grp);
}
void Loader:: parseImage2D ()
{
M3GObject3DStruct obj;
M3GImage2DStruct image;
reader->readObject3D (&obj);
reader->readImage2D (&image);
int format = image.format;
int width = image.width;
int height = image.height;
int palette_count = image.palette_count;
unsigned char* palette = image.palette;
unsigned char* pixels = image.pixels;
Image2D* img;
if (palette_count > 0) {
img = new Image2D (format, width, height, pixels, palette);
} else {
img = new Image2D (format, width, height, pixels);
}
setObject3D (img, obj);
setImage2D (img, image);
objs.push_back (img);
}
void Loader:: parseTriangleStripArray ()
{
M3GObject3DStruct obj;
M3GIndexBufferStruct ibuf;
M3GTriangleStripArrayStruct tri_strip;
reader->readObject3D (&obj);
reader->readIndexBuffer (&ibuf);
reader->readTriangleStripArray (&tri_strip);
int start_index = tri_strip.start_index;
int num_indices = tri_strip.indices_count;
int* indices = (int*)tri_strip.indices;
int num_strips = tri_strip.strip_lengths_count;
int* strips = (int*)tri_strip.strip_lengths;
TriangleStripArray* tris;
if (indices)
tris = new TriangleStripArray (num_indices, indices, num_strips, strips);
else
tris = new TriangleStripArray (start_index, num_strips, strips);
setObject3D (tris, obj);
setIndexBuffer (tris, ibuf);
setTriangleStripArray (tris, tri_strip);
objs.push_back (tris);
}
void Loader:: parseLight ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GLightStruct light;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readLight (&light);
Light* lgh = new Light ();
setObject3D (lgh, obj);
setTransformable (lgh, tra);
setNode (lgh, node);
setLight (lgh, light);
objs.push_back (lgh);
}
void Loader:: parseMaterial ()
{
M3GObject3DStruct obj;
M3GMaterialStruct material;
reader->readObject3D (&obj);
reader->readMaterial (&material);
Material* mat = new Material ();
setObject3D (mat, obj);
setMaterial (mat, material);
objs.push_back (mat);
}
void Loader:: parseMesh ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GMeshStruct msh;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readMesh (&msh);
VertexBuffer* vertices = dynamic_cast<VertexBuffer*>(objs[msh.vertex_buffer_index]);
int num_submesh = msh.submesh_count; // ファイルフォーマットで両者が
int num_appearance = msh.submesh_count; // 等しいことが保証されている
vector<IndexBuffer*> submeshs (num_submesh);
vector<Appearance*> appearances (num_submesh);
for (int i = 0; i < num_submesh; i++) {
submeshs[i] = dynamic_cast<IndexBuffer*>(objs[msh.index_buffer_index[i]]);
}
for (int i = 0; i < num_appearance; i++) {
appearances[i] = dynamic_cast<Appearance*>(objs[msh.appearance_index[i]]);
}
Mesh* mesh = new Mesh (vertices, num_submesh, &submeshs[0], num_appearance, &appearances[0]);
setObject3D (mesh, obj);
setTransformable (mesh, tra);
setNode (mesh, node);
setMesh (mesh, msh);
objs.push_back (mesh);
}
void Loader:: parseMorphingMesh ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GMeshStruct msh;
M3GMorphingMeshStruct morph_msh;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readMesh (&msh);
reader->readMorphingMesh (&morph_msh);
VertexBuffer* vertices = dynamic_cast<VertexBuffer*>(objs[msh.vertex_buffer_index]);
int num_submesh = msh.submesh_count;
int num_appearance = msh.submesh_count;
vector<IndexBuffer*> submeshs (num_submesh);
vector<Appearance*> appearances (num_submesh);
for (int i = 0; i < num_submesh; i++) {
submeshs[i] = dynamic_cast<IndexBuffer*>(objs[msh.index_buffer_index[i]]);
}
for (int i = 0; i < num_appearance; i++) {
appearances[i] = dynamic_cast<Appearance*>(objs[msh.appearance_index[i]]);
}
int num_target = morph_msh.morph_target_count;
vector<VertexBuffer*> targets (num_target);
for (int i = 0; i < num_target; i++) {
targets[i] = dynamic_cast<VertexBuffer*>(objs[morph_msh.morph_target_index[i]]);
}
MorphingMesh* mesh = new MorphingMesh (vertices ,
num_target , &targets[0] ,
num_submesh , &submeshs[0] ,
num_appearance, &appearances[0] );
setObject3D (mesh, obj);
setTransformable (mesh, tra);
setNode (mesh, node);
setMesh (mesh, msh);
setMorphingMesh (mesh, morph_msh);
objs.push_back (mesh);
}
void Loader:: parseSkinnedMesh ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GMeshStruct msh;
M3GSkinnedMeshStruct skin_msh;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readMesh (&msh);
reader->readSkinnedMesh (&skin_msh);
VertexBuffer* vertices = dynamic_cast<VertexBuffer*>(objs[msh.vertex_buffer_index]);
int num_submesh = msh.submesh_count;
int num_appearance = msh.submesh_count;
vector<IndexBuffer*> submeshs (num_submesh);
vector<Appearance*> appearances (num_submesh);
Group* skeleton = dynamic_cast<Group*>(objs[skin_msh.skeleton_index]);
for (int i = 0; i < num_submesh; i++) {
submeshs[i] = dynamic_cast<IndexBuffer*>(objs[msh.index_buffer_index[i]]);
}
for (int i = 0; i < num_appearance; i++) {
appearances[i] = dynamic_cast<Appearance*>(objs[msh.appearance_index[i]]);
}
SkinnedMesh* mesh = new SkinnedMesh (vertices, num_submesh, &submeshs[0], num_appearance, &appearances[0], skeleton);
setObject3D (mesh, obj);
setTransformable (mesh, tra);
setNode (mesh, node);
setMesh (mesh, msh);
setSkinnedMesh (mesh, skin_msh);
objs.push_back (mesh);
}
void Loader:: parseTexture2D ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GTexture2DStruct texture;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readTexture2D (&texture);
Image2D* image = dynamic_cast<Image2D*>(objs[texture.image_index]);
Texture2D* tex = new Texture2D (image);
setObject3D (tex, obj);
setTransformable (tex, tra);
setTexture2D (tex, texture);
objs.push_back (tex);
}
void Loader:: parseSprite3D ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GSprite3DStruct sprite;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readSprite3D (&sprite);
bool scaled = sprite.is_scaled;
Image2D* img = dynamic_cast<Image2D*>(objs[sprite.image_index]);
Appearance* app = dynamic_cast<Appearance*>(objs[sprite.appearance_index]);
Sprite3D* spr = new Sprite3D (scaled, img, app);
setObject3D (spr, obj);
setTransformable (spr, tra);
setSprite3D (spr, sprite);
objs.push_back (spr);
}
void Loader:: parseKeyframeSequence ()
{
M3GObject3DStruct obj;
M3GKeyframeSequenceStruct keyframe_sequence;
reader->readObject3D (&obj);
reader->readKeyframeSequence (&keyframe_sequence);
int num_keyframes = keyframe_sequence.keyframe_count;
int num_components = keyframe_sequence.component_count;
int interpolation = keyframe_sequence.interpolation;
KeyframeSequence* key_seq = new KeyframeSequence (num_keyframes, num_components, interpolation);
setObject3D (key_seq, obj);
setKeyframeSequence (key_seq, keyframe_sequence);
objs.push_back (key_seq);
}
void Loader:: parseVertexArray ()
{
M3GObject3DStruct obj;
M3GVertexArrayStruct varray;
reader->readObject3D (&obj);
reader->readVertexArray (&varray);
int num_vertices = varray.vertex_count;
int num_components = varray.component_count;
int component_size = varray.component_size;
VertexArray* varry = new VertexArray (num_vertices, num_components, component_size);
setObject3D (varry, obj);
setVertexArray (varry, varray);
objs.push_back (varry);
}
void Loader:: parseVertexBuffer ()
{
M3GObject3DStruct obj;
M3GVertexBufferStruct vbuffer;
reader->readObject3D (&obj);
reader->readVertexBuffer (&vbuffer);
VertexBuffer* vbuf = new VertexBuffer ();
setObject3D (vbuf, obj);
setVertexBuffer (vbuf, vbuffer);
objs.push_back (vbuf);
}
void Loader:: parseWorld ()
{
M3GObject3DStruct obj;
M3GTransformableStruct tra;
M3GNodeStruct node;
M3GGroupStruct grp;
M3GWorldStruct world;
reader->readObject3D (&obj);
reader->readTransformable (&tra);
reader->readNode (&node);
reader->readGroup (&grp);
reader->readWorld (&world);
World* wld = new World ();
setObject3D (wld, obj);
setTransformable (wld, tra);
setNode (wld, node);
setGroup (wld, grp);
setWorld (wld, world);
objs.push_back (wld);
}
void Loader:: parseExternalReference ()
{
M3GExternalReferenceStruct ext;
reader->readExternalReference (&ext);
if (ext.uri) {
vector<Object3D*> ext_objs = Loader:: load (ext.uri);
if ((int)ext_objs.size() == 0)
throw IOException (__FILE__, __func__, "ExternalReference has no M3G objects.");
objs.push_back (ext_objs[0]);
}
}
void Loader:: setObject3D (Object3D* obj, const M3GObject3DStruct& object) const
{
int user_id = object.user_id;
int anim_track_count = object.animation_tracks_count;
int user_parameter_count = object.user_parameter_count;
obj->setUserID (user_id);
for (int i = 0; i < anim_track_count; i++) {
AnimationTrack* anim_track = dynamic_cast<AnimationTrack*>(objs[object.animation_tracks_index[i]]);
obj->addAnimationTrack (anim_track);
}
if (user_parameter_count > 0) {
map<unsigned int, char*>* user_object = new map<unsigned int, char*>();
for (int i = 0; i < user_parameter_count; i++) {
user_object->insert (map<unsigned int, char*>::value_type(object.parameter_id[i], object.parameter_value[i]));
}
obj->setUserObject (user_object);
}
}
void Loader:: setAppearance (Appearance* app, const M3GAppearanceStruct& appearance) const
{
int layer = appearance.layer;
CompositingMode* cmode = dynamic_cast<CompositingMode*>(objs[appearance.compositing_mode_index]);
PolygonMode* pmode = dynamic_cast<PolygonMode*>(objs[appearance.polygon_mode_index]);
Material* mat = dynamic_cast<Material*>(objs[appearance.material_index]);
int textures_count = appearance.textures_count;
app->setLayer (layer);
app->setCompositingMode (cmode);
app->setPolygonMode (pmode);
app->setMaterial (mat);
for (int i = 0; i < textures_count; i++) {
Texture2D* tex = dynamic_cast<Texture2D*>(objs[appearance.textures_index[i]]);
app->setTexture (i, tex);
}
}
void Loader:: setAnimationController (AnimationController* anim_ctr, const M3GAnimationControllerStruct& ac) const
{
anim_ctr->setActiveInterval (ac.active_interval_start, ac.active_interval_end);
anim_ctr->setPosition (ac.reference_sequence_time, ac.reference_world_time);
anim_ctr->setSpeed (ac.speed, ac.reference_world_time);
anim_ctr->setWeight (ac.weight);
}
void Loader:: setAnimationTrack (AnimationTrack* anim_track, const M3GAnimationTrackStruct& at) const
{
AnimationController* anim_ctr = dynamic_cast<AnimationController*>(objs[at.animation_controller_index]);
anim_track->setController (anim_ctr);
}
void Loader:: setBackground (Background* bg, const M3GBackgroundStruct& bgr) const
{
int argb = bgr.background_color;
Image2D* img = dynamic_cast<Image2D*>(objs[bgr.background_image_index]);
int mode_x = bgr.background_image_mode_x;
int mode_y = bgr.background_image_mode_y;
int crop_x = bgr.crop_x;
int crop_y = bgr.crop_y;
int width = bgr.crop_width;
int height = bgr.crop_height;
bool depth_clear_enable = bgr.depth_clear_enabled;
bool color_clear_enable = bgr.color_clear_enabled;
bg->setColor (argb);
bg->setColorClearEnable (color_clear_enable);
bg->setCrop (crop_x, crop_y, width, height);
bg->setDepthClearEnable (depth_clear_enable);
bg->setImage (img);
bg->setImageMode (mode_x, mode_y);
}
void Loader:: setCamera (Camera* cam, const M3GCameraStruct& cmr) const
{
int projection_type = cmr.projection_type;
float fovy = cmr.fovy;
float aspect_ratio = cmr.aspect_ratio;
float near = cmr.near;
float far = cmr.far;
Transform tra;
tra.set (cmr.matrix);
switch (projection_type) {
case Camera::GENERIC : cam->setGeneric (&tra) ; break;
case Camera::PARALLEL : cam->setParallel (fovy, aspect_ratio, near, far) ; break;
case Camera::PERSPECTIVE: cam->setPerspective (fovy, aspect_ratio, near, far); break;
default: throw IOException (__FILE__, __func__, "Projection type of camera is illegal, type=%d", projection_type);
}
}
void Loader:: setCompositingMode (CompositingMode* cmode, const M3GCompositingModeStruct& comp_mode) const
{
bool depth_test_enable = comp_mode.depth_test_enabled;
bool depth_write_enable = comp_mode.depth_write_enabled;
bool color_write_enable = comp_mode.color_write_enabled;
bool alpha_write_enable = comp_mode.alpha_write_enabled;
int blending = comp_mode.blending;
float alpha_threshold = comp_mode.alpha_threshold / 255.f;
float factor = comp_mode.depth_offset_factor;
float units = comp_mode.depth_offset_units;
cmode->setAlphaThreshold (alpha_threshold);
cmode->setAlphaWriteEnable (alpha_write_enable);
cmode->setBlending (blending);
cmode->setColorWriteEnable (color_write_enable);
cmode->setDepthOffset (factor, units);
cmode->setDepthTestEnable (depth_test_enable);
cmode->setDepthWriteEnable (depth_write_enable);
}
void Loader:: setFog (Fog* fog, const M3GFogStruct& fg) const
{
int rgb = fg.color;
int mode = fg.mode;
float density = fg.density;
float near = fg.near;
float far = fg.far;
fog->setColor (rgb);
fog->setMode (mode);
switch (mode) {
case Fog::EXPONENTIAL: fog->setDensity (density) ; break;
case Fog::LINEAR : fog->setLinear (near, far); break;
default: throw IOException (__FILE__, __func__, "Fog mode is invalid, mode=%d.", mode);
}
}
void Loader:: setGroup (Group* grp, const M3GGroupStruct& group) const
{
int child_count = group.children_index_count;
for (int i = 0; i < child_count; i++) {
Node* node = dynamic_cast<Node*>(objs[group.children_index[i]]);
if (node) {
grp->addChild (node);
}
}
}
void Loader:: setImage2D (Image2D* img, const M3GImage2DStruct& image) const
{
// nothing to do
}
void Loader:: setIndexBuffer (IndexBuffer* ibuf, const M3GIndexBufferStruct& index_buffer) const
{
// nothing to do
}
void Loader:: setKeyframeSequence (KeyframeSequence* key_seq, const M3GKeyframeSequenceStruct& ks) const
{
int duration = ks.duration;
int mode = ks.repeat_mode;
int first = ks.valid_range_first;
int last = ks.valid_range_last;
int keyframe_count = ks.keyframe_count;
key_seq->setDuration (duration);
key_seq->setRepeatMode (mode);
key_seq->setValidRange (first, last);
for (int i = 0; i < keyframe_count; i++) {
int time = ks.time[i];
float* value = ks.vector_value[i];
key_seq->setKeyframe (i, time, value);
}
}
void Loader:: setLight (Light* lgh, const M3GLightStruct& light) const
{
float constant = light.attenuation_constant;
float linear = light.attenuation_linear;
float quadratic = light.attenuation_quadratic;
int rgb = light.color;
int mode = light.mode;
float intensity = light.intensity;
float angle = light.spot_angle;
float exponent = light.spot_exponent;
lgh->setAttenuation (constant, linear, quadratic);
lgh->setColor (rgb);
lgh->setIntensity (intensity);
lgh->setMode (mode);
lgh->setSpotAngle (angle);
lgh->setSpotExponent (exponent);
}
void Loader:: setMaterial (Material* mat, const M3GMaterialStruct& material) const
{
int ambient_color = material.ambient_color;
int diffuse_color = material.diffuse_color; // argb
int emissive_color = material.emissive_color;
int specular_color = material.specular_color;
float shininess = material.shininess;
bool vertex_color_tracking_enable = material.vertex_color_tracking_enabled;
mat->setColor (Material::DIFFUSE, diffuse_color);
mat->setColor (Material::AMBIENT, ambient_color);
mat->setColor (Material::EMISSIVE, emissive_color);
mat->setColor (Material::SPECULAR, specular_color);
mat->setShininess (shininess);
mat->setVertexColorTrackingEnable (vertex_color_tracking_enable);
}
void Loader:: setMesh (Mesh* mesh, const M3GMeshStruct& msh) const
{
// nothing to do
}
void Loader:: setMorphingMesh (MorphingMesh* mesh, const M3GMorphingMeshStruct& msh) const
{
int target_count = msh.morph_target_count;
float* weights = msh.initial_weight;
mesh->setWeights (target_count, weights);
}
void Loader:: setNode (Node* node, const M3GNodeStruct& nod) const
{
bool rendering_enable = nod.enable_rendering;
bool picking_enable = nod.enable_picking;
float alpha_factor = nod.alpha_factor / 255.f;
int scope = nod.scope;
bool has_alignment = nod.has_alignment;
node->setAlphaFactor (alpha_factor);
node->setPickingEnable (picking_enable);
node->setRenderingEnable (rendering_enable);
node->setScope (scope);
if (has_alignment) {
int z_target = nod.z_target;
int y_target = nod.y_target;
Node* z_ref = dynamic_cast<Node*>(objs[nod.z_reference_index]);
Node* y_ref = dynamic_cast<Node*>(objs[nod.y_reference_index]);
node->setAlignment (z_ref, z_target, y_ref, y_target);
}
}
void Loader:: setPolygonMode (PolygonMode* pmode, const M3GPolygonModeStruct& poly_mode) const
{
int culling_mode = poly_mode.culling;
int shading_mode = poly_mode.shading;
int winding_mode = poly_mode.winding;
bool two_sided_lighting_enable = poly_mode.two_sided_lighting_enabled;
bool local_camera_lighting_enable = poly_mode.local_camera_lighting_enabled;
bool perspective_correction_enable = poly_mode.perspective_correction_enabled;
pmode->setCulling (culling_mode);
pmode->setLocalCameraLightingEnable (local_camera_lighting_enable);
pmode->setPerspectiveCorrectionEnable (perspective_correction_enable);
pmode->setShading (shading_mode);
pmode->setTwoSidedLightingEnable (two_sided_lighting_enable);
pmode->setWinding (winding_mode);
}
void Loader:: setSkinnedMesh (SkinnedMesh* mesh, const M3GSkinnedMeshStruct& msh) const
{
int transform_reference_count = msh.transform_reference_count;
for (int i = 0; i < transform_reference_count; i++) {
Node* node = dynamic_cast<Node*>(objs[msh.transform_node_index[i]]);
int weight = msh.weight[i];
int first_vertex = msh.first_vertex[i];
int num_vertices = msh.vertex_count[i];
mesh->addTransform (node, weight, first_vertex, num_vertices);
}
}
void Loader:: setSprite3D (Sprite3D* spr, const M3GSprite3DStruct& sprite) const
{
int crop_x = sprite.crop_x;
int crop_y = sprite.crop_y;
int width = sprite.crop_width;
int height = sprite.crop_height;
spr->setCrop (crop_x, crop_y, width, height);
}
void Loader:: setTexture2D (Texture2D* tex, const M3GTexture2DStruct& texture) const
{
int rgb = texture.blend_color;
int blend_func = texture.blending;
int wrap_s = texture.wrapping_s;
int wrap_t = texture.wrapping_t;
int level_filter = texture.level_filter;
int image_filter = texture.image_filter;
tex->setBlendColor (rgb);
tex->setBlending (blend_func);
tex->setFiltering (level_filter, image_filter);
tex->setWrapping (wrap_s, wrap_t);
}
void Loader:: setTransformable (Transformable* trans, const M3GTransformableStruct& transformable) const
{
float tx = transformable.translation[0];
float ty = transformable.translation[1];
float tz = transformable.translation[2];
float sx = transformable.scale[0];
float sy = transformable.scale[1];
float sz = transformable.scale[2];
float angle = transformable.orientation_angle;
float ax = transformable.orientation_axis[0];
float ay = transformable.orientation_axis[1];
float az = transformable.orientation_axis[2];
float has_component_transform = transformable.has_component_transform;
float has_general_transform = transformable.has_general_transform;
Transform tra;
tra.set (transformable.transform);
if (has_component_transform) {
trans->setTranslation (tx, ty, tz);
trans->setOrientation (angle, ax, ay, az);
trans->setScale (sx, sy, sz);
}
if (has_general_transform) {
trans->setTransform (&tra);
}
}
void Loader:: setTriangleStripArray (TriangleStripArray* tris, const M3GTriangleStripArrayStruct& tri_strip) const
{
// nothing to do
}
void Loader:: setVertexArray (VertexArray* varry, const M3GVertexArrayStruct& varray) const
{
int component_size = varray.component_size;
int vertex_count = varray.vertex_count;
char** char_components = varray.char_components;
short** short_components = varray.short_components;
float** float_components = varray.float_components;
for (int i = 0; i < vertex_count; i++) {
switch (component_size) {
case 1: varry->set (i, 1, char_components[i]) ; break;
case 2: varry->set (i, 1, short_components[i]); break;
case 4: varry->set (i, 1, float_components[i]); break;
}
}
}
void Loader:: setVertexBuffer (VertexBuffer* vbuf, const M3GVertexBufferStruct& vbuffer) const
{
int default_color = vbuffer.default_color;
float position_scale = vbuffer.position_scale;
float position_bias[3] = {vbuffer.position_bias[0], vbuffer.position_bias[1], vbuffer.position_bias[2]};
VertexArray* colors = dynamic_cast<VertexArray*>(objs[vbuffer.colors_index]);
VertexArray* normals = dynamic_cast<VertexArray*>(objs[vbuffer.normals_index]);
VertexArray* positions = dynamic_cast<VertexArray*>(objs[vbuffer.positions_index]);
int texcoord_count = vbuffer.texcoord_array_count;
if (positions) {
// OpenGL(Desktop-M3G)は1バイト型の座標値に対応していないのでここで変換.
if (positions->getComponentType() == 1) {
positions->convert (2);
}
vbuf->setPositions (positions, position_scale, position_bias);
}
if (normals) {
vbuf->setNormals (normals);
}
if (colors) {
vbuf->setColors (colors);
}
vbuf->setDefaultColor (default_color);
for (int i = 0; i < texcoord_count; i++) {
VertexArray* tex_coords = dynamic_cast<VertexArray*>(objs[vbuffer.texcoords_index[i]]);
float texcoord_scale = vbuffer.texcoord_scale[i];
float texcoord_bias[3] = {vbuffer.texcoord_bias[i][0], vbuffer.texcoord_bias[i][1], vbuffer.texcoord_bias[i][2]};
if (tex_coords->getComponentType() == 1) {
tex_coords->convert (2);
}
vbuf->setTexCoords (i, tex_coords, texcoord_scale, texcoord_bias);
}
}
void Loader:: setWorld (World* wld, const M3GWorldStruct& world) const
{
Camera* cam = dynamic_cast<Camera*>(objs[world.active_camera_index]);
Background* bg = dynamic_cast<Background*>(objs[world.background_index]);
if (cam) {
wld->setActiveCamera (cam);
}
if (bg) {
wld->setBackground (bg);
}
}
| 34.126074 | 129 | 0.622726 | vadosnaprimer |
fbba48d6e7f4d8d6e5d9fa82409641de87fa13ab | 8,676 | cpp | C++ | latentred/firmware/UART.cpp | azonenberg/latentpacket | af5612618f9704ecea3779bcd061496053a6d48a | [
"BSD-3-Clause"
] | 14 | 2018-06-11T21:49:09.000Z | 2021-12-07T07:29:23.000Z | latentred/firmware/UART.cpp | azonenberg/latentpacket | af5612618f9704ecea3779bcd061496053a6d48a | [
"BSD-3-Clause"
] | 2 | 2019-08-18T07:14:42.000Z | 2019-08-18T08:56:11.000Z | latentred/firmware/UART.cpp | azonenberg/latentpacket | af5612618f9704ecea3779bcd061496053a6d48a | [
"BSD-3-Clause"
] | 3 | 2019-01-15T13:15:16.000Z | 2019-08-18T09:09:39.000Z | /***********************************************************************************************************************
* *
* LATENTPACKET v0.1 *
* *
* Copyright (c) 2019 Andrew D. Zonenberg *
* 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 author nor the names of any contributors may be used to endorse or promote products *
* derived from this software without specific prior written permission. *
* *
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS "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 AUTHORS BE HELD 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 "latentred.h"
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// UART driver class
/**
@brief Initializes a UART.
TODO: nicer constants here
*/
UART::UART(volatile usart_t* txlane, volatile usart_t* rxlane, uint32_t baud_div)
: m_txlane(txlane)
, m_rxlane(rxlane)
{
//TODO: make this part generic
if(txlane == &UART4)
{
//Enable GPIO port A
RCC.AHB1ENR |= RCC_AHB1_GPIOA;
//Configure UART4_TX as AF8 on PA0 (PMOD0_DQ5) and USART2_RX as AF7 on PA3
GPIOA.MODER = (GPIOA.MODER & 0xffffff3c) | 0x82;
GPIOA.AFRL = (GPIOA.AFRL & 0xffff0ff0) | 0x7008;
//Enable the UARTs
RCC.APB1ENR |= RCC_APB1_UART4 | RCC_APB1_USART2;
}
else if(txlane == &UART5)
{
//Enable GPIO port B
RCC.AHB1ENR |= RCC_AHB1_GPIOB;
//Configure UART5_TX as AF7 on PB9 and USART5_RX as AF7 on PB8
GPIOB.MODER = (GPIOB.MODER & 0xfff0ffff) | 0x000a0000;
GPIOB.AFRH = (GPIOB.AFRH & 0xffffff00) | 0x0077;
//Enable the UART
RCC.APB1ENR |= RCC_APB1_UART5;
}
//Set baud rates
m_txlane->BRR = baud_div;
if(m_txlane != m_rxlane)
m_rxlane->BRR = baud_div;
//Wipe config register to default states
m_txlane->CR3 = 0x0;
m_txlane->CR2 = 0x0;
m_txlane->CR1 = 0x0;
if(m_txlane != m_rxlane)
{
m_rxlane->CR3 = 0x0;
m_rxlane->CR2 = 0x0;
m_rxlane->CR1 = 0x0;
}
//Configure TX/RX lanes appropriately
m_txlane->CR1 |= 0x9;
m_rxlane->CR1 |= 0x25;
//Enable RXNE interrupt vector
volatile uint32_t* NVIC_ISER1 = (volatile uint32_t*)(0xe000e104);
if(txlane == &UART4)
{
//Enable IRQ38. This is bit 6 of NVIC_ISER1.
*NVIC_ISER1 = 0x40;
}
else if(txlane == &UART5)
{
//Enable IRQ53. This is bit 21 of NVIC_ISER1.
*NVIC_ISER1 = 0x200000;
}
}
void UART::PrintBinary(char ch)
{
m_txlane->TDR = ch;
while(0 == (m_txlane->ISR & USART_ISR_TXE))
{}
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Output formatting
void UART::WritePadded(const char* str, int minlen, char padding, int prepad)
{
int len = strlen(str);
int npads = minlen - len;
if(npads < 0)
npads = 0;
if(prepad)
for(int i=0; i<npads; i++)
PrintBinary(padding);
PrintString(str);
if(!prepad)
for(int i=0; i<npads; i++)
PrintBinary(padding);
}
/**
@brief Stripped-down printf implementation adapted from my old PICNIX project.
Much ligher than a full ANSI compatible version but good enough for typical embedded use.
*/
void UART::Printf(const char* format, ...)
{
__builtin_va_list list;
__builtin_va_start(list, format);
//Parsing helpers
const int buflen = 32; //must be large enough for INT_MAX plus null
char buf[buflen+1];
const char* pch;
int bufpos = 0;
static const char hex[] = "0123456789abcdef";
static const char Hex[] = "0123456789ABCDEF";
unsigned int d;
//Go through the format string and process it
int len = strlen(format);
for(int i=0; i<len; i++)
{
//Format character
if(format[i] == '%')
{
char type; //format code
int length = 0; //min length of field
char padchar = ' '; //padding character
int prepad = 1;
//Flush the buffer
if(bufpos > 0)
{
buf[bufpos] = '\0';
PrintString(buf);
bufpos = 0;
}
//Read specifier
type = format[++i];
if(type == '-')
{
prepad = 0;
type = format[++i];
}
while(isdigit(type))
{
if(type == '0' && length == 0)
padchar = '0';
else
length = (length*10) + (type - '0');
type = format[++i];
}
switch(type)
{
case '%':
PrintBinary('%');
break;
case 'd':
itoa(__builtin_va_arg(list, int), buf);
WritePadded(buf, length, padchar, prepad);
break;
case 's':
pch = __builtin_va_arg(list, const char*);
WritePadded(pch, length, padchar, prepad);
break;
case 'x':
case 'X':
{
d = __builtin_va_arg(list, unsigned int);
int bFirst = 1;
for(int j=0; j<8; j++)
{
//Grab the next 4 bits
unsigned int x = d >> 28;
//Print it
char ch = hex[x];
if(format[i] == 'X') //capitalize
ch = Hex[x];
//Skip leading zeros unless we are padding
//but print a single 0 if it's zero
if( (ch == '0') && bFirst && (j != 7) )
{
if( (8 - j) <= length)
PrintBinary(padchar);
}
else
{
PrintBinary(ch);
bFirst = 0;
}
//Shift off what we just printed
d <<= 4;
}
}
break;
default:
PrintBinary('*');
break;
}
}
//Nope, print it directly, buffering for improved performance
else
{
if(bufpos >= buflen)
{
buf[bufpos] = '\0';
PrintString(buf);
bufpos = 0;
}
buf[bufpos++] = format[i];
}
}
//Flush the buffer
if(bufpos > 0)
{
buf[bufpos] = '\0';
PrintString(buf);
}
__builtin_va_end(list);
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Interrupt handlers
void __attribute__((isr)) USART2_Handler()
{
//Check why we got the IRQ.
//For now, ignore anything other than "data ready"
if(0 == (USART2.ISR & USART_ISR_RXNE))
return;
//rx data? Shove it in the fifo
g_platform.m_cliUart.OnIRQRxData(USART2.RDR);
}
| 30.657244 | 120 | 0.483402 | azonenberg |
fbbaf5e0074e10d2851ce506350c252f31cf638f | 12,884 | cc | C++ | src/MapMatching/patArcTransition.cc | godosou/smaroute | e2ccc9492dff54c8ef5c74d5309d2b06758ba342 | [
"MIT"
] | 4 | 2015-02-23T16:02:52.000Z | 2021-03-26T17:58:53.000Z | src/MapMatching/patArcTransition.cc | godosou/smaroute | e2ccc9492dff54c8ef5c74d5309d2b06758ba342 | [
"MIT"
] | null | null | null | src/MapMatching/patArcTransition.cc | godosou/smaroute | e2ccc9492dff54c8ef5c74d5309d2b06758ba342 | [
"MIT"
] | 5 | 2015-02-23T16:05:59.000Z | 2017-05-04T16:13:16.000Z | #include <fstream>
#include <gsl/gsl_integration.h>
#include "patConst.h"
#include<sstream>
#include <gsl/gsl_rng.h>
#include <gsl/gsl_randist.h>
#include <gsl/gsl_math.h>
#include <gsl/gsl_monte.h>
#include <gsl/gsl_monte_plain.h>
#include <gsl/gsl_monte_miser.h>
#include <gsl/gsl_monte_vegas.h>
#include "patErrMiscError.h"
#include "patError.h"
#include "patString.h"
#include "patErrNullPointer.h"
//in the same library
#include "patArcTransition.h"
#include "patMeasurement.h"
//in Utilities
#include "patDisplay.h"
#include "patNBParameters.h"
//in Models
#include "patMeasurementDDR.h"
#include "patMeasurementModel.h"
#include "patMeasurementModelV2.h"
#include "patTrafficModelComplex.h"
#include "patBTMeasurementModel.h"
#include "patAccelMeasurementModel.h"
patArcTransition::patArcTransition(patMultiModalPath path,
patMeasurement* measurement_prev, patMeasurement* measurement_curr) :
m_value(-1.0), m_path(path), m_prev_measurement(measurement_prev), m_curr_measurement(
measurement_curr) {
}
ostream& operator<<(ostream& str, const patArcTransition& x) {
str << "<" << x.m_prev_measurement->getTimeStamp() << " - "
<< x.m_curr_measurement->getTimeStamp() << "> ";
str << x.m_path;
return str;
}
bool operator==(const patArcTransition& aTran, const patArcTransition& bTran) {
if (aTran.m_path == bTran.m_path){
if ((aTran.m_prev_measurement == bTran.m_prev_measurement)
&& (aTran.m_curr_measurement == bTran.m_curr_measurement)){
return true;
}
else{
if (!aTran.m_prev_measurement->isGPS() && !bTran.m_prev_measurement->isGPS() && !aTran.m_curr_measurement->isGPS() && !bTran.m_curr_measurement->isGPS()){
return true;
}
}
}
// if ((aTran.m_prev_measurement == bTran.m_prev_measurement)
// && (aTran.m_curr_measurement == bTran.m_curr_measurement)
// && aTran.m_path == bTran.m_path) {
// return true;
// if (aTran.m_curr_measurement->getMeasurementType() == ACCEL) {
// if (aTran.m_path.getDistanceToStop()->back()
// == bTran.m_path.getDistanceToStop()->back()) {
// return true;
// }
// else{
// return false;
// }
// } else {
// return true;
// }
// }
return false;
}
bool operator<(const patArcTransition& aTran, const patArcTransition& bTran) {
if (!aTran.m_prev_measurement->isGPS() && !bTran.m_prev_measurement->isGPS() && !aTran.m_curr_measurement->isGPS() && !bTran.m_curr_measurement->isGPS()){
return (aTran.m_path < bTran.m_path);
}
else{
//compare current time;
if (aTran.m_curr_measurement < bTran.m_curr_measurement) {
return true;
}
if (aTran.m_curr_measurement > bTran.m_curr_measurement) {
return false;
}
//compare prev time;
if (aTran.m_prev_measurement < bTran.m_prev_measurement) {
return true;
}
if (aTran.m_prev_measurement > bTran.m_prev_measurement) {
return false;
}
}
// if (aTran.m_curr_measurement->getMeasurementType() == ACCEL) {
// if (aTran.m_path.getDistanceToStop()->back()
// < bTran.m_path.getDistanceToStop()->back()) {
// return true;
// }
// if (aTran.m_path.getDistanceToStop()->back()
// > bTran.m_path.getDistanceToStop()->back()) {
// return false;
// }
// }
// //compare path
return (aTran.m_path < bTran.m_path);
}
double baseFunction_TM(double* k, size_t dim, void* params) {
struct base_params * fp = (struct base_params *) params;
return fp->TM->integral(k[0], k[1]) * fp->MM_prev->integral(k[0])
* fp->MM_curr->integral(k[1]);
}
double baseFunction_MM_2modes(double* k, size_t dim, void* params) {
struct base_params * fp = (struct base_params *) params;
return fp->TM->integral(k[0], k[1], k[2]) * fp->MM_prev->integral(k[0])
* fp->MM_curr->integral(k[1]);
}
bool patArcTransition::setModels() {
m_param.TM = new patTrafficModelComplex(m_prev_measurement,
m_curr_measurement, &m_path);
MeasurementType prev_measurement_type =
m_prev_measurement->getMeasurementType();
MeasurementType curr_measurement_type =
m_curr_measurement->getMeasurementType();
switch (prev_measurement_type) {
case GPS:
//DEBUG_MESSAGE("GPS");
m_param.MM_prev = new patMeasurementModelV2(m_prev_measurement,
m_path.front(), m_path.frontMode());
break;
case BT:
//DEBUG_MESSAGE("Dependency not GPS, but BT");
m_param.MM_prev = new patBTMeasurementModel(m_prev_measurement,
m_path.front(), m_path.frontMode());
break;
case ACCEL:
//DEBUG_MESSAGE("Dependency not GPS, but ACCEL");
m_param.MM_prev = new patAccelMeasurementModel(m_prev_measurement,
m_path.front(), m_path.frontMode(), 0.0); //FIXME
break;
default:
return false;
}
switch (curr_measurement_type) {
case GPS:
//DEBUG_MESSAGE("GPS");
m_param.MM_curr = new patMeasurementModelV2(m_curr_measurement,
m_path.back(), m_path.backMode());
break;
case BT:
m_param.MM_curr = new patBTMeasurementModel(m_curr_measurement,
m_path.back(), m_path.backMode());
break;
case ACCEL:
m_param.MM_curr = new patAccelMeasurementModel(m_curr_measurement,
m_path.back(), m_path.backMode(),
m_path.getDistanceToStop()->back());
break;
default:
return false;
}
return true;
}
patArcTransition::~patArcTransition(){
//deleteModels();
}
void patArcTransition::deleteModels() {
//DEBUG_MESSAGE("deconstructer called");
delete m_param.MM_prev;
m_param.MM_prev = NULL;
delete m_param.MM_curr;
m_param.MM_curr = NULL;
delete m_param.TM;
m_param.TM = NULL;
}
double patArcTransition::calProbability(patString algoType) {
// DEBUG_MESSAGE("change points" << m_path.getChangePoints().size());
if (algoType != "complex") {
m_value = 0.0;
WARNING("wrong algorithm name");
return 0.0;
}
if (m_path.getChangePoints().size() > 1) {
// DEBUG_MESSAGE(
// "too many multi-modal change: " << m_path.getChangePoints().size());
m_value = 0.0;
//DEBUG_MESSAGE("return 0");
//DEBUG_MESSAGE("===done===");
return 0.0;
}
patError* err_pointer(NULL);
struct link_ddr_range curr_ddr_range =
m_curr_measurement->getDDR()->getArcDDRRange(m_path.back(),
m_path.back_road_travel().mode, err_pointer);
if (err_pointer != NULL) {
WARNING("current ddr not found");
m_value = 0.0;
return m_value;
}
struct link_ddr_range prev_ddr_range =
m_prev_measurement->getDDR()->getArcDDRRange(m_path.front(),
m_path.front_road_travel().mode, err_pointer);
if (err_pointer != NULL) {
m_value = 0.0;
WARNING("prev ddr not found");
return m_value;
}
delete err_pointer;
err_pointer = NULL;
double res, err;
double *xl;
double *xu;
setModels();
// DEBUG_MESSAGE("========Start =========");
gsl_monte_function G;
// DEBUG_MESSAGE(prev_ddr_range.lower_bound<<"-"<<prev_ddr_range.upper_bound<<", "<<curr_ddr_range.lower_bound<<"-"<<curr_ddr_range.upper_bound);
G.params = &m_param;
unsigned long dimension=0;
double resConst = m_param.MM_prev->getConstant()
* m_param.MM_curr->getConstant();
//DEBUG_MESSAGE(resConst);
if (algoType == "complex" && m_path.isUniModal()) {
/*
DEBUG_MESSAGE(
"unimodal transition with arcs:" << m_path.size());
*/
xl = new double[2];
xu = new double[2];
xl[0] = prev_ddr_range.lower_bound;
xu[0] = prev_ddr_range.upper_bound; // ell_{k-1}
xl[1] = curr_ddr_range.lower_bound;
xu[1] = curr_ddr_range.upper_bound; //\ell_k
dimension = 2;
G.f = &baseFunction_TM;
} else if (algoType == "complex" && m_path.getChangePoints().size() == 1) {
/*
DEBUG_MESSAGE(
"multi-modal change: " << m_path.getChangePoints().size());
*/
xl = new double[3];
xu = new double[3];
xl[0] = prev_ddr_range.lower_bound;
xu[0] = prev_ddr_range.upper_bound; // ell_{k-1}
xl[1] = curr_ddr_range.lower_bound;
xu[1] = curr_ddr_range.upper_bound; //\ell_k
xl[2] = m_prev_measurement->getTimeStamp();
xu[2] = m_curr_measurement->getTimeStamp(); /// t_c
if (xl[0] < 0.0 || xu[0] > 1.0 || xl[1] < 0.0 || xu[1] > 1.0) {
DEBUG_MESSAGE(
xl[0] << "-" << xu[0] << "," << xl[1] << "-" << xu[1]);
}
dimension = 3;
G.f = &baseFunction_MM_2modes;
}
for (unsigned long i = 0; i < dimension; ++i) {
if (xl[i] >= xu[i]) {
DEBUG_MESSAGE(
"algorithm:" << algoType << " invalid bound " << m_path.size() << " " << i << ":" << xl[i] << "," << xu[i]);
}
}
G.dim = dimension;
const gsl_rng_type *T;
gsl_rng *r;
size_t calls = patNBParameters::the()->nbrOfIntegrationCalls;
gsl_rng_env_setup();
T = gsl_rng_default;
r = gsl_rng_alloc(T);
if (patNBParameters::the()->integrationMethod == "miser") {
gsl_monte_miser_state *s = gsl_monte_miser_alloc(dimension);
gsl_monte_miser_integrate(&G, xl, xu, dimension, calls, r, s, &res,
&err);
gsl_monte_miser_free(s);
//DEBUG_MESSAGE("miser integration result:" << res << "," << err);
} else if (patNBParameters::the()->integrationMethod == "vegas") {
gsl_monte_vegas_state *s = gsl_monte_vegas_alloc(dimension);
gsl_monte_vegas_integrate(&G, xl, xu, dimension, 10000, r, s, &res,
&err);
//DEBUG_MESSAGE("vegas warm-up" << res << "," << err);
do {
gsl_monte_vegas_integrate(&G, xl, xu, dimension, calls / 5, r, s,
&res, &err);
// DEBUG_MESSAGE(
// "result" << res << "sigma" << err << ",chisq"
// << gsl_monte_vegas_chisq(s));
} while (fabs(gsl_monte_vegas_chisq(s) - 1.0) > 0.5);
gsl_monte_vegas_free(s);
} else {
gsl_monte_plain_state *s = gsl_monte_plain_alloc(dimension);
gsl_monte_plain_integrate(&G, xl, xu, dimension, calls, r, s, &res,
&err);
gsl_monte_plain_free(s);
}
if (res != res) {
WARNING("nan integration result");
}
delete[] xl;
xl=NULL;
delete[] xu;
xu=NULL;
m_value = resConst * res;
//DEBUG_MESSAGE("arc tran" << m_value << "=" << resConst << "*" << res);
gsl_rng_free(r);
deleteModels();
//DEBUG_MESSAGE("=========Done========");
return m_value;
}
patMultiModalPath patArcTransition::getPath() {
return m_path;
}
double patArcTransition::getValue(patString type) {
if (m_value < 0.0) {
calProbability(patNBParameters::the()->algoInSelection);
}
return m_value;
}
double patArcTransition::getValue(patString type, patMeasurement* prev_measurement, patMeasurement* curr_measurement) {
if (prev_measurement->isGPS() || curr_measurement->isGPS() || m_prev_measurement->isGPS() || m_curr_measurement->isGPS() || m_value<0.0){
return getValue(type);
}
double prev_original = 0.0;
switch (m_prev_measurement->getMeasurementType()) {
case BT:
//DEBUG_MESSAGE("Dependency not GPS, but BT");
{
patBTMeasurementModel prev_m_bt_m(m_prev_measurement,
m_path.front(), m_path.frontMode());
prev_original = prev_m_bt_m.integral(1.0);
}
break;
case ACCEL:
//DEBUG_MESSAGE("Use cache");
{
patAccelMeasurementModel prev_m_accel_m(m_prev_measurement,
m_path.front(), m_path.frontMode(), 0.0);
prev_original = prev_m_accel_m.integral(1.0);
} break;
default:
WARNING("WRONG MEASUREMENT TYPE");
return false;
}
double curr_original = 0.0;
switch (m_curr_measurement->getMeasurementType()) {
case BT:
{ patBTMeasurementModel curr_m_bt_m(m_curr_measurement,
m_path.back(), m_path.backMode());
curr_original = curr_m_bt_m.integral(1.0);
break;
} case ACCEL:
{ patAccelMeasurementModel curr_m_accel_m(m_curr_measurement,
m_path.back(), m_path.backMode(),
m_path.getDistanceToStop()->back());
curr_original = curr_m_accel_m.integral(1.0);
} break;
default:
WARNING("WRONG MEASUREMENT TYPE");
return false;
}
double prev_new = 0.0;
switch (prev_measurement->getMeasurementType()) {
case BT:
//DEBUG_MESSAGE("Dependency not GPS, but BT");
{patBTMeasurementModel prev_m_bt(prev_measurement,
m_path.front(), m_path.frontMode());
prev_new = prev_m_bt.integral(1.0);
}break;
case ACCEL:
//DEBUG_MESSAGE("Dependency not GPS, but ACCEL");
{
patAccelMeasurementModel prev_m_accel(prev_measurement,
m_path.front(), m_path.frontMode(), 0.0); //FIXME
prev_new = prev_m_accel.integral(1.0);
}break;
default:
WARNING("WRONG MEASUREMENT TYPE");
return false;
}
double curr_new = 0.0;
switch (curr_measurement->getMeasurementType()) {
case BT:
{patBTMeasurementModel curr_m_bt(curr_measurement,
m_path.back(), m_path.backMode());
curr_new = curr_m_bt.integral(1.0);
}break;
case ACCEL:
{patAccelMeasurementModel curr_m_accel(curr_measurement,
m_path.back(), m_path.backMode(),
m_path.getDistanceToStop()->back());
curr_new = curr_m_accel.integral(1.0);
}break;
default:
WARNING("WRONG MEASUREMENT TYPE");
return false;
}
return m_value * curr_new * prev_new / (prev_original * curr_original);
// return m_value;
}
patMeasurement* patArcTransition::getPrevGpsPoint() {
return m_prev_measurement;
}
patMeasurement* patArcTransition::getCurrGpsPoint() {
return m_curr_measurement;
}
const patArc* patArcTransition::getFirstArc() {
return m_path.front();
}
const patArc* patArcTransition::getLastArc() {
return m_path.back();
}
| 27.354565 | 157 | 0.689227 | godosou |
fbbf3598e6dccb2caa5016b86431d4f7f7c1bed3 | 533 | cpp | C++ | STL/pair_basic.cpp | SanatankrMishra/MITMuz2020 | e1d8007a0d3332ad32ce7aeba58780b7a6469442 | [
"MIT"
] | null | null | null | STL/pair_basic.cpp | SanatankrMishra/MITMuz2020 | e1d8007a0d3332ad32ce7aeba58780b7a6469442 | [
"MIT"
] | null | null | null | STL/pair_basic.cpp | SanatankrMishra/MITMuz2020 | e1d8007a0d3332ad32ce7aeba58780b7a6469442 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main(){
pair<int,string> p , p1;
p = make_pair(2,"abc");
p1 = {2, "abcd"};
cout<< p.first << " " << p.second <<endl;
pair<int,string> &p2 = p;
p2.first = 3;
cout<< p.first << " " << p.second <<endl;
pair<int,int> p_array[3];
p_array[0]={1,2};
p_array[1]={2,3};
p_array[2]={3,4};
swap(p_array[0], p_array[2]);
for(int i=0; i<3; i++){
cout<<p_array[i].first << " " << p_array[i].second<<endl;
}
return 0;
} | 20.5 | 66 | 0.49531 | SanatankrMishra |
fbbf5a86d8fb0570119c47d6c27baa37c4fad45f | 3,123 | hpp | C++ | spacelogs.hpp | SpaceCraftTR/SpaceLogs | f913e85bf5940366359c698d6b4c96dd81285d7a | [
"MIT"
] | 1 | 2021-02-23T21:36:40.000Z | 2021-02-23T21:36:40.000Z | spacelogs.hpp | SpaceCraftTR/SpaceLogs | f913e85bf5940366359c698d6b4c96dd81285d7a | [
"MIT"
] | null | null | null | spacelogs.hpp | SpaceCraftTR/SpaceLogs | f913e85bf5940366359c698d6b4c96dd81285d7a | [
"MIT"
] | null | null | null | /*
SpaceLogs
SpaceLogs is an easy to use logging library for C++ developers.
If you don't want to get your hands dirty with date formats, SpaceLogs is here to save your back!
Copyright (c) 2021 - SpaceCraft
Distributed under terms of the MIT licence.
*/
#pragma once
#include <string>
#include <fstream>
#include <ctime>
#include <iostream>
/*Date format definitions.*/
#define MMDDYY 0
#define DDMMYY 1
#define YYMMDD 2
#define MMDDYYYY 3
#define DDMMYYYY 4
#define YYYYMMDD 5
class SpaceLogs{
std::string log;
struct tm *time__;
char cur_time[80];
char* date_format_array[6] = {
"%D %T","%d/%m/%y %T","%y/%m/%d %T",
"%m/%d/%Y %T","%d/%m/%Y %T","%Y/%m/%d %T"
};
char* selected_date_format = nullptr;
public:
SpaceLogs(){
update_time(date_format_array[MMDDYYYY]);
}
SpaceLogs(std::string log, unsigned int date_format){
try{
if(date_format < 6){
selected_date_format = date_format_array[date_format];
update_time(selected_date_format);
}
else{
throw std::string("Invalid time format! You can use a custom date format instead, or you can just rely on SpaceLogs defaults.");
}
write_log(log);
}
catch(std::string& ex){
std::cout<<"[SpaceLogs] "<<ex<<std::endl;
exit(-1);
}
}
SpaceLogs(std::string log, char* custom_date_format){
update_time(custom_date_format);
selected_date_format = custom_date_format;
write_log(log);
}
SpaceLogs(std::string log){
update_time(date_format_array[DDMMYYYY]);
write_log(log);
}
inline void write_log(std::string &log){
this->log = log;
}
inline std::string current_time(){
return this->cur_time;
}
inline std::string get_selected_date_format(){
return this->selected_date_format;
}
std::string get_latest_log(){return this->log;}
inline friend std::ostream& operator<<(std::ostream& output, SpaceLogs &obj){return output<<"["<<obj.cur_time<<"] "<<obj.get_latest_log()<<std::endl;} //Returns the latest log.
inline friend void operator>>(std::string input, SpaceLogs &log){
int pos = input.npos;
if((pos = input.find("\n")) != input.npos){
std::string temp_str = "["+log.current_time()+"] ";
input.insert(pos+1,temp_str);
}
log.write_log(input);
}
private:
inline void update_time(char* date_format){
const time_t temp_time = time(nullptr);
time__ = localtime(&temp_time);
strftime(cur_time,sizeof(cur_time),date_format,time__);
}
inline void update_time(std::string date_format){
const time_t temp_time = time(nullptr);
time__ = localtime(&temp_time);
strftime(cur_time,sizeof(cur_time),date_format.c_str(),time__);
}
}; | 31.867347 | 184 | 0.57765 | SpaceCraftTR |
fbc20a97978ac17e8f1a132d84d7c5be559c6742 | 2,239 | cc | C++ | squid/squid3-3.3.8.spaceify/src/tests/stub_tools.cc | spaceify/spaceify | 4296d6c93cad32bb735cefc9b8157570f18ffee4 | [
"MIT"
] | 4 | 2015-01-20T15:25:34.000Z | 2017-12-20T06:47:42.000Z | squid/squid3-3.3.8.spaceify/src/tests/stub_tools.cc | spaceify/spaceify | 4296d6c93cad32bb735cefc9b8157570f18ffee4 | [
"MIT"
] | 4 | 2015-05-15T09:32:55.000Z | 2016-02-18T13:43:31.000Z | squid/squid3-3.3.8.spaceify/src/tests/stub_tools.cc | spaceify/spaceify | 4296d6c93cad32bb735cefc9b8157570f18ffee4 | [
"MIT"
] | null | null | null | #include "squid.h"
#include "tools.h"
#define STUB_API "tools.cc"
#include "tests/STUB.h"
int DebugSignal = -1;
void releaseServerSockets(void) STUB
char * dead_msg(void) STUB_RETVAL(NULL)
void mail_warranty(void) STUB
void dumpMallocStats(void) STUB
void squid_getrusage(struct rusage *r) STUB
double rusage_cputime(struct rusage *r) STUB_RETVAL(0)
int rusage_maxrss(struct rusage *r) STUB_RETVAL(0)
int rusage_pagefaults(struct rusage *r) STUB_RETVAL(0)
void PrintRusage(void) STUB
void death(int sig) STUB
void BroadcastSignalIfAny(int& sig) STUB
void sigusr2_handle(int sig) STUB
void debug_trap(const char *message) STUB
void sig_child(int sig) STUB
void sig_shutdown(int sig) STUB
const char * getMyHostname(void) STUB_RETVAL(NULL)
const char * uniqueHostname(void) STUB_RETVAL(NULL)
void leave_suid(void) STUB
void enter_suid(void) STUB
void no_suid(void) STUB
bool
IamMasterProcess()
{
//std::cerr << STUB_API << " IamMasterProcess() Not implemented\n";
// Since most tests run as a single process, this is the best default.
// TODO: If some test case uses multiple processes and cares about
// its role, we may need to parameterize or remove this stub.
return true;
}
bool
IamWorkerProcess()
{
//std::cerr << STUB_API << " IamWorkerProcess() Not implemented\n";
return true;
}
bool IamDiskProcess() STUB_RETVAL_NOP(false)
bool InDaemonMode() STUB_RETVAL_NOP(false)
bool UsingSmp() STUB_RETVAL_NOP(false)
bool IamCoordinatorProcess() STUB_RETVAL(false)
bool IamPrimaryProcess() STUB_RETVAL(false)
int NumberOfKids() STUB_RETVAL(0)
//not yet needed in the Stub, causes dependency on String
//String ProcessRoles() STUB_RETVAL(String())
void writePidFile(void) STUB
pid_t readPidFile(void) STUB_RETVAL(0)
void setMaxFD(void) STUB
void setSystemLimits(void) STUB
void squid_signal(int sig, SIGHDLR * func, int flags) STUB
void logsFlush(void) STUB
void kb_incr(kb_t * k, size_t v) STUB
void debugObj(int section, int level, const char *label, void *obj, ObjPackMethod pm) STUB
void parseEtcHosts(void) STUB
int getMyPort(void) STUB_RETVAL(0)
void setUmask(mode_t mask) STUB
void strwordquote(MemBuf * mb, const char *str) STUB
void keepCapabilities(void) STUB
void restoreCapabilities(int keep) STUB
| 32.449275 | 90 | 0.7749 | spaceify |
fbc3d8aeed409e96820c39d5d1e784bd40faac93 | 1,637 | hpp | C++ | src/backend/opencl/types/image2D_readwrite.hpp | wchang22/Nova | 3db1e8f8a0dea1dcdd3d3d02332534d5945e17bb | [
"MIT"
] | 21 | 2020-05-02T06:32:23.000Z | 2021-07-14T11:22:07.000Z | src/backend/opencl/types/image2D_readwrite.hpp | wchang22/Nova | 3db1e8f8a0dea1dcdd3d3d02332534d5945e17bb | [
"MIT"
] | null | null | null | src/backend/opencl/types/image2D_readwrite.hpp | wchang22/Nova | 3db1e8f8a0dea1dcdd3d3d02332534d5945e17bb | [
"MIT"
] | 1 | 2021-05-24T13:44:56.000Z | 2021-05-24T13:44:56.000Z | #ifndef OPENCL_IMAGE2D_READWRITE_HPP
#define OPENCL_IMAGE2D_READWRITE_HPP
#ifdef OPENCL_2
#include <CL/cl2.hpp>
#else
#ifdef __APPLE__
#include <OpenCL/cl.hpp>
#else
#include <CL/cl.hpp>
#endif
#endif
#include "backend/opencl/types/image2D.hpp"
namespace nova {
template <typename T>
class Image2DReadWrite : public Image2D<T> {
public:
Image2DReadWrite() = default;
template <typename... Args>
Image2DReadWrite(Args&&... args) : Image2D<T>(std::forward<Args>(args)...) {}
Image2DReadWrite(const Image2DReadWrite& other) : Image2D<T>(other.image) {}
Image2DReadWrite(Image2DReadWrite& other) : Image2D<T>(other.image) {}
Image2DReadWrite& operator=(const Image2DReadWrite& other) {
this->image = other.image;
return *this;
}
Image2DReadWrite& operator=(Image2DReadWrite& other) {
this->image = other.image;
return *this;
}
Image2DReadWrite(Image2DReadWrite&& other) : Image2D<T>(std::move(other.image)) {}
Image2DReadWrite& operator=(Image2DReadWrite&& other) {
std::swap(this->image, other.image);
return *this;
}
~Image2DReadWrite() = default;
struct ReadAccessor {
Image2DReadWrite& image;
const cl::Image2D& data() const { return image.image; }
};
struct WriteAccessor {
Image2DReadWrite& image;
const cl::Image2D& data() const { return image.image; }
};
const ReadAccessor read_access() const { return read_accessor; }
const WriteAccessor write_access() const { return write_accessor; }
private:
ReadAccessor read_accessor { *this };
WriteAccessor write_accessor { *this };
};
}
#endif // OPENCL_IMAGE2D_READWRITE_HPP | 24.073529 | 84 | 0.706781 | wchang22 |
fbcc0bf3cb8ef5d04bc1ba11d7cb0479f49359f5 | 647 | cpp | C++ | src/circular_buffer/private/unit_tests/main_unit_tests.cpp | rybcom/circular_buffer | 5cee33519bd5cd432bea4dd325913fb64ba93152 | [
"BSD-3-Clause"
] | null | null | null | src/circular_buffer/private/unit_tests/main_unit_tests.cpp | rybcom/circular_buffer | 5cee33519bd5cd432bea4dd325913fb64ba93152 | [
"BSD-3-Clause"
] | null | null | null | src/circular_buffer/private/unit_tests/main_unit_tests.cpp | rybcom/circular_buffer | 5cee33519bd5cd432bea4dd325913fb64ba93152 | [
"BSD-3-Clause"
] | null | null | null | #include "project_config.h"
#if RUN_AS_UNIT_TESTING() == true
#define CATCH_CONFIG_RUNNER
#include "catch.hpp"
struct Point
{
float x{ 0 };
float y{ 0 };
};
static bool operator==(Point const& point, Point const& point_b)
{
return (point.x == point_b.x) && (point.y == point_b.y);
}
static bool operator!=(Point const& point, Point const& point_b)
{
return !(point == point);
}
#include "unit_tests/push_back_unit_tests.h"
#include "unit_tests/iterator_unit_tests.h"
int main(int argc, char* argv[])
{
char* xxx[2];
xxx[0] = (char*)"xxx";
xxx[1] =(char*) "-s";
int result = Catch::Session().run(2, xxx);
return result;
}
#endif
| 17.026316 | 64 | 0.667697 | rybcom |
fbcd808eb203bbd96bcd4af6a958713da0101595 | 15,536 | cc | C++ | Kernel/Boundaries/PeriodicBoundary.cc | gustavo-castillo-bautista/Mercury | eeb402ccec8e487652229d4595c46ec84f6aefbb | [
"BSD-3-Clause"
] | null | null | null | Kernel/Boundaries/PeriodicBoundary.cc | gustavo-castillo-bautista/Mercury | eeb402ccec8e487652229d4595c46ec84f6aefbb | [
"BSD-3-Clause"
] | null | null | null | Kernel/Boundaries/PeriodicBoundary.cc | gustavo-castillo-bautista/Mercury | eeb402ccec8e487652229d4595c46ec84f6aefbb | [
"BSD-3-Clause"
] | null | null | null | //Copyright (c) 2013-2020, The MercuryDPM Developers Team. All rights reserved.
//For the list of developers, see <http://www.MercuryDPM.org/Team>.
//
//Redistribution and use in source and binary forms, with or without
//modification, are permitted provid->d 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 provid->d with the distribution.
// * Neither the name MercuryDPM 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 MERCURYDPM DEVELOPERS TEAM 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 "PeriodicBoundary.h"
#include "ParticleHandler.h"
#include "Particles/BaseParticle.h"
#include "MpiDataClass.h"
#include "MpiContainer.h"
#include "DPMBase.h"
#include "MercuryBase.h"
/*!
* \details constructor
*/
PeriodicBoundary::PeriodicBoundary()
: BasePeriodicBoundary()
{
distanceLeft_ = std::numeric_limits<double>::quiet_NaN();
distanceRight_ = std::numeric_limits<double>::quiet_NaN();
scaleFactor_ = std::numeric_limits<double>::quiet_NaN();
logger(DEBUG, "PeriodicBoundary::PeriodicBoundary() finished");
}
/*!
* \details destructor
*/
PeriodicBoundary::~PeriodicBoundary()
{
logger(DEBUG, "PeriodicBoundary::~PeriodicBoundary() finished");
}
/*!
* \details Copy method; creates a copy on the heap and returns its pointer.
*/
PeriodicBoundary* PeriodicBoundary::copy() const
{
return new PeriodicBoundary(*this);
}
/*!
* \details Copy constructor
*/
PeriodicBoundary::PeriodicBoundary(const PeriodicBoundary& other)
: BasePeriodicBoundary(other)
{
normal_ = other.normal_;
scaleFactor_ = other.scaleFactor_;
distanceLeft_ = other.distanceLeft_;
distanceRight_ = other.distanceRight_;
shift_ = other.shift_;
}
/*!
* \details Defines the boundary, given a normal vector such that all particles
* are within {x: position_left<=normal*x<position_right}. The shift vector is set
* assuming that the domain is rectangular (shift parallel to normal).
* \param[in] normal The normal vector pointing from the left wall into the domain
* \param[in] distanceLeft The (signed) distance between the left wall and the origin
* \param[in] distanceRight The (signed) distance between the right wall and the origin
*/
void PeriodicBoundary::set(Vec3D normal, Mdouble distanceLeft, Mdouble distanceRight)
{
// factor is used to set normal to unit length
scaleFactor_ = 1. / std::sqrt(Vec3D::dot(normal, normal));
normal_ = normal * scaleFactor_;
distanceLeft_ = distanceLeft * scaleFactor_;
distanceRight_ = distanceRight * scaleFactor_;
logger.assert_always(distanceRight_ > distanceLeft_,
"PeriodicBoundary::set: left distance needs to be smaller than right distance");
shift_ = normal_ * (distanceRight_ - distanceLeft_);
}
void PeriodicBoundary::set(Vec3D normal, Vec3D positionLeft, Vec3D positionRight)
{
set(normal, Vec3D::dot(positionLeft, normal), Vec3D::dot(positionRight, normal));
}
/*!
* \details like PeriodicBoundary::set(normal, distanceLeft, distanceRight), but
* including the possibility of setting the shift direction vector.
* \param[in] normal The normal vector pointing from the left wall into the domain
* \param[in] distanceLeft The (signed) distance between the left wall and the origin
* \param[in] distanceRight The (signed) distance between the right wall and the origin
* \param[in] shiftDirection The vector over which particles will be shifted when
* moving through the PeriodicBoundary
*/
void PeriodicBoundary::set(Vec3D normal, Mdouble distanceLeft, Mdouble distanceRight, Vec3D shiftDirection)
{
// factor is used to set normal to unit length
scaleFactor_ = 1. / std::sqrt(Vec3D::dot(normal, normal));
normal_ = normal * scaleFactor_;
distanceLeft_ = distanceLeft * scaleFactor_;
distanceRight_ = distanceRight * scaleFactor_;
// factor is used to set shift vector to correct length
scaleFactor_ = (distanceRight_ - distanceLeft_) * Vec3D::dot(shiftDirection, normal_);
shift_ = shiftDirection * scaleFactor_;
}
/*!
* \details Sets the shift_ vector through setting the planewise shift.
* We delete the component of planewiseShift that is parallel to normal_.
*/
void PeriodicBoundary::setPlanewiseShift(Vec3D planewiseShift)
{
planewiseShift -= Vec3D::dot(planewiseShift, normal_) / Vec3D::dot(normal_, normal_) * normal_;
shift_ = normal_ * (distanceRight_ - distanceLeft_) + planewiseShift;
}
/*!
* \return The vector perpendicular to the periodic boundary
*/
Vec3D PeriodicBoundary::getNormal() const
{
return normal_;
}
/*!
* \return The distance of the left wall to the origin, in normal direction
*/
Mdouble PeriodicBoundary::getDistanceLeft() const
{
return distanceLeft_;
}
/*!
* \return The distance of the left wall to the origin, in normal direction
*/
Mdouble PeriodicBoundary::getDistanceRight() const
{
return distanceRight_;
}
/*!
* \return The vector going from the left to the right sid-> of the periodic boundary
*/
Vec3D PeriodicBoundary::getShift() const
{
return shift_;
}
/*!
* \details Allows the left periodic boundary to be moved to a new position and
* automatically changes its shift value
* \param[in] distanceLeft The distance (from the origin) to which the left
* boundary is moved
*/
void PeriodicBoundary::moveLeft(Mdouble distanceLeft)
{
distanceLeft_ = distanceLeft * scaleFactor_;
shift_ = normal_ * (distanceRight_ - distanceLeft_);
}
/*!
* \details Allows the right periodic wall to be moved to a new position and
* automatically changes its shift value
* \param[in] distanceRight The distance (from the origin) to which the right
* boundary is moved
*/
void PeriodicBoundary::moveRight(Mdouble distanceRight)
{
distanceRight_ = distanceRight * scaleFactor_;
shift_ = normal_ * (distanceRight_ - distanceLeft_);
}
/*!
* \details Returns the distance to the closest edge of the boundary to the particle.
* Since this function should be called before calculating any Particle-Wall
* interactions, it can also be used to set the shift vector in case of curved walls.
* Positive means that the particle is insid-> the periodic domain, negative means that it is
* outsid-> the periodic domain.
* \param[in] p A reference to the particle which distance to the periodic
* boundary is calculated
*/
Mdouble PeriodicBoundary::getDistance(const BaseParticle& p) const
{
return getDistance(p.getPosition());
}
/*!
* \details Returns the distance to the edge closest to the position
* \param[in] position A reference to the position which distance to the periodic
* boundary is to be calculated
*/
Mdouble PeriodicBoundary::getDistance(const Vec3D& position) const
{
Mdouble distanceFromPlaneThroughOrigin = Vec3D::dot(position, normal_);
return std::min(distanceFromPlaneThroughOrigin - distanceLeft_,
distanceRight_ - distanceFromPlaneThroughOrigin);
}
/*!
* \details Shifts the particle either to the left or right, using the method isClosestToLeftBoundary to determine which
* sid-> it should be shifted to.
* \param[in] p A pointer to the particle which will be shifted.
*/
void PeriodicBoundary::shiftPosition(BaseParticle* p) const
{
if (isClosestToLeftBoundary(*p))
{
p->move(shift_);
}
else
{
p->move(-shift_);
}
}
/*!
* \details Shifts the particle either to the left or right, using the method isClosestToLeftBoundary to determine which
* sid-> it should be shifted to.
* \param[in] p A pointer to the particle which will be shifted.
*/
void PeriodicBoundary::shiftPosition(Vec3D& p) const
{
if (isClosestToLeftBoundary(p))
{
p += shift_;
}
else
{
p -= shift_;
}
}
/*!
* \details Shifts two given positions by the shift_ vector.
* \param[in] position1 The first position to be shifted
* \param[in] position2 The second position to be shifted
* \todo (AT) see toDo of PeriodicBoundary::shiftPosition().
*/
void PeriodicBoundary::shiftPositions(Vec3D& position1, Vec3D& position2) const
{
if (isClosestToLeftBoundary(position1))
{
position1 += shift_;
position2 += shift_;
}
else
{
position1 -= shift_;
position2 -= shift_;
}
}
/*
* \details Returns TRUE if particle checked is closest to the 'left'
* wall, and FALSE if it is closest to the 'right' wall.
* \param[in] p A point to a BaseParticle that is being checked.
* \return true if it is closest to the left boundary, false otherwise
*/
bool PeriodicBoundary::isClosestToLeftBoundary(const BaseParticle& p) const
{
return isClosestToLeftBoundary(p.getPosition());
}
/*
* \details Returns TRUE if position checked is closest to the 'left'
* wall, and FALSE if it is closest to the 'right' wall.
* \param[in] p A position vector p that is checked.
* \return true if it is closest to the left boundary, false otherwise
*/
bool PeriodicBoundary::isClosestToLeftBoundary(const Vec3D& p) const
{
const Mdouble distance = Vec3D::dot(p, normal_);
return (distanceRight_ - distance > distance - distanceLeft_);
}
/*!
* \details Reads the boundary properties from an istream
* \param[in] is the istream
*/
void PeriodicBoundary::read(std::istream& is)
{
BasePeriodicBoundary::read(is);
std::string dummy;
is >> dummy >> normal_
>> dummy >> scaleFactor_
>> dummy >> distanceLeft_
>> dummy >> distanceRight_
>> dummy >> shift_;
}
/*!
* \details Deprecated version of read().
* \deprecated Should be gone by Mercury 2.0. Instead, use CubeInsertionBoundary::read().
*/
void PeriodicBoundary::oldRead(std::istream& is)
{
std::string dummy;
is >> dummy >> normal_
>> dummy >> scaleFactor_
>> dummy >> distanceLeft_
>> dummy >> distanceRight_
>> dummy >> shift_;
}
/*!
* \details Writes boundary's properties to an ostream
* \param[in] os the ostream
*/
void PeriodicBoundary::write(std::ostream& os) const
{
BasePeriodicBoundary::write(os);
os << " normal " << normal_
<< " scaleFactor " << scaleFactor_
<< " distanceLeft " << distanceLeft_
<< " distanceRight " << distanceRight_
<< " shift " << shift_;
}
/*!
* \details Returns the name of the object class
* \return the object's class' name, i.e. 'CubeInsertionBoundary'
*/
std::string PeriodicBoundary::getName() const
{
return "PeriodicBoundary";
}
/*!
* \details Checks the distance of given particle to the closest of both periodic
* walls, and creates a periodic copy of the particle if needed (i.e. if the particle
* is closer to the periodic wall than the radius of the largest particle in the
* system).
* \param[in] p Particle to be checked and possibly periodically copied
* \param[in,out] pH System's ParticleHandler, (1) from which the interaction radius
* of its largest particle is retrieved to determine the maximum
* distance from the wall at which a particle should still have
* a periodic copy created, and (2) to which a possible periodic
* copy of the particle will be added
*/
void PeriodicBoundary::createPeriodicParticle(BaseParticle* p, ParticleHandler& pH)
{
//note that getDistance sets closestToLeftBoundary_ to true or false depending on which side is closest
const Mdouble maxDistance = p->getMaxInteractionRadius() + pH.getLargestParticle()->getMaxInteractionRadius();
if (getDistance(*p) < maxDistance)
{
createGhostParticle(p);
}
}
void PeriodicBoundary::createGhostParticle(BaseParticle* pReal)
{
ParticleHandler& pH = getHandler()->getDPMBase()->particleHandler;
//Step 1: Copy the particle to new ghost particle.
BaseParticle* pGhost = pReal->copy();
//Step 2: Copy the interactions of the ghost particle.
pGhost->copyInteractionsForPeriodicParticles(*pReal);
//Step 3: Shift the ghost to the 'reflected' location.
shiftPosition(pGhost);
//Step 4: If Particle is double shifted, get correct original particle
BaseParticle* from = pReal;
while (from->getPeriodicFromParticle() != nullptr)
from = from->getPeriodicFromParticle();
pGhost->setPeriodicFromParticle(from);
pGhost->setPeriodicGhostParticle(true);
pH.addObject(pGhost);
}
/*!
* \details Checks the distance of given particle to the closest of both periodic
* walls, and creates a periodic copy of the particle if needed (i.e. if the particle
* is closer to the periodic wall than the radius of the largest particle in the
* system).
* \param[in] p Particle to be checked and possibly periodically copied
* \param[in,out] pH System's ParticleHandler, (1) from which the interaction radius
* of its largest particle is retrieved to determine the maximum
* distance from the wall at which a particle should still have
* a periodic copy created, and (2) to which a possible periodic
* copy of the particle will be added
*/
void PeriodicBoundary::createPeriodicParticles(ParticleHandler& pH)
{
#ifdef MERCURY_USE_MPI
if (NUMBER_OF_PROCESSORS == 1)
{
#endif
unsigned numberOfParticles = pH.getSize();
for (unsigned i = 0; i < numberOfParticles; i++)
{
createPeriodicParticle(pH.getObject(i), pH);
}
#ifdef MERCURY_USE_MPI
}
#endif
}
/*!
* \details Loops through all particles to see if they have become ghosts. If that
* is the case their position is shifted.
* Note: This is only for a serial build - periodic particles work different in paralle
* \param[in]
* \param[out] pH the particle handler that contains all particles that
* need to be checked
*/
void PeriodicBoundary::checkBoundaryAfterParticlesMove(ParticleHandler& pH)
{
#ifdef MERCURY_USE_MPI
if (NUMBER_OF_PROCESSORS == 1)
{
#endif
for (auto p = pH.begin(); p != pH.end(); ++p)
{
if (getDistance((*p)->getPosition()) < 0)
{
shiftPosition(*p);
getHandler()->getDPMBase()->hGridUpdateMove(*p, shift_.getLengthSquared());
}
}
#ifdef MERCURY_USE_MPI
}
#endif
}
| 33.773913 | 120 | 0.701982 | gustavo-castillo-bautista |
fbd232b86ff3fdcc05731a6079327e3a0b2a03c2 | 2,102 | hpp | C++ | src/genericcomponent.hpp | nek0bit/LoopCube | 882296f32bfe3a8b1765950a9b8c9e24af75d009 | [
"MIT"
] | 9 | 2020-04-03T21:20:02.000Z | 2021-08-23T19:57:57.000Z | src/genericcomponent.hpp | nek0bit/LoopCube | 882296f32bfe3a8b1765950a9b8c9e24af75d009 | [
"MIT"
] | 2 | 2020-12-05T01:05:58.000Z | 2021-01-23T04:41:24.000Z | src/genericcomponent.hpp | nek0bit/LoopCube | 882296f32bfe3a8b1765950a9b8c9e24af75d009 | [
"MIT"
] | 4 | 2020-07-04T13:47:33.000Z | 2021-09-11T15:29:08.000Z | #pragma once
#include <functional>
#include <variant>
#include <glm/glm.hpp>
#include <cmath>
#include "margin.hpp"
#include "camera.hpp"
#include "generic.hpp"
#include "eventwrapper.hpp"
#include "graphics.hpp"
#include "transform.hpp"
#include "componenttypes.hpp"
enum component_size_t
{
SIZE_AUTO = -1,
SIZE_NONE
};
enum fixedsize_t
{
FIXED_W = 1,
FIXED_H
};
// TODO use structs for arguments that get repeated a lot
namespace UI
{
class GenericComponent
{
private:
// Event handling (click, enter, etc.)
void eventClick(const Camera& camera, const EventWrapper& events, const Transform& transform);
void eventHover(const Camera& camera, const EventWrapper& events, const Transform& transform);
protected:
[[nodiscard]] bool isVmouseTouching(const Camera& camera, const EventWrapper& events, const Transform& transform) const noexcept;
void handleEvents(const Camera& camera, const EventWrapper& events, const Transform& transform); // Calls all event methods
void transformPropify(Transform& transform) const noexcept;
public:
glm::ivec2 position;
glm::ivec2 realPosition;
glm::ivec2 size;
glm::ivec2 initialSize;
GenericComponent(const component_t type,
const glm::ivec2& position = {0, 0},
const glm::ivec2& size = {0, 0},
const Margin& margin = {0, 0, 0, 0});
virtual ~GenericComponent();
virtual void refreshContent();
virtual void update(const Camera& camera, const EventWrapper& events, Transform = {});
virtual void draw(const Graphics&, Transform = {}) const noexcept;
component_t type;
unsigned id;
// Events
std::function<void(void)> onClick;
std::function<void(void)> onHover;
// Properties
Margin margin;
glm::vec3 scale;
uint8_t fixed;
// Any type can go here, but containers are recommended
GenericComponent* parentContainer;
};
}
| 28.405405 | 137 | 0.636061 | nek0bit |
fbde78a2c0a18cd8a0b149fe1e43d016d784dbd9 | 57 | hpp | C++ | src/boost_fusion_algorithm_iteration_fold_fwd.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 10 | 2018-03-17T00:58:42.000Z | 2021-07-06T02:48:49.000Z | src/boost_fusion_algorithm_iteration_fold_fwd.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 2 | 2021-03-26T15:17:35.000Z | 2021-05-20T23:55:08.000Z | src/boost_fusion_algorithm_iteration_fold_fwd.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 4 | 2019-05-28T21:06:37.000Z | 2021-07-06T03:06:52.000Z | #include <boost/fusion/algorithm/iteration/fold_fwd.hpp>
| 28.5 | 56 | 0.824561 | miathedev |
fbe72457c27be685c36473d4c044cf3c06b2be33 | 6,434 | cpp | C++ | samples/find_skills.cpp | robert-lindsey/WCRP | 7e46c02d430b5fdc7a13dda42cc965b87f640346 | [
"MIT"
] | 19 | 2015-11-02T01:28:57.000Z | 2022-03-31T06:14:46.000Z | samples/find_skills.cpp | wpmarinho/WCRP | 7e46c02d430b5fdc7a13dda42cc965b87f640346 | [
"MIT"
] | 1 | 2017-04-13T08:18:40.000Z | 2017-04-13T08:18:40.000Z | samples/find_skills.cpp | wpmarinho/WCRP | 7e46c02d430b5fdc7a13dda42cc965b87f640346 | [
"MIT"
] | 6 | 2016-11-08T02:18:47.000Z | 2020-12-20T20:18:05.000Z | /*
The MIT License (MIT)
Copyright (c) 2015 Robert Lindsey
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 FIND_SKILLS_CPP
#define FIND_SKILLS_CPP
#include "common.hpp"
#include "MixtureWCRP.hpp"
using namespace std;
int main(int argc, char ** argv) {
namespace po = boost::program_options;
string datafile, savefile, expertfile;
int tmp_num_iterations, tmp_burn, tmp_num_subsamples;
double init_beta, init_alpha_prime;
bool infer_beta, infer_alpha_prime, map_estimate;
// parse the command line arguments
po::options_description desc("Allowed options");
desc.add_options()
("help", "print help message")
("datafile", po::value<string>(&datafile), "(required) file containing the student recall data")
("savefile", po::value<string>(&savefile), "(required) file to put the skill labels")
("expertfile", po::value<string>(&expertfile), "(optional) file containing the expert-provided skill labels")
("map_estimate", "(optional) save the MAP skill labels instead of all sampled skill labels")
("iterations", po::value<int>(&tmp_num_iterations)->default_value(1000), "(optional but highly recommended) number of iterations to run. if you're not sure how to set it, use a large value")
("burn", po::value<int>(&tmp_burn)->default_value(500), "(optional but highly recommended) number of iterations to discard. if you're not sure how to set it, use a large value (less than iterations)")
("fix_alpha_prime", po::value<double>(&init_alpha_prime), "(optional) fix alpha' at the provided value instead of letting the model try to estimate it")
("fix_beta", po::value<double>(&init_beta), "(optional) fix beta at the provided value instead of giving it the Bayesian treatment")
("num_subsamples", po::value<int>(&tmp_num_subsamples)->default_value(2000), "number of auxiliary samples to use when approximating the marginal likelihood of new skills")
;
po::variables_map vm;
po::store(po::parse_command_line(argc, argv, desc), vm);
po::notify(vm);
if (argc == 1 || vm.count("help")) {
cout << desc << endl;
return EXIT_SUCCESS;
}
map_estimate = vm.count("map_estimate");
if (vm.count("fix_alpha_prime")) {
assert(init_alpha_prime >= 0);
infer_alpha_prime = false;
}
else {
init_alpha_prime = -1;
infer_alpha_prime = true;
}
size_t num_iterations = (size_t) tmp_num_iterations;
size_t burn = (size_t) tmp_burn;
size_t num_subsamples = (size_t) tmp_num_subsamples;
Random * generator = new Random(time(NULL));
if (vm.count("fix_beta")) {
assert(init_beta >= 0 && init_beta <= 1);
infer_beta = false;
}
else {
// note: this will be overwritten if no expert-labels are provided
init_beta = .5; // arbitrary starting value < 1
infer_beta = true;
}
assert(num_iterations >= 0);
assert(num_iterations > burn);
// load the dataset
vector< vector<bool> > recall_sequences; // recall_sequences[student][trial # i] = recall success or failure of the ith trial we have for the student
vector< vector<size_t> > item_sequences; // item_sequences[student][trial # i] = item corresponding to the ith trial we have for the student
size_t num_students, num_items, num_skills_dataset;
load_student_data(datafile.c_str(), recall_sequences, item_sequences, num_students, num_items, num_skills_dataset);
assert(num_students > 0 && num_items > 0);
// load the expert-provided skill labels if possible
vector<size_t> provided_skill_labels(num_items, 0);
if (!expertfile.empty()) load_expert_labels(expertfile.c_str(), provided_skill_labels, num_items);
else {
// tell the model to ignore provided_skill_labels:
init_beta = 0.0;
infer_beta = false;
}
// we'll let the model use all the students as training data:
set<size_t> train_students;
for (size_t s = 0; s < num_students; s++) train_students.insert(s);
// create the model
MixtureWCRP model(generator, train_students, recall_sequences, item_sequences, provided_skill_labels, init_beta, init_alpha_prime, num_students, num_items, num_subsamples);
// run the sampler
model.run_mcmc(num_iterations, burn, infer_beta, infer_alpha_prime);
ofstream out_skills(savefile.c_str(), ofstream::out);
if (map_estimate) { // save the most likely skill label
vector<size_t> map_estimate = model.get_most_likely_skill_labels();
assert(map_estimate.size() == num_items);
for (size_t item = 0; item < num_items; item++) {
out_skills << map_estimate.at(item);
if (item == num_items - 1) out_skills << endl;
else out_skills << " ";
}
}
else { // save all sampled skill labels
vector< vector<size_t> > skill_samples = model.get_sampled_skill_labels();
assert(!skill_samples.empty());
for (size_t sample = 0; sample < skill_samples.size(); sample++) {
assert(skill_samples.at(sample).size() == num_items);
for (size_t item = 0; item < num_items; item++) {
out_skills << skill_samples.at(sample).at(item);
if (item == num_items - 1) out_skills << endl;
else out_skills << " ";
}
}
}
delete generator;
return EXIT_SUCCESS;
}
#endif
| 42.328947 | 208 | 0.688685 | robert-lindsey |
fbeba41c6180654d034034683e1745858fbf062e | 4,556 | cpp | C++ | examples/simple_examples/SimpleExamples.cpp | vsemenyakin/cpprt | e9c34bb89f470e148e531b70359acd2d2f9d6730 | [
"MIT-0",
"MIT"
] | 4 | 2016-04-20T09:40:11.000Z | 2017-05-03T16:10:21.000Z | examples/simple_examples/SimpleExamples.cpp | vsemenyakin/cpprt | e9c34bb89f470e148e531b70359acd2d2f9d6730 | [
"MIT-0",
"MIT"
] | null | null | null | examples/simple_examples/SimpleExamples.cpp | vsemenyakin/cpprt | e9c34bb89f470e148e531b70359acd2d2f9d6730 | [
"MIT-0",
"MIT"
] | 1 | 2022-02-14T16:08:44.000Z | 2022-02-14T16:08:44.000Z | ////////////////////////////////////////////////////////////////////////////////
//
// SimpleExamples.cpp
//
// Copyright (c) 2016 Semenyakin Vladimir (semenyakinVS@gmail.com)
//
// Distributed under the MIT (See accompanying file LICENSE.txt or copy at
// https://opensource.org/licenses/MIT)
//
////////////////////////////////////////////////////////////////////////////////
// Cpprt includes
#include <cpprt/CPPRTRuntime.h>
// Output
#include <iostream>
//----------------------------- Classes ----------------------------------------
// Animal [ICPPRTManagedClass]
// | -Mammal
// | | -Dog
// | | -Cat
// | -Birds
// | | -Parrot
// | | -Crow
// | -Fish
//-
// IAnimal.h
class IAnimal : public ICPPRTManagedClass {
CPPRT_DECLARATION(IAnimal)
public:
virtual void saySomething() = 0;
};
// IAnimal.cpp
CPPRT_INTERFACE_IMPLEMENTATION_BASE_0(IAnimal)
//--
// IMammal.h
class IMammal : public IAnimal {
CPPRT_DECLARATION(IMammal)
public:
// virtual void saySomething() = 0; <<<--- not implemented
};
// IMammal.cpp
CPPRT_INTERFACE_IMPLEMENTATION_BASE_1(IMammal, IAnimal)
//---
// Dog.h
class Dog : public IMammal {
CPPRT_DECLARATION(Dog)
public:
virtual void saySomething() {
std::cout << "howl-howl" << std::endl;
}
};
// Dog.cpp
CPPRT_CLASS_IMPLEMENTATION_BASE_1(Dog, IMammal)
//---
// Cat.h
class Cat : public IMammal {
CPPRT_DECLARATION(Cat)
public:
virtual void saySomething() {
std::cout << "mew-mew" << std::endl;
}
};
// Cat.cpp
CPPRT_CLASS_IMPLEMENTATION_BASE_1(Cat, IMammal)
//--
// IBird.h
class IBird : public IAnimal {
CPPRT_DECLARATION(IBird)
public:
// virtual void saySomething() = 0; <<<--- not implemented
};
// IBird.cpp
CPPRT_INTERFACE_IMPLEMENTATION_BASE_1(IBird, IAnimal)
//---
// Parrot.h
class Parrot : public IBird {
CPPRT_DECLARATION(Parrot)
public:
virtual void saySomething() {
std::cout << "hello, richard" << std::endl;
}
};
// Parrot.cpp
CPPRT_CLASS_IMPLEMENTATION_BASE_1(Parrot, IBird)
//---
// Crow.h
namespace Poe {
class Crow : public IBird {
CPPRT_DECLARATION(Crow)
public:
virtual void saySomething() {
std::cout << "never-r mor-re!!!" << std::endl;
}
};
}
// Crow.cpp
CPPRT_CLASS_IMPLEMENTATION_BASE_1(Poe::Crow, IBird)
//--
// Fish.h
class Fish : public IAnimal {
CPPRT_DECLARATION(Fish)
public:
virtual void saySomething() {
std::cout << " " << std::endl;
}
};
// Fish.cpp
CPPRT_CLASS_IMPLEMENTATION_BASE_1(Fish, IAnimal)
//----------------------------- Main -------------------------------------------
int main() {
// Get ClassData of all animal childs
std::cout << "--------------------------------------------------" <<
std::endl;
std::cout << "There was next animal ecosystem in out programm: " <<
std::endl;
std::vector<CPPRTClassData *> theClassDatas;
cppRuntime().observeChilds(IAnimal::gClassData, theClassDatas,
CPPRTRuntime::ObservingFlagRecursive |
CPPRTRuntime::ObservingFlagIgnoreBase);
for (size_t theIndex = 0, theSize = theClassDatas.size();
theIndex < theSize; ++theIndex)
{
CPPRTClassData *theClassData = theClassDatas[theIndex];
std::cout << "- " << theClassData->fullName() << " (" <<
theClassData->name() << ")";
if (theClassData->isInterface()) std::cout << " is abstract";
std::cout << std::endl;
}
// Some other tests
std::cout << "-----------------------------------------" << std::endl;
std::cout << "Animals was created and said something" << std::endl;
IAnimal *theAnimal = NULL;
theAnimal = static_cast<IAnimal *>(cppRuntime().createObject("Dog"));
std::cout << theAnimal->getClassDataRT()->name() << " said: ";
theAnimal->saySomething(); // howl-howl
delete theAnimal;
theAnimal = static_cast<IAnimal *>(cppRuntime().createObject("Cat"));
std::cout << theAnimal->getClassDataRT()->name() << " said: ";
theAnimal->saySomething(); // mew-mew
delete theAnimal;
theAnimal = static_cast<IAnimal *>(cppRuntime().createObject("Parrot"));
std::cout << theAnimal->getClassDataRT()->name() << " said: ";
theAnimal->saySomething(); // hello, richard
delete theAnimal;
theAnimal = static_cast<IAnimal *>(cppRuntime().createObject("Fish"));
std::cout << theAnimal->getClassDataRT()->name() << " said: ";
theAnimal->saySomething(); //
delete theAnimal;
theAnimal = static_cast<IAnimal *>(cppRuntime().createObject("Poe::Crow"));
std::cout << theAnimal->getClassDataRT()->name() << " said: ";
theAnimal->saySomething(); // never-r mor-re!!!
delete theAnimal;
return 0;
}
////////////////////////////////////////////////////////////////////////////////
| 22.333333 | 80 | 0.604039 | vsemenyakin |
fbef2e73b429e89c438fa94ed6d69603116738e3 | 543 | hpp | C++ | include/saci/qt/push_btn/detail/clicked.hpp | ricardocosme/saci | 2a6a134f63b6e69fde452e0fe9bb5acfd149a6e4 | [
"BSL-1.0"
] | 1 | 2020-07-29T20:42:58.000Z | 2020-07-29T20:42:58.000Z | include/saci/qt/push_btn/detail/clicked.hpp | ricardocosme/saci | 2a6a134f63b6e69fde452e0fe9bb5acfd149a6e4 | [
"BSL-1.0"
] | null | null | null | include/saci/qt/push_btn/detail/clicked.hpp | ricardocosme/saci | 2a6a134f63b6e69fde452e0fe9bb5acfd149a6e4 | [
"BSL-1.0"
] | null | null | null |
// Copyright Ricardo Calheiros de Miranda Cosme 2018.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#pragma once
#include <coruja/support/signal/signal.hpp>
#include <QObject>
namespace saci { namespace qt { namespace detail {
class clicked : public QObject {
Q_OBJECT
public:
clicked() = default;
virtual ~clicked() = default;
coruja::signal<void()> cbk;
public Q_SLOTS:
void reaction(bool)
{ cbk(); }
};
}}}
| 20.884615 | 61 | 0.694291 | ricardocosme |
fbf0fd20244b9a436c76b3d15fb05eb9bfd0a876 | 3,559 | cpp | C++ | modules/gate_ops/arithmetic/test_arithmetic.cpp | ICHEC/QNLP | 2966c7f71e6979c7ddef62520c3749cf6473fabe | [
"Apache-2.0"
] | 29 | 2020-04-13T04:40:35.000Z | 2021-12-17T11:21:35.000Z | modules/gate_ops/arithmetic/test_arithmetic.cpp | ICHEC/QNLP | 2966c7f71e6979c7ddef62520c3749cf6473fabe | [
"Apache-2.0"
] | 6 | 2020-03-12T17:40:00.000Z | 2021-01-20T12:15:08.000Z | modules/gate_ops/arithmetic/test_arithmetic.cpp | ICHEC/QNLP | 2966c7f71e6979c7ddef62520c3749cf6473fabe | [
"Apache-2.0"
] | 9 | 2020-09-28T05:00:30.000Z | 2022-03-04T02:11:49.000Z | /**
* @file test_arithmetic.cpp
* @author Lee J. O'Riordan (lee.oriordan@ichec.ie)
* @brief Tests for quantum arithmetic using the (QFT) implementation.
* @version 0.1
* @date 2019-09-10
*
* @copyright Copyright (c) 2019
*
*/
//#define CATCH_CONFIG_RUNNER
//#define CATCH_CONFIG_MAIN
#include "catch2/catch.hpp"
#include "Simulator.hpp"
#include "IntelSimulator.cpp"
#include <memory>
#include "arithmetic.hpp"
using namespace QNLP;
#include <bitset>
/**
* @brief Test Arithmetic: subtraction
*
*/
TEST_CASE("Arithmetic subtraction","[arithmetic]"){
std::size_t num_qubits = 6;
IntelSimulator sim(num_qubits);
Arithmetic<decltype(sim)> arr;
auto& r = sim.getQubitRegister();
SECTION("OLD_TEST"){
unsigned int r1_min = 0, r1_max=(num_qubits/2)-1, r2_min = r1_max+1, r2_max = num_qubits-1;
CAPTURE(r1_min, r1_max, r2_min, r2_max );
for(std::size_t pattern = 0; pattern < 1<<(num_qubits/2); pattern ++){
unsigned int bitmask = 0x1;
unsigned int a = 0;
sim.initRegister();
for (unsigned int i=0; i <= r1_max -1; i++){
sim.applyGateX(i);
a += (unsigned int) pow(2,i);
}
for (unsigned int j = r2_min; j <= r2_max; j++){
if ( (pattern & bitmask) > 0 ){
sim.applyGateX(j);
}
bitmask <<=1;
}
CAPTURE(pattern, a, bitmask);
arr.sub_reg(sim, r1_min, r1_max, r2_min, r2_max);
std::string result="";
CAPTURE(result);
for (unsigned int j = r2_min; j <= r2_max; j++){
result += std::to_string( r.GetProbability( j )).at(0);
}
CAPTURE(result);
std::reverse(result.begin(), result.end());
std::cout << "Sub = " << std::bitset<4>(a) << "-" << std::bitset<4>(pattern) << "=> Expected:=" << std::bitset<4>(a-pattern) << " : Actual:=" << result << std::endl;
CAPTURE(r);
}
}
}
/**
* @brief Test Arithmetic: Summation
*
*/
TEST_CASE("Arithmetic summation","[arithmetic]"){
std::size_t min_idx=0, max_idx=3;
std::size_t num_qubits = max_idx - min_idx +1;
IntelSimulator sim(num_qubits);
Arithmetic<decltype(sim)> arr;
auto& r = sim.getQubitRegister();
SECTION("OLD_TEST","[arithmetic]"){
unsigned int r1_min = 0, r1_max=(num_qubits/2)-1, r2_min = r1_max+1, r2_max = num_qubits-1;
for(int pattern = 0; pattern < 1<<(num_qubits/2); pattern ++){
unsigned int bitmask = 0x1;
unsigned int a = 0;
sim.initRegister();
for (unsigned int i=0; i <= r1_max -1; i++){
sim.applyGateX(i);
a += (unsigned int) pow(2,i);
}
for (unsigned int j = r2_min; j <= r2_max; j++){
if ( (pattern & bitmask) > 0 ){
sim.applyGateX(j);
}
bitmask <<=1;
}
arr.sum_reg(sim, r1_min, r1_max, r2_min, r2_max);
std::string result="";
for (unsigned int j = r2_min; j <= r2_max; j++){
result += std::to_string( r.GetProbability( j )).at(0);
}
std::reverse(result.begin(), result.end());
std::cout << "Sub = " << std::bitset<4>(a) << "-" << std::bitset<4>(pattern) << "=> Expected:=" << std::bitset<4>(a-pattern) << " : Actual:=" << result << std::endl;
CAPTURE(r);
}
}
}
| 33.261682 | 177 | 0.522338 | ICHEC |
fbf333c20937358a3fbfbca4d735273dfdc8cf57 | 876 | cpp | C++ | C++/HackerRank/mini-max-sum/src/main.cpp | cosmicraccoon/competitive-programming-sites | f7cf4f7fcb5e6c2515037fde87049cce44ddf3c3 | [
"MIT"
] | 1 | 2022-01-14T11:28:52.000Z | 2022-01-14T11:28:52.000Z | C++/HackerRank/mini-max-sum/src/main.cpp | cosmicraccoon/competitive-programming-sites | f7cf4f7fcb5e6c2515037fde87049cce44ddf3c3 | [
"MIT"
] | null | null | null | C++/HackerRank/mini-max-sum/src/main.cpp | cosmicraccoon/competitive-programming-sites | f7cf4f7fcb5e6c2515037fde87049cce44ddf3c3 | [
"MIT"
] | 1 | 2022-01-16T04:03:22.000Z | 2022-01-16T04:03:22.000Z | #include <cstdint>
#include <iostream>
#include <sstream>
#include <string_view>
#include <vector>
using namespace std;
void miniMaxSum(vector<int> arr);
int main() {
vector<int> arr1 = {1,2,3,4,5};
miniMaxSum(arr1);
vector<int> arr2 = {396285104, 573261094, 759641832, 819230764, 364801279};
miniMaxSum(arr2);
return 0;
}
/**
* Calculate minimum and maximum sum of 4 integers from a vector
* Should be for vector size of 5 but works with all sizes
*/
void miniMaxSum(vector<int> arr) {
long max = 0, min = INT64_MAX;
long sum = 0;
int len = arr.size();
for (int i = 0; i < len; i++) {
for (int j = i; j < (i + 4); j++) {
sum += arr[((j % len) + len) % len];
}
max = (sum > max)?(sum):(max);
min = (sum < min)?(sum):(min);
sum = 0;
}
cout << min << " " << max << endl;
}
| 22.461538 | 79 | 0.554795 | cosmicraccoon |
fbf4da4195b971bab3ced48a59650ed1409c4af5 | 2,460 | cpp | C++ | src/gmail/errors/ErrorsErrorInfo.cpp | Vadimatorik/googleQt | 814ad6f695bb8e88d6a773e69fb8c188febaab00 | [
"MIT"
] | 24 | 2016-12-03T09:12:43.000Z | 2022-03-29T19:51:48.000Z | src/gmail/errors/ErrorsErrorInfo.cpp | Vadimatorik/googleQt | 814ad6f695bb8e88d6a773e69fb8c188febaab00 | [
"MIT"
] | 4 | 2016-12-03T09:14:42.000Z | 2022-03-29T22:02:21.000Z | src/gmail/errors/ErrorsErrorInfo.cpp | Vadimatorik/googleQt | 814ad6f695bb8e88d6a773e69fb8c188febaab00 | [
"MIT"
] | 7 | 2018-01-01T09:14:10.000Z | 2022-03-29T21:50:11.000Z | /**********************************************************
DO NOT EDIT
This file was generated from stone specification "errors"
Part of "Ardi - the organizer" project.
osoft4ardi@gmail.com
www.prokarpaty.net
***********************************************************/
#include "gmail/errors/ErrorsErrorInfo.h"
using namespace googleQt;
namespace googleQt{
namespace errors{
///ErrorInfo
ErrorInfo::operator QJsonObject()const{
QJsonObject js;
this->toJson(js);
return js;
}
void ErrorInfo::toJson(QJsonObject& js)const{
js["errors"] = struct_list2jsonarray(m_errors);
js["code"] = QString("%1").arg(m_code);
if(!m_message.isEmpty())
js["message"] = QString(m_message);
}
void ErrorInfo::fromJson(const QJsonObject& js){
jsonarray2struct_list(js["errors"].toArray(), m_errors);
m_code = js["code"].toVariant().toString().toULongLong();
m_message = js["message"].toString();
}
QString ErrorInfo::toString(bool multiline)const
{
QJsonObject js;
toJson(js);
QJsonDocument doc(js);
QString s(doc.toJson(multiline ? QJsonDocument::Indented : QJsonDocument::Compact));
return s;
}
std::unique_ptr<ErrorInfo> ErrorInfo::factory::create(const QByteArray& data)
{
QJsonDocument doc = QJsonDocument::fromJson(data);
QJsonObject js = doc.object();
return create(js);
}
std::unique_ptr<ErrorInfo> ErrorInfo::factory::create(const QJsonObject& js)
{
std::unique_ptr<ErrorInfo> rv;
rv = std::unique_ptr<ErrorInfo>(new ErrorInfo);
rv->fromJson(js);
return rv;
}
#ifdef API_QT_AUTOTEST
std::unique_ptr<ErrorInfo> ErrorInfo::EXAMPLE(int context_index, int parent_context_index){
Q_UNUSED(context_index);
Q_UNUSED(parent_context_index);
static int example_idx = 0;
example_idx++;
std::unique_ptr<ErrorInfo> rv(new ErrorInfo);
std::vector<errors::ErrorPart> list_of_errors;
for(int i = 0; i < 5; i++){
errors::ErrorPart p = *(errors::ErrorPart::EXAMPLE(i, context_index).get());
ApiAutotest::INSTANCE().prepareAutoTestObj("errors::ErrorInfo", "errors::ErrorPart", &p, i, context_index);
rv->m_errors.push_back(p);
}
rv->m_code = ApiAutotest::INSTANCE().getInt("errors::ErrorInfo", "m_code", 2 + example_idx);
rv->m_message = ApiAutotest::INSTANCE().getString("errors::ErrorInfo", "m_message", QString("message_%1").arg(example_idx));
return rv;
}
#endif //API_QT_AUTOTEST
}//errors
}//googleQt
| 28.604651 | 128 | 0.662602 | Vadimatorik |
fbf720108d6eecac8dde98a078834605d0b3e9c3 | 21,560 | cpp | C++ | CalculatePIChudnovsky.cpp | grevutiu-gabriel/calcpi-code | 4e2cbb9fbeeb8ed54167ee5f98e09ba34c2fa730 | [
"MIT"
] | null | null | null | CalculatePIChudnovsky.cpp | grevutiu-gabriel/calcpi-code | 4e2cbb9fbeeb8ed54167ee5f98e09ba34c2fa730 | [
"MIT"
] | null | null | null | CalculatePIChudnovsky.cpp | grevutiu-gabriel/calcpi-code | 4e2cbb9fbeeb8ed54167ee5f98e09ba34c2fa730 | [
"MIT"
] | null | null | null | /* Pi computation using Chudnovsky's algorithm.
* Copyright 2002, 2005 Hanhong Xue (macroxue at yahoo dot com)
* Slightly modified 2005 by Torbjorn Granlund to allow more than 2G
digits to be computed.
* Slightly adjusted to this framework and C++-ified by Roman Hiestand.
* 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 AUTHORS ``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 AUTHORS 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 "CommonIncludes.h"
#include "CalculatePIChudnovsky.h"
#include "ProgressIndicatorInterface.h"
const double CalculatePIChudnovsky::progressBSFactor_ = 0.8;
const int CalculatePIChudnovsky::progressDiv_ = 85;
const int CalculatePIChudnovsky::progressMul_ = 90;
const wxString CalculatePIChudnovsky::algoName_ = wxT("PI: Chudnovsky (GMP)");
const wxString CalculatePIChudnovsky::algoDescr_ = wxT("Calculates PI using the Chudnovsky algorithm based on GMP/MPIR.");
const wxString CalculatePIChudnovsky::copyrightText_ = wxT("Pi computation using Chudnovsky's algorithm.\n") \
wxT("\n") \
wxT(" * Copyright 2002, 2005 Hanhong Xue (macroxue at yahoo dot com)\n") \
wxT("\n") \
wxT(" * Slightly modified 2005 by Torbjorn Granlund to allow more than 2G\n") \
wxT(" digits to be computed.\n") \
wxT("\n") \
wxT(" * Slightly adjusted to this framework and C++-ified 2013 by Roman Hiestand.\n") \
wxT("\n") \
wxT(" * Redistribution and use in source and binary forms, with or without\n") \
wxT(" * modification, are permitted provided that the following conditions are met:\n") \
wxT(" * 1. Redistributions of source code must retain the above copyright notice,\n") \
wxT(" * this list of conditions and the following disclaimer.\n") \
wxT(" * 2. Redistributions in binary form must reproduce the above copyright notice,\n") \
wxT(" * this list of conditions and the following disclaimer in the documentation\n") \
wxT(" * and/or other materials provided with the distribution.\n") \
wxT(" *\n") \
wxT(" * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR\n") \
wxT(" * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n") \
wxT(" * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n") \
wxT(" * EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n") \
wxT(" * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n") \
wxT(" * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n") \
wxT(" * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n") \
wxT(" * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n") \
wxT(" * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n") \
wxT(" * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.");
// TODO: Find out actual limit
const std::string CalculatePIChudnovsky::maxNumberOfDigits_ = "1000000000000";
CalculatePIChudnovsky::CalculatePIChudnovsky() :
pProgressIndicatorInterface_(NULL)
{
}
CalculatePIChudnovsky::~CalculatePIChudnovsky()
{
}
bool CalculatePIChudnovsky::isMulticoreCapable()
{
return false;
}
bool CalculatePIChudnovsky::enableProgressBar()
{
return true;
}
const std::string &CalculatePIChudnovsky::getMaxNumberOfDigits()
{
return maxNumberOfDigits_;
}
const wxString &CalculatePIChudnovsky::getAlgorithmName()
{
return algoName_;
}
const wxString &CalculatePIChudnovsky::getAlgorithmDescription()
{
return algoDescr_;
}
const wxString &CalculatePIChudnovsky::getCopyrightText()
{
return copyrightText_;
}
void CalculatePIChudnovsky::setDigits(const wxString &digits)
{
digits_ = digits;
}
void CalculatePIChudnovsky::setCores(int c)
{
// Don't do anything: This Calculator is not multithreaded
}
#define A 13591409
#define B 545140134
#define C 640320
#define D 12
#define BITS_PER_DIGIT 3.32192809488736234787
#define DIGITS_PER_ITER 14.1816474627254776555
#define DOUBLE_PREC 53
#ifdef __GNUC__
#define inline __inline__
#endif
#if CHECK_MEMUSAGE
#undef CHECK_MEMUSAGE
#define CHECK_MEMUSAGE \
do { \
char buf[100]; \
snprintf (buf, 100, \
"ps aguxw | grep '[%c]%s'", prog_name[0], prog_name+1); \
system (buf); \
} while (0)
#else
#undef CHECK_MEMUSAGE
#define CHECK_MEMUSAGE (0);
#endif
/* Return user CPU time measured in milliseconds. */
#if !defined (__sun) \
&& (defined (USG) || defined (__SVR4) || defined (_UNICOS) \
|| defined (__hpux))
int
cputime ()
{
return (int) ((double) clock () * 1000 / CLOCKS_PER_SEC);
}
#else
/*
#include <sys/types.h>
#include <sys/time.h>
#include <sys/resource.h>
int
cputime ()
{
struct rusage rus;
getrusage (0, &rus);
return rus.ru_utime.tv_sec * 1000 + rus.ru_utime.tv_usec / 1000;
}*/
int cputime() { return 0; }
#endif
/*///////////////////////////////////////////////////////////////////////////*/
/* r = sqrt(x) */
void CalculatePIChudnovsky::my_sqrt_ui(mpf_t r, unsigned long x)
{
unsigned long prec, bits, prec0;
prec0 = mpf_get_prec(r);
if (prec0<=DOUBLE_PREC) {
mpf_set_d(r, std::sqrt(static_cast<double>(x)));
return;
}
bits = 0;
for (prec=prec0; prec>DOUBLE_PREC;)
{
int bit = prec&1;
prec = (prec+bit)/2;
bits = bits*2+bit;
}
mpf_set_prec_raw(t1, DOUBLE_PREC);
mpf_set_d(t1, 1./std::sqrt(static_cast<double>(x)));
while (prec<prec0)
{
prec *=2;
if (prec<prec0)
{
/* t1 = t1+t1*(1-x*t1*t1)/2; */
mpf_set_prec_raw(t2, prec);
mpf_mul(t2, t1, t1); /* half x half -> full */
mpf_mul_ui(t2, t2, x);
mpf_ui_sub(t2, 1, t2);
mpf_set_prec_raw(t2, prec/2);
mpf_div_2exp(t2, t2, 1);
mpf_mul(t2, t2, t1); /* half x half -> half */
mpf_set_prec_raw(t1, prec);
mpf_add(t1, t1, t2);
}
else
{
break;
}
prec -= (bits&1);
bits /=2;
}
/* t2=x*t1, t1 = t2+t1*(x-t2*t2)/2; */
mpf_set_prec_raw(t2, prec0/2);
mpf_mul_ui(t2, t1, x);
mpf_mul(r, t2, t2); /* half x half -> full */
mpf_ui_sub(r, x, r);
mpf_mul(t1, t1, r); /* half x half -> half */
mpf_div_2exp(t1, t1, 1);
mpf_add(r, t1, t2);
}
/* r = y/x WARNING: r cannot be the same as y. */
#if __GMP_MP_RELEASE >= 50001
#define my_div mpf_div
#else
void CalculatePIChudnovsky::my_div(mpf_t r, mpf_t y, mpf_t x)
{
unsigned long prec, bits, prec0;
prec0 = mpf_get_prec(r);
if (prec0<=DOUBLE_PREC) {
mpf_set_d(r, mpf_get_d(y)/mpf_get_d(x));
return;
}
bits = 0;
for (prec=prec0; prec>DOUBLE_PREC;) {
int bit = prec&1;
prec = (prec+bit)/2;
bits = bits*2+bit;
}
mpf_set_prec_raw(t1, DOUBLE_PREC);
mpf_ui_div(t1, 1, x);
while (prec<prec0) {
prec *=2;
if (prec<prec0) {
/* t1 = t1+t1*(1-x*t1); */
mpf_set_prec_raw(t2, prec);
mpf_mul(t2, x, t1); /* full x half -> full */
mpf_ui_sub(t2, 1, t2);
mpf_set_prec_raw(t2, prec/2);
mpf_mul(t2, t2, t1); /* half x half -> half */
mpf_set_prec_raw(t1, prec);
mpf_add(t1, t1, t2);
} else {
prec = prec0;
/* t2=y*t1, t1 = t2+t1*(y-x*t2); */
mpf_set_prec_raw(t2, prec/2);
mpf_mul(t2, t1, y); /* half x half -> half */
mpf_mul(r, x, t2); /* full x half -> full */
mpf_sub(r, y, r);
mpf_mul(t1, t1, r); /* half x half -> half */
mpf_add(r, t1, t2);
break;
}
prec -= (bits&1);
bits /=2;
}
}
#endif
/*///////////////////////////////////////////////////////////////////////////*/
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)>(y)?(x):(y))
#define INIT_FACS 32
void CalculatePIChudnovsky::fac_show(CalculatePIChudnovsky::fac_t f)
{
/* unsigned long int i;
for (i=0; i<f[0].num_facs; i++)
if (f[0].pow[i]==1)
printf("%ld ", f[0].fac[i]);
else
printf("%ld^%ld ", f[0].fac[i], f[0].pow[i]);
printf("\n");*/
}
inline void fac_reset(CalculatePIChudnovsky::fac_t f)
{
f[0].num_facs = 0;
}
inline void fac_init_size(CalculatePIChudnovsky::fac_t f, long int s)
{
if (s<INIT_FACS)
s=INIT_FACS;
f[0].fac = (unsigned long *)malloc(s*sizeof(unsigned long)*2);
f[0].pow = f[0].fac + s;
f[0].max_facs = s;
fac_reset(f);
}
inline void
fac_init(CalculatePIChudnovsky::fac_t f)
{
fac_init_size(f, INIT_FACS);
}
inline void
fac_clear(CalculatePIChudnovsky::fac_t f)
{
free(f[0].fac);
}
inline void
fac_resize(CalculatePIChudnovsky::fac_t f, unsigned long int s)
{
if (f[0].max_facs < s) {
fac_clear(f);
fac_init_size(f, s);
}
}
/* f = base^pow */
inline void
fac_set_bp(CalculatePIChudnovsky::fac_t f, unsigned long base, long int pow, CalculatePIChudnovsky::sieve_t *sieve, unsigned long int sieve_size)
{
unsigned long int i;
assert(base<sieve_size);
for (i=0, base/=2; base>0; i++, base = sieve[base].nxt) {
f[0].fac[i] = sieve[base].fac;
f[0].pow[i] = sieve[base].pow*pow;
}
f[0].num_facs = i;
assert(i<=f[0].max_facs);
}
/* r = f*g */
inline void
fac_mul2(CalculatePIChudnovsky::fac_t r, CalculatePIChudnovsky::fac_t f, CalculatePIChudnovsky::fac_t g)
{
unsigned long int i, j, k;
for (i=j=k=0; i<f[0].num_facs && j<g[0].num_facs; k++) {
if (f[0].fac[i] == g[0].fac[j]) {
r[0].fac[k] = f[0].fac[i];
r[0].pow[k] = f[0].pow[i] + g[0].pow[j];
i++; j++;
} else if (f[0].fac[i] < g[0].fac[j]) {
r[0].fac[k] = f[0].fac[i];
r[0].pow[k] = f[0].pow[i];
i++;
} else {
r[0].fac[k] = g[0].fac[j];
r[0].pow[k] = g[0].pow[j];
j++;
}
}
for (; i<f[0].num_facs; i++, k++) {
r[0].fac[k] = f[0].fac[i];
r[0].pow[k] = f[0].pow[i];
}
for (; j<g[0].num_facs; j++, k++) {
r[0].fac[k] = g[0].fac[j];
r[0].pow[k] = g[0].pow[j];
}
r[0].num_facs = k;
assert(k<=r[0].max_facs);
}
CalculatePIChudnovsky::fac_t ftmp, fmul;
/* f *= g */
inline void
fac_mul(CalculatePIChudnovsky::fac_t f, CalculatePIChudnovsky::fac_t g)
{
CalculatePIChudnovsky::fac_t tmp;
fac_resize(fmul, f[0].num_facs + g[0].num_facs);
fac_mul2(fmul, f, g);
tmp[0] = f[0];
f[0] = fmul[0];
fmul[0] = tmp[0];
}
/* f *= base^pow */
inline void
fac_mul_bp(CalculatePIChudnovsky::fac_t f, unsigned long base, unsigned long pow, CalculatePIChudnovsky::sieve_t *sieve, unsigned long int sieve_size)
{
fac_set_bp(ftmp, base, pow, sieve, sieve_size);
fac_mul(f, ftmp);
}
/* remove factors of power 0 */
inline void
fac_compact(CalculatePIChudnovsky::fac_t f)
{
unsigned long int i, j;
for (i=0, j=0; i<f[0].num_facs; i++) {
if (f[0].pow[i]>0) {
if (j<i) {
f[0].fac[j] = f[0].fac[i];
f[0].pow[j] = f[0].pow[i];
}
j++;
}
}
f[0].num_facs = j;
}
/* convert factorized form to number */
void CalculatePIChudnovsky::bs_mul(mpz_t r, long int a, long int b)
{
long int i;
if (b-a<=32) {
mpz_set_ui(r, 1);
for (i=a; i<b; i++)
for (unsigned long int j=0; j<fmul[0].pow[i]; j++)
mpz_mul_ui(r, r, fmul[0].fac[i]);
} else {
mpz_t r2;
mpz_init(r2);
bs_mul(r2, a, (a+b)/2);
bs_mul(r, (a+b)/2, b);
mpz_mul(r, r, r2);
mpz_clear(r2);
}
}
#if HAVE_DIVEXACT_PREINV
void mpz_invert_mod_2exp (mpz_ptr, mpz_srcptr);
void mpz_divexact_pre (mpz_ptr, mpz_srcptr, mpz_srcptr, mpz_srcptr);
#endif
/* f /= gcd(f,g), g /= gcd(f,g) */
void CalculatePIChudnovsky::fac_remove_gcd(mpz_t p, fac_t fp, mpz_t g, fac_t fg)
{
unsigned long int i, j, k, c;
fac_resize(fmul, min(fp->num_facs, fg->num_facs));
for (i=j=k=0; i<fp->num_facs && j<fg->num_facs; ) {
if (fp->fac[i] == fg->fac[j]) {
c = min(fp->pow[i], fg->pow[j]);
fp->pow[i] -= c;
fg->pow[j] -= c;
fmul->fac[k] = fp->fac[i];
fmul->pow[k] = c;
i++; j++; k++;
} else if (fp->fac[i] < fg->fac[j]) {
i++;
} else {
j++;
}
}
fmul->num_facs = k;
assert(k <= fmul->max_facs);
if (fmul->num_facs) {
bs_mul(gcd, 0, fmul->num_facs);
#if HAVE_DIVEXACT_PREINV
mpz_invert_mod_2exp (mgcd, gcd);
mpz_divexact_pre (p, p, gcd, mgcd);
mpz_divexact_pre (g, g, gcd, mgcd);
#else
#define SIZ(x) x->_mp_size
mpz_divexact(p, p, gcd);
mpz_divexact(g, g, gcd);
#endif
fac_compact(fp);
fac_compact(fg);
}
}
/*///////////////////////////////////////////////////////////////////////////*/
#define p1 (pstack[top])
#define q1 (qstack[top])
#define g1 (gstack[top])
#define fp1 (fpstack[top])
#define fg1 (fgstack[top])
#define p2 (pstack[top+1])
#define q2 (qstack[top+1])
#define g2 (gstack[top+1])
#define fp2 (fpstack[top+1])
#define fg2 (fgstack[top+1])
/* binary splitting */
void CalculatePIChudnovsky::bs(unsigned long a, unsigned long b, unsigned gflag, long int level)
{
unsigned long i, mid;
int ccc;
if (b-a==1) {
/*
g(b-1,b) = (6b-5)(2b-1)(6b-1)
p(b-1,b) = b^3 * C^3 / 24
q(b-1,b) = (-1)^b*g(b-1,b)*(A+Bb).
*/
mpz_set_ui(p1, b);
mpz_mul_ui(p1, p1, b);
mpz_mul_ui(p1, p1, b);
mpz_mul_ui(p1, p1, (C/24)*(C/24));
mpz_mul_ui(p1, p1, C*24);
mpz_set_ui(g1, 2*b-1);
mpz_mul_ui(g1, g1, 6*b-1);
mpz_mul_ui(g1, g1, 6*b-5);
mpz_set_ui(q1, b);
mpz_mul_ui(q1, q1, B);
mpz_add_ui(q1, q1, A);
mpz_mul (q1, q1, g1);
if (b%2)
mpz_neg(q1, q1);
i=b;
while ((i&1)==0) i>>=1;
fac_set_bp(fp1, i, 3, sieve, sieve_size); /* b^3 */
fac_mul_bp(fp1, 3*5*23*29, 3, sieve, sieve_size);
fp1[0].pow[0]--;
fac_set_bp(fg1, 2*b-1, 1, sieve, sieve_size); /* 2b-1 */
fac_mul_bp(fg1, 6*b-1, 1, sieve, sieve_size); /* 6b-1 */
fac_mul_bp(fg1, 6*b-5, 1, sieve, sieve_size); /* 6b-5 */
updateProgressBS(static_cast<int>(static_cast<double>(b)/percent));
/* if (b>(int)(progress)) {
printf("."); fflush(stdout);
progress += percent*2;
}*/
} else {
/*
p(a,b) = p(a,m) * p(m,b)
g(a,b) = g(a,m) * g(m,b)
q(a,b) = q(a,m) * p(m,b) + q(m,b) * g(a,m)
*/
mid = a+(b-a)*0.5224; /* tuning parameter */
bs(a, mid, 1, level+1);
top++;
bs(mid, b, gflag, level+1);
top--;
// if (level == 0)
// puts ("");
ccc = level == 0;
if (ccc) CHECK_MEMUSAGE;
if (level>=4) { /* tuning parameter */
#if 0
long t = cputime();
#endif
fac_remove_gcd(p2, fp2, g1, fg1);
#if 0
gcd_time += cputime()-t;
#endif
}
if (ccc) CHECK_MEMUSAGE;
mpz_mul(p1, p1, p2);
if (ccc) CHECK_MEMUSAGE;
mpz_mul(q1, q1, p2);
if (ccc) CHECK_MEMUSAGE;
mpz_mul(q2, q2, g1);
if (ccc) CHECK_MEMUSAGE;
mpz_add(q1, q1, q2);
if (ccc) CHECK_MEMUSAGE;
fac_mul(fp1, fp2);
if (gflag) {
mpz_mul(g1, g1, g2);
fac_mul(fg1, fg2);
}
}
/*
if (out&2) {
printf("p(%ld,%ld)=",a,b); fac_show(fp1);
if (gflag)
printf("g(%ld,%ld)=",a,b); fac_show(fg1);
}*/
}
void build_sieve(long int n, CalculatePIChudnovsky::sieve_t *s)
{
long int m, i, j, k;
m = (long int)std::sqrt(static_cast<double>(n));
memset(s, 0, sizeof(CalculatePIChudnovsky::sieve_t)*n/2);
s[1/2].fac = 1;
s[1/2].pow = 1;
for (i=3; i<=n; i+=2) {
if (s[i/2].fac == 0) {
s[i/2].fac = i;
s[i/2].pow = 1;
if (i<=m) {
for (j=i*i, k=i/2; j<=n; j+=i+i, k++) {
if (s[j/2].fac==0) {
s[j/2].fac = i;
if (s[k].fac == i) {
s[j/2].pow = s[k].pow + 1;
s[j/2].nxt = s[k].nxt;
} else {
s[j/2].pow = 1;
s[j/2].nxt = k;
}
}
}
}
}
}
}
void CalculatePIChudnovsky::updateProgressBS(int progress)
{
updateProgress(static_cast<int>(progressBSFactor_ * static_cast<double>(progress)));
}
void CalculatePIChudnovsky::updateProgress(int progress)
{
if(pProgressIndicatorInterface_ != NULL)
pProgressIndicatorInterface_->updateProgress(progress);
}
void CalculatePIChudnovsky::calculate(ProgressIndicatorInterface *pProgressIndicatorInterface)
{
mpf_t pi, qi;
long long int d=100, i, depth=1, terms;
unsigned long psize, qsize;
long begin, mid0, mid1; //, mid2, mid3, mid4, end;
pProgressIndicatorInterface_ = pProgressIndicatorInterface;
out=0;
top = 0;
progress=0;
gcd_time = 0;
digits_.ToLongLong(&d);
terms = d/DIGITS_PER_ITER;
while ((1LL<<depth)<terms)
depth++;
depth++;
percent = terms/100.0;
// printf("#terms=%ld, depth=%ld\n", terms, depth);
begin = cputime();
// printf("sieve "); fflush(stdout);
sieve_size = max(3*5*23*29+1, terms*6);
sieve = (sieve_t *)malloc(sizeof(sieve_t)*sieve_size/2);
build_sieve(sieve_size, sieve);
mid0 = cputime();
// printf("time = %6.3f\n", (double)(mid0-begin)/1000);
/* allocate stacks */
pstack = (mpz_t *)malloc(sizeof(mpz_t)*depth);
qstack = (mpz_t *)malloc(sizeof(mpz_t)*depth);
gstack = (mpz_t *)malloc(sizeof(mpz_t)*depth);
fpstack = (fac_t *)malloc(sizeof(fac_t)*depth);
fgstack = (fac_t *)malloc(sizeof(fac_t)*depth);
for (i=0; i<depth; i++) {
mpz_init(pstack[i]);
mpz_init(qstack[i]);
mpz_init(gstack[i]);
fac_init(fpstack[i]);
fac_init(fgstack[i]);
}
mpz_init(gcd);
#if HAVE_DIVEXACT_PREINV
mpz_init(mgcd);
#endif
fac_init(ftmp);
fac_init(fmul);
/* begin binary splitting process */
if (terms<=0) {
mpz_set_ui(p2,1);
mpz_set_ui(q2,0);
mpz_set_ui(g2,1);
} else {
bs(0,terms,0,0);
}
mid1 = cputime();
// printf("\nbs time = %6.3f\n", (double)(mid1-mid0)/1000);
// printf(" gcd time = %6.3f\n", (double)(gcd_time)/1000);
/* printf("misc "); fflush(stdout); */
/* free some resources */
free(sieve);
#if HAVE_DIVEXACT_PREINV
mpz_clear(mgcd);
#endif
mpz_clear(gcd);
fac_clear(ftmp);
fac_clear(fmul);
for (i=1; i<depth; i++) {
mpz_clear(pstack[i]);
mpz_clear(qstack[i]);
mpz_clear(gstack[i]);
fac_clear(fpstack[i]);
fac_clear(fgstack[i]);
}
mpz_clear(gstack[0]);
fac_clear(fpstack[0]);
fac_clear(fgstack[0]);
free(gstack);
free(fpstack);
free(fgstack);
/* prepare to convert integers to floats */
mpf_set_default_prec((long int)(d*BITS_PER_DIGIT+16));
/*
p*(C/D)*sqrt(C)
pi = -----------------
(q+A*p)
*/
psize = mpz_sizeinbase(p1,10);
qsize = mpz_sizeinbase(q1,10);
mpz_addmul_ui(q1, p1, A);
mpz_mul_ui(p1, p1, C/D);
mpf_init(pi);
mpf_set_z(pi, p1);
mpz_clear(p1);
mpf_init(qi);
mpf_set_z(qi, q1);
mpz_clear(q1);
free(pstack);
free(qstack);
// mid2 = cputime();
/* printf("time = %6.3f\n", (double)(mid2-mid1)/1000); */
/* initialize temp float variables for sqrt & div */
mpf_init(t1);
mpf_init(t2);
/* mpf_set_prec_raw(t1, mpf_get_prec(pi)); */
/* final step */
// printf("div "); fflush(stdout);
my_div(qi, pi, qi);
// mid3 = cputime();
// printf("time = %6.3f\n", (double)(mid3-mid2)/1000);
updateProgress(progressDiv_);
// printf("sqrt "); fflush(stdout);
my_sqrt_ui(pi, C);
// mid4 = cputime();
// printf("time = %6.3f\n", (double)(mid4-mid3)/1000);
// printf("mul "); fflush(stdout);
mpf_mul(qi, qi, pi);
// end = cputime();
// printf("time = %6.3f\n", (double)(end-mid4)/1000);
updateProgress(progressMul_);
// printf("total time = %6.3f\n", (double)(end-begin)/1000);
// fflush(stdout);
// printf(" P size=%ld digits (%f)\n"
// " Q size=%ld digits (%f)\n",
// psize, (double)psize/d, qsize, (double)qsize/d);
/* output Pi and timing statistics */
/* if (out&1) {
printf("pi(0,%ld)=\n", terms);
mpf_out_str(stdout, 10, d+2, qi);
printf("\n");
}*/
// Convert to string
result_.resize(d+3);
// gmp_snprintf(&(result_[0]), d+2, "%.*Ff", d+2, qi);
mp_exp_t exponent = 0;
mpf_get_str(&(result_[1]), &exponent, 10, d+1, qi);
for(mp_exp_t i = 0; i < exponent; i++)
result_[i] = result_[i+1];
result_[exponent] = '.';
size_t length1 = result_.size();
size_t length2 = strlen(&(result_[0]));
result_.resize(d+2);
/* free float resources */
mpf_clear(pi);
mpf_clear(qi);
mpf_clear(t1);
mpf_clear(t2);
pProgressIndicatorInterface_ = NULL;
}
| 25.975904 | 151 | 0.594573 | grevutiu-gabriel |
fbf90592be1f53883bb92c67228c0a20b858c2dd | 448 | cpp | C++ | vector/local.cpp | learnMachining/cplus2test | 8cc0048627724bb967f27d5cd9860dbb5804a7d9 | [
"Apache-2.0"
] | null | null | null | vector/local.cpp | learnMachining/cplus2test | 8cc0048627724bb967f27d5cd9860dbb5804a7d9 | [
"Apache-2.0"
] | null | null | null | vector/local.cpp | learnMachining/cplus2test | 8cc0048627724bb967f27d5cd9860dbb5804a7d9 | [
"Apache-2.0"
] | null | null | null | #include<iostream>
#include<vector>
using namespace std;
vector<int>& local(int tail){
vector<int> ret;
ret.push_back(tail);
return ret;
}
void local2(vector<int>& ret){
vector<int> tmp;
tmp.push_back(100);
ret=tmp;
}
int main(){
vector<int> ret = local(3);
for(int i=0;i<ret.size();i++){
cout<<ret[i]<<"\t";
}
cout<<endl;
vector<int> ret2;
local2(ret2);
for(int i=0;i<ret2.size();i++){
cout<<ret2[i]<<"\t";
}
cout<<endl;
}
| 14 | 32 | 0.616071 | learnMachining |
220207339b9b1875c3927fda39ba5bc6bbba2e41 | 252 | cpp | C++ | Exercicios/Exercicios C - Uri #2/1142.cpp | yunger7/SENAI | 85093e0ce3ed83e50dcd570d7c42b1dda4111929 | [
"MIT"
] | 1 | 2020-09-07T12:19:27.000Z | 2020-09-07T12:19:27.000Z | Exercicios/Exercicios C - Uri #2/1142.cpp | yunger7/SENAI | 85093e0ce3ed83e50dcd570d7c42b1dda4111929 | [
"MIT"
] | null | null | null | Exercicios/Exercicios C - Uri #2/1142.cpp | yunger7/SENAI | 85093e0ce3ed83e50dcd570d7c42b1dda4111929 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
int n, cont, cont2=1;
scanf("%d",&n);
for(cont=1; cont <= n; cont++){
for(int c=1; c <= 3; c++){
printf("%d ",cont2);
cont2++;
}
printf("PUM\n");
cont2++;
}
return 0;
}
| 11.454545 | 32 | 0.503968 | yunger7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.