sha256 stringlengths 64 64 | language stringclasses 27
values | size int32 1 491k | lines int32 1 21.8k | content stringlengths 1 200k |
|---|---|---|---|---|
0c990dd9aadda58ccf4890213795dfa95b0b8482020f337308ea629ced325ac0 | C++ | 321 | 15 | #include "../Eigen/Core"
#ifdef EIGEN_SHOULD_FAIL_TO_BUILD
#define CV_QUALIFIER
#else
#define CV_QUALIFIER const
#endif
using namespace Eigen;
void foo(const float *ptr, DenseIndex rows, DenseIndex cols){
Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
}
int main() {}... |
7fb3f678aaa7e12b6bedb9342f8d5d40038a0dc83879e7d4a30648475bb50344 | C++ | 324 | 8 | Matrix3f m = Matrix3f::Random();
Matrix3f y = Matrix3f::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the matrix y:" << endl << y << endl;
Matrix3f x;
x = m.colPivHouseholderQr().solve(y);
assert(y.isApprox(m*x));
cout << "Here is a solution x to the equation mx=y:" << endl << x << en... |
b7bf9192ca2e471a08d31e1ceecea8c70ec65e5a210453ba5e8cd5c33211cef2 | C++ | 325 | 8 | Matrix3f m = Matrix3f::Random();
Matrix3f y = Matrix3f::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the matrix y:" << endl << y << endl;
Matrix3f x;
x = m.fullPivHouseholderQr().solve(y);
assert(y.isApprox(m*x));
cout << "Here is a solution x to the equation mx=y:" << endl << x << e... |
81f05a6a9c08415c08048193ab606998b07456f1130a6d2e41ad10cd5fdf61fe | C++ | 331 | 13 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::any value = boost::anys::basic_any... |
58d39528b6a941ead33bc27d693de07abef65c7b7d978d6dd978d80a498efdab | C++ | 332 | 13 | std::cout << "A fixed-size array:\n";
Array33f a1 = Array33f::Zero();
std::cout << a1 << "\n\n";
std::cout << "A one-dimensional dynamic-size array:\n";
ArrayXf a2 = ArrayXf::Zero(3);
std::cout << a2 << "\n\n";
std::cout << "A two-dimensional dynamic-size array:\n";
ArrayXXf a3 = ArrayXXf::Zero(3, 4);
std::cout << ... |
683a7cfaec252bb2fcf0524bd41e19c1c41ecaa71fb4ef3a8196beea511f0d90 | C++ | 333 | 12 | // Copyright Ruslan Arutyunyan, 2019-2021.
// Copyright Antony Polukhin, 2021-2022.
//
// Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any/basic_any.hpp>
int main() {
boost::anys::basic_any... |
1c70325c136f3b0e281518699dca2eff83c13003621830bd3517395de6fe82b9 | C++ | 334 | 14 | // Copyright 2006 Alexander Nasonov.
// Copyright Antony Polukhin, 2013-2022.
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/any.hpp>
int main() {
boost::any const a;
boost::any_cast... |
66a478a8d2b13d344791ac75f0747532bc9aabf46a219acb954f6b8913373dfe | C++ | 336 | 13 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<256, 16> bany = boo... |
2dd146ce861bee9270741972a78ccd1fa3d02d8e9a9a7e17b545da719005c04f | C++ | 339 | 6 | MatrixXcf A = MatrixXcf::Random(4,4);
HessenbergDecomposition<MatrixXcf> hd(4);
hd.compute(A);
cout << "The matrix H in the decomposition of A is:" << endl << hd.matrixH() << endl;
hd.compute(2*A); // re-use hd to compute and store decomposition of 2A
cout << "The matrix H in the decomposition of 2A is:" << endl << hd.... |
ec5b61816715cfdbcc4ca5369cda8b18859f39f0c02d8664d9970252131d1a4d | C++ | 340 | 14 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<> bany;
bany =... |
14924b7e89d079defa78603f045594357f13d9c81690f7f5274a544250b98758 | C++ | 343 | 18 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
MatrixXd m(2,2);
m(0,0) = 3;
m(1,0) = 2.5;
m(0,1) = -1;
m(1,1) = m(1,0) + m(0,1);
std::cout << "Here is the matrix m:\n" << m << std::endl;
VectorXd v(2);
v(0) = 4;
v(1) = v(0) - 1;
std::cout << "Here is the vector v:\n... |
55156b0be3479a17c8939b389ed29e4f6df1f395ba3413f231ab0f9c04740e99 | C++ | 343 | 6 | MatrixXf A = MatrixXf::Random(4,4);
RealSchur<MatrixXf> schur(4);
schur.compute(A, /* computeU = */ false);
cout << "The matrix T in the decomposition of A is:" << endl << schur.matrixT() << endl;
schur.compute(A.inverse(), /* computeU = */ false);
cout << "The matrix T in the decomposition of A^(-1) is:" << endl << sc... |
b27fc52e68419c4fb1f27cd6f51b875364241589379cdb8b037f78edf51b2143 | C++ | 345 | 18 | //
// quick.cpp - a quick test for boost/assert.hpp
//
// Copyright 2017 Peter Dimov
//
// Distributed under the Boost Software License, Version 1.0.
//
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
#include <boost/assert.hpp>
int main()
{
int x = 1; (void)x;
B... |
29f8b07cb1f9e596ed69e46bab471923d95a56abe85549113fcb4a0885d26206 | C++ | 347 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
A << 1, 2, 1,
2, 1, 0,
-1, 1, 2;
cout << "Here is the matrix A:\n" << A << endl;
cout << "The determinant of A is " << A.determinant() << endl;
cout << "The inverse of A is:\n... |
41432cc8b2b426f27532cc8d442c98eb11df9cafddf2aaee0b759727724c61ae | C++ | 347 | 7 | // This puts most asio functions in this object file instead of everywhere
// it is called when compiled with BOOST_ASIO_SEPARATE_COMPILATION in lslboost
// Normally, one would just compile boost/asio/impl/src.hpp but some compilers
// think they should generate a precompiled header.
#include "boost/asio/impl/src.hpp"... |
61f2be5263f9c322048e1c40504026fd20eb11bec0ca6715a60ee4a9a5581ff5 | C++ | 347 | 13 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<> bany = boost::an... |
f68f8e7f100501ce1e7f0a54b09ee2fb10440e57d47fb5c6580373b6dad1aecf | C++ | 347 | 14 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<> bany = 42;
b... |
465779bda43672587b80b8b5ffa25e82085d2b9a6b51b408a4ebcbaed4f8a77f | C++ | 348 | 14 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::any value;
value = boost::anys:... |
a4f596f618d45d2eb8177bdd38771267769bda32571ca954494ef117dfa5a057 | C++ | 348 | 12 | #include "endian.hpp"
#include "../common.h"
double lsl::measure_endian_performance() {
const double measure_duration = 0.01;
const double t_end = lsl_clock() + measure_duration;
uint64_t data = 0x01020304;
double k;
for (k = 0; ((int)k & 0xFF) != 0 || lsl_clock() < t_end; k++)
lslboost::endian::endian_reverse_... |
ff5d9ccf55b3993cce142861265017f178f2d08f108da5046f34936fb9ad2fc9 | C++ | 348 | 14 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::ArrayXf v(6);
v << 1, 2, 3, 4, 5, 6;
cout << "v.head(3) =" << endl << v.head(3) << endl << endl;
cout << "v.tail<3>() = " << endl << v.tail<3>() << endl << endl;
v.segment(1,4) *= 2;
cout << "after 'v.segment(1,4) *= 2', v... |
10d6220c4bcd64ea08482fdb4887ee40a7f0e3fb804bb4936f587f2797d93bcc | C++ | 349 | 19 | //
// arg_copy_fail.cpp - arg<1> to arg<2>
//
// Copyright 2016 Peter Dimov
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
#include <boost/bind/arg.hpp>
//
int main()
{
boost::arg<1> a1(( boost::... |
5421cb6bd4cd54b4ee44540eece1f7f0d3f027bcbde24b18b64e5c100c4d7517 | C++ | 352 | 12 | #include <catch2/catch.hpp>
#include <thread>
#include "../src/common.h"
TEST_CASE("sleep") {
BENCHMARK("sleep1ms") { std::this_thread::sleep_for(std::chrono::milliseconds(1)); };
}
TEST_CASE("read system clock"){
BENCHMARK("lsl_local_clock") { return lsl_local_clock(); };
BENCHMARK("lsl_local_clock_ns") { return ... |
53dbcb1b190ee3800dd569b1858cbd5bf0252e8b53116cee7cd9b0535588a1aa | C++ | 353 | 17 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d a;
a << 1, 2,
3, 4;
Vector3d v(1,2,3);
std::cout << "a * 2.5 =\n" << a * 2.5 << std::endl;
std::cout << "0.1 * v =\n" << 0.1 * v << std::endl;
std::cout << "Doing v *= 2;" << std::endl;
v *= 2;
std::cout << ... |
103a7963977e804fe0850d7fd5eb50380542017606ae638c479ad9280ba8d452 | C++ | 354 | 14 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::any value = 42;
boost::anys::ba... |
d42dfe9bad76fc00d87e92eff1cc2505cf3172baa1659ed9ffabea847f5221d9 | C++ | 355 | 23 |
#include <iostream>
#if (defined __GNUC__)
#define EIGEN_WEAK_LINKING __attribute__ ((weak))
#else
#define EIGEN_WEAK_LINKING
#endif
#ifdef __cplusplus
extern "C"
{
#endif
EIGEN_WEAK_LINKING int xerbla_(const char * msg, int *info, int)
{
std::cerr << "Eigen BLAS ERROR #" << *info << ": " << msg << "\n";
return... |
0c456b619dc4c51b905eda118e4b301b0079f7f4972d01c8c7f7e86f021c4982 | C++ | 356 | 16 | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
const double pi = std::acos(-1.0);
MatrixXd A(3,3);
A << 0, -pi/4, 0,
pi/4, 0, 0,
0, 0, 0;
std::cout << "The matrix A is:\n" << A << "\n\n";
std::cout << "The matrix exponential ... |
536b93958aca9947017a6c038dc41a447aed46efc2e39de1ab15dd0059bef9a3 | C++ | 356 | 21 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
Eigen::VectorXf v(2);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
v << 0,
1;
//add v to each column of m
mat.colwise() += v;
std::cout << "Broadcasting result: " << std::endl;... |
8c741755f536b8e23a4a3d5b165a1a066ac7e184412af30f28e1a35aba3dca98 | C++ | 356 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A, b;
A << 2, -1, -1, 3;
b << 1, 2, 3, 1;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the right hand side b:\n" << b << endl;
Matrix2f x = A.ldlt().solve(b);
cout << "... |
148c46eb1663ad23da62eac84aca5dfb1b83cf0e96a451931bebf6a19709c0a7 | C++ | 357 | 9 | typedef Matrix<float,3,3> Matrix3x3;
Matrix3x3 m = Matrix3x3::Random();
Matrix3f y = Matrix3f::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the matrix y:" << endl << y << endl;
Matrix3f x;
x = m.householderQr().solve(y);
assert(y.isApprox(m*x));
cout << "Here is a solution x to the e... |
2c60d25c31d1896826ac72ad5cf6e252ea978d57e4f399e74e83c68a2e5d058a | C++ | 358 | 15 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::any value = 10;
boost::anys::b... |
3cec6754fa89b6f2276ff5eef0094fdf7726b66ce8ce649311bf6802e213c775 | C++ | 361 | 9 | Matrix3d m;
m << 1,1,0,
1,3,2,
0,1,1;
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Notice that the middle column is the sum of the two others, so the "
<< "columns are linearly dependent." << endl;
cout << "Here is a matrix whose columns have the same span but are linearly independent:"... |
73df26f4dc432cf8a8fe4ce7ad96a3639a36b578bef1189af39c0a088aea3015 | C++ | 361 | 6 | EigenSolver<MatrixXf> es;
MatrixXf A = MatrixXf::Random(4,4);
es.compute(A, /* computeEigenvectors = */ false);
cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
es.compute(A + MatrixXf::Identity(4,4), false); // re-use es to compute eigenvalues of A+I
cout << "The eigenvalues of A+I are: " ... |
99a225fb26c8d10f9f617853bfd3541561a3ed34ee80c4d74405c239fdfb2c70 | C++ | 361 | 14 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<> bany;
bany =... |
e4bcc51e1cef438adadc80d4bc836ca28b9698688d93e3c5ffd0c675c120792f | C++ | 361 | 20 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
Eigen::VectorXf v(4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
v << 0,1,2,3;
//add v to each row of m
mat.rowwise() += v.transpose();
std::cout << "Broadcasting result: " << std::... |
667eb08059056a644068f46dc7a694d17156e68816633566732669ea7aa93a6e | C++ | 362 | 7 | SelfAdjointEigenSolver<Matrix4f> es;
Matrix4f X = Matrix4f::Random(4,4);
Matrix4f A = X + X.transpose();
es.compute(A);
cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
es.compute(A + Matrix4f::Identity(4,4)); // re-use es to compute eigenvalues of A+I
cout << "The eigenvalues of A+I are: "... |
eb2d0741391080bf616202edba473e05dcf8d96886d2d80f3f78df48f9dbe6f9 | C++ | 363 | 8 | MatrixXd X = MatrixXd::Random(4,4);
MatrixXd A = X * X.transpose();
cout << "Here is a random positive-definite matrix, A:" << endl << A << endl << endl;
SelfAdjointEigenSolver<MatrixXd> es(A);
MatrixXd sqrtA = es.operatorSqrt();
cout << "The square root of A is: " << endl << sqrtA << endl;
cout << "If we square this,... |
f7f2630ff89452554293716390f192e64155e592e4f49dbdbf4d3518256bd0a8 | C++ | 364 | 15 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<256, 16> bany = 10;... |
0715f2607003e12db41cee842dfbc9325838341ee68aaa9409ac09238f3907c4 | C++ | 365 | 7 | SelfAdjointEigenSolver<MatrixXf> es(4);
MatrixXf X = MatrixXf::Random(4,4);
MatrixXf A = X + X.transpose();
es.compute(A);
cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
es.compute(A + MatrixXf::Identity(4,4)); // re-use es to compute eigenvalues of A+I
cout << "The eigenvalues of A+I are... |
f10527d46d9069b027bc60ae75bec4eacd61e5542db9d848b4db67f6733e2b39 | C++ | 368 | 13 | Matrix3f A(3,3);
A << 1,2,3, 4,5,6, 7,8,10;
PartialPivLU<Matrix3f> luOfA(A); // compute LU decomposition of A
Vector3f b;
b << 3,3,4;
Vector3f x;
x = luOfA.solve(b);
cout << "The solution with right-hand side (3,3,4) is:" << endl;
cout << x << endl;
b << 1,1,1;
x = luOfA.solve(b);
cout << "The solution with right-han... |
0fd10871e4084036c48e0449585b4ed5c2737aae495aa8efa77ce71aca941f3c | C++ | 369 | 9 | Matrix3d m;
m << 1,1,0,
1,3,2,
0,1,1;
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Notice that the middle column is the sum of the two others, so the "
<< "columns are linearly dependent." << endl;
cout << "Here is a matrix whose columns have the same span but are linearly independent:"... |
4bd7d6dd03d7b280ed010121cb0806b0ae5827a5f29b6ed69bb7d32132355b8c | C++ | 371 | 20 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define function to be applied coefficient-wise
double ramp(double x)
{
if (x > 0)
return x;
else
return 0;
}
int main(int, char**)
{
Matrix4d m1 = Matrix4d::Random();
cout << m1 << endl << "becomes: " << endl << ... |
f0fed3205e90a1959db4c6ad3e0a05107952fce402585bf5c14334431a1db072 | C++ | 371 | 14 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXd A = MatrixXd::Random(100,100);
MatrixXd b = MatrixXd::Random(100,50);
MatrixXd x = A.fullPivLu().solve(b);
double relative_error = (A*x - b).norm() / b.norm(); // norm() is L2 norm
cout << "The ... |
4b4ca3eeff3e4880ca46c452877511ceca54066b678ff24ac47fcedbbe5d9fb5 | C++ | 372 | 7 | MatrixXd A = MatrixXd::Random(3,3);
MatrixXd B = MatrixXd::Random(3,2);
cout << "Here is the invertible matrix A:" << endl << A << endl;
cout << "Here is the matrix B:" << endl << B << endl;
MatrixXd X = A.lu().solve(B);
cout << "Here is the (unique) solution X to the equation AX=B:" << endl << X << endl;
cout << "Rela... |
aea21f077b01c02e85545d7c83367f94d102263541d6f50f1b10b04f83518ab5 | C++ | 372 | 14 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<256, 32> another(1... |
341567eb03325582fa029d35d9099c48ec702c73a322da35f16971ca63fd9681 | C++ | 375 | 15 | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
using std::sqrt;
MatrixXd A(3,3);
A << 0.5*sqrt(2), -0.5*sqrt(2), 0,
0.5*sqrt(2), 0.5*sqrt(2), 0,
0, 0, 1;
std::cout << "The matrix A is:\n" << A << "\n\n";
std::cout << "... |
cf6b2f73c9107e6b5acfc53df8d8c1d2b4770502ce1dc8f9a958eef63d16d305 | C++ | 377 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2d A;
A << 2, 1,
2, 0.9999999999;
FullPivLU<Matrix2d> lu(A);
cout << "By default, the rank of A is found to be " << lu.rank() << endl;
lu.setThreshold(1e-5);
cout << "With threshold 1e-5... |
15f5e22319396743354e078c1f10a0c6f7968e872c724a5891985cbc9ec0272d | C++ | 379 | 12 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// This file is used... |
24f69ee47979da62d2e27609108b95c735ecece0a47f0fa39ccd2d87e721c82a | C++ | 379 | 23 | #include "processor.h"
#include "peprocessor.h"
#include "seprocessor.h"
Processor::Processor(Options* opt){
mOptions = opt;
}
Processor::~Processor(){
}
bool Processor::process() {
if(mOptions->isPaired()) {
PairEndProcessor p(mOptions);
p.process();
} else {
SingleEndProcessor ... |
32a0cf6882a32f4856c6ae748f802afd0e01963c78fb7142ee01d6ccae67426e | C++ | 379 | 17 | // test_duration.cpp ----------------------------------------------------------//
// Copyright 2009 Vicente J. Botet Escriba
// Distributed under the Boost Software License, Version 1.0.
// See http://www.boost.org/LICENSE_1_0.txt
#if !defined(__GNUC__)
#define min(A,B) ((A)<(B)?(A):(B))
#define max(A,B) ((A)>... |
031de774b104d179a6f67e60ee6b99091eda0f95aaccfc26ea2907e19366c5b4 | C++ | 381 | 17 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
Vector3f b;
A << 1,2,3, 4,5,6, 7,8,10;
b << 3, 3, 4;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the vector b:\n" << b << endl;
Vector3f x = A.colPivHouseholderQr... |
78846291939e3ff7459322c6d317d366f6e6d14f69ee34ab10feae60dc95c522 | C++ | 381 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
a7053348208bbdbb95a11842052c5018bbf9048442251a3e443f890bffb8fb49 | C++ | 381 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
14d224a607f744e4fef4fe85fdbf6c99e823b950b26441b1c3d39eadfdb92986 | C++ | 382 | 15 | // Copyright (c) 2021-2022 Antony Polukhin
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt).
#include <boost/any.hpp>
#include <boost/any/basic_any.hpp>
int main()
{
boost::anys::basic_any<> bany;
boost:... |
f701772a195ef9d95bb68a44bb06919f264138b3a65f7898ca07a6ac3c9b8f73 | C++ | 382 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
8c85d4a67052298d27e68230a250a23ab5b838606e2c7dcefa85cf6fee6bdd2d | C++ | 383 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
a989045a1dab8f16a248de333956c51bac00d12538cf1ae2a637d29b6990c665 | C++ | 383 | 8 | Matrix3d m = Matrix3d::Zero();
m.part<Eigen::StrictlyUpperTriangular>().setOnes();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "And let us now compute m*m.adjoint() in a very optimized way" << endl
<< "taking advantage of the symmetry." << endl;
Matrix3d n;
n.part<Eigen::SelfAdjoint>() = (m*m.adj... |
c33f678e38fcd1e5b26be2e5dd00ec5114dbad8aa9b3243defebd696bdf1d7e7 | C++ | 383 | 12 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// This file is used... |
267f1ce2f970a627e56541314a50cf02aa6742bafc0acc6677dc7f3706e08ddd | C++ | 384 | 13 | #include <include/matlab_bgl.h>
#include <algorithm>
#include <iostream>
int main(int argc, char **argv) {
mbglIndex n = 4;
mbglIndex rp[] = {0,3,6,9,12};
mbglIndex ci[] = {1,2,3,0,2,3,0,1,3,0,1,2};
double X[] = { 1,2,1,0,2,1,0,1 };
int is_sldraw = 0;
is_straight_line_drawing(n, ci, rp, X, &is_sldraw... |
1f0edf2f71eb071e67a9dd5ffbb091b93ca5329a0231506d73a454efe9b08c8f | C++ | 386 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
8e861129900eb927feac94fc5fade2d74dcd21ef306e334e427b8039748725e7 | C++ | 386 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
10d0866577b78ff09695c909afe4e6e3c516477b6a639fa4d6994af26884c192 | C++ | 387 | 12 | //
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
26eccc1dc02c30a601951793d84da0edcefca4a5b614c5071eb10df19885a04f | C++ | 387 | 12 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// This file is used... |
7a9a13c096223107106227f785bf770f8ab590caa3ff50e3b69e50fa1517707f | C++ | 388 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
ac62f42ee97ee94622a4eda97830abd6774ff5a094afab2f7f3aec0c258cda88 | C++ | 388 | 14 | #include <catch2/catch.hpp>
#include <common.h>
#include <thread>
// clazy:excludeall=non-pod-global-static
TEST_CASE("sleep") {
BENCHMARK("sleep1ms") { std::this_thread::sleep_for(std::chrono::milliseconds(1)); };
}
TEST_CASE("read system clock"){
BENCHMARK("lsl_local_clock") { return lsl_local_clock(); };
BENCH... |
55b506ad8ce48ddce0cf0e6a761ba4366558e4713bbf628ddcd85b56e8e7aa0f | C++ | 390 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
6eee36fb9361edc0af6f8605621c45995ebc169735c71ca31c82ac7f243142b3 | C++ | 390 | 17 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(3,3);
m << 1,2,3,
4,5,6,
7,8,9;
cout << "Here is the matrix m:" << endl << m << endl;
cout << "2nd Row: " << m.row(1) << endl;
m.col(2) += 3 * m.col(0);
cout << "After adding 3 times the first colu... |
c9182a6284abc57f1b3755af8f4daf55479ca192810442f9c857bffcf797b5bd | C++ | 390 | 6 | #include "ChimericDetection.h"
ChimericDetection::ChimericDetection(Parameters &Pin, Transcript ***trAll, uint *nWinTr, char** Read1in, Genome &mapGenIn, fstream *ostreamChimJunctionIn, ReadAlign *RAin)
: P(Pin), RA(RAin), trAll(trAll), nWinTr(nWinTr), Read1(Read1in), outGen(mapGenIn), ostreamChimJun... |
54099e6838ff1e82ae987d213e13cec695bb253d155a3163bc572d2600a2d50c | C++ | 391 | 8 | Matrix4f A = MatrixXf::Random(4,4);
cout << "Here is a random 4x4 matrix:" << endl << A << endl;
HessenbergDecomposition<MatrixXf> hessOfA(A);
MatrixXf H = hessOfA.matrixH();
cout << "The Hessenberg matrix H is:" << endl << H << endl;
MatrixXf Q = hessOfA.matrixQ();
cout << "The orthogonal matrix Q is:" << endl << Q <<... |
8963d8c528e7097b8e1a860015ccca2da4aeea325238daff05a770280aee75ca | C++ | 392 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
8c2418138287b40b8df7add8d47f1cbfedb135a3051f9605e4d2b8f82dfc95f9 | C++ | 392 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
913f5eb26365c78a76895ffd7865817045c217c56fb8aebd5c0c6c18f28d06bd | C++ | 392 | 9 | Tridiagonalization<MatrixXf> tri;
MatrixXf X = MatrixXf::Random(4,4);
MatrixXf A = X + X.transpose();
tri.compute(A);
cout << "The matrix T in the tridiagonal decomposition of A is: " << endl;
cout << tri.matrixT() << endl;
tri.compute(2*A); // re-use tri to compute eigenvalues of 2A
cout << "The matrix T in the tridia... |
ba9e8e73bf145b9ecee44d33e11bcb74c76e0cb062e3daccfbe075cf8d877110 | C++ | 392 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
24e88260d3a8d255383cd5926a12facc0adab0b512762eb79b7f8247e3e7b278 | C++ | 393 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
411bf03bc8a8617e450241dc6f7c9e9104860e27a52f403068902b0ccb2a08f3 | C++ | 393 | 15 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
using namespace std;
int main()
{
Vector3d v(1,2,3);
Vector3d w(0,1,2);
cout << "Dot product: " << v.dot(w) << endl;
double dp = v.adjoint()*w; // automatic conversion of the inner product to a scalar
cout << "Dot product via a matrix product... |
8449f0b07fbecb4230719dfdac97b19a9eae31190c0059a57d2c49d61ca195ba | C++ | 394 | 8 | Matrix4d X = Matrix4d::Random(4,4);
Matrix4d A = X + X.transpose();
cout << "Here is a random symmetric 4x4 matrix:" << endl << A << endl;
Tridiagonalization<Matrix4d> triOfA(A);
Matrix4d pm = triOfA.packedMatrix();
cout << "The packed matrix M is:" << endl << pm << endl;
cout << "The diagonal and subdiagonal correspon... |
348f148a986fd814fb1e6a455f59f67503ec7fed9318e1b1169cd2d91aab427f | C++ | 395 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
2d0cdfe78dac61b4b1ad28b1e02680e4a37399e20be1f8b63cf49bc69293c7ad | C++ | 396 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
8aa5ed706dca5c634da572b1fb1bbb853d4587e7f5852d746790690c0ed3cd7e | C++ | 396 | 9 | MatrixXd X = MatrixXd::Random(5,5);
MatrixXd A = X * X.transpose();
X = MatrixXd::Random(5,5);
MatrixXd B = X * X.transpose();
GeneralizedSelfAdjointEigenSolver<MatrixXd> es(A,B,EigenvaluesOnly);
cout << "The eigenvalues of the pencil (A,B) are:" << endl << es.eigenvalues() << endl;
es.compute(B,A,false);
cout << "The... |
607cf09618cf4e18915653d446536fd56872511cb7d563a8ca04a755e8d783a5 | C++ | 398 | 11 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Test that header ... |
836e009650596ab9931b0150060b01a7f57ea598a8b76d05ca070f4a163e0687 | C++ | 400 | 23 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXXf a(3,3);
ArrayXXf b(3,3);
a << 1,2,3,
4,5,6,
7,8,9;
b << 1,2,3,
1,2,3,
1,2,3;
// Adding two arrays
cout << "a + b = " << endl << a + b << endl << endl;
// Subt... |
9c476fdb88bf3c370eb9445c1c19632cac18a1dcce53a87ebc7b79357f10945d | C++ | 400 | 12 | #include "Parameters.h"
#include "ErrorWarning.h"
#include <fstream>
#include <sys/stat.h>
void Parameters::closeReadsFiles() {
for (uint imate=0; imate<readFilesIn.size(); imate++) {//open readIn files
if ( inOut->readIn[imate].is_open() )
inOut->readIn[imate].close();
if (readFilesComm... |
2b0a1e8e57596e2be3de14207e6627c9dffedb3dbbd9b0a7ce34947628a3ca59 | C++ | 401 | 15 | // Copyright 2006 Alexander Nasonov.
// Copyright Antony Polukhin, 2013-2022.
// Copyright Ruslan Arutyunyan, 2019-2021.
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/any/basic_any.hpp>
int... |
d109d7b8960198d3c2b625419a0ee98c95d6445eb5ecc747f6c4b3631aa98fac | C++ | 401 | 18 | #include <Eigen/Core>
#include <Eigen/LU>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
Vector3f b;
A << 1,2,3, 4,5,6, 7,8,10;
b << 3, 3, 4;
cout << "Here is the matrix A:" << endl << A << endl;
cout << "Here is the vector b:" << endl << b << endl;
Vec... |
47478c697517e67e553636a242b1d8b06c8d58f47bafd933d216bc150cee13c5 | C++ | 405 | 13 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// This file is used... |
967b7fa9b8c061c486fec6055ce5281d72f72555629ad2187389d1703555e5d0 | C++ | 407 | 8 | MatrixXi m = MatrixXi::Random(3,4);
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the reverse of m:" << endl << m.reverse() << endl;
cout << "Here is the coefficient (1,0) in the reverse of m:" << endl
<< m.reverse()(1,0) << endl;
cout << "Let us overwrite this coefficient with the value 4... |
a93d36bcd6f2b4f03c2d7601a9c0e4b8e0a60d39c3c4e9b263ead2a3da9b0bb8 | C++ | 407 | 9 | MatrixXd m(2,3);
m << 1,2,3,4,5,6;
cout << "here's the 2x3 matrix m:" << endl << m << endl;
cout << "let's resize m to 3x2. This is a conservative resizing because 2*3==3*2." << endl;
m.resize(3,2);
cout << "here's the 3x2 matrix m:" << endl << m << endl;
cout << "now let's resize m to size 2x2. This is NOT a conservat... |
cdcfafe53d6aa9b42bcc82bd39aa3b4801f307de344be8eaa0894f8016693338 | C++ | 408 | 12 | //
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/boostorg/beast
//
// Make sure symbols... |
dbb0415d763ca5a3213d1ca88658cc8d98c03de56f0dc4b25574c86601c95138 | C++ | 408 | 15 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXf A = MatrixXf::Random(3, 2);
cout << "Here is the matrix A:\n" << A << endl;
VectorXf b = VectorXf::Random(3);
cout << "Here is the right hand side b:\n" << b << endl;
cout << "The least-squares ... |
1bd522558aee8a4b94a57650776399d452d3d2cc1785f635b3f5f71c228de566 | C++ | 410 | 19 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXf a = ArrayXf::Random(5);
a *= 2;
cout << "a =" << endl
<< a << endl;
cout << "a.abs() =" << endl
<< a.abs() << endl;
cout << "a.abs().sqrt() =" << endl
<< a.abs().sqrt() << endl... |
62e9f24bea5a8de4d5302c24b0b53b717b0fd8d3fe34a4757a2ef7397892b01b | C++ | 410 | 16 | // Unit test for boost::any.
//
// See http://www.boost.org for most recent version, including documentation.
//
// Copyright Ruslan Arutyunyan, 2019-2021.
//
// Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)... |
af0f8cc4efa8d7307530255abe919031eded3351d80d575261322b3817bb607b | C++ | 410 | 13 | Matrix3d m = Matrix3d::Random();
cout << "Here is the matrix m:" << endl << m << endl;
Matrix3d inverse;
bool invertible;
double determinant;
m.computeInverseAndDetWithCheck(inverse,determinant,invertible);
cout << "Its determinant is " << determinant << endl;
if(invertible) {
cout << "It is invertible, and its inver... |
dfea92e45ceaccefcb9cf9127c815b01dda1c50c4e061b9cdfd1c9805b7718e7 | C++ | 410 | 16 | // Unit test for boost::any.
//
// See http://www.boost.org for most recent version, including documentation.
//
// Copyright Ruslan Arutyunyan, 2019-2021.
//
// Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)... |
0b32393b86b0d10b65f1d704ad76c8c4fc29113065796cb0337b8954857f6bb6 | C++ | 411 | 16 | // Unit test for boost::any.
//
// See http://www.boost.org for most recent version, including documentation.
//
// Copyright Ruslan Arutyunyan, 2019-2021.
//
// Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)... |
753ff1a7d39c267da4998fe8a175a0d8ec5f507173a88cf7c07f2c833704e392 | C++ | 413 | 11 | Matrix<float,2,3> m = Matrix<float,2,3>::Random();
Matrix2f y = Matrix2f::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the matrix y:" << endl << y << endl;
Matrix<float,3,2> x = m.fullPivLu().solve(y);
if((m*x).isApprox(y))
{
cout << "Here is a solution x to the equation mx=y:" << ... |
8acefbc1f6ee5a0476d89673844918d0cc09ddc3444ae34a29834530acafff2d | C++ | 413 | 10 | #include "stringSubstituteAll.h"
void stringSubstituteAll(std::string& str, const std::string& from, const std::string& to) {
if(from.empty()) return;
size_t start_pos = 0;
while((start_pos = str.find(from, start_pos)) != std::string::npos) {
str.replace(start_pos, from.length(), to);
start... |
9269a72875fa62ff6ddf1ee0104f19ab55d48367ded18c5e18b892144fdbc6a1 | C++ | 413 | 20 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(4,4);
m << 1, 2, 3, 4,
5, 6, 7, 8,
9,10,11,12,
13,14,15,16;
cout << "Block in the middle" << endl;
cout << m.block<2,2>(1,1) << endl << endl;
for (int i = 1; i <= 3; ++i)
{
cout << "B... |
7cdaea1c42dd0e563ccb152f93985352eee4f85235219e28386e4eec2f123fc2 | C++ | 414 | 8 | Matrix2i m = Matrix2i::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the transpose of m:" << endl << m.transpose() << endl;
cout << "Here is the coefficient (1,0) in the transpose of m:" << endl
<< m.transpose()(1,0) << endl;
cout << "Let us overwrite this coefficient with the va... |
f922278540ce19d331dff5bcee70a8c55273c345eb40990906b0485841f936df | C++ | 417 | 22 | // Copyright 2017, 2020 Peter Dimov
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#include <boost/bind.hpp>
#include <boost/core/lightweight_test.hpp>
//
int f( int a, int b, int c )
{
return a + 10 * b + 100 * c;
}
int main()
{
int const i = 1;
... |
c4af769a76fad4107434d39798653e123260cb46319853a8ab768c6fa24af843 | C++ | 418 | 18 | #include <iostream>
#include <Eigen/Core>
using namespace Eigen;
template <typename Derived>
void print_size(const EigenBase<Derived>& b)
{
std::cout << "size (rows, cols): " << b.size() << " (" << b.rows()
<< ", " << b.cols() << ")" << std::endl;
}
int main()
{
Vector3f v;
print_size(v);
//... |
f3f359f9f3ace33b73ac1962c56cd85dcd5e8dd1f3069b89efdf8b029879d3e6 | C++ | 418 | 16 | // Copyright (c) 2017 Andrey Semashev
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/atomic.hpp>
int main(int, char *[])
{
// The test verifies that atomic<> does not provide arithmet... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.