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
sequencelengths 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
sequencelengths 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
sequencelengths 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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b45ea979df345cf23b7c7ea1ed0cd6a130dd70c5 | 7,239 | hpp | C++ | include/lapack/lahqr_schur22.hpp | thijssteel/tlapack | 0749324fdecfc80c089d58d8d43500b66a20df70 | [
"BSD-3-Clause"
] | null | null | null | include/lapack/lahqr_schur22.hpp | thijssteel/tlapack | 0749324fdecfc80c089d58d8d43500b66a20df70 | [
"BSD-3-Clause"
] | null | null | null | include/lapack/lahqr_schur22.hpp | thijssteel/tlapack | 0749324fdecfc80c089d58d8d43500b66a20df70 | [
"BSD-3-Clause"
] | null | null | null | /// @file lahqr_schur22.hpp
/// @author Thijs Steel, KU Leuven, Belgium
/// Adapted from @see https://github.com/Reference-LAPACK/lapack/tree/master/SRC/dlanv2.f
//
// Copyright (c) 2013-2022, University of Colorado Denver. All rights reserved.
//
// This file is part of <T>LAPACK.
// <T>LAPACK is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.
#ifndef __LAHQR_SCHUR22_HH__
#define __LAHQR_SCHUR22_HH__
#include <complex>
#include <cmath>
#include "lapack/utils.hpp"
#include "lapack/types.hpp"
namespace lapack
{
/** Computes the Schur factorization of a 2x2 matrix A
*
* A = [a b] = [cs -sn] [aa bb] [ cs sn]
* [c d] [sn cs] [cc dd] [-sn cs]
*
* This routine is designed for real matrices.
* If the template T is complex, it returns with error
* and does nothing. (This is so we don't need c++17's static if
* but still keep the code somewhat clean).
*
* @return 0 if the template T is real
* @return -1 if the template T is complex
*
* @param[in,out] a scalar, A(0,0).
* @param[in,out] b scalar, A(0,1).
* @param[in,out] c scalar, A(1,0).
* @param[in,out] d scalar, A(1,1).
* On entry, the elements of the matrix A.
* On exit, the elements of the Schur factor (aa, bb, cc and dd).
* @param[out] s1 complex scalar.
* First eigenvalue of the matrix.
* @param[out] s2 complex scalar.
* Second eigenvalue of the matrix.
* @param[out] cs scalar.
* Cosine factor of the rotation
* @param[out] sn scalar.
* Sine factor of the rotation
*
* @ingroup geev
*/
template <
typename T,
enable_if_t<!is_complex<T>::value, bool> = true>
int lahqr_schur22(T &a, T &b, T &c, T &d, std::complex<T> &s1, std::complex<T> &s2, T &cs, T &sn)
{
using blas::abs;
using std::log;
using std::max;
using std::min;
using std::pow;
using std::copysign;
const T zero(0);
const T half(0.5);
const T one(1);
const T two(2);
const T multpl(4);
const T eps = blas::uroundoff<T>();
const T safmin = blas::safe_min<T>();
const T safmn2 = pow(two, (int)(log(safmin / eps) / log(two)) / two);
const T safmx2 = one / safmn2;
if (c == zero)
{
// c is zero, the matrix is already in Schur form.
cs = one;
sn = zero;
}
else if (b == zero)
{
// b is zero, swapping rows and columns results in Schur form.
cs = zero;
sn = one;
auto temp = d;
d = a;
a = temp;
b = -c;
c = zero;
}
else if ((a - d) == zero and copysign(one,b) != copysign(one,c))
{
cs = one;
sn = zero;
}
else
{
auto temp = a - d;
auto p = half * temp;
auto bcmax = max(abs(b), abs(c));
auto bcmin = min(abs(b), abs(c)) * copysign(one,b) * copysign(one,c);
auto scale = max(abs(p), bcmax);
auto z = (p / scale) * p + (bcmax / scale) * bcmin;
// if z is positive, we should have real eigenvalues
// however, is z is very small, but positive, we postpone the decision
if (z >= multpl * eps)
{
// Real eigenvalues.
// Compute a and d.
z = p + copysign(one,p) * sqrt(scale) * sqrt(z);
a = d + z;
d = d - (bcmax / z) * bcmin;
// Compute b and the rotation matrix
auto tau = lapy2(c, z);
cs = z / tau;
sn = c / tau;
b = b - c;
c = zero;
}
else
{
// Complex eigenvalues, or real (almost) equal eigenvalues.
// Make diagonal elements equal.
auto sigma = b + c;
for (int count = 0; count < 20; ++count)
{
scale = max(abs(temp), abs(sigma));
if (scale >= safmx2)
{
sigma = sigma * safmn2;
temp = temp * safmn2;
continue;
}
if (scale <= safmn2)
{
sigma = sigma * safmx2;
temp = temp * safmx2;
continue;
}
break;
}
p = half * temp;
auto tau = lapy2(sigma, temp);
cs = sqrt(half * (one + abs(sigma) / tau));
sn = -(p / (tau * cs)) * copysign(one,sigma);
//
// Compute [aa bb] = [a b][cs -sn]
// [cc dd] = [c d][sn cs]
//
auto aa = a * cs + b * sn;
auto bb = -a * sn + b * cs;
auto cc = c * cs + d * sn;
auto dd = -c * sn + d * cs;
//
// Compute [a b] = [ cs sn][aa bb]
// [c d] = [-sn cs][cc dd]
//
a = aa * cs + cc * sn;
b = bb * cs + dd * sn;
c = -aa * sn + cc * cs;
d = -bb * sn + dd * cs;
temp = half * (a + d);
a = temp;
d = temp;
if (c != zero)
{
if (b != zero)
{
if (copysign(one,b) == copysign(one,c))
{
// Real eigenvalues: reduce to upper triangular form
auto sab = sqrt(abs(b));
auto sac = sqrt(abs(c));
p = abs(c) * copysign(one,sab * sac);
tau = one / sqrt(abs(b + c));
a = temp + p;
d = temp - p;
b = b - c;
c = zero;
auto cs1 = sab * tau;
auto sn1 = sac * tau;
temp = cs * cs1 - sn * sn1;
sn = cs * sn1 + sn * cs1;
cs = temp;
}
}
}
}
}
// Store eigenvalues in s1 and s2
if (c != zero)
{
auto temp = sqrt(abs(b)) * sqrt(abs(c));
s1 = std::complex<T>(a, temp);
s2 = std::complex<T>(d, -temp);
}
else
{
s1 = a;
s2 = d;
}
return 0;
}
template <
typename T,
enable_if_t<is_complex<T>::value, bool> = true>
int lahqr_schur22(T &a, T &b, T &c, T &d, T &s1, T &s2, real_type<T> &cs, T &sn)
{
return -1;
}
} // lapack
#endif // __LAHQR_SCHUR22_HH__
| 32.461883 | 101 | 0.407377 | thijssteel |
b45f0016f7e0a1abeecc609efcacdbc8583a2e51 | 14,504 | cpp | C++ | src/Core/ECEditorModule/AssetsWindow.cpp | Adminotech/tundra | 8270097dbf79c3ec1935cf66c7979eeef9c24c0e | [
"Apache-2.0"
] | null | null | null | src/Core/ECEditorModule/AssetsWindow.cpp | Adminotech/tundra | 8270097dbf79c3ec1935cf66c7979eeef9c24c0e | [
"Apache-2.0"
] | null | null | null | src/Core/ECEditorModule/AssetsWindow.cpp | Adminotech/tundra | 8270097dbf79c3ec1935cf66c7979eeef9c24c0e | [
"Apache-2.0"
] | null | null | null | /**
For conditions of distribution and use, see copyright notice in LICENSE
@file AssetsWindow.cpp
@brief The main UI for managing asset storages and assets. */
#include "StableHeaders.h"
#include "DebugOperatorNew.h"
#include "AssetsWindow.h"
#include "AssetTreeWidget.h"
#include "TreeWidgetUtils.h"
#include "SceneTreeWidgetItems.h"
#include "Framework.h"
#include "AssetAPI.h"
#include "IAsset.h"
#include "IAssetBundle.h"
#include "IAssetStorage.h"
#include "UiAPI.h"
#include "Profiler.h"
#include "MemoryLeakCheck.h"
namespace
{
bool HasSameRefAsPredecessors(QTreeWidgetItem *item)
{
QTreeWidgetItem *parent = 0, *child = item;
while((parent = child->parent()) != 0)
{
if (parent->text(0).compare(child->text(0), Qt::CaseInsensitive) == 0)
return true;
child = parent;
}
return false;
}
}
AssetsWindow::AssetsWindow(Framework *fw, QWidget *parent) :
QWidget(parent),
framework(fw),
noStorageItem(0)
{
Initialize();
PopulateTreeWidget();
}
AssetsWindow::AssetsWindow(const QString &assetType_, Framework *fw, QWidget *parent) :
QWidget(parent),
framework(fw),
noStorageItem(0),
assetType(assetType_)
{
Initialize();
PopulateTreeWidget();
// Asset picking layout
QSpacerItem *spacer = new QSpacerItem(20, 20, QSizePolicy::Expanding, QSizePolicy::Fixed);
QPushButton *cancelButton = new QPushButton(tr("Cancel"), this);
QPushButton *pickButton = new QPushButton(tr("Pick"), this);
QHBoxLayout *hlayout2= new QHBoxLayout;
hlayout2->insertSpacerItem(-1, spacer);
hlayout2->addWidget(pickButton);
hlayout2->addWidget(cancelButton);
static_cast<QVBoxLayout *>(layout())->addLayout(hlayout2);
connect(treeWidget, SIGNAL(currentItemChanged(QTreeWidgetItem *, QTreeWidgetItem *)), SLOT(ChangeSelectedAsset(QTreeWidgetItem *)));
connect(pickButton, SIGNAL(clicked()), SLOT(PickAssetAndClose()));
connect(cancelButton, SIGNAL(clicked()), SLOT(Cancel()));
}
AssetsWindow::~AssetsWindow()
{
// Disable ResizeToContents, Qt goes sometimes into eternal loop after
// ~AssetsWindow() if we have lots (hundreds or thousands) of items.
treeWidget->blockSignals(true);
treeWidget->header()->setResizeMode(QHeaderView::Interactive);
QTreeWidgetItemIterator it(treeWidget);
while(*it)
{
QTreeWidgetItem *item = *it;
SAFE_DELETE(item);
++it;
}
}
void AssetsWindow::PopulateTreeWidget()
{
PROFILE(AssetsWindow_PopulateTreeWidget)
treeWidget->clear();
alreadyAdded.clear();
// Create "No provider" for assets without storage.
SAFE_DELETE(noStorageItem);
noStorageItem = new QTreeWidgetItem();
noStorageItem->setText(0, tr("No Storage"));
// Iterate storages
CreateStorageItem(framework->Asset()->DefaultAssetStorage());
foreach(const AssetStoragePtr &storage, framework->Asset()->AssetStorages())
CreateStorageItem(storage);
// Iterate asset bundles
std::pair<QString, AssetBundlePtr> bundlePair;
foreach(bundlePair, framework->Asset()->AssetBundles())
AddBundle(bundlePair.second);
// Iterate assets
std::pair<QString, AssetPtr> pair;
foreach(pair, framework->Asset()->Assets())
AddAsset(pair.second);
// Add the no provider last and hide if no children.
treeWidget->addTopLevelItem(noStorageItem);
noStorageItem->setHidden(noStorageItem->childCount() == 0);
}
void AssetsWindow::AddAsset(const AssetPtr &asset)
{
PROFILE(AssetsWindow_AddAsset)
if (alreadyAdded.find(asset) != alreadyAdded.end())
return;
if (!assetType.isEmpty() && assetType != asset->Type())
return;
AssetItem *item = CreateAssetItem(asset);
if (!item)
return;
AddChildren(asset, item);
connect(asset.get(), SIGNAL(Loaded(AssetPtr)), SLOT(UpdateAssetItem(AssetPtr)), Qt::UniqueConnection);
connect(asset.get(), SIGNAL(Unloaded(IAsset *)), SLOT(UpdateAssetItem(IAsset *)), Qt::UniqueConnection);
connect(asset.get(), SIGNAL(PropertyStatusChanged(IAsset *)), SLOT(UpdateAssetItem(IAsset *)), Qt::UniqueConnection);
noStorageItem->setHidden(noStorageItem->childCount() == 0);
// If we have an ongoing search, make sure that the new item is compared too.
QString searchFilter = searchField->text().trimmed();
if (!searchFilter.isEmpty())
TreeWidgetSearch(treeWidget, 0, searchFilter);
}
void AssetsWindow::AddBundle(const AssetBundlePtr &bundle)
{
CreateBundleItem(bundle);
}
void AssetsWindow::RemoveAsset(AssetPtr asset)
{
QTreeWidgetItemIterator it(treeWidget);
while(*it)
{
AssetItem *item = dynamic_cast<AssetItem *>(*it);
if (item && item->Asset() && item->Asset() == asset)
{
QTreeWidgetItem *parent = item->parent();
parent->removeChild(item);
SAFE_DELETE(item);
alreadyAdded.erase(asset);
addedItemNames.erase(asset->Name());
}
++it;
}
}
void AssetsWindow::Search(const QString &filter)
{
TreeWidgetSearch(treeWidget, 0, filter);
}
void AssetsWindow::UpdateAssetItem(IAsset *asset)
{
QTreeWidgetItemIterator it(treeWidget);
while(*it)
{
AssetItem *item = dynamic_cast<AssetItem *>(*it);
if (item && item->Asset().get() == asset)
{
item->SetText(asset);
break;
}
++it;
}
}
void AssetsWindow::Initialize()
{
setWindowTitle(tr("Assets"));
// Append asset type if we're viewing only assets of specific type.
if (!assetType.isEmpty())
setWindowTitle(windowTitle() + ": " + assetType);
resize(450, 450);
QVBoxLayout *layout = new QVBoxLayout(this);
layout->setContentsMargins(5, 5, 5, 5);
setLayout(layout);
// Create child widgets
treeWidget = new AssetTreeWidget(framework, this);
treeWidget->setHeaderHidden(true);
searchField = new QLineEdit(this);
searchField->setPlaceholderText(tr("Search..."));
expandAndCollapseButton = new QPushButton(tr("Expand All"), this);
QHBoxLayout *hlayout= new QHBoxLayout;
hlayout->addWidget(searchField);
hlayout->addWidget(expandAndCollapseButton);
layout->addLayout(hlayout);
layout->addWidget(treeWidget);
connect(searchField, SIGNAL(textEdited(const QString &)), SLOT(Search(const QString &)));
connect(expandAndCollapseButton, SIGNAL(clicked()), SLOT(ExpandOrCollapseAll()));
connect(framework->Asset(), SIGNAL(AssetCreated(AssetPtr)), SLOT(AddAsset(AssetPtr)));
connect(framework->Asset(), SIGNAL(AssetAboutToBeRemoved(AssetPtr)), SLOT(RemoveAsset(AssetPtr)));
connect(treeWidget, SIGNAL(itemCollapsed(QTreeWidgetItem*)), SLOT(CheckTreeExpandStatus(QTreeWidgetItem*)));
connect(treeWidget, SIGNAL(itemExpanded(QTreeWidgetItem*)), SLOT(CheckTreeExpandStatus(QTreeWidgetItem*)));
connect(treeWidget, SIGNAL(itemDoubleClicked(QTreeWidgetItem*, int)), SLOT(OnItemDoubleClicked(QTreeWidgetItem*, int)));
}
void AssetsWindow::closeEvent(QCloseEvent *e)
{
emit AboutToClose(this);
QWidget::closeEvent(e);
}
void AssetsWindow::AddChildren(const AssetPtr &asset, QTreeWidgetItem *parent)
{
PROFILE(AssetsWindow_AddChildren)
foreach(const AssetReference &ref, asset->FindReferences())
{
AssetPtr asset = framework->Asset()->GetAsset(ref.ref);
if (asset && alreadyAdded.find(asset) == alreadyAdded.end())
{
AssetItem *item = new AssetItem(asset, parent);
parent->addChild(item);
alreadyAdded.insert(asset);
// Check for recursive dependencies.
if (HasSameRefAsPredecessors(item))
item->setText(0, tr("Recursive dependency to ") + asset->Name());
else
AddChildren(asset, item);
}
}
}
void AssetsWindow::ExpandOrCollapseAll()
{
treeWidget->blockSignals(true);
bool treeExpanded = TreeWidgetExpandOrCollapseAll(treeWidget);
treeWidget->blockSignals(false);
expandAndCollapseButton->setText(treeExpanded ? tr("Collapse All") : tr("Expand All"));
}
void AssetsWindow::CheckTreeExpandStatus(QTreeWidgetItem * /*item*/)
{
expandAndCollapseButton->setText(TreeWidgetIsAnyExpanded(treeWidget) ? tr("Collapse All") : tr("Expand All"));
}
void AssetsWindow::OnItemDoubleClicked(QTreeWidgetItem *item, int /*column*/)
{
AssetItem* assItem = dynamic_cast<AssetItem*>(item);
if (!assItem || !assItem->Asset())
return;
QMenu dummyMenu;
QList<QObject*> targets;
targets.push_back(assItem->Asset().get());
framework->Ui()->EmitContextMenuAboutToOpen(&dummyMenu, targets);
foreach(QAction *action, dummyMenu.actions())
if (action->text() == "Open")
{
action->activate(QAction::ActionEvent());
break;
}
}
void AssetsWindow::ChangeSelectedAsset(QTreeWidgetItem *current)
{
// Note: clause if <=1 cause for some reason when activating item for the first time
// treeWidget->selectedItems().size() returns 0, even though we should have 1.
if (treeWidget->selectedItems().size() <= 1 && current)
{
AssetItem *item = dynamic_cast<AssetItem *>(current);
if (item && item->Asset())
emit SelectedAssetChanged(item->Asset());
}
}
void AssetsWindow::PickAssetAndClose()
{
if (treeWidget->selectedItems().size() == 1)
{
AssetItem *item = dynamic_cast<AssetItem *>(treeWidget->currentItem());
if (item && item->Asset())
emit AssetPicked(item->Asset());
}
close();
}
void AssetsWindow::Cancel()
{
emit PickCanceled();
close();
}
AssetStorageItem *AssetsWindow::CreateStorageItem(const AssetStoragePtr &storage)
{
for (int i=0; i<treeWidget->topLevelItemCount(); ++i)
{
AssetStorageItem *existing = dynamic_cast<AssetStorageItem*>(treeWidget->topLevelItem(i));
if (existing && storage == existing->Storage())
return 0;
}
AssetStorageItem *item = new AssetStorageItem(storage);
treeWidget->addTopLevelItem(item);
if (storage == framework->Asset()->DefaultAssetStorage())
{
QFont font = item->font(0);
font.setBold(true);
item->setFont(0, font);
}
return item;
}
AssetBundleItem *AssetsWindow::CreateBundleItem(const AssetBundlePtr &bundle)
{
if (addedItemNames.find(bundle->Name()) != addedItemNames.end())
return 0;
// for (int i=0; i<treeWidget->topLevelItemCount(); ++i)
// if (FindBundleItemRecursive(treeWidget->topLevelItem(i), bundle))
// return 0;
addedItemNames.insert(bundle->Name());
QTreeWidgetItem *p = FindParentItem(bundle);
AssetBundleItem *item = new AssetBundleItem(bundle, p);
p->addChild(item);
return item;
}
AssetItem *AssetsWindow::CreateAssetItem(const AssetPtr &asset)
{
if (addedItemNames.find(asset->Name()) != addedItemNames.end())
return 0;
// for (int i=0; i<treeWidget->topLevelItemCount(); ++i)
// if (FindAssetItemRecursive(treeWidget->topLevelItem(i), asset))
// return 0;
addedItemNames.insert(asset->Name());
QTreeWidgetItem *p = FindParentItem(asset);
AssetItem *item = new AssetItem(asset, p);
p->addChild(item);
return item;
}
AssetBundleItem *AssetsWindow::FindBundleItemRecursive(QTreeWidgetItem *parent, const AssetBundlePtr &bundle)
{
PROFILE(AssetsWindow_FindBundleItemRecursive_bundle)
if (!parent || parent->childCount() == 0)
return 0;
AssetBundleItem *result = 0;
for (int i=0; i<parent->childCount(); ++i)
{
AssetBundleItem *existing = dynamic_cast<AssetBundleItem*>(parent->child(i));
if (existing && existing->AssetBundle() == bundle)
result = existing;
else
result = FindBundleItemRecursive(parent->child(i), bundle);
if (result)
break;
}
return result;
}
AssetBundleItem *AssetsWindow::FindBundleItemRecursive(QTreeWidgetItem *parent, const QString &subAssetRef)
{
PROFILE(AssetsWindow_FindBundleItemRecursive_subAssetRef)
if (!parent || parent->childCount() == 0)
return 0;
AssetBundleItem *result = 0;
for (int i=0; i<parent->childCount(); ++i)
{
AssetBundleItem *existing = dynamic_cast<AssetBundleItem*>(parent->child(i));
if (existing && existing->Contains(subAssetRef))
result = existing;
else
result = FindBundleItemRecursive(parent->child(i), subAssetRef);
if (result)
break;
}
return result;
}
AssetItem *AssetsWindow::FindAssetItemRecursive(QTreeWidgetItem *parent, const AssetPtr &asset)
{
PROFILE(AssetsWindow_FindAssetItemRecursive)
if (!parent || parent->childCount() == 0)
return 0;
AssetItem *result = 0;
for (int i=0; i<parent->childCount(); ++i)
{
AssetItem *existing = dynamic_cast<AssetItem*>(parent->child(i));
if (existing && existing->Asset() == asset)
result = existing;
else
result = FindAssetItemRecursive(parent->child(i), asset);
if (result)
break;
}
return result;
}
template <typename T>
QTreeWidgetItem *AssetsWindow::FindParentItem(const T &item)
{
PROFILE(AssetsWindow_FindParentItem)
QString subAssetPart;
AssetAPI::ParseAssetRef(item->Name(), 0, 0, 0, 0, 0, 0, 0, &subAssetPart);
for (int i=0; i<treeWidget->topLevelItemCount(); ++i)
{
AssetStorageItem *existingStorage = dynamic_cast<AssetStorageItem*>(treeWidget->topLevelItem(i));
if (existingStorage && existingStorage->Storage() == item->AssetStorage())
{
// If this is a sub asset to a bundle, find the bundle item from this storage.
if (!subAssetPart.isEmpty())
{
AssetBundleItem *existingBundle = FindBundleItemRecursive(existingStorage, item->Name());
if (existingBundle)
return existingBundle;
}
return existingStorage;
}
}
// If this is a sub asset to a bundle, try to find the bundle also from no storage item.
if (!subAssetPart.isEmpty())
{
AssetBundleItem *existingBundle = FindBundleItemRecursive(noStorageItem, item->Name());
if (existingBundle)
return existingBundle;
}
return noStorageItem;
}
| 31.462039 | 136 | 0.659887 | Adminotech |
b46a12b3489a9f0045f59d392b977b4437fc612b | 1,636 | hpp | C++ | src/parser_nodes/and_parser_node.hpp | lowlander/nederrock | aa23f79de3adf0510419208938bf4dcdbe786c9f | [
"MIT"
] | null | null | null | src/parser_nodes/and_parser_node.hpp | lowlander/nederrock | aa23f79de3adf0510419208938bf4dcdbe786c9f | [
"MIT"
] | null | null | null | src/parser_nodes/and_parser_node.hpp | lowlander/nederrock | aa23f79de3adf0510419208938bf4dcdbe786c9f | [
"MIT"
] | null | null | null | //
// Copyright (c) 2020 Erwin Rol <[email protected]>
//
// SPDX-License-Identifier: MIT
//
#ifndef NEDERROCK_SRC_AND_PARSER_NODE_HPP
#define NEDERROCK_SRC_AND_PARSER_NODE_HPP
#include "and_parser_node_pre.hpp"
#include "separator_parser_node_pre.hpp"
#include "equality_check_parser_node_pre.hpp"
#include "token_stream.hpp"
#include "scope_state.hpp"
#include <memory>
#include <istream>
#include <string>
#include <variant>
class And_Parser_Node {
public:
struct Choice_1 {
void dump(std::wostream& output) const;
void generate_cpp(Scope_State_Ptr state) const;
void collect_variables(Scope_State_Ptr state) const;
Equality_Check_Parser_Node_Ptr m_equality;
Separator_Parser_Node_Ptr m_separator_1;
std::wstring m_keyword;
Separator_Parser_Node_Ptr m_separator_2;
And_Parser_Node_Ptr m_and;
};
struct Choice_2 {
void dump(std::wostream& output) const;
void generate_cpp(Scope_State_Ptr state) const;
void collect_variables(Scope_State_Ptr state) const;
Equality_Check_Parser_Node_Ptr m_equality;
};
public:
And_Parser_Node(Choice_1&& choice);
And_Parser_Node(Choice_2&& choice);
static And_Parser_Node_Ptr parse_choice_1(Token_Stream& input);
static And_Parser_Node_Ptr parse_choice_2(Token_Stream& input);
static And_Parser_Node_Ptr parse(Token_Stream& input);
void dump(std::wostream& output) const;
void generate_cpp(Scope_State_Ptr state) const;
void collect_variables(Scope_State_Ptr state) const;
private:
std::variant<Choice_1, Choice_2> m_choice;
};
#endif // NEDERROCK_SRC_AND_PARSER_NODE_HPP
| 28.206897 | 65 | 0.762225 | lowlander |
b46b55e634ed4e6190b191941e67e4dc7bb06c37 | 5,496 | cpp | C++ | NewEditBox.cpp | yohshee/magenta | 6efec67106b2769dd7c6dde5f63343fc0ecd5f3a | [
"MIT"
] | null | null | null | NewEditBox.cpp | yohshee/magenta | 6efec67106b2769dd7c6dde5f63343fc0ecd5f3a | [
"MIT"
] | null | null | null | NewEditBox.cpp | yohshee/magenta | 6efec67106b2769dd7c6dde5f63343fc0ecd5f3a | [
"MIT"
] | null | null | null | // NewEditBox.cpp : implementation file
//
#include "stdafx.h"
#include "Magenta.h"
#include "Constants.h"
#include "Person.h"
#include "NewEditBox.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CNewEditBox
CNewEditBox::CNewEditBox()
{
// Basic initialization...
m_iSelStart = 0;
m_iSelLength = 0;
}
CNewEditBox::~CNewEditBox()
{
}
BEGIN_MESSAGE_MAP(CNewEditBox, CEdit)
//{{AFX_MSG_MAP(CNewEditBox)
ON_WM_KEYUP()
ON_WM_KEYDOWN()
ON_WM_CHAR()
ON_MESSAGE(WM_UNINITMENUPOPUP, OnUninitPopup)
//}}AFX_MSG_MAP
END_MESSAGE_MAP()
// Processes an autocomplete request.
void CNewEditBox::ProcessAutoComplete()
{
int i;
INT_PTR iCount = 0;
int iMatches = 0;
int iStart, iEnd, iMiddle;
CString szText;
CString szName, szItem, szTemp;
CPoint ptCursor;
GetSel(iStart, iMiddle); // Get the position of the cursor (considered to be iMiddle)
GetWindowText(szText); // Also grab ahold of the text in the window.
// Prepare the menu
if(m_mnuAuto.GetSafeHmenu() != NULL)
m_mnuAuto.DestroyMenu();
if(!m_mnuAuto.CreatePopupMenu()) {
AfxMessageBox(_T("Unable to generate menu for Tab Complete!"), MB_ICONSTOP | MB_OK);
return;
}
// Look for the start of the string.
if(iMiddle > 0)
iStart = FindRev(szText, " ", iMiddle - 1);
else
iStart = FindRev(szText, " ", 0);
if(iStart == -1)
iStart = 0;
iEnd = szText.Find(_T(" "), iMiddle + 1);
if(iEnd == -1)
iEnd = szText.GetLength();
SetSel(iStart, iEnd); // Cosmetic reasons.
szName = szText.Mid(iStart, iEnd - iStart); // Because MFC won't give us the selected text..><
if(szName.GetLength() > 0) {
//iCount = m_plstRegulars->GetCount();
iCount = m_pcolUsers->GetSize();
iMatches = 0;
m_pcsUsers->Lock();
//szName.MakeUpper();
for(i = 0; i < iCount; i++) {
szItem = ((CPerson*)m_pcolUsers->GetAt(i))->szName;
//m_plstRegulars->GetText(i, szItem);
szTemp = szItem;
//szTemp.MakeUpper();
if(szTemp.Left(szName.GetLength()).CompareNoCase(szName) == 0) {
// We matched. Add one, and add it to the list.
iMatches++;
if(iMatches <= MATCH_LIMIT) {
//m_plstOutput->AddString(szItem);
m_mnuAuto.AppendMenu(MF_STRING, ID_AUTO_BASE + iMatches, szItem);
}
}
}
m_pcsUsers->Unlock();
if(iMatches > 1) {
// Lock the text in the message textbox and let them choose a completion.
SetReadOnly(TRUE);
// Cache selection info
m_iSelStart = iStart;
m_iSelLength = iEnd - iStart;
// Get the insertion point position and popup the menu right where it is.
ptCursor = GetCaretPos();
ClientToScreen(&ptCursor);
m_mnuAuto.TrackPopupMenu(TPM_CENTERALIGN | TPM_LEFTBUTTON,
ptCursor.x, ptCursor.y, this);
}
else if(iMatches == 1) {
// Merely paste in the last item.
m_mnuAuto.GetMenuString(0, szItem, MF_BYPOSITION);
m_mnuAuto.DestroyMenu();
ReplaceSel(szItem);
}
// Fix the selection start.
GetWindowText(szText);
SetSel(szText.GetLength(), szText.GetLength());
}
}
// Searches for a substring starting at the end of a string.
int CNewEditBox::FindRev(CString szString, CString szFind, int iStart)
{
int iRet = -1;
int iPos, iLen;
// Reverse the strings...
szString.MakeReverse();
szFind.MakeReverse();
iLen = szString.GetLength();
iPos = szString.Find(szFind, iLen - iStart - 1);
if(iPos != -1)
iRet = szString.GetLength() - iPos - szFind.GetLength() + 1;
return iRet;
}
/////////////////////////////////////////////////////////////////////////////
// CNewEditBox message handlers
void CNewEditBox::OnKeyUp(UINT nChar, UINT nRepCnt, UINT nFlags)
{
switch(nChar) {
case VK_ESCAPE:
if(!m_bHadMenu) {
// We want to clear it.
SetWindowText(_T(""));
}
else {
m_bHadMenu = FALSE; // This flag only makes sense for this case, so far.
}
break;
case VK_TAB:
ProcessAutoComplete();
break;
default:
// Nothing to do...
break;
}
// Call default
CEdit::OnKeyUp(nChar, nRepCnt, nFlags);
}
void CNewEditBox::OnKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags)
{
// Doggone tabs! Don't process unless I say so!
if(nChar != VK_TAB)
CEdit::OnKeyDown(nChar, nRepCnt, nFlags);
}
void CNewEditBox::OnChar(UINT nChar, UINT nRepCnt, UINT nFlags)
{
// Another attempt to keep tabs from processing...
if(nChar != VK_TAB)
CEdit::OnChar(nChar, nRepCnt, nFlags);
}
BOOL CNewEditBox::OnCommand(WPARAM wParam, LPARAM lParam)
{
int iID;
CString szItem;
CString szMessage;
iID = LOWORD(wParam); // Get the command ID. (which should be from the menu)
if(iID & ID_AUTO_BASE) {
// It's one of our popups, all right...
m_mnuAuto.GetMenuString(iID, szItem, MF_BYCOMMAND);
ASSERT(szItem.GetLength() > 0);
SetSel(m_iSelStart, m_iSelLength + m_iSelStart);
ReplaceSel(szItem);
SetReadOnly(FALSE);
m_mnuAuto.DestroyMenu();
}
return CEdit::OnCommand(wParam, lParam);
}
LRESULT CNewEditBox::OnUninitPopup(WPARAM wParam, LPARAM lParam)
{
// Hm, let's see....we can try to do this this way. o.o
// Unfortunately, now my program doesn't work on Win95, but
// who uses Win95 anymore, anyway?
if((HMENU)wParam == m_mnuAuto.GetSafeHmenu()) {
SetReadOnly(FALSE);
m_bHadMenu = TRUE;
}
return 0;
}
| 25.327189 | 96 | 0.637737 | yohshee |
b46f40112fb85b203e5177c158eb66bad8276fca | 23,551 | hh | C++ | inc/lacze_do_gnuplota.hh | KPO-2020-2021/zad5_3-jmeko1214 | 6c59e182b409c39e02c5a0e37d3e983ed1b3e0ba | [
"Unlicense"
] | null | null | null | inc/lacze_do_gnuplota.hh | KPO-2020-2021/zad5_3-jmeko1214 | 6c59e182b409c39e02c5a0e37d3e983ed1b3e0ba | [
"Unlicense"
] | null | null | null | inc/lacze_do_gnuplota.hh | KPO-2020-2021/zad5_3-jmeko1214 | 6c59e182b409c39e02c5a0e37d3e983ed1b3e0ba | [
"Unlicense"
] | null | null | null | #pragma once
#include <string>
#include <list>
#include <vector>
/*!
* \file lacze_do_gnuplota.hh
*
* Plik zawiera definicję klasy realizującej interfejs
* komunikacyjny do programu gnuplot.
*/
/*!
* \brief Moduł narzędzi umożliwiających połącznie z GNUPlotem
*
* Niniejsza przestrzeń nazw stanowi moduł logiczny zawierający
* narzędzia umożliwiające realizację połączenia z programem \p gnuplot.
*/
namespace PzG {
/*!
* \brief Określa tryb rysowania realizowanego przez program \p gnuplot
*
* Typ wyliczeniowy określające dopuszczalne tryby rysowania
* realizowanego przez program \p gnuplot. Wybór trybu wiąże się
* ze zmianą sposobu interpretacji danych zawartych pliku. Jeśli
* np. wybrany zostanie tryb 2D, to zakłada się, że w każdej linii
* pliku z danymi znajdują się wartości współrzędnych \e x, \e y.
* Wartości typu:
* \li \p TR_2D - rysowanie w trybie 2D, co sprowadza się do
* rysowania wykresów funkcji jednej zmiennej.
* \li \p TR_3D - rysowanie w trybie 3D. Oznacza to możliwość
* rysowania wykresów funkcji dwóch zmiennych.
*
*/
enum TrybRysowania { TR_2D, TR_3D };
/*!
* \brief Sposób rysowania linii
*
* Określa sposób rysowania linii.
*/
enum RodzajRysowania { RR_Ciagly, RR_Punktowy };
/*!
* \brief Zestaw informacji dotyczący pliku i sposobu rysowania
*
* Klasa modeluje zestaw informacji dotyczący pliku i sposobu
* w jaki mają być wizualizowane zawarte w nim dane.
*/
class InfoPlikuDoRysowania {
public:
/*!
* Inicjalizuje obiekt.
* \param NazwaPliku - nazwa pliku, z którego pobierane będą dane,
* \param RodzRys - rodzaj rysowania linii,
* \param Szerokosc - szerokosc linii.
*/
InfoPlikuDoRysowania(const char* NazwaPliku, RodzajRysowania RodzRys, int Szerokosc)
{
_NazwaPliku = NazwaPliku;
_RodzRys = RodzRys;
_Szerokosc = Szerokosc;
}
/*!
* \brief Udostępia nazwę pliku do rysowania
*
* Udostępnia nazwę pliku z danymi do rysowania.
*/
const std::string WezNazwePliku() const { return _NazwaPliku; }
/*!
* \brief Zmienia nazwę pliku do rysowania
*
* Zmienia nazwę pliku z danymi do rysowania.
*/
void ZmienNazwePliku(const std::string& NazwaPliku) { _NazwaPliku = NazwaPliku; }
/*!
* \brief Udostępnia sposób rysowanej linii
*
* Udostępnia informację o sposóbie rysowania linii.
*/
RodzajRysowania WezRodzRys() const { return _RodzRys; }
/*!
* \brief Udostępnia informację o szerokości linii.
*
* Udostępnia informację o szerokości rysowanej linii.
*/
int WezSzerokosc() const { return _Szerokosc; }
private:
/*!
* \brief Nazwa pliku z danymi do rysowania
*
* Nazwa pliku z danymi do rysowania.
*/
std::string _NazwaPliku;
/*!
* \brief Szerokość użytego piórka
*
* Określa szerokość piórka, jakie ma być użyte
* do rysowania obiektów graficznych.
*/
int _Szerokosc;
/*!
* \brief Sposób rysowania danej linii
*
* Przechowuje informacje o sposobie rysowania linii.
*/
RodzajRysowania _RodzRys;
};
/*!
* \brief Klasa realizuje interfejs do programu GNUPlot.
*
* Klasa realizuje interfejs do programu GNUPlot. Pozwala ona na wskazanie
* zbioru punktów płaszczyzn umieszczonych w pliku lub plikach.
* Każdy taki zbiór może być następnie wizualizowany przez program
* gnuplot w postaci oddzielnych płaszczyzn z wycinaniem części zasłanianych.
*/
class LaczeDoGNUPlota {
protected:
/*!
* \brief Lista nazw plików z danymi dla \e gnuplota.
*
* Pole jest zarządcą listy nazw plików, z których są wczytywane
* dane dotyczące rysowania obrysu brył przez program \e gnuplot.
* Operacja ta wykonywana jest po wywołaniu polecenia.
* \link LaczeDoGNUPlota::Rysuj Rysuj\endlink.
*/
static std::list<InfoPlikuDoRysowania> _InfoPlikow;
/*!
* Pole przechowuje deskryptor do wejścia standardowego uruchomionego
* programu gnuplot.
*/
int _Wejscie_GNUPlota;
/*!
* Pole przechowuje deskryptor do weyjścia standardowego uruchomionego
* programu gnuplot.
*/
int _Wyjscie_GNUPlota;
/*!
* \brief Decyduje czy mają być wyświetlane komunikaty o błędach,
* czy też nie.
*
* Wartość tego pola decyduje o tym czy komunikaty o błędach będą
* wyświetlane na wyjście standardowe błędów (\b cerr), czy też nie.
* \li \p true - komunikaty będę wyświetlane,
* \li \p false - komunikaty nie będę wyświetlane.
*/
bool _WyswietlajKomunikatyOBledach;
/*!
* \brief Określa aktualny tryb rysowania
*
* Zawartość pola determinuje sposób rysowania, jaki zostanie
* wymuszony na programie \p gnuplot poprzez wysłanie do niego
* odpowiednich poleceń. Wspomniane wymuszenie jest realizowane
* poprzez wywołanie polecenia
* \link LaczeDoGNUPlota::Rysuj Rysuj()\endlink
*/
TrybRysowania _TrybRys;
/*!
* \brief Dolny zakres wyświetlanej skali skali dla osi \e OX.
*
* Określa dolny zakres wyświetlanej skali dla osi \e OX.
*/
float _Xmin;
/*!
* \brief Górny zakres wyświetlanej skali skali dla osi \e OX.
*
* Określa górny zakres wyświetlanej skali dla osi \e OX.
*/
float _Xmax;
/*!
* \brief Dolny zakres wyświetlanej skali skali dla osi \e OY.
*
* Określa dolny zakres wyświetlanej skali dla osi \e OY.
*/
float _Ymin;
/*!
* \brief Górny zakres wyświetlanej skali skali dla osi \e OY.
*
* Określa górny zakres wyświetlanej skali dla osi \e OY.
*/
float _Ymax;
/*!
* \brief Dolny zakres wyświetlanej skali skali dla osi \e OZ.
*
* Określa dolny zakres wyświetlanej skali dla osi \e OZ.
*/
float _Zmin;
/*!
* \brief Górny zakres wyświetlanej skali skali dla osi \e OZ.
*
* Określa górny zakres wyświetlanej skali dla osi \e OZ.
*/
float _Zmax;
/*!
* Wartość tego pola definiuje skalowanie rysunku wzdłuż osi
* \e OX (oś horyzontalna ekranu).
*/
float _Xskala;
/*!
* Wartość tego pola definiuje skalowanie rysunku wzdłuż osi
* \e OZ (oś wertykalna ekranu).
*/
float _Zskala;
/*!
* Wartość tego pola definiuje rotację rysunku (zmiane punktu patrzenia)
* względem osi \e OX.
*/
float _Xrotacja;
/*!
* Wartość tego pola definiuje rotację rysunku (zmiane punktu patrzenia)
* względem osi \e OZ.
*/
float _Zrotacja;
/*!
* \brief Czy oś OX ma być widoczna
*
* Przechowuje informację decydującą o tym czy oś OX będzie
* widoczna na rysunku (\p true), czy też nie (\p false).
*/
bool _PokazOs_OX;
/*!
* \brief Czy oś OY ma być widoczna
*
* Przechowuje informację decydującą o tym czy oś OY będzie
* widoczna na rysunku (\p true), czy też nie (\p false).
*/
bool _PokazOs_OY;
/*!
* \brief Czy oś OZ ma być widoczna
*
* Przechowuje informację decydującą o tym czy oś OZ będzie
* widoczna na rysunku (\p true), czy też nie (\p false).
*/
bool _PokazOs_OZ;
/*!
* \brief Tworzy listę parametrów umożliwiających rysowanie dodatkowych elementów
*
* Metoda ta przewidziana jest jako element rozszerzenia pozwalającego
* w klasach pochodnych powiększyć listę rysowanych elementów.
* \pre Parametr \e Polecenie powinien zawierać polecenie \e plot lub \e splot,
* do którego będzie możliwe dopisanie dalszego ciągu.
* \param Polecenie - polecenie rysowania, do którego mają być dopisane
* nazwy plików i odpowiednie parametry dla polecenia plot.
* \param Sep - zawiera znak separatora między poszczególnymi
* parametrami. Jeżeli parametry listy przeszkód
* są generowane jako pierwsze, to zmienna ta musi
* być wskaźnikiem do wskaźnika na łańcuch: " ".
*/
virtual bool DopiszPlikiDoPoleceniaRysowania( std::string &Polecenie, char const **Sep );
/*!
* \brief Tworzy polecenie ustawiające zakres dla danej współrzędnej.
*
* Tworzy polecenie dla programu \e gnuplot ustawiające zakres
* współrzędnych wybranej współrzędnej \e x, \e y lub \e z,
* dla której ma być tworzony dany rysunek.
* \param Os - zawiera znak określający współrzędną, dla której
* ma zostać wygenerowane polecenie ustawienia zakresu.
* \return łańcuch znaków polecenia ustawiającego żądany zakres
* dla wybranej współrzędnej.
*/
std::string ZapiszUstawienieZakresu(char Os) const;
/*!
* \brief Tworzy polecenie ustawiające punkt obserwacji.
*
* Tworzy polecenie dla programu \e gnuplot ustawiajające punkt obserwacji
* poprzez zadanie rotacji i skali dla poszczególnych osi.
*/
std::string ZapiszUstawienieRotacjiISkali() const;
/*!
* Przesyła na wejście programu \e gnuplot zadany ciąg znaków.
* \param Polecenie - komunikat przeznaczony do przeslania.
*
* \pre Musi być zainicjowane połączenie z programem gnuplot.
*
* \retval true - jesli przeslanie polecenia zakończyło się powodzeniem,
* \retval false - w przypadku przeciwnym.
*
*/
bool PrzeslijDoGNUPlota(const char *Polecenie);
/*!
* \brief Udostępnia informację czy mają być wyświetlane informacje o błędach.
*
* Udostępnia wartość pola
* \link LaczeDoGNUPlota::_WyswietlajKomunikatyOBledach
* _WyswietlajKomunikatyOBledach\endlink.
* Określa ono, czy mają być wyświetlane komunikaty o błędach na wyjście
* standardowe, czy też nie.
*/
bool CzyWyswietlacKomunikaty() const { return _WyswietlajKomunikatyOBledach;}
/*!
* \brief Uruchamia program \e gnuplot jako proces potomny.
*/
bool UtworzProcesPotomny();
/*!
* Wyświetla na wyjście "standard error" komunikat (przekazany jako
* parametr), o ile pole
* \link LaczeDoGNUPlota::_WyswietlajKomunikatyOBledach
* _WyswietlajKomunikatyOBledach\endlink ma wartość
* \p true. W przypadku przeciwnym komunikat nie jest wyświetlany.
*/
void KomunikatBledu(const char *Komunikat) const;
/*!
* \brief Tworzy preambułę poprzedzającą polecenie rysowania
*
* Tworzy zbiór poleceń, które ustawiają właściwy tryb rysowania
* oraz zakresy współrzędnych, jak też wszystkie inne parametry
* wynikające z przyjętego trybu rysowania.
*/
void BudujPreambulePoleceniaRysowania(std::string &Preambula) const;
/*!
* \brief Tworzy preambułę poprzedzającą polecenie rysowania w trybie 2D
*
* Tworzy zbiór poleceń, które ustawiają właściwy tryb rysowania
* oraz zakresy współrzędnych, jak też wszystkie inne parametry
* wynikające z trybu rysowania 2D.
*/
void BudujPreambule_2D(std::string &Preambula) const;
/*!
* \brief Tworzy preambułę poprzedzającą polecenie rysowania w trybie 3D
*
* Tworzy zbiór poleceń, które ustawiają właściwy tryb rysowania
* oraz zakresy współrzędnych, jak też wszystkie inne parametry
* wynikające z trybu rysowania 3D.
*/
void BudujPreambule_3D(std::string &Preambula) const;
public:
/*!
* \brief Umożliwia lub zabrania rysowania osi OX
*
* Umożliwia lub zabrania rysowania osi \e OX na rysunku wykresu.
* \param Pokaz - decyduje o tym czy oś \e OX będzie rysowana (\p true),
* czy też nie (\p false).
*/
void PokazOs_OX(bool Pokaz) { _PokazOs_OX = Pokaz; }
/*!
* \brief Czy oś OX ma być rysowana
*
* Udostępnia informację czy oś \e OX ma być rysowana,
* czy też nie.
* \retval true - gdy oś \e OX ma być rysowana,
* \retval false - w przypadku przeciwnym.
*/
bool PokazOs_OX() const { return _PokazOs_OX; }
/*!
* \brief Umożliwia lub zabrania rysowania osi OY
*
* Umożliwia lub zabrania rysowania osi \e OY na rysunku wykresu.
* \param Pokaz - decyduje o tym czy oś \e OY będzie rysowana (\p true),
* czy też nie (\p false).
*/
void PokazOs_OY(bool Pokaz) { _PokazOs_OY = Pokaz; }
/*!
* \brief Czy oś OY ma być rysowana
*
* Udostępnia informację czy oś \e OY ma być rysowana,
* czy też nie.
* \retval true - gdy oś \e OY ma być rysowana,
* \retval false - w przypadku przeciwnym.
*/
bool PokazOs_OY() const { return _PokazOs_OY; }
/*!
* \brief Umożliwia lub zabrania rysowania osi OZ
*
* Umożliwia lub zabrania rysowania osi \e OZ na rysunku wykresu.
* \param Pokaz - decyduje o tym czy oś \e OZ będzie rysowana (\p true),
* czy też nie (\p false).
*/
void PokazOs_OZ(bool Pokaz) { _PokazOs_OZ = Pokaz; }
/*!
* \brief Czy oś OZ ma być rysowana
*
* Udostępnia informację czy oś \e OZ ma być rysowana,
* czy też nie.
* \retval true - gdy oś \e OZ ma być rysowana,
* \retval false - w przypadku przeciwnym.
*/
bool PokazOs_OZ() const { return _PokazOs_OZ; }
/*!
* Udostępnia dolną wartość zakresu skali wzdłuż osi \e OX.
*/
float Xmin() const { return _Xmin; }
/*!
* Udostępnia górną wartość zakresu skali wzdłuż osi \e OX.
*/
float Xmax() const { return _Xmax; }
/*!
* Udostępnia dolną wartość zakresu skali wzdłuż osi \e OY.
*/
float Ymin() const { return _Ymin; }
/*!
* Udostępnia górną wartość zakresu skali wzdłuż osi \e OY.
*/
float Ymax() const { return _Ymax; }
/*!
* Udostępnia dolną wartość zakresu skali wzdłuż osi \e OZ.
*/
float Zmin() const { return _Zmin; }
/*!
* Udostępnia górną wartość zakresu skali wzdłuż osi \e OZ.
*/
float Zmax() const { return _Zmax; }
/*!
* \brief Zmienia tryb rysowania
*
* Zmienia tryb rysowania jaki zostanie wymuszony na programie
* \p gnuplot.
* \param Tryb - wartość parametru określa nowy tryb rysowania.
*/
void ZmienTrybRys(TrybRysowania Tryb) { _TrybRys = Tryb; }
/*!
* \brief Udostępnia aktualny tryb rysowania
*
* Udostępnia informację o aktualnym trybie rysowania.
*/
TrybRysowania WezTrybRys() const { return _TrybRys; }
/*!
* \brief Ustawia zakres osi \e OX
*
* Ustawia zakres osi \e OX. Ogranicza to obszar, który będzie
* zwizualizowany przez programa \e gnuplot.
* \param Xo - dolna granica obszaru rysowania dla osi \e OX.
* \param Xn - górna granica obszaru rysowania dla osi \e OX.
*/
void UstawZakresX(float Xo, float Xn) { _Xmin = Xo; _Xmax = Xn; }
/*!
* \brief Ustawia zakres osi \e OY
*
* Ustawia zakres osi \e OY. Ogranicza to obszar, który będzie
* zwizualizowany przez programa \e gnuplot.
* \param Yo - dolna granica obszaru rysowania dla osi \e OY.
* \param Yn - górna granica obszaru rysowania dla osi \e OY.
*/
void UstawZakresY(float Yo, float Yn) { _Ymin = Yo; _Ymax = Yn; }
/*!
* \brief Ustawia zakres osi \e OZ.
*
* Ustawia zakres osi \e OZ. Ogranicza to obszar, który będzie
* zwizualizowany przez programa \e gnuplot.
* \param Zo - dolna granica obszaru rysowania dla osi \e OZ.
* \param Zn - górna granica obszaru rysowania dla osi \e OZ.
*/
void UstawZakresZ(float Zo, float Zn) { _Zmin = Zo; _Zmax = Zn; }
/*!
* \brief Udostępnia skalę dla osi \e OX.
*
* Udostępnia skalę dla osi \e OX dla tworzonego rysunku.
*/
float SkalaX() const { return _Xskala; }
/*!
* \brief Udostępnia skalę dla osi \e OZ.
*
* Udostępnia skalę dla osi \e OZ dla tworzonego rysunku.
*/
float SkalaZ() const { return _Zskala; }
/*!
* \brief Zadaje skalę wzdłuż osi \e OZ.
*
* Zadaje skalę wzdłuż osi \e OX dla tworzonego rysunku.
* \param skala_x - skala wzdłuż osi \e OX.
*/
void UstawSkaleX( float skala_x ) { _Xskala = skala_x; }
/*!
* \brief Zadaje skalę wzdłuż osi \e OZ.
*
* Zadaje skalę wzdłuż osi \e OZ dla tworzonego rysunku.
* \param skala_z - skala wzdłuż osi \e OZ.
*/
void UstawSkaleZ( float skala_z ) { _Zskala = skala_z; }
/*!
* \brief Zadaje skalę wzdłuż osi \e OX i \e OZ.
*
* Zadaje skalę wzdłuż osi \e OX i \e OZ dla tworzonego rysunku.
* \param skala_x - skala wzdłuż osi \e OX.
* \param skala_z - skala wzdłuż osi \e OZ.
*/
void UstawSkaleXZ( float skala_x, float skala_z )
{ UstawSkaleX(skala_x); UstawSkaleZ(skala_z); }
/*!
* Udostępnia wartość kąta rotacji renderowanego rysunku wokół
* osi \e OX. Zwracana wartość wyrażona jest w stopiniach.
*/
float RotacjaX() const { return _Xrotacja; }
/*!
* Udostępnia wartość kąta rotacji renderowanego rysunku wokół
* osi \e OZ. Zwracana wartość wyrażona jest w stopiniach.
*/
float RotacjaZ() const { return _Zrotacja; }
/*!
* \brief Ustawia rotację wokół osi \e OX.
*
* Zadaje kąt rotacji wokół osi \e OX. Umożliwia to zmianę
* punktu obserwacji renderowanego rysunku.
* \param kat_x - wartość kąta rotacji. Jego wartość podawana
* jest w stopniach.
*/
void UstawRotacjeX( float kat_x ) { _Xrotacja = kat_x; }
/*!
* \brief Ustawia rotację wokół osi \e OZ.
*
* Zadaje kąt rotacji wokół osi \e OZ. Umożliwia to zmianę
* punktu obserwacji renderowanego rysunku.
* \param kat_z - wartość kąta rotacji. Jego wartość podawana
* jest w stopniach.
*/
void UstawRotacjeZ( float kat_z ) { _Zrotacja = kat_z; }
/*!
* \brief Ustawia rotację wokół osi \e OX i \e OZ.
*
* Zadaje jednocześnie kąt rotacji wokół osi \e OX i \e OZ.
* Umożliwia to zmianę
* punktu obserwacji renderowanego rysunku.
* \param kat_x - wartość kąta rotacji względem osi \e OX.
* Jego wartość podawana
* jest w stopniach.
* \param kat_z - wartość kąta rotacji względem osi \e OZ.
* Jego wartość podawana
* jest w stopniach.
*/
void UstawRotacjeXZ( float kat_x, float kat_z )
{ UstawRotacjeX(kat_x); UstawRotacjeZ(kat_z); }
/*!
* \brief Zezwala lub zabrania wyświetlania komunikatów.
*
* Metoda pozwala, albo też zabrania wyświetlania komunikatów o blędach.
* Jeżeli jakaś z operacji nie powiedzie się, to jako wynik zwracana
* jest wartość \p false. Oprócz tego metody takie moga wyświetlać
* komunikaty, które kierowane są na wyjście "standard error"
* Domyślnie przymuje się, że programista nie chce dodatkwego wyświetlania
* komunikatów.
*/
void WyswietlajKomunikatyBledow( bool Tryb = true );
/*!
* \brief Dodaje nazwę pliku.
*
* Powoduje dodanie do listy plików zawierajacych dane dla \e gnuplota,
* nowej nazwy pliku.
*
* \param[in] NazwaPliku - nazwa pliku z danymi dla gnuplota.
* \param[in] RodzRys - tryb rysowania danego zbioru punktow.
* Może być ciągły lub jako zbiór osobnych punktów.
* \param[in] Szerokosc - szerokość rysowanego obiektu. W przypadku
* punktów parametr ten jest połową szerokości
* kwadratu reprezentującego dany punkt.
*
* \retval true - jeżeli istnieje plik o nazwie udostępnionej poprzez
* parametr
* \e NazwaPliku oraz jest zezwolenie na jego czytanie.
* Nazwa pliku zostaje dodana do listy plików z danymi
* dla \e gnuplota.
* \retval false - Jeżeli nie istnieje plik o nazwie przekazanej poprzez
* parametr \e NazwaPliku.
* Nazwa pliku zostaje dodana do listy plików z danymi
* dla \e gnuplota.
*/
bool DodajNazwePliku( const char * NazwaPliku,
RodzajRysowania RodzRys = RR_Ciagly,
int Szerokosc = 1
);
/*!
* \brief Tworzy listę parametrów umożliwiających rysowanie brył z plików.
*/
bool DopiszRysowanieZPlikow( std::string &Polecenie, char const **Sep );
/*!
* \brief Informuje, czy połączenie z \e gnuplot'em jest zainicjalizowane.
*
* Informuje, czy połączenie z programem \e gnuplot jest zainicjowane.
* \retval true - jeśli tak,
* \retval false - w przypadku przeciwnym.
*/
bool CzyPolaczenieJestZainicjowane() const;
/*!
* Jeżeli lista plików nie jest pusta, to generuje sekwencje poleceń
* dla programu \e gnuplot mająca na celu narysowanie płaszczyzn na
* na podstawie danych zawartych w plikach z listy.
*
* \pre Lista plików nie powinna być pusta. Nazwy plików na niej
* można umieścić za pomoca metody
* \link LaczeDoGNUPlota::DodajNazwe DodajNazwe\endlink.
* Metoda nie wymaga wcześniejszego zainicjowania połączenia
* z \e gnuplotem.
* \retval true - gdy zostają poprawnie wysłane polecenia dla gnuplota.
* Nie oznacza to jednak, że proces rysowania zakończył
* się pomyślnie.
* \retval false - gdy połączenie z gnuplotem nie może zostać poprawnie
* zainicjalizowane lub gdy lista plików jest pusta.
*/
bool Rysuj();
/*!
* Działa analogicznie jak metoda
* \link LaczeDoGNUPlota::Rysuj Rysuj\endlink, z tą różnicą, że
* rysunek robota
* składowany jest w pliku o nazwie przekazanej przez parametr
* \e NazwaPliku.
* Rysunek jest zapisywany w formacie \e PNG.
*
* \post Lista plików nie powinna być pusta ponadto powinno być
* możliwe otwarcie do zapisu pliku o nazwie przekazanej przez
* parametr \e NazwaPliku, do której dołączane jest rozszerzenie
* .ps .
* Metoda nie wymaga wcześniejszego zainicjowania połączenia
* z programem \e gnuplot.
*
* \retval true - gdy zostają poprawnie wysłane polecenia dla
* \e gnuplota.
* Nie oznacza to jednak, że proces rysowania zakończył
* się pomyślnie.
* \retval false - gdy połączenie z gnuplotem nie może zostać poprawnie
* zainicjalizowane lub gdy lista plików jest pusta lub
* też gdy nie można otworzyć pliku do zapisu.
*/
bool RysujDoPliku(const char *NazwaPliku);
/*!
* \brief Inicjalizuje połączenie z programem \e gnuplot.
*
* Inicjalizuje połączenie z programem \e gnuplot. Realizowane jest to
* poprzez rozwidlenie procesu i uruchomienie jako procesu potomnego
* programu \e gnuplot. Komunikacja z programem \e gnuplot realizowana jest
* poprzez przejęcie jego wejścia i wyjścia standardowego.
*
* \retval true - gdy połączenie z programem \e 0gnuplot zostało poprawnie
* zainicjalizowane lub gdy już wcześniej było
* zainicjalizowane.
* \retval false - gdy proces inicjalizacji połączenia zakończył się
* niepowodzeniem.
*/
bool Inicjalizuj();
/*!
* \brief Usuwa ostatnią nazwę pliku.
*
* Usuwa ostatnią nazwę z listy nazw plików.
*/
void UsunOstatniaNazwe();
/*!
* \brief Kasuje zawartość listy nazw plików.
*
* Calkowicie kasuje zawartość listy nazw plików.
*/
void UsunWszystkieNazwyPlikow();
LaczeDoGNUPlota();
virtual ~LaczeDoGNUPlota();
};
inline
bool LaczeDoGNUPlota::DopiszPlikiDoPoleceniaRysowania( std::string &,
char const **
)
{ return true; }
}
| 33.886331 | 91 | 0.651183 | KPO-2020-2021 |
b4717b8d0a9e7a7820568a0ee2159fc863d9c59a | 6,959 | hh | C++ | examples/external/OpenMesh/include/OpenMesh/Core/IO/exporter/BaseExporter.hh | zhangxaochen/Opt | 7f1af802bfc84cc9ef1adb9facbe4957078f529a | [
"MIT"
] | 260 | 2017-03-02T19:57:51.000Z | 2022-01-21T03:52:03.000Z | examples/external/OpenMesh/include/OpenMesh/Core/IO/exporter/BaseExporter.hh | zhangxaochen/Opt | 7f1af802bfc84cc9ef1adb9facbe4957078f529a | [
"MIT"
] | 102 | 2017-03-03T00:42:56.000Z | 2022-03-30T14:15:20.000Z | examples/external/OpenMesh/include/OpenMesh/Core/IO/exporter/BaseExporter.hh | zhangxaochen/Opt | 7f1af802bfc84cc9ef1adb9facbe4957078f529a | [
"MIT"
] | 71 | 2017-03-02T20:22:33.000Z | 2022-01-02T03:49:04.000Z | /* ========================================================================= *
* *
* OpenMesh *
* Copyright (c) 2001-2015, RWTH-Aachen University *
* Department of Computer Graphics and Multimedia *
* All rights reserved. *
* www.openmesh.org *
* *
*---------------------------------------------------------------------------*
* This file is part of OpenMesh. *
*---------------------------------------------------------------------------*
* *
* Redistribution and use in source and binary forms, with or without *
* modification, are permitted provided that the following conditions *
* are met: *
* *
* 1. Redistributions of source code must retain the above copyright notice, *
* this list of conditions and the following disclaimer. *
* *
* 2. Redistributions in binary form must reproduce the above copyright *
* notice, this list of conditions and the following disclaimer in the *
* documentation and/or other materials provided with the distribution. *
* *
* 3. Neither the name of the copyright holder nor the names of its *
* contributors may be used to endorse or promote products derived from *
* this software without specific prior written permission. *
* *
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
* *
* ========================================================================= */
/*===========================================================================*\
* *
* $Revision$ *
* $Date$ *
* *
\*===========================================================================*/
//=============================================================================
//
// Implements the baseclass for MeshWriter exporter modules
//
//=============================================================================
#ifndef __BASEEXPORTER_HH__
#define __BASEEXPORTER_HH__
//=== INCLUDES ================================================================
// STL
#include <vector>
// OpenMesh
#include <OpenMesh/Core/System/config.h>
#include <OpenMesh/Core/Geometry/VectorT.hh>
#include <OpenMesh/Core/Mesh/BaseKernel.hh>
//=== NAMESPACES ==============================================================
namespace OpenMesh {
namespace IO {
//=== EXPORTER ================================================================
/**
Base class for exporter modules.
The exporter modules provide an interface between the writer modules and
the target data structure.
*/
class OPENMESHDLLEXPORT BaseExporter
{
public:
virtual ~BaseExporter() { }
// get vertex data
virtual Vec3f point(VertexHandle _vh) const = 0;
virtual Vec3f normal(VertexHandle _vh) const = 0;
virtual Vec3uc color(VertexHandle _vh) const = 0;
virtual Vec4uc colorA(VertexHandle _vh) const = 0;
virtual Vec3ui colori(VertexHandle _vh) const = 0;
virtual Vec4ui colorAi(VertexHandle _vh) const = 0;
virtual Vec3f colorf(VertexHandle _vh) const = 0;
virtual Vec4f colorAf(VertexHandle _vh) const = 0;
virtual Vec2f texcoord(VertexHandle _vh) const = 0;
// get face data
virtual unsigned int
get_vhandles(FaceHandle _fh,
std::vector<VertexHandle>& _vhandles) const=0;
virtual Vec3f normal(FaceHandle _fh) const = 0;
virtual Vec3uc color (FaceHandle _fh) const = 0;
virtual Vec4uc colorA(FaceHandle _fh) const = 0;
virtual Vec3ui colori(FaceHandle _fh) const = 0;
virtual Vec4ui colorAi(FaceHandle _fh) const = 0;
virtual Vec3f colorf(FaceHandle _fh) const = 0;
virtual Vec4f colorAf(FaceHandle _fh) const = 0;
// get edge data
virtual Vec3uc color(EdgeHandle _eh) const = 0;
virtual Vec4uc colorA(EdgeHandle _eh) const = 0;
virtual Vec3ui colori(EdgeHandle _eh) const = 0;
virtual Vec4ui colorAi(EdgeHandle _eh) const = 0;
virtual Vec3f colorf(EdgeHandle _eh) const = 0;
virtual Vec4f colorAf(EdgeHandle _eh) const = 0;
// get reference to base kernel
virtual const BaseKernel* kernel() { return 0; }
// query number of faces, vertices, normals, texcoords
virtual size_t n_vertices() const = 0;
virtual size_t n_faces() const = 0;
virtual size_t n_edges() const = 0;
// property information
virtual bool is_triangle_mesh() const { return false; }
virtual bool has_vertex_normals() const { return false; }
virtual bool has_vertex_colors() const { return false; }
virtual bool has_vertex_texcoords() const { return false; }
virtual bool has_edge_colors() const { return false; }
virtual bool has_face_normals() const { return false; }
virtual bool has_face_colors() const { return false; }
};
//=============================================================================
} // namespace IO
} // namespace OpenMesh
//=============================================================================
#endif
//=============================================================================
| 44.896774 | 79 | 0.470901 | zhangxaochen |
b472c958b2690811d723def0ab4a062b61ddae59 | 12,732 | cpp | C++ | src/stage/stage-base.cpp | tilnewman/heroespath-src | a7784e44d8b5724f305ef8b8671fed54e2e5fd69 | [
"BSL-1.0",
"Beerware"
] | 2 | 2019-02-28T00:28:08.000Z | 2019-10-20T14:39:48.000Z | src/stage/stage-base.cpp | tilnewman/heroespath-src | a7784e44d8b5724f305ef8b8671fed54e2e5fd69 | [
"BSL-1.0",
"Beerware"
] | null | null | null | src/stage/stage-base.cpp | tilnewman/heroespath-src | a7784e44d8b5724f305ef8b8671fed54e2e5fd69 | [
"BSL-1.0",
"Beerware"
] | null | null | null | // This is an open source non-commercial project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
// ----------------------------------------------------------------------------
// "THE BEER-WARE LICENSE" (Revision 42):
// <[email protected]> wrote this file. As long as you retain this notice you
// can do whatever you want with this stuff. If we meet some day, and you think
// this stuff is worth it, you can buy me a beer in return. Ziesche Til Newman
// ----------------------------------------------------------------------------
//
// stage-base.cpp
//
#include "stage-base.hpp"
#include "game/game-controller.hpp"
#include "gui/box-entity-info.hpp"
#include "gui/box-entity.hpp"
#include "gui/display.hpp"
#include "gui/entity.hpp"
#include "gui/font-manager.hpp"
#include "gui/i-entity.hpp"
#include "gui/sound-manager.hpp"
#include "gui/text-info.hpp"
#include "gui/texture-cache.hpp"
#include "sfutil/distance.hpp"
#include <SFML/Graphics/RenderTarget.hpp>
#include <SFML/Graphics/Sprite.hpp>
#include <algorithm>
#include <exception>
#include <sstream>
namespace heroespath
{
namespace stage
{
const float StageBase::MOUSE_DRAG_MIN_DISTANCE_ { 3.0f };
StageBase::StageBase(
const std::string & NAME,
const gui::FontEnumVec_t & FONTS_TO_PRELOAD,
const gui::SfxEnumVec_t & SFX_TO_PRELOAD)
: STAGE_NAME_(std::string(NAME))
, stageRegion_(gui::Display::Instance()->FullScreenRect())
, entityPVec_()
, entityWithFocusPtrOpt_()
, hoverTextBoxUPtr_()
, hoverText_()
, isFading_(false)
, isMouseHeldDown_(false)
, isMouseHeldDownAndMoving_(false)
, mouseDownPosV_(0.0f, 0.0f)
{
StageBaseCommonSetupTasks(FONTS_TO_PRELOAD, SFX_TO_PRELOAD);
}
StageBase::StageBase(
const std::string & NAME,
const sf::FloatRect & REGION,
const gui::FontEnumVec_t & FONTS_TO_PRELOAD,
const gui::SfxEnumVec_t & SFX_TO_PRELOAD)
: STAGE_NAME_(std::string(NAME))
, stageRegion_(REGION)
, entityPVec_()
, entityWithFocusPtrOpt_()
, hoverTextBoxUPtr_()
, hoverText_()
, isFading_(false)
, isMouseHeldDown_(false)
, isMouseHeldDownAndMoving_(false)
, mouseDownPosV_(0.0f, 0.0f)
{
StageBaseCommonSetupTasks(FONTS_TO_PRELOAD, SFX_TO_PRELOAD);
}
void StageBase::StageBaseCommonSetupTasks(
const gui::FontEnumVec_t & FONTS_TO_PRELOAD, const gui::SfxEnumVec_t & SFX_TO_PRELOAD)
{
gui::FontManager::Instance()->Load(FONTS_TO_PRELOAD);
gui::SoundManager::Instance()->PreLoadSfx(SFX_TO_PRELOAD);
}
StageBase::~StageBase() = default;
game::Phase::Enum StageBase::GetPhase() const
{
return game::GameController::Instance()->GetPhase();
}
const std::string StageBase::MakeCallbackHandlerMessage(
const std::string & EVENT_DESCRIPTION, const std::string & ACTION_TAKEN) const
{
if (ACTION_TAKEN.empty())
{
return "";
}
else
{
return GetStageName() + " finished handling callback event " + EVENT_DESCRIPTION
+ " and " + ACTION_TAKEN + ".";
}
}
void StageBase::UpdateTime(const float ELAPSED_TIME_SECONDS)
{
for (auto & entityPtr : entityPVec_)
{
entityPtr->UpdateTime(ELAPSED_TIME_SECONDS);
}
}
void StageBase::UpdateMousePos(const sf::Vector2i & NEW_MOUSE_POS)
{
const sf::Vector2f NEW_MOUSE_POS_F(NEW_MOUSE_POS);
isMouseHeldDownAndMoving_
= (isMouseHeldDown_
&& (sfutil::Distance(mouseDownPosV_, NEW_MOUSE_POS_F) > MOUSE_DRAG_MIN_DISTANCE_));
for (auto & entityPtr : entityPVec_)
{
entityPtr->UpdateMousePos(NEW_MOUSE_POS_F);
}
}
void StageBase::UpdateMouseDown(const sf::Vector2f & MOUSE_POS_V)
{
isMouseHeldDown_ = true;
mouseDownPosV_ = MOUSE_POS_V;
for (auto & entityPtr : entityPVec_)
{
entityPtr->MouseDown(MOUSE_POS_V);
}
}
const gui::IEntityPtrOpt_t StageBase::UpdateMouseUp(const sf::Vector2f & MOUSE_POS_V)
{
isMouseHeldDown_ = false;
isMouseHeldDownAndMoving_ = false;
for (const auto & ENTITY_PTR : entityPVec_)
{
if ((ENTITY_PTR->MouseUp(MOUSE_POS_V)) && ENTITY_PTR->WillAcceptFocus())
{
return ENTITY_PTR;
}
}
return boost::none;
}
void StageBase::UpdateMouseWheel(const sf::Vector2f & MOUSE_POS_V, const float MOUSEWHEEL_DELTA)
{
for (auto & entityPtr : entityPVec_)
{
entityPtr->UpdateMouseWheel(MOUSE_POS_V, MOUSEWHEEL_DELTA);
}
}
bool StageBase::KeyPress(const sf::Event::KeyEvent & KE)
{
return (entityWithFocusPtrOpt_ && (entityWithFocusPtrOpt_.value()->KeyPress(KE)));
}
bool StageBase::KeyRelease(const sf::Event::KeyEvent & KE)
{
return (entityWithFocusPtrOpt_ && (entityWithFocusPtrOpt_.value()->KeyRelease(KE)));
}
void StageBase::RemoveFocus()
{
if (entityWithFocusPtrOpt_)
{
entityWithFocusPtrOpt_.value()->SetHasFocus(false);
entityWithFocusPtrOpt_ = boost::none;
}
}
void StageBase::SetFocus(const gui::IEntityPtr_t ENTITY_PTR)
{
const auto ORIG_ENTITY_WITH_FOCUS_NAME {
((entityWithFocusPtrOpt_) ? entityWithFocusPtrOpt_.value()->GetEntityName() : "(None)")
};
const auto WAS_FOUND { std::find(std::begin(entityPVec_), std::end(entityPVec_), ENTITY_PTR)
!= std::end(entityPVec_) };
if (WAS_FOUND)
{
RemoveFocus();
ENTITY_PTR->SetHasFocus(true);
entityWithFocusPtrOpt_ = ENTITY_PTR;
}
else
{
M_HP_LOG_ERR(
"stage::StageBase("
<< GetStageName() << ")::SetFocus(entity=" << ENTITY_PTR->GetEntityName()
<< ") Attempt to set focus with an IEntityPtr_t that was not in entityPVec_. "
"orig_entity_withfocus=\""
<< ORIG_ENTITY_WITH_FOCUS_NAME << "\"");
}
}
void StageBase::draw(sf::RenderTarget & target, sf::RenderStates states) const
{
for (auto & entityPtr : entityPVec_)
{
entityPtr->draw(target, states);
}
if (hoverTextBoxUPtr_)
{
target.draw(*hoverTextBoxUPtr_, states);
target.draw(hoverText_, states);
}
}
void StageBase::EntityAdd(const gui::IEntityPtr_t ENTITY_PTR, const bool WILL_INSERT_AT_FRONT)
{
const auto WAS_FOUND { std::find(std::begin(entityPVec_), std::end(entityPVec_), ENTITY_PTR)
!= std::end(entityPVec_) };
if (WAS_FOUND)
{
M_HP_LOG_WRN(
"Ignoring because this entity was already in the list. (entity_name=\""
<< ENTITY_PTR->GetEntityName() << "\")" << M_HP_VAR_STR(WILL_INSERT_AT_FRONT)
<< "(stage=" << GetStageName() << ")");
return;
}
if (WILL_INSERT_AT_FRONT)
{
entityPVec_.insert(std::begin(entityPVec_), ENTITY_PTR);
}
else
{
entityPVec_.emplace_back(ENTITY_PTR);
}
}
void StageBase::EntityRemove(const gui::IEntityPtr_t ENTITY_PTR)
{
const auto ORIG_NUM_ENTITYS { entityPVec_.size() };
entityPVec_.erase(
std::remove(entityPVec_.begin(), entityPVec_.end(), ENTITY_PTR), entityPVec_.end());
bool wasEntityFoundAndRemoved { (ORIG_NUM_ENTITYS != entityPVec_.size()) };
if (entityWithFocusPtrOpt_ == ENTITY_PTR)
{
RemoveFocus();
wasEntityFoundAndRemoved = true;
}
if (false == wasEntityFoundAndRemoved)
{
M_HP_LOG_WRN(
"Entity to remove named \"" << ENTITY_PTR->GetEntityName() << "\" was not found. "
<< "(stage=" << GetStageName() << ")");
}
}
void StageBase::SetMouseHover(const sf::Vector2f & MOUSE_POS_V, const bool IS_MOUSE_HOVERING)
{
if (IS_MOUSE_HOVERING)
{
std::string text("");
// check if focused entity is hovered first
if (entityWithFocusPtrOpt_
&& (entityWithFocusPtrOpt_.value()->GetEntityRegion().contains(MOUSE_POS_V)))
{
text = entityWithFocusPtrOpt_.value()->GetMouseHoverText();
}
// if focused entity is not hovered, then look for any entity the mouse is hovering over
if (text.empty())
{
for (const auto & NEXT_ENTITY_PTR : entityPVec_)
{
if (NEXT_ENTITY_PTR->GetEntityRegion().contains(MOUSE_POS_V))
{
text = NEXT_ENTITY_PTR->GetMouseHoverText();
if (text.empty() == false)
{
break;
}
}
}
}
if (text.empty())
{
if (hoverTextBoxUPtr_)
{
hoverTextBoxUPtr_.reset();
}
return;
}
const gui::TextInfo TEXT_INFO(
text,
gui::GuiFont::System,
gui::FontManager::Instance()->Size_Smallish(),
sf::Color(50, 50, 50),
gui::Justified::Left);
hoverText_.setup(TEXT_INFO);
sf::FloatRect region(
MOUSE_POS_V.x - 200.0f,
MOUSE_POS_V.y + 10.0f,
hoverText_.getGlobalBounds().width + 20.0f,
hoverText_.getGlobalBounds().height + 8.0f);
const auto SCREEN_WIDTH { gui::Display::Instance()->GetWinWidth() };
if ((region.left + region.width) > SCREEN_WIDTH)
{
region.left = SCREEN_WIDTH - region.width;
}
if (region.left < 0.0f)
{
region.left = 0.0f;
}
hoverText_.setPosition(region.left + 10.0f, region.top + 2.0f);
gui::BoxEntityInfo boxInfo;
boxInfo.SetupColor(sfutil::color::Orange - sf::Color(20, 0, 0, 0));
boxInfo.SetupBorder(true, 1.0f);
hoverTextBoxUPtr_
= std::make_unique<gui::BoxEntity>(GetStageName() + "'sHoverText", region, boxInfo);
}
else
{
if (hoverTextBoxUPtr_)
{
hoverTextBoxUPtr_.reset();
}
}
}
void StageBase::TestingStrAppend(const std::string & MESSAGE)
{
game::GameController::Instance()->TestingStrAppend(MESSAGE);
}
void StageBase::TestingStrIncrement(const std::string & MESSAGE)
{
game::GameController::Instance()->TestingStrIncrement(MESSAGE);
}
void StageBase::TestingImageSet(const std::string & MESSAGE)
{
game::GameController::Instance()->TestingImageSet(MESSAGE);
}
void StageBase::ClearAllEntities()
{
entityWithFocusPtrOpt_ = boost::none;
entityPVec_.clear();
}
void StageBase::SpawnPopup(
const misc::PopupCallback_t::IHandlerPtr_t POPUP_HANDLER_PTR,
const popup::PopupInfo & POPUP_INFO) const
{
game::GameController::Instance()->SpawnPopup(POPUP_HANDLER_PTR, POPUP_INFO);
}
void StageBase::RemovePopup(
const popup::PopupButtons::Enum TYPE, const std::size_t SELECTION) const
{
game::GameController::Instance()->RemovePopup(TYPE, SELECTION);
}
void StageBase::TransitionTo(const stage::Stage::Enum NEW_STAGE) const
{
game::GameController::Instance()->TransitionTo(NEW_STAGE);
}
void StageBase::TransitionTo(const stage::SetupPacket & SETUP_PACKET) const
{
game::GameController::Instance()->TransitionTo(SETUP_PACKET);
}
const gui::DisplayChangeResult StageBase::ChangeResolution(
const misc::PopupCallback_t::IHandlerPtr_t POPUP_HANDLER_PTR,
const gui::Resolution & NEW_RES,
const unsigned ANTIALIAS_LEVEL) const
{
return game::GameController::Instance()->ChangeResolution(
POPUP_HANDLER_PTR, NEW_RES, ANTIALIAS_LEVEL);
}
} // namespace stage
} // namespace heroespath
| 31.205882 | 100 | 0.572809 | tilnewman |
b4738fcb5e33aacf0e943ca446289dfcbd2cf839 | 18,214 | cpp | C++ | src/chrono_vehicle/wheeled_vehicle/steering/ChPitmanArmShafts.cpp | iicfcii/chrono | d42e58d6e7fb2a2b254510c1c174789dc9f95dfe | [
"BSD-3-Clause"
] | 3 | 2019-01-15T07:40:33.000Z | 2019-01-15T09:16:45.000Z | src/chrono_vehicle/wheeled_vehicle/steering/ChPitmanArmShafts.cpp | iicfcii/chrono | d42e58d6e7fb2a2b254510c1c174789dc9f95dfe | [
"BSD-3-Clause"
] | 1 | 2019-10-25T10:35:29.000Z | 2019-10-25T10:35:29.000Z | src/chrono_vehicle/wheeled_vehicle/steering/ChPitmanArmShafts.cpp | iicfcii/chrono | d42e58d6e7fb2a2b254510c1c174789dc9f95dfe | [
"BSD-3-Clause"
] | null | null | null | // =============================================================================
// PROJECT CHRONO - http://projectchrono.org
//
// Copyright (c) 2014 projectchrono.org
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be found
// in the LICENSE file at the top level of the distribution and at
// http://projectchrono.org/license-chrono.txt.
//
// =============================================================================
// Authors: Radu Serban
// =============================================================================
//
// Base class for a Pitman Arm steering subsystem.
// Derived from ChSteering, but still an abstract base class.
//
// =============================================================================
#include <vector>
#include "chrono/assets/ChColorAsset.h"
#include "chrono/assets/ChCylinderShape.h"
#include "chrono/assets/ChPointPointDrawing.h"
#include "chrono_vehicle/wheeled_vehicle/steering/ChPitmanArmShafts.h"
namespace chrono {
namespace vehicle {
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
ChPitmanArmShafts::ChPitmanArmShafts(const std::string& name, bool vehicle_frame_inertia, bool rigid_column)
: ChSteering(name), m_vehicle_frame_inertia(vehicle_frame_inertia), m_rigid(rigid_column) {}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
void ChPitmanArmShafts::Initialize(std::shared_ptr<ChChassis> chassis,
const ChVector<>& location,
const ChQuaternion<>& rotation) {
m_position = ChCoordsys<>(location, rotation);
auto chassisBody = chassis->GetBody();
auto sys = chassisBody->GetSystem();
// Chassis orientation (expressed in absolute frame)
// Recall that the suspension reference frame is aligned with the chassis.
ChQuaternion<> chassisRot = chassisBody->GetFrame_REF_to_abs().GetRot();
// Express the steering reference frame in the absolute coordinate system.
ChFrame<> steering_to_abs(location, rotation);
steering_to_abs.ConcatenatePreTransformation(chassisBody->GetFrame_REF_to_abs());
// Transform all points and directions to absolute frame.
std::vector<ChVector<>> points(NUM_POINTS);
std::vector<ChVector<>> dirs(NUM_DIRS);
for (int i = 0; i < NUM_POINTS; i++) {
ChVector<> rel_pos = getLocation(static_cast<PointId>(i));
points[i] = steering_to_abs.TransformPointLocalToParent(rel_pos);
}
for (int i = 0; i < NUM_DIRS; i++) {
ChVector<> rel_dir = getDirection(static_cast<DirectionId>(i));
dirs[i] = steering_to_abs.TransformDirectionLocalToParent(rel_dir);
}
// Unit vectors for orientation matrices.
ChVector<> u;
ChVector<> v;
ChVector<> w;
ChMatrix33<> rot;
// Create and initialize the steering link body
m_link = std::shared_ptr<ChBody>(sys->NewBody());
m_link->SetNameString(m_name + "_link");
m_link->SetPos(points[STEERINGLINK]);
m_link->SetRot(steering_to_abs.GetRot());
m_link->SetMass(getSteeringLinkMass());
if (m_vehicle_frame_inertia) {
ChMatrix33<> inertia = TransformInertiaMatrix(getSteeringLinkInertiaMoments(), getSteeringLinkInertiaProducts(),
chassisRot, steering_to_abs.GetRot());
m_link->SetInertia(inertia);
} else {
m_link->SetInertiaXX(getSteeringLinkInertiaMoments());
m_link->SetInertiaXY(getSteeringLinkInertiaProducts());
}
sys->AddBody(m_link);
m_pP = m_link->TransformPointParentToLocal(points[UNIV]);
m_pI = m_link->TransformPointParentToLocal(points[REVSPH_S]);
m_pTP = m_link->TransformPointParentToLocal(points[TIEROD_PA]);
m_pTI = m_link->TransformPointParentToLocal(points[TIEROD_IA]);
// Create and initialize the Pitman arm body
m_arm = std::shared_ptr<ChBody>(sys->NewBody());
m_arm->SetNameString(m_name + "_arm");
m_arm->SetPos(points[PITMANARM]);
m_arm->SetRot(steering_to_abs.GetRot());
m_arm->SetMass(getPitmanArmMass());
if (m_vehicle_frame_inertia) {
ChMatrix33<> inertia = TransformInertiaMatrix(getPitmanArmInertiaMoments(), getPitmanArmInertiaProducts(),
chassisRot, steering_to_abs.GetRot());
m_arm->SetInertia(inertia);
} else {
m_arm->SetInertiaXX(getPitmanArmInertiaMoments());
m_arm->SetInertiaXY(getPitmanArmInertiaProducts());
}
sys->AddBody(m_arm);
// Cache points for arm visualization (expressed in the arm frame)
m_pC = m_arm->TransformPointParentToLocal(points[REV]);
m_pL = m_arm->TransformPointParentToLocal(points[UNIV]);
// Create and initialize the revolute joint between chassis and Pitman arm.
// The z direction of the joint orientation matrix is dirs[REV_AXIS], assumed
// to be a unit vector.
u = points[PITMANARM] - points[REV];
v = Vcross(dirs[REV_AXIS], u);
v.Normalize();
u = Vcross(v, dirs[REV_AXIS]);
rot.Set_A_axis(u, v, dirs[REV_AXIS]);
m_revolute = chrono_types::make_shared<ChLinkLockRevolute>();
m_revolute->SetNameString(m_name + "_revolute");
m_revolute->Initialize(chassisBody, m_arm, ChCoordsys<>(points[REV], rot.Get_A_quaternion()));
sys->AddLink(m_revolute);
// Create and initialize the universal joint between the Pitman arm and steering link.
// The x and y directions of the joint orientation matrix are given by
// dirs[UNIV_AXIS_ARM] and dirs[UNIV_AXIS_LINK], assumed to be unit vectors
// and orthogonal.
w = Vcross(dirs[UNIV_AXIS_ARM], dirs[UNIV_AXIS_LINK]);
rot.Set_A_axis(dirs[UNIV_AXIS_ARM], dirs[UNIV_AXIS_LINK], w);
m_universal = chrono_types::make_shared<ChLinkUniversal>();
m_universal->SetNameString(m_name + "_universal");
m_universal->Initialize(m_arm, m_link, ChFrame<>(points[UNIV], rot.Get_A_quaternion()));
sys->AddLink(m_universal);
// Create and initialize the revolute-spherical joint (massless idler arm).
// The length of the idler arm is the distance between the two hardpoints.
// The z direction of the revolute joint orientation matrix is
// dirs[REVSPH_AXIS], assumed to be a unit vector.
double distance = (points[REVSPH_S] - points[REVSPH_R]).Length();
u = points[REVSPH_S] - points[REVSPH_R];
v = Vcross(dirs[REVSPH_AXIS], u);
v.Normalize();
u = Vcross(v, dirs[REVSPH_AXIS]);
rot.Set_A_axis(u, v, dirs[REVSPH_AXIS]);
m_revsph = chrono_types::make_shared<ChLinkRevoluteSpherical>();
m_revsph->SetNameString(m_name + "_revsph");
m_revsph->Initialize(chassisBody, m_link, ChCoordsys<>(points[REVSPH_R], rot.Get_A_quaternion()), distance);
sys->AddLink(m_revsph);
//// TODO: Decide if shaftC should be attached to chassis or if it should be "fixed"
//// Right now: fixed.
// Create all shafts in steering column
// Chassis --X-- shaftC --M-- shaftC1 --S-- shaftA1 --G-- shaftA --X-- Arm
// All shafts are aligned with dir[REV_AXIS], assumed to be a unit vector.
double inertia = getSteeringColumnInertia();
m_shaft_C = chrono_types::make_shared<ChShaft>();
m_shaft_C->SetNameString(m_name + "_shaftC");
m_shaft_C->SetInertia(inertia);
m_shaft_C->SetShaftFixed(true);
sys->Add(m_shaft_C);
m_shaft_C1 = chrono_types::make_shared<ChShaft>();
m_shaft_C1->SetNameString(m_name + "_shaftC1");
m_shaft_C1->SetInertia(inertia);
sys->Add(m_shaft_C1);
m_shaft_A1 = chrono_types::make_shared<ChShaft>();
m_shaft_A1->SetNameString(m_name + "_shaftA1");
m_shaft_A1->SetInertia(inertia);
sys->Add(m_shaft_A1);
m_shaft_A = chrono_types::make_shared<ChShaft>();
m_shaft_A->SetNameString(m_name + "_shaftA");
m_shaft_A->SetInertia(inertia);
sys->Add(m_shaft_A);
// Rigidly attach shaftA to the arm body
m_shaft_arm = chrono_types::make_shared<ChShaftsBody>();
m_shaft_arm->SetNameString(m_name + "_shaftA_to_arm");
m_shaft_arm->Initialize(m_shaft_A, m_arm, dirs[REV_AXIS]);
sys->Add(m_shaft_arm);
// Rigidly attach shaftC to the chassis body
////m_shaft_chassis = chrono_types::make_shared<ChShaftsBody>();
////m_shaft_chassis->SetNameString(m_name + "_shaftC_to_chassis");
////m_shaft_chassis->Initialize(m_shaft_C, chassisBody, dirs[REV_AXIS]);
////sys->Add(m_shaft_chassis);
// A motor (for steering input) between shaftC and shaftC1
// The setpoint for the motor angle function is set in Synchronize()
m_shaft_motor = chrono_types::make_shared<ChShaftsMotorAngle>();
m_shaft_motor->SetNameString(m_name + "_motor");
m_shaft_motor->Initialize(m_shaft_C, m_shaft_C1);
auto motor_fun = chrono_types::make_shared<ChFunction_Setpoint>();
m_shaft_motor->SetAngleFunction(motor_fun);
sys->Add(m_shaft_motor);
// A reduction gear between shaftA and shaftA1
// (note order of connected shafts for gear_ratio > 1)
m_shaft_gear = chrono_types::make_shared<ChShaftsGear>();
m_shaft_gear->SetNameString(m_name + "_transmission");
m_shaft_gear->SetTransmissionRatio(getGearRatio());
m_shaft_gear->Initialize(m_shaft_A, m_shaft_A1);
sys->Add(m_shaft_gear);
// Connect shaftA1 and shaftC1 (compliant or rigid connection)
if (m_rigid) {
// Use a gear couple with ratio=1
m_rigid_connection = chrono_types::make_shared<ChShaftsGear>();
m_rigid_connection->SetNameString(m_name + "_rigid_column");
m_rigid_connection->SetTransmissionRatio(1.0);
m_rigid_connection->Initialize(m_shaft_A1, m_shaft_C1);
sys->Add(m_rigid_connection);
} else {
// Use a torsional spring between shaftA1 and shaftC1
m_spring_connection = chrono_types::make_shared<ChShaftsTorsionSpring>();
m_spring_connection->SetNameString(m_name + "_compliant_column");
m_spring_connection->SetTorsionalStiffness(getSteeringCompliance());
////m_spring_connection->SetTorsionalDamping(10);
m_spring_connection->Initialize(m_shaft_C1, m_shaft_A1);
sys->Add(m_spring_connection);
}
}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
void ChPitmanArmShafts::Synchronize(double time, double steering) {
auto fun = std::static_pointer_cast<ChFunction_Setpoint>(m_shaft_motor->GetAngleFunction());
fun->SetSetpoint(getMaxAngle() * steering, time);
}
// -----------------------------------------------------------------------------
// Get the total mass of the steering subsystem
// -----------------------------------------------------------------------------
double ChPitmanArmShafts::GetMass() const {
return getSteeringLinkMass() + getPitmanArmMass();
}
// -----------------------------------------------------------------------------
// Get the current COM location of the steering subsystem.
// -----------------------------------------------------------------------------
ChVector<> ChPitmanArmShafts::GetCOMPos() const {
ChVector<> com = getSteeringLinkMass() * m_link->GetPos() + getPitmanArmMass() * m_arm->GetPos();
return com / GetMass();
}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
void ChPitmanArmShafts::AddVisualizationAssets(VisualizationType vis) {
if (vis == VisualizationType::NONE)
return;
// Visualization for link
{
auto cyl = chrono_types::make_shared<ChCylinderShape>();
cyl->GetCylinderGeometry().p1 = m_pP;
cyl->GetCylinderGeometry().p2 = m_pI;
cyl->GetCylinderGeometry().rad = getSteeringLinkRadius();
m_link->AddAsset(cyl);
auto cyl_P = chrono_types::make_shared<ChCylinderShape>();
cyl_P->GetCylinderGeometry().p1 = m_pP;
cyl_P->GetCylinderGeometry().p2 = m_pTP;
cyl_P->GetCylinderGeometry().rad = getSteeringLinkRadius();
m_link->AddAsset(cyl_P);
auto cyl_I = chrono_types::make_shared<ChCylinderShape>();
cyl_I->GetCylinderGeometry().p1 = m_pI;
cyl_I->GetCylinderGeometry().p2 = m_pTI;
cyl_I->GetCylinderGeometry().rad = getSteeringLinkRadius();
m_link->AddAsset(cyl_I);
auto col = chrono_types::make_shared<ChColorAsset>();
col->SetColor(ChColor(0.2f, 0.7f, 0.7f));
m_link->AddAsset(col);
}
// Visualization for arm
{
auto cyl = chrono_types::make_shared<ChCylinderShape>();
cyl->GetCylinderGeometry().p1 = m_pC;
cyl->GetCylinderGeometry().p2 = m_pL;
cyl->GetCylinderGeometry().rad = getPitmanArmRadius();
m_arm->AddAsset(cyl);
auto col = chrono_types::make_shared<ChColorAsset>();
col->SetColor(ChColor(0.7f, 0.7f, 0.2f));
m_arm->AddAsset(col);
}
// Visualization for rev-sph link
m_revsph->AddAsset(chrono_types::make_shared<ChPointPointSegment>());
}
void ChPitmanArmShafts::RemoveVisualizationAssets() {
m_link->GetAssets().clear();
m_arm->GetAssets().clear();
m_revsph->GetAssets().clear();
}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
void ChPitmanArmShafts::LogConstraintViolations() {
// Revolute joint
{
ChVectorDynamic<> C = m_revolute->GetC();
GetLog() << "Revolute ";
GetLog() << " " << C(0) << " ";
GetLog() << " " << C(1) << " ";
GetLog() << " " << C(2) << " ";
GetLog() << " " << C(3) << " ";
GetLog() << " " << C(4) << "\n";
}
// Universal joint
{
ChVectorDynamic<> C = m_universal->GetC();
GetLog() << "Universal ";
GetLog() << " " << C(0) << " ";
GetLog() << " " << C(1) << " ";
GetLog() << " " << C(2) << " ";
GetLog() << " " << C(3) << "\n";
}
// Revolute-spherical joint
{
ChVectorDynamic<> C = m_revsph->GetC();
GetLog() << "Revolute-spherical ";
GetLog() << " " << C(0) << " ";
GetLog() << " " << C(1) << "\n";
}
//// TODO
//// Constraint violations for the various shaft couples
}
void ChPitmanArmShafts::GetShaftInformation(double time,
double& motor_input,
double& motor_input_der,
std::vector<double>& shaft_angles,
std::vector<double>& shaft_velocities,
std::vector<double>& constraint_violations,
ChVector<>& arm_angular_vel) const {
auto fun = std::static_pointer_cast<ChFunction_Setpoint>(m_shaft_motor->GetAngleFunction());
motor_input = fun->Get_y(time);
motor_input_der = fun->Get_y_dx(time);
shaft_angles.push_back(m_shaft_C->GetPos());
shaft_angles.push_back(m_shaft_C1->GetPos());
shaft_angles.push_back(m_shaft_A1->GetPos());
shaft_angles.push_back(m_shaft_A->GetPos());
shaft_velocities.push_back(m_shaft_C->GetPos_dt());
shaft_velocities.push_back(m_shaft_C1->GetPos_dt());
shaft_velocities.push_back(m_shaft_A1->GetPos_dt());
shaft_velocities.push_back(m_shaft_A->GetPos_dt());
constraint_violations.push_back(m_shaft_motor->GetConstraintViolation());
constraint_violations.push_back(m_shaft_gear->GetConstraintViolation());
if (m_rigid)
constraint_violations.push_back(m_rigid_connection->GetConstraintViolation());
arm_angular_vel = m_arm->GetWvel_loc();
}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
void ChPitmanArmShafts::ExportComponentList(rapidjson::Document& jsonDocument) const {
ChPart::ExportComponentList(jsonDocument);
std::vector<std::shared_ptr<ChBody>> bodies;
bodies.push_back(m_link);
bodies.push_back(m_arm);
ChPart::ExportBodyList(jsonDocument, bodies);
std::vector<std::shared_ptr<ChShaft>> shafts;
shafts.push_back(m_shaft_C);
shafts.push_back(m_shaft_C1);
shafts.push_back(m_shaft_A1);
shafts.push_back(m_shaft_A);
ChPart::ExportShaftList(jsonDocument, shafts);
std::vector<std::shared_ptr<ChLink>> joints;
joints.push_back(m_revolute);
joints.push_back(m_revsph);
joints.push_back(m_universal);
ChPart::ExportJointList(jsonDocument, joints);
std::vector<std::shared_ptr<ChShaftsCouple>> couples;
couples.push_back(m_shaft_motor);
couples.push_back(m_shaft_gear);
if (m_rigid)
couples.push_back(m_rigid_connection);
else
couples.push_back(m_spring_connection);
ChPart::ExportCouplesList(jsonDocument, couples);
}
void ChPitmanArmShafts::Output(ChVehicleOutput& database) const {
if (!m_output)
return;
std::vector<std::shared_ptr<ChBody>> bodies;
bodies.push_back(m_link);
bodies.push_back(m_arm);
database.WriteBodies(bodies);
std::vector<std::shared_ptr<ChShaft>> shafts;
shafts.push_back(m_shaft_C);
shafts.push_back(m_shaft_C1);
shafts.push_back(m_shaft_A1);
shafts.push_back(m_shaft_A);
database.WriteShafts(shafts);
std::vector<std::shared_ptr<ChLink>> joints;
joints.push_back(m_revolute);
joints.push_back(m_revsph);
joints.push_back(m_universal);
database.WriteJoints(joints);
std::vector<std::shared_ptr<ChShaftsCouple>> couples;
couples.push_back(m_shaft_motor);
couples.push_back(m_shaft_gear);
if (m_rigid)
couples.push_back(m_rigid_connection);
else
couples.push_back(m_spring_connection);
database.WriteCouples(couples);
}
} // end namespace vehicle
} // end namespace chrono
| 41.022523 | 120 | 0.613649 | iicfcii |
b4779ddd9029d12265fc09f22624ba8f8205dc2a | 4,471 | cpp | C++ | src/thread/future.cpp | Revolution-Populi/fc | 02b7593a96b02d9966358c59d22f344d86fa9a19 | [
"BSL-1.0",
"Apache-2.0",
"Zlib"
] | 37 | 2017-02-04T09:42:48.000Z | 2021-02-17T14:59:15.000Z | src/thread/future.cpp | Revolution-Populi/fc | 02b7593a96b02d9966358c59d22f344d86fa9a19 | [
"BSL-1.0",
"Apache-2.0",
"Zlib"
] | 120 | 2017-11-09T19:46:40.000Z | 2022-01-20T18:26:23.000Z | src/thread/future.cpp | Revolution-Populi/fc | 02b7593a96b02d9966358c59d22f344d86fa9a19 | [
"BSL-1.0",
"Apache-2.0",
"Zlib"
] | 109 | 2017-01-16T14:24:31.000Z | 2022-03-18T21:10:07.000Z | #include <fc/thread/future.hpp>
#include <fc/thread/spin_yield_lock.hpp>
#include <fc/thread/thread.hpp>
#include <fc/thread/unique_lock.hpp>
#include <fc/exception/exception.hpp>
#include <boost/assert.hpp>
namespace fc {
promise_base::promise_base( const char* desc )
:_ready(false),
_blocked_thread(nullptr),
_blocked_fiber_count(0),
_timeout(time_point::maximum()),
_canceled(false),
#ifndef NDEBUG
_cancellation_reason(nullptr),
#endif
_desc(desc),
_compl(nullptr)
{ }
promise_base::~promise_base() { }
const char* promise_base::get_desc()const{
return _desc;
}
void promise_base::cancel(const char* reason /* = nullptr */){
// wlog("${desc} canceled!", ("desc", _desc? _desc : ""));
_canceled = true;
#ifndef NDEBUG
_cancellation_reason = reason;
#endif
}
bool promise_base::ready()const {
return _ready.load();
}
bool promise_base::error()const {
return std::atomic_load( &_exceptp ) != nullptr;
}
void promise_base::set_exception( const fc::exception_ptr& e ){
std::atomic_store( &_exceptp, e );
_set_value(nullptr);
}
void promise_base::_wait( const microseconds& timeout_us ){
if( timeout_us == microseconds::maximum() )
_wait_until( time_point::maximum() );
else
_wait_until( time_point::now() + timeout_us );
}
void promise_base::_wait_until( const time_point& timeout_us ){
if( _ready.load() ) {
fc::exception_ptr ex = std::atomic_load( &_exceptp );
if( ex )
ex->dynamic_rethrow_exception();
return;
}
_enqueue_thread();
// Need to check _ready again to avoid a race condition.
if( _ready.load() )
{
_dequeue_thread();
return _wait_until( timeout_us ); // this will simply return or throw _exceptp
}
std::exception_ptr e;
//
// Create shared_ptr to take ownership of this; i.e. this will
// be deleted when p_this goes out of scope. Consequently,
// it would be Very Bad to let p_this go out of scope
// before we're done reading/writing instance variables!
// See https://github.com/cryptonomex/graphene/issues/597
//
ptr p_this = shared_from_this();
try
{
//
// We clone p_this here because the wait_until() API requires us
// to use std::move(). I.e. wait_until() takes ownership of any
// pointer passed to it. Since we want to keep ownership ourselves,
// we need to have two shared_ptr's to this:
//
// - p_this to keep this alive until the end of the current function
// - p_this2 to be owned by wait_until() as the wait_until() API requires
//
ptr p_this2 = p_this;
thread::current().wait_until( std::move( p_this2 ), timeout_us );
}
catch (...) { e = std::current_exception(); }
_dequeue_thread();
if( e ) std::rethrow_exception(e);
if( _ready.load() ) return _wait_until( timeout_us ); // this will simply return or throw _exceptp
FC_THROW_EXCEPTION( timeout_exception, "" );
}
void promise_base::_enqueue_thread(){
_blocked_fiber_count.fetch_add( 1 );
thread* blocked_thread = _blocked_thread.load();
// only one thread can wait on a promise at any given time
do
assert( !blocked_thread || blocked_thread == &thread::current() );
while( !_blocked_thread.compare_exchange_weak( blocked_thread, &thread::current() ) );
}
void promise_base::_dequeue_thread(){
if( _blocked_fiber_count.fetch_add( -1 ) == 1 )
_blocked_thread.store( nullptr );
}
void promise_base::_notify(){
// copy _blocked_thread into a local so that if the thread unblocks (e.g.,
// because of a timeout) before we get a chance to notify it, we won't be
// calling notify on a null pointer
thread* blocked_thread = _blocked_thread.load();
if( blocked_thread )
blocked_thread->notify( shared_from_this() );
}
void promise_base::_set_value(const void* s){
bool ready = false;
if( !_ready.compare_exchange_strong( ready, true ) ) //don't allow promise to be set more than once
return;
_notify();
auto* hdl = _compl.load();
if( nullptr != hdl )
hdl->on_complete( s, std::atomic_load( &_exceptp ) );
}
void promise_base::_on_complete( detail::completion_handler* c ) {
auto* hdl = _compl.load();
while( !_compl.compare_exchange_weak( hdl, c ) );
delete hdl;
}
}
| 31.70922 | 104 | 0.648624 | Revolution-Populi |
b4795dae218444764446204b4ddddc7b50eb5c3c | 47,717 | cc | C++ | src/components/application_manager/rpc_plugins/sdl_rpc_plugin/test/commands/mobile/add_command_request_test.cc | Sohei-Suzuki-Nexty/sdl_core | 68f082169e0a40fccd9eb0db3c83911c28870f07 | [
"BSD-3-Clause"
] | 5 | 2015-02-26T07:47:26.000Z | 2021-08-03T15:08:53.000Z | src/components/application_manager/rpc_plugins/sdl_rpc_plugin/test/commands/mobile/add_command_request_test.cc | Sohei-Suzuki-Nexty/sdl_core | 68f082169e0a40fccd9eb0db3c83911c28870f07 | [
"BSD-3-Clause"
] | 73 | 2015-11-12T15:36:48.000Z | 2022-02-11T08:09:52.000Z | src/components/application_manager/rpc_plugins/sdl_rpc_plugin/test/commands/mobile/add_command_request_test.cc | Sohei-Suzuki-Nexty/sdl_core | 68f082169e0a40fccd9eb0db3c83911c28870f07 | [
"BSD-3-Clause"
] | 8 | 2015-09-11T08:37:55.000Z | 2021-07-13T19:34:02.000Z | /*
* Copyright (c) 2018, Ford Motor Company
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following
* disclaimer in the documentation and/or other materials provided with the
* distribution.
*
* Neither the name of the Ford Motor Company nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdint.h>
#include <memory>
#include <set>
#include <string>
#include "mobile/add_command_request.h"
#include "gtest/gtest.h"
#include "utils/helpers.h"
#include "application_manager/commands/command_request_test.h"
#include "application_manager/event_engine/event.h"
#include "application_manager/mock_application.h"
#include "application_manager/mock_application_manager.h"
#include "application_manager/mock_help_prompt_manager.h"
#include "application_manager/mock_hmi_interface.h"
#include "application_manager/mock_message_helper.h"
#include "application_manager/mock_resume_ctrl.h"
#include "application_manager/resumption/resumption_data_processor.h"
#include "application_manager/smart_object_keys.h"
#include "smart_objects/smart_object.h"
#include "utils/custom_string.h"
namespace test {
namespace components {
namespace commands_test {
namespace mobile_commands_test {
namespace add_command_request {
namespace am = application_manager;
namespace am_test = application_manager_test;
using am::ApplicationManager;
using am::ApplicationSharedPtr;
using am::commands::CommandImpl;
using am::commands::MessageSharedPtr;
using am::event_engine::EventObserver;
using ns_smart_device_link::ns_smart_objects::SmartObjectSPtr;
using sdl_rpc_plugin::commands::AddCommandRequest;
using ::test::components::application_manager_test::MockApplication;
using ::testing::_;
using ::testing::InSequence;
using ::testing::Return;
using namespace smart_objects;
using app_mngr::commands::RequestFromMobileImpl;
namespace custom_str = utils::custom_string;
namespace strings = ::application_manager::strings;
namespace mobile_result = mobile_apis::Result;
namespace hmi_response = ::application_manager::hmi_response;
namespace hmi_request = ::application_manager::hmi_request;
using namespace strings;
namespace {
const hmi_apis::FunctionID::eType kInvalidFunctionId =
hmi_apis::FunctionID::INVALID_ENUM;
const uint32_t kAppId = 1u;
const uint32_t kCmdId = 1u;
const uint32_t kConnectionKey = 2u;
const std::string kMenuName = "LG";
const uint32_t kFirstParentId = 10u;
const uint32_t kSecondParentId = 1u;
const std::string kErroredVRCommand = "l\namer";
const std::string kFirstVrCommand = "lamer";
const std::string kSecondVrCommand = "hacker";
const uint32_t kFirstCommandId = 10u;
const uint32_t kSecondCommandId = 11u;
const int32_t kType = 34;
const int32_t kGrammarId = 12;
const int32_t kPosition = 10;
} // namespace
class AddCommandRequestTest
: public CommandRequestTest<CommandsTestMocks::kIsNice> {
public:
AddCommandRequestTest()
: msg_(CreateMessage())
, smart_obj_(smart_objects::SmartType_Null)
, default_app_name_("test_default_app_name_")
, lock_ptr_(std::make_shared<sync_primitives::Lock>())
, mock_help_prompt_manager_(
std::make_shared<am_test::MockHelpPromptManager>())
, mock_app_(CreateMockApp()) {
EXPECT_CALL(app_mngr_, application(kConnectionKey))
.WillRepeatedly(Return(mock_app_));
InitGetters();
InitBasicMessage();
}
protected:
void InitBasicMessage() {
(*msg_)[params][connection_key] = kConnectionKey;
(*msg_)[msg_params][app_id] = kAppId;
(*msg_)[msg_params][app_name] = default_app_name_;
}
void InitGetters() {
ON_CALL(*mock_app_, app_id()).WillByDefault(Return(kAppId));
ON_CALL(*mock_app_, FindCommand(kCmdId)).WillByDefault(Return(smart_obj_));
}
void CreateBasicParamsUIRequest() {
SmartObject menu_params = SmartObject(SmartType_Map);
menu_params[position] = kPosition;
menu_params[menu_name] = kMenuName;
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[cmd_id] = kCmdId;
msg_params[strings::menu_params] = menu_params;
msg_params[cmd_icon] = 1;
msg_params[cmd_icon][value] = "10";
msg_params[info] = "UI info";
}
void CreateBasicParamsVRRequest() {
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[cmd_id] = kCmdId;
msg_params[vr_commands] = SmartObject(SmartType_Array);
msg_params[vr_commands][0] = kFirstVrCommand;
msg_params[type] = kPosition;
msg_params[grammar_id] = kGrammarId;
msg_params[info] = "VR info";
}
const am::CommandsMap CreateCommandsMap(SmartObject& first_command,
SmartObject& second_command) {
second_command[menu_params] = SmartObject(SmartType_Map);
second_command[menu_params][hmi_request::parent_id] = kFirstParentId;
second_command[menu_params][menu_name] = kMenuName;
second_command[vr_commands] = SmartObject(SmartType_Array);
second_command[vr_commands][0] = kSecondVrCommand;
am::CommandsMap commands_map;
commands_map.insert(std::make_pair(kFirstCommandId, &first_command));
commands_map.insert(std::make_pair(kSecondCommandId, &second_command));
return commands_map;
}
void CheckOnTimeOutCommandDeletion(
const hmi_apis::FunctionID::eType incoming_cmd,
const hmi_apis::FunctionID::eType cmd_to_delete) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[menu_params][hmi_request::parent_id] = kSecondParentId;
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
SmartObject first_command = SmartObject(SmartType_Map);
SmartObject second_command = SmartObject(SmartType_Map);
const am::CommandsMap commands_map =
CreateCommandsMap(first_command, second_command);
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
SmartObject sub_menu(SmartType_Map);
EXPECT_CALL(*mock_app_, FindSubMenu(kSecondParentId))
.WillOnce(Return(sub_menu));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(mock_rpc_service_, ManageMobileCommand(_, _)).Times(0);
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
Event event(incoming_cmd);
event.set_smart_object(*msg_);
request_ptr->on_event(event);
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(cmd_to_delete), _))
.WillOnce(Return(true));
SmartObjectSPtr response = std::make_shared<SmartObject>(SmartType_Map);
(*response)[strings::msg_params][strings::info] = "info";
EXPECT_CALL(
mock_message_helper_,
CreateNegativeResponse(_, _, _, mobile_apis::Result::GENERIC_ERROR))
.WillOnce(Return(response));
EXPECT_CALL(
mock_rpc_service_,
ManageMobileCommand(response,
am::commands::Command::CommandSource::SOURCE_SDL));
std::shared_ptr<RequestFromMobileImpl> base_class_request =
static_cast<std::shared_ptr<RequestFromMobileImpl> >(request_ptr);
base_class_request->OnTimeOut();
}
MessageSharedPtr msg_;
smart_objects::SmartObject smart_obj_;
const utils::custom_string::CustomString default_app_name_;
std::shared_ptr<sync_primitives::Lock> lock_ptr_;
std::shared_ptr<am_test::MockHelpPromptManager> mock_help_prompt_manager_;
MockAppPtr mock_app_;
};
TEST_F(AddCommandRequestTest, Run_AppNotExisted_EXPECT_AppNotRegistered) {
CreateBasicParamsUIRequest();
EXPECT_CALL(app_mngr_, application(kConnectionKey))
.WillOnce(Return(ApplicationSharedPtr()));
EXPECT_CALL(
mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_result::APPLICATION_NOT_REGISTERED), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_ImageVerificationFailed_EXPECT_INVALID_DATA) {
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::INVALID_DATA));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_DATA), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_ImageVerificationFailed_EXPECT_WARNINGS) {
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::WARNINGS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_MenuNameHasSyntaxError_EXPECT_INVALID_DATA) {
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[menu_params][hmi_request::parent_id] = kFirstParentId;
const std::string errored_menu_name = "L\nG";
msg_params[menu_params][menu_name] = errored_menu_name;
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
SmartObject parent = SmartObject(SmartType_Map);
EXPECT_CALL(*mock_app_, FindSubMenu(kFirstParentId)).WillOnce(Return(parent));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_DATA), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest,
Run_VRCommandsHaveSyntaxError_EXPECT_INVALID_DATA) {
CreateBasicParamsVRRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[vr_commands][0] = kErroredVRCommand;
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_DATA), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_CMDIconHasError_EXPECT_INVALID_DATA) {
MessageSharedPtr msg = CreateMessage();
SmartObject& msg_params = (*msg)[strings::msg_params];
(*msg)[params][connection_key] = kConnectionKey;
msg_params[cmd_id] = kCmdId;
msg_params[cmd_icon] = 1;
const std::string errored_cmd_icon_value = "1\n0";
msg_params[cmd_icon][value] = errored_cmd_icon_value;
msg_params[vr_commands][0] = kFirstVrCommand;
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_DATA), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_CommandIDAlreadyExists_EXPECT_INVALID_ID) {
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
SmartObject existing_cmd_so(smart_objects::SmartType_Map);
EXPECT_CALL(*mock_app_, FindCommand(kCmdId))
.WillOnce(Return(existing_cmd_so));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_ID), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_CommandNameAlreadyExists_EXPECT_Forwarded) {
CreateBasicParamsUIRequest();
(*msg_)[msg_params][menu_name] = kMenuName;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
EXPECT_CALL(*mock_app_, AddCommand(_, (*msg_)[msg_params]));
SmartObject first_command = SmartObject(SmartType_Map);
SmartObject second_command = SmartObject(SmartType_Map);
am::CommandsMap commands_map =
CreateCommandsMap(first_command, second_command);
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest,
Run_CmdAndMsgParentIDsAreDifferentSubmenuNotExisted_EXPECT_INVALID_ID) {
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[menu_params][hmi_request::parent_id] = kSecondParentId;
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
SmartObject first_command = SmartObject(SmartType_Map);
SmartObject second_command = SmartObject(SmartType_Map);
const am::CommandsMap commands_map =
CreateCommandsMap(first_command, second_command);
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
SmartObject invalid_command(SmartType_Null);
EXPECT_CALL(*mock_app_, FindSubMenu(kSecondParentId))
.WillOnce(Return(invalid_command));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_ID), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest,
Run_CmdAndMsgVrSynonymsAreTheSame_EXPECT_DUPLICATE_NAME) {
CreateBasicParamsVRRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[menu_params][hmi_request::parent_id] = kSecondParentId;
msg_params[vr_commands][0] = kSecondVrCommand;
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
SmartObject first_command = SmartObject(SmartType_Map);
SmartObject second_command = SmartObject(SmartType_Map);
const am::CommandsMap commands_map =
CreateCommandsMap(first_command, second_command);
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
SmartObject sub_menu(SmartType_Map);
EXPECT_CALL(*mock_app_, FindSubMenu(kSecondParentId))
.WillOnce(Return(sub_menu));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::DUPLICATE_NAME), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, Run_MsgDataEmpty_EXPECT_INVALID_DATA) {
MessageSharedPtr msg = CreateMessage();
(*msg)[params][connection_key] = kConnectionKey;
SmartObject& msg_params = (*msg)[strings::msg_params];
msg_params[app_id] = kAppId;
msg_params[cmd_id] = kCmdId;
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::INVALID_DATA), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest,
Run_CmdAndMsg_UI_and_Vr_AreCorrect_EXPECT_VR_AND_UI_SENT) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
msg_params[menu_params][hmi_request::parent_id] = kSecondParentId;
SmartObject& image = msg_params[cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
SmartObject first_command = SmartObject(SmartType_Map);
SmartObject second_command = SmartObject(SmartType_Map);
const am::CommandsMap commands_map =
CreateCommandsMap(first_command, second_command);
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
SmartObject sub_menu(SmartType_Map);
EXPECT_CALL(*mock_app_, FindSubMenu(kSecondParentId))
.WillOnce(Return(sub_menu));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(mock_rpc_service_, ManageMobileCommand(_, _)).Times(0);
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, GetRunMethods_SUCCESS) {
CreateBasicParamsUIRequest();
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
EXPECT_CALL(*mock_app_, AddCommand(kCmdId, (*msg_)[msg_params]));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
}
TEST_F(AddCommandRequestTest, OnEvent_UI_SUCCESS) {
CreateBasicParamsUIRequest();
(*msg_)[params][hmi_response::code] = hmi_apis::Common_Result::SUCCESS;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, AddCommand(kCmdId, (*msg_)[msg_params]));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(
Return(DataAccessor<am::CommandsMap>(commands_map, lock_ptr_)));
Event event(hmi_apis::FunctionID::UI_AddCommand);
event.set_smart_object(*msg_);
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(*mock_app_, help_prompt_manager())
.WillOnce(ReturnRef(*mock_help_prompt_manager_));
EXPECT_CALL(*mock_help_prompt_manager_,
OnVrCommandAdded(kCmdId, (*msg_)[msg_params], false));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
request_ptr->on_event(event);
}
TEST_F(AddCommandRequestTest, OnEvent_VR_SUCCESS) {
CreateBasicParamsVRRequest();
MessageSharedPtr msg = CreateMessage(SmartType_Map);
(*msg)[params][hmi_response::code] = hmi_apis::Common_Result::SUCCESS;
(*msg)[msg_params][cmd_id] = kCmdId;
Event event(hmi_apis::FunctionID::VR_AddCommand);
event.set_smart_object(*msg);
EXPECT_CALL(*mock_app_, AddCommand(kCmdId, (*msg_)[msg_params]));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(
Return(DataAccessor<am::CommandsMap>(commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(*mock_app_, help_prompt_manager())
.WillOnce(ReturnRef(*mock_help_prompt_manager_));
EXPECT_CALL(*mock_help_prompt_manager_,
OnVrCommandAdded(kCmdId, (*msg_)[msg_params], false));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
request_ptr->on_event(event);
}
TEST_F(AddCommandRequestTest, OnTimeOut_EXPECT_VR_DeleteCommand) {
CheckOnTimeOutCommandDeletion(hmi_apis::FunctionID::VR_AddCommand,
hmi_apis::FunctionID::VR_DeleteCommand);
}
TEST_F(AddCommandRequestTest, OnTimeOut_EXPECT_UI_DeleteCommand) {
CheckOnTimeOutCommandDeletion(hmi_apis::FunctionID::UI_AddCommand,
hmi_apis::FunctionID::UI_DeleteCommand);
}
TEST_F(AddCommandRequestTest, OnEvent_BothSend_SUCCESS) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::WARNINGS;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
event_vr.set_smart_object(*msg_);
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(*mock_app_, help_prompt_manager())
.WillOnce(ReturnRef(*mock_help_prompt_manager_));
EXPECT_CALL(*mock_help_prompt_manager_, OnVrCommandAdded(kCmdId, _, false));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId)).Times(0);
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
request_ptr->on_event(event_ui);
request_ptr->on_event(event_vr);
}
TEST_F(AddCommandRequestTest, OnEvent_UnknownEvent_UNSUCCESS) {
EXPECT_CALL(mock_rpc_service_, ManageMobileCommand(_, _)).Times(0);
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
Event event(hmi_apis::FunctionID::INVALID_ENUM);
request_ptr->on_event(event);
}
TEST_F(AddCommandRequestTest, OnEvent_AppNotExisted_UNSUCCESS) {
CreateBasicParamsUIRequest();
EXPECT_CALL(app_mngr_, application(kConnectionKey))
.WillOnce(Return(ApplicationSharedPtr()));
Event event(hmi_apis::FunctionID::UI_AddCommand);
EXPECT_CALL(mock_rpc_service_, ManageMobileCommand(_, _)).Times(0);
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->on_event(event);
}
TEST_F(AddCommandRequestTest,
OnEvent_HmiResponseCodeIsRejected_ExpectUICommandRemoved) {
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::REJECTED;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::REJECTED), _));
Event event(hmi_apis::FunctionID::UI_AddCommand);
event.set_smart_object(*msg_);
request_ptr->on_event(event);
}
TEST_F(AddCommandRequestTest,
OnEvent_HmiResponseCodeIsWarnings_ExpectCommandUpdated) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::WARNINGS;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::WARNINGS), _));
EXPECT_CALL(*mock_app_, help_prompt_manager())
.WillOnce(ReturnRef(*mock_help_prompt_manager_));
EXPECT_CALL(*mock_help_prompt_manager_, OnVrCommandAdded(kCmdId, _, false));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
event_vr.set_smart_object(*msg_);
request_ptr->on_event(event_ui);
request_ptr->on_event(event_vr);
}
TEST_F(
AddCommandRequestTest,
OnEvent_UI_HmiResponseCodeIsGenericError_VR_HmiResponseCodeIsUnsupportedResourse_ExpectCommandRemoved) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::GENERIC_ERROR;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_);
request_ptr->on_event(event_ui);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
MessageSharedPtr msg_vr = CreateMessage(SmartType_Map);
(*msg_vr)[strings::params][hmi_response::code] =
hmi_apis::Common_Result::UNSUPPORTED_RESOURCE;
(*msg_vr)[msg_params][cmd_id] = kCmdId;
event_vr.set_smart_object(*msg_vr);
request_ptr->on_event(event_vr);
}
TEST_F(
AddCommandRequestTest,
OnEvent_VR_HmiResponseCodeIsGenericError_UI_HmiResponseCodeIsUnsupportedResourse_ExpectCommandRemoved) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::GENERIC_ERROR;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
event_vr.set_smart_object(*msg_);
request_ptr->on_event(event_vr);
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
MessageSharedPtr msg_ui = CreateMessage(SmartType_Map);
(*msg_ui)[strings::params][hmi_response::code] =
hmi_apis::Common_Result::UNSUPPORTED_RESOURCE;
(*msg_ui)[msg_params][cmd_id] = kCmdId;
event_ui.set_smart_object(*msg_ui);
request_ptr->on_event(event_ui);
}
TEST_F(
AddCommandRequestTest,
OnEvent_UI_VR_HmiResponseCodeIsUnsupportedResourse_UI_NotAvailableInterfaceState_ExpectCommandRemoved) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::UNSUPPORTED_RESOURCE;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_UI))
.WillRepeatedly(
Return(am::HmiInterfaces::InterfaceState::STATE_NOT_AVAILABLE));
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_VR))
.WillRepeatedly(Return(am::HmiInterfaces::STATE_AVAILABLE));
EXPECT_CALL(
mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::UNSUPPORTED_RESOURCE), _));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
event_vr.set_smart_object(*msg_);
request_ptr->on_event(event_ui);
request_ptr->on_event(event_vr);
}
TEST_F(
AddCommandRequestTest,
OnEvent_UI_VR_HmiResponseCodeIsUnsupportedResourse_VR_NotAvailableInterfaceState_ExpectCommandRemoved) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::UNSUPPORTED_RESOURCE;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_UI))
.WillRepeatedly(Return(am::HmiInterfaces::STATE_AVAILABLE));
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_VR))
.WillRepeatedly(
Return(am::HmiInterfaces::InterfaceState::STATE_NOT_AVAILABLE));
EXPECT_CALL(
mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::UNSUPPORTED_RESOURCE), _));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
event_vr.set_smart_object(*msg_);
request_ptr->on_event(event_ui);
request_ptr->on_event(event_vr);
}
TEST_F(
AddCommandRequestTest,
OnEvent_UI_HmiResponseCodeIsUnsupportedResource_NotAvailableInterfaceState_ExpectCommandRemoved) {
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::UNSUPPORTED_RESOURCE;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_UI))
.WillRepeatedly(
Return(am::HmiInterfaces::InterfaceState::STATE_NOT_AVAILABLE));
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_VR))
.WillRepeatedly(
Return(am::HmiInterfaces::InterfaceState::STATE_NOT_AVAILABLE));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
EXPECT_CALL(
mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::UNSUPPORTED_RESOURCE), _));
Event event(hmi_apis::FunctionID::UI_AddCommand);
event.set_smart_object(*msg_);
request_ptr->on_event(event);
}
TEST_F(
AddCommandRequestTest,
OnEvent_VR_HmiResponseCodeIsUnsupportedResource_NotAvailableInterfaceState_ExpectCommandRemoved) {
CreateBasicParamsVRRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::UNSUPPORTED_RESOURCE;
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
EXPECT_CALL(
mock_rpc_service_,
ManageHMICommand(HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_UI))
.WillRepeatedly(
Return(am::HmiInterfaces::InterfaceState::STATE_NOT_AVAILABLE));
EXPECT_CALL(mock_hmi_interfaces_,
GetInterfaceState(am::HmiInterfaces::HMI_INTERFACE_VR))
.WillRepeatedly(
Return(am::HmiInterfaces::InterfaceState::STATE_NOT_AVAILABLE));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
EXPECT_CALL(
mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::UNSUPPORTED_RESOURCE), _));
Event event(hmi_apis::FunctionID::VR_AddCommand);
event.set_smart_object(*msg_);
request_ptr->on_event(event);
}
TEST_F(AddCommandRequestTest,
OnEvent_UI_EventWithNotSuccesResponseCode_ExpectVRCommandDelete) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::SUCCESS;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::GENERIC_ERROR), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
MessageSharedPtr msg_ui = CreateMessage(SmartType_Map);
(*msg_ui)[strings::params][hmi_response::code] =
hmi_apis::Common_Result::ABORTED;
(*msg_ui)[msg_params][cmd_id] = kCmdId;
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_ui);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
event_vr.set_smart_object(*msg_);
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_DeleteCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId)).Times(2);
request_ptr->on_event(event_ui);
request_ptr->on_event(event_vr);
}
TEST_F(AddCommandRequestTest,
OnEvent_UI_VR_Events_VRErrorPresent_ExpectRemoveCommand) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& params = (*msg_)[strings::params];
params[hmi_response::code] = hmi_apis::Common_Result::SUCCESS;
SmartObject& image = (*msg_)[msg_params][cmd_icon];
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
am::CommandsMap commands_map;
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
MobileResultCodeIs(mobile_apis::Result::GENERIC_ERROR), _));
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
Event event_ui(hmi_apis::FunctionID::UI_AddCommand);
event_ui.set_smart_object(*msg_);
request_ptr->on_event(event_ui);
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_DeleteCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId)).Times(2);
Event event_vr(hmi_apis::FunctionID::VR_AddCommand);
MessageSharedPtr msg_vr = CreateMessage(SmartType_Map);
(*msg_vr)[strings::params][hmi_response::code] =
hmi_apis::Common_Result::ABORTED;
(*msg_vr)[msg_params][cmd_id] = kCmdId;
event_vr.set_smart_object(*msg_vr);
request_ptr->on_event(event_vr);
}
TEST_F(AddCommandRequestTest,
OnTimeOut_AppNotExisted_NoAppRemoveCommandCalled) {
CreateBasicParamsUIRequest();
EXPECT_CALL(app_mngr_, application(kConnectionKey))
.WillOnce(Return(ApplicationSharedPtr()));
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId)).Times(0);
SmartObjectSPtr response = std::make_shared<SmartObject>(SmartType_Map);
(*response)[strings::msg_params][strings::info] = "info";
EXPECT_CALL(
mock_message_helper_,
CreateNegativeResponse(_, _, _, mobile_apis::Result::GENERIC_ERROR))
.WillOnce(Return(response));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
response, am::commands::Command::CommandSource::SOURCE_SDL));
std::shared_ptr<RequestFromMobileImpl> base_class_request =
static_cast<std::shared_ptr<RequestFromMobileImpl> >(
CreateCommand<AddCommandRequest>(msg_));
base_class_request->OnTimeOut();
}
TEST_F(AddCommandRequestTest, OnTimeOut_AppRemoveCommandCalled) {
CreateBasicParamsVRRequest();
CreateBasicParamsUIRequest();
SmartObject& msg_params = (*msg_)[strings::msg_params];
SmartObject& image = msg_params[cmd_icon];
msg_params[menu_params][hmi_request::parent_id] = kSecondParentId;
EXPECT_CALL(mock_message_helper_, VerifyImage(image, _, _))
.WillOnce(Return(mobile_apis::Result::SUCCESS));
EXPECT_CALL(*mock_app_, FindCommand(kCmdId)).WillOnce(Return(smart_obj_));
SmartObject first_command = SmartObject(SmartType_Map);
SmartObject second_command = SmartObject(SmartType_Map);
const am::CommandsMap commands_map =
CreateCommandsMap(first_command, second_command);
EXPECT_CALL(*mock_app_, commands_map())
.WillRepeatedly(Return(DataAccessor<application_manager::CommandsMap>(
commands_map, lock_ptr_)));
SmartObject sub_menu(SmartType_Map);
EXPECT_CALL(*mock_app_, FindSubMenu(kSecondParentId))
.WillOnce(Return(sub_menu));
{
InSequence dummy;
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::UI_AddCommand), _))
.WillOnce(Return(true));
EXPECT_CALL(mock_rpc_service_,
ManageHMICommand(
HMIResultCodeIs(hmi_apis::FunctionID::VR_AddCommand), _))
.WillOnce(Return(true));
}
EXPECT_CALL(mock_rpc_service_, ManageMobileCommand(_, _)).Times(0);
std::shared_ptr<AddCommandRequest> request_ptr =
CreateCommand<AddCommandRequest>(msg_);
request_ptr->Run();
EXPECT_CALL(*mock_app_, RemoveCommand(kCmdId));
SmartObjectSPtr response = std::make_shared<SmartObject>(SmartType_Map);
(*response)[strings::msg_params][strings::info] = "info";
EXPECT_CALL(
mock_message_helper_,
CreateNegativeResponse(_, _, _, mobile_apis::Result::GENERIC_ERROR))
.WillOnce(Return(response));
EXPECT_CALL(mock_rpc_service_,
ManageMobileCommand(
response, am::commands::Command::CommandSource::SOURCE_SDL));
std::shared_ptr<RequestFromMobileImpl> base_class_request =
static_cast<std::shared_ptr<RequestFromMobileImpl> >(request_ptr);
base_class_request->OnTimeOut();
}
} // namespace add_command_request
} // namespace mobile_commands_test
} // namespace commands_test
} // namespace components
} // namespace test
| 40.472434 | 108 | 0.73959 | Sohei-Suzuki-Nexty |
b47d03c744f790f2be2d4b36804b0db8d951e0cd | 1,262 | cpp | C++ | trading_technologies/main.cpp | akhiltiwari13/phyllanthus_emblica | 7c7bb65270b94f13216ab2d8f25bad74f78c813d | [
"MIT"
] | null | null | null | trading_technologies/main.cpp | akhiltiwari13/phyllanthus_emblica | 7c7bb65270b94f13216ab2d8f25bad74f78c813d | [
"MIT"
] | null | null | null | trading_technologies/main.cpp | akhiltiwari13/phyllanthus_emblica | 7c7bb65270b94f13216ab2d8f25bad74f78c813d | [
"MIT"
] | null | null | null | #include <cstdint>
#include <stdexcept>
#include <iostream>
enum Side { NONE, LEFT, RIGHT };
class ChainLink
{
public:
void append(ChainLink* rightPart)
{
if (this->right != NULL)
throw std::logic_error("Link is already connected.");
this->right = rightPart;
rightPart->left = this;
}
Side longerSide()
{
/* throw std::logic_error("Waiting to be implemented"); */
auto cur = left;
uint32_t leftLen{0};
uint32_t rightLen{0};
while((cur != nullptr) && (cur != right)){
cur = cur->left;
++leftLen;
}
if(cur == right)
return Side::NONE;
// reset curr
cur = right;
while(cur != nullptr) {
cur = cur->right;
++rightLen;
}
if (rightLen == leftLen )
return Side::NONE;
return rightLen>leftLen? Side::RIGHT : Side::LEFT;
}
private:
ChainLink* left;
ChainLink* right;
};
#ifndef RunTests
int main()
{
ChainLink* left = new ChainLink();
ChainLink* middle = new ChainLink();
ChainLink* right = new ChainLink();
left->append(middle);
middle->append(right);
std::cout << left->longerSide();
}
#endif
| 21.033333 | 66 | 0.538827 | akhiltiwari13 |
b47f1a4bdafe07ec3dd893ab7c26441475ccc87b | 2,817 | cpp | C++ | discrete-maths/graph-planarity/a_graph_embedding.cpp | nothingelsematters/university | 5561969b1b11678228aaf7e6660e8b1a93d10294 | [
"WTFPL"
] | 1 | 2018-06-03T17:48:50.000Z | 2018-06-03T17:48:50.000Z | discrete-maths/graph-planarity/a_graph_embedding.cpp | nothingelsematters/University | b1e188cb59e5a436731b92c914494626a99e1ae0 | [
"WTFPL"
] | null | null | null | discrete-maths/graph-planarity/a_graph_embedding.cpp | nothingelsematters/University | b1e188cb59e5a436731b92c914494626a99e1ae0 | [
"WTFPL"
] | 14 | 2019-04-07T21:27:09.000Z | 2021-12-05T13:37:25.000Z | #include <iostream>
bool bipartition(std::pair<size_t, size_t>* edges, size_t* hamilton_cycle, bool* partition, size_t edges_size,
bool* visited, size_t current_index, bool first_part = true) {
if (visited[current_index]) {
return partition[current_index] == first_part;
}
visited[current_index] = true;
partition[current_index] = first_part;
auto current = edges[current_index];
std::pair<size_t, size_t> hamilton_current({hamilton_cycle[current.first], hamilton_cycle[current.second]});
for (size_t i = 0; i < edges_size; ++i) {
if (!((hamilton_current.first < hamilton_cycle[edges[i].first] &&
hamilton_cycle[edges[i].first] < hamilton_current.second &&
hamilton_current.second < hamilton_cycle[edges[i].second]) ||
(hamilton_current.first > hamilton_cycle[edges[i].first] &&
hamilton_cycle[edges[i].second] > hamilton_current.first &&
hamilton_current.second > hamilton_cycle[edges[i].second]))) {
continue;
}
if (!bipartition(edges, hamilton_cycle, partition, edges_size, visited, i, !first_part)) {
return false;
}
}
return true;
}
int main() {
size_t vertex_size;
size_t edges_size;
std::cin >> vertex_size >> edges_size;
std::pair<size_t, size_t>* edges = new std::pair<size_t, size_t>[edges_size];
size_t* hamilton_cycle = new size_t[vertex_size];
bool* partition = new bool[edges_size];
std::fill(partition, partition + edges_size, false);
for (size_t i = 0; i < edges_size; ++i) {
std::cin >> edges[i].first >> edges[i].second;
}
for (size_t i = 0; i < vertex_size; ++i) {
size_t vertex;
std::cin >> vertex;
hamilton_cycle[vertex - 1] = i;
}
for (size_t i = 0; i < edges_size; ++i) {
if (hamilton_cycle[--edges[i].first] > hamilton_cycle[--edges[i].second]) {
std::swap(edges[i].first, edges[i].second);
}
}
bool* visited = new bool[edges_size];
std::fill(visited, visited + edges_size, false);
for (size_t i = 0; i < edges_size; ++i) {
if (!visited[i] && !bipartition(edges, hamilton_cycle, partition, edges_size,
visited, i)) {
std::cout << "NO\n";
return 0;
}
}
std::cout << "YES\n";
for (size_t i = 0; i < vertex_size; ++i) {
std::cout << 2 * hamilton_cycle[i] << ' ' << 0 << ' ';
}
std::cout << '\n';
for (size_t i = 0; i < edges_size; ++i) {
size_t edge_begin = hamilton_cycle[edges[i].first];
size_t edge_end = hamilton_cycle[edges[i].second];
std::cout << edge_begin + edge_end << ' ' <<
(partition[i] ? 1 : -1) * abs(edge_begin - edge_end) << '\n';
}
}
| 35.2125 | 112 | 0.586084 | nothingelsematters |
b47fb2c62845996fb27441aaab474f3b6ed7726e | 2,778 | hpp | C++ | lib/src/Delphi/Syntax/Statements/DelphiRaiseStatementSyntax.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | null | null | null | lib/src/Delphi/Syntax/Statements/DelphiRaiseStatementSyntax.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | 50 | 2021-06-30T20:01:50.000Z | 2021-11-28T16:21:26.000Z | lib/src/Delphi/Syntax/Statements/DelphiRaiseStatementSyntax.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | null | null | null | #ifndef INTERLINCK_DELPHI_SYNTAX_STATEMENTS_DELPHIRAISESTATEMENTSYNTAX_H
#define INTERLINCK_DELPHI_SYNTAX_STATEMENTS_DELPHIRAISESTATEMENTSYNTAX_H
#include "interlinck/Core/Syntax/SyntaxVariant.hpp"
#include "interlinck/Core/Types.hpp"
#include "Core/Basic/Macros.hpp"
#include "Delphi/Syntax/Statements/DelphiStatementSyntax.hpp"
namespace interlinck::Core::Support
{
class SyntaxFactory;
} // end namespace interlinck::Core::Support
namespace interlinck::Core::Syntax
{
class ISyntaxToken;
} // end namespace interlinck::Core::Syntax
namespace interlinck::Delphi::Syntax
{
class DelphiExpressionSyntax;
class DelphiRaiseStatementSyntax : public DelphiStatementSyntax
{
public:
explicit DelphiRaiseStatementSyntax(const Core::Syntax::ISyntaxToken* raiseKeyword,
const Core::Syntax::ISyntaxToken* semiColonToken,
const DelphiExpressionSyntax* expression = nullptr) noexcept;
~DelphiRaiseStatementSyntax() noexcept override = default;
inline const Core::Syntax::ISyntaxToken* raiseKeyword() const noexcept { return _raiseKeyword; }
inline const DelphiExpressionSyntax* expression() const noexcept { return _expression; }
inline const Core::Syntax::ISyntaxToken* semiColonToken() const noexcept { return _semiColonToken; }
inline il_size childCount() const noexcept final { return _expression != nullptr ? 3 : 2; }
Core::Syntax::SyntaxVariant child(il_size index) const noexcept final;
inline Core::Syntax::SyntaxVariant first() const noexcept final { return Core::Syntax::SyntaxVariant::asToken(_raiseKeyword); }
inline Core::Syntax::SyntaxVariant last() const noexcept final { return Core::Syntax::SyntaxVariant::asToken(_semiColonToken); }
inline il_string typeName() const noexcept override { CREATE_TYPENAME(DelphiRaiseStatementSyntax) }
inline bool isRaiseStatement() const noexcept final { return true; }
static const DelphiRaiseStatementSyntax* create(Core::Support::SyntaxFactory& syntaxFactory,
const Core::Syntax::ISyntaxToken* raiseKeyword,
const Core::Syntax::ISyntaxToken* semiColonToken,
const DelphiExpressionSyntax* expression = nullptr) noexcept;
private:
const Core::Syntax::ISyntaxToken* _raiseKeyword;
const Core::Syntax::ISyntaxToken* _semiColonToken;
// might be optional; for example in an exception block
//
// except
// raise; <-- re-raises the exception
const DelphiExpressionSyntax* _expression;
};
} // end namespace interlinck::Delphi::Syntax
#endif // INTERLINCK_DELPHI_SYNTAX_STATEMENTS_DELPHIRAISESTATEMENTSYNTAX_H
| 40.26087 | 132 | 0.719942 | henrikfroehling |
b480038da169d5118a8875c3d30acadae6284878 | 184 | cpp | C++ | documents/Buffer Overflow/main.cpp | sspony/oop244 | 4fdf8abf58f52b0c083eb6dad65ad4dfcdd4397a | [
"MIT"
] | null | null | null | documents/Buffer Overflow/main.cpp | sspony/oop244 | 4fdf8abf58f52b0c083eb6dad65ad4dfcdd4397a | [
"MIT"
] | null | null | null | documents/Buffer Overflow/main.cpp | sspony/oop244 | 4fdf8abf58f52b0c083eb6dad65ad4dfcdd4397a | [
"MIT"
] | null | null | null | #include <iostream>
#include "Foo.h"
using namespace std;
int main (void)
{
Foo theFoo;
cout << theFoo;
theFoo.SetMsg("Hello World");
cout << theFoo;
return 0;
}
| 12.266667 | 31 | 0.608696 | sspony |
b48053bf9790f7fe0af1be9aa6984f5e050ac4a2 | 5,344 | hpp | C++ | src/lib/optimizer/strategy/subquery_to_join_rule.hpp | mrcl-tst/hyrise | eec50b39de9f530b0a1732ceb5822b7222f3fe17 | [
"MIT"
] | 583 | 2015-01-10T00:55:32.000Z | 2022-03-25T12:24:30.000Z | src/lib/optimizer/strategy/subquery_to_join_rule.hpp | mrcl-tst/hyrise | eec50b39de9f530b0a1732ceb5822b7222f3fe17 | [
"MIT"
] | 1,573 | 2015-01-07T15:47:22.000Z | 2022-03-31T11:48:03.000Z | src/lib/optimizer/strategy/subquery_to_join_rule.hpp | mrcl-tst/hyrise | eec50b39de9f530b0a1732ceb5822b7222f3fe17 | [
"MIT"
] | 145 | 2015-03-09T16:26:07.000Z | 2022-02-15T12:53:23.000Z | #pragma once
#include "abstract_rule.hpp"
#include "expression/abstract_expression.hpp"
#include "types.hpp"
namespace opossum {
class AbstractExpression;
class AbstractLQPNode;
class AliasNode;
class AggregateNode;
class BinaryPredicateExpression;
class LQPSubqueryExpression;
class PredicateNode;
class ProjectionNode;
/**
* Optimizes:
* - (NOT) IN predicates with a subquery as the right operand
* - (NOT) EXISTS predicates
* - comparison (<,>,<=,>=,=,<>) predicates with subquery as the right operand
* Does not currently optimize:
* - (NOT) IN expressions where
* - the left value is not a column expression.
* - NOT IN with a correlated subquery
* - Correlated subqueries where the correlated parameter
* - is used outside predicates
* - is used in predicates at a point where it cannot be pulled up into a join predicate (below limits, etc.)
*/
class SubqueryToJoinRule : public AbstractRule {
public:
std::string name() const override;
struct PredicateNodeInfo {
/**
* Join predicate to achieve the semantic of the input expression type (IN, comparison, ...) in the created join.
*
* This can be nullptr (for (NOT) EXISTS), in this case only the join predicates from correlated predicates in the
* subquery will be used in the created join.
*/
std::shared_ptr<BinaryPredicateExpression> join_predicate;
JoinMode join_mode;
std::shared_ptr<LQPSubqueryExpression> subquery;
};
/**
* Result of pulling up correlated predicates from an LQP.
*/
struct PredicatePullUpResult {
std::shared_ptr<AbstractLQPNode> adapted_lqp;
std::vector<std::shared_ptr<BinaryPredicateExpression>> join_predicates;
size_t pulled_predicate_node_count = 0;
/**
* Expressions from the subquery required by the extracted join predicates.
*
* This list contains every expression only once, even if it is used (required) by multiple join predicates.
* This is a vector instead of an unordered_set so that tests are reproducible. Since correlation is usually very
* low there shouldn't be much of a performance difference.
*/
std::vector<std::shared_ptr<AbstractExpression>> required_output_expressions = {};
};
/**
* Extract information about the input LQP into a general format.
*
* Returns nullopt if the LQP does not match one of the supported formats.
*/
static std::optional<PredicateNodeInfo> is_predicate_node_join_candidate(const PredicateNode& predicate_node);
/**
* Searches for usages of correlated parameters.
*
* The first boolean is false when a correlated parameter is used outside of PredicateNodes (for example in joins).
* In this case we can never optimize this LQP. If it is true, the size_t contains the number of PredicateNodes in
* the LQP that use correlated parameters.
*/
static std::pair<bool, size_t> assess_correlated_parameter_usage(
const std::shared_ptr<AbstractLQPNode>& lqp,
const std::map<ParameterID, std::shared_ptr<AbstractExpression>>& parameter_mapping);
/**
* Tries to safely extract new join predicates from a PredicateNode.
*
* Returns a binary predicate expressions where the left operand is always the expression associated with the
* correlated parameter (and thus a column from the left subtree) and the right operand a column from the subqueries
* LQP. Also returns a new expression containing all non-correlated parts of the original nodes expression. If
* every part of the original nodes expression was turned into join predicates, nullptr is returned instead.
*/
static std::pair<std::vector<std::shared_ptr<BinaryPredicateExpression>>, std::shared_ptr<AbstractExpression>>
try_to_extract_join_predicates(const std::shared_ptr<PredicateNode>& predicate_node,
const std::map<ParameterID, std::shared_ptr<AbstractExpression>>& parameter_mapping,
bool is_below_aggregate);
/**
* Copy an aggregate node and adapt it to group by all required columns.
*/
static std::shared_ptr<AggregateNode> adapt_aggregate_node(
const std::shared_ptr<AggregateNode>& node,
const std::vector<std::shared_ptr<AbstractExpression>>& required_output_expressions);
/**
* Copy an alias node and adapt it to keep all required columns.
*/
static std::shared_ptr<AliasNode> adapt_alias_node(
const std::shared_ptr<AliasNode>& node,
const std::vector<std::shared_ptr<AbstractExpression>>& required_output_expressions);
/**
* Copy a projection node and adapt it to keep all required columns.
*/
static std::shared_ptr<ProjectionNode> adapt_projection_node(
const std::shared_ptr<ProjectionNode>& node,
const std::vector<std::shared_ptr<AbstractExpression>>& required_output_expressions);
/**
* Walk the subquery LQP, removing all correlated PredicateNodes and adapting other nodes as necessary.
*/
static PredicatePullUpResult pull_up_correlated_predicates(
const std::shared_ptr<AbstractLQPNode>& node,
const std::map<ParameterID, std::shared_ptr<AbstractExpression>>& parameter_mapping);
protected:
void _apply_to_plan_without_subqueries(const std::shared_ptr<AbstractLQPNode>& lqp_root) const override;
};
} // namespace opossum
| 40.484848 | 118 | 0.732036 | mrcl-tst |
b4835ccb7a3c3fe7cab83e3b6246ac0a76449464 | 6,285 | cc | C++ | src/relay/analysis/kind_check.cc | heweiwill/incubator-tvm | 5317afb79616454a27dedd4cf3b28dd0986aacdb | [
"Apache-2.0"
] | 5 | 2020-06-19T03:22:24.000Z | 2021-03-17T22:16:48.000Z | src/relay/analysis/kind_check.cc | heweiwill/incubator-tvm | 5317afb79616454a27dedd4cf3b28dd0986aacdb | [
"Apache-2.0"
] | 2 | 2020-07-08T12:34:59.000Z | 2020-07-11T15:54:47.000Z | src/relay/analysis/kind_check.cc | heweiwill/incubator-tvm | 5317afb79616454a27dedd4cf3b28dd0986aacdb | [
"Apache-2.0"
] | 2 | 2019-08-24T00:06:36.000Z | 2022-03-03T02:07:27.000Z | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
/*!
*
* \file kindchecker.cc
*
* \brief Check that types are well formed by applying "kinding rules".
*
* This pass ensures we do not do things that violate the design of the
* type system when writing down types.
*
* For example tensors are not allowed to contain functions in Relay.
*
* We check this by ensuring the `dtype` field of a Tensor always
* contains a data type such as `int`, `float`, `uint`.
*/
#include <tvm/ir/type_functor.h>
#include <tvm/relay/analysis.h>
#include <tvm/ir/error.h>
namespace tvm {
namespace relay {
using namespace tvm::runtime;
struct KindChecker : TypeFunctor<Kind(const Type&)> {
const IRModule& mod;
ErrorReporter err_reporter;
explicit KindChecker(const IRModule& mod) : mod(mod), err_reporter() {}
void ReportFatalError(const Error& err) {
this->err_reporter.Report(err);
this->err_reporter.RenderErrors(mod);
}
void CheckKindMatches(const Type& t, const Type& outer,
Kind expected, const std::string& description) {
Kind k = this->VisitType(t);
if (k != expected) {
ReportFatalError(ErrorBuilder()
<< "Incorrect kind for a " << description
<< ". Type " << t << " inside " << outer
<< " is of kind " << k
<< " but was expected to be "
<< expected);
}
}
Kind VisitType_(const IncompleteTypeNode* op) override {
return op->kind;
}
Kind VisitType_(const TypeVarNode* op) override {
return op->kind;
}
Kind VisitType_(const GlobalTypeVarNode* op) override {
return op->kind;
}
Kind VisitType_(const TensorTypeNode* op) override {
return Kind::kType;
}
Kind VisitType_(const TupleTypeNode* op) override {
// tuples should only contain normal types
for (const Type& t : op->fields) {
CheckKindMatches(t, GetRef<TupleType>(op), Kind::kType,
"tuple member");
}
return Kind::kType;
}
Kind VisitType_(const FuncTypeNode* op) override {
// Func types should only take normal types for arguments
// and only return a normal type. They should also have
// well-formed constraints
FuncType ft = GetRef<FuncType>(op);
for (const Type& t : op->arg_types) {
CheckKindMatches(t, ft, Kind::kType, "function type parameter");
}
CheckKindMatches(ft->ret_type, ft, Kind::kType, "function return type");
for (const TypeConstraint& tc : op->type_constraints) {
CheckKindMatches(tc, ft, Kind::kConstraint, "function type constraint");
}
return Kind::kType;
}
Kind VisitType_(const RelayRefTypeNode* op) override {
// ref types should only contain normal types
RelayRefType rt = GetRef<RelayRefType>(op);
CheckKindMatches(op->value, rt, Kind::kType, "ref contents");
return Kind::kType;
}
Kind VisitType_(const TypeRelationNode* op) override {
// arguments to type relation should be normal types
for (const Type& t : op->args) {
CheckKindMatches(t, GetRef<TypeRelation>(op), Kind::kType,
"argument to type relation");
}
return Kind::kConstraint;
}
Kind VisitType_(const TypeCallNode* op) override {
// type call func should be a global type var, args should be type
TypeCall tc = GetRef<TypeCall>(op);
const auto* gtv = op->func.as<GlobalTypeVarNode>();
if (gtv == nullptr) {
ReportFatalError(
ErrorBuilder() <<"The callee in " << tc
<< " is not a global type var, but is " << op->func);
}
CheckKindMatches(op->func, tc, Kind::kAdtHandle, "type call function");
for (const Type& t : op->args) {
CheckKindMatches(t, tc, Kind::kType, "type call argument");
}
// finally we need to check the module to check the number of type params
auto var = GetRef<GlobalTypeVar>(gtv);
auto data = mod->LookupTypeDef(var);
if (data->type_vars.size() != op->args.size()) {
ReportFatalError(ErrorBuilder()
<< "Expected " << data->type_vars.size() << "arguments for " << tc
<< "; got " << op->args.size());
}
return Kind::kType;
}
Kind VisitType_(const TypeDataNode* op) override {
// Constructors can reference the header var, but no other GlobalTypeVars.
// In theory, a TypeData could be nested, so the header scope
// should be tracked recursively, but it is unclear that we need
// to support it.
TypeData td = GetRef<TypeData>(op);
CheckKindMatches(op->header, td, Kind::kAdtHandle, "type data header");
for (const auto& var : op->type_vars) {
CheckKindMatches(var, td, Kind::kType, "ADT type var");
}
for (const auto& con : op->constructors) {
if (!con->belong_to.same_as(op->header)) {
ReportFatalError(ErrorBuilder()
<<con << " has header " << con->belong_to
<< " but " << op << " has header " << op->header);
}
for (const Type& t : con->inputs) {
CheckKindMatches(t, td, Kind::kType, "ADT constructor input");
}
}
return Kind::kTypeData;
}
Kind Check(const Type& t) {
return this->VisitType(t);
}
};
Kind KindCheck(const Type& t, const IRModule& mod) {
KindChecker kc(mod);
return kc.Check(t);
}
TVM_REGISTER_GLOBAL("relay.analysis.check_kind")
.set_body([](TVMArgs args, TVMRetValue* ret) {
if (args.size() == 1) {
*ret = KindCheck(args[0], IRModule({}, {}));
} else {
*ret = KindCheck(args[0], args[1]);
}
});
} // namespace relay
} // namespace tvm
| 31.425 | 78 | 0.648846 | heweiwill |
b483edc29433ebcce8397fc2fe7b4556fa6df288 | 1,571 | cpp | C++ | tests/math_unit/math/fwd/scal/fun/pow_test.cpp | alashworth/stan-monorepo | 75596bc1f860ededd7b3e9ae9002aea97ee1cd46 | [
"BSD-3-Clause"
] | 1 | 2019-09-06T15:53:17.000Z | 2019-09-06T15:53:17.000Z | tests/math_unit/math/fwd/scal/fun/pow_test.cpp | alashworth/stan-monorepo | 75596bc1f860ededd7b3e9ae9002aea97ee1cd46 | [
"BSD-3-Clause"
] | 8 | 2019-01-17T18:51:16.000Z | 2019-01-17T18:51:39.000Z | tests/math_unit/math/fwd/scal/fun/pow_test.cpp | alashworth/stan-monorepo | 75596bc1f860ededd7b3e9ae9002aea97ee1cd46 | [
"BSD-3-Clause"
] | null | null | null | #include <stan/math/fwd/scal.hpp>
#include <gtest/gtest.h>
#include <math/fwd/scal/fun/nan_util.hpp>
TEST(AgradFwdPow, Fvar) {
using stan::math::fvar;
using std::isnan;
using std::log;
using std::pow;
fvar<double> x(0.5, 1.0);
double y = 5.0;
fvar<double> a = pow(x, y);
EXPECT_FLOAT_EQ(pow(0.5, 5.0), a.val_);
EXPECT_FLOAT_EQ(5.0 * pow(0.5, 5.0 - 1.0), a.d_);
fvar<double> b = pow(y, x);
EXPECT_FLOAT_EQ(pow(5.0, 0.5), b.val_);
EXPECT_FLOAT_EQ(log(5.0) * pow(5.0, 0.5), b.d_);
fvar<double> z(1.2, 2.0);
fvar<double> c = pow(x, z);
EXPECT_FLOAT_EQ(pow(0.5, 1.2), c.val_);
EXPECT_FLOAT_EQ((2.0 * log(0.5) + 1.2 * 1.0 / 0.5) * pow(0.5, 1.2), c.d_);
fvar<double> w(-0.4, 1.0);
fvar<double> d = pow(w, x);
isnan(d.val_);
isnan(d.d_);
}
TEST(AgradFwdPow, FvarFvarDouble) {
using stan::math::fvar;
using std::log;
using std::pow;
fvar<fvar<double> > x;
x.val_.val_ = 0.5;
x.val_.d_ = 1.0;
fvar<fvar<double> > y;
y.val_.val_ = 0.5;
y.d_.val_ = 1.0;
fvar<fvar<double> > a = pow(x, y);
EXPECT_FLOAT_EQ(pow(0.5, 0.5), a.val_.val_);
EXPECT_FLOAT_EQ(0.5 * pow(0.5, -0.5), a.val_.d_);
EXPECT_FLOAT_EQ(log(0.5) * pow(0.5, 0.5), a.d_.val_);
EXPECT_FLOAT_EQ(pow(0.5, -0.5) * (0.5 * log(0.5) + 1.0), a.d_.d_);
}
struct pow_fun {
template <typename T0, typename T1>
inline typename boost::math::tools::promote_args<T0, T1>::type operator()(
const T0 arg1, const T1 arg2) const {
return pow(arg1, arg2);
}
};
TEST(AgradFwdPow, nan_0) {
pow_fun pow_;
test_nan_fwd(pow_, 3.0, 5.0, false);
}
| 23.80303 | 76 | 0.602801 | alashworth |
b486e13ea20cff2c3d3b82c920400ce2eae2ea1c | 13,660 | cpp | C++ | src/modules/processes/contrib/nvolkov/CosmeticCorrection/CosmeticCorrectionParameters.cpp | fmeschia/pixinsight-class-library | 11b956e27d6eee3e119a7b1c337d090d7a03f436 | [
"JasPer-2.0",
"libtiff"
] | null | null | null | src/modules/processes/contrib/nvolkov/CosmeticCorrection/CosmeticCorrectionParameters.cpp | fmeschia/pixinsight-class-library | 11b956e27d6eee3e119a7b1c337d090d7a03f436 | [
"JasPer-2.0",
"libtiff"
] | null | null | null | src/modules/processes/contrib/nvolkov/CosmeticCorrection/CosmeticCorrectionParameters.cpp | fmeschia/pixinsight-class-library | 11b956e27d6eee3e119a7b1c337d090d7a03f436 | [
"JasPer-2.0",
"libtiff"
] | null | null | null | // ____ ______ __
// / __ \ / ____// /
// / /_/ // / / /
// / ____// /___ / /___ PixInsight Class Library
// /_/ \____//_____/ PCL 2.4.9
// ----------------------------------------------------------------------------
// Standard CosmeticCorrection Process Module Version 1.2.5
// ----------------------------------------------------------------------------
// CosmeticCorrectionParameters.cpp - Released 2021-04-09T19:41:49Z
// ----------------------------------------------------------------------------
// This file is part of the standard CosmeticCorrection PixInsight module.
//
// Copyright (c) 2011-2020 Nikolay Volkov
// Copyright (c) 2003-2020 Pleiades Astrophoto S.L.
//
// Redistribution and use in both source and binary forms, with or without
// modification, is permitted provided that the following conditions are met:
//
// 1. All redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. All redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the names "PixInsight" and "Pleiades Astrophoto", nor the names
// of their contributors, may be used to endorse or promote products derived
// from this software without specific prior written permission. For written
// permission, please contact [email protected].
//
// 4. All products derived from this software, in any form whatsoever, must
// reproduce the following acknowledgment in the end-user documentation
// and/or other materials provided with the product:
//
// "This product is based on software from the PixInsight project, developed
// by Pleiades Astrophoto and its contributors (https://pixinsight.com/)."
//
// Alternatively, if that is where third-party acknowledgments normally
// appear, this acknowledgment must be reproduced in the product itself.
//
// THIS SOFTWARE IS PROVIDED BY PLEIADES ASTROPHOTO AND ITS CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL PLEIADES ASTROPHOTO OR ITS
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, BUSINESS
// INTERRUPTION; PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; AND LOSS OF USE,
// DATA OR PROFITS) 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 "CosmeticCorrectionParameters.h"
namespace pcl
{
// ----------------------------------------------------------------------------
CCTargetFrames* TheTargetFrames = nullptr;
CCTargetFrameEnabled* TheTargetFrameEnabled = nullptr;
CCTargetFramePath* TheTargetFramePath = nullptr;
CCOutputDir* TheOutputDir = nullptr;
CCOutputExtension* TheOutputExtension = nullptr;
CCPrefix* ThePrefix = nullptr;
CCPostfix* ThePostfix = nullptr;
CCOverwrite* TheOverwrite = nullptr;
CCCFA* TheCFA = nullptr;
CCAmount* TheAmount = nullptr;
CCUseMasterDark* TheUseMasterDark = nullptr;
CCMasterDarkPath* TheMasterPath = nullptr;
CCHotDarkCheck* TheHotDarkCheck = nullptr;
CCColdLevel* TheColdLevel = nullptr;
CCColdDarkCheck* TheColdDarkCheck = nullptr;
CCHotLevel* TheHotLevel = nullptr;
CCUseAutoDetect* TheUseAutoDetect = nullptr;
CCHotAutoCheck* TheHotAutoCheck = nullptr;
CCHotAutoValue* TheHotAutoValue = nullptr;
CCColdAutoCheck* TheColdAutoCheck = nullptr;
CCColdAutoValue* TheColdAutoValue = nullptr;
CCUseDefectList* TheUseDefectList = nullptr;
CCDefects* TheDefects = nullptr;
CCDefectEnabled* TheDefectEnabled = nullptr;
CCDefectIsRow* TheDefectIsRow = nullptr;
CCDefectAddress* TheDefectAddress = nullptr;
CCDefectIsRange* TheDefectIsRange = nullptr;
CCDefectBegin* TheDefectBegin = nullptr;
CCDefectEnd* TheDefectEnd = nullptr;
// ----------------------------------------------------------------------------
CCTargetFrames::CCTargetFrames( MetaProcess* P )
: MetaTable( P )
{
TheTargetFrames = this;
}
IsoString CCTargetFrames::Id() const
{
return "targetFrames";
}
// ----------------------------------------------------------------------------
CCTargetFrameEnabled::CCTargetFrameEnabled( MetaTable* T )
: MetaBoolean( T )
{
TheTargetFrameEnabled = this;
}
IsoString CCTargetFrameEnabled::Id() const
{
return "enabled";
}
bool CCTargetFrameEnabled::DefaultValue() const
{
return true;
}
// ----------------------------------------------------------------------------
CCTargetFramePath::CCTargetFramePath( MetaTable* T )
: MetaString( T )
{
TheTargetFramePath = this;
}
IsoString CCTargetFramePath::Id() const
{
return "path";
}
// ----------------------------------------------------------------------------
CCOutputDir::CCOutputDir( MetaProcess* P )
: MetaString( P )
{
TheOutputDir = this;
}
IsoString CCOutputDir::Id() const
{
return "outputDir";
}
// ----------------------------------------------------------------------------
CCOutputExtension::CCOutputExtension( MetaProcess* P )
: MetaString( P )
{
TheOutputExtension = this;
}
IsoString CCOutputExtension::Id() const
{
return "outputExtension";
}
String CCOutputExtension::DefaultValue() const
{
return ".xisf";
}
// ----------------------------------------------------------------------------
CCPrefix::CCPrefix( MetaProcess* P )
: MetaString( P )
{
ThePrefix = this;
}
IsoString CCPrefix::Id() const
{
return "prefix";
}
String CCPrefix::DefaultValue() const
{
return "";
}
// ----------------------------------------------------------------------------
CCPostfix::CCPostfix( MetaProcess* P )
: MetaString( P )
{
ThePostfix = this;
}
IsoString CCPostfix::Id() const
{
return "postfix";
}
String CCPostfix::DefaultValue() const
{
return "_cc";
}
// ----------------------------------------------------------------------------
CCOverwrite::CCOverwrite( MetaProcess* P )
: MetaBoolean( P )
{
TheOverwrite = this;
}
IsoString CCOverwrite::Id() const
{
return "overwrite";
}
bool CCOverwrite::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCCFA::CCCFA( MetaProcess* P )
: MetaBoolean( P )
{
TheCFA = this;
}
IsoString CCCFA::Id() const
{
return "cfa";
}
bool CCCFA::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCAmount::CCAmount( MetaProcess* P )
: MetaFloat( P )
{
TheAmount = this;
}
IsoString CCAmount::Id() const
{
return "amount";
}
IsoString CCAmount::Aliases() const
{
return "transferFn";
}
int CCAmount::Precision() const
{
return 2;
}
double CCAmount::DefaultValue() const
{
return 1;
}
double CCAmount::MinimumValue() const
{
return 0;
}
double CCAmount::MaximumValue() const
{
return 1;
}
// -----------------------------------------------------------Via Master Dark-----------------
CCUseMasterDark::CCUseMasterDark( MetaProcess* P )
: MetaBoolean( P )
{
TheUseMasterDark = this;
}
IsoString CCUseMasterDark::Id() const
{
return "useMasterDark";
}
bool CCUseMasterDark::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCMasterDarkPath::CCMasterDarkPath( MetaProcess* P )
: MetaString( P )
{
TheMasterPath = this;
}
IsoString CCMasterDarkPath::Id() const
{
return "masterDarkPath";
}
// ----------------------------------------------------------------------------
CCHotDarkCheck::CCHotDarkCheck( MetaProcess* P )
: MetaBoolean( P )
{
TheHotDarkCheck = this;
}
IsoString CCHotDarkCheck::Id() const
{
return "hotDarkCheck";
}
bool CCHotDarkCheck::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCHotLevel::CCHotLevel( MetaProcess* P )
: MetaFloat( P )
{
TheHotLevel = this;
}
IsoString CCHotLevel::Id() const
{
return "hotDarkLevel";
}
int CCHotLevel::Precision() const
{
return 10;
}
double CCHotLevel::DefaultValue() const
{
return 1;
}
double CCHotLevel::MinimumValue() const
{
return 0;
}
double CCHotLevel::MaximumValue() const
{
return 1;
}
// ----------------------------------------------------------------------------
CCColdDarkCheck::CCColdDarkCheck( MetaProcess* P )
: MetaBoolean( P )
{
TheColdDarkCheck = this;
}
IsoString CCColdDarkCheck::Id() const
{
return "coldDarkCheck";
}
bool CCColdDarkCheck::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCColdLevel::CCColdLevel( MetaProcess* P )
: MetaFloat( P )
{
TheColdLevel = this;
}
IsoString CCColdLevel::Id() const
{
return "coldDarkLevel";
}
int CCColdLevel::Precision() const
{
return 10;
}
double CCColdLevel::DefaultValue() const
{
return 0;
}
double CCColdLevel::MinimumValue() const
{
return 0;
}
double CCColdLevel::MaximumValue() const
{
return 1;
}
// -----------------------------------------------------------Via Auto Detect-----------------
CCUseAutoDetect::CCUseAutoDetect( MetaProcess* P )
: MetaBoolean( P )
{
TheUseAutoDetect = this;
}
IsoString CCUseAutoDetect::Id() const
{
return "useAutoDetect";
}
bool CCUseAutoDetect::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCHotAutoCheck::CCHotAutoCheck( MetaProcess* P )
: MetaBoolean( P )
{
TheHotAutoCheck = this;
}
IsoString CCHotAutoCheck::Id() const
{
return "hotAutoCheck";
}
bool CCHotAutoCheck::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCHotAutoValue::CCHotAutoValue( MetaProcess* P )
: MetaFloat( P )
{
TheHotAutoValue = this;
}
IsoString CCHotAutoValue::Id() const
{
return "hotAutoValue";
}
int CCHotAutoValue::Precision() const
{
return 1;
}
double CCHotAutoValue::DefaultValue() const
{
return 3;
}
double CCHotAutoValue::MinimumValue() const
{
return 0;
}
double CCHotAutoValue::MaximumValue() const
{
return 50;
}
// ----------------------------------------------------------------------------
CCColdAutoCheck::CCColdAutoCheck( MetaProcess* P )
: MetaBoolean( P )
{
TheColdAutoCheck = this;
}
IsoString CCColdAutoCheck::Id() const
{
return "coldAutoCheck";
}
bool CCColdAutoCheck::DefaultValue() const
{
return false;
}
// ----------------------------------------------------------------------------
CCColdAutoValue::CCColdAutoValue( MetaProcess* P )
: MetaFloat( P )
{
TheColdAutoValue = this;
}
IsoString CCColdAutoValue::Id() const
{
return "coldAutoValue";
}
int CCColdAutoValue::Precision() const
{
return 1;
}
double CCColdAutoValue::DefaultValue() const
{
return 3;
}
double CCColdAutoValue::MinimumValue() const
{
return 0;
}
double CCColdAutoValue::MaximumValue() const
{
return 50;
}
// ----------------------------------------------------------------------------
CCUseDefectList::CCUseDefectList( MetaProcess* P )
: MetaBoolean( P )
{
TheUseDefectList = this;
}
IsoString CCUseDefectList::Id() const
{
return "useDefectList";
}
// ----------------------------------------------------------------------------
CCDefects::CCDefects( MetaProcess* P )
: MetaTable( P )
{
TheDefects = this;
}
IsoString CCDefects::Id() const
{
return "defects";
}
// ----------------------------------------------------------------------------
CCDefectEnabled::CCDefectEnabled( MetaTable* T )
: MetaBoolean( T )
{
TheDefectEnabled = this;
}
IsoString CCDefectEnabled::Id() const
{
return "defectEnabled";
}
// ----------------------------------------------------------------------------
CCDefectIsRow::CCDefectIsRow( MetaTable* T )
: MetaBoolean( T )
{
TheDefectIsRow = this;
}
IsoString CCDefectIsRow::Id() const
{
return "defectIsRow";
}
// ----------------------------------------------------------------------------
CCDefectAddress::CCDefectAddress( MetaTable* T )
: MetaUInt16( T )
{
TheDefectAddress = this;
}
IsoString CCDefectAddress::Id() const
{
return "defectAddress";
}
// ----------------------------------------------------------------------------
CCDefectIsRange::CCDefectIsRange( MetaTable* T )
: MetaBoolean( T )
{
TheDefectIsRange = this;
}
IsoString CCDefectIsRange::Id() const
{
return "defectIsRange";
}
// ----------------------------------------------------------------------------
CCDefectBegin::CCDefectBegin( MetaTable* T )
: MetaUInt16( T )
{
TheDefectBegin = this;
}
IsoString CCDefectBegin::Id() const
{
return "defectBegin";
}
// ----------------------------------------------------------------------------
CCDefectEnd::CCDefectEnd( MetaTable* T )
: MetaUInt16( T )
{
TheDefectEnd = this;
}
IsoString CCDefectEnd::Id() const
{
return "defectEnd";
}
// ----------------------------------------------------------------------------
} // namespace pcl
// ----------------------------------------------------------------------------
// EOF CosmeticCorrectionParameters.cpp - Released 2021-04-09T19:41:49Z
| 21.21118 | 94 | 0.565813 | fmeschia |
b48bb453520fe2347c7ee858c1188bb783bf24d1 | 4,317 | cpp | C++ | src/entity_systems/ffi_path.cpp | mokoi/luxengine | 965532784c4e6112141313997d040beda4b56d07 | [
"MIT"
] | 11 | 2015-03-02T07:43:00.000Z | 2021-12-04T04:53:02.000Z | src/entity_systems/ffi_path.cpp | mokoi/luxengine | 965532784c4e6112141313997d040beda4b56d07 | [
"MIT"
] | 1 | 2015-03-28T17:17:13.000Z | 2016-10-10T05:49:07.000Z | src/entity_systems/ffi_path.cpp | mokoi/luxengine | 965532784c4e6112141313997d040beda4b56d07 | [
"MIT"
] | 3 | 2016-11-04T01:14:31.000Z | 2020-05-07T23:42:27.000Z | /****************************
Copyright © 2014 Luke Salisbury
This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
****************************/
#include "ffi_path.h"
#include "ffi_functions.h"
#include <cmath>
#include "core.h"
#define FIXEDPI 3.1415926535897932384626433832795
/**
* @brief Lux_FFI_Path_Move_Object
* @param object_id
* @param fixed_speed
* @param x
* @param y
* @param loop
* @return
*/
int32_t Lux_FFI_Path_Move_Object( uint32_t object_id, int32_t fixed_speed, int16_t * x, int16_t * y, uint8_t loop )
{
float movex, movey, speed, angle = 0;
LuxPath next, prev;
uint16_t next_path_point = 0;
MapObject * map_object = Lux_FFI_Object_Get( object_id );
if ( map_object )
{
if ( !map_object->_path.size() )
{
return -2;
}
// Movement direction
speed = MAKE_FIXED_FLOAT(fixed_speed) * MAKE_FIXED_FLOAT(lux::core->GetFrameDelta() );
if ( speed > 0.0 )
{
next_path_point = map_object->path_point+1;
if ( loop ) // Loop around
{
if ( map_object->path_point >= map_object->_path.size()-1 )
{
next_path_point = 0;
}
}
else
{
if ( map_object->path_point >= map_object->_path.size()-1 )
return map_object->path_point;
}
prev.x = map_object->position.x;
prev.y = map_object->position.y;
next = map_object->_path.at(next_path_point);
}
else if ( speed < 0.0 )
{
next_path_point = map_object->path_point-1;
if ( loop ) // Loop around
{
if ( (map_object->path_point == 0) && map_object->path_point > map_object->_path.size() )
{
next_path_point = map_object->_path.size()-1;
}
}
else
{
if ( (map_object->path_point == 0) && map_object->path_point > map_object->_path.size() )
return map_object->path_point;
}
prev.x = map_object->position.x;
prev.y = map_object->position.y;
prev = map_object->_path.at(map_object->path_point);
next = map_object->_path.at(next_path_point);
}
else
return -1;
angle = atan2( (float)(prev.y - next.y), (float)(prev.x - next.x));
movey = sin(angle) * speed;
movex = cos(angle) * speed;
map_object->path_current_x -= MAKE_FLOAT_FIXED(movex);
map_object->path_current_y -= MAKE_FLOAT_FIXED(movey);
map_object->position.x = MAKE_FIXED_INT(map_object->path_current_x);
map_object->position.y = MAKE_FIXED_INT(map_object->path_current_y);
if ( map_object->position.x == next.x && map_object->position.y == next.y)
{
map_object->path_current_x = MAKE_INT_FIXED(map_object->position.x);
map_object->path_current_y = MAKE_INT_FIXED(map_object->position.y);
map_object->path_point = next_path_point;
}
if (x)
*x = map_object->position.x;
if (y)
*y = map_object->position.y;
return map_object->path_point;
}
return -1;
}
/**
* @brief Lux_FFI_Path_Count
* @param object_id
* @return
*/
int32_t Lux_FFI_Path_Count( uint32_t object_id )
{
MapObject * map_object = Lux_FFI_Object_Get( object_id );
if ( map_object )
{
return (int32_t)map_object->_path.size();
}
return -1;
}
/**
* @brief Lux_FFI_Path_Point
* @param object_id
* @param point
* @param x
* @param y
* @param ms_length
* @return
*/
uint8_t Lux_FFI_Path_Point( uint32_t object_id, uint8_t point, int16_t * x, int16_t * y, uint32_t *ms_length )
{
if ( point < 0 )
return 0;
LuxPath next;
MapObject * map_object = Lux_FFI_Object_Get( object_id );
if ( map_object )
{
next = map_object->_path.at(point);
if (x)
*x = next.x;
if (y)
*y = next.y;
if (ms_length)
*ms_length = next.ms_length;
return 1;
}
return 0;
}
| 26.006024 | 243 | 0.682187 | mokoi |
b48c4d31ac1bcb213e103c329e5a28a441479e8b | 23,581 | cpp | C++ | FFX_CAS/cas-samples/libs/cauldron/src/DX12/GLTF/GltfPbrPass.cpp | TonyJennifer/OpenSource | 442e705eb42197ccdc44557a61caf91deebfcd05 | [
"MIT"
] | 2 | 2019-07-27T11:40:02.000Z | 2021-04-30T05:16:13.000Z | src/DX12/GLTF/GltfPbrPass.cpp | swq0553/Cauldron | 8530be0b7c65886726761944ec7855ce74d09db9 | [
"MIT"
] | null | null | null | src/DX12/GLTF/GltfPbrPass.cpp | swq0553/Cauldron | 8530be0b7c65886726761944ec7855ce74d09db9 | [
"MIT"
] | null | null | null | // AMD AMDUtils code
//
// Copyright(c) 2018 Advanced Micro Devices, Inc.All rights reserved.
// 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 "stdafx.h"
#include "GltfPbrPass.h"
#include "Misc\ThreadPool.h"
#include "GltfHelpers.h"
#include "Base\ShaderCompilerHelper.h"
namespace CAULDRON_DX12
{
//--------------------------------------------------------------------------------------
//
// OnCreate
//
//--------------------------------------------------------------------------------------
void GltfPbrPass::OnCreate(
Device *pDevice,
UploadHeap* pUploadHeap,
ResourceViewHeaps *pHeaps,
DynamicBufferRing *pDynamicBufferRing,
StaticBufferPool *pStaticBufferPool,
GLTFTexturesAndBuffers *pGLTFTexturesAndBuffers,
SkyDome *pSkyDome,
Texture *pShadowMap,
DXGI_FORMAT outFormat,
uint32_t sampleCount)
{
m_sampleCount = sampleCount;
m_pResourceViewHeaps = pHeaps;
m_pStaticBufferPool = pStaticBufferPool;
m_pDynamicBufferRing = pDynamicBufferRing;
m_pGLTFTexturesAndBuffers = pGLTFTexturesAndBuffers;
m_outFormat = outFormat;
const json &j3 = m_pGLTFTexturesAndBuffers->m_pGLTFCommon->j3;
/////////////////////////////////////////////
// Load BRDF look up table for the PBR shader
m_BrdfLut.InitFromFile(pDevice, pUploadHeap, "BrdfLut.dds", false); // LUT images are stored as linear
// Create default material
//
{
m_defaultMaterial.m_pbrMaterialParameters.m_doubleSided = false;
m_defaultMaterial.m_pbrMaterialParameters.m_blending = false;
m_defaultMaterial.m_pbrMaterialParameters.m_params.m_emissiveFactor = XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);
m_defaultMaterial.m_pbrMaterialParameters.m_params.m_baseColorFactor = XMVectorSet(1.0f, 0.0f, 0.0f, 1.0f);
m_defaultMaterial.m_pbrMaterialParameters.m_params.m_metallicRoughnessValues = XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);
m_defaultMaterial.m_pbrMaterialParameters.m_params.m_specularGlossinessFactor = XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);
std::map<std::string, Texture *> texturesBase;
CreateGPUMaterialData(&m_defaultMaterial, texturesBase, pSkyDome, pShadowMap);
}
// Load PBR 2.0 Materials
//
const json::array_t &materials = j3["materials"];
m_materialsData.resize(materials.size());
for (uint32_t i = 0; i < materials.size(); i++)
{
PBRMaterial *tfmat = &m_materialsData[i];
// Get PBR material parameters and texture IDs
//
std::map<std::string, int> textureIds;
ProcessMaterials(materials[i], &tfmat->m_pbrMaterialParameters, textureIds);
// translate texture IDs into textureViews
//
std::map<std::string, Texture *> texturesBase;
for (auto const& value : textureIds)
texturesBase[value.first] = m_pGLTFTexturesAndBuffers->GetTextureViewByID(value.second);
CreateGPUMaterialData(tfmat, texturesBase, pSkyDome, pShadowMap);
}
// Load Meshes
//
if (j3.find("meshes") != j3.end())
{
const json::array_t &meshes = j3["meshes"];
const json::array_t &accessors = j3["accessors"];
m_meshes.resize(meshes.size());
for (uint32_t i = 0; i < meshes.size(); i++)
{
PBRMesh *tfmesh = &m_meshes[i];
const json::array_t &primitives = meshes[i]["primitives"];
tfmesh->m_pPrimitives.resize(primitives.size());
for (uint32_t p = 0; p < primitives.size(); p++)
{
json::object_t primitive = primitives[p];
PBRPrimitives *pPrimitive = &tfmesh->m_pPrimitives[p];
// Sets primitive's material, or set a default material if none was specified in the GLTF
//
auto mat = primitive.find("material");
pPrimitive->m_pMaterial = (mat != primitive.end()) ? &m_materialsData[mat->second] : &m_defaultMaterial;
// Gets the geometry topology (so far we are not doing anything with this)
//
int32_t mode = GetElementInt(primitive, "mode", 4);
// Defines for the shader compiler, they will hold the PS and VS bindings for the geometry, io and textures
//
DefineList attributeDefines;
// Set input layout from glTF attributes and set VS bindings
//
const json::object_t &attribute = primitive["attributes"];
std::vector<tfAccessor> vertexBuffers(attribute.size());
std::vector<std::string> semanticNames(attribute.size());
std::vector<D3D12_INPUT_ELEMENT_DESC> layout(attribute.size());
uint32_t cnt = 0;
for (auto it = attribute.begin(); it != attribute.end(); it++, cnt++)
{
const json::object_t &accessor = accessors[it->second];
// let the compiler know we have this stream
attributeDefines[std::string("HAS_") + it->first] = "1";
// split semantic name from index, DX doesnt like the trailing number
uint32_t semanticIndex = 0;
SplitGltfAttribute(it->first, &semanticNames[cnt], &semanticIndex);
// Create Input Layout
//
layout[cnt].SemanticName = semanticNames[cnt].c_str(); // we need to set it in the pipeline function (because of multithreading)
layout[cnt].SemanticIndex = semanticIndex;
layout[cnt].Format = GetFormat(accessor.at("type"), accessor.at("componentType"));
layout[cnt].InputSlot = (UINT)cnt;
layout[cnt].InputSlotClass = D3D12_INPUT_CLASSIFICATION_PER_VERTEX_DATA;
layout[cnt].InstanceDataStepRate = 0;
layout[cnt].AlignedByteOffset = D3D12_APPEND_ALIGNED_ELEMENT;
// Get VB accessors
//
m_pGLTFTexturesAndBuffers->m_pGLTFCommon->GetBufferDetails(it->second, &vertexBuffers[cnt]);
}
// Get Index and vertex buffer buffer accessors and create the geometry
//
tfAccessor indexBuffer;
m_pGLTFTexturesAndBuffers->m_pGLTFCommon->GetBufferDetails(primitive["indices"], &indexBuffer);
m_pGLTFTexturesAndBuffers->CreateGeometry(indexBuffer, vertexBuffers, &pPrimitive->m_geometry);
// Create the descriptors, the root signature and the pipeline
//
{
bool bUsingSkinning = m_pGLTFTexturesAndBuffers->m_pGLTFCommon->FindMeshSkinId(i) != -1;
CreateDescriptors(pDevice->GetDevice(), bUsingSkinning, &attributeDefines, pPrimitive);
CreatePipeline(pDevice->GetDevice(), semanticNames, layout, &attributeDefines, pPrimitive);
}
}
}
}
}
//--------------------------------------------------------------------------------------
//
// CreateGPUMaterialData
//
//--------------------------------------------------------------------------------------
void GltfPbrPass::CreateGPUMaterialData(PBRMaterial *tfmat, std::map<std::string, Texture *> &texturesBase, SkyDome *pSkyDome, Texture *pShadowMap)
{
// count the number of textures to init bindings and descriptor
{
tfmat->m_textureCount = (int)texturesBase.size();
tfmat->m_textureCount += 1; // This is for the BRDF LUT texture
if (pSkyDome)
tfmat->m_textureCount += 2; // +2 because the skydome has a specular, diffusse and BDRF maps
if (pShadowMap != NULL) // will use a shadowmap texture if present
tfmat->m_textureCount += 1;
}
// Alloc descriptor layout and init the descriptor set
if (tfmat->m_textureCount >= 0)
{
// allocate descriptor table for the textures
m_pResourceViewHeaps->AllocCBV_SRV_UAVDescriptor(tfmat->m_textureCount, &tfmat->m_texturesTable);
uint32_t cnt = 0;
//create SRVs and #defines for the BRDF LUT resources
tfmat->m_pbrMaterialParameters.m_defines["ID_brdfTexture"] = std::to_string(cnt);
CreateSamplerForBrdfLut(cnt, &tfmat->m_samplers[cnt]);
m_BrdfLut.CreateSRV(cnt, &tfmat->m_texturesTable);
cnt++;
//create SRVs and #defines for the IBL resources
if (pSkyDome)
{
tfmat->m_pbrMaterialParameters.m_defines["ID_diffuseCube"] = std::to_string(cnt);
pSkyDome->SetDescriptorDiff(cnt, &tfmat->m_texturesTable, cnt, &tfmat->m_samplers[cnt]);
cnt++;
tfmat->m_pbrMaterialParameters.m_defines["ID_specularCube"] = std::to_string(cnt);
pSkyDome->SetDescriptorSpec(cnt, &tfmat->m_texturesTable, cnt, &tfmat->m_samplers[cnt]);
cnt++;
tfmat->m_pbrMaterialParameters.m_defines["USE_IBL"] = "1";
}
// Create SRV for the shadowmap
if (pShadowMap != NULL)
{
tfmat->m_pbrMaterialParameters.m_defines["ID_shadowMap"] = std::to_string(cnt);
pShadowMap->CreateSRV(cnt, &tfmat->m_texturesTable);
CreateSamplerForShadowMap(cnt, &tfmat->m_samplers[cnt]);
cnt++;
}
//create SRVs and #defines so the shader compiler knows what the index of each texture is
for (auto it = texturesBase.begin(); it != texturesBase.end(); it++)
{
tfmat->m_pbrMaterialParameters.m_defines[std::string("ID_") + it->first] = std::to_string(cnt);
it->second->CreateSRV(cnt, &tfmat->m_texturesTable);
CreateSamplerForPBR(cnt, &tfmat->m_samplers[cnt]);
cnt++;
}
}
}
//--------------------------------------------------------------------------------------
//
// OnDestroy
//
//--------------------------------------------------------------------------------------
void GltfPbrPass::OnDestroy()
{
for (uint32_t m = 0; m < m_meshes.size(); m++)
{
PBRMesh *pMesh = &m_meshes[m];
for (uint32_t p = 0; p < pMesh->m_pPrimitives.size(); p++)
{
PBRPrimitives *pPrimitive = &pMesh->m_pPrimitives[p];
pPrimitive->m_PipelineRender->Release();
pPrimitive->m_RootSignature->Release();
}
}
m_BrdfLut.OnDestroy();
}
//--------------------------------------------------------------------------------------
//
// CreateDescriptors for a combination of material and geometry
//
//--------------------------------------------------------------------------------------
void GltfPbrPass::CreateDescriptors(ID3D12Device* pDevice, bool bUsingSkinning, DefineList *pAttributeDefines, PBRPrimitives *pPrimitive)
{
CD3DX12_DESCRIPTOR_RANGE DescRange[1];
DescRange[0].Init(D3D12_DESCRIPTOR_RANGE_TYPE_SRV, pPrimitive->m_pMaterial->m_textureCount, 0); // texture table
int params = 0;
CD3DX12_ROOT_PARAMETER RTSlot[4];
// b0 <- Constant buffer 'per frame'
RTSlot[params++].InitAsConstantBufferView(0, 0, D3D12_SHADER_VISIBILITY_ALL);
// textures table
if (pPrimitive->m_pMaterial->m_textureCount > 0)
{
RTSlot[params++].InitAsDescriptorTable(1, &DescRange[0], D3D12_SHADER_VISIBILITY_PIXEL);
}
// b1 <- Constant buffer 'per object', these are mainly the material data
RTSlot[params++].InitAsConstantBufferView(1, 0, D3D12_SHADER_VISIBILITY_ALL);
// b2 <- Constant buffer holding the skinning matrices
if (bUsingSkinning)
{
RTSlot[params++].InitAsConstantBufferView(2, 0, D3D12_SHADER_VISIBILITY_VERTEX);
(*pAttributeDefines)["ID_SKINNING_MATRICES"] = std::to_string(2);
}
// the root signature contains 3 slots to be used
CD3DX12_ROOT_SIGNATURE_DESC descRootSignature = CD3DX12_ROOT_SIGNATURE_DESC();
descRootSignature.pParameters = RTSlot;
descRootSignature.NumParameters = params;
descRootSignature.pStaticSamplers = pPrimitive->m_pMaterial->m_samplers;
descRootSignature.NumStaticSamplers = pPrimitive->m_pMaterial->m_textureCount;
// deny uneccessary access to certain pipeline stages
descRootSignature.Flags = D3D12_ROOT_SIGNATURE_FLAG_NONE
| D3D12_ROOT_SIGNATURE_FLAG_ALLOW_INPUT_ASSEMBLER_INPUT_LAYOUT
| D3D12_ROOT_SIGNATURE_FLAG_DENY_HULL_SHADER_ROOT_ACCESS
| D3D12_ROOT_SIGNATURE_FLAG_DENY_DOMAIN_SHADER_ROOT_ACCESS
| D3D12_ROOT_SIGNATURE_FLAG_DENY_GEOMETRY_SHADER_ROOT_ACCESS;
ID3DBlob *pOutBlob, *pErrorBlob = NULL;
ThrowIfFailed(D3D12SerializeRootSignature(&descRootSignature, D3D_ROOT_SIGNATURE_VERSION_1, &pOutBlob, &pErrorBlob));
ThrowIfFailed(pDevice->CreateRootSignature(0, pOutBlob->GetBufferPointer(), pOutBlob->GetBufferSize(), IID_PPV_ARGS(&pPrimitive->m_RootSignature)));
pPrimitive->m_RootSignature->SetName(L"GltfPbr::D3D12SerializeRootSignature");
pOutBlob->Release();
if (pErrorBlob)
pErrorBlob->Release();
}
//--------------------------------------------------------------------------------------
//
// CreatePipeline
//
//--------------------------------------------------------------------------------------
void GltfPbrPass::CreatePipeline(ID3D12Device* pDevice, std::vector<std::string> semanticNames, std::vector<D3D12_INPUT_ELEMENT_DESC> layout, DefineList *pAttributeDefines, PBRPrimitives *pPrimitive)
{
/////////////////////////////////////////////
// Compile and create shaders
D3D12_SHADER_BYTECODE shaderVert, shaderPixel;
{
// Create #defines based on material properties and vertex attributes
DefineList defines = pPrimitive->m_pMaterial->m_pbrMaterialParameters.m_defines + (*pAttributeDefines);
CompileShaderFromFile("GLTFPbrPass-VS.hlsl", &defines, "mainVS", "vs_5_0", 0, &shaderVert);
CompileShaderFromFile("GLTFPbrPass-PS.hlsl", &defines, "mainPS", "ps_5_0", 0, &shaderPixel);
}
// Set blending
//
CD3DX12_BLEND_DESC blendState = CD3DX12_BLEND_DESC(D3D12_DEFAULT);
blendState.RenderTarget[0] = D3D12_RENDER_TARGET_BLEND_DESC
{
(pPrimitive->m_pMaterial->m_pbrMaterialParameters.m_defines.Has("DEF_alphaMode_BLEND")),
FALSE,
D3D12_BLEND_SRC_ALPHA, D3D12_BLEND_INV_SRC_ALPHA, D3D12_BLEND_OP_ADD,
D3D12_BLEND_ONE, D3D12_BLEND_ZERO, D3D12_BLEND_OP_ADD,
D3D12_LOGIC_OP_NOOP,
D3D12_COLOR_WRITE_ENABLE_ALL,
};
/////////////////////////////////////////////
// Create a PSO description
D3D12_GRAPHICS_PIPELINE_STATE_DESC descPso = {};
descPso.InputLayout = { layout.data(), (UINT)layout.size() };
descPso.pRootSignature = pPrimitive->m_RootSignature;
descPso.VS = shaderVert;
descPso.PS = shaderPixel;
descPso.RasterizerState = CD3DX12_RASTERIZER_DESC(D3D12_DEFAULT);
descPso.RasterizerState.CullMode = (pPrimitive->m_pMaterial->m_pbrMaterialParameters.m_doubleSided) ? D3D12_CULL_MODE_NONE : D3D12_CULL_MODE_FRONT;
descPso.BlendState = blendState;
descPso.DepthStencilState = CD3DX12_DEPTH_STENCIL_DESC(D3D12_DEFAULT);
descPso.DepthStencilState.DepthFunc = D3D12_COMPARISON_FUNC_LESS_EQUAL;
descPso.SampleMask = UINT_MAX;
descPso.PrimitiveTopologyType = D3D12_PRIMITIVE_TOPOLOGY_TYPE_TRIANGLE;
descPso.NumRenderTargets = 1;
descPso.RTVFormats[0] = m_outFormat;
descPso.DSVFormat = DXGI_FORMAT_D32_FLOAT;
descPso.SampleDesc.Count = m_sampleCount;
descPso.NodeMask = 0;
ThrowIfFailed(
pDevice->CreateGraphicsPipelineState(&descPso, IID_PPV_ARGS(&pPrimitive->m_PipelineRender))
);
}
//--------------------------------------------------------------------------------------
//
// Draw
//
//--------------------------------------------------------------------------------------
void GltfPbrPass::Draw(ID3D12GraphicsCommandList* pCommandList)
{
UserMarker(pCommandList, "gltfPBR");
struct Transparent
{
float m_depth;
PBRPrimitives *m_pPrimitive;
D3D12_GPU_VIRTUAL_ADDRESS m_perFrameDesc;
D3D12_GPU_VIRTUAL_ADDRESS m_perObjectDesc;
D3D12_GPU_VIRTUAL_ADDRESS m_pPerSkeleton;
operator float() { return -m_depth; }
};
std::vector<Transparent> m_transparent;
// Set descriptor heaps
pCommandList->IASetPrimitiveTopology(D3D_PRIMITIVE_TOPOLOGY_TRIANGLELIST);
ID3D12DescriptorHeap *pDescriptorHeaps[] = { m_pResourceViewHeaps->GetCBV_SRV_UAVHeap(), m_pResourceViewHeaps->GetSamplerHeap() };
pCommandList->SetDescriptorHeaps(2, pDescriptorHeaps);
// loop through nodes
//
std::vector<tfNode> *pNodes = &m_pGLTFTexturesAndBuffers->m_pGLTFCommon->m_nodes;
XMMATRIX *pNodesMatrices = m_pGLTFTexturesAndBuffers->m_pGLTFCommon->m_transformedData.m_worldSpaceMats.data();
for (uint32_t i = 0; i < pNodes->size(); i++)
{
tfNode *pNode = &pNodes->at(i);
if ((pNode == NULL) || (pNode->meshIndex < 0))
continue;
// skinning matrices constant buffer
D3D12_GPU_VIRTUAL_ADDRESS pPerSkeleton = m_pGLTFTexturesAndBuffers->GetSkinningMatricesBuffer(pNode->skinIndex);
// loop through primitives
//
PBRMesh *pMesh = &m_meshes[pNode->meshIndex];
for (uint32_t p = 0; p < pMesh->m_pPrimitives.size(); p++)
{
PBRPrimitives *pPrimitive = &pMesh->m_pPrimitives[p];
if (pPrimitive->m_PipelineRender == NULL)
continue;
// Set per Object constants
//
per_object *cbPerObject;
D3D12_GPU_VIRTUAL_ADDRESS perObjectDesc;
m_pDynamicBufferRing->AllocConstantBuffer(sizeof(per_object), (void **)&cbPerObject, &perObjectDesc);
cbPerObject->mWorld = pNodesMatrices[i];
PBRMaterialParameters *pPbrParams = &pPrimitive->m_pMaterial->m_pbrMaterialParameters;
cbPerObject->m_pbrParams = pPbrParams->m_params;
// Draw primitive
//
if (pPbrParams->m_blending == false)
{
// If solid draw it
//
pPrimitive->DrawPrimitive(pCommandList, m_pGLTFTexturesAndBuffers->m_perFrameConstants, perObjectDesc, pPerSkeleton);
}
else
{
// If transparent queue it for sorting
//
XMMATRIX mat = pNodesMatrices[i] * m_pGLTFTexturesAndBuffers->m_pGLTFCommon->m_perFrameData.mCameraViewProj;
XMVECTOR v = m_pGLTFTexturesAndBuffers->m_pGLTFCommon->m_meshes[pNode->meshIndex].m_pPrimitives[p].m_center;
Transparent t;
t.m_depth = XMVectorGetW(XMVector4Transform(v, mat));
t.m_pPrimitive = pPrimitive;
t.m_perFrameDesc = m_pGLTFTexturesAndBuffers->m_perFrameConstants;
t.m_perObjectDesc = perObjectDesc;
t.m_pPerSkeleton = pPerSkeleton;
m_transparent.push_back(t);
}
}
}
// sort transparent primitives
//
std::sort(m_transparent.begin(), m_transparent.end());
// Draw them sorted front to back
//
int tt = 0;
for (auto &t : m_transparent)
{
t.m_pPrimitive->DrawPrimitive(pCommandList, t.m_perFrameDesc, t.m_perObjectDesc, t.m_pPerSkeleton);
}
}
void PBRPrimitives::DrawPrimitive(ID3D12GraphicsCommandList *pCommandList, D3D12_GPU_VIRTUAL_ADDRESS perFrameDesc, D3D12_GPU_VIRTUAL_ADDRESS perObjectDesc, D3D12_GPU_VIRTUAL_ADDRESS pPerSkeleton)
{
// Bind indices and vertices using the right offsets into the buffer
//
pCommandList->IASetIndexBuffer(&m_geometry.m_IBV);
pCommandList->IASetVertexBuffers(0, (UINT)m_geometry.m_VBV.size(), m_geometry.m_VBV.data());
// Bind Descriptor sets
//
pCommandList->SetGraphicsRootSignature(m_RootSignature);
int paramIndex = 0;
// bind the per scene constant buffer descriptor
pCommandList->SetGraphicsRootConstantBufferView(paramIndex++, perFrameDesc);
// bind the textures and samplers descriptors
if (m_pMaterial->m_textureCount > 0)
{
pCommandList->SetGraphicsRootDescriptorTable(paramIndex++, m_pMaterial->m_texturesTable.GetGPU());
}
// bind the per object constant buffer descriptor
pCommandList->SetGraphicsRootConstantBufferView(paramIndex++, perObjectDesc);
// bind the skeleton bind matrices constant buffer descriptor
if (pPerSkeleton != 0)
pCommandList->SetGraphicsRootConstantBufferView(paramIndex++, pPerSkeleton);
// Bind Pipeline
//
pCommandList->SetPipelineState(m_PipelineRender);
// Draw
//
pCommandList->DrawIndexedInstanced(m_geometry.m_NumIndices, 1, 0, 0, 0);
}
} | 45.261036 | 203 | 0.584284 | TonyJennifer |
b491fa6871156142217c1b7732510bbdfc49c210 | 3,040 | hh | C++ | test/maple/MockSwitch.hh | Alexey-Ershov/runos | dfbf8f74d7f45d25f0d4fad743b51f572ec272c9 | [
"Apache-2.0"
] | 9 | 2019-04-04T18:03:36.000Z | 2019-05-03T23:48:59.000Z | test/maple/MockSwitch.hh | Alexey-Ershov/runos | dfbf8f74d7f45d25f0d4fad743b51f572ec272c9 | [
"Apache-2.0"
] | 16 | 2019-04-04T12:22:19.000Z | 2019-04-09T19:04:42.000Z | test/maple/MockSwitch.hh | Alexey-Ershov/runos | dfbf8f74d7f45d25f0d4fad743b51f572ec272c9 | [
"Apache-2.0"
] | 2 | 2019-10-11T14:17:26.000Z | 2022-03-15T10:06:08.000Z | #pragma once
#include <map>
#include <ostream>
#include <boost/test/unit_test.hpp>
#include "api/Packet.hh"
#include "oxm/field_set.hh"
#include "maple/Backend.hh"
#include "maple/Flow.hh"
namespace runos {
class MockSwitch : public maple::Backend {
using Flow = maple::Flow;
using FlowPtr = maple::FlowPtr;
struct Classifier {
unsigned prio;
oxm::field_set match;
friend bool operator== (const Classifier& lhs, const Classifier& rhs)
{ return lhs.prio == rhs.prio && lhs.match == rhs.match; }
friend bool operator< (const Classifier& lhs, const Classifier& rhs)
{ return lhs.prio > rhs.prio; }
friend std::ostream& operator<< (std::ostream& out, const Classifier& c)
{ return out << "prio=" << c.prio << ", " << c.match; }
};
typedef std::map< Classifier, FlowPtr >
FlowTable;
FlowPtr miss;
FlowTable flow_table;
public:
explicit MockSwitch(FlowPtr miss)
: miss(miss)
{ }
virtual void install(unsigned priority,
oxm::field_set const& fs,
FlowPtr flow) override
{
Classifier classifier {priority, fs};
BOOST_TEST_MESSAGE("Installing flow " << classifier);
BOOST_REQUIRE_MESSAGE(flow_table.emplace(classifier, flow).second,
"Overlapping flow " << classifier);
}
virtual void remove(FlowPtr flow) override
{
BOOST_TEST_MESSAGE("Removing flow " << flow);
for (auto it = flow_table.begin(); it != flow_table.end(); ++it) {
if (it->second == flow)
flow_table.erase(it);
}
}
virtual void remove(unsigned priority,
oxm::field_set const& match) override
{
Classifier key{ priority, std::move(match) };
BOOST_TEST_MESSAGE("Removing flow " << key);
for (auto it = flow_table.begin(); it != flow_table.end(); ++it) {
if (it->first == key)
flow_table.erase(it);
}
}
virtual void remove(oxm::field_set const& match) override
{
BOOST_TEST_MESSAGE("Removing flow " << match);
for (auto it = flow_table.begin(); it != flow_table.end(); ++it) {
if (it->first.match == match)
flow_table.erase(it);
}
}
FlowPtr operator()(const Packet& pkt) const
{
auto it = flow_table.cbegin();
auto match = flow_table.cend();
for (; it != flow_table.cend(); ++it) {
if (it->first.match & pkt) {
match = it;
break;
}
}
if (it != flow_table.cend())
++it;
for (; it != flow_table.cend() &&
it->first.prio == match->first.prio;
++it)
{
BOOST_REQUIRE( not (it->first.match & pkt) );
}
if (match != flow_table.cend())
return match->second;
else
return miss;
}
};
}
| 27.142857 | 80 | 0.536842 | Alexey-Ershov |
b493cd7548c9022d25a50a0e387a5b3d3e8e5e68 | 12,165 | cpp | C++ | Gui/gui/MainWindowBase.cpp | igui/OppositeRenderer | 2442741792b3f0f426025c2015002694fab692eb | [
"MIT"
] | 9 | 2016-06-25T15:52:05.000Z | 2020-01-15T17:31:49.000Z | Gui/gui/MainWindowBase.cpp | igui/OppositeRenderer | 2442741792b3f0f426025c2015002694fab692eb | [
"MIT"
] | null | null | null | Gui/gui/MainWindowBase.cpp | igui/OppositeRenderer | 2442741792b3f0f426025c2015002694fab692eb | [
"MIT"
] | 2 | 2018-10-17T18:33:37.000Z | 2022-03-14T20:17:30.000Z | /*
* Copyright (c) 2013 Opposite Renderer
* For the full copyright and license information, please view the LICENSE.txt
* file that was distributed with this source code.
*/
#include "Application.hxx"
#include "MainWindowBase.hxx"
#include "renderer/OptixRenderer.h"
#include <QString>
#include <QMessageBox>
#include <QStandardPaths>
#include "RenderWidget.hxx"
#include "gui/AboutWindow.hxx"
#include "gui/ComputeDeviceInformationWidget.hxx"
#include "gui/docks/RenderInformationDock.hxx"
#include "gui/docks/OutputDock.hxx"
#include "gui/docks/PPMDock.hxx"
#include "gui/docks/CameraDock.hxx"
#include "gui/docks/SceneDock.hxx"
#include "gui/docks/ConsoleDock.hxx"
#include "ComputeDeviceRepository.h"
#include "config.h"
#include <qfiledialog.h>
#include <qinputdialog.h>
#include <qlineedit.h>
#include "gui/ui/resources.h"
const int MainWindowBase::maxRecentFiles = 5;
MainWindowBase::MainWindowBase(Application& application)
: m_application(application),
m_camera(application.getCamera())
{
setupUi(this);
actionReload_scene->setVisible(false);
//connect(&application.getOutputSettingsModel(), SIGNAL(resolutionUpdated()), this, SLOT(onOutputSettingsResolutionUpdated()));
//connect(&application.getPPMSettingsModel(), SIGNAL(updated()), this, SLOT(onPPMSettingsModelUpdated()));
connect(&application, SIGNAL(applicationError(QString)), this, SLOT(onApplicationError(QString)));
// Render Information Dock
RenderInformationDock* renderInformationDock = new RenderInformationDock(this, application.getRenderStatisticsModel(), application);
this->addDockWidget(Qt::RightDockWidgetArea, renderInformationDock);
connect(renderInformationDock, SIGNAL(renderStatusToggle()), this, SLOT(onRenderStatusToggle()));
connect(renderInformationDock, SIGNAL(renderRestart()), this, SLOT(onRenderRestart()));
// Output Dock
OutputDock* outputDock = new OutputDock(this, application.getOutputSettingsModel());
this->addDockWidget(Qt::RightDockWidgetArea, outputDock);
// PPM Information dock
PPMDock* ppmDock = new PPMDock(this, m_application, m_application.getPPMSettingsModel());
this->addDockWidget(Qt::RightDockWidgetArea, ppmDock);
// Camera Dock
CameraDock* cameraDock = new CameraDock(this, application.getCamera(), application.getPPMSettingsModel(), application.getOutputSettingsModel());
this->addDockWidget(Qt::RightDockWidgetArea, cameraDock);
connect(&application, SIGNAL(cameraUpdated()), cameraDock, SLOT(onCameraUpdated()));
connect(cameraDock, SIGNAL(cameraUpdated()), &application, SLOT(onCameraUpdated()));
// Scene Dock
SceneDock* sceneDock = new SceneDock(this, application.getSceneManager());
this->addDockWidget(Qt::RightDockWidgetArea, sceneDock);
// Console Dock
ConsoleDock *consoleDock = new ConsoleDock(this);
this->m_consoleDock = consoleDock;
this->addDockWidget(Qt::BottomDockWidgetArea, consoleDock);
// Status Bar Running Status and Time
m_statusbar_runningStatusLabel = new QLabel(this);
this->statusBar()->addPermanentWidget(m_statusbar_runningStatusLabel, 1);
m_statusbar_runningStatusLabel->setGeometry(100, 0, 100, 12);
QTimer* runningStatusLabelTimer = new QTimer(this);
runningStatusLabelTimer->setInterval(100);
connect(runningStatusLabelTimer, SIGNAL(timeout()), this, SLOT(onUpdateRunningStatusLabelTimer()));
runningStatusLabelTimer->start();
// Status Bar Render Method
m_statusbar_renderMethodLabel = new QLabel(this);
this->statusBar()->addPermanentWidget(m_statusbar_renderMethodLabel, 1);
m_statusbar_renderMethodLabel->setGeometry(100, 0, 100, 12);
// Render Widget
m_renderWidget = new RenderWidget(centralwidget, application.getCamera(), application.getOutputSettingsModel());
gridLayout->addWidget(m_renderWidget, 0, 0, 1, 1);
connect(m_renderWidget, SIGNAL(cameraUpdated()), &application, SLOT(onCameraUpdated()));
connect(&application, SIGNAL(newFrameReadyForDisplay(const float*, unsigned long long)),
m_renderWidget, SLOT(onNewFrameReadyForDisplay(const float*, unsigned long long)),
Qt::QueuedConnection);
connect(&application, SIGNAL(runningStatusChanged()), this, SLOT(onRunningStatusChanged()));
connect(&application, SIGNAL(renderMethodChanged()), this, SLOT(onRenderMethodChanged()));
connect(this, SIGNAL(renderRestart()), &m_application, SLOT(onRenderRestart()));
connect(this, SIGNAL(renderStatusToggle()), &m_application, SLOT(onRenderStatusToggle()));
// recent files
for (int i = 0; i < maxRecentFiles; ++i) {
QAction *action = new QAction(this);
action->setVisible(false);
connect(action, SIGNAL(triggered()),
this, SLOT(onOpenRecentFile()));
menuFile->insertAction(actionQuit, action);
m_recentFileActions.append(action);
}
m_recentActionsSeparator = new QAction(this);
m_recentActionsSeparator->setSeparator(true);
menuFile->insertAction(actionQuit, m_recentActionsSeparator);
connect(this, SIGNAL(recentFilesChanged()), this, SLOT(onRecentFilesChanged()));
connect(&application.getSceneManager(), SIGNAL(sceneUpdated()), this, SLOT(onSceneUpdated()));
onRunningStatusChanged();
onRenderMethodChanged();
onRecentFilesChanged();
}
void MainWindowBase::closeEvent( QCloseEvent* event )
{
}
ConsoleDock *MainWindowBase::consoleDock()
{
return m_consoleDock;
}
MainWindowBase::~MainWindowBase()
{
}
void MainWindowBase::onActionAbout()
{
AboutWindow* aboutWindow = new AboutWindow(this);
aboutWindow->show();
connect(aboutWindow, SIGNAL(finished()), aboutWindow, SLOT(deleteLater()));
}
void MainWindowBase::onRenderStatusToggle()
{
emit renderStatusToggle();
}
void MainWindowBase::onSetCameraToDefault()
{
m_application.setCameraToSceneDefault();
}
void MainWindowBase::onChangeRenderMethodPM()
{
m_application.setRenderMethod(RenderMethod::PHOTON_MAPPING);
emit renderRestart();
}
void MainWindowBase::onChangeRenderMethodPPM()
{
m_application.setRenderMethod(RenderMethod::PROGRESSIVE_PHOTON_MAPPING);
emit renderRestart();
}
void MainWindowBase::onChangeRenderMethodPT()
{
m_application.setRenderMethod(RenderMethod::PATH_TRACING);
emit renderRestart();
}
void MainWindowBase::onConfigureGPUDevices()
{
/*QDialog* dialog = new QDialog(this);
ComputeDeviceInformationWidget* widget = new ComputeDeviceInformationWidget(dialog, ComputeDeviceRepository::get());
dialog->show();*/
}
void MainWindowBase::onOpenSceneFile()
{
QString desktopDir = QStandardPaths::locate(QStandardPaths::DesktopLocation, "", QStandardPaths::LocateDirectory);
QString fileName = QFileDialog::getOpenFileName(
this,
tr("Open File"),
desktopDir,
tr("Scene files (*.dae *.blend *.3ds);;Any(*.*)")
);
if(fileName.length() > 0)
{
m_lastOpenedSceneFile = QFileInfo(fileName);
actionReload_scene->setText(QString("Reload last scene (%1)").arg(m_lastOpenedSceneFile.completeBaseName()));
actionReload_scene->setVisible(true);
loadSceneByName(fileName);
}
}
void MainWindowBase::onRunningStatusChanged()
{
if(m_application.getRunningStatus() == RunningStatus::RUNNING)
{
actionRenderStatusToggle->setText("Pause");
}
else if(m_application.getRunningStatus() == RunningStatus::STOPPED)
{
actionRenderStatusToggle->setText("Start");
}
}
void MainWindowBase::onRenderMethodChanged()
{
QString str;
if(m_application.getRenderMethod() == RenderMethod::PATH_TRACING)
{
str = "Path Tracing";
}
else
{
str = "Progressive Photon Mapping";
if(ACCELERATION_STRUCTURE == ACCELERATION_STRUCTURE_UNIFORM_GRID)
{
str += " (Sorted uniform grid)";
}
else if(ACCELERATION_STRUCTURE == ACCELERATION_STRUCTURE_KD_TREE_CPU)
{
str += " (CPU k-d tree)";
}
else if(ACCELERATION_STRUCTURE == ACCELERATION_STRUCTURE_STOCHASTIC_HASH)
{
str += " (Stochastic hash)";
}
}
m_statusbar_renderMethodLabel->setText(QString("Render method: ") + str);
}
void MainWindowBase::onUpdateRunningStatusLabelTimer()
{
m_statusbar_runningStatusLabel->setText(QString("Status: ") + getApplicationStatusString(m_application));
}
void MainWindowBase::loadSceneByName( QString & sceneName )
{
try
{
m_application.getSceneManager().setScene(sceneName.toUtf8().constData());
}
catch(const std::exception & E)
{
QMessageBox::warning(this, "Error loading scene file", QString(E.what()));
}
catch(...)
{
QMessageBox::warning(this, "Unknown error", "Unknown error happened when importing this scene. This is not a valid scene.");
}
}
void MainWindowBase::onReloadLastScene()
{
if(m_lastOpenedSceneFile.exists())
{
loadSceneByName(m_lastOpenedSceneFile.canonicalFilePath());
}
}
void MainWindowBase::onActionOpenBuiltInScene()
{
bool ok;
QString sceneName = QInputDialog::getText(this, tr("Please provide a built-in scene name"),
tr("Name (customscene/ class name):"), QLineEdit::Normal, "", &ok);
if (ok && !sceneName.isEmpty())
{
loadSceneByName(sceneName);
}
}
void MainWindowBase::onRenderRestart()
{
emit renderRestart();
}
void MainWindowBase::onApplicationError( QString appError )
{
QMessageBox::warning(this, "An application error occurred", appError);
}
QString MainWindowBase::getApplicationStatusString(const Application & application, bool showSeconds)
{
QString status = "";
if(application.getSceneManager().getStatus() == SceneManagerStatus::IMPORTING)
{
status += "Importing scene";
}
else if(application.getRunningStatus() == RunningStatus::STOPPED)
{
status += "Stopped";
}
else if(application.getRunningStatus() == RunningStatus::PAUSE)
{
status += "Pause";
}
else
{
if(application.getRendererStatus() == RendererStatus::NOT_INITIALIZED)
{
status += "Not initialized";
}
else if(application.getRendererStatus() == RendererStatus::INITIALIZING_ENGINE)
{
status += "Initializing engine";
}
else if(application.getRendererStatus() == RendererStatus::INITIALIZING_SCENE)
{
status += "Initializing scene";
}
else if(application.getRendererStatus() == RendererStatus::RENDERING)
{
status += "Running";
if(showSeconds)
{
status += QString(" (%1 seconds)").arg(application.getRenderTimeSeconds(), 0, 'f', 1);
}
}
}
return status;
}
void MainWindowBase::onActionSaveImagePPM()
{
printf("Save image as PPM!");
}
void MainWindowBase::onRecentFilesChanged()
{
QStringList files = QSettings().value("recentFileList").toStringList();
int numRecentFiles = qMin(files.size(), maxRecentFiles);
for (int i = 0; i < numRecentFiles; ++i) {
QString strippedName = QFileInfo(files[i]).fileName();
QString text = tr("&%1 %2").arg(i + 1).arg(strippedName);
m_recentFileActions[i]->setText(text);
m_recentFileActions[i]->setData(files[i]);
m_recentFileActions[i]->setVisible(true);
}
for (int j = numRecentFiles; j < maxRecentFiles; ++j)
m_recentFileActions[j]->setVisible(false);
m_recentActionsSeparator->setVisible(numRecentFiles > 0);
}
void MainWindowBase::onOpenRecentFile()
{
QAction *action = qobject_cast<QAction *>(sender());
if (action){
QString fileName = action->data().toString();
loadSceneByName(fileName);
}
}
void MainWindowBase::onSceneUpdated()
{
QString fileName = m_application.getSceneManager().getScene()->getSceneName();
QSettings settings;
QStringList files = settings.value("recentFileList").toStringList();
files.removeAll(fileName);
files.prepend(fileName);
while (files.size() > maxRecentFiles)
files.removeLast();
settings.setValue("recentFileList", files);
emit onRecentFilesChanged();
} | 32.013158 | 148 | 0.707028 | igui |
b4955daf50bfddcf5527694d94e5dbf83e7b6cb7 | 6,513 | cxx | C++ | applications/rtkdualenergyforwardmodel/rtkdualenergyforwardmodel.cxx | cyrilmory/CyrilsRTK | bb829a9d6aff45181d1642b4b050dde999169ff8 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | applications/rtkdualenergyforwardmodel/rtkdualenergyforwardmodel.cxx | cyrilmory/CyrilsRTK | bb829a9d6aff45181d1642b4b050dde999169ff8 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | applications/rtkdualenergyforwardmodel/rtkdualenergyforwardmodel.cxx | cyrilmory/CyrilsRTK | bb829a9d6aff45181d1642b4b050dde999169ff8 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | /*=========================================================================
*
* Copyright RTK Consortium
*
* 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.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include "rtkdualenergyforwardmodel_ggo.h"
#include "rtkGgoFunctions.h"
#include "rtkConfiguration.h"
#include "rtkMacro.h"
#include "rtkSpectralForwardModelImageFilter.h"
#include "rtkConstantImageSource.h"
#include <itkImageFileReader.h>
#include <itkImageFileWriter.h>
int main(int argc, char * argv[])
{
GGO(rtkdualenergyforwardmodel, args_info);
typedef float PixelValueType;
const unsigned int Dimension = 3;
typedef itk::VectorImage< PixelValueType, Dimension > DecomposedProjectionType;
typedef itk::ImageFileReader<DecomposedProjectionType> DecomposedProjectionReaderType;
typedef itk::VectorImage< PixelValueType, Dimension > DualEnergyProjectionsType;
typedef itk::ImageFileWriter< DualEnergyProjectionsType > DualEnergyProjectionWriterType;
typedef itk::VectorImage< PixelValueType, Dimension-1 > IncidentSpectrumImageType;
typedef itk::ImageFileReader<IncidentSpectrumImageType> IncidentSpectrumReaderType;
typedef itk::Image< PixelValueType, Dimension-1 > DetectorResponseImageType;
typedef itk::ImageFileReader<DetectorResponseImageType> DetectorResponseReaderType;
typedef itk::Image< PixelValueType, Dimension-1 > MaterialAttenuationsImageType;
typedef itk::ImageFileReader<MaterialAttenuationsImageType> MaterialAttenuationsReaderType;
// Read all inputs
DecomposedProjectionReaderType::Pointer decomposedProjectionReader = DecomposedProjectionReaderType::New();
decomposedProjectionReader->SetFileName( args_info.input_arg );
decomposedProjectionReader->Update();
IncidentSpectrumReaderType::Pointer incidentSpectrumReaderHighEnergy = IncidentSpectrumReaderType::New();
incidentSpectrumReaderHighEnergy->SetFileName( args_info.high_arg );
incidentSpectrumReaderHighEnergy->Update();
IncidentSpectrumReaderType::Pointer incidentSpectrumReaderLowEnergy = IncidentSpectrumReaderType::New();
incidentSpectrumReaderLowEnergy->SetFileName( args_info.low_arg );
incidentSpectrumReaderLowEnergy->Update();
MaterialAttenuationsReaderType::Pointer materialAttenuationsReader = MaterialAttenuationsReaderType::New();
materialAttenuationsReader->SetFileName( args_info.attenuations_arg );
materialAttenuationsReader->Update();
// If the detector response is given by the user, use it. Otherwise, assume it is included in the
// incident spectrum, and fill the response with ones
DetectorResponseReaderType::Pointer detectorResponseReader = DetectorResponseReaderType::New();
DetectorResponseImageType::Pointer detectorImage;
if(args_info.detector_given)
{
detectorResponseReader->SetFileName( args_info.detector_arg );
detectorResponseReader->Update();
detectorImage = detectorResponseReader->GetOutput();
}
else
{
rtk::ConstantImageSource<DetectorResponseImageType>::Pointer detectorSource = rtk::ConstantImageSource<DetectorResponseImageType>::New();
DetectorResponseImageType::SizeType sourceSize;
sourceSize[0] = 1;
sourceSize[1] = incidentSpectrumReaderHighEnergy->GetOutput()->GetVectorLength();
detectorSource->SetSize(sourceSize);
detectorSource->SetConstant(1.0);
detectorSource->Update();
detectorImage = detectorSource->GetOutput();
}
// Get parameters from the images
const unsigned int MaximumEnergy = incidentSpectrumReaderHighEnergy->GetOutput()->GetVectorLength();
// Generate a set of zero-filled intensity projections
DualEnergyProjectionsType::Pointer dualEnergyProjections = DualEnergyProjectionsType::New();
dualEnergyProjections->CopyInformation(decomposedProjectionReader->GetOutput());
dualEnergyProjections->SetVectorLength(2);
dualEnergyProjections->Allocate();
// Check that the inputs have the expected size
DecomposedProjectionType::IndexType indexDecomp;
indexDecomp.Fill(0);
if (decomposedProjectionReader->GetOutput()->GetVectorLength() != 2)
itkGenericExceptionMacro(<< "Decomposed projections (i.e. initialization data) image has vector length "
<< decomposedProjectionReader->GetOutput()->GetVectorLength()
<< ", should be 2");
if (materialAttenuationsReader->GetOutput()->GetLargestPossibleRegion().GetSize()[1] != MaximumEnergy)
itkGenericExceptionMacro(<< "Material attenuations image has "
<< materialAttenuationsReader->GetOutput()->GetLargestPossibleRegion().GetSize()[1]
<< "energies, should have "
<< MaximumEnergy);
// Create and set the filter
typedef rtk::SpectralForwardModelImageFilter<DecomposedProjectionType, DualEnergyProjectionsType> ForwardModelFilterType;
ForwardModelFilterType::Pointer forward = ForwardModelFilterType::New();
forward->SetInputDecomposedProjections(decomposedProjectionReader->GetOutput());
forward->SetInputMeasuredProjections(dualEnergyProjections);
forward->SetInputIncidentSpectrum(incidentSpectrumReaderHighEnergy->GetOutput());
forward->SetInputSecondIncidentSpectrum(incidentSpectrumReaderLowEnergy->GetOutput());
forward->SetDetectorResponse(detectorImage);
forward->SetMaterialAttenuations(materialAttenuationsReader->GetOutput());
forward->SetIsSpectralCT(false);
forward->SetComputeVariances(args_info.variances_given);
TRY_AND_EXIT_ON_ITK_EXCEPTION(forward->Update())
// Write output
DualEnergyProjectionWriterType::Pointer writer = DualEnergyProjectionWriterType::New();
writer->SetInput(forward->GetOutput());
writer->SetFileName(args_info.output_arg);
writer->Update();
// If requested, write the variances
if (args_info.variances_given)
{
writer->SetInput(forward->GetOutput(1));
writer->SetFileName(args_info.variances_arg);
writer->Update();
}
return EXIT_SUCCESS;
}
| 45.545455 | 141 | 0.758483 | cyrilmory |
a3335aaca6be045e10a2ce5d019d2de716834385 | 1,350 | hpp | C++ | NeuralNetworkCode/src/Stimulus/Stimulus.hpp | SFB1089/BrainCode | d7fab1f455c2c58f9be73be47e9f4538b426155c | [
"MIT"
] | null | null | null | NeuralNetworkCode/src/Stimulus/Stimulus.hpp | SFB1089/BrainCode | d7fab1f455c2c58f9be73be47e9f4538b426155c | [
"MIT"
] | null | null | null | NeuralNetworkCode/src/Stimulus/Stimulus.hpp | SFB1089/BrainCode | d7fab1f455c2c58f9be73be47e9f4538b426155c | [
"MIT"
] | null | null | null | #ifndef Stimulus_HPP
#define Stimulus_HPP
#include <algorithm>
#include <string>
#include <iostream>
#include <vector>
#include <random>
#include <fstream>
#include "../GlobalFunctions.hpp"
#include "../NeuronPopSample.hpp"
/* class Stimulus is a virtual base class for injecting a determined
* current into each neuron during each time step.
* - double current(int neuronId, int populationId) returns the current for the
* current time step
* - void timeStepFinished() needs to be called after one time step is finished.
* It updates the stimulus object, if neccessary
* - get_raw_stimulus(int neuronId, int populationId) returns some non-
* normalized version of the input current as specified.
*/
class Stimulus
{
protected:
GlobalSimInfo * info;
NeuronPopSample * neurons;
double ** signal_array;
public:
Stimulus(NeuronPopSample * neur,GlobalSimInfo * info);
virtual ~Stimulus() { delete [] signal_array;}
virtual void Update(std::vector<std::vector<double>> * synaptic_dV) ;
virtual std::string GetType() = 0;
virtual void SaveParameters(std::ofstream * stream);
virtual void LoadParameters(std::vector<std::string> *input){}
double GetSignalArray(int p,int i){return signal_array[p][i];}
};
#endif //Stimulus_HPP
| 30.681818 | 81 | 0.691852 | SFB1089 |
a3340fae155e9100cf02236a6d99062b31766727 | 5,177 | cxx | C++ | Libraries/ITK/Testing/BoundaryShiftIntegral/itkBinaryIntersectWithPaddingImageFilterTest.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 13 | 2018-07-28T13:36:38.000Z | 2021-11-01T19:17:39.000Z | Libraries/ITK/Testing/BoundaryShiftIntegral/itkBinaryIntersectWithPaddingImageFilterTest.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | null | null | null | Libraries/ITK/Testing/BoundaryShiftIntegral/itkBinaryIntersectWithPaddingImageFilterTest.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 10 | 2018-08-20T07:06:00.000Z | 2021-07-07T07:55:27.000Z | /*=============================================================================
NifTK: A software platform for medical image computing.
Copyright (c) University College London (UCL). All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE.
See LICENSE.txt in the top level directory for details.
=============================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include <itkImage.h>
#include <itkNumericTraits.h>
#include <itkBinaryIntersectWithPaddingImageFilter.h>
#include <itkImageRegionIteratorWithIndex.h>
#include <time.h>
/**
* Test the BinaryIntersectWithPaddingImageFilter by generating 256x256x256 images
* and filling them with random values between 0 to 4, then testing whether
* the output image is generated correctly.
*/
int itkBinaryIntersectWithPaddingImageFilterTest(int, char* [])
{
srand(time(NULL));
// Define the dimension of the images
const unsigned int Dimension = 3;
const unsigned char IntensityRange = 5;
const unsigned char PaddingValue = 3;
// Declare the types of the images
typedef unsigned char PixelType;
typedef itk::Image<PixelType, Dimension> ImageType1;
typedef itk::Image<PixelType, Dimension> ImageType2;
// Declare the type of the index to access images
typedef itk::Index<Dimension> IndexType;
// Declare the type of the size
typedef itk::Size<Dimension> SizeType;
// Declare the type of the Region
typedef itk::ImageRegion<Dimension> RegionType;
// Declare the type for the ADD filter
typedef itk::BinaryIntersectWithPaddingImageFilter< ImageType1,
ImageType2 > FilterType;
// Declare the pointers to images
typedef ImageType1::Pointer ImageType1Pointer;
typedef ImageType2::Pointer ImageType2Pointer;
typedef FilterType::Pointer FilterTypePointer;
// Create two images
ImageType1Pointer inputImageA = ImageType1::New();
ImageType2Pointer inputImageB = ImageType1::New();
// Define their size, and start index
SizeType size;
size[0] = 256;
size[1] = 256;
size[2] = 256;
IndexType start;
start[0] = 0;
start[1] = 0;
start[2] = 0;
RegionType region;
region.SetIndex( start );
region.SetSize( size );
// Initialize Image A
inputImageA->SetLargestPossibleRegion( region );
inputImageA->SetBufferedRegion( region );
inputImageA->SetRequestedRegion( region );
inputImageA->Allocate();
// Initialize Image B
inputImageB->SetLargestPossibleRegion( region );
inputImageB->SetBufferedRegion( region );
inputImageB->SetRequestedRegion( region );
inputImageB->Allocate();
// Declare Iterator types apropriated for each image
typedef itk::ImageRegionIteratorWithIndex<ImageType1> IteratorType1;
typedef itk::ImageRegionIteratorWithIndex<ImageType2> IteratorType2;
// Create one iterator for Image A (this is a light object)
IteratorType1 it1( inputImageA, inputImageA->GetBufferedRegion() );
it1.GoToBegin();
// Initialize the content of Image A
std::cout << "First operand " << std::endl;
while( !it1.IsAtEnd() )
{
it1.Set( rand()%IntensityRange );
//std::cout << static_cast<itk::NumericTraits<PixelType>::PrintType>(it1.Get()) << std::endl;
++it1;
}
// Create one iterator for Image B (this is a light object)
IteratorType1 it2( inputImageB, inputImageB->GetBufferedRegion() );
it2.GoToBegin();
// Initialize the content of Image B
std::cout << "Second operand " << std::endl;
while( !it2.IsAtEnd() )
{
it2.Set( rand()%IntensityRange );
//std::cout << static_cast<itk::NumericTraits<PixelType>::PrintType>(it2.Get()) << std::endl;
++it2;
}
// Create an ADD Filter
FilterTypePointer filter = FilterType::New();
// Connect the input images
filter->SetInput1( inputImageA );
filter->SetInput2( inputImageB );
filter->SetPaddingValue(PaddingValue);
// Get the Smart Pointer to the Filter Output
ImageType2Pointer outputImage = filter->GetOutput();
// Execute the filter
filter->Update();
filter->SetFunctor(filter->GetFunctor());
// Create an iterator for going through the image output
IteratorType2 it3(outputImage, outputImage->GetBufferedRegion());
it1.GoToBegin();
it2.GoToBegin();
it3.GoToBegin();
// Print the content of the result image
std::cout << " Result " << std::endl;
while( !it3.IsAtEnd() )
{
PixelType pixel1 = it1.Get();
PixelType pixel2 = it2.Get();
PixelType pixel3 = it3.Get();
//std::cout << static_cast<itk::NumericTraits<PixelType>::PrintType>(pixel3) << std::endl;
if (pixel1 != PaddingValue && pixel2 != PaddingValue)
{
if (pixel3 != 1)
return EXIT_FAILURE;
}
else
{
if (pixel3 != 0)
return EXIT_FAILURE;
}
++it1;
++it2;
++it3;
}
// All objects should be automatically destroyed at this point
std::cout << "Test PASSED !" << std::endl;
return EXIT_SUCCESS;
}
| 28.761111 | 97 | 0.667568 | NifTK |
a3376be423828b25c6eda6fff30a56578c7bbbe5 | 3,235 | cc | C++ | lite/backends/x86/jit/gen_base.cc | xw-github/Paddle-Lite | 3cbd1d375d89c4deb379d44cdbcdc32ee74634c5 | [
"Apache-2.0"
] | null | null | null | lite/backends/x86/jit/gen_base.cc | xw-github/Paddle-Lite | 3cbd1d375d89c4deb379d44cdbcdc32ee74634c5 | [
"Apache-2.0"
] | null | null | null | lite/backends/x86/jit/gen_base.cc | xw-github/Paddle-Lite | 3cbd1d375d89c4deb379d44cdbcdc32ee74634c5 | [
"Apache-2.0"
] | null | null | null | /* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License. */
#include "lite/backends/x86/jit/gen_base.h"
#include <fstream>
#include <iostream>
#include <sstream>
#include <vector>
// #include "paddle/fluid/memory/allocation/cpu_allocator.h" // for
// posix_memalign
#include "lite/backends/x86/cpu_info.h"
#include "lite/backends/x86/jit/macro.h"
#include "lite/utils/env.h"
#include "lite/utils/paddle_enforce.h"
#ifndef _WIN32
#define posix_memalign_free free
#endif
#ifdef _WIN32
#define posix_memalign_free _aligned_free
#define posix_memalign(p, a, s) \
(((*(p)) = _aligned_malloc((s), (a))), *(p) ? 0 : errno)
#endif
// DEFINE_bool(dump_jitcode, false, "Whether to dump the jitcode to file");
bool dump_jitcode = paddle::lite::GetBoolFromEnv("dump_jitcode");
namespace paddle {
namespace lite {
namespace jit {
// refer do not need CanBeUsed, it would be the last one.
void GenBase::dumpCode(const unsigned char* code) const {
if (code) {
static int counter = 0;
std::ostringstream filename;
filename << "paddle_jitcode_" << name() << "." << counter << ".bin";
counter++;
std::ofstream fout(filename.str(), std::ios::out);
if (fout.is_open()) {
fout.write(reinterpret_cast<const char*>(code), this->getSize());
fout.close();
}
}
}
void* GenBase::operator new(size_t size) {
void* ptr;
constexpr size_t alignment = 32ul;
#ifdef _WIN32
ptr = _aligned_malloc(size, alignment);
#else
PADDLE_ENFORCE_EQ(posix_memalign(&ptr, alignment, size),
0,
"GenBase Alloc %ld error!",
size);
#endif
PADDLE_ENFORCE(ptr, "Fail to allocate GenBase CPU memory: size = %d .", size);
return ptr;
}
void GenBase::operator delete(void* ptr) { posix_memalign_free(ptr); }
std::vector<int> packed_groups(int n, int k, int* block_out, int* rest_out) {
int block;
int max_num_regs;
if (x86::MayIUse(x86::avx512f)) {
block = ZMM_FLOAT_BLOCK;
max_num_regs = 32;
} else {
block = YMM_FLOAT_BLOCK;
max_num_regs = 16;
}
// one for x, one for y, others for z
const int max_used_regs_for_n = max_num_regs - 2;
const int aligned_n = n % block == 0 ? n : (n / block + 1) * block;
const int num_block = aligned_n / block;
const int num_groups = num_block / max_used_regs_for_n;
std::vector<int> groups(num_groups, max_used_regs_for_n);
int rest_num_regs = num_block % max_used_regs_for_n;
if (rest_num_regs != 0) {
groups.push_back(rest_num_regs);
}
if (block_out) {
*block_out = block;
}
if (rest_out) {
*rest_out = n % block;
}
return groups;
}
} // namespace jit
} // namespace lite
} // namespace paddle
| 29.953704 | 80 | 0.683153 | xw-github |
a33939937f0e5327979204334bdaa92c6b3191cd | 5,861 | hpp | C++ | vec-kernels/include/sctl/morton.hpp | ejyoo921/FMM3D | 6aeb4031340c1aeca0754f0fd2b7ef8e754a449e | [
"Apache-2.0"
] | 71 | 2019-06-03T21:22:37.000Z | 2022-03-03T01:15:45.000Z | vec-kernels/include/sctl/morton.hpp | ejyoo921/FMM3D | 6aeb4031340c1aeca0754f0fd2b7ef8e754a449e | [
"Apache-2.0"
] | 14 | 2019-08-22T19:58:36.000Z | 2022-02-08T19:01:06.000Z | vec-kernels/include/sctl/morton.hpp | ejyoo921/FMM3D | 6aeb4031340c1aeca0754f0fd2b7ef8e754a449e | [
"Apache-2.0"
] | 23 | 2019-09-13T21:30:35.000Z | 2022-02-26T12:34:42.000Z | #ifndef _SCTL_MORTON_
#define _SCTL_MORTON_
#include SCTL_INCLUDE(common.hpp)
#include <cstdint>
#ifndef SCTL_MAX_DEPTH
#define SCTL_MAX_DEPTH 15
#endif
namespace SCTL_NAMESPACE {
template <class ValueType> class Vector;
template <Integer DIM = 3> class Morton {
public:
#if SCTL_MAX_DEPTH < 7
typedef uint8_t UINT_T;
#elif SCTL_MAX_DEPTH < 15
typedef uint16_t UINT_T;
#elif SCTL_MAX_DEPTH < 31
typedef uint32_t UINT_T;
#elif SCTL_MAX_DEPTH < 63
typedef uint64_t UINT_T;
#endif
static const Integer MAX_DEPTH = SCTL_MAX_DEPTH;
Morton() {
depth = 0;
for (Integer i = 0; i < DIM; i++) x[i] = 0;
}
template <class T> Morton(ConstIterator<T> coord, uint8_t depth_ = MAX_DEPTH) {
depth = depth_;
assert(depth <= MAX_DEPTH);
UINT_T mask = ~((((UINT_T)1) << (MAX_DEPTH - depth)) - 1);
for (Integer i = 0; i < DIM; i++) x[i] = mask & (UINT_T)floor(coord[i] * maxCoord);
}
uint8_t Depth() const { return depth; }
template <class T> void Coord(Iterator<T> coord) const {
static const T s = 1.0 / ((T)maxCoord);
for (Integer i = 0; i < DIM; i++) coord[i] = x[i] * s;
}
Morton Next() const {
UINT_T mask = ((UINT_T)1) << (MAX_DEPTH - depth);
Integer d, i;
Morton m = *this;
for (d = depth; d >= 0; d--) {
for (i = 0; i < DIM; i++) {
m.x[i] = (m.x[i] ^ mask);
if ((m.x[i] & mask)) break;
}
if (i < DIM) break;
mask = (mask << 1);
}
if (d < 0) d = 0;
m.depth = (uint8_t)d;
return m;
}
Morton Ancestor(uint8_t ancestor_level) const {
UINT_T mask = ~((((UINT_T)1) << (MAX_DEPTH - ancestor_level)) - 1);
Morton m;
for (Integer i = 0; i < DIM; i++) m.x[i] = x[i] & mask;
m.depth = ancestor_level;
return m;
}
/**
* \brief Returns the deepest first descendant.
*/
Morton DFD(uint8_t level = MAX_DEPTH) const {
Morton m = *this;
m.depth = level;
return m;
}
void NbrList(Vector<Morton> &nlst, uint8_t level, bool periodic) const {
nlst.ReInit(1);
UINT_T mask = ~((((UINT_T)1) << (MAX_DEPTH - level)) - 1);
for (Integer i = 0; i < DIM; i++) nlst[0].x[i] = x[i] & mask;
nlst[0].depth = level;
Morton m;
Integer k = 1;
mask = (((UINT_T)1) << (MAX_DEPTH - level));
if (periodic) {
for (Integer i = 0; i < DIM; i++) {
for (Integer j = 0; j < k; j++) {
m = nlst[j];
m.x[i] = (m.x[i] + mask) & (maxCoord - 1);
nlst.PushBack(m);
}
for (Integer j = 0; j < k; j++) {
m = nlst[j];
m.x[i] = (m.x[i] - mask) & (maxCoord - 1);
nlst.PushBack(m);
}
k = nlst.Dim();
}
} else {
for (Integer i = 0; i < DIM; i++) {
for (Integer j = 0; j < k; j++) {
m = nlst[j];
if (m.x[i] + mask < maxCoord) {
m.x[i] += mask;
nlst.PushBack(m);
}
}
for (Integer j = 0; j < k; j++) {
m = nlst[j];
if (m.x[i] >= mask) {
m.x[i] -= mask;
nlst.PushBack(m);
}
}
k = nlst.Dim();
}
}
}
void Children(Vector<Morton> &nlst) const {
static const Integer cnt = (1UL << DIM);
if (nlst.Dim() != cnt) nlst.ReInit(cnt);
for (Integer i = 0; i < DIM; i++) nlst[0].x[i] = x[i];
nlst[0].depth = (uint8_t)(depth + 1);
Integer k = 1;
UINT_T mask = (((UINT_T)1) << (MAX_DEPTH - (depth + 1)));
for (Integer i = 0; i < DIM; i++) {
for (Integer j = 0; j < k; j++) {
nlst[j + k] = nlst[j];
nlst[j + k].x[i] += mask;
}
k = (k << 1);
}
}
bool operator<(const Morton &m) const {
UINT_T diff = 0;
for (Integer i = 0; i < DIM; i++) diff = diff | (x[i] ^ m.x[i]);
if (!diff) return depth < m.depth;
UINT_T mask = 1;
for (Integer i = 4 * sizeof(UINT_T); i > 0; i = (i >> 1)) {
UINT_T mask_ = (mask << i);
if (mask_ <= diff) mask = mask_;
}
for (Integer i = DIM - 1; i >= 0; i--) {
if (mask & (x[i] ^ m.x[i])) return x[i] < m.x[i];
}
return false; // TODO: check
}
bool operator>(const Morton &m) const { return m < (*this); }
bool operator!=(const Morton &m) const {
for (Integer i = 0; i < DIM; i++)
if (x[i] != m.x[i]) return true;
return (depth != m.depth);
}
bool operator==(const Morton &m) const { return !(*this != m); }
bool operator<=(const Morton &m) const { return !(*this > m); }
bool operator>=(const Morton &m) const { return !(*this < m); }
bool isAncestor(Morton const &descendant) const { return descendant.depth > depth && descendant.Ancestor(depth) == *this; }
Long operator-(const Morton<DIM> &I) const {
// Intersecting -1
// Touching 0
Long offset0 = 1 << (MAX_DEPTH - depth - 1);
Long offset1 = 1 << (MAX_DEPTH - I.depth - 1);
Long diff = 0;
for (Integer i = 0; i < DIM; i++) {
diff = std::max<Long>(diff, abs(((Long)x[i] + offset0) - ((Long)I.x[i] + offset1)));
}
if (diff < offset0 + offset1) return -1;
Integer max_depth = std::max(depth, I.depth);
diff = (diff - offset0 - offset1) >> (MAX_DEPTH - max_depth);
return diff;
}
friend std::ostream &operator<<(std::ostream &out, const Morton &mid) {
double a = 0;
double s = 1u << DIM;
for (Integer j = MAX_DEPTH; j >= 0; j--) {
for (Integer i = DIM - 1; i >= 0; i--) {
s = s * 0.5;
if (mid.x[i] & (((UINT_T)1) << j)) a += s;
}
}
out << "(";
for (Integer i = 0; i < DIM; i++) {
out << mid.x[i] * 1.0 / maxCoord << ",";
}
out << (int)mid.depth << "," << a << ")";
return out;
}
private:
static constexpr UINT_T maxCoord = ((UINT_T)1) << (MAX_DEPTH);
// StaticArray<UINT_T,DIM> x;
UINT_T x[DIM];
uint8_t depth;
};
}
#endif //_SCTL_MORTON_
| 25.933628 | 125 | 0.513394 | ejyoo921 |
a339fc4732c9173612ee2dc0011a9e451d9caf35 | 3,857 | cpp | C++ | test/test_ref_results/formatter_test.cpp | mdegirolami/stay | b47676e5340c2bbd93fe97d52a12a895a3492b22 | [
"BSD-3-Clause"
] | 2 | 2021-08-13T01:00:49.000Z | 2021-09-07T17:31:14.000Z | test/test_ref_results/formatter_test.cpp | mdegirolami/sing | 7f674d3a1d5787b3f4016dc28c14e997149fc9f6 | [
"BSD-3-Clause"
] | null | null | null | test/test_ref_results/formatter_test.cpp | mdegirolami/sing | 7f674d3a1d5787b3f4016dc28c14e997149fc9f6 | [
"BSD-3-Clause"
] | null | null | null | #include "formatter_test.h"
static const int32_t veryveryveryveryveryverylong1 = 100;
static const int32_t veryveryveryveryveryverylong2 = 100;
static const int32_t veryveryveryveryveryverylong3 = 100;
static const int32_t veryveryveryveryveryverylong4 = 100;
// before class
class tc final { // on class
public:
tc();
// on ff1
void ff1();
int32_t pub_; // on pub
private:
// on ff0
void ff0();
int32_t priv1_;
int32_t priv2_; // on priv2
};
class xxx { // on if
public:
virtual ~xxx() {}
virtual void *get__id() const = 0;
virtual void dostuff() const = 0; // on fun
virtual void dootherstuff() const = 0;
};
static void manyargs(std::complex<float> veryveryveryveryveryverylongarg1, std::complex<float> veryveryveryveryveryverylongarg2,
std::complex<float> veryveryveryveryveryverylongarg3, std::complex<float> veryveryveryveryveryverylongarg4);
static void fn1(int32_t a, int32_t b, int32_t *c);
static void fn2(int32_t a, int32_t b, int32_t *c);
// attached to next
static const sing::array<sing::array<int32_t, 3>, 6> table = {{1, 2, 3}, {1, 2, 3}, {1, 2, 3}, // hand formatted !!
{1, 2, 3}, {1, 2, 3}, {1, 2, 3}
};
// attached to table4
static const sing::array<sing::array<int32_t, 3>, 6> table4 = {
{1, 2, 3}, {1, 2, 3}, {1, 2, 3},
{1, 2, 3}, {1, 2, 3}, {1, 2, 3}
};
static const sing::array<sing::array<sing::array<std::string, 3>, 3>, 3> table2 = {{{"akjhdfk", "askjfhsad", "hgfksahgjh"}, {"akjhdfk", "askjfhsad", "hgfksahgjh"}, {"akjhdfk", "askjfhsad", "hgfksahgjh"}}, {{"akjhdfk", "askjfhsad", "hgfksahgjh"}, {"akjhdfk", "askjfhsad", "hgfksahgjh"}, {"akjhdfk", "askjfhsad", "hgfksahgjh"}}, {{"akjhdfk", "askjfhsad", "hgfksahgjh"}, {"akjhdfk", "askjfhsad", "hgfksahgjh"}, {"akjhdfk", "askjfhsad", "hgfksahgjh"}}};
static const sing::array<sing::array<int32_t, 3>, 6> table3 = {
{1, 2, 3}, {1, 2, 3}, {1, 2, 3},
{1, 2, 3}, {1, 2, 3}, {1, 2, 3}
};
static const std::string stest = "kjdhfkhfdkhskdfhkshghkhl" // rem1
"hfdslkjflkjasdlkfjlksdjflkj";
static void manyargs(std::complex<float> veryveryveryveryveryverylongarg1, std::complex<float> veryveryveryveryveryverylongarg2,
std::complex<float> veryveryveryveryveryverylongarg3, std::complex<float> veryveryveryveryveryverylongarg4)
{
}
static void fn1(int32_t a, int32_t b, int32_t *c) // rem1
{
// of statement
*c = a + b; // post
*c = 100 + 123 * sing::pow2(12) + 12345 / (veryveryveryveryveryverylong1 / veryveryveryveryveryverylong2) - // rem
(veryveryveryveryveryverylong3 & veryveryveryveryveryverylong4);
manyargs(12.6526546f + std::complex<float>(0.0f, 12.925985478f), 12.6526546f + std::complex<float>(0.0f, 12.925985478f), // xyz
12.6526546f + std::complex<float>(0.0f, 12.925985478f), 12.6526546f + std::complex<float>(0.0f, 12.925985478f));
manyargs(12.6526546f + std::complex<float>(0.0f, 12.925985478f), 12.6526546f + std::complex<float>(0.0f, 12.925985478f), //xyz
12.6526546f + std::complex<float>(0.0f, 12.925985478f), 12.6526546f + std::complex<float>(0.0f, 12.925985478f));
// note: the next line has blanks but must be handled as empty
for(int32_t it = 0; it < 10; ++it) { // onfor
++(*c);
break; // inner
}
}
static void fn2(int32_t a, int32_t b, int32_t *c) // rem0
{
}
tc::tc()
{
priv1_ = 0;
priv2_ = 0;
pub_ = 0;
}
void tc::ff0()
{
priv1_ = 0;
}
void tc::ff1()
{
switch (priv2_) { // on switch
case 0:
++pub_; // on statement 0
break;
case 1:
case 2:
{ // on case2
ff0();
}
break;
}
}
| 33.25 | 449 | 0.600985 | mdegirolami |
a33a1f5edb4a1df7c78e3166bf2c5f0447f6fd4c | 24,173 | cpp | C++ | src/parser.cpp | AllanCameron/PDFR | 15abe85d853295258a30f63a8aaa09f40c772e6f | [
"MIT"
] | 20 | 2019-02-14T12:22:17.000Z | 2022-02-17T02:52:01.000Z | src/parser.cpp | AllanCameron/PDFR | 15abe85d853295258a30f63a8aaa09f40c772e6f | [
"MIT"
] | 2 | 2018-12-04T21:36:01.000Z | 2019-07-25T21:17:02.000Z | src/parser.cpp | AllanCameron/PDFR | 15abe85d853295258a30f63a8aaa09f40c772e6f | [
"MIT"
] | 1 | 2020-03-19T20:16:59.000Z | 2020-03-19T20:16:59.000Z | //---------------------------------------------------------------------------//
// //
// PDFR Parser implementation file //
// //
// Copyright (C) 2018 - 2019 by Allan Cameron //
// //
// Licensed under the MIT license - see https://mit-license.org //
// or the LICENSE file in the project root directory //
// //
//---------------------------------------------------------------------------//
#include "utilities.h"
#include "font.h"
#include "text_element.h"
#include "page.h"
#include "parser.h"
#include<iostream>
//---------------------------------------------------------------------------//
using namespace std;
using namespace Token;
//---------------------------------------------------------------------------//
// This typedef declares fptr as a function pointer
typedef void (Parser::*FunctionPointer)();
//---------------------------------------------------------------------------//
// This statically-declared map allows functions to be called based on strings
// passed to it from the tokenizer
std::unordered_map<std::string, FunctionPointer> Parser::function_map_ =
{
{"Q", &Parser::Q_ }, {"q", &Parser::q_ }, {"BT", &Parser::BT_ },
{"ET", &Parser::ET_ }, {"cm", &Parser::cm_}, {"Tm", &Parser::Tm_ },
{"Tf", &Parser::Tf_ }, {"Td", &Parser::Td_}, {"Th", &Parser::TH_ },
{"Tw", &Parser::TW_ }, {"Tc", &Parser::TC_}, {"TL", &Parser::TL_ },
{"T*", &Parser::T__ }, {"TD", &Parser::TD_}, {"'", &Parser::Ap_ },
{"TJ", &Parser::TJ_ }, {"Tj", &Parser::TJ_}, {"re", &Parser::re_ },
{"l", &Parser::l_ }, {"m", &Parser::m_ }, {"w", &Parser::w_ },
{"f", &Parser::f_ }, {"F", &Parser::f_ }, {"f*", &Parser::f_ },
{"s", &Parser::s_ }, {"S", &Parser::S_ }, {"CS", &Parser::CS_ },
{"cs", &Parser::cs_ }, {"SC", &Parser::SC_}, {"sc", &Parser::sc_ },
{"h", &Parser::h_ }, {"rg", &Parser::rg_}, {"RG", &Parser::RG_ },
{"G", &Parser::G_ }, {"g", &Parser::g_ }, {"scn", &Parser::scn_},
{"SCN", &Parser::SCN_}, {"K", &Parser::K_ }, {"k", &Parser::k_ },
{"c", &Parser::c_ }, {"v", &Parser::v_ }, {"y", &Parser::y_ },
{"B", &Parser::B_ }, {"B*", &Parser::B_ }, {"b", &Parser::b_ },
{"b*", &Parser::b_ }, {"n", &Parser::n_ }
};
//---------------------------------------------------------------------------//
// Creates a 100 point Bezier interpolation for start point p1, end point p4
// and control points p2 and p3. Used only in implementing Bezier operators.
// This has to be used once for the x co-ordinates and once for the y
// co-ordinates.
std::vector<float> bezier(float p1, float p2, float p3, float p4) {
std::vector<float> result(100);
for(int i = 0; i < 100; i++)
{
float t1 = (i + 1) * 0.01;
float t2 = 1 - t1;
result[i] = 1 * t2 * t2 * t2 * p1 +
3 * t1 * t2 * t2 * p2 +
3 * t1 * t1 * t2 * p3 +
1 * t1 * t1 * t1 * p4;
}
return result;
}
//---------------------------------------------------------------------------//
// The Parser constructor has to initialize many variables that allow
// it to track state once instructions are passed to it. After these are set,
// it does no work unless passed instructions by the tokenizer
Parser::Parser(shared_ptr<Page> page_ptr) :
page_(page_ptr),
text_box_(unique_ptr<TextBox>(new TextBox(Box(*(page_->GetMinbox()))))),
graphics_state_({GraphicsState(page_ptr)}), // Graphics state stack
kerning_(0)
{
graphics_.emplace_back(std::make_shared<Path>());
}
/*---------------------------------------------------------------------------*/
// re operator - defines a rectangle
void Parser::re_()
{
graphics_.back()->NewSubpath();
float left = std::stof(operands_[0]);
float width = std::stof(operands_[2]);
float right = left + width;
float bottom = std::stof(operands_[1]);
float height = std::stof(operands_[3]);
float top = bottom + height;
auto lb = graphics_state_.back().CTM.transformXY(left, bottom);
auto rb = graphics_state_.back().CTM.transformXY(right, bottom);
auto lt = graphics_state_.back().CTM.transformXY(left, top);
auto rt = graphics_state_.back().CTM.transformXY(right, top);
graphics_.back()->AppendX({lb[0], lt[0], rt[0], rb[0]});
graphics_.back()->AppendY({lb[1], lt[1], rt[1], rb[1]});
graphics_.back()->CloseSubpath();
}
/*---------------------------------------------------------------------------*/
// m operator moves the current graphics co-ordinate
void Parser::m_() {
graphics_.back()->NewSubpath();
auto xy = graphics_state_.back().CTM.transformXY(std::stof(operands_[0]),
std::stof(operands_[1]));
graphics_.back()->AppendX({xy[0]});
graphics_.back()->AppendY({xy[1]});
}
/*---------------------------------------------------------------------------*/
// CS operator sets current color space for strokes
void Parser::CS_() {
graphics_state_.back().colour_space_stroke = {operands_[0]};
}
/*---------------------------------------------------------------------------*/
// cs operator sets current color space for fills
void Parser::cs_() {
graphics_state_.back().colour_space_fill = {operands_[0]};
}
/*---------------------------------------------------------------------------*/
// SC operator sets stroke colour
void Parser::SC_() {
size_t n = operands_.size();
if(n == 1) G_();
if(n == 3) RG_();
if(n == 4) K_();
}
/*---------------------------------------------------------------------------*/
// SCN operator sets stroke colour via CMYK
void Parser::K_() {
graphics_state_.back().colour_space_stroke = {"/DeviceCMYK"};
// CMYK approximation
float black = 1 - std::stof(operands_[3]);
graphics_state_.back().colour = {
(1 - std::stof(operands_[0])) * black,
(1 - std::stof(operands_[1])) * black,
(1 - std::stof(operands_[2])) * black
};
}
/*---------------------------------------------------------------------------*/
// SCN operator sets stroke colour or pattern
void Parser::SCN_() {
SC_();
}
/*---------------------------------------------------------------------------*/
// SCN operator sets fill colour or pattern
void Parser::scn_() {
sc_();
}
/*---------------------------------------------------------------------------*/
// RG operator sets stroke colour
void Parser::RG_() {
graphics_state_.back().colour_space_stroke = {"/DeviceRGB"};
graphics_state_.back().colour = { std::stof(operands_[0]),
std::stof(operands_[1]),
std::stof(operands_[2])
};
}
/*---------------------------------------------------------------------------*/
// rg operator sets fill colour
void Parser::rg_() {
graphics_state_.back().colour_space_fill = {"/DeviceRGB"};
graphics_state_.back().fill = { std::stof(operands_[0]),
std::stof(operands_[1]),
std::stof(operands_[2])
};
}
/*---------------------------------------------------------------------------*/
// RG operator sets stroke colour
void Parser::G_() {
graphics_state_.back().colour_space_stroke = {"/DeviceGray"};
graphics_state_.back().colour = { std::stof(operands_[0]),
std::stof(operands_[0]),
std::stof(operands_[0])
};
}
/*---------------------------------------------------------------------------*/
// g operator sets fill colour
void Parser::g_() {
graphics_state_.back().colour_space_fill = {"/DeviceGray"};
graphics_state_.back().fill = { std::stof(operands_[0]),
std::stof(operands_[0]),
std::stof(operands_[0])
};
}
/*---------------------------------------------------------------------------*/
// sc operator sets fill colour
void Parser::sc_() {
size_t n = operands_.size();
if(n == 1) g_();
if(n == 3) rg_();
if(n == 4) k_();
}
/*---------------------------------------------------------------------------*/
// k operator sets fill colour
void::Parser::k_() {
graphics_state_.back().colour_space_fill = {"/DeviceCMYK"};
float black = 1 - std::stof(operands_[3]);
graphics_state_.back().fill = {
(1 - std::stof(operands_[0])) * black,
(1 - std::stof(operands_[1])) * black,
(1 - std::stof(operands_[2])) * black
};
}
void Parser::B_() {
graphics_.back()->SetFilled(true);
graphics_.back()->SetFillColour(graphics_state_.back().fill);
S_();
}
void Parser::b_() {
h_();
B_();
}
/*---------------------------------------------------------------------------*/
// l operator constructs a path segment
void Parser::l_() {
auto xy = graphics_state_.back().CTM.transformXY(std::stof(operands_[0]),
std::stof(operands_[1]));
graphics_.back()->SetLineWidth(graphics_state_.back().line_width *
graphics_state_.back().CTM[0]);
graphics_.back()->AppendX({xy[0]});
graphics_.back()->AppendY({xy[1]});
}
/*---------------------------------------------------------------------------*/
// c operator constructs a bezier curve with two control points
void Parser::c_() {
std::array<float, 2> xy0 = {graphics_.back()->GetX().back(),
graphics_.back()->GetY().back()};
auto xy1 = graphics_state_.back().CTM.transformXY(std::stof(operands_[0]),
std::stof(operands_[1]));
auto xy2 = graphics_state_.back().CTM.transformXY(std::stof(operands_[2]),
std::stof(operands_[3]));
auto xy3 = graphics_state_.back().CTM.transformXY(std::stof(operands_[4]),
std::stof(operands_[5]));
auto new_x = bezier(xy0[0], xy1[0], xy2[0], xy3[0]);
auto new_y = bezier(xy0[1], xy1[1], xy2[1], xy3[1]);
graphics_.back()->AppendX(new_x);
graphics_.back()->AppendY(new_y);
}
/*---------------------------------------------------------------------------*/
// v operator constructs a bezier curve with single control point (first point
// also acting as control point)
void Parser::v_() {
std::array<float, 2> xy0 = {graphics_.back()->GetX().back(),
graphics_.back()->GetY().back()};
auto xy1 = xy0;
auto xy2 = graphics_state_.back().CTM.transformXY(std::stof(operands_[0]),
std::stof(operands_[1]));
auto xy3 = graphics_state_.back().CTM.transformXY(std::stof(operands_[2]),
std::stof(operands_[3]));
auto new_x = bezier(xy0[0], xy1[0], xy2[0], xy3[0]);
auto new_y = bezier(xy0[1], xy1[1], xy2[1], xy3[1]);
graphics_.back()->AppendX(new_x);
graphics_.back()->AppendY(new_y);
}
/*---------------------------------------------------------------------------*/
// y operator constructs a bezier curve with single control point (last point
// also acting as control point)
void Parser::y_() {
std::array<float, 2> xy0 = {graphics_.back()->GetX().back(),
graphics_.back()->GetY().back()};
auto xy1 = graphics_state_.back().CTM.transformXY(std::stof(operands_[0]),
std::stof(operands_[1]));
auto xy2 = graphics_state_.back().CTM.transformXY(std::stof(operands_[2]),
std::stof(operands_[3]));
auto xy3 = xy2;
auto new_x = bezier(xy0[0], xy1[0], xy2[0], xy3[0]);
auto new_y = bezier(xy0[1], xy1[1], xy2[1], xy3[1]);
graphics_.back()->AppendX(new_x);
graphics_.back()->AppendY(new_y);
}
/*---------------------------------------------------------------------------*/
// h operator closes path
void Parser::h_() {
graphics_.back()->CloseSubpath();
}
/*---------------------------------------------------------------------------*/
// w operator sets line width
void Parser::w_() {
graphics_state_.back().line_width = std::stof(operands_[0]);
}
/*---------------------------------------------------------------------------*/
// f operator fills the previous path
void Parser::f_() {
graphics_.back()->SetFilled(true);
graphics_.back()->SetFillColour(graphics_state_.back().fill);
graphics_.push_back(std::make_shared<Path>());
}
void Parser::n_() {
graphics_.push_back(std::make_shared<Path>());
}
/*---------------------------------------------------------------------------*/
// S operator strokes the path
void Parser::S_() {
graphics_.back()->SetStroke(true);
graphics_.back()->SetColour(graphics_state_.back().colour);
graphics_.back()->SetLineWidth(graphics_state_.back().line_width *
graphics_state_.back().CTM[0]);
graphics_.push_back(std::make_shared<Path>());
}
/*---------------------------------------------------------------------------*/
// s operator closes and strokes the path
void Parser::s_() {
h_();
S_();
}
/*---------------------------------------------------------------------------*/
// q operator - pushes a copy of the current graphics state to the stack
void Parser::q_()
{
graphics_state_.emplace_back(graphics_state_.back());
}
/*---------------------------------------------------------------------------*/
// Q operator - pop the graphics state stack
void Parser::Q_()
{
// Empty graphics state is undefined but graphics_state_[0] is identity
if (graphics_state_.size() > 1) graphics_state_.pop_back();
}
/*---------------------------------------------------------------------------*/
// Td operator - applies tranlational changes only to text matrix (Tm)
void Parser::Td_()
{
Matrix Tds = Matrix(); //---------------------------------
Tds[6] = ParseFloats(operands_[0])[0]; // create 3 x 3 translation matrix
Tds[7] = ParseFloats(operands_[1])[0]; //---------------------------------
// Multiply translation and text matrices
graphics_state_.back().td_state *= Tds;
// Td resets kerning
kerning_ = 0;
}
/*---------------------------------------------------------------------------*/
// TD operator - same as Td except it also sets the 'leading' (Tl) operator
void Parser::TD_()
{
Td_();
// Set text leading to new value
graphics_state_.back().text_state.tl = -ParseFloats(operands_[1])[0];
}
/*---------------------------------------------------------------------------*/
// BT operator - signifies start of text
void Parser::BT_()
{
// Reset text matrix to identity matrix
graphics_state_.back().tm_state = Matrix();
graphics_state_.back().td_state = Matrix();
// Reset word spacing and character spacing
graphics_state_.back().text_state.tw = graphics_state_.back().text_state.tc = 0;
graphics_state_.back().text_state.th = 100; // reset horizontal spacing
}
/*---------------------------------------------------------------------------*/
// ET operator - signifies end of text
void Parser::ET_()
{
BT_();
graphics_.push_back(std::make_shared<Path>());
}
/*---------------------------------------------------------------------------*/
// Tf operator - specifies font and pointsize
void Parser::Tf_()
{
// Should be 2 operators: 1 is not defined
if (operands_.size() > 1)
{
graphics_state_.back().text_state.tf = operands_[0];
graphics_state_.back().text_state.current_font =
page_->GetFont(graphics_state_.back().text_state.tf);
graphics_state_.back().text_state.tfs = ParseFloats(operands_[1])[0];
}
}
/*---------------------------------------------------------------------------*/
// TH - sets horizontal spacing
void Parser::TH_()
{
// Reads operand as new horizontal spacing value
graphics_state_.back().text_state.th = stof(operands_.at(0));
}
/*---------------------------------------------------------------------------*/
// Tc operator - sets character spacing
void Parser::TC_()
{
// Reads operand as new character spacing value
graphics_state_.back().text_state.tc = stof(operands_.at(0));
}
/*---------------------------------------------------------------------------*/
// TW operator - sets word spacing
void Parser::TW_()
{
// Reads operand as new word spacing value
graphics_state_.back().text_state.tw = stof(operands_.at(0));
}
/*---------------------------------------------------------------------------*/
// TL operator - sets leading (size of vertical jump to new line)
void Parser::TL_()
{
// Reads operand as new text leading value
graphics_state_.back().text_state.tl = stof(operands_.at(0));
}
/*---------------------------------------------------------------------------*/
// T* operator - moves to new line
void Parser::T__()
{
// Decrease y value of text matrix by amount specified by text leading param
graphics_state_.back().td_state[7] = graphics_state_.back().td_state[7] -
graphics_state_.back().text_state.tl;
// This also resets the kerning
kerning_ = 0;
}
/*---------------------------------------------------------------------------*/
// Tm operator - sets the text matrix (convolve text relative to graphics state)
void Parser::Tm_()
{
// Reads operands as a 3x3 matrix
graphics_state_.back().tm_state = Matrix(operands_);
// Reset the Td modifier matrix to identity matrix
graphics_state_.back().td_state = Matrix();
// Reset the kerning
kerning_ = 0;
}
/*---------------------------------------------------------------------------*/
// cm operator - applies transformation matrix to graphics state
void Parser::cm_()
{
// Read the operands as a matrix, multiply by top of graphics state stack
// and replace the top of the stack with the result
graphics_state_.back().CTM *= Matrix(operands_);
}
/*---------------------------------------------------------------------------*/
// The "'" operator is a minor variation of the TJ function. Ap is short for
// apostrophe
void Parser::Ap_()
{
// The "'" operator is the same as Tj except it moves to the next line first
graphics_state_.back().td_state[7] -= graphics_state_.back().text_state.tl;
kerning_ = 0;
TJ_();
}
/*---------------------------------------------------------------------------*/
// TJ operator - prints glyphs to the output. This is the crux of the reading
// process, because it is where all the elements come together to get the
// values needed for each character. Since there are actually 3 operators
// that print text in largely overlapping ways, they are all handled here,
// but that requires an extra parameter to be passed in to specify which
// operation we are dealing with.
//
// This function is heavily commented as a little mistake here can screw
// everything up. YOU HAVE BEEN WARNED!
void Parser::TJ_()
{
// Creates text space that is the product of Tm, td and cm matrices
// and sets the starting x value and scale of our string
Matrix text_space = graphics_state_.back().CTM *
graphics_state_.back().tm_state *
graphics_state_.back().td_state;
float initial_x = text_space[6],
scale = graphics_state_.back().text_state.tfs * text_space[0];
// We now iterate through our operands and their associated types
for (size_t index = 0; index < operand_types_.size(); index++)
{
// Adjust the text space according to kerning and scale
text_space[6] = kerning_ * scale / 1000 + initial_x;
// Depending on the operand type, we process the operand as appropriate
switch (operand_types_[index])
{
case NUMBER : kerning_ -= stof(operands_[index]); continue;
case HEXSTRING : raw_ = ConvertHexToRawChar(operands_[index]); break;
case STRING : raw_ = ConvertStringToRawChar(operands_[index]); break;
default : continue;
}
// Now we can process the string given the current user space and font
if (!operands_[index].empty()) ProcessRawChar_(scale, text_space, initial_x);
}
}
/*---------------------------------------------------------------------------*/
// This method is a helper of / extension of Tj which takes the RawChars
// generated, the userspace and initial userspace to calculate the
// glyphs, sizes and positions intended by the string in the page program
void Parser::ProcessRawChar_(float& scale, Matrix& text_space,
float& initial_x)
{
// Look up the RawChars in the font to get their Unicode values and widths
vector<pair<Unicode, float>>&& glyph_pairs =
graphics_state_.back().text_state.current_font->MapRawChar(raw_);
// Now, for each character...
for (auto& glyph_pair : glyph_pairs)
{
float glyph_width, left, right, bottom, width;
// If the first character is not a space, record its position as is and
// adjust for character spacing
if (glyph_pair.first != 0x0020)
{
left = text_space[6];
bottom = text_space[7];
glyph_width = glyph_pair.second + graphics_state_.back().text_state.tc * 1000 /
graphics_state_.back().text_state.tfs;
}
else // if this is a space, just adjust word & char spacing
{
glyph_width = glyph_pair.second +
1000 * (graphics_state_.back().text_state.tc +
graphics_state_.back().text_state.tw) /
graphics_state_.back().text_state.tfs;
}
// Adjust the kerning in text space by character width
kerning_ += glyph_width;
// Move user space right by the (converted to user space) width of the char
text_space[6] = kerning_ * scale / 1000 + initial_x;
if (glyph_pair.first != 0x0020)
{
// record width of char taking Th (horizontal scaling) into account
width = scale * (glyph_width / 1000) *
(graphics_state_.back().text_state.th / 100);
right = left + width;
auto te = make_shared<TextElement>
(left, right, bottom + scale,
bottom, scale,
graphics_state_.back().text_state.current_font,
vector<Unicode>{glyph_pair.first});
graphics_.push_back(std::make_shared<Text>(te));
graphics_.back()->SetColour(graphics_state_.back().colour);
graphics_.back()->SetFillColour(graphics_state_.back().fill);
text_box_->push_back(te);
}
}
raw_.clear();
}
/*---------------------------------------------------------------------------*/
// The reader takes the instructions generated by the tokenizer and enacts them.
// It does this by reading each token and its type. If it comes across an
// IDENTIFIER it calls the operator function for that symbol. Otherwise,
// it assumes it is reading an operand and places it on the operand stack.
// When an operator function is called, it takes the operands on the stack
// as arguments.
void Parser::Reader(const string& token, TokenState state)
{
// if it's an identifier, call the operator
if (state == IDENTIFIER)
{
// Pass any stored operands on the stack
auto finder = function_map_.find(token);
if (finder != function_map_.end()) (this->*function_map_[token])();
// Clear the stack since an operator has been called
operand_types_.clear();
operands_.clear();
}
else
{
// Push operands and their types on stack, awaiting operator
operand_types_.push_back(state);
operands_.push_back(token);
}
}
/*---------------------------------------------------------------------------*/
// Can't inline this without including page.h in header
shared_ptr<string> Parser::GetXObject(const string& inloop) const
{
return page_->GetXObject(inloop);
};
| 33.855742 | 85 | 0.508998 | AllanCameron |
a33ef0c3de014f99c9a4dd6af4781002a66527fb | 3,786 | cpp | C++ | ShaderBank.cpp | m3rt32/OpenGL-Playground | 5dbf38dce53ee90a2e59953bedb83de59c270f0a | [
"Apache-2.0"
] | null | null | null | ShaderBank.cpp | m3rt32/OpenGL-Playground | 5dbf38dce53ee90a2e59953bedb83de59c270f0a | [
"Apache-2.0"
] | null | null | null | ShaderBank.cpp | m3rt32/OpenGL-Playground | 5dbf38dce53ee90a2e59953bedb83de59c270f0a | [
"Apache-2.0"
] | 1 | 2020-04-22T22:30:22.000Z | 2020-04-22T22:30:22.000Z | #include <iostream>
#include <fstream>
#include <sstream>
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <vector>
#include <glm.hpp>
#include <gtc/matrix_transform.hpp>
#include <gtc/matrix_access.hpp>
class ShaderBank
{
public:
ShaderBank(std::string vertexFile, std::string fragmentFile)
{
vertexShaderId = LoadShader(vertexFile, GL_VERTEX_SHADER);
fragmentShaderId = LoadShader(fragmentFile, GL_FRAGMENT_SHADER);
programId = glCreateProgram();
glAttachShader(programId, vertexShaderId);
glAttachShader(programId, fragmentShaderId);
}
void BindAttribute(int attributeIndex, std::string attributeName)
{
const GLchar* attrName = attributeName.c_str();
glBindAttribLocation(programId, attributeIndex, attrName);
}
void Prepare()
{
glLinkProgram(programId);
glValidateProgram(programId);
prepared = true;
CheckLinking();
GetAllUniformLocations();
}
void Activate()
{
if (!this->prepared)
std::cout << "Prepare method not called!!!" << std::endl;
glUseProgram(programId);
}
void Deactivate()
{
glUseProgram(0);
}
void Dispose()
{
Deactivate();
glDetachShader(programId, vertexShaderId);
glDetachShader(programId, fragmentShaderId);
glDeleteShader(vertexShaderId);
glDeleteShader(fragmentShaderId);
glDeleteProgram(programId);
}
void GetAllUniformLocations()
{
location_transformMatrix = GetUniformLocation("transformationMatrix");
location_MVPMatrix = GetUniformLocation("MVP");
}
void LoadTRSToBuffer(glm::mat4 matrix)
{
LoadToUniformBuffer(location_transformMatrix, matrix);
}
void LoadMVPToBuffer(glm::mat4 model,glm::mat4 view,glm::mat4 projection)
{
glm::mat4 mvp = projection * view * model;
LoadToUniformBuffer(location_MVPMatrix, mvp);
}
private:
bool prepared = false;
int programId;
int vertexShaderId;
int fragmentShaderId;
int location_transformMatrix;
int location_MVPMatrix;
static int LoadShader(std::string shaderFileName, int shaderType)
{
auto sourceString = ReadShader(shaderFileName);
const GLchar* source = sourceString.c_str();
const int source_length = sourceString.size();
int shader_id = glCreateShader(shaderType);
glShaderSource(shader_id, 1, &source, &source_length);
glCompileShader(shader_id);
int result;
glGetShaderiv(shader_id, GL_COMPILE_STATUS, &result);
if (result != GL_TRUE)
{
int log_length = 0;
char message[2048];
glGetShaderInfoLog(shader_id, 2048, &log_length, message);
std::cout << message << std::endl;
}
return shader_id;
}
static std::string ReadShader(std::string shaderFileName)
{
std::ifstream inFile;
inFile.open("Engine/Shaders/" + shaderFileName);
if (!inFile)
std::cout << "ERROR READING" + shaderFileName << std::endl;
std::stringstream strStream;
strStream << inFile.rdbuf();
return strStream.str();
}
void CheckLinking()
{
GLint program_linked;
glGetProgramiv(programId, GL_LINK_STATUS, &program_linked);
if (program_linked != GL_TRUE)
{
GLsizei log_length = 0;
GLchar message[1024];
glGetProgramInfoLog(programId, 1024, &log_length, message);
std::cout << message << std::endl;
}
}
int GetUniformLocation(std::string uniformName)
{
return glGetUniformLocation(programId, uniformName.c_str());
}
void LoadToUniformBuffer(int location, float value)
{
glUniform1f(location, value);
}
void LoadToUniformBuffer(int location, glm::vec3 value)
{
glUniform3f(location, value.x, value.y, value.z);
}
void LoadToUniformBuffer(int location, bool value)
{
glUniform1i(location, value);
}
void LoadToUniformBuffer(int location, glm::mat4& value) //& passing value by reference
{
//count:how many matrices that you provide
glUniformMatrix4fv(location, 1, false, &value[0][0]); //get pointer of the referenced value
}
}; | 24.584416 | 93 | 0.735605 | m3rt32 |
a3423b5d7f97f8e1c2bef283aa025cb897bf25e9 | 1,014 | cpp | C++ | tests/decisionMaker/XML_test_load_parameters_decision_maker_v2/main.cpp | SimulationEverywhere/NEP_DAM | bc8cdf661c4a4e050abae12fb756f41ec6240e6b | [
"BSD-2-Clause"
] | null | null | null | tests/decisionMaker/XML_test_load_parameters_decision_maker_v2/main.cpp | SimulationEverywhere/NEP_DAM | bc8cdf661c4a4e050abae12fb756f41ec6240e6b | [
"BSD-2-Clause"
] | null | null | null | tests/decisionMaker/XML_test_load_parameters_decision_maker_v2/main.cpp | SimulationEverywhere/NEP_DAM | bc8cdf661c4a4e050abae12fb756f41ec6240e6b | [
"BSD-2-Clause"
] | null | null | null | #include <math.h>
#include <assert.h>
#include <memory>
#include <iomanip>
#include <iostream>
#include <fstream>
#include <string>
#include <chrono>
#include <algorithm>
#include <limits>
#include "../../../data_structures/nep_model_enum_types.hpp"
#include "../../../data_structures/decision_maker_behaviour_struct_types_V2.hpp"
#include "../../../data_structures/decision_maker_behaviour_enum_types.hpp"
using namespace std;
using namespace nep_model_enum_types;
using namespace decision_maker_behaviour_structures;
using namespace decision_maker_behaviour_enum_types;
int main(){
string file_name_in = string("XML_DecisionMakerBehaviour_Eg1_v2.xml");
DecisionMakerBehaviour decison_maker_behaviour;
const char * in = file_name_in.c_str();
decison_maker_behaviour.load(in);
#ifdef DEBUG_PARAMETERS
string debugname = string("test_load_XML_DecisionMakerBehaviour_Eg1_v2.xml");
const char * out = debugname.c_str();
decison_maker_behaviour.save(out);
#endif
return 1;
} | 29.823529 | 87 | 0.770217 | SimulationEverywhere |
a34257fafa1f6103acf98bad3926e1a6d75fc991 | 2,687 | cpp | C++ | snowman.cpp | ItayMeiri/CCPEx_1B | a020e314416371bd891e46507ec1ad3cd836cd8d | [
"MIT"
] | null | null | null | snowman.cpp | ItayMeiri/CCPEx_1B | a020e314416371bd891e46507ec1ad3cd836cd8d | [
"MIT"
] | null | null | null | snowman.cpp | ItayMeiri/CCPEx_1B | a020e314416371bd891e46507ec1ad3cd836cd8d | [
"MIT"
] | null | null | null | #include "snowman.hpp"
#include <iostream>
namespace ariel
{
const int options = 4;
const int required_seed_length = 8;
std::array<std::string, options> hats = {
" _===_",
" ___\n .....",
" _\n /_\\",
" ___ \n (_*_)"
};
std::array<std::string, options> noses = {",", ".", "_", " "};
std::array<std::string, options> eyes = {".", "o", "O", "-"};
std::array<std::string, options> base = {" : ", "\" \"", "___", " "};
std::array<std::string, options> torso = {" : ", "] [", "> <", " "};
std::array<std::string, options> leftHand = {" <", "\\ ", " /", " "};
std::array<std::string, options> rightHand = {" >", "/ ", " \\", " "};
const int Hat=0 , Nose=1, LeftEye=2 , RightEye=3, RightHand=4, LeftHand=5, Torso=6, Base=7;
std::string snowman(int seed)
{
// validate snowman seed, throws exception when invalid
std::array<std::string, required_seed_length> strSeed = seedValidator(seed); // stored as the seed HNLRXYTB
std::string sman =
strSeed.at(Hat) + "\n" // hat
+strSeed.at(RightHand).at(0) + "(" // right arm, char 0
+strSeed.at(LeftEye) + strSeed.at(1) + strSeed.at(3) + ")" // face and eyes
+strSeed.at(LeftHand).at(0) + "\n" // left arm, char 0
+strSeed.at(RightHand).at(1) + "(" // right arm, char 1
+strSeed.at(Torso) + ")" // torso
+strSeed.at(LeftHand).at(1) + "\n (" // left arm, char 1
+strSeed.at(Base) + ")"; // base
return sman;
}
constexpr int TEN{10};
std::array<std::string, required_seed_length> seedValidator(int seed)
{
if(seed < 0) { throw std::out_of_range("Invalid code '5'");}
int count = 0;
std::array<std::string, required_seed_length> str;
int size = required_seed_length - 1;
while(seed > 0)
{
if ((seed % TEN) > 4){ // get last digit
throw std::out_of_range("Invalid code '5'");
}
//HNLRXYTB
int index = (seed % TEN) - 1;
int strCount = size - count;
if(count == Base){str.at(strCount) = hats.at(index);}
else if(count == Torso){str.at(strCount) = noses.at(index);}
else if( (count == LeftHand) || (count == RightHand) ){str.at(strCount) = eyes.at(index);} // left
else if(count == RightEye){str.at(strCount) = leftHand.at(index);}
else if(count == LeftEye){str.at(strCount) = rightHand.at(index);}
else if(count == Nose){str.at(strCount) = torso.at(index);}
else if(count == Hat){str.at(strCount) = base.at(index);}
seed = (seed/TEN); // removes last digit
count++; // counts the digits
}
if(count != required_seed_length ){
throw std::out_of_range("Invalid code '5'");
}
return str;
}
} | 34.896104 | 112 | 0.563082 | ItayMeiri |
a34280ac3c7c8c2366bb0a8a2bafa26677fb2624 | 5,349 | cpp | C++ | GPRO-Graphics1/project/VisualStudio/GPRO-Graphics1/rawdata.cpp | rmMinusR/GPR-200 | 344d983a1a9cc9c1d2468cc2502a403e793eddf9 | [
"Apache-2.0"
] | null | null | null | GPRO-Graphics1/project/VisualStudio/GPRO-Graphics1/rawdata.cpp | rmMinusR/GPR-200 | 344d983a1a9cc9c1d2468cc2502a403e793eddf9 | [
"Apache-2.0"
] | null | null | null | GPRO-Graphics1/project/VisualStudio/GPRO-Graphics1/rawdata.cpp | rmMinusR/GPR-200 | 344d983a1a9cc9c1d2468cc2502a403e793eddf9 | [
"Apache-2.0"
] | null | null | null | #include "rawdata.hpp"
/*
Copyright 2020 Robert S. Christensen
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.
*/
/*
rawdata.cpp
Contains basic boilerplate data types such as float4 and int3. All member
variables are given deliberately vague names, which are accessed by
reference as RGB or XYZ in children.
These are loosely based on:
- `vec3` by Dan Buckstein in his starter framework
- `vec3` by Peter Shirley in `Ray Tracing in One Weekend`
- `Vector3` by myself, in `rm's Bukkit Common API` (private codebase available upon request)
- `Vector` and `Quaternion` by Unity Technologies
*/
#pragma region int3
//Data IO
int3::int3(int _x, int _y, int _z) : val0(_x), val1(_y), val2(_z)
{ }
int3::int3(float _x, float _y, float _z) : int3((int)_x, (int)_y, (int)_z)
{ }
int3::int3(const int3& cpy) : val0(cpy.val0), val1(cpy.val1), val2(cpy.val2)
{ }
int3& int3::operator=(const int3& rhs)
{
this->val0 = rhs.val0;
this->val1 = rhs.val1;
this->val2 = rhs.val2;
return *this;
}
int3& int3::operator+=(const int3& rhs) { return *this = *this + rhs; }
int3& int3::operator-=(const int3& rhs) { return *this = *this - rhs; }
int3& int3::operator*=(const float& rhs) { return *this = *this * rhs; }
int3& int3::operator/=(const float& rhs) { return *this = *this / rhs; }
//Math operators
inline int3 int3::operator+(const int3& rhs) const
{
return int3(this->val0 + rhs.val0, this->val1 + rhs.val1, this->val2 + rhs.val2);
}
inline int3 int3::operator-(const int3& rhs) const
{
return int3(this->val0 - rhs.val0, this->val1 - rhs.val1, this->val2 - rhs.val2);
}
inline int3 int3::operator*(const float& rhs) const
{
return int3(this->val0 * rhs, this->val1 * rhs, this->val2 * rhs);
}
//Allows float*int3 as well
int3 operator*(const float& lhs, const int3& rhs) { return rhs * lhs; }
inline int3 int3::operator/(const float& rhs) const
{
return int3(this->val0 / rhs, this->val1 / rhs, this->val2 / rhs);
}
#pragma endregion int3
#pragma region float3
//Data IO
float3::float3(float _x, float _y, float _z) : val0(_x), val1(_y), val2(_z)
{ }
float3::float3(const float3& cpy) : val0(cpy.val0), val1(cpy.val1), val2(cpy.val2)
{ }
float3& float3::operator=(const float3& rhs)
{
this->val0 = rhs.val0;
this->val1 = rhs.val1;
this->val2 = rhs.val2;
return *this;
}
float3& float3::operator+=(const float3& rhs) { return *this = *this + rhs; }
float3& float3::operator-=(const float3& rhs) { return *this = *this - rhs; }
float3& float3::operator*=(const float& rhs) { return *this = *this * rhs; }
float3& float3::operator/=(const float& rhs) { return *this = *this / rhs; }
//Math operators
inline float3 float3::operator-() const
{
return float3(-val0, -val1, -val2);
}
inline float3 float3::operator+(const float3& rhs) const
{
return float3(this->val0 + rhs.val0, this->val1 + rhs.val1, this->val2 + rhs.val2);
}
inline float3 float3::operator-(const float3& rhs) const
{
return float3(this->val0 - rhs.val0, this->val1 - rhs.val1, this->val2 - rhs.val2);
}
inline float3 float3::operator*(const float& rhs) const
{
return float3(this->val0 * rhs, this->val1 * rhs, this->val2 * rhs);
}
//Allows float*float3 as well
float3 operator*(const float& lhs, const float3& rhs) { return rhs * lhs; }
inline float3 float3::operator/(const float& rhs) const
{
return float3(this->val0 / rhs, this->val1 / rhs, this->val2 / rhs);
}
#pragma endregion float3
#pragma region float4
//Data IO
float4::float4(float _w, float _x, float _y, float _z) : val0(_w), val1(_x), val2(_y), val3(_z)
{ }
float4::float4(const float4& cpy) : val0(cpy.val0), val1(cpy.val1), val2(cpy.val2), val3(cpy.val3)
{ }
float4& float4::operator=(const float4& rhs)
{
this->val1 = rhs.val1;
this->val2 = rhs.val2;
this->val3 = rhs.val3;
return *this;
}
float4& float4::operator+=(const float4& rhs) { return *this = *this + rhs; }
float4& float4::operator-=(const float4& rhs) { return *this = *this - rhs; }
float4& float4::operator*=(const float& rhs) { return *this = *this * rhs; }
float4& float4::operator/=(const float& rhs) { return *this = *this / rhs; }
//Math operators
inline float4 float4::operator+(const float4& rhs) const
{
return float4(this->val0+rhs.val0, this->val1+rhs.val1, this->val2+rhs.val2, this->val3+rhs.val3);
}
inline float4 float4::operator-(const float4& rhs) const
{
return float4(this->val0-rhs.val0, this->val1-rhs.val1, this->val2-rhs.val2, this->val3-rhs.val3);
}
inline float4 float4::operator*(const float& rhs) const
{
return float4(this->val0 * rhs, this->val1 * rhs, this->val2 * rhs, this->val3 * rhs);
}
//Allows float*float4 as well
float4 operator*(const float& lhs, const float4& rhs) { return rhs * lhs; }
inline float4 float4::operator/(const float& rhs) const
{
return float4(this->val0 / rhs, this->val1 / rhs, this->val2 / rhs, this->val3 / rhs);
}
#pragma endregion float4 | 28.301587 | 99 | 0.688353 | rmMinusR |
a34487532423d0ad62efb8a88d7810da5956de9b | 8,948 | cpp | C++ | cpp/src/meshmatchcommand.cpp | luckylyk/cfxnodes | e787eb1974566ffc5f92976685cc3e1f2389839a | [
"BSD-3-Clause-Clear"
] | 1 | 2020-06-27T07:11:35.000Z | 2020-06-27T07:11:35.000Z | cpp/src/meshmatchcommand.cpp | luckylyk/cfxnodes | e787eb1974566ffc5f92976685cc3e1f2389839a | [
"BSD-3-Clause-Clear"
] | null | null | null | cpp/src/meshmatchcommand.cpp | luckylyk/cfxnodes | e787eb1974566ffc5f92976685cc3e1f2389839a | [
"BSD-3-Clause-Clear"
] | null | null | null |
#include "commands.h"
#include <maya/MGlobal.h>
#include <maya/MObject.h>
#include <maya/MPlugArray.h>
#include <maya/MDGModifier.h>
#include <maya/MSyntax.h>
#include <maya/MPlug.h>
#include <maya/MSelectionList.h>
#include <maya/MDagPath.h>
#include <maya/MArgList.h>
#include <maya/MArgParser.h>
MeshMatchCommand::MeshMatchCommand() {}
MeshMatchCommand::~MeshMatchCommand() {}
void* MeshMatchCommand::creator() {return new MeshMatchCommand();}
MString MeshMatchCommand::name("meshMatch");
void checkArgsSanity(
const MArgList & argList,
MArgParser & argParser,
MString & meshMatchNodeName,
MStatus & status) {
if (argParser.numberOfFlagsUsed() > 1) {
status = MS::kInvalidParameter;
MString msg("meshMatch doesn't support multi-flag usage.");
MGlobal::displayError(msg);
return;}
if (argParser.numberOfFlagsUsed() == 0) {
MStringArray objects;
argParser.getObjects(objects);
if (objects.length() < 2) {
status = MS::kInvalidParameter;
MString msg(
"No enough objects providen.\n At least 2 geometries "
"must be selected or passed as argument when the command is "
"used without any flag or");
MGlobal::displayError(msg);
return;}}
if (argParser.isFlagSet("updateBinding") == true) {
meshMatchNodeName = argParser.flagArgumentString("updateBinding", 0);
if (argList.length() != 0){
status = MS::kInvalidParameter;
MString msg(
"meshMatch command doesn't support argument with flag "
"-updateBinding");
MGlobal::displayError(msg);
return;}}
if (argParser.isFlagSet("addGeometryDriver") == true) {
meshMatchNodeName = argParser.flagArgumentString("addGeometryDriver", 0);
if (argList.length() == 0){
status = MS::kInvalidParameter;
MString msg(
"meshMatch need at least one geometry argument with "
"flag addGeometryDriver");
MGlobal::displayError(msg);
return;}}
if (argParser.isFlagSet("removeGeometryDriver") == true) {
meshMatchNodeName = argParser.flagArgumentString("removeGeometryDriver", 0);
if (argList.length() == 0){
status = MS::kInvalidParameter;
MString msg(
"meshMatch need at least one geometry argument with flag "
"removeGeometryDriver");
MGlobal::displayError(msg);
return;}}
return;
}
MStatus toDependecyNode(
const MString & nodeName,
MObject & mobject,
MStatus status){
MSelectionList nodelist;
status = nodelist.add(nodeName);
if (status != MS::kSuccess) {
MGlobal::displayError(nodeName + " doesn't exists");}
CHECK_MSTATUS_AND_RETURN_IT(status);
MDagPath dagPath;
nodelist.getDagPath(0, dagPath);
dagPath.extendToShape();
MObject oDependNode(dagPath.node());
mobject = oDependNode;
return status;
}
MStatus isNodeType(
const MString & nodeName,
const MString & nodeType,
MStatus & status){
MObject oDependNode;
toDependecyNode(nodeName, oDependNode, status);
CHECK_MSTATUS_AND_RETURN_IT(status);
MFnDependencyNode fnDagNode(oDependNode);
if (fnDagNode.typeName() != nodeType) {
MString msg(
nodeName + " must be a " + nodeType +
" node but is " + fnDagNode.typeName());
MGlobal::displayInfo(msg);
status = MS::kInvalidParameter;}
return status;
}
void getSelectedMeshes(MStringArray & geometries, MStatus & status) {
MSelectionList sel;
MGlobal::getActiveSelectionList(sel);
MStringArray selections;
sel.getSelectionStrings(selections);
bool isMesh;
for (unsigned int i(0); i < selections.length(); ++i) {
isMesh = isNodeType(selections[i], "mesh", status);
if (isMesh == true) {
geometries.append(selections[i]);}}
return;
}
unsigned int findNextFreeLogicalIndex(
MPlug const & plugArray,
unsigned int index) {
MPlug child;
while (true) {
child = plugArray.elementByLogicalIndex(index);
if (child.isConnected() == false) {
return index;}
index += 1;}
return index;
}
void addGeometriesToMeshMatch(
const MStringArray & geometries,
const MString & meshMatchName,
MStatus & status) {
MDGModifier modifier;
MPlug dstPlug;
MPlug srcPlug;
MPlug pMeshes;
MSelectionList sel;
sel.add(meshMatchName + ".meshes");
sel.getPlug(0, pMeshes);
unsigned int plugChildIndex(0);
for (unsigned int i(0); i < geometries.length(); ++i) {
MString geometry(geometries[i]);
MObject oGeometry;
toDependecyNode(geometry, oGeometry, status);
plugChildIndex = findNextFreeLogicalIndex(pMeshes, plugChildIndex);
MFnDependencyNode fnDepNodeGeometry(oGeometry);
srcPlug = fnDepNodeGeometry.findPlug("outMesh", status);
dstPlug = pMeshes.elementByLogicalIndex(plugChildIndex);
status = modifier.connect(srcPlug, dstPlug);
plugChildIndex += 1;}
status = modifier.doIt();
return;
}
void removeGeometriesToMeshMatch(
const MStringArray & geometries,
const MString meshMatchName,
MStatus & status) {
MDGModifier modifier;
MPlug pMeshes;
MPlug dstPlug;
MPlug srcPlug;
MSelectionList sel;
sel.add(meshMatchName + ".meshes");
sel.getPlug(0, pMeshes);
for (unsigned int i(0); i < geometries.length(); ++i) {
MString geometry(geometries[i]);
MObject oGeometry;
toDependecyNode(geometry, oGeometry, status);
MFnDependencyNode fnDepNodeGeometry(oGeometry);
srcPlug = fnDepNodeGeometry.findPlug("outMesh");
for (unsigned int j(0); j < pMeshes.numElements(); ++j) {
dstPlug = pMeshes.elementByLogicalIndex(j);
MPlugArray connections;
connections.append(dstPlug);
srcPlug.connectedTo(connections, false, true);
for (unsigned int k(0); k < connections.length(); ++k) {
if (dstPlug.name() == connections[k].name()) {
modifier.disconnect(srcPlug, dstPlug);
modifier.doIt();}}}}
}
MString createMeshMatchs(const MString & target, MStatus & status) {
MString command;
command += "deformer -type meshMatch " + target;
MStringArray result;
MGlobal::executeCommand(command, result);
return result[0];
}
MStatus checksNodesTypesSanity(
const MStringArray & geometries,
MStatus & status){
for (unsigned int i(0); i < geometries.length(); ++i){
MString geometry(geometries[i]);
isNodeType(geometry, "mesh", status);
CHECK_MSTATUS_AND_RETURN_IT(status);}
return status;
}
MStatus MeshMatchCommand::doIt(const MArgList & args) {
MStatus status;
MArgParser argParser(syntax(), args, &status);
CHECK_MSTATUS_AND_RETURN_IT(status);
MString meshMatchNodeName;
checkArgsSanity(args, argParser, meshMatchNodeName, status);
CHECK_MSTATUS_AND_RETURN_IT(status);
MStringArray geometries;
argParser.getObjects(geometries);
if (geometries.length() == 0) {
getSelectedMeshes(geometries, status);
CHECK_MSTATUS_AND_RETURN_IT(status);}
checksNodesTypesSanity(geometries, status);
CHECK_MSTATUS_AND_RETURN_IT(status);
MString target(geometries[geometries.length() - 1]);
if (argParser.isFlagSet("addGeometryDriver")){
addGeometriesToMeshMatch(geometries, meshMatchNodeName, status);
CHECK_MSTATUS_AND_RETURN_IT(status);}
if (argParser.isFlagSet("removeGeometryDriver")){
removeGeometriesToMeshMatch(geometries, meshMatchNodeName, status);
CHECK_MSTATUS_AND_RETURN_IT(status);}
if (argParser.numberOfFlagsUsed() == 0) {
geometries.remove(geometries.length() - 1);
MString deformer(createMeshMatchs(target, status));
CHECK_MSTATUS_AND_RETURN_IT(status);
addGeometriesToMeshMatch(geometries, deformer, status);
CHECK_MSTATUS_AND_RETURN_IT(status);
setResult(deformer);}
// set node in update mode
MSelectionList sel;
MPlug plug;
sel.add(meshMatchNodeName + ".hasToRebuiltMatches");
sel.getPlug(0, plug);
plug.setValue(true);
return MS::kSuccess;
}
MSyntax MeshMatchCommand::createSyntax(){
MSyntax syntax;
syntax.enableQuery(false);
syntax.enableEdit(false);
syntax.setObjectType(MSyntax::kStringObjects, 0, 1024);
syntax.addFlag("-ub", "-updateBinding", MSyntax::kString);
syntax.addFlag("-add", "-addGeometryDriver", MSyntax::kString);
syntax.addFlag("-rmv", "-removeGeometryDriver", MSyntax::kString);
return syntax;
} | 31.730496 | 84 | 0.646737 | luckylyk |
a348a44569e0006e2e267cf88baebecdb96cc484 | 1,610 | cpp | C++ | src/unittests/escaped_string_test.cpp | puremourning/netcoredbg | c34eaef68abe06197d03bc8c19282707cfc1adda | [
"MIT"
] | null | null | null | src/unittests/escaped_string_test.cpp | puremourning/netcoredbg | c34eaef68abe06197d03bc8c19282707cfc1adda | [
"MIT"
] | null | null | null | src/unittests/escaped_string_test.cpp | puremourning/netcoredbg | c34eaef68abe06197d03bc8c19282707cfc1adda | [
"MIT"
] | null | null | null | // Copyright (C) 2021 Samsung Electronics Co., Ltd.
// See the LICENSE file in the project root for more information.
#include <catch2/catch.hpp>
#include <string>
#include "string_view.h"
#include "utils/escaped_string.h"
#include "compile_test.h"
using namespace netcoredbg;
using string_view = Utility::string_view;
struct EscapeRules
{
static const char forbidden_chars[];
static const char subst_chars[];
static const char constexpr escape_char = '\\';
};
const char EscapeRules::forbidden_chars[] = "\"\\\0\a\b\f\n\r\t\v";
const char EscapeRules::subst_chars[] = "\"\\0abfnrtv";
using ES = EscapedString<EscapeRules>;
TEST_CASE("EscapedString")
{
string_view s1 { "test12345" };
string_view s2 { "test\n" };
// assuming no copying
CHECK(static_cast<string_view>(ES(s1)) == s1);
const void *v1, *v2;
v1 = static_cast<string_view>(ES(s1)).data(), v2 = s1.data();
CHECK(v1 == v2);
ES es1(s1); // expecting copying
CHECK(static_cast<string_view>(es1) == s1);
v1 = static_cast<string_view>(es1).data(), v2 = s1.data();
CHECK(v1 != v2);
CHECK(static_cast<string_view>(ES("\n")) == "\\n");
CHECK(static_cast<string_view>(ES("aaa\n")) == "aaa\\n");
CHECK(static_cast<string_view>(ES("\naaa")) == "\\naaa");
CHECK(static_cast<string_view>(ES("aaa\nbbb")) == string_view("aaa\\nbbb", 8));
CHECK(static_cast<string_view>(ES(string_view("aaa\0bbb", 7))) == string_view("aaa\\0bbb", 8));
std::string result;
ES("aaa\nbbb")([&](string_view s) { result.append(s.begin(), s.end()); });
CHECK(result == "aaa\\nbbb");
}
| 30.961538 | 99 | 0.650311 | puremourning |
a34a803e86d6245e370b649a1d72d80213527f4c | 8,973 | cpp | C++ | MMOCoreORB/src/server/zone/managers/skill/SkillModManager.cpp | V-Fib/FlurryClone | 40e0ca7245ec31b3815eb6459329fd9e70f88936 | [
"Zlib",
"OpenSSL"
] | 18 | 2017-02-09T15:36:05.000Z | 2021-12-21T04:22:15.000Z | MMOCoreORB/src/server/zone/managers/skill/SkillModManager.cpp | V-Fib/FlurryClone | 40e0ca7245ec31b3815eb6459329fd9e70f88936 | [
"Zlib",
"OpenSSL"
] | 61 | 2016-12-30T21:51:10.000Z | 2021-12-10T20:25:56.000Z | MMOCoreORB/src/server/zone/managers/skill/SkillModManager.cpp | V-Fib/FlurryClone | 40e0ca7245ec31b3815eb6459329fd9e70f88936 | [
"Zlib",
"OpenSSL"
] | 71 | 2017-01-01T05:34:38.000Z | 2022-03-29T01:04:00.000Z | /*
Copyright <SWGEmu>
See file COPYING for copying conditions.
*/
#include "SkillModManager.h"
#include "server/zone/objects/creature/CreatureObject.h"
#include "server/zone/objects/player/PlayerObject.h"
#include "server/zone/objects/tangible/TangibleObject.h"
#include "server/zone/objects/tangible/weapon/WeaponObject.h"
#include "server/zone/objects/tangible/wearables/WearableObject.h"
#include "server/zone/objects/tangible/wearables/WearableContainerObject.h"
#include "server/zone/objects/structure/StructureObject.h"
#include "server/zone/objects/area/CampSiteActiveArea.h"
SkillModManager::SkillModManager()
: Logger("SkillModManager") {
skillModMin.setNullValue(0);
skillModMax.setNullValue(0);
disabledWearableSkillMods.setNoDuplicateInsertPlan();
init();
}
SkillModManager::~SkillModManager() {
}
void SkillModManager::init() {
Lua* lua = new Lua();
lua->init();
if (!lua->runFile("scripts/managers/skill_mod_manager.lua")) {
error("Cannot read configuration, using default");
setDefaults();
delete lua;
lua = nullptr;
return;
}
LuaObject skillLimits = lua->getGlobalObject("skillModLimits");
if (!skillLimits.isValidTable()) {
error("Invalid configuration");
setDefaults();
} else {
for(int i = 1; i <= skillLimits.getTableSize(); ++i) {
LuaObject entry = skillLimits.getObjectAt(i);
uint32 type = entry.getIntAt(1);
int min = entry.getIntAt(2);
int max = entry.getIntAt(3);
skillModMin.put(type, min);
skillModMax.put(type, max);
entry.pop();
}
skillLimits.pop();
}
LuaObject disabledMods = lua->getGlobalObject("disabledWearableSkillMods");
if (disabledMods.isValidTable()) {
for(int i = 1; i <= disabledMods.getTableSize(); ++i) {
String mod = disabledMods.getStringAt(i);
disabledWearableSkillMods.put(mod);
}
disabledMods.pop();
}
delete lua;
lua = nullptr;
return;
}
void SkillModManager::setDefaults() {
skillModMin.put(WEARABLE, -25);
skillModMax.put(WEARABLE, 25);
skillModMin.put(ABILITYBONUS, -125);
skillModMax.put(ABILITYBONUS, 125);
skillModMin.put(STRUCTURE, -125);
skillModMax.put(STRUCTURE, 125);
skillModMin.put(BUFF, -125);
skillModMax.put(BUFF, 125);
skillModMin.put(DROID, -110);
skillModMax.put(DROID, 110);
}
void SkillModManager::verifyWearableSkillMods(CreatureObject* creature) {
Locker locker(creature);
VectorMap<String, int> mods;
mods.setAllowOverwriteInsertPlan();
mods.setNullValue(0);
SortedVector<ManagedReference<SceneObject*> > usedObjects;
usedObjects.setNoDuplicateInsertPlan();
for(int i = 0; i < creature->getSlottedObjectsSize(); ++i) {
ManagedReference<TangibleObject*> object = creature->getSlottedObject(i).castTo<TangibleObject*>();
if(object == nullptr || usedObjects.contains(object.get()))
continue;
if(object->isWearableObject()) {
WearableObject* wearable = cast<WearableObject*>(object.get());
if(wearable != nullptr) {
const VectorMap<String, int>* wearableSkillMods = wearable->getWearableSkillMods();
for (int j = 0; j < wearableSkillMods->size(); ++j) {
String name = wearableSkillMods->elementAt(j).getKey();
if (isWearableModDisabled(name))
continue;
int value = wearableSkillMods->get(name);
if(mods.contains(name)) {
value += mods.get(name);
}
mods.put(name, value);
}
}
} else if (object->isWearableContainerObject()) {
WearableContainerObject* wearable = cast<WearableContainerObject*>(object.get());
if(wearable != nullptr) {
const VectorMap<String, int>* wearableSkillMods = wearable->getWearableSkillMods();
for (int j = 0; j < wearableSkillMods->size(); ++j) {
String name = wearableSkillMods->elementAt(j).getKey();
if (isWearableModDisabled(name))
continue;
int value = wearableSkillMods->get(name);
if(mods.contains(name)) {
value += mods.get(name);
}
mods.put(name, value);
}
}
} else if (object->isWeaponObject()) {
WeaponObject* weapon = cast<WeaponObject*>(object.get());
if(weapon != nullptr) {
const VectorMap<String, int>* wearableSkillMods = weapon->getWearableSkillMods();
for (int j = 0; j < wearableSkillMods->size(); ++j) {
String name = wearableSkillMods->elementAt(j).getKey();
if (isWearableModDisabled(name))
continue;
int value = wearableSkillMods->get(name);
if(mods.contains(name)) {
value += mods.get(name);
}
mods.put(name, value);
}
}
}
usedObjects.put(object.get());
}
if(!compareMods(mods, creature, WEARABLE)) {
warning("Wearable mods don't match for " + creature->getFirstName());
}
}
void SkillModManager::verifyStructureSkillMods(TangibleObject* tano) {
if (!tano->isCreatureObject())
return;
CreatureObject* creature = cast<CreatureObject*>(tano);
if (creature == nullptr)
return;
//Locker locker(creature);
VectorMap<String, int> mods;
mods.setAllowOverwriteInsertPlan();
mods.setNullValue(0);
ManagedReference<SceneObject*> parent = creature->getRootParent();
if (parent == nullptr) {
if (creature->getCurrentCamp() != nullptr) {
ManagedReference<CampSiteActiveArea*> campArea = creature->getCurrentCamp();
parent = campArea->getCamp();
}
}
if (parent != nullptr && parent->isStructureObject()) {
StructureObject* structure = parent.castTo<StructureObject*>();
const auto templateMods = structure->getTemplateSkillMods();
for (int i = 0; i < templateMods->size(); ++i) {
String name = templateMods->elementAt(i).getKey();
int value = templateMods->get(name);
if(mods.contains(name)) {
value += mods.get(name);
}
mods.put(name, value);
}
}
if (!compareMods(mods, creature, STRUCTURE)) {
warning("Structure mods don't match for " + creature->getFirstName());
}
}
void SkillModManager::verifySkillBoxSkillMods(CreatureObject* creature) {
Locker locker(creature);
VectorMap<String, int> mods;
mods.setAllowOverwriteInsertPlan();
mods.setNullValue(0);
const SkillList* skillList = creature->getSkillList();
for(int i = 0; i < skillList->size(); ++i) {
Reference<Skill*> skill = skillList->get(i);
auto skillMods = skill->getSkillModifiers();
for(int j = 0; j < skillMods->size(); ++j) {
const String& name = skillMods->elementAt(j).getKey();
int value = skillMods->get(name);
if(mods.contains(name)) {
value += mods.get(name);
}
mods.put(name, value);
}
}
if(!compareMods(mods, creature, SKILLBOX)) {
warning("SkillBox mods don't match for " + creature->getFirstName());
}
}
void SkillModManager::verifyBuffSkillMods(CreatureObject* creature) {
Locker locker(creature);
VectorMap<String, int> mods;
mods.setAllowOverwriteInsertPlan();
mods.setNullValue(0);
const BuffList* buffList = creature->getBuffList();
for(int i = 0; i < buffList->getBuffListSize(); ++i) {
ManagedReference<Buff*> buff = buffList->getBuffByIndex(i);
VectorMap<String, int>* skillMods = buff->getSkillModifiers();
for(int j = 0; j < skillMods->size(); ++j) {
String name = skillMods->elementAt(j).getKey();
int value = skillMods->get(name);
if(mods.contains(name)) {
value += mods.get(name);
}
mods.put(name, value);
}
}
if(!compareMods(mods, creature, BUFF)) {
warning("Buff mods don't match for " + creature->getFirstName());
}
}
bool SkillModManager::compareMods(VectorMap<String, int>& mods, CreatureObject* creature, uint32 type) {
mods.setAllowOverwriteInsertPlan();
mods.setNullValue(0);
auto skillModMutex = creature->getSkillModMutex();
Locker skillModLocker(skillModMutex);
SkillModList* skillModList = creature->getSkillModList();
if (skillModList == nullptr) {
error("nullptr SkillmodList for " + creature->getFirstName());
return false;
}
const SkillModGroup* group = skillModList->getSkillModGroup(type);
if(group == nullptr){
error("nullptr SkillModGroup for " + creature->getFirstName());
return false;
}
bool match = true;
StringBuffer compare;
compare << endl << " " << "SkillMod" << " " << "Player" << " " << "Computed" << endl;
for(int i = 0; i < group->size(); ++i) {
String key = group->elementAt(i).getKey();
int value = group->get(key);
int currentValue = mods.get(key);
mods.drop(key);
compare << " " << key << " " << value << " " << currentValue << endl;
if (value != currentValue) {
creature->removeSkillMod(type, key, value, true);
creature->addSkillMod(type, key, currentValue, true);
match = false;
}
}
if (!mods.isEmpty()) {
match = false;
for (int i = 0; i < mods.size(); i++) {
String key = mods.elementAt(i).getKey();
int currentValue = mods.get(key);
compare << " " << key << " " << "none" << " " << currentValue << endl;
}
}
if (match == false) {
warning(compare.toString());
if(creature->getPlayerObject() != nullptr) {
if(creature->getPlayerObject()->getDebug()) {
creature->sendSystemMessage(compare.toString());
}
}
}
return match;
}
| 25.205056 | 104 | 0.680597 | V-Fib |
a34ad4f998d847b5be3c0fdda2930bf8d4540af6 | 134 | hxx | C++ | src/Providers/UNIXProviders/AGPVideoController/UNIX_AGPVideoController_FREEBSD.hxx | brunolauze/openpegasus-providers-old | b00f1aad575bae144b8538bf57ba5fd5582a4ec7 | [
"MIT"
] | 1 | 2020-10-12T09:00:09.000Z | 2020-10-12T09:00:09.000Z | src/Providers/UNIXProviders/AGPVideoController/UNIX_AGPVideoController_FREEBSD.hxx | brunolauze/openpegasus-providers-old | b00f1aad575bae144b8538bf57ba5fd5582a4ec7 | [
"MIT"
] | null | null | null | src/Providers/UNIXProviders/AGPVideoController/UNIX_AGPVideoController_FREEBSD.hxx | brunolauze/openpegasus-providers-old | b00f1aad575bae144b8538bf57ba5fd5582a4ec7 | [
"MIT"
] | null | null | null | #ifdef PEGASUS_OS_FREEBSD
#ifndef __UNIX_AGPVIDEOCONTROLLER_PRIVATE_H
#define __UNIX_AGPVIDEOCONTROLLER_PRIVATE_H
#endif
#endif
| 11.166667 | 43 | 0.858209 | brunolauze |
a34af2f1abb7ca39ebc7fb496cfc11f7d64d6422 | 17,043 | cpp | C++ | src/twins.cpp | sequencing/gvcftools | 7e854392c94c63410a846d29a97b95a6f1435576 | [
"BSL-1.0"
] | 26 | 2015-11-30T18:53:11.000Z | 2021-11-12T07:48:37.000Z | src/twins.cpp | sequencing/gvcftools | 7e854392c94c63410a846d29a97b95a6f1435576 | [
"BSL-1.0"
] | 5 | 2015-08-06T18:32:55.000Z | 2020-03-08T18:13:22.000Z | src/twins.cpp | ctsa/gvcftools | 7e854392c94c63410a846d29a97b95a6f1435576 | [
"BSL-1.0"
] | 8 | 2015-07-20T09:53:07.000Z | 2018-06-10T09:55:31.000Z | // -*- mode: c++; indent-tabs-mode: nil; -*-
//
// Copyright (c) 2009-2012 Illumina, Inc.
//
// 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.
//
//
/// \file
///
/// \author Chris Saunders
///
#include "gvcftools.hh"
#include "related_sample_util.hh"
#include "ref_util.hh"
#include "tabix_util.hh"
#include "trio_option_util.hh"
#include "boost/program_options.hpp"
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
std::ostream& log_os(std::cerr);
std::ostream& report_os(std::cout);
std::string cmdline;
enum sample_t {
TWIN1,
TWIN2,
SAMPLE_SIZE
};
const char* sample_label[] = { "twin1","twin2" };
enum state_t {
SAMEHOM,
DIFFHOM,
SAMEHET,
DIFFHET,
HOMHET,
STATE_SIZE
};
const char* state_label[] = { "samehom" , "diffhom" , "samehet" , "diffhet" , "homhet" };
static
state_t
get_st_cat(const bool ist1hom,
const bool ist2hom,
const char t1_1,
const char t2_1,
const char t1_2,
const char t2_2) {
if (ist1hom!=ist2hom) return HOMHET;
if (ist1hom) {
return (t1_1==t2_1 ? SAMEHOM : DIFFHOM);
} else {
return ((t1_1==t2_1) && (t1_2==t2_2) ? SAMEHET : DIFFHET);
}
}
struct site_stats : public site_stats_core<SAMPLE_SIZE> {
site_stats() {
for (unsigned i(0); i<STATE_SIZE; ++i) {
snp_correct_type[i]=0;
incorrect_type[i]=0;
}
}
unsigned snp_correct_type[STATE_SIZE];
unsigned incorrect_type[STATE_SIZE];
};
static
void
processSite(const site_crawler* sa,
const pos_t low_pos,
const reference_contig_segment& ref_seg,
pos_reporter& pr,
site_stats& ss) {
bool is_all_mapped(true);
bool is_any_mapped(false);
bool is_all_called(true);
bool is_any_called(false);
const char ref_base(ref_seg.get_base(low_pos-1));
if (ref_base=='N') return;
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
if (sa[st].is_pos_valid() && (sa[st].pos()==low_pos) && (sa[st].n_total() != 0)) {
ss.sample_mapped[st]++;
is_any_mapped=true;
} else {
is_all_mapped=false;
}
if (sa[st].is_pos_valid() && (sa[st].pos()==low_pos) && sa[st].is_site_call()) {
ss.sample_called[st]++;
if (! ((ref_base==sa[st].get_allele(0)) && (ref_base==sa[st].get_allele(1)))) {
ss.sample_snp[st]++;
if (sa[st].get_allele(0) != sa[st].get_allele(1)) {
ss.sample_snp_het[st]++;
}
}
is_any_called=true;
} else {
is_all_called=false;
}
}
if (! is_all_mapped) {
if (is_any_mapped) ss.some_mapped++;
} else {
ss.all_mapped++;
}
if (! is_all_called) {
if (is_any_called) ss.some_called++;
return;
} else {
ss.all_called++;
}
const char t1_1(sa[TWIN1].get_allele(0));
const char t1_2(sa[TWIN1].get_allele(1));
const char t2_1(sa[TWIN2].get_allele(0));
const char t2_2(sa[TWIN2].get_allele(1));
const bool is_correct(((t1_1==t2_1) && (t1_2==t2_2)) ||
((t1_2==t2_1) && (t1_1==t2_2)));
const bool ist1hom(t1_1==t1_2);
const bool ist2hom(t2_1==t2_2);
if (is_correct) {
const bool is_ref_call(ist1hom && ist2hom && (t1_1==ref_base));
if (! is_ref_call) {
const state_t st(get_st_cat(ist1hom,ist2hom,t1_1,t2_1,t1_2,t2_2));
ss.snp_correct++;
ss.snp_correct_type[st]++;
if (! ist1hom) ss.sample_snp_correct_het[TWIN1]++;
else if (t1_1!=ref_base) ss.sample_snp_correct_hom[TWIN1]++;
if (! ist2hom) ss.sample_snp_correct_het[TWIN2]++;
else if (t2_1!=ref_base) ss.sample_snp_correct_hom[TWIN2]++;
}
} else {
pr.print_pos(sa);
const state_t st(get_st_cat(ist1hom,ist2hom,t1_1,t2_1,t1_2,t2_2));
ss.incorrect++;
ss.incorrect_type[st]++;
}
}
static
void
report(const site_stats& ss,
const time_t& start_time,
const bool is_variable_metadata) {
std::ostream& os(report_os);
os << "CMDLINE " << cmdline << "\n";
if (is_variable_metadata) {
os << "START_TIME " << asctime(localtime(&start_time));
os << "VERSION " << gvcftools_version() << "\n";
}
os << "\n";
os << "sites: " << ss.ref_size << "\n";
os << "known_sites: " << ss.known_size << "\n";
os << "\n";
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
os << "sites_mapped_" << sample_label[st] << ": " << ss.sample_mapped[st] << "\n";
}
assert(ss.known_size >= (ss.some_mapped+ss.all_mapped));
const unsigned none_mapped(ss.known_size-(ss.some_mapped+ss.all_mapped));
os << "sites_mapped_in_no_samples: " << none_mapped << "\n";
os << "sites_mapped_in_some_samples: " << ss.some_mapped << "\n";
os << "sites_mapped_in_all_samples: " << ss.all_mapped << "\n";
os << "\n";
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
os << "sites_called_" << sample_label[st] << ": " << ss.sample_called[st] << "\n";
}
assert(ss.known_size >= (ss.some_called+ss.all_called));
const unsigned none_called(ss.known_size-(ss.some_called+ss.all_called));
os << "sites_called_in_no_samples: " << none_called << "\n";
os << "sites_called_in_some_samples: " << ss.some_called << "\n";
os << "sites_called_in_all_samples: " << ss.all_called << "\n";
os << "sites_called_in_all_samples_conflict: " << ss.incorrect << "\n";
os << "fraction_of_known_sites_called_in_all_samples: " << ratio(ss.all_called,ss.known_size) << "\n";
os << "fraction_of_sites_called_in_all_samples_in_conflict: " << ratio(ss.incorrect,ss.all_called) << "\n";
os << "\n";
const unsigned snps(ss.snp_correct+ss.incorrect);
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
const unsigned het(ss.sample_snp_het[st]);
const unsigned hom(ss.sample_snp[st]-ss.sample_snp_het[st]);
const double sample_het_hom(ratio(het,hom));
const double sample_phet(ratio(het,(hom+het)));
os << "sites_with_snps_called_total_het_hom_het/hom_P(het)_" << sample_label[st] << ": " << ss.sample_snp[st] << " " << het << " " << hom << " " << sample_het_hom << " " << sample_phet << "\n";
}
os << "sites_called_in_all_samples_with_snps_called_any_sample: " << snps << "\n";
os << "fraction_of_snp_sites_in_conflict: " << ratio(ss.incorrect,snps) << "\n";
os << "\n";
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
const unsigned het(ss.sample_snp_correct_het[st]);
const unsigned hom(ss.sample_snp_correct_hom[st]);
const double sample_het_hom(ratio(het,hom));
const double sample_phet(ratio(het,(hom+het)));
os << "snp_non_conflict_total_het_hom_het/hom_P(het)_" << sample_label[st] << ": " << (het+hom) << " " << het << " " << hom << " " << sample_het_hom << " " << sample_phet << "\n";
}
os << "\n";
for (unsigned i(0); i<STATE_SIZE; ++i) {
os << "snp_conflict_type_" << state_label[i] << ": "
<< ss.incorrect_type[i] << "\n";
}
os << "\n";
for (unsigned i(0); i<STATE_SIZE; ++i) {
os << "snp_non_conflict_type_" << state_label[i] << ": "
<< ss.snp_correct_type[i] << "\n";
}
os << "\n";
}
static
void
accumulate_region_statistics(const sample_info* const si,
const shared_crawler_options& opt,
const std::string& ref_seq_file,
const char* region,
pos_reporter& pr,
site_stats& ss) {
// setup reference sequence:
reference_contig_segment ref_seg;
unsigned segment_known_size;
get_samtools_std_ref_segment(ref_seq_file.c_str(),region,ref_seg,segment_known_size);
if (opt.is_region()) {
ref_seg.set_offset(opt.region_begin-1);
}
ss.ref_size += ref_seg.seq().size();
ss.known_size += segment_known_size;
// setup allele crawlers:
site_crawler sa[SAMPLE_SIZE] = { site_crawler(si[TWIN1],TWIN1,opt,region,ref_seg),
site_crawler(si[TWIN2],TWIN2,opt,region,ref_seg)
};
while (true) {
// get lowest position:
bool is_low_pos_set(false);
pos_t low_pos(0);
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
if (! sa[st].is_pos_valid()) continue;
if ((! is_low_pos_set) || (sa[st].pos() < low_pos)) {
low_pos = sa[st].pos();
is_low_pos_set=true;
}
}
if (! is_low_pos_set) break;
processSite(sa,low_pos,ref_seg,pr,ss);
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
if (sa[st].is_pos_valid() && (low_pos == sa[st].pos())) {
sa[st].update();
}
}
}
}
static
void
try_main(int argc,char* argv[]) {
const time_t start_time(time(0));
const char* progname(compat_basename(argv[0]));
for (int i(0); i<argc; ++i) {
if (i) cmdline += ' ';
cmdline += argv[i];
}
std::string conflict_pos_file;
std::string ref_seq_file;
shared_crawler_options opt;
std::vector<std::string> exclude_list;
sample_info si[SAMPLE_SIZE];
snp_param& sp(opt.sp());
std::vector<info_filter> max_info_filters;
namespace po = boost::program_options;
po::options_description req("configuration");
req.add_options()
("ref", po::value(&ref_seq_file),"samtools reference sequence (required)")
("region", po::value(&opt.region), "samtools reference region (optional)")
("exclude", po::value<std::vector<std::string> >(&exclude_list), "name of chromosome to skip over (argument may be specified multiple times). Exclusions will be ignored if a region argument is provided")
("twin1", po::value(&si[TWIN1].file),
"twin/replicate 1 gvcf file")
("twin2", po::value(&si[TWIN2].file),
"twin/replicate 2 gvcf file")
("conflict-file", po::value(&conflict_pos_file), "Write all conflict positions to the specified file")
("no-variable-metadata",
"Remove timestamp and any other metadata from output during validation testing")
("murdock", po::value(&opt.is_murdock_mode)->zero_tokens(),
"If true, don't stop because of any out-of-order position conflicts. Any out of order positions are ignored. In case of an overlap the first observation is used and subsequent repeats are ignored.");
po::options_description filter("filtration");
filter.add_options()
("min-gqx", po::value(&sp.min_gqx), "If GQX value for a record is below this value, then don't use the locus. Note that if the filter field already contains a GQX filter, this will not 'rescue' filtered variants when min-gqx is set very low -- this filter can only lower callability on a file. Any records missing the GQX field will not be filtered out. (default: 0)")
("min-pos-rank-sum", po::value(&sp.min_pos_rank_sum), "Filter site if the INFO field contains the key BaseQRankSum and the value is less than the minimum. (default: no-filter)")
("min-qd", po::value(&sp.min_qd), "Filter site if the INFO field contains the key QD and the value is less than the minimum. (default: no-filter)")
("min-info-field",po::value<std::vector<info_filter> >(&sp.infof)->multitoken(),
"Filter records which contain an INFO key equal to argument1, and a corresponding value less than argument2 ")
("max-info-field",po::value<std::vector<info_filter> >(&max_info_filters)->multitoken(),
"Filter records which contain an INFO key equal to argument1, and a corresponding value greater than argument2 ");
po::options_description help("help");
help.add_options()
("help,h","print this message");
po::options_description visible("options");
visible.add(req).add(filter).add(help);
bool po_parse_fail(false);
po::variables_map vm;
try {
po::store(po::parse_command_line(argc, argv, visible,
po::command_line_style::unix_style ^ po::command_line_style::allow_short), vm);
po::notify(vm);
} catch (const boost::program_options::error& e) { // todo:: find out what is the more specific exception class thrown by program options
log_os << "ERROR: Exception thrown by option parser: " << e.what() << "\n";
po_parse_fail=true;
}
if ((argc<=1) || (vm.count("help")) || ref_seq_file.empty() || po_parse_fail) {
log_os << "\n" << progname << " finds conflicts in the variant calls made from twins or technical replicates.\n\n";
log_os << "version: " << gvcftools_version() << "\n\n";
log_os << "usage: " << progname << " [options] > twins_report\n\n";
log_os << visible << "\n";
log_os << "Note that calls inside of deletions will not be used\n";
exit(EXIT_FAILURE);
}
// clean up filters:
{
for (unsigned i(0); i<max_info_filters.size(); ++i) {
max_info_filters[i].is_min=false;
sp.infof.push_back(max_info_filters[i]);
}
}
const bool is_variable_metadata(! vm.count("no-variable-metadata"));
sp.is_min_qd=(vm.count("min-qd"));
sp.is_min_pos_rank_sum=(vm.count("min-pos-rank-sum"));
#if 0
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
log_os << sample_label[st] << "_files:\n";
const unsigned st_size(si[st].allele_files.size());
for (unsigned i(0); i<st_size; ++i) {
log_os << si[st].allele_files[i] << "\n";
}
}
#endif
for (unsigned st(0); st<SAMPLE_SIZE; ++st) {
if (si[st].file.empty()) {
log_os << "ERROR: no gvcf file specified for sample: '" << sample_label[st] << "'\n";
exit(EXIT_FAILURE);
}
}
if (opt.is_region()) {
parse_tabix_region(si[TWIN1].file.c_str(),opt.region.c_str(),opt.region_begin,opt.region_end);
opt.region_begin+=1;
}
std::vector<std::string> slabel(sample_label,sample_label+SAMPLE_SIZE);
pos_reporter pr(conflict_pos_file,slabel);
site_stats ss;
if (opt.is_region()) {
accumulate_region_statistics(si,opt,ref_seq_file,opt.region.c_str(),pr,ss);
} else {
fasta_chrom_list fcl(ref_seq_file.c_str());
while (true) {
const char* chrom = fcl.next();
if (NULL == chrom) break;
// don't even bother making this efficient:
bool is_skip(false);
for (unsigned i(0); i<exclude_list.size(); ++i) {
if (strcmp(chrom,exclude_list[i].c_str())==0) {
is_skip=true;
break;
}
}
if (is_skip) {
log_os << "skipping chromosome: '" << chrom << "'\n";
} else {
log_os << "processing chromosome: '" << chrom << "'\n";
accumulate_region_statistics(si,opt,ref_seq_file,chrom,pr,ss);
}
}
}
report(ss,start_time,is_variable_metadata);
}
static
void
dump_cl(int argc,
char* argv[],
std::ostream& os) {
os << "cmdline:";
for (int i(0); i<argc; ++i) {
os << ' ' << argv[i];
}
os << std::endl;
}
int
main(int argc,char* argv[]) {
std::ios_base::sync_with_stdio(false);
// last chance to catch exceptions...
//
try {
try_main(argc,argv);
} catch (const std::exception& e) {
log_os << "FATAL:: EXCEPTION: " << e.what() << "\n"
<< "...caught in main()\n";
dump_cl(argc,argv,log_os);
exit(EXIT_FAILURE);
} catch (...) {
log_os << "FATAL:: UNKNOWN EXCEPTION\n"
<< "...caught in main()\n";
dump_cl(argc,argv,log_os);
exit(EXIT_FAILURE);
}
return EXIT_SUCCESS;
}
| 33.748515 | 372 | 0.598251 | sequencing |
a34b3aa8443cd09ba2da708b397080b3aa05e070 | 16,042 | cpp | C++ | components/homme/src/preqx_kokkos/cxx/cxx_f90_interface_preqx.cpp | oksanaguba/E3SM | 3523b2bd017db92dcc84c4df29fa2b2c3473d3a9 | [
"BSD-3-Clause"
] | null | null | null | components/homme/src/preqx_kokkos/cxx/cxx_f90_interface_preqx.cpp | oksanaguba/E3SM | 3523b2bd017db92dcc84c4df29fa2b2c3473d3a9 | [
"BSD-3-Clause"
] | 11 | 2021-06-04T22:56:10.000Z | 2022-03-29T14:23:55.000Z | components/homme/src/preqx_kokkos/cxx/cxx_f90_interface_preqx.cpp | oksanaguba/E3SM | 3523b2bd017db92dcc84c4df29fa2b2c3473d3a9 | [
"BSD-3-Clause"
] | null | null | null | /********************************************************************************
* HOMMEXX 1.0: Copyright of Sandia Corporation
* This software is released under the BSD license
* See the file 'COPYRIGHT' in the HOMMEXX/src/share/cxx directory
*******************************************************************************/
#include "CaarFunctor.hpp"
#include "Context.hpp"
#include "Diagnostics.hpp"
#include "Elements.hpp"
#include "ErrorDefs.hpp"
#include "EulerStepFunctor.hpp"
#include "FunctorsBuffersManager.hpp"
#include "HommexxEnums.hpp"
#include "HybridVCoord.hpp"
#include "HyperviscosityFunctor.hpp"
#include "ReferenceElement.hpp"
#include "SimulationParams.hpp"
#include "SphereOperators.hpp"
#include "TimeLevel.hpp"
#include "Tracers.hpp"
#include "VerticalRemapManager.hpp"
#include "mpi/BoundaryExchange.hpp"
#include "mpi/MpiBuffersManager.hpp"
#include "utilities/SyncUtils.hpp"
#include "profiling.hpp"
namespace Homme
{
extern "C"
{
void init_simulation_params_c (const int& remap_alg, const int& limiter_option, const int& rsplit, const int& qsplit,
const int& time_step_type, const int& qsize, const int& state_frequency,
const Real& nu, const Real& nu_p, const Real& nu_q, const Real& nu_s, const Real& nu_div, const Real& nu_top,
const int& hypervis_order, const int& hypervis_subcycle, const double& hypervis_scaling,
const int& ftype, const bool& prescribed_wind, const bool& moisture, const bool& disable_diagnostics,
const bool& use_cpstar, const int& transport_alg,
const int& dt_remap_factor, const int& dt_tracer_factor,
const double& rearth)
{
// Check that the simulation options are supported. This helps us in the future, since we
// are currently 'assuming' some option have/not have certain values. As we support for more
// options in the C++ build, we will remove some checks
Errors::check_option("init_simulation_params_c","vert_remap_q_alg",remap_alg,{1,3});
Errors::check_option("init_simulation_params_c","prescribed_wind",prescribed_wind,{false});
Errors::check_option("init_simulation_params_c","hypervis_order",hypervis_order,{2});
Errors::check_option("init_simulation_params_c","transport_alg",transport_alg,{0});
Errors::check_option("init_simulation_params_c","time_step_type",time_step_type,{5});
Errors::check_option("init_simulation_params_c","qsize",qsize,0,Errors::ComparisonOp::GE);
Errors::check_option("init_simulation_params_c","qsize",qsize,QSIZE_D,Errors::ComparisonOp::LE);
Errors::check_option("init_simulation_params_c","limiter_option",limiter_option,{8,9});
Errors::check_option("init_simulation_params_c","ftype",ftype, {-1, 0, 2});
Errors::check_option("init_simulation_params_c","nu_p",nu_p,0.0,Errors::ComparisonOp::GT);
Errors::check_option("init_simulation_params_c","nu",nu,0.0,Errors::ComparisonOp::GT);
Errors::check_option("init_simulation_params_c","nu_div",nu_div,0.0,Errors::ComparisonOp::GT);
// Get the simulation params struct
SimulationParams& params = Context::singleton().create<SimulationParams>();
if (remap_alg==1) {
params.remap_alg = RemapAlg::PPM_MIRRORED;
}
if (time_step_type==5) {
params.time_step_type = TimeStepType::ttype5;
}
params.limiter_option = limiter_option;
params.rsplit = rsplit;
params.qsplit = qsplit;
params.dt_remap_factor = dt_remap_factor;
params.dt_tracer_factor = dt_tracer_factor;
params.prescribed_wind = prescribed_wind;
params.state_frequency = state_frequency;
params.qsize = qsize;
params.nu = nu;
params.nu_p = nu_p;
params.nu_q = nu_q;
params.nu_s = nu_s;
params.nu_div = nu_div;
params.nu_top = nu_top;
params.hypervis_order = hypervis_order;
params.hypervis_subcycle = hypervis_subcycle;
params.hypervis_scaling = hypervis_scaling;
params.disable_diagnostics = disable_diagnostics;
params.moisture = (moisture ? MoistDry::MOIST : MoistDry::DRY);
params.use_cpstar = use_cpstar;
params.transport_alg = transport_alg;
params.rearth = rearth;
//set nu_ratios values
if (params.nu != params.nu_div) {
Real ratio = params.nu_div / params.nu;
if (params.hypervis_scaling != 0.0) {
params.nu_ratio1 = ratio * ratio;
params.nu_ratio2 = 1.0;
}else{
params.nu_ratio1 = ratio;
params.nu_ratio2 = ratio;
}
}else{
params.nu_ratio1 = 1.0;
params.nu_ratio2 = 1.0;
}
if (ftype == -1) {
params.ftype = ForcingAlg::FORCING_OFF;
} else if (ftype == 0) {
params.ftype = ForcingAlg::FORCING_DEBUG;
} else if (ftype == 2) {
params.ftype = ForcingAlg::FORCING_2;
}
// TODO Parse a fortran string and set this properly. For now, our code does
// not depend on this except to throw an error in apply_test_forcing.
params.test_case = TestCase::JW_BAROCLINIC;
// Now this structure can be used safely
params.params_set = true;
}
void init_hvcoord_c (const Real& ps0, CRCPtr& hybrid_am_ptr, CRCPtr& hybrid_ai_ptr,
CRCPtr& hybrid_bm_ptr, CRCPtr& hybrid_bi_ptr)
{
HybridVCoord& hvcoord = Context::singleton().create<HybridVCoord>();
hvcoord.init(ps0,hybrid_am_ptr,hybrid_ai_ptr,hybrid_bm_ptr,hybrid_bi_ptr);
}
void cxx_push_results_to_f90(F90Ptr &elem_state_v_ptr, F90Ptr &elem_state_temp_ptr,
F90Ptr &elem_state_dp3d_ptr, F90Ptr &elem_state_Qdp_ptr,
F90Ptr &elem_Q_ptr, F90Ptr &elem_state_ps_v_ptr,
F90Ptr &elem_derived_omega_p_ptr) {
Elements &elements = Context::singleton().get<Elements>();
elements.m_state.push_to_f90_pointers(elem_state_v_ptr, elem_state_temp_ptr, elem_state_dp3d_ptr);
Tracers &tracers = Context::singleton().get<Tracers>();
tracers.push_qdp(elem_state_Qdp_ptr);
// F90 ptrs to arrays (np,np,num_time_levels,nelemd) can be stuffed directly
// in an unmanaged view
// with scalar Real*[NUM_TIME_LEVELS][NP][NP] (with runtime dimension nelemd)
HostViewUnmanaged<Real * [NUM_TIME_LEVELS][NP][NP]> ps_v_f90(
elem_state_ps_v_ptr, elements.num_elems());
auto ps_v_host = Kokkos::create_mirror_view(elements.m_state.m_ps_v);
Kokkos::deep_copy(ps_v_host, elements.m_state.m_ps_v);
Kokkos::deep_copy(ps_v_f90, ps_v_host);
sync_to_host(elements.m_derived.m_omega_p,
HostViewUnmanaged<Real * [NUM_PHYSICAL_LEV][NP][NP]>(
elem_derived_omega_p_ptr, elements.num_elems()));
sync_to_host(tracers.Q,
HostViewUnmanaged<Real * [QSIZE_D][NUM_PHYSICAL_LEV][NP][NP]>(
elem_Q_ptr, elements.num_elems()));
}
// Probably not needed
void cxx_push_forcing_to_f90(F90Ptr elem_derived_FM, F90Ptr elem_derived_FT,
F90Ptr elem_derived_FQ) {
Elements &elements = Context::singleton().get<Elements>();
Tracers &tracers = Context::singleton().get<Tracers>();
HostViewUnmanaged<Real * [NUM_PHYSICAL_LEV][2][NP][NP]> fm_f90(
elem_derived_FM, elements.num_elems());
sync_to_host<2>(elements.m_forcing.m_fm, fm_f90);
HostViewUnmanaged<Real * [NUM_PHYSICAL_LEV][NP][NP]> ft_f90(
elem_derived_FT, elements.num_elems());
sync_to_host(elements.m_forcing.m_ft, ft_f90);
const SimulationParams ¶ms = Context::singleton().get<SimulationParams>();
if (params.ftype == ForcingAlg::FORCING_DEBUG) {
if (tracers.fq.data() == nullptr) {
tracers.fq = decltype(tracers.fq)("fq", elements.num_elems());
}
HostViewUnmanaged<Real * [QSIZE_D][NUM_PHYSICAL_LEV][NP][NP]> fq_f90(
elem_derived_FQ, elements.num_elems());
sync_to_host(tracers.fq, fq_f90);
}
}
void f90_push_forcing_to_cxx(F90Ptr elem_derived_FM, F90Ptr elem_derived_FT,
F90Ptr elem_derived_FQ,
F90Ptr elem_state_Qdp_ptr) {
Elements &elements = Context::singleton().get<Elements>();
HostViewUnmanaged<Real * [NUM_PHYSICAL_LEV][2][NP][NP]> fm_f90(
elem_derived_FM, elements.num_elems());
sync_to_device<2>(fm_f90, elements.m_forcing.m_fm);
HostViewUnmanaged<Real * [NUM_PHYSICAL_LEV][NP][NP]> ft_f90(
elem_derived_FT, elements.num_elems());
sync_to_device(ft_f90, elements.m_forcing.m_ft);
const SimulationParams ¶ms = Context::singleton().get<SimulationParams>();
Tracers &tracers = Context::singleton().get<Tracers>();
if (params.ftype == ForcingAlg::FORCING_DEBUG) {
if (tracers.fq.data() == nullptr) {
tracers.fq = decltype(tracers.fq)("fq", elements.num_elems());
}
HostViewUnmanaged<Real * [QSIZE_D][NUM_PHYSICAL_LEV][NP][NP]> fq_f90(
elem_derived_FQ, elements.num_elems());
sync_to_device(fq_f90, tracers.fq);
}
tracers.push_qdp(elem_state_Qdp_ptr);
}
void init_reference_element_c (CF90Ptr& deriv, CF90Ptr& mass)
{
ReferenceElement& ref_FE = Context::singleton().create<ReferenceElement> ();
ref_FE.init(deriv,mass);
}
void init_time_level_c (const int& nm1, const int& n0, const int& np1,
const int& nstep, const int& nstep0)
{
TimeLevel& tl = Context::singleton().create<TimeLevel>();
tl.nm1 = nm1-1;
tl.n0 = n0-1;
tl.np1 = np1-1;
tl.nstep = nstep;
tl.nstep0 = nstep0;
}
void init_elements_c (const int& num_elems)
{
auto& c = Context::singleton();
Elements& e = c.create<Elements> ();
const SimulationParams& params = c.get<SimulationParams>();
const bool consthv = (params.hypervis_scaling==0.0);
e.init (num_elems, consthv, /* alloc_gradphis = */ false, params.rearth);
// Init also the tracers structure
Tracers& t = c.create<Tracers> ();
t.init(num_elems,params.qsize);
// In the context, we register also Elements[Geometry|State|DerivedState|Forcing],
// making sure they store the same views as in the subobjects of Elements.
// This allows objects that need only a piece of Elements, to grab it from the Context,
// while still knowing that what they grab contains the same views as the object stored in the
// Elements inside the Context
// WARNING: after this point, you should NOT do things like
// e.m_geometry.m_phis = ...
// since they would NOT be reflected into the ElementsGeometry stored in the Context.
// In other words, you cannot reset the views. If you *really* need to do it,
// you must reset the view in both c.get<Elements>().m_geometry AND
// c.get<ElementsGeometry>()
c.create_ref<ElementsGeometry>(e.m_geometry);
c.create_ref<ElementsState>(e.m_state);
c.create_ref<ElementsDerivedState>(e.m_derived);
c.create_ref<ElementsForcing>(e.m_forcing);
}
void init_functors_c ()
{
// We init all the functors in the Context, so that every call to
// Context::singleton().get<[FunctorName]>() is allowed (otherwise
// Context would throw because the requested object is not found).
auto& elems = Context::singleton().get<Elements>();
auto& tracers = Context::singleton().get<Tracers>();
auto& ref_FE = Context::singleton().get<ReferenceElement>();
auto& hvcoord = Context::singleton().get<HybridVCoord>();
auto& params = Context::singleton().get<SimulationParams>();
auto& fbm = Context::singleton().create<FunctorsBuffersManager>();
// Check that the above structures have been inited
Errors::runtime_check(elems.inited(), "Error! You must initialize the Elements structure before initializing the functors.\n", -1);
Errors::runtime_check(tracers.inited(), "Error! You must initialize the Tracers structure before initializing the functors.\n", -1);
Errors::runtime_check(ref_FE.inited(), "Error! You must initialize the ReferenceElement structure before initializing the functors.\n", -1);
Errors::runtime_check(hvcoord.m_inited, "Error! You must initialize the HybridVCoord structure before initializing the functors.\n", -1);
Errors::runtime_check(params.params_set, "Error! You must initialize the SimulationParams structure before initializing the functors.\n", -1);
// First, sphere operators, then all the functors
auto& sph_op = Context::singleton().create<SphereOperators>(elems.m_geometry,ref_FE);
auto& caar = Context::singleton().create<CaarFunctor>(elems,tracers,ref_FE,hvcoord,sph_op,params);
auto& esf = Context::singleton().create<EulerStepFunctor>();
auto& hvf = Context::singleton().create<HyperviscosityFunctor>();
Context::singleton().create<VerticalRemapManager>();
// Ask the functors to request buffers to the buffers manager
fbm.request_size(caar.requested_buffer_size());
fbm.request_size(esf.requested_buffer_size());
fbm.request_size(hvf.requested_buffer_size());
// Allocate the buffers
fbm.allocate();
// Tell the functors to grab their buffers
caar.init_buffers(fbm);
esf.init_buffers(fbm);
hvf.init_buffers(fbm);
}
void init_elements_2d_c (const int& ie, CF90Ptr& D, CF90Ptr& Dinv, CF90Ptr& fcor,
CF90Ptr& spheremp, CF90Ptr& rspheremp,
CF90Ptr& metdet, CF90Ptr& metinv, CF90Ptr& phis,
CF90Ptr &tensorvisc, CF90Ptr &vec_sph2cart)
{
Elements& e = Context::singleton().get<Elements> ();
const SimulationParams& params = Context::singleton().get<SimulationParams>();
const bool consthv = (params.hypervis_scaling==0.0);
e.m_geometry.set_elem_data(ie,D,Dinv,fcor,spheremp,rspheremp,metdet,metinv,tensorvisc,vec_sph2cart,consthv);
e.m_geometry.set_phis(ie,phis);
}
void init_elements_states_c (CF90Ptr& elem_state_v_ptr, CF90Ptr& elem_state_temp_ptr, CF90Ptr& elem_state_dp3d_ptr,
CF90Ptr& elem_state_Qdp_ptr, CF90Ptr& elem_state_ps_v_ptr)
{
Elements& elements = Context::singleton().get<Elements> ();
elements.m_state.pull_from_f90_pointers(elem_state_v_ptr,elem_state_temp_ptr,elem_state_dp3d_ptr,elem_state_ps_v_ptr);
Tracers &tracers = Context::singleton().get<Tracers>();
tracers.pull_qdp(elem_state_Qdp_ptr);
}
void init_diagnostics_c (F90Ptr& elem_state_q_ptr, F90Ptr& elem_accum_qvar_ptr, F90Ptr& elem_accum_qmass_ptr,
F90Ptr& elem_accum_q1mass_ptr, F90Ptr& elem_accum_iener_ptr, F90Ptr& elem_accum_iener_wet_ptr,
F90Ptr& elem_accum_kener_ptr, F90Ptr& elem_accum_pener_ptr)
{
Elements& elements = Context::singleton().get<Elements> ();
Diagnostics& diagnostics = Context::singleton().create<Diagnostics> ();
diagnostics.init(elements.num_elems(), elem_state_q_ptr, elem_accum_qvar_ptr, elem_accum_qmass_ptr, elem_accum_q1mass_ptr,
elem_accum_iener_ptr, elem_accum_iener_wet_ptr, elem_accum_kener_ptr, elem_accum_pener_ptr);
}
void init_boundary_exchanges_c ()
{
auto& params = Context::singleton().get<SimulationParams>();
// Create BEs. Note: connectivity is created in init_connectivity in mpi_cxx_f90_interface
auto connectivity = Context::singleton().get_ptr<Connectivity>();
auto& bmm = Context::singleton().create<MpiBuffersManagerMap>();
bmm[MPI_EXCHANGE]->set_connectivity(connectivity);
bmm[MPI_EXCHANGE_MIN_MAX]->set_connectivity(connectivity);
// Euler BEs
auto& esf = Context::singleton().get<EulerStepFunctor>();
esf.reset(params);
esf.init_boundary_exchanges();
// RK stages BE's
auto& cf = Context::singleton().get<CaarFunctor>();
cf.init_boundary_exchanges(bmm[MPI_EXCHANGE]);
// HyperviscosityFunctor's BE's
auto& hvf = Context::singleton().get<HyperviscosityFunctor>();
hvf.init_boundary_exchanges();
}
} // extern "C"
} // namespace Homme
| 44.437673 | 144 | 0.686136 | oksanaguba |
a34bd9cccfb95831c11f1c118ad0e12ba336cb66 | 94,219 | cpp | C++ | Split/Temp/il2cppOutput/il2cppOutput/UnityEngine.UnityWebRequestWWWModule.cpp | OgiJr/SunBed | ea42007d57affe1421517cff6634e6412943f89f | [
"MIT"
] | null | null | null | Split/Temp/il2cppOutput/il2cppOutput/UnityEngine.UnityWebRequestWWWModule.cpp | OgiJr/SunBed | ea42007d57affe1421517cff6634e6412943f89f | [
"MIT"
] | null | null | null | Split/Temp/il2cppOutput/il2cppOutput/UnityEngine.UnityWebRequestWWWModule.cpp | OgiJr/SunBed | ea42007d57affe1421517cff6634e6412943f89f | [
"MIT"
] | null | null | null | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <limits>
#include <stdint.h>
// UnityEngine.Networking.CertificateHandler
struct CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E;
// System.Void
struct Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5;
// UnityEngine.WWW
struct WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2;
// System.Action`1<UnityEngine.AsyncOperation>
struct Action_1_tC1348BEB2C677FD60E4B65764CA3A1CAFF6DFB31;
// System.Collections.Generic.Dictionary`2<System.Object,System.Object>
struct Dictionary_2_tBD1E3221EBD04CEBDA49B84779912E91F56B958D;
// System.Collections.Generic.Dictionary`2<System.String,System.String>
struct Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5;
// System.Collections.Generic.IEqualityComparer`1<System.String>
struct IEqualityComparer_1_tE6A65C5E45E33FD7D9849FD0914DE3AD32B68050;
// System.Collections.Generic.Dictionary`2/KeyCollection<System.String,System.String>
struct KeyCollection_t52C81163A051BCD87A36FEF95F736DD600E2305D;
// System.Collections.Generic.List`1<System.Byte[]>
struct List_1_t08E192A6E99857FD75EAA081A5D3BEC33729EDBE;
// System.Collections.Generic.List`1<System.String>
struct List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3;
// System.Collections.Generic.Dictionary`2/ValueCollection<System.String,System.String>
struct ValueCollection_t9161A5C97376D261665798FA27DAFD5177305C81;
// System.Byte[]
struct ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726;
// System.Char[]
struct CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34;
// UnityEngine.CustomYieldInstruction
struct CustomYieldInstruction_t4ED1543FBAA3143362854EB1867B42E5D190A5C7;
// UnityEngine.Networking.DownloadHandler
struct DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB;
// UnityEngine.Networking.DownloadHandlerBuffer
struct DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D;
// System.Collections.Generic.Dictionary`2/Entry<System.String,System.String>[]
struct EntryU5BU5D_t52A654EA9927D1B5F56CA05CF209F2E4393C4510;
// System.Int32[]
struct Int32U5BU5D_t70F1BDC14B1786481B176D6139A5E3B87DC54C32;
// System.String
struct String_t;
// UnityEngine.Texture2D
struct Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF;
// UnityEngine.Networking.UnityWebRequest
struct UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E;
// UnityEngine.Networking.UnityWebRequestAsyncOperation
struct UnityWebRequestAsyncOperation_tDCAC6B6C7D51563F8DFD4963E3BE362470125396;
// UnityEngine.Networking.UploadHandler
struct UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA;
// UnityEngine.Networking.UploadHandlerRaw
struct UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669;
// System.Uri
struct Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612;
// UnityEngine.WWWForm
struct WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB;
IL2CPP_EXTERN_C RuntimeClass* Debug_tEB68BCBEB8EFD60F8043C67146DC05E7F50F374B_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* Int64_t378EE0D608BD3107E77238E85F30D2BBD46981F3_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C String_t* _stringLiteral14B6DF3349D302FD20ED0B3BD448C2045066E9BE;
IL2CPP_EXTERN_C String_t* _stringLiteral14E338D17C42E552FA7AF42CDAE40CA1F0E8A04D;
IL2CPP_EXTERN_C String_t* _stringLiteral218F5A08519088A96BE3C1074984C53EA49F1CCA;
IL2CPP_EXTERN_C String_t* _stringLiteral3781CFEEF925855A4B7284E1783A7D715A6333F6;
IL2CPP_EXTERN_C String_t* _stringLiteral8E752B76D455A50FE476984D4B09A7CDBF2A753E;
IL2CPP_EXTERN_C String_t* _stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709;
IL2CPP_EXTERN_C String_t* _stringLiteralE2429764F10DC7E990250D2AE4138FE5AC928076;
IL2CPP_EXTERN_C const RuntimeMethod* Dictionary_2_GetEnumerator_m8C0A038B5FA7E62DEF4DB9EF1F5FCC4348D785C5_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* Enumerator_Dispose_m76E867298698AA2B89F9D57E21CEFCD16B372D22_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* Enumerator_MoveNext_mA57D4325DBD9D10EB3E43C99CC18DB6C3CE85FC8_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* Enumerator_get_Current_m45394A0B01FA26CB32851562F9CBF27DB35FF4DD_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* KeyValuePair_2_get_Key_m42802FFFC275E928911F87B16DFE504319DF58F1_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* KeyValuePair_2_get_Value_mB6B24D3920A4744624F8ED9AE493783D0E5F81DD_RuntimeMethod_var;
IL2CPP_EXTERN_C const uint32_t WWW_CreateTextureFromDownloadedData_m978F4A746B24EEA580E7AA8F1F05203196A299F9_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t WWW_WaitUntilDoneIfPossible_m8D6B638F661CBD13B442F392BF42F5C9BDF0E84D_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t WWW__ctor_m6686CBC878BB9EB28F4C4171C203CA4E3DE3656C_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t WWW_get_error_mB278F5EC90EF99FEF70D80112940CFB49E79C9BC_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t WWW_get_text_m0D2EF7BBFB58E37FE30A665389355ACA65804138_MetadataUsageId;
struct CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E_marshaled_com;
struct DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_com;
struct UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_marshaled_com;
struct UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_marshaled_pinvoke;
struct UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_com;
struct ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726;
IL2CPP_EXTERN_C_BEGIN
IL2CPP_EXTERN_C_END
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// <Module>
struct U3CModuleU3E_t1A04780FFD77F371B4AE0F3CA161423BCEF4EDAF
{
public:
public:
};
// System.Object
struct Il2CppArrayBounds;
// System.Array
// System.Collections.Generic.Dictionary`2<System.String,System.String>
struct Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 : public RuntimeObject
{
public:
// System.Int32[] System.Collections.Generic.Dictionary`2::buckets
Int32U5BU5D_t70F1BDC14B1786481B176D6139A5E3B87DC54C32* ___buckets_0;
// System.Collections.Generic.Dictionary`2_Entry<TKey,TValue>[] System.Collections.Generic.Dictionary`2::entries
EntryU5BU5D_t52A654EA9927D1B5F56CA05CF209F2E4393C4510* ___entries_1;
// System.Int32 System.Collections.Generic.Dictionary`2::count
int32_t ___count_2;
// System.Int32 System.Collections.Generic.Dictionary`2::version
int32_t ___version_3;
// System.Int32 System.Collections.Generic.Dictionary`2::freeList
int32_t ___freeList_4;
// System.Int32 System.Collections.Generic.Dictionary`2::freeCount
int32_t ___freeCount_5;
// System.Collections.Generic.IEqualityComparer`1<TKey> System.Collections.Generic.Dictionary`2::comparer
RuntimeObject* ___comparer_6;
// System.Collections.Generic.Dictionary`2_KeyCollection<TKey,TValue> System.Collections.Generic.Dictionary`2::keys
KeyCollection_t52C81163A051BCD87A36FEF95F736DD600E2305D * ___keys_7;
// System.Collections.Generic.Dictionary`2_ValueCollection<TKey,TValue> System.Collections.Generic.Dictionary`2::values
ValueCollection_t9161A5C97376D261665798FA27DAFD5177305C81 * ___values_8;
// System.Object System.Collections.Generic.Dictionary`2::_syncRoot
RuntimeObject * ____syncRoot_9;
public:
inline static int32_t get_offset_of_buckets_0() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___buckets_0)); }
inline Int32U5BU5D_t70F1BDC14B1786481B176D6139A5E3B87DC54C32* get_buckets_0() const { return ___buckets_0; }
inline Int32U5BU5D_t70F1BDC14B1786481B176D6139A5E3B87DC54C32** get_address_of_buckets_0() { return &___buckets_0; }
inline void set_buckets_0(Int32U5BU5D_t70F1BDC14B1786481B176D6139A5E3B87DC54C32* value)
{
___buckets_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___buckets_0), (void*)value);
}
inline static int32_t get_offset_of_entries_1() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___entries_1)); }
inline EntryU5BU5D_t52A654EA9927D1B5F56CA05CF209F2E4393C4510* get_entries_1() const { return ___entries_1; }
inline EntryU5BU5D_t52A654EA9927D1B5F56CA05CF209F2E4393C4510** get_address_of_entries_1() { return &___entries_1; }
inline void set_entries_1(EntryU5BU5D_t52A654EA9927D1B5F56CA05CF209F2E4393C4510* value)
{
___entries_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___entries_1), (void*)value);
}
inline static int32_t get_offset_of_count_2() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___count_2)); }
inline int32_t get_count_2() const { return ___count_2; }
inline int32_t* get_address_of_count_2() { return &___count_2; }
inline void set_count_2(int32_t value)
{
___count_2 = value;
}
inline static int32_t get_offset_of_version_3() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___version_3)); }
inline int32_t get_version_3() const { return ___version_3; }
inline int32_t* get_address_of_version_3() { return &___version_3; }
inline void set_version_3(int32_t value)
{
___version_3 = value;
}
inline static int32_t get_offset_of_freeList_4() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___freeList_4)); }
inline int32_t get_freeList_4() const { return ___freeList_4; }
inline int32_t* get_address_of_freeList_4() { return &___freeList_4; }
inline void set_freeList_4(int32_t value)
{
___freeList_4 = value;
}
inline static int32_t get_offset_of_freeCount_5() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___freeCount_5)); }
inline int32_t get_freeCount_5() const { return ___freeCount_5; }
inline int32_t* get_address_of_freeCount_5() { return &___freeCount_5; }
inline void set_freeCount_5(int32_t value)
{
___freeCount_5 = value;
}
inline static int32_t get_offset_of_comparer_6() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___comparer_6)); }
inline RuntimeObject* get_comparer_6() const { return ___comparer_6; }
inline RuntimeObject** get_address_of_comparer_6() { return &___comparer_6; }
inline void set_comparer_6(RuntimeObject* value)
{
___comparer_6 = value;
Il2CppCodeGenWriteBarrier((void**)(&___comparer_6), (void*)value);
}
inline static int32_t get_offset_of_keys_7() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___keys_7)); }
inline KeyCollection_t52C81163A051BCD87A36FEF95F736DD600E2305D * get_keys_7() const { return ___keys_7; }
inline KeyCollection_t52C81163A051BCD87A36FEF95F736DD600E2305D ** get_address_of_keys_7() { return &___keys_7; }
inline void set_keys_7(KeyCollection_t52C81163A051BCD87A36FEF95F736DD600E2305D * value)
{
___keys_7 = value;
Il2CppCodeGenWriteBarrier((void**)(&___keys_7), (void*)value);
}
inline static int32_t get_offset_of_values_8() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ___values_8)); }
inline ValueCollection_t9161A5C97376D261665798FA27DAFD5177305C81 * get_values_8() const { return ___values_8; }
inline ValueCollection_t9161A5C97376D261665798FA27DAFD5177305C81 ** get_address_of_values_8() { return &___values_8; }
inline void set_values_8(ValueCollection_t9161A5C97376D261665798FA27DAFD5177305C81 * value)
{
___values_8 = value;
Il2CppCodeGenWriteBarrier((void**)(&___values_8), (void*)value);
}
inline static int32_t get_offset_of__syncRoot_9() { return static_cast<int32_t>(offsetof(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5, ____syncRoot_9)); }
inline RuntimeObject * get__syncRoot_9() const { return ____syncRoot_9; }
inline RuntimeObject ** get_address_of__syncRoot_9() { return &____syncRoot_9; }
inline void set__syncRoot_9(RuntimeObject * value)
{
____syncRoot_9 = value;
Il2CppCodeGenWriteBarrier((void**)(&____syncRoot_9), (void*)value);
}
};
// System.String
struct String_t : public RuntimeObject
{
public:
// System.Int32 System.String::m_stringLength
int32_t ___m_stringLength_0;
// System.Char System.String::m_firstChar
Il2CppChar ___m_firstChar_1;
public:
inline static int32_t get_offset_of_m_stringLength_0() { return static_cast<int32_t>(offsetof(String_t, ___m_stringLength_0)); }
inline int32_t get_m_stringLength_0() const { return ___m_stringLength_0; }
inline int32_t* get_address_of_m_stringLength_0() { return &___m_stringLength_0; }
inline void set_m_stringLength_0(int32_t value)
{
___m_stringLength_0 = value;
}
inline static int32_t get_offset_of_m_firstChar_1() { return static_cast<int32_t>(offsetof(String_t, ___m_firstChar_1)); }
inline Il2CppChar get_m_firstChar_1() const { return ___m_firstChar_1; }
inline Il2CppChar* get_address_of_m_firstChar_1() { return &___m_firstChar_1; }
inline void set_m_firstChar_1(Il2CppChar value)
{
___m_firstChar_1 = value;
}
};
struct String_t_StaticFields
{
public:
// System.String System.String::Empty
String_t* ___Empty_5;
public:
inline static int32_t get_offset_of_Empty_5() { return static_cast<int32_t>(offsetof(String_t_StaticFields, ___Empty_5)); }
inline String_t* get_Empty_5() const { return ___Empty_5; }
inline String_t** get_address_of_Empty_5() { return &___Empty_5; }
inline void set_Empty_5(String_t* value)
{
___Empty_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___Empty_5), (void*)value);
}
};
// System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52 : public RuntimeObject
{
public:
public:
};
// Native definition for P/Invoke marshalling of System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52_marshaled_pinvoke
{
};
// Native definition for COM marshalling of System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52_marshaled_com
{
};
// UnityEngine.CustomYieldInstruction
struct CustomYieldInstruction_t4ED1543FBAA3143362854EB1867B42E5D190A5C7 : public RuntimeObject
{
public:
public:
};
// UnityEngine.WWWForm
struct WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB : public RuntimeObject
{
public:
// System.Collections.Generic.List`1<System.Byte[]> UnityEngine.WWWForm::formData
List_1_t08E192A6E99857FD75EAA081A5D3BEC33729EDBE * ___formData_0;
// System.Collections.Generic.List`1<System.String> UnityEngine.WWWForm::fieldNames
List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * ___fieldNames_1;
// System.Collections.Generic.List`1<System.String> UnityEngine.WWWForm::fileNames
List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * ___fileNames_2;
// System.Collections.Generic.List`1<System.String> UnityEngine.WWWForm::types
List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * ___types_3;
// System.Byte[] UnityEngine.WWWForm::boundary
ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* ___boundary_4;
// System.Boolean UnityEngine.WWWForm::containsFiles
bool ___containsFiles_5;
public:
inline static int32_t get_offset_of_formData_0() { return static_cast<int32_t>(offsetof(WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB, ___formData_0)); }
inline List_1_t08E192A6E99857FD75EAA081A5D3BEC33729EDBE * get_formData_0() const { return ___formData_0; }
inline List_1_t08E192A6E99857FD75EAA081A5D3BEC33729EDBE ** get_address_of_formData_0() { return &___formData_0; }
inline void set_formData_0(List_1_t08E192A6E99857FD75EAA081A5D3BEC33729EDBE * value)
{
___formData_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___formData_0), (void*)value);
}
inline static int32_t get_offset_of_fieldNames_1() { return static_cast<int32_t>(offsetof(WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB, ___fieldNames_1)); }
inline List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * get_fieldNames_1() const { return ___fieldNames_1; }
inline List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 ** get_address_of_fieldNames_1() { return &___fieldNames_1; }
inline void set_fieldNames_1(List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * value)
{
___fieldNames_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___fieldNames_1), (void*)value);
}
inline static int32_t get_offset_of_fileNames_2() { return static_cast<int32_t>(offsetof(WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB, ___fileNames_2)); }
inline List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * get_fileNames_2() const { return ___fileNames_2; }
inline List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 ** get_address_of_fileNames_2() { return &___fileNames_2; }
inline void set_fileNames_2(List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * value)
{
___fileNames_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___fileNames_2), (void*)value);
}
inline static int32_t get_offset_of_types_3() { return static_cast<int32_t>(offsetof(WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB, ___types_3)); }
inline List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * get_types_3() const { return ___types_3; }
inline List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 ** get_address_of_types_3() { return &___types_3; }
inline void set_types_3(List_1_t6C9F81EDBF0F4A31A9B0DA372D2EF34BDA3A1AF3 * value)
{
___types_3 = value;
Il2CppCodeGenWriteBarrier((void**)(&___types_3), (void*)value);
}
inline static int32_t get_offset_of_boundary_4() { return static_cast<int32_t>(offsetof(WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB, ___boundary_4)); }
inline ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* get_boundary_4() const { return ___boundary_4; }
inline ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726** get_address_of_boundary_4() { return &___boundary_4; }
inline void set_boundary_4(ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* value)
{
___boundary_4 = value;
Il2CppCodeGenWriteBarrier((void**)(&___boundary_4), (void*)value);
}
inline static int32_t get_offset_of_containsFiles_5() { return static_cast<int32_t>(offsetof(WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB, ___containsFiles_5)); }
inline bool get_containsFiles_5() const { return ___containsFiles_5; }
inline bool* get_address_of_containsFiles_5() { return &___containsFiles_5; }
inline void set_containsFiles_5(bool value)
{
___containsFiles_5 = value;
}
};
// UnityEngine.YieldInstruction
struct YieldInstruction_tB0B4E05316710E51ECCC1E57174C27FE6DEBBEAF : public RuntimeObject
{
public:
public:
};
// Native definition for P/Invoke marshalling of UnityEngine.YieldInstruction
struct YieldInstruction_tB0B4E05316710E51ECCC1E57174C27FE6DEBBEAF_marshaled_pinvoke
{
};
// Native definition for COM marshalling of UnityEngine.YieldInstruction
struct YieldInstruction_tB0B4E05316710E51ECCC1E57174C27FE6DEBBEAF_marshaled_com
{
};
// System.Boolean
struct Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37
{
public:
// System.Boolean System.Boolean::m_value
bool ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37, ___m_value_0)); }
inline bool get_m_value_0() const { return ___m_value_0; }
inline bool* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(bool value)
{
___m_value_0 = value;
}
};
struct Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields
{
public:
// System.String System.Boolean::TrueString
String_t* ___TrueString_5;
// System.String System.Boolean::FalseString
String_t* ___FalseString_6;
public:
inline static int32_t get_offset_of_TrueString_5() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields, ___TrueString_5)); }
inline String_t* get_TrueString_5() const { return ___TrueString_5; }
inline String_t** get_address_of_TrueString_5() { return &___TrueString_5; }
inline void set_TrueString_5(String_t* value)
{
___TrueString_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___TrueString_5), (void*)value);
}
inline static int32_t get_offset_of_FalseString_6() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields, ___FalseString_6)); }
inline String_t* get_FalseString_6() const { return ___FalseString_6; }
inline String_t** get_address_of_FalseString_6() { return &___FalseString_6; }
inline void set_FalseString_6(String_t* value)
{
___FalseString_6 = value;
Il2CppCodeGenWriteBarrier((void**)(&___FalseString_6), (void*)value);
}
};
// System.Byte
struct Byte_t0111FAB8B8685667EDDAF77683F0D8F86B659056
{
public:
// System.Byte System.Byte::m_value
uint8_t ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Byte_t0111FAB8B8685667EDDAF77683F0D8F86B659056, ___m_value_0)); }
inline uint8_t get_m_value_0() const { return ___m_value_0; }
inline uint8_t* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(uint8_t value)
{
___m_value_0 = value;
}
};
// System.Collections.Generic.KeyValuePair`2<System.Object,System.Object>
struct KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625
{
public:
// TKey System.Collections.Generic.KeyValuePair`2::key
RuntimeObject * ___key_0;
// TValue System.Collections.Generic.KeyValuePair`2::value
RuntimeObject * ___value_1;
public:
inline static int32_t get_offset_of_key_0() { return static_cast<int32_t>(offsetof(KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625, ___key_0)); }
inline RuntimeObject * get_key_0() const { return ___key_0; }
inline RuntimeObject ** get_address_of_key_0() { return &___key_0; }
inline void set_key_0(RuntimeObject * value)
{
___key_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___key_0), (void*)value);
}
inline static int32_t get_offset_of_value_1() { return static_cast<int32_t>(offsetof(KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625, ___value_1)); }
inline RuntimeObject * get_value_1() const { return ___value_1; }
inline RuntimeObject ** get_address_of_value_1() { return &___value_1; }
inline void set_value_1(RuntimeObject * value)
{
___value_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___value_1), (void*)value);
}
};
// System.Collections.Generic.KeyValuePair`2<System.String,System.String>
struct KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC
{
public:
// TKey System.Collections.Generic.KeyValuePair`2::key
String_t* ___key_0;
// TValue System.Collections.Generic.KeyValuePair`2::value
String_t* ___value_1;
public:
inline static int32_t get_offset_of_key_0() { return static_cast<int32_t>(offsetof(KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC, ___key_0)); }
inline String_t* get_key_0() const { return ___key_0; }
inline String_t** get_address_of_key_0() { return &___key_0; }
inline void set_key_0(String_t* value)
{
___key_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___key_0), (void*)value);
}
inline static int32_t get_offset_of_value_1() { return static_cast<int32_t>(offsetof(KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC, ___value_1)); }
inline String_t* get_value_1() const { return ___value_1; }
inline String_t** get_address_of_value_1() { return &___value_1; }
inline void set_value_1(String_t* value)
{
___value_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___value_1), (void*)value);
}
};
// System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA : public ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52
{
public:
public:
};
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_StaticFields
{
public:
// System.Char[] System.Enum::enumSeperatorCharArray
CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* ___enumSeperatorCharArray_0;
public:
inline static int32_t get_offset_of_enumSeperatorCharArray_0() { return static_cast<int32_t>(offsetof(Enum_t23B90B40F60E677A8025267341651C94AE079CDA_StaticFields, ___enumSeperatorCharArray_0)); }
inline CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* get_enumSeperatorCharArray_0() const { return ___enumSeperatorCharArray_0; }
inline CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34** get_address_of_enumSeperatorCharArray_0() { return &___enumSeperatorCharArray_0; }
inline void set_enumSeperatorCharArray_0(CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* value)
{
___enumSeperatorCharArray_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___enumSeperatorCharArray_0), (void*)value);
}
};
// Native definition for P/Invoke marshalling of System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_marshaled_pinvoke
{
};
// Native definition for COM marshalling of System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_marshaled_com
{
};
// System.Int32
struct Int32_tFDE5F8CD43D10453F6A2E0C77FE48C6CC7009046
{
public:
// System.Int32 System.Int32::m_value
int32_t ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Int32_tFDE5F8CD43D10453F6A2E0C77FE48C6CC7009046, ___m_value_0)); }
inline int32_t get_m_value_0() const { return ___m_value_0; }
inline int32_t* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(int32_t value)
{
___m_value_0 = value;
}
};
// System.Int64
struct Int64_t378EE0D608BD3107E77238E85F30D2BBD46981F3
{
public:
// System.Int64 System.Int64::m_value
int64_t ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Int64_t378EE0D608BD3107E77238E85F30D2BBD46981F3, ___m_value_0)); }
inline int64_t get_m_value_0() const { return ___m_value_0; }
inline int64_t* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(int64_t value)
{
___m_value_0 = value;
}
};
// System.IntPtr
struct IntPtr_t
{
public:
// System.Void* System.IntPtr::m_value
void* ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(IntPtr_t, ___m_value_0)); }
inline void* get_m_value_0() const { return ___m_value_0; }
inline void** get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(void* value)
{
___m_value_0 = value;
}
};
struct IntPtr_t_StaticFields
{
public:
// System.IntPtr System.IntPtr::Zero
intptr_t ___Zero_1;
public:
inline static int32_t get_offset_of_Zero_1() { return static_cast<int32_t>(offsetof(IntPtr_t_StaticFields, ___Zero_1)); }
inline intptr_t get_Zero_1() const { return ___Zero_1; }
inline intptr_t* get_address_of_Zero_1() { return &___Zero_1; }
inline void set_Zero_1(intptr_t value)
{
___Zero_1 = value;
}
};
// System.Void
struct Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5
{
public:
union
{
struct
{
};
uint8_t Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5__padding[1];
};
public:
};
// UnityEngine.WWW
struct WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 : public CustomYieldInstruction_t4ED1543FBAA3143362854EB1867B42E5D190A5C7
{
public:
// UnityEngine.Networking.UnityWebRequest UnityEngine.WWW::_uwr
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * ____uwr_0;
public:
inline static int32_t get_offset_of__uwr_0() { return static_cast<int32_t>(offsetof(WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2, ____uwr_0)); }
inline UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * get__uwr_0() const { return ____uwr_0; }
inline UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E ** get_address_of__uwr_0() { return &____uwr_0; }
inline void set__uwr_0(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * value)
{
____uwr_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&____uwr_0), (void*)value);
}
};
// System.Collections.Generic.Dictionary`2_Enumerator<System.Object,System.Object>
struct Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0
{
public:
// System.Collections.Generic.Dictionary`2<TKey,TValue> System.Collections.Generic.Dictionary`2_Enumerator::dictionary
Dictionary_2_tBD1E3221EBD04CEBDA49B84779912E91F56B958D * ___dictionary_0;
// System.Int32 System.Collections.Generic.Dictionary`2_Enumerator::version
int32_t ___version_1;
// System.Int32 System.Collections.Generic.Dictionary`2_Enumerator::index
int32_t ___index_2;
// System.Collections.Generic.KeyValuePair`2<TKey,TValue> System.Collections.Generic.Dictionary`2_Enumerator::current
KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 ___current_3;
// System.Int32 System.Collections.Generic.Dictionary`2_Enumerator::getEnumeratorRetType
int32_t ___getEnumeratorRetType_4;
public:
inline static int32_t get_offset_of_dictionary_0() { return static_cast<int32_t>(offsetof(Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0, ___dictionary_0)); }
inline Dictionary_2_tBD1E3221EBD04CEBDA49B84779912E91F56B958D * get_dictionary_0() const { return ___dictionary_0; }
inline Dictionary_2_tBD1E3221EBD04CEBDA49B84779912E91F56B958D ** get_address_of_dictionary_0() { return &___dictionary_0; }
inline void set_dictionary_0(Dictionary_2_tBD1E3221EBD04CEBDA49B84779912E91F56B958D * value)
{
___dictionary_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___dictionary_0), (void*)value);
}
inline static int32_t get_offset_of_version_1() { return static_cast<int32_t>(offsetof(Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0, ___version_1)); }
inline int32_t get_version_1() const { return ___version_1; }
inline int32_t* get_address_of_version_1() { return &___version_1; }
inline void set_version_1(int32_t value)
{
___version_1 = value;
}
inline static int32_t get_offset_of_index_2() { return static_cast<int32_t>(offsetof(Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0, ___index_2)); }
inline int32_t get_index_2() const { return ___index_2; }
inline int32_t* get_address_of_index_2() { return &___index_2; }
inline void set_index_2(int32_t value)
{
___index_2 = value;
}
inline static int32_t get_offset_of_current_3() { return static_cast<int32_t>(offsetof(Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0, ___current_3)); }
inline KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 get_current_3() const { return ___current_3; }
inline KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 * get_address_of_current_3() { return &___current_3; }
inline void set_current_3(KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 value)
{
___current_3 = value;
Il2CppCodeGenWriteBarrier((void**)&(((&___current_3))->___key_0), (void*)NULL);
#if IL2CPP_ENABLE_STRICT_WRITE_BARRIERS
Il2CppCodeGenWriteBarrier((void**)&(((&___current_3))->___value_1), (void*)NULL);
#endif
}
inline static int32_t get_offset_of_getEnumeratorRetType_4() { return static_cast<int32_t>(offsetof(Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0, ___getEnumeratorRetType_4)); }
inline int32_t get_getEnumeratorRetType_4() const { return ___getEnumeratorRetType_4; }
inline int32_t* get_address_of_getEnumeratorRetType_4() { return &___getEnumeratorRetType_4; }
inline void set_getEnumeratorRetType_4(int32_t value)
{
___getEnumeratorRetType_4 = value;
}
};
// System.Collections.Generic.Dictionary`2_Enumerator<System.String,System.String>
struct Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB
{
public:
// System.Collections.Generic.Dictionary`2<TKey,TValue> System.Collections.Generic.Dictionary`2_Enumerator::dictionary
Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 * ___dictionary_0;
// System.Int32 System.Collections.Generic.Dictionary`2_Enumerator::version
int32_t ___version_1;
// System.Int32 System.Collections.Generic.Dictionary`2_Enumerator::index
int32_t ___index_2;
// System.Collections.Generic.KeyValuePair`2<TKey,TValue> System.Collections.Generic.Dictionary`2_Enumerator::current
KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC ___current_3;
// System.Int32 System.Collections.Generic.Dictionary`2_Enumerator::getEnumeratorRetType
int32_t ___getEnumeratorRetType_4;
public:
inline static int32_t get_offset_of_dictionary_0() { return static_cast<int32_t>(offsetof(Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB, ___dictionary_0)); }
inline Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 * get_dictionary_0() const { return ___dictionary_0; }
inline Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 ** get_address_of_dictionary_0() { return &___dictionary_0; }
inline void set_dictionary_0(Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 * value)
{
___dictionary_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___dictionary_0), (void*)value);
}
inline static int32_t get_offset_of_version_1() { return static_cast<int32_t>(offsetof(Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB, ___version_1)); }
inline int32_t get_version_1() const { return ___version_1; }
inline int32_t* get_address_of_version_1() { return &___version_1; }
inline void set_version_1(int32_t value)
{
___version_1 = value;
}
inline static int32_t get_offset_of_index_2() { return static_cast<int32_t>(offsetof(Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB, ___index_2)); }
inline int32_t get_index_2() const { return ___index_2; }
inline int32_t* get_address_of_index_2() { return &___index_2; }
inline void set_index_2(int32_t value)
{
___index_2 = value;
}
inline static int32_t get_offset_of_current_3() { return static_cast<int32_t>(offsetof(Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB, ___current_3)); }
inline KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC get_current_3() const { return ___current_3; }
inline KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC * get_address_of_current_3() { return &___current_3; }
inline void set_current_3(KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC value)
{
___current_3 = value;
Il2CppCodeGenWriteBarrier((void**)&(((&___current_3))->___key_0), (void*)NULL);
#if IL2CPP_ENABLE_STRICT_WRITE_BARRIERS
Il2CppCodeGenWriteBarrier((void**)&(((&___current_3))->___value_1), (void*)NULL);
#endif
}
inline static int32_t get_offset_of_getEnumeratorRetType_4() { return static_cast<int32_t>(offsetof(Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB, ___getEnumeratorRetType_4)); }
inline int32_t get_getEnumeratorRetType_4() const { return ___getEnumeratorRetType_4; }
inline int32_t* get_address_of_getEnumeratorRetType_4() { return &___getEnumeratorRetType_4; }
inline void set_getEnumeratorRetType_4(int32_t value)
{
___getEnumeratorRetType_4 = value;
}
};
// System.StringComparison
struct StringComparison_tCC9F72B9B1E2C3C6D2566DD0D3A61E1621048998
{
public:
// System.Int32 System.StringComparison::value__
int32_t ___value___2;
public:
inline static int32_t get_offset_of_value___2() { return static_cast<int32_t>(offsetof(StringComparison_tCC9F72B9B1E2C3C6D2566DD0D3A61E1621048998, ___value___2)); }
inline int32_t get_value___2() const { return ___value___2; }
inline int32_t* get_address_of_value___2() { return &___value___2; }
inline void set_value___2(int32_t value)
{
___value___2 = value;
}
};
// UnityEngine.AsyncOperation
struct AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86 : public YieldInstruction_tB0B4E05316710E51ECCC1E57174C27FE6DEBBEAF
{
public:
// System.IntPtr UnityEngine.AsyncOperation::m_Ptr
intptr_t ___m_Ptr_0;
// System.Action`1<UnityEngine.AsyncOperation> UnityEngine.AsyncOperation::m_completeCallback
Action_1_tC1348BEB2C677FD60E4B65764CA3A1CAFF6DFB31 * ___m_completeCallback_1;
public:
inline static int32_t get_offset_of_m_Ptr_0() { return static_cast<int32_t>(offsetof(AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86, ___m_Ptr_0)); }
inline intptr_t get_m_Ptr_0() const { return ___m_Ptr_0; }
inline intptr_t* get_address_of_m_Ptr_0() { return &___m_Ptr_0; }
inline void set_m_Ptr_0(intptr_t value)
{
___m_Ptr_0 = value;
}
inline static int32_t get_offset_of_m_completeCallback_1() { return static_cast<int32_t>(offsetof(AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86, ___m_completeCallback_1)); }
inline Action_1_tC1348BEB2C677FD60E4B65764CA3A1CAFF6DFB31 * get_m_completeCallback_1() const { return ___m_completeCallback_1; }
inline Action_1_tC1348BEB2C677FD60E4B65764CA3A1CAFF6DFB31 ** get_address_of_m_completeCallback_1() { return &___m_completeCallback_1; }
inline void set_m_completeCallback_1(Action_1_tC1348BEB2C677FD60E4B65764CA3A1CAFF6DFB31 * value)
{
___m_completeCallback_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_completeCallback_1), (void*)value);
}
};
// Native definition for P/Invoke marshalling of UnityEngine.AsyncOperation
struct AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86_marshaled_pinvoke : public YieldInstruction_tB0B4E05316710E51ECCC1E57174C27FE6DEBBEAF_marshaled_pinvoke
{
intptr_t ___m_Ptr_0;
Il2CppMethodPointer ___m_completeCallback_1;
};
// Native definition for COM marshalling of UnityEngine.AsyncOperation
struct AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86_marshaled_com : public YieldInstruction_tB0B4E05316710E51ECCC1E57174C27FE6DEBBEAF_marshaled_com
{
intptr_t ___m_Ptr_0;
Il2CppMethodPointer ___m_completeCallback_1;
};
// UnityEngine.Networking.CertificateHandler
struct CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.Networking.CertificateHandler::m_Ptr
intptr_t ___m_Ptr_0;
public:
inline static int32_t get_offset_of_m_Ptr_0() { return static_cast<int32_t>(offsetof(CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E, ___m_Ptr_0)); }
inline intptr_t get_m_Ptr_0() const { return ___m_Ptr_0; }
inline intptr_t* get_address_of_m_Ptr_0() { return &___m_Ptr_0; }
inline void set_m_Ptr_0(intptr_t value)
{
___m_Ptr_0 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.CertificateHandler
struct CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E_marshaled_pinvoke
{
intptr_t ___m_Ptr_0;
};
// Native definition for COM marshalling of UnityEngine.Networking.CertificateHandler
struct CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E_marshaled_com
{
intptr_t ___m_Ptr_0;
};
// UnityEngine.Networking.DownloadHandler
struct DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.Networking.DownloadHandler::m_Ptr
intptr_t ___m_Ptr_0;
public:
inline static int32_t get_offset_of_m_Ptr_0() { return static_cast<int32_t>(offsetof(DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB, ___m_Ptr_0)); }
inline intptr_t get_m_Ptr_0() const { return ___m_Ptr_0; }
inline intptr_t* get_address_of_m_Ptr_0() { return &___m_Ptr_0; }
inline void set_m_Ptr_0(intptr_t value)
{
___m_Ptr_0 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.DownloadHandler
struct DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_pinvoke
{
intptr_t ___m_Ptr_0;
};
// Native definition for COM marshalling of UnityEngine.Networking.DownloadHandler
struct DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_com
{
intptr_t ___m_Ptr_0;
};
// UnityEngine.Networking.UnityWebRequest_Result
struct Result_t3233C0F690EC3844C8E0C4649568659679AFBE75
{
public:
// System.Int32 UnityEngine.Networking.UnityWebRequest_Result::value__
int32_t ___value___2;
public:
inline static int32_t get_offset_of_value___2() { return static_cast<int32_t>(offsetof(Result_t3233C0F690EC3844C8E0C4649568659679AFBE75, ___value___2)); }
inline int32_t get_value___2() const { return ___value___2; }
inline int32_t* get_address_of_value___2() { return &___value___2; }
inline void set_value___2(int32_t value)
{
___value___2 = value;
}
};
// UnityEngine.Networking.UploadHandler
struct UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.Networking.UploadHandler::m_Ptr
intptr_t ___m_Ptr_0;
public:
inline static int32_t get_offset_of_m_Ptr_0() { return static_cast<int32_t>(offsetof(UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA, ___m_Ptr_0)); }
inline intptr_t get_m_Ptr_0() const { return ___m_Ptr_0; }
inline intptr_t* get_address_of_m_Ptr_0() { return &___m_Ptr_0; }
inline void set_m_Ptr_0(intptr_t value)
{
___m_Ptr_0 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.UploadHandler
struct UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_pinvoke
{
intptr_t ___m_Ptr_0;
};
// Native definition for COM marshalling of UnityEngine.Networking.UploadHandler
struct UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_com
{
intptr_t ___m_Ptr_0;
};
// UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.Object::m_CachedPtr
intptr_t ___m_CachedPtr_0;
public:
inline static int32_t get_offset_of_m_CachedPtr_0() { return static_cast<int32_t>(offsetof(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A, ___m_CachedPtr_0)); }
inline intptr_t get_m_CachedPtr_0() const { return ___m_CachedPtr_0; }
inline intptr_t* get_address_of_m_CachedPtr_0() { return &___m_CachedPtr_0; }
inline void set_m_CachedPtr_0(intptr_t value)
{
___m_CachedPtr_0 = value;
}
};
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_StaticFields
{
public:
// System.Int32 UnityEngine.Object::OffsetOfInstanceIDInCPlusPlusObject
int32_t ___OffsetOfInstanceIDInCPlusPlusObject_1;
public:
inline static int32_t get_offset_of_OffsetOfInstanceIDInCPlusPlusObject_1() { return static_cast<int32_t>(offsetof(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_StaticFields, ___OffsetOfInstanceIDInCPlusPlusObject_1)); }
inline int32_t get_OffsetOfInstanceIDInCPlusPlusObject_1() const { return ___OffsetOfInstanceIDInCPlusPlusObject_1; }
inline int32_t* get_address_of_OffsetOfInstanceIDInCPlusPlusObject_1() { return &___OffsetOfInstanceIDInCPlusPlusObject_1; }
inline void set_OffsetOfInstanceIDInCPlusPlusObject_1(int32_t value)
{
___OffsetOfInstanceIDInCPlusPlusObject_1 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke
{
intptr_t ___m_CachedPtr_0;
};
// Native definition for COM marshalling of UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com
{
intptr_t ___m_CachedPtr_0;
};
// UnityEngine.Networking.DownloadHandlerBuffer
struct DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D : public DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB
{
public:
public:
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.DownloadHandlerBuffer
struct DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D_marshaled_pinvoke : public DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_pinvoke
{
};
// Native definition for COM marshalling of UnityEngine.Networking.DownloadHandlerBuffer
struct DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D_marshaled_com : public DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_com
{
};
// UnityEngine.Networking.UnityWebRequest
struct UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.Networking.UnityWebRequest::m_Ptr
intptr_t ___m_Ptr_0;
// UnityEngine.Networking.DownloadHandler UnityEngine.Networking.UnityWebRequest::m_DownloadHandler
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * ___m_DownloadHandler_1;
// UnityEngine.Networking.UploadHandler UnityEngine.Networking.UnityWebRequest::m_UploadHandler
UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * ___m_UploadHandler_2;
// UnityEngine.Networking.CertificateHandler UnityEngine.Networking.UnityWebRequest::m_CertificateHandler
CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E * ___m_CertificateHandler_3;
// System.Uri UnityEngine.Networking.UnityWebRequest::m_Uri
Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612 * ___m_Uri_4;
// System.Boolean UnityEngine.Networking.UnityWebRequest::<disposeCertificateHandlerOnDispose>k__BackingField
bool ___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5;
// System.Boolean UnityEngine.Networking.UnityWebRequest::<disposeDownloadHandlerOnDispose>k__BackingField
bool ___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6;
// System.Boolean UnityEngine.Networking.UnityWebRequest::<disposeUploadHandlerOnDispose>k__BackingField
bool ___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7;
public:
inline static int32_t get_offset_of_m_Ptr_0() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___m_Ptr_0)); }
inline intptr_t get_m_Ptr_0() const { return ___m_Ptr_0; }
inline intptr_t* get_address_of_m_Ptr_0() { return &___m_Ptr_0; }
inline void set_m_Ptr_0(intptr_t value)
{
___m_Ptr_0 = value;
}
inline static int32_t get_offset_of_m_DownloadHandler_1() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___m_DownloadHandler_1)); }
inline DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * get_m_DownloadHandler_1() const { return ___m_DownloadHandler_1; }
inline DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB ** get_address_of_m_DownloadHandler_1() { return &___m_DownloadHandler_1; }
inline void set_m_DownloadHandler_1(DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * value)
{
___m_DownloadHandler_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_DownloadHandler_1), (void*)value);
}
inline static int32_t get_offset_of_m_UploadHandler_2() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___m_UploadHandler_2)); }
inline UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * get_m_UploadHandler_2() const { return ___m_UploadHandler_2; }
inline UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA ** get_address_of_m_UploadHandler_2() { return &___m_UploadHandler_2; }
inline void set_m_UploadHandler_2(UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * value)
{
___m_UploadHandler_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_UploadHandler_2), (void*)value);
}
inline static int32_t get_offset_of_m_CertificateHandler_3() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___m_CertificateHandler_3)); }
inline CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E * get_m_CertificateHandler_3() const { return ___m_CertificateHandler_3; }
inline CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E ** get_address_of_m_CertificateHandler_3() { return &___m_CertificateHandler_3; }
inline void set_m_CertificateHandler_3(CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E * value)
{
___m_CertificateHandler_3 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_CertificateHandler_3), (void*)value);
}
inline static int32_t get_offset_of_m_Uri_4() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___m_Uri_4)); }
inline Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612 * get_m_Uri_4() const { return ___m_Uri_4; }
inline Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612 ** get_address_of_m_Uri_4() { return &___m_Uri_4; }
inline void set_m_Uri_4(Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612 * value)
{
___m_Uri_4 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_Uri_4), (void*)value);
}
inline static int32_t get_offset_of_U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5)); }
inline bool get_U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5() const { return ___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5; }
inline bool* get_address_of_U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5() { return &___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5; }
inline void set_U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5(bool value)
{
___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5 = value;
}
inline static int32_t get_offset_of_U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6)); }
inline bool get_U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6() const { return ___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6; }
inline bool* get_address_of_U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6() { return &___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6; }
inline void set_U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6(bool value)
{
___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6 = value;
}
inline static int32_t get_offset_of_U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7() { return static_cast<int32_t>(offsetof(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E, ___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7)); }
inline bool get_U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7() const { return ___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7; }
inline bool* get_address_of_U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7() { return &___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7; }
inline void set_U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7(bool value)
{
___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.UnityWebRequest
struct UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_marshaled_pinvoke
{
intptr_t ___m_Ptr_0;
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_pinvoke ___m_DownloadHandler_1;
UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_pinvoke ___m_UploadHandler_2;
CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E_marshaled_pinvoke ___m_CertificateHandler_3;
Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612 * ___m_Uri_4;
int32_t ___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5;
int32_t ___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6;
int32_t ___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7;
};
// Native definition for COM marshalling of UnityEngine.Networking.UnityWebRequest
struct UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_marshaled_com
{
intptr_t ___m_Ptr_0;
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB_marshaled_com* ___m_DownloadHandler_1;
UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_com* ___m_UploadHandler_2;
CertificateHandler_tDA66C86D1302CE4266DBB078361F7A363C7B005E_marshaled_com* ___m_CertificateHandler_3;
Uri_t4A915E1CC15B2C650F478099AD448E9466CBF612 * ___m_Uri_4;
int32_t ___U3CdisposeCertificateHandlerOnDisposeU3Ek__BackingField_5;
int32_t ___U3CdisposeDownloadHandlerOnDisposeU3Ek__BackingField_6;
int32_t ___U3CdisposeUploadHandlerOnDisposeU3Ek__BackingField_7;
};
// UnityEngine.Networking.UnityWebRequestAsyncOperation
struct UnityWebRequestAsyncOperation_tDCAC6B6C7D51563F8DFD4963E3BE362470125396 : public AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86
{
public:
// UnityEngine.Networking.UnityWebRequest UnityEngine.Networking.UnityWebRequestAsyncOperation::<webRequest>k__BackingField
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * ___U3CwebRequestU3Ek__BackingField_2;
public:
inline static int32_t get_offset_of_U3CwebRequestU3Ek__BackingField_2() { return static_cast<int32_t>(offsetof(UnityWebRequestAsyncOperation_tDCAC6B6C7D51563F8DFD4963E3BE362470125396, ___U3CwebRequestU3Ek__BackingField_2)); }
inline UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * get_U3CwebRequestU3Ek__BackingField_2() const { return ___U3CwebRequestU3Ek__BackingField_2; }
inline UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E ** get_address_of_U3CwebRequestU3Ek__BackingField_2() { return &___U3CwebRequestU3Ek__BackingField_2; }
inline void set_U3CwebRequestU3Ek__BackingField_2(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * value)
{
___U3CwebRequestU3Ek__BackingField_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___U3CwebRequestU3Ek__BackingField_2), (void*)value);
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.UnityWebRequestAsyncOperation
struct UnityWebRequestAsyncOperation_tDCAC6B6C7D51563F8DFD4963E3BE362470125396_marshaled_pinvoke : public AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86_marshaled_pinvoke
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_marshaled_pinvoke* ___U3CwebRequestU3Ek__BackingField_2;
};
// Native definition for COM marshalling of UnityEngine.Networking.UnityWebRequestAsyncOperation
struct UnityWebRequestAsyncOperation_tDCAC6B6C7D51563F8DFD4963E3BE362470125396_marshaled_com : public AsyncOperation_tB6913CEC83169F22E96067CE8C7117A221E51A86_marshaled_com
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_marshaled_com* ___U3CwebRequestU3Ek__BackingField_2;
};
// UnityEngine.Networking.UploadHandlerRaw
struct UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669 : public UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA
{
public:
public:
};
// Native definition for P/Invoke marshalling of UnityEngine.Networking.UploadHandlerRaw
struct UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669_marshaled_pinvoke : public UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_pinvoke
{
};
// Native definition for COM marshalling of UnityEngine.Networking.UploadHandlerRaw
struct UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669_marshaled_com : public UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA_marshaled_com
{
};
// UnityEngine.Texture
struct Texture_t9FE0218A1EEDF266E8C85879FE123265CACC95AE : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A
{
public:
public:
};
struct Texture_t9FE0218A1EEDF266E8C85879FE123265CACC95AE_StaticFields
{
public:
// System.Int32 UnityEngine.Texture::GenerateAllMips
int32_t ___GenerateAllMips_4;
public:
inline static int32_t get_offset_of_GenerateAllMips_4() { return static_cast<int32_t>(offsetof(Texture_t9FE0218A1EEDF266E8C85879FE123265CACC95AE_StaticFields, ___GenerateAllMips_4)); }
inline int32_t get_GenerateAllMips_4() const { return ___GenerateAllMips_4; }
inline int32_t* get_address_of_GenerateAllMips_4() { return &___GenerateAllMips_4; }
inline void set_GenerateAllMips_4(int32_t value)
{
___GenerateAllMips_4 = value;
}
};
// UnityEngine.Texture2D
struct Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF : public Texture_t9FE0218A1EEDF266E8C85879FE123265CACC95AE
{
public:
public:
};
#ifdef __clang__
#pragma clang diagnostic pop
#endif
// System.Byte[]
struct ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726 : public RuntimeArray
{
public:
ALIGN_FIELD (8) uint8_t m_Items[1];
public:
inline uint8_t GetAt(il2cpp_array_size_t index) const
{
IL2CPP_ARRAY_BOUNDS_CHECK(index, (uint32_t)(this)->max_length);
return m_Items[index];
}
inline uint8_t* GetAddressAt(il2cpp_array_size_t index)
{
IL2CPP_ARRAY_BOUNDS_CHECK(index, (uint32_t)(this)->max_length);
return m_Items + index;
}
inline void SetAt(il2cpp_array_size_t index, uint8_t value)
{
IL2CPP_ARRAY_BOUNDS_CHECK(index, (uint32_t)(this)->max_length);
m_Items[index] = value;
}
inline uint8_t GetAtUnchecked(il2cpp_array_size_t index) const
{
return m_Items[index];
}
inline uint8_t* GetAddressAtUnchecked(il2cpp_array_size_t index)
{
return m_Items + index;
}
inline void SetAtUnchecked(il2cpp_array_size_t index, uint8_t value)
{
m_Items[index] = value;
}
};
// System.Collections.Generic.Dictionary`2/Enumerator<!0,!1> System.Collections.Generic.Dictionary`2<System.Object,System.Object>::GetEnumerator()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0 Dictionary_2_GetEnumerator_mA44BBB15DFBD8E08B5E60E23AA5044D45C3F889F_gshared (Dictionary_2_tBD1E3221EBD04CEBDA49B84779912E91F56B958D * __this, const RuntimeMethod* method);
// System.Collections.Generic.KeyValuePair`2<!0,!1> System.Collections.Generic.Dictionary`2/Enumerator<System.Object,System.Object>::get_Current()
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 Enumerator_get_Current_m17E1C36ECBB09CC2AB892710866F8655D83A6048_gshared_inline (Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0 * __this, const RuntimeMethod* method);
// !0 System.Collections.Generic.KeyValuePair`2<System.Object,System.Object>::get_Key()
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR RuntimeObject * KeyValuePair_2_get_Key_mCAD7B121DB998D7C56EB0281215A860EFE9DCD95_gshared_inline (KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 * __this, const RuntimeMethod* method);
// !1 System.Collections.Generic.KeyValuePair`2<System.Object,System.Object>::get_Value()
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR RuntimeObject * KeyValuePair_2_get_Value_m622223593F7461E7812C581DDB145270016ED303_gshared_inline (KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 * __this, const RuntimeMethod* method);
// System.Boolean System.Collections.Generic.Dictionary`2/Enumerator<System.Object,System.Object>::MoveNext()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool Enumerator_MoveNext_mCAD84084129516BD41DE5CC3E1FABA5A8DF836D0_gshared (Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0 * __this, const RuntimeMethod* method);
// System.Void System.Collections.Generic.Dictionary`2/Enumerator<System.Object,System.Object>::Dispose()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Enumerator_Dispose_m85CA135BAB22C9F0C87C84AB90FF6740D1859279_gshared (Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0 * __this, const RuntimeMethod* method);
// System.Void UnityEngine.CustomYieldInstruction::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void CustomYieldInstruction__ctor_m01929E3EEB78B751510038B32D889061960DA1BE (CustomYieldInstruction_t4ED1543FBAA3143362854EB1867B42E5D190A5C7 * __this, const RuntimeMethod* method);
// UnityEngine.Networking.UnityWebRequest UnityEngine.Networking.UnityWebRequest::Post(System.String,UnityEngine.WWWForm)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * UnityWebRequest_Post_m5F29B83B6FEDEAEAAC938DD26AE484A2750DB646 (String_t* ___uri0, WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB * ___formData1, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UnityWebRequest::set_chunkedTransfer(System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UnityWebRequest_set_chunkedTransfer_mA743E172FDB5D5892DD6D3AA6836B66CD6233B5B (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, bool ___value0, const RuntimeMethod* method);
// UnityEngine.Networking.UnityWebRequestAsyncOperation UnityEngine.Networking.UnityWebRequest::SendWebRequest()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR UnityWebRequestAsyncOperation_tDCAC6B6C7D51563F8DFD4963E3BE362470125396 * UnityWebRequest_SendWebRequest_m990921023F56ECB8FF8C118894A317EB6E2F5B50 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UnityWebRequest::.ctor(System.String,System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UnityWebRequest__ctor_mC2ED369A4ACE53AFF2E70A38BE95EB48D68D4975 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, String_t* ___url0, String_t* ___method1, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UploadHandlerRaw::.ctor(System.Byte[])
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UploadHandlerRaw__ctor_mB46261D7AA64B605D5CA8FF9027A4A32E57A7BD9 (UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669 * __this, ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* ___data0, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UploadHandler::set_contentType(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UploadHandler_set_contentType_mAECD24AB554541300BD126E01C65329F0A29A328 (UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * __this, String_t* ___value0, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UnityWebRequest::set_uploadHandler(UnityEngine.Networking.UploadHandler)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UnityWebRequest_set_uploadHandler_m8D5DF24FBE7F8F0DCF27E11CE3C6CF4363DF23BA (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * ___value0, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.DownloadHandlerBuffer::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void DownloadHandlerBuffer__ctor_m01FD35970E4B4FC45FC99A648408F53A8B164774 (DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D * __this, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UnityWebRequest::set_downloadHandler(UnityEngine.Networking.DownloadHandler)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UnityWebRequest_set_downloadHandler_m7496D2C5F755BEB68651A4F33EA9BDA319D092C2 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * ___value0, const RuntimeMethod* method);
// System.Collections.Generic.Dictionary`2/Enumerator<!0,!1> System.Collections.Generic.Dictionary`2<System.String,System.String>::GetEnumerator()
inline Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB Dictionary_2_GetEnumerator_m8C0A038B5FA7E62DEF4DB9EF1F5FCC4348D785C5 (Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 * __this, const RuntimeMethod* method)
{
return (( Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB (*) (Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 *, const RuntimeMethod*))Dictionary_2_GetEnumerator_mA44BBB15DFBD8E08B5E60E23AA5044D45C3F889F_gshared)(__this, method);
}
// System.Collections.Generic.KeyValuePair`2<!0,!1> System.Collections.Generic.Dictionary`2/Enumerator<System.String,System.String>::get_Current()
inline KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC Enumerator_get_Current_m45394A0B01FA26CB32851562F9CBF27DB35FF4DD_inline (Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB * __this, const RuntimeMethod* method)
{
return (( KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC (*) (Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB *, const RuntimeMethod*))Enumerator_get_Current_m17E1C36ECBB09CC2AB892710866F8655D83A6048_gshared_inline)(__this, method);
}
// !0 System.Collections.Generic.KeyValuePair`2<System.String,System.String>::get_Key()
inline String_t* KeyValuePair_2_get_Key_m42802FFFC275E928911F87B16DFE504319DF58F1_inline (KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC * __this, const RuntimeMethod* method)
{
return (( String_t* (*) (KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC *, const RuntimeMethod*))KeyValuePair_2_get_Key_mCAD7B121DB998D7C56EB0281215A860EFE9DCD95_gshared_inline)(__this, method);
}
// !1 System.Collections.Generic.KeyValuePair`2<System.String,System.String>::get_Value()
inline String_t* KeyValuePair_2_get_Value_mB6B24D3920A4744624F8ED9AE493783D0E5F81DD_inline (KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC * __this, const RuntimeMethod* method)
{
return (( String_t* (*) (KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC *, const RuntimeMethod*))KeyValuePair_2_get_Value_m622223593F7461E7812C581DDB145270016ED303_gshared_inline)(__this, method);
}
// System.Void UnityEngine.Networking.UnityWebRequest::SetRequestHeader(System.String,System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UnityWebRequest_SetRequestHeader_m5ED4EFBACC106390DF5D81D19E4D4D9D59F13EFB (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, String_t* ___name0, String_t* ___value1, const RuntimeMethod* method);
// System.Boolean System.Collections.Generic.Dictionary`2/Enumerator<System.String,System.String>::MoveNext()
inline bool Enumerator_MoveNext_mA57D4325DBD9D10EB3E43C99CC18DB6C3CE85FC8 (Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB * __this, const RuntimeMethod* method)
{
return (( bool (*) (Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB *, const RuntimeMethod*))Enumerator_MoveNext_mCAD84084129516BD41DE5CC3E1FABA5A8DF836D0_gshared)(__this, method);
}
// System.Void System.Collections.Generic.Dictionary`2/Enumerator<System.String,System.String>::Dispose()
inline void Enumerator_Dispose_m76E867298698AA2B89F9D57E21CEFCD16B372D22 (Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB * __this, const RuntimeMethod* method)
{
(( void (*) (Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB *, const RuntimeMethod*))Enumerator_Dispose_m85CA135BAB22C9F0C87C84AB90FF6740D1859279_gshared)(__this, method);
}
// System.Boolean UnityEngine.Networking.UnityWebRequest::get_isDone()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool UnityWebRequest_get_isDone_mF8C92D10767B80877BCFE6D119CBE9090ACCDFBD (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// UnityEngine.Networking.UnityWebRequest/Result UnityEngine.Networking.UnityWebRequest::get_result()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR int32_t UnityWebRequest_get_result_m4E9272AB25BD5CE7B927F4B1873763510476BDC6 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.String UnityEngine.Networking.UnityWebRequest::get_error()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* UnityWebRequest_get_error_m32B69D2365C1FE2310B5936C7C295B71A92CC2B4 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.Int64 UnityEngine.Networking.UnityWebRequest::get_responseCode()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR int64_t UnityWebRequest_get_responseCode_m27D1260ADC92070608532D81B836CAA2742D1753 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.String UnityEngine.Networking.UnityWebRequest::GetHTTPStatusString(System.Int64)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* UnityWebRequest_GetHTTPStatusString_m317BB359DAAE3592F55F8C989FC076FEA76BC7C0 (int64_t ___responseCode0, const RuntimeMethod* method);
// System.String System.String::Format(System.String,System.Object,System.Object)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* String_Format_m8D1CB0410C35E052A53AE957C914C841E54BAB66 (String_t* ___format0, RuntimeObject * ___arg01, RuntimeObject * ___arg12, const RuntimeMethod* method);
// System.Boolean UnityEngine.WWW::WaitUntilDoneIfPossible()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool WWW_WaitUntilDoneIfPossible_m8D6B638F661CBD13B442F392BF42F5C9BDF0E84D (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method);
// UnityEngine.Networking.DownloadHandler UnityEngine.Networking.UnityWebRequest::get_downloadHandler()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * UnityWebRequest_get_downloadHandler_mCE0A0C53A63419FE5AE25915AFB36EABE294C732 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.String UnityEngine.Networking.DownloadHandler::get_text()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* DownloadHandler_get_text_mD89D7125640800A8F5C4B9401C080C405953828A (DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * __this, const RuntimeMethod* method);
// System.Void UnityEngine.Texture2D::.ctor(System.Int32,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Texture2D__ctor_m7D64AB4C55A01F2EE57483FD9EF826607DF9E4B4 (Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * __this, int32_t ___width0, int32_t ___height1, const RuntimeMethod* method);
// System.Byte[] UnityEngine.Networking.DownloadHandler::get_data()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* DownloadHandler_get_data_m3AE551AAE6BF21279435D386E76EA7084CC037D3 (DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.ImageConversion::LoadImage(UnityEngine.Texture2D,System.Byte[],System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool ImageConversion_LoadImage_m1E5C9BF6206ED40B23CDB28341B8A64E05C43683 (Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * ___tex0, ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* ___data1, bool ___markNonReadable2, const RuntimeMethod* method);
// UnityEngine.Texture2D UnityEngine.WWW::CreateTextureFromDownloadedData(System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * WWW_CreateTextureFromDownloadedData_m978F4A746B24EEA580E7AA8F1F05203196A299F9 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, bool ___markNonReadable0, const RuntimeMethod* method);
// System.String UnityEngine.Networking.UnityWebRequest::get_url()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* UnityWebRequest_get_url_m802F6A7942362F28F2D856F17B2BDF8C2561734E (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.Void UnityEngine.Networking.UnityWebRequest::Dispose()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void UnityWebRequest_Dispose_m8032472F6BC2EC4FEE017DE7E4C440078BC4E1C8 (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * __this, const RuntimeMethod* method);
// System.String UnityEngine.WWW::get_url()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* WWW_get_url_m1D75D492D78A7AA8F607C5D7700497B8FE5E9526 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method);
// System.Boolean System.String::StartsWith(System.String,System.StringComparison)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool String_StartsWith_mEA750A0572C706249CDD826681741B7DD733381E (String_t* __this, String_t* ___value0, int32_t ___comparisonType1, const RuntimeMethod* method);
// System.Void UnityEngine.Debug::LogError(System.Object)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Debug_LogError_m8850D65592770A364D494025FF3A73E8D4D70485 (RuntimeObject * ___message0, const RuntimeMethod* method);
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.WWW::.ctor(System.String,UnityEngine.WWWForm)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void WWW__ctor_m2F58987EB716A6D1B9B2425464E5C42FB6CF7DE6 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, String_t* ___url0, WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB * ___form1, const RuntimeMethod* method)
{
{
CustomYieldInstruction__ctor_m01929E3EEB78B751510038B32D889061960DA1BE(__this, /*hidden argument*/NULL);
String_t* L_0 = ___url0;
WWWForm_t078274293DA1BDA9AB5689AF8BCBF0EE17A2BABB * L_1 = ___form1;
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_2 = UnityWebRequest_Post_m5F29B83B6FEDEAEAAC938DD26AE484A2750DB646(L_0, L_1, /*hidden argument*/NULL);
__this->set__uwr_0(L_2);
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_3 = __this->get__uwr_0();
NullCheck(L_3);
UnityWebRequest_set_chunkedTransfer_mA743E172FDB5D5892DD6D3AA6836B66CD6233B5B(L_3, (bool)0, /*hidden argument*/NULL);
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_4 = __this->get__uwr_0();
NullCheck(L_4);
UnityWebRequest_SendWebRequest_m990921023F56ECB8FF8C118894A317EB6E2F5B50(L_4, /*hidden argument*/NULL);
return;
}
}
// System.Void UnityEngine.WWW::.ctor(System.String,System.Byte[],System.Collections.Generic.Dictionary`2<System.String,System.String>)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void WWW__ctor_m6686CBC878BB9EB28F4C4171C203CA4E3DE3656C (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, String_t* ___url0, ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* ___postData1, Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 * ___headers2, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (WWW__ctor_m6686CBC878BB9EB28F4C4171C203CA4E3DE3656C_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
String_t* V_0 = NULL;
UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * V_1 = NULL;
Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB V_2;
memset((&V_2), 0, sizeof(V_2));
KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC V_3;
memset((&V_3), 0, sizeof(V_3));
Exception_t * __last_unhandled_exception = 0;
NO_UNUSED_WARNING (__last_unhandled_exception);
Exception_t * __exception_local = 0;
NO_UNUSED_WARNING (__exception_local);
void* __leave_targets_storage = alloca(sizeof(int32_t) * 1);
il2cpp::utils::LeaveTargetStack __leave_targets(__leave_targets_storage);
NO_UNUSED_WARNING (__leave_targets);
String_t* G_B3_0 = NULL;
{
CustomYieldInstruction__ctor_m01929E3EEB78B751510038B32D889061960DA1BE(__this, /*hidden argument*/NULL);
ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* L_0 = ___postData1;
if (!L_0)
{
goto IL_0012;
}
}
{
G_B3_0 = _stringLiteral14E338D17C42E552FA7AF42CDAE40CA1F0E8A04D;
goto IL_0017;
}
IL_0012:
{
G_B3_0 = _stringLiteral3781CFEEF925855A4B7284E1783A7D715A6333F6;
}
IL_0017:
{
V_0 = G_B3_0;
String_t* L_1 = ___url0;
String_t* L_2 = V_0;
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_3 = (UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E *)il2cpp_codegen_object_new(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E_il2cpp_TypeInfo_var);
UnityWebRequest__ctor_mC2ED369A4ACE53AFF2E70A38BE95EB48D68D4975(L_3, L_1, L_2, /*hidden argument*/NULL);
__this->set__uwr_0(L_3);
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_4 = __this->get__uwr_0();
NullCheck(L_4);
UnityWebRequest_set_chunkedTransfer_mA743E172FDB5D5892DD6D3AA6836B66CD6233B5B(L_4, (bool)0, /*hidden argument*/NULL);
ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* L_5 = ___postData1;
UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669 * L_6 = (UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669 *)il2cpp_codegen_object_new(UploadHandlerRaw_t398466F5905D0829DE2807D531A2419DA8B61669_il2cpp_TypeInfo_var);
UploadHandlerRaw__ctor_mB46261D7AA64B605D5CA8FF9027A4A32E57A7BD9(L_6, L_5, /*hidden argument*/NULL);
V_1 = L_6;
UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * L_7 = V_1;
NullCheck(L_7);
UploadHandler_set_contentType_mAECD24AB554541300BD126E01C65329F0A29A328(L_7, _stringLiteral14B6DF3349D302FD20ED0B3BD448C2045066E9BE, /*hidden argument*/NULL);
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_8 = __this->get__uwr_0();
UploadHandler_t5F80A2A6874D4D330751BE3524009C21C9B74BDA * L_9 = V_1;
NullCheck(L_8);
UnityWebRequest_set_uploadHandler_m8D5DF24FBE7F8F0DCF27E11CE3C6CF4363DF23BA(L_8, L_9, /*hidden argument*/NULL);
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_10 = __this->get__uwr_0();
DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D * L_11 = (DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D *)il2cpp_codegen_object_new(DownloadHandlerBuffer_t74D11E891308B7FD5255C8D0D876AD0DBF512B6D_il2cpp_TypeInfo_var);
DownloadHandlerBuffer__ctor_m01FD35970E4B4FC45FC99A648408F53A8B164774(L_11, /*hidden argument*/NULL);
NullCheck(L_10);
UnityWebRequest_set_downloadHandler_m7496D2C5F755BEB68651A4F33EA9BDA319D092C2(L_10, L_11, /*hidden argument*/NULL);
Dictionary_2_tDE3227CA5E7A32F5070BD24C69F42204A3ADE9D5 * L_12 = ___headers2;
NullCheck(L_12);
Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB L_13 = Dictionary_2_GetEnumerator_m8C0A038B5FA7E62DEF4DB9EF1F5FCC4348D785C5(L_12, /*hidden argument*/Dictionary_2_GetEnumerator_m8C0A038B5FA7E62DEF4DB9EF1F5FCC4348D785C5_RuntimeMethod_var);
V_2 = L_13;
}
IL_006b:
try
{ // begin try (depth: 1)
{
goto IL_008f;
}
IL_006d:
{
KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC L_14 = Enumerator_get_Current_m45394A0B01FA26CB32851562F9CBF27DB35FF4DD_inline((Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB *)(&V_2), /*hidden argument*/Enumerator_get_Current_m45394A0B01FA26CB32851562F9CBF27DB35FF4DD_RuntimeMethod_var);
V_3 = L_14;
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_15 = __this->get__uwr_0();
String_t* L_16 = KeyValuePair_2_get_Key_m42802FFFC275E928911F87B16DFE504319DF58F1_inline((KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC *)(&V_3), /*hidden argument*/KeyValuePair_2_get_Key_m42802FFFC275E928911F87B16DFE504319DF58F1_RuntimeMethod_var);
String_t* L_17 = KeyValuePair_2_get_Value_mB6B24D3920A4744624F8ED9AE493783D0E5F81DD_inline((KeyValuePair_2_tE863694F1DB1F441CAE5A282829BDB941B2DEEBC *)(&V_3), /*hidden argument*/KeyValuePair_2_get_Value_mB6B24D3920A4744624F8ED9AE493783D0E5F81DD_RuntimeMethod_var);
NullCheck(L_15);
UnityWebRequest_SetRequestHeader_m5ED4EFBACC106390DF5D81D19E4D4D9D59F13EFB(L_15, L_16, L_17, /*hidden argument*/NULL);
}
IL_008f:
{
bool L_18 = Enumerator_MoveNext_mA57D4325DBD9D10EB3E43C99CC18DB6C3CE85FC8((Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB *)(&V_2), /*hidden argument*/Enumerator_MoveNext_mA57D4325DBD9D10EB3E43C99CC18DB6C3CE85FC8_RuntimeMethod_var);
if (L_18)
{
goto IL_006d;
}
}
IL_0098:
{
IL2CPP_LEAVE(0xA9, FINALLY_009a);
}
} // end try (depth: 1)
catch(Il2CppExceptionWrapper& e)
{
__last_unhandled_exception = (Exception_t *)e.ex;
goto FINALLY_009a;
}
FINALLY_009a:
{ // begin finally (depth: 1)
Enumerator_Dispose_m76E867298698AA2B89F9D57E21CEFCD16B372D22((Enumerator_tEDF5E503528903FB9B9A1D645C82789D7B8006CB *)(&V_2), /*hidden argument*/Enumerator_Dispose_m76E867298698AA2B89F9D57E21CEFCD16B372D22_RuntimeMethod_var);
IL2CPP_END_FINALLY(154)
} // end finally (depth: 1)
IL2CPP_CLEANUP(154)
{
IL2CPP_JUMP_TBL(0xA9, IL_00a9)
IL2CPP_RETHROW_IF_UNHANDLED(Exception_t *)
}
IL_00a9:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_19 = __this->get__uwr_0();
NullCheck(L_19);
UnityWebRequest_SendWebRequest_m990921023F56ECB8FF8C118894A317EB6E2F5B50(L_19, /*hidden argument*/NULL);
return;
}
}
// System.String UnityEngine.WWW::get_error()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* WWW_get_error_mB278F5EC90EF99FEF70D80112940CFB49E79C9BC (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (WWW_get_error_mB278F5EC90EF99FEF70D80112940CFB49E79C9BC_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
String_t* V_1 = NULL;
bool V_2 = false;
bool V_3 = false;
String_t* V_4 = NULL;
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_0 = __this->get__uwr_0();
NullCheck(L_0);
bool L_1 = UnityWebRequest_get_isDone_mF8C92D10767B80877BCFE6D119CBE9090ACCDFBD(L_0, /*hidden argument*/NULL);
V_0 = (bool)((((int32_t)L_1) == ((int32_t)0))? 1 : 0);
bool L_2 = V_0;
if (!L_2)
{
goto IL_0017;
}
}
{
V_1 = (String_t*)NULL;
goto IL_0087;
}
IL_0017:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_3 = __this->get__uwr_0();
NullCheck(L_3);
int32_t L_4 = UnityWebRequest_get_result_m4E9272AB25BD5CE7B927F4B1873763510476BDC6(L_3, /*hidden argument*/NULL);
V_2 = (bool)((((int32_t)L_4) == ((int32_t)2))? 1 : 0);
bool L_5 = V_2;
if (!L_5)
{
goto IL_0037;
}
}
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_6 = __this->get__uwr_0();
NullCheck(L_6);
String_t* L_7 = UnityWebRequest_get_error_m32B69D2365C1FE2310B5936C7C295B71A92CC2B4(L_6, /*hidden argument*/NULL);
V_1 = L_7;
goto IL_0087;
}
IL_0037:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_8 = __this->get__uwr_0();
NullCheck(L_8);
int64_t L_9 = UnityWebRequest_get_responseCode_m27D1260ADC92070608532D81B836CAA2742D1753(L_8, /*hidden argument*/NULL);
V_3 = (bool)((((int32_t)((((int64_t)L_9) < ((int64_t)(((int64_t)((int64_t)((int32_t)400))))))? 1 : 0)) == ((int32_t)0))? 1 : 0);
bool L_10 = V_3;
if (!L_10)
{
goto IL_0083;
}
}
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_11 = __this->get__uwr_0();
NullCheck(L_11);
int64_t L_12 = UnityWebRequest_get_responseCode_m27D1260ADC92070608532D81B836CAA2742D1753(L_11, /*hidden argument*/NULL);
String_t* L_13 = UnityWebRequest_GetHTTPStatusString_m317BB359DAAE3592F55F8C989FC076FEA76BC7C0(L_12, /*hidden argument*/NULL);
V_4 = L_13;
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_14 = __this->get__uwr_0();
NullCheck(L_14);
int64_t L_15 = UnityWebRequest_get_responseCode_m27D1260ADC92070608532D81B836CAA2742D1753(L_14, /*hidden argument*/NULL);
int64_t L_16 = L_15;
RuntimeObject * L_17 = Box(Int64_t378EE0D608BD3107E77238E85F30D2BBD46981F3_il2cpp_TypeInfo_var, &L_16);
String_t* L_18 = V_4;
String_t* L_19 = String_Format_m8D1CB0410C35E052A53AE957C914C841E54BAB66(_stringLiteral8E752B76D455A50FE476984D4B09A7CDBF2A753E, L_17, L_18, /*hidden argument*/NULL);
V_1 = L_19;
goto IL_0087;
}
IL_0083:
{
V_1 = (String_t*)NULL;
goto IL_0087;
}
IL_0087:
{
String_t* L_20 = V_1;
return L_20;
}
}
// System.String UnityEngine.WWW::get_text()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* WWW_get_text_m0D2EF7BBFB58E37FE30A665389355ACA65804138 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (WWW_get_text_m0D2EF7BBFB58E37FE30A665389355ACA65804138_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * V_0 = NULL;
bool V_1 = false;
String_t* V_2 = NULL;
bool V_3 = false;
bool V_4 = false;
{
bool L_0 = WWW_WaitUntilDoneIfPossible_m8D6B638F661CBD13B442F392BF42F5C9BDF0E84D(__this, /*hidden argument*/NULL);
V_1 = (bool)((((int32_t)L_0) == ((int32_t)0))? 1 : 0);
bool L_1 = V_1;
if (!L_1)
{
goto IL_0016;
}
}
{
V_2 = _stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709;
goto IL_0057;
}
IL_0016:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_2 = __this->get__uwr_0();
NullCheck(L_2);
int32_t L_3 = UnityWebRequest_get_result_m4E9272AB25BD5CE7B927F4B1873763510476BDC6(L_2, /*hidden argument*/NULL);
V_3 = (bool)((((int32_t)L_3) == ((int32_t)2))? 1 : 0);
bool L_4 = V_3;
if (!L_4)
{
goto IL_0030;
}
}
{
V_2 = _stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709;
goto IL_0057;
}
IL_0030:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_5 = __this->get__uwr_0();
NullCheck(L_5);
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * L_6 = UnityWebRequest_get_downloadHandler_mCE0A0C53A63419FE5AE25915AFB36EABE294C732(L_5, /*hidden argument*/NULL);
V_0 = L_6;
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * L_7 = V_0;
V_4 = (bool)((((RuntimeObject*)(DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB *)L_7) == ((RuntimeObject*)(RuntimeObject *)NULL))? 1 : 0);
bool L_8 = V_4;
if (!L_8)
{
goto IL_004e;
}
}
{
V_2 = _stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709;
goto IL_0057;
}
IL_004e:
{
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * L_9 = V_0;
NullCheck(L_9);
String_t* L_10 = DownloadHandler_get_text_mD89D7125640800A8F5C4B9401C080C405953828A(L_9, /*hidden argument*/NULL);
V_2 = L_10;
goto IL_0057;
}
IL_0057:
{
String_t* L_11 = V_2;
return L_11;
}
}
// UnityEngine.Texture2D UnityEngine.WWW::CreateTextureFromDownloadedData(System.Boolean)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * WWW_CreateTextureFromDownloadedData_m978F4A746B24EEA580E7AA8F1F05203196A299F9 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, bool ___markNonReadable0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (WWW_CreateTextureFromDownloadedData_m978F4A746B24EEA580E7AA8F1F05203196A299F9_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * V_0 = NULL;
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * V_1 = NULL;
bool V_2 = false;
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * V_3 = NULL;
bool V_4 = false;
bool V_5 = false;
{
bool L_0 = WWW_WaitUntilDoneIfPossible_m8D6B638F661CBD13B442F392BF42F5C9BDF0E84D(__this, /*hidden argument*/NULL);
V_2 = (bool)((((int32_t)L_0) == ((int32_t)0))? 1 : 0);
bool L_1 = V_2;
if (!L_1)
{
goto IL_0018;
}
}
{
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_2 = (Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF *)il2cpp_codegen_object_new(Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF_il2cpp_TypeInfo_var);
Texture2D__ctor_m7D64AB4C55A01F2EE57483FD9EF826607DF9E4B4(L_2, 2, 2, /*hidden argument*/NULL);
V_3 = L_2;
goto IL_0064;
}
IL_0018:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_3 = __this->get__uwr_0();
NullCheck(L_3);
int32_t L_4 = UnityWebRequest_get_result_m4E9272AB25BD5CE7B927F4B1873763510476BDC6(L_3, /*hidden argument*/NULL);
V_4 = (bool)((((int32_t)L_4) == ((int32_t)2))? 1 : 0);
bool L_5 = V_4;
if (!L_5)
{
goto IL_0030;
}
}
{
V_3 = (Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF *)NULL;
goto IL_0064;
}
IL_0030:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_6 = __this->get__uwr_0();
NullCheck(L_6);
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * L_7 = UnityWebRequest_get_downloadHandler_mCE0A0C53A63419FE5AE25915AFB36EABE294C732(L_6, /*hidden argument*/NULL);
V_0 = L_7;
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * L_8 = V_0;
V_5 = (bool)((((RuntimeObject*)(DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB *)L_8) == ((RuntimeObject*)(RuntimeObject *)NULL))? 1 : 0);
bool L_9 = V_5;
if (!L_9)
{
goto IL_004a;
}
}
{
V_3 = (Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF *)NULL;
goto IL_0064;
}
IL_004a:
{
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_10 = (Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF *)il2cpp_codegen_object_new(Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF_il2cpp_TypeInfo_var);
Texture2D__ctor_m7D64AB4C55A01F2EE57483FD9EF826607DF9E4B4(L_10, 2, 2, /*hidden argument*/NULL);
V_1 = L_10;
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_11 = V_1;
DownloadHandler_tEEAE0DD53DB497C8A491C4F7B7A14C3CA027B1DB * L_12 = V_0;
NullCheck(L_12);
ByteU5BU5D_tDBBEB0E8362242FA7223000D978B0DD19D4B0726* L_13 = DownloadHandler_get_data_m3AE551AAE6BF21279435D386E76EA7084CC037D3(L_12, /*hidden argument*/NULL);
bool L_14 = ___markNonReadable0;
ImageConversion_LoadImage_m1E5C9BF6206ED40B23CDB28341B8A64E05C43683(L_11, L_13, L_14, /*hidden argument*/NULL);
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_15 = V_1;
V_3 = L_15;
goto IL_0064;
}
IL_0064:
{
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_16 = V_3;
return L_16;
}
}
// UnityEngine.Texture2D UnityEngine.WWW::get_texture()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * WWW_get_texture_mC23FF88883698F3E6F7BED2733A2DB3B18F788E4 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * V_0 = NULL;
{
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_0 = WWW_CreateTextureFromDownloadedData_m978F4A746B24EEA580E7AA8F1F05203196A299F9(__this, (bool)0, /*hidden argument*/NULL);
V_0 = L_0;
goto IL_000b;
}
IL_000b:
{
Texture2D_t9B604D0D8E28032123641A7E7338FA872E2698BF * L_1 = V_0;
return L_1;
}
}
// System.String UnityEngine.WWW::get_url()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR String_t* WWW_get_url_m1D75D492D78A7AA8F607C5D7700497B8FE5E9526 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
String_t* V_0 = NULL;
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_0 = __this->get__uwr_0();
NullCheck(L_0);
String_t* L_1 = UnityWebRequest_get_url_m802F6A7942362F28F2D856F17B2BDF8C2561734E(L_0, /*hidden argument*/NULL);
V_0 = L_1;
goto IL_000f;
}
IL_000f:
{
String_t* L_2 = V_0;
return L_2;
}
}
// System.Boolean UnityEngine.WWW::get_keepWaiting()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool WWW_get_keepWaiting_m231A6A7A835610182D78FC414665CC75195ABD70 (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
bool V_0 = false;
int32_t G_B3_0 = 0;
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_0 = __this->get__uwr_0();
if (!L_0)
{
goto IL_0019;
}
}
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_1 = __this->get__uwr_0();
NullCheck(L_1);
bool L_2 = UnityWebRequest_get_isDone_mF8C92D10767B80877BCFE6D119CBE9090ACCDFBD(L_1, /*hidden argument*/NULL);
G_B3_0 = ((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
goto IL_001a;
}
IL_0019:
{
G_B3_0 = 0;
}
IL_001a:
{
V_0 = (bool)G_B3_0;
goto IL_001d;
}
IL_001d:
{
bool L_3 = V_0;
return L_3;
}
}
// System.Void UnityEngine.WWW::Dispose()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void WWW_Dispose_mF5A8B944281564903043545BC1E7F1CAD941519F (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
bool V_0 = false;
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_0 = __this->get__uwr_0();
V_0 = (bool)((!(((RuntimeObject*)(UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E *)L_0) <= ((RuntimeObject*)(RuntimeObject *)NULL)))? 1 : 0);
bool L_1 = V_0;
if (!L_1)
{
goto IL_0023;
}
}
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_2 = __this->get__uwr_0();
NullCheck(L_2);
UnityWebRequest_Dispose_m8032472F6BC2EC4FEE017DE7E4C440078BC4E1C8(L_2, /*hidden argument*/NULL);
__this->set__uwr_0((UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E *)NULL);
}
IL_0023:
{
return;
}
}
// System.Boolean UnityEngine.WWW::WaitUntilDoneIfPossible()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool WWW_WaitUntilDoneIfPossible_m8D6B638F661CBD13B442F392BF42F5C9BDF0E84D (WWW_tCC46D6E5A368D4A83A3D6FAFF00B19700C5373E2 * __this, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (WWW_WaitUntilDoneIfPossible_m8D6B638F661CBD13B442F392BF42F5C9BDF0E84D_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
bool V_2 = false;
bool V_3 = false;
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_0 = __this->get__uwr_0();
NullCheck(L_0);
bool L_1 = UnityWebRequest_get_isDone_mF8C92D10767B80877BCFE6D119CBE9090ACCDFBD(L_0, /*hidden argument*/NULL);
V_0 = L_1;
bool L_2 = V_0;
if (!L_2)
{
goto IL_0014;
}
}
{
V_1 = (bool)1;
goto IL_0054;
}
IL_0014:
{
String_t* L_3 = WWW_get_url_m1D75D492D78A7AA8F607C5D7700497B8FE5E9526(__this, /*hidden argument*/NULL);
NullCheck(L_3);
bool L_4 = String_StartsWith_mEA750A0572C706249CDD826681741B7DD733381E(L_3, _stringLiteral218F5A08519088A96BE3C1074984C53EA49F1CCA, 5, /*hidden argument*/NULL);
V_2 = L_4;
bool L_5 = V_2;
if (!L_5)
{
goto IL_0044;
}
}
{
goto IL_002e;
}
IL_002c:
{
}
IL_002e:
{
UnityWebRequest_tB75B39F6951CA0DBA2D5BEDF85FDCAAC6026A37E * L_6 = __this->get__uwr_0();
NullCheck(L_6);
bool L_7 = UnityWebRequest_get_isDone_mF8C92D10767B80877BCFE6D119CBE9090ACCDFBD(L_6, /*hidden argument*/NULL);
V_3 = (bool)((((int32_t)L_7) == ((int32_t)0))? 1 : 0);
bool L_8 = V_3;
if (L_8)
{
goto IL_002c;
}
}
{
V_1 = (bool)1;
goto IL_0054;
}
IL_0044:
{
IL2CPP_RUNTIME_CLASS_INIT(Debug_tEB68BCBEB8EFD60F8043C67146DC05E7F50F374B_il2cpp_TypeInfo_var);
Debug_LogError_m8850D65592770A364D494025FF3A73E8D4D70485(_stringLiteralE2429764F10DC7E990250D2AE4138FE5AC928076, /*hidden argument*/NULL);
V_1 = (bool)0;
goto IL_0054;
}
IL_0054:
{
bool L_9 = V_1;
return L_9;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 Enumerator_get_Current_m17E1C36ECBB09CC2AB892710866F8655D83A6048_gshared_inline (Enumerator_tE4E91EE5578038530CF0C46227953BA787E7A0A0 * __this, const RuntimeMethod* method)
{
{
KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 L_0 = (KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 )__this->get_current_3();
return L_0;
}
}
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR RuntimeObject * KeyValuePair_2_get_Key_mCAD7B121DB998D7C56EB0281215A860EFE9DCD95_gshared_inline (KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 * __this, const RuntimeMethod* method)
{
{
RuntimeObject * L_0 = (RuntimeObject *)__this->get_key_0();
return L_0;
}
}
IL2CPP_MANAGED_FORCE_INLINE IL2CPP_METHOD_ATTR RuntimeObject * KeyValuePair_2_get_Value_m622223593F7461E7812C581DDB145270016ED303_gshared_inline (KeyValuePair_2_tFB6A066C69E28C6ACA5FC5E24D969BFADC5FA625 * __this, const RuntimeMethod* method)
{
{
RuntimeObject * L_0 = (RuntimeObject *)__this->get_value_1();
return L_0;
}
}
| 47.875508 | 334 | 0.843514 | OgiJr |
a3515a565993e1f29cd5faf45971285db135672d | 2,080 | cpp | C++ | src/StepLibrary/MockMessageConsumer.cpp | dale-wilson/HSQueue | 04d01ed42707069d28e81b5494aba61904e6e591 | [
"BSD-3-Clause"
] | 2 | 2015-12-29T17:33:25.000Z | 2021-12-20T02:30:44.000Z | src/StepLibrary/MockMessageConsumer.cpp | dale-wilson/HighQueue | 04d01ed42707069d28e81b5494aba61904e6e591 | [
"BSD-3-Clause"
] | null | null | null | src/StepLibrary/MockMessageConsumer.cpp | dale-wilson/HighQueue | 04d01ed42707069d28e81b5494aba61904e6e591 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2015 Object Computing, Inc.
// All rights reserved.
// See the file license.txt for licensing information.
#include <Steps/StepPch.hpp>
#include "MockMessageConsumer.hpp"
#include <Steps/StepFactory.hpp>
using namespace HighQueue;
using namespace Steps;
namespace
{
StepFactory::Registrar<MockMessageConsumer<SmallMockMessage> > registerStepSmall("small_test_message_consumer", "Validate and consume small test messages");
StepFactory::Registrar<MockMessageConsumer<MediumMockMessage> > registerStepMedium("medium_test_message_consumer", "Validate and consume medium test messages");
StepFactory::Registrar<MockMessageConsumer<LargeMockMessage> > registerStepLarge("large_test_message_consumer", "Validate and consume large test messages");
const std::string keyMessageCount = "message_count";
}
BaseMessageConsumer::BaseMessageConsumer()
: messageCount_(0)
, heartbeats_(0)
, shutdowns_(0)
, gaps_(0)
, messagesHandled_(0)
, nextSequence_(0)
, sequenceError_(0)
, unexpectedMessageError_(0)
{
}
BaseMessageConsumer::~BaseMessageConsumer()
{
}
bool BaseMessageConsumer::configureParameter(const std::string & key, const ConfigurationNode & configuration)
{
if(key == keyMessageCount)
{
uint64_t messageCount;
if(!configuration.getValue(messageCount))
{
LogFatal("MessageConsumer can't interpret value for " << keyMessageCount);
}
messageCount_ = uint32_t(messageCount);
return true;
}
return Step::configureParameter(key, configuration);
}
void BaseMessageConsumer::logStats()
{
LogStatistics("MessageConsumer " << name_ << " heartbeats: " << heartbeats_);
LogStatistics("MessageConsumer " << name_ << " shutdowns: " << shutdowns_);
LogStatistics("MessageConsumer " << name_ << " messagesHandled: " << messagesHandled_);
LogStatistics("MessageConsumer " << name_ << " sequenceError: " << sequenceError_);
LogStatistics("MessageConsumer " << name_ << " unexpectedMessageError: " << unexpectedMessageError_);
}
| 33.548387 | 164 | 0.725962 | dale-wilson |
a35666c1f20c292b7b9b6ac7dd821aab39493f75 | 1,341 | cc | C++ | sketches/sketch_vc.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 26 | 2019-11-26T08:36:15.000Z | 2022-02-15T17:13:21.000Z | sketches/sketch_vc.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 1,215 | 2019-09-09T14:31:33.000Z | 2022-03-30T20:20:14.000Z | sketches/sketch_vc.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 12 | 2019-09-08T00:03:05.000Z | 2022-02-23T21:28:35.000Z |
// runtime code
struct VirtualContext {
using virtual_context_id_t = int64_t;
bool is_migrateable = false;
virtual_context_id_t get_virtual_context_id();
};
struct VirtualContextMessage : vt::Message {
};
// user code
struct MyContext : VirtualContext {
int my_data;
MyContext() = default;
};
struct MyMsg : vt::VirtualContextMessage {
int size, info;
};
MyContext* my_handler(MyMsg* msg) {
return new MyContext(size, info);
}
// work msg for MyContext
struct MyWorkMsg : vt::VirtualContextMessage {
int work_info;
};
void my_work_handler(MyWorkMsg* msg, MyContext* context) {
// do work on context
}
int main(int argc, char** argv) {
CollectiveOps::initialize_context(argc, argv);
CollectiveOps::initialize_runtime();
auto const& my_node = theContext()->getNode();
auto const& num_nodes = theContext()->get_num_nodes();
if (num_nodes == 1) {
CollectiveOps::abort("At least 2 ranks required");
}
if (my_node == 5) {
MyMsg* msg = make_shared_message<MyMsg>(10, 100);
virtual_context_id_t my_id = the_virtual->create_virtual_context<
MyContext, MyMsg, my_handler
>(msg);
MyWorkMsg* msg = make_shared_message<MyWorkMsg>();
the_virtual->sendMsg<MyContext, MyWorkMsg, my_work_handler>(my_id, work_msg);
}
while (1) {
theMsg()->scheduler();
}
return 0;
}
| 20.318182 | 81 | 0.698732 | rbuch |
a3574c4857679e9827022e9a53448e73d2f38ce8 | 1,202 | cpp | C++ | src/ioThreads.cpp | Aerijo/languageserver-tools | 6834f3d96a5d73d975ce2714f18bf5a5383ab2e6 | [
"MIT"
] | null | null | null | src/ioThreads.cpp | Aerijo/languageserver-tools | 6834f3d96a5d73d975ce2714f18bf5a5383ab2e6 | [
"MIT"
] | null | null | null | src/ioThreads.cpp | Aerijo/languageserver-tools | 6834f3d96a5d73d975ce2714f18bf5a5383ab2e6 | [
"MIT"
] | null | null | null | #include <iostream>
#include <thread>
#include <string>
#include <rapidjson/document.h>
#include "QueueManager.h"
#include "library.h"
bool isExitNotif (const Document &message) {
return std::strcmp(message["method"].GetString(), "exit") == 0;
}
std::thread launchStdinLoop () {
std::cin.tie(nullptr);
return std::thread([]{
while (true) {
Document message = getMessage();
if (message.HasParseError() || isExitNotif(message)) {
break;
}
QueueManager::pushMessage(message);
}
});
}
void sendMessage (Document &message) {
message.AddMember("jsonrpc", "2.0", message.GetAllocator());
StringBuffer buffer;
Writer<StringBuffer> writer (buffer);
message.Accept(writer);
std::cout
<< "Content-Length: "
<< buffer.GetLength()
<< "\r\n\r\n"
<< buffer.GetString();
std::cout.flush();
}
std::thread launchStdoutLoop () {
return std::thread([]{
auto *queue = QueueManager::getInstance();
while (true) {
Document message = queue->for_stdout.dequeue();
sendMessage(message);
}
});
} | 22.259259 | 67 | 0.569884 | Aerijo |
a358a7337a069e37e833cb52fb73237674d6d71e | 3,531 | cpp | C++ | level_zero/core/test/unit_tests/mocks/mock_driver_handle.cpp | 8tab/compute-runtime | 71bd96ad7184df83c7af04ffa8e0d6678ab26f99 | [
"MIT"
] | null | null | null | level_zero/core/test/unit_tests/mocks/mock_driver_handle.cpp | 8tab/compute-runtime | 71bd96ad7184df83c7af04ffa8e0d6678ab26f99 | [
"MIT"
] | null | null | null | level_zero/core/test/unit_tests/mocks/mock_driver_handle.cpp | 8tab/compute-runtime | 71bd96ad7184df83c7af04ffa8e0d6678ab26f99 | [
"MIT"
] | null | null | null | /*
* Copyright (C) 2019-2020 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "mock_driver_handle.h"
namespace L0 {
namespace ult {
using MockDriverHandle = Mock<L0::ult::DriverHandle>;
using namespace testing;
using ::testing::Invoke;
using ::testing::Return;
Mock<DriverHandle>::Mock() {
EXPECT_CALL(*this, getDevice)
.WillRepeatedly(testing::Invoke(this, &MockDriverHandle::doGetDevice));
EXPECT_CALL(*this, getMemoryManager)
.WillRepeatedly(Invoke(this, &MockDriverHandle::doGetMemoryManager));
EXPECT_CALL(*this, getSvmAllocsManager)
.WillRepeatedly(Invoke(this, &MockDriverHandle::doGetSvmAllocManager));
EXPECT_CALL(*this, allocHostMem)
.WillRepeatedly(Invoke(this, &MockDriverHandle::doAllocHostMem));
EXPECT_CALL(*this, allocDeviceMem)
.WillRepeatedly(Invoke(this, &MockDriverHandle::doAllocDeviceMem));
EXPECT_CALL(*this, freeMem)
.WillRepeatedly(Invoke(this, &MockDriverHandle::doFreeMem));
};
NEO::MemoryManager *Mock<DriverHandle>::doGetMemoryManager() {
return memoryManager;
}
NEO::SVMAllocsManager *Mock<DriverHandle>::doGetSvmAllocManager() {
return svmAllocsManager;
}
ze_result_t Mock<DriverHandle>::doGetDevice(uint32_t *pCount, ze_device_handle_t *phDevices) {
if (*pCount == 0) { // User wants to know number of devices
*pCount = this->num_devices;
return ZE_RESULT_SUCCESS;
}
if (phDevices == nullptr) // User is expected to allocate space
return ZE_RESULT_ERROR_INVALID_ARGUMENT;
phDevices[0] = &this->device;
return ZE_RESULT_SUCCESS;
}
ze_result_t Mock<DriverHandle>::doAllocHostMem(ze_host_mem_alloc_flag_t flags, size_t size, size_t alignment,
void **ptr) {
NEO::SVMAllocsManager::UnifiedMemoryProperties unifiedMemoryProperties(InternalMemoryType::HOST_UNIFIED_MEMORY);
auto allocation = svmAllocsManager->createUnifiedMemoryAllocation(0u, size, unifiedMemoryProperties);
if (allocation == nullptr) {
return ZE_RESULT_ERROR_OUT_OF_HOST_MEMORY;
}
*ptr = allocation;
return ZE_RESULT_SUCCESS;
}
ze_result_t Mock<DriverHandle>::doAllocDeviceMem(ze_device_handle_t hDevice, ze_device_mem_alloc_flag_t flags, size_t size, size_t alignment, void **ptr) {
NEO::SVMAllocsManager::UnifiedMemoryProperties unifiedMemoryProperties(InternalMemoryType::DEVICE_UNIFIED_MEMORY);
auto allocation = svmAllocsManager->createUnifiedMemoryAllocation(0u, size, unifiedMemoryProperties);
if (allocation == nullptr) {
return ZE_RESULT_ERROR_OUT_OF_DEVICE_MEMORY;
}
*ptr = allocation;
return ZE_RESULT_SUCCESS;
}
ze_result_t Mock<DriverHandle>::doFreeMem(const void *ptr) {
auto allocation = svmAllocsManager->getSVMAlloc(ptr);
if (allocation == nullptr) {
return ZE_RESULT_ERROR_INVALID_ARGUMENT;
}
svmAllocsManager->freeSVMAlloc(const_cast<void *>(ptr));
if (svmAllocsManager->getSvmMapOperation(ptr)) {
svmAllocsManager->removeSvmMapOperation(ptr);
}
return ZE_RESULT_SUCCESS;
}
void Mock<DriverHandle>::setupDevices(std::vector<std::unique_ptr<NEO::Device>> neoDevices) {
this->numDevices = static_cast<uint32_t>(neoDevices.size());
for (auto &neoDevice : neoDevices) {
auto device = Device::create(this, neoDevice.release(), std::numeric_limits<uint32_t>::max());
this->devices.push_back(device);
}
}
Mock<DriverHandle>::~Mock(){};
} // namespace ult
} // namespace L0
| 32.694444 | 155 | 0.722741 | 8tab |
a35bd4ae48b4c1e27fcaedf07b7445ae01f0cc20 | 638 | cpp | C++ | Camp_1-2562/05 String/Wordchain.cpp | MasterIceZ/POSN_BUU | 56e176fb843d7ddcee0cf4acf2bb141576c260cf | [
"MIT"
] | null | null | null | Camp_1-2562/05 String/Wordchain.cpp | MasterIceZ/POSN_BUU | 56e176fb843d7ddcee0cf4acf2bb141576c260cf | [
"MIT"
] | null | null | null | Camp_1-2562/05 String/Wordchain.cpp | MasterIceZ/POSN_BUU | 56e176fb843d7ddcee0cf4acf2bb141576c260cf | [
"MIT"
] | null | null | null | #include<stdio.h>
#include<string.h>
char a[1010],b[1010],c[1010];
int main(){
int i,n,j,cnt=0,ch=1,l;
scanf("%d %d",&l,&n);
for(i=0;i<l;i++){
scanf(" %c",&a[i]);
}
if(n==1){
for(j==0;j<l;j++){
printf("%c",a[j]);
}
return 0;
}
for(i=0;i<n-1;i++){
cnt=0;
for(j=0;j<l;j++){
scanf(" %c",&b[j]);
}
for(j=0;j<l;j++){
if(a[j]!=b[j]){
cnt++;
}
}
if(cnt>2&&ch){
for(j=0;j<l;j++){
c[j]=a[j];
ch=0;
}
}
if(ch){
for(j=0;j<l;j++)
c[j]=b[j];
}
strcpy(a,b);
}
for(j=0;j<l;j++){
printf("%c",c[j]);
}
}
/*
4
12
HEAD
HEAP
LEAP
TEAR
REAR
BAER
BAET
BEEP
JEEP
JOIP
JEIP
AEIO
*/
| 10.813559 | 29 | 0.440439 | MasterIceZ |
a35c2d00644ae9955391a748cd5afdd8d7e74129 | 892 | cpp | C++ | Sources/Common/Vertex.cpp | CubbyFlow/RenderFlow | c38686917ab526463430b05de78fafb85a35bd20 | [
"MIT"
] | 3 | 2021-07-07T13:39:01.000Z | 2022-03-11T02:40:49.000Z | Sources/Common/Vertex.cpp | CubbyFlow/RenderFlow | c38686917ab526463430b05de78fafb85a35bd20 | [
"MIT"
] | 7 | 2021-07-08T02:50:03.000Z | 2021-07-24T09:12:11.000Z | Sources/Common/Vertex.cpp | CubbyFlow/RenderFlow | c38686917ab526463430b05de78fafb85a35bd20 | [
"MIT"
] | 1 | 2021-07-21T20:30:21.000Z | 2021-07-21T20:30:21.000Z | #include <Common/Vertex.hpp>
namespace Common
{
std::size_t VertexHelper::GetNumberOfFloats(VertexFormat format)
{
std::size_t size = 0;
if (static_cast<bool>(format & VertexFormat::Position3))
{
size += 3;
}
if (static_cast<bool>(format & VertexFormat::Normal3))
{
size += 3;
}
if (static_cast<bool>(format & VertexFormat::TexCoord2))
{
size += 2;
}
if (static_cast<bool>(format & VertexFormat::TexCoord3))
{
size += 3;
}
if (static_cast<bool>(format & VertexFormat::Color4))
{
size += 4;
}
if (static_cast<bool>(format & VertexFormat::Tangent4))
{
size += 4;
}
return size;
}
std::size_t VertexHelper::GetSizeInBytes(VertexFormat format)
{
return sizeof(float) * GetNumberOfFloats(format);
}
} // namespace Common | 21.756098 | 65 | 0.575112 | CubbyFlow |
a35cac64593a6d7e46f6a2cbad305982606666f2 | 125,501 | cxx | C++ | VTK/Filtering/vtkKdTree.cxx | matthb2/ParaView-beforekitwareswtichedtogit | e47e57d6ce88444d9e6af9ab29f9db8c23d24cef | [
"BSD-3-Clause"
] | 1 | 2021-07-31T19:38:03.000Z | 2021-07-31T19:38:03.000Z | VTK/Filtering/vtkKdTree.cxx | matthb2/ParaView-beforekitwareswtichedtogit | e47e57d6ce88444d9e6af9ab29f9db8c23d24cef | [
"BSD-3-Clause"
] | null | null | null | VTK/Filtering/vtkKdTree.cxx | matthb2/ParaView-beforekitwareswtichedtogit | e47e57d6ce88444d9e6af9ab29f9db8c23d24cef | [
"BSD-3-Clause"
] | 2 | 2019-01-22T19:51:40.000Z | 2021-07-31T19:38:05.000Z | /*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile$
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*----------------------------------------------------------------------------
Copyright (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
#include "vtkKdTree.h"
#include "vtkKdNode.h"
#include "vtkBSPCuts.h"
#include "vtkBSPIntersections.h"
#include "vtkObjectFactory.h"
#include "vtkDataSet.h"
#include "vtkDataSetCollection.h"
#include "vtkFloatArray.h"
#include "vtkMath.h"
#include "vtkCell.h"
#include "vtkCellArray.h"
#include "vtkGarbageCollector.h"
#include "vtkIdList.h"
#include "vtkPolyData.h"
#include "vtkPoints.h"
#include "vtkIdTypeArray.h"
#include "vtkIntArray.h"
#include "vtkPointSet.h"
#include "vtkImageData.h"
#include "vtkUniformGrid.h"
#include "vtkRectilinearGrid.h"
#include "vtkCallbackCommand.h"
#ifdef _MSC_VER
#pragma warning ( disable : 4100 )
#endif
#include <vtkstd/algorithm>
#include <vtkstd/list>
#include <vtkstd/map>
#include <vtkstd/queue>
#include <vtkstd/set>
vtkCxxRevisionMacro(vtkKdTree, "$Revision$");
// Timing data ---------------------------------------------
#include "vtkTimerLog.h"
#define MSGSIZE 60
static char dots[MSGSIZE] = "...........................................................";
static char msg[MSGSIZE];
//-----------------------------------------------------------------------------
static void LastInputDeletedCallback(vtkObject *, unsigned long,
void *_self, void *)
{
vtkKdTree *self = reinterpret_cast<vtkKdTree *>(_self);
self->InvalidateGeometry();
}
//----------------------------------------------------------------------------
static char * makeEntry(const char *s)
{
memcpy(msg, dots, MSGSIZE);
int len = static_cast<int>(strlen(s));
len = (len >= MSGSIZE) ? MSGSIZE-1 : len;
memcpy(msg, s, len);
return msg;
}
#define TIMER(s) \
if (this->Timing) \
{ \
char *s2 = makeEntry(s); \
if (this->TimerLog == NULL){ \
this->TimerLog = vtkTimerLog::New(); \
} \
this->TimerLog->MarkStartEvent(s2); \
}
#define TIMERDONE(s) \
if (this->Timing){ char *s2 = makeEntry(s); this->TimerLog->MarkEndEvent(s2); }
// Timing data ---------------------------------------------
// helper class for ordering the points in vtkKdTree::FindClosestNPoints()
namespace
{
class OrderPoints
{
public:
OrderPoints(int N)
{
this->NumDesiredPoints = N;
this->NumPoints = 0;
this->LargestDist2 = VTK_LARGE_FLOAT;
}
void InsertPoint(float dist2, vtkIdType id)
{
if(dist2 <= this->LargestDist2 || this->NumPoints < this->NumDesiredPoints)
{
vtkstd::map<float, vtkstd::list<vtkIdType> >::iterator it=this->dist2ToIds.find(dist2);
this->NumPoints++;
if(it == this->dist2ToIds.end())
{
vtkstd::list<vtkIdType> idset;
idset.push_back(id);
this->dist2ToIds[dist2] = idset;
}
else
{
it->second.push_back(id);
}
if(this->NumPoints > this->NumDesiredPoints)
{
it=this->dist2ToIds.end();
it--;
if((this->NumPoints-it->second.size()) > this->NumDesiredPoints)
{
this->NumPoints -= it->second.size();
vtkstd::map<float, vtkstd::list<vtkIdType> >::iterator it2 = it;
it2--;
this->LargestDist2 = it2->first;
this->dist2ToIds.erase(it);
}
}
}
}
void GetSortedIds(vtkIdList* ids)
{
ids->Reset();
vtkIdType numIds = (this->NumDesiredPoints < this->NumPoints)
? this->NumDesiredPoints : this->NumPoints;
ids->SetNumberOfIds(numIds);
vtkIdType counter = 0;
vtkstd::map<float, vtkstd::list<vtkIdType> >::iterator it=this->dist2ToIds.begin();
while(counter < numIds && it!=this->dist2ToIds.end())
{
vtkstd::list<vtkIdType>::iterator lit=it->second.begin();
while(counter < numIds && lit!=it->second.end())
{
ids->InsertId(counter, *lit);
counter++;
lit++;
}
it++;
}
}
float GetLargestDist2()
{
return this->LargestDist2;
}
private:
size_t NumDesiredPoints, NumPoints;
float LargestDist2;
vtkstd::map<float, vtkstd::list<vtkIdType> > dist2ToIds; // map from dist^2 to a list of ids
};
}
vtkStandardNewMacro(vtkKdTree);
//----------------------------------------------------------------------------
vtkKdTree::vtkKdTree()
{
this->FudgeFactor = 0;
this->MaxWidth = 0.0;
this->MaxLevel = 20;
this->Level = 0;
this->NumberOfRegionsOrLess = 0;
this->NumberOfRegionsOrMore = 0;
this->ValidDirections =
(1 << vtkKdTree::XDIM) | (1 << vtkKdTree::YDIM) | (1 << vtkKdTree::ZDIM);
this->MinCells = 100;
this->NumberOfRegions = 0;
this->DataSets = vtkDataSetCollection::New();
this->Top = NULL;
this->RegionList = NULL;
this->Timing = 0;
this->TimerLog = NULL;
this->IncludeRegionBoundaryCells = 0;
this->GenerateRepresentationUsingDataBounds = 0;
this->InitializeCellLists();
this->CellRegionList = NULL;
this->NumberOfLocatorPoints = 0;
this->LocatorPoints = NULL;
this->LocatorIds = NULL;
this->LocatorRegionLocation = NULL;
this->LastDataCacheSize = 0;
this->LastNumDataSets = 0;
this->ClearLastBuildCache();
this->BSPCalculator = NULL;
this->Cuts = NULL;
this->UserDefinedCuts = 0;
this->Progress = 0;
this->ProgressOffset = 0;
this->ProgressScale = 1.0;
}
//----------------------------------------------------------------------------
void vtkKdTree::DeleteAllDescendants(vtkKdNode *nd)
{
vtkKdNode *left = nd->GetLeft();
vtkKdNode *right = nd->GetRight();
if (left && left->GetLeft())
{
vtkKdTree::DeleteAllDescendants(left);
}
if (right && right->GetLeft())
{
vtkKdTree::DeleteAllDescendants(right);
}
if (left && right)
{
nd->DeleteChildNodes(); // undo AddChildNodes
left->Delete(); // undo vtkKdNode::New()
right->Delete();
}
}
//----------------------------------------------------------------------------
void vtkKdTree::InitializeCellLists()
{
this->CellList.dataSet = NULL;
this->CellList.regionIds = NULL;
this->CellList.nRegions = 0;
this->CellList.cells = NULL;
this->CellList.boundaryCells = NULL;
this->CellList.emptyList = NULL;
}
//----------------------------------------------------------------------------
void vtkKdTree::DeleteCellLists()
{
int i;
int num = this->CellList.nRegions;
if (this->CellList.regionIds)
{
delete [] this->CellList.regionIds;
}
if (this->CellList.cells)
{
for (i=0; i<num; i++)
{
this->CellList.cells[i]->Delete();
}
delete [] this->CellList.cells;
}
if (this->CellList.boundaryCells)
{
for (i=0; i<num; i++)
{
this->CellList.boundaryCells[i]->Delete();
}
delete [] this->CellList.boundaryCells;
}
if (this->CellList.emptyList)
{
this->CellList.emptyList->Delete();
}
this->InitializeCellLists();
return;
}
//----------------------------------------------------------------------------
vtkKdTree::~vtkKdTree()
{
if (this->DataSets)
{
this->DataSets->Delete();
this->DataSets = NULL;
}
this->FreeSearchStructure();
this->DeleteCellLists();
if (this->CellRegionList)
{
delete [] this->CellRegionList;
this->CellRegionList = NULL;
}
if (this->TimerLog)
{
this->TimerLog->Delete();
}
this->ClearLastBuildCache();
this->SetCalculator(NULL);
this->SetCuts(NULL);
}
//----------------------------------------------------------------------------
void vtkKdTree::SetCalculator(vtkKdNode *kd)
{
if (this->BSPCalculator)
{
this->BSPCalculator->Delete();
this->BSPCalculator = NULL;
}
if (!this->UserDefinedCuts)
{
this->SetCuts(NULL, 0);
}
if (kd == NULL)
{
return;
}
if (!this->UserDefinedCuts)
{
vtkBSPCuts *cuts = vtkBSPCuts::New();
cuts->CreateCuts(kd);
this->SetCuts(cuts, 0);
}
this->BSPCalculator = vtkBSPIntersections::New();
this->BSPCalculator->SetCuts(this->Cuts);
}
//----------------------------------------------------------------------------
void vtkKdTree::SetCuts(vtkBSPCuts *cuts)
{
this->SetCuts(cuts, 1);
}
//----------------------------------------------------------------------------
void vtkKdTree::SetCuts(vtkBSPCuts *cuts, int userDefined)
{
if (userDefined != 0)
{
userDefined = 1;
}
if ((cuts == this->Cuts) && (userDefined == this->UserDefinedCuts))
{
return;
}
if (!this->Cuts || !this->Cuts->Equals(cuts))
{
this->Modified();
}
if (this->Cuts)
{
if (this->UserDefinedCuts)
{
this->Cuts->UnRegister(this);
}
else
{
this->Cuts->Delete();
}
this->Cuts = NULL;
this->UserDefinedCuts = 0;
}
if (cuts == NULL)
{
return;
}
this->Cuts = cuts;
this->UserDefinedCuts = userDefined;
if (this->UserDefinedCuts)
{
this->Cuts->Register(this);
}
}
//----------------------------------------------------------------------------
// Add and remove data sets. We don't update this->Modify() here, because
// changing the data sets doesn't necessarily require rebuilding the
// k-d tree. We only need to build a new k-d tree in BuildLocator if
// the geometry has changed, and we check for that with NewGeometry in
// BuildLocator. We Modify() for changes that definitely require a
// rebuild of the tree, like changing the depth of the k-d tree.
void vtkKdTree::SetDataSet(vtkDataSet *set)
{
this->DataSets->RemoveAllItems();
this->AddDataSet(set);
}
void vtkKdTree::AddDataSet(vtkDataSet *set)
{
if (set == NULL)
{
return;
}
if (this->DataSets->IsItemPresent(set))
{
return;
}
this->DataSets->AddItem(set);
}
void vtkKdTree::RemoveDataSet(vtkDataSet *set)
{
this->DataSets->RemoveItem(set);
}
void vtkKdTree::RemoveDataSet(int index)
{
this->DataSets->RemoveItem(index);
}
void vtkKdTree::RemoveAllDataSets()
{
this->DataSets->RemoveAllItems();
}
//-----------------------------------------------------------------------------
int vtkKdTree::GetNumberOfDataSets()
{
return this->DataSets->GetNumberOfItems();
}
int vtkKdTree::GetDataSetIndex(vtkDataSet *set)
{
// This is weird, but IsItemPresent returns the index + 1 (so that 0
// corresponds to item not present).
return this->DataSets->IsItemPresent(set) - 1;
}
vtkDataSet *vtkKdTree::GetDataSet(int index)
{
return this->DataSets->GetItem(index);
}
int vtkKdTree::GetDataSetsNumberOfCells(int from, int to)
{
int numCells = 0;
for (int i=from; i<=to; i++)
{
vtkDataSet *data = this->GetDataSet(i);
if (data)
{
numCells += data->GetNumberOfCells();
}
}
return numCells;
}
//----------------------------------------------------------------------------
int vtkKdTree::GetNumberOfCells()
{
return this->GetDataSetsNumberOfCells(0, this->GetNumberOfDataSets()-1);
}
//----------------------------------------------------------------------------
void vtkKdTree::GetBounds(double *bounds)
{
if (this->Top)
{
this->Top->GetBounds(bounds);
}
}
//----------------------------------------------------------------------------
void vtkKdTree::GetRegionBounds(int regionID, double bounds[6])
{
if ( (regionID < 0) || (regionID >= this->NumberOfRegions))
{
vtkErrorMacro( << "vtkKdTree::GetRegionBounds invalid region");
return;
}
vtkKdNode *node = this->RegionList[regionID];
node->GetBounds(bounds);
}
//----------------------------------------------------------------------------
void vtkKdTree::GetRegionDataBounds(int regionID, double bounds[6])
{
if ( (regionID < 0) || (regionID >= this->NumberOfRegions))
{
vtkErrorMacro( << "vtkKdTree::GetRegionDataBounds invalid region");
return;
}
vtkKdNode *node = this->RegionList[regionID];
node->GetDataBounds(bounds);
}
//----------------------------------------------------------------------------
vtkKdNode **vtkKdTree::_GetRegionsAtLevel(int level, vtkKdNode **nodes, vtkKdNode *kd)
{
if (level > 0)
{
vtkKdNode **nodes0 = _GetRegionsAtLevel(level-1, nodes, kd->GetLeft());
vtkKdNode **nodes1 = _GetRegionsAtLevel(level-1, nodes0, kd->GetRight());
return nodes1;
}
else
{
nodes[0] = kd;
return nodes+1;
}
}
//----------------------------------------------------------------------------
void vtkKdTree::GetRegionsAtLevel(int level, vtkKdNode **nodes)
{
if ( (level < 0) || (level > this->Level))
{
return;
}
vtkKdTree::_GetRegionsAtLevel(level, nodes, this->Top);
return;
}
//----------------------------------------------------------------------------
void vtkKdTree::GetLeafNodeIds(vtkKdNode *node, vtkIntArray *ids)
{
int id = node->GetID();
if (id < 0)
{
vtkKdTree::GetLeafNodeIds(node->GetLeft(), ids);
vtkKdTree::GetLeafNodeIds(node->GetRight(), ids);
}
else
{
ids->InsertNextValue(id);
}
return;
}
//----------------------------------------------------------------------------
float *vtkKdTree::ComputeCellCenters()
{
vtkDataSet *allSets = NULL;
return this->ComputeCellCenters(allSets);
}
//----------------------------------------------------------------------------
float *vtkKdTree::ComputeCellCenters(int set)
{
vtkDataSet *data = this->GetDataSet(set);
if (!data)
{
vtkErrorMacro(<<"vtkKdTree::ComputeCellCenters no such data set");
return NULL;
}
return this->ComputeCellCenters(data);
}
//----------------------------------------------------------------------------
float *vtkKdTree::ComputeCellCenters(vtkDataSet *set)
{
this->UpdateSubOperationProgress(0);
int totalCells;
if (set)
{
totalCells = set->GetNumberOfCells();
}
else
{
totalCells = this->GetNumberOfCells(); // all data sets
}
if (totalCells == 0)
{
return NULL;
}
float *center = new float [3 * totalCells];
if (!center)
{
return NULL;
}
int maxCellSize = 0;
if (set)
{
maxCellSize = set->GetMaxCellSize();
}
else
{
vtkCollectionSimpleIterator cookie;
this->DataSets->InitTraversal(cookie);
for (vtkDataSet *iset = this->DataSets->GetNextDataSet(cookie);
iset != NULL; iset = this->DataSets->GetNextDataSet(cookie))
{
int cellSize = iset->GetMaxCellSize();
maxCellSize = (cellSize > maxCellSize) ? cellSize : maxCellSize;
}
}
double *weights = new double [maxCellSize];
float *cptr = center;
double dcenter[3];
if (set)
{
for (int j=0; j<totalCells; j++)
{
this->ComputeCellCenter(set->GetCell(j), dcenter, weights);
cptr[0] = static_cast<float>(dcenter[0]);
cptr[1] = static_cast<float>(dcenter[1]);
cptr[2] = static_cast<float>(dcenter[2]);
cptr += 3;
if (j%1000 == 0)
{
this->UpdateSubOperationProgress(static_cast<double>(j)/totalCells);
}
}
}
else
{
vtkCollectionSimpleIterator cookie;
this->DataSets->InitTraversal(cookie);
for (vtkDataSet *iset = this->DataSets->GetNextDataSet(cookie);
iset != NULL; iset = this->DataSets->GetNextDataSet(cookie))
{
int nCells = iset->GetNumberOfCells();
for (int j=0; j<nCells; j++)
{
this->ComputeCellCenter(iset->GetCell(j), dcenter, weights);
cptr[0] = static_cast<float>(dcenter[0]);
cptr[1] = static_cast<float>(dcenter[1]);
cptr[2] = static_cast<float>(dcenter[2]);
cptr += 3;
if (j%1000 == 0)
{
this->UpdateSubOperationProgress(static_cast<double>(j)/totalCells);
}
}
}
}
delete [] weights;
this->UpdateSubOperationProgress(1.0);
return center;
}
//----------------------------------------------------------------------------
void vtkKdTree::ComputeCellCenter(vtkDataSet *set, int cellId, float *center)
{
double dcenter[3];
this->ComputeCellCenter(set, cellId, dcenter);
center[0] = static_cast<float>(dcenter[0]);
center[1] = static_cast<float>(dcenter[1]);
center[2] = static_cast<float>(dcenter[2]);
}
//----------------------------------------------------------------------------
void vtkKdTree::ComputeCellCenter(vtkDataSet *set, int cellId, double *center)
{
int setNum;
if (set)
{
setNum = this->GetDataSetIndex(set);
if ( setNum < 0)
{
vtkErrorMacro(<<"vtkKdTree::ComputeCellCenter invalid data set");
return;
}
}
else
{
setNum = 0;
set = this->GetDataSet();
}
if ( (cellId < 0) || (cellId >= set->GetNumberOfCells()))
{
vtkErrorMacro(<<"vtkKdTree::ComputeCellCenter invalid cell ID");
return;
}
double *weights = new double [set->GetMaxCellSize()];
this->ComputeCellCenter(set->GetCell(cellId), center, weights);
delete [] weights;
return;
}
//----------------------------------------------------------------------------
void vtkKdTree::ComputeCellCenter(vtkCell *cell, double *center,
double *weights)
{
double pcoords[3];
int subId = cell->GetParametricCenter(pcoords);
cell->EvaluateLocation(subId, pcoords, center, weights);
return;
}
//----------------------------------------------------------------------------
// Build the kdtree structure based on location of cell centroids.
//
void vtkKdTree::BuildLocator()
{
this->UpdateProgress(0);
int nCells=0;
int i;
if ((this->Top != NULL) &&
(this->BuildTime > this->GetMTime()) &&
(this->NewGeometry() == 0))
{
return;
}
// Make sure input is up to date.
for (i = 0; i < this->GetNumberOfDataSets(); i++)
{
this->GetDataSet(i)->Update();
}
nCells = this->GetNumberOfCells();
if (nCells == 0)
{
vtkErrorMacro( << "vtkKdTree::BuildLocator - No cells to subdivide");
return;
}
vtkDebugMacro( << "Creating Kdtree" );
this->InvokeEvent(vtkCommand::StartEvent);
if ((this->Timing) && (this->TimerLog == NULL))
{
this->TimerLog = vtkTimerLog::New();
}
TIMER("Set up to build k-d tree");
this->FreeSearchStructure();
// volume bounds - push out a little if flat
double setBounds[6], volBounds[6];
int first = 1;
vtkCollectionSimpleIterator cookie;
this->DataSets->InitTraversal(cookie);
for (vtkDataSet *iset = this->DataSets->GetNextDataSet(cookie);
iset != NULL; iset = this->DataSets->GetNextDataSet(cookie))
{
iset->Update();
if (first)
{
iset->GetBounds(volBounds);
first = 0;
}
else
{
iset->GetBounds(setBounds);
if (setBounds[0] < volBounds[0])
{
volBounds[0] = setBounds[0];
}
if (setBounds[2] < volBounds[2])
{
volBounds[2] = setBounds[2];
}
if (setBounds[4] < volBounds[4])
{
volBounds[4] = setBounds[4];
}
if (setBounds[1] > volBounds[1])
{
volBounds[1] = setBounds[1];
}
if (setBounds[3] > volBounds[3])
{
volBounds[3] = setBounds[3];
}
if (setBounds[5] > volBounds[5])
{
volBounds[5] = setBounds[5];
}
}
}
double diff[3], aLittle = 0.0;
this->MaxWidth = 0.0;
for (i=0; i<3; i++)
{
diff[i] = volBounds[2*i+1] - volBounds[2*i];
this->MaxWidth = static_cast<float>(
(diff[i] > this->MaxWidth) ? diff[i] : this->MaxWidth);
}
this->FudgeFactor = this->MaxWidth * 10e-6;
aLittle = this->MaxWidth / 100.0;
for (i=0; i<3; i++)
{
if (diff[i] <= 0)
{
volBounds[2*i] -= aLittle;
volBounds[2*i+1] += aLittle;
}
else // need lower bound to be strictly less than any point in decomposition
{
volBounds[2*i] -= this->FudgeFactor;
}
}
TIMERDONE("Set up to build k-d tree");
if (this->UserDefinedCuts)
{
// Actually, we will not compute the k-d tree. We will use a
// k-d tree provided to us.
int fail = this->ProcessUserDefinedCuts(volBounds);
if (fail)
{
return;
}
}
else
{
// cell centers - basis of spatial decomposition
TIMER("Create centroid list");
this->ProgressOffset = 0;
this->ProgressScale = 0.3;
float *ptarray = this->ComputeCellCenters();
TIMERDONE("Create centroid list");
if (!ptarray)
{
vtkErrorMacro( << "vtkKdTree::BuildLocator - insufficient memory");
return;
}
// create kd tree structure that balances cell centers
vtkKdNode *kd = this->Top = vtkKdNode::New();
kd->SetBounds(volBounds[0], volBounds[1],
volBounds[2], volBounds[3],
volBounds[4], volBounds[5]);
kd->SetNumberOfPoints(nCells);
kd->SetDataBounds(volBounds[0], volBounds[1],
volBounds[2], volBounds[3],
volBounds[4], volBounds[5]);
TIMER("Build tree");
this->ProgressOffset += this->ProgressScale;
this->ProgressScale = 0.7;
this->DivideRegion(kd, ptarray, NULL, 0);
TIMERDONE("Build tree");
// In the process of building the k-d tree regions,
// the cell centers became reordered, so no point
// in saving them, for example to build cell lists.
delete [] ptarray;
}
this->SetActualLevel();
this->BuildRegionList();
this->InvokeEvent(vtkCommand::EndEvent);
this->UpdateBuildTime();
this->SetCalculator(this->Top);
this->UpdateProgress(1.0);
return;
}
int vtkKdTree::ProcessUserDefinedCuts(double *minBounds)
{
if (!this->Cuts)
{
vtkErrorMacro(<< "vtkKdTree::ProcessUserDefinedCuts - no cuts" );
return 1;
}
// Fix the bounds for the entire partitioning. They must be at
// least as large of the bounds of all the data sets.
vtkKdNode *kd = this->Cuts->GetKdNodeTree();
double bounds[6];
kd->GetBounds(bounds);
int fixBounds = 0;
for (int j=0; j<3; j++)
{
int min = 2*j;
int max = min+1;
if (minBounds[min] < bounds[min])
{
bounds[min] = minBounds[min];
fixBounds = 1;
}
if (minBounds[max] > bounds[max])
{
bounds[max] = minBounds[max];
fixBounds = 1;
}
}
this->Top = vtkKdTree::CopyTree(kd);
if (fixBounds)
{
this->SetNewBounds(bounds);
}
// We don't really know the data bounds, so we'll just set them
// to the spatial bounds.
vtkKdTree::SetDataBoundsToSpatialBounds(this->Top);
// And, we don't know how many points are in each region. The number
// in the provided vtkBSPCuts object was for some other dataset. So
// we zero out those fields.
vtkKdTree::ZeroNumberOfPoints(this->Top);
return 0;
}
//----------------------------------------------------------------------------
void vtkKdTree::ZeroNumberOfPoints(vtkKdNode *kd)
{
kd->SetNumberOfPoints(0);
if (kd->GetLeft())
{
vtkKdTree::ZeroNumberOfPoints(kd->GetLeft());
vtkKdTree::ZeroNumberOfPoints(kd->GetRight());
}
}
//----------------------------------------------------------------------------
void vtkKdTree::SetNewBounds(double *bounds)
{
vtkKdNode *kd = this->Top;
if (!kd)
{
return;
}
int fixDimLeft[6], fixDimRight[6];
int go=0;
double kdb[6];
kd->GetBounds(kdb);
for (int i=0; i<3; i++)
{
int min = 2*i;
int max = 2*i + 1;
fixDimLeft[min] = fixDimRight[min] = 0;
fixDimLeft[max] = fixDimRight[max] = 0;
if (kdb[min] > bounds[min])
{
kdb[min] = bounds[min];
go = fixDimLeft[min] = fixDimRight[min] = 1;
}
if (kdb[max] < bounds[max])
{
kdb[max] = bounds[max];
go = fixDimLeft[max] = fixDimRight[max] = 1;
}
}
if (go)
{
kd->SetBounds(kdb[0],kdb[1],kdb[2],kdb[3],kdb[4],kdb[5]);
if (kd->GetLeft())
{
int cutDim = kd->GetDim() * 2;
fixDimLeft[cutDim + 1] = 0;
vtkKdTree::_SetNewBounds(kd->GetLeft(), bounds, fixDimLeft);
fixDimRight[cutDim] = 0;
vtkKdTree::_SetNewBounds(kd->GetRight(), bounds, fixDimRight);
}
}
}
//----------------------------------------------------------------------------
void vtkKdTree::_SetNewBounds(vtkKdNode *kd, double *b, int *fixDim)
{
int go=0;
int fixDimLeft[6], fixDimRight[6];
double kdb[6];
kd->GetBounds(kdb);
for (int i=0; i<6; i++)
{
if (fixDim[i])
{
kdb[i] = b[i];
go = 1;
}
fixDimLeft[i] = fixDim[i];
fixDimRight[i] = fixDim[i];
}
if (go)
{
kd->SetBounds(kdb[0],kdb[1],kdb[2],kdb[3],kdb[4],kdb[5]);
if (kd->GetLeft())
{
int cutDim = kd->GetDim() * 2;
fixDimLeft[cutDim + 1] = 0;
vtkKdTree::_SetNewBounds(kd->GetLeft(), b, fixDimLeft);
fixDimRight[cutDim] = 0;
vtkKdTree::_SetNewBounds(kd->GetRight(), b, fixDimRight);
}
}
}
//----------------------------------------------------------------------------
vtkKdNode *vtkKdTree::CopyTree(vtkKdNode *kd)
{
vtkKdNode *top = vtkKdNode::New();
vtkKdTree::CopyKdNode(top, kd);
vtkKdTree::CopyChildNodes(top, kd);
return top;
}
//----------------------------------------------------------------------------
void vtkKdTree::CopyChildNodes(vtkKdNode *to, vtkKdNode *from)
{
if (from->GetLeft())
{
vtkKdNode *left = vtkKdNode::New();
vtkKdNode *right = vtkKdNode::New();
vtkKdTree::CopyKdNode(left, from->GetLeft());
vtkKdTree::CopyKdNode(right, from->GetRight());
to->AddChildNodes(left, right);
vtkKdTree::CopyChildNodes(to->GetLeft(), from->GetLeft());
vtkKdTree::CopyChildNodes(to->GetRight(), from->GetRight());
}
}
//----------------------------------------------------------------------------
void vtkKdTree::CopyKdNode(vtkKdNode *to, vtkKdNode *from)
{
to->SetMinBounds(from->GetMinBounds());
to->SetMaxBounds(from->GetMaxBounds());
to->SetMinDataBounds(from->GetMinDataBounds());
to->SetMaxDataBounds(from->GetMaxDataBounds());
to->SetID(from->GetID());
to->SetMinID(from->GetMinID());
to->SetMaxID(from->GetMaxID());
to->SetNumberOfPoints(from->GetNumberOfPoints());
to->SetDim(from->GetDim());
}
//----------------------------------------------------------------------------
int vtkKdTree::ComputeLevel(vtkKdNode *kd)
{
if (!kd)
{
return 0;
}
int iam = 1;
if (kd->GetLeft() != NULL)
{
int depth1 = vtkKdTree::ComputeLevel(kd->GetLeft());
int depth2 = vtkKdTree::ComputeLevel(kd->GetRight());
if (depth1 > depth2)
{
iam += depth1;
}
else
{
iam += depth2;
}
}
return iam;
}
//----------------------------------------------------------------------------
void vtkKdTree::SetDataBoundsToSpatialBounds(vtkKdNode *kd)
{
kd->SetMinDataBounds(kd->GetMinBounds());
kd->SetMaxDataBounds(kd->GetMaxBounds());
if (kd->GetLeft())
{
vtkKdTree::SetDataBoundsToSpatialBounds(kd->GetLeft());
vtkKdTree::SetDataBoundsToSpatialBounds(kd->GetRight());
}
}
//----------------------------------------------------------------------------
int vtkKdTree::SelectCutDirection(vtkKdNode *kd)
{
int dim=0, i;
int xdir = 1 << vtkKdTree::XDIM;
int ydir = 1 << vtkKdTree::YDIM;
int zdir = 1 << vtkKdTree::ZDIM;
// determine direction in which to divide this region
if (this->ValidDirections == xdir)
{
dim = vtkKdTree::XDIM;
}
else if (this->ValidDirections == ydir)
{
dim = vtkKdTree::YDIM;
}
else if (this->ValidDirections == zdir)
{
dim = vtkKdTree::ZDIM;
}
else
{
// divide in the longest direction, for more compact regions
double diff[3], dataBounds[6], maxdiff;
kd->GetDataBounds(dataBounds);
for (i=0; i<3; i++)
{
diff[i] = dataBounds[i*2+1] - dataBounds[i*2];
}
maxdiff = -1.0;
if ((this->ValidDirections & xdir) && (diff[vtkKdTree::XDIM] > maxdiff))
{
dim = vtkKdTree::XDIM;
maxdiff = diff[vtkKdTree::XDIM];
}
if ((this->ValidDirections & ydir) && (diff[vtkKdTree::YDIM] > maxdiff))
{
dim = vtkKdTree::YDIM;
maxdiff = diff[vtkKdTree::YDIM];
}
if ((this->ValidDirections & zdir) && (diff[vtkKdTree::ZDIM] > maxdiff))
{
dim = vtkKdTree::ZDIM;
}
}
return dim;
}
//----------------------------------------------------------------------------
int vtkKdTree::DivideTest(int size, int level)
{
if (level >= this->MaxLevel) return 0;
int minCells = this->GetMinCells();
if (minCells && (minCells > (size/2))) return 0;
int nRegionsNow = 1 << level;
int nRegionsNext = nRegionsNow << 1;
if (this->NumberOfRegionsOrLess && (nRegionsNext > this->NumberOfRegionsOrLess)) return 0;
if (this->NumberOfRegionsOrMore && (nRegionsNow >= this->NumberOfRegionsOrMore)) return 0;
return 1;
}
//----------------------------------------------------------------------------
int vtkKdTree::DivideRegion(vtkKdNode *kd, float *c1, int *ids, int level)
{
int ok = this->DivideTest(kd->GetNumberOfPoints(), level);
if (!ok)
{
return 0;
}
int maxdim = this->SelectCutDirection(kd);
kd->SetDim(maxdim);
int dim1 = maxdim; // best cut direction
int dim2 = -1; // other valid cut directions
int dim3 = -1;
int otherDirections = this->ValidDirections ^ (1 << maxdim);
if (otherDirections)
{
int x = otherDirections & (1 << vtkKdTree::XDIM);
int y = otherDirections & (1 << vtkKdTree::YDIM);
int z = otherDirections & (1 << vtkKdTree::ZDIM);
if (x)
{
dim2 = vtkKdTree::XDIM;
if (y)
{
dim3 = vtkKdTree::YDIM;
}
else if (z)
{
dim3 = vtkKdTree::ZDIM;
}
}
else if (y)
{
dim2 = vtkKdTree::YDIM;
if (z)
{
dim3 = vtkKdTree::ZDIM;
}
}
else if (z)
{
dim2 = vtkKdTree::ZDIM;
}
}
this->DoMedianFind(kd, c1, ids, dim1, dim2, dim3);
if (kd->GetLeft() == NULL)
{
return 0; // unable to divide region further
}
int nleft = kd->GetLeft()->GetNumberOfPoints();
int *leftIds = ids;
int *rightIds = ids ? ids + nleft : NULL;
this->DivideRegion(kd->GetLeft(), c1, leftIds, level + 1);
this->DivideRegion(kd->GetRight(), c1 + nleft*3, rightIds, level + 1);
return 0;
}
//----------------------------------------------------------------------------
// Rearrange the point array. Try dim1 first. If there's a problem
// go to dim2, then dim3.
//
void vtkKdTree::DoMedianFind(vtkKdNode *kd, float *c1, int *ids,
int dim1, int dim2, int dim3)
{
double coord;
int dim;
int midpt;
int npoints = kd->GetNumberOfPoints();
int dims[3];
dims[0] = dim1; dims[1] = dim2; dims[2] = dim3;
for (dim = 0; dim < 3; dim++)
{
if (dims[dim] < 0)
{
break;
}
midpt = vtkKdTree::Select(dims[dim], c1, ids, npoints, coord);
if (midpt == 0)
{
continue; // fatal
}
kd->SetDim(dims[dim]);
vtkKdTree::AddNewRegions(kd, c1, midpt, dims[dim], coord);
break; // division is fine
}
}
//----------------------------------------------------------------------------
void vtkKdTree::AddNewRegions(vtkKdNode *kd, float *c1, int midpt, int dim, double coord)
{
vtkKdNode *left = vtkKdNode::New();
vtkKdNode *right = vtkKdNode::New();
int npoints = kd->GetNumberOfPoints();
int nleft = midpt;
int nright = npoints - midpt;
kd->AddChildNodes(left, right);
double bounds[6];
kd->GetBounds(bounds);
left->SetBounds(
bounds[0], ((dim == vtkKdTree::XDIM) ? coord : bounds[1]),
bounds[2], ((dim == vtkKdTree::YDIM) ? coord : bounds[3]),
bounds[4], ((dim == vtkKdTree::ZDIM) ? coord : bounds[5]));
left->SetNumberOfPoints(nleft);
right->SetBounds(
((dim == vtkKdTree::XDIM) ? coord : bounds[0]), bounds[1],
((dim == vtkKdTree::YDIM) ? coord : bounds[2]), bounds[3],
((dim == vtkKdTree::ZDIM) ? coord : bounds[4]), bounds[5]);
right->SetNumberOfPoints(nright);
left->SetDataBounds(c1);
right->SetDataBounds(c1 + nleft*3);
}
// Use Floyd & Rivest (1975) to find the median:
// Given an array X with element indices ranging from L to R, and
// a K such that L <= K <= R, rearrange the elements such that
// X[K] contains the ith sorted element, where i = K - L + 1, and
// all the elements X[j], j < k satisfy X[j] < X[K], and all the
// elements X[j], j > k satisfy X[j] >= X[K].
#define Exchange(array, ids, x, y) \
{ \
float temp[3]; \
temp[0] = array[3*x]; \
temp[1] = array[3*x + 1]; \
temp[2] = array[3*x + 2]; \
array[3*x] = array[3*y]; \
array[3*x + 1] = array[3*y + 1]; \
array[3*x + 2] = array[3*y + 2]; \
array[3*y] = temp[0]; \
array[3*y + 1] = temp[1]; \
array[3*y + 2] = temp[2]; \
if (ids) \
{ \
vtkIdType tempid = ids[x]; \
ids[x] = ids[y]; \
ids[y] = tempid; \
} \
}
#define sign(x) ((x<0) ? (-1) : (1))
#ifndef max
#define max(x,y) ((x>y) ? (x) : (y))
#endif
#ifndef min
#define min(x,y) ((x<y) ? (x) : (y))
#endif
//----------------------------------------------------------------------------
int vtkKdTree::Select(int dim, float *c1, int *ids, int nvals, double &coord)
{
int left = 0;
int mid = nvals / 2;
int right = nvals -1;
vtkKdTree::_Select(dim, c1, ids, left, right, mid);
// We need to be careful in the case where the "mid"
// value is repeated several times in the array. We
// want to roll the dividing index (mid) back to the
// first occurence in the array, so that there is no
// ambiguity about which spatial region a given point
// belongs in.
//
// The array has been rearranged (in _Select) like this:
//
// All values c1[n], left <= n < mid, satisfy c1[n] <= c1[mid]
// All values c1[n], mid < n <= right, satisfy c1[n] >= c1[mid]
//
// In addition, by careful construction, there is a J <= mid
// such that
//
// All values c1[n], n < J, satisfy c1[n] < c1[mid] STRICTLY
// All values c1[n], J <= n <= mid, satisfy c1[n] = c1[mid]
// All values c1[n], mid < n <= right , satisfy c1[n] >= c1[mid]
//
// We need to roll back the "mid" value to the "J". This
// means our spatial regions are less balanced, but there
// is no ambiguity regarding which region a point belongs in.
int midValIndex = mid*3 + dim;
while ((mid > left) && (c1[midValIndex-3] == c1[midValIndex]))
{
mid--;
midValIndex -= 3;
}
if (mid == left)
{
return mid; // failed to divide region
}
float leftMax = vtkKdTree::FindMaxLeftHalf(dim, c1, mid);
coord=(static_cast<double>(c1[midValIndex])
+static_cast<double>(leftMax))/2.0;
return mid;
}
//----------------------------------------------------------------------------
float vtkKdTree::FindMaxLeftHalf(int dim, float *c1, int K)
{
int i;
float *Xcomponent = c1 + dim;
float max = Xcomponent[0];
for (i=3; i<K*3; i+=3)
{
if (Xcomponent[i] > max)
{
max = Xcomponent[i];
}
}
return max;
}
//----------------------------------------------------------------------------
// Note: The indices (L, R, X) into the point array should be vtkIdTypes rather
// than ints, but this change causes the k-d tree build time to double.
// _Select is the heart of this build, called for every sub-interval that
// is to be reordered. We will leave these as ints now.
void vtkKdTree::_Select(int dim, float *X, int *ids,
int L, int R, int K)
{
int N, I, J, S, SD, LL, RR;
float Z, T;
int manyTValues=0;
while (R > L)
{
if ( R - L > 600)
{
// "Recurse on a sample of size S to get an estimate for the
// (K-L+1)-th smallest element into X[K], biased slightly so
// that the (K-L+1)-th element is expected to lie in the
// smaller set after partitioning"
N = R - L + 1;
I = K - L + 1;
Z = static_cast<float>(log(static_cast<float>(N)));
S = static_cast<int>(.5 * exp(2*Z/3));
SD = static_cast<int>(.5 * sqrt(Z*S*static_cast<float>(N-S)/N) * sign(I - N/2));
LL = max(L, K - static_cast<int>(I*static_cast<float>(S)/N) + SD);
RR = min(R, K + static_cast<int>((N-I)*static_cast<float>(S)/N) + SD);
_Select(dim, X, ids, LL, RR, K);
}
float *Xcomponent = X + dim; // x, y or z component
T = Xcomponent[K*3];
// "the following code partitions X[L:R] about T."
I = L;
J = R;
Exchange(X, ids, L, K);
if (Xcomponent[R*3] >= T)
{
if (Xcomponent[R*3] == T) manyTValues++;
Exchange(X, ids, R, L);
}
while (I < J)
{
Exchange(X, ids, I, J);
while (Xcomponent[(++I)*3] < T)
{
;
}
while ((J>L) && (Xcomponent[(--J)*3] >= T))
{
if (!manyTValues && (J>L) && (Xcomponent[J*3] == T))
{
manyTValues = 1;
}
}
}
if (Xcomponent[L*3] == T)
{
Exchange(X, ids, L, J);
}
else
{
J++;
Exchange(X, ids, J, R);
}
if ((J < K) && manyTValues)
{
// Select has a worst case - when many of the same values
// are repeated in an array. It is bad enough that it is
// worth detecting and optimizing for. Here we're taking the
// interval of values that are >= T, and rearranging it into
// an interval of values = T followed by those > T.
I = J;
J = R+1;
while (I < J)
{
while ((++I < J) && (Xcomponent[I*3] == T))
{
;
}
if (I == J) break;
while ((--J > I) && (Xcomponent[J*3] > T))
{
;
}
if (J == I) break;
Exchange(X, ids, I, J);
}
// I and J are at the first array element that is > T
// If K is within the sequence of T's, we're done, else
// move the new [L,R] interval to the sequence of values
// that are strictly greater than T.
if (K < J)
{
J = K;
}
else
{
J = J-1;
}
}
// "now adjust L,R so they surround the subset containing
// the (K-L+1)-th smallest element"
if (J <= K)
{
L = J + 1;
}
if (K <= J)
{
R = J - 1;
}
}
}
//----------------------------------------------------------------------------
void vtkKdTree::SelfRegister(vtkKdNode *kd)
{
if (kd->GetLeft() == NULL)
{
this->RegionList[kd->GetID()] = kd;
}
else
{
this->SelfRegister(kd->GetLeft());
this->SelfRegister(kd->GetRight());
}
return;
}
//----------------------------------------------------------------------------
int vtkKdTree::SelfOrder(int startId, vtkKdNode *kd)
{
int nextId;
if (kd->GetLeft() == NULL)
{
kd->SetID(startId);
kd->SetMaxID(startId);
kd->SetMinID(startId);
nextId = startId + 1;
}
else
{
kd->SetID(-1);
nextId = vtkKdTree::SelfOrder(startId, kd->GetLeft());
nextId = vtkKdTree::SelfOrder(nextId, kd->GetRight());
kd->SetMinID(startId);
kd->SetMaxID(nextId - 1);
}
return nextId;
}
void vtkKdTree::BuildRegionList()
{
if (this->Top == NULL)
{
return;
}
this->NumberOfRegions = vtkKdTree::SelfOrder(0, this->Top);
this->RegionList = new vtkKdNode * [this->NumberOfRegions];
this->SelfRegister(this->Top);
}
//----------------------------------------------------------------------------
// K-d tree from points, for finding duplicate and near-by points
//
void vtkKdTree::BuildLocatorFromPoints(vtkPointSet *pointset)
{
this->BuildLocatorFromPoints(pointset->GetPoints());
}
void vtkKdTree::BuildLocatorFromPoints(vtkPoints *ptArray)
{
this->BuildLocatorFromPoints(&ptArray, 1);
}
//----------------------------------------------------------------------------
void vtkKdTree::BuildLocatorFromPoints(vtkPoints **ptArrays, int numPtArrays)
{
int ptId;
int i;
int totalNumPoints = 0;
for (i = 0; i < numPtArrays; i++)
{
totalNumPoints += ptArrays[i]->GetNumberOfPoints();
}
if (totalNumPoints < 1)
{
vtkErrorMacro(<< "vtkKdTree::BuildLocatorFromPoints - no points");
return;
}
if (totalNumPoints >= VTK_INT_MAX)
{
// The heart of the k-d tree build is the recursive median find in
// _Select. It rearranges point IDs along with points themselves.
// When point IDs are stored in an "int" instead of a vtkIdType,
// performance doubles. So we store point IDs in an "int" during
// the calculation. This will need to be rewritten if true 64 bit
// IDs are required.
vtkErrorMacro(<<
"BuildLocatorFromPoints - intentional 64 bit error - time to rewrite code");
return;
}
vtkDebugMacro( << "Creating Kdtree" );
if ((this->Timing) && (this->TimerLog == NULL) )
{
this->TimerLog = vtkTimerLog::New();
}
TIMER("Set up to build k-d tree");
this->FreeSearchStructure();
this->ClearLastBuildCache();
// Fix bounds - (1) push out a little if flat
// (2) pull back the x, y and z lower bounds a little bit so that
// points are clearly "inside" the spatial region. Point p is
// "inside" region r = [r1, r2] if r1 < p <= r2.
double bounds[6], diff[3];
ptArrays[0]->GetBounds(bounds);
for (i=1; i<numPtArrays; i++)
{
double tmpbounds[6];
ptArrays[i]->GetBounds(tmpbounds);
if (tmpbounds[0] < bounds[0])
{
bounds[0] = tmpbounds[0];
}
if (tmpbounds[2] < bounds[2])
{
bounds[2] = tmpbounds[2];
}
if (tmpbounds[4] < bounds[4])
{
bounds[4] = tmpbounds[4];
}
if (tmpbounds[1] > bounds[1])
{
bounds[1] = tmpbounds[1];
}
if (tmpbounds[3] > bounds[3])
{
bounds[3] = tmpbounds[3];
}
if (tmpbounds[5] > bounds[5])
{
bounds[5] = tmpbounds[5];
}
}
this->MaxWidth = 0.0;
for (i=0; i<3; i++)
{
diff[i] = bounds[2*i+1] - bounds[2*i];
this->MaxWidth = static_cast<float>
((diff[i] > this->MaxWidth) ? diff[i] : this->MaxWidth);
}
this->FudgeFactor = this->MaxWidth * 10e-6;
double aLittle = this->MaxWidth * 10e-2;
for (i=0; i<3; i++)
{
if (diff[i] < aLittle) // case (1) above
{
double temp = bounds[2*i];
bounds[2*i] = bounds[2*i+1] - aLittle;
bounds[2*i+1] = temp + aLittle;
}
else // case (2) above
{
bounds[2*i] -= this->FudgeFactor;
}
}
// root node of k-d tree - it's the whole space
vtkKdNode *kd = this->Top = vtkKdNode::New();
kd->SetBounds(bounds[0], bounds[1],
bounds[2], bounds[3],
bounds[4], bounds[5]);
kd->SetNumberOfPoints(totalNumPoints);
kd->SetDataBounds(bounds[0], bounds[1],
bounds[2], bounds[3],
bounds[4], bounds[5]);
this->LocatorIds = new int [totalNumPoints];
this->LocatorPoints = new float [3 * totalNumPoints];
if ( !this->LocatorPoints || !this->LocatorIds)
{
this->FreeSearchStructure();
vtkErrorMacro(<< "vtkKdTree::BuildLocatorFromPoints - memory allocation");
return;
}
int *ptIds = this->LocatorIds;
float *points = this->LocatorPoints;
for (i=0, ptId = 0; i<numPtArrays; i++)
{
int npoints = ptArrays[i]->GetNumberOfPoints();
int nvals = npoints * 3;
int pointArrayType = ptArrays[i]->GetDataType();
if (pointArrayType == VTK_FLOAT)
{
vtkDataArray *da = ptArrays[i]->GetData();
vtkFloatArray *fa = vtkFloatArray::SafeDownCast(da);
memcpy(points + ptId, fa->GetPointer(0), sizeof(float) * nvals );
ptId += nvals;
}
else
{
// Hopefully point arrays are usually floats. This conversion will
// really slow things down.
for (vtkIdType ii=0; ii<npoints; ii++)
{
double *pt = ptArrays[i]->GetPoint(ii);
points[ptId++] = static_cast<float>(pt[0]);
points[ptId++] = static_cast<float>(pt[1]);
points[ptId++] = static_cast<float>(pt[2]);
}
}
}
for (ptId=0; ptId<totalNumPoints; ptId++)
{
// _Select dominates DivideRegion algorithm, operating on
// ints is much fast than operating on long longs
ptIds[ptId] = ptId;
}
TIMERDONE("Set up to build k-d tree");
TIMER("Build tree");
this->DivideRegion(kd, points, ptIds, 0);
this->SetActualLevel();
this->BuildRegionList();
// Create a location array for the points of each region
this->LocatorRegionLocation = new int [this->NumberOfRegions];
int idx = 0;
for (int reg = 0; reg < this->NumberOfRegions; reg++)
{
this->LocatorRegionLocation[reg] = idx;
idx += this->RegionList[reg]->GetNumberOfPoints();
}
this->NumberOfLocatorPoints = idx;
this->SetCalculator(this->Top);
TIMERDONE("Build tree");
}
//----------------------------------------------------------------------------
// Query functions subsequent to BuildLocatorFromPoints,
// relating to duplicate and nearby points
//
vtkIdTypeArray *vtkKdTree::BuildMapForDuplicatePoints(float tolerance = 0.0)
{
int i;
if ((tolerance < 0.0) || (tolerance >= this->MaxWidth))
{
vtkWarningMacro(<< "vtkKdTree::BuildMapForDuplicatePoints - invalid tolerance");
tolerance = this->MaxWidth;
}
TIMER("Find duplicate points");
int *idCount = new int [this->NumberOfRegions];
int **uniqueFound = new int * [this->NumberOfRegions];
if (!idCount || !uniqueFound)
{
if (idCount)
{
delete [] idCount;
}
if (uniqueFound)
{
delete [] uniqueFound;
}
vtkErrorMacro(<< "vtkKdTree::BuildMapForDuplicatePoints memory allocation");
return NULL;
}
memset(idCount, 0, sizeof(int) * this->NumberOfRegions);
for (i=0; i<this->NumberOfRegions; i++)
{
uniqueFound[i] = new int [this->RegionList[i]->GetNumberOfPoints()];
if (!uniqueFound[i])
{
delete [] idCount;
for (int j=0; j<i; j++) delete [] uniqueFound[j];
delete [] uniqueFound;
vtkErrorMacro(<< "vtkKdTree::BuildMapForDuplicatePoints memory allocation");
return NULL;
}
}
float tolerance2 = tolerance * tolerance;
vtkIdTypeArray *uniqueIds = vtkIdTypeArray::New();
uniqueIds->SetNumberOfValues(this->NumberOfLocatorPoints);
int idx = 0;
int nextRegionId = 0;
float *point = this->LocatorPoints;
while (idx < this->NumberOfLocatorPoints)
{
// first point we have in this region
int currentId = this->LocatorIds[idx];
int regionId = this->GetRegionContainingPoint(point[0],point[1],point[2]);
if ((regionId == -1) || (regionId != nextRegionId))
{
delete [] idCount;
for (i=0; i<this->NumberOfRegions; i++) delete [] uniqueFound[i];
delete [] uniqueFound;
uniqueIds->Delete();
vtkErrorMacro(<< "vtkKdTree::BuildMapForDuplicatePoints corrupt k-d tree");
return NULL;
}
int duplicateFound = -1;
if ((tolerance > 0.0) && (regionId > 0))
{
duplicateFound = this->SearchNeighborsForDuplicate(regionId, point,
uniqueFound, idCount, tolerance, tolerance2);
}
if (duplicateFound >= 0)
{
uniqueIds->SetValue(currentId, this->LocatorIds[duplicateFound]);
}
else
{
uniqueFound[regionId][idCount[regionId]++] = idx;
uniqueIds->SetValue(currentId, currentId);
}
// test the other points in this region
int numRegionPoints = this->RegionList[regionId]->GetNumberOfPoints();
int secondIdx = idx + 1;
int nextFirstIdx = idx + numRegionPoints;
for (int idx2 = secondIdx ; idx2 < nextFirstIdx; idx2++)
{
point += 3;
currentId = this->LocatorIds[idx2];
duplicateFound = this->SearchRegionForDuplicate(point,
uniqueFound[regionId], idCount[regionId], tolerance2);
if ((tolerance > 0.0) && (duplicateFound < 0) && (regionId > 0))
{
duplicateFound = this->SearchNeighborsForDuplicate(regionId, point,
uniqueFound, idCount, tolerance, tolerance2);
}
if (duplicateFound >= 0)
{
uniqueIds->SetValue(currentId, this->LocatorIds[duplicateFound]);
}
else
{
uniqueFound[regionId][idCount[regionId]++] = idx2;
uniqueIds->SetValue(currentId, currentId);
}
}
idx = nextFirstIdx;
point += 3;
nextRegionId++;
}
for (i=0; i<this->NumberOfRegions; i++)
{
delete [] uniqueFound[i];
}
delete [] uniqueFound;
delete [] idCount;
TIMERDONE("Find duplicate points");
return uniqueIds;
}
//----------------------------------------------------------------------------
int vtkKdTree::SearchRegionForDuplicate(float *point, int *pointsSoFar,
int len, float tolerance2)
{
int duplicateFound = -1;
int id;
for (id=0; id < len; id++)
{
int otherId = pointsSoFar[id];
float *otherPoint = this->LocatorPoints + (otherId * 3);
float distance2 = vtkMath::Distance2BetweenPoints(point, otherPoint);
if (distance2 <= tolerance2)
{
duplicateFound = otherId;
break;
}
}
return duplicateFound;
}
//----------------------------------------------------------------------------
int vtkKdTree::SearchNeighborsForDuplicate(int regionId, float *point,
int **pointsSoFar, int *len,
float tolerance, float tolerance2)
{
int duplicateFound = -1;
float dist2 =
this->RegionList[regionId]->GetDistance2ToInnerBoundary(point[0],point[1],point[2]);
if (dist2 >= tolerance2)
{
// There are no other regions with data that are within the
// tolerance distance of this point.
return duplicateFound;
}
// Find all regions that are within the tolerance distance of the point
int *regionIds = new int [this->NumberOfRegions];
this->BSPCalculator->ComputeIntersectionsUsingDataBoundsOn();
#ifdef USE_SPHERE
// Find all regions which intersect a sphere around the point
// with radius equal to tolerance. Compute the intersection using
// the bounds of data within regions, not the bounds of the region.
int nRegions =
this->BSPCalculator->IntersectsSphere2(regionIds, this->NumberOfRegions,
point[0], point[1], point[2], tolerance2);
#else
// Technically, we want all regions that intersect a sphere around the
// point. But this takes much longer to compute than a box. We'll compute
// all regions that intersect a box. We may occasionally get a region
// we don't need, but that's OK.
double box[6];
box[0] = point[0] - tolerance; box[1] = point[0] + tolerance;
box[2] = point[1] - tolerance; box[3] = point[1] + tolerance;
box[4] = point[2] - tolerance; box[5] = point[2] + tolerance;
int nRegions = this->BSPCalculator->IntersectsBox(regionIds, this->NumberOfRegions, box);
#endif
this->BSPCalculator->ComputeIntersectionsUsingDataBoundsOff();
for (int reg=0; reg < nRegions; reg++)
{
if ((regionIds[reg] == regionId) || (len[reg] == 0) )
{
continue;
}
duplicateFound = this->SearchRegionForDuplicate(point, pointsSoFar[reg],
len[reg], tolerance2);
if (duplicateFound)
{
break;
}
}
delete [] regionIds;
return duplicateFound;
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindPoint(double x[3])
{
return this->FindPoint(x[0], x[1], x[2]);
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindPoint(double x, double y, double z)
{
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindPoint - must build locator first");
return -1;
}
int regionId = this->GetRegionContainingPoint(x, y, z);
if (regionId == -1)
{
return -1;
}
int idx = this->LocatorRegionLocation[regionId];
vtkIdType ptId = -1;
float *point = this->LocatorPoints + (idx * 3);
float fx = static_cast<float>(x);
float fy = static_cast<float>(y);
float fz = static_cast<float>(z);
for (int i=0; i < this->RegionList[regionId]->GetNumberOfPoints(); i++)
{
if ( (point[0] == fx) && (point[1] == fy) && (point[2] == fz))
{
ptId = static_cast<vtkIdType>(this->LocatorIds[idx + i]);
break;
}
point += 3;
}
return ptId;
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindClosestPoint(double x[3], double &dist2)
{
vtkIdType id = this->FindClosestPoint(x[0], x[1], x[2], dist2);
return id;
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindClosestPoint(double x, double y, double z, double &dist2)
{
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindClosestPoint: must build locator first");
return -1;
}
double minDistance2 = 0.0;
int closeId=-1, newCloseId=-1;
double newDistance2 = 4 * this->MaxWidth * this->MaxWidth;
int regionId = this->GetRegionContainingPoint(x, y, z);
if (regionId < 0)
{
// This point is not inside the space divided by the k-d tree.
// Find the point on the boundary that is closest to it.
double pt[3];
this->Top->GetDistance2ToBoundary(x, y, z, pt, 1);
double *min = this->Top->GetMinBounds();
double *max = this->Top->GetMaxBounds();
// GetDistance2ToBoundary will sometimes return a point *just*
// *barely* outside the bounds of the region. Move that point to
// just barely *inside* instead.
if (pt[0] <= min[0])
{
pt[0] = min[0] + this->FudgeFactor;
}
if (pt[1] <= min[1])
{
pt[1] = min[1] + this->FudgeFactor;
}
if (pt[2] <= min[2])
{
pt[2] = min[2] + this->FudgeFactor;
}
if (pt[0] >= max[0])
{
pt[0] = max[0] - this->FudgeFactor;
}
if (pt[1] >= max[1])
{
pt[1] = max[1] - this->FudgeFactor;
}
if (pt[2] >= max[2])
{
pt[2] = max[2] - this->FudgeFactor;
}
regionId = this->GetRegionContainingPoint(pt[0], pt[1], pt[2]);
closeId = this->_FindClosestPointInRegion(regionId,
x, y, z,
minDistance2);
// Check to see if neighboring regions have a closer point
newCloseId =
this->FindClosestPointInSphere(x, y, z,
sqrt(minDistance2), // radius
regionId, // skip this region
newDistance2); // distance to closest point
}
else // Point is inside a k-d tree region
{
closeId =
this->_FindClosestPointInRegion(regionId, x, y, z, minDistance2);
if (minDistance2 > 0.0)
{
float dist2ToBoundary =
this->RegionList[regionId]->GetDistance2ToInnerBoundary(x, y, z);
if (dist2ToBoundary < minDistance2)
{
// The closest point may be in a neighboring region
newCloseId = this->FindClosestPointInSphere(x, y, z,
sqrt(minDistance2), // radius
regionId, // skip this region
newDistance2);
}
}
}
if (newDistance2 < minDistance2 && newCloseId != -1)
{
closeId = newCloseId;
minDistance2 = newDistance2;
}
vtkIdType closePointId = static_cast<vtkIdType>(this->LocatorIds[closeId]);
dist2 = minDistance2;
return closePointId;
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindClosestPointWithinRadius(
double radius, const double x[3], double& dist2)
{
int localCloseId =
this->FindClosestPointInSphere(x[0], x[1], x[2], radius, -1, dist2);
if(localCloseId >= 0)
{
return static_cast<vtkIdType>(this->LocatorIds[localCloseId]);
}
return -1;
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindClosestPointInRegion(int regionId, double *x, double &dist2)
{
return this->FindClosestPointInRegion(regionId, x[0], x[1], x[2], dist2);
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::FindClosestPointInRegion(int regionId,
double x, double y,
double z, double &dist2)
{
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindClosestPointInRegion - must build locator first");
return -1;
}
int localId = this->_FindClosestPointInRegion(regionId, x, y, z, dist2);
vtkIdType originalId = -1;
if (localId >= 0)
{
originalId = static_cast<vtkIdType>(this->LocatorIds[localId]);
}
return originalId;
}
//----------------------------------------------------------------------------
int vtkKdTree::_FindClosestPointInRegion(int regionId,
double x, double y, double z, double &dist2)
{
int minId=0;
double minDistance2 = 4 * this->MaxWidth * this->MaxWidth;
int idx = this->LocatorRegionLocation[regionId];
float *candidate = this->LocatorPoints + (idx * 3);
int numPoints = this->RegionList[regionId]->GetNumberOfPoints();
for (int i=0; i < numPoints; i++)
{
double dx = (x - candidate[0]) * (x - candidate[0]);
if (dx < minDistance2)
{
double dxy = dx + ((y - candidate[1]) * (y - candidate[1]));
if (dxy < minDistance2)
{
double dxyz = dxy + ((z - candidate[2]) * (z - candidate[2]));
if (dxyz < minDistance2)
{
minId = idx + i;
minDistance2 = dxyz;
if (dxyz == 0.0)
{
break;
}
}
}
}
candidate += 3;
}
dist2 = minDistance2;
return minId;
}
//----------------------------------------------------------------------------
int vtkKdTree::FindClosestPointInSphere(double x, double y, double z,
double radius, int skipRegion,
double &dist2)
{
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindClosestPointInSphere - must build locator first");
return -1;
}
int *regionIds = new int [this->NumberOfRegions];
this->BSPCalculator->ComputeIntersectionsUsingDataBoundsOn();
int nRegions =
this->BSPCalculator->IntersectsSphere2(regionIds, this->NumberOfRegions, x, y, z, radius*radius);
this->BSPCalculator->ComputeIntersectionsUsingDataBoundsOff();
double minDistance2 = 4 * this->MaxWidth * this->MaxWidth;
int localCloseId = -1;
bool recheck = 0; // used to flag that we should recheck the distance
for (int reg=0; reg < nRegions; reg++)
{
if (regionIds[reg] == skipRegion)
{
continue;
}
int neighbor = regionIds[reg];
// recheck that the bin is closer than the current minimum distance
if(!recheck || this->RegionList[neighbor]->GetDistance2ToBoundary(x, y, z, 1) < minDistance2)
{
double newDistance2;
int newLocalCloseId = this->_FindClosestPointInRegion(neighbor,
x, y, z, newDistance2);
if (newDistance2 < minDistance2)
{
minDistance2 = newDistance2;
localCloseId = newLocalCloseId;
recheck = 1; // changed the minimum distance so mark to check subsequent bins
}
}
}
delete [] regionIds;
dist2 = minDistance2;
return localCloseId;
}
//----------------------------------------------------------------------------
void vtkKdTree::FindPointsWithinRadius(double R, const double x[3],
vtkIdList* result)
{
result->Reset();
// don't forget to square the radius
this->FindPointsWithinRadius(this->Top, R*R, x, result);
}
//----------------------------------------------------------------------------
void vtkKdTree::FindPointsWithinRadius(vtkKdNode* node, double R2,
const double x[3],
vtkIdList* result)
{
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindPointsWithinRadius - must build locator first");
return;
}
double b[6];
node->GetBounds(b);
double mindist2 = 0; // distance to closest vertex of BB
double maxdist2 = 0; // distance to furthest vertex of BB
// x-dir
if(x[0] < b[0])
{
mindist2 = (b[0]-x[0])*(b[0]-x[0]);
maxdist2 = (b[1]-x[0])*(b[1]-x[0]);
}
else if(x[0] > b[1])
{
mindist2 = (b[1]-x[0])*(b[1]-x[0]);
maxdist2 = (b[0]-x[0])*(b[0]-x[0]);
}
else if((b[1]-x[0]) > (x[0]-b[0]))
{
maxdist2 = (b[1]-x[0])*(b[1]-x[0]);
}
else
{
maxdist2 = (b[0]-x[0])*(b[0]-x[0]);
}
// y-dir
if(x[1] < b[2])
{
mindist2 += (b[2]-x[1])*(b[2]-x[1]);
maxdist2 += (b[3]-x[1])*(b[3]-x[1]);
}
else if(x[1] > b[3])
{
mindist2 += (b[3]-x[1])*(b[3]-x[1]);
maxdist2 += (b[2]-x[1])*(b[2]-x[1]);
}
else if((b[3]-x[1]) > (x[1]-b[2]))
{
maxdist2 += (b[3]-x[1])*(b[3]-x[1]);
}
else
{
maxdist2 += (b[2]-x[1])*(b[2]-x[1]);
}
// z-dir
if(x[2] < b[4])
{
mindist2 += (b[4]-x[2])*(b[4]-x[2]);
maxdist2 += (b[5]-x[2])*(b[5]-x[2]);
}
else if(x[2] > b[5])
{
mindist2 += (b[5]-x[2])*(b[5]-x[2]);
maxdist2 += (b[4]-x[2])*(b[4]-x[2]);
}
else if((b[5]-x[2]) > (x[2]-b[4]))
{
maxdist2 += (b[5]-x[2])*(b[5]-x[2]);
}
else
{
maxdist2 += (x[2]-b[4])*(x[2]-b[4]);
}
if(mindist2 > R2)
{
// non-intersecting
return;
}
if(maxdist2 <= R2)
{
// sphere contains BB
this->AddAllPointsInRegion(node, result);
return;
}
// partial intersection of sphere & BB
if (node->GetLeft() == NULL)
{
int regionID = node->GetID();
int regionLoc = this->LocatorRegionLocation[regionID];
float* pt = this->LocatorPoints + (regionLoc * 3);
vtkIdType numPoints = this->RegionList[regionID]->GetNumberOfPoints();
for (vtkIdType i = 0; i < numPoints; i++)
{
double dist2 = (pt[0]-x[0])*(pt[0]-x[0])+
(pt[1]-x[1])*(pt[1]-x[1])+(pt[2]-x[2])*(pt[2]-x[2]);
if(dist2 <= R2)
{
vtkIdType ptId = static_cast<vtkIdType>(this->LocatorIds[regionLoc + i]);
result->InsertNextId(ptId);
}
pt += 3;
}
}
else
{
this->FindPointsWithinRadius(node->GetLeft(), R2, x, result);
this->FindPointsWithinRadius(node->GetRight(), R2, x, result);
}
}
//----------------------------------------------------------------------------
void vtkKdTree::FindClosestNPoints(int N, const double x[3],
vtkIdList* result)
{
result->Reset();
if(N<=0)
{
return;
}
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindClosestNPoints - must build locator first");
return;
}
int numTotalPoints = this->Top->GetNumberOfPoints();
if(numTotalPoints < N)
{
vtkWarningMacro("Number of requested points is greater than total number of points in KdTree");
N = numTotalPoints;
}
result->SetNumberOfIds(N);
// now we want to go about finding a region that contains at least N points
// but not many more -- hopefully the region contains X as well but we
// can't depend on that
vtkKdNode* node = this->Top;
vtkKdNode* startingNode = 0;
if(!node->ContainsPoint(x[0], x[1], x[2], 0))
{
// point is not in the region
int numPoints = node->GetNumberOfPoints();
vtkKdNode* prevNode = node;
while(node->GetLeft() && numPoints > N)
{
prevNode = node;
double leftDist2 = node->GetLeft()->GetDistance2ToBoundary(x[0], x[1], x[2], 1);
double rightDist2 = node->GetRight()->GetDistance2ToBoundary(x[0], x[1], x[2], 1);
if(leftDist2 < rightDist2)
{
node = node->GetLeft();
}
else
{
node = node->GetRight();
}
numPoints = node->GetNumberOfPoints();
}
if(numPoints < N)
{
startingNode = prevNode;
}
else
{
startingNode = node;
}
}
else
{
int numPoints = node->GetNumberOfPoints();
vtkKdNode* prevNode = node;
while(node->GetLeft() && numPoints > N)
{
prevNode = node;
if(node->GetLeft()->ContainsPoint(x[0], x[1], x[2], 0))
{
node = node->GetLeft();
}
else
{
node = node->GetRight();
}
numPoints = node->GetNumberOfPoints();
}
if(numPoints < N)
{
startingNode = prevNode;
}
else
{
startingNode = node;
}
}
// now that we have a starting region, go through its points
// and order them
int regionId = startingNode->GetID();
int numPoints = startingNode->GetNumberOfPoints();
int where;
if(regionId >= 0)
{
where = this->LocatorRegionLocation[regionId];
}
else
{
vtkKdNode* left = startingNode->GetLeft();
vtkKdNode* next = left->GetLeft();
while(next)
{
left = next;
next = next->GetLeft();
}
int leftRegionId = left->GetID();
where = this->LocatorRegionLocation[leftRegionId];
}
int *ids = this->LocatorIds + where;
float* pt = this->LocatorPoints + (where*3);
float xfloat[3] = {x[0], x[1], x[2]};
OrderPoints orderedPoints(N);
for (int i=0; i<numPoints; i++)
{
float dist2 = vtkMath::Distance2BetweenPoints(xfloat, pt);
orderedPoints.InsertPoint(dist2, ids[i]);
pt += 3;
}
// to finish up we have to check other regions for
// closer points
float LargestDist2 = orderedPoints.GetLargestDist2();
double delta[3] = {0,0,0};
double bounds[6];
node = this->Top;
vtkstd::queue<vtkKdNode*> nodesToBeSearched;
nodesToBeSearched.push(node);
while(!nodesToBeSearched.empty())
{
node = nodesToBeSearched.front();
nodesToBeSearched.pop();
if(node == startingNode)
{
continue;
}
vtkKdNode* left = node->GetLeft();
if(left)
{
left->GetDataBounds(bounds);
if(vtkMath::PointIsWithinBounds(const_cast<double*>(x), bounds, delta) == 1 ||
left->GetDistance2ToBoundary(x[0], x[1], x[2], 1) < LargestDist2)
{
nodesToBeSearched.push(left);
}
node->GetRight()->GetDataBounds(bounds);
if(vtkMath::PointIsWithinBounds(const_cast<double*>(x), bounds, delta) == 1 ||
node->GetRight()->GetDistance2ToBoundary(x[0], x[1], x[2], 1) < LargestDist2)
{
nodesToBeSearched.push(node->GetRight());
}
}
else if(node->GetDistance2ToBoundary(x[0], x[1], x[2], 1) < LargestDist2)
{
regionId = node->GetID();
numPoints = node->GetNumberOfPoints();
where = this->LocatorRegionLocation[regionId];
ids = this->LocatorIds + where;
pt = this->LocatorPoints + (where*3);
for (int i=0; i<numPoints; i++)
{
float dist2 = vtkMath::Distance2BetweenPoints(xfloat, pt);
orderedPoints.InsertPoint(dist2, ids[i]);
pt += 3;
}
LargestDist2 = orderedPoints.GetLargestDist2();
}
}
orderedPoints.GetSortedIds(result);
}
//----------------------------------------------------------------------------
vtkIdTypeArray *vtkKdTree::GetPointsInRegion(int regionId)
{
if ( (regionId < 0) || (regionId >= this->NumberOfRegions))
{
vtkErrorMacro(<< "vtkKdTree::GetPointsInRegion invalid region ID");
return NULL;
}
if (!this->LocatorIds)
{
vtkErrorMacro(<< "vtkKdTree::GetPointsInRegion build locator first");
return NULL;
}
int numPoints = this->RegionList[regionId]->GetNumberOfPoints();
int where = this->LocatorRegionLocation[regionId];
vtkIdTypeArray *ptIds = vtkIdTypeArray::New();
ptIds->SetNumberOfValues(numPoints);
int *ids = this->LocatorIds + where;
for (int i=0; i<numPoints; i++)
{
ptIds->SetValue(i, ids[i]);
}
return ptIds;
}
//----------------------------------------------------------------------------
// Code to save state/time of last k-d tree build, and to
// determine if a data set's geometry has changed since the
// last build.
//
void vtkKdTree::InvalidateGeometry()
{
// Remove observers to data sets.
for (int i = 0; i < this->LastNumDataSets; i++)
{
this->LastInputDataSets[i]
->RemoveObserver(this->LastDataSetObserverTags[i]);
}
this->LastNumDataSets = 0;
}
//-----------------------------------------------------------------------------
void vtkKdTree::ClearLastBuildCache()
{
this->InvalidateGeometry();
if (this->LastDataCacheSize > 0)
{
delete [] this->LastInputDataSets;
delete [] this->LastDataSetObserverTags;
delete [] this->LastDataSetType;
delete [] this->LastInputDataInfo;
delete [] this->LastBounds;
delete [] this->LastNumCells;
delete [] this->LastNumPoints;
this->LastDataCacheSize = 0;
}
this->LastNumDataSets = 0;
this->LastInputDataSets = NULL;
this->LastDataSetObserverTags = NULL;
this->LastDataSetType = NULL;
this->LastInputDataInfo = NULL;
this->LastBounds = NULL;
this->LastNumPoints = NULL;
this->LastNumCells = NULL;
}
//----------------------------------------------------------------------------
void vtkKdTree::UpdateBuildTime()
{
this->BuildTime.Modified();
// Save enough information so that next time we execute,
// we can determine whether input geometry has changed.
this->InvalidateGeometry();
int numDataSets = this->GetNumberOfDataSets();
if (numDataSets > this->LastDataCacheSize)
{
this->ClearLastBuildCache();
this->LastInputDataSets = new vtkDataSet * [numDataSets];
this->LastDataSetObserverTags = new unsigned long [numDataSets];
this->LastDataSetType = new int [numDataSets];
this->LastInputDataInfo = new double [9 * numDataSets];
this->LastBounds = new double [6 * numDataSets];
this->LastNumPoints = new vtkIdType [numDataSets];
this->LastNumCells = new vtkIdType [numDataSets];
this->LastDataCacheSize = numDataSets;
}
this->LastNumDataSets = numDataSets;
int nextds = 0;
vtkCollectionSimpleIterator cookie;
this->DataSets->InitTraversal(cookie);
for (vtkDataSet *in = this->DataSets->GetNextDataSet(cookie);
in != NULL; in = this->DataSets->GetNextDataSet(cookie))
{
if (nextds >= numDataSets)
{
vtkErrorMacro(<< "vtkKdTree::UpdateBuildTime corrupt counts");
return;
}
vtkCallbackCommand *cbc = vtkCallbackCommand::New();
cbc->SetCallback(LastInputDeletedCallback);
cbc->SetClientData(this);
this->LastDataSetObserverTags[nextds]
= in->AddObserver(vtkCommand::DeleteEvent, cbc);
cbc->Delete();
this->LastInputDataSets[nextds] = in;
this->LastNumPoints[nextds] = in->GetNumberOfPoints();
this->LastNumCells[nextds] = in->GetNumberOfCells();
in->GetBounds(this->LastBounds + 6*nextds);
int type = this->LastDataSetType[nextds] = in->GetDataObjectType();
if ((type == VTK_IMAGE_DATA) || (type == VTK_UNIFORM_GRID))
{
double origin[3], spacing[3];
int dims[3];
if (type == VTK_IMAGE_DATA)
{
vtkImageData *id = vtkImageData::SafeDownCast(in);
id->GetDimensions(dims);
id->GetOrigin(origin);
id->GetSpacing(spacing);
}
else
{
vtkUniformGrid *ug = vtkUniformGrid::SafeDownCast(in);
ug->GetDimensions(dims);
ug->GetOrigin(origin);
ug->GetSpacing(spacing);
}
this->SetInputDataInfo(nextds, dims, origin, spacing);
}
nextds++;
}
}
//----------------------------------------------------------------------------
void vtkKdTree::SetInputDataInfo(int i, int dims[3], double origin[3],
double spacing[3])
{
int idx = 9*i;
this->LastInputDataInfo[idx++] = static_cast<double>(dims[0]);
this->LastInputDataInfo[idx++] = static_cast<double>(dims[1]);
this->LastInputDataInfo[idx++] = static_cast<double>(dims[2]);
this->LastInputDataInfo[idx++] = origin[0];
this->LastInputDataInfo[idx++] = origin[1];
this->LastInputDataInfo[idx++] = origin[2];
this->LastInputDataInfo[idx++] = spacing[0];
this->LastInputDataInfo[idx++] = spacing[1];
this->LastInputDataInfo[idx++] = spacing[2];
}
//----------------------------------------------------------------------------
int vtkKdTree::CheckInputDataInfo(int i, int dims[3], double origin[3],
double spacing[3])
{
int sameValues = 1;
int idx = 9*i;
if ((dims[0] != static_cast<int>(this->LastInputDataInfo[idx])) ||
(dims[1] != static_cast<int>(this->LastInputDataInfo[idx+1])) ||
(dims[2] != static_cast<int>(this->LastInputDataInfo[idx+2])) ||
(origin[0] != this->LastInputDataInfo[idx+3]) ||
(origin[1] != this->LastInputDataInfo[idx+4]) ||
(origin[2] != this->LastInputDataInfo[idx+5]) ||
(spacing[0] != this->LastInputDataInfo[idx+6]) ||
(spacing[1] != this->LastInputDataInfo[idx+7]) ||
(spacing[2] != this->LastInputDataInfo[idx+8]) )
{
sameValues = 0;
}
return sameValues;
}
//----------------------------------------------------------------------------
int vtkKdTree::NewGeometry()
{
if (this->GetNumberOfDataSets() != this->LastNumDataSets)
{
return 1;
}
vtkDataSet **tmp = new vtkDataSet * [this->GetNumberOfDataSets()];
for (int i=0; i < this->GetNumberOfDataSets(); i++)
{
tmp[i] = this->GetDataSet(i);
}
int itsNew = this->NewGeometry(tmp, this->GetNumberOfDataSets());
delete [] tmp;
return itsNew;
}
int vtkKdTree::NewGeometry(vtkDataSet **sets, int numSets)
{
int newGeometry = 0;
#if 0
vtkPointSet *ps = NULL;
#endif
vtkRectilinearGrid *rg = NULL;
vtkImageData *id = NULL;
vtkUniformGrid *ug = NULL;
int same=0;
int dims[3];
double origin[3], spacing[3];
if (numSets != this->LastNumDataSets)
{
return 1;
}
for (int i=0; i<numSets; i++)
{
vtkDataSet *in = this->LastInputDataSets[i];
int type = in->GetDataObjectType();
if (type != this->LastDataSetType[i])
{
newGeometry = 1;
break;
}
switch (type)
{
case VTK_POLY_DATA:
case VTK_UNSTRUCTURED_GRID:
case VTK_STRUCTURED_GRID:
#if 0
// For now, vtkPExodusReader creates a whole new
// vtkUnstructuredGrid, even when just changing
// field arrays. So we'll just check bounds.
ps = vtkPointSet::SafeDownCast(in);
if (ps->GetPoints()->GetMTime() > this->BuildTime)
{
newGeometry = 1;
}
#else
if ((sets[i]->GetNumberOfPoints() != this->LastNumPoints[i]) ||
(sets[i]->GetNumberOfCells() != this->LastNumCells[i]) )
{
newGeometry = 1;
}
else
{
double b[6];
sets[i]->GetBounds(b);
double *lastb = this->LastBounds + 6*i;
for (int dim=0; dim<6; dim++)
{
if (*lastb++ != b[dim])
{
newGeometry = 1;
break;
}
}
}
#endif
break;
case VTK_RECTILINEAR_GRID:
rg = vtkRectilinearGrid::SafeDownCast(in);
if ((rg->GetXCoordinates()->GetMTime() > this->BuildTime) ||
(rg->GetYCoordinates()->GetMTime() > this->BuildTime) ||
(rg->GetZCoordinates()->GetMTime() > this->BuildTime) )
{
newGeometry = 1;
}
break;
case VTK_IMAGE_DATA:
case VTK_STRUCTURED_POINTS:
id = vtkImageData::SafeDownCast(in);
id->GetDimensions(dims);
id->GetOrigin(origin);
id->GetSpacing(spacing);
same = this->CheckInputDataInfo(i, dims, origin, spacing);
if (!same)
{
newGeometry = 1;
}
break;
case VTK_UNIFORM_GRID:
ug = vtkUniformGrid::SafeDownCast(in);
ug->GetDimensions(dims);
ug->GetOrigin(origin);
ug->GetSpacing(spacing);
same = this->CheckInputDataInfo(i, dims, origin, spacing);
if (!same)
{
newGeometry = 1;
}
else if (ug->GetPointVisibilityArray()->GetMTime() >
this->BuildTime)
{
newGeometry = 1;
}
else if (ug->GetCellVisibilityArray()->GetMTime() >
this->BuildTime)
{
newGeometry = 1;
}
break;
default:
vtkWarningMacro(<<
"vtkKdTree::NewGeometry: unanticipated type");
newGeometry = 1;
}
if (newGeometry)
{
break;
}
}
return newGeometry;
}
//----------------------------------------------------------------------------
void vtkKdTree::__printTree(vtkKdNode *kd, int depth, int v)
{
if (v)
{
kd->PrintVerboseNode(depth);
}
else
{
kd->PrintNode(depth);
}
if (kd->GetLeft())
{
vtkKdTree::__printTree(kd->GetLeft(), depth+1, v);
}
if (kd->GetRight())
{
vtkKdTree::__printTree(kd->GetRight(), depth+1, v);
}
}
//----------------------------------------------------------------------------
void vtkKdTree::_printTree(int v)
{
vtkKdTree::__printTree(this->Top, 0, v);
}
//----------------------------------------------------------------------------
void vtkKdTree::PrintRegion(int id)
{
this->RegionList[id]->PrintNode(0);
}
//----------------------------------------------------------------------------
void vtkKdTree::PrintTree()
{
_printTree(0);
}
//----------------------------------------------------------------------------
void vtkKdTree::PrintVerboseTree()
{
_printTree(1);
}
//----------------------------------------------------------------------------
void vtkKdTree::FreeSearchStructure()
{
if (this->Top)
{
vtkKdTree::DeleteAllDescendants(this->Top);
this->Top->Delete();
this->Top = NULL;
}
if (this->RegionList)
{
delete [] this->RegionList;
this->RegionList = NULL;
}
this->NumberOfRegions = 0;
this->SetActualLevel();
this->DeleteCellLists();
if (this->CellRegionList)
{
delete [] this->CellRegionList;
this->CellRegionList = NULL;
}
if (this->LocatorPoints)
{
delete [] this->LocatorPoints;
this->LocatorPoints = NULL;
}
if (this->LocatorIds)
{
delete [] this->LocatorIds;
this->LocatorIds = NULL;
}
if (this->LocatorRegionLocation)
{
delete [] this->LocatorRegionLocation;
this->LocatorRegionLocation = NULL;
}
}
//----------------------------------------------------------------------------
// build PolyData representation of all spacial regions------------
//
void vtkKdTree::GenerateRepresentation(int level, vtkPolyData *pd)
{
if (this->GenerateRepresentationUsingDataBounds)
{
this->GenerateRepresentationDataBounds(level, pd);
}
else
{
this->GenerateRepresentationWholeSpace(level, pd);
}
}
//----------------------------------------------------------------------------
void vtkKdTree::GenerateRepresentationWholeSpace(int level, vtkPolyData *pd)
{
int i;
vtkPoints *pts;
vtkCellArray *polys;
if ( this->Top == NULL )
{
vtkErrorMacro(<<"vtkKdTree::GenerateRepresentation empty tree");
return;
}
if ((level < 0) || (level > this->Level))
{
level = this->Level;
}
int npoints = 0;
int npolys = 0;
for (i=0 ; i < level; i++)
{
int levelPolys = 1 << (i-1);
npoints += (4 * levelPolys);
npolys += levelPolys;
}
pts = vtkPoints::New();
pts->Allocate(npoints);
polys = vtkCellArray::New();
polys->Allocate(npolys);
// level 0 bounding box
vtkIdType ids[8];
vtkIdType idList[4];
double x[3];
vtkKdNode *kd = this->Top;
double *min = kd->GetMinBounds();
double *max = kd->GetMaxBounds();
x[0] = min[0]; x[1] = max[1]; x[2] = min[2];
ids[0] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = max[1]; x[2] = min[2];
ids[1] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = max[1]; x[2] = max[2];
ids[2] = pts->InsertNextPoint(x);
x[0] = min[0]; x[1] = max[1]; x[2] = max[2];
ids[3] = pts->InsertNextPoint(x);
x[0] = min[0]; x[1] = min[1]; x[2] = min[2];
ids[4] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = min[1]; x[2] = min[2];
ids[5] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = min[1]; x[2] = max[2];
ids[6] = pts->InsertNextPoint(x);
x[0] = min[0]; x[1] = min[1]; x[2] = max[2];
ids[7] = pts->InsertNextPoint(x);
idList[0] = ids[0]; idList[1] = ids[1]; idList[2] = ids[2]; idList[3] = ids[3];
polys->InsertNextCell(4, idList);
idList[0] = ids[1]; idList[1] = ids[5]; idList[2] = ids[6]; idList[3] = ids[2];
polys->InsertNextCell(4, idList);
idList[0] = ids[5]; idList[1] = ids[4]; idList[2] = ids[7]; idList[3] = ids[6];
polys->InsertNextCell(4, idList);
idList[0] = ids[4]; idList[1] = ids[0]; idList[2] = ids[3]; idList[3] = ids[7];
polys->InsertNextCell(4, idList);
idList[0] = ids[3]; idList[1] = ids[2]; idList[2] = ids[6]; idList[3] = ids[7];
polys->InsertNextCell(4, idList);
idList[0] = ids[1]; idList[1] = ids[0]; idList[2] = ids[4]; idList[3] = ids[5];
polys->InsertNextCell(4, idList);
if (kd->GetLeft() && (level > 0))
{
this->_generateRepresentationWholeSpace(kd, pts, polys, level-1);
}
pd->SetPoints(pts);
pts->Delete();
pd->SetPolys(polys);
polys->Delete();
pd->Squeeze();
}
//----------------------------------------------------------------------------
void vtkKdTree::_generateRepresentationWholeSpace(vtkKdNode *kd,
vtkPoints *pts,
vtkCellArray *polys,
int level)
{
int i;
double p[4][3];
vtkIdType ids[4];
if ((level < 0) || (kd->GetLeft() == NULL))
{
return;
}
double *min = kd->GetMinBounds();
double *max = kd->GetMaxBounds();
double *leftmax = kd->GetLeft()->GetMaxBounds();
// splitting plane
switch (kd->GetDim())
{
case XDIM:
p[0][0] = leftmax[0]; p[0][1] = max[1]; p[0][2] = max[2];
p[1][0] = leftmax[0]; p[1][1] = max[1]; p[1][2] = min[2];
p[2][0] = leftmax[0]; p[2][1] = min[1]; p[2][2] = min[2];
p[3][0] = leftmax[0]; p[3][1] = min[1]; p[3][2] = max[2];
break;
case YDIM:
p[0][0] = min[0]; p[0][1] = leftmax[1]; p[0][2] = max[2];
p[1][0] = min[0]; p[1][1] = leftmax[1]; p[1][2] = min[2];
p[2][0] = max[0]; p[2][1] = leftmax[1]; p[2][2] = min[2];
p[3][0] = max[0]; p[3][1] = leftmax[1]; p[3][2] = max[2];
break;
case ZDIM:
p[0][0] = min[0]; p[0][1] = min[1]; p[0][2] = leftmax[2];
p[1][0] = min[0]; p[1][1] = max[1]; p[1][2] = leftmax[2];
p[2][0] = max[0]; p[2][1] = max[1]; p[2][2] = leftmax[2];
p[3][0] = max[0]; p[3][1] = min[1]; p[3][2] = leftmax[2];
break;
}
for (i=0; i<4; i++) ids[i] = pts->InsertNextPoint(p[i]);
polys->InsertNextCell(4, ids);
this->_generateRepresentationWholeSpace(kd->GetLeft(), pts, polys, level-1);
this->_generateRepresentationWholeSpace(kd->GetRight(), pts, polys, level-1);
}
//----------------------------------------------------------------------------
void vtkKdTree::GenerateRepresentationDataBounds(int level, vtkPolyData *pd)
{
int i;
vtkPoints *pts;
vtkCellArray *polys;
if ( this->Top == NULL )
{
vtkErrorMacro(<<"vtkKdTree::GenerateRepresentation no tree");
return;
}
if ((level < 0) || (level > this->Level))
{
level = this->Level;
}
int npoints = 0;
int npolys = 0;
for (i=0; i < level; i++)
{
int levelBoxes= 1 << i;
npoints += (8 * levelBoxes);
npolys += (6 * levelBoxes);
}
pts = vtkPoints::New();
pts->Allocate(npoints);
polys = vtkCellArray::New();
polys->Allocate(npolys);
_generateRepresentationDataBounds(this->Top, pts, polys, level);
pd->SetPoints(pts);
pts->Delete();
pd->SetPolys(polys);
polys->Delete();
pd->Squeeze();
}
//----------------------------------------------------------------------------
void vtkKdTree::_generateRepresentationDataBounds(vtkKdNode *kd, vtkPoints *pts,
vtkCellArray *polys, int level)
{
if (level > 0)
{
if (kd->GetLeft())
{
_generateRepresentationDataBounds(kd->GetLeft(), pts, polys, level-1);
_generateRepresentationDataBounds(kd->GetRight(), pts, polys, level-1);
}
return;
}
vtkKdTree::AddPolys(kd, pts, polys);
}
//----------------------------------------------------------------------------
// PolyData rep. of all spacial regions, shrunk to data bounds-------
//
void vtkKdTree::AddPolys(vtkKdNode *kd, vtkPoints *pts, vtkCellArray *polys)
{
vtkIdType ids[8];
vtkIdType idList[4];
double x[3];
double *min;
double *max;
if (this->GenerateRepresentationUsingDataBounds)
{
min = kd->GetMinDataBounds();
max = kd->GetMaxDataBounds();
}
else
{
min = kd->GetMinBounds();
max = kd->GetMaxBounds();
}
x[0] = min[0]; x[1] = max[1]; x[2] = min[2];
ids[0] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = max[1]; x[2] = min[2];
ids[1] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = max[1]; x[2] = max[2];
ids[2] = pts->InsertNextPoint(x);
x[0] = min[0]; x[1] = max[1]; x[2] = max[2];
ids[3] = pts->InsertNextPoint(x);
x[0] = min[0]; x[1] = min[1]; x[2] = min[2];
ids[4] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = min[1]; x[2] = min[2];
ids[5] = pts->InsertNextPoint(x);
x[0] = max[0]; x[1] = min[1]; x[2] = max[2];
ids[6] = pts->InsertNextPoint(x);
x[0] = min[0]; x[1] = min[1]; x[2] = max[2];
ids[7] = pts->InsertNextPoint(x);
idList[0] = ids[0]; idList[1] = ids[1]; idList[2] = ids[2]; idList[3] = ids[3];
polys->InsertNextCell(4, idList);
idList[0] = ids[1]; idList[1] = ids[5]; idList[2] = ids[6]; idList[3] = ids[2];
polys->InsertNextCell(4, idList);
idList[0] = ids[5]; idList[1] = ids[4]; idList[2] = ids[7]; idList[3] = ids[6];
polys->InsertNextCell(4, idList);
idList[0] = ids[4]; idList[1] = ids[0]; idList[2] = ids[3]; idList[3] = ids[7];
polys->InsertNextCell(4, idList);
idList[0] = ids[3]; idList[1] = ids[2]; idList[2] = ids[6]; idList[3] = ids[7];
polys->InsertNextCell(4, idList);
idList[0] = ids[1]; idList[1] = ids[0]; idList[2] = ids[4]; idList[3] = ids[5];
polys->InsertNextCell(4, idList);
}
//----------------------------------------------------------------------------
// PolyData representation of a list of spacial regions------------
//
void vtkKdTree::GenerateRepresentation(int *regions, int len, vtkPolyData *pd)
{
int i;
vtkPoints *pts;
vtkCellArray *polys;
if ( this->Top == NULL )
{
vtkErrorMacro(<<"vtkKdTree::GenerateRepresentation no tree");
return;
}
int npoints = 8 * len;
int npolys = 6 * len;
pts = vtkPoints::New();
pts->Allocate(npoints);
polys = vtkCellArray::New();
polys->Allocate(npolys);
for (i=0; i<len; i++)
{
if ((regions[i] < 0) || (regions[i] >= this->NumberOfRegions))
{
break;
}
vtkKdTree::AddPolys(this->RegionList[regions[i]], pts, polys);
}
pd->SetPoints(pts);
pts->Delete();
pd->SetPolys(polys);
polys->Delete();
pd->Squeeze();
}
//----------------------------------------------------------------------------
// Cell ID lists
//
#define SORTLIST(l, lsize) vtkstd::sort(l, l + lsize)
#define REMOVEDUPLICATES(l, lsize, newsize) \
{ \
int ii,jj; \
for (ii=0, jj=0; ii<lsize; ii++) \
{ \
if ((ii > 0) && (l[ii] == l[jj-1])) \
{ \
continue; \
} \
if (jj != ii) \
{ \
l[jj] = l[ii]; \
} \
jj++; \
} \
newsize = jj; \
}
//----------------------------------------------------------------------------
int vtkKdTree::FoundId(vtkIntArray *idArray, int id)
{
// This is a simple linear search, because I think it is rare that
// an id array would be provided, and if one is it should be small.
int found = 0;
int len = idArray->GetNumberOfTuples();
int *ids = idArray->GetPointer(0);
for (int i=0; i<len; i++)
{
if (ids[i] == id)
{
found = 1;
}
}
return found;
}
//----------------------------------------------------------------------------
int vtkKdTree::findRegion(vtkKdNode *node, float x, float y, float z)
{
return vtkKdTree::findRegion(node,static_cast<double>(x),static_cast<double>(y),static_cast<double>(z));
}
//----------------------------------------------------------------------------
int vtkKdTree::findRegion(vtkKdNode *node, double x, double y, double z)
{
int regionId;
if (!node->ContainsPoint(x, y, z, 0))
{
return -1;
}
if (node->GetLeft() == NULL)
{
regionId = node->GetID();
}
else
{
regionId = vtkKdTree::findRegion(node->GetLeft(), x, y, z);
if (regionId < 0)
{
regionId = vtkKdTree::findRegion(node->GetRight(), x, y, z);
}
}
return regionId;
}
//----------------------------------------------------------------------------
void vtkKdTree::CreateCellLists()
{
this->CreateCellLists(static_cast<int *>(NULL), 0);
return;
}
//----------------------------------------------------------------------------
void vtkKdTree::CreateCellLists(int *regionList, int listSize)
{
this->CreateCellLists(this->GetDataSet(), regionList, listSize);
return;
}
//----------------------------------------------------------------------------
void vtkKdTree::CreateCellLists(int dataSetIndex, int *regionList, int listSize)
{
vtkDataSet *dataSet = this->GetDataSet(dataSetIndex);
if (!dataSet)
{
vtkErrorMacro(<<"vtkKdTree::CreateCellLists invalid data set");
return;
}
this->CreateCellLists(dataSet, regionList, listSize);
return;
}
//----------------------------------------------------------------------------
void vtkKdTree::CreateCellLists(vtkDataSet *set, int *regionList, int listSize)
{
int i, AllRegions;
if ( this->GetDataSetIndex(set) < 0)
{
vtkErrorMacro(<<"vtkKdTree::CreateCellLists invalid data set");
return;
}
vtkKdTree::_cellList *list = &this->CellList;
if (list->nRegions > 0)
{
this->DeleteCellLists();
}
list->emptyList = vtkIdList::New();
list->dataSet = set;
if ((regionList == NULL) || (listSize == 0))
{
list->nRegions = this->NumberOfRegions; // all regions
}
else
{
list->regionIds = new int [listSize];
if (!list->regionIds)
{
vtkErrorMacro(<<"vtkKdTree::CreateCellLists memory allocation");
return;
}
memcpy(list->regionIds, regionList, sizeof(int) * listSize);
SORTLIST(list->regionIds, listSize);
REMOVEDUPLICATES(list->regionIds, listSize, list->nRegions);
if (list->nRegions == this->NumberOfRegions)
{
delete [] list->regionIds;
list->regionIds = NULL;
}
}
if (list->nRegions == this->NumberOfRegions)
{
AllRegions = 1;
}
else
{
AllRegions = 0;
}
int *idlist = NULL;
int idListLen = 0;
if (this->IncludeRegionBoundaryCells)
{
list->boundaryCells = new vtkIdList * [list->nRegions];
if (!list->boundaryCells)
{
vtkErrorMacro(<<"vtkKdTree::CreateCellLists memory allocation");
return;
}
for (i=0; i<list->nRegions; i++)
{
list->boundaryCells[i] = vtkIdList::New();
}
idListLen = this->NumberOfRegions;
idlist = new int [idListLen];
}
int *listptr = NULL;
if (!AllRegions)
{
listptr = new int [this->NumberOfRegions];
if (!listptr)
{
vtkErrorMacro(<<"vtkKdTree::CreateCellLists memory allocation");
return;
}
for (i=0; i<this->NumberOfRegions; i++)
{
listptr[i] = -1;
}
}
list->cells = new vtkIdList * [list->nRegions];
if (!list->cells)
{
vtkErrorMacro(<<"vtkKdTree::CreateCellLists memory allocation");
return;
}
for (i = 0; i < list->nRegions; i++)
{
list->cells[i] = vtkIdList::New();
if (listptr)
{
listptr[list->regionIds[i]] = i;
}
}
// acquire a list in cell Id order of the region Id each
// cell centroid falls in
int *regList = this->CellRegionList;
if (regList == NULL)
{
regList = this->AllGetRegionContainingCell();
}
int setNum = this->GetDataSetIndex(set);
if (setNum > 0)
{
int ncells = this->GetDataSetsNumberOfCells(0,setNum-1);
regList += ncells;
}
int nCells = set->GetNumberOfCells();
for (int cellId=0; cellId<nCells; cellId++)
{
if (this->IncludeRegionBoundaryCells)
{
// Find all regions the cell intersects, including
// the region the cell centroid lies in.
// This can be an expensive calculation, intersections
// of a convex region with axis aligned boxes.
int nRegions =
this->BSPCalculator->IntersectsCell(idlist, idListLen,
set->GetCell(cellId), regList[cellId]);
if (nRegions == 1)
{
int idx = (listptr) ? listptr[idlist[0]] : idlist[0];
if (idx >= 0)
{
list->cells[idx]->InsertNextId(cellId);
}
}
else
{
for (int r=0; r < nRegions; r++)
{
int regionId = idlist[r];
int idx = (listptr) ? listptr[regionId] : regionId;
if (idx < 0)
{
continue;
}
if (regionId == regList[cellId])
{
list->cells[idx]->InsertNextId(cellId);
}
else
{
list->boundaryCells[idx]->InsertNextId(cellId);
}
}
}
}
else
{
// just find the region the cell centroid lies in - easy
int regionId = regList[cellId];
int idx = (listptr) ? listptr[regionId] : regionId;
if (idx >= 0)
{
list->cells[idx]->InsertNextId(cellId);
}
}
}
if (listptr)
{
delete [] listptr;
}
if (idlist)
{
delete [] idlist;
}
}
//----------------------------------------------------------------------------
vtkIdList * vtkKdTree::GetList(int regionId, vtkIdList **which)
{
int i;
struct _cellList *list = &this->CellList;
vtkIdList *cellIds = NULL;
if (which && (list->nRegions == this->NumberOfRegions))
{
cellIds = which[regionId];
}
else if (which)
{
for (i=0; i< list->nRegions; i++)
{
if (list->regionIds[i] == regionId)
{
cellIds = which[i];
break;
}
}
}
else
{
cellIds = list->emptyList;
}
return cellIds;
}
//----------------------------------------------------------------------------
vtkIdList * vtkKdTree::GetCellList(int regionID)
{
return this->GetList(regionID, this->CellList.cells);
}
//----------------------------------------------------------------------------
vtkIdList * vtkKdTree::GetBoundaryCellList(int regionID)
{
return this->GetList(regionID, this->CellList.boundaryCells);
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::GetCellLists(vtkIntArray *regions,
int setIndex, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells)
{
vtkDataSet *set = this->GetDataSet(setIndex);
if (!set)
{
vtkErrorMacro(<<"vtkKdTree::GetCellLists no such data set");
return 0;
}
return this->GetCellLists(regions, set,
inRegionCells, onBoundaryCells);
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::GetCellLists(vtkIntArray *regions,
vtkIdList *inRegionCells, vtkIdList *onBoundaryCells)
{
return this->GetCellLists(regions, this->GetDataSet(),
inRegionCells, onBoundaryCells);
}
//----------------------------------------------------------------------------
vtkIdType vtkKdTree::GetCellLists(vtkIntArray *regions, vtkDataSet *set,
vtkIdList *inRegionCells, vtkIdList *onBoundaryCells)
{
int reg, regionId;
vtkIdType cell, cellId, numCells;
vtkIdList *cellIds;
vtkIdType totalCells = 0;
if ( (inRegionCells == NULL) && (onBoundaryCells == NULL))
{
return totalCells;
}
int nregions = regions->GetNumberOfTuples();
if (nregions == 0)
{
return totalCells;
}
// Do I have cell lists for all these regions? If not, build cell
// lists for all regions for this data set.
int rebuild = 0;
if (this->CellList.dataSet != set)
{
rebuild = 1;
}
else if (nregions > this->CellList.nRegions)
{
rebuild = 1;
}
else if ((onBoundaryCells != NULL) && (this->CellList.boundaryCells == NULL))
{
rebuild = 1;
}
else if (this->CellList.nRegions < this->NumberOfRegions)
{
// these two lists should generally be "short"
int *haveIds = this->CellList.regionIds;
for (int wantReg=0; wantReg < nregions; wantReg++)
{
int wantRegion = regions->GetValue(wantReg);
int gotId = 0;
for (int haveReg=0; haveReg < this->CellList.nRegions; haveReg++)
{
if (haveIds[haveReg] == wantRegion)
{
gotId = 1;
break;
}
}
if (!gotId)
{
rebuild = 1;
break;
}
}
}
if (rebuild)
{
if (onBoundaryCells != NULL)
{
this->IncludeRegionBoundaryCellsOn();
}
this->CreateCellLists(set, NULL, 0); // for all regions
}
// OK, we have cell lists for these regions. Make lists of region
// cells and boundary cells.
int CheckSet = (onBoundaryCells && (nregions > 1));
vtkstd::set<vtkIdType> ids;
vtkstd::pair<vtkstd::set<vtkIdType>::iterator, bool> idRec;
vtkIdType totalRegionCells = 0;
vtkIdType totalBoundaryCells = 0;
vtkIdList **inRegionList = new vtkIdList * [nregions];
// First the cell IDs with centroid in the regions
for (reg = 0; reg < nregions; reg++)
{
regionId = regions->GetValue(reg);
inRegionList[reg] = this->GetCellList(regionId);
totalRegionCells += inRegionList[reg]->GetNumberOfIds();
}
if (inRegionCells)
{
inRegionCells->Initialize();
inRegionCells->SetNumberOfIds(totalRegionCells);
}
int nextCell = 0;
for (reg = 0; reg < nregions; reg++)
{
cellIds = inRegionList[reg];
numCells = cellIds->GetNumberOfIds();
for (cell = 0; cell < numCells; cell++)
{
if (inRegionCells)
{
inRegionCells->SetId(nextCell++, cellIds->GetId(cell));
}
if (CheckSet)
{
// We have to save the ids, so we don't include
// them as boundary cells. A cell in one region
// may be a boundary cell of another region.
ids.insert(cellIds->GetId(cell));
}
}
}
delete [] inRegionList;
if (onBoundaryCells == NULL)
{
return totalRegionCells;
}
// Now the list of all cells on the boundary of the regions,
// which do not have their centroid in one of the regions
onBoundaryCells->Initialize();
for (reg = 0; reg < nregions; reg++)
{
regionId = regions->GetValue(reg);
cellIds = this->GetBoundaryCellList(regionId);
numCells = cellIds->GetNumberOfIds();
for (cell = 0; cell < numCells; cell++)
{
cellId = cellIds->GetId(cell);
if (CheckSet)
{
// if we already included this cell because it is within
// one of the regions, or on the boundary of another, skip it
idRec = ids.insert(cellId);
if (idRec.second == 0)
{
continue;
}
}
onBoundaryCells->InsertNextId(cellId);
totalBoundaryCells++;
}
totalCells += totalBoundaryCells;
}
return totalCells;
}
//----------------------------------------------------------------------------
int vtkKdTree::GetRegionContainingCell(vtkIdType cellID)
{
return this->GetRegionContainingCell(this->GetDataSet(), cellID);
}
//----------------------------------------------------------------------------
int vtkKdTree::GetRegionContainingCell(int setIndex, vtkIdType cellID)
{
vtkDataSet *set = this->GetDataSet(setIndex);
if (!set)
{
vtkErrorMacro(<<"vtkKdTree::GetRegionContainingCell no such data set");
return -1;
}
return this->GetRegionContainingCell(set, cellID);
}
//----------------------------------------------------------------------------
int vtkKdTree::GetRegionContainingCell(vtkDataSet *set, vtkIdType cellID)
{
int regionID = -1;
if ( this->GetDataSetIndex(set) < 0)
{
vtkErrorMacro(<<"vtkKdTree::GetRegionContainingCell no such data set");
return -1;
}
if ( (cellID < 0) || (cellID >= set->GetNumberOfCells()))
{
vtkErrorMacro(<<"vtkKdTree::GetRegionContainingCell bad cell ID");
return -1;
}
if (this->CellRegionList)
{
if (set == this->GetDataSet()) // 99.99999% of the time
{
return this->CellRegionList[cellID];
}
int setNum = this->GetDataSetIndex(set);
int offset = this->GetDataSetsNumberOfCells(0, setNum-1);
return this->CellRegionList[offset + cellID];
}
float center[3];
this->ComputeCellCenter(set, cellID, center);
regionID = this->GetRegionContainingPoint(center[0], center[1], center[2]);
return regionID;
}
//----------------------------------------------------------------------------
int *vtkKdTree::AllGetRegionContainingCell()
{
if (this->CellRegionList)
{
return this->CellRegionList;
}
this->CellRegionList = new int [this->GetNumberOfCells()];
if (!this->CellRegionList)
{
vtkErrorMacro(<<"vtkKdTree::AllGetRegionContainingCell memory allocation");
return NULL;
}
int *listPtr = this->CellRegionList;
vtkCollectionSimpleIterator cookie;
this->DataSets->InitTraversal(cookie);
for (vtkDataSet *iset = this->DataSets->GetNextDataSet(cookie);
iset != NULL; iset = this->DataSets->GetNextDataSet(cookie))
{
int setCells = iset->GetNumberOfCells();
float *centers = this->ComputeCellCenters(iset);
float *pt = centers;
for (int cellId = 0; cellId < setCells; cellId++)
{
listPtr[cellId] =
this->GetRegionContainingPoint(pt[0], pt[1], pt[2]);
pt += 3;
}
listPtr += setCells;
delete [] centers;
}
return this->CellRegionList;
}
//----------------------------------------------------------------------------
int vtkKdTree::GetRegionContainingPoint(double x, double y, double z)
{
return vtkKdTree::findRegion(this->Top, x, y, z);
}
//----------------------------------------------------------------------------
int vtkKdTree::MinimalNumberOfConvexSubRegions(vtkIntArray *regionIdList,
double **convexSubRegions)
{
int nids = 0;
if ((regionIdList == NULL) ||
((nids = regionIdList->GetNumberOfTuples()) == 0))
{
vtkErrorMacro(<<
"vtkKdTree::MinimalNumberOfConvexSubRegions no regions specified");
return 0;
}
int i;
int *ids = regionIdList->GetPointer(0);
if (nids == 1)
{
if ( (ids[0] < 0) || (ids[0] >= this->NumberOfRegions))
{
vtkErrorMacro(<<
"vtkKdTree::MinimalNumberOfConvexSubRegions bad region ID");
return 0;
}
double *bounds = new double [6];
this->RegionList[ids[0]]->GetBounds(bounds);
*convexSubRegions = bounds;
return 1;
}
// create a sorted list of unique region Ids
vtkstd::set<int> idSet;
vtkstd::set<int>::iterator it;
for (i=0; i<nids; i++)
{
idSet.insert(ids[i]);
}
int nUniqueIds = static_cast<int>(idSet.size());
int *idList = new int [nUniqueIds];
for (i=0, it = idSet.begin(); it != idSet.end(); ++it, ++i)
{
idList[i] = *it;
}
vtkKdNode **regions = new vtkKdNode * [nUniqueIds];
int nregions = vtkKdTree::__ConvexSubRegions(idList, nUniqueIds, this->Top, regions);
double *bounds = new double [nregions * 6];
for (i=0; i<nregions; i++)
{
regions[i]->GetBounds(bounds + (i*6));
}
*convexSubRegions = bounds;
delete [] idList;
delete [] regions;
return nregions;
}
//----------------------------------------------------------------------------
int vtkKdTree::__ConvexSubRegions(int *ids, int len, vtkKdNode *tree, vtkKdNode **nodes)
{
int nregions = tree->GetMaxID() - tree->GetMinID() + 1;
if (nregions == len)
{
*nodes = tree;
return 1;
}
if (tree->GetLeft() == NULL)
{
return 0;
}
int min = ids[0];
int max = ids[len-1];
int leftMax = tree->GetLeft()->GetMaxID();
int rightMin = tree->GetRight()->GetMinID();
if (max <= leftMax)
{
return vtkKdTree::__ConvexSubRegions(ids, len, tree->GetLeft(), nodes);
}
else if (min >= rightMin)
{
return vtkKdTree::__ConvexSubRegions(ids, len, tree->GetRight(), nodes);
}
else
{
int leftIds = 1;
for (int i=1; i<len-1; i++)
{
if (ids[i] <= leftMax)
{
leftIds++;
}
else
{
break;
}
}
int numNodesLeft =
vtkKdTree::__ConvexSubRegions(ids, leftIds, tree->GetLeft(), nodes);
int numNodesRight =
vtkKdTree::__ConvexSubRegions(ids + leftIds, len - leftIds,
tree->GetRight(), nodes + numNodesLeft);
return (numNodesLeft + numNodesRight);
}
}
//-----------------------------------------------------------------------------
#ifndef VTK_LEGACY_REMOVE
int vtkKdTree::DepthOrderRegions(vtkIntArray *regionIds,
double *directionOfProjection,
vtkIntArray *orderedList)
{
VTK_LEGACY_REPLACED_BODY(vtkKdTree::DepthOrderRegions, "VTK 5.2",
vtkKdTree::ViewOrderRegionsInDirection);
return this->ViewOrderRegionsInDirection(regionIds, directionOfProjection,
orderedList);
}
int vtkKdTree::DepthOrderAllRegions(double *directionOfProjection,
vtkIntArray *orderedList)
{
VTK_LEGACY_REPLACED_BODY(vtkKdTree::DepthOrderAllRegions, "VTK 5.2",
vtkKdTree::ViewOrderAllRegionsInDirection);
return this->ViewOrderAllRegionsInDirection(directionOfProjection,
orderedList);
}
#endif //VTK_LEGACY_REMOVE
//----------------------------------------------------------------------------
int vtkKdTree::ViewOrderRegionsInDirection(
vtkIntArray *regionIds,
const double directionOfProjection[3],
vtkIntArray *orderedList)
{
int i;
vtkIntArray *IdsOfInterest = NULL;
if (regionIds && (regionIds->GetNumberOfTuples() > 0))
{
// Created sorted list of unique ids
vtkstd::set<int> ids;
vtkstd::set<int>::iterator it;
int nids = regionIds->GetNumberOfTuples();
for (i=0; i<nids; i++)
{
ids.insert(regionIds->GetValue(i));
}
if (ids.size() < static_cast<unsigned int>(this->NumberOfRegions))
{
IdsOfInterest = vtkIntArray::New();
IdsOfInterest->SetNumberOfValues(ids.size());
for (it = ids.begin(), i=0; it != ids.end(); ++it, ++i)
{
IdsOfInterest->SetValue(i, *it);
}
}
}
int size = this->_ViewOrderRegionsInDirection(IdsOfInterest,
directionOfProjection,
orderedList);
if (IdsOfInterest)
{
IdsOfInterest->Delete();
}
return size;
}
//----------------------------------------------------------------------------
int vtkKdTree::ViewOrderAllRegionsInDirection(
const double directionOfProjection[3],
vtkIntArray *orderedList)
{
return this->_ViewOrderRegionsInDirection(NULL, directionOfProjection,
orderedList);
}
//----------------------------------------------------------------------------
int vtkKdTree::ViewOrderRegionsFromPosition(vtkIntArray *regionIds,
const double cameraPosition[3],
vtkIntArray *orderedList)
{
int i;
vtkIntArray *IdsOfInterest = NULL;
if (regionIds && (regionIds->GetNumberOfTuples() > 0))
{
// Created sorted list of unique ids
vtkstd::set<int> ids;
vtkstd::set<int>::iterator it;
int nids = regionIds->GetNumberOfTuples();
for (i=0; i<nids; i++)
{
ids.insert(regionIds->GetValue(i));
}
if (ids.size() < static_cast<unsigned int>(this->NumberOfRegions))
{
IdsOfInterest = vtkIntArray::New();
IdsOfInterest->SetNumberOfValues(ids.size());
for (it = ids.begin(), i=0; it != ids.end(); ++it, ++i)
{
IdsOfInterest->SetValue(i, *it);
}
}
}
int size = this->_ViewOrderRegionsFromPosition(IdsOfInterest,
cameraPosition,
orderedList);
if (IdsOfInterest)
{
IdsOfInterest->Delete();
}
return size;
}
//----------------------------------------------------------------------------
int vtkKdTree::ViewOrderAllRegionsFromPosition(const double cameraPosition[3],
vtkIntArray *orderedList)
{
return this->_ViewOrderRegionsFromPosition(NULL, cameraPosition, orderedList);
}
//----------------------------------------------------------------------------
int vtkKdTree::_ViewOrderRegionsInDirection(vtkIntArray *IdsOfInterest,
const double dir[3],
vtkIntArray *orderedList)
{
int nextId = 0;
int numValues = (IdsOfInterest ? IdsOfInterest->GetNumberOfTuples() :
this->NumberOfRegions);
orderedList->Initialize();
orderedList->SetNumberOfValues(numValues);
int size = vtkKdTree::__ViewOrderRegionsInDirection(this->Top, orderedList,
IdsOfInterest, dir,
nextId);
if (size < 0)
{
vtkErrorMacro(<<"vtkKdTree::DepthOrderRegions k-d tree structure is corrupt");
orderedList->Initialize();
return 0;
}
return size;
}
//----------------------------------------------------------------------------
int vtkKdTree::__ViewOrderRegionsInDirection(vtkKdNode *node,
vtkIntArray *list,
vtkIntArray *IdsOfInterest,
const double dir[3], int nextId)
{
if (node->GetLeft() == NULL)
{
if (!IdsOfInterest || vtkKdTree::FoundId(IdsOfInterest, node->GetID()))
{
list->SetValue(nextId, node->GetID());
nextId = nextId+1;
}
return nextId;
}
int cutPlane = node->GetDim();
if ((cutPlane < 0) || (cutPlane > 2))
{
return -1;
}
double closest = dir[cutPlane] * -1;
vtkKdNode *closeNode = (closest < 0) ? node->GetLeft() : node->GetRight();
vtkKdNode *farNode = (closest >= 0) ? node->GetLeft() : node->GetRight();
int nextNextId = vtkKdTree::__ViewOrderRegionsInDirection(closeNode, list,
IdsOfInterest, dir,
nextId);
if (nextNextId == -1)
{
return -1;
}
nextNextId = vtkKdTree::__ViewOrderRegionsInDirection(farNode, list,
IdsOfInterest, dir,
nextNextId);
return nextNextId;
}
//----------------------------------------------------------------------------
int vtkKdTree::_ViewOrderRegionsFromPosition(vtkIntArray *IdsOfInterest,
const double pos[3],
vtkIntArray *orderedList)
{
int nextId = 0;
int numValues = (IdsOfInterest ? IdsOfInterest->GetNumberOfTuples() :
this->NumberOfRegions);
orderedList->Initialize();
orderedList->SetNumberOfValues(numValues);
int size = vtkKdTree::__ViewOrderRegionsFromPosition(this->Top, orderedList,
IdsOfInterest, pos,
nextId);
if (size < 0)
{
vtkErrorMacro(<<"vtkKdTree::DepthOrderRegions k-d tree structure is corrupt");
orderedList->Initialize();
return 0;
}
return size;
}
//----------------------------------------------------------------------------
int vtkKdTree::__ViewOrderRegionsFromPosition(vtkKdNode *node,
vtkIntArray *list,
vtkIntArray *IdsOfInterest,
const double pos[3], int nextId)
{
if (node->GetLeft() == NULL)
{
if (!IdsOfInterest || vtkKdTree::FoundId(IdsOfInterest, node->GetID()))
{
list->SetValue(nextId, node->GetID());
nextId = nextId+1;
}
return nextId;
}
int cutPlane = node->GetDim();
if ((cutPlane < 0) || (cutPlane > 2))
{
return -1;
}
double closest = pos[cutPlane] - node->GetDivisionPosition();
vtkKdNode *closeNode = (closest < 0) ? node->GetLeft() : node->GetRight();
vtkKdNode *farNode = (closest >= 0) ? node->GetLeft() : node->GetRight();
int nextNextId = vtkKdTree::__ViewOrderRegionsFromPosition(closeNode, list,
IdsOfInterest, pos,
nextId);
if (nextNextId == -1)
{
return -1;
}
nextNextId = vtkKdTree::__ViewOrderRegionsFromPosition(farNode, list,
IdsOfInterest, pos,
nextNextId);
return nextNextId;
}
//----------------------------------------------------------------------------
// These requests change the boundaries of the k-d tree, so must
// update the MTime.
//
void vtkKdTree::NewPartitioningRequest(int req)
{
if (req != this->ValidDirections)
{
this->Modified();
this->ValidDirections = req;
}
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitXPartitioning()
{
this->NewPartitioningRequest((1 << vtkKdTree::YDIM) | (1 << vtkKdTree::ZDIM));
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitYPartitioning()
{
this->NewPartitioningRequest((1 << vtkKdTree::ZDIM) | (1 << vtkKdTree::XDIM));
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitZPartitioning()
{
this->NewPartitioningRequest((1 << vtkKdTree::XDIM) | (1 << vtkKdTree::YDIM));
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitXYPartitioning()
{
this->NewPartitioningRequest((1 << vtkKdTree::ZDIM));
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitYZPartitioning()
{
this->NewPartitioningRequest((1 << vtkKdTree::XDIM));
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitZXPartitioning()
{
this->NewPartitioningRequest((1 << vtkKdTree::YDIM));
}
//----------------------------------------------------------------------------
void vtkKdTree::OmitNoPartitioning()
{
int req = ((1 << vtkKdTree::XDIM)|(1 << vtkKdTree::YDIM)|(1 << vtkKdTree::ZDIM));
this->NewPartitioningRequest(req);
}
//---------------------------------------------------------------------------
void vtkKdTree::PrintTiming(ostream& os, vtkIndent )
{
vtkTimerLog::DumpLogWithIndents(&os, 0.0f);
}
//---------------------------------------------------------------------------
void vtkKdTree::ReportReferences(vtkGarbageCollector *collector)
{
this->Superclass::ReportReferences(collector);
vtkGarbageCollectorReport(collector, this->DataSets, "DataSets");
}
//----------------------------------------------------------------------------
void vtkKdTree::UpdateProgress(double amt)
{
this->Progress = amt;
this->InvokeEvent(vtkCommand::ProgressEvent,static_cast<void *>(&amt));
}
//----------------------------------------------------------------------------
void vtkKdTree::UpdateSubOperationProgress(double amt)
{
this->UpdateProgress(this->ProgressOffset + this->ProgressScale*amt);
}
//----------------------------------------------------------------------------
void vtkKdTree::FindPointsInArea(double* area, vtkIdTypeArray* ids, bool clearArray)
{
if (clearArray)
{
ids->Reset();
}
if (!this->LocatorPoints)
{
vtkErrorMacro(<< "vtkKdTree::FindPointsInArea - must build locator first");
return;
}
this->FindPointsInArea(this->Top, area, ids);
}
//----------------------------------------------------------------------------
void vtkKdTree::FindPointsInArea(vtkKdNode* node, double* area, vtkIdTypeArray* ids)
{
double b[6];
node->GetBounds(b);
if (b[0] > area[1] || b[1] < area[0] ||
b[2] > area[3] || b[3] < area[2] ||
b[4] > area[5] || b[5] < area[4])
{
return;
}
bool contains = false;
if (area[0] <= b[0] && b[1] <= area[1] &&
area[2] <= b[2] && b[3] <= area[3] &&
area[4] <= b[4] && b[5] <= area[5])
{
contains = true;
}
if (contains)
{
this->AddAllPointsInRegion(node, ids);
}
else // intersects
{
if (node->GetLeft() == NULL)
{
int regionID = node->GetID();
int regionLoc = this->LocatorRegionLocation[regionID];
float* pt = this->LocatorPoints + (regionLoc * 3);
vtkIdType numPoints = this->RegionList[regionID]->GetNumberOfPoints();
for (vtkIdType i = 0; i < numPoints; i++)
{
if (area[0] <= pt[0] && pt[0] <= area[1] &&
area[2] <= pt[1] && pt[1] <= area[3] &&
area[4] <= pt[2] && pt[2] <= area[5])
{
vtkIdType ptId = static_cast<vtkIdType>(this->LocatorIds[regionLoc + i]);
ids->InsertNextValue(ptId);
}
pt += 3;
}
}
else
{
this->FindPointsInArea(node->GetLeft(), area, ids);
this->FindPointsInArea(node->GetRight(), area, ids);
}
}
}
//----------------------------------------------------------------------------
void vtkKdTree::AddAllPointsInRegion(vtkKdNode* node, vtkIdTypeArray* ids)
{
if (node->GetLeft() == NULL)
{
int regionID = node->GetID();
int regionLoc = this->LocatorRegionLocation[regionID];
vtkIdType numPoints = this->RegionList[regionID]->GetNumberOfPoints();
for (vtkIdType i = 0; i < numPoints; i++)
{
vtkIdType ptId = static_cast<vtkIdType>(this->LocatorIds[regionLoc + i]);
ids->InsertNextValue(ptId);
}
}
else
{
this->AddAllPointsInRegion(node->GetLeft(), ids);
this->AddAllPointsInRegion(node->GetRight(), ids);
}
}
//----------------------------------------------------------------------------
void vtkKdTree::AddAllPointsInRegion(vtkKdNode* node, vtkIdList* ids)
{
if (node->GetLeft() == NULL)
{
int regionID = node->GetID();
int regionLoc = this->LocatorRegionLocation[regionID];
vtkIdType numPoints = this->RegionList[regionID]->GetNumberOfPoints();
for (vtkIdType i = 0; i < numPoints; i++)
{
vtkIdType ptId = static_cast<vtkIdType>(this->LocatorIds[regionLoc + i]);
ids->InsertNextId(ptId);
}
}
else
{
this->AddAllPointsInRegion(node->GetLeft(), ids);
this->AddAllPointsInRegion(node->GetRight(), ids);
}
}
//----------------------------------------------------------------------------
void vtkKdTree::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "ValidDirections: " << this->ValidDirections << endl;
os << indent << "MinCells: " << this->MinCells << endl;
os << indent << "NumberOfRegionsOrLess: " << this->NumberOfRegionsOrLess << endl;
os << indent << "NumberOfRegionsOrMore: " << this->NumberOfRegionsOrMore << endl;
os << indent << "NumberOfRegions: " << this->NumberOfRegions << endl;
os << indent << "DataSets: " << this->DataSets << endl;
os << indent << "Top: " << this->Top << endl;
os << indent << "RegionList: " << this->RegionList << endl;
os << indent << "Timing: " << this->Timing << endl;
os << indent << "TimerLog: " << this->TimerLog << endl;
os << indent << "IncludeRegionBoundaryCells: ";
os << this->IncludeRegionBoundaryCells << endl;
os << indent << "GenerateRepresentationUsingDataBounds: ";
os<< this->GenerateRepresentationUsingDataBounds << endl;
if (this->CellList.nRegions > 0)
{
os << indent << "CellList.dataSet " << this->CellList.dataSet << endl;
os << indent << "CellList.regionIds " << this->CellList.regionIds << endl;
os << indent << "CellList.nRegions " << this->CellList.nRegions << endl;
os << indent << "CellList.cells " << this->CellList.cells << endl;
os << indent << "CellList.boundaryCells " << this->CellList.boundaryCells << endl;
}
os << indent << "CellRegionList: " << this->CellRegionList << endl;
os << indent << "LocatorPoints: " << this->LocatorPoints << endl;
os << indent << "NumberOfLocatorPoints: " << this->NumberOfLocatorPoints << endl;
os << indent << "LocatorIds: " << this->LocatorIds << endl;
os << indent << "LocatorRegionLocation: " << this->LocatorRegionLocation << endl;
os << indent << "FudgeFactor: " << this->FudgeFactor << endl;
os << indent << "MaxWidth: " << this->MaxWidth << endl;
os << indent << "Cuts: ";
if( this->Cuts )
{
this->Cuts->PrintSelf(os << endl, indent.GetNextIndent() );
}
else
{
os << "(none)" << endl;
}
os << indent << "Progress: " << this->Progress << endl;
}
| 25.989025 | 106 | 0.527805 | matthb2 |
a36b5f6abfc7acf6acf42cd2ee5c2d16056e69c4 | 262 | cpp | C++ | src/main.cpp | ironoir/briqs | 6224371c9ea4feec19fb970c2f4c8c85fa661124 | [
"Apache-2.0"
] | 3 | 2015-01-29T09:14:58.000Z | 2015-03-02T01:13:05.000Z | src/main.cpp | ironoir/briqs | 6224371c9ea4feec19fb970c2f4c8c85fa661124 | [
"Apache-2.0"
] | null | null | null | src/main.cpp | ironoir/briqs | 6224371c9ea4feec19fb970c2f4c8c85fa661124 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <fstream>
#include <sstream>
#include "interpreter.h"
int main(int argc, char *argv[]) {
fstream fs(argv[1]);
stringstream ss;
ss << fs.rdbuf();
Interpreter interpreter(ss);
cout << interpreter.eval() << endl;
}
| 20.153846 | 39 | 0.641221 | ironoir |
a371f8c88a5b13f8b696404094ed079f2a9489bd | 957 | cc | C++ | src/analyzer/protocol/modbus/Modbus.cc | simonhf/zeek | 1f52fe9f7bfe9f51056ad97aaf89761b2ad4c327 | [
"Apache-2.0"
] | 5 | 2020-08-07T10:26:04.000Z | 2022-01-12T19:50:11.000Z | src/analyzer/protocol/modbus/Modbus.cc | simonhf/zeek | 1f52fe9f7bfe9f51056ad97aaf89761b2ad4c327 | [
"Apache-2.0"
] | 27 | 2020-02-28T22:29:21.000Z | 2020-12-24T18:03:24.000Z | src/analyzer/protocol/modbus/Modbus.cc | simonhf/zeek | 1f52fe9f7bfe9f51056ad97aaf89761b2ad4c327 | [
"Apache-2.0"
] | 3 | 2020-05-25T20:14:38.000Z | 2020-11-10T22:58:08.000Z |
#include "Modbus.h"
#include "analyzer/protocol/tcp/TCP_Reassembler.h"
#include "events.bif.h"
using namespace analyzer::modbus;
ModbusTCP_Analyzer::ModbusTCP_Analyzer(Connection* c)
: TCP_ApplicationAnalyzer("MODBUS", c)
{
interp = new binpac::ModbusTCP::ModbusTCP_Conn(this);
}
ModbusTCP_Analyzer::~ModbusTCP_Analyzer()
{
delete interp;
}
void ModbusTCP_Analyzer::Done()
{
TCP_ApplicationAnalyzer::Done();
interp->FlowEOF(true);
interp->FlowEOF(false);
}
void ModbusTCP_Analyzer::DeliverStream(int len, const u_char* data, bool orig)
{
TCP_ApplicationAnalyzer::DeliverStream(len, data, orig);
interp->NewData(orig, data, data + len);
}
void ModbusTCP_Analyzer::Undelivered(uint64_t seq, int len, bool orig)
{
TCP_ApplicationAnalyzer::Undelivered(seq, len, orig);
interp->NewGap(orig, len);
}
void ModbusTCP_Analyzer::EndpointEOF(bool is_orig)
{
TCP_ApplicationAnalyzer::EndpointEOF(is_orig);
interp->FlowEOF(is_orig);
}
| 20.804348 | 78 | 0.753396 | simonhf |
a3787328afafee1d594026f57bfbfdc55e4d4709 | 198 | hpp | C++ | effects/cfgFunctions.hpp | genesis92x/LambsMods | d7a281ef74b1927ea3e8aba1063feeab2a97593a | [
"Unlicense"
] | 1 | 2021-07-10T10:06:23.000Z | 2021-07-10T10:06:23.000Z | effects/cfgFunctions.hpp | genesis92x/LambsMods | d7a281ef74b1927ea3e8aba1063feeab2a97593a | [
"Unlicense"
] | null | null | null | effects/cfgFunctions.hpp | genesis92x/LambsMods | d7a281ef74b1927ea3e8aba1063feeab2a97593a | [
"Unlicense"
] | null | null | null | class cfgFunctions {
class lambs_effects {
tag = "lambs_effects";
class functions {
file = "effects\functions";
class killed;
};
};
}; | 22 | 40 | 0.484848 | genesis92x |
a378c53c7ffaaad8f269221dd7e02e65b1837e10 | 11,218 | cp | C++ | MacOS/Sources/Application/Calendar/Component_Editing/CNewComponentRepeat.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 12 | 2015-04-21T16:10:43.000Z | 2021-11-05T13:41:46.000Z | MacOS/Sources/Application/Calendar/Component_Editing/CNewComponentRepeat.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 2 | 2015-11-02T13:32:11.000Z | 2019-07-10T21:11:21.000Z | MacOS/Sources/Application/Calendar/Component_Editing/CNewComponentRepeat.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 6 | 2015-01-12T08:49:12.000Z | 2021-03-27T09:11:10.000Z | /*
Copyright (c) 2007 Cyrus Daboo. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include "CNewComponentRepeat.h"
#include "CDateTimeZoneSelect.h"
#include "CNewEventDialog.h"
#include "CNewTimingPanel.h"
#include "CNewToDoDialog.h"
#include "CNumberEdit.h"
#include "CRecurrenceDialog.h"
#include "CStaticText.h"
#include "CICalendar.h"
#include "CICalendarRecurrence.h"
#include "CICalendarRecurrenceSet.h"
#include <LCheckBox.h>
#include <LLittleArrows.h>
#include <LPopupButton.h>
#include <LPushButton.h>
#include <LRadioButton.h>
#include <LTabsControl.h>
#include "MyCFString.h"
// ---------------------------------------------------------------------------
// CNewComponentRepeat [public]
/**
Default constructor */
CNewComponentRepeat::CNewComponentRepeat(LStream *inStream) :
CNewComponentPanel(inStream)
{
}
// ---------------------------------------------------------------------------
// ~CNewComponentRepeat [public]
/**
Destructor */
CNewComponentRepeat::~CNewComponentRepeat()
{
}
#pragma mark -
void CNewComponentRepeat::FinishCreateSelf()
{
// Get UI items
mRepeats = dynamic_cast<LCheckBox*>(FindPaneByID(eRepeats_ID));
mRepeatsTabs = dynamic_cast<LTabsControl*>(FindPaneByID(eRepeatsTabs_ID));
mOccursSimpleItems = dynamic_cast<LView*>(FindPaneByID(eOccursSimpleItems_ID));
mOccursInterval = dynamic_cast<CNumberEdit*>(FindPaneByID(eOccursInterval_ID));
mOccursIntervalSpin = dynamic_cast<LLittleArrows*>(FindPaneByID(eOccursIntervalSpin_ID));
mOccursInterval->SetArrows(mOccursIntervalSpin, 1, 1000, 0);
mOccursFreq = dynamic_cast<LPopupButton*>(FindPaneByID(eOccursFreq_ID));
mOccursForEver = dynamic_cast<LRadioButton*>(FindPaneByID(eOccursForEver_ID));
mOccursCount = dynamic_cast<LRadioButton*>(FindPaneByID(eOccursCount_ID));
mOccursUntil = dynamic_cast<LRadioButton*>(FindPaneByID(eOccursUntil_ID));
mOccursCounter = dynamic_cast<CNumberEdit*>(FindPaneByID(eOccursCounter_ID));
mOccursCounterSpin = dynamic_cast<LLittleArrows*>(FindPaneByID(eOccursCounterSpin_ID));
mOccursCounter->SetArrows(mOccursCounterSpin, 1, 1000, 0);
mOccursDateTimeZone = CDateTimeZoneSelect::CreateInside(dynamic_cast<LView*>(FindPaneByID(eOccursDateTimeZone_ID)));
mOccursAdvancedItems = dynamic_cast<LView*>(FindPaneByID(eOccursAdvancedItems_ID));
mOccursDescription = dynamic_cast<CStaticText*>(FindPaneByID(eOccursDescription_ID));
mOccursEdit = dynamic_cast<LPushButton*>(FindPaneByID(eOccursEdit_ID));
// Listen to some controls
UReanimator::LinkListenerToBroadcasters(this, this, pane_ID);
// Init controls
DoRepeat(false);
DoRepeatTab(eOccurs_Simple);
DoOccursGroup(eOccurs_ForEver);
}
// Respond to clicks in the icon buttons
void CNewComponentRepeat::ListenToMessage(MessageT inMessage,void *ioParam)
{
switch (inMessage)
{
case eOccursEdit_ID:
DoOccursEdit();
break;
case eRepeats_ID:
DoRepeat(mRepeats->GetValue() == 1);
break;
case eRepeatsTabs_ID:
DoRepeatTab(mRepeatsTabs->GetValue());
break;
case eOccursForEver_ID:
DoOccursGroup(eOccurs_ForEver);
break;
case eOccursCount_ID:
DoOccursGroup(eOccurs_Count);
break;
case eOccursUntil_ID:
DoOccursGroup(eOccurs_Until);
break;
}
}
const CNewTimingPanel* CNewComponentRepeat::GetTimingPanel() const
{
// Look for parent item
LView* super = GetSuperView();
while(super && !dynamic_cast<CModelessDialog*>(super))
super = super->GetSuperView();
CModelessDialog* dlg = dynamic_cast<CModelessDialog*>(super);
if (dynamic_cast<CNewEventDialog*>(dlg))
return static_cast<CNewEventDialog*>(dlg)->GetTimingPanel();
else if (dynamic_cast<CNewToDoDialog*>(dlg))
return static_cast<CNewToDoDialog*>(dlg)->GetTimingPanel();
else
return NULL;
}
void CNewComponentRepeat::DoRepeat(bool repeat)
{
mRepeatsTabs->SetEnabled(repeat);
}
void CNewComponentRepeat::DoRepeatTab(UInt32 value)
{
switch(value)
{
case eOccurs_Simple:
mOccursSimpleItems->SetVisible(true);
mOccursAdvancedItems->SetVisible(false);
break;
case eOccurs_Advanced:
mOccursSimpleItems->SetVisible(false);
mOccursAdvancedItems->SetVisible(true);
mOccursEdit->SetVisible(true);
// Set description to advanced item
{
MyCFString txt(mAdvancedRecur.GetUIDescription(), kCFStringEncodingUTF8);
mOccursDescription->SetCFDescriptor(txt);
}
break;
case eOccurs_Complex:
mOccursSimpleItems->SetVisible(false);
mOccursAdvancedItems->SetVisible(true);
mOccursEdit->SetVisible(false);
// Set description to complex item
{
MyCFString txt(mComplexDescription, kCFStringEncodingUTF8);
mOccursDescription->SetCFDescriptor(txt);
}
break;
}
}
void CNewComponentRepeat::DoOccursGroup(UInt32 value)
{
mOccursCounter->SetEnabled(value == eOccurs_Count);
mOccursCounterSpin->SetEnabled(value == eOccurs_Count);
mOccursDateTimeZone->SetEnabled(value == eOccurs_Until);
}
void CNewComponentRepeat::DoOccursEdit()
{
// Get tzid set in the start
iCal::CICalendarTimezone tzid;
GetTimingPanel()->GetTimezone(tzid);
bool all_day = GetTimingPanel()->GetAllDay();
// Edit the stored recurrence item
iCal::CICalendarRecurrence temp(mAdvancedRecur);
if (CRecurrenceDialog::PoseDialog(temp, tzid, all_day))
{
mAdvancedRecur = temp;
// Update description
MyCFString txt(mAdvancedRecur.GetUIDescription(), kCFStringEncodingUTF8);
mOccursDescription->SetCFDescriptor(txt);
}
}
void CNewComponentRepeat::SetEvent(const iCal::CICalendarVEvent& vevent, const iCal::CICalendarComponentExpanded* expanded)
{
// Set recurrence
SetRecurrence(vevent.GetRecurrenceSet());
}
void CNewComponentRepeat::SetToDo(const iCal::CICalendarVToDo& vtodo, const iCal::CICalendarComponentExpanded* expanded)
{
// Set recurrence
//SetRecurrence(vtodo.GetRecurrenceSet());
}
void CNewComponentRepeat::SetRecurrence(const iCal::CICalendarRecurrenceSet* recurs)
{
static const int cFreqValueToPopup[] =
{
CNewComponentRepeat::eOccurs_Secondly, CNewComponentRepeat::eOccurs_Minutely, CNewComponentRepeat::eOccurs_Hourly,
CNewComponentRepeat::eOccurs_Daily, CNewComponentRepeat::eOccurs_Weekly, CNewComponentRepeat::eOccurs_Monthly, CNewComponentRepeat::eOccurs_Yearly
};
// See whether it is simple enough that we can handle it
if ((recurs != NULL) && recurs->HasRecurrence())
{
if (recurs->IsSimpleUI())
{
const iCal::CICalendarRecurrence* recur = recurs->GetUIRecurrence();
// Is repeating
mRepeats->SetValue(1);
mRepeatsTabs->SetValue(eOccurs_Simple);
// Set frequency
mOccursFreq->SetValue(cFreqValueToPopup[recur->GetFreq()]);
// Set interval
mOccursInterval->SetNumberValue(recur->GetInterval());
// Set count
if (recur->GetUseCount())
{
mOccursCount->SetValue(1);
mOccursCounter->SetNumberValue(recur->GetCount());
}
else if (recur->GetUseUntil())
{
mOccursUntil->SetValue(1);
// NB the UNTIL value is always UTC, but we want to display it to the user relative to their start time
// Get tzid set in the start
iCal::CICalendarTimezone tzid;
GetTimingPanel()->GetTimezone(tzid);
// Adjust UNTIL to new timezone
iCal::CICalendarDateTime until(recur->GetUntil());
until.AdjustTimezone(tzid);
mOccursDateTimeZone->SetDateTimeZone(until, GetTimingPanel()->GetAllDay());
}
else
mOccursForEver->SetValue(1);
// Always remove the complex tab as user cannot create a complex item
mRepeatsTabs->SetMaxValue(2);
return;
}
else if (recurs->IsAdvancedUI())
{
const iCal::CICalendarRecurrence* recur = recurs->GetUIRecurrence();
// Cache the value we will be editing
mAdvancedRecur = *recur;
// Is repeating
mRepeats->SetValue(1);
mRepeatsTabs->SetValue(eOccurs_Advanced);
// Always remove the complex tab as user cannot create a complex item
mRepeatsTabs->SetMaxValue(2);
return;
}
// Fall through to here => complex rule
mComplexDescription = recurs->GetUIDescription();
// Is repeating
mRepeats->SetValue(1);
mRepeatsTabs->SetValue(eOccurs_Complex);
}
else
{
// Is not repeating
mRepeats->SetValue(0);
mRepeatsTabs->SetValue(eOccurs_Simple);
// Always remove the complex tab as user cannot create a complex item
mRepeatsTabs->SetMaxValue(2);
}
}
void CNewComponentRepeat::GetEvent(iCal::CICalendarVEvent& vevent)
{
// Do recurrence items
// NB in complex mode we do not change the existing set
iCal::CICalendarRecurrenceSet recurs;
if (GetRecurrence(recurs))
vevent.EditRecurrenceSet(recurs);
}
void CNewComponentRepeat::GetToDo(iCal::CICalendarVToDo& vtodo)
{
// Do recurrence items
// NB in complex mode we do not change the existing set
//iCal::CICalendarRecurrenceSet recurs;
//if (GetRecurrence(recurs))
// vtodo.EditRecurrenceSet(recurs);
}
static const iCal::ERecurrence_FREQ cFreqPopupToValue[] =
{
iCal::eRecurrence_YEARLY, iCal::eRecurrence_MONTHLY, iCal::eRecurrence_WEEKLY, iCal::eRecurrence_DAILY,
iCal::eRecurrence_HOURLY, iCal::eRecurrence_MINUTELY, iCal::eRecurrence_SECONDLY
};
bool CNewComponentRepeat::GetRecurrence(iCal::CICalendarRecurrenceSet& recurs)
{
// Only if repeating enabled
if (mRepeats->GetValue() == 0)
return true;
// Do not do anything to existing recurrence if complex mode
if (mRepeatsTabs->GetValue() == eOccurs_Complex)
return false;
// Get simple/advanced data
if (mRepeatsTabs->GetValue() == eOccurs_Simple)
{
// Simple mode means we only do a single RRULE
iCal::CICalendarRecurrence recur;
// Set frequency
recur.SetFreq(cFreqPopupToValue[mOccursFreq->GetValue() - 1]);
// Set interval
recur.SetInterval(mOccursInterval->GetNumberValue());
// Determine end
if (mOccursForEver->GetValue() == 1)
{
// Nothing to add
}
else if (mOccursCount->GetValue() == 1)
{
recur.SetUseCount(true);
recur.SetCount(mOccursCounter->GetNumberValue());
}
else if (mOccursUntil->GetValue() == 1)
{
// NB the UNTIL value is always UTC, but we want to display it to the user relative to their start time,
// so we must convert from dialog tzid to UTC
// Get value from dialog
iCal::CICalendarDateTime until;
mOccursDateTimeZone->GetDateTimeZone(until, GetTimingPanel()->GetAllDay());
// Adjust to UTC
until.AdjustToUTC();
recur.SetUseUntil(true);
recur.SetUntil(until);
}
// Now add recurrence
recurs.Add(recur);
}
else
// Just add advanced item
recurs.Add(mAdvancedRecur);
return true;
}
void CNewComponentRepeat::SetReadOnly(bool read_only)
{
mReadOnly = read_only;
mRepeats->SetEnabled(!read_only);
mRepeatsTabs->SetEnabled(!read_only && (mRepeats->GetValue() == 1));
}
| 28.18593 | 148 | 0.734712 | mulberry-mail |
a379251325c31268a3c747511b380893c6677eaa | 2,716 | cc | C++ | Fleece/Tree/NodeRef.cc | tophatch/fleece | 8853b610575c1a7d68681a792188bab9c0c1ec7d | [
"Apache-2.0"
] | 134 | 2016-05-09T19:42:55.000Z | 2022-01-16T13:05:18.000Z | Fleece/Tree/NodeRef.cc | tophatch/fleece | 8853b610575c1a7d68681a792188bab9c0c1ec7d | [
"Apache-2.0"
] | 70 | 2016-05-09T05:16:46.000Z | 2022-03-08T19:43:30.000Z | Fleece/Tree/NodeRef.cc | tophatch/fleece | 8853b610575c1a7d68681a792188bab9c0c1ec7d | [
"Apache-2.0"
] | 32 | 2016-05-19T10:38:06.000Z | 2022-01-30T22:45:25.000Z | //
// NodeRef.cc
//
// Copyright 2018-Present Couchbase, Inc.
//
// Use of this software is governed by the Business Source License included
// in the file licenses/BSL-Couchbase.txt. As of the Change Date specified
// in that file, in accordance with the Business Source License, use of this
// software will be governed by the Apache License, Version 2.0, included in
// the file licenses/APL2.txt.
//
#include "NodeRef.hh"
#include "MutableNode.hh"
#include "betterassert.hh"
namespace fleece { namespace hashtree {
bool NodeRef::isLeaf() const {
return isMutable() ? _asMutable()->isLeaf() : _asImmutable()->isLeaf();
}
hash_t NodeRef::hash() const {
assert_precondition(isLeaf());
return isMutable() ? ((MutableLeaf*)_asMutable())->_hash : _asImmutable()->leaf.hash();
}
Value NodeRef::value() const {
assert_precondition(isLeaf());
return isMutable() ? ((MutableLeaf*)_asMutable())->_value : _asImmutable()->leaf.value();
}
bool NodeRef::matches(Target target) const {
assert_precondition(isLeaf());
return isMutable() ? ((MutableLeaf*)_asMutable())->matches(target)
: _asImmutable()->leaf.matches(target.key);
}
unsigned NodeRef::childCount() const {
assert_precondition(!isLeaf());
return isMutable() ? ((MutableInterior*)_asMutable())->childCount()
: _asImmutable()->interior.childCount();
}
NodeRef NodeRef::childAtIndex(unsigned index) const {
assert_precondition(!isLeaf());
return isMutable() ? ((MutableInterior*)_asMutable())->childAtIndex(index)
: _asImmutable()->interior.childAtIndex(index);
}
Node NodeRef::writeTo(Encoder &enc) {
assert_precondition(!isLeaf());
Node node;
if (isMutable())
node.interior = ((MutableInterior*)asMutable())->writeTo(enc);
else
node.interior = asImmutable()->interior.writeTo(enc);
return node;
}
uint32_t NodeRef::writeTo(Encoder &enc, bool writeKey) {
assert_precondition(isLeaf());
if (isMutable())
return ((MutableLeaf*)asMutable())->writeTo(enc, writeKey);
else
return asImmutable()->leaf.writeTo(enc, writeKey);
}
void NodeRef::dump(ostream &out, unsigned indent) const {
if (isMutable())
isLeaf() ? ((MutableLeaf*)_asMutable())->dump(out, indent)
: ((MutableInterior*)_asMutable())->dump(out, indent);
else
isLeaf() ? _asImmutable()->leaf.dump(out, indent)
: _asImmutable()->interior.dump(out, indent);
}
} }
| 33.95 | 97 | 0.611929 | tophatch |
a379bb3244fdb3bf6bb4a95ff875ce18d7cbe759 | 4,856 | cpp | C++ | mainwindow.cpp | danielScLima/RedBlackTree | cdb35c547dffa983d749f557a19937f083692208 | [
"MIT"
] | null | null | null | mainwindow.cpp | danielScLima/RedBlackTree | cdb35c547dffa983d749f557a19937f083692208 | [
"MIT"
] | null | null | null | mainwindow.cpp | danielScLima/RedBlackTree | cdb35c547dffa983d749f557a19937f083692208 | [
"MIT"
] | null | null | null | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <fstream>
#include <QDir>
#include <QMessageBox>
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
{
ui->setupUi(this);
updateDotFile();
updateImage();
renderImage();
}
MainWindow::~MainWindow()
{
delete ui;
}
void MainWindow::updateDotFile()
{
std::ofstream myFile;
QDir::setCurrent(QCoreApplication::applicationFilePath());
myFile.open
(
"file.dot"
);
std::string textToFile;
if (ui->radioButtonTrad->isChecked())
textToFile = redBlackTree.gitDotFileMode1();
else
textToFile = redBlackTree.gitDotFileMode2();
myFile << textToFile;
myFile.close();
}
void MainWindow::updateImage()
{
std::string message =
"dot -Tpng file.dot > file.png";
QDir::setCurrent(QCoreApplication::applicationFilePath());
system(message.c_str());
}
void MainWindow::renderImage()
{
QDir::setCurrent(QCoreApplication::applicationFilePath());
QPixmap image("file.png");
ui->labelOfImage->setPixmap(image);
ui->labelOfImage->show();
}
template <class Container>
void MainWindow::split3(const std::string& str, Container& cont,
char delim)
{
std::size_t current, previous = 0;
current = str.find(delim);
while (current != std::string::npos)
{
cont.push_back(str.substr(previous, current - previous));
previous = current + 1;
current = str.find(delim, previous);
}
cont.push_back(str.substr(previous, current - previous));
}
void MainWindow::on_pushButtonOfInsert_clicked()
{
std::vector<std::string> numbersAsString;
std::string numbers = ui->lineEditOfInsert->text().toStdString();
split3(numbers, numbersAsString);
bool ret;
for (auto numberAsStr: numbersAsString)
{
int number = std::atoi(numberAsStr.c_str());
ret = redBlackTree.insertInterface(number);
QMessageBox msgBox;
if (ret)
msgBox.setText("The number "+QString::number(number)+" was inserted");
else
msgBox.setText("This number already exists in the tree");
msgBox.exec();
}
updateDotFile();
updateImage();
renderImage();
}
void MainWindow::on_pushButtonOfSearch_clicked()
{
int toSearch = ui->lineEditOfSearch->text().toInt();
bool ret = redBlackTree.search(toSearch);
QMessageBox msgBox;
if (ret)
msgBox.setText("This number exists");
else
msgBox.setText("This number does not exists");
msgBox.exec();
}
void MainWindow::on_pushButtonOfRemove_clicked()
{
int toRemove = ui->lineEditOfRemove->text().toInt();
NodeOfRedBlackTree *node = redBlackTree.removeInterface(toRemove);
updateDotFile();
updateImage();
renderImage();
if (node != nullptr)
delete node;
}
void MainWindow::on_pushButtonPreOrdem_clicked()
{
//Eu, esq, direita
std::string ret = redBlackTree.preOrder();
QMessageBox msgBox;
msgBox.setText(ret.c_str());
msgBox.exec();
}
void MainWindow::on_pushButtonEmOrdem_clicked()
{
//esq, eu, dir
std::string ret = redBlackTree.inOrder();
QMessageBox msgBox;
msgBox.setText(ret.c_str());
msgBox.exec();
}
void MainWindow::on_pushButtonPosOrdem_clicked()
{
//esq, dir, eu
std::string ret = redBlackTree.posOrder();
QMessageBox msgBox;
msgBox.setText(ret.c_str());
msgBox.exec();
}
void MainWindow::on_pushButtonEmNivel_clicked()
{
//eu, filhos, netos, bisnetos
std::string ret = redBlackTree.InLevelOrder();
QMessageBox msgBox;
msgBox.setText(ret.c_str());
msgBox.exec();
}
void MainWindow::on_radioButtonTrad_toggled(bool checked)
{
updateDotFile();
updateImage();
renderImage();
}
void MainWindow::on_pushButtonChangeColor_clicked()
{
std::vector<std::string> colorAsString;
std::string colors = ui->lineEditOfColors->text().toStdString();
split3(colors, colorAsString);
std::vector<RedBlackTreeColor> vectorOfColors;
for (auto colorAsStr: colorAsString)
{
if
(
colorAsStr.compare("r") == 0 ||
colorAsStr.compare("R") == 0 ||
colorAsStr.compare("red") == 0 ||
colorAsStr.compare("RED") == 0
)
{
vectorOfColors.push_back(RedBlackTreeColor::RedBlackTreeColorRED);
}
else
{
vectorOfColors.push_back(RedBlackTreeColor::RedBlackTreeColorBLACK);
}
}
std::vector<NodeOfRedBlackTree*> nodes = redBlackTree.inLevelOrderNodes();
for (int index = 0; index < nodes.size() && index < vectorOfColors.size(); ++index)
{
nodes.at(index)->color = vectorOfColors.at(index);
}
updateDotFile();
updateImage();
renderImage();
}
| 23.12381 | 87 | 0.642916 | danielScLima |
a37bc38db07361f9d605d9f78f9aad9bb816c1a3 | 4,878 | cpp | C++ | aws-cpp-sdk-ec2/source/model/SpotPrice.cpp | ambasta/aws-sdk-cpp | c81192e00b572b76d175d84dff77185bd17ae1ac | [
"Apache-2.0"
] | null | null | null | aws-cpp-sdk-ec2/source/model/SpotPrice.cpp | ambasta/aws-sdk-cpp | c81192e00b572b76d175d84dff77185bd17ae1ac | [
"Apache-2.0"
] | null | null | null | aws-cpp-sdk-ec2/source/model/SpotPrice.cpp | ambasta/aws-sdk-cpp | c81192e00b572b76d175d84dff77185bd17ae1ac | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2010-2016 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file is distributed
* on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
* express or implied. See the License for the specific language governing
* permissions and limitations under the License.
*/
#include <aws/ec2/model/SpotPrice.h>
#include <aws/core/utils/xml/XmlSerializer.h>
#include <aws/core/utils/StringUtils.h>
#include <aws/core/utils/memory/stl/AWSStringStream.h>
#include <utility>
using namespace Aws::Utils::Xml;
using namespace Aws::Utils;
namespace Aws
{
namespace EC2
{
namespace Model
{
SpotPrice::SpotPrice() :
m_instanceTypeHasBeenSet(false),
m_productDescriptionHasBeenSet(false),
m_spotPriceHasBeenSet(false),
m_timestampHasBeenSet(false),
m_availabilityZoneHasBeenSet(false)
{
}
SpotPrice::SpotPrice(const XmlNode& xmlNode) :
m_instanceTypeHasBeenSet(false),
m_productDescriptionHasBeenSet(false),
m_spotPriceHasBeenSet(false),
m_timestampHasBeenSet(false),
m_availabilityZoneHasBeenSet(false)
{
*this = xmlNode;
}
SpotPrice& SpotPrice::operator =(const XmlNode& xmlNode)
{
XmlNode resultNode = xmlNode;
if(!resultNode.IsNull())
{
XmlNode instanceTypeNode = resultNode.FirstChild("instanceType");
if(!instanceTypeNode.IsNull())
{
m_instanceType = InstanceTypeMapper::GetInstanceTypeForName(StringUtils::Trim(instanceTypeNode.GetText().c_str()).c_str());
m_instanceTypeHasBeenSet = true;
}
XmlNode productDescriptionNode = resultNode.FirstChild("productDescription");
if(!productDescriptionNode.IsNull())
{
m_productDescription = RIProductDescriptionMapper::GetRIProductDescriptionForName(StringUtils::Trim(productDescriptionNode.GetText().c_str()).c_str());
m_productDescriptionHasBeenSet = true;
}
XmlNode spotPriceNode = resultNode.FirstChild("spotPrice");
if(!spotPriceNode.IsNull())
{
m_spotPrice = StringUtils::Trim(spotPriceNode.GetText().c_str());
m_spotPriceHasBeenSet = true;
}
XmlNode timestampNode = resultNode.FirstChild("timestamp");
if(!timestampNode.IsNull())
{
m_timestamp = DateTime(StringUtils::Trim(timestampNode.GetText().c_str()).c_str(), DateFormat::ISO_8601);
m_timestampHasBeenSet = true;
}
XmlNode availabilityZoneNode = resultNode.FirstChild("availabilityZone");
if(!availabilityZoneNode.IsNull())
{
m_availabilityZone = StringUtils::Trim(availabilityZoneNode.GetText().c_str());
m_availabilityZoneHasBeenSet = true;
}
}
return *this;
}
void SpotPrice::OutputToStream(Aws::OStream& oStream, const char* location, unsigned index, const char* locationValue) const
{
if(m_instanceTypeHasBeenSet)
{
oStream << location << index << locationValue << ".InstanceType=" << InstanceTypeMapper::GetNameForInstanceType(m_instanceType) << "&";
}
if(m_productDescriptionHasBeenSet)
{
oStream << location << index << locationValue << ".ProductDescription=" << RIProductDescriptionMapper::GetNameForRIProductDescription(m_productDescription) << "&";
}
if(m_spotPriceHasBeenSet)
{
oStream << location << index << locationValue << ".SpotPrice=" << StringUtils::URLEncode(m_spotPrice.c_str()) << "&";
}
if(m_timestampHasBeenSet)
{
oStream << location << index << locationValue << ".Timestamp=" << StringUtils::URLEncode(m_timestamp.ToGmtString(DateFormat::ISO_8601).c_str()) << "&";
}
if(m_availabilityZoneHasBeenSet)
{
oStream << location << index << locationValue << ".AvailabilityZone=" << StringUtils::URLEncode(m_availabilityZone.c_str()) << "&";
}
}
void SpotPrice::OutputToStream(Aws::OStream& oStream, const char* location) const
{
if(m_instanceTypeHasBeenSet)
{
oStream << location << ".InstanceType=" << InstanceTypeMapper::GetNameForInstanceType(m_instanceType) << "&";
}
if(m_productDescriptionHasBeenSet)
{
oStream << location << ".ProductDescription=" << RIProductDescriptionMapper::GetNameForRIProductDescription(m_productDescription) << "&";
}
if(m_spotPriceHasBeenSet)
{
oStream << location << ".SpotPrice=" << StringUtils::URLEncode(m_spotPrice.c_str()) << "&";
}
if(m_timestampHasBeenSet)
{
oStream << location << ".Timestamp=" << StringUtils::URLEncode(m_timestamp.ToGmtString(DateFormat::ISO_8601).c_str()) << "&";
}
if(m_availabilityZoneHasBeenSet)
{
oStream << location << ".AvailabilityZone=" << StringUtils::URLEncode(m_availabilityZone.c_str()) << "&";
}
}
} // namespace Model
} // namespace EC2
} // namespace Aws
| 32.959459 | 169 | 0.717097 | ambasta |
a37ee6b4441af2e3cae44896615383a39f5c5da2 | 4,299 | cpp | C++ | games/varooom-3d/src/fr_title_advices.cpp | taellinglin/butano | 13b93c1296970262e047b728496908c036f7e789 | [
"Zlib"
] | null | null | null | games/varooom-3d/src/fr_title_advices.cpp | taellinglin/butano | 13b93c1296970262e047b728496908c036f7e789 | [
"Zlib"
] | null | null | null | games/varooom-3d/src/fr_title_advices.cpp | taellinglin/butano | 13b93c1296970262e047b728496908c036f7e789 | [
"Zlib"
] | null | null | null | /*
* Copyright (c) 2020-2021 Gustavo Valiente [email protected]
* zlib License, see LICENSE file.
*/
#include "fr_title_advices.h"
#include "bn_display.h"
#include "fr_common_stuff.h"
namespace fr
{
namespace
{
constexpr bn::fixed text_y = (bn::display::height() / 2) - 16;
constexpr bn::fixed scale_inc = bn::fixed(1) / 8;
constexpr bn::string_view text_items[] = {
"DON'T FORGET YOUR HEADPHONES!",
"USE TURBO BOOSTS! YOU ARE NOT GOING TO GET FAR WITHOUT THEM!",
"INSTEAD OF BUMPING A RIVAL, STOP ACCELERATING UNTIL YOU KNOW YOU CAN OVERTAKE IT!",
"DON'T WASTE A TURBO BOOST IF YOU KNOW A RIVAL IS NEAR. USE THE BOOST TO OVERTAKE IT!",
"YOU CAN USE TURBO BOOSTS FOR OVERTAKINGS BY DRIVING OUTSIDE OF THE TRACK WITHOUT SLOWING DOWN TOO MUCH!",
"IF YOU HAVE A TURBO BOOST YOU CAN BUMP ANOTHER CAR, TURN A BIT, FIRE THE BOOST AND OVERTAKE IT!",
};
constexpr int text_items_count = sizeof(text_items) / sizeof(text_items[0]);
}
title_advices::title_advices(common_stuff& common_stuff) :
_affine_mat(bn::sprite_affine_mat_ptr::create()),
_item_index(common_stuff.storage.advice_index())
{
if(_item_index < 0 || _item_index >= text_items_count)
{
_item_index = 0;
}
}
void title_advices::set_visible(bool visible)
{
if(visible)
{
_intro_done = false;
}
else
{
_outro_done = false;
}
}
void title_advices::update(common_stuff& common_stuff)
{
if(! _intro_done)
{
_update_intro();
}
else if(! _outro_done)
{
_update_outro();
}
if(_vertical_scale > 0)
{
for(message_type& message : _messages)
{
bn::ideque<bn::sprite_ptr>& sprites = message.sprites;
for(bn::sprite_ptr& sprite : sprites)
{
sprite.set_x(sprite.x() - 1);
}
if(! sprites.empty() && sprites.front().x() < -(bn::display::width() / 2) - 32)
{
sprites.pop_front();
}
}
if(_wait_frames)
{
--_wait_frames;
}
else
{
if(_messages.full())
{
_messages.pop_front();
}
_messages.push_back(message_type());
message_type& message = _messages.back();
bn::sprite_text_generator& text_generator = common_stuff.small_variable_text_generator;
const bn::string_view& text_item = text_items[_item_index];
bn::vector<bn::sprite_ptr, 32> sprites;
bn::fixed text_x = bn::display::width() / 2;
text_generator.generate(text_x, text_y, text_item, sprites);
for(bn::sprite_ptr& sprite : sprites)
{
sprite.set_affine_mat(_affine_mat);
message.sprites.push_back(bn::move(sprite));
}
_wait_frames = text_generator.width(text_item) + 64;
_item_index = (_item_index + 1) % text_items_count;
common_stuff.storage.set_advice_index(_item_index);
}
}
}
void title_advices::_set_sprites_visible(bool visible)
{
for(message_type& message : _messages)
{
for(bn::sprite_ptr& sprite : message.sprites)
{
sprite.set_visible(visible);
}
}
}
void title_advices::_set_sprites_vertical_scale(bn::fixed vertical_scale)
{
_vertical_scale = vertical_scale;
if(vertical_scale > 0)
{
_affine_mat.set_vertical_scale(vertical_scale);
}
}
void title_advices::_update_intro()
{
bn::fixed vertical_scale = _vertical_scale;
if(vertical_scale > 0)
{
vertical_scale += scale_inc;
if(vertical_scale >= 1)
{
vertical_scale = 1;
_intro_done = true;
}
}
else
{
_set_sprites_visible(true);
vertical_scale = scale_inc;
}
_set_sprites_vertical_scale(vertical_scale);
}
void title_advices::_update_outro()
{
bn::fixed vertical_scale = _vertical_scale - scale_inc;
if(vertical_scale < scale_inc)
{
_set_sprites_visible(false);
vertical_scale = 0;
_outro_done = true;
}
_set_sprites_vertical_scale(vertical_scale);
}
}
| 24.706897 | 114 | 0.599674 | taellinglin |
a37ff5a87a4bff37660011b41a0ea4f1dfce7571 | 6,333 | cc | C++ | cpp/core_v2/internal/simulation_user.cc | zhounewone/nearby-connections | 4e3f343b7a1b9faee0cb71dc3b2c0ecf13c7f707 | [
"Apache-2.0"
] | null | null | null | cpp/core_v2/internal/simulation_user.cc | zhounewone/nearby-connections | 4e3f343b7a1b9faee0cb71dc3b2c0ecf13c7f707 | [
"Apache-2.0"
] | null | null | null | cpp/core_v2/internal/simulation_user.cc | zhounewone/nearby-connections | 4e3f343b7a1b9faee0cb71dc3b2c0ecf13c7f707 | [
"Apache-2.0"
] | null | null | null | // Copyright 2020 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "core_v2/internal/simulation_user.h"
#include "core_v2/listeners.h"
#include "platform_v2/public/count_down_latch.h"
#include "platform_v2/public/system_clock.h"
#include "absl/functional/bind_front.h"
namespace location {
namespace nearby {
namespace connections {
void SimulationUser::OnConnectionInitiated(const std::string& endpoint_id,
const ConnectionResponseInfo& info,
bool is_outgoing) {
if (is_outgoing) {
NEARBY_LOG(INFO, "RequestConnection: initiated_cb called");
} else {
NEARBY_LOG(INFO, "StartAdvertising: initiated_cb called");
discovered_ = DiscoveredInfo{
.endpoint_id = endpoint_id,
.endpoint_info = GetInfo(),
.service_id = service_id_,
};
}
if (initiated_latch_) initiated_latch_->CountDown();
}
void SimulationUser::OnConnectionAccepted(const std::string& endpoint_id) {
if (accept_latch_) accept_latch_->CountDown();
}
void SimulationUser::OnConnectionRejected(const std::string& endpoint_id,
Status status) {
if (reject_latch_) reject_latch_->CountDown();
}
void SimulationUser::OnEndpointFound(const std::string& endpoint_id,
const ByteArray& endpoint_info,
const std::string& service_id) {
NEARBY_LOG(INFO, "Device discovered: id=%s", endpoint_id.c_str());
discovered_ = DiscoveredInfo{
.endpoint_id = endpoint_id,
.endpoint_info = endpoint_info,
.service_id = service_id,
};
if (found_latch_) found_latch_->CountDown();
}
void SimulationUser::OnEndpointLost(const std::string& endpoint_id) {
if (lost_latch_) lost_latch_->CountDown();
}
void SimulationUser::OnPayload(const std::string& endpoint_id,
Payload payload) {
payload_ = std::move(payload);
if (payload_latch_) payload_latch_->CountDown();
}
void SimulationUser::OnPayloadProgress(const std::string& endpoint_id,
const PayloadProgressInfo& info) {
MutexLock lock(&progress_mutex_);
progress_info_ = info;
if (future_ && predicate_ && predicate_(info)) future_->Set(true);
}
bool SimulationUser::WaitForProgress(
std::function<bool(const PayloadProgressInfo&)> predicate,
absl::Duration timeout) {
Future<bool> future;
{
MutexLock lock(&progress_mutex_);
if (predicate(progress_info_)) return true;
future_ = &future;
predicate_ = std::move(predicate);
}
auto response = future.Get(timeout);
{
MutexLock lock(&progress_mutex_);
future_ = nullptr;
predicate_ = nullptr;
}
return response.ok() && response.result();
}
void SimulationUser::StartAdvertising(const std::string& service_id,
CountDownLatch* latch) {
initiated_latch_ = latch;
service_id_ = service_id;
ConnectionListener listener = {
.initiated_cb =
std::bind(&SimulationUser::OnConnectionInitiated, this,
std::placeholders::_1, std::placeholders::_2, false),
.accepted_cb =
absl::bind_front(&SimulationUser::OnConnectionAccepted, this),
.rejected_cb =
absl::bind_front(&SimulationUser::OnConnectionRejected, this),
};
EXPECT_TRUE(mgr_.StartAdvertising(&client_, service_id_, options_,
{
.endpoint_info = info_,
.listener = std::move(listener),
})
.Ok());
}
void SimulationUser::StartDiscovery(const std::string& service_id,
CountDownLatch* latch) {
found_latch_ = latch;
EXPECT_TRUE(
mgr_.StartDiscovery(&client_, service_id, options_,
{
.endpoint_found_cb = absl::bind_front(
&SimulationUser::OnEndpointFound, this),
.endpoint_lost_cb = absl::bind_front(
&SimulationUser::OnEndpointLost, this),
})
.Ok());
}
void SimulationUser::RequestConnection(CountDownLatch* latch) {
initiated_latch_ = latch;
ConnectionListener listener = {
.initiated_cb =
std::bind(&SimulationUser::OnConnectionInitiated, this,
std::placeholders::_1, std::placeholders::_2, true),
.accepted_cb =
absl::bind_front(&SimulationUser::OnConnectionAccepted, this),
.rejected_cb =
absl::bind_front(&SimulationUser::OnConnectionRejected, this),
};
EXPECT_TRUE(
mgr_.RequestConnection(&client_, discovered_.endpoint_id,
{
.endpoint_info = discovered_.endpoint_info,
.listener = std::move(listener),
},
connection_options_)
.Ok());
}
void SimulationUser::AcceptConnection(CountDownLatch* latch) {
accept_latch_ = latch;
PayloadListener listener = {
.payload_cb = absl::bind_front(&SimulationUser::OnPayload, this),
.payload_progress_cb =
absl::bind_front(&SimulationUser::OnPayloadProgress, this),
};
EXPECT_TRUE(mgr_.AcceptConnection(&client_, discovered_.endpoint_id,
std::move(listener))
.Ok());
}
void SimulationUser::RejectConnection(CountDownLatch* latch) {
reject_latch_ = latch;
EXPECT_TRUE(mgr_.RejectConnection(&client_, discovered_.endpoint_id).Ok());
}
} // namespace connections
} // namespace nearby
} // namespace location
| 36.188571 | 78 | 0.620717 | zhounewone |
a380825bfe33d4a83a65d9664ee5e559c86cacf8 | 12,463 | cc | C++ | hefur/udp-server.cc | KrauseStefan/hefur | 8cecf86acdc55a4dd3942041c1e50f7bbdec045f | [
"MIT"
] | null | null | null | hefur/udp-server.cc | KrauseStefan/hefur | 8cecf86acdc55a4dd3942041c1e50f7bbdec045f | [
"MIT"
] | null | null | null | hefur/udp-server.cc | KrauseStefan/hefur | 8cecf86acdc55a4dd3942041c1e50f7bbdec045f | [
"MIT"
] | null | null | null | #include <sys/types.h>
#include <netinet/in.h>
#include <inttypes.h>
#include <unistd.h>
#include <fcntl.h>
#include <poll.h>
#if defined(__linux__)
# include <endian.h>
#elif defined(__FreeBSD__) || defined(__NetBSD__)
# include <sys/endian.h>
#elif defined(__OpenBSD__)
# include <sys/types.h>
# define be16toh(x) betoh16(x)
# define be32toh(x) betoh32(x)
# define be64toh(x) betoh64(x)
#elif defined(_AIX)
# define be16toh(x) ntohs(x)
# define be32toh(x) ntohl(x)
# define be64toh(x) ntohll(x)
# define htobe16(x) htons(x)
# define htobe32(x) htonl(x)
# define htobe64(x) htonll(x)
#endif
#include <cstring>
#include <cerrno>
#include <gnutls/gnutls.h>
#include <gnutls/crypto.h>
#include "hefur.hh"
#include "udp-server.hh"
#include "log.hh"
#include "options.hh"
#include "info-hash.hxx"
#ifndef MSG_NOSIGNAL
# define MSG_NOSIGNAL 0
#endif
namespace hefur
{
UdpServer::UdpServer()
: stop_(false),
thread_(),
fd_(-1),
secrets_(),
sbufs_(),
next_timeout_()
{
}
UdpServer::~UdpServer()
{
stop();
}
bool
UdpServer::start(uint16_t port,
bool ipv6)
{
if (fd_ >= 0)
stop();
stop_ = false;
fd_ = ::socket(ipv6 ? AF_INET6 : AF_INET, SOCK_DGRAM, 0);
if (fd_ < 0)
{
log->error("failed to create udp socket: %s", strerror(errno));
return false;
}
static const int enable = 1;
::setsockopt(fd_, SOL_SOCKET, SO_REUSEADDR, &enable, sizeof(enable));
// non block
if (::fcntl(fd_, F_SETFL, O_NONBLOCK) == -1)
log->error("fcntl(O_NONBLOCK) failed: %s", strerror(errno));
if (ipv6)
{
// accepts ipv4 connections
static const int disable = 0;
::setsockopt(fd_, IPPROTO_IPV6, IPV6_V6ONLY, &disable, sizeof (disable));
struct sockaddr_in6 addr;
::memset(&addr, 0, sizeof (addr));
addr.sin6_addr = ::in6addr_any;
addr.sin6_family = AF_INET6;
addr.sin6_port = htobe16(port);
if (::bind(fd_, (struct ::sockaddr *)&addr, sizeof (addr)))
{
log->error("failed to bind udp socket: %s", strerror(errno));
return false;
}
}
else
{
struct sockaddr_in addr;
::memset(&addr, 0, sizeof (addr));
addr.sin_addr.s_addr = INADDR_ANY;
addr.sin_family = AF_INET;
addr.sin_port = htobe16(port);
if (::bind(fd_, (struct ::sockaddr *)&addr, sizeof (addr)))
{
log->error("failed to bind udp socket: %s", strerror(errno));
return false;
}
}
// pre-generate 3 secrets
for (unsigned i = 0; i < sizeof (secrets_) / sizeof (*secrets_); ++i)
genSecret();
thread_.start([this] { this->run(); });
return true;
}
void
UdpServer::genSecret()
{
memmove(secrets_ + 1, secrets_, sizeof (secrets_) - sizeof (*secrets_));
if (::gnutls_rnd(GNUTLS_RND_NONCE, secrets_, sizeof (*secrets_)))
log->error("gnutls_rnd() failed");
next_timeout_ = m::monotonicTimeCoarse() + m::second;
}
void
UdpServer::run()
{
struct pollfd pfd;
int timeout;
pfd.fd = fd_;
pfd.events = POLLIN;
while (!stop_)
{
timeout = (next_timeout_ - m::monotonicTimeCoarse()) / m::millisecond;
if (timeout <= 0)
{
genSecret();
continue;
}
if (sbufs_.empty())
pfd.events = POLLIN;
else
pfd.events = POLLIN | POLLOUT;
int ret = ::poll(&pfd, 1, timeout);
if (ret < 0)
log->error("poll(): %s", ::strerror(errno));
else if (ret == 0)
genSecret();
else if (pfd.revents & POLLOUT)
send();
else if (pfd.revents & POLLIN)
receive();
}
}
void
UdpServer::send()
{
while (!sbufs_.empty())
{
SendToBuffer * sbuf = sbufs_.front();
ssize_t sbytes = ::sendto(fd_, sbuf->data_, sbuf->len_, MSG_NOSIGNAL,
&sbuf->addr_, sizeof (sbuf->in6_));
if (sbytes < 0)
{
if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR ||
errno == ENOMEM || errno == ENOBUFS)
return;
log->error("sendto: unexpected error: %s => dropping packet", strerror(errno));
}
sbufs_.pop();
::free(sbuf);
}
}
void
UdpServer::receive()
{
union
{
uint8_t buffer[4096];
ConnectRequest conn;
AnnounceRequest ann;
ScrapeRequest scrape;
};
union
{
struct ::sockaddr addr;
struct ::sockaddr_in in;
struct ::sockaddr_in6 in6;
};
while (sbufs_.size() < 64)
{
socklen_t solen = sizeof (in6);
ssize_t rbytes = recvfrom(fd_, buffer, sizeof (buffer), 0, &addr, &solen);
if (rbytes < 0) {
if (errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR)
return;
log->error("recvfrom: unexpected error: %s", strerror(errno));
return;
}
if ((size_t)rbytes < sizeof (conn))
continue;
conn.action_ = be32toh(conn.action_);
switch (conn.action_) {
case kConnect:
handleConnect(&conn, rbytes, &addr, solen);
break;
case kAnnounce:
handleAnnounce(&ann, rbytes, &addr, solen);
break;
case kScrape:
handleScrape(&scrape, rbytes, &addr, solen);
break;
default:
break;
}
}
}
void
UdpServer::handleConnect(ConnectRequest * conn,
size_t size,
struct ::sockaddr * addr,
socklen_t addr_len)
{
if (size < sizeof (*conn))
return;
SendToBuffer * sbuf;
size_t sbuf_len = sizeof (*sbuf) + sizeof (ConnectResponse);
sbuf = (SendToBuffer *)calloc(sbuf_len, 1);
if (!sbuf)
return;
sbuf->len_ = sbuf_len - sizeof (SendToBuffer);
::memcpy(&sbuf->addr_, addr, addr_len);
ConnectResponse * rp = (ConnectResponse *)sbuf->data_;
rp->connection_id_ = connectionId(secrets_[0], addr);
rp->transaction_id_ = conn->transaction_id_;
rp->action_ = htobe32(kConnect);
sbufs_.push(sbuf);
}
void
UdpServer::sendFailure(ConnectRequest * conn,
struct ::sockaddr * addr,
socklen_t addr_len,
const std::string & msg)
{
SendToBuffer * sbuf;
size_t sbuf_len = sizeof (*sbuf) + sizeof (ErrorResponse) + msg.size();
sbuf = (SendToBuffer *)calloc(sbuf_len, 1);
if (!sbuf)
return;
sbuf->len_ = sbuf_len - sizeof (SendToBuffer);
::memcpy(&sbuf->addr_, addr, addr_len);
ErrorResponse * rp = (ErrorResponse *)sbuf->data_;
rp->transaction_id_ = conn->transaction_id_;
rp->action_ = htobe32(kError);
::memcpy(rp->msg_, msg.data(), msg.size());
sbufs_.push(sbuf);
}
AnnounceRequest::Event
UdpServer::convert(Event event)
{
switch (event)
{
case kNone:
return hefur::AnnounceRequest::kNone;
case kStarted:
return hefur::AnnounceRequest::kStarted;
case kCompleted:
return hefur::AnnounceRequest::kCompleted;
case kStopped:
return hefur::AnnounceRequest::kStopped;
default:
return hefur::AnnounceRequest::kNone;
};
}
bool
UdpServer::checkConnectionId(uint64_t connection_id,
struct ::sockaddr * addr)
{
return connection_id == connectionId(secrets_[0], addr) ||
connection_id == connectionId(secrets_[1], addr) ||
connection_id == connectionId(secrets_[2], addr);
}
void
UdpServer::handleAnnounce(AnnounceRequest * ann,
size_t size,
struct ::sockaddr * addr,
socklen_t addr_len)
{
if (size < sizeof (*ann) ||
!checkConnectionId(ann->connection_id_, addr))
return;
hefur::AnnounceRequest::Ptr rq = new hefur::AnnounceRequest;
memcpy(rq->peerid_, ann->peer_id_, 20);
memcpy(rq->info_hash_.bytes_, ann->info_hash_, 20);
rq->downloaded_ = be64toh(ann->downloaded_);
rq->uploaded_ = be64toh(ann->uploaded_);
rq->left_ = be64toh(ann->left_);
rq->event_ = convert((Event)be32toh(ann->event_));
rq->num_want_ = be32toh(ann->num_want_);
rq->skip_ipv6_ = true;
if (ALLOW_PROXY)
{
rq->addr_.family_ = AF_INET;
memcpy(rq->addr_.in_.addr_, &ann->ip_, 4);
}
else
rq->addr_ = addr;
rq->addr_.setPort(be16toh(ann->port_));
auto tdb = Hefur::instance().torrentDb();
if (!tdb)
return;
auto rp = tdb->announce(rq);
if (!rp || rp->error_)
{
sendFailure((ConnectRequest *)ann, addr, addr_len,
rp ? rp->error_msg_ : "internal error (1)");
return;
}
SendToBuffer * sbuf;
size_t sbuf_len = sizeof (*sbuf) + sizeof (AnnounceResponse)
+ 6 * rp->addrs_.size();
sbuf = (SendToBuffer *)calloc(sbuf_len, 1);
if (!sbuf)
return;
sbuf->len_ = sbuf_len - sizeof (SendToBuffer);
::memcpy(&sbuf->addr_, addr, addr_len);
AnnounceResponse * rp2 = (AnnounceResponse *)sbuf->data_;
rp2->transaction_id_ = ann->transaction_id_;
rp2->action_ = htobe32(kAnnounce);
rp2->interval_ = htobe32(rp->interval_);
rp2->leechers_ = htobe32(rp->nleechers_);
rp2->seeders_ = htobe32(rp->nseeders_);
int i = 0;
for (auto it = rp->addrs_.begin(); it != rp->addrs_.end(); ++it, ++i)
{
if (it->family_ == AF_INET) {
memcpy(&rp2->peers_[i].ip_, (const char*)&it->in_.addr_, 4);
memcpy(&rp2->peers_[i].port_, (const char*)&it->in_.port_, 2);
}
}
sbufs_.push(sbuf);
}
void
UdpServer::handleScrape(ScrapeRequest * scrape,
size_t size,
struct ::sockaddr * addr,
socklen_t addr_len)
{
if (size < sizeof (*scrape) ||
!checkConnectionId(scrape->connection_id_, addr))
return;
hefur::ScrapeRequest::Ptr rq = new hefur::ScrapeRequest;
for (size_t i = 0; i < (size - sizeof (*scrape)) / 20; ++i)
rq->info_hashs_.push_back(InfoHash((const char *)scrape->info_hash_ + i * 20));
auto tdb = Hefur::instance().torrentDb();
if (!tdb)
return;
auto rp = tdb->scrape(rq);
if (!rp || rp->error_)
{
sendFailure((ConnectRequest *)scrape, addr, addr_len,
rp ? rp->error_msg_ : "internal error (1)");
return;
}
SendToBuffer * sbuf;
size_t sbuf_len = sizeof (*sbuf) + sizeof (ScrapeResponse)
+ 12 * rp->items_.size();
sbuf = (SendToBuffer *)calloc(sbuf_len, 1);
if (!sbuf)
return;
sbuf->len_ = sbuf_len - sizeof (SendToBuffer);
::memcpy(&sbuf->addr_, addr, addr_len);
ScrapeResponse * rp2 = (ScrapeResponse *)sbuf->data_;
rp2->transaction_id_ = scrape->transaction_id_;
rp2->action_ = htobe32(kScrape);
int i = 0;
for (auto it = rp->items_.begin(); it != rp->items_.end(); ++it, ++i)
{
rp2->torrents_[i].seeders_ = htobe32(it->nseeders_);
rp2->torrents_[i].leechers_ = htobe32(it->nleechers_);
rp2->torrents_[i].completed_ = htobe32(it->ndownloaded_);
}
sbufs_.push(sbuf);
}
void
UdpServer::stop()
{
if (fd_ <= 0)
return;
stop_ = true;
thread_.cancel();
thread_.join();
}
uint64_t
UdpServer::connectionId(const Secret & secret, struct ::sockaddr * addr)
{
if (addr->sa_family == AF_INET)
return connectionId(secret, (struct ::sockaddr_in *)addr);
else if (addr->sa_family == AF_INET6)
return connectionId(secret, (struct ::sockaddr_in6 *)addr);
// WTF??
return 42;
}
uint64_t
UdpServer::connectionId(const Secret & secret, struct ::sockaddr_in * addr)
{
uint8_t * ip = (uint8_t *)&addr->sin_addr;
uint64_t conn_id = 0;
for (int j = 0; j < 4; ++j)
conn_id += (ip[j] * secret.s_[j]) ^ secret.s_[j + 1];
return conn_id;
}
uint64_t
UdpServer::connectionId(const Secret & secret, struct ::sockaddr_in6 * addr)
{
uint8_t * ip = (uint8_t *)&addr->sin6_addr;
uint64_t conn_id = 0;
for (int j = 0; j < 16; ++j)
conn_id += (ip[j] * secret.s_[j]) ^ secret.s_[j + 1];
return conn_id;
}
}
| 26.293249 | 87 | 0.566717 | KrauseStefan |
a38408321fbe5e69bb3868192bf33af5f2ee7bdc | 700 | hpp | C++ | src/gui/addentrypointdialog.hpp | AndreaOrru/Gilgamesh | c688dcecd80236d2e62641ee4d157e1ef042c7d9 | [
"BSD-2-Clause"
] | 25 | 2015-11-27T01:47:24.000Z | 2018-09-17T12:57:45.000Z | src/gui/addentrypointdialog.hpp | AndreaOrru/gilgamesh | c688dcecd80236d2e62641ee4d157e1ef042c7d9 | [
"BSD-2-Clause"
] | 122 | 2019-08-11T18:54:09.000Z | 2020-05-31T08:43:44.000Z | src/gui/addentrypointdialog.hpp | AndreaOrru/Gilgamesh | c688dcecd80236d2e62641ee4d157e1ef042c7d9 | [
"BSD-2-Clause"
] | null | null | null | #pragma once
#include <QDialog>
#include <string>
#include "state.hpp"
#include "types.hpp"
class QGroupBox;
class QLineEdit;
class QRadioButton;
class AddEntryPointDialog : public QDialog {
Q_OBJECT
public:
AddEntryPointDialog(QWidget* parent = nullptr);
std::string label;
SubroutinePC pc;
State state;
private slots:
void accept();
private:
auto createTextAreas();
auto createRegisterStateGroup(QString reg);
auto createButtonBox();
void setupLayout();
QLineEdit* labelText;
QLineEdit* pcText;
QGroupBox* mStateGroup;
QRadioButton* mStateZero;
QRadioButton* mStateOne;
QGroupBox* xStateGroup;
QRadioButton* xStateZero;
QRadioButton* xStateOne;
};
| 16.27907 | 49 | 0.741429 | AndreaOrru |
a38909d2f095c44db5be5bf31ba6f2a559e27d21 | 3,544 | cpp | C++ | Environment/ScriptBind_InteractiveObject.cpp | IvarJonsson/Project-Unknown | 4675b41bbb5e90135c7bf3aded2c2e262b50f351 | [
"BSL-1.0"
] | null | null | null | Environment/ScriptBind_InteractiveObject.cpp | IvarJonsson/Project-Unknown | 4675b41bbb5e90135c7bf3aded2c2e262b50f351 | [
"BSL-1.0"
] | null | null | null | Environment/ScriptBind_InteractiveObject.cpp | IvarJonsson/Project-Unknown | 4675b41bbb5e90135c7bf3aded2c2e262b50f351 | [
"BSL-1.0"
] | null | null | null | // Copyright 2001-2016 Crytek GmbH / Crytek Group. All rights reserved.
/*************************************************************************
-------------------------------------------------------------------------
$Id$
$DateTime$
Description: Script bind functions for Crysis2 interactive object
-------------------------------------------------------------------------
History:
- 14:12:2009: Created by Benito G.R.
*************************************************************************/
#include "StdAfx.h"
#include "InteractiveObject.h"
#include "ScriptBind_InteractiveObject.h"
CScriptBind_InteractiveObject::CScriptBind_InteractiveObject( ISystem *pSystem, IGameFramework *pGameFramework )
: m_pSystem(pSystem)
, m_pGameFrameWork(pGameFramework)
{
Init(pSystem->GetIScriptSystem(), m_pSystem, 1);
RegisterMethods();
}
CScriptBind_InteractiveObject::~CScriptBind_InteractiveObject()
{
}
void CScriptBind_InteractiveObject::RegisterMethods()
{
#undef SCRIPT_REG_CLASSNAME
#define SCRIPT_REG_CLASSNAME &CScriptBind_InteractiveObject::
SCRIPT_REG_TEMPLFUNC(CanUse, "userId");
SCRIPT_REG_TEMPLFUNC(Use, "userId");
SCRIPT_REG_TEMPLFUNC(StopUse, "userId");
SCRIPT_REG_TEMPLFUNC(AbortUse, "");
}
void CScriptBind_InteractiveObject::AttachTo( CInteractiveObjectEx *pInteractiveObject )
{
IScriptTable *pScriptTable = pInteractiveObject->GetEntity()->GetScriptTable();
if (pScriptTable)
{
SmartScriptTable thisTable(m_pSS);
thisTable->SetValue("__this", ScriptHandle(pInteractiveObject->GetEntityId()));
thisTable->Delegate(GetMethodsTable());
pScriptTable->SetValue("interactiveObject", thisTable);
}
m_interactiveObjectsMap.insert(TInteractiveObjectsMap::value_type(pInteractiveObject->GetEntityId(), pInteractiveObject));
}
void CScriptBind_InteractiveObject::Detach( EntityId entityId )
{
m_interactiveObjectsMap.erase(entityId);
}
CInteractiveObjectEx * CScriptBind_InteractiveObject::GetInteractiveObject( IFunctionHandler *pH )
{
void* pThis = pH->GetThis();
if (pThis)
{
const EntityId objectId = (EntityId)(UINT_PTR)pThis;
TInteractiveObjectsMap::const_iterator cit = m_interactiveObjectsMap.find(objectId);
if (cit != m_interactiveObjectsMap.end())
{
return cit->second;
}
}
return NULL;
}
int CScriptBind_InteractiveObject::CanUse( IFunctionHandler *pH, ScriptHandle userId )
{
CInteractiveObjectEx *pInteractiveObject = GetInteractiveObject(pH);
if (pInteractiveObject)
{
return pH->EndFunction(pInteractiveObject->CanUse((EntityId)userId.n));
}
return pH->EndFunction();
}
int CScriptBind_InteractiveObject::Use( IFunctionHandler *pH, ScriptHandle userId )
{
CInteractiveObjectEx *pInteractiveObject = GetInteractiveObject(pH);
if (pInteractiveObject)
{
pInteractiveObject->Use((EntityId)userId.n);
}
return pH->EndFunction();
}
int CScriptBind_InteractiveObject::StopUse( IFunctionHandler *pH, ScriptHandle userId )
{
CInteractiveObjectEx *pInteractiveObject = GetInteractiveObject(pH);
if (pInteractiveObject)
{
pInteractiveObject->StopUse((EntityId)userId.n);
}
return pH->EndFunction();
}
int CScriptBind_InteractiveObject::AbortUse( IFunctionHandler *pH )
{
CInteractiveObjectEx *pInteractiveObject = GetInteractiveObject(pH);
if (pInteractiveObject)
{
pInteractiveObject->AbortUse();
}
return pH->EndFunction();
}
void CScriptBind_InteractiveObject::GetMemoryUsage(ICrySizer *pSizer) const
{
pSizer->AddObject(this, sizeof(*this));
pSizer->AddContainer(m_interactiveObjectsMap);
pSizer->AddObject(m_objectDataRegistry);
} | 26.646617 | 123 | 0.720655 | IvarJonsson |
a38e1a72eadc727f0b2a78f8bbf1d764b6fb16f8 | 1,158 | cpp | C++ | chapter-10/10.22.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | chapter-10/10.22.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | chapter-10/10.22.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | #include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <functional>
using std::vector;
using std::string;
using std::cout;
using std::endl;
using std::sort;
using std::find_if;
using std::unique;
using std::stable_sort;
using std::for_each;
using std::bind;
using std::placeholders::_1;
void elimDups(vector<string> &words)
{
sort(words.begin(), words.end());
auto end_unique = unique(words.begin(), words.end());
words.erase(end_unique, words.end());
}
bool is_shorter(const string &s1, const string &s2)
{
return s1.size() < s2.size();
}
bool compare_sz(const string &s, string::size_type sz)
{
return s.size() >= sz;
}
void biggies(vector<string> &words, vector<string>::size_type sz)
{
elimDups(words);
stable_sort(words.begin(), words.end(), is_shorter);
auto iter = find_if(words.begin(), words.end(),
bind(compare_sz, _1, sz));
auto count = words.end() - iter;
cout << count << " words" << endl;
for_each(iter, words.end(), [](const string &s){cout << s << endl;});
}
int main()
{
vector<string> vs =
{"the", "time", "is", "near", "near", "the", "sunrise"};
biggies(vs, 4);
}
| 21.849057 | 71 | 0.65544 | zero4drift |
a393e0b9118fad28efbb4b898055d1a1ca0237df | 2,491 | hpp | C++ | include/codegen/include/UnityEngine/TestRunner/NUnitExtensions/Runner/CompositeWorkItem_UnityWorkItemOrderComparer.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/UnityEngine/TestRunner/NUnitExtensions/Runner/CompositeWorkItem_UnityWorkItemOrderComparer.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/UnityEngine/TestRunner/NUnitExtensions/Runner/CompositeWorkItem_UnityWorkItemOrderComparer.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | // Autogenerated from CppHeaderCreator on 7/27/2020 3:10:35 PM
// Created by Sc2ad
// =========================================================================
#pragma once
#pragma pack(push, 8)
// Begin includes
#include "utils/typedefs.h"
// Including type: System.Object
#include "System/Object.hpp"
// Including type: UnityEngine.TestRunner.NUnitExtensions.Runner.CompositeWorkItem
#include "UnityEngine/TestRunner/NUnitExtensions/Runner/CompositeWorkItem.hpp"
// Including type: System.Collections.Generic.IComparer`1
#include "System/Collections/Generic/IComparer_1.hpp"
#include "utils/il2cpp-utils.hpp"
// Completed includes
// Begin forward declares
// Forward declaring namespace: UnityEngine::TestRunner::NUnitExtensions::Runner
namespace UnityEngine::TestRunner::NUnitExtensions::Runner {
// Skipping declaration: UnityWorkItem because it is already included!
}
// Completed forward declares
// Type namespace: UnityEngine.TestRunner.NUnitExtensions.Runner
namespace UnityEngine::TestRunner::NUnitExtensions::Runner {
// Autogenerated type: UnityEngine.TestRunner.NUnitExtensions.Runner.CompositeWorkItem/UnityWorkItemOrderComparer
class CompositeWorkItem::UnityWorkItemOrderComparer : public ::Il2CppObject, public System::Collections::Generic::IComparer_1<UnityEngine::TestRunner::NUnitExtensions::Runner::UnityWorkItem*> {
public:
// public System.Int32 Compare(UnityEngine.TestRunner.NUnitExtensions.Runner.UnityWorkItem x, UnityEngine.TestRunner.NUnitExtensions.Runner.UnityWorkItem y)
// Offset: 0xE1C370
// Implemented from: System.Collections.Generic.IComparer`1
// Base method: System.Int32 IComparer`1::Compare(UnityEngine.TestRunner.NUnitExtensions.Runner.UnityWorkItem x, UnityEngine.TestRunner.NUnitExtensions.Runner.UnityWorkItem y)
int Compare(UnityEngine::TestRunner::NUnitExtensions::Runner::UnityWorkItem* x, UnityEngine::TestRunner::NUnitExtensions::Runner::UnityWorkItem* y);
// public System.Void .ctor()
// Offset: 0xE19FD0
// Implemented from: System.Object
// Base method: System.Void Object::.ctor()
static CompositeWorkItem::UnityWorkItemOrderComparer* New_ctor();
}; // UnityEngine.TestRunner.NUnitExtensions.Runner.CompositeWorkItem/UnityWorkItemOrderComparer
}
DEFINE_IL2CPP_ARG_TYPE(UnityEngine::TestRunner::NUnitExtensions::Runner::CompositeWorkItem::UnityWorkItemOrderComparer*, "UnityEngine.TestRunner.NUnitExtensions.Runner", "CompositeWorkItem/UnityWorkItemOrderComparer");
#pragma pack(pop)
| 60.756098 | 218 | 0.782818 | Futuremappermydud |
a397dfb912817cb6fcf1b8264c7d8789b37edcee | 2,283 | cpp | C++ | src/esp/sensor/Sensor.cpp | xjwang-cs/habitat-sim | bb984fe8d2b8c9844bcfc1f121dd83fcb377aeda | [
"MIT"
] | null | null | null | src/esp/sensor/Sensor.cpp | xjwang-cs/habitat-sim | bb984fe8d2b8c9844bcfc1f121dd83fcb377aeda | [
"MIT"
] | null | null | null | src/esp/sensor/Sensor.cpp | xjwang-cs/habitat-sim | bb984fe8d2b8c9844bcfc1f121dd83fcb377aeda | [
"MIT"
] | null | null | null | // Copyright (c) Facebook, Inc. and its affiliates.
// This source code is licensed under the MIT license found in the
// LICENSE file in the root directory of this source tree.
#include "Sensor.h"
#include <Magnum/EigenIntegration/Integration.h>
namespace esp {
namespace sensor {
Sensor::Sensor(scene::SceneNode& node, SensorSpec::ptr spec)
: Magnum::SceneGraph::AbstractFeature3D{node}, spec_(spec) {
node.setType(scene::SceneNodeType::SENSOR);
if (spec_ == nullptr) {
LOG(ERROR) << "Cannot initialize sensor. The specification is null.";
}
ASSERT(spec_ != nullptr);
setTransformationFromSpec();
}
bool Sensor::getObservation(gfx::Simulator& sim, Observation& obs) {
// TODO fill out observation
return false;
}
bool Sensor::getObservationSpace(ObservationSpace& space) {
// TODO fill out observation space
return false;
}
bool Sensor::displayObservation(gfx::Simulator& sim) {
// TODO fill out display observation if sensor supports it
return false;
}
void SensorSuite::add(Sensor::ptr sensor) {
const std::string uuid = sensor->specification()->uuid;
sensors_[uuid] = sensor;
}
Sensor::ptr SensorSuite::get(const std::string& uuid) const {
return (sensors_.at(uuid));
}
void SensorSuite::clear() {
sensors_.clear();
}
void Sensor::setTransformationFromSpec() {
if (spec_ == nullptr) {
LOG(ERROR) << "Cannot initialize sensor. the specification is null.";
return;
}
node().resetTransformation();
node().translate(Magnum::Vector3(spec_->position));
node().rotateX(Magnum::Rad(spec_->orientation[0]));
node().rotateY(Magnum::Rad(spec_->orientation[1]));
node().rotateZ(Magnum::Rad(spec_->orientation[2]));
}
bool operator==(const SensorSpec& a, const SensorSpec& b) {
return a.uuid == b.uuid && a.sensorType == b.sensorType &&
a.sensorSubtype == b.sensorSubtype && a.parameters == b.parameters &&
a.position == b.position && a.orientation == b.orientation &&
a.resolution == b.resolution && a.channels == b.channels &&
a.encoding == b.encoding && a.observationSpace == b.observationSpace &&
a.gpu2gpuTransfer == b.gpu2gpuTransfer;
}
bool operator!=(const SensorSpec& a, const SensorSpec& b) {
return !(a == b);
}
} // namespace sensor
} // namespace esp
| 28.898734 | 80 | 0.69032 | xjwang-cs |
a399b76c4b504295b9802677ef8c5c99e1ad0d97 | 5,867 | cpp | C++ | AudioMixer/InputVolAdjDlg.cpp | ray-x/AudioMixer | 53d40543bdebcd60091e6952e8af43799e479e18 | [
"MIT"
] | null | null | null | AudioMixer/InputVolAdjDlg.cpp | ray-x/AudioMixer | 53d40543bdebcd60091e6952e8af43799e479e18 | [
"MIT"
] | null | null | null | AudioMixer/InputVolAdjDlg.cpp | ray-x/AudioMixer | 53d40543bdebcd60091e6952e8af43799e479e18 | [
"MIT"
] | null | null | null | // InputVolAdjDlg.cpp : implementation file
//
#include "stdafx.h"
#include "AudioMixer.h"
#include "InputVolAdjDlg.h"
#include "ConfData.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
#include "Wait.h"
/////////////////////////////////////////////////////////////////////////////
// CInputVolAdjDlg dialog
CInputVolAdjDlg::CInputVolAdjDlg(CWnd* pParent /*=NULL*/)
: CPropertyPage(CInputVolAdjDlg::IDD)
{
//{{AFX_DATA_INIT(CInputVolAdjDlg)
m_inputVol1 = 0;
m_inputVol2 = 0;
m_inputVol3 = 0;
m_inputVol4 = 0;
m_inputVol5 = 0;
m_inputVol6 = 0;
m_inputVol7 = 0;
m_inputVol8 = 0;
m_numTotalCh = 0;
//}}AFX_DATA_INIT
}
void CInputVolAdjDlg::DoDataExchange(CDataExchange* pDX)
{
CDialog::DoDataExchange(pDX);
//{{AFX_DATA_MAP(CInputVolAdjDlg)
DDX_Control(pDX, IDC_SLIDER8, m_SliderInput8);
DDX_Control(pDX, IDC_SLIDER7, m_SliderInput7);
DDX_Control(pDX, IDC_SLIDER6, m_SliderInput6);
DDX_Control(pDX, IDC_SLIDER5, m_SliderInput5);
DDX_Control(pDX, IDC_SLIDER4, m_SliderInput4);
DDX_Control(pDX, IDC_SLIDER3, m_SliderInput3);
DDX_Control(pDX, IDC_SLIDER2, m_SliderInput2);
DDX_Control(pDX, IDC_SLIDER1, m_SliderInput1);
DDX_Slider(pDX, IDC_SLIDER1, m_inputVol1);
DDX_Slider(pDX, IDC_SLIDER2, m_inputVol2);
DDX_Slider(pDX, IDC_SLIDER3, m_inputVol3);
DDX_Slider(pDX, IDC_SLIDER4, m_inputVol4);
DDX_Slider(pDX, IDC_SLIDER5, m_inputVol5);
DDX_Slider(pDX, IDC_SLIDER6, m_inputVol6);
DDX_Slider(pDX, IDC_SLIDER7, m_inputVol7);
DDX_Slider(pDX, IDC_SLIDER8, m_inputVol8);
DDX_Radio(pDX, IDC_RADIO_FOURCH, m_numTotalCh);
//}}AFX_DATA_MAP
}
BEGIN_MESSAGE_MAP(CInputVolAdjDlg, CDialog)
//{{AFX_MSG_MAP(CInputVolAdjDlg)
ON_BN_CLICKED(IDC_BUTTON_APPLY_IVOLCHANGE, OnButtonApplyInputVolChange)
ON_WM_VSCROLL()
//}}AFX_MSG_MAP
END_MESSAGE_MAP()
/////////////////////////////////////////////////////////////////////////////
// CInputVolAdjDlg message handlers
BOOL CInputVolAdjDlg::OnInitDialog()
{
CDialog::OnInitDialog();
m_SliderInput1.SetRange(0,15);
m_SliderInput2.SetRange(0,15);
m_SliderInput3.SetRange(0,15);
m_SliderInput4.SetRange(0,15);
m_SliderInput5.SetRange(0,15);
m_SliderInput6.SetRange(0,15);
m_SliderInput7.SetRange(0,15);
m_SliderInput8.SetRange(0,15);
m_SliderInput1.SetPos(0xF-extConfigData.m_InputConf[0]&0xF);
m_SliderInput1.SetRange(0,15,TRUE);
m_SliderInput2.SetPos(0xF-extConfigData.m_InputConf[1]&0xF);
m_SliderInput2.SetRange(0,15,TRUE);
m_SliderInput3.SetPos(0xF-extConfigData.m_InputConf[2]&0xF);
m_SliderInput3.SetRange(0,15,TRUE);
m_SliderInput4.SetPos(0xF-extConfigData.m_InputConf[3]&0xF);
m_SliderInput4.SetRange(0,15,TRUE);
m_SliderInput5.SetPos(0xF-extConfigData.m_InputConf[4]&0xF);
m_SliderInput5.SetRange(0,15,TRUE);
m_SliderInput6.SetPos(0xF-extConfigData.m_InputConf[5]&0xF);
m_SliderInput6.SetRange(0,15,TRUE);
m_SliderInput7.SetPos(0xF-extConfigData.m_InputConf[6]&0xF);
m_SliderInput7.SetRange(0,15,TRUE);
m_SliderInput8.SetPos(0xF-extConfigData.m_InputConf[7]&0xF);
m_SliderInput8.SetRange(0,15,TRUE);
// TODO: Add extra initialization here
return TRUE; // return TRUE unless you set the focus to a control
// EXCEPTION: OCX Property Pages should return FALSE
}
void CInputVolAdjDlg::OnButtonApplyInputVolChange()
{
// TODO: Add your control notification handler code here
UpdateData(TRUE);
extConfigData.m_InputConf[0]=0xF-m_inputVol1&0xF;
extConfigData.m_InputConf[1]=0xF-m_inputVol2&0xF;
extConfigData.m_InputConf[2]=0xF-m_inputVol3&0xF;
extConfigData.m_InputConf[3]=0xF-m_inputVol4&0xF;
if(m_numTotalCh==1)
{
extConfigData.m_InputConf[4]=0xF-m_inputVol5&0xF;
extConfigData.m_InputConf[5]=0xF-m_inputVol6&0xF;
extConfigData.m_InputConf[6]=0xF-m_inputVol7&0xF;
extConfigData.m_InputConf[7]=0xF-m_inputVol8&0xF;
}
CWait dlg(1,NULL); //1 means input
dlg.DoModal();
//dlg.SendData();
}
void CInputVolAdjDlg::OnVScroll(UINT nSBCode, UINT nPos, CScrollBar* pScrollBar)
{
// TODO: Add your message handler code here and/or call default
int ch;
UpdateData(TRUE);
CWait dlg(1,NULL); //1 means input
dlg.Init();
//dlg.InitConfBuf();
if(extConfigData.m_InputConf[0]!=(0xF-m_inputVol1&0xF)){
extConfigData.m_InputConf[0]=0xF-m_inputVol1&0xF;
ch=1;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if(extConfigData.m_InputConf[1]!=(0xF-m_inputVol2&0xF)){
extConfigData.m_InputConf[1]=0xF-m_inputVol2&0xF;
ch=2;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if(extConfigData.m_InputConf[2]!=(0xF-m_inputVol3&0xF)){
extConfigData.m_InputConf[2]=0xF-m_inputVol3&0xF;
ch=3;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if(extConfigData.m_InputConf[3]!=(0xF-m_inputVol4&0xF)){
extConfigData.m_InputConf[3]=0xF-m_inputVol4&0xF;
ch=4;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if(m_numTotalCh==1)
{
if(extConfigData.m_InputConf[4]!=(0xF-m_inputVol5&0xF)){
extConfigData.m_InputConf[4]=0xF-m_inputVol5&0xF;
ch=5;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if (extConfigData.m_InputConf[5]!=(0xF-m_inputVol6&0xF))
{
extConfigData.m_InputConf[5]=0xF-m_inputVol6&0xF;
ch=6;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if (extConfigData.m_InputConf[6]!=(0xF-m_inputVol7&0xF))
{
extConfigData.m_InputConf[6]=0xF-m_inputVol7&0xF;
ch=7;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
if (extConfigData.m_InputConf[7]!=(0xF-m_inputVol8&0xF))
{
extConfigData.m_InputConf[7]=0xF-m_inputVol8&0xF;
ch=8;
dlg.UpdateInputVol(ch,extConfigData.m_InputConf[ch-1] );
}
}else
{
extConfigData.m_InputConf[4]=extConfigData.m_InputConf[5]=extConfigData.m_InputConf[6]=extConfigData.m_InputConf[7]=0x00;
}
if (ch>8||ch<1)
{
ch=1;
}
CDialog::OnVScroll(nSBCode, nPos, pScrollBar);
}
| 29.044554 | 123 | 0.737685 | ray-x |
a39ca26b1a5000913646455ab482038ed1fbeeb0 | 6,111 | hpp | C++ | cppcache/include/geode/CqQuery.hpp | mmartell/geode-native | fa6edf5d3ad83c78431f0c5e2da163b7a0df5558 | [
"Apache-2.0"
] | null | null | null | cppcache/include/geode/CqQuery.hpp | mmartell/geode-native | fa6edf5d3ad83c78431f0c5e2da163b7a0df5558 | [
"Apache-2.0"
] | null | null | null | cppcache/include/geode/CqQuery.hpp | mmartell/geode-native | fa6edf5d3ad83c78431f0c5e2da163b7a0df5558 | [
"Apache-2.0"
] | null | null | null | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
#pragma once
#ifndef GEODE_CQQUERY_H_
#define GEODE_CQQUERY_H_
#include <chrono>
#include "internal/geode_globals.hpp"
#include "CqResults.hpp"
#include "CqStatistics.hpp"
#include "CqAttributes.hpp"
#include "CqAttributesMutator.hpp"
#include "CqState.hpp"
/**
* @file
*/
namespace apache {
namespace geode {
namespace client {
class Query;
/**
* @class CqQuery CqQuery.hpp
*
* A Query is obtained from a QueryService which in turn is obtained from the
* Cache.
* This can be executed to return SelectResults which can be either
* a ResultSet or a StructSet, or it can be just registered on the java server
* without returning results immediately rather only the incremental results.
*
* This class is intentionally not thread-safe. So multiple threads should not
* operate on the same <code>CqQuery</code> object concurrently rather should
* have their own <code>CqQuery</code> objects.
*/
class APACHE_GEODE_EXPORT CqQuery {
public:
/**
* Get the query string provided when a new Query was created from a
* QueryService.
* @returns The query string.
*/
virtual const std::string& getQueryString() const = 0;
/**
* Get teh query object generated for this CQs query.
* @return Query object fort he query string
*/
virtual std::shared_ptr<Query> getQuery() const = 0;
/**
* Get the name of the CQ.
* @return the name of the CQ.
*/
virtual const std::string& getName() const = 0;
/**
* Get the statistics information of this CQ.
* @return CqStatistics, the CqStatistics object.
*/
virtual std::shared_ptr<CqStatistics> getStatistics() const = 0;
/**
* Get the Attributes of this CQ.
* @return CqAttributes, the CqAttributes object.
*/
virtual std::shared_ptr<CqAttributes> getCqAttributes() const = 0;
/**
* Get the AttributesMutator of this CQ.
* @return CqAttributesMutator, the CqAttributesMutator object.
*/
virtual std::shared_ptr<CqAttributesMutator> getCqAttributesMutator()
const = 0;
/**
* Start executing the CQ or if this CQ is stopped earlier, resumes execution
* of the CQ.
* Get the resultset associated with CQ query.
* The CQ is executed on primary and redundant servers, if CQ execution fails
* on all the
* server then a CqException is thrown.
*
* @param timeout The time to wait for query response, optional.
*
* @throws IllegalArgumentException If timeout exceeds 2147483647ms.
* @throws CqClosedException if this CqQuery is closed.
* @throws RegionNotFoundException if the specified region in the
* query string is not found.
* @throws IllegalStateException if the CqQuery is in the RUNNING state
* already.
* @throws CqException if failed to execute and get initial results.
* @return CqResults resultset obtained by executing the query.
*/
virtual std::shared_ptr<CqResults> executeWithInitialResults(
std::chrono::milliseconds timeout = DEFAULT_QUERY_RESPONSE_TIMEOUT) = 0;
/**
* Executes the OQL Query on the cache server and returns the results.
*
* @throws RegionNotFoundException if the specified region in the
* query string is not found.
* @throws CqClosedException if this CqQuery is closed.
* @throws CqException if some query error occurred at the server.
* @throws IllegalStateException if some error occurred.
* @throws NotConnectedException if no java cache server is available. For
* pools
* configured with locators, if no locators are available, the cause of
* NotConnectedException
* is set to NoAvailableLocatorsException.
*/
virtual void execute() = 0;
/**
* Stops this CqQuery without releasing resources. Puts the CqQuery into
* the STOPPED state. Can be resumed by calling execute or
* executeWithInitialResults.
* @throws IllegalStateException if the CqQuery is in the STOPPED state
* already.
* @throws CqClosedException if the CQ is CLOSED.
*/
virtual void stop() = 0;
/**
* Get the state of the CQ in CqState object form.
* CqState supports methods like isClosed(), isRunning(), isStopped().
* @see CqState
* @return CqState state object of the CQ.
*/
virtual CqState getState() = 0;
/**
* Close the CQ and stop execution.
* Releases the resources associated with this CqQuery.
* @throws CqClosedException Further calls on this CqQuery instance except
* for getState() or getName().
* @throws CqException - if failure during cleanup of CQ resources.
*/
virtual void close() = 0;
/**
* This allows to check if the CQ is in running or active.
* @return boolean true if running, false otherwise
*/
virtual bool isRunning() const = 0;
/**
* This allows to check if the CQ is in stopped.
* @return boolean true if stopped, false otherwise
*/
virtual bool isStopped() const = 0;
/**
* This allows to check if the CQ is closed.
* @return boolean true if closed, false otherwise
*/
virtual bool isClosed() const = 0;
/**
* This allows to check if the CQ is durable.
* @return boolean true if durable, false otherwise
* @since 5.5
*/
virtual bool isDurable() const = 0;
};
} // namespace client
} // namespace geode
} // namespace apache
#endif // GEODE_CQQUERY_H_
| 31.994764 | 79 | 0.706595 | mmartell |
a39d99cd42f4ecbc321801e8124eb2ddbfd71c19 | 3,643 | cpp | C++ | testsuites/unittest/process/basic/pthread/smoke/pthread_once_test_001.cpp | qdsxinyee4/PatentsViewh | c0e2da8d88ccb6af89d80e38dfc8f2b70f8627f9 | [
"BSD-3-Clause"
] | 175 | 2020-10-21T15:15:18.000Z | 2022-03-31T04:59:30.000Z | testsuites/unittest/process/basic/pthread/smoke/pthread_once_test_001.cpp | qdsxinyee4/PatentsViewh | c0e2da8d88ccb6af89d80e38dfc8f2b70f8627f9 | [
"BSD-3-Clause"
] | 1 | 2020-12-20T11:41:53.000Z | 2020-12-21T04:49:33.000Z | testsuites/unittest/process/basic/pthread/smoke/pthread_once_test_001.cpp | qdsxinyee4/PatentsViewh | c0e2da8d88ccb6af89d80e38dfc8f2b70f8627f9 | [
"BSD-3-Clause"
] | 39 | 2020-10-26T03:23:18.000Z | 2022-03-28T16:23:03.000Z | /*
* Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
* Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
* of conditions and the following disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used
* to endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "it_pthread_test.h"
static int g_number = 0;
static int g_okStatus = 777; // 777, a special number indicate the status is ok.
static pthread_once_t g_onceCtrl = PTHREAD_ONCE_INIT;
static void InitRoutine(void)
{
g_number++;
}
static void *Threadfunc(void *parm)
{
int err;
err = pthread_once(&g_onceCtrl, InitRoutine);
ICUNIT_GOTO_EQUAL(err, 0, err, EXIT);
return (void *)g_okStatus;
EXIT:
return NULL;
}
static void *ThreadFuncTest(void *arg)
{
pthread_t thread[3];
int rc = 0;
int i = 3;
void *status;
const int threadsNum = 3;
g_number = 0;
for (i = 0; i < threadsNum; ++i) {
rc = pthread_create(&thread[i], NULL, Threadfunc, NULL);
ICUNIT_GOTO_EQUAL(rc, 0, rc, EXIT);
}
for (i = 0; i < threadsNum; ++i) {
rc = pthread_join(thread[i], &status);
ICUNIT_GOTO_EQUAL(rc, 0, rc, EXIT);
ICUNIT_GOTO_EQUAL((unsigned int)status, (unsigned int)g_okStatus, status, EXIT);
}
ICUNIT_GOTO_EQUAL(g_number, 1, g_number, EXIT);
EXIT:
return NULL;
}
static int Testcase(void)
{
int ret;
pthread_t newPthread;
int curThreadPri, curThreadPolicy;
pthread_attr_t a = { 0 };
struct sched_param param = { 0 };
g_onceCtrl = PTHREAD_ONCE_INIT;
ret = pthread_getschedparam(pthread_self(), &curThreadPolicy, ¶m);
ICUNIT_ASSERT_EQUAL(ret, 0, -ret);
curThreadPri = param.sched_priority;
ret = pthread_attr_init(&a);
pthread_attr_setinheritsched(&a, PTHREAD_EXPLICIT_SCHED);
param.sched_priority = curThreadPri + 2; // 2, adjust the priority.
pthread_attr_setschedparam(&a, ¶m);
ret = pthread_create(&newPthread, &a, ThreadFuncTest, 0);
ICUNIT_ASSERT_EQUAL(ret, 0, ret);
ret = pthread_join(newPthread, NULL);
ICUNIT_ASSERT_EQUAL(ret, 0, ret);
return 0;
}
void ItTestPthreadOnce001(void)
{
TEST_ADD_CASE("IT_PTHREAD_ONCE_001", Testcase, TEST_POSIX, TEST_MEM, TEST_LEVEL0, TEST_FUNCTION);
}
| 32.81982 | 101 | 0.716442 | qdsxinyee4 |
a3a3484d28bb82ccf5a7bdc27dfd0bb2ee37c611 | 462 | cpp | C++ | examples/insertion.cpp | uliana99/course | cd92a799fecc4f76d7ca858bf2904432ce1477ac | [
"MIT"
] | null | null | null | examples/insertion.cpp | uliana99/course | cd92a799fecc4f76d7ca858bf2904432ce1477ac | [
"MIT"
] | null | null | null | examples/insertion.cpp | uliana99/course | cd92a799fecc4f76d7ca858bf2904432ce1477ac | [
"MIT"
] | null | null | null | #include "insertion.hpp"
void sortInsertion() {
srand(time(NULL));
const int ARRAY_LEN = 20;
const int INT_RANGE = 100;
int *array = new int[ARRAY_LEN];
for (int i = 0; i < ARRAY_LEN; i ++) {
array[i] = rand() % INT_RANGE;
}
messageInsertsort(array, ARRAY_LEN);
insertsort(array, ARRAY_LEN);
messageInsertsort(array, ARRAY_LEN);
}
int main(int argc, char const *argv[]) {
sortInsertion();
return 0;
} | 20.086957 | 42 | 0.61039 | uliana99 |
a3a387e97ddff09bb34d8e3f8e5031f2412c153b | 1,576 | cpp | C++ | Queue/Queue_using_linked_list.cpp | PreethiSamanthaBennet/Cpp_TheDataStructuresSurvivalKit | f8657cc0c3fc5056d4c003ba7ebcce2e1a7d99a6 | [
"BSD-3-Clause"
] | 3 | 2021-05-21T17:24:18.000Z | 2021-08-11T19:34:38.000Z | Queue/Queue_using_linked_list.cpp | PreethiSamanthaBennet/Cpp_TheDataStructuresSurvivalKit | f8657cc0c3fc5056d4c003ba7ebcce2e1a7d99a6 | [
"BSD-3-Clause"
] | null | null | null | Queue/Queue_using_linked_list.cpp | PreethiSamanthaBennet/Cpp_TheDataStructuresSurvivalKit | f8657cc0c3fc5056d4c003ba7ebcce2e1a7d99a6 | [
"BSD-3-Clause"
] | null | null | null | #include <iostream>
using namespace std;
class Node{
public:
int data;
Node* next;
};
/********************************************/
void Display(Node* n){
if(n == NULL){
cout<<"queue is empty"<<endl;
return;
}
while(n != NULL){
cout<< n->data <<" ";
n = n->next;
}
cout<<endl;
}
/********************************************/
int Enqueue(Node**headref, int new_data){
Node* new_node = new Node();
Node* last = *headref;
new_node->data = new_data;
new_node->next = NULL;
if(*headref == NULL){
*headref = new_node;
return 0;
}
while(last->next != NULL){
last = last->next;
}
last->next = new_node;
return 0;
}
/********************************************/
int Dequeue(Node**headref){
Node* temp = *headref;
if(temp == NULL){
cout<<"Queue is empty"<<endl;
return 0;
}
*headref = temp->next;
delete temp;
return 0;
}
/********************************************/
int main(){
Node*head = NULL;
int choice, val;
cout<<"1->Enqueue"<<endl;
cout<<"2->Dequeue"<<endl;
cout<<"3->Display"<<endl;
cout<<"4->Exit"<<endl;
do{
cout<<"Enter choice"<<endl;
cin>>choice;
switch(choice){
case 1:
cout<<"Enter the value: "<<endl;
cin>>val;
Enqueue(&head, val);
break;
case 2:
Dequeue(&head);
break;
case 3:
Display(head);
break;
case 4:
break;
default:
cout<<"Enter the values between 1 and 4"<<endl;
}
}while(choice != 4);
return 0;
}
| 18.325581 | 55 | 0.466371 | PreethiSamanthaBennet |
a3a6ab70e9a8da56a3632890162606f4e69115f9 | 23,346 | cc | C++ | src/working_files.cc | Gei0r/cquery | 6ff8273e8b8624016f9363f444acfee30c4bbf64 | [
"MIT"
] | 1,652 | 2018-01-24T03:19:58.000Z | 2020-07-28T19:04:00.000Z | src/working_files.cc | Gei0r/cquery | 6ff8273e8b8624016f9363f444acfee30c4bbf64 | [
"MIT"
] | 490 | 2018-01-24T00:55:38.000Z | 2020-07-03T19:44:16.000Z | src/working_files.cc | Gei0r/cquery | 6ff8273e8b8624016f9363f444acfee30c4bbf64 | [
"MIT"
] | 154 | 2018-01-31T05:57:33.000Z | 2020-07-05T00:02:46.000Z | #include "working_files.h"
#include "lex_utils.h"
#include "position.h"
#include <doctest/doctest.h>
#include <loguru.hpp>
#include <algorithm>
#include <climits>
#include <numeric>
namespace {
// When finding a best match of buffer line and index line, limit the max edit
// distance.
constexpr int kMaxDiff = 20;
// Don't align index line to buffer line if one of the lengths is larger than
// |kMaxColumnAlignSize|.
constexpr int kMaxColumnAlignSize = 200;
lsPosition GetPositionForOffset(const std::string& content, int offset) {
if (offset >= content.size())
offset = (int)content.size() - 1;
lsPosition result;
int i = 0;
while (i < offset) {
if (content[i] == '\n') {
result.line += 1;
result.character = 0;
} else {
result.character += 1;
}
++i;
}
return result;
}
// Computes the edit distance of strings [a,a+la) and [b,b+lb) with Eugene W.
// Myers' O(ND) diff algorithm.
// Costs: insertion=1, deletion=1, no substitution.
// If the distance is larger than threshold, returns threshould + 1.
int MyersDiff(const char* a, int la, const char* b, int lb, int threshold) {
assert(threshold <= kMaxDiff);
static int v_static[2 * kMaxColumnAlignSize + 2];
const char *ea = a + la, *eb = b + lb;
// Strip prefix
for (; a < ea && b < eb && *a == *b; a++, b++) {
}
// Strip suffix
for (; a < ea && b < eb && ea[-1] == eb[-1]; ea--, eb--) {
}
la = int(ea - a);
lb = int(eb - b);
// If the sum of lengths exceeds what we can handle, return a lower bound.
if (la + lb > 2 * kMaxColumnAlignSize)
return std::min(abs(la - lb), threshold + 1);
int* v = v_static + lb;
v[1] = 0;
for (int di = 0; di <= threshold; di++) {
int low = -di + 2 * std::max(0, di - lb),
high = di - 2 * std::max(0, di - la);
for (int i = low; i <= high; i += 2) {
int x = i == -di || (i != di && v[i - 1] < v[i + 1]) ? v[i + 1]
: v[i - 1] + 1,
y = x - i;
while (x < la && y < lb && a[x] == b[y])
x++, y++;
v[i] = x;
if (x == la && y == lb)
return di;
}
}
return threshold + 1;
}
int MyersDiff(const std::string& a, const std::string& b, int threshold) {
return MyersDiff(a.data(), a.size(), b.data(), b.size(), threshold);
}
// Computes edit distance with O(N*M) Needleman-Wunsch algorithm
// and returns a distance vector where d[i] = cost of aligning a to b[0,i).
//
// Myers' diff algorithm is used to find best matching line while this one is
// used to align a single column because Myers' needs some twiddling to return
// distance vector.
std::vector<int> EditDistanceVector(std::string a, std::string b) {
std::vector<int> d(b.size() + 1);
std::iota(d.begin(), d.end(), 0);
for (int i = 0; i < (int)a.size(); i++) {
int ul = d[0];
d[0] = i + 1;
for (int j = 0; j < (int)b.size(); j++) {
int t = d[j + 1];
d[j + 1] = a[i] == b[j] ? ul : std::min(d[j], d[j + 1]) + 1;
ul = t;
}
}
return d;
}
// Find matching position of |a[column]| in |b|.
// This is actually a single step of Hirschberg's sequence alignment algorithm.
int AlignColumn(const std::string& a, int column, std::string b, bool is_end) {
int head = 0, tail = 0;
while (head < (int)a.size() && head < (int)b.size() && a[head] == b[head])
head++;
while (tail < (int)a.size() && tail < (int)b.size() &&
a[a.size() - 1 - tail] == b[b.size() - 1 - tail])
tail++;
if (column < head)
return column;
if ((int)a.size() - tail < column)
return column + b.size() - a.size();
if (std::max(a.size(), b.size()) - head - tail >= kMaxColumnAlignSize)
return std::min(column, (int)b.size());
// b[head, b.size() - tail)
b = b.substr(head, b.size() - tail - head);
// left[i] = cost of aligning a[head, column) to b[head, head + i)
std::vector<int> left = EditDistanceVector(a.substr(head, column - head), b);
// right[i] = cost of aligning a[column, a.size() - tail) to b[head + i,
// b.size() - tail)
std::string a_rev = a.substr(column, a.size() - tail - column);
std::reverse(a_rev.begin(), a_rev.end());
std::reverse(b.begin(), b.end());
std::vector<int> right = EditDistanceVector(a_rev, b);
std::reverse(right.begin(), right.end());
int best = 0, best_cost = INT_MAX;
for (size_t i = 0; i < left.size(); i++) {
int cost = left[i] + right[i];
if (is_end ? cost < best_cost : cost <= best_cost) {
best_cost = cost;
best = i;
}
}
return head + best;
}
// Find matching buffer line of index_lines[line].
// By symmetry, this can also be used to find matching index line of a buffer
// line.
optional<int> FindMatchingLine(const std::vector<std::string>& index_lines,
const std::vector<int>& index_to_buffer,
int line,
int* column,
const std::vector<std::string>& buffer_lines,
bool is_end) {
// If this is a confident mapping, returns.
if (index_to_buffer[line] >= 0) {
int ret = index_to_buffer[line];
if (column)
*column =
AlignColumn(index_lines[line], *column, buffer_lines[ret], is_end);
return ret;
}
// Find the nearest two confident lines above and below.
int up = line, down = line;
while (--up >= 0 && index_to_buffer[up] < 0) {
}
while (++down < int(index_to_buffer.size()) && index_to_buffer[down] < 0) {
}
up = up < 0 ? 0 : index_to_buffer[up];
down = down >= int(index_to_buffer.size()) ? int(buffer_lines.size()) - 1
: index_to_buffer[down];
if (up > down)
return nullopt;
// Search for lines [up,down] and use Myers's diff algorithm to find the best
// match (least edit distance).
int best = up, best_dist = kMaxDiff + 1;
const std::string& needle = index_lines[line];
for (int i = up; i <= down; i++) {
int dist = MyersDiff(needle, buffer_lines[i], kMaxDiff);
if (dist < best_dist) {
best_dist = dist;
best = i;
}
}
if (column)
*column =
AlignColumn(index_lines[line], *column, buffer_lines[best], is_end);
return best;
}
} // namespace
std::vector<CXUnsavedFile> WorkingFiles::Snapshot::AsUnsavedFiles() const {
std::vector<CXUnsavedFile> result;
result.reserve(files.size());
for (auto& file : files) {
CXUnsavedFile unsaved;
unsaved.Filename = file.filename.c_str();
unsaved.Contents = file.content.c_str();
unsaved.Length = (unsigned long)file.content.size();
result.push_back(unsaved);
}
return result;
}
WorkingFile::WorkingFile(const AbsolutePath& filename,
const std::string& buffer_content)
: filename(filename), buffer_content(buffer_content) {
OnBufferContentUpdated();
// SetIndexContent gets called when the file is opened.
}
void WorkingFile::SetIndexContent(const std::string& index_content) {
index_lines = ToLines(index_content, false /*trim_whitespace*/);
index_to_buffer.clear();
buffer_to_index.clear();
}
void WorkingFile::OnBufferContentUpdated() {
buffer_lines = ToLines(buffer_content, false /*trim_whitespace*/);
index_to_buffer.clear();
buffer_to_index.clear();
}
// Variant of Paul Heckel's diff algorithm to compute |index_to_buffer| and
// |buffer_to_index|.
// The core idea is that if a line is unique in both index and buffer,
// we are confident that the line appeared in index maps to the one appeared in
// buffer. And then using them as start points to extend upwards and downwards
// to align other identical lines (but not unique).
void WorkingFile::ComputeLineMapping() {
std::unordered_map<uint64_t, int> hash_to_unique;
std::vector<uint64_t> index_hashes(index_lines.size());
std::vector<uint64_t> buffer_hashes(buffer_lines.size());
index_to_buffer.resize(index_lines.size());
buffer_to_index.resize(buffer_lines.size());
hash_to_unique.reserve(
std::max(index_to_buffer.size(), buffer_to_index.size()));
// For index line i, set index_to_buffer[i] to -1 if line i is duplicated.
int i = 0;
for (auto& line : index_lines) {
std::string trimmed = Trim(line);
uint64_t h = HashUsr(trimmed);
auto it = hash_to_unique.find(h);
if (it == hash_to_unique.end()) {
hash_to_unique[h] = i;
index_to_buffer[i] = i;
} else {
if (it->second >= 0)
index_to_buffer[it->second] = -1;
index_to_buffer[i] = it->second = -1;
}
index_hashes[i++] = h;
}
// For buffer line i, set buffer_to_index[i] to -1 if line i is duplicated.
i = 0;
hash_to_unique.clear();
for (auto& line : buffer_lines) {
std::string trimmed = Trim(line);
uint64_t h = HashUsr(trimmed);
auto it = hash_to_unique.find(h);
if (it == hash_to_unique.end()) {
hash_to_unique[h] = i;
buffer_to_index[i] = i;
} else {
if (it->second >= 0)
buffer_to_index[it->second] = -1;
buffer_to_index[i] = it->second = -1;
}
buffer_hashes[i++] = h;
}
// If index line i is the identical to buffer line j, and they are both
// unique, align them by pointing from_index[i] to j.
i = 0;
for (auto h : index_hashes) {
if (index_to_buffer[i] >= 0) {
auto it = hash_to_unique.find(h);
if (it != hash_to_unique.end() && it->second >= 0 &&
buffer_to_index[it->second] >= 0)
index_to_buffer[i] = it->second;
else
index_to_buffer[i] = -1;
}
i++;
}
// Starting at unique lines, extend upwards and downwards.
for (i = 0; i < (int)index_hashes.size() - 1; i++) {
int j = index_to_buffer[i];
if (0 <= j && j + 1 < buffer_hashes.size() &&
index_hashes[i + 1] == buffer_hashes[j + 1])
index_to_buffer[i + 1] = j + 1;
}
for (i = (int)index_hashes.size(); --i > 0;) {
int j = index_to_buffer[i];
if (0 < j && index_hashes[i - 1] == buffer_hashes[j - 1])
index_to_buffer[i - 1] = j - 1;
}
// |buffer_to_index| is a inverse mapping of |index_to_buffer|.
std::fill(buffer_to_index.begin(), buffer_to_index.end(), -1);
for (i = 0; i < (int)index_hashes.size(); i++)
if (index_to_buffer[i] >= 0)
buffer_to_index[index_to_buffer[i]] = i;
}
optional<int> WorkingFile::GetBufferPosFromIndexPos(int line,
int* column,
bool is_end) {
// The implementation is simple but works pretty well for most cases. We
// lookup the line contents in the indexed file contents, and try to find the
// most similar line in the current buffer file.
//
// Previously, this was implemented by tracking edits and by running myers
// diff algorithm. They were complex implementations that did not work as
// well.
// Note: |index_line| and |buffer_line| are 1-based.
// TODO: reenable this assert once we are using the real indexed file.
// assert(index_line >= 1 && index_line <= index_lines.size());
if (line < 0 || line >= (int)index_lines.size()) {
loguru::Text stack = loguru::stacktrace();
LOG_S(WARNING) << "Bad index_line (got " << line << ", expected [0, "
<< index_lines.size() << ")) in " << filename
<< stack.c_str();
return nullopt;
}
if (index_to_buffer.empty())
ComputeLineMapping();
return FindMatchingLine(index_lines, index_to_buffer, line, column,
buffer_lines, is_end);
}
optional<int> WorkingFile::GetIndexPosFromBufferPos(int line,
int* column,
bool is_end) {
// See GetBufferLineFromIndexLine for additional comments.
if (line < 0 || line >= (int)buffer_lines.size())
return nullopt;
if (buffer_to_index.empty())
ComputeLineMapping();
return FindMatchingLine(buffer_lines, buffer_to_index, line, column,
index_lines, is_end);
}
std::string WorkingFile::FindClosestCallNameInBuffer(
lsPosition position,
int* active_parameter,
lsPosition* completion_position) const {
*active_parameter = 0;
int offset = GetOffsetForPosition(position, buffer_content);
// If vscode auto-inserts closing ')' we will begin on ')' token in foo()
// which will make the below algorithm think it's a nested call.
if (offset > 0 && buffer_content[offset] == ')')
--offset;
// Scan back out of call context.
int balance = 0;
while (offset > 0) {
char c = buffer_content[offset];
if (c == ')')
++balance;
else if (c == '(')
--balance;
if (balance == 0 && c == ',')
*active_parameter += 1;
--offset;
if (balance == -1)
break;
}
if (offset < 0)
return "";
// Scan back entire identifier.
int start_offset = offset;
while (offset > 0) {
char c = buffer_content[offset - 1];
if (isalnum(c) == false && c != '_')
break;
--offset;
}
if (completion_position)
*completion_position = GetPositionForOffset(buffer_content, offset);
return buffer_content.substr(offset, start_offset - offset + 1);
}
lsPosition WorkingFile::FindStableCompletionSource(
lsPosition position,
bool* is_global_completion,
std::string* existing_completion,
lsPosition* replace_end_position) const {
*is_global_completion = true;
int start_offset = GetOffsetForPosition(position, buffer_content);
int offset = start_offset;
while (offset > 0) {
char c = buffer_content[offset - 1];
if (!isalnum(c) && c != '_') {
// Global completion is everything except for dot (.), arrow (->), and
// double colon (::)
if (c == '.')
*is_global_completion = false;
if (offset > 2) {
char pc = buffer_content[offset - 2];
if (pc == ':' && c == ':')
*is_global_completion = false;
else if (pc == '-' && c == '>')
*is_global_completion = false;
}
break;
}
--offset;
}
*replace_end_position = position;
int end_offset = start_offset;
while (end_offset < buffer_content.size()) {
char c = buffer_content[end_offset];
if (!isalnum(c) && c != '_')
break;
++end_offset;
// We know that replace_end_position and position are on the same line.
++replace_end_position->character;
}
*existing_completion = buffer_content.substr(offset, start_offset - offset);
return GetPositionForOffset(buffer_content, offset);
}
WorkingFile* WorkingFiles::GetFileByFilename(const AbsolutePath& filename) {
std::lock_guard<std::mutex> lock(files_mutex);
return GetFileByFilenameNoLock(filename);
}
WorkingFile* WorkingFiles::GetFileByFilenameNoLock(
const AbsolutePath& filename) {
for (auto& file : files) {
if (file->filename == filename)
return file.get();
}
return nullptr;
}
void WorkingFiles::DoAction(const std::function<void()>& action) {
std::lock_guard<std::mutex> lock(files_mutex);
action();
}
void WorkingFiles::DoActionOnFile(
const AbsolutePath& filename,
const std::function<void(WorkingFile* file)>& action) {
std::lock_guard<std::mutex> lock(files_mutex);
WorkingFile* file = GetFileByFilenameNoLock(filename);
action(file);
}
WorkingFile* WorkingFiles::OnOpen(const lsTextDocumentItem& open) {
std::lock_guard<std::mutex> lock(files_mutex);
AbsolutePath filename = open.uri.GetAbsolutePath();
std::string content = open.text;
// The file may already be open.
if (WorkingFile* file = GetFileByFilenameNoLock(filename)) {
file->version = open.version;
file->buffer_content = content;
file->OnBufferContentUpdated();
return file;
}
files.push_back(std::make_unique<WorkingFile>(filename, content));
return files[files.size() - 1].get();
}
void WorkingFiles::OnChange(const lsTextDocumentDidChangeParams& change) {
std::lock_guard<std::mutex> lock(files_mutex);
AbsolutePath filename = change.textDocument.uri.GetAbsolutePath();
WorkingFile* file = GetFileByFilenameNoLock(filename);
if (!file) {
LOG_S(WARNING) << "Could not change " << filename
<< " because it was not open";
return;
}
if (change.textDocument.version)
file->version = *change.textDocument.version;
for (const lsTextDocumentContentChangeEvent& diff : change.contentChanges) {
// Per the spec replace everything if the rangeLength and range are not set.
// See https://github.com/Microsoft/language-server-protocol/issues/9.
if (!diff.range) {
file->buffer_content = diff.text;
file->OnBufferContentUpdated();
} else {
int start_offset =
GetOffsetForPosition(diff.range->start, file->buffer_content);
// Ignore TextDocumentContentChangeEvent.rangeLength which causes trouble
// when UTF-16 surrogate pairs are used.
int end_offset =
GetOffsetForPosition(diff.range->end, file->buffer_content);
file->buffer_content.replace(file->buffer_content.begin() + start_offset,
file->buffer_content.begin() + end_offset,
diff.text);
file->OnBufferContentUpdated();
}
}
}
void WorkingFiles::OnClose(const lsTextDocumentIdentifier& close) {
std::lock_guard<std::mutex> lock(files_mutex);
AbsolutePath filename = close.uri.GetAbsolutePath();
for (int i = 0; i < files.size(); ++i) {
if (files[i]->filename == filename) {
files.erase(files.begin() + i);
return;
}
}
LOG_S(WARNING) << "Could not close " << filename
<< " because it was not open";
}
WorkingFiles::Snapshot WorkingFiles::AsSnapshot(
const std::vector<std::string>& filter_paths) {
std::lock_guard<std::mutex> lock(files_mutex);
Snapshot result;
result.files.reserve(files.size());
for (const auto& file : files) {
if (filter_paths.empty() ||
FindAnyPartial(file->filename.path, filter_paths))
result.files.push_back({file->filename.path, file->buffer_content});
}
return result;
}
lsPosition CharPos(const WorkingFile& file,
char character,
int character_offset = 0) {
return CharPos(file.buffer_content, character, character_offset);
}
TEST_SUITE("WorkingFile") {
TEST_CASE("simple call") {
WorkingFile f(AbsolutePath::BuildDoNotUse("foo.cc"), "abcd(1, 2");
int active_param = 0;
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, '('), &active_param) ==
"abcd");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, '1'), &active_param) ==
"abcd");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, ','), &active_param) ==
"abcd");
REQUIRE(active_param == 1);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, ' '), &active_param) ==
"abcd");
REQUIRE(active_param == 1);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, '2'), &active_param) ==
"abcd");
REQUIRE(active_param == 1);
}
TEST_CASE("nested call") {
WorkingFile f(AbsolutePath::BuildDoNotUse("foo.cc"), "abcd(efg(), 2");
int active_param = 0;
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, '('), &active_param) ==
"abcd");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, 'e'), &active_param) ==
"abcd");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, 'f'), &active_param) ==
"abcd");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, 'g'), &active_param) ==
"abcd");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, 'g', 1), &active_param) ==
"efg");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, 'g', 2), &active_param) ==
"efg");
REQUIRE(active_param == 0);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, ','), &active_param) ==
"abcd");
REQUIRE(active_param == 1);
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, ' '), &active_param) ==
"abcd");
REQUIRE(active_param == 1);
}
TEST_CASE("auto-insert )") {
WorkingFile f(AbsolutePath::BuildDoNotUse("foo.cc"), "abc()");
int active_param = 0;
REQUIRE(f.FindClosestCallNameInBuffer(CharPos(f, ')'), &active_param) ==
"abc");
REQUIRE(active_param == 0);
}
TEST_CASE("existing completion") {
WorkingFile f(AbsolutePath::BuildDoNotUse("foo.cc"), "zzz.asdf ");
bool is_global_completion;
std::string existing_completion;
lsPosition end_pos;
f.FindStableCompletionSource(CharPos(f, '.'), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "zzz");
REQUIRE(end_pos.line == CharPos(f, '.').line);
REQUIRE(end_pos.character == CharPos(f, '.').character);
f.FindStableCompletionSource(CharPos(f, 'a', 1), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "a");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
f.FindStableCompletionSource(CharPos(f, 's', 1), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "as");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
f.FindStableCompletionSource(CharPos(f, 'd', 1), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "asd");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
f.FindStableCompletionSource(CharPos(f, 'f', 1), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "asdf");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
}
TEST_CASE("existing completion underscore") {
WorkingFile f(AbsolutePath::BuildDoNotUse("foo.cc"), "ABC_DEF ");
bool is_global_completion;
std::string existing_completion;
lsPosition end_pos;
f.FindStableCompletionSource(CharPos(f, 'C'), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "AB");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
f.FindStableCompletionSource(CharPos(f, '_'), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "ABC");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
f.FindStableCompletionSource(CharPos(f, 'D'), &is_global_completion,
&existing_completion, &end_pos);
REQUIRE(existing_completion == "ABC_");
REQUIRE(end_pos.line == CharPos(f, ' ').line);
REQUIRE(end_pos.character == CharPos(f, ' ').character);
}
}
| 34.231672 | 80 | 0.619678 | Gei0r |
a3abe0825d43446a485e0a85e7a0284493db7f98 | 10,043 | hpp | C++ | src/cpu/jit_avx512_core_conv_winograd_kernel_f32.hpp | rongjiecomputer/mkl-dnn | 64e03a1939e0d526aa8e9f2e3f7dc0ad8d372944 | [
"Apache-2.0"
] | 3 | 2019-07-08T09:03:03.000Z | 2020-09-09T10:34:17.000Z | src/cpu/jit_avx512_core_conv_winograd_kernel_f32.hpp | rongjiecomputer/mkl-dnn | 64e03a1939e0d526aa8e9f2e3f7dc0ad8d372944 | [
"Apache-2.0"
] | 3 | 2020-11-13T18:59:18.000Z | 2022-02-10T02:14:53.000Z | src/cpu/jit_avx512_core_conv_winograd_kernel_f32.hpp | rongjiecomputer/mkl-dnn | 64e03a1939e0d526aa8e9f2e3f7dc0ad8d372944 | [
"Apache-2.0"
] | 1 | 2018-12-05T07:38:25.000Z | 2018-12-05T07:38:25.000Z | /*******************************************************************************
* Copyright 2017-2018 Intel Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*******************************************************************************/
#ifndef JIT_AVX512_CORE_CONV_WINOGRAD_KERNEL_F32_HPP
#define JIT_AVX512_CORE_CONV_WINOGRAD_KERNEL_F32_HPP
#include "c_types_map.hpp"
#include "cpu_memory.hpp"
#include "jit_generator.hpp"
#include "jit_primitive_conf.hpp"
#include "jit_avx512_common_conv_winograd_kernel_f32.hpp"
namespace mkldnn {
namespace impl {
namespace cpu {
struct _jit_avx512_core_conv_winograd_data_kernel_f32 : public jit_generator {
_jit_avx512_core_conv_winograd_data_kernel_f32(
jit_conv_winograd_conf_t ajcp)
: jcp(ajcp)
{
{
this->weights_transform_data_ker_generate();
weights_transform_data_ker
= (decltype(weights_transform_data_ker)) this->getCode();
}
{
align();
const Xbyak::uint8 *addr = getCurr();
this->input_transform_data_ker_generate();
input_transform_data_ker = (decltype(input_transform_data_ker))addr;
}
{
align();
const Xbyak::uint8 *addr = getCurr();
this->output_transform_data_ker_generate();
output_transform_data_ker
= (decltype(output_transform_data_ker))addr;
}
{
align();
const Xbyak::uint8 *addr = getCurr();
this->gemm_loop_generate();
gemm_loop_ker = (decltype(gemm_loop_ker))addr;
}
}
DECLARE_CPU_JIT_AUX_FUNCTIONS(_jit_avx512_core_conv_winograd_data_kernel_f32)
static status_t init_conf_common(jit_conv_winograd_conf_t &jcp,
const convolution_desc_t &cd, const memory_desc_wrapper &src_d,
const memory_desc_wrapper &weights_d,
const memory_desc_wrapper &dst_d);
static status_t init_conf_kernel(
jit_conv_winograd_conf_t &jcp, int dimM, int dimN, int dimK);
jit_conv_winograd_conf_t jcp;
void (*gemm_loop_ker)(float *, const float *, const float *, const int);
void (*input_transform_data_ker)(jit_wino_transform_call_s *);
void (*output_transform_data_ker)(jit_wino_transform_call_s *);
void (*weights_transform_data_ker)(jit_wino_transform_call_s *);
protected:
using reg64_t = const Xbyak::Reg64;
using reg32_t = const Xbyak::Reg32;
enum { typesize = sizeof(float) };
void gemm_loop_generate();
void input_transform_data_ker_generate();
void output_transform_data_ker_generate();
void weights_transform_data_ker_generate();
/* registers used for GEMM */
reg64_t reg_dstC = abi_param1;
reg64_t reg_srcA = abi_param2;
reg64_t reg_srcB = abi_param3;
reg64_t reg_is_beta_zero = abi_param4;
reg64_t reg_dimM_block_loop_cnt = r10;
reg64_t reg_dimK_block_loop_cnt = r11;
/* registers used for transforms*/
reg64_t param = abi_param1;
/* registers used for output_transform_data_ker */
reg64_t oreg_temp = rcx;
reg64_t oreg_Ow = r9;
reg64_t oreg_src = r11;
reg64_t oreg_tile_block = r12;
reg64_t oreg_tile_block_ur = r13;
reg64_t oreg_nb_tile_block_ur = r14;
reg64_t oreg_O = r8;
reg64_t oreg_T = r10;
reg64_t oreg_dst = r11;
reg64_t oreg_ydim = r14;
reg64_t oreg_xdim = r15;
reg64_t oreg_out_j = r12;
reg64_t oreg_bias = rbx;
reg64_t imm_addr64 = rax;
/* registers used for input_transform_data_ker */
reg64_t ireg_temp = rcx;
reg64_t ireg_jtiles = rax;
reg64_t ireg_itiles = rbx;
reg64_t ireg_I = r8;
reg64_t ireg_src = r13;
reg64_t ireg_ydim = r14;
reg64_t ireg_xdim = r15;
reg64_t ireg_inp_j = r12;
reg64_t ireg_inp_i = rdx;
reg64_t ireg_mask_j = r11;
reg64_t ireg_mask = rsi;
reg32_t ireg_mask_32 = esi;
reg64_t ireg_zero = r9;
reg64_t ireg_Iw = r9;
reg64_t ireg_T = r10;
reg64_t ireg_tile_block = r12;
reg64_t ireg_tile_block_ur = r13;
reg64_t ireg_nb_tile_block_ur = r14;
reg64_t ireg_output = r15;
/* registers used for wei transform */
reg64_t wreg_temp = rcx;
reg64_t wreg_F = r8;
reg64_t wreg_src = r9;
reg64_t wreg_MT = r15;
reg64_t wreg_M = r14;
reg64_t wreg_dst = r10;
reg64_t wreg_dst_aux = r9;
reg64_t wreg_dst_idx = r8;
reg64_t wreg_Fw = r11;
reg64_t wreg_T = r12;
reg64_t wreg_cnt_j = rdx;
reg64_t wreg_F_aux = r14;
reg64_t wreg_Fw_aux = r15;
};
struct jit_avx512_core_conv_winograd_fwd_kernel_f32
: _jit_avx512_core_conv_winograd_data_kernel_f32 {
using _jit_avx512_core_conv_winograd_data_kernel_f32::
_jit_avx512_core_conv_winograd_data_kernel_f32;
static bool post_ops_ok(jit_conv_conf_t &jcp, const primitive_attr_t &attr);
static status_t init_conf(jit_conv_winograd_conf_t &jcp,
const convolution_desc_t &cd, const memory_desc_wrapper &src_d,
const memory_desc_wrapper &weights_d,
const memory_desc_wrapper &dst_d, const primitive_attr_t &attr,
bool with_relu = false, float relu_negative_slope = 0.);
};
struct jit_avx512_core_conv_winograd_bwd_data_kernel_f32
: public _jit_avx512_core_conv_winograd_data_kernel_f32 {
using _jit_avx512_core_conv_winograd_data_kernel_f32::
_jit_avx512_core_conv_winograd_data_kernel_f32;
static status_t init_conf(jit_conv_winograd_conf_t &jcp,
const convolution_desc_t &cd, const memory_desc_wrapper &diff_src_d,
const memory_desc_wrapper &weights_d,
const memory_desc_wrapper &diff_dst_d);
};
struct jit_avx512_core_conv_winograd_bwd_weights_kernel_f32
: public jit_generator {
DECLARE_CPU_JIT_AUX_FUNCTIONS(
_jit_avx512_core_conv_winograd_bwd_weights_kernel_f32)
jit_avx512_core_conv_winograd_bwd_weights_kernel_f32(
jit_conv_winograd_conf_t ajcp)
: jcp(ajcp)
{
//******************* First iter kernel ********************//
this->gemm_loop_generate(true);
gemm_loop_ker_first_iter = (decltype(gemm_loop_ker_first_iter))this->getCode();
align();
const Xbyak::uint8 *addr = getCurr();
this->src_transform_generate();
src_transform = (decltype(src_transform))addr;
if (jcp.with_bias) {
align();
addr = getCurr();
this->diff_dst_transform_generate(true);
diff_dst_transform_wbias = (decltype(diff_dst_transform_wbias))addr;
}
align();
addr = getCurr();
this->diff_dst_transform_generate(false);
diff_dst_transform = (decltype(diff_dst_transform))addr;
if (jcp.sched_policy != WSCHED_WEI_SDGtWo && jcp.tile_block > 1) {
align();
addr = getCurr();
this->gemm_loop_generate(false);
gemm_loop_ker = (decltype(gemm_loop_ker))addr;
}
align();
addr = getCurr();
this->diff_weights_transform_generate(true);
diff_weights_transform = (decltype(diff_weights_transform))addr;
if (jcp.sched_policy == WSCHED_WEI_SDGtWo) {
align();
addr = getCurr();
this->diff_weights_transform_generate(false);
diff_weights_transform_accum =
(decltype(diff_weights_transform_accum))addr;
};
}
static status_t init_conf(jit_conv_winograd_conf_t &jcp,
const convolution_desc_t &cd, const memory_desc_wrapper &src_d,
const memory_desc_wrapper &diff_dst_d,
const memory_desc_wrapper &diff_weights_d);
jit_conv_winograd_conf_t jcp;
void (*gemm_loop_ker)(float *, const float *, const float *);
void (*gemm_loop_ker_first_iter)(float *, const float *, const float *);
void (*src_transform)(jit_wino_transform_call_s *);
void (*diff_dst_transform)(jit_wino_transform_call_s *);
void (*diff_dst_transform_wbias)(jit_wino_transform_call_s *);
void (*diff_weights_transform)(jit_wino_transform_call_s *);
void (*diff_weights_transform_accum)(jit_wino_transform_call_s *);
private:
using reg64_t = const Xbyak::Reg64;
using reg32_t = const Xbyak::Reg32;
enum { typesize = sizeof(float) };
void src_transform_generate();
void diff_dst_transform_generate(bool with_bias);
void diff_weights_transform_generate(bool first_tile);
/*registers common to transforms*/
reg64_t reg_transp = abi_param1;
reg64_t reg_ti = rbx;
reg64_t reg_tj = rcx;
reg64_t reg_src = r8;
reg64_t reg_dst = r9;
reg64_t reg_G = rsi; /*TODO: check if this is ok*/
reg64_t reg_temp = rsi;
/*registers common to src/diff_dst transform*/
reg64_t reg_I = r10;
reg64_t reg_ydim = r11;
reg64_t reg_xdim = r12;
reg64_t reg_src_offset = r13;
reg64_t reg_zero = r14;
reg64_t reg_tile_count = r15;
reg64_t reg_maski = rsi;
reg32_t reg_maski_32 = esi;
reg64_t reg_maskj = rdx;
reg64_t reg_T = rax;
reg64_t reg_oc_ur = rax;
reg64_t reg_ic_simd = r14;
reg64_t reg_bias = r10;
void gemm_loop_generate(bool is_first_tile);
reg64_t reg_dstC = abi_param1;
reg64_t reg_srcA = abi_param2;
reg64_t reg_srcB = abi_param3;
reg64_t reg_dimM_block_loop_cnt = r9;
reg64_t reg_dimN_block_loop_cnt = r10;
reg64_t reg_nb_dimN_bcast_ur = r11;
reg64_t reg_dimK_block_loop_cnt = r12;
};
}
}
}
#endif
| 34.159864 | 87 | 0.676192 | rongjiecomputer |
a3b4ee89424f67d63a8ea1d352e58a4eae87bf38 | 1,787 | cxx | C++ | Modules/Adapters/OSSIMAdapters/src/otbEllipsoidAdapter.cxx | heralex/OTB | c52b504b64dc89c8fe9cac8af39b8067ca2c3a57 | [
"Apache-2.0"
] | null | null | null | Modules/Adapters/OSSIMAdapters/src/otbEllipsoidAdapter.cxx | heralex/OTB | c52b504b64dc89c8fe9cac8af39b8067ca2c3a57 | [
"Apache-2.0"
] | null | null | null | Modules/Adapters/OSSIMAdapters/src/otbEllipsoidAdapter.cxx | heralex/OTB | c52b504b64dc89c8fe9cac8af39b8067ca2c3a57 | [
"Apache-2.0"
] | 1 | 2020-10-15T09:37:30.000Z | 2020-10-15T09:37:30.000Z | /*
* Copyright (C) 2005-2020 Centre National d'Etudes Spatiales (CNES)
*
* This file is part of Orfeo Toolbox
*
* https://www.orfeo-toolbox.org/
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "otbEllipsoidAdapter.h"
#if defined(__GNUC__) || defined(__clang__)
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#pragma GCC diagnostic ignored "-Woverloaded-virtual"
#pragma GCC diagnostic ignored "-Wshadow"
#include "ossim/base/ossimEllipsoid.h"
#pragma GCC diagnostic pop
#else
#include "ossim/base/ossimEllipsoid.h"
#endif
namespace otb
{
EllipsoidAdapter::EllipsoidAdapter()
{
m_Ellipsoid = new ossimEllipsoid();
}
EllipsoidAdapter::~EllipsoidAdapter()
{
if (m_Ellipsoid != nullptr)
{
delete m_Ellipsoid;
}
}
void EllipsoidAdapter::XYZToLonLatHeight(double x, double y, double z, double& lon, double& lat, double& h) const
{
// Note the lat/lon convension for ossim vs lon/lat for OTB
m_Ellipsoid->XYZToLatLonHeight(x, y, z, lat, lon, h);
}
void EllipsoidAdapter::LonLatHeightToXYZ(double lon, double lat, double h, double& x, double& y, double& z) const
{
// Note the lat/lon convension for ossim vs lon/lat for OTB
m_Ellipsoid->latLonHeightToXYZ(lat, lon, h, x, y, z);
}
} // namespace otb
| 27.492308 | 113 | 0.732513 | heralex |
a3b557d5f26cb826ff27092ec11059bda06abc1b | 3,568 | hpp | C++ | OracleSolaris_OpenJDK_Builder/patches-14/patch-src_hotspot_os__cpu_solaris__x86_atomic__solaris__x86.hpp | gco/oraclesolaris-contrib | f9905a8758a50a44720f5500e19b5f2528c6b6c8 | [
"UPL-1.0"
] | null | null | null | OracleSolaris_OpenJDK_Builder/patches-14/patch-src_hotspot_os__cpu_solaris__x86_atomic__solaris__x86.hpp | gco/oraclesolaris-contrib | f9905a8758a50a44720f5500e19b5f2528c6b6c8 | [
"UPL-1.0"
] | null | null | null | OracleSolaris_OpenJDK_Builder/patches-14/patch-src_hotspot_os__cpu_solaris__x86_atomic__solaris__x86.hpp | gco/oraclesolaris-contrib | f9905a8758a50a44720f5500e19b5f2528c6b6c8 | [
"UPL-1.0"
] | null | null | null | $NetBSD$
Support SunOS/gcc.
--- src/hotspot/os_cpu/solaris_x86/atomic_solaris_x86.hpp.orig 2019-01-08 09:40:30.000000000 +0000
+++ src/hotspot/os_cpu/solaris_x86/atomic_solaris_x86.hpp
@@ -27,11 +27,65 @@
// For Sun Studio - implementation is in solaris_x86_64.il.
+#ifdef __GNUC__
+inline int32_t _Atomic_add(int32_t add_value, volatile int32_t* dest) {
+ int32_t rv = add_value;
+ __asm__ volatile ("lock xaddl %0,(%2)"
+ : "=r" (rv)
+ : "0" (rv), "r" (dest)
+ : "cc", "memory");
+ return rv + add_value;
+}
+inline int64_t _Atomic_add_long(int64_t add_value, volatile int64_t* dest) {
+ int64_t rv = add_value;
+ __asm__ volatile ("lock xaddq %0,(%2)"
+ : "=r" (rv)
+ : "0" (rv), "r" (dest)
+ : "cc", "memory");
+ return rv + add_value;
+}
+inline int32_t _Atomic_xchg(int32_t exchange_value, volatile int32_t* dest) {
+ __asm__ __volatile__ ("xchgl (%2),%0"
+ : "=r" (exchange_value)
+ : "0" (exchange_value), "r" (dest)
+ : "memory");
+ return exchange_value;
+}
+inline int64_t _Atomic_xchg_long(int64_t exchange_value, volatile int64_t* dest) {
+ __asm__ __volatile__ ("xchgq (%2),%0"
+ : "=r" (exchange_value)
+ : "0" (exchange_value), "r" (dest)
+ : "memory");
+ return exchange_value;
+}
+inline int8_t _Atomic_cmpxchg_byte(int8_t exchange_value, volatile int8_t* dest, int8_t compare_value) {
+ __asm__ volatile ("lock cmpxchgb %1,(%3)"
+ : "=a" (exchange_value)
+ : "q" (exchange_value), "a" (compare_value), "r" (dest)
+ : "cc", "memory");
+ return exchange_value;
+}
+inline int32_t _Atomic_cmpxchg(int32_t exchange_value, volatile int32_t* dest, int32_t compare_value) {
+ __asm__ volatile ("lock cmpxchgl %1,(%3)"
+ : "=a" (exchange_value)
+ : "q" (exchange_value), "a" (compare_value), "r" (dest)
+ : "cc", "memory");
+ return exchange_value;
+}
+inline int64_t _Atomic_cmpxchg_long(int64_t exchange_value, volatile int64_t* dest, int64_t compare_value) {
+ __asm__ volatile ("lock cmpxchgq %1,(%3)"
+ : "=a" (exchange_value)
+ : "q" (exchange_value), "a" (compare_value), "r" (dest)
+ : "cc", "memory");
+ return exchange_value;
+}
+#else
extern "C" {
int32_t _Atomic_add(int32_t add_value, volatile int32_t* dest);
int64_t _Atomic_add_long(int64_t add_value, volatile int64_t* dest);
int32_t _Atomic_xchg(int32_t exchange_value, volatile int32_t* dest);
+ int64_t _Atomic_xchg_long(int64_t exchange_value, volatile int64_t* dest);
int8_t _Atomic_cmpxchg_byte(int8_t exchange_value, volatile int8_t* dest,
int8_t compare_value);
int32_t _Atomic_cmpxchg(int32_t exchange_value, volatile int32_t* dest,
@@ -39,6 +93,7 @@ extern "C" {
int64_t _Atomic_cmpxchg_long(int64_t exchange_value, volatile int64_t* dest,
int64_t compare_value);
}
+#endif
template<size_t byte_size>
struct Atomic::PlatformAdd
@@ -83,8 +138,6 @@ inline T Atomic::PlatformXchg<4>::operat
reinterpret_cast<int32_t volatile*>(dest)));
}
-extern "C" int64_t _Atomic_xchg_long(int64_t exchange_value, volatile int64_t* dest);
-
template<>
template<typename T>
inline T Atomic::PlatformXchg<8>::operator()(T exchange_value,
| 39.644444 | 109 | 0.60398 | gco |
a3b5885bf7f23b09f22f8cf9dfdc4f6a953e885f | 8,034 | cpp | C++ | INDIGO/Engine/Entity.cpp | TsuuN/TsuuN | db26336ad1f9ce95b2c37b118aaac8fb3077193f | [
"MIT"
] | 2 | 2018-04-30T15:52:05.000Z | 2018-06-13T17:41:55.000Z | INDIGO/Engine/Entity.cpp | TsuuN/TsuuN | db26336ad1f9ce95b2c37b118aaac8fb3077193f | [
"MIT"
] | 3 | 2018-06-03T18:57:42.000Z | 2018-07-11T22:01:17.000Z | INDIGO/Engine/Entity.cpp | TsuuN/TsuuN | db26336ad1f9ce95b2c37b118aaac8fb3077193f | [
"MIT"
] | 2 | 2018-03-31T06:34:01.000Z | 2019-08-02T14:04:17.000Z | #include "Entity.h"
namespace Engine
{
//[junk_enable /]
char* CBaseEntity::GetPlayerName()
{
if (IsPlayer())
{
static PlayerInfo Info;
if (Interfaces::Engine()->GetPlayerInfo(EntIndex(), &Info))
return Info.m_szPlayerName;
}
return "";
}
bool CBaseEntity::IsPlayer()
{
typedef bool(__thiscall* IsPlayerFn)(void*);
return GetMethod<IsPlayerFn>(this, 152)(this);
}
bool CBaseEntity::IsValid()
{
return (!IsDead() && GetHealth() > 0 && !IsDormant());
}
bool CBaseEntity::IsDead()
{
BYTE LifeState = *(PBYTE)((DWORD)this + Offset::Entity::m_lifeState);
return (LifeState != LIFE_ALIVE);
}
Vector CBaseEntity::GetOrigin() {
return *(Vector*)((DWORD)this + Offset::Entity::m_vecOrigin);
}
bool CBaseEntity::IsVisible(CBaseEntity* pLocalEntity)
{
if (!pLocalEntity->IsValid())
return false;
Vector vSrcOrigin = pLocalEntity->GetEyePosition();
if (vSrcOrigin.IsZero() || !vSrcOrigin.IsValid())
return false;
BYTE bHitBoxCheckVisible[6] = {
HITBOX_HEAD,
HITBOX_BODY,
HITBOX_RIGHT_FOOT,
HITBOX_LEFT_FOOT,
HITBOX_RIGHT_HAND,
HITBOX_LEFT_HAND,
};
CTraceFilter filter;
filter.pSkip = pLocalEntity;
for (int nHit = 0; nHit < 6; nHit++)
{
Vector vHitBox = GetHitboxPosition(bHitBoxCheckVisible[nHit]);
if (vHitBox.IsZero() || !vHitBox.IsValid())
continue;
trace_t tr;
Ray_t ray;
ray.Init(vSrcOrigin, vHitBox);
Interfaces::EngineTrace()->TraceRay(ray, PlayerVisibleMask, &filter, &tr);
if (tr.m_pEnt == (IClientEntity*)this && !tr.allsolid)
return true;
}
return false;
}
bool CBaseEntity::HasHelmet()
{
return *(bool*)((DWORD)this + Offset::Entity::m_bHasHelmet);
}
bool CBaseEntity::HasDefuser()
{
return *(bool*)((DWORD)this + Offset::Entity::m_bHasDefuser);
}
bool* CBaseEntity::IsSpotted()
{
return (bool*)((DWORD)this + Offset::Entity::m_bSpotted);
}
int CBaseEntity::GetFovStart()
{
return *(PINT)((DWORD)this + Offset::Entity::m_iFOVStart);
}
int CBaseEntity::GetFlags()
{
return *(PINT)((DWORD)this + Offset::Entity::m_fFlags);
}
int CBaseEntity::GetHealth()
{
return *(PINT)((DWORD)this + Offset::Entity::m_iHealth);
}
int CBaseEntity::GetArmor()
{
return *(PINT)((DWORD)this + Offset::Entity::m_ArmorValue);
}
int CBaseEntity::GetTeam()
{
return *(PINT)((DWORD)this + Offset::Entity::m_iTeamNum);
}
float CBaseEntity::GetLowerBodyYaw()
{
return *(float*)((DWORD)this + Offset::Entity::m_flLowerBodyYawTarget);
}
float CBaseEntity::GetSimTime()
{
return *(float*)((DWORD)this + Offset::Entity::m_flSimulationTime);
}
int CBaseEntity::GetShotsFired()
{
return *(PINT)((DWORD)this + (DWORD)Offset::Entity::m_iShotsFired);
}
int CBaseEntity::GetIsScoped()
{
return *(bool*)((DWORD)this + (DWORD)Offset::Entity::m_bIsScoped);
}
int CBaseEntity::GetTickBase()
{
return *(PINT)((DWORD)this + (DWORD)Offset::Entity::m_nTickBase);
}
ObserverMode_t CBaseEntity::GetObserverMode()
{
return *(ObserverMode_t*)((DWORD)this + (DWORD)Offset::Entity::m_iObserverMode);
}
PVOID CBaseEntity::GetObserverTarget()
{
return (PVOID)*(PDWORD)((DWORD)this + (DWORD)Offset::Entity::m_hObserverTarget);
}
PVOID CBaseEntity::GetActiveWeapon()
{
return (PVOID)((DWORD)this + (DWORD)Offset::Entity::m_hActiveWeapon);
}
CBaseWeapon* CBaseEntity::GetBaseWeapon()
{
return (CBaseWeapon*)Interfaces::EntityList()->GetClientEntityFromHandle((PVOID)*(PDWORD)GetActiveWeapon());
}
UINT* CBaseEntity::GetWeapons()
{
// DT_BasePlayer -> m_hMyWeapons
return (UINT*)((DWORD)this + Offset::Entity::m_hMyWeapons);
}
UINT* CBaseEntity::GetWearables()
{
return (UINT*)((DWORD)this + Offset::Entity::m_hMyWearables);
}
CBaseViewModel* CBaseEntity::GetViewModel()
{
// DT_BasePlayer -> m_hViewModel
return (CBaseViewModel*)Interfaces::EntityList()->GetClientEntityFromHandle((PVOID)*(PDWORD)((DWORD)this + Offset::Entity::m_hViewModel));
}
Vector* CBaseEntity::GetVAngles()
{
return (Vector*)((uintptr_t)this + Offset::Entity::deadflag + 0x4);
}
Vector CBaseEntity::GetAimPunchAngle()
{
return *(Vector*)((DWORD)this + Offset::Entity::m_aimPunchAngle);
}
Vector CBaseEntity::GetViewPunchAngle()
{
return *(Vector*)((DWORD)this + Offset::Entity::m_viewPunchAngle);
}
Vector CBaseEntity::GetVelocity()
{
return *(Vector*)((DWORD)this + Offset::Entity::m_vecVelocity);
}
Vector CBaseEntity::GetViewOffset()
{
return *(Vector*)((DWORD)this + Offset::Entity::m_vecViewOffset);
}
Vector CBaseEntity::GetEyePosition()
{
return GetRenderOrigin() + GetViewOffset();
}
QAngle CBaseEntity::GetEyeAngles()
{
return *reinterpret_cast<QAngle*>((DWORD)this + Offset::Entity::m_angEyeAngles);
}
Vector CBaseEntity::GetBonePosition(int nBone)
{
Vector vRet;
matrix3x4_t MatrixArray[MAXSTUDIOBONES];
if (!SetupBones(MatrixArray, MAXSTUDIOBONES, BONE_USED_BY_HITBOX, Interfaces::GlobalVars()->curtime))
return vRet;
matrix3x4_t HitboxMatrix = MatrixArray[nBone];
vRet = Vector(HitboxMatrix[0][3], HitboxMatrix[1][3], HitboxMatrix[2][3]);
return vRet;
}
studiohdr_t* CBaseEntity::GetStudioModel()
{
const model_t* model = nullptr;
model = GetModel();
if (!model)
return nullptr;
studiohdr_t* pStudioModel = Interfaces::ModelInfo()->GetStudioModel(model);
if (!pStudioModel)
return nullptr;
return pStudioModel;
}
mstudiobone_t* CBaseEntity::GetBone(int nBone)
{
mstudiobone_t* pBoneBox = nullptr;
studiohdr_t* pStudioModel = GetStudioModel();
if (!pStudioModel)
return pBoneBox;
mstudiobone_t* pBone = pStudioModel->pBone(nBone);
if (!pBone)
return nullptr;
return pBone;
}
mstudiobbox_t* CBaseEntity::GetHitBox(int nHitbox)
{
if (nHitbox < 0 || nHitbox >= HITBOX_MAX)
return nullptr;
mstudiohitboxset_t* pHitboxSet = nullptr;
mstudiobbox_t* pHitboxBox = nullptr;
pHitboxSet = GetHitBoxSet();
if (!pHitboxSet)
return pHitboxBox;
pHitboxBox = pHitboxSet->pHitbox(nHitbox);
if (!pHitboxBox)
return nullptr;
return pHitboxBox;
}
mstudiohitboxset_t* CBaseEntity::GetHitBoxSet()
{
studiohdr_t* pStudioModel = nullptr;
mstudiohitboxset_t* pHitboxSet = nullptr;
pStudioModel = GetStudioModel();
if (!pStudioModel)
return pHitboxSet;
pHitboxSet = pStudioModel->pHitboxSet(0);
if (!pHitboxSet)
return nullptr;
return pHitboxSet;
}
Vector CBaseEntity::GetHitboxPosition(int nHitbox)
{
matrix3x4_t MatrixArray[MAXSTUDIOBONES];
Vector vRet, vMin, vMax;
vRet = Vector(0, 0, 0);
mstudiobbox_t* pHitboxBox = GetHitBox(nHitbox);
if (!pHitboxBox || !IsValid())
return vRet;
if (!SetupBones(MatrixArray, MAXSTUDIOBONES, BONE_USED_BY_HITBOX, 0/*Interfaces::GlobalVars()->curtime*/))
return vRet;
if (!pHitboxBox->m_Bone || !pHitboxBox->m_vBbmin.IsValid() || !pHitboxBox->m_vBbmax.IsValid())
return vRet;
VectorTransform(pHitboxBox->m_vBbmin, MatrixArray[pHitboxBox->m_Bone], vMin);
VectorTransform(pHitboxBox->m_vBbmax, MatrixArray[pHitboxBox->m_Bone], vMax);
vRet = (vMin + vMax) * 0.5f;
return vRet;
}
int CBaseViewModel::GetModelIndex()
{
// DT_BaseViewModel -> m_nModelIndex
return *(int*)((DWORD)this + Offset::Entity::m_nModelIndex);
}
void CBaseViewModel::SetModelIndex(int nModelIndex)
{
VirtualFn(void)(PVOID, int);
GetMethod< OriginalFn >(this, 75)(this, nModelIndex);
// DT_BaseViewModel -> m_nModelIndex
//*(int*)( ( DWORD )this + Offset::Entity::m_nModelIndex ) = nModelIndex;
}
void CBaseViewModel::SetWeaponModel(const char* Filename, IClientEntity* Weapon)
{
typedef void(__thiscall* SetWeaponModelFn)(void*, const char*, IClientEntity*);
return GetMethod<SetWeaponModelFn>(this, 242)(this, Filename, Weapon);
}
DWORD CBaseViewModel::GetOwner()
{
// DT_BaseViewModel -> m_hOwner
return *(PDWORD)((DWORD)this + Offset::Entity::m_hOwner);
}
DWORD CBaseViewModel::GetWeapon()
{
// DT_BaseViewModel -> m_hWeapon
return *(PDWORD)((DWORD)this + Offset::Entity::m_hWeapon);
}
} | 21.95082 | 140 | 0.698033 | TsuuN |
a3bb595b681a1020f6b32280e0c04a9a43c30f6d | 1,408 | cpp | C++ | source/projects/filter.chebyshev2/filter.chebyshev2.cpp | Cycling74/filter | f19f9427f4200132827aadf7c70001e983cc6949 | [
"MIT"
] | 5 | 2020-09-30T08:55:48.000Z | 2021-04-03T07:52:56.000Z | source/projects/filter.chebyshev2/filter.chebyshev2.cpp | Cycling74/filter | f19f9427f4200132827aadf7c70001e983cc6949 | [
"MIT"
] | 3 | 2021-03-30T20:25:09.000Z | 2022-01-21T19:06:04.000Z | source/projects/filter.chebyshev2/filter.chebyshev2.cpp | Cycling74/filter | f19f9427f4200132827aadf7c70001e983cc6949 | [
"MIT"
] | 1 | 2021-09-16T21:38:24.000Z | 2021-09-16T21:38:24.000Z | /// @file
/// @copyright Copyright (c) 2017, Cycling '74
/// @author Timothy Place
/// @license Usage of this file and its contents is governed by the MIT License
#include "DspFilters/ChebyshevII.h"
using namespace Dsp::ChebyshevII::Design;
#include "../filter.h"
class chebyshev : public filter<chebyshev,false,true> {
public:
MIN_DESCRIPTION { "Nth-order Chebyshev Type-II filter"
"This object is intended mainly for plotting. "
"For audio filtering, see <o>filter.chebyshev2~</o>. " };
MIN_TAGS { "filters" };
MIN_AUTHOR { "Cycling '74" };
MIN_RELATED { "filterdesign, filterdetail, slide, filter.chebyshev2~" };
inlet<> m_inlet { this, "(number) input" };
outlet<> m_outlet { this, "(number) output" };
chebyshev(const atoms& args = {})
: filter(args)
{}
attribute<double> m_samplerate { this, "samplerate", 44100.0,
description { "Sampling frequency of the filter." },
};
double samplerate() override {
return m_samplerate;
}
message<> number { this, "number", "Stream of numbers to be filtered.",
MIN_FUNCTION {
double x[1] { args[0] };
double* y = x;
// we use the pending filter because this object is threadsafe using a copy
if (m_update_pending) {
m_filter = std::move(m_filter_pending);
m_update_pending = false;
}
m_filter->process(1, &y);
m_outlet.send(*y);
return {};
}
};
};
MIN_EXTERNAL(chebyshev);
| 23.466667 | 79 | 0.666903 | Cycling74 |
a3bc8ac05a9886d30a06e6a796a664bbf19398c0 | 586 | cpp | C++ | Userland/Libraries/LibJS/Runtime/Map.cpp | shubhdev/serenity | 9321d9d83d366ad4cf686c856063ff9ac97c18a4 | [
"BSD-2-Clause"
] | 4 | 2021-02-23T05:35:25.000Z | 2021-06-08T06:11:06.000Z | Userland/Libraries/LibJS/Runtime/Map.cpp | shubhdev/serenity | 9321d9d83d366ad4cf686c856063ff9ac97c18a4 | [
"BSD-2-Clause"
] | 4 | 2021-04-27T20:44:44.000Z | 2021-06-30T18:07:10.000Z | Userland/Libraries/LibJS/Runtime/Map.cpp | shubhdev/serenity | 9321d9d83d366ad4cf686c856063ff9ac97c18a4 | [
"BSD-2-Clause"
] | 1 | 2021-06-05T16:58:05.000Z | 2021-06-05T16:58:05.000Z | /*
* Copyright (c) 2021, Idan Horowitz <[email protected]>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <LibJS/Runtime/Map.h>
namespace JS {
Map* Map::create(GlobalObject& global_object)
{
return global_object.heap().allocate<Map>(global_object, *global_object.map_prototype());
}
Map::Map(Object& prototype)
: Object(prototype)
{
}
Map::~Map()
{
}
void Map::visit_edges(Cell::Visitor& visitor)
{
Object::visit_edges(visitor);
for (auto& value : m_entries) {
visitor.visit(value.key);
visitor.visit(value.value);
}
}
}
| 16.742857 | 93 | 0.667235 | shubhdev |
a3bf8722431af381ab7ceae9f5a2e5f51f01aaa8 | 1,947 | cc | C++ | visualization/src/viz-data-collector.cc | AdronTech/maplab | 1340e01466fc1c02994860723b8117daf9ad226d | [
"Apache-2.0"
] | 1,936 | 2017-11-27T23:11:37.000Z | 2022-03-30T14:24:14.000Z | visualization/src/viz-data-collector.cc | AdronTech/maplab | 1340e01466fc1c02994860723b8117daf9ad226d | [
"Apache-2.0"
] | 353 | 2017-11-29T18:40:39.000Z | 2022-03-30T15:53:46.000Z | visualization/src/viz-data-collector.cc | AdronTech/maplab | 1340e01466fc1c02994860723b8117daf9ad226d | [
"Apache-2.0"
] | 661 | 2017-11-28T07:20:08.000Z | 2022-03-28T08:06:29.000Z | #include "visualization/viz-data-collector.h"
#include <mutex>
#include <string>
#include <tuple>
#include <unordered_map>
#include <Eigen/Core>
#include <aslam/common/unique-id.h>
#include <maplab-common/accessors.h>
#include <maplab-common/macros.h>
namespace visualization {
namespace internal {
const VizDataCollectorImpl::SlotId VizDataCollectorImpl::kCommonSlotId =
VizDataCollectorImpl::SlotId::Random();
VizDataCollectorImpl::VizChannelGroup* VizDataCollectorImpl::getSlot(
const SlotId& slot_id) {
CHECK(slot_id.isValid());
std::lock_guard<std::mutex> lock(m_channel_groups_);
return common::getValuePtr(channel_groups_, slot_id);
}
const VizDataCollectorImpl::VizChannelGroup* VizDataCollectorImpl::getSlot(
const SlotId& slot_id) const {
CHECK(slot_id.isValid());
std::lock_guard<std::mutex> lock(m_channel_groups_);
return common::getValuePtr(channel_groups_, slot_id);
}
VizDataCollectorImpl::VizChannelGroup*
VizDataCollectorImpl::getSlotAndCreateIfNecessary(const SlotId& slot_id) {
CHECK(slot_id.isValid());
std::lock_guard<std::mutex> lock(m_channel_groups_);
SlotIdSlotMap::iterator iterator;
bool inserted = false;
std::tie(iterator, inserted) = channel_groups_.emplace(
std::piecewise_construct, std::make_tuple(slot_id), std::make_tuple());
return &iterator->second;
}
void VizDataCollectorImpl::removeSlotIfAvailable(const SlotId& slot_id) {
CHECK(slot_id.isValid());
std::lock_guard<std::mutex> lock(m_channel_groups_);
channel_groups_.erase(slot_id);
}
bool VizDataCollectorImpl::hasSlot(const SlotId& slot_id) const {
return (getSlot(slot_id) != nullptr);
}
bool VizDataCollectorImpl::hasChannel(
const SlotId& slot_id, const std::string& channel_name) const {
const VizChannelGroup* slot;
if ((slot = getSlot(slot_id)) == nullptr) {
return false;
}
return slot->hasChannel(channel_name);
}
} // namespace internal
} // namespace visualization
| 30.421875 | 77 | 0.761685 | AdronTech |
a3c0e0d4cd6ce5cf2e7792ebe09050e1a7d68791 | 13,465 | cpp | C++ | rede/powerNet.cpp | BigsonLvrocha/NeuralPowerFlow | 3d64078b5d1053cd521318229b69592acab6582a | [
"MIT"
] | null | null | null | rede/powerNet.cpp | BigsonLvrocha/NeuralPowerFlow | 3d64078b5d1053cd521318229b69592acab6582a | [
"MIT"
] | null | null | null | rede/powerNet.cpp | BigsonLvrocha/NeuralPowerFlow | 3d64078b5d1053cd521318229b69592acab6582a | [
"MIT"
] | null | null | null | /**
* @brief implementation of a power network used in calculations
*
* @file powerNet.cpp
* @author Luiz Victor Linhares Rocha
* @date 2018-09-22
* @copyright 2018
*/
#include <utility>
#include <iostream>
#include "powerNet.hpp"
#include "barra.hpp"
#include "branch.hpp"
#include "admitanceCalc.hpp"
#include "../util/complexutils.h"
namespace neuralFlux {
PowerNet::PowerNet(uint64_t id):
Identifiable(id),
m_nPQ(0),
m_nPV(0),
m_nSlack(0) {
}
PowerNet::~PowerNet() {
m_branches.clear(); // branches must be deleted first
m_busBars.clear();
}
PowerNet::PowerNet(const PowerNet& net):
Identifiable(net.getId()),
m_nPQ(0),
m_nPV(0),
m_nSlack(0) {
for (size_t i = 0, n = net.getNBars() ; i < n ; i++) {
const BarPtr bar = net.getBarByIndex(i);
if (bar->getType() == Bar::Slack) {
this->addSlackBar(bar->getId(), bar->getV(), bar->getTeta(), bar->getP(), bar->getQ(), bar->getBsh());
} else if (bar->getType() == Bar::PV) {
this->addPVBar(bar->getId(), bar->getV(), bar->getTeta(), bar->getP(), bar->getQ(), bar->getBsh());
} else {
this->addPQBar(bar->getId(), bar->getV(), bar->getTeta(), bar->getP(), bar->getQ(), bar->getBsh());
}
}
for (size_t i = 0, n = net.getNBranches(); i < n; i++) {
const BranchPtr branch = net.getBranchByIndex(i);
this->connect(
branch->getK()->getId(),
branch->getM()->getId(),
branch->getRkm(),
branch->getXkm(),
branch->getBshkm(),
branch->getA(),
branch->getPhi());
}
}
PowerNet& PowerNet::operator=(const PowerNet& net) {
for (size_t i = 0, n = net.getNBars(); i < n; i++) {
const BarPtr bar = net.getBarByIndex(i);
if (bar->getType() == Bar::Slack) {
this->addSlackBar(bar->getId(), bar->getV(), bar->getTeta(), bar->getP(), bar->getQ(), bar->getBsh());
} else if (bar->getType() == Bar::PV) {
this->addPVBar(bar->getId(), bar->getV(), bar->getTeta(), bar->getP(), bar->getQ(), bar->getBsh());
} else {
this->addPQBar(bar->getId(), bar->getV(), bar->getTeta(), bar->getP(), bar->getQ(), bar->getBsh());
}
}
for (size_t i = 0, n = net.getNBranches(); i < n; i++) {
const BranchPtr branch = net.getBranchByIndex(i);
this->connect(
branch->getK()->getId(),
branch->getM()->getId(),
branch->getRkm(),
branch->getXkm(),
branch->getBshkm(),
branch->getA(),
branch->getPhi());
}
return *this;
}
void PowerNet::addSlackBar(
const size_t id,
const double v,
const double teta,
const double p,
const double q,
const double bsh
) {
if (checkBarIdExists(id)) {
throw std::runtime_error("cannot create same id bar in the net");
}
m_busBars.push_back(Bar::newSlack(v, teta, id, p, q, bsh));
++m_nSlack;
sortBackBar();
}
void PowerNet::addPQBar(
const size_t id,
const double p,
const double q,
const double v,
const double teta,
const double bsh
) {
if (checkBarIdExists(id)) {
throw std::runtime_error("cannot create same id bar in the net");
}
m_busBars.push_back(Bar::newPQ(p, q, id, v, teta, bsh));
++m_nPQ;
sortBackBar();
}
void PowerNet::addBar(
const Bar::barType type,
const size_t id,
const double v,
const double teta,
const double p,
const double q,
const double bsh
) {
switch (type) {
case Bar::Slack:
addSlackBar(id, v, teta, p, q, bsh);
break;
case Bar::PV:
addPVBar(id, p, v, teta, q, bsh);
break;
case Bar::PQ:
addPQBar(id, p, q, v, teta, bsh);
break;
default:
throw std::runtime_error("unsuported bar type");
}
}
void PowerNet::addPVBar(
const size_t id,
const double p,
const double v,
const double teta,
const double q,
const double bsh
) {
if (checkBarIdExists(id)) {
throw std::runtime_error("cannot create same id bar in the net");
}
m_busBars.push_back(Bar::newPV(p, v, id, teta, q, bsh));
++m_nPV;
sortBackBar();
}
void PowerNet::connect(
size_t k,
size_t m,
const double rkm,
const double xkm,
const double bshkm,
const double a,
const double phi
) {
connectByIndex(
getBarIndex(k),
getBarIndex(m),
rkm,
xkm,
bshkm,
a,
phi);
}
void PowerNet::connectByIndex(
size_t k,
size_t m,
const double rkm,
const double xkm,
const double bshkm,
const double a,
const double phi
) {
if (k == m) {
throw std::invalid_argument("cannot connect same bars");
}
if (k > m) {
std::swap<size_t>(k, m);
}
try { // TODO(lvrocha): do this more eficiently
getBranchIndexByIndex(k, m);
throw std::invalid_argument("cannot connect same bars twice");
} catch(std::runtime_error e) {
m_branches.push_back(Branch::connectBranch(m_busBars[k], m_busBars[m], rkm, xkm, bshkm, a, phi));
sortBackBranch();
}
}
void PowerNet::deleteBranch(uint64_t id) {
deleteBranchByIndex(getBranchIndex(id));
}
void PowerNet::deleteBranchByIndex(size_t i) {
if (m_branches.size() <= i) {
throw std::runtime_error("branch does not exist");
}
for (size_t _i = i+1, n = m_branches.size() ; _i < n ; _i++) {
m_branches[_i-1] = m_branches[_i];
}
m_branches.pop_back();
}
void PowerNet::deleteBranch(uint64_t kId, uint64_t mId) {
deleteBranchByIndex(getBranchIndex(kId, mId));
}
void PowerNet::deleteBranchByBarIndex(size_t kI, size_t mI) {
deleteBranchByIndex(getBranchIndexByIndex(kI, mI));
}
void PowerNet::deleteBar(size_t id) {
deleteBarByIndex(getBarIndex(id));
}
void PowerNet::deleteBarByIndex(size_t i) {
if (m_busBars.size() <= i) {
throw std::runtime_error("Bar does not exists");
}
if (m_busBars[i]->getNConnections() != 0) {
throw std::runtime_error("cannot delete bar with live connections");
}
// does the deletion, done this way because busBars do not change much over time so optimization is not important
discontBarCount(m_busBars[i]->getType());
for (size_t _i = i+1, n=m_busBars.size() ; _i < n ; _i++) {
m_busBars[_i-1] = m_busBars[_i];
}
m_busBars.pop_back();
}
void PowerNet::cleanBranches() {
m_branches.clear();
}
void PowerNet::clean() {
m_branches.clear();
m_busBars.clear();
m_nPQ = 0;
m_nPV = 0;
m_nSlack = 0;
}
void PowerNet::setFlatStart() {
for (size_t i = 0, n = m_busBars.size(); i < n; i++) {
if (m_busBars[i]->getType() == Bar::Slack) {
m_busBars[i]->setP(0);
m_busBars[i]->setQ(0);
} else if (m_busBars[i]->getType() == Bar::PV) {
m_busBars[i]->setTeta(0);
m_busBars[i]->setQ(0);
} else {
m_busBars[i]->setV(1);
m_busBars[i]->setTeta(0);
}
}
}
size_t PowerNet::getNBars() const {
return m_busBars.size();
}
size_t PowerNet::getNBranches() const {
return m_branches.size();
}
size_t PowerNet::getNSlack() const {
return m_nSlack;
}
size_t PowerNet::getNPQ() const {
return m_nPQ;
}
size_t PowerNet::getNPV() const {
return m_nPV;
}
size_t PowerNet::getBarIndex(const BarPtr bar) const {
for (size_t i = 0, n = m_busBars.size(); i < n; i++) {
if (m_busBars[i] == bar) {
return i;
}
}
throw std::runtime_error("Bar could not be found");
}
size_t PowerNet::getBarIndex(const size_t id) const {
for (size_t i = 0, n = m_busBars.size(); i < n; i++) {
if (m_busBars[i]->getId() == id) {
return i;
}
}
throw std::runtime_error("Bar could not be found");
}
size_t PowerNet::getBranchIndex(const BranchPtr branch) const {
for (size_t i = 0, n = m_branches.size(); i < n; i++) {
if (m_branches[i] == branch) {
return i;
}
}
throw std::runtime_error("Branch could not be found");
}
size_t PowerNet::getBranchIndex(uint64_t id) const {
for (size_t i = 0, n = m_branches.size(); i < n ; i++) {
uint64_t id1 = m_branches[i]->getId();
if (id1 == id) {
return i;
} else if (id1 > id) {
throw std::runtime_error("could not find branch");
}
}
throw std::runtime_error("could not find branch");
}
size_t PowerNet::getBranchIndex(size_t kId, size_t mId) const {
return getBranchIndex(Branch::calculateId(kId, mId));
}
size_t PowerNet::getBranchIndexByIndex(size_t kId, size_t mId) const {
if (m_busBars.size() <= kId || m_busBars.size() <= mId) {
throw std::runtime_error("bar does not exists");
}
return getBranchIndex(m_busBars[kId]->getId(), m_busBars[mId]->getId());
}
const BarPtr PowerNet::getBar(uint64_t i) const {
return m_busBars[getBarIndex(i)];
}
const BarPtr PowerNet::getBarByIndex(size_t i) const {
if (m_busBars.size() <= i) {
throw std::runtime_error("bar does not exists");
}
return m_busBars[i];
}
const BranchPtr PowerNet::getBranch(uint64_t i) const {
return m_branches[getBranchIndex(i)];
}
const BranchPtr PowerNet::getBranchByIndex(size_t i) const {
if (m_branches.size() <= i) {
throw std::runtime_error("branch does not exists");
}
return m_branches[i];
}
const BranchPtr PowerNet::getBranch(uint64_t kId, uint64_t mId) const {
return m_branches[getBranchIndex(kId, mId)];
}
const BranchPtr PowerNet::getBranchByIndex(uint64_t kId, uint64_t mId) const {
return m_branches[getBranchIndexByIndex(kId, mId)];
}
void PowerNet::updateY() {
const size_t nBars = getNBars();
m_Y.setZero(nBars, nBars);
for (size_t i = 0; i < nBars; i++) {
BarPtr bar = getBarByIndex(i);
m_Y(i, i) = AdmitanceCalc::getAdmitanceKk(bar);
for (size_t j = i+1 ; j < nBars ; j++) {
try {
BranchPtr branch = getBranchByIndex(i, j);
if (branch->getK() == bar) {
m_Y(i, j) = AdmitanceCalc::getAdmitanceKm(branch);
m_Y(j, i) = AdmitanceCalc::getAdmitanceMk(branch);
} else {
m_Y(i, j) = AdmitanceCalc::getAdmitanceMk(branch);
m_Y(j, i) = AdmitanceCalc::getAdmitanceKm(branch);
}
} catch(std::exception e) {
}
}
}
}
const complexo PowerNet::getY(size_t i, size_t j) {
if (checkChanged()) {
updateY();
}
return m_Y(i, j);
}
void PowerNet::completeNetPowers() {
for (int i = 0, n = m_nSlack; i < n; i++) {
m_busBars[i]->setS(getSk(i));
}
for (int i = m_nSlack, n = m_nSlack + m_nPV; i < n; i++) {
m_busBars[i]->setQ(getSk(i).imag());
}
}
bool PowerNet::areConnected(uint64_t i, uint64_t j) {
try {
size_t id = getBranchIndex(i, j);
return m_branches[id]->isBranchOn();
} catch(std::exception e) {
return false;
}
}
bool PowerNet::areConnectedByIndex(size_t i, size_t j) {
try {
size_t id = getBranchIndexByIndex(i, j);
return m_branches[id]->isBranchOn();
} catch(std::exception e) {
return false;
}
}
void PowerNet::discontBarCount(Bar::barType type) {
if (type == Bar::PQ) {
--m_nPQ;
} else if (type == Bar::PV) {
--m_nPV;
} else {
--m_nSlack;
}
}
void PowerNet::sortBackBranch() {
const uint64_t id = m_branches[m_branches.size()-1]->getId();
for (size_t i = m_branches.size()-1 ; i > 0 ; i--) {
if (m_branches[i-1]->getId() > id) {
std::swap<BranchPtr>(m_branches[i], m_branches[i-1]);
} else {
return;
}
}
}
void PowerNet::sortBackBar() {
const Bar::barType type = m_busBars[m_busBars.size()-1]->getType();
for (size_t i = m_busBars.size()-1; i > 0; i--) {
if (m_busBars[i-1]->getType() > type) {
std::swap<BarPtr>(m_busBars[i], m_busBars[i-1]);
} else {
break;
}
}
}
bool PowerNet::checkChanged() {
bool changed = false;
for (size_t i = 0, m = m_busBars.size(); i < m; i++) {
if (m_busBars[i]->isChanged()) {
changed = true;
m_busBars[i]->clearChanged();
}
}
for (size_t i = 0, m = m_branches.size(); i < m; i++) {
if (m_branches[i]->isChanged()) {
changed = true;
m_branches[i]->clearChanged();
}
}
return changed;
}
complexo PowerNet::getSk(size_t bar) {
complexo sum = 0;
for (size_t i = 0, n = m_busBars.size() ; i < n ; i++) {
sum += m_Y(bar, i)*m_busBars[i]->getE();
}
return complexConjugado(complexConjugado(m_busBars[bar]->getE())*sum);
}
double PowerNet::getTetaKm(uint64_t kId, uint64_t mId) const {
return getTetaKm(getBarIndex(kId), getBarIndex(mId));
}
double PowerNet::getTetaKmByIndex(size_t kI, size_t mI) const {
return m_busBars[kI]->getTeta() - m_busBars[mI]->getTeta();
}
bool PowerNet::checkBarIdExists(uint64_t id) {
for (size_t i = 0, n = m_busBars.size(); i < n; i++) {
if (m_busBars[i]->getId() == id) {
return true;
}
}
return false;
}
} // namespace neuralFlux
| 26.93 | 117 | 0.573932 | BigsonLvrocha |
a3c18d0f493cb5157d677e3983fad6681fbbe935 | 2,287 | cpp | C++ | libnd4j/include/ops/declarable/generic/linalg/matrix_diag.cpp | phong-phuong/deeplearning4j | d21e8839578d328f46f4b5ca38307a78528c34f5 | [
"Apache-2.0"
] | null | null | null | libnd4j/include/ops/declarable/generic/linalg/matrix_diag.cpp | phong-phuong/deeplearning4j | d21e8839578d328f46f4b5ca38307a78528c34f5 | [
"Apache-2.0"
] | null | null | null | libnd4j/include/ops/declarable/generic/linalg/matrix_diag.cpp | phong-phuong/deeplearning4j | d21e8839578d328f46f4b5ca38307a78528c34f5 | [
"Apache-2.0"
] | null | null | null | /* ******************************************************************************
*
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
* See the NOTICE file distributed with this work for additional
* information regarding copyright ownership.
* 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.
*
* SPDX-License-Identifier: Apache-2.0
******************************************************************************/
//
// @author GS <[email protected]> 3/21/2018
// @author Yurii Shyrma ([email protected])
//
#include <ops/declarable/CustomOperations.h>
#include <ops/declarable/helpers/matrixSetDiag.h>
#if NOT_EXCLUDED(OP_matrix_diag)
namespace sd {
namespace ops {
CUSTOM_OP_IMPL(matrix_diag, 1, 1, false, 0, 0) {
auto diagonal = INPUT_VARIABLE(0);
auto output = OUTPUT_VARIABLE(0);
REQUIRE_TRUE(!diagonal->isScalar(), 0, "CUSTOM_OP matrix_diag: input diagonal array must be at list a vector, but scalar was given!");
helpers::matrixSetDiag(block.launchContext(), *output, *diagonal, *output, true);
return Status::OK();
}
DECLARE_SHAPE_FN(matrix_diag) {
Nd4jLong* outShapeInfo = nullptr;
auto in = inputShape->at(0);
int inRank = shape::rank(in);
// if for example diagonal array has shape [A,B,C] then output array has shape [A,B,C,C]
int outRank = inRank + 1;
ALLOCATE(outShapeInfo, block.getWorkspace(), shape::shapeInfoLength(outRank), Nd4jLong);
outShapeInfo[0] = outRank;
for(int i = 0; i < inRank; ++i)
outShapeInfo[i + 1] = shape::sizeAt(in, i);
outShapeInfo[outRank] = shape::sizeAt(in, -1);
ShapeUtils::updateStridesAndType(outShapeInfo, in, shape::order(in));
return SHAPELIST(CONSTANT(outShapeInfo));
}
DECLARE_TYPES(matrix_diag) {
getOpDescriptor()
->setAllowedInputTypes(sd::DataType::ANY)
->setSameMode(true);
}
}
}
#endif
| 30.905405 | 138 | 0.655444 | phong-phuong |
a3c35f4ff7c4c98db1e25d1e5388ea2d29568c6c | 6,656 | cpp | C++ | tap/core/peer.cpp | tsavola/tap | e7b5dea6b0e9c7ebbb2710842ebfb62352cb54cc | [
"BSD-2-Clause"
] | 1 | 2019-12-09T20:55:59.000Z | 2019-12-09T20:55:59.000Z | tap/core/peer.cpp | tsavola/tap | e7b5dea6b0e9c7ebbb2710842ebfb62352cb54cc | [
"BSD-2-Clause"
] | null | null | null | tap/core/peer.cpp | tsavola/tap | e7b5dea6b0e9c7ebbb2710842ebfb62352cb54cc | [
"BSD-2-Clause"
] | null | null | null | #include "core.hpp"
#include <cstdio>
namespace tap {
struct PeerObject::State {
enum {
DIRTY_FLAG = 1 << 0,
REFERENCE_FLAG = 1 << 1,
};
State() noexcept:
key(-1),
flags(0)
{
}
State(Key key, unsigned int flags) noexcept:
key(key),
flags(flags)
{
}
State &operator=(const State &other) noexcept
{
key = other.key;
flags = other.flags;
return *this;
}
void set_flag(unsigned int mask) noexcept
{
flags |= mask;
}
void clear_flag(unsigned int mask) noexcept
{
flags &= ~mask;
}
bool test_flag(unsigned int mask) const noexcept
{
return flags & mask;
}
Key key;
unsigned int flags;
};
PeerObject::PeerObject():
next_object_id(0)
{
instance_peers().insert(this);
}
PeerObject::~PeerObject()
{
instance_peers().erase(this);
for (auto pair: states) {
if (pair.second.test_flag(State::REFERENCE_FLAG))
Py_DECREF(pair.first);
}
}
int PeerObject::insert(PyObject *object, Key key) noexcept
{
return insert(object, key, 0);
}
int PeerObject::insert(PyObject *object, Key key, unsigned int flags) noexcept
{
try {
states[object] = State(key, flags);
} catch (...) {
return -1;
}
try {
objects[key] = object;
} catch (...) {
states.erase(object);
return -1;
}
return 0;
}
Key PeerObject::insert_new(PyObject *object, unsigned int flags) noexcept
{
Key key = next_object_id;
if (insert(object, key, flags) < 0)
return -1;
next_object_id++;
return key;
}
void PeerObject::clear(PyObject *object) noexcept
{
auto i = states.find(object);
if (i != states.end())
i->second.clear_flag(State::DIRTY_FLAG);
}
std::pair<Key, bool> PeerObject::insert_or_clear_for_remote(PyObject *object) noexcept
{
bool object_changed;
Key key;
auto i = states.find(object);
if (i != states.end()) {
object_changed = i->second.test_flag(State::DIRTY_FLAG);
i->second.clear_flag(State::DIRTY_FLAG);
key = i->second.key;
} else {
object_changed = true;
key = insert_new(object, 0);
}
Key remote_key = key_for_remote(key);
return std::make_pair(remote_key, object_changed);
}
Key PeerObject::key_for_remote(PyObject *object) noexcept
{
Key key;
auto i = states.find(object);
if (i != states.end())
key = i->second.key;
else
key = insert_new(object, State::DIRTY_FLAG);
return key_for_remote(key);
}
Key PeerObject::key_for_remote(Key key) noexcept
{
if (key < 0)
return -1;
uint32_t object_id = key;
int32_t remote_id = key >> 32;
remote_id = !remote_id;
return (Key(remote_id) << 32) | object_id;
}
PyObject *PeerObject::object(Key key) noexcept
{
PyObject *object = nullptr;
auto i = objects.find(key);
if (i != objects.end()) {
object = i->second;
if (object->ob_refcnt <= 0) {
fprintf(stderr, "tap peer: %s object %p with invalid reference count %ld during lookup\n", object->ob_type->tp_name, object, object->ob_refcnt);
object = nullptr;
}
}
return object;
}
void PeerObject::touch(PyObject *object) noexcept
{
auto i = states.find(object);
if (i != states.end())
i->second.set_flag(State::DIRTY_FLAG);
}
void PeerObject::set_references(const std::unordered_set<PyObject *> &referenced) noexcept
{
for (PyObject *object: referenced)
states.find(object)->second.set_flag(State::REFERENCE_FLAG);
}
void PeerObject::dereference(Key key) noexcept
{
auto i = objects.find(key);
if (i != objects.end()) {
PyObject *object = i->second;
State &state = states.find(object)->second;
if (state.test_flag(State::REFERENCE_FLAG)) {
state.clear_flag(State::REFERENCE_FLAG);
state.set_flag(State::DIRTY_FLAG);
Py_DECREF(object);
}
}
}
void PeerObject::object_freed(void *ptr) noexcept
{
auto i = states.find(ptr);
if (i != states.end()) {
PyObject *object = reinterpret_cast<PyObject *> (ptr);
fprintf(stderr, "tap peer: %s object %p freed\n", object->ob_type->tp_name, object);
if (object->ob_refcnt != 0)
fprintf(stderr, "tap peer: %s object %p with unexpected reference count %ld when freed\n", object->ob_type->tp_name, object, object->ob_refcnt);
Key key = i->second.key;
objects.erase(key);
states.erase(i);
freed.push_back(key);
}
}
static PyObject *peer_new(PyTypeObject *type, PyObject *args, PyObject *kwargs) noexcept
{
PyObject *peer = type->tp_alloc(type, 0);
if (peer) {
try {
new (peer) PeerObject;
} catch (...) {
type->tp_free(peer);
peer = nullptr;
}
}
return peer;
}
static void peer_dealloc(PyObject *peer) noexcept
{
reinterpret_cast<PeerObject *> (peer)->~PeerObject();
Py_TYPE(peer)->tp_free(peer);
}
int peer_type_init() noexcept
{
return PyType_Ready(&peer_type);
}
PyTypeObject peer_type = {
PyVarObject_HEAD_INIT(nullptr, 0)
"tap.core.Peer", /* tp_name */
sizeof (PeerObject), /* tp_basicsize */
0, /* tp_itemsize */
peer_dealloc, /* tp_dealloc */
0, /* tp_print */
0, /* tp_getattr */
0, /* tp_setattr */
0, /* tp_reserved */
0, /* tp_repr */
0, /* tp_as_number */
0, /* tp_as_sequence */
0, /* tp_as_mapping */
0, /* tp_hash */
0, /* tp_call */
0, /* tp_str */
0, /* tp_getattro */
0, /* tp_setattro */
0, /* tp_as_buffer */
Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /* tp_flags */
nullptr, /* tp_doc */
0, /* tp_traverse */
0, /* tp_clear */
0, /* tp_richcompare */
0, /* tp_weaklistoffset */
0, /* tp_iter */
0, /* tp_iternext */
0, /* tp_methods */
0, /* tp_members */
0, /* tp_getset */
0, /* tp_base */
0, /* tp_dict */
0, /* tp_descr_get */
0, /* tp_descr_set */
0, /* tp_dictoffset */
0, /* tp_init */
0, /* tp_alloc */
peer_new, /* tp_new */
};
void peers_touch(PyObject *object) noexcept
{
for (PeerObject *peer: instance_peers())
peer->touch(object);
}
} // namespace tap
| 22.562712 | 147 | 0.5628 | tsavola |
a3c706f89b16da99b8ea32c03afb32f138468697 | 11,377 | cpp | C++ | Schweizer-Messer/numpy_eigen/src/autogen_module/numpy_eigen_export_module.cpp | huangqinjin/kalibr | 5bc7b73ce8185c734152def716e7d657a2736ec5 | [
"BSD-4-Clause"
] | null | null | null | Schweizer-Messer/numpy_eigen/src/autogen_module/numpy_eigen_export_module.cpp | huangqinjin/kalibr | 5bc7b73ce8185c734152def716e7d657a2736ec5 | [
"BSD-4-Clause"
] | null | null | null | Schweizer-Messer/numpy_eigen/src/autogen_module/numpy_eigen_export_module.cpp | huangqinjin/kalibr | 5bc7b73ce8185c734152def716e7d657a2736ec5 | [
"BSD-4-Clause"
] | null | null | null | // This file automatically generated by create_export_module.py
#include <NumpyEigenConverter.hpp>
#define NUMPY_IMPORT_ARRAY_RETVAL
// function prototypes
void import_1_1_int();
void import_1_1_float();
void import_1_1_double();
void import_1_1_uchar();
void import_1_1_long();
void import_1_2_int();
void import_1_2_float();
void import_1_2_double();
void import_1_2_uchar();
void import_1_2_long();
void import_1_3_int();
void import_1_3_float();
void import_1_3_double();
void import_1_3_uchar();
void import_1_3_long();
void import_1_4_int();
void import_1_4_float();
void import_1_4_double();
void import_1_4_uchar();
void import_1_4_long();
void import_1_5_int();
void import_1_5_float();
void import_1_5_double();
void import_1_5_uchar();
void import_1_5_long();
void import_1_6_int();
void import_1_6_float();
void import_1_6_double();
void import_1_6_uchar();
void import_1_6_long();
void import_1_D_int();
void import_1_D_float();
void import_1_D_double();
void import_1_D_uchar();
void import_1_D_long();
void import_2_1_int();
void import_2_1_float();
void import_2_1_double();
void import_2_1_uchar();
void import_2_1_long();
void import_2_2_int();
void import_2_2_float();
void import_2_2_double();
void import_2_2_uchar();
void import_2_2_long();
void import_2_3_int();
void import_2_3_float();
void import_2_3_double();
void import_2_3_uchar();
void import_2_3_long();
void import_2_4_int();
void import_2_4_float();
void import_2_4_double();
void import_2_4_uchar();
void import_2_4_long();
void import_2_5_int();
void import_2_5_float();
void import_2_5_double();
void import_2_5_uchar();
void import_2_5_long();
void import_2_6_int();
void import_2_6_float();
void import_2_6_double();
void import_2_6_uchar();
void import_2_6_long();
void import_2_D_int();
void import_2_D_float();
void import_2_D_double();
void import_2_D_uchar();
void import_2_D_long();
void import_3_1_int();
void import_3_1_float();
void import_3_1_double();
void import_3_1_uchar();
void import_3_1_long();
void import_3_2_int();
void import_3_2_float();
void import_3_2_double();
void import_3_2_uchar();
void import_3_2_long();
void import_3_3_int();
void import_3_3_float();
void import_3_3_double();
void import_3_3_uchar();
void import_3_3_long();
void import_3_4_int();
void import_3_4_float();
void import_3_4_double();
void import_3_4_uchar();
void import_3_4_long();
void import_3_5_int();
void import_3_5_float();
void import_3_5_double();
void import_3_5_uchar();
void import_3_5_long();
void import_3_6_int();
void import_3_6_float();
void import_3_6_double();
void import_3_6_uchar();
void import_3_6_long();
void import_3_D_int();
void import_3_D_float();
void import_3_D_double();
void import_3_D_uchar();
void import_3_D_long();
void import_4_1_int();
void import_4_1_float();
void import_4_1_double();
void import_4_1_uchar();
void import_4_1_long();
void import_4_2_int();
void import_4_2_float();
void import_4_2_double();
void import_4_2_uchar();
void import_4_2_long();
void import_4_3_int();
void import_4_3_float();
void import_4_3_double();
void import_4_3_uchar();
void import_4_3_long();
void import_4_4_int();
void import_4_4_float();
void import_4_4_double();
void import_4_4_uchar();
void import_4_4_long();
void import_4_5_int();
void import_4_5_float();
void import_4_5_double();
void import_4_5_uchar();
void import_4_5_long();
void import_4_6_int();
void import_4_6_float();
void import_4_6_double();
void import_4_6_uchar();
void import_4_6_long();
void import_4_D_int();
void import_4_D_float();
void import_4_D_double();
void import_4_D_uchar();
void import_4_D_long();
void import_5_1_int();
void import_5_1_float();
void import_5_1_double();
void import_5_1_uchar();
void import_5_1_long();
void import_5_2_int();
void import_5_2_float();
void import_5_2_double();
void import_5_2_uchar();
void import_5_2_long();
void import_5_3_int();
void import_5_3_float();
void import_5_3_double();
void import_5_3_uchar();
void import_5_3_long();
void import_5_4_int();
void import_5_4_float();
void import_5_4_double();
void import_5_4_uchar();
void import_5_4_long();
void import_5_5_int();
void import_5_5_float();
void import_5_5_double();
void import_5_5_uchar();
void import_5_5_long();
void import_5_6_int();
void import_5_6_float();
void import_5_6_double();
void import_5_6_uchar();
void import_5_6_long();
void import_5_D_int();
void import_5_D_float();
void import_5_D_double();
void import_5_D_uchar();
void import_5_D_long();
void import_6_1_int();
void import_6_1_float();
void import_6_1_double();
void import_6_1_uchar();
void import_6_1_long();
void import_6_2_int();
void import_6_2_float();
void import_6_2_double();
void import_6_2_uchar();
void import_6_2_long();
void import_6_3_int();
void import_6_3_float();
void import_6_3_double();
void import_6_3_uchar();
void import_6_3_long();
void import_6_4_int();
void import_6_4_float();
void import_6_4_double();
void import_6_4_uchar();
void import_6_4_long();
void import_6_5_int();
void import_6_5_float();
void import_6_5_double();
void import_6_5_uchar();
void import_6_5_long();
void import_6_6_int();
void import_6_6_float();
void import_6_6_double();
void import_6_6_uchar();
void import_6_6_long();
void import_6_D_int();
void import_6_D_float();
void import_6_D_double();
void import_6_D_uchar();
void import_6_D_long();
void import_D_1_int();
void import_D_1_float();
void import_D_1_double();
void import_D_1_uchar();
void import_D_1_long();
void import_D_2_int();
void import_D_2_float();
void import_D_2_double();
void import_D_2_uchar();
void import_D_2_long();
void import_D_3_int();
void import_D_3_float();
void import_D_3_double();
void import_D_3_uchar();
void import_D_3_long();
void import_D_4_int();
void import_D_4_float();
void import_D_4_double();
void import_D_4_uchar();
void import_D_4_long();
void import_D_5_int();
void import_D_5_float();
void import_D_5_double();
void import_D_5_uchar();
void import_D_5_long();
void import_D_6_int();
void import_D_6_float();
void import_D_6_double();
void import_D_6_uchar();
void import_D_6_long();
void import_D_D_int();
void import_D_D_float();
void import_D_D_double();
void import_D_D_uchar();
void import_D_D_long();
BOOST_PYTHON_MODULE(libnumpy_eigen)
{
using namespace boost::python;
// Without this import, the converter will segfault
import_array();
import_1_1_int();
import_1_1_float();
import_1_1_double();
import_1_1_uchar();
import_1_1_long();
import_1_2_int();
import_1_2_float();
import_1_2_double();
import_1_2_uchar();
import_1_2_long();
import_1_3_int();
import_1_3_float();
import_1_3_double();
import_1_3_uchar();
import_1_3_long();
import_1_4_int();
import_1_4_float();
import_1_4_double();
import_1_4_uchar();
import_1_4_long();
import_1_5_int();
import_1_5_float();
import_1_5_double();
import_1_5_uchar();
import_1_5_long();
import_1_6_int();
import_1_6_float();
import_1_6_double();
import_1_6_uchar();
import_1_6_long();
import_1_D_int();
import_1_D_float();
import_1_D_double();
import_1_D_uchar();
import_1_D_long();
import_2_1_int();
import_2_1_float();
import_2_1_double();
import_2_1_uchar();
import_2_1_long();
import_2_2_int();
import_2_2_float();
import_2_2_double();
import_2_2_uchar();
import_2_2_long();
import_2_3_int();
import_2_3_float();
import_2_3_double();
import_2_3_uchar();
import_2_3_long();
import_2_4_int();
import_2_4_float();
import_2_4_double();
import_2_4_uchar();
import_2_4_long();
import_2_5_int();
import_2_5_float();
import_2_5_double();
import_2_5_uchar();
import_2_5_long();
import_2_6_int();
import_2_6_float();
import_2_6_double();
import_2_6_uchar();
import_2_6_long();
import_2_D_int();
import_2_D_float();
import_2_D_double();
import_2_D_uchar();
import_2_D_long();
import_3_1_int();
import_3_1_float();
import_3_1_double();
import_3_1_uchar();
import_3_1_long();
import_3_2_int();
import_3_2_float();
import_3_2_double();
import_3_2_uchar();
import_3_2_long();
import_3_3_int();
import_3_3_float();
import_3_3_double();
import_3_3_uchar();
import_3_3_long();
import_3_4_int();
import_3_4_float();
import_3_4_double();
import_3_4_uchar();
import_3_4_long();
import_3_5_int();
import_3_5_float();
import_3_5_double();
import_3_5_uchar();
import_3_5_long();
import_3_6_int();
import_3_6_float();
import_3_6_double();
import_3_6_uchar();
import_3_6_long();
import_3_D_int();
import_3_D_float();
import_3_D_double();
import_3_D_uchar();
import_3_D_long();
import_4_1_int();
import_4_1_float();
import_4_1_double();
import_4_1_uchar();
import_4_1_long();
import_4_2_int();
import_4_2_float();
import_4_2_double();
import_4_2_uchar();
import_4_2_long();
import_4_3_int();
import_4_3_float();
import_4_3_double();
import_4_3_uchar();
import_4_3_long();
import_4_4_int();
import_4_4_float();
import_4_4_double();
import_4_4_uchar();
import_4_4_long();
import_4_5_int();
import_4_5_float();
import_4_5_double();
import_4_5_uchar();
import_4_5_long();
import_4_6_int();
import_4_6_float();
import_4_6_double();
import_4_6_uchar();
import_4_6_long();
import_4_D_int();
import_4_D_float();
import_4_D_double();
import_4_D_uchar();
import_4_D_long();
import_5_1_int();
import_5_1_float();
import_5_1_double();
import_5_1_uchar();
import_5_1_long();
import_5_2_int();
import_5_2_float();
import_5_2_double();
import_5_2_uchar();
import_5_2_long();
import_5_3_int();
import_5_3_float();
import_5_3_double();
import_5_3_uchar();
import_5_3_long();
import_5_4_int();
import_5_4_float();
import_5_4_double();
import_5_4_uchar();
import_5_4_long();
import_5_5_int();
import_5_5_float();
import_5_5_double();
import_5_5_uchar();
import_5_5_long();
import_5_6_int();
import_5_6_float();
import_5_6_double();
import_5_6_uchar();
import_5_6_long();
import_5_D_int();
import_5_D_float();
import_5_D_double();
import_5_D_uchar();
import_5_D_long();
import_6_1_int();
import_6_1_float();
import_6_1_double();
import_6_1_uchar();
import_6_1_long();
import_6_2_int();
import_6_2_float();
import_6_2_double();
import_6_2_uchar();
import_6_2_long();
import_6_3_int();
import_6_3_float();
import_6_3_double();
import_6_3_uchar();
import_6_3_long();
import_6_4_int();
import_6_4_float();
import_6_4_double();
import_6_4_uchar();
import_6_4_long();
import_6_5_int();
import_6_5_float();
import_6_5_double();
import_6_5_uchar();
import_6_5_long();
import_6_6_int();
import_6_6_float();
import_6_6_double();
import_6_6_uchar();
import_6_6_long();
import_6_D_int();
import_6_D_float();
import_6_D_double();
import_6_D_uchar();
import_6_D_long();
import_D_1_int();
import_D_1_float();
import_D_1_double();
import_D_1_uchar();
import_D_1_long();
import_D_2_int();
import_D_2_float();
import_D_2_double();
import_D_2_uchar();
import_D_2_long();
import_D_3_int();
import_D_3_float();
import_D_3_double();
import_D_3_uchar();
import_D_3_long();
import_D_4_int();
import_D_4_float();
import_D_4_double();
import_D_4_uchar();
import_D_4_long();
import_D_5_int();
import_D_5_float();
import_D_5_double();
import_D_5_uchar();
import_D_5_long();
import_D_6_int();
import_D_6_float();
import_D_6_double();
import_D_6_uchar();
import_D_6_long();
import_D_D_int();
import_D_D_float();
import_D_D_double();
import_D_D_uchar();
import_D_D_long();
}
| 22.48419 | 63 | 0.779379 | huangqinjin |
a3caad17378d6860b83421c5b3d16101ebebb670 | 8,814 | hpp | C++ | c++/include/objtools/alnmgr/score_builder_base.hpp | OpenHero/gblastn | a0d6c1c288fe916ab85fc637a44cdd6e79ebd2a8 | [
"MIT"
] | 31 | 2016-12-09T04:56:59.000Z | 2021-12-31T17:19:10.000Z | c++/include/objtools/alnmgr/score_builder_base.hpp | OpenHero/gblastn | a0d6c1c288fe916ab85fc637a44cdd6e79ebd2a8 | [
"MIT"
] | 6 | 2017-03-10T17:25:13.000Z | 2021-09-22T15:49:49.000Z | c++/include/objtools/alnmgr/score_builder_base.hpp | OpenHero/gblastn | a0d6c1c288fe916ab85fc637a44cdd6e79ebd2a8 | [
"MIT"
] | 20 | 2015-01-04T02:15:17.000Z | 2021-12-03T02:31:43.000Z | #ifndef OBJMGR_UTIL___SCORE_BUILDER_BASE__HPP
#define OBJMGR_UTIL___SCORE_BUILDER_BASE__HPP
/* $Id: score_builder_base.hpp 363131 2012-05-14 15:34:29Z whlavina $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
* Authors: Mike DiCuccio
*
* File Description:
*
*/
#include <corelib/ncbiobj.hpp>
#include <util/range_coll.hpp>
#include <objects/seqalign/Seq_align.hpp>
BEGIN_NCBI_SCOPE
BEGIN_SCOPE(objects)
class CScope;
class NCBI_XALNMGR_EXPORT CScoreBuilderBase
{
public:
CScoreBuilderBase();
virtual ~CScoreBuilderBase();
enum EScoreType {
//< typical blast 'score'
//< NOTE: implemented in a derived class!!
eScore_Blast,
//< blast 'bit_score' score
//< NOTE: implemented in a derived class!!
eScore_Blast_BitScore,
//< blast 'e_value' score
//< NOTE: implemented in a derived class!!
eScore_Blast_EValue,
//< count of ungapped identities as 'num_ident'
eScore_IdentityCount,
//< count of ungapped identities as 'num_mismatch'
eScore_MismatchCount,
//< percent identity as defined in CSeq_align, range 0.0-100.0
//< this will also create 'num_ident' and 'num_mismatch'
//< NOTE: see Seq_align.hpp for definitions
eScore_PercentIdentity,
//< percent coverage of query as 'pct_coverage', range 0.0-100.0
eScore_PercentCoverage
};
/// Error handling while adding scores that are not implemented
/// or unsupported (cannot be defined) for certain types
/// of alignments.
///
/// Transient errors, such as problems retrieving sequence
/// data, will always throw.
enum EErrorMode {
eError_Silent, ///< Try to ignore errors, continue adding scores.
eError_Report, ///< Print error messages, but do not fail.
eError_Throw ///< Throw exceptions on errors.
};
/// @name Functions to add scores directly to Seq-aligns
/// @{
EErrorMode GetErrorMode(void) const { return m_ErrorMode; }
void SetErrorMode(EErrorMode mode) { m_ErrorMode = mode; }
void AddScore(CScope& scope, CSeq_align& align,
CSeq_align::EScoreType score);
void AddScore(CScope& scope, list< CRef<CSeq_align> >& aligns,
CSeq_align::EScoreType score);
/// @}
/// @name Functions to compute scores without adding
/// @{
double ComputeScore(CScope& scope, const CSeq_align& align,
CSeq_align::EScoreType score);
double ComputeScore(CScope& scope, const CSeq_align& align,
const TSeqRange &range,
CSeq_align::EScoreType score);
virtual double ComputeScore(CScope& scope, const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges,
CSeq_align::EScoreType score);
/// Compute percent identity (range 0-100)
enum EPercentIdentityType {
eGapped, //< count gaps as mismatches
eUngapped, //< ignore gaps; only count aligned bases
eGBDNA //< each gap counts as a 1nt mismatch
};
double GetPercentIdentity(CScope& scope, const CSeq_align& align,
EPercentIdentityType type = eGapped);
/// Compute percent coverage of the query (sequence 0) (range 0-100)
double GetPercentCoverage(CScope& scope, const CSeq_align& align);
/// Compute percent identity or coverage of the query within specified range
double GetPercentIdentity(CScope& scope, const CSeq_align& align,
const TSeqRange &range,
EPercentIdentityType type = eGapped);
double GetPercentCoverage(CScope& scope, const CSeq_align& align,
const TSeqRange &range);
/// Compute percent identity or coverage of the query within specified
/// collection of ranges
double GetPercentIdentity(CScope& scope, const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges,
EPercentIdentityType type = eGapped);
double GetPercentCoverage(CScope& scope, const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges);
/// Compute the number of identities in the alignment
int GetIdentityCount (CScope& scope, const CSeq_align& align);
/// Compute the number of mismatches in the alignment
int GetMismatchCount (CScope& scope, const CSeq_align& align);
void GetMismatchCount (CScope& scope, const CSeq_align& align,
int& identities, int& mismatches);
/// Compute identity and/or mismatch counts within specified range
int GetIdentityCount (CScope& scope, const CSeq_align& align,
const TSeqRange &range);
int GetMismatchCount (CScope& scope, const CSeq_align& align,
const TSeqRange &range);
void GetMismatchCount (CScope& scope, const CSeq_align& align,
const TSeqRange &range,
int& identities, int& mismatches);
/// Compute identity and/or mismatch counts within specified
/// collection of ranges
int GetIdentityCount (CScope& scope, const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges);
int GetMismatchCount (CScope& scope, const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges);
void GetMismatchCount (CScope& scope, const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges,
int& identities, int& mismatches);
/// counts based on substitution matrix for protein alignments
int GetPositiveCount (CScope& scope, const CSeq_align& align);
int GetNegativeCount (CScope& scope, const CSeq_align& align);
void GetMatrixCounts (CScope& scope, const CSeq_align& align,
int& positives, int& negatives);
/// Compute the number of gaps in the alignment
int GetGapCount (const CSeq_align& align);
int GetGapCount (const CSeq_align& align,
const TSeqRange &range);
int GetGapCount (const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges);
/// Compute the number of gap bases in the alignment (= length of all gap
/// segments)
int GetGapBaseCount (const CSeq_align& align);
int GetGapBaseCount (const CSeq_align& align,
const TSeqRange &range);
int GetGapBaseCount (const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges);
/// Compute the length of the alignment (= length of all segments, gaps +
/// aligned)
TSeqPos GetAlignLength(const CSeq_align& align, bool ungapped=false);
TSeqPos GetAlignLength(const CSeq_align& align,
const TSeqRange &range, bool ungapped=false);
TSeqPos GetAlignLength(const CSeq_align& align,
const CRangeCollection<TSeqPos> &ranges,
bool ungapped=false);
void SetSubstMatrix(const string &name);
/// @}
private:
EErrorMode m_ErrorMode;
string m_SubstMatrixName;
void x_GetMatrixCounts(CScope& scope,
const CSeq_align& align,
int* positives, int* negatives);
};
END_SCOPE(objects)
END_NCBI_SCOPE
#endif // OBJMGR_UTIL___SCORE_BUILDER_BASE__HPP
| 40.246575 | 80 | 0.631382 | OpenHero |
a3cab4435bb899caf07684cb1186d74f0cc881bf | 7,296 | hpp | C++ | include/opentxs/core/trade/OTTrade.hpp | nopdotcom/opentxs | 140428ba8f1bd4c09654ebf0a1c1725f396efa8b | [
"MIT"
] | null | null | null | include/opentxs/core/trade/OTTrade.hpp | nopdotcom/opentxs | 140428ba8f1bd4c09654ebf0a1c1725f396efa8b | [
"MIT"
] | null | null | null | include/opentxs/core/trade/OTTrade.hpp | nopdotcom/opentxs | 140428ba8f1bd4c09654ebf0a1c1725f396efa8b | [
"MIT"
] | null | null | null | // Copyright (c) 2018 The Open-Transactions developers
// 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/.
// An OTTrade is derived from OTCronItem. OTCron has a list of items,
// which may be trades or agreements or who knows what next.
#ifndef OPENTXS_CORE_TRADE_OTTRADE_HPP
#define OPENTXS_CORE_TRADE_OTTRADE_HPP
#include "opentxs/Forward.hpp"
#include "opentxs/core/cron/OTCronItem.hpp"
#include "opentxs/core/trade/OTMarket.hpp"
#include "opentxs/core/trade/OTOffer.hpp"
#include "opentxs/core/Contract.hpp"
#include "opentxs/core/OTTransactionType.hpp"
#include "opentxs/core/String.hpp"
#include "opentxs/Types.hpp"
#include <cstdint>
namespace opentxs
{
namespace api
{
namespace implementation
{
class Factory;
} // namespace implementation
} // namespace api
/*
OTTrade
Standing Order (for Trades) MUST STORE:
X 1) Transaction ID // It took a transaction number to create this trade. We
record it here and use it to uniquely identify the trade, like any other
transaction.
X 4) CURRENCY TYPE ID (Currency type ID of whatever I’m trying to buy or sell
WITH. Dollars? Euro?)
X 5) Account ID SENDER (for above currency type. This is the account where I
make my payments from, to satisfy the trades.)
X 6) Valid date range. (Start. Expressed as an absolute date.)
X 7) Valid date range. ( End. Expressed as an absolute date.)
X 2) Creation date.
X 3) INTEGER: Number of trades that have processed through this order.
X 8) STOP ORDER — SIGN (nullptr if not a stop order — otherwise GREATER THAN or
LESS THAN…)
X 9) STOP ORDER — PRICE (…AT X PRICE, POST THE OFFER TO THE MARKET.)
Cron for these orders must check expiration dates and stop order prices.
———————————————————————————————
*/
class OTTrade : public OTCronItem
{
public:
originType GetOriginType() const override
{
return originType::origin_market_offer;
}
EXPORT bool VerifyOffer(OTOffer& offer) const;
EXPORT bool IssueTrade(
OTOffer& offer,
char stopSign = 0,
std::int64_t stopPrice = 0);
// The Trade always stores the original, signed version of its Offer.
// This method allows you to grab a copy of it.
inline bool GetOfferString(String& offer)
{
offer.Set(marketOffer_);
if (marketOffer_.Exists()) { return true; }
return false;
}
inline bool IsStopOrder() const
{
if ((stopSign_ == '<') || (stopSign_ == '>')) { return true; }
return false;
}
inline const std::int64_t& GetStopPrice() const { return stopPrice_; }
inline bool IsGreaterThan() const
{
if (stopSign_ == '>') { return true; }
return false;
}
inline bool IsLessThan() const
{
if (stopSign_ == '<') { return true; }
return false;
}
// optionally returns the offer's market ID and a pointer to the market.
OTOffer* GetOffer(OTMarket** market = nullptr);
// optionally returns the offer's market ID and a pointer to the market.
OTOffer* GetOffer(Identifier& offerMarketId, OTMarket** market = nullptr);
inline const Identifier& GetCurrencyID() const { return currencyTypeID_; }
inline void SetCurrencyID(const Identifier& currencyId)
{
currencyTypeID_ = currencyId;
}
inline const Identifier& GetCurrencyAcctID() const
{
return currencyAcctID_;
}
inline void SetCurrencyAcctID(const Identifier& currencyAcctID)
{
currencyAcctID_ = currencyAcctID;
}
inline void IncrementTradesAlreadyDone() { tradesAlreadyDone_++; }
inline std::int32_t GetCompletedCount() { return tradesAlreadyDone_; }
EXPORT std::int64_t GetAssetAcctClosingNum() const;
EXPORT std::int64_t GetCurrencyAcctClosingNum() const;
// Return True if should stay on OTCron's list for more processing.
// Return False if expired or otherwise should be removed.
bool ProcessCron() override; // OTCron calls this regularly, which is my
// chance to expire, etc.
bool CanRemoveItemFromCron(const ClientContext& context) override;
// From OTScriptable, we override this function. OTScriptable now does fancy
// stuff like checking to see
// if the Nym is an agent working on behalf of a party to the contract.
// That's how all OTScriptable-derived
// objects work by default. But OTAgreement (payment plan) and OTTrade do
// it the old way: they just check to
// see if theNym has signed *this.
//
bool VerifyNymAsAgent(const Nym& nym, const Nym& signerNym) const override;
bool VerifyNymAsAgentForAccount(const Nym& nym, const Account& account)
const override;
void InitTrade();
void Release_Trade();
void Release() override;
std::int64_t GetClosingNumber(const Identifier& acctId) const override;
// return -1 if error, 0 if nothing, and 1 if the node was processed.
std::int32_t ProcessXMLNode(irr::io::IrrXMLReader*& xml) override;
void UpdateContents() override; // Before transmission or serialization,
// this is where the ledger saves its
// contents
EXPORT virtual ~OTTrade();
protected:
void onFinalReceipt(
OTCronItem& origCronItem,
const std::int64_t& newTransactionNumber,
ConstNym originator,
ConstNym remover) override;
void onRemovalFromCron() override;
private:
friend api::implementation::Factory;
typedef OTCronItem ot_super;
OTIdentifier currencyTypeID_; // GOLD (Asset) is trading for DOLLARS
// (Currency).
OTIdentifier currencyAcctID_; // My Dollar account, used for paying for
// my Gold (say) trades.
OTOffer* offer_{nullptr}; // The pointer to the Offer (NOT responsible for
// cleaning this up!!!
// The offer is owned by the market and I only keep a pointer here for
// convenience.
bool hasTradeActivated_{false}; // Has the offer yet been first added to a
// market?
std::int64_t stopPrice_{0}; // The price limit that activates the STOP
// order.
char stopSign_{0x0}; // Value is 0, or '<', or '>'.
bool stopActivated_{false}; // If the Stop Order has already activated, I
// need to know that.
std::int32_t tradesAlreadyDone_{0}; // How many trades have already
// processed through this order? We
// keep track.
String marketOffer_; // The market offer associated with this trade.
EXPORT OTTrade(const api::Core& core);
EXPORT OTTrade(
const api::Core& core,
const Identifier& notaryID,
const Identifier& instrumentDefinitionID,
const Identifier& assetAcctId,
const Identifier& nymID,
const Identifier& currencyId,
const Identifier& currencyAcctId);
OTTrade() = delete;
};
} // namespace opentxs
#endif
| 33.163636 | 80 | 0.653372 | nopdotcom |
a3caef25b7b1a37a13e79ffbfdfe68d9208ce590 | 420 | cc | C++ | net/quiche/common/platform/impl/quiche_test_impl.cc | fangqiuhang/quiche | 13a192d533408e45139517a2f48f36eadb539f5a | [
"BSD-3-Clause"
] | null | null | null | net/quiche/common/platform/impl/quiche_test_impl.cc | fangqiuhang/quiche | 13a192d533408e45139517a2f48f36eadb539f5a | [
"BSD-3-Clause"
] | null | null | null | net/quiche/common/platform/impl/quiche_test_impl.cc | fangqiuhang/quiche | 13a192d533408e45139517a2f48f36eadb539f5a | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2021 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/quiche/common/platform/impl/quiche_test_impl.h"
#include <string>
namespace quiche {
namespace test {
std::string QuicheGetCommonSourcePathImpl() {
return "third_party/quiche/common";
}
} // namespace test
} // namespace quiche
| 23.333333 | 73 | 0.745238 | fangqiuhang |
a3ce12616f2db5403b6b07d17ddbc06382bc56a3 | 27,394 | cpp | C++ | sample/OMPLPlugin/MotionPlannerDialog.cpp | k38-suzuki/hairo-world-plugin | 031375812b278d88116f92320d8c5ce74eba7a0a | [
"MIT"
] | 5 | 2020-12-16T22:18:46.000Z | 2022-03-26T08:39:51.000Z | sample/OMPLPlugin/MotionPlannerDialog.cpp | k38-suzuki/hairo-world-plugin | 031375812b278d88116f92320d8c5ce74eba7a0a | [
"MIT"
] | 2 | 2021-06-29T04:03:15.000Z | 2021-06-29T05:46:15.000Z | sample/OMPLPlugin/MotionPlannerDialog.cpp | k38-suzuki/hairo-world-plugin | 031375812b278d88116f92320d8c5ce74eba7a0a | [
"MIT"
] | 2 | 2021-06-19T17:11:12.000Z | 2021-07-09T06:58:47.000Z | /**
\file
\author Kenta Suzuki
*/
#include "MotionPlannerDialog.h"
#include <cnoid/BodyItem>
#include <cnoid/Button>
#include <cnoid/CheckBox>
#include <cnoid/ComboBox>
#include <cnoid/EigenTypes>
#include <cnoid/JointPath>
#include <cnoid/MenuManager>
#include <cnoid/MeshGenerator>
#include <cnoid/MessageView>
#include <cnoid/PositionDragger>
#include <cnoid/RootItem>
#include <cnoid/SceneDrawables>
#include <cnoid/SceneView>
#include <cnoid/SceneWidget>
#include <cnoid/Separator>
#include <cnoid/SpinBox>
#include <cnoid/Timer>
#include <cnoid/ViewManager>
#include <cnoid/WorldItem>
#include <fmt/format.h>
#include <QColor>
#include <QDialogButtonBox>
#include <QGridLayout>
#include <QHBoxLayout>
#include <QLabel>
#include <QVBoxLayout>
#include <ompl/base/SpaceInformation.h>
#include <ompl/base/spaces/SE3StateSpace.h>
#include <ompl/geometric/planners/rrt/RRT.h>
#include <ompl/geometric/planners/rrt/RRTConnect.h>
#include <ompl/geometric/planners/rrt/RRTstar.h>
#include <ompl/geometric/planners/rrt/pRRT.h>
#include <ompl/geometric/SimpleSetup.h>
#include <ompl/config.h>
#include "gettext.h"
#include "sample/SimpleController/Interpolator.h"
using namespace std;
using namespace cnoid;
namespace ob = ompl::base;
namespace og = ompl::geometric;
MotionPlannerDialog* plannerDialog = nullptr;
namespace cnoid {
class MotionPlannerDialogImpl
{
public:
MotionPlannerDialogImpl(MotionPlannerDialog* self);
MotionPlannerDialog* self;
SgSwitchableGroupPtr startScene;
SgSwitchableGroupPtr goalScene;
SgSwitchableGroupPtr statesScene;
SgSwitchableGroupPtr solutionScene;
SgShape* currentShape;
Affine3 currentTransform;
ItemList<BodyItem> bodyItems;
BodyItem* bodyItem;
Body* body;
Link* baseLink;
Link* endLink;
WorldItem* worldItem;
ComboBox* bodyCombo;
ComboBox* baseCombo;
ComboBox* endCombo;
ComboBox* plannerCombo;
CheckBox* statesCheck;
CheckBox* solutionCheck;
CheckBox* cubicCheck;
DoubleSpinBox* cubicSpin;
DoubleSpinBox* xminSpin;
DoubleSpinBox* xmaxSpin;
DoubleSpinBox* yminSpin;
DoubleSpinBox* ymaxSpin;
DoubleSpinBox* zminSpin;
DoubleSpinBox* zmaxSpin;
DoubleSpinBox* startxSpin;
DoubleSpinBox* startySpin;
DoubleSpinBox* startzSpin;
DoubleSpinBox* goalxSpin;
DoubleSpinBox* goalySpin;
DoubleSpinBox* goalzSpin;
DoubleSpinBox* timeLengthSpin;
DoubleSpinBox* timeSpin;
CheckBox* startCheck;
CheckBox* goalCheck;
ToggleButton* previewButton;
PushButton* startButton;
PushButton* goalButton;
MessageView* messageView;
vector<Vector3> solutions;
Interpolator<VectorXd> interpolator;
double time;
double timeStep;
double timeLength;
Timer* timer;
bool isSolved;
PositionDraggerPtr startDragger;
PositionDraggerPtr goalDragger;
void onTargetLinkChanged();
void onStartButtonClicked();
void onGoalButtonClicked();
void onGenerateButtonClicked();
void onPreviewButtonToggled(bool on);
void onPreviewTimeout();
void onCheckToggled();
void onCurrentIndexChanged(int index);
void onStartValueChanged();
void onGoalValueChanged();
void onStartPositionDragged();
void onGoalPositionDragged();
void planWithSimpleSetup();
bool isStateValid(const ob::State* state);
void onAccepted();
void onRejected();
};
}
MotionPlannerDialog::MotionPlannerDialog()
{
impl = new MotionPlannerDialogImpl(this);
}
MotionPlannerDialogImpl::MotionPlannerDialogImpl(MotionPlannerDialog* self)
: self(self)
{
self->setWindowTitle(_("Motion Planner"));
currentShape = nullptr;
bodyItems.clear();
bodyItem = nullptr;
body = nullptr;
baseLink = nullptr;
endLink = nullptr;
worldItem = nullptr;
messageView = MessageView::instance();
solutions.clear();
interpolator.clear();
time = 0.0;
timeStep = 0.001;
timeLength = 1.0;
timer = new Timer();
timer->start(1);
isSolved = false;
startDragger = nullptr;
goalDragger = nullptr;
MeshGenerator generator;
startScene = new SgSwitchableGroup();
startScene->setTurnedOn(false);
startDragger = new PositionDragger(
PositionDragger::TranslationAxes, PositionDragger::WideHandle);
startDragger->setDragEnabled(true);
startDragger->setOverlayMode(true);
startDragger->setPixelSize(48, 2);
startDragger->setDisplayMode(PositionDragger::DisplayInEditMode);
SgPosTransform* startPos = new SgPosTransform();
SgGroup* startGroup = new SgGroup();
SgShape* startShape = new SgShape();
SgMesh* startMesh = generator.generateSphere(0.05);
SgMaterial* startMaterial = new SgMaterial();
startMaterial->setDiffuseColor(Vector3(0.0, 0.0, 1.0));
startShape->setMesh(startMesh);
startShape->setMaterial(startMaterial);
startGroup->addChild(startShape);
startGroup->addChild(startDragger);
startPos->addChild(startGroup);
startScene->addChild(startPos);
startDragger->adjustSize(startShape->boundingBox());
startDragger->sigPositionDragged().connect([&](){ onStartPositionDragged(); });
goalScene = new SgSwitchableGroup();
goalScene->setTurnedOn(false);
goalDragger = new PositionDragger(
PositionDragger::TranslationAxes, PositionDragger::WideHandle);
goalDragger->setDragEnabled(true);
goalDragger->setOverlayMode(true);
goalDragger->setPixelSize(48, 2);
goalDragger->setDisplayMode(PositionDragger::DisplayInEditMode);
SgPosTransform* goalPos = new SgPosTransform();
SgGroup* goalGroup = new SgGroup();
SgShape* goalShape = new SgShape();
SgMesh* goalMesh = generator.generateSphere(0.05);
SgMaterial* goalMaterial = new SgMaterial();
goalMaterial->setDiffuseColor(Vector3(1.0, 0.0, 0.0));
goalShape->setMesh(goalMesh);
goalShape->setMaterial(goalMaterial);
goalGroup->addChild(goalShape);
goalGroup->addChild(goalDragger);
goalPos->addChild(goalGroup);
goalScene->addChild(goalPos);
goalDragger->adjustSize(goalShape->boundingBox());
goalDragger->sigPositionDragged().connect([&](){ onGoalPositionDragged(); });
statesScene = new SgSwitchableGroup();
statesScene->setTurnedOn(false);
solutionScene = new SgSwitchableGroup();
solutionScene->setTurnedOn(false);
SceneWidget* sceneWidget = SceneView::instance()->sceneWidget();
sceneWidget->sceneRoot()->addChild(startScene);
sceneWidget->sceneRoot()->addChild(goalScene);
sceneWidget->sceneRoot()->addChild(statesScene);
sceneWidget->sceneRoot()->addChild(solutionScene);
QVBoxLayout* vbox = new QVBoxLayout();
HSeparatorBox* tbsbox = new HSeparatorBox(new QLabel(_("Target Body")));
vbox->addLayout(tbsbox);
QGridLayout* tbgbox = new QGridLayout();
bodyCombo = new ComboBox();
baseCombo = new ComboBox();
endCombo = new ComboBox();
tbgbox->addWidget(new QLabel(_("Body")), 0, 0);
tbgbox->addWidget(bodyCombo, 0, 1);
tbgbox->addWidget(new QLabel(_("Base Link")), 1, 0);
tbgbox->addWidget(baseCombo, 1, 1);
tbgbox->addWidget(new QLabel(_("End Link")), 1, 2);
tbgbox->addWidget(endCombo, 1, 3);
vbox->addLayout(tbgbox);
HSeparatorBox* bbsbox = new HSeparatorBox(new QLabel(_("Bounding Box")));
vbox->addLayout(bbsbox);
QGridLayout* bbgbox = new QGridLayout();
cubicCheck = new CheckBox();
cubicCheck->setText(_("Cubic BB"));
cubicSpin = new DoubleSpinBox();
cubicSpin->setRange(0.0, 1000.0);
cubicSpin->setValue(1.0);
cubicSpin->setAlignment(Qt::AlignCenter);
cubicSpin->setEnabled(false);
xminSpin = new DoubleSpinBox();
xminSpin->setRange(-1000.0, 0.0);
xminSpin->setValue(-1.0);
xminSpin->setAlignment(Qt::AlignCenter);
xmaxSpin = new DoubleSpinBox();
xmaxSpin->setRange(0.0, 1000.0);
xmaxSpin->setValue(1.0);
xmaxSpin->setAlignment(Qt::AlignCenter);
yminSpin = new DoubleSpinBox();
yminSpin->setRange(-1000.0, 0.0);
yminSpin->setValue(-1.0);
yminSpin->setAlignment(Qt::AlignCenter);
ymaxSpin = new DoubleSpinBox();
ymaxSpin->setRange(0.0, 1000.0);
ymaxSpin->setValue(1.0);
ymaxSpin->setAlignment(Qt::AlignCenter);
zminSpin = new DoubleSpinBox();
zminSpin->setRange(-1000.0, 0.0);
zminSpin->setValue(-1.0);
zminSpin->setAlignment(Qt::AlignCenter);
zmaxSpin = new DoubleSpinBox();
zmaxSpin->setRange(0.0, 1000.0);
zmaxSpin->setValue(1.0);
zmaxSpin->setAlignment(Qt::AlignCenter);
bbgbox->addWidget(cubicCheck, 0, 0);
bbgbox->addWidget(cubicSpin, 0, 1);
bbgbox->addWidget(new QLabel(_("min[x, y, z]")), 1, 0);
bbgbox->addWidget(xminSpin, 1, 1);
bbgbox->addWidget(yminSpin, 1, 2);
bbgbox->addWidget(zminSpin, 1, 3);
bbgbox->addWidget(new QLabel(_("max[x, y, z]")), 2, 0);
bbgbox->addWidget(xmaxSpin, 2, 1);
bbgbox->addWidget(ymaxSpin, 2, 2);
bbgbox->addWidget(zmaxSpin, 2, 3);
vbox->addLayout(bbgbox);
HSeparatorBox* ctsbox = new HSeparatorBox(new QLabel(_("Path Generation")));
vbox->addLayout(ctsbox);
QGridLayout* pgbox = new QGridLayout();
plannerCombo = new ComboBox();
QStringList planners = { "RRT", "RRTConnect", "RRT*", "pRRT" };
plannerCombo->addItems(planners);
timeSpin = new DoubleSpinBox();
timeSpin->setRange(0.0, 1000.0);
timeSpin->setValue(1.0);
timeSpin->setAlignment(Qt::AlignCenter);
statesCheck = new CheckBox();
statesCheck->setText(_("Show states"));
statesCheck->setChecked(false);
solutionCheck = new CheckBox();
solutionCheck->setText(_("Show solution"));
solutionCheck->setChecked(false);
startCheck = new CheckBox();
startCheck->setChecked(false);
startCheck->setText(_("Start[x, y, z]"));
startxSpin = new DoubleSpinBox();
startxSpin->setRange(-1000.0, 1000.0);
startxSpin->setSingleStep(0.01);
startxSpin->setValue(0.0);
startxSpin->setAlignment(Qt::AlignCenter);
startySpin = new DoubleSpinBox();
startySpin->setRange(-1000.0, 1000.0);
startySpin->setSingleStep(0.01);
startySpin->setValue(0.0);
startySpin->setAlignment(Qt::AlignCenter);
startzSpin = new DoubleSpinBox();
startzSpin->setRange(-1000.0, 1000.0);
startzSpin->setSingleStep(0.01);
startzSpin->setValue(0.0);
startzSpin->setAlignment(Qt::AlignCenter);
goalCheck = new CheckBox();
goalCheck->setChecked(false);
goalCheck->setText(_("Goal[x, y, z]"));
goalxSpin = new DoubleSpinBox();
goalxSpin->setRange(-1000.0, 1000.0);
goalxSpin->setSingleStep(0.01);
goalxSpin->setValue(0.0);
goalxSpin->setAlignment(Qt::AlignCenter);
goalySpin = new DoubleSpinBox();
goalySpin->setRange(-1000.0, 1000.0);
goalySpin->setSingleStep(0.01);
goalySpin->setValue(0.0);
goalySpin->setAlignment(Qt::AlignCenter);
goalzSpin = new DoubleSpinBox();
goalzSpin->setRange(-1000.0, 1000.0);
goalzSpin->setSingleStep(0.01);
goalzSpin->setValue(0.0);
goalzSpin->setAlignment(Qt::AlignCenter);
startButton = new PushButton(_("Set start"));
goalButton = new PushButton(_("Set goal"));
pgbox->addWidget(new QLabel(_("Geometric planner")), 0, 0);
pgbox->addWidget(plannerCombo, 0, 1);
pgbox->addWidget(startButton, 0, 2);
pgbox->addWidget(goalButton, 0, 3);
pgbox->addWidget(startCheck, 1, 0);
pgbox->addWidget(startxSpin, 1, 1);
pgbox->addWidget(startySpin, 1, 2);
pgbox->addWidget(startzSpin, 1, 3);
pgbox->addWidget(goalCheck, 2, 0);
pgbox->addWidget(goalxSpin, 2, 1);
pgbox->addWidget(goalySpin, 2, 2);
pgbox->addWidget(goalzSpin, 2, 3);
pgbox->addWidget(new QLabel(_("Calculation time")), 3, 0);
pgbox->addWidget(timeSpin, 3, 1);
vbox->addLayout(pgbox);
HSeparatorBox* psbox = new HSeparatorBox(new QLabel(_("Preview")));
vbox->addLayout(psbox);
PushButton* generateButton = new PushButton(_("Generate"));
previewButton = new ToggleButton(_("Preview"));
timeLengthSpin = new DoubleSpinBox();
timeLengthSpin->setRange(1.0, 1000.0);
timeLengthSpin->setValue(1.0);
timeLengthSpin->setAlignment(Qt::AlignCenter);
QGridLayout* pvbox = new QGridLayout();
pvbox->addWidget(solutionCheck, 0, 0);
pvbox->addWidget(statesCheck, 0, 1);
pvbox->addWidget(generateButton, 0, 2);
pvbox->addWidget(new QLabel(_("Time length")), 1, 0);
pvbox->addWidget(timeLengthSpin, 1, 1);
pvbox->addWidget(previewButton, 1, 2);
vbox->addLayout(pvbox);
vbox->addWidget(new HSeparator);
QPushButton* okButton = new QPushButton(_("&Ok"));
okButton->setDefault(true);
QDialogButtonBox* buttonBox = new QDialogButtonBox(self);
buttonBox->addButton(okButton, QDialogButtonBox::AcceptRole);
self->connect(buttonBox,SIGNAL(accepted()), self, SLOT(accept()));
vbox->addWidget(buttonBox);
generateButton->sigClicked().connect([&](){ onGenerateButtonClicked(); });
RootItem::instance()->sigCheckToggled().connect([&](Item* item, bool on){
onCheckToggled();
});
previewButton->sigToggled().connect([&](bool on){ onPreviewButtonToggled(on); });
bodyCombo->sigCurrentIndexChanged().connect([&](int index){ onCurrentIndexChanged(index); });
cubicCheck->sigToggled().connect([&](bool on){
cubicSpin->setEnabled(on);
xminSpin->setEnabled(!on);
xmaxSpin->setEnabled(!on);
yminSpin->setEnabled(!on);
ymaxSpin->setEnabled(!on);
zminSpin->setEnabled(!on);
zmaxSpin->setEnabled(!on);
});
cubicSpin->sigValueChanged().connect([&](double value){
xminSpin->setValue(-1.0 * value);
xmaxSpin->setValue(value);
yminSpin->setValue(-1.0 * value);
ymaxSpin->setValue(value);
zminSpin->setValue(-1.0 * value);
zmaxSpin->setValue(value);
});
statesCheck->sigToggled().connect([&](bool on){
statesScene->setTurnedOn(on);
statesScene->notifyUpdate();
});
solutionCheck->sigToggled().connect([&](bool on){
solutionScene->setTurnedOn(on);
solutionScene->notifyUpdate();
});
startCheck->sigToggled().connect([&](bool on){
startScene->setTurnedOn(on);
startScene->notifyUpdate();
});
goalCheck->sigToggled().connect([&](bool on){
goalScene->setTurnedOn(on);
goalScene->notifyUpdate();
});
startxSpin->sigValueChanged().connect([&](double value){ onStartValueChanged(); });
startySpin->sigValueChanged().connect([&](double value){ onStartValueChanged(); });
startzSpin->sigValueChanged().connect([&](double value){ onStartValueChanged(); });
goalxSpin->sigValueChanged().connect([&](double value){ onGoalValueChanged(); });
goalySpin->sigValueChanged().connect([&](double value){ onGoalValueChanged(); });
goalzSpin->sigValueChanged().connect([&](double value){ onGoalValueChanged(); });
timer->sigTimeout().connect([&](){ onPreviewTimeout(); });
ViewManager::sigViewCreated().connect([&](View* view){
SceneView* sceneView = dynamic_cast<SceneView*>(view);
if(sceneView) {
sceneView->sceneWidget()->sceneRoot()->addChildOnce(startScene);
sceneView->sceneWidget()->sceneRoot()->addChildOnce(goalScene);
sceneView->sceneWidget()->sceneRoot()->addChildOnce(statesScene);
sceneView->sceneWidget()->sceneRoot()->addChildOnce(solutionScene);
}
});
ViewManager::sigViewRemoved().connect([&](View* view){
SceneView* sceneView = dynamic_cast<SceneView*>(view);
if(sceneView) {
sceneView->sceneWidget()->sceneRoot()->removeChild(startScene);
sceneView->sceneWidget()->sceneRoot()->removeChild(goalScene);
sceneView->sceneWidget()->sceneRoot()->removeChild(statesScene);
sceneView->sceneWidget()->sceneRoot()->removeChild(solutionScene);
}
});
startButton->sigClicked().connect([&](){ onStartButtonClicked(); });
goalButton->sigClicked().connect([&](){ onGoalButtonClicked(); });
self->setLayout(vbox);
}
MotionPlannerDialog::~MotionPlannerDialog()
{
delete impl;
}
void MotionPlannerDialog::initializeClass(ExtensionManager* ext)
{
string version = OMPL_VERSION;
MessageView::instance()->putln(fmt::format("OMPL version: {0}", version));
if(!plannerDialog) {
plannerDialog = ext->manage(new MotionPlannerDialog());
}
MenuManager& mm = ext->menuManager();
mm.setPath("/Tools");
mm.addItem(_("Motion Planner"))
->sigTriggered().connect([](){ plannerDialog->show(); });
}
MotionPlannerDialog* MotionPlannerDialog::instance()
{
return plannerDialog;
}
void MotionPlannerDialogImpl::onTargetLinkChanged()
{
bodyItem = bodyItems[bodyCombo->currentIndex()];
body = bodyItem->body();
endLink = body->link(endCombo->currentIndex());
}
void MotionPlannerDialogImpl::onStartButtonClicked()
{
onTargetLinkChanged();
if(endLink) {
Vector3 translation = endLink->T().translation();
startxSpin->setValue(translation[0]);
startySpin->setValue(translation[1]);
startzSpin->setValue(translation[2]);
}
}
void MotionPlannerDialogImpl::onGoalButtonClicked()
{
onTargetLinkChanged();
if(endLink) {
Vector3 translation = endLink->T().translation();
goalxSpin->setValue(translation[0]);
goalySpin->setValue(translation[1]);
goalzSpin->setValue(translation[2]);
}
}
void MotionPlannerDialogImpl::onGenerateButtonClicked()
{
statesScene->clearChildren();
solutionScene->clearChildren();
if(bodyItems.size()) {
bodyItem = bodyItems[bodyCombo->currentIndex()];
body = bodyItem->body();
bodyItem->restoreInitialState(true);
baseLink = body->link(baseCombo->currentIndex());
endLink = body->link(endCombo->currentIndex());
worldItem = bodyItem->findOwnerItem<WorldItem>();
}
planWithSimpleSetup();
}
void MotionPlannerDialogImpl::onPreviewButtonToggled(bool on)
{
if(on && isSolved) {
time = 0.0;
interpolator.clear();
int numPoints = solutions.size();
timeLength = timeLengthSpin->value();
double dt = timeLength / (double)numPoints;
for(size_t i = 0; i < solutions.size(); i++) {
interpolator.appendSample(dt * (double)i, solutions[i]);
}
interpolator.update();
}
}
void MotionPlannerDialogImpl::onPreviewTimeout()
{
if(body && baseLink && endLink) {
if(previewButton->isChecked()) {
auto path = JointPath::getCustomPath(body, baseLink, endLink);
VectorXd p(6);
p = interpolator.interpolate(time);
Vector3 pref = Vector3(p.head<3>());
Matrix3 rref = endLink->R();
Isometry3 T;
T.linear() = rref;
T.translation() = pref;
if(path->calcInverseKinematics(T)) {
bodyItem->notifyKinematicStateChange(true);
}
time += timeStep;
}
}
}
void MotionPlannerDialogImpl::onCheckToggled()
{
bodyItems = RootItem::instance()->checkedItems<BodyItem>();
bodyCombo->clear();
for(size_t i = 0; i < bodyItems.size(); i++) {
bodyCombo->addItem(QString::fromStdString(bodyItems[i]->name()));
}
}
void MotionPlannerDialogImpl::onCurrentIndexChanged(int index)
{
baseCombo->clear();
endCombo->clear();
if(index >= 0) {
Body* body = bodyItems[index]->body();
for(size_t i = 0; i < body->numLinks(); i++) {
Link* link = body->link(i);
baseCombo->addItem(QString::fromStdString(link->name()));
endCombo->addItem(QString::fromStdString(link->name()));
}
}
}
void MotionPlannerDialogImpl::onStartValueChanged()
{
SgPosTransform* pos = dynamic_cast<SgPosTransform*>(startScene->child(0));
Vector3 translation = Vector3(startxSpin->value(), startySpin->value(), startzSpin->value());
pos->setTranslation(translation);
startScene->notifyUpdate();
}
void MotionPlannerDialogImpl::onGoalValueChanged()
{
SgPosTransform* pos = dynamic_cast<SgPosTransform*>(goalScene->child(0));
Vector3 translation = Vector3(goalxSpin->value(), goalySpin->value(), goalzSpin->value());
pos->setTranslation(translation);
goalScene->notifyUpdate();
}
void MotionPlannerDialogImpl::onStartPositionDragged()
{
Vector3 p = startDragger->globalDraggingPosition().translation();
startxSpin->setValue(p[0]);
startySpin->setValue(p[1]);
startzSpin->setValue(p[2]);
}
void MotionPlannerDialogImpl::onGoalPositionDragged()
{
Vector3 p = goalDragger->globalDraggingPosition().translation();
goalxSpin->setValue(p[0]);
goalySpin->setValue(p[1]);
goalzSpin->setValue(p[2]);
}
void MotionPlannerDialogImpl::planWithSimpleSetup()
{
auto space(std::make_shared<ob::SE3StateSpace>());
ob::RealVectorBounds bounds(3);
bounds.setLow(0, xminSpin->value());
bounds.setHigh(0, xmaxSpin->value());
bounds.setLow(1, yminSpin->value());
bounds.setHigh(1, ymaxSpin->value());
bounds.setLow(2, zminSpin->value());
bounds.setHigh(2, zmaxSpin->value());
space->setBounds(bounds);
og::SimpleSetup ss(space);
ss.setStateValidityChecker([&](const ob::State* state) { return isStateValid(state); });
ob::ScopedState<ob::SE3StateSpace> start(space);
start->setX(startxSpin->value());
start->setY(startySpin->value());
start->setZ(startzSpin->value());
start->rotation().setIdentity();
ob::ScopedState<ob::SE3StateSpace> goal(space);
goal->setX(goalxSpin->value());
goal->setY(goalySpin->value());
goal->setZ(goalzSpin->value());
goal->rotation().setIdentity();
ss.setStartAndGoalStates(start, goal);
int index = plannerCombo->currentIndex();
switch (index) {
case 0:
{
ob::PlannerPtr planner(new og::RRT(ss.getSpaceInformation()));
ss.setPlanner(planner);
}
break;
case 1:
{
ob::PlannerPtr planner(new og::RRTConnect(ss.getSpaceInformation()));
ss.setPlanner(planner);
}
break;
case 2:
{
ob::PlannerPtr planner(new og::RRTstar(ss.getSpaceInformation()));
ss.setPlanner(planner);
}
break;
case 3:
{
ob::PlannerPtr planner(new og::pRRT(ss.getSpaceInformation()));
ss.setPlanner(planner);
}
break;
default:
break;
}
ss.setup();
// ss.print(messageView->cout());
ob::PlannerStatus solved = ss.solve(timeSpin->value());
if(solved) {
messageView->putln("Found solution:");
isSolved = true;
og::PathGeometric pathes = ss.getSolutionPath();
const int numPoints = pathes.getStateCount();
solutions.clear();
for(size_t i = 0; i < pathes.getStateCount(); i++) {
ob::State* state = pathes.getState(i);
float x = state->as<ob::SE3StateSpace::StateType>()->getX();
float y = state->as<ob::SE3StateSpace::StateType>()->getY();
float z = state->as<ob::SE3StateSpace::StateType>()->getZ();
solutions.push_back(Vector3(x, y, z));
MeshGenerator generator;
SgShape* shape = new SgShape();
shape->setMesh(generator.generateSphere(0.02));
SgMaterial* material = new SgMaterial();
int hue = 240.0 * (1.0 - (double)i / (double)(numPoints - 1));
QColor qColor = QColor::fromHsv(hue, 255, 255);
Vector3f color((double)qColor.red() / 255.0, (double)qColor.green() / 255.0, (double)qColor.blue() / 255.0);
material->setDiffuseColor(Vector3(color[0], color[1], color[2]));
material->setTransparency(0.5);
shape->setMaterial(material);
SgPosTransform* transform = new SgPosTransform();
transform->addChild(shape);
transform->setTranslation(Vector3(x, y, z));
solutionScene->addChild(transform);
if(bodyItem) {
bodyItem->restoreInitialState(true);
if(baseLink != endLink) {
auto path = JointPath::getCustomPath(body, baseLink, endLink);
Vector3 pref = Vector3(x, y, z);
Matrix3 rref = endLink->R();
Isometry3 T;
T.linear() = rref;
T.translation() = pref;
if(path->calcInverseKinematics(T)) {
bodyItem->notifyKinematicStateChange(true);
}
}
}
}
ss.simplifySolution();
// ss.getSolutionPath().print(messageView->cout());
} else {
messageView->putln("No solution found");
isSolved = false;
}
}
bool MotionPlannerDialogImpl::isStateValid(const ob::State* state)
{
const auto *se3state = state->as<ob::SE3StateSpace::StateType>();
const auto *pos = se3state->as<ob::RealVectorStateSpace::StateType>(0);
const auto *rot = se3state->as<ob::SO3StateSpace::StateType>(1);
bool solved = false;
bool collided = false;
float x = state->as<ob::SE3StateSpace::StateType>()->getX();
float y = state->as<ob::SE3StateSpace::StateType>()->getY();
float z = state->as<ob::SE3StateSpace::StateType>()->getZ();
MeshGenerator generator;
SgShape* shape = new SgShape();
shape->setMesh(generator.generateSphere(0.02));
SgMaterial* material = new SgMaterial();
material->setDiffuseColor(Vector3(0.0, 1.0, 0.0));
material->setTransparency(0.5);
shape->setMaterial(material);
SgPosTransform* transform = new SgPosTransform();
transform->addChild(shape);
transform->setTranslation(Vector3(x, y, z));
statesScene->addChild(transform);
if(bodyItem) {
bodyItem->restoreInitialState(true);
if(baseLink != endLink) {
auto path = JointPath::getCustomPath(body, baseLink, endLink);
Vector3 pref = endLink->p();
Matrix3 rref = endLink->R();
pref = Vector3(x, y, z);
Isometry3 T;
T.linear() = rref;
T.translation() = pref;
if(path->calcInverseKinematics(T)) {
bodyItem->notifyKinematicStateChange(true);
solved = true;
if(worldItem) {
worldItem->updateCollisions();
vector<CollisionLinkPairPtr> collisions = bodyItem->collisions();
for(size_t i = 0; i < collisions.size(); i++) {
CollisionLinkPairPtr collision = collisions[i];
if((collision->body[0] == body) || (collision->body[1] == body)) {
if(!collision->isSelfCollision()) {
collided = true;
}
}
}
}
}
}
}
return ((const void*)rot != (const void*)pos) && solved && !collided;
}
void MotionPlannerDialog::onAccepted()
{
impl->onAccepted();
}
void MotionPlannerDialogImpl::onAccepted()
{
}
void MotionPlannerDialog::onRejected()
{
impl->onAccepted();
}
void MotionPlannerDialogImpl::onRejected()
{
}
| 32.767943 | 120 | 0.648865 | k38-suzuki |
a3ce53f1916fccb020472e811b0de84e1537d47e | 676 | cpp | C++ | Other/ternarySearch.cpp | adiletabs/Algos | fa2bb9edddb517f52b79fc712f70d6f8a0786e33 | [
"MIT"
] | 3 | 2020-01-29T18:26:37.000Z | 2021-01-19T06:26:34.000Z | Other/ternarySearch.cpp | adiletabs/Algos | fa2bb9edddb517f52b79fc712f70d6f8a0786e33 | [
"MIT"
] | null | null | null | Other/ternarySearch.cpp | adiletabs/Algos | fa2bb9edddb517f52b79fc712f70d6f8a0786e33 | [
"MIT"
] | 2 | 2019-03-06T03:40:42.000Z | 2019-09-23T03:48:21.000Z | /*--------------------------------------------
Ternary search algorithm
Finds the maximum/minimum value of
any unimodal function
Here is an algorithm for finding the maximum
of a sample function f(x). Algorithm for
finding the minimum value is symmetrical
Time complexity - O(log(2/3)N)
--------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
int f(int x) {
return -x * x + 20;
}
int ternary_search(int l, int r) {
while (r - l >= 3) {
int d = (r - l) / 3;
int m1 = l + d, m2 = r - d;
if (f(m1) < f(m2)) l = m1;
else r = m2;
}
int res = f(l);
for (int i = l + 1; i <= r; i++)
res = max(res, f(i));
return res;
}
| 19.314286 | 46 | 0.523669 | adiletabs |
a3d01902f44a8f1741b9ccd3967232124a410b7c | 1,318 | hh | C++ | src/whetstone/PolynomialOnMesh.hh | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 37 | 2017-04-26T16:27:07.000Z | 2022-03-01T07:38:57.000Z | src/whetstone/PolynomialOnMesh.hh | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 494 | 2016-09-14T02:31:13.000Z | 2022-03-13T18:57:05.000Z | src/whetstone/PolynomialOnMesh.hh | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 43 | 2016-09-26T17:58:40.000Z | 2022-03-25T02:29:59.000Z | /*
WhetStone, Version 2.2
Release name: naka-to.
Copyright 2010-201x held jointly by LANS/LANL, LBNL, and PNNL.
Amanzi is released under the three-clause BSD License.
The terms of use and "as is" disclaimer for this license are
provided in the top-level COPYRIGHT file.
Author: Konstantin Lipnikov ([email protected])
A polynomial binded with a mesh object. This struct allows us
to verify identity of a polynomial used by multiple classes.
*/
#ifndef AMANZI_WHETSTONE_POLYNOMIAL_ON_MESH_HH_
#define AMANZI_WHETSTONE_POLYNOMIAL_ON_MESH_HH_
#include "Teuchos_RCP.hpp"
#include "Point.hh"
#include "Polynomial.hh"
#include "WhetStoneDefs.hh"
namespace Amanzi {
namespace WhetStone {
class PolynomialOnMesh {
public:
PolynomialOnMesh() : id_(-1), kind_((Entity_kind)WhetStone::CELL) {};
Polynomial& poly() { return poly_; }
const Polynomial& poly() const { return poly_; }
void set_kind(Entity_kind kind) { kind_ = kind; }
const Entity_kind& get_kind() const { return kind_; }
const Entity_ID& get_id() const { return id_; }
void set_id(Entity_ID id) { id_ = id; }
private:
Polynomial poly_;
Entity_kind kind_; // topological binding of polynomial
Entity_ID id_; // numerical id of topological entity
};
} // namespace WhetStone
} // namespace Amanzi
#endif
| 24.867925 | 71 | 0.734446 | fmyuan |
a3d352f05f4ee9dec1206881dfec5836ea5bdb75 | 8,250 | cpp | C++ | src/core/SkImageInfo.cpp | CarbonBeta/android_external_skqp | 78c01d5dd7309cebba9bb38099cbe8dcb7960d05 | [
"BSD-3-Clause"
] | 1 | 2021-03-07T03:46:07.000Z | 2021-03-07T03:46:07.000Z | src/core/SkImageInfo.cpp | CarbonBeta/android_external_skqp | 78c01d5dd7309cebba9bb38099cbe8dcb7960d05 | [
"BSD-3-Clause"
] | null | null | null | src/core/SkImageInfo.cpp | CarbonBeta/android_external_skqp | 78c01d5dd7309cebba9bb38099cbe8dcb7960d05 | [
"BSD-3-Clause"
] | 5 | 2019-01-12T23:00:57.000Z | 2021-03-24T20:55:12.000Z | /*
* Copyright 2010 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkImageInfo.h"
#include "SkSafeMath.h"
#include "SkReadBuffer.h"
#include "SkWriteBuffer.h"
// These values must be constant over revisions, though they can be renamed to reflect if/when
// they are deprecated.
enum Stored_SkColorType {
kUnknown_Stored_SkColorType = 0,
kAlpha_8_Stored_SkColorType = 1,
kRGB_565_Stored_SkColorType = 2,
kARGB_4444_Stored_SkColorType = 3,
kRGBA_8888_Stored_SkColorType = 4,
kBGRA_8888_Stored_SkColorType = 5,
kIndex_8_Stored_SkColorType_DEPRECATED = 6,
kGray_8_Stored_SkColorType = 7,
kRGBA_F16_Stored_SkColorType = 8,
kRGB_888x_Stored_SkColorType = 9,
kRGBA_1010102_Stored_SkColorType = 10,
kRGB_101010x_Stored_SkColorType = 11,
};
static uint8_t live_to_stored(unsigned ct) {
switch (ct) {
case kUnknown_SkColorType: return kUnknown_Stored_SkColorType;
case kAlpha_8_SkColorType: return kAlpha_8_Stored_SkColorType;
case kRGB_565_SkColorType: return kRGB_565_Stored_SkColorType;
case kARGB_4444_SkColorType: return kARGB_4444_Stored_SkColorType;
case kRGBA_8888_SkColorType: return kRGBA_8888_Stored_SkColorType;
case kRGB_888x_SkColorType: return kRGB_888x_Stored_SkColorType;
case kBGRA_8888_SkColorType: return kBGRA_8888_Stored_SkColorType;
case kRGBA_1010102_SkColorType: return kRGBA_1010102_Stored_SkColorType;
case kRGB_101010x_SkColorType: return kRGB_101010x_Stored_SkColorType;
case kGray_8_SkColorType: return kGray_8_Stored_SkColorType;
case kRGBA_F16_SkColorType: return kRGBA_F16_Stored_SkColorType;
}
return kUnknown_Stored_SkColorType;
}
static SkColorType stored_to_live(unsigned stored) {
switch (stored) {
case kUnknown_Stored_SkColorType: return kUnknown_SkColorType;
case kAlpha_8_Stored_SkColorType: return kAlpha_8_SkColorType;
case kRGB_565_Stored_SkColorType: return kRGB_565_SkColorType;
case kARGB_4444_Stored_SkColorType: return kARGB_4444_SkColorType;
case kRGBA_8888_Stored_SkColorType: return kRGBA_8888_SkColorType;
case kRGB_888x_Stored_SkColorType: return kRGB_888x_SkColorType;
case kBGRA_8888_Stored_SkColorType: return kBGRA_8888_SkColorType;
case kRGBA_1010102_Stored_SkColorType: return kRGBA_1010102_SkColorType;
case kRGB_101010x_Stored_SkColorType: return kRGB_101010x_SkColorType;
case kIndex_8_Stored_SkColorType_DEPRECATED: return kUnknown_SkColorType;
case kGray_8_Stored_SkColorType: return kGray_8_SkColorType;
case kRGBA_F16_Stored_SkColorType: return kRGBA_F16_SkColorType;
}
return kUnknown_SkColorType;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
size_t SkImageInfo::computeByteSize(size_t rowBytes) const {
if (0 == fHeight) {
return 0;
}
SkSafeMath safe;
size_t bytes = safe.add(safe.mul(fHeight - 1, rowBytes),
safe.mul(fWidth, this->bytesPerPixel()));
return safe ? bytes : SK_MaxSizeT;
}
static bool alpha_type_is_valid(SkAlphaType alphaType) {
return (alphaType >= kUnknown_SkAlphaType) && (alphaType <= kLastEnum_SkAlphaType);
}
static bool color_type_is_valid(SkColorType colorType) {
return (colorType >= kUnknown_SkColorType) && (colorType <= kLastEnum_SkColorType);
}
SkImageInfo SkImageInfo::MakeS32(int width, int height, SkAlphaType at) {
return SkImageInfo(width, height, kN32_SkColorType, at,
SkColorSpace::MakeSRGB());
}
static const int kColorTypeMask = 0x0F;
static const int kAlphaTypeMask = 0x03;
void SkImageInfo::unflatten(SkReadBuffer& buffer) {
fWidth = buffer.read32();
fHeight = buffer.read32();
uint32_t packed = buffer.read32();
fColorType = stored_to_live((packed >> 0) & kColorTypeMask);
fAlphaType = (SkAlphaType)((packed >> 8) & kAlphaTypeMask);
buffer.validate(alpha_type_is_valid(fAlphaType) && color_type_is_valid(fColorType));
sk_sp<SkData> data = buffer.readByteArrayAsData();
fColorSpace = SkColorSpace::Deserialize(data->data(), data->size());
}
void SkImageInfo::flatten(SkWriteBuffer& buffer) const {
buffer.write32(fWidth);
buffer.write32(fHeight);
SkASSERT(0 == (fAlphaType & ~kAlphaTypeMask));
SkASSERT(0 == (fColorType & ~kColorTypeMask));
uint32_t packed = (fAlphaType << 8) | live_to_stored(fColorType);
buffer.write32(packed);
if (fColorSpace) {
sk_sp<SkData> data = fColorSpace->serialize();
if (data) {
buffer.writeDataAsByteArray(data.get());
} else {
buffer.writeByteArray(nullptr, 0);
}
} else {
sk_sp<SkData> data = SkData::MakeEmpty();
buffer.writeDataAsByteArray(data.get());
}
}
bool SkColorTypeValidateAlphaType(SkColorType colorType, SkAlphaType alphaType,
SkAlphaType* canonical) {
switch (colorType) {
case kUnknown_SkColorType:
alphaType = kUnknown_SkAlphaType;
break;
case kAlpha_8_SkColorType:
if (kUnpremul_SkAlphaType == alphaType) {
alphaType = kPremul_SkAlphaType;
}
// fall-through
case kARGB_4444_SkColorType:
case kRGBA_8888_SkColorType:
case kBGRA_8888_SkColorType:
case kRGBA_1010102_SkColorType:
case kRGBA_F16_SkColorType:
if (kUnknown_SkAlphaType == alphaType) {
return false;
}
break;
case kGray_8_SkColorType:
case kRGB_565_SkColorType:
case kRGB_888x_SkColorType:
case kRGB_101010x_SkColorType:
alphaType = kOpaque_SkAlphaType;
break;
default:
return false;
}
if (canonical) {
*canonical = alphaType;
}
return true;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
#include "SkReadPixelsRec.h"
bool SkReadPixelsRec::trim(int srcWidth, int srcHeight) {
if (nullptr == fPixels || fRowBytes < fInfo.minRowBytes()) {
return false;
}
if (0 >= fInfo.width() || 0 >= fInfo.height()) {
return false;
}
int x = fX;
int y = fY;
SkIRect srcR = SkIRect::MakeXYWH(x, y, fInfo.width(), fInfo.height());
if (!srcR.intersect(0, 0, srcWidth, srcHeight)) {
return false;
}
// if x or y are negative, then we have to adjust pixels
if (x > 0) {
x = 0;
}
if (y > 0) {
y = 0;
}
// here x,y are either 0 or negative
fPixels = ((char*)fPixels - y * fRowBytes - x * fInfo.bytesPerPixel());
// the intersect may have shrunk info's logical size
fInfo = fInfo.makeWH(srcR.width(), srcR.height());
fX = srcR.x();
fY = srcR.y();
return true;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
#include "SkWritePixelsRec.h"
bool SkWritePixelsRec::trim(int dstWidth, int dstHeight) {
if (nullptr == fPixels || fRowBytes < fInfo.minRowBytes()) {
return false;
}
if (0 >= fInfo.width() || 0 >= fInfo.height()) {
return false;
}
int x = fX;
int y = fY;
SkIRect dstR = SkIRect::MakeXYWH(x, y, fInfo.width(), fInfo.height());
if (!dstR.intersect(0, 0, dstWidth, dstHeight)) {
return false;
}
// if x or y are negative, then we have to adjust pixels
if (x > 0) {
x = 0;
}
if (y > 0) {
y = 0;
}
// here x,y are either 0 or negative
fPixels = ((const char*)fPixels - y * fRowBytes - x * fInfo.bytesPerPixel());
// the intersect may have shrunk info's logical size
fInfo = fInfo.makeWH(dstR.width(), dstR.height());
fX = dstR.x();
fY = dstR.y();
return true;
}
| 35.25641 | 99 | 0.626909 | CarbonBeta |
a3d7ddd41c0ec2bafd914e5cf0b186ae55adffe8 | 12,697 | cpp | C++ | thcrap/src/log.cpp | thpatch/thcrap | 251f1cad72adc175d77d8f4be9a6b1ec2d317fd7 | [
"Unlicense"
] | 359 | 2015-01-01T17:17:17.000Z | 2022-03-27T14:56:19.000Z | thcrap/src/log.cpp | thpatch/thcrap | 251f1cad72adc175d77d8f4be9a6b1ec2d317fd7 | [
"Unlicense"
] | 145 | 2015-05-01T05:53:31.000Z | 2022-03-31T13:32:53.000Z | thcrap/src/log.cpp | thpatch/thcrap | 251f1cad72adc175d77d8f4be9a6b1ec2d317fd7 | [
"Unlicense"
] | 43 | 2015-06-09T11:30:11.000Z | 2022-01-30T01:36:00.000Z | /**
* Touhou Community Reliant Automatic Patcher
* Main DLL
*
* ----
*
* Logging functions.
*/
#include "thcrap.h"
#include <io.h>
#include <fcntl.h>
#include <ThreadPool.h>
// -------
// Globals
// -------
static HANDLE log_file = INVALID_HANDLE_VALUE;
static bool console_open = false;
static ThreadPool *log_queue = NULL;
// For checking nested thcrap instances that access the same log file.
// We only want to print an error message for the first instance.
static HANDLE log_filemapping = INVALID_HANDLE_VALUE;
static const char LOG[] = "logs/thcrap_log.txt";
static const char LOG_ROTATED[] = "logs/thcrap_log.%d.txt";
static const int ROTATIONS = 5; // Number of backups to keep
static void (*log_print_hook)(const char*) = NULL;
static void(*log_nprint_hook)(const char*, size_t) = NULL;
static HWND mbox_owner_hwnd = NULL; // Set by log_mbox_set_owner
// -----------------------
struct lasterror_t {
char str[DECIMAL_DIGITS_BOUND(DWORD) + 1];
};
THREAD_LOCAL(lasterror_t, lasterror_tls, nullptr, nullptr);
const char* lasterror_str_for(DWORD err)
{
switch(err) {
case ERROR_SHARING_VIOLATION:
return "File in use";
case ERROR_MOD_NOT_FOUND:
return "File not found";
default: // -Wswitch...
break;
}
auto str = lasterror_tls_get();
if(!str) {
static lasterror_t lasterror_static;
str = &lasterror_static;
}
snprintf(str->str, sizeof(str->str), "%lu", err);
return str->str;
}
const char* lasterror_str()
{
return lasterror_str_for(GetLastError());
}
void log_set_hook(void(*print_hook)(const char*), void(*nprint_hook)(const char*,size_t)){
log_print_hook = print_hook;
log_nprint_hook = nprint_hook;
}
// Rotation
// --------
void log_fn_for_rotation(char *fn, int rotnum)
{
if(rotnum == 0) {
strcpy(fn, LOG);
} else {
sprintf(fn, LOG_ROTATED, rotnum);
}
}
void log_rotate(void)
{
size_t rot_fn_len = MAX(sizeof(LOG_ROTATED), sizeof(LOG));
VLA(char, rot_from, rot_fn_len);
VLA(char, rot_to, rot_fn_len);
for(int rotation = ROTATIONS; rotation > 0; rotation--) {
log_fn_for_rotation(rot_from, rotation - 1);
log_fn_for_rotation(rot_to, rotation);
MoveFileExU(rot_from, rot_to, MOVEFILE_REPLACE_EXISTING);
}
VLA_FREE(rot_from);
VLA_FREE(rot_to);
}
// --------
void log_print(const char *str)
{
if (log_queue) {
log_queue->enqueue([str = strdup(str)]() {
DWORD byteRet;
if (console_open) {
WriteFile(GetStdHandle(STD_OUTPUT_HANDLE), str, strlen(str), &byteRet, NULL);
}
if (log_file) {
WriteFile(log_file, str, strlen(str), &byteRet, NULL);
}
if (log_print_hook) {
log_print_hook(str);
}
free(str);
});
}
}
void log_print_fast(const char* str, size_t n) {
if (log_queue) {
log_queue->enqueue([str = strndup(str, n), n]() {
DWORD byteRet;
if (console_open) {
WriteFile(GetStdHandle(STD_OUTPUT_HANDLE), str, n, &byteRet, NULL);
}
if (log_file != INVALID_HANDLE_VALUE) {
WriteFile(log_file, str, n, &byteRet, NULL);
}
if (log_print_hook) {
log_print_hook(str);
}
free(str);
});
}
}
void log_nprint(const char *str, size_t n)
{
if (log_queue) {
log_queue->enqueue([str = strndup(str, n), n]() {
DWORD byteRet;
if (console_open) {
WriteFile(GetStdHandle(STD_OUTPUT_HANDLE), str, n, &byteRet, NULL);
}
if (log_file != INVALID_HANDLE_VALUE) {
WriteFile(log_file, str, n, &byteRet, NULL);
}
if (log_nprint_hook) {
log_nprint_hook(str, n);
}
free(str);
});
}
}
void log_vprintf(const char *format, va_list va)
{
va_list va2;
va_copy(va2, va);
const int total_size = vsnprintf(NULL, 0, format, va2);
va_end(va2);
if (total_size > 0) {
VLA(char, str, total_size + 1);
vsprintf(str, format, va);
log_print_fast(str, total_size);
VLA_FREE(str);
}
}
void log_printf(const char *format, ...)
{
va_list va;
va_start(va, format);
log_vprintf(format, va);
va_end(va);
}
/**
* Message box functions.
*/
struct EnumStatus
{
HWND hwnd;
int w;
int h;
};
static BOOL CALLBACK enumWindowProc(HWND hwnd, LPARAM lParam)
{
EnumStatus *status = (EnumStatus*)lParam;
if (!IsWindowVisible(hwnd)) {
return TRUE;
}
DWORD pid;
GetWindowThreadProcessId(hwnd, &pid);
if (pid != GetCurrentProcessId()) {
return TRUE;
}
RECT rect;
GetWindowRect(hwnd, &rect);
int w = rect.right - rect.left;
int h = rect.bottom - rect.top;
if (w * h > status->w * status->h) {
status->hwnd = hwnd;
}
return TRUE;
}
static HWND guess_mbox_owner()
{
// If an owner have been set, easy - just return it.
if (mbox_owner_hwnd) {
return mbox_owner_hwnd;
}
// Time to guess. If the current thread has an active window, it's probably a good window to steal.
HWND hwnd = GetActiveWindow();
if (hwnd) {
return hwnd;
}
// It's getting harder. Look at all the top-level visible windows of our processes, and take the biggest one.
EnumStatus status;
status.hwnd = nullptr;
status.w = 10; // Ignore windows smaller than 10x10
status.h = 10;
EnumWindows(enumWindowProc, (LPARAM)&status);
if (status.hwnd) {
return status.hwnd;
}
// Let's hope our process is allowed to take the focus.
return nullptr;
}
int log_mbox(const char *caption, const UINT type, const char *text)
{
log_printf(
"---------------------------\n"
"%s\n"
"---------------------------\n"
, text
);
return MessageBox(guess_mbox_owner(), text, (caption ? caption : PROJECT_NAME), type);
}
int log_vmboxf(const char *caption, const UINT type, const char *format, va_list va)
{
int ret = 0;
if(format) {
va_list va2;
va_copy(va2, va);
const int total_size = vsnprintf(NULL, 0, format, va2);
va_end(va2);
if (total_size > 0) {
VLA(char, formatted_str, total_size + 1);
vsprintf(formatted_str, format, va);
ret = log_mbox(caption, type, formatted_str);
VLA_FREE(formatted_str);
}
}
return ret;
}
int log_mboxf(const char *caption, const UINT type, const char *format, ...)
{
va_list va;
va_start(va, format);
int ret = log_vmboxf(caption, type, format, va);
va_end(va);
return ret;
}
void log_mbox_set_owner(HWND hwnd)
{
mbox_owner_hwnd = hwnd;
}
static void OpenConsole(void)
{
if(console_open) {
return;
}
AllocConsole();
// To match the behavior of the native Windows console, Wine additionally
// needs read rights because its WriteConsole() implementation calls
// GetConsoleMode(), and setvbuf() because… I don't know?
freopen("CONOUT$", "w+b", stdout);
setvbuf(stdout, NULL, _IONBF, 0);
/// This breaks all normal, unlogged printf() calls to stdout!
// _setmode(_fileno(stdout), _O_U16TEXT);
console_open = true;
}
/// Per-module loggers
/// ------------------
std::nullptr_t logger_t::verrorf(const char *format, va_list va) const
{
va_list va2;
va_copy(va2, va);
const int total_size = vsnprintf(NULL, 0, format, va2);
va_end(va2);
if (total_size > 0) {
VLA(char, formatted_str, total_size + 1 + prefix.length());
memcpy(formatted_str, prefix.data(), prefix.length());
vsprintf(formatted_str + prefix.length(), format, va);
log_mbox(err_caption, MB_OK | MB_ICONERROR, formatted_str);
VLA_FREE(formatted_str);
}
return nullptr;
}
std::nullptr_t logger_t::errorf(const char *format, ...) const
{
va_list va;
va_start(va, format);
auto ret = verrorf(format, va);
va_end(va);
return ret;
}
/// ------------------
void log_init(int console)
{
CreateDirectoryU("logs", NULL);
log_rotate();
// Using CreateFile, _open_osfhandle and _fdopen instead of plain fopen because we need the flag FILE_SHARE_DELETE for log rotation
log_file = CreateFileU(LOG, GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_DELETE, nullptr, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr);
log_queue = new ThreadPool(1);
#ifdef _DEBUG
OpenConsole();
#else
if(log_file) {
constexpr std::string_view DashUChar = u8"―";
const size_t line_len = (strlen(PROJECT_NAME) + strlen(" logfile")) * DashUChar.length();
VLA(char, line, line_len + 1);
line[line_len] = '\0';
for (size_t i = 0; i < line_len; i += DashUChar.length()) {
memcpy(&line[i], DashUChar.data(), DashUChar.length());
}
log_printf("%s\n", line);
log_printf("%s logfile\n", PROJECT_NAME);
log_printf("Branch: %s\n", PROJECT_BRANCH);
log_printf("Version: %s\n", PROJECT_VERSION_STRING);
{
const char* months[] = {
"Invalid",
"Jan",
"Feb",
"Mar",
"Apr",
"May",
"Jun",
"Jul",
"Aug",
"Sep",
"Oct",
"Nov",
"Dec"
};
SYSTEMTIME time;
GetSystemTime(&time);
if (time.wMonth > 12) time.wMonth = 0;
log_printf("Current time: %s %d %d %d:%d:%d\n",
months[time.wMonth], time.wDay, time.wYear,
time.wHour, time.wMinute, time.wSecond);
}
log_printf("Build time: " __DATE__ " " __TIME__ "\n");
#if defined(BUILDER_NAME_W)
{
const wchar_t *builder = BUILDER_NAME_W;
UTF8_DEC(builder);
UTF8_CONV(builder);
log_printf("Built by: %s\n", builder_utf8);
UTF8_FREE(builder);
}
#elif defined(BUILDER_NAME)
log_printf("Built by: %s\n", BUILDER_NAME);
#endif
log_printf("Command line: %s\n", GetCommandLineU());
log_print("\nSystem Information:\n");
{
char cpu_brand[48] = {};
__cpuidex((int*)cpu_brand, 0x80000002, 0);
__cpuidex((int*)cpu_brand + 4, 0x80000003, 0);
__cpuidex((int*)cpu_brand + 8, 0x80000004, 0);
log_printf("CPU: %s\n", cpu_brand);
}
{
MEMORYSTATUSEX ram_stats = { sizeof(MEMORYSTATUSEX) };
GlobalMemoryStatusEx(&ram_stats);
double ram_total = (double)ram_stats.ullTotalPhys;
int div_count_total = 0;
for (;;) {
int temp = (int)(ram_total / 1024.0f);
if (temp) {
ram_total = ram_total / 1024.0f;
div_count_total++;
}
else {
break;
}
}
double ram_left = (double)ram_stats.ullAvailPhys;
int div_count_left = 0;
for (;;) {
int temp = (int)(ram_left / 1024.0f);
if (temp) {
ram_left = ram_left / 1024.0f;
div_count_left++;
}
else {
break;
}
}
const char* size_units[] = {
"B",
"KiB",
"MiB",
"GiB",
"TiB",
"PiB"
};
log_printf("RAM: %.2f%s free out of %.1f%s, %d%% used\n",
ram_left, size_units[div_count_left],
ram_total, size_units[div_count_total],
ram_stats.dwMemoryLoad
);
}
log_printf("OS/Runtime: %s\n", windows_version());
log_printf("Code pages: ANSI=%u, OEM=%u\n", GetACP(), GetOEMCP());
log_print("\nScreens:\n");
{
DISPLAY_DEVICEA display_device = {};
display_device.cb = sizeof(display_device);
for (int i = 0;
EnumDisplayDevicesA(NULL, i, &display_device, EDD_GET_DEVICE_INTERFACE_NAME);
i++
)
{
if ((display_device.StateFlags | DISPLAY_DEVICE_ATTACHED_TO_DESKTOP)) {
DEVMODEA d;
d.dmSize = sizeof(d);
DISPLAY_DEVICEA mon = {};
mon.cb = sizeof(mon);
if (!EnumDisplayDevicesA(display_device.DeviceName, 0, &mon, EDD_GET_DEVICE_INTERFACE_NAME)) {
continue;
}
log_printf("%s on %s: ", mon.DeviceString, display_device.DeviceString);
EnumDisplaySettingsA(display_device.DeviceName, ENUM_CURRENT_SETTINGS, &d);
if ((d.dmFields & DM_PELSHEIGHT) && !(d.dmFields & DM_PAPERSIZE)) {
log_printf("%dx%d@%d %dHz\n", d.dmPelsWidth, d.dmPelsHeight, d.dmBitsPerPel, d.dmDisplayFrequency);
}
}
}
}
log_printf("%s\n\n", line);
FlushFileBuffers(log_file);
VLA_FREE(line);
}
if (console) {
OpenConsole();
}
#endif
size_t cur_dir_len = GetCurrentDirectoryU(0, nullptr);
size_t full_fn_len = cur_dir_len + sizeof(LOG);
VLA(char, full_fn, full_fn_len);
defer(VLA_FREE(full_fn));
GetCurrentDirectoryU(cur_dir_len, full_fn);
full_fn[cur_dir_len - 1] = '/';
full_fn[cur_dir_len] = '\0';
str_slash_normalize(full_fn); // Necessary!
memcpy(full_fn + cur_dir_len, LOG, sizeof(LOG));
log_filemapping = CreateFileMappingU(
INVALID_HANDLE_VALUE, nullptr, PAGE_READWRITE, 0, 1, full_fn
);
if(log_file == INVALID_HANDLE_VALUE && GetLastError() != ERROR_ALREADY_EXISTS) {
auto ret = log_mboxf(nullptr, MB_OKCANCEL | MB_ICONHAND,
"Error creating %s: %s\n"
"\n"
"Logging will be unavailable. "
"Further writes to this directory are likely to fail as well. "
"Moving %s to a different directory will probably fix this.\n"
"\n"
"Continue?",
full_fn, strerror(errno), PROJECT_NAME_SHORT
);
if(ret == IDCANCEL) {
auto pExitProcess = ((void (TH_STDCALL*)(UINT))detour_top(
"kernel32.dll", "ExitProcess", (FARPROC)thcrap_ExitProcess
));
pExitProcess(-1);
}
}
}
void log_exit(void)
{
// Run the destructor to ensure all remaining log messages were printed
delete log_queue;
if(console_open)
FreeConsole();
if(log_file) {
CloseHandle(log_filemapping);
CloseHandle(log_file);
log_file = INVALID_HANDLE_VALUE;
}
}
| 23.866541 | 137 | 0.664015 | thpatch |
a3da4e57b81d8242d0186108d50167262b330b48 | 1,873 | cpp | C++ | korus/src/tcp/tcp_helper.cpp | zjkw/konus | fb8c6f54cf481454d2d66129505efb11bf534994 | [
"MIT"
] | 13 | 2017-10-24T08:50:28.000Z | 2019-11-02T01:15:26.000Z | korus/src/tcp/tcp_helper.cpp | zjkw/konus | fb8c6f54cf481454d2d66129505efb11bf534994 | [
"MIT"
] | null | null | null | korus/src/tcp/tcp_helper.cpp | zjkw/konus | fb8c6f54cf481454d2d66129505efb11bf534994 | [
"MIT"
] | null | null | null | #include <fcntl.h>
#include <unistd.h>
#include "tcp_helper.h"
SOCKET create_tcp_origin_sock()
{
return ::socket(AF_INET, SOCK_STREAM | SOCK_NONBLOCK | SOCK_CLOEXEC, IPPROTO_TCP);
}
bool set_linger_sock(SOCKET fd, int onoff, int linger)
{
struct linger slinger;
slinger.l_onoff = onoff ? 1 : 0;
slinger.l_linger = linger;
return !setsockopt(fd, SOL_SOCKET, SO_LINGER, (const char *)(&slinger), sizeof(slinger));
}
SOCKET create_tcp_socket(const struct sockaddr_in& addr)
{
/* Request socket. */
SOCKET s = create_tcp_origin_sock();
if (s == INVALID_SOCKET)
{
return INVALID_SOCKET;
}
/* set nonblock */
if (!set_nonblock_sock(s, 1))
{
close(s);
return INVALID_SOCKET;
}
if (!set_linger_sock(s, 1, 0))
{
close(s);
return INVALID_SOCKET;
}
return s;
}
bool set_defer_accept_sock(SOCKET fd, int32_t defer)
{
int val = defer != 0 ? 1 : 0;
int len = sizeof(val);
return 0 == setsockopt(fd, /*SOL_TCP*/IPPROTO_TCP, defer, (const char*)&val, len);
}
bool listen_sock(SOCKET fd, int backlog)
{
return !::listen(fd, backlog);
}
SOCKET listen_nonblock_reuse_socket(uint32_t backlog, uint32_t defer_accept, const struct sockaddr_in& addr)
{
/* Request socket. */
SOCKET s = create_tcp_socket(addr);
if (s == INVALID_SOCKET)
{
return INVALID_SOCKET;
}
if (defer_accept && !set_defer_accept_sock(s, defer_accept))
{
close(s);
return INVALID_SOCKET;
}
if (!set_reuse_addr_sock(s, 1))
{
close(s);
return INVALID_SOCKET;
}
if (!set_reuse_port_sock(s, 1))
{
close(s);
return INVALID_SOCKET;
}
if (!bind_sock(s, addr))
{
close(s);
return false;
}
if (!listen_sock(s, backlog))
{
close(s);
return false;
}
return s;
}
SOCKET accept_sock(SOCKET fd, struct sockaddr_in* addr)
{
socklen_t l = sizeof(struct sockaddr_in);
return accept4(fd, (struct sockaddr*)addr, &l, SOCK_NONBLOCK | SOCK_CLOEXEC);
}
| 18.184466 | 108 | 0.691404 | zjkw |
a3dfe593f9eeb59715fa46f302d216d959b755d3 | 46,253 | cpp | C++ | src/fileformat/types/dotnet_types/dotnet_type_reconstructor.cpp | nimeshvaghasiya/retdec | 30b3cb3402fe59d992bf0558681f051bcd7f7849 | [
"MIT",
"BSD-3-Clause"
] | 1 | 2019-01-25T13:31:44.000Z | 2019-01-25T13:31:44.000Z | src/fileformat/types/dotnet_types/dotnet_type_reconstructor.cpp | nimeshvaghasiya/retdec | 30b3cb3402fe59d992bf0558681f051bcd7f7849 | [
"MIT",
"BSD-3-Clause"
] | null | null | null | src/fileformat/types/dotnet_types/dotnet_type_reconstructor.cpp | nimeshvaghasiya/retdec | 30b3cb3402fe59d992bf0558681f051bcd7f7849 | [
"MIT",
"BSD-3-Clause"
] | 1 | 2019-03-24T03:45:30.000Z | 2019-03-24T03:45:30.000Z | /**
* @file src/fileformat/types/dotnet_types/dotnet_type_reconstructor.cpp
* @brief Class for .NET reconstructor.
* @copyright (c) 2017 Avast Software, licensed under the MIT license
*/
#include <iostream>
#include "retdec/utils/conversion.h"
#include "retdec/utils/string.h"
#include "retdec/fileformat/types/dotnet_headers/metadata_tables.h"
#include "retdec/fileformat/types/dotnet_types/dotnet_data_types.h"
#include "retdec/fileformat/types/dotnet_types/dotnet_field.h"
#include "retdec/fileformat/types/dotnet_types/dotnet_type_reconstructor.h"
namespace retdec {
namespace fileformat {
namespace
{
/**
* Signature constants.
*/
const std::uint8_t FieldSignature = 0x06; ///< Field signature.
const std::uint8_t PropertySignature = 0x08; ///< Property signature.
const std::uint8_t HasThis = 0x20; ///< Flag indicating whether the method/property is static or not (has this).
const std::uint8_t Generic = 0x10; ///< Flag indicating whether the method is generic or not.
/**
* Decodes unsigned integer out of the signature.
* @param data Signature data.
* @param [out] bytesRead Amount of bytes read out of signature.
* @return Decoded unsigned integer.
*/
std::uint64_t decodeUnsigned(const std::vector<std::uint8_t>& data, std::uint64_t& bytesRead)
{
std::uint64_t result = 0;
bytesRead = 0;
// If highest bit not set, it is 1-byte number
if ((data[0] & 0x80) == 0)
{
if (data.size() < 1)
return result;
result = data[0];
bytesRead = 1;
}
// If highest bit set and second highest not set, it is 2-byte number
else if ((data[0] & 0xC0) == 0x80)
{
if (data.size() < 2)
return result;
result = ((static_cast<std::uint64_t>(data[0]) & 0x3F) << 8)
| data[1];
bytesRead = 2;
}
// If highest bit and second highest are set and third bit is not set, it is 4-byte number
else if ((data[0] & 0xE0) == 0xC0)
{
if (data.size() < 4)
return result;
result = ((static_cast<std::uint64_t>(data[0]) & 0x1F) << 24)
| (static_cast<std::uint64_t>(data[1]) << 16)
| (static_cast<std::uint64_t>(data[2]) << 8)
| data[3];
bytesRead = 4;
}
return result;
}
/**
* Decodes signed integer out of the signature.
* @param data Signature data.
* @param [out] bytesRead Amount of bytes read out of signature.
* @return Decoded signed integer.
*/
std::int64_t decodeSigned(const std::vector<std::uint8_t>& data, std::uint64_t& bytesRead)
{
std::int64_t result = 0;
bytesRead = 0;
// If highest bit not set, it is 1-byte number
if ((data[0] & 0x80) == 0)
{
if (data.size() < 1)
return result;
std::int8_t result8 = (data[0] & 0x01 ? 0x80 : 0x00)
| static_cast<std::uint64_t>(data[0]);
result = result8 >> 1;
bytesRead = 1;
}
// If highest bit set and second highest not set, it is 2-byte number
else if ((data[0] & 0xC0) == 0x80)
{
if (data.size() < 2)
return result;
std::int16_t result16 = (data[1] & 0x01 ? 0xC000 : 0x0000)
| ((static_cast<std::uint64_t>(data[0]) & 0x1F) << 8)
| static_cast<std::uint64_t>(data[1]);
result = result16 >> 1;
bytesRead = 2;
}
// If highest bit and second highest are set and third bit is not set, it is 4-byte number
else if ((data[0] & 0xE0) == 0xC0)
{
if (data.size() < 4)
return result;
std::int32_t result32 = (data[3] & 0x01 ? 0xE0000000 : 0x00000000)
| ((static_cast<std::uint64_t>(data[0]) & 0x0F) << 24)
| (static_cast<std::uint64_t>(data[1]) << 16)
| (static_cast<std::uint64_t>(data[2]) << 8)
| static_cast<std::uint64_t>(data[3]);
result = result32 >> 1;
bytesRead = 4;
}
return result;
}
/**
* Extracts the classes from the class table.
* @param classTable Class table.
* @return Classes in form of list.
*/
auto classesFromTable(const DotnetTypeReconstructor::ClassTable& classTable)
{
DotnetTypeReconstructor::ClassList classes;
classes.reserve(classTable.size());
for (auto& kv : classTable)
classes.push_back(kv.second);
return classes;
}
/**
* Extracts the generic parameter count out of class name that is stored in metadata tables.
* Class names encode this information in form of "ClassName`N" where N is number of generic parameters.
* @param className Class name.
* @return Number of generic parameters.
*/
std::uint64_t extractGenericParamsCountAndFixClassName(std::string& className)
{
// Generic types end with `N where N is number of generic parameters
std::uint64_t genericParamsCount = 0;
auto isGenericPos = className.find('`');
if (isGenericPos != std::string::npos)
{
// Obtain number of generic parameters
retdec::utils::strToNum(className.substr(isGenericPos + 1), genericParamsCount);
// Remove `N part
className.erase(isGenericPos);
}
return genericParamsCount;
}
/**
* Transforms metadata table record to visibility.
* @param source Metadata table record.
* @return Visibility.
*/
template <typename T>
DotnetTypeVisibility toTypeVisibility(const T* source)
{
if (source->isPublic())
return DotnetTypeVisibility::Public;
else if (source->isProtected())
return DotnetTypeVisibility::Protected;
else if (source->isPrivate())
return DotnetTypeVisibility::Private;
else
return DotnetTypeVisibility::Private;
}
template <>
DotnetTypeVisibility toTypeVisibility<TypeDef>(const TypeDef* source)
{
if (source->isPublic() || source->isNestedPublic())
return DotnetTypeVisibility::Public;
else if (source->isNestedProtected())
return DotnetTypeVisibility::Protected;
else if (source->isNonPublic() || source->isNestedPrivate())
return DotnetTypeVisibility::Private;
else
return DotnetTypeVisibility::Private;
}
}
/**
* Constructor.
* @param metadata Metadata stream.
* @param strings String stream.
* @param blob Blob stream.
*/
DotnetTypeReconstructor::DotnetTypeReconstructor(const MetadataStream* metadata, const StringStream* strings, const BlobStream* blob)
: metadataStream(metadata), stringStream(strings), blobStream(blob), defClassTable(), refClassTable(), methodTable(),
classToMethodTable(), methodReturnTypeAndParamTypeTable()
{
}
/**
* Reconstructs classes, methods, fields, properties and class hierarchy.
* @return @c true if reconstruction was successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstruct()
{
if (!metadataStream || !stringStream || !blobStream)
return false;
// Order matters here, because some stages of reconstruction need to have information from previous stages
// Required conditions are:
// - Reconstruction of generic parameters needs to known which classes and methods are defined
// - Reconstruction of method parameters needs to known which generic parameters exist
// - Reconstruction of fields and properties needs to know which classes are defined and which generic parameters they contain
// - Reconstruction of nested classes and base types needs to know all the classes that are defined
return reconstructClasses()
&& reconstructMethods()
&& reconstructGenericParameters()
&& reconstructMethodParameters()
&& reconstructFields()
&& reconstructProperties()
&& reconstructNestedClasses()
&& reconstructBaseTypes();
}
/**
* Returns the defined classes.
* @return Defined classes.
*/
DotnetTypeReconstructor::ClassList DotnetTypeReconstructor::getDefinedClasses() const
{
return classesFromTable(defClassTable);
}
/**
* Returns the referenced (imported) classes.
* @return Referenced (imported) classes.
*/
DotnetTypeReconstructor::ClassList DotnetTypeReconstructor::getReferencedClasses() const
{
return classesFromTable(refClassTable);
}
/**
* Links referenced (imported) classes.
*/
void DotnetTypeReconstructor::linkReconstructedClasses()
{
std::vector<bool> visited (refClassTable.size(), false);
std::vector<bool> stack (refClassTable.size(), false);
auto typeRefTable = static_cast<const MetadataTable<TypeRef>*>(metadataStream->getMetadataTable(MetadataTableType::TypeRef));
if (!typeRefTable)
{
return;
}
auto refClasses = getReferencedClasses();
for (size_t i = 1; i < refClasses.size(); i++)
{
linkReconstructedClassesDo(i, visited, stack, refClasses, typeRefTable);
}
for (size_t i = 1; i < refClasses.size(); i++)
{
auto t = refClasses[i];
}
}
/**
* Helper function for linkReconstructedClasses()
* @param i Index of a class to be linked.
* @param visited Visited flags for cyclic linkage detection.
* @param stack Recent traversal stack for cyclic linkage detection.
* @param refClasses List of imported classes.
* @param typeRefTable Typeref table.
*/
void DotnetTypeReconstructor::linkReconstructedClassesDo(size_t i, std::vector<bool> &visited, std::vector<bool> &stack,
ClassList &refClasses, const MetadataTable<TypeRef>* typeRefTable)
{
if (visited[i])
{
return;
}
visited[i] = true;
auto typeRef = refClasses[i];
auto typeRefRaw = typeRef->getRawTypeRef();
MetadataTableType resolutionScopeType;
if (!typeRefRaw || !typeRefRaw->resolutionScope.getTable(resolutionScopeType) ||
resolutionScopeType != MetadataTableType::TypeRef)
{
return;
}
auto parentRaw = typeRefTable->getRow(typeRefRaw->resolutionScope.getIndex());
if (!parentRaw)
{
return;
}
const DotnetClass *parent = nullptr;
size_t parentI = 1;
while (parentI < refClasses.size())
{
auto parentInRefClasses = refClasses[parentI];
if (parentInRefClasses->getRawTypeRef() == parentRaw)
{
parent = parentInRefClasses.get();
break;
}
parentI++;
}
stack[i] = true;
if (!parent || stack[parentI])
{
stack[i] = false;
return;
}
typeRef->setParent(parent);
linkReconstructedClassesDo(parentI, visited, stack, refClasses, typeRefTable);
stack[i] = false;
}
/**
* Reconstructs defined and referenced (imported) classes and interfaces.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructClasses()
{
auto typeDefTable = static_cast<const MetadataTable<TypeDef>*>(metadataStream->getMetadataTable(MetadataTableType::TypeDef));
auto typeRefTable = static_cast<const MetadataTable<TypeRef>*>(metadataStream->getMetadataTable(MetadataTableType::TypeRef));
auto fieldTable = static_cast<const MetadataTable<Field>*>(metadataStream->getMetadataTable(MetadataTableType::Field));
auto methodDefTable = static_cast<const MetadataTable<MethodDef>*>(metadataStream->getMetadataTable(MetadataTableType::MethodDef));
if (typeDefTable == nullptr || typeRefTable == nullptr)
return false;
// Reconstruct defined classes from TypeDef table
for (std::size_t i = 1; i <= typeDefTable->getNumberOfRows(); ++i)
{
auto typeDef = static_cast<const TypeDef*>(typeDefTable->getRow(i));
std::size_t fieldsCount = 0;
std::size_t methodsCount = 0;
// Field & method count needs to be determined based on index the following record in the table stores
// We use size of the referenced table for the last record
auto nextTypeDef = typeDefTable->getRow(i + 1);
// Obtain number of fields if there are any
if (fieldTable && typeDef->fieldList.getIndex() <= fieldTable->getSize())
{
fieldsCount = nextTypeDef
? nextTypeDef->fieldList.getIndex() - typeDef->fieldList.getIndex()
: fieldTable->getSize() - typeDef->fieldList.getIndex() + 1;
}
// Obtain number of methods if there are any
if (methodDefTable && typeDef->methodList.getIndex() <= methodDefTable->getSize())
{
methodsCount = nextTypeDef
? nextTypeDef->methodList.getIndex() - typeDef->methodList.getIndex()
: methodDefTable->getSize() - typeDef->methodList.getIndex() + 1;
}
auto newClass = createClassDefinition(typeDef, fieldsCount, methodsCount, i);
if (newClass == nullptr)
continue;
defClassTable.emplace(i, std::move(newClass));
}
// Reconstruct referenced classes from TypeRef table
for (std::size_t i = 1; i <= typeRefTable->getNumberOfRows(); ++i)
{
auto typeRef = typeRefTable->getRow(i);
auto newClass = createClassReference(typeRef, i);
if (newClass == nullptr)
continue;
refClassTable.emplace(i, std::move(newClass));
}
linkReconstructedClasses();
return true;
}
/**
* Reconstructs methods in the classes and interfaces. Method parameters are not reconstructed here.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructMethods()
{
auto methodDefTable = static_cast<const MetadataTable<MethodDef>*>(metadataStream->getMetadataTable(MetadataTableType::MethodDef));
if (methodDefTable == nullptr)
return true;
for (const auto& kv : defClassTable)
{
// Obtain TypeDef from the class
const auto& classType = kv.second;
auto typeDef = classType->getRawTypeDef();
auto methodStartIndex = typeDef->methodList.getIndex();
for (auto i = methodStartIndex; i < methodStartIndex + classType->getDeclaredMethodsCount(); ++i)
{
auto methodDef = methodDefTable->getRow(i);
if (methodDef == nullptr)
break;
auto newMethod = createMethod(methodDef, classType.get());
if (newMethod == nullptr)
continue;
// Place method into method table so we can later associate its table index with DotnetMethod object
methodTable.emplace(i, newMethod.get());
// Do not add method to the class yet, because we don't know if return type and parameter are OK
classToMethodTable[classType.get()].push_back(std::move(newMethod));
}
}
return true;
}
/**
* Reconstructs generic parameters of classes and methods.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructGenericParameters()
{
auto genericParamTable = static_cast<const MetadataTable<GenericParam>*>(metadataStream->getMetadataTable(MetadataTableType::GenericParam));
if (genericParamTable == nullptr)
return true;
for (const auto& genericParam : *genericParamTable)
{
// Obtain generic parameter name
std::string genericParamName;
if (!stringStream->getString(genericParam.name.getIndex(), genericParamName))
continue;
genericParamName = retdec::utils::replaceNonprintableChars(genericParamName);
// Generic parameter points either to TypeDef or MethodDef table depending on what it belongs to
MetadataTableType classOrMethod;
if (!genericParam.owner.getTable(classOrMethod))
continue;
if (classOrMethod == MetadataTableType::TypeDef)
{
auto itr = defClassTable.find(genericParam.owner.getIndex());
if (itr == defClassTable.end())
continue;
itr->second->addGenericParameter(std::move(genericParamName));
}
else if (classOrMethod == MetadataTableType::MethodDef)
{
auto itr = methodTable.find(genericParam.owner.getIndex());
if (itr == methodTable.end())
continue;
itr->second->addGenericParameter(std::move(genericParamName));
}
}
return true;
}
/**
* Reconstructs parameters of methods.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructMethodParameters()
{
auto paramTable = static_cast<const MetadataTable<Param>*>(metadataStream->getMetadataTable(MetadataTableType::Param));
if (paramTable == nullptr)
return true;
// We need to iterate over classes because we need to know the owner of every single method
for (const auto& kv : defClassTable)
{
const auto& classType = kv.second;
// Now iterate over all methods
for (auto&& method : classToMethodTable[classType.get()])
{
// Obtain postponed signature
// We now know all the information required for method parameters reconstruction
auto methodDef = method->getRawRecord();
auto signature = methodReturnTypeAndParamTypeTable[method.get()];
// Reconstruct return type
auto returnType = dataTypeFromSignature(signature, classType.get(), method.get());
if (returnType == nullptr)
continue;
method->setReturnType(std::move(returnType));
// Reconstruct parameters
bool methodOk = true;
auto startIndex = methodDef->paramList.getIndex();
for (auto i = startIndex; i < startIndex + method->getDeclaredParametersCount(); ++i)
{
auto param = paramTable->getRow(i);
if (param == nullptr)
break;
auto newParam = createMethodParameter(param, classType.get(), method.get(), signature);
if (newParam == nullptr)
{
methodOk = false;
break;
}
method->addParameter(std::move(newParam));
}
// Now we can add method to class
if (methodOk)
classType->addMethod(std::move(method));
}
}
return true;
}
/**
* Reconstructs fields of classes.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructFields()
{
auto fieldTable = static_cast<const MetadataTable<Field>*>(metadataStream->getMetadataTable(MetadataTableType::Field));
if (fieldTable == nullptr)
return true;
for (const auto& kv : defClassTable)
{
const auto& classType = kv.second;
auto typeDef = classType->getRawTypeDef();
auto fieldStartIndex = typeDef->fieldList.getIndex();
for (auto i = fieldStartIndex; i < fieldStartIndex + classType->getDeclaredFieldsCount(); ++i)
{
auto field = fieldTable->getRow(i);
if (field == nullptr)
break;
auto newField = createField(field, classType.get());
if (newField == nullptr)
continue;
classType->addField(std::move(newField));
}
}
return true;
}
/**
* Reconstructs fields of classes.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructProperties()
{
// Properties does not have very nice structure and cannot be easily reconstructed
// Their reconstruction needs to be done using two tables Property and PropertyMap
// Property table contains information about every single property, however it does not contain the reference to the class it belongs to
// PropertyMap table actually contains mapping of properties to classes
auto propertyTable = static_cast<const MetadataTable<Property>*>(metadataStream->getMetadataTable(MetadataTableType::Property));
auto propertyMapTable = static_cast<const MetadataTable<PropertyMap>*>(metadataStream->getMetadataTable(MetadataTableType::PropertyMap));
if (propertyTable == nullptr || propertyMapTable == nullptr)
return true;
for (std::size_t i = 1; i <= propertyMapTable->getNumberOfRows(); ++i)
{
auto propertyMap = propertyMapTable->getRow(i);
// First obtain owning class
auto ownerIndex = propertyMap->parent.getIndex();
auto itr = defClassTable.find(ownerIndex);
if (itr == defClassTable.end())
{
continue;
}
const auto& ownerClass = itr->second;
// Property count needs to be determined based on index the following record in the table stores
// We use size of the table for the last record
auto nextPropertyMap = propertyMapTable->getRow(i + 1);
auto propertyCount = nextPropertyMap
? nextPropertyMap->propertyList.getIndex() - propertyMap->propertyList.getIndex()
: propertyTable->getSize() - propertyMap->propertyList.getIndex() + 1;
auto startIndex = propertyMap->propertyList.getIndex();
for (std::size_t propertyIndex = startIndex; propertyIndex < startIndex + propertyCount; ++propertyIndex)
{
auto property = propertyTable->getRow(propertyIndex);
if (property == nullptr)
break;
auto newProperty = createProperty(property, ownerClass.get());
if (newProperty == nullptr)
continue;
ownerClass->addProperty(std::move(newProperty));
}
}
return true;
}
/**
* Reconstructs namespaces of nested classes.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructNestedClasses()
{
// Nested classes does not have proper namespaces set so we need to fix them
auto nestedClassTable = static_cast<const MetadataTable<NestedClass>*>(metadataStream->getMetadataTable(MetadataTableType::NestedClass));
if (nestedClassTable == nullptr)
return true;
for (std::size_t i = 1; i <= nestedClassTable->getNumberOfRows(); ++i)
{
auto nestedClass = nestedClassTable->getRow(i);
auto nestedItr = defClassTable.find(nestedClass->nestedClass.getIndex());
if (nestedItr == defClassTable.end())
continue;
auto enclosingItr = defClassTable.find(nestedClass->enclosingClass.getIndex());
if (enclosingItr == defClassTable.end())
continue;
nestedItr->second->setNameSpace(enclosingItr->second->getFullyQualifiedName());
}
return true;
}
/**
* Reconstructs base types of classes.
* @return @c true if reconstruction successful, otherwise @c false.
*/
bool DotnetTypeReconstructor::reconstructBaseTypes()
{
// Even though CLI does not support multiple inheritance, any class can still implement more than one interface
auto typeSpecTable = static_cast<const MetadataTable<TypeSpec>*>(metadataStream->getMetadataTable(MetadataTableType::TypeSpec));
// First reconstruct classic inheritance
for (const auto& kv : defClassTable)
{
const auto& classType = kv.second;
std::unique_ptr<DotnetDataTypeBase> baseType;
auto typeDef = classType->getRawTypeDef();
MetadataTableType extendsTable;
if (!typeDef->extends.getTable(extendsTable))
continue;
if (extendsTable == MetadataTableType::TypeDef)
{
auto itr = defClassTable.find(typeDef->extends.getIndex());
if (itr == defClassTable.end())
continue;
baseType = std::make_unique<DotnetDataTypeClass>(itr->second.get());
}
else if (extendsTable == MetadataTableType::TypeRef)
{
auto itr = refClassTable.find(typeDef->extends.getIndex());
if (itr == refClassTable.end())
continue;
baseType = std::make_unique<DotnetDataTypeClass>(itr->second.get());
}
else if (typeSpecTable && extendsTable == MetadataTableType::TypeSpec)
{
// TypeSpec table is used when class inherits from some generic type like Class<T>, Class<int> or similar
auto typeSpec = typeSpecTable->getRow(typeDef->extends.getIndex());
if (typeSpec == nullptr)
continue;
auto signature = blobStream->getElement(typeSpec->signature.getIndex());
baseType = dataTypeFromSignature(signature, classType.get(), nullptr);
if (baseType == nullptr)
continue;
}
else
continue;
classType->addBaseType(std::move(baseType));
}
// Reconstruct interface implementations from InterfaceImpl table
auto interfaceImplTable = static_cast<const MetadataTable<InterfaceImpl>*>(metadataStream->getMetadataTable(MetadataTableType::InterfaceImpl));
if (interfaceImplTable == nullptr)
return true;
for (std::size_t i = 1; i <= interfaceImplTable->getSize(); ++i)
{
auto interfaceImpl = interfaceImplTable->getRow(i);
if (interfaceImpl == nullptr)
continue;
std::unique_ptr<DotnetDataTypeBase> baseType;
auto itr = defClassTable.find(interfaceImpl->classType.getIndex());
if (itr == defClassTable.end())
continue;
MetadataTableType interfaceTable;
if (!interfaceImpl->interfaceType.getTable(interfaceTable))
continue;
if (interfaceTable == MetadataTableType::TypeDef)
{
auto itr = defClassTable.find(interfaceImpl->interfaceType.getIndex());
if (itr == defClassTable.end())
continue;
baseType = std::make_unique<DotnetDataTypeClass>(itr->second.get());
}
else if (interfaceTable == MetadataTableType::TypeRef)
{
auto itr = refClassTable.find(interfaceImpl->interfaceType.getIndex());
if (itr == refClassTable.end())
continue;
baseType = std::make_unique<DotnetDataTypeClass>(itr->second.get());
}
else if (typeSpecTable && interfaceTable == MetadataTableType::TypeSpec)
{
// TypeSpec table is used when class implements some generic interface like Interface<T>, Interface<int> or similar
auto typeSpec = typeSpecTable->getRow(interfaceImpl->interfaceType.getIndex());
if (typeSpec == nullptr)
continue;
auto signature = blobStream->getElement(typeSpec->signature.getIndex());
baseType = dataTypeFromSignature(signature, itr->second.get(), nullptr);
if (baseType == nullptr)
continue;
}
else
continue;
itr->second->addBaseType(std::move(baseType));
}
return true;
}
/**
* Creates new class definition from TypeDef table record.
* @param typeDef TypeDef table record.
* @param fieldsCount Declared number of fields.
* @param methodsCount Declared number of methods.
* @param typeDefIndex Index of TypeDef record.
* @return New class definition or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetClass> DotnetTypeReconstructor::createClassDefinition(const TypeDef* typeDef, std::size_t fieldsCount,
std::size_t methodsCount, std::size_t typeDefIndex)
{
std::string className, classNameSpace;
if (!stringStream->getString(typeDef->typeName.getIndex(), className) || !stringStream->getString(typeDef->typeNamespace.getIndex(), classNameSpace))
return nullptr;
className = retdec::utils::replaceNonprintableChars(className);
classNameSpace = retdec::utils::replaceNonprintableChars(classNameSpace);
auto genericParamsCount = extractGenericParamsCountAndFixClassName(className);
// Skip this special type, it seems to be used in C# binaries
if (className.empty() || className == "<Module>")
return nullptr;
auto newClass = std::make_unique<DotnetClass>(MetadataTableType::TypeDef, typeDefIndex);
newClass->setRawRecord(typeDef);
newClass->setName(className);
newClass->setNameSpace(classNameSpace);
newClass->setVisibility(toTypeVisibility(typeDef));
newClass->setIsInterface(typeDef->isInterface());
newClass->setIsAbstract(typeDef->isAbstract());
newClass->setIsSealed(typeDef->isSealed());
newClass->setDeclaredFieldsCount(fieldsCount);
newClass->setDeclaredMethodsCount(methodsCount);
newClass->setDeclaredGenericParametersCount(genericParamsCount);
return newClass;
}
/**
* Creates new class reference from TypeRef table record.
* @param typeRef TypeRef table record.
* @param typeRefIndex Index of typeRef table record.
* @return New class reference or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetClass> DotnetTypeReconstructor::createClassReference(const TypeRef* typeRef, std::size_t typeRefIndex)
{
std::string className, classNameSpace, classLibName;
MetadataTableType resolutionScopeType;
if (!stringStream->getString(typeRef->typeName.getIndex(), className) ||
!stringStream->getString(typeRef->typeNamespace.getIndex(), classNameSpace))
{
return nullptr;
}
if (!typeRef->resolutionScope.getTable(resolutionScopeType) || resolutionScopeType != MetadataTableType::AssemblyRef)
{
classLibName = "";
}
else
{
auto assemblyRefTable = static_cast<const MetadataTable<AssemblyRef>*>(metadataStream->getMetadataTable(MetadataTableType::AssemblyRef));
auto assemblyRef = assemblyRefTable->getRow(typeRef->resolutionScope.getIndex());
if (!assemblyRef || !stringStream->getString(assemblyRef->name.getIndex(), classLibName))
{
classLibName = "";
}
}
className = retdec::utils::replaceNonprintableChars(className);
classNameSpace = retdec::utils::replaceNonprintableChars(classNameSpace);
classLibName = retdec::utils::replaceNonprintableChars(classLibName);
auto genericParamsCount = extractGenericParamsCountAndFixClassName(className);
if (className.empty())
{
return nullptr;
}
auto newClass = std::make_unique<DotnetClass>(MetadataTableType::TypeRef, typeRefIndex);
newClass->setRawRecord(typeRef);
newClass->setName(className);
newClass->setNameSpace(classNameSpace);
newClass->setLibName(classLibName);
newClass->setDeclaredGenericParametersCount(genericParamsCount);
return newClass;
}
/**
* Creates new field from Field table record.
* @param field Field table record.
* @param ownerClass Owning class.
* @return New field or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetField> DotnetTypeReconstructor::createField(const Field* field, const DotnetClass* ownerClass)
{
std::string fieldName;
if (!stringStream->getString(field->name.getIndex(), fieldName))
return nullptr;
fieldName = retdec::utils::replaceNonprintableChars(fieldName);
auto signature = blobStream->getElement(field->signature.getIndex());
if (signature.empty() || signature[0] != FieldSignature)
return nullptr;
signature.erase(signature.begin(), signature.begin() + 1);
auto type = dataTypeFromSignature(signature, ownerClass, nullptr);
if (type == nullptr)
return nullptr;
auto newField = std::make_unique<DotnetField>();
newField->setName(fieldName);
newField->setNameSpace(ownerClass->getFullyQualifiedName());
newField->setVisibility(toTypeVisibility(field));
newField->setDataType(std::move(type));
newField->setIsStatic(field->isStatic());
return newField;
}
/**
* Creates new property from Property table record.
* @param property Property table record.
* @param ownerClass Owning class.
* @return New property or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetProperty> DotnetTypeReconstructor::createProperty(const Property* property, const DotnetClass* ownerClass)
{
std::string propertyName;
if (!stringStream->getString(property->name.getIndex(), propertyName))
return nullptr;
propertyName = retdec::utils::replaceNonprintableChars(propertyName);
auto signature = blobStream->getElement(property->type.getIndex());
if (signature.size() < 2 || (signature[0] & ~HasThis) != PropertySignature)
return nullptr;
bool hasThis = signature[0] & HasThis;
// Delete two bytes because the first is 0x08 (or 0x28 if HASTHIS is set) and the other one is number of parameters
// This seems like a weird thing, because I don't think that C# allows any parameters in getters/setters and therefore this will always be 0
signature.erase(signature.begin(), signature.begin() + 2);
auto type = dataTypeFromSignature(signature, ownerClass, nullptr);
if (type == nullptr)
return nullptr;
auto newProperty = std::make_unique<DotnetProperty>();
newProperty->setName(propertyName);
newProperty->setNameSpace(ownerClass->getFullyQualifiedName());
newProperty->setIsStatic(!hasThis);
newProperty->setDataType(std::move(type));
return newProperty;
}
/**
* Creates new method from MethodDef table record.
* @param methodDef MethodDef table record.
* @param ownerClass Owning class.
* @return New method or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetMethod> DotnetTypeReconstructor::createMethod(const MethodDef* methodDef, const DotnetClass* ownerClass)
{
std::string methodName;
if (!stringStream->getString(methodDef->name.getIndex(), methodName))
return nullptr;
methodName = retdec::utils::replaceNonprintableChars(methodName);
auto signature = blobStream->getElement(methodDef->signature.getIndex());
if (methodName.empty() || signature.empty())
return nullptr;
// If method contains generic paramters, we need to read the number of these generic paramters
if (signature[0] & Generic)
{
signature.erase(signature.begin(), signature.begin() + 1);
// We ignore this value just because we have this information already from the class name in format 'ClassName`N'
std::uint64_t bytesRead = 0;
decodeUnsigned(signature, bytesRead);
if (bytesRead == 0)
return nullptr;
signature.erase(signature.begin(), signature.begin() + bytesRead);
}
else
{
signature.erase(signature.begin(), signature.begin() + 1);
}
// It is followed by number of parameters
std::uint64_t bytesRead = 0;
std::uint64_t paramsCount = decodeUnsigned(signature, bytesRead);
if (bytesRead == 0)
return nullptr;
signature.erase(signature.begin(), signature.begin() + bytesRead);
auto newMethod = std::make_unique<DotnetMethod>();
newMethod->setRawRecord(methodDef);
newMethod->setName(methodName);
newMethod->setNameSpace(ownerClass->getFullyQualifiedName());
newMethod->setVisibility(toTypeVisibility(methodDef));
newMethod->setIsStatic(methodDef->isStatic());
newMethod->setIsVirtual(methodDef->isVirtual());
newMethod->setIsAbstract(methodDef->isAbstract());
newMethod->setIsFinal(methodDef->isFinal());
newMethod->setIsConstructor(methodName == ".ctor" || methodName == ".cctor");
newMethod->setDeclaredParametersCount(paramsCount);
// We need to postpone loading of return type and parameters because first we need to known all generic types
// However, we can't reconstruct generic types until we know all classes and methods, so we first create method just with its name, properties and parameter count
methodReturnTypeAndParamTypeTable.emplace(newMethod.get(), signature);
return newMethod;
}
/**
* Creates new method parameter from Param table record.
* @param param Param table record.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @param signature Signature with data types. Is destroyed in the meantime.
* @return New method parameter or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetParameter> DotnetTypeReconstructor::createMethodParameter(const Param* param, const DotnetClass* ownerClass,
const DotnetMethod* ownerMethod, std::vector<std::uint8_t>& signature)
{
std::string paramName;
if (!stringStream->getString(param->name.getIndex(), paramName))
return nullptr;
paramName = retdec::utils::replaceNonprintableChars(paramName);
auto type = dataTypeFromSignature(signature, ownerClass, ownerMethod);
if (type == nullptr)
return nullptr;
auto newParam = std::make_unique<DotnetParameter>();
newParam->setName(paramName);
newParam->setNameSpace(ownerMethod->getFullyQualifiedName());
newParam->setDataType(std::move(type));
return newParam;
}
/**
* Creates data type from signature that references defined or imported class.
* @param data Signature data.
* @return New data type or @c nullptr in case of failure.
*/
template <typename T>
std::unique_ptr<T> DotnetTypeReconstructor::createDataTypeFollowedByReference(std::vector<std::uint8_t>& data)
{
std::uint64_t bytesRead;
TypeDefOrRef typeRef;
typeRef.setIndex(decodeUnsigned(data, bytesRead));
if (bytesRead == 0)
return nullptr;
auto classRef = selectClass(typeRef);
if (classRef == nullptr)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
return std::make_unique<T>(classRef);
}
/**
* Creates data type from signature that refers to another data type.
* @param data Signature data.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @return New data type or @c nullptr in case of failure.
*/
template <typename T>
std::unique_ptr<T> DotnetTypeReconstructor::createDataTypeFollowedByType(std::vector<std::uint8_t>& data, const DotnetClass* ownerClass, const DotnetMethod* ownerMethod)
{
auto type = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (type == nullptr)
return nullptr;
return std::make_unique<T>(std::move(type));
}
/**
* Creates data type from signature that references generic parameter.
* @param data Signature data.
* @param owner Owning class or method.
* @return New data type or @c nullptr in case of failure.
*/
template <typename T, typename U>
std::unique_ptr<T> DotnetTypeReconstructor::createGenericReference(std::vector<std::uint8_t>& data, const U* owner)
{
if (owner == nullptr)
return nullptr;
// Index of generic parameter
std::uint64_t bytesRead = 0;
std::uint64_t index = decodeUnsigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
const auto& genericParams = owner->getGenericParameters();
if (index >= genericParams.size())
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
return std::make_unique<T>(&genericParams[index]);
}
/**
* Creates data type from signature that instantiates generic data type.
* @param data Signature data.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @return New data type or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetDataTypeGenericInst> DotnetTypeReconstructor::createGenericInstantiation(std::vector<std::uint8_t>& data, const DotnetClass* ownerClass, const DotnetMethod* ownerMethod)
{
if (data.empty())
return nullptr;
// Instantiated type
auto type = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (type == nullptr)
return nullptr;
if (data.empty())
return nullptr;
// Number of instantiated generic parameters
auto genericCount = data[0];
data.erase(data.begin(), data.begin() + 1);
// Generic parameters used for instantiation
std::vector<std::unique_ptr<DotnetDataTypeBase>> genericTypes;
for (std::size_t i = 0; i < genericCount; ++i)
{
auto genericType = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (genericType == nullptr)
return nullptr;
genericTypes.push_back(std::move(genericType));
}
return std::make_unique<DotnetDataTypeGenericInst>(std::move(type), std::move(genericTypes));
}
/**
* Creates data type from signature that represent array.
* @param data Signature data.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @return New data type or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetDataTypeArray> DotnetTypeReconstructor::createArray(std::vector<std::uint8_t>& data, const DotnetClass* ownerClass, const DotnetMethod* ownerMethod)
{
// First comes data type representing elements in array
auto type = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (type == nullptr)
return nullptr;
// Rank of an array comes then, this means how many dimensions our array has
std::uint64_t bytesRead = 0;
std::uint64_t rank = decodeUnsigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
// Rank must be non-zero number
if (rank == 0)
return nullptr;
std::vector<std::pair<std::int64_t, std::int64_t>> dimensions(rank);
// Some dimensions can have limited size by declaration
// Size 0 means not specified
std::uint64_t numOfSizes = decodeUnsigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
// Now get all those sizes
for (std::uint64_t i = 0; i < numOfSizes; ++i)
{
dimensions[i].second = decodeSigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
}
// And some dimensions can also be limited by special lower bound
std::size_t numOfLowBounds = decodeUnsigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
// Make sure we don't get out of bounds with dimensions
numOfLowBounds = std::min(dimensions.size(), numOfLowBounds);
for (std::uint64_t i = 0; i < numOfLowBounds; ++i)
{
dimensions[i].first = decodeSigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
// Adjust higher bound according to lower bound
dimensions[i].second += dimensions[i].first;
}
return std::make_unique<DotnetDataTypeArray>(std::move(type), std::move(dimensions));
}
/**
* Creates data type from signature that represent type modifier.
* @param data Signature data.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @return New data type or @c nullptr in case of failure.
*/
template <typename T>
std::unique_ptr<T> DotnetTypeReconstructor::createModifier(std::vector<std::uint8_t>& data, const DotnetClass* ownerClass, const DotnetMethod* ownerMethod)
{
// These modifiers are used to somehow specify data type using some data type
// The only usage we know about right know is 'volatile' keyword
// First read reference to type used for modifier
std::uint64_t bytesRead;
TypeDefOrRef typeRef;
typeRef.setIndex(decodeUnsigned(data, bytesRead));
if (bytesRead == 0)
return nullptr;
auto modifier = selectClass(typeRef);
if (modifier == nullptr)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
// Go further in signature because we only have modifier, we need to obtain type that is modified
auto type = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (type == nullptr)
return nullptr;
return std::make_unique<T>(modifier, std::move(type));
}
/**
* Creates data type from signature that represents function pointer.
* @param data Signature data.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @return New data type or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetDataTypeFnPtr> DotnetTypeReconstructor::createFnPtr(std::vector<std::uint8_t>& data, const DotnetClass* ownerClass, const DotnetMethod* ownerMethod)
{
if (data.empty())
return nullptr;
// Delete first byte, what does it even mean?
data.erase(data.begin(), data.begin() + 1);
// Read number of parameters
std::uint64_t bytesRead = 0;
std::uint64_t paramsCount = decodeUnsigned(data, bytesRead);
if (bytesRead == 0)
return nullptr;
data.erase(data.begin(), data.begin() + bytesRead);
auto returnType = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (returnType == nullptr)
return nullptr;
std::vector<std::unique_ptr<DotnetDataTypeBase>> paramTypes;
for (std::size_t i = 0; i < paramsCount; ++i)
{
auto paramType = dataTypeFromSignature(data, ownerClass, ownerMethod);
if (paramType == nullptr)
return nullptr;
paramTypes.push_back(std::move(paramType));
}
return std::make_unique<DotnetDataTypeFnPtr>(std::move(returnType), std::move(paramTypes));
}
/**
* Creates data type from signature. Signature is destroyed in the meantime.
* @param signature Signature data.
* @param ownerClass Owning class.
* @param ownerMethod Owning method.
* @return New data type or @c nullptr in case of failure.
*/
std::unique_ptr<DotnetDataTypeBase> DotnetTypeReconstructor::dataTypeFromSignature(std::vector<std::uint8_t>& signature, const DotnetClass* ownerClass, const DotnetMethod* ownerMethod)
{
if (signature.empty())
return nullptr;
std::unique_ptr<DotnetDataTypeBase> result;
auto type = static_cast<ElementType>(signature[0]);
signature.erase(signature.begin(), signature.begin() + 1);
switch (type)
{
case ElementType::Void:
result = std::make_unique<DotnetDataTypeVoid>();
break;
case ElementType::Boolean:
result = std::make_unique<DotnetDataTypeBoolean>();
break;
case ElementType::Char:
result = std::make_unique<DotnetDataTypeChar>();
break;
case ElementType::Int8:
result = std::make_unique<DotnetDataTypeInt8>();
break;
case ElementType::UInt8:
result = std::make_unique<DotnetDataTypeUInt8>();
break;
case ElementType::Int16:
result = std::make_unique<DotnetDataTypeInt16>();
break;
case ElementType::UInt16:
result = std::make_unique<DotnetDataTypeUInt16>();
break;
case ElementType::Int32:
result = std::make_unique<DotnetDataTypeInt32>();
break;
case ElementType::UInt32:
result = std::make_unique<DotnetDataTypeUInt32>();
break;
case ElementType::Int64:
result = std::make_unique<DotnetDataTypeInt64>();
break;
case ElementType::UInt64:
result = std::make_unique<DotnetDataTypeUInt64>();
break;
case ElementType::Float32:
result = std::make_unique<DotnetDataTypeFloat32>();
break;
case ElementType::Float64:
result = std::make_unique<DotnetDataTypeFloat64>();
break;
case ElementType::String:
result = std::make_unique<DotnetDataTypeString>();
break;
case ElementType::Ptr:
result = createDataTypeFollowedByType<DotnetDataTypePtr>(signature, ownerClass, ownerMethod);
break;
case ElementType::ByRef:
result = createDataTypeFollowedByType<DotnetDataTypeByRef>(signature, ownerClass, ownerMethod);
break;
case ElementType::ValueType:
result = createDataTypeFollowedByReference<DotnetDataTypeValueType>(signature);
break;
case ElementType::Class:
result = createDataTypeFollowedByReference<DotnetDataTypeClass>(signature);
break;
case ElementType::GenericVar:
result = createGenericReference<DotnetDataTypeGenericVar>(signature, ownerClass);
break;
case ElementType::Array:
result = createArray(signature, ownerClass, ownerMethod);
break;
case ElementType::GenericInst:
result = createGenericInstantiation(signature, ownerClass, ownerMethod);
break;
case ElementType::TypedByRef:
result = std::make_unique<DotnetDataTypeTypedByRef>();
break;
case ElementType::IntPtr:
result = std::make_unique<DotnetDataTypeIntPtr>();
break;
case ElementType::UIntPtr:
result = std::make_unique<DotnetDataTypeUIntPtr>();
break;
case ElementType::FnPtr:
result = createFnPtr(signature, ownerClass, ownerMethod);
break;
case ElementType::Object:
result = std::make_unique<DotnetDataTypeObject>();
break;
case ElementType::SzArray:
result = createDataTypeFollowedByType<DotnetDataTypeSzArray>(signature, ownerClass, ownerMethod);
break;
case ElementType::GenericMVar:
result = createGenericReference<DotnetDataTypeGenericMVar>(signature, ownerMethod);
break;
case ElementType::CModOptional:
result = createModifier<DotnetDataTypeCModOptional>(signature, ownerClass, ownerMethod);
break;
case ElementType::CModRequired:
result = createModifier<DotnetDataTypeCModRequired>(signature, ownerClass, ownerMethod);
break;
case ElementType::Internal:
return nullptr;
case ElementType::Modifier:
return nullptr;
case ElementType::Sentinel:
return nullptr;
case ElementType::Pinned:
return nullptr;
case ElementType::MetaType:
return nullptr;
case ElementType::BoxedObject:
return nullptr;
case ElementType::CustomField:
return nullptr;
case ElementType::CustomProperty:
return nullptr;
case ElementType::CustomEnum:
return nullptr;
default:
break;
}
return result;
}
/**
* Selects a class from defined or referenced class table based on provided @c TypeDefOrRef index.
* @param typeDefOrRef Index.
* @return Class if any exists, otherwise @c nullptr.
*/
const DotnetClass* DotnetTypeReconstructor::selectClass(const TypeDefOrRef& typeDefOrRef) const
{
MetadataTableType refTable;
if (!typeDefOrRef.getTable(refTable))
return nullptr;
const DotnetClass* result = nullptr;
if (refTable == MetadataTableType::TypeDef)
{
auto itr = defClassTable.find(typeDefOrRef.getIndex());
if (itr == defClassTable.end())
return nullptr;
result = itr->second.get();
}
else if (refTable == MetadataTableType::TypeRef)
{
auto itr = refClassTable.find(typeDefOrRef.getIndex());
if (itr == refClassTable.end())
return nullptr;
result = itr->second.get();
}
return result;
}
} // namespace fileformat
} // namespace retdec
| 32.232056 | 191 | 0.737963 | nimeshvaghasiya |
9cb16744fe767b9314c64517359912c5cfdb800b | 24,099 | cpp | C++ | Product/Main.cpp | markshepherd/papr-firmware | 7e85eb7a393e54b0edef0c30e8354a9d34d130d0 | [
"MIT"
] | null | null | null | Product/Main.cpp | markshepherd/papr-firmware | 7e85eb7a393e54b0edef0c30e8354a9d34d130d0 | [
"MIT"
] | null | null | null | Product/Main.cpp | markshepherd/papr-firmware | 7e85eb7a393e54b0edef0c30e8354a9d34d130d0 | [
"MIT"
] | null | null | null | /*
* Main.cpp
*
* The main program of the PAPR product firmware.
*
* KEEP THE MAIN LOOP RUNNING AT ALL TIMES. DO NOT USE DELAY().
* Be careful - this firmware keeps running even when the user does "Power Off".
* This code may need to run correctly for months at a time. Don't break this code!
* All code must work when millis() and micros() wrap around
*
* Once a battery is connected to the PCB, the system runs continuously forever. The
* only time we actually shut down is if the user completely drains the battery.
*/
#include "Main.h"
#include "PB2PWM.h"
#include <LowPower.h>
#include "MySerial.h"
#include "Hardware.h"
// The Hardware object gives access to all the microcontroller hardware such as pins and timers. Please always use this object,
// and never access any hardware or Arduino APIs directly. This gives us the option of using a fake hardware object for unit testing.
#define hw Hardware::instance
// indexed by PAPRState
const char* STATE_NAMES[] = { "Off", "On", "Off Charging", "On Charging" };
// TODO make this automatically update during build process
const char* PRODUCT_ID = "PAPR Rev 3.1 6/20/2021";
/********************************************************************
* Fan constants
********************************************************************/
// How many milliseconds should there be between readings of the fan speed. A smaller value will update
// more often, while a higher value will give more accurate and smooth readings.
const int FAN_SPEED_READING_INTERVAL = 1000;
// The duty cycle for each fan speed. Indexed by FanSpeed.
const byte fanDutyCycles[] = { 0, 50, 100 };
// The expected RPM for each fan speed. Indexed by FanSpeed.
const unsigned int expectedFanRPM[] = { 7479, 16112, 22271 };
/* Here are measured values for fan RMP for the San Ace 9GA0412P3K011
% MIN MAX AVG
0, 7461, 7480, 7479
10, 9431, 9481, 9456
20, 11264, 11284, 11274
30, 12908, 12947, 12928
40, 14580, 14626, 14603
50, 16047, 16177, 16112
60, 17682, 17743, 17743
70, 19092, 19150, 19121
80, 20408, 20488, 20448
90, 21510, 21556, 21533
100, 22215, 22327, 22271
*/
// How much tolerance do we give when checking for correct fan RPM. We allow +/- 5%.
const float LOWEST_FAN_OK_RPM = 0.95;
const float HIGHEST_FAN_OK_RPM = 1.05;
// The fan speed when we startup.
const FanSpeed DEFAULT_FAN_SPEED = fanLow;
// When we change the fan speed, allow at least this many milliseconds before checking the speed.
// This gives the fan enough time to stabilize at the new speed.
const int FAN_STABILIZE_MILLIS = 6000;
/********************************************************************
* Button constants
********************************************************************/
// The user must push a button for at least this many milliseconds.
const int BUTTON_DEBOUNCE_MILLIS = 1000;
// The power off button needs a very short debounce interval,
// so it can do a little song and dance before taking effect.
const int POWER_OFF_BUTTON_DEBOUNCE_MILLIS = 50;
// The power off button only takes effect if the user holds it pressed for at least this long.
const int POWER_OFF_BUTTON_HOLD_MILLIS = 1000;
/********************************************************************
* Alert constants
********************************************************************/
// Which LEDs to flash for each type of alert.
const int batteryLowLEDs[] = { BATTERY_LED_LOW_PIN, CHARGING_LED_PIN , -1 };
const int fanRPMLEDs[] = { FAN_LOW_LED_PIN, FAN_MED_LED_PIN, FAN_HIGH_LED_PIN, -1 };
const int* alertLEDs[] = { 0, batteryLowLEDs, fanRPMLEDs }; // Indexed by enum Alert.
// What are the on & off durations for the pulsed lights and buzzer for each type of alert.
const int batteryAlertMillis[] = { 1000, 1000 };
const int fanAlertMillis[] = { 200, 200 };
const int* alertMillis[] = { 0, batteryAlertMillis, fanAlertMillis }; // Indexed by enum Alert.
// Buzzer settings.
const long BUZZER_FREQUENCY = 2500; // in Hz
const int BUZZER_DUTYCYCLE = 50; // in percent
// A "low battery" alarm is in effect whenever the battery level is at or below the "urgent" amount.
// If a charger is connected then the red LED flashes until the level is above the urgent amount,
// but the buzzer doesn't sound.
// This percentage is supposed to occur when the battery has 30 minutes of charge left. To give a
// generous margin, it's actually about an hour.
const int URGENT_BATTERY_PERCENT = 8;
/********************************************************************
* LED
********************************************************************/
// Set a single LED to o given state
void Main::setLED(const int pin, int onOff) {
hw.digitalWrite(pin, onOff);
// keep track of the LED's state in ledState.
for (int i = 0; i < numLEDs; i++) {
if (pin == LEDpins[i]) {
ledState[i] = onOff;
return;
}
}
}
// Turn off all LEDs
void Main::allLEDsOff()
{
for (int i = 0; i < numLEDs; i += 1) {
setLED(LEDpins[i], LED_OFF);
}
}
// Turn on all LEDs
void Main::allLEDsOn()
{
for (int i = 0; i < numLEDs; i += 1) {
setLED(LEDpins[i], LED_ON);
}
}
// Set a list of LEDs to a given state.
void Main::setLEDs(const int* pinList, int onOff)
{
for (int i = 0; pinList[i] != -1; i += 1) {
setLED(pinList[i], onOff);
}
}
// Flash all the LEDS for a specified duration and number of flashes.
void Main::flashAllLEDs(int millis, int count)
{
while (count--) {
allLEDsOn();
hw.delay(millis);
allLEDsOff();
hw.delay(millis);
}
}
/********************************************************************
* Alert
********************************************************************/
// This function pulses the lights and buzzer during an alert.
void Main::onToggleAlert()
{
alertToggle = !alertToggle;
setLEDs(currentAlertLEDs, alertToggle ? LED_ON : LED_OFF);
setBuzzer(alertToggle ? BUZZER_ON : BUZZER_OFF);
alertTimer.start(currentAlertMillis[alertToggle ? 0 : 1]);
}
// Enter the "alert" state. In this state we pulse the lights and buzzer to
// alert the user to a problem. Once we are in this state, the only
// way out is for the user to turn the power off.
void Main::raiseAlert(Alert alert)
{
currentAlert = alert;
serialPrintf("Begin %s Alert", currentAlertName());
currentAlertLEDs = alertLEDs[alert];
currentAlertMillis = alertMillis[alert];
alertToggle = false;
onToggleAlert();
}
// Turn off any active alert.
void Main::cancelAlert()
{
currentAlert = alertNone;
alertTimer.cancel();
}
// Turn the buzzer on or off.
void Main::setBuzzer(int onOff) {
//serialPrintf("set buzzer %s", onOff == BUZZER_OFF ? "off" : "on");
if (onOff) {
startPB2PWM(BUZZER_FREQUENCY, BUZZER_DUTYCYCLE);
} else {
stopPB2PWM();
}
buzzerState = onOff;
}
/********************************************************************
* Fan
********************************************************************/
// Update the fan indicator LEDs to correspond to the current fan setting.
void Main::updateFanLEDs()
{
setLED(FAN_LOW_LED_PIN, LED_ON);
setLED(FAN_MED_LED_PIN, currentFanSpeed > fanLow ? LED_ON : LED_OFF);
setLED(FAN_HIGH_LED_PIN, currentFanSpeed == fanHigh ? LED_ON : LED_OFF);
}
// Set the fan to the indicated speed, and update the fan indicator LEDs.
void Main::setFanSpeed(FanSpeed speed)
{
fanController.setDutyCycle(fanDutyCycles[speed]);
currentFanSpeed = speed;
updateFanLEDs();
serialPrintf("Set Fan Speed %d", speed);
// disable fan RPM monitor for a few seconds, until the new fan speed stabilizes
lastFanSpeedChangeMilliSeconds = hw.millis();
fanSpeedRecentlyChanged = true;
}
// Call this periodically to check that the fan RPM is within the expected range for the current FanSpeed.
void Main::checkForFanAlert() {
const unsigned int fanRPM = fanController.getRPM();
// Note: we call getRPM() even if we're not going to use the result, because getRPM() works better if you call it often.
// If fan RPM checking is temporarily disabled, then do nothing.
if (fanSpeedRecentlyChanged) {
if (hw.millis() - lastFanSpeedChangeMilliSeconds < FAN_STABILIZE_MILLIS) {
return;
}
fanSpeedRecentlyChanged = false;
}
// If the RPM is too low or too high compared to the expected value, raise an alert.
const unsigned int expectedRPM = expectedFanRPM[currentFanSpeed];
if ((fanRPM < (LOWEST_FAN_OK_RPM * expectedRPM)) || (fanRPM > (HIGHEST_FAN_OK_RPM * expectedRPM))) {
raiseAlert(alertFanRPM);
}
}
/********************************************************************
* Battery
********************************************************************/
int Main::getBatteryPercentFull() {
return (int)((battery.getPicoCoulombs() - BATTERY_MIN_CHARGE_PICO_COULOMBS) / ((BATTERY_CAPACITY_PICO_COULOMBS - BATTERY_MIN_CHARGE_PICO_COULOMBS) / 100LL));
}
// Call this periodically to update the battery and charging LEDs.
void Main::updateBatteryLEDs() {
int percentFull = getBatteryPercentFull();
// Decide if the red LED should be on or not.
bool redLED = (percentFull < 40);
if (percentFull <= URGENT_BATTERY_PERCENT) {
// The battery level is really low. Flash the LED.
bool ledToggle = (hw.millis() / 1000) & 1;
redLED = redLED && ledToggle;
}
// Turn on/off the battery LEDs as required
setLED(BATTERY_LED_LOW_PIN, redLED ? LED_ON : LED_OFF); // red
setLED(BATTERY_LED_MED_PIN, ((percentFull > 15) && (percentFull < 97)) ? LED_ON : LED_OFF); // yellow
setLED(BATTERY_LED_HIGH_PIN, (percentFull > 70) ? LED_ON : LED_OFF); // green
// Turn on/off the charging indicator LED as required
setLED(CHARGING_LED_PIN, battery.isCharging() ? LED_ON : LED_OFF); // orange
// Maybe turn the charge reminder on or off.
// The "charge reminder" is the periodic beep that occurs when the battery is below 15%
// to remind the user to recharge the unit as soon as possible.
if (!battery.isCharging() && percentFull <= 15 && currentAlert != alertBatteryLow) {
if (!chargeReminder.isActive()) {
onChargeReminder();
chargeReminder.start();
}
} else {
chargeReminder.stop();
}
}
// Call this periodically to decide if a battery alert should be started or terminated.
void Main::checkForBatteryAlert()
{
if (currentAlert == alertBatteryLow) {
if (battery.isCharging() || getBatteryPercentFull() > URGENT_BATTERY_PERCENT) {
cancelAlert();
}
} else if (getBatteryPercentFull() <= URGENT_BATTERY_PERCENT && !battery.isCharging()) {
chargeReminder.stop();
raiseAlert(alertBatteryLow);
}
}
// This is the callback function for chargeReminder. When it's active, this function gets called every minute or so.
// We turn on the buzzer and the charging LED, then set a timer for when to turn buzzer and LED off.
void Main::onChargeReminder() {
serialPrintf("reminder beep");
setBuzzer(BUZZER_ON);
setLED(CHARGING_LED_PIN, LED_ON);
beepTimer.start(500);
}
// This is the callback function for beepTimer. This function gets called to turn off the chargeReminder buzzer and LED.
void Main::onBeepTimer() {
setBuzzer(BUZZER_OFF);
setLED(CHARGING_LED_PIN, LED_OFF);
}
/********************************************************************
* states and modes
********************************************************************/
// Go into a new state.
void Main::enterState(PAPRState newState)
{
serialPrintf("\r\nenter state %s", STATE_NAMES[newState]);
onStatusReport();
paprState = newState;
switch (newState) {
case stateOn:
case stateOnCharging:
hw.digitalWrite(FAN_ENABLE_PIN, FAN_ON);
setFanSpeed(currentFanSpeed);
setBuzzer(BUZZER_OFF);
if (currentAlert != alertFanRPM) {
updateFanLEDs();
}
if (currentAlert != alertBatteryLow) {
updateBatteryLEDs();
}
break;
case stateOff:
case stateOffCharging:
pinMode(BUZZER_PIN, INPUT); // tri-state the output pin, so the buzzer receives no signal and consumes no power.
hw.digitalWrite(FAN_ENABLE_PIN, FAN_OFF);
currentFanSpeed = DEFAULT_FAN_SPEED;
cancelAlert();
allLEDsOff();
break;
}
onStatusReport();
}
// Set the PCB to its low power state, and put the MCU into its lowest power sleep mode.
// This function will return only when the user presses the Power On button,
// or until the charger is connected. While we are napping, the system uses a negligible amount
// of power, perhaps 1-3% of a full battery charge every month.
//
// Be careful inside this function, it's the only place where we mess around with
// power, speed, watchdog, and sleeping. If you break this code it will mess up
// a lot of things!
//
// When this function returns, the board MUST be in full power mode,
// and the watchdog timer MUST be enabled.
void Main::nap()
{
hw.wdt_disable();
hw.setPowerMode(lowPowerMode);
while (true) {
LowPower.powerDown(SLEEP_1S, ADC_OFF, BOD_OFF);
if (battery.isCharging()) {
hw.setPowerMode(fullPowerMode);
enterState(stateOffCharging);
hw.wdt_enable(WDTO_8S);
return;
}
long wakeupTime = hw.millis();
while (hw.digitalRead(POWER_ON_PIN) == BUTTON_PUSHED) {
if (hw.millis() - wakeupTime > 125) { // we're at 1/8 speed, so this is really 1000 ms (8 * 125)
hw.setPowerMode(fullPowerMode);
enterState(stateOn);
while (hw.digitalRead(POWER_ON_PIN) == BUTTON_PUSHED) {}
hw.wdt_enable(WDTO_8S);
return;
}
}
}
}
/********************************************************************
* UI event handlers
********************************************************************/
// when the user presses Power Off, we want to give the user an audible and visible signal
// in case they didn't mean to do it. If the user holds the button long enough we return true,
// meaning that the user really wants to do it.
bool Main::doPowerOffWarning()
{
// Turn on all LEDs, and the buzzer
allLEDsOn();
setBuzzer(BUZZER_ON);
// If the user holds the button for long enough, we will return true,
// which tells the caller to go ahead and enter the off state.
unsigned long startMillis = hw.millis();
while (hw.digitalRead(POWER_OFF_PIN) == BUTTON_PUSHED) {
if (hw.millis() - startMillis > POWER_OFF_BUTTON_HOLD_MILLIS) {
allLEDsOff();
setBuzzer(BUZZER_OFF);
return true;
}
}
// The user did not hold the button long enough. Restore the UI
// and tell the caller not to enter the off state.
allLEDsOff();
setBuzzer(BUZZER_OFF);
if (currentAlert != alertFanRPM) {
updateFanLEDs();
}
if (currentAlert != alertBatteryLow) {
updateBatteryLEDs();
}
return false;
}
// This function gets called when the user presses the Power On button
void Main::onPowerOnPress()
{
switch (paprState) {
case stateOn:
case stateOnCharging:
// do nothing
break;
case stateOff: // should never happen
case stateOffCharging:
enterState(stateOnCharging);
break;
}
}
// This function gets called when the user presses the Power On button
void Main::onPowerOffPress()
{
switch (paprState) {
case stateOn:
if (doPowerOffWarning()) {
enterState(stateOff);
}
break;
case stateOff:
case stateOffCharging:
// these should never happen
break;
case stateOnCharging:
if (doPowerOffWarning()) {
enterState(stateOffCharging);
}
break;
}
}
// This function gets called when the user presses the Fan Down button
void Main::onFanDownPress()
{
/* TEMP for testing/debugging: decrease the current battery level by a few percent. */
if (digitalRead(POWER_ON_PIN) == BUTTON_PUSHED) {
battery.DEBUG_incrementPicoCoulombs(-1500000000000000LL);
serialPrintf("Charge is %d%", getBatteryPercentFull());
return;
}
setFanSpeed((currentFanSpeed == fanHigh) ? fanMedium : fanLow);
}
// This function gets called when the user presses the Fan Up button
void Main::onFanUpPress()
{
/* TEMP for testing/debugging: increase the current battery level by a few percent. */
if (digitalRead(POWER_ON_PIN) == BUTTON_PUSHED) {
battery.DEBUG_incrementPicoCoulombs(1500000000000000LL);
serialPrintf("Charge is %d%", getBatteryPercentFull());
return;
}
setFanSpeed((instance->currentFanSpeed == fanLow) ? fanMedium : fanHigh);
}
// This function is an interrupt handler that gets called whenever the user presses the Power On button.
void Main::callback()
{
if (hw.digitalRead(POWER_ON_PIN) == BUTTON_PUSHED && hw.digitalRead(FAN_UP_PIN) == BUTTON_PUSHED && hw.digitalRead(FAN_DOWN_PIN) == BUTTON_PUSHED) {
// it's a user reset
hw.reset();
// TEMP cause a watchdog timeout
//while (true) {
// setLED(ERROR_LED_PIN, LED_ON);
// setLED(ERROR_LED_PIN, LED_OFF);
//}
}
}
/********************************************************************
* Startup and run
********************************************************************/
Main::Main() :
// In the following code we are using the c++ lambda expressions as glue to our event handler functions.
buttonFanUp(FAN_UP_PIN, BUTTON_DEBOUNCE_MILLIS,
[]() { instance->onFanUpPress(); }),
buttonFanDown(FAN_DOWN_PIN, BUTTON_DEBOUNCE_MILLIS,
[]() { instance->onFanDownPress(); }),
buttonPowerOff(POWER_OFF_PIN, POWER_OFF_BUTTON_DEBOUNCE_MILLIS,
[]() { instance->onPowerOffPress(); }),
buttonPowerOn(POWER_ON_PIN, BUTTON_DEBOUNCE_MILLIS,
[]() { instance->onPowerOnPress(); }),
alertTimer(
[]() { instance->onToggleAlert(); }),
beepTimer(
[]() { instance->onBeepTimer(); }),
chargeReminder(10000,
[]() { instance->onChargeReminder(); }),
statusReport(10000,
[]() { instance->onStatusReport(); }),
fanController(FAN_RPM_PIN, FAN_SPEED_READING_INTERVAL, FAN_PWM_PIN),
currentFanSpeed(fanLow),
fanSpeedRecentlyChanged(false),
ledState({ LED_OFF, LED_OFF, LED_OFF, LED_OFF, LED_OFF, LED_OFF, LED_OFF}),
buzzerState(BUZZER_OFF),
currentAlert(alertNone)
{
instance = this;
}
// This function gets called once, when the MCU starts up.
void Main::setup()
{
// Make sure watchdog is off. Remember what kind of reset just happened. Setup the hardware.
int resetFlags = hw.watchdogStartup();
hw.setup();
// Initialize the serial port and print some initial debug info.
#ifdef SERIAL_ENABLED
delay(1000);
serialInit();
serialPrintf("%s, MCUSR = %x", PRODUCT_ID, resetFlags);
#endif
// Decide what state we should be in.
PAPRState initialState;
if (resetFlags & (1 << WDRF)) {
// Watchdog timer expired. Tell the user that something unusual happened.
flashAllLEDs(100, 5);
initialState = stateOn;
} else if (resetFlags == 0) {
// Manual reset. Tell the user that something unusual happened.
flashAllLEDs(100, 10);
initialState = stateOn;
} else {
// It's a simple power-on. This will happen when:
// - somebody in the factory just connected the battery to the PCB; or
// - the battery had been fully drained (and therefore not delivering any power), and the user just plugged in the charger.
initialState = stateOff;
}
if (battery.isCharging()) {
initialState = (PAPRState)((int)initialState + 2);
}
// Initialize the fan
fanController.begin();
setFanSpeed(DEFAULT_FAN_SPEED);
// Enable the watchdog timer. (Note: Don't make the timeout value too small - we need to give the IDE a chance to
// call the bootloader in case something dumb happens during development and the WDT
// resets the MCU too quickly. Once the code is solid, you could make it shorter.)
wdt_enable(WDTO_8S);
// Enable pin-change interrupts for the Power On button, and register a callback to handle those interrupts.
// The interrupt serves 2 distinct purposes: (1) to get this callback called, and (2) to wake us up if we're napping.
hw.setPowerOnButtonInterruptCallback(this);
// and we're done!
battery.initializeCoulombCount();
enterState(initialState);
statusReport.start();
}
// Call the update() function of everybody who wants to do something each time through the loop() function.
void Main::doAllUpdates()
{
battery.update();
if (currentAlert == alertNone) {
checkForFanAlert();
}
if (currentAlert != alertFanRPM) {
updateFanLEDs();
}
checkForBatteryAlert();
if (currentAlert != alertBatteryLow) {
updateBatteryLEDs();
}
buttonFanUp.update();
buttonFanDown.update();
buttonPowerOff.update();
alertTimer.update();
chargeReminder.update();
beepTimer.update();
statusReport.update();
}
// This is our main function, which gets called over and over again, forever.
void Main::loop()
{
hw.wdt_reset_();
switch (paprState) {
case stateOn:
doAllUpdates();
if (battery.isCharging()) {
enterState(stateOnCharging);
}
break;
case stateOnCharging:
doAllUpdates();
if (!battery.isCharging()) {
enterState(stateOn);
}
break;
case stateOff:
// We are not charging so there are no LEDs to update.
// We have nothing to do except take a nap. Our nap will end
// when the state is no longer stateOff.
nap();
battery.wakeUp();
break;
case stateOffCharging:
// Only do the work that is necessary when power is off and we're charging
// - update the battery status and battery LEDs
// - see if the charger has been unplugged
// - see if the Power On button was pressed
battery.update();
updateBatteryLEDs();
if (!battery.isCharging()) {
enterState(stateOff);
}
buttonPowerOn.update();
statusReport.update();
break;
}
}
// Write a one-line summary of the status of everything. For use in testing and debugging.
void Main::onStatusReport() {
#ifdef SERIAL_ENABLED
serialPrintf("Fan,%s,Buzzer,%s,Alert,%s,Charging,%s,LEDs,%s,%s,%s,%s,%s,%s,%s,milliVolts,%ld,milliAmps,%ld,Coulombs,%ld,charge,%d%%",
(currentFanSpeed == fanLow) ? "lo" : ((currentFanSpeed == fanMedium) ? "med" : "hi"),
(buzzerState == BUZZER_ON) ? "on" : "off",
currentAlertName(),
battery.isCharging() ? "yes" : "no",
(ledState[0] == LED_ON) ? "red" : "---",
(ledState[1] == LED_ON) ? "yellow" : "---",
(ledState[2] == LED_ON) ? "green" : "---",
(ledState[3] == LED_ON) ? "amber" : "---",
(ledState[4] == LED_ON) ? "blue" : "---",
(ledState[5] == LED_ON) ? "blue" : "---",
(ledState[6] == LED_ON) ? "blue" : "---",
(long)(hw.readMicroVolts() / 1000LL),
(long)(hw.readMicroAmps() / 1000LL),
(long)(battery.getPicoCoulombs() / 1000000000000LL),
getBatteryPercentFull());
#endif
}
Main* Main::instance;
| 35.027616 | 161 | 0.612059 | markshepherd |
9cb5096edff0dbbc7f349a706892a37d794a4164 | 3,009 | cpp | C++ | cpp/20226.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 9 | 2021-01-15T13:36:39.000Z | 2022-02-23T03:44:46.000Z | cpp/20226.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 1 | 2021-07-31T17:11:26.000Z | 2021-08-02T01:01:03.000Z | cpp/20226.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using pll = pair<ll, ll>;
struct Random {
mt19937 rd;
Random() : rd((unsigned)chrono::steady_clock::now().time_since_epoch().count()) {}
Random(int seed) : rd(seed) {}
template<typename T = int>
T GetInt(T l = 0, T r = 32767) {
return uniform_int_distribution<T>(l, r)(rd);
}
double GetDouble(double l = 0, double r = 1) {
return uniform_real_distribution<double>(l, r)(rd);
}
} Rand;
struct MillerRabin {
ll Mul(ll x, ll y, ll MOD) {
ll ret = x * y - MOD * ull(1.L / MOD * x * y);
return ret + MOD * (ret < 0) - MOD * (ret >= (ll)MOD);
}
ll _pow(ll x, ll n, ll MOD) {
ll ret = 1; x %= MOD;
for (; n; n >>= 1) {
if (n & 1) ret = Mul(ret, x, MOD);
x = Mul(x, x, MOD);
}
return ret;
}
bool Check(ll x, ll p) {
if (x % p == 0) return 0;
for (ll d = x - 1; ; d >>= 1) {
ll t = _pow(p, d, x);
if (d & 1) return t != 1 && t != x - 1;
if (t == x - 1) return 0;
}
}
bool IsPrime(ll x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return 1;
if (x % 2 == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return 0;
if (x < 121) return x > 1;
if (x < 1ULL << 32) for (auto& i : { 2, 7, 61 }) {
if (x == i) return 1;
if (x > i && Check(x, i)) return 0;
}
else for (auto& i : { 2, 325, 9375, 28178, 450775, 9780504, 1795265022 }) {
if (x == i) return 1;
if (x > i && Check(x, i)) return 0;
}
return 1;
}
};
struct PollardRho : public MillerRabin {
void Rec(ll n, vector<ll>& v) {
if (n == 1) return;
if (~n & 1) { v.push_back(2); Rec(n >> 1, v); return; }
if (IsPrime(n)) { v.push_back(n); return; }
ll a, b, c, g = n;
auto f = [&](ll x) { return (c + Mul(x, x, n)) % n; };
do {
if (g == n) {
a = b = Rand.GetInt<ll>(0, n - 3) + 2;
c = Rand.GetInt<ll>(0, 19) + 1;
}
a = f(a); b = f(f(b)); g = gcd(abs(a - b), n);
} while (g == 1);
Rec(g, v); Rec(n / g, v);
}
vector<ll> Factorize(ll n) {
vector<ll> ret; Rec(n, ret);
sort(ret.begin(), ret.end());
return ret;
}
} P;
vector<pll> Compress(vector<ll> v) {
map<ll, ll> M;
for (auto& i : v) M[i]++;
return vector<pll>(M.begin(), M.end());
}
ll Sol(ll n) {
if (P.IsPrime(n)) return n + 2;
ll ret = n + 2;
vector<pll> v = Compress(P.Factorize(n));
vector<ll> div;
auto DFS = [&](int dep, ll cur, auto&& DFS) -> void {
if (dep == v.size()) { div.push_back(cur); return; }
for (ll i = 0, t = 1; i <= v[dep].second; i++) {
DFS(dep + 1, cur * t, DFS);
t *= v[dep].first;
}
};
DFS(0, 1, DFS);
sort(div.begin(), div.end());
for (int i = 0; i < div.size(); i++) {
auto it = lower_bound(div.begin(), div.end(), sqrt(div[i]));
for (auto j = it - 3; j <= it + 3; j++) {
if (j < div.begin() || j >= div.end()) continue;
if (div[i] % *j) continue;
ret = min(ret, n / div[i] + div[i] / *j + *j);
}
}
return ret;
}
int main() {
fastio;
for (ll n; cin >> n && n; cout << Sol(n) << '\n');
} | 25.285714 | 83 | 0.504819 | jinhan814 |
9cb56b68a5d296612853dc49467ce522135a89ed | 2,955 | cpp | C++ | src/core/renderable.cpp | lebarsfa/vpython-wx | 38df062e5532b79f632f4f2a1abae86754c264a9 | [
"BSL-1.0"
] | 68 | 2015-01-17T05:41:58.000Z | 2021-04-24T08:35:24.000Z | src/core/renderable.cpp | lebarsfa/vpython-wx | 38df062e5532b79f632f4f2a1abae86754c264a9 | [
"BSL-1.0"
] | 16 | 2015-01-02T19:36:06.000Z | 2018-09-09T21:01:25.000Z | src/core/renderable.cpp | lebarsfa/vpython-wx | 38df062e5532b79f632f4f2a1abae86754c264a9 | [
"BSL-1.0"
] | 37 | 2015-02-04T04:23:00.000Z | 2020-06-07T03:24:41.000Z | // Copyright (c) 2000, 2001, 2002, 2003 by David Scherer and others.
// Copyright (c) 2003, 2004 by Jonathan Brandmeyer and others.
// See the file license.txt for complete license terms.
// See the file authors.txt for a complete list of contributors.
#include "renderable.hpp"
#include "material.hpp"
namespace cvisual {
// TODO: tan_hfov_x and tan_hfov_y must be revisited in the face of
// nonuniform scaling. It may be more appropriate to describe the viewing
// frustum in a different way entirely.
view::view( const vector n_forward, vector n_center, int n_width,
int n_height, bool n_forward_changed,
double n_gcf, vector n_gcfvec,
bool n_gcf_changed, gl_extensions& glext)
: forward( n_forward), center(n_center), view_width( n_width),
view_height( n_height), forward_changed( n_forward_changed),
gcf( n_gcf), gcfvec( n_gcfvec), gcf_changed( n_gcf_changed), lod_adjust(0),
anaglyph(false), coloranaglyph(false), tan_hfov_x(0), tan_hfov_y(0),
screen_objects( z_comparator( forward)), glext(glext),
enable_shaders(true)
{
for(int i=0; i<N_LIGHT_TYPES; i++)
light_count[i] = 0;
}
void view::apply_frame_transform( const tmatrix& wft ) {
camera = wft * camera;
forward = wft.times_v( forward );
center = wft * center;
up = wft.times_v(up);
screen_objects_t tso( (z_comparator(forward)) );
screen_objects.swap( tso );
}
double
view::pixel_coverage( const vector& pos, double radius) const
{
// The distance from the camera to this position, in the direction of the
// camera. This is the distance to the viewing plane that the coverage
// circle lies in.
double dist = (pos - camera).dot(forward);
// Half of the width of the viewing plane at this distance.
double apparent_hwidth = tan_hfov_x * dist;
// The fraction of the apparent width covered by the coverage circle.
double coverage_fraction = radius / apparent_hwidth;
// Convert from fraction to pixels.
return coverage_fraction * view_width;
}
renderable::renderable()
: visible(true), opacity( 1.0 )
{
}
renderable::~renderable()
{
}
void
renderable::outer_render( view& v )
{
rgb actual_color = color;
if (v.anaglyph) {
if (v.coloranaglyph)
color = actual_color.desaturate();
else
color = actual_color.grayscale();
}
tmatrix material_matrix;
get_material_matrix(v, material_matrix);
apply_material use_mat( v, mat.get(), material_matrix );
gl_render(v);
if (v.anaglyph)
color = actual_color;
}
void
renderable::gl_render( view&)
{
return;
}
void
renderable::gl_pick_render( view&)
{
}
void
renderable::grow_extent( extent&)
{
return;
}
void
renderable::set_material( shared_ptr<class material> m )
{
mat = m;
}
shared_ptr<class material>
renderable::get_material() {
return mat;
}
bool renderable::translucent() {
return opacity != 1.0 || (mat && mat->get_translucent());
}
} // !namespace cvisual
| 25.042373 | 77 | 0.701184 | lebarsfa |
9cb78d2faaba29f6af5c59fc1039441b986e299f | 9,693 | cpp | C++ | test/gtest_unit/hook/select.cpp | zhcpku/libgo | 4780002c9bfb4e710ab51951b064a04118d4a191 | [
"MIT"
] | 2,831 | 2015-12-24T03:21:07.000Z | 2022-03-31T18:37:29.000Z | test/gtest_unit/hook/select.cpp | gswgit/libgo | 4af17b7c67643c4d54aa354dcc77963ea07847d0 | [
"MIT"
] | 238 | 2016-01-26T03:35:35.000Z | 2022-03-18T11:17:00.000Z | test/gtest_unit/hook/select.cpp | gswgit/libgo | 4af17b7c67643c4d54aa354dcc77963ea07847d0 | [
"MIT"
] | 781 | 2015-12-24T04:28:34.000Z | 2022-03-26T05:23:12.000Z | #include "test_server.h"
#include <iostream>
#include <unistd.h>
#include <gtest/gtest.h>
#include <sys/select.h>
#include <time.h>
#include <chrono>
#include <boost/any.hpp>
#include "coroutine.h"
#include "../gtest_exit.h"
#include "hook.h"
using namespace std;
using namespace co;
///select test points:
// 1.timeout == 0 seconds (immedaitely)
// 2.timeout == NULL
// 3.timeout == 1 seconds
// 4.all of fds are valid
// 5.all of fds are invalid
// 6.some -1 in fds
//X7.some file_fd in fds
//X8.occurred ERR events
// 9.timeout return
// 10.multi threads
// 11.trigger read and not trigger write
typedef int(*select_t)(int nfds, fd_set *readfds, fd_set *writefds,
fd_set *exceptfds, struct timeval *timeout);
bool FD_EQUAL(fd_set const* lhs, fd_set const* rhs){
return memcmp(lhs, rhs, sizeof(fd_set)) == 0;
}
bool FD_ISZERO(fd_set *fds){
for (int i = 0; i < FD_SETSIZE; ++i)
if (FD_ISSET(i, fds))
return false;
return true;
}
int FD_SIZE(fd_set *fds){
int n = 0;
for (int i = 0; i < FD_SETSIZE; ++i)
if (FD_ISSET(i, fds))
++n;
return n;
}
int FD_NFDS(fd_set *fds1 = nullptr, fd_set *fds2 = nullptr, fd_set *fds3 = nullptr)
{
int n = 0;
fd_set* fdss[3] = {fds1, fds2, fds3};
for (int i = 0; i < 3; ++i) {
fd_set* fds = fdss[i];
if (!fds) continue;
for (int fd = 0; fd < FD_SETSIZE; ++fd)
if (FD_ISSET(fd, fds))
n = (std::max)(fd, n);
}
return n + 1;
}
struct GcNew
{
std::unique_ptr<boost::any> holder_;
template <typename T>
T* operator-(T* ptr) {
holder_.reset(new boost::any(std::shared_ptr<T>(ptr)));
return ptr;
}
};
#define gc_new GcNew()-new
struct AutoFreeFdSet
{
fd_set fds_;
int nfds_;
AutoFreeFdSet(fd_set* fds) : fds_(*fds), nfds_(0) {
for (int i = 0; i < FD_SETSIZE; ++i)
if (FD_ISSET(i, &fds_))
nfds_ = i + 1;
}
~AutoFreeFdSet() {
for (int i = 0; i < FD_SETSIZE; ++i)
if (FD_ISSET(i, &fds_))
close(i);
}
bool operator==(fd_set *fds) {
return FD_EQUAL(&fds_, fds);
}
bool operator==(fd_set & fds) {
return FD_EQUAL(&fds_, &fds);
}
};
void connect_me(int fd)
{
sockaddr_in addr;
addr.sin_family = AF_INET;
addr.sin_port = htons(43222);
addr.sin_addr.s_addr = inet_addr("127.0.0.1");
int r = connect(fd, (sockaddr*)&addr, sizeof(addr));
EXPECT_EQ(r, 0);
}
std::shared_ptr<AutoFreeFdSet> CreateFds(fd_set* fds, int num)
{
FD_ZERO(fds);
for (int i = 0; i < num; ++i) {
int socketfd = socket(AF_INET, SOCK_STREAM, 0);
EXPECT_FALSE(-1 == socketfd);
EXPECT_LT(socketfd, FD_SETSIZE);
connect_me(socketfd);
FD_SET(socketfd, fds);
}
return std::shared_ptr<AutoFreeFdSet>(new AutoFreeFdSet(fds));
}
static timeval zero_timeout = {0, 0};
static timeval sec_timeout = {3, 0};
TEST(Select, TimeoutIs0)
{
// co_opt.debug = dbg_all;
// co_opt.debug_output = fopen("log", "w+");
go [] {
uint64_t yield_count = g_Scheduler.GetCurrentTaskYieldCount();
select(0, NULL, NULL, NULL, &zero_timeout);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
int fds[2];
int res = tcpSocketPair(0, SOCK_STREAM, 0, fds);
EXPECT_EQ(res, 0);
fd_set wfs;
FD_ZERO(&wfs);
FD_SET(fds[0], &wfs);
FD_SET(fds[1], &wfs);
EXPECT_EQ(FD_SIZE(&wfs), 2);
const fd_set x = wfs;
yield_count = g_Scheduler.GetCurrentTaskYieldCount();
int n = select(FD_NFDS(&wfs), NULL, &wfs, NULL, &zero_timeout);
EXPECT_EQ(n, 2);
EXPECT_TRUE(FD_EQUAL(&x, &wfs));
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
fd_set rfs = x;
yield_count = g_Scheduler.GetCurrentTaskYieldCount();
n = select(FD_NFDS(&rfs), &rfs, NULL, NULL, &zero_timeout);
EXPECT_EQ(n, 0);
EXPECT_TRUE(FD_ISZERO(&rfs));
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
rfs = x;
wfs = x;
yield_count = g_Scheduler.GetCurrentTaskYieldCount();
n = select(FD_NFDS(&rfs, &wfs), &rfs, &wfs, NULL, &zero_timeout);
EXPECT_EQ(n, 2);
EXPECT_TRUE(FD_ISZERO(&rfs));
EXPECT_TRUE(FD_EQUAL(&x, &wfs));
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
};
WaitUntilNoTask();
}
TEST(Select, TimeoutIsF1)
{
go [] {
uint64_t yield_count = g_Scheduler.GetCurrentTaskYieldCount();
select(0, NULL, NULL, NULL, nullptr);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count + 1);
int fds[2];
int res = tcpSocketPair(0, SOCK_STREAM, 0, fds);
EXPECT_EQ(res, 0);
fd_set wfs;
FD_ZERO(&wfs);
FD_SET(fds[0], &wfs);
FD_SET(fds[1], &wfs);
EXPECT_EQ(FD_SIZE(&wfs), 2);
const fd_set x = wfs;
yield_count = g_Scheduler.GetCurrentTaskYieldCount();
int n = select(FD_NFDS(&wfs), NULL, &wfs, NULL, nullptr);
EXPECT_EQ(n, 2);
EXPECT_TRUE(FD_EQUAL(&x, &wfs));
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
fd_set rfs = x;
yield_count = g_Scheduler.GetCurrentTaskYieldCount();
n = select(FD_NFDS(&rfs, &wfs), &rfs, &wfs, NULL, nullptr);
EXPECT_EQ(n, 2);
EXPECT_TRUE(FD_EQUAL(&x, &wfs));
EXPECT_TRUE(FD_ISZERO(&rfs));
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
};
WaitUntilNoTask();
}
TEST(Select, TimeoutIs1)
{
go [] {
fd_set wr_fds;
auto x = CreateFds(&wr_fds, 2);
EXPECT_EQ(FD_SIZE(&wr_fds), 2);
uint64_t yield_count = g_Scheduler.GetCurrentTaskYieldCount();
int n = select(x->nfds_, NULL, &wr_fds, NULL, gc_new timeval{1, 0});
EXPECT_TRUE(*x == wr_fds);
EXPECT_EQ(n, 2);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
fd_set rd_fds;
auto r = CreateFds(&rd_fds, 2);
EXPECT_EQ(FD_SIZE(&rd_fds), 2);
yield_count = g_Scheduler.GetCurrentTaskYieldCount();
n = select((std::max)(x->nfds_, r->nfds_), &rd_fds, &wr_fds, NULL, gc_new timeval{1, 0});
EXPECT_TRUE(*x == wr_fds);
EXPECT_TRUE(FD_ISZERO(&rd_fds));
EXPECT_EQ(n, 2);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count);
};
WaitUntilNoTask();
go [] {
fd_set rd_fds;
auto r = CreateFds(&rd_fds, 2);
EXPECT_EQ(FD_SIZE(&rd_fds), 2);
uint64_t yield_count = g_Scheduler.GetCurrentTaskYieldCount();
auto start = std::chrono::high_resolution_clock::now();
int n = select(r->nfds_, &rd_fds, NULL, NULL, gc_new timeval{1, 0});
auto end = std::chrono::high_resolution_clock::now();
auto c = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
EXPECT_FALSE(*r == rd_fds);
EXPECT_TRUE(FD_ISZERO(&rd_fds));
EXPECT_EQ(n, 0);
EXPECT_LT(c, 1050);
EXPECT_GT(c, 950);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count + 1);
};
WaitUntilNoTask();
}
TEST(Select, Sleep)
{
go [] {
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), 0u);
auto start = std::chrono::high_resolution_clock::now();
int n = select(0, NULL, NULL, NULL, gc_new timeval{1, 0});
auto end = std::chrono::high_resolution_clock::now();
auto c = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
EXPECT_EQ(n, 0);
EXPECT_LT(c, 1050);
EXPECT_GT(c, 950);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), 1u);
};
WaitUntilNoTask();
}
TEST(Select, MultiThreads)
{
// co_sched.GetOptions().debug = co::dbg_hook;
for (int i = 0; i < 50; ++i)
go [] {
fd_set rd_fds;
auto r = CreateFds(&rd_fds, 2);
EXPECT_EQ(FD_SIZE(&rd_fds), 2);
uint64_t yield_count = g_Scheduler.GetCurrentTaskYieldCount();
auto start = std::chrono::high_resolution_clock::now();
int n = select(r->nfds_, &rd_fds, NULL, NULL, gc_new timeval{1, 0});
auto end = std::chrono::high_resolution_clock::now();
auto c = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
EXPECT_FALSE(*r == rd_fds);
EXPECT_TRUE(FD_ISZERO(&rd_fds));
EXPECT_EQ(n, 0);
EXPECT_LT(c, 1100);
EXPECT_GT(c, 999);
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count + 1);
};
WaitUntilNoTask();
}
TEST(Select, TriggerReadOnly)
{
// co_opt.debug = dbg_all;
// co_opt.debug_output = fopen("log", "w+");
go [] {
int fds[2];
int res = tcpSocketPair(0, SOCK_STREAM, 0, fds);
EXPECT_EQ(res, 0);
fd_set rfs;
FD_ZERO(&rfs);
FD_SET(fds[0], &rfs);
FD_SET(fds[1], &rfs);
EXPECT_EQ(FD_SIZE(&rfs), 2);
go [=] {
co_sleep(200);
int res = write(fds[0], "a", 1);
// std::cout << "fill_send_buffer return " << res << endl;
};
auto yield_count = g_Scheduler.GetCurrentTaskYieldCount();
int n = select(FD_NFDS(&rfs), &rfs, NULL, NULL, &sec_timeout);
EXPECT_EQ(n, 1);
EXPECT_TRUE(!FD_ISSET(fds[0], &rfs));
EXPECT_TRUE(FD_ISSET(fds[1], &rfs));
EXPECT_EQ(g_Scheduler.GetCurrentTaskYieldCount(), yield_count + 1);
};
WaitUntilNoTask();
}
| 30.102484 | 97 | 0.588775 | zhcpku |
9cbabb8fe4f917122cdb1ee706eca3e48bfb803b | 1,019 | cpp | C++ | src/164.maximum_gap/code2.cpp | cloudzfy/leetcode | 9d32090429ef297e1f62877382bff582d247266a | [
"MIT"
] | 1 | 2016-07-02T17:44:10.000Z | 2016-07-02T17:44:10.000Z | src/164.maximum_gap/code2.cpp | cloudzfy/leetcode | 9d32090429ef297e1f62877382bff582d247266a | [
"MIT"
] | null | null | null | src/164.maximum_gap/code2.cpp | cloudzfy/leetcode | 9d32090429ef297e1f62877382bff582d247266a | [
"MIT"
] | 1 | 2019-12-21T04:57:15.000Z | 2019-12-21T04:57:15.000Z | class Solution {
public:
int maximumGap(vector<int>& nums) {
int n = nums.size();
if (n < 2) return 0;
int maxNum = *max_element(nums.begin(), nums.end());
int minNum = *min_element(nums.begin(), nums.end());
if (maxNum == minNum) return 0;
double bucketSize = (double)(maxNum - minNum) / (n - 1);
vector<pair<int, int> > buckets(n, make_pair(INT_MAX, INT_MIN));
for (int i = 0; i < n; i++) {
int idx = (nums[i] - minNum) / bucketSize;
buckets[idx].first = min(buckets[idx].first, nums[i]);
buckets[idx].second = max(buckets[idx].second, nums[i]);
}
int ans = buckets[0].second - buckets[0].first;
int pre = buckets[0].second;
for (int i = 1; i < n; i++) {
if (buckets[i].first == INT_MAX) continue;
ans = max(ans, max(buckets[i].first - pre, buckets[i].second - buckets[i].first));
pre = buckets[i].second;
}
return ans;
}
};
| 39.192308 | 94 | 0.525025 | cloudzfy |
9cbdf76959e02f4f0ea1003b30ed05b043de9ede | 31,578 | cpp | C++ | be/src/exec/tablet_sink.cpp | Xuxue1/incubator-doris | 3ea12dd5932b90ea949782e7ebf6a282cb75652b | [
"Apache-2.0"
] | null | null | null | be/src/exec/tablet_sink.cpp | Xuxue1/incubator-doris | 3ea12dd5932b90ea949782e7ebf6a282cb75652b | [
"Apache-2.0"
] | null | null | null | be/src/exec/tablet_sink.cpp | Xuxue1/incubator-doris | 3ea12dd5932b90ea949782e7ebf6a282cb75652b | [
"Apache-2.0"
] | null | null | null | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
#include "exec/tablet_sink.h"
#include <sstream>
#include "exprs/expr.h"
#include "runtime/exec_env.h"
#include "runtime/row_batch.h"
#include "runtime/runtime_state.h"
#include "runtime/tuple_row.h"
#include "util/brpc_stub_cache.h"
#include "util/uid_util.h"
#include "service/brpc.h"
namespace doris {
namespace stream_load {
NodeChannel::NodeChannel(OlapTableSink* parent, int64_t index_id,
int64_t node_id, int32_t schema_hash)
: _parent(parent), _index_id(index_id),
_node_id(node_id), _schema_hash(schema_hash) {
}
NodeChannel::~NodeChannel() {
if (_open_closure != nullptr) {
if (_open_closure->unref()) {
delete _open_closure;
}
_open_closure = nullptr;
}
if (_add_batch_closure != nullptr) {
if (_add_batch_closure->unref()) {
delete _add_batch_closure;
}
_add_batch_closure = nullptr;
}
_add_batch_request.release_id();
}
Status NodeChannel::init(RuntimeState* state) {
_tuple_desc = _parent->_output_tuple_desc;
_node_info = _parent->_nodes_info->find_node(_node_id);
if (_node_info == nullptr) {
std::stringstream ss;
ss << "unknown node id, id=" << _node_id;
return Status::InternalError(ss.str());
}
RowDescriptor row_desc(_tuple_desc, false);
_batch.reset(new RowBatch(row_desc, state->batch_size(), _parent->_mem_tracker));
_stub = state->exec_env()->brpc_stub_cache()->get_stub(
_node_info->host, _node_info->brpc_port);
if (_stub == nullptr) {
LOG(WARNING) << "Get rpc stub failed, host=" << _node_info->host
<< ", port=" << _node_info->brpc_port;
return Status::InternalError("get rpc stub failed");
}
// Initialize _add_batch_request
_add_batch_request.set_allocated_id(&_parent->_load_id);
_add_batch_request.set_index_id(_index_id);
_add_batch_request.set_sender_id(_parent->_sender_id);
return Status::OK();
}
void NodeChannel::open() {
PTabletWriterOpenRequest request;
request.set_allocated_id(&_parent->_load_id);
request.set_index_id(_index_id);
request.set_txn_id(_parent->_txn_id);
request.set_allocated_schema(_parent->_schema->to_protobuf());
for (auto& tablet : _all_tablets) {
auto ptablet = request.add_tablets();
ptablet->set_partition_id(tablet.partition_id);
ptablet->set_tablet_id(tablet.tablet_id);
}
request.set_num_senders(_parent->_num_senders);
request.set_need_gen_rollup(_parent->_need_gen_rollup);
_open_closure = new RefCountClosure<PTabletWriterOpenResult>();
_open_closure->ref();
// This ref is for RPC's reference
_open_closure->ref();
_open_closure->cntl.set_timeout_ms(_rpc_timeout_ms);
_stub->tablet_writer_open(&_open_closure->cntl,
&request,
&_open_closure->result,
_open_closure);
request.release_id();
request.release_schema();
}
Status NodeChannel::open_wait() {
_open_closure->join();
if (_open_closure->cntl.Failed()) {
LOG(WARNING) << "failed to open tablet writer, error="
<< berror(_open_closure->cntl.ErrorCode())
<< ", error_text=" << _open_closure->cntl.ErrorText();
return Status::InternalError("failed to open tablet writer");
}
Status status(_open_closure->result.status());
if (_open_closure->unref()) {
delete _open_closure;
}
_open_closure = nullptr;
// add batch closure
_add_batch_closure = new RefCountClosure<PTabletWriterAddBatchResult>();
_add_batch_closure->ref();
return status;
}
Status NodeChannel::add_row(Tuple* input_tuple, int64_t tablet_id) {
auto row_no = _batch->add_row();
if (row_no == RowBatch::INVALID_ROW_INDEX) {
RETURN_IF_ERROR(_send_cur_batch());
row_no = _batch->add_row();
}
DCHECK_NE(row_no, RowBatch::INVALID_ROW_INDEX);
auto tuple = input_tuple->deep_copy(*_tuple_desc, _batch->tuple_data_pool());
_batch->get_row(row_no)->set_tuple(0, tuple);
_batch->commit_last_row();
_add_batch_request.add_tablet_ids(tablet_id);
return Status::OK();
}
Status NodeChannel::close(RuntimeState* state) {
auto st = _close(state);
_batch.reset();
return st;
}
Status NodeChannel::_close(RuntimeState* state) {
RETURN_IF_ERROR(_wait_in_flight_packet());
return _send_cur_batch(true);
}
Status NodeChannel::close_wait(RuntimeState* state) {
RETURN_IF_ERROR(_wait_in_flight_packet());
Status status(_add_batch_closure->result.status());
if (status.ok()) {
for (auto& tablet : _add_batch_closure->result.tablet_vec()) {
TTabletCommitInfo commit_info;
commit_info.tabletId = tablet.tablet_id();
commit_info.backendId = _node_id;
state->tablet_commit_infos().emplace_back(std::move(commit_info));
}
}
// clear batch after sendt
_batch.reset();
return status;
}
void NodeChannel::cancel() {
// Do we need to wait last rpc finished???
PTabletWriterCancelRequest request;
request.set_allocated_id(&_parent->_load_id);
request.set_index_id(_index_id);
request.set_sender_id(_parent->_sender_id);
auto closure = new RefCountClosure<PTabletWriterCancelResult>();
closure->ref();
closure->cntl.set_timeout_ms(_rpc_timeout_ms);
_stub->tablet_writer_cancel(&closure->cntl,
&request,
&closure->result,
closure);
request.release_id();
// reset batch
_batch.reset();
}
Status NodeChannel::_wait_in_flight_packet() {
if (!_has_in_flight_packet) {
return Status::OK();
}
SCOPED_RAW_TIMER(_parent->mutable_wait_in_flight_packet_ns());
_add_batch_closure->join();
_has_in_flight_packet = false;
if (_add_batch_closure->cntl.Failed()) {
LOG(WARNING) << "failed to send batch, error="
<< berror(_add_batch_closure->cntl.ErrorCode())
<< ", error_text=" << _add_batch_closure->cntl.ErrorText();
return Status::InternalError("failed to send batch");
}
return {_add_batch_closure->result.status()};
}
Status NodeChannel::_send_cur_batch(bool eos) {
RETURN_IF_ERROR(_wait_in_flight_packet());
// tablet_ids has already set when add row
_add_batch_request.set_eos(eos);
_add_batch_request.set_packet_seq(_next_packet_seq);
if (_batch->num_rows() > 0) {
SCOPED_RAW_TIMER(_parent->mutable_serialize_batch_ns());
_batch->serialize(_add_batch_request.mutable_row_batch());
}
_add_batch_closure->ref();
_add_batch_closure->cntl.Reset();
_add_batch_closure->cntl.set_timeout_ms(_rpc_timeout_ms);
if (eos) {
for (auto pid : _parent->_partition_ids) {
_add_batch_request.add_partition_ids(pid);
}
}
_stub->tablet_writer_add_batch(&_add_batch_closure->cntl,
&_add_batch_request,
&_add_batch_closure->result,
_add_batch_closure);
_add_batch_request.clear_tablet_ids();
_add_batch_request.clear_row_batch();
_add_batch_request.clear_partition_ids();
_has_in_flight_packet = true;
_next_packet_seq++;
_batch->reset();
return Status::OK();
}
IndexChannel::~IndexChannel() {
}
Status IndexChannel::init(RuntimeState* state,
const std::vector<TTabletWithPartition>& tablets) {
// nodeId -> tabletIds
std::map<int64_t, std::vector<int64_t>> tablets_by_node;
for (auto& tablet : tablets) {
auto location = _parent->_location->find_tablet(tablet.tablet_id);
if (location == nullptr) {
LOG(WARNING) << "unknow tablet, tablet_id=" << tablet.tablet_id;
return Status::InternalError("unknown tablet");
}
std::vector<NodeChannel*> channels;
for (auto& node_id : location->node_ids) {
NodeChannel* channel = nullptr;
auto it = _node_channels.find(node_id);
if (it == std::end(_node_channels)) {
channel = _parent->_pool->add(
new NodeChannel(_parent, _index_id, node_id, _schema_hash));
_node_channels.emplace(node_id, channel);
} else {
channel = it->second;
}
channel->add_tablet(tablet);
channels.push_back(channel);
}
_channels_by_tablet.emplace(tablet.tablet_id, std::move(channels));
}
for (auto& it : _node_channels) {
RETURN_IF_ERROR(it.second->init(state));
}
return Status::OK();
}
Status IndexChannel::open() {
for (auto& it : _node_channels) {
it.second->open();
}
for (auto& it : _node_channels) {
auto channel = it.second;
auto st = channel->open_wait();
if (!st.ok()) {
LOG(WARNING) << "tablet open failed, load_id=" << _parent->_load_id
<< ", node=" << channel->node_info()->host
<< ":" << channel->node_info()->brpc_port
<< ", errmsg=" << st.get_error_msg();
if (_handle_failed_node(channel)) {
LOG(WARNING) << "open failed, load_id=" << _parent->_load_id;
return st;
}
}
}
return Status::OK();
}
Status IndexChannel::add_row(Tuple* tuple, int64_t tablet_id) {
auto it = _channels_by_tablet.find(tablet_id);
DCHECK(it != std::end(_channels_by_tablet)) << "unknown tablet, tablet_id=" << tablet_id;
for (auto channel : it->second) {
if (channel->already_failed()) {
continue;
}
auto st = channel->add_row(tuple, tablet_id);
if (!st.ok()) {
LOG(WARNING) << "NodeChannel add row failed, load_id=" << _parent->_load_id
<< ", tablet_id=" << tablet_id
<< ", node=" << channel->node_info()->host
<< ":" << channel->node_info()->brpc_port
<< ", errmsg=" << st.get_error_msg();
if (_handle_failed_node(channel)) {
LOG(WARNING) << "add row failed, load_id=" << _parent->_load_id;
return st;
}
}
}
return Status::OK();
}
Status IndexChannel::close(RuntimeState* state) {
std::vector<NodeChannel*> need_wait_channels;
need_wait_channels.reserve(_node_channels.size());
Status close_status;
for (auto& it : _node_channels) {
auto channel = it.second;
if (channel->already_failed() || !close_status.ok()) {
channel->cancel();
continue;
}
auto st = channel->close(state);
if (st.ok()) {
need_wait_channels.push_back(channel);
} else {
LOG(WARNING) << "close node channel failed, load_id=" << _parent->_load_id
<< ", node=" << channel->node_info()->host
<< ":" << channel->node_info()->brpc_port
<< ", errmsg=" << st.get_error_msg();
if (_handle_failed_node(channel)) {
LOG(WARNING) << "close failed, load_id=" << _parent->_load_id;
close_status = st;
}
}
}
if (close_status.ok()) {
for (auto channel : need_wait_channels) {
auto st = channel->close_wait(state);
if (!st.ok()) {
LOG(WARNING) << "close_wait node channel failed, load_id=" << _parent->_load_id
<< ", node=" << channel->node_info()->host
<< ":" << channel->node_info()->brpc_port
<< ", errmsg=" << st.get_error_msg();
if (_handle_failed_node(channel)) {
LOG(WARNING) << "close_wait failed, load_id=" << _parent->_load_id;
return st;
}
}
}
}
return close_status;
}
void IndexChannel::cancel() {
for (auto& it : _node_channels) {
it.second->cancel();
}
}
bool IndexChannel::_handle_failed_node(NodeChannel* channel) {
DCHECK(!channel->already_failed());
channel->set_failed();
_num_failed_channels++;
return _num_failed_channels >= ((_parent->_num_repicas + 1) / 2);
}
OlapTableSink::OlapTableSink(ObjectPool* pool,
const RowDescriptor& row_desc,
const std::vector<TExpr>& texprs,
Status* status)
: _pool(pool), _input_row_desc(row_desc), _filter_bitmap(1024) {
if (!texprs.empty()) {
*status = Expr::create_expr_trees(_pool, texprs, &_output_expr_ctxs);
}
}
OlapTableSink::~OlapTableSink() {
}
Status OlapTableSink::init(const TDataSink& t_sink) {
DCHECK(t_sink.__isset.olap_table_sink);
auto& table_sink = t_sink.olap_table_sink;
_load_id.set_hi(table_sink.load_id.hi);
_load_id.set_lo(table_sink.load_id.lo);
_txn_id = table_sink.txn_id;
_db_id = table_sink.db_id;
_table_id = table_sink.table_id;
_num_repicas = table_sink.num_replicas;
_need_gen_rollup = table_sink.need_gen_rollup;
_db_name = table_sink.db_name;
_table_name = table_sink.table_name;
_tuple_desc_id = table_sink.tuple_id;
_schema.reset(new OlapTableSchemaParam());
RETURN_IF_ERROR(_schema->init(table_sink.schema));
_partition = _pool->add(new OlapTablePartitionParam(_schema, table_sink.partition));
RETURN_IF_ERROR(_partition->init());
_location = _pool->add(new OlapTableLocationParam(table_sink.location));
_nodes_info = _pool->add(new DorisNodesInfo(table_sink.nodes_info));
return Status::OK();
}
Status OlapTableSink::prepare(RuntimeState* state) {
RETURN_IF_ERROR(DataSink::prepare(state));
_sender_id = state->per_fragment_instance_idx();
_num_senders = state->num_per_fragment_instances();
// profile must add to state's object pool
_profile = state->obj_pool()->add(new RuntimeProfile(_pool, "OlapTableSink"));
_mem_tracker = _pool->add(
new MemTracker(-1, "OlapTableSink", state->instance_mem_tracker()));
SCOPED_TIMER(_profile->total_time_counter());
// Prepare the exprs to run.
RETURN_IF_ERROR(Expr::prepare(_output_expr_ctxs, state,
_input_row_desc, _expr_mem_tracker.get()));
// get table's tuple descriptor
_output_tuple_desc = state->desc_tbl().get_tuple_descriptor(_tuple_desc_id);
if (_output_tuple_desc == nullptr) {
LOG(WARNING) << "unknown destination tuple descriptor, id=" << _tuple_desc_id;
return Status::InternalError("unknown destination tuple descriptor");
}
if (!_output_expr_ctxs.empty()) {
if (_output_expr_ctxs.size() != _output_tuple_desc->slots().size()) {
LOG(WARNING) << "number of exprs is not same with slots, num_exprs="
<< _output_expr_ctxs.size()
<< ", num_slots=" << _output_tuple_desc->slots().size();
return Status::InternalError("number of exprs is not same with slots");
}
for (int i = 0; i < _output_expr_ctxs.size(); ++i) {
if (!is_type_compatible(_output_expr_ctxs[i]->root()->type().type,
_output_tuple_desc->slots()[i]->type().type)) {
LOG(WARNING) << "type of exprs is not match slot's, expr_type="
<< _output_expr_ctxs[i]->root()->type().type
<< ", slot_type=" << _output_tuple_desc->slots()[i]->type().type
<< ", slot_name=" << _output_tuple_desc->slots()[i]->col_name();
return Status::InternalError("expr's type is not same with slot's");
}
}
}
_output_row_desc = _pool->add(new RowDescriptor(_output_tuple_desc, false));
_output_batch.reset(new RowBatch(*_output_row_desc, state->batch_size(), _mem_tracker));
_max_decimal_val.resize(_output_tuple_desc->slots().size());
_min_decimal_val.resize(_output_tuple_desc->slots().size());
_max_decimalv2_val.resize(_output_tuple_desc->slots().size());
_min_decimalv2_val.resize(_output_tuple_desc->slots().size());
// check if need validate batch
for (int i = 0; i < _output_tuple_desc->slots().size(); ++i) {
auto slot = _output_tuple_desc->slots()[i];
switch (slot->type().type) {
case TYPE_DECIMAL:
_max_decimal_val[i].to_max_decimal(slot->type().precision, slot->type().scale);
_min_decimal_val[i].to_min_decimal(slot->type().precision, slot->type().scale);
_need_validate_data = true;
break;
case TYPE_DECIMALV2:
_max_decimalv2_val[i].to_max_decimal(slot->type().precision, slot->type().scale);
_min_decimalv2_val[i].to_min_decimal(slot->type().precision, slot->type().scale);
_need_validate_data = true;
break;
case TYPE_CHAR:
case TYPE_VARCHAR:
case TYPE_DATE:
case TYPE_DATETIME:
_need_validate_data = true;
break;
default:
break;
}
}
// add all counter
_input_rows_counter = ADD_COUNTER(_profile, "RowsRead", TUnit::UNIT);
_output_rows_counter = ADD_COUNTER(_profile, "RowsReturned", TUnit::UNIT);
_filtered_rows_counter = ADD_COUNTER(_profile, "RowsFiltered", TUnit::UNIT);
_send_data_timer = ADD_TIMER(_profile, "SendDataTime");
_convert_batch_timer = ADD_TIMER(_profile, "ConvertBatchTime");
_validate_data_timer = ADD_TIMER(_profile, "ValidateDataTime");
_open_timer = ADD_TIMER(_profile, "OpenTime");
_close_timer = ADD_TIMER(_profile, "CloseTime");
_wait_in_flight_packet_timer = ADD_TIMER(_profile, "WaitInFlightPacketTime");
_serialize_batch_timer = ADD_TIMER(_profile, "SerializeBatchTime");
// open all channels
auto& partitions = _partition->get_partitions();
for (int i = 0; i < _schema->indexes().size(); ++i) {
// collect all tablets belong to this rollup
std::vector<TTabletWithPartition> tablets;
auto index = _schema->indexes()[i];
for (auto part : partitions) {
for (auto tablet : part->indexes[i].tablets) {
TTabletWithPartition tablet_with_partition;
tablet_with_partition.partition_id = part->id;
tablet_with_partition.tablet_id = tablet;
tablets.emplace_back(std::move(tablet_with_partition));
}
}
auto channel = _pool->add(new IndexChannel(this, index->index_id, index->schema_hash));
RETURN_IF_ERROR(channel->init(state, tablets));
_channels.emplace_back(channel);
}
return Status::OK();
}
Status OlapTableSink::open(RuntimeState* state) {
SCOPED_TIMER(_profile->total_time_counter());
SCOPED_TIMER(_open_timer);
// Prepare the exprs to run.
RETURN_IF_ERROR(Expr::open(_output_expr_ctxs, state));
for (auto channel : _channels) {
RETURN_IF_ERROR(channel->open());
}
return Status::OK();
}
Status OlapTableSink::send(RuntimeState* state, RowBatch* input_batch) {
SCOPED_TIMER(_profile->total_time_counter());
_number_input_rows += input_batch->num_rows();
RowBatch* batch = input_batch;
if (!_output_expr_ctxs.empty()) {
SCOPED_RAW_TIMER(&_convert_batch_ns);
_output_batch->reset();
_convert_batch(state, input_batch, _output_batch.get());
batch = _output_batch.get();
}
int num_invalid_rows = 0;
if (_need_validate_data) {
SCOPED_RAW_TIMER(&_validate_data_ns);
_filter_bitmap.Reset(batch->num_rows());
num_invalid_rows = _validate_data(state, batch, &_filter_bitmap);
_number_filtered_rows += num_invalid_rows;
}
SCOPED_RAW_TIMER(&_send_data_ns);
for (int i = 0; i < batch->num_rows(); ++i) {
Tuple* tuple = batch->get_row(i)->get_tuple(0);
if (num_invalid_rows > 0 && _filter_bitmap.Get(i)) {
continue;
}
const OlapTablePartition* partition = nullptr;
uint32_t dist_hash = 0;
if (!_partition->find_tablet(tuple, &partition, &dist_hash)) {
std::stringstream ss;
ss << "no partition for this tuple. tuple="
<< Tuple::to_string(tuple, *_output_tuple_desc);
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
_number_filtered_rows++;
continue;
}
_partition_ids.emplace(partition->id);
uint32_t tablet_index = dist_hash % partition->num_buckets;
for (int j = 0; j < partition->indexes.size(); ++j) {
int64_t tablet_id = partition->indexes[j].tablets[tablet_index];
RETURN_IF_ERROR(_channels[j]->add_row(tuple, tablet_id));
_number_output_rows++;
}
}
return Status::OK();
}
Status OlapTableSink::close(RuntimeState* state, Status close_status) {
Status status = close_status;
if (status.ok()) {
// SCOPED_TIMER should only be called is status is ok.
// if status is not ok, this OlapTableSink may not be prepared,
// so the `_profile` may be null.
SCOPED_TIMER(_profile->total_time_counter());
{
SCOPED_TIMER(_close_timer);
for (auto channel : _channels) {
status = channel->close(state);
if (!status.ok()) {
LOG(WARNING) << "close channel failed, load_id=" << _load_id
<< ", txn_id=" << _txn_id;
}
}
}
COUNTER_SET(_input_rows_counter, _number_input_rows);
COUNTER_SET(_output_rows_counter, _number_output_rows);
COUNTER_SET(_filtered_rows_counter, _number_filtered_rows);
COUNTER_SET(_send_data_timer, _send_data_ns);
COUNTER_SET(_convert_batch_timer, _convert_batch_ns);
COUNTER_SET(_validate_data_timer, _validate_data_ns);
COUNTER_SET(_wait_in_flight_packet_timer, _wait_in_flight_packet_ns);
COUNTER_SET(_serialize_batch_timer, _serialize_batch_ns);
state->update_num_rows_load_filtered(_number_filtered_rows);
} else {
for (auto channel : _channels) {
channel->cancel();
}
}
Expr::close(_output_expr_ctxs, state);
_output_batch.reset();
return status;
}
void OlapTableSink::_convert_batch(RuntimeState* state, RowBatch* input_batch, RowBatch* output_batch) {
DCHECK_GE(output_batch->capacity(), input_batch->num_rows());
int commit_rows = 0;
for (int i = 0; i < input_batch->num_rows(); ++i) {
auto src_row = input_batch->get_row(i);
Tuple* dst_tuple = (Tuple*)output_batch->tuple_data_pool()->allocate(
_output_tuple_desc->byte_size());
bool exist_null_value_for_not_null_col = false;
for (int j = 0; j < _output_expr_ctxs.size(); ++j) {
auto src_val = _output_expr_ctxs[j]->get_value(src_row);
auto slot_desc = _output_tuple_desc->slots()[j];
if (slot_desc->is_nullable()) {
if (src_val == nullptr) {
dst_tuple->set_null(slot_desc->null_indicator_offset());
continue;
} else {
dst_tuple->set_not_null(slot_desc->null_indicator_offset());
}
} else {
if (src_val == nullptr) {
std::stringstream ss;
ss << "null value for not null column, column=" << slot_desc->col_name();
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
exist_null_value_for_not_null_col = true;
_number_filtered_rows++;
break;
}
}
void* slot = dst_tuple->get_slot(slot_desc->tuple_offset());
RawValue::write(src_val, slot, slot_desc->type(), _output_batch->tuple_data_pool());
}
if (!exist_null_value_for_not_null_col) {
output_batch->get_row(commit_rows)->set_tuple(0, dst_tuple);
commit_rows++;
}
}
output_batch->commit_rows(commit_rows);
}
int OlapTableSink::_validate_data(RuntimeState* state, RowBatch* batch, Bitmap* filter_bitmap) {
int filtered_rows = 0;
for (int row_no = 0; row_no < batch->num_rows(); ++row_no) {
Tuple* tuple = batch->get_row(row_no)->get_tuple(0);
bool row_valid = true;
for (int i = 0; row_valid && i < _output_tuple_desc->slots().size(); ++i) {
SlotDescriptor* desc = _output_tuple_desc->slots()[i];
if (tuple->is_null(desc->null_indicator_offset())) {
continue;
}
void* slot = tuple->get_slot(desc->tuple_offset());
switch (desc->type().type) {
case TYPE_CHAR:
case TYPE_VARCHAR: {
// Fixed length string
StringValue* str_val = (StringValue*)slot;
if (str_val->len > desc->type().len) {
std::stringstream ss;
ss << "the length of input is too long than schema. "
<< "column_name: " << desc->col_name() << "; "
<< "input_str: [" << std::string(str_val->ptr, str_val->len) << "] "
<< "schema length: " << desc->type().len << "; "
<< "actual length: " << str_val->len << "; ";
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
filtered_rows++;
row_valid = false;
filter_bitmap->Set(row_no, true);
continue;
}
// padding 0 to CHAR field
if (desc->type().type == TYPE_CHAR
&& str_val->len < desc->type().len) {
auto new_ptr = (char*)batch->tuple_data_pool()->allocate(desc->type().len);
memcpy(new_ptr, str_val->ptr, str_val->len);
memset(new_ptr + str_val->len, 0, desc->type().len - str_val->len);
str_val->ptr = new_ptr;
str_val->len = desc->type().len;
}
break;
}
case TYPE_DECIMAL: {
DecimalValue* dec_val = (DecimalValue*)slot;
if (dec_val->scale() > desc->type().scale) {
int code = dec_val->round(dec_val, desc->type().scale, HALF_UP);
if (code != E_DEC_OK) {
std::stringstream ss;
ss << "round one decimal failed.value=" << dec_val->to_string();
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
filtered_rows++;
row_valid = false;
filter_bitmap->Set(row_no, true);
continue;
}
}
if (*dec_val > _max_decimal_val[i] || *dec_val < _min_decimal_val[i]) {
std::stringstream ss;
ss << "decimal value is not valid for defination, column=" << desc->col_name()
<< ", value=" << dec_val->to_string()
<< ", precision=" << desc->type().precision
<< ", scale=" << desc->type().scale;
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
filtered_rows++;
row_valid = false;
filter_bitmap->Set(row_no, true);
continue;
}
break;
}
case TYPE_DECIMALV2: {
DecimalV2Value dec_val(reinterpret_cast<const PackedInt128*>(slot)->value);
if (dec_val.greater_than_scale(desc->type().scale)) {
int code = dec_val.round(&dec_val, desc->type().scale, HALF_UP);
reinterpret_cast<PackedInt128*>(slot)->value = dec_val.value();
if (code != E_DEC_OK) {
std::stringstream ss;
ss << "round one decimal failed.value=" << dec_val.to_string();
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
filtered_rows++;
row_valid = false;
filter_bitmap->Set(row_no, true);
continue;
}
}
if (dec_val > _max_decimalv2_val[i] || dec_val < _min_decimalv2_val[i]) {
std::stringstream ss;
ss << "decimal value is not valid for defination, column=" << desc->col_name()
<< ", value=" << dec_val.to_string()
<< ", precision=" << desc->type().precision
<< ", scale=" << desc->type().scale;
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
filtered_rows++;
row_valid = false;
filter_bitmap->Set(row_no, true);
continue;
}
break;
}
case TYPE_DATE:
case TYPE_DATETIME: {
static DateTimeValue s_min_value = DateTimeValue(19000101000000UL);
// static DateTimeValue s_max_value = DateTimeValue(99991231235959UL);
DateTimeValue* date_val = (DateTimeValue*)slot;
if (*date_val < s_min_value) {
std::stringstream ss;
ss << "datetime value is not valid, column=" << desc->col_name()
<< ", value=" << date_val->debug_string();
#if BE_TEST
LOG(INFO) << ss.str();
#else
state->append_error_msg_to_file("", ss.str());
#endif
filtered_rows++;
row_valid = false;
filter_bitmap->Set(row_no, true);
continue;
}
}
default:
break;
}
}
}
return filtered_rows;
}
}
}
| 38.416058 | 104 | 0.586991 | Xuxue1 |
9cbe30c285c0a5ceedf852f0e51262d3e9cefa12 | 9,915 | hxx | C++ | opencascade/Graphic3d_GraduatedTrihedron.hxx | mgreminger/OCP | 92eacb99497cd52b419c8a4a8ab0abab2330ed42 | [
"Apache-2.0"
] | null | null | null | opencascade/Graphic3d_GraduatedTrihedron.hxx | mgreminger/OCP | 92eacb99497cd52b419c8a4a8ab0abab2330ed42 | [
"Apache-2.0"
] | null | null | null | opencascade/Graphic3d_GraduatedTrihedron.hxx | mgreminger/OCP | 92eacb99497cd52b419c8a4a8ab0abab2330ed42 | [
"Apache-2.0"
] | null | null | null | // Created on: 2011-03-06
// Created by: Sergey ZERCHANINOV
// Copyright (c) 2011-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
#ifndef _Graphic3d_GraduatedTrihedron_HeaderFile
#define _Graphic3d_GraduatedTrihedron_HeaderFile
#include <Font_FontAspect.hxx>
#include <NCollection_Array1.hxx>
#include <Quantity_Color.hxx>
#include <Standard_Boolean.hxx>
#include <Standard_Integer.hxx>
#include <TCollection_AsciiString.hxx>
#include <TCollection_ExtendedString.hxx>
class Graphic3d_CView;
//! Defines the class of a graduated trihedron.
//! It contains main style parameters for implementation of graduated trihedron
//! @sa OpenGl_GraduatedTrihedron
class Graphic3d_GraduatedTrihedron
{
public:
//! Class that stores style for one graduated trihedron axis such as colors, lengths and customization flags.
//! It is used in Graphic3d_GraduatedTrihedron.
class AxisAspect
{
public:
AxisAspect (const TCollection_ExtendedString theName = "", const Quantity_Color theNameColor = Quantity_NOC_BLACK,
const Quantity_Color theColor = Quantity_NOC_BLACK,
const Standard_Integer theValuesOffset = 10, const Standard_Integer theNameOffset = 30,
const Standard_Integer theTickmarksNumber = 5, const Standard_Integer theTickmarksLength = 10,
const Standard_Boolean theToDrawName = Standard_True,
const Standard_Boolean theToDrawValues = Standard_True,
const Standard_Boolean theToDrawTickmarks = Standard_True)
: myName (theName),
myToDrawName (theToDrawName),
myToDrawTickmarks (theToDrawTickmarks),
myToDrawValues (theToDrawValues),
myNameColor (theNameColor),
myTickmarksNumber (theTickmarksNumber),
myTickmarksLength (theTickmarksLength),
myColor (theColor),
myValuesOffset (theValuesOffset),
myNameOffset (theNameOffset)
{ }
public:
void SetName (const TCollection_ExtendedString& theName) { myName = theName; }
const TCollection_ExtendedString& Name() const { return myName; }
Standard_Boolean ToDrawName() const { return myToDrawName; }
void SetDrawName (const Standard_Boolean theToDraw) { myToDrawName = theToDraw; }
Standard_Boolean ToDrawTickmarks() const { return myToDrawTickmarks; }
void SetDrawTickmarks (const Standard_Boolean theToDraw) { myToDrawTickmarks = theToDraw; }
Standard_Boolean ToDrawValues() const { return myToDrawValues; }
void SetDrawValues (const Standard_Boolean theToDraw) { myToDrawValues = theToDraw; }
const Quantity_Color& NameColor() const { return myNameColor; }
void SetNameColor (const Quantity_Color& theColor) { myNameColor = theColor; }
//! Color of axis and values
const Quantity_Color& Color() const { return myColor; }
//! Sets color of axis and values
void SetColor (const Quantity_Color& theColor) { myColor = theColor; }
Standard_Integer TickmarksNumber() const { return myTickmarksNumber; }
void SetTickmarksNumber (const Standard_Integer theValue) { myTickmarksNumber = theValue; }
Standard_Integer TickmarksLength() const { return myTickmarksLength; }
void SetTickmarksLength (const Standard_Integer theValue) { myTickmarksLength = theValue; }
Standard_Integer ValuesOffset() const { return myValuesOffset; }
void SetValuesOffset (const Standard_Integer theValue) { myValuesOffset = theValue; }
Standard_Integer NameOffset() const { return myNameOffset; }
void SetNameOffset (const Standard_Integer theValue) { myNameOffset = theValue; }
protected:
TCollection_ExtendedString myName;
Standard_Boolean myToDrawName;
Standard_Boolean myToDrawTickmarks;
Standard_Boolean myToDrawValues;
Quantity_Color myNameColor;
Standard_Integer myTickmarksNumber; //!< Number of splits along axes
Standard_Integer myTickmarksLength; //!< Length of tickmarks
Quantity_Color myColor; //!< Color of axis and values
Standard_Integer myValuesOffset; //!< Offset for drawing values
Standard_Integer myNameOffset; //!< Offset for drawing name of axis
};
public:
typedef void (*MinMaxValuesCallback) (Graphic3d_CView*);
public:
//! Default constructor
//! Constructs the default graduated trihedron with grid, X, Y, Z axes, and tickmarks
Graphic3d_GraduatedTrihedron (const TCollection_AsciiString& theNamesFont = "Arial",
const Font_FontAspect& theNamesStyle = Font_FA_Bold, const Standard_Integer theNamesSize = 12,
const TCollection_AsciiString& theValuesFont = "Arial",
const Font_FontAspect& theValuesStyle = Font_FA_Regular, const Standard_Integer theValuesSize = 12,
const Standard_ShortReal theArrowsLength = 30.0f, const Quantity_Color theGridColor = Quantity_NOC_WHITE,
const Standard_Boolean theToDrawGrid = Standard_True, const Standard_Boolean theToDrawAxes = Standard_True)
: myCubicAxesCallback (NULL),
myNamesFont (theNamesFont),
myNamesStyle (theNamesStyle),
myNamesSize (theNamesSize),
myValuesFont (theValuesFont),
myValuesStyle (theValuesStyle),
myValuesSize (theValuesSize),
myArrowsLength (theArrowsLength),
myGridColor (theGridColor),
myToDrawGrid (theToDrawGrid),
myToDrawAxes (theToDrawAxes),
myAxes(0, 2)
{
myAxes (0) = AxisAspect ("X", Quantity_NOC_RED, Quantity_NOC_RED);
myAxes (1) = AxisAspect ("Y", Quantity_NOC_GREEN, Quantity_NOC_GREEN);
myAxes (2) = AxisAspect ("Z", Quantity_NOC_BLUE1, Quantity_NOC_BLUE1);
}
public:
AxisAspect& ChangeXAxisAspect() { return myAxes(0); }
AxisAspect& ChangeYAxisAspect() { return myAxes(1); }
AxisAspect& ChangeZAxisAspect() { return myAxes(2); }
AxisAspect& ChangeAxisAspect (const Standard_Integer theIndex)
{
Standard_OutOfRange_Raise_if (theIndex < 0 || theIndex > 2, "Graphic3d_GraduatedTrihedron::ChangeAxisAspect: theIndex is out of bounds [0,2].");
return myAxes (theIndex);
}
const AxisAspect& XAxisAspect() const { return myAxes(0); }
const AxisAspect& YAxisAspect() const { return myAxes(1); }
const AxisAspect& ZAxisAspect() const { return myAxes(2); }
const AxisAspect& AxisAspectAt (const Standard_Integer theIndex) const
{
Standard_OutOfRange_Raise_if (theIndex < 0 || theIndex > 2, "Graphic3d_GraduatedTrihedron::AxisAspect: theIndex is out of bounds [0,2].");
return myAxes (theIndex);
}
Standard_ShortReal ArrowsLength() const { return myArrowsLength; }
void SetArrowsLength (const Standard_ShortReal theValue) { myArrowsLength = theValue; }
const Quantity_Color& GridColor() const { return myGridColor; }
void SetGridColor (const Quantity_Color& theColor) {myGridColor = theColor; }
Standard_Boolean ToDrawGrid() const { return myToDrawGrid; }
void SetDrawGrid (const Standard_Boolean theToDraw) { myToDrawGrid = theToDraw; }
Standard_Boolean ToDrawAxes() const { return myToDrawAxes; }
void SetDrawAxes (const Standard_Boolean theToDraw) { myToDrawAxes = theToDraw; }
const TCollection_AsciiString& NamesFont() const { return myNamesFont; }
void SetNamesFont (const TCollection_AsciiString& theFont) { myNamesFont = theFont; }
Font_FontAspect NamesFontAspect() const { return myNamesStyle; }
void SetNamesFontAspect (Font_FontAspect theAspect) { myNamesStyle = theAspect; }
Standard_Integer NamesSize() const { return myNamesSize; }
void SetNamesSize (const Standard_Integer theValue) { myNamesSize = theValue; }
const TCollection_AsciiString& ValuesFont () const { return myValuesFont; }
void SetValuesFont (const TCollection_AsciiString& theFont) { myValuesFont = theFont; }
Font_FontAspect ValuesFontAspect() const { return myValuesStyle; }
void SetValuesFontAspect (Font_FontAspect theAspect) { myValuesStyle = theAspect; }
Standard_Integer ValuesSize() const { return myValuesSize; }
void SetValuesSize (const Standard_Integer theValue) { myValuesSize = theValue; }
Standard_Boolean CubicAxesCallback(Graphic3d_CView* theView) const
{
if (myCubicAxesCallback != NULL)
{
myCubicAxesCallback (theView);
return Standard_True;
}
return Standard_False;
}
void SetCubicAxesCallback (const MinMaxValuesCallback theCallback) { myCubicAxesCallback = theCallback; }
protected:
MinMaxValuesCallback myCubicAxesCallback; //!< Callback function to define boundary box of displayed objects
TCollection_AsciiString myNamesFont; //!< Font name of names of axes: Courier, Arial, ...
Font_FontAspect myNamesStyle; //!< Style of names of axes: OSD_FA_Regular, OSD_FA_Bold,..
Standard_Integer myNamesSize; //!< Size of names of axes: 8, 10,..
protected:
TCollection_AsciiString myValuesFont; //!< Font name of values: Courier, Arial, ...
Font_FontAspect myValuesStyle; //!< Style of values: OSD_FA_Regular, OSD_FA_Bold, ...
Standard_Integer myValuesSize; //!< Size of values: 8, 10, 12, 14, ...
protected:
Standard_ShortReal myArrowsLength;
Quantity_Color myGridColor;
Standard_Boolean myToDrawGrid;
Standard_Boolean myToDrawAxes;
NCollection_Array1<AxisAspect> myAxes; //!< X, Y and Z axes parameters
};
#endif // Graphic3d_GraduatedTrihedron_HeaderFile
| 42.012712 | 148 | 0.741503 | mgreminger |
9cbf95027924eb40ae799b2ba58d260f249d76e3 | 405 | cpp | C++ | BasicPhysicsEngine/main.cpp | adityadutta/BasicPhysicsEngine | dfd85f1f3a25e573c09ca420115c2a4e701c5dc0 | [
"MIT"
] | 1 | 2018-12-12T21:20:37.000Z | 2018-12-12T21:20:37.000Z | BasicPhysicsEngine/main.cpp | adityadutta/BasicPhysicsEngine | dfd85f1f3a25e573c09ca420115c2a4e701c5dc0 | [
"MIT"
] | null | null | null | BasicPhysicsEngine/main.cpp | adityadutta/BasicPhysicsEngine | dfd85f1f3a25e573c09ca420115c2a4e701c5dc0 | [
"MIT"
] | 1 | 2018-12-12T21:21:23.000Z | 2018-12-12T21:21:23.000Z | #include "GameManager.h"
#include <iostream>
int main(int argc, char* args[])
{
GameManager *ptr = new GameManager();
bool status = ptr->OnCreate();
if (status == true) {
ptr->Run();
}
else if (status == false) {
/// You should have learned about stderr (std::cerr) in Operating Systems
std::cerr << "Fatal error occured. Cannot start this program" << std::endl;
}
delete ptr;
return 0;
} | 22.5 | 77 | 0.654321 | adityadutta |
9cc07313177f18bb06a2ce21d9ad1294e39fa0d5 | 1,636 | hpp | C++ | Nana.Cpp03/include/nana/threads/thread.hpp | gfannes/nana | 3b8d33f9a98579684ea0440b6952deabe61bd978 | [
"BSL-1.0"
] | 1 | 2018-02-09T21:25:13.000Z | 2018-02-09T21:25:13.000Z | Nana.Cpp03/include/nana/threads/thread.hpp | gfannes/nana | 3b8d33f9a98579684ea0440b6952deabe61bd978 | [
"BSL-1.0"
] | null | null | null | Nana.Cpp03/include/nana/threads/thread.hpp | gfannes/nana | 3b8d33f9a98579684ea0440b6952deabe61bd978 | [
"BSL-1.0"
] | null | null | null | /*
* Thread Implementation
* Copyright(C) 2003-2013 Jinhao([email protected])
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
* @file: nana/threads/thread.hpp
*/
#ifndef NANA_THREADS_THREAD_HPP
#define NANA_THREADS_THREAD_HPP
#include <map>
#include "mutex.hpp"
#include "../exceptions.hpp"
#include "../traits.hpp"
#include <nana/functor.hpp>
namespace nana
{
namespace threads
{
class thread;
namespace detail
{
struct thread_object_impl;
class thread_holder
{
public:
void insert(unsigned tid, thread* obj);
thread* get(unsigned tid);
void remove(unsigned tid);
private:
threads::recursive_mutex mutex_;
std::map<unsigned, thread*> map_;
};
}//end namespace detail
class thread
:nana::noncopyable
{
typedef thread self_type;
public:
thread();
~thread();
template<typename Functor>
void start(const Functor& f)
{
close();
_m_start_thread(f);
}
template<typename Object, typename Concept>
void start(Object& obj, void (Concept::*memf)())
{
close();
_m_start_thread(nana::functor<void()>(obj, memf));
}
bool empty() const;
unsigned tid() const;
void close();
static void check_break(int retval);
private:
void _m_start_thread(const nana::functor<void()>& f);
private:
void _m_add_tholder();
unsigned _m_thread_routine();
private:
detail::thread_object_impl* impl_;
static detail::thread_holder tholder;
};
}//end namespace threads
}//end namespace nana
#endif
| 19.47619 | 61 | 0.680318 | gfannes |
9cc1d9aa5ffe9e9c8a2e701fe211822c907f10ca | 488 | cpp | C++ | gen/blink/modules/serviceworkers/ClientQueryOptions.cpp | gergul/MiniBlink | 7a11c52f141d54d5f8e1a9af31867cd120a2c3c4 | [
"Apache-2.0"
] | 8 | 2019-05-05T16:38:05.000Z | 2021-11-09T11:45:38.000Z | gen/blink/modules/serviceworkers/ClientQueryOptions.cpp | gergul/MiniBlink | 7a11c52f141d54d5f8e1a9af31867cd120a2c3c4 | [
"Apache-2.0"
] | null | null | null | gen/blink/modules/serviceworkers/ClientQueryOptions.cpp | gergul/MiniBlink | 7a11c52f141d54d5f8e1a9af31867cd120a2c3c4 | [
"Apache-2.0"
] | 4 | 2018-12-14T07:52:46.000Z | 2021-06-11T18:06:09.000Z | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This file has been auto-generated by code_generator_v8.py. DO NOT MODIFY!
#include "config.h"
#include "ClientQueryOptions.h"
namespace blink {
ClientQueryOptions::ClientQueryOptions()
{
setIncludeUncontrolled(false);
setType(String("window"));
}
DEFINE_TRACE(ClientQueryOptions)
{
}
} // namespace blink
| 20.333333 | 76 | 0.747951 | gergul |
9cc246112cbf1f8e0aca0977fa0fea216c914593 | 277 | hpp | C++ | cmdstan/stan/src/stan/lang/ast/fun/is_space_def.hpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | 1 | 2019-07-05T01:40:40.000Z | 2019-07-05T01:40:40.000Z | cmdstan/stan/src/stan/lang/ast/fun/is_space_def.hpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | cmdstan/stan/src/stan/lang/ast/fun/is_space_def.hpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | #ifndef STAN_LANG_AST_FUN_IS_SPACE_DEF_HPP
#define STAN_LANG_AST_FUN_IS_SPACE_DEF_HPP
#include <stan/lang/ast/fun/is_space.hpp>
namespace stan {
namespace lang {
bool is_space(char c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t';
}
}
}
#endif
| 17.3125 | 61 | 0.624549 | yizhang-cae |
Subsets and Splits