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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c195d4dba24c4d8abcb9285a8b1a4947c136b491 | 7,887 | cpp | C++ | Test/Collisions/Source/main.cpp | bugsbycarlin/Honey | 56902979eb746c8dff5c8bcfc531fbf855c0bae5 | [
"MIT"
] | null | null | null | Test/Collisions/Source/main.cpp | bugsbycarlin/Honey | 56902979eb746c8dff5c8bcfc531fbf855c0bae5 | [
"MIT"
] | null | null | null | Test/Collisions/Source/main.cpp | bugsbycarlin/Honey | 56902979eb746c8dff5c8bcfc531fbf855c0bae5 | [
"MIT"
] | null | null | null | /*
Collisions Test Program
Matthew Carlin
Copyright 2018
*/
#include <string>
#include <array>
#include "honey.h"
using namespace Honey;
using namespace std;
void initialize();
void render();
void logic();
bool test_collision(int i, int j);
bool quit;
float x_velocity;
float y_velocity;
float acceleration;
float deceleration;
position spots[7];
string pictures[7] = {
"180_180_line_",
"180_180_line_",
"180_90_line_",
"40_120_box_",
"160_80_box_",
"60_circle_",
"120_circle_",
};
box box1 = {0, 0, 40, 120};
box box2 = {0, 0, 160, 80};
float circle_1_radius = 30.0f;
float circle_2_radius = 60.0f;
int selection = 0;
// Functions
int main(int argc, char* args[]) {
initialize();
quit = false;
while (!quit) {
logic();
render();
}
}
void initialize() {
StartHoney("Collisions Test");
graphics.addImages("Art/", {
"180_180_line_black",
"180_180_line_green",
"180_90_line_green",
"180_90_line_black",
"40_120_box_black",
"40_120_box_green",
"160_80_box_green",
"160_80_box_black",
"60_circle_black",
"60_circle_green",
"120_circle_green",
"120_circle_black",
});
for (int i = 0; i < 7; i++) {
spots[i] = {math_utils.randomInt(100, 800), math_utils.randomInt(100, 500)};
}
acceleration = 1.0f;
deceleration = 0.95;
}
void logic() {
input.processInput();
if (input.keyPressed("return")) {
selection += 1;
if (selection == 7) selection = 0;
}
if (input.keyDown("left")) {
x_velocity -= acceleration;
}
if (input.keyDown("right")) {
x_velocity += acceleration;
}
if (input.keyDown("up")) {
y_velocity -= acceleration;
}
if (input.keyDown("down")) {
y_velocity += acceleration;
}
spots[selection].x += (int) x_velocity;
spots[selection].y += (int) y_velocity;
x_velocity *= deceleration;
y_velocity *= deceleration;
if (input.keyPressed("quit") > 0) {
quit = true;
}
if (input.threeQuickKey("escape")) {
quit = true;
}
}
bool test_collision(int i, int j) {
position l1a = {spots[0].x, spots[0].y + 180};
position l1b = {spots[0].x + 180, spots[0].y};
position l2a = {spots[1].x, spots[1].y + 180};
position l2b = {spots[1].x + 180, spots[1].y};
position l3a = {spots[2].x, spots[2].y};
position l3b = {spots[2].x + 180, spots[2].y + 90};
position b1 = spots[3];
position b2 = spots[4];
position c1 = spots[5];
position c2 = spots[6];
if (i == 0) {
// Line 1
if (j == 1) {
// Line 1 and line 2
return collisions.test(l1a, l1b, l2a, l2b);
} else if (j == 2) {
// Line 1 and line 3
return collisions.test(l1a, l1b, l3a, l3b);
} else if (j == 3) {
// Line 1 and box 1
return collisions.test(b1, box1, l1a, l1b);
} else if (j == 4) {
// Line 1 and box 2
return collisions.test(b2, box2, l1a, l1b);
} else if (j == 5) {
// Line 1 and circle 1
return collisions.test(c1, circle_1_radius, l1a, l1b);
} else if (j == 6) {
// Line 1 and circle 2
return collisions.test(c2, circle_2_radius, l1a, l1b);
}
} else if (i == 1) {
// Line 2
if (j == 0) {
// Line 2 and line 1
return collisions.test(l2a, l2b, l1a, l1b);
} else if (j == 2) {
// Line 2 and line 3
return collisions.test(l2a, l2b, l3a, l3b);
} else if (j == 3) {
// Line 2 and box 1
return collisions.test(b1, box1, l2a, l2b);
} else if (j == 4) {
// Line 2 and box 2
return collisions.test(b2, box2, l2a, l2b);
} else if (j == 5) {
// Line 2 and circle 1
return collisions.test(c1, circle_1_radius, l2a, l2b);
} else if (j == 6) {
// Line 2 and circle 2
return collisions.test(c2, circle_2_radius, l2a, l2b);
}
} else if (i == 2) {
// Line 3
if (j == 0) {
// Line 3 and line 1
return collisions.test(l3a, l3b, l1a, l1b);
} else if (j == 1) {
// Line 3 and line 2
return collisions.test(l3a, l3b, l2a, l2b);
} else if (j == 3) {
// Line 3 and box 1
return collisions.test(b1, box1, l3a, l3b);
} else if (j == 4) {
// Line 3 and box 2
return collisions.test(b2, box2, l3a, l3b);
} else if (j == 5) {
// Line 3 and circle 1
return collisions.test(c1, circle_1_radius, l3a, l3b);
} else if (j == 6) {
// Line 3 and circle 2
return collisions.test(c2, circle_2_radius, l3a, l3b);
}
} else if (i == 3) {
// Box 1
if (j == 0) {
// box 1 and line 1
return collisions.test(b1, box1, l1a, l1b);
} else if (j == 1) {
// box 1 and line 2
return collisions.test(b1, box1, l2a, l2b);
} else if (j == 2) {
// box 1 and line 3
return collisions.test(b1, box1, l3a, l3b);
} else if (j == 4) {
// box 1 and box 2
return collisions.test(b1, box1, b2, box2);
} else if (j == 5) {
// box 1 and circle 1
return collisions.test(c1, circle_1_radius, b1, box1);
} else if (j == 6) {
// box 1 and circle 2
return collisions.test(c2, circle_2_radius, b1, box1);
}
} else if (i == 4) {
// Box 2
if (j == 0) {
// box 1 and line 1
return collisions.test(spots[i], box2, l1a, l1b);
} else if (j == 1) {
// box 1 and line 2
return collisions.test(spots[i], box2, l2a, l2b);
} else if (j == 2) {
// box 1 and line 3
return collisions.test(spots[i], box2, l3a, l3b);
} else if (j == 3) {
// box 1 and box 2
return collisions.test(b2, box2, b1, box1);
} else if (j == 5) {
// box 1 and circle 1
return collisions.test(c1, circle_1_radius, b2, box2);
} else if (j == 6) {
// box 1 and circle 2
return collisions.test(c2, circle_2_radius, b2, box2);
}
} else if (i == 5) {
// Circle 1
if (j == 0) {
// circle 1 and line 1
return collisions.test(c1, circle_1_radius, l1a, l1b);
} else if (j == 1) {
// circle 1 and line 2
return collisions.test(c1, circle_1_radius, l2a, l2b);
} else if (j == 2) {
// circle 1 and line 3
return collisions.test(c1, circle_1_radius, l3a, l3b);
} else if (j == 3) {
// circle 1 and box 1
return collisions.test(c1, circle_1_radius, b1, box1);
} else if (j == 4) {
// circle 1 and box 2
return collisions.test(c1, circle_1_radius, b2, box2);
} else if (j == 6) {
// circle 1 and circle 2
return collisions.test(c1, circle_1_radius, c2, circle_2_radius);
}
} else if (i == 6) {
// Circle 2
if (j == 0) {
// circle 1 and line 1
return collisions.test(c2, circle_2_radius, l1a, l1b);
} else if (j == 1) {
// circle 1 and line 2
return collisions.test(c2, circle_2_radius, l2a, l2b);
} else if (j == 2) {
// circle 1 and line 3
return collisions.test(c2, circle_2_radius, l3a, l3b);
} else if (j == 3) {
// circle 1 and box 1
return collisions.test(c2, circle_2_radius, b1, box1);
} else if (j == 4) {
// circle 1 and box 2
return collisions.test(c2, circle_2_radius, b2, box2);
} else if (j == 5) {
// circle 1 and circle 2
return collisions.test(c2, circle_2_radius, c1, circle_1_radius);
}
}
return false;
}
void render() {
// Clear the screen to a soft white color
graphics.clearScreen("#DDDDDD");
// Switch to 2D drawing mode
graphics.draw2D();
for (int i = 0; i < 7; i++) {
string color = "black";
if (i == selection) {
color = "green";
} else {
if (test_collision(selection, i)) color = "green";
}
bool centered = false;
if (i == 5 || i == 6) centered = true;
graphics.drawImage(pictures[i] + color, spots[i].x, spots[i].y, centered, 0, 1);
}
// Put everything we've drawn on screen
graphics.updateDisplay();
}
| 24.646875 | 84 | 0.565741 | bugsbycarlin |
c197258d125848928500d5e8c499aa1b588eca38 | 117 | cpp | C++ | example/task_thread_safe.cpp | tearshark/libst | 1c8251856957590be5ad063be7f05f0f5c5430a1 | [
"Apache-2.0"
] | 18 | 2018-05-21T12:57:44.000Z | 2021-11-24T01:44:32.000Z | example/task_thread_safe.cpp | tearshark/libst | 1c8251856957590be5ad063be7f05f0f5c5430a1 | [
"Apache-2.0"
] | null | null | null | example/task_thread_safe.cpp | tearshark/libst | 1c8251856957590be5ad063be7f05f0f5c5430a1 | [
"Apache-2.0"
] | 6 | 2019-06-08T15:37:44.000Z | 2020-12-12T12:38:12.000Z | //测试任务链节点之间的数据传递和执行是线程安全的
#include "task.h"
#include "log_print.h"
void test_task_thread_safe()
{
//TODO
}
| 13 | 29 | 0.692308 | tearshark |
c197cba8eb070f2390301c052ef101ae075a21dd | 640 | cpp | C++ | 55.跳跃游戏/canJump_暴力回溯法.cpp | YichengZhong/Top-Interview-Questions | 124828d321f482a0eaa30012b3706267487bfd24 | [
"MIT"
] | 1 | 2019-10-21T14:40:39.000Z | 2019-10-21T14:40:39.000Z | 55.跳跃游戏/canJump_暴力回溯法.cpp | YichengZhong/Top-Interview-Questions | 124828d321f482a0eaa30012b3706267487bfd24 | [
"MIT"
] | null | null | null | 55.跳跃游戏/canJump_暴力回溯法.cpp | YichengZhong/Top-Interview-Questions | 124828d321f482a0eaa30012b3706267487bfd24 | [
"MIT"
] | 1 | 2020-11-04T07:33:34.000Z | 2020-11-04T07:33:34.000Z | class Solution {
public:
bool canJump(vector<int>& nums)
{
return canJumpFromPosition(0, nums);
}
bool canJumpFromPosition(int position, vector<int>& nums) {
if (position == nums.size() - 1)
{
return true;
}
int nums_size=nums.size()-1;
int furthestJump = min((position + nums[position]), nums_size);
for (int nextPosition = position + 1; nextPosition <= furthestJump; nextPosition++)
{
if (canJumpFromPosition(nextPosition, nums))
{
return true;
}
}
return false;
}
}; | 23.703704 | 91 | 0.528125 | YichengZhong |
c19f7aefab0663d230fecb5aa59b165fa9b27930 | 5,264 | hpp | C++ | hpx/runtime/parcelset/parcel.hpp | folshost/hpx | 6b3dc70c4fcade16052cc964790a98522bbfc3ec | [
"BSL-1.0"
] | null | null | null | hpx/runtime/parcelset/parcel.hpp | folshost/hpx | 6b3dc70c4fcade16052cc964790a98522bbfc3ec | [
"BSL-1.0"
] | null | null | null | hpx/runtime/parcelset/parcel.hpp | folshost/hpx | 6b3dc70c4fcade16052cc964790a98522bbfc3ec | [
"BSL-1.0"
] | null | null | null | // Copyright (c) 2007-2014 Hartmut Kaiser
// Copyright (c) 2015-2016 Thomas Heller
// Copyright (c) 2007 Richard D Guidry Jr
// Copyright (c) 2007 Alexandre (aka Alex) TABBAL
// Copyright (c) 2011 Bryce Lelbach
//
// SPDX-License-Identifier: BSL-1.0
// 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)
#if !defined(HPX_PARCELSET_PARCEL_MAR_26_2008_1051AM)
#define HPX_PARCELSET_PARCEL_MAR_26_2008_1051AM
#include <hpx/config.hpp>
#if defined(HPX_HAVE_NETWORKING)
#include <hpx/runtime/actions_fwd.hpp>
#include <hpx/runtime/naming_fwd.hpp>
#include <hpx/runtime/naming/address.hpp>
#include <hpx/runtime/naming/name.hpp>
#include <hpx/runtime/parcelset_fwd.hpp>
#include <hpx/serialization/serialization_fwd.hpp>
#include <hpx/serialization/traits/is_bitwise_serializable.hpp>
#include <cstddef>
#include <cstdint>
#include <map>
#include <memory>
#include <string>
#include <utility>
#include <hpx/config/warnings_prefix.hpp>
namespace hpx { namespace serialization
{
struct binary_filter;
}}
namespace hpx { namespace parcelset { namespace policies
{
struct message_handler;
}}}
namespace hpx { namespace parcelset
{
namespace detail
{
struct parcel_data
{
public:
parcel_data();
parcel_data(naming::gid_type&& dest, naming::address&& addr,
bool has_continuation);
parcel_data(parcel_data && rhs);
parcel_data& operator=(parcel_data && rhs);
template <typename Archive>
void serialize(Archive &ar, unsigned);
#if defined(HPX_HAVE_PARCEL_PROFILING)
naming::gid_type parcel_id_;
double start_time_;
double creation_time_;
#endif
naming::gid_type source_id_;
naming::gid_type dest_;
naming::address addr_;
bool has_continuation_;
};
}
class HPX_EXPORT parcel
{
private:
using split_gids_type =
std::map<naming::gid_type const*, naming::gid_type>;
#if defined(HPX_DEBUG)
bool is_valid() const;
#else
// Only used in debug mode.
bool is_valid() const
{
return true;
}
#endif
public:
parcel();
~parcel();
private:
parcel(
naming::gid_type&& dest,
naming::address&& addr,
std::unique_ptr<actions::base_action> act
);
friend struct detail::create_parcel;
public:
parcel(parcel && other);
parcel &operator=(parcel && other);
void reset();
actions::base_action *get_action() const;
naming::id_type source_id() const;
void set_source_id(naming::id_type const & source_id);
void set_destination_id(naming::gid_type&& dest);
naming::gid_type const& destination() const;
naming::address const& addr() const;
naming::address& addr();
std::uint32_t destination_locality_id() const;
naming::gid_type const& destination_locality() const;
double start_time() const;
void set_start_time(double time);
double creation_time() const;
threads::thread_priority get_thread_priority() const;
#if defined(HPX_HAVE_PARCEL_PROFILING)
naming::gid_type const parcel_id() const;
naming::gid_type & parcel_id();
#endif
serialization::binary_filter* get_serialization_filter() const;
policies::message_handler* get_message_handler(
parcelset::parcelhandler* ph, locality const& loc) const;
bool does_termination_detection() const;
split_gids_type move_split_gids() const;
void set_split_gids(split_gids_type&& split_gids);
std::size_t const& num_chunks() const;
std::size_t & num_chunks();
std::size_t const& size() const;
std::size_t & size();
void schedule_action(std::size_t num_thread = std::size_t(-1));
// returns true if parcel was migrated, false if scheduled locally
bool load_schedule(serialization::input_archive & ar,
std::size_t num_thread, bool& deferred_schedule);
// generate unique parcel id
static naming::gid_type generate_unique_id(
std::uint32_t locality_id = naming::invalid_locality_id);
private:
friend std::ostream& operator<< (std::ostream& os, parcel const& req);
// serialization support
friend class hpx::serialization::access;
void load_data(serialization::input_archive & ar);
void serialize(serialization::input_archive & ar, unsigned);
void serialize(serialization::output_archive & ar, unsigned);
std::pair<naming::address_type, naming::component_type> determine_lva();
detail::parcel_data data_;
std::unique_ptr<actions::base_action> action_;
mutable split_gids_type split_gids_;
std::size_t size_;
std::size_t num_chunks_;
};
HPX_EXPORT std::string dump_parcel(parcel const& p);
}}
HPX_IS_BITWISE_SERIALIZABLE(hpx::parcelset::detail::parcel_data)
#include <hpx/config/warnings_suffix.hpp>
#endif
#endif
| 26.857143 | 80 | 0.656725 | folshost |
c1a0195613c0a9aebcfe57ea7d5568bec91da144 | 935 | cpp | C++ | src/main.cpp | Mostafa-RT/gem-castle | cf0647f08a0dca1fdce8aece6e44d9f137857132 | [
"BSD-2-Clause"
] | 1 | 2020-12-16T08:41:04.000Z | 2020-12-16T08:41:04.000Z | src/main.cpp | Mostafa-RT/gem-castle | cf0647f08a0dca1fdce8aece6e44d9f137857132 | [
"BSD-2-Clause"
] | null | null | null | src/main.cpp | Mostafa-RT/gem-castle | cf0647f08a0dca1fdce8aece6e44d9f137857132 | [
"BSD-2-Clause"
] | null | null | null | #include <string>
#include <climits>
#include <unistd.h>
#include <iostream>
#include <stdexcept>
#include "game.hpp"
int main()
{
try
{
char hostname[HOST_NAME_MAX];
char username[LOGIN_NAME_MAX];
gethostname(hostname, HOST_NAME_MAX);
getlogin_r(username, LOGIN_NAME_MAX);
std::string playerName = std::string(username) + '@' + std::string(hostname);
gc_game::Game::getHandler().setPlayerName(playerName);
gc_game::Game::getHandler().run();
}
catch (std::exception &ex)
{
std::cerr << "-> Sorry, an fatal error leads the program to be terminated :(\n"
<< "-> Here is the ERR_COMMET:\n=> "
<< ex.what() << '\n';
exit(EXIT_FAILURE);
}
catch (...)
{
std::cerr << "-> Ooh, an UNKNOWN fatal error leads the program to be terminated :/\n"
<< "-> No ERR_COMMET availbale!\n";
exit(EXIT_FAILURE);
}
} | 28.333333 | 91 | 0.588235 | Mostafa-RT |
c1a47ec4cac5ad675ecc99d1277b953db3ab64ed | 1,791 | cpp | C++ | codeforces/E - Omkar and Last Floor/Wrong answer on pretest 8.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | 1 | 2022-02-11T16:55:36.000Z | 2022-02-11T16:55:36.000Z | codeforces/E - Omkar and Last Floor/Wrong answer on pretest 8.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | codeforces/E - Omkar and Last Floor/Wrong answer on pretest 8.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | /****************************************************************************************
* @author: * kzvd4729 created: Jul/11/2020 22:27
* solution_verdict: Wrong answer on pretest 8 language: GNU C++14
* run_time: 31 ms memory_used: 3900 KB
* problem: https://codeforces.com/contest/1372/problem/E
****************************************************************************************/
#include<iostream>
#include<vector>
#include<cstring>
#include<map>
#include<bitset>
#include<assert.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<set>
#include<queue>
#include<unordered_map>
#include<random>
#include<chrono>
#include<stack>
#include<deque>
#define long long long
using namespace std;
const int N=1e2;
int l[N+2][N+2],r[N+2][N+2],mt[N+2][N+2],rm[N+2];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int n,m;cin>>n>>m;
for(int i=1;i<=n;i++)
{
int k;cin>>k;
while(k--)
{
int a,b;cin>>a>>b;
for(int j=a;j<=b;j++)l[i][j]=a,r[i][j]=b;
}
}
set<pair<int,int> >st;
for(int i=1;i<=m;i++)st.insert({n,i});
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)mt[i][j]=1;
}
for(int i=1;i<=m;i++)rm[i]=n;
long ans=0;
while(st.size())
{
pair<int,int>p=*st.rbegin();st.erase(p);
ans+=1LL*p.first*p.first;
int cl=p.second;
for(int i=1;i<=n;i++)
{
if(mt[i][cl]==0)continue;
mt[i][cl]=0;
for(int j=l[i][cl];j<=r[i][cl];j++)
{
if(j==cl)continue;st.erase({rm[j],j});
rm[j]--;mt[i][j]=0;
if(rm[j])st.insert({rm[j],j});
}
}
}
cout<<ans<<endl;
return 0;
} | 26.731343 | 111 | 0.454495 | kzvd4729 |
c1aa4b16977060aaee80e20f480ae31b41e69ffd | 351 | hpp | C++ | blaise-lang/include/gasp/blaise/impl/blaise_ast_expression_type.hpp | sanelli/gasp | 108700e8739534e9c152d7c8e2f1308917cf8611 | [
"MIT"
] | null | null | null | blaise-lang/include/gasp/blaise/impl/blaise_ast_expression_type.hpp | sanelli/gasp | 108700e8739534e9c152d7c8e2f1308917cf8611 | [
"MIT"
] | null | null | null | blaise-lang/include/gasp/blaise/impl/blaise_ast_expression_type.hpp | sanelli/gasp | 108700e8739534e9c152d7c8e2f1308917cf8611 | [
"MIT"
] | null | null | null | #pragma once
namespace gasp::blaise::ast {
enum class blaise_ast_expression_type {
UNDEFINED,
BINARY,
UNARY,
IDENTIFIER,
FUNCTION_CALL,
LITERAL_BYTE,
LITERAL_SHORT,
LITERAL_INTEGER,
LITERAL_LONG,
LITERAL_FLOAT,
LITERAL_DOUBLE,
LITERAL_CHAR,
LITERAL_STRING,
LITERAL_BOOLEAN,
CAST,
TERNARY,
NEW
};
} | 14.04 | 39 | 0.695157 | sanelli |
c1aa8d6c3f6108a31f23fac8985e0004c22efa8e | 6,156 | cpp | C++ | src/game/client/tf/vgui/panels/tf_itemtooltippanel.cpp | TF2V/Tf2Vintage | 983d652c338dc017dca51f5bc4eee1a3d4b7ac2e | [
"Unlicense"
] | 18 | 2017-07-14T09:43:26.000Z | 2021-09-12T08:56:05.000Z | src/game/client/tf/vgui/panels/tf_itemtooltippanel.cpp | TF2V/Tf2Vintage | 983d652c338dc017dca51f5bc4eee1a3d4b7ac2e | [
"Unlicense"
] | 13 | 2017-08-08T02:07:18.000Z | 2022-03-22T23:49:58.000Z | src/game/client/tf/vgui/panels/tf_itemtooltippanel.cpp | TF2V/Tf2Vintage | 983d652c338dc017dca51f5bc4eee1a3d4b7ac2e | [
"Unlicense"
] | 15 | 2017-07-14T11:01:35.000Z | 2021-09-04T06:55:27.000Z | #include "cbase.h"
#include "tf_itemtooltippanel.h"
#include "tf_mainmenupanel.h"
#include "tf_mainmenu.h"
#include "controls/tf_advbuttonbase.h"
#include "controls/tf_advmodelpanel.h"
#include <vgui/ILocalize.h>
#include <vgui_controls/TextImage.h>
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
using namespace vgui;
//-----------------------------------------------------------------------------
// Purpose: Constructor
//-----------------------------------------------------------------------------
CTFItemToolTipPanel::CTFItemToolTipPanel( Panel* parent, const char *panelName ) : CTFToolTipPanel( parent, panelName )
{
m_pClassModelPanel = new CTFAdvModelPanel( this, "classmodelpanel" );
m_pTitle = new CExLabel( this, "TitleLabel", "Title" );
m_pClassName = new CExLabel( this, "ClassNameLabel", "ClassName" );
m_pYear = new CExLabel( this, "YearLabel", "Year" );
m_pAttributeText = new CExLabel( this, "AttributeLabel", "Attribute" );
for ( int i = 0; i < 31; i++ )
{
m_pAttributes.AddToTail( new CExLabel( this, VarArgs( "attribute_%d", i ), "Attribute" ) );
}
Init();
}
//-----------------------------------------------------------------------------
// Purpose: Destructor
//-----------------------------------------------------------------------------
CTFItemToolTipPanel::~CTFItemToolTipPanel()
{
}
bool CTFItemToolTipPanel::Init( void )
{
return BaseClass::Init();
}
void CTFItemToolTipPanel::ApplySchemeSettings( IScheme *pScheme )
{
BaseClass::ApplySchemeSettings( pScheme );
LoadControlSettings( "resource/UI/main_menu/ItemToolTipPanel.res" );
if ( m_pTitle )
{
m_colorTitle = m_pTitle->GetFgColor();
}
}
void CTFItemToolTipPanel::PerformLayout()
{
// Place attributes one under the other.
int x, y, wide, tall;
m_pAttributeText->GetBounds( x, y, wide, tall );
int iTotalHeight = y;
for ( int i = 0; i < m_pAttributes.Count(); i++ )
{
CExLabel *pLabel = m_pAttributes[i];
if ( pLabel->IsVisible() )
{
pLabel->SetPos( x + XRES( 5 ), iTotalHeight );
int twide, ttall;
pLabel->GetTextImage()->GetContentSize( twide, ttall );
pLabel->SetSize( pLabel->GetWide(), ttall );
iTotalHeight += ttall;
}
}
// Set the tooltip size based on attribute list size.
SetSize( GetWide(), iTotalHeight + YRES( 10 ) );
};
void CTFItemToolTipPanel::OnChildSettingsApplied( KeyValues *pInResourceData, Panel *pChild )
{
// Apply settings from template to all attribute strings.
if ( pChild == m_pAttributeText )
{
for ( int i = 0; i < m_pAttributes.Count(); i++ )
{
m_pAttributes[i]->ApplySettings( pInResourceData );
}
}
BaseClass::OnChildSettingsApplied( pInResourceData, pChild );
}
void CTFItemToolTipPanel::ShowToolTip(CEconItemDefinition *pItemData)
{
Show();
IScheme *pScheme = scheme()->GetIScheme( GetScheme() );
if ( !pScheme )
return;
/*
char pModel[64];
Q_snprintf(pModel, sizeof(pModel), pItemData->model_world);
if (!Q_strcmp(pModel, ""))
Q_snprintf(pModel, sizeof(pModel), pItemData->model_player);
m_pClassModelPanel->SetModelName(strdup(pModel), 0);
if (Q_strcmp(pModel, ""))
{
m_pClassModelPanel->SetVisible(true);
m_pClassModelPanel->Update();
}
*/
if ( m_pTitle )
{
m_pTitle->SetText( pItemData->GenerateLocalizedFullItemName() );
Color colTitle = pScheme->GetColor( g_szQualityColorStrings[pItemData->item_quality], m_colorTitle );
m_colQuality = colTitle;
m_pTitle->SetFgColor( colTitle );
}
if ( m_pClassName )
{
m_pClassName->SetText( pItemData->GetTypeName() );
}
if ( m_pYear )
{
// Show the item's year at the beginning.
if (pItemData->year >= 2006) // Only debug, undefined always whitelisted items before this period.
{
wchar_t wszYear[128];
swprintf_s(wszYear, L"%d", pItemData->year);
m_pYear->SetText(wszYear);
}
}
for ( int i = 0; i < m_pAttributes.Count(); i++ )
m_pAttributes[i]->SetVisible( false );
if ( m_pAttributeText )
{
for ( int i = 0; i <= ( pItemData->attributes.Count() ); i++ )
{
CExLabel *pLabel = m_pAttributes[i];
if ( i == pItemData->attributes.Count() )
{
// Show item description at the end.
if ( !pItemData->GetDescription() )
continue;
pLabel->SetText( pItemData->GetDescription() );
pLabel->SetFgColor( pScheme->GetColor( "ItemAttribNeutral", COLOR_WHITE ) );
pLabel->SetVisible( true );
}
else
{
static_attrib_t *pAttribute = &pItemData->attributes[i];
const CEconAttributeDefinition *pStatic = pAttribute->GetStaticData();
if ( !pStatic || pStatic->hidden )
continue;
float flValue = pAttribute->value.flVal;
switch ( pStatic->description_format )
{
case ATTRIB_FORMAT_PERCENTAGE:
flValue = flValue - 1.0f;
flValue *= 100.0f;
break;
case ATTRIB_FORMAT_INVERTED_PERCENTAGE:
flValue = 1.0f - flValue;
flValue *= 100.0f;
break;
case ATTRIB_FORMAT_ADDITIVE_PERCENTAGE:
flValue *= 100.0f;
break;
}
wchar_t wszValue[32];
V_snwprintf( wszValue, sizeof( wszValue ) / sizeof( wchar_t ), L"%.0f", flValue );
const wchar_t *pszLocalized = g_pVGuiLocalize->Find( pStatic->GetDescription() );
if ( !pszLocalized || pszLocalized[0] == '\0' )
continue;
wchar_t wszAttrib[128];
g_pVGuiLocalize->ConstructString( wszAttrib, sizeof( wszAttrib ), pszLocalized, 1, wszValue );
pLabel->SetText( wszAttrib );
Color attrcolor;
switch ( pStatic->effect_type )
{
case ATTRIB_EFFECT_NEUTRAL:
attrcolor = GETSCHEME()->GetColor( "ItemAttribNeutral", COLOR_WHITE );
break;
case ATTRIB_EFFECT_POSITIVE:
attrcolor = GETSCHEME()->GetColor( "ItemAttribPositive", COLOR_WHITE );
break;
case ATTRIB_EFFECT_NEGATIVE:
attrcolor = GETSCHEME()->GetColor( "ItemAttribNegative", COLOR_WHITE );
break;
}
pLabel->SetFgColor( attrcolor );
pLabel->SetVisible( true );
}
}
}
InvalidateLayout( true );
}
void CTFItemToolTipPanel::HideToolTip()
{
Hide();
}
void CTFItemToolTipPanel::Show()
{
BaseClass::Show();
MakePopup();
}
void CTFItemToolTipPanel::Hide()
{
BaseClass::Hide();
} | 25.757322 | 119 | 0.645712 | TF2V |
c1af9ac803a94d1cc3ac6ada9147e6a50b90c521 | 9,293 | cpp | C++ | Plugins/SHTNPlanner/Source/SHTNPlannerEditor/Private/DetailCustomizations/WorldStateDebugDetails.cpp | Strik3One/SHTNPlanner | deafb243e80913c71c0eaac4936804ad3625ff4c | [
"MIT"
] | 14 | 2020-12-09T14:16:27.000Z | 2022-02-01T19:45:20.000Z | Plugins/SHTNPlanner/Source/SHTNPlannerEditor/Private/DetailCustomizations/WorldStateDebugDetails.cpp | Strik3One/SHTNPlanner | deafb243e80913c71c0eaac4936804ad3625ff4c | [
"MIT"
] | null | null | null | Plugins/SHTNPlanner/Source/SHTNPlannerEditor/Private/DetailCustomizations/WorldStateDebugDetails.cpp | Strik3One/SHTNPlanner | deafb243e80913c71c0eaac4936804ad3625ff4c | [
"MIT"
] | 4 | 2020-12-16T15:42:30.000Z | 2021-08-15T17:52:19.000Z | #include "WorldStateDebugDetails.h"
#include "PropertyEditing.h"
#include "Widgets/Input/SNumericEntryBox.h"
#include "InputCoreTypes.h"
#include "SGraphActionMenu.h"
#include "Kismet/GameplayStatics.h"
#include "Widgets/SWidget.h"
#include "Widgets/Layout/SExpandableArea.h"
#include "Engine/Selection.h"
#include "AIController.h"
#include "SHTNComponent.h"
#include "SHTNPlannerEditor.h"
#include "BehaviorTreeEditor/Private/SBehaviorTreeBlackboardView.cpp"
#include "BehaviorTreeEditor\Private\SBehaviorTreeBlackboardEditor.h"
#include "WorldStateDebugTool.h"
DEFINE_LOG_CATEGORY(LogBlackboardEditor);
#define LOCTEXT_NAMESPACE "WorldStateDebugDetails"
TSharedRef<IDetailCustomization> FWorldStateDebugDetails::MakeInstance()
{
return MakeShareable(new FWorldStateDebugDetails);
}
void FWorldStateDebugDetails::RefreshDetails()
{
FPropertyEditorModule& PropertyEditorModule = FModuleManager::GetModuleChecked<FPropertyEditorModule>("PropertyEditor");
PropertyEditorModule.NotifyCustomizationModuleChanged();
}
void FWorldStateDebugDetails::OnNewPlanMade()
{
FillPlanTaskNames();
if (CurrentPlanWidget)
{
CurrentPlanWidget->RequestListRefresh();
}
else
{
DetailBuilderPtr->ForceRefreshDetails();
}
}
void FWorldStateDebugDetails::CustomizeDetails(IDetailLayoutBuilder& DetailBuilder)
{
DetailBuilderPtr = &DetailBuilder;
TArray<TWeakObjectPtr<UObject>> CustomizedObjects;
DetailBuilder.GetObjectsBeingCustomized(CustomizedObjects);
ToolInstance = CastChecked<UWorldStateDebugTool>(CustomizedObjects[0].Get());
ToolInstance->OnCreation(this);
IDetailCategoryBuilder& Selection = DetailBuilder.EditCategory("Selection");
Selection.AddCustomRow(LOCTEXT("SelectedAgent", "Selection Agent Selected"))
.NameContent()
[
SNew(STextBlock)
.Text(LOCTEXT("Selected HTN Agent", "Selected HTN Agent"))
]
.ValueContent()
[
SNew(SComboButton)
.OnGetMenuContent(this, &FWorldStateDebugDetails::OnGetMenuContent)
.IsEnabled(this, &FWorldStateDebugDetails::IsEditingEnabled)
.ButtonContent()
[
SNew(STextBlock)
.Text(this, &FWorldStateDebugDetails::GetCurrentAgentDesc)
.Font(IDetailLayoutBuilder::GetDetailFont())
]
];
if (ToolInstance->SelectedComponent)
{
Selection.AddCustomRow(LOCTEXT("Select Agent in PIE", "Select Agent in PIE"))
.NameContent()
[
SNew(STextBlock)
.Text(LOCTEXT("Select Agent in PIE", "Select Agent in PIE"))
]
.ValueContent()
[
SNew(SCheckBox)
.IsChecked(ToolInstance->bSelectInPIE)
.OnCheckStateChanged_Lambda([this](ECheckBoxState NewState)
{
if (NewState == ECheckBoxState::Checked)
{
OnObjectSelectedHandle = USelection::SelectObjectEvent.AddSP(this, &FWorldStateDebugDetails::OnObjectSelected);
ToolInstance->bSelectInPIE = true;
}
else
{
USelection::SelectObjectEvent.Remove(OnObjectSelectedHandle);
ToolInstance->bSelectInPIE = false;
}
})
];
if (ToolInstance->bSelectInPIE)
{
OnObjectSelectedHandle = USelection::SelectObjectEvent.AddSP(this, &FWorldStateDebugDetails::OnObjectSelected);
}
IDetailCategoryBuilder& WorldState = DetailBuilder.EditCategory("WorldState");
WorldState.AddCustomRow(LOCTEXT("WorldState", "WorldState"))
.WholeRowContent()
[
SNew(SGraphActionMenu, true)
.OnCreateWidgetForAction(this, &FWorldStateDebugDetails::HandleCreateWidgetForAction)
.OnCollectAllActions(this, &FWorldStateDebugDetails::HandleCollectAllActions)
.OnGetSectionTitle(this, &FWorldStateDebugDetails::HandleGetSectionTitle)
//.OnActionSelected(this, &SBehaviorTreeBlackboardView::HandleActionSelected)
//.OnContextMenuOpening(this, &SBehaviorTreeBlackboardView::HandleContextMenuOpening, InCommandList)
//.OnActionMatchesName(this, &SBehaviorTreeBlackboardView::HandleActionMatchesName)
.AlphaSortItems(GetDefault<UEditorPerProjectUserSettings>()->bDisplayBlackboardKeysInAlphabeticalOrder)
.AutoExpandActionMenu(true)
];
FillPlanTaskNames();
IDetailCategoryBuilder& Plan = DetailBuilder.EditCategory("Plan");
Plan.AddCustomRow(LOCTEXT("Current Task", "Current Task"))
.NameContent()
[
SNew(STextBlock)
.Text(LOCTEXT("Current Task:", "Current Task:"))
]
.ValueContent()
[
SNew(STextBlock)
.Text_Raw(this, &FWorldStateDebugDetails::GetCurrentTaskName)
];
Plan.AddCustomRow(LOCTEXT("CurrentPlan", "CurrentPlan"))
.WholeRowContent()
[
SNew(SExpandableArea)
.AreaTitle(LOCTEXT("Current Plan", "Current Plan"))
.InitiallyCollapsed(false)
.BodyContent()
[
SAssignNew(CurrentPlanWidget, SListView<TSharedPtr<FString>>)
.ListItemsSource(&PlanTaskNames)
.OnGenerateRow(this, &FWorldStateDebugDetails::OnGenerateRowForList)
]
];
}
DetailBuilder.HideCategory("Tags");
DetailBuilder.HideCategory("ComponentReplication");
DetailBuilder.HideCategory("Activation");
DetailBuilder.HideCategory("Variable");
DetailBuilder.HideCategory("Cooking");
DetailBuilder.HideCategory("AssetUserData");
}
void FWorldStateDebugDetails::OnAgentComboChange(int32 Index)
{
if (Index != ToolInstance->CurrentIndex)
{
if (ToolInstance->OnNewPlanMadeHandle.IsValid())
{
ToolInstance->SelectedComponent->OnNewPlanMade.Remove(ToolInstance->OnNewPlanMadeHandle);
ToolInstance->OnNewPlanMadeHandle.Reset();
}
ToolInstance->CurrentIndex = Index;
ToolInstance->SelectedComponent = ToolInstance->HTNComponents[Index];
FillPlanTaskNames();
DetailBuilderPtr->ForceRefreshDetails();
}
}
TSharedRef<SWidget> FWorldStateDebugDetails::OnGetMenuContent() const
{
FMenuBuilder MenuBuilder(true, NULL);
for (int32 Idx = 0; Idx < ToolInstance->HTNComponents.Num(); Idx++)
{
FUIAction ItemAction(FExecuteAction::CreateSP(this, &FWorldStateDebugDetails::OnAgentComboChange, Idx));
MenuBuilder.AddMenuEntry(FText::FromName(ToolInstance->HTNComponents[Idx]->OwningPawnName), TAttribute<FText>(), FSlateIcon(), ItemAction);
}
return MenuBuilder.MakeWidget();
}
FText FWorldStateDebugDetails::GetCurrentAgentDesc() const
{
if (ToolInstance->bIsPlayingWorld)
{
if (IsValid(ToolInstance->SelectedComponent))
{
return FText::FromName(ToolInstance->SelectedComponent->OwningPawnName);
}
else
{
return FText::FromString("No HTN Agent found");
}
}
else
{
return FText::FromString("No active world");
}
}
bool FWorldStateDebugDetails::IsEditingEnabled() const
{
return ToolInstance->bIsPlayingWorld && ToolInstance->HTNComponents.Num();
}
void FWorldStateDebugDetails::FillPlanTaskNames()
{
PlanTaskNames.Empty();
for (auto& Name : ToolInstance->SelectedComponent->DebugTaskNames)
{
PlanTaskNames.Add(MakeShareable(new FString(Name.ToString())));
}
}
FText FWorldStateDebugDetails::GetCurrentTaskName() const
{
return FText::FromName(ToolInstance->SelectedComponent->CurrentTaskName);
}
TSharedRef<ITableRow> FWorldStateDebugDetails::OnGenerateRowForList(TSharedPtr<FString> Item, const TSharedRef<STableViewBase>& OwnerTable)
{
return SNew(STableRow<TSharedPtr<FString>>, OwnerTable)
[
SNew(STextBlock).Text(FText::FromString(*Item.Get()))
];
}
TSharedRef<SWidget> FWorldStateDebugDetails::HandleCreateWidgetForAction(FCreateWidgetForActionData* const InCreateData)
{
return SNew(SBehaviorTreeBlackboardItem, InCreateData)
.OnIsDebuggerReady(this, &FWorldStateDebugDetails::IsDebuggerReady)
.OnGetDebugKeyValue(this, &FWorldStateDebugDetails::HandleGetDebugKeyValue)
.OnGetDisplayCurrentState(this, &FWorldStateDebugDetails::DisplayCurrentState);
}
void FWorldStateDebugDetails::HandleCollectAllActions(FGraphActionListBuilderBase& GraphActionListBuilder)
{
if (ToolInstance->SelectedComponent != nullptr)
{
UBlackboardData* BlackboardData = ToolInstance->SelectedComponent->BlackboardState->GetBlackboardAsset();
for (auto& ParentKey : BlackboardData->ParentKeys)
{
GraphActionListBuilder.AddAction(MakeShareable(new FEdGraphSchemaAction_BlackboardEntry(BlackboardData, ParentKey, true)));
}
for (auto& Key : BlackboardData->Keys)
{
GraphActionListBuilder.AddAction(MakeShareable(new FEdGraphSchemaAction_BlackboardEntry(BlackboardData, Key, false)));
}
}
}
FText FWorldStateDebugDetails::HandleGetDebugKeyValue(const FName& InKeyName, bool bUseCurrentState) const
{
if (ToolInstance && ToolInstance->SelectedComponent)
{
return FText::FromString(ToolInstance->SelectedComponent->BlackboardState->DescribeKeyValue(InKeyName, EBlackboardDescription::OnlyValue));
}
return FText::FromString("Error");
}
bool FWorldStateDebugDetails::IsDebuggerReady() const
{
return IsValid(ToolInstance->SelectedComponent);
}
FText FWorldStateDebugDetails::HandleGetSectionTitle(int32 SectionID) const
{
switch (SectionID)
{
case EBlackboardSectionTitles::InheritedKeys:
return LOCTEXT("InheritedKeysSectionLabel", "Inherited Keys");
case EBlackboardSectionTitles::Keys:
return LOCTEXT("KeysSectionLabel", "Keys");
}
return FText();
}
void FWorldStateDebugDetails::OnObjectSelected(UObject * Object)
{
int32 Idx = ToolInstance->HTNComponents.IndexOfByPredicate([Object](USHTNComponent* Component) { return Component->OwningPawnName == Object->GetFName(); });
if(Idx >= 0)
{
OnAgentComboChange(Idx);
}
}
#undef LOCTEXT_NAMESPACE | 30.172078 | 157 | 0.772194 | Strik3One |
c1b08f4b11782422550ca80c730b14db2058ae48 | 1,848 | cpp | C++ | stl/SequenceContainers/Source.cpp | xtianhb/modern_cpp | 0b39fe1663a69795a5cfa13c73ed849a74c4121f | [
"MIT"
] | null | null | null | stl/SequenceContainers/Source.cpp | xtianhb/modern_cpp | 0b39fe1663a69795a5cfa13c73ed849a74c4121f | [
"MIT"
] | null | null | null | stl/SequenceContainers/Source.cpp | xtianhb/modern_cpp | 0b39fe1663a69795a5cfa13c73ed849a74c4121f | [
"MIT"
] | null | null | null | #include <iostream>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <forward_list>
void Array() {
std::array<int, 5> arr{ 3,1,8,5,9 };
for (int i = 0; i < arr.size(); ++i) {
arr[i] = i;
}
auto itr = arr.begin();
for (auto x : arr) {
std::cout << x << " ";
}
std::cout << std::endl;
arr.data();
}
void Vector() {
std::vector<int> coll{ 1,2,3,4 };
for (int i = 0; i < 5; ++i) {
coll.push_back(i * 10);
std::cout << coll.size() << std::endl;
}
coll[0] = 100;
//for (int i = 0; i< coll.size(); ++i) {
// std::cout << coll[i] << " ";
//}
auto itr = coll.begin();
while (itr != coll.end()) {
std::cout << *itr++ << " ";
}
coll.insert(coll.begin(), 700);
coll.erase(coll.end()-5);
coll.pop_back();
}
void Deque() {
std::deque<int> coll;
for (int i = 0; i < 5; ++i) {
coll.push_back(i * 10);
}
for (int i = 0; i < 5; ++i) {
coll.push_front(i * 10);
}
coll[0] = 100;
//for (int i = 0; i< coll.size(); ++i) {
// std::cout << coll[i] << " ";
//}
auto itr = coll.begin();
while (itr != coll.end()) {
std::cout << *itr++ << " ";
}
coll.insert(coll.begin(), 700);
coll.erase(coll.end() - 5);
coll.pop_back();
coll.pop_front();
}
void List() {
std::list<int> coll;
for (int i = 0; i < 5; ++i) {
coll.push_back(i * 10);
}
auto itr = coll.begin();
while (itr != coll.end()) {
std::cout << *itr++ << " ";
}
itr = coll.begin();
coll.insert(itr, 800);
coll.erase(itr);
}
void ForwardList() {
std::forward_list<int> coll;
for (int i = 0; i < 10; ++i) {
coll.push_front(i);
}
for (auto x : coll) {
std::cout << x << " ";
}
coll.insert_after(coll.begin(), 10);
coll.erase_after(coll.begin());
}
int main() {
Array();
Vector();
Deque();
List();
ForwardList();
return 0;
} | 20.764045 | 42 | 0.502706 | xtianhb |
c1b5479a18e526e0d453c4a7f60d8a591498c53c | 435 | hpp | C++ | include/elements/solids/movable/MovableSolid.hpp | PalasanRares/WaterSim | ccdffc9d7442ca5bbbb9a2f807db127a9bda2740 | [
"MIT"
] | null | null | null | include/elements/solids/movable/MovableSolid.hpp | PalasanRares/WaterSim | ccdffc9d7442ca5bbbb9a2f807db127a9bda2740 | [
"MIT"
] | null | null | null | include/elements/solids/movable/MovableSolid.hpp | PalasanRares/WaterSim | ccdffc9d7442ca5bbbb9a2f807db127a9bda2740 | [
"MIT"
] | null | null | null | #ifndef _MOVABLE_SOLID_HPP
#define _MOVABLE_SOLID_HPP
#include "elements/Element.hpp"
#include "types.hpp"
class MovableSolid : public Element {
private:
bool goDown(Matrix* matrix, const int& i, const int& j);
bool goDownSide(Matrix* matrix, const int& i, const int& j);
public:
MovableSolid(byte id, int type, rgb color) : Element(id, type, color) {};
void update(Matrix* matrix, const int& i, const int& j);
};
#endif
| 21.75 | 75 | 0.714943 | PalasanRares |
c1b629640928e6177233185c73578c2bf54e09de | 22 | cpp | C++ | matrix.cpp | csiro-robotics/Morphogenesis | 4d390609f941a58f09529371d185a344573de35f | [
"BSD-3-Clause"
] | null | null | null | matrix.cpp | csiro-robotics/Morphogenesis | 4d390609f941a58f09529371d185a344573de35f | [
"BSD-3-Clause"
] | null | null | null | matrix.cpp | csiro-robotics/Morphogenesis | 4d390609f941a58f09529371d185a344573de35f | [
"BSD-3-Clause"
] | null | null | null |
#include "matrix.h"
| 5.5 | 19 | 0.636364 | csiro-robotics |
c1be271b451c2c8a1bf9d2b8a23d9d910319131c | 64,358 | hpp | C++ | include/xpm_icons.hpp | aiordache/landsat-image-merger | c959c7641740ed31cb6dc344c043310cc213e33e | [
"Unlicense"
] | 1 | 2021-01-24T13:57:47.000Z | 2021-01-24T13:57:47.000Z | include/xpm_icons.hpp | aiordache/landsat-image-merger | c959c7641740ed31cb6dc344c043310cc213e33e | [
"Unlicense"
] | null | null | null | include/xpm_icons.hpp | aiordache/landsat-image-merger | c959c7641740ed31cb6dc344c043310cc213e33e | [
"Unlicense"
] | null | null | null | static const char *add_image_icon[] = {
/* columns rows colors chars-per-pixel */
"48 48 144 2 ",
" c #434B53",
". c #444B53",
"X c #434A54",
"o c #434B54",
"O c #444A54",
"+ c #444B54",
"@ c #454C54",
"# c #454C55",
"$ c #464C56",
"% c #464D56",
"& c #474E57",
"* c #484E57",
"= c #484F57",
"- c #494F58",
"; c #495058",
": c #495059",
"> c #4B525A",
", c #4C535B",
"< c #4D535B",
"1 c #4D535C",
"2 c #4E545C",
"3 c #4F555D",
"4 c #50565E",
"5 c #51575F",
"6 c #52585F",
"7 c #525860",
"8 c #535961",
"9 c #545A62",
"0 c #585D64",
"q c #5F646B",
"w c #63676D",
"e c #64696F",
"r c #656A70",
"t c #6B6F74",
"y c #6B6F76",
"u c #6C6F75",
"i c #6C7075",
"p c #6D7177",
"a c #73767C",
"s c #73777C",
"d c #74787E",
"f c #777B80",
"g c #797D82",
"h c #7C7F84",
"j c #7D8085",
"k c #7D8186",
"l c #83868A",
"z c #85898E",
"x c #87898E",
"c c #8A8D91",
"v c #8B8E93",
"b c #8D9094",
"n c #8F9296",
"m c #909296",
"M c #929599",
"N c #A8AAAD",
"B c #AAADB0",
"V c #ABADB1",
"C c #ACAEB1",
"Z c #ADAEB1",
"A c #AFB2B5",
"S c #B0B2B5",
"D c #B3B4B6",
"F c #B8BABC",
"G c #B8BABD",
"H c #B8BBBD",
"J c #B9BBBD",
"K c #BDBEC0",
"L c #BCBEC1",
"P c #BDBFC1",
"I c #BFC0C2",
"U c #BEC0C3",
"Y c #C0C1C3",
"T c #C1C2C4",
"R c #C2C3C5",
"E c #C5C7C9",
"W c #CBCCCE",
"Q c #CCCDD0",
"! c #D1D3D4",
"~ c #D2D3D4",
"^ c #D3D4D6",
"/ c #DADBDC",
"( c #DCDEDF",
") c #DEDFDF",
"_ c #E0E0E1",
"` c #E5E5E6",
"' c #E7E7E8",
"] c #E9EAEB",
"[ c #ECECED",
"{ c #ECEDED",
"} c #EDEEEE",
"| c #EEEEEF",
" . c #E9EEF4",
".. c #EAEEF4",
"X. c #EAEFF5",
"o. c #EBEFF5",
"O. c #EBF0F5",
"+. c #ECF0F5",
"@. c #ECF0F6",
"#. c #ECF1F6",
"$. c #EEF2F6",
"%. c #EEF2F7",
"&. c #EFF3F7",
"*. c #F1F1F2",
"=. c #F0F3F7",
"-. c #F4F5F5",
";. c gray96",
":. c #F6F6F6",
">. c #F6F6F7",
",. c #F6F7F7",
"<. c gray97",
"1. c #F1F4F8",
"2. c #F1F5F8",
"3. c #F2F5F8",
"4. c #F4F7FA",
"5. c #F5F7FA",
"6. c #F6F8FA",
"7. c #F7F8FA",
"8. c #F6F8FB",
"9. c #F7F8FB",
"0. c #F7F9FB",
"q. c #F8F8F8",
"w. c #F9F9FA",
"e. c #F8F9FB",
"r. c gray98",
"t. c #F8FAFC",
"y. c #F9FAFC",
"u. c #F9FBFC",
"i. c #FAFBFC",
"p. c #FAFBFD",
"a. c #FAFCFC",
"s. c #FBFCFD",
"d. c gray99",
"f. c #FCFCFD",
"g. c #FCFDFD",
"h. c #FDFDFD",
"j. c #FCFDFE",
"k. c #FDFDFE",
"l. c #FDFEFE",
"z. c #FEFEFE",
"x. c #FEFEFF",
"c. c #FEFFFF",
"v. c gray100",
"b. c None",
/* pixels */
"b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.b. + + + + + + + + + + @ + + + + + + + + @ b.b.b.b.b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.@ @ @ + + + + + + + + + + + @ + + + + + + + + + + + o b.b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.@ = d Z T T T R T I R T T T R T T T T R T R D y > d g 5 @ o b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ @ h / r.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.[ z 5 S ' L p @ b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 2 B k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.[ z 7 H k.r.~ d @ @ b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 6 H k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.[ v 1 S k.k.r.R 0 @ b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.q.N = v ] d.k.} z @ + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.k.k.k.k.k.i.s.s.s.s.s.s.r.s.s.k.k.~ e 2 m W _ ) m = + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.q.O. . . . . . . . .O.q.k.q.J q = 2 2 2 = @ + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.r.#.O.O.#.#.O.O.O.O.#.i.k.k.>.! M d i i t e & b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.q.>.>.>.>.*.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.>.E b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.Q r @ b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 @ b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 @ b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.R 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.I 7 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.o 7 H k.k.k.k.k.k.k.k.s.k.k.k.s.k.k.k.k.s.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.@ 7 J k.k.k.k.k.#.#.#.O.O.O.O.O.O.O.O.O.O.#.#.O.#.#.s.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.@ 7 J k.k.k.k.i.#. . . . . . . .X. . . . . . . . .#.i.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.@ 7 J k.k.k.k.k.k.s.r.s.i.s.t.s.q.q.s.s.t.i.i.s.r.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.i.i.q.t.9.i.q.q.t.i.t.9.i.t.t.i.q.i.k.k.k.k.k.R 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.s.#.@. .@. .@. .O.O. .O. . . . .@. .#.s.k.k.k.k.I 7 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.s.4.%.%.%.%.&.#.&.#.#.&.#.&.%.%.%.%.4.s.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.s.k.k.s.k.k.k.k.k.k.k.k.s.k.k.s.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.k.4.&.&.&.&.&.&.&.&.&.&.&.t.k.k.k.q.4.s.k.k.k.k.R 9 @ b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.r.#. . . . . . . . . . . .&.k.k.k.4. .q.k.k.k.k.I 7 @ b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.k.q.q.4.t.q.4.q.4.q.4.q.t.t.k.k.k.k.t.k.k.k.k.k.U 9 o b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 H k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.U 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.R 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.I 7 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 7 J k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.L 9 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ 1 C k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.i.C 1 + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.+ @ l ` k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.k.d./ k + + b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.# > b L R R R R R R R R R R R R R R R R R R R R R R R R D k - + b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.+ + & > @ > @ = = = = = = = - > @ > @ - = = = > @ > @ @ + + b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.b.o + @ @ + @ + + + + + + + + @ @ + @ + + + + @ @ + + + b.b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.",
"b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b.b."
};
static const char *image_icon_1[] = {
/* columns rows colors chars-per-pixel */
"64 64 97 2 ",
" c #434A53",
". c #434B53",
"X c #444A53",
"o c #444B53",
"O c #434B54",
"+ c #444A54",
"@ c #444B54",
"# c #454C55",
"$ c #4A5159",
"% c #4B515A",
"& c #4B525B",
"* c #545B63",
"= c #595E67",
"- c #5A6068",
"; c #60666D",
": c #61676E",
"> c #61676F",
", c #62686F",
"< c #636970",
"1 c #646971",
"2 c #646A72",
"3 c #70757C",
"4 c #757A81",
"5 c #70C1FE",
"6 c #71C1FE",
"7 c #70C2FE",
"8 c #71C2FE",
"9 c #70C2FF",
"0 c #71C2FF",
"q c #73C3FF",
"w c #74C3FF",
"e c #75C4FF",
"r c #7AC6FF",
"t c #7BC6FF",
"y c #7CC7FF",
"u c #A8ACB0",
"i c #ABAEB2",
"p c #B0B3B7",
"a c #B4B7BB",
"s c #BCBEC1",
"d c #84CAFF",
"f c #88CCFF",
"g c #8ACDFF",
"h c #95D2FF",
"j c #96D2FF",
"k c #9BD4FF",
"l c #9CD4FF",
"z c #A5D8FE",
"x c #A9DAFE",
"c c #B2DEFF",
"v c #B3DEFF",
"b c #B8E0FF",
"n c #B8E1FF",
"m c #BFE3FF",
"M c #C2C4C7",
"N c #CBCDCF",
"B c #CCCED0",
"V c #CCCED1",
"C c #CDCFD1",
"Z c #CED0D2",
"A c #CFD0D3",
"S c #CFD1D3",
"D c #D0D2D4",
"F c #D1D3D5",
"G c #D2D3D5",
"H c #D2D4D6",
"J c #DADCDE",
"K c #DFE1E2",
"L c #C0E4FF",
"P c #C7E7FF",
"I c #C8E7FF",
"U c #D4EDFF",
"Y c #DBF0FF",
"T c #DEF1FF",
"R c #E4E4E6",
"E c #ECEDEE",
"W c #EDEDEE",
"Q c #EDEEEF",
"! c #EEEFF0",
"~ c #EFEFF0",
"^ c #E0F2FF",
"/ c #E1F2FF",
"( c #E2F3FF",
") c #E8F5FF",
"_ c #EAF6FF",
"` c #EDF7FF",
"' c #EEF8FF",
"] c #F0F0F1",
"[ c #F1F9FF",
"{ c #F4FAFF",
"} c #FBFBFB",
"| c #FCFEFF",
" . c #FDFEFF",
".. c #FEFEFE",
"X. c #FEFFFF",
"o. c white",
"O. c None",
/* pixels */
"O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.O.0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 O.O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.0 0 0 0 l v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v k 0 9 0 0 O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.0 0 t ( o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.( t 0 0 O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 I o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.P 0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 [ o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.[ 0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.) ` o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.m t 0 0 g Y o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.v 9 9 0 0 0 e T o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.{ e 0 0 0 0 0 0 j o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.U 0 0 0 0 0 0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.U 0 0 0 0 0 0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.{ e 0 0 0 0 0 0 j o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.n 0 0 0 0 0 w ( o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.L t 0 0 g T o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.| ) ' o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.} H M R o.o.o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.F - @ @ @ 4 Q o.o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.N $ @ @ @ @ # - E o.o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.B $ @ @ @ @ # # + ; E o.o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.B $ @ @ @ @ @ @ @ @ @ , ! o.o.o.o.o.0 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 0 o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.B & @ @ @ @ @ @ @ @ @ @ @ , ! o.o.o.o.d 0 0 O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.0 0 d o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.B & @ @ @ @ @ @ @ @ @ @ @ @ @ , Q o.o.o.) x O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.z ) o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.B & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ 2 Q o.o.o.o.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.o.Z & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o 2 Q o.o.o.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.o.o.o.F p s ] o.o.o.o.o.o.o.o.o.o.o.S & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o @ 2 ] o.o.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.o.Q 3 @ @ @ $ a o.o.o.o.o.o.o.o.o.Z & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o 2 ] o.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.Q ; @ @ @ # @ i o.o.o.o.o.o.o.F & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o 2 R O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.J ; # # @ @ @ @ i o.o.o.o.o.F $ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ = O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.* # # @ @ @ @ @ i o.o.o.F & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.+ O # # # @ @ @ @ @ @ i o.S & @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.o # # # @ @ @ @ @ @ * # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O. # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.# # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.# # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O. # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.# # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O. # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.. # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.o # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O. # # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O. # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ o O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.O. # # @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ + O.O.O.O.O.O.O.O.O.O.O.O.",
"O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O."
};
static const char *image_icon_2[] = {
/* columns rows colors chars-per-pixel */
"64 64 146 2 ",
" c #434A53",
". c #434B53",
"X c #444A53",
"o c #444B53",
"O c #434A54",
"+ c #434B54",
"@ c #444A54",
"# c #444B54",
"$ c #464D56",
"% c #474E57",
"& c #495059",
"* c #4E545D",
"= c #4F565E",
"- c #50575F",
"; c #515860",
": c #545B63",
"> c #585E66",
", c #595F67",
"< c #5C626A",
"1 c #5E646B",
"2 c #6B7078",
"3 c #6D737A",
"4 c #6F747B",
"5 c #747A80",
"6 c #7B8086",
"7 c #7D8288",
"8 c #70C1FE",
"9 c #71C1FE",
"0 c #70C2FE",
"q c #71C2FF",
"w c #72C2FF",
"e c #73C3FF",
"r c #74C3FF",
"t c #77C4FF",
"y c #78C5FF",
"u c #79C6FF",
"i c #7AC6FE",
"p c #7AC6FF",
"a c #7BC6FF",
"s c #7DC7FF",
"d c #7EC8FF",
"f c #7FC8FF",
"g c #898D93",
"h c #8D9398",
"j c #9A9EA2",
"k c #9B9FA4",
"l c #9CA0A4",
"z c #A0A3A8",
"x c #A3A7AB",
"c c #A6A9AD",
"v c #A7AAAF",
"b c #B4B7BB",
"n c #B6B8BC",
"m c #B7BABD",
"M c #81C9FF",
"N c #83CAFF",
"B c #84CAFF",
"V c #85CBFF",
"C c #86CBFF",
"Z c #87CCFF",
"A c #8ACDFF",
"S c #8DCEFF",
"D c #8ECEFF",
"F c #90CFFF",
"G c #92D0FF",
"H c #96D2FF",
"J c #9BD4FF",
"K c #9CD5FF",
"L c #9ED5FF",
"P c #A1D6FE",
"I c #A0D6FF",
"U c #A3D7FF",
"Y c #A3D8FF",
"T c #A4D8FF",
"R c #A5D8FF",
"E c #A7D9FF",
"W c #A8D9FF",
"Q c #A8DAFF",
"! c #A9DAFF",
"~ c #AADAFF",
"^ c #AADBFF",
"/ c #ABDBFF",
"( c #ADDCFF",
") c #AFDDFF",
"_ c #B1DEFF",
"` c #B8E0FF",
"' c #B9E1FF",
"] c #BCE2FF",
"[ c #BDE3FF",
"{ c #BEE3FF",
"} c #BFE3FF",
"| c #C5C7CA",
" . c #D7D8DA",
".. c #D7D9DB",
"X. c #D8DADB",
"o. c #DDDEDF",
"O. c #C0E4FF",
"+. c #C1E4FF",
"@. c #C2E5FF",
"#. c #C5E6FF",
"$. c #CAE8FF",
"%. c #CCE9FF",
"&. c #CDEAFF",
"*. c #CEEAFF",
"=. c #CFEAFF",
"-. c #D0EBFF",
";. c #D3ECFF",
":. c #D4ECFF",
">. c #D4EDFF",
",. c #D5EDFF",
"<. c #D6EEFF",
"1. c #D8EEFF",
"2. c #DAEFFF",
"3. c #DCF0FF",
"4. c #DDF0FF",
"5. c #E2E3E4",
"6. c #E2E3E5",
"7. c #E4E5E6",
"8. c #E7E8E9",
"9. c #ECEDEE",
"0. c #EDEDEE",
"q. c #E0F2FF",
"w. c #E1F2FF",
"e. c #E3F3FE",
"r. c #E5F4FF",
"t. c #E6F4FF",
"y. c #E8F5FF",
"u. c #EBF6FF",
"i. c #ECF7FF",
"p. c #EDF7FF",
"a. c #EFF8FF",
"s. c #F6F7F7",
"d. c #F1F9FF",
"f. c #F2F9FF",
"g. c #F6FBFF",
"h. c #F7FBFF",
"j. c #F8FCFF",
"k. c #F9FCFF",
"l. c #F9FDFF",
"z. c #FAFDFF",
"x. c #FBFDFF",
"c. c #FCFEFF",
"v. c #FDFEFF",
"b. c #FEFFFF",
"n. c white",
"m. c None",
/* pixels */
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.. . # # # # # # # # # # # # # # # # # # # # # # # # # # # . + # m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.+ # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # o . m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.o # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # # ; m 0.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # g b 3 # # # . m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # % X.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # k n.n.| : # # o m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # 7 n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # l n.n.n.8.> # # + m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # j n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # j n.n.n.n.o.& # # m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.m # # 5 n.n.n.n.n.k # # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.5.# # % .n.n.n.n.0.% # o m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.5 + # ; n 9.n.n.n.4 # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.5.= # + # # # # # # # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n. .> . o # # # # # # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.s.v 2 * # # # # # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.l.:.O.O.:.l.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.} p q q q q p } n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.U 0 q q q q q q q Y n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.} q q q B / ! M q q q } n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.l.t q q ! n.n.n.l.! q q p l.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.:.q q B l.n.n.n.n.l.B q q :.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.O.q q / n.n.n.n.n.n.! q q O.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.O.q q R n.n.n.n.n.n.! q q O.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.:.q q B l.n.n.n.n.n.M q q :.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.l.p q q ! l.n.n.l.R q q p l.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.O.q q q B ! ! B q q q O.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.U q q q q q q q q R n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.} p q q q q p O.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.l.:.O.O.:.l.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v + # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.n.;.;.n.n.n.n.n.n.n.n.&.&.n.n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.n.} q 0 ! n.n.n.n.n.n.' q q ' n.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.n.&.q q q q } n.n.n.n.2.q q q q :.n.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # l n.n.n.n.n.n.n.n.n.q.q q q q q e :.n.n.n.Z q q q q p a.n.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.# # x n.n.n.n.n.n.n.n.p.s q q F F q q t q.n.n.B q d d q q S l.n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.o 1 7.n.n.n.n.n.n.n.g.B q q M d.d.M q q M d.n.a.} u.3.t q q ! n.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.n.n.n.n.n.l.H q q p t.n.n.t.p q q A g.n.n.n.n.} q q q $.n.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.n.n.n.n.n.Y q q t :.n.n.n.n.2.q q q J n.n.n.n.n.L q q p r.n.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.n.n.n.n.} q q q O.n.n.n.n.n.n.O.q q q ! n.n.n.n.l.B q q Z h.n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.n.n.n.$.q q q _ n.n.n.n.n.n.n.n._ q q q O.n.n.n.n.u.t q q L n.n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.n.n.q.t q q J n.n.n.n.n.n.n.n.n.n.L q q q :.n.n.n.n.&.q q q } n.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.n.u.s q q S l.n.n.n.n.n.n.n.n.n.n.l.S q q t q.n.n.n.n._ q q q 3.n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.g.M q q M a.n.n.n.n.n.n.n.n.n.n.n.n.d.M q q M a.n.n.n.n.F q q B n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.n.H q q p t.n.n.n.n.n.n.n.n.n.n.n.n.n.n.t.p q q A g.n.n.n.d.d q M n.n.n.n.n.v # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.n.R q q q :.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.:.q q q J n.n.n.n.p.O.p.n.n.n.n.n.z # # . m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.n.' q q q #.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.#.q q q ! n.n.n.n.n.n.n.n.n.n.n.6 # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.&.q q q ( n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.( q q q O.n.n.n.n.n.n.n.n.n. .% # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.t q q J n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.J q q q ;.n.n.n.n.n.n.0.b = # # # m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.q q q A j.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.l.A q q t t.n.n.n.5.< + # # # o m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.q q p q.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.n.q.p q q U n.n.n.h # # # # # m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.q q m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.q q m.m.m.m.m.o # # m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.",
"m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m.m."
};
static const char *color_image_icon[] = {
/* columns rows colors chars-per-pixel */
"48 48 235 2 ",
" c #434B53",
". c #444A53",
"X c #434A54",
"o c #434B54",
"O c #444A54",
"+ c #444B54",
"@ c #454C55",
"# c #464D55",
"$ c #464D56",
"% c #484E57",
"& c #484F57",
"* c #495058",
"= c #495059",
"- c #4C535B",
"; c #4D535B",
": c #4E545C",
"> c #4F555D",
", c #51575F",
"< c #52585F",
"1 c #525860",
"2 c #535961",
"3 c #545A62",
"4 c #585E65",
"5 c #5A5F66",
"6 c #5C6268",
"7 c #5F646B",
"8 c #656A70",
"9 c #6B6F74",
"0 c #6B6F76",
"q c #6B7076",
"w c #6C7075",
"e c #6E7378",
"r c #73777C",
"t c #74797F",
"y c #75797F",
"u c #777B80",
"i c #797E83",
"p c #7B7E83",
"a c #7C7F84",
"s c #71C1FE",
"d c #71C1FF",
"f c #70C2FE",
"g c #71C2FF",
"h c #72C2FF",
"j c #72C3FF",
"k c #74C3FF",
"l c #75C3FF",
"z c #76C4FF",
"x c #77C4FF",
"c c #78C4FF",
"v c #78C5FF",
"b c #79C5FF",
"n c #7AC5FF",
"m c #7BC5FF",
"M c #7BC6FF",
"N c #7CC6FF",
"B c #7EC6FF",
"V c #7EC7FF",
"C c #7FC7FF",
"Z c #85898E",
"A c #878A8E",
"S c #8A8D91",
"D c #8B8E93",
"F c #8F9296",
"G c #909396",
"H c #929599",
"J c #A8AAAD",
"K c #AAADB0",
"L c #ACAEB1",
"P c #ADAEB1",
"I c #AFB2B5",
"U c #B0B2B5",
"Y c #B3B4B6",
"T c #B7B9BC",
"R c #B8BABC",
"E c #B8BABD",
"W c #B8BBBD",
"Q c #B9BBBD",
"! c #BCBEC1",
"~ c #BFC0C2",
"^ c #BEC0C3",
"/ c #BFC0C3",
"( c #80C7FF",
") c #81C7FF",
"_ c #81C8FF",
"` c #82C8FF",
"' c #83C9FF",
"] c #84C9FF",
"[ c #85C9FF",
"{ c #86C9FF",
"} c #87C9FF",
"| c #87CAFF",
" . c #8BCBFE",
".. c #8ACBFF",
"X. c #8ACCFF",
"o. c #8CCCFF",
"O. c #8DCCFF",
"+. c #8ECCFF",
"@. c #8FCDFF",
"#. c #90CDFF",
"$. c #92CEFF",
"%. c #92CFFF",
"&. c #94CEFF",
"*. c #94CFFF",
"=. c #95CFFF",
"-. c #96D0FF",
";. c #97D0FF",
":. c #98D0FF",
">. c #9AD1FF",
",. c #9ED2FF",
"<. c #9ED3FF",
"1. c #A4D5FF",
"2. c #A5D6FF",
"3. c #A8D7FF",
"4. c #A9D7FF",
"5. c #AAD7FF",
"6. c #A8D8FF",
"7. c #ACD8FF",
"8. c #ADD9FF",
"9. c #AEDAFF",
"0. c #AFDAFF",
"q. c #B0DAFF",
"w. c #B1DAFF",
"e. c #B2DBFF",
"r. c #B5DDFF",
"t. c #B6DDFF",
"y. c #B7DDFF",
"u. c #B8DEFF",
"i. c #B8DFFF",
"p. c #BADFFF",
"a. c #BBDFFF",
"s. c #BCDFFF",
"d. c #BEE0FF",
"f. c #BEE1FF",
"g. c #BFE1FF",
"h. c #C0C1C3",
"j. c #C0C2C4",
"k. c #C7C9CB",
"l. c #CBCCCE",
"z. c #CFD0D2",
"x. c #D1D3D4",
"c. c #D2D3D4",
"v. c #D5D6D7",
"b. c #D6D8D9",
"n. c #D9DADC",
"m. c #DADBDC",
"M. c #DEDFE0",
"N. c #C1E2FF",
"B. c #C2E2FF",
"V. c #C3E3FF",
"C. c #C5E4FF",
"Z. c #C6E4FF",
"A. c #C6E5FF",
"S. c #C8E5FF",
"D. c #CAE5FF",
"F. c #CAE6FF",
"G. c #CBE6FF",
"H. c #CDE7FF",
"J. c #CEE7FF",
"K. c #CEE8FF",
"L. c #CFE9FF",
"P. c #D1E8FF",
"I. c #D1E9FF",
"U. c #D3EAFF",
"Y. c #D4EAFF",
"T. c #D5EBFF",
"R. c #D6EBFF",
"E. c #D7EBFF",
"W. c #D5ECFF",
"Q. c #D6ECFF",
"!. c #D9EDFF",
"~. c #DCEEFF",
"^. c #DEEFFF",
"/. c #DFF0FF",
"(. c #E0E0E1",
"). c #E7E8E9",
"_. c #E9EAEB",
"`. c #ECECED",
"'. c #ECEDED",
"]. c #EDEEEE",
"[. c #EEEEEF",
"{. c #E0F0FF",
"}. c #E0F1FF",
"|. c #E1F1FF",
" X c #E2F1FF",
".X c #E3F1FF",
"XX c #E2F2FF",
"oX c #E3F2FF",
"OX c #E4F2FF",
"+X c #E5F2FF",
"@X c #E7F3FF",
"#X c #E7F4FF",
"$X c #E9F4FF",
"%X c #E9F5FF",
"&X c #EBF5FF",
"*X c #ECF5FF",
"=X c #ECF6FF",
"-X c #EDF6FF",
";X c #EDF7FF",
":X c #EFF7FF",
">X c #EFF8FF",
",X c #F1F1F2",
"<X c #F3F3F4",
"1X c gray96",
"2X c #F6F6F6",
"3X c #F6F6F7",
"4X c #F6F7F7",
"5X c gray97",
"6X c #F7F7F8",
"7X c AliceBlue",
"8X c #F1F8FF",
"9X c #F2F9FF",
"0X c #F4FAFF",
"qX c #F5FAFF",
"wX c #F6FBFF",
"eX c #F7FBFF",
"rX c #F8F8F8",
"tX c gray98",
"yX c #FBFCFC",
"uX c #F8FCFF",
"iX c #F9FCFF",
"pX c #FAFDFF",
"aX c #FBFDFF",
"sX c gray99",
"dX c #FCFCFD",
"fX c #FDFDFD",
"gX c #FDFDFE",
"hX c #FCFDFF",
"jX c #FCFEFF",
"kX c #FDFEFF",
"lX c #FEFEFE",
"zX c #FEFEFF",
"xX c #FEFFFF",
"cX c gray100",
"vX c None",
/* pixels */
"vXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXvXvX + + + + + + + + + + + . + + + + + + + + o vXvXvXvXvXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXvX# . # + + + + + + + + + + + # + + + + + + + + + + + + vXvXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvX. & y P j.j.j.j.j.j.j.j.j.j.j.j.j.j.j.j.j.j.Y w * y i , # + vXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ # a m.rXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX`.A , U )./ e # . vXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ : K gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX`.A < W gXgXv.r . o vXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ < W gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX[.D : U gXgXrX^ 4 vXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 W gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXrXJ * S _.gXgX`.A # vXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 W gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXc.8 < F l.(.(.G & + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXrXQ 7 * : : : * + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX<Xc.H y w 9 5 # + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXrX<X<X<XW 1 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 W gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXpXpXgXgXgXgXgXgXgXgX/ 1 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXpXOXC.i.C.oXpXgXgXgXgXgXgX/ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXwXf.[ z l l [ f.qXgXgXgXgXgX/ 1 # vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXV.N b ;.6.;.b b V.pXgXgXgXgX/ 3 o vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgX;XO.z t.9XpX9Xt.z O.;XgXgXgXgXj.3 # vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXW.N o.#XgXgXgXOXo.' W.gXgXgXgX/ 3 o vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 W gXgXgXgXgXgXgXgXgXgXgXgXgXI.N ;.;XgXgXgX>X%.b I.gXgXgXgX^ 3 o vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgX/.' N W.pXgXgXW.V ' oXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX# 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXpX1.k &.D.!.D.&.l 1.wXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX# 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXoX&.l b ' b l =.oXgXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXpXoXe.=.o.&.9.oXgXgXgXgXgXgX/ 1 # vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXpX=XoX=XpXgXgXgXgXgXgXgX/ 3 o vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXj.3 o vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX/ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXpXgXgXgXgXgXgXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgXgX=XC.OXgXgXgXgXpXH.H.wXgXgXgXgXgXgXgXgXgX/ 1 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 Q gXgXgXgXgXgXgX#X<.z ;.#XgXgXpXD.' ' D.gXgXgXgXgXgXgXgXgX/ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 1 W gXgXgXgXgXgX;X3.b k l 1.;XgX=X+.k k ..^.gXgXgXgXgXgXgXgXj.3 # vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvX+ 6 k.gXgXgXgXgXwXt.z ..9.[ l e.9X;X,.,.&.l :.=XgXgXgXgXgXgXgX/ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXj.<XgXgXgXgXpXV.b ' D.wXD.N b s.qX;X;X^.O.z 3.9XgXgXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXgXgXgXgXgXpXD.' b V.wXgXqXV.b N C.pXgXpXH.' b V.pXgXgXgXgXgX^ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXgXgXgXgXgXW.o.z e.9XgXgXgX9Xe.z [ I.pXgXpXd.b [ W.gXgXgXgXgX/ 1 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXgXgXgXpXoX=.l 1.>XgXgXgXgXgX;X1.k &.^.gXgX>X6.k &.OXgXgXgXgX/ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXgXgXgX=X,.l :.OXgXgXgXgXgXgXgX=X;.l :.OXgXgX#X;.z 1.9XgXgXgXj.3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXgXgX9X3.z O.oXgXgXgXgXgXgXgXgXgX^.O.l 1.>XgXgXW.[ b I.gXgXgX/ 3 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXgXwXt.b [ I.pXgXgXgXgXgXgXgXgXgXgXI...z e.9XgXgXH.9.OXgXgXgX! 1 + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXqXV.N ( D.pXgXgXgXgXgXgXgXgXgXgXgXpXC.( b i.pXgXpXwXgXgXgXgXK ; + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXi.' b i.pXgXgXgXgXgXgXgXgXgXgXgXgXgXpXi.b N C.pXgXgXgXgXrXm.p # + vXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXl z 9.9XgXgXgXgXgXgXgXgXgXgXgXgXgXgXgX9X9.b [ Y.gXgX6Xz.P u % + vXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXk k o.oXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXgXoX..k :.>XgXb.w + + + vXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXf vXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXs vXvXvXvX* + vXvXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvX",
"vXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvX"
};
static const char *save_icon[] = {
/* columns rows colors chars-per-pixel */
"48 48 16 1 ",
" c #263238",
". c #C62828",
"X c #CB2B2A",
"o c #E63C32",
"O c #F44336",
"+ c #C05355",
"@ c #E1655E",
"# c #B3ADB3",
"$ c #B8B0B5",
"% c #B0BEC5",
"& c #CFD8DC",
"* c #FCD3D0",
"= c #FCD4D0",
"- c #FCD4D1",
"; c gray100",
": c None",
/* pixels */
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::OOO......%%%%%%%%%%%%%%%%%%%OOO:::::::::::",
"::::::OOO......%%%%%%%%%%%%%%%%%%%OOOO::::::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOO:::::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOO::::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOOO:::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOOOO::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOOOO::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOOOO::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOOOO::::::",
"::::::OOO......%%%%%%%%%%% %%%%OOOOOOOO::::::",
"::::::OOOX.....#%%%%%%%%%%%%%%%%%$OOOOOOOO::::::",
"::::::OOOoX....+#%%%%%%%%%%%%%%%$@OOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOO-;;;;;;;;;;;;;;;;;;;;;;;;;;;;-OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;&&&&&&&&&&&&&&&&&&&&&&;;;;OOO::::::",
"::::::OOO;;;;&&&&&&&&&&&&&&&&&&&&&&;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;&&&&&&&&&&&&&&&&&&&&&&;;;;OOO::::::",
"::::::OOO;;;;&&&&&&&&&&&&&&&&&&&&&&;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;&&&&&&&&&&&&&&&&&&&&&&;;;;OOO::::::",
"::::::OOO;;;;&&&&&&&&&&&&&&&&&&&&&&;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OOO::::::",
"::::::OOO-;;;;;;;;;;;;;;;;;;;;;;;;;;;;*OOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::",
"::::::::::::::::::::::::::::::::::::::::::::::::"
};
static const char *save_as_icon[] = {
/* columns rows colors chars-per-pixel */
"48 48 50 1 ",
" c #263238",
". c #404C4C",
"X c #66674A",
"o c #7B7852",
"O c #C62828",
"+ c #CB2B2A",
"@ c #E63C32",
"# c #F44336",
"$ c #F54932",
"% c #C05355",
"& c #E1655E",
"* c #E47272",
"= c #E57272",
"- c #E57373",
"; c #E17777",
": c #E17778",
"> c #E27878",
", c #E27879",
"< c #FD870B",
"1 c #FF9800",
"2 c #FD9D0A",
"3 c #FF9F0C",
"4 c #CEA318",
"5 c #F6A52A",
"6 c #FFAC31",
"7 c #FFAC32",
"8 c #FFC107",
"9 c #F9C423",
"0 c #F6C32C",
"q c #FFC932",
"w c #AAA37A",
"e c #D0987A",
"r c #E8C66B",
"t c #E8C76B",
"y c #BDB388",
"u c #B3ADB3",
"i c #B8B0B5",
"p c #B2B8BE",
"a c #AFBDC4",
"s c #AFBEC4",
"d c #B0BEC5",
"f c #D5D6C3",
"g c #D2D4CC",
"h c #CFD8DC",
"j c #FCD4D0",
"k c #FCD4D1",
"l c #FFF8E2",
"z c #FFF8ED",
"x c gray100",
"c c None",
/* pixels */
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"ccccc###OOOOOOddddddddddddddddd###cccccccccccccc",
"ccccc###OOOOOOddddddddddddddddd####ccccccccccccc",
"ccccc###OOOOOOddddddddd dddd#####cccccccccccc",
"ccccc###OOOOOOddddddddd dddd######ccccccccccc",
"ccccc###OOOOOOddddddddd dddd#######cccccccccc",
"ccccc###OOOOOOddddddddd dddd########ccccccccc",
"ccccc###OOOOOOddddddddd dddd########ccccccccc",
"ccccc###OOOOOOddddddddd dddd########ccccccccc",
"ccccc###OOOOOOddddddddd dddd########ccccccccc",
"ccccc###+OOOOOudddddddddddddddi########ccccccccc",
"ccccc###@+OOOO%udddddddddddddi&########ccccccccc",
"ccccc##################################ccccccccc",
"ccccc##################################ccccccccc",
"ccccc##################################ccccccccc",
"ccccc##################################ccccccccc",
"ccccc##################################ccccccccc",
"ccccc###kxxxxxxxxxxxxxxxxxxxxxxxxxxj###ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxxxxxxxxxxxxx###ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxxxxxxxxxxxxx###ccccccccc",
"ccccc###xxxxhhhhhhhhhhhhXowfhhhhxxxx###ccccccccc",
"ccccc###xxxxhhhhhhhhhhhho.489tghxxxx###ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxy488q37zxxxx###ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxl88q3117zxxx###ccccccccc",
"ccccc###xxxxhhhhhhhhhhhhh90211117zxx###ccccccccc",
"ccccc###xxxxhhhhhhhhhhhhht21111117zx###ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxxz711111117z###ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxxxz711111117$##ccccccccc",
"ccccc###xxxxhhhhhhhhhhhhhhhg51111111<$#ccccccccc",
"ccccc###xxxxhhhhhhhhhhhhhhhhg51111111<$ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxxxxxxz71111111<ccccccccc",
"ccccc###xxxxxxxxxxxxxxxxxxxxxxz7111111eacccccccc",
"ccccc###jxxxxxxxxxxxxxxxxxxxxxxz71111eddaccccccc",
"ccccc###########################$<11edddp>cccccc",
"ccccc############################$<edddp;-=ccccc",
"cccccccccccccccccccccccccccccccccccaddp:--=ccccc",
"ccccccccccccccccccccccccccccccccccccap>--=cccccc",
"ccccccccccccccccccccccccccccccccccccc>---ccccccc",
"cccccccccccccccccccccccccccccccccccccc==cccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc",
"cccccccccccccccccccccccccccccccccccccccccccccccc"
};
static const char *icon_xpm_data[] = {
/* columns rows colors chars-per-pixel */
"32 32 6 1",
" c black",
". c navy",
"X c red",
"o c yellow",
"O c gray100",
"+ c None",
/* pixels */
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++ ++++++++++",
"++++++++ ............ ++++++++++",
"++++++++ ............ ++++++++++",
"++++++++ .OO......... ++++++++++",
"++++++++ .OO......... ++++++++++",
"++++++++ .OO......... ++++++++++",
"++++++++ .OO...... ",
"++++++++ .OO...... oooooooooooo ",
" .OO...... oooooooooooo ",
" XXXXXXX .OO...... oOOooooooooo ",
" XXXXXXX .OO...... oOOooooooooo ",
" XOOXXXX ......... oOOooooooooo ",
" XOOXXXX ......... oOOooooooooo ",
" XOOXXXX oOOooooooooo ",
" XOOXXXXXXXXX ++++ oOOooooooooo ",
" XOOXXXXXXXXX ++++ oOOooooooooo ",
" XOOXXXXXXXXX ++++ oOOooooooooo ",
" XOOXXXXXXXXX ++++ oooooooooooo ",
" XOOXXXXXXXXX ++++ oooooooooooo ",
" XXXXXXXXXXXX ++++ ",
" XXXXXXXXXXXX ++++++++++++++++++",
" ++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++",
"++++++++++++++++++++++++++++++++"
};
static const char *exit_icon[] = {
/* columns rows colors chars-per-pixel */
"43 43 202 2 ",
" c #8C6B9D",
". c #8C6C9E",
"X c #8D6D9F",
"o c #8D6E9E",
"O c #8D6E9F",
"+ c #8E6E9F",
"@ c #8F6FA0",
"# c #8D70A0",
"$ c #8E70A0",
"% c #8F70A0",
"& c #8E71A1",
"* c #8F71A1",
"= c #8F72A2",
"- c #8F73A2",
"; c #8F73A3",
": c #9071A0",
"> c #9171A1",
", c #9173A2",
"< c #9174A2",
"1 c #9074A3",
"2 c #9374A2",
"3 c #9375A2",
"4 c #9074A4",
"5 c #9075A4",
"6 c #9175A4",
"7 c #927BA7",
"8 c #937BA8",
"9 c #957FAB",
"0 c #9581AC",
"q c #9582AC",
"w c #9783AD",
"e c #9784AE",
"r c #9F83A9",
"t c #9882AD",
"y c #9883AF",
"u c #9987B0",
"i c #9987B1",
"p c #9A86B0",
"a c #9A88B1",
"s c #9A89B1",
"d c #9C8BB2",
"f c #9D8CB2",
"g c #9C8BB4",
"h c #9D8DB5",
"j c #9D8EB4",
"k c #9E90B8",
"l c #9D96B9",
"z c #9E99BB",
"x c #9E9ABC",
"c c #9F9BBC",
"v c #9F9CBD",
"b c #A58EAB",
"n c #AA94AE",
"m c #AB94AF",
"M c #AB95AF",
"N c #AC94B0",
"B c #A092B9",
"V c #A29BBE",
"C c #A09EBF",
"Z c #A59CBD",
"A c #BEA9BA",
"S c #BFAABA",
"D c #C0ABBA",
"F c #C1ADBB",
"G c #C5B2BE",
"H c #A39EC0",
"J c #A69EC1",
"K c #A69FC1",
"L c #A99FC1",
"P c #A3A2C2",
"I c #A6A2C3",
"U c #A3A5C3",
"Y c #A4A5C3",
"T c #A7A5C5",
"R c #A4A6C4",
"E c #A9A2C3",
"W c #ACA7C7",
"Q c #AEA7C7",
"! c #A5A8C5",
"~ c #A5A9C6",
"^ c #ABA7C9",
"/ c #A6ABC8",
"( c #AFABC9",
") c #ACAACA",
"_ c #A8AFCA",
"` c #AFADCE",
"' c #A9B1CB",
"] c #A9B1CC",
"[ c #A9B2CC",
"{ c #AAB3CD",
"} c #ABB5CF",
"| c #ABB6CF",
" . c #B0B0CF",
".. c #ACB7D0",
"X. c #AEB8D2",
"o. c #B1B7D3",
"O. c #B3B7D2",
"+. c #B5B7D5",
"@. c #B2B9D3",
"#. c #B2B9D5",
"$. c #B4BCD7",
"%. c #B8BEDA",
"&. c #B9BFDB",
"*. c #CCBAC2",
"=. c #B7C1DB",
"-. c #B7C2DC",
";. c #BAC0DB",
":. c #BAC1DD",
">. c #B8C3DD",
",. c #BBC2DE",
"<. c #BCC3DD",
"1. c #BDC3DD",
"2. c #BFC5DE",
"3. c #BDC6E1",
"4. c #BEC6E1",
"5. c #BEC7E2",
"6. c #BFC8E2",
"7. c #BFC9E3",
"8. c #BFC9E4",
"9. c #BFCAE4",
"0. c #C0C6DE",
"q. c #C1C6DE",
"w. c #E9DCD4",
"e. c #EADCD4",
"r. c #EBDDD4",
"t. c #EBDED4",
"y. c #EBDED5",
"u. c #ECDFD4",
"i. c #ECDFD5",
"p. c #ECE0D5",
"a. c #F3E6D9",
"s. c #F3E7D9",
"d. c #F5E8DA",
"f. c #F9EDDC",
"g. c #F9EDDD",
"h. c #FAEFDD",
"j. c #C2C7E0",
"k. c #C2C9E0",
"l. c #C3C9E0",
"z. c #C0CAE0",
"x. c #C3CAE1",
"c. c #C0C9E2",
"v. c #C1CAE3",
"b. c #C2CBE3",
"n. c #C0CBE5",
"m. c #C1CBE5",
"M. c #C1CCE6",
"N. c #C2CCE6",
"B. c #C2CDE6",
"V. c #C3CEE7",
"C. c #C6CEE4",
"Z. c #C6CFE5",
"A. c #C4CEE7",
"S. c #C4CFE8",
"D. c #C7D0E6",
"F. c #C8D0E6",
"G. c #C8D1E6",
"H. c #C8D1E7",
"J. c #C9D1E7",
"K. c #C5D0E8",
"L. c #C6D0E8",
"P. c #C6D1E8",
"I. c #C7D1E8",
"U. c #C7D1E9",
"Y. c #C7D2E9",
"T. c #C8D2E8",
"R. c #CAD3E8",
"E. c #CAD4E9",
"W. c #CBD4E9",
"Q. c #C9D4EA",
"!. c #CAD5EA",
"~. c #CBD6EB",
"^. c #CCD5E9",
"/. c #CCD6EB",
"(. c #CCD7EB",
"). c #CFD7EA",
"_. c #CCD7EC",
"`. c #CDD7EC",
"'. c #CDD8EC",
"]. c #CED8EC",
"[. c #CED9EC",
"{. c #CFD9EC",
"}. c #CFDAEE",
"|. c #D0D8EA",
" X c #D1D9EB",
".X c #D2D9EB",
"XX c #D1DAEB",
"oX c #D1DBEE",
"OX c #D7DEED",
"+X c #D6DFEF",
"@X c #DBE2EF",
"#X c #DCE2EF",
"$X c #DAE2F0",
"%X c #DBE2F0",
"&X c #E2E6F1",
"*X c #E3E7F1",
"=X c #E1E6F2",
"-X c #E4E8F1",
";X c #E6EAF2",
":X c #E9EDF3",
">X c #EBEFF4",
",X c None",
/* pixels */
",X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X% % ; % % % % % % % ; % % ; % ; % % % % % % % ; % % ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. 7 / [ [ ' ' ' ' ' ' ' ' ' ' [ [ [ ' ' ' ' ' ' ' U # ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. q X.x ~ X.R x | ' x [ | v U ..~ x | | l _ | v P @.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u 3.9 I -.H q -.#.% o.-.e V ,.R 7 =.$.; @.l.j Z T.2 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u 8.h ` M.) k 8.,.y ,.n.B ^ M. .g 8.6.y q.^.E W Y.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u n.6.8.M.6.3.M.M.3.8.M.3.8.M.8.6.M.Y.T.Q.'.Q.^.T.2 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u n.M.M.M.M.M.M.M.M.M.M.M.M.M.M.M.Y._._.'.'.'.(.Y.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u n.M.M.M.M.M.M.M.M.M.M.M.M.M.M.T.'._.oX'.'.'.'.H.2 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u n.M.M.M.M.M.M.M.M.M.M.M.M.M.Y._.'.$X-XoX'.'.'.T.2 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u n.M.M.M.M.A.M.M.M.M.M.M.M.T.'.'.'.oX+X(.'.'.Q.6.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. u n.M.M.M..XOXA.M.M.M.M.M.Y.'.'.'.'.'.'.(.'.Q.M.6.2 ,X,X,X",
",X,X,X,X,X,X,X@ % ,X,X,X,X. u n.M.M.Q.&X;XXXM.M.M.M.Y._.'.'.'.'.'.'.'.Q.S.M.l.; ,X,X,X",
",X,X,X,X,X,X> S G 2 ,X,X,X. u n.M.M.M.^..XM.M.M.M.Q._.'.'.'.'.'.'.'.'.V.M.S.A.7 ,X,X,X",
",X,X,X,X,X> S s.d.D . ,X,X. u M.M.M.M.M.M.M.M.M.Q.(.'.'.'.'.'.'.'.Y.V.V.S.'.T.2 ,X,X,X",
",X,X,X,X> F s.h.t.N . ,X,X. u 9.M.M.M.M.M.b.M.T.(.(.'.'.'.'.'.'.'.V.9.S.'._.T.5 ,X,X,X",
",X,X,X> D s.h.t.m @ ,X,X,X. e %.%.;.;.;.%.;.1.q.x.k.k.k.b.T.'.Q.S.V.V.Y.'.'.T.; ,X,X,X",
",X,X> F s.h.h.*.2 % : : : > > > 2 ; 2 > < < < < 2 2 2 2 : ( Q.V.9.V.'.'.'.'.6.; ,X,X,X",
",X> D s.h.h.h.s.p.p.u.u.u.u.u.u.t.p.p.p.t.p.p.p.t.p.t.t.b E S.M.V.'.'.'._.Y.6.; ,X,X,X",
" r u.h.h.h.h.h.h.h.h.h.h.h.h.h.h.h.h.f.h.f.h.f.h.h.h.h.n Z M.S.'.'.'.'.S.9.3.2 ,X,X,X",
",X> D s.h.h.h.s.p.t.u.u.u.u.u.u.t.p.t.p.p.p.t.p.p.u.p.t.b I S.'.'.'._.S.9.V.9.; ,X,X,X",
",X,X> F s.h.h.*.2 : : > : : : > 2 ; 2 2 < < < < 2 2 % 2 % W Q.'.'.'.S.V.9.Y.T.; ,X,X,X",
",X,X,X> D s.h.t.n @ ,X,X,X. q ,.q.x.x.x.x.x.k.k.k.2.;.;.<.H.'.'._.S.M.9.Y._.T.2 ,X,X,X",
",X,X,X,X> F s.h.t.N . ,X,X. a Y.(.(.(.'.(.'.(.(.Q.M.M.S.Q.'.'.(.Y.9.M.Y._._.b.; ,X,X,X",
",X,X,X,X,X> S s.d.S . ,X,X. f _.'.'.'.'.(.'.'.'.V.9.S.Q.'.'.(.Y.9.V.T.'.'.Y.6.; ,X,X,X",
",X,X,X,X,X,X> A G 3 ,X,X,X. f ^.'.'.'.'.'.'.Q.M.M.T.'.'.'.Q.T.M.9.T.Q.'.T.9.3.; ,X,X,X",
",X,X,X,X,X,X,X> > ,X,X,X,X. f (.'.'.'.'.'.Q.V.M.S.Q.'.'.'.Y.9.M.T.(.(.T.M.M.6.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. f (.'.'.'.'.Q.S.M.Y.'.'.'.'.V.M.M.Y.(.(.Y.M.M.M.3.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. f (.'.'.'.^.M.M.V.Q.'.'.'.V.M.9.Y.'.(.XXM.M.M.M.3.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. f (.'.'.Q.S.M.V.'.'.'.'.Y.M.M.Y._.(.#X-XQ.M.M.M.6.6 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. f ^.(.Q.M.M.S.Q.'.'.'.Y.9.M.T.'.'.@X;X>X-XQ.M.M.6.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. f '.Q.Y.M.Y.'.'.'._.V.M.M.Y.'.'.V.T.@X;X(.V.M.M.3.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. d Q.M.M.Y.(.'.(.'.S.M.9.Y.'.'.V.M.M.H.XXA.M.M.M.6.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. a M.M.S.Q.'.'.'.T.8.M.T.'.Q.T.M.M.M.M.M.M.M.M.9.3.2 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. a M.Y.Q.'.'.Q.Y.M.8.Y.'.'.T.9.9.M.M.M.M.M.M.M.M.3.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. a M.Q.(.'.(.Y.M.M.Y.Q.'.T.M.M.M.M.9.M.M.M.9.M.M.3.6 ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X. t l.T.T.H.M.3.3.l.Y.T.M.6.3.6.6.3.6.2.3.3.6.6.6.#.; ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X# 2 6 6 2 ; ; ; 6 6 2 ; ; ; ; ; ; ; ; 2 ; ; ; ; % . ,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X",
",X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X"
};
static const char *bin_icon[] = {
/* columns rows colors chars-per-pixel */
"48 48 13 1 ",
" c #5C6BBF",
". c #5B6BC0",
"X c #5C6AC0",
"o c #5C6BC0",
"O c #7986CB",
"+ c #9EA7D9",
"@ c #9FA7D9",
"# c #9FA7DA",
"$ c #9EA8D9",
"% c #9FA8D9",
"& c #9EA8DA",
"* c #9FA8DA",
"= c None",
/* pixels */
"================================================",
"================================================",
"================================================",
"================================================",
"================================================",
"================================================",
"==================.oooooooo.====================",
"=================ooooooooooo ===================",
"=================oo========oo===================",
"=================oo========oo===================",
"===========oooooooooooooooooooooooo=============",
"===========oooooooooooooooooooooooo=============",
"===========oooooooooooooooooooooooo=============",
"=========oooooooooooooooooooooooooooo===========",
"=========oooooooooooooooooooooooooooo===========",
"=========oooooooooooooooooooooooooooo===========",
"=========oooooooooooooooooooooooooooo===========",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========*****OO****OO****OO*****=============",
"===========#***********************=============",
"===========***********************#=============",
"============*********************#==============",
"=============******************#*===============",
"================================================",
"================================================",
"================================================",
"================================================",
"================================================",
"================================================"
};
static const char *img_file_icon[] = {
/* columns rows colors chars-per-pixel */
"48 48 135 2 ",
" c #272931",
". c #2D2F35",
"X c #2F3036",
"o c #323339",
"O c #3A3B3E",
"+ c #3A3B40",
"@ c #1A686C",
"# c #147174",
"$ c #2F6B6E",
"% c #2A777A",
"& c #3E7A7E",
"* c #47474B",
"= c #47484C",
"- c #4B4B4D",
"; c #575758",
": c #5B5C5C",
"> c #515153",
", c #4C7A7C",
"< c #517779",
"1 c #636462",
"2 c #6F6F6D",
"3 c #B9AE5D",
"4 c #8A8663",
"5 c #918D67",
"6 c #99946C",
"7 c #99977B",
"8 c #A19C71",
"9 c #ACA766",
"0 c #ACA86B",
"q c #B2AB62",
"w c #A6A375",
"e c #ADA878",
"r c #B4AF7D",
"t c #C3B85B",
"y c #D8C857",
"u c #E8D758",
"i c #EDDB59",
"p c #F4E25B",
"a c #F9E65C",
"s c #617F85",
"d c #0D8889",
"f c #0F8183",
"g c #079697",
"h c #0E9293",
"j c #069D9E",
"k c #169495",
"l c #1B9293",
"z c #119899",
"x c #2D8587",
"c c #278889",
"v c #2D898B",
"b c #328586",
"n c #378689",
"m c #298E90",
"M c #00A7A7",
"N c #428688",
"B c #51888C",
"V c #5D8383",
"C c #5E8D92",
"Z c #718A88",
"A c #758183",
"S c #6F9399",
"D c #77989E",
"F c #759DA2",
"G c #78A0A5",
"H c #7FA6AB",
"J c #8B8B81",
"K c #919A82",
"L c #969F9A",
"P c #9B9A94",
"I c #96A086",
"U c #95A28C",
"Y c #8EA398",
"T c #92A69A",
"R c #B6B38D",
"E c #BAB68D",
"W c #A4A49D",
"Q c #B6B49E",
"! c #8FA2A4",
"~ c #83AAAF",
"^ c #90A3A6",
"/ c #92AFAD",
"( c #90AAA3",
") c #89AFB5",
"_ c #8EB5BA",
"` c #94B6B9",
"' c #ABABA5",
"] c #AEAEA8",
"[ c #AAB1AD",
"{ c #B3B2A4",
"} c #B3B3AB",
"| c #B5B7B0",
" . c #BDBCB4",
".. c #C4BF8D",
"X. c #C0BFB7",
"o. c #E4DD9B",
"O. c #EBE39F",
"+. c #C0C0B7",
"@. c #C5C5BC",
"#. c #C7C8BF",
"$. c #CAC9BE",
"%. c #EEE7A1",
"&. c #F3EBA3",
"*. c #FEF6AA",
"=. c #96BDC2",
"-. c #99BEC2",
";. c #9AC0C6",
":. c #9CC3C8",
">. c #9EC8CD",
",. c #A1C9CC",
"<. c #A3CDD2",
"1. c #A7D1D6",
"2. c #A8D3D8",
"3. c #ACD8DD",
"4. c #AFDCE1",
"5. c #B1DEE3",
"6. c #B3E1E6",
"7. c #C7C9C0",
"8. c #CBCBC1",
"9. c #D0CFC5",
"0. c #D1D1C7",
"q. c #D4D4CA",
"w. c #DBDACF",
"e. c #DEDED2",
"r. c #E0DFD4",
"t. c #E2E1D6",
"y. c #E4E4D8",
"u. c #EAE9DD",
"i. c #EFEFE2",
"p. c #F0EFE3",
"a. c #F2F1E4",
"s. c #F7F6E9",
"d. c #F8F7E9",
"f. c #FDFCEE",
"g. c None",
/* pixels */
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.o ; 1 1 1 1 1 1 1 1 1 1 1 1 1 1 : O g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.2 8.y.i.u.i.u.i.u.u.i.i.i.u.u.i.u.w.7 4 g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.: r.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.u.R %.5 g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.] f.f.a.$.| a.f.f.f.f.f.f.f.f.f.f.f.u.R *.%.6 g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.X @.f.a.| w.s.f.f.f.f.f.f.f.f.f.f.f.f.i.R *.*.&.6 g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.f.7.e.f.f.f.f.f.f.f.f.f.f.f.f.f.f.p.R *.*.*.&.8 g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.} d.f.f.f.f.f.f.f.f.f.f.f.f.f.f.a.R *.*.*.*.&.w g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.] f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.d.{ &.*.*.*.*.&.e g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.e...*.*.*.*.*.&.r g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.8.E o.&.&.&.&.O.w g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.u.$.} { { { } J X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f. .X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f. .o g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.f.s.7.[ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ y.f.f.f.f.@.. g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.f.| =.3.2.<.` -.2.3.2.2.2.2.2.2.2.2.<.! i.f.f.f. .X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.a.^ 6.6.1.I 3 q T 3.6.6.6.6.6.6.6.6.6.-.8.f.f.f.7.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.a.^ 6.5.U u a p y / 6.6.6.6.6.6.6.6.6.:.7.f.f.d.@.. g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' f.a.^ 6.1.w a a a p K 5.6.6.6.6.6.6.6.6.:.7.d.7.f. .X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.a.^ 6.3.w p a a i Y 5.6.6.6.6.6.6.6.6.:.7.d.} d.@.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.a.^ 6.5.) t i i 9 :.6.6.6.6.2.;.6.6.6.:.8.d.q.f.X.. g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.] f.a.^ 6.6.5.-.( ( ,.6.6.6.6.5.F & >.6.6.:.7.d.] f.X.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.a.^ 6.6.6.5.5.6.6.6.6.6.6.=.c j C 3.6.:.7.d.' d. .X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.a.^ 6.6.6.4.5.6.6.6.6.6.2.B M M k ~ 5.:.7.d.| d.@.. g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.a.^ 6.6.3.S _ 5.6.6.6.5.G z M M M n :.:.7.d.q.f.X.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.a.^ 5.4.F k N <.6.6.6.-.v M M M M M C ` 7.s.] d. .X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' f.a.^ 4.~ l M j C 3.6.2.B M M M M M M k s 7.s.] d.@.. g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.a.! ) v M M M k H 5.G z M M M M M M M % +.s.' d.@.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' d.a.s v M M M M M v F v M M M M M M M M h .s.' d. .X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' f.u.< M M M M M M g @ M M M M M M M M M z .s.' d.X.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.i., M M M M M M # g M M M M M M M M M z .s.' d.@.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' f.u., M M M M M d # M M M M M M M M M M h .s.' d.+.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.s.' f.a.Z M M M M j # M M M M M M M M M M M c 7.s.' f. .. g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.d.' d.f.8.V n b x $ $ x v x x x x x x x x N L s.s.] d.@.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.o @.f. .i.f.f.a.q.q.q.0.q.0.q.0.0.q.0.0.0.q.0.e.d.f.u. .f.X.X g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.X @.f.y.} p.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.f.a.} u.f. . g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.W f.f.y.} . . . . . . . . . . . . . . . . . . .} y.f.d.P g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.> q.f.f.d.i.u.y.u.u.u.u.u.u.u.y.u.u.y.u.u.u.u.a.d.f.f.9.- g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.: | r.y.y.y.y.y.y.t.y.y.y.y.y.y.y.y.y.y.y.y.y.y.e.} ; g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g. O = = = = = = = = = = = = = = = = = * * = * O g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.",
"g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g.g."
};
static const char *folder_icon[] = {
/* columns rows colors chars-per-pixel */
"40 40 67 1 ",
" c #4788C7",
". c #4B8DC8",
"X c #508FCB",
"o c #508FCC",
"O c #5391CC",
"+ c #5593CD",
"@ c #5692CD",
"# c #5693CD",
"$ c #5793CD",
"% c #5795D0",
"& c #5E98D0",
"* c #629AD2",
"= c #669ED3",
"- c #609BD4",
"; c #629CD4",
": c #649ED5",
"> c #679FD6",
", c #67A0D7",
"< c #68A1D6",
"1 c #6DA2D5",
"2 c #67A2DB",
"3 c #6BA3D8",
"4 c #6BA6DE",
"5 c #70A5D6",
"6 c #73A6D8",
"7 c #70A6DB",
"8 c #74AADD",
"9 c #79AADA",
"0 c #7AAEE0",
"q c #7FB2E3",
"w c #80AFDC",
"e c #87B4DF",
"r c #8CB8E1",
"t c #90BAE2",
"y c #90BBE2",
"u c #91BCE2",
"i c #93BCE2",
"p c #91C0EB",
"a c #90C6F7",
"s c #9CC8F1",
"d c #9DC9F1",
"f c #91C6F8",
"g c #97CCFD",
"h c #98CCFD",
"j c #B2D1EE",
"k c #B3D1EE",
"l c #B5D3EE",
"z c #A4CFF5",
"x c #ADD5F9",
"c c #BED9F2",
"v c #B2D8FC",
"b c #B4DAFD",
"n c #B4DBFD",
"m c #B5DBFD",
"M c #B5DCFE",
"N c #B6DCFE",
"B c #CFE5F8",
"V c #D3E7F9",
"C c #D6EAFB",
"Z c #D8ECFC",
"A c #DAECFC",
"S c #DAEDFC",
"D c #DCEDFD",
"F c #DDEFFD",
"G c #DEF0FE",
"H c #DFF0FE",
"J c None",
/* pixels */
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"J .JJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"J NNNNNNNNNx+.JJJJJJJJJJJJJJJJJJJJJJJJJJ",
"J NNNNNNNNNNx+.JJJJJJJJJJJJJJJJJJJJJJJJJ",
"J NNNNNNNNNNNzX J",
"J NNNNNNNNNNpOrAHHHHHHHHHHHHHHHHHHHHHH J",
"J &cHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHk++kHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHH+dd+HHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHH+ds$HHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHk++lHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHB5VHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHFV&2&VHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHC*wNq*CHHHHHuuHHHHHHHHHHHH J",
"J HHHHHHHHHA;qNNb0=AHHHu%%uHHHHHHHHHHH J",
"J HHHHHHHHA18NNNbN81AHu%ff%uHHHHHHHHHH J",
"J HHHHHHHF67bNNNNNN46r%fhhf%uHHHHHHHHH J",
"J HHHHHHF91bNNNNNNNb<ofhhhhf%uHHHHHHHH J",
"J HHHHHHw>bNNNNNNNNNb=2hhhhhf%uHHHHHHH J",
"J HHHHHe;vNNNNNNNNNNNb-4hhhhhf%uHHHHHH J",
"J HHHHr iHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH J",
"J J",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ",
"JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ"
};
| 37.65828 | 131 | 0.464231 | aiordache |
c1c838ce5dc9a9cc9eed601adf83ea8b204b8fb8 | 567 | hpp | C++ | include/gridtools/meta/list.hpp | jdahm/gridtools | 5961932cd2ccf336d3d73b4bc967243828e55cc5 | [
"BSD-3-Clause"
] | null | null | null | include/gridtools/meta/list.hpp | jdahm/gridtools | 5961932cd2ccf336d3d73b4bc967243828e55cc5 | [
"BSD-3-Clause"
] | null | null | null | include/gridtools/meta/list.hpp | jdahm/gridtools | 5961932cd2ccf336d3d73b4bc967243828e55cc5 | [
"BSD-3-Clause"
] | 1 | 2019-06-14T10:35:50.000Z | 2019-06-14T10:35:50.000Z | /*
* GridTools
*
* Copyright (c) 2014-2019, ETH Zurich
* All rights reserved.
*
* Please, refer to the LICENSE file in the root directory.
* SPDX-License-Identifier: BSD-3-Clause
*/
#pragma once
namespace gridtools {
namespace meta {
/**
* The default list constructor.
*
* Used within the library when it needed to produce something, that satisfy list concept.
*/
template <class...>
struct list {
using type = list;
};
} // namespace meta
} // namespace gridtools
| 22.68 | 100 | 0.589065 | jdahm |
c1c9fb2737ce6d2a853508d4b67ae0004153a4ee | 256 | cpp | C++ | Helping Chef.cpp | kamesh666/codechef-beginnner-problem | 2a85d779cdb1d67a9e663092a6e52a0a5b798edd | [
"MIT"
] | null | null | null | Helping Chef.cpp | kamesh666/codechef-beginnner-problem | 2a85d779cdb1d67a9e663092a6e52a0a5b798edd | [
"MIT"
] | null | null | null | Helping Chef.cpp | kamesh666/codechef-beginnner-problem | 2a85d779cdb1d67a9e663092a6e52a0a5b798edd | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
if (n<10) {
cout <<"Thanks for helping Chef!"<< endl;
}
else {
cout << "-1" << endl;
}
}
return 0;
}
| 13.473684 | 50 | 0.445313 | kamesh666 |
c1d4995d11a51308c14e71406a71e8ded6e907a6 | 451 | cpp | C++ | Sources/ResourceSystem/ResourceSerializer/SyrinxMeshFileHeader.cpp | LeptusHe/SyrinxEngine | 5ecdfdd53eb421bdfba61ed183a1ac688d117b97 | [
"MIT"
] | 3 | 2020-04-24T07:58:52.000Z | 2021-11-17T11:08:46.000Z | Sources/ResourceSystem/ResourceSerializer/SyrinxMeshFileHeader.cpp | LeptusHe/SyrinxEngine | 5ecdfdd53eb421bdfba61ed183a1ac688d117b97 | [
"MIT"
] | null | null | null | Sources/ResourceSystem/ResourceSerializer/SyrinxMeshFileHeader.cpp | LeptusHe/SyrinxEngine | 5ecdfdd53eb421bdfba61ed183a1ac688d117b97 | [
"MIT"
] | 2 | 2019-10-02T01:49:46.000Z | 2021-11-16T15:25:59.000Z | #include "ResourceSerializer/SyrinxMeshFileHeader.h"
namespace Syrinx {
constexpr uint8_t version = 0x1;
const MeshFileHeader MESH_FILE_HEADER = MeshFileHeader("[SYRINXMESH]", version, "[SyrinxMesh_Version1.0]");
MeshFileHeader::MeshFileHeader(const std::string& signature, uint8_t version, const std::string& versionInfo)
: signature(signature)
, version(version)
, versionInfo(versionInfo)
{
}
} // namespace Syrinx | 26.529412 | 110 | 0.736142 | LeptusHe |
c1d800410da9bc4cf3c9bd0233dd6875c13303e1 | 12,102 | inl | C++ | LibFoundation/Mathematics/Wm4Math.inl | wjezxujian/WildMagic4 | 249a17f8c447cf57c6283408e01009039810206a | [
"BSL-1.0"
] | 3 | 2021-08-02T04:03:03.000Z | 2022-01-04T07:31:20.000Z | LibFoundation/Mathematics/Wm4Math.inl | wjezxujian/WildMagic4 | 249a17f8c447cf57c6283408e01009039810206a | [
"BSL-1.0"
] | null | null | null | LibFoundation/Mathematics/Wm4Math.inl | wjezxujian/WildMagic4 | 249a17f8c447cf57c6283408e01009039810206a | [
"BSL-1.0"
] | 5 | 2019-10-13T02:44:19.000Z | 2021-08-02T04:03:10.000Z | // Geometric Tools, Inc.
// http://www.geometrictools.com
// Copyright (c) 1998-2006. All Rights Reserved
//
// The Wild Magic Version 4 Foundation Library source code is supplied
// under the terms of the license agreement
// http://www.geometrictools.com/License/Wm4FoundationLicense.pdf
// and may not be copied or disclosed except in accordance with the terms
// of that agreement.
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::ACos (Real fValue)
{
if (-(Real)1.0 < fValue)
{
if (fValue < (Real)1.0)
{
return (Real)acos((double)fValue);
}
else
{
return (Real)0.0;
}
}
else
{
return PI;
}
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::ASin (Real fValue)
{
if (-(Real)1.0 < fValue)
{
if (fValue < (Real)1.0)
{
return (Real)asin((double)fValue);
}
else
{
return HALF_PI;
}
}
else
{
return -HALF_PI;
}
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::ATan (Real fValue)
{
return (Real)atan((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::ATan2 (Real fY, Real fX)
{
return (Real)atan2((double)fY,(double)fX);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Ceil (Real fValue)
{
return (Real)ceil((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Cos (Real fValue)
{
return (Real)cos((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Exp (Real fValue)
{
return (Real)exp((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FAbs (Real fValue)
{
return (Real)fabs((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Floor (Real fValue)
{
return (Real)floor((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FMod (Real fX, Real fY)
{
return (Real)fmod((double)fX,(double)fY);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::InvSqrt (Real fValue)
{
return (Real)(1.0/sqrt((double)fValue));
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Log (Real fValue)
{
return (Real)log((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Log2 (Real fValue)
{
return Math<Real>::INV_LN_2 * (Real)log((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Log10 (Real fValue)
{
return Math<Real>::INV_LN_10 * (Real)log((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Pow (Real fBase, Real fExponent)
{
return (Real)pow((double)fBase,(double)fExponent);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Sin (Real fValue)
{
return (Real)sin((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Sqr (Real fValue)
{
return fValue*fValue;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Sqrt (Real fValue)
{
return (Real)sqrt((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Tan (Real fValue)
{
return (Real)tan((double)fValue);
}
//----------------------------------------------------------------------------
template <class Real>
int Math<Real>::Sign (int iValue)
{
if (iValue > 0)
{
return 1;
}
if (iValue < 0)
{
return -1;
}
return 0;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::Sign (Real fValue)
{
if (fValue > (Real)0.0)
{
return (Real)1.0;
}
if (fValue < (Real)0.0)
{
return -(Real)1.0;
}
return (Real)0.0;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::UnitRandom (unsigned int uiSeed )
{
if (uiSeed > 0)
{
srand(uiSeed);
}
double dRatio = ((double)rand())/((double)(RAND_MAX));
return (Real)dRatio;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::SymmetricRandom (unsigned int uiSeed)
{
if (uiSeed > 0.0)
{
srand(uiSeed);
}
double dRatio = ((double)rand())/((double)(RAND_MAX));
return (Real)(2.0*dRatio - 1.0);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::IntervalRandom (Real fMin, Real fMax, unsigned int uiSeed)
{
if (uiSeed > 0)
{
srand(uiSeed);
}
double dRatio = ((double)rand())/((double)(RAND_MAX));
return fMin+(fMax-fMin)*((Real)dRatio);
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastSin0 (Real fAngle)
{
Real fASqr = fAngle*fAngle;
Real fResult = (Real)7.61e-03;
fResult *= fASqr;
fResult -= (Real)1.6605e-01;
fResult *= fASqr;
fResult += (Real)1.0;
fResult *= fAngle;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastSin1 (Real fAngle)
{
Real fASqr = fAngle*fAngle;
Real fResult = -(Real)2.39e-08;
fResult *= fASqr;
fResult += (Real)2.7526e-06;
fResult *= fASqr;
fResult -= (Real)1.98409e-04;
fResult *= fASqr;
fResult += (Real)8.3333315e-03;
fResult *= fASqr;
fResult -= (Real)1.666666664e-01;
fResult *= fASqr;
fResult += (Real)1.0;
fResult *= fAngle;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastCos0 (Real fAngle)
{
Real fASqr = fAngle*fAngle;
Real fResult = (Real)3.705e-02;
fResult *= fASqr;
fResult -= (Real)4.967e-01;
fResult *= fASqr;
fResult += (Real)1.0;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastCos1 (Real fAngle)
{
Real fASqr = fAngle*fAngle;
Real fResult = -(Real)2.605e-07;
fResult *= fASqr;
fResult += (Real)2.47609e-05;
fResult *= fASqr;
fResult -= (Real)1.3888397e-03;
fResult *= fASqr;
fResult += (Real)4.16666418e-02;
fResult *= fASqr;
fResult -= (Real)4.999999963e-01;
fResult *= fASqr;
fResult += (Real)1.0;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastTan0 (Real fAngle)
{
Real fASqr = fAngle*fAngle;
Real fResult = (Real)2.033e-01;
fResult *= fASqr;
fResult += (Real)3.1755e-01;
fResult *= fASqr;
fResult += (Real)1.0;
fResult *= fAngle;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastTan1 (Real fAngle)
{
Real fASqr = fAngle*fAngle;
Real fResult = (Real)9.5168091e-03;
fResult *= fASqr;
fResult += (Real)2.900525e-03;
fResult *= fASqr;
fResult += (Real)2.45650893e-02;
fResult *= fASqr;
fResult += (Real)5.33740603e-02;
fResult *= fASqr;
fResult += (Real)1.333923995e-01;
fResult *= fASqr;
fResult += (Real)3.333314036e-01;
fResult *= fASqr;
fResult += (Real)1.0;
fResult *= fAngle;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastInvSin0 (Real fValue)
{
Real fRoot = Math<Real>::Sqrt(((Real)1.0)-fValue);
Real fResult = -(Real)0.0187293;
fResult *= fValue;
fResult += (Real)0.0742610;
fResult *= fValue;
fResult -= (Real)0.2121144;
fResult *= fValue;
fResult += (Real)1.5707288;
fResult = HALF_PI - fRoot*fResult;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastInvSin1 (Real fValue)
{
Real fRoot = Math<Real>::Sqrt(FAbs(((Real)1.0)-fValue));
Real fResult = -(Real)0.0012624911;
fResult *= fValue;
fResult += (Real)0.0066700901;
fResult *= fValue;
fResult -= (Real)0.0170881256;
fResult *= fValue;
fResult += (Real)0.0308918810;
fResult *= fValue;
fResult -= (Real)0.0501743046;
fResult *= fValue;
fResult += (Real)0.0889789874;
fResult *= fValue;
fResult -= (Real)0.2145988016;
fResult *= fValue;
fResult += (Real)1.5707963050;
fResult = HALF_PI - fRoot*fResult;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastInvCos0 (Real fValue)
{
Real fRoot = Math<Real>::Sqrt(((Real)1.0)-fValue);
Real fResult = -(Real)0.0187293;
fResult *= fValue;
fResult += (Real)0.0742610;
fResult *= fValue;
fResult -= (Real)0.2121144;
fResult *= fValue;
fResult += (Real)1.5707288;
fResult *= fRoot;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastInvCos1 (Real fValue)
{
Real fRoot = Math<Real>::Sqrt(FAbs(((Real)1.0)-fValue));
Real fResult = -(Real)0.0012624911;
fResult *= fValue;
fResult += (Real)0.0066700901;
fResult *= fValue;
fResult -= (Real)0.0170881256;
fResult *= fValue;
fResult += (Real)0.0308918810;
fResult *= fValue;
fResult -= (Real)0.0501743046;
fResult *= fValue;
fResult += (Real)0.0889789874;
fResult *= fValue;
fResult -= (Real)0.2145988016;
fResult *= fValue;
fResult += (Real)1.5707963050;
fResult *= fRoot;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastInvTan0 (Real fValue)
{
Real fVSqr = fValue*fValue;
Real fResult = (Real)0.0208351;
fResult *= fVSqr;
fResult -= (Real)0.085133;
fResult *= fVSqr;
fResult += (Real)0.180141;
fResult *= fVSqr;
fResult -= (Real)0.3302995;
fResult *= fVSqr;
fResult += (Real)0.999866;
fResult *= fValue;
return fResult;
}
//----------------------------------------------------------------------------
template <class Real>
Real Math<Real>::FastInvTan1 (Real fValue)
{
Real fVSqr = fValue*fValue;
Real fResult = (Real)0.0028662257;
fResult *= fVSqr;
fResult -= (Real)0.0161657367;
fResult *= fVSqr;
fResult += (Real)0.0429096138;
fResult *= fVSqr;
fResult -= (Real)0.0752896400;
fResult *= fVSqr;
fResult += (Real)0.1065626393;
fResult *= fVSqr;
fResult -= (Real)0.1420889944;
fResult *= fVSqr;
fResult += (Real)0.1999355085;
fResult *= fVSqr;
fResult -= (Real)0.3333314528;
fResult *= fVSqr;
fResult += (Real)1.0;
fResult *= fValue;
return fResult;
}
//----------------------------------------------------------------------------
| 27.756881 | 78 | 0.465047 | wjezxujian |
c1db9ecc3a45b7a93de51e30bddadb93ed5e584b | 1,012 | cc | C++ | src/main.cc | AkihiroTakai/yuri-image | d6565cf9045f717c5420daf1dc204797ea8c3a11 | [
"MIT"
] | null | null | null | src/main.cc | AkihiroTakai/yuri-image | d6565cf9045f717c5420daf1dc204797ea8c3a11 | [
"MIT"
] | null | null | null | src/main.cc | AkihiroTakai/yuri-image | d6565cf9045f717c5420daf1dc204797ea8c3a11 | [
"MIT"
] | null | null | null | #include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <string>
#include <iostream>
#include <fstream>
/*
*ゆりOSのソースコード(include/kernel.h)より引用
*/
#define __RGB256COL__(r, g, b) (16+(r/51)+(6*(g/51))+(36*(b/51)))
int main(int argc, char **argv){
std::ofstream yim;
cv::Mat src_img = cv::imread(argv[1]);
char color_number;
yim.open(argv[2], std::ios::out | std::ios::binary | std::ios::trunc);
if(!yim){
std::cout << "ERROR";
exit(0);
}
/*
*シグネチャ
*/
yim.write("yim", 3);
/*
*画像の基本情報を記述
*/
//画像の幅
yim.write((char *)(&src_img.cols), 4);
//画像の高さ
yim.write((char *)(&src_img.rows), 4);
/*
*画素をビットマップ的に書き込む
*/
for(int y = 0;y < src_img.rows;y++){
for(int x = 0;x < src_img.cols;x++){
color_number = __RGB256COL__(
src_img.at<cv::Vec3b>(y, x)[2], //RED
src_img.at<cv::Vec3b>(y, x)[1], //GREEN
src_img.at<cv::Vec3b>(y, x)[0] //BLUE
);
yim.write((char *)&color_number, sizeof(char));
}
}
yim.close();
return 0;
}
| 18.4 | 71 | 0.583004 | AkihiroTakai |
c1dcd3adc0100d065b4203ebab1dda844e1b7b4b | 1,646 | cpp | C++ | D07/ex02/main.cpp | amoinier/piscine-cpp | 43d4806d993eb712f49a32e54646d8c058a569ea | [
"MIT"
] | null | null | null | D07/ex02/main.cpp | amoinier/piscine-cpp | 43d4806d993eb712f49a32e54646d8c058a569ea | [
"MIT"
] | null | null | null | D07/ex02/main.cpp | amoinier/piscine-cpp | 43d4806d993eb712f49a32e54646d8c058a569ea | [
"MIT"
] | null | null | null | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.cpp :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: amoinier <amoinier@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2017/10/11 15:00:15 by amoinier #+# #+# */
/* Updated: 2017/10/11 17:16:14 by amoinier ### ########.fr */
/* */
/* ************************************************************************** */
#include <iostream>
#include "Array.template.hpp"
int main(void)
{
Array<int> test(5);
Array<std::string> str(5);
Array<std::string> empty;
Array<std::string> copy(empty);
std::cout << "-------------" << std::endl;
try {
test[2] = 2;
std::cout << test[2] << " INT 2" << std::endl;
}
catch(std::exception & e) {
std::cout << "Size too small" << std::endl;
}
try {
test[6] = 6;
std::cout << test[6] << " INT 2" << std::endl;
}
catch(std::exception & e) {
std::cout << "Size too small" << std::endl;
}
try {
str[1] = "hello";
std::cout << str[1] << " INT 2" << std::endl;
}
catch(std::exception & e) {
std::cout << "Size too small" << std::endl;
}
std::cout << "-------------" << std::endl;
return 0;
}
| 31.056604 | 80 | 0.295869 | amoinier |
c1deb41070a3a0c63d8425884071cd28e71a4cf8 | 3,884 | cpp | C++ | WOAP Host/Source/woap_access_control_core.cpp | ZonRobin/WOAP | f1bfb8dbe84e57826834ad3ca81f548b20b1afc6 | [
"MIT"
] | null | null | null | WOAP Host/Source/woap_access_control_core.cpp | ZonRobin/WOAP | f1bfb8dbe84e57826834ad3ca81f548b20b1afc6 | [
"MIT"
] | null | null | null | WOAP Host/Source/woap_access_control_core.cpp | ZonRobin/WOAP | f1bfb8dbe84e57826834ad3ca81f548b20b1afc6 | [
"MIT"
] | null | null | null | #include "woap_access_control_core.h"
#include "woap_user.h"
#include "woap_user_group.h"
#include "woap_user_permission.h"
#include "woap_user_login.h"
#include "woap_password_helper.h"
#include "woap_bootstrapper.h"
#include "woap_configuration_manager.h"
using namespace WOAP;
SINGLETON_IMPLEMENTATION(AccessControlCore)
AccessControlCore::AccessControlCore()
{
for (UserPermission* permission : Bootstrapper::getInstance()->getReportedPermissions())
{
permissions.add(new UserPermission(*permission));
}
jassert(!permissions.isEmpty()); /* If empty, a new instance of this core was maybe created? */
adminGroup = new UserGroup();
groups.add(adminGroup);
for (UserPermission* permission : permissions)
{
adminGroup->addPermission(permission);
}
adminUser = new User();
adminUser->setUsername("admin");
adminUser->setPlainPassword(ConfigurationManager::getInstance()->getAdminPassword());
adminUser->addToGroup(adminGroup);
users.add(adminUser);
if (ConfigurationManager::getInstance()->isAnonymousLoginEnabled())
{
anonymousUser = new User();
anonymousUser->setUsername("anonymous");
anonymousUser->setPlainPassword("");
anonymousUser->setIsAnonymous(true);
anonymousUser->addToGroup(adminGroup);
users.add(anonymousUser);
}
else
{
anonymousUser = nullptr;
}
ConfigurationManager::getInstance()->addListener(this);
}
AccessControlCore::~AccessControlCore()
{
ConfigurationManager::getInstance()->removeListener(this);
}
User* AccessControlCore::findUserWithPassword(const String& plainPassword) const
{
for (User* user : users)
{
if (user->isAnonymous())
continue;
if (PasswordHelper::hashPassword(plainPassword, user->getSalt()) == user->getPassword())
return user;
}
return nullptr;
}
UserLogin* AccessControlCore::findLoginByLogTag(const String& logTag) const
{
for (User* user : users)
{
const ScopedLock sl2(user->getLogins().getLock());
for (UserLogin* login : user->getLogins())
{
if (login->getLogTag() == logTag && login->isActive())
{
return login;
}
}
}
return nullptr;
}
ValueTree AccessControlCore::getState() const
{
ValueTree state("ACCESSCONTROLCORE");
ValueTree adminState("ADMIN");
for (UserLogin* login : adminUser->getLogins())
{
if (login->isActive())
adminState.addChild(login->getState(), -1, nullptr);
}
state.addChild(adminState, -1, nullptr);
if (anonymousUser != nullptr && ConfigurationManager::getInstance()->isAnonymousLoginEnabled())
{
ValueTree anonymousState("ANONYMOUS");
for (UserLogin* login : anonymousUser->getLogins())
{
if (login->isActive())
anonymousState.addChild(login->getState(), -1, nullptr);
}
state.addChild(anonymousState, -1, nullptr);
}
return state;
}
void AccessControlCore::setState(const ValueTree& state)
{
if (!state.hasType("ACCESSCONTROLCORE"))
return;
for (ValueTree adminLoginState : state.getChildWithName("ADMIN"))
{
UserLogin* login = UserLogin::fromState(adminUser, adminLoginState);
if (login != nullptr)
adminUser->addLogin(login);
}
if (anonymousUser != nullptr && ConfigurationManager::getInstance()->isAnonymousLoginEnabled())
{
for (ValueTree anonymousLoginState : state.getChildWithName("ANONYMOUS"))
{
UserLogin* login = UserLogin::fromState(anonymousUser, anonymousLoginState);
if (login != nullptr)
anonymousUser->addLogin(login);
}
}
}
void AccessControlCore::configurationChanged(const ConfigurationManager::Configuration& oldConfig, const ConfigurationManager::Configuration& newConfig)
{
if (oldConfig.adminPassword != newConfig.adminPassword)
{
adminUser->setPlainPassword(newConfig.adminPassword.toString());
for (UserLogin* login : adminUser->getLogins())
{
login->invalidate();
}
if (anonymousUser != nullptr)
{
for (UserLogin* login : anonymousUser->getLogins())
{
login->invalidate();
}
}
}
}
| 24.582278 | 152 | 0.730947 | ZonRobin |
c1e08a881be2ab569c33012c9a18d3bb8a2db2ec | 494 | cpp | C++ | src/main/main.cpp | ammrat13/atmega328p-cross | a19d6d51a934ff28bb2aff25b28db2876b6bab4e | [
"MIT"
] | null | null | null | src/main/main.cpp | ammrat13/atmega328p-cross | a19d6d51a934ff28bb2aff25b28db2876b6bab4e | [
"MIT"
] | null | null | null | src/main/main.cpp | ammrat13/atmega328p-cross | a19d6d51a934ff28bb2aff25b28db2876b6bab4e | [
"MIT"
] | null | null | null | #include <serial.hpp>
USART::Configuration USART0_CONFIGURATION {
.baudrate_register = 16,
.use_2X = true,
.rx_en = true,
.tx_en = true,
.stop_bits = USART::Configuration::StopBits::ONE,
.parity = USART::Configuration::Parity::NONE,
};
int main(void) {
size_t num_read;
char buf[256];
USART::PORT[0].setConfiguration(USART0_CONFIGURATION);
while(1) {
USART::PORT[0].gets(buf, 256, num_read, '\n');
USART::PORT[0].puts(buf);
}
}
| 19.76 | 58 | 0.619433 | ammrat13 |
c1e1a5fc5ac3316d305b97287cf5570f3226feee | 1,696 | hpp | C++ | example/testServer.hpp | vkardon/grpc_async_server | cd2d87114a5b539e212cb391998e892e6174f772 | [
"MIT"
] | 8 | 2018-09-20T09:29:30.000Z | 2021-08-12T22:46:30.000Z | example/testServer.hpp | vkardon/grpc_async_server | cd2d87114a5b539e212cb391998e892e6174f772 | [
"MIT"
] | null | null | null | example/testServer.hpp | vkardon/grpc_async_server | cd2d87114a5b539e212cb391998e892e6174f772 | [
"MIT"
] | null | null | null | #ifndef __TEST_SERVER_HPP__
#define __TEST_SERVER_HPP__
#include "logger.hpp"
#include "grpcServer.hpp"
#include "testService.hpp"
#include "healthService.hpp"
#include <atomic>
class TestServer : public gen::GrpcServer
{
public:
TestServer() : testService(this) {}
virtual ~TestServer() = default;
// gen::GrpcServer overrides
virtual bool OnInit(::grpc::ServerBuilder& builder) override;
virtual bool OnRun() override;
virtual void OnError(const std::string& err) const override;
virtual void OnInfo(const std::string& info) const override;
bool Shutdown(const gen::RpcContext& ctx, std::string& errMsg);
private:
std::atomic<bool> mStop{false};
TestService testService;
HealthService healthService;
};
//
// Helper class to set thread-specific logger prefix
//
struct LoggerPrefix
{
static constexpr const char* METADATA_SESSION_ID = "sessionid";
static constexpr const char* METADATA_REQUEST_ID = "requestid";
LoggerPrefix(const gen::RpcContext& ctx)
{
// Set thread-specific logging prefix "[session id][request id]"
std::string sessionId;
std::string requestId;
ctx.GetMetadata(METADATA_SESSION_ID, sessionId);
ctx.GetMetadata(METADATA_REQUEST_ID, requestId);
char prefix[256] {};
char* ptr = prefix;
if(!sessionId.empty())
ptr += sprintf(ptr, "[sid=%s]", sessionId.c_str());
if(!requestId.empty())
ptr += sprintf(ptr, "[rid=%s]", requestId.c_str());
*ptr = '\0';
logger::SetThreadPrefix(prefix);
}
~LoggerPrefix()
{
logger::SetThreadPrefix("");
}
};
#endif // __TEST_SERVER_HPP__
| 25.69697 | 72 | 0.661557 | vkardon |
c1e1b8db8841110395a3c3ee411aae0cd514b18f | 12,809 | cpp | C++ | Connection.cpp | matt-attack/netlibrary | 98970ebb249cd960b826fe0e987909ef790e4b60 | [
"MIT"
] | 6 | 2018-01-06T17:38:42.000Z | 2019-11-14T01:37:31.000Z | Connection.cpp | matt-attack/netlibrary | 98970ebb249cd960b826fe0e987909ef790e4b60 | [
"MIT"
] | null | null | null | Connection.cpp | matt-attack/netlibrary | 98970ebb249cd960b826fe0e987909ef790e4b60 | [
"MIT"
] | null | null | null |
#ifdef _WIN32
#define _CRTDBG_MAP_ALLOC
#include <crtdbg.h>
#endif
#include "Connection.h"
#ifdef _DEBUG
#ifndef DBG_NEW
#define DBG_NEW new ( _NORMAL_BLOCK , __FILE__ , __LINE__ )
#define new DBG_NEW
#endif
#endif
#define _CRTDBG_MAP_ALLOC
void NetConnection::net_thread(void* data)
{
netlog("Network thread started!\n");
NetConnection* connection = (NetConnection*)data;
char buffer[2048];
while(connection->running)
{
connection->peerincomingmutex.lock();
//for each client, read in all packets
int size;
Address sender;
Peer* client;
while ((size = connection->connection.Receive(sender, buffer, sizeof(buffer))) > 0)
{
//ok, check for connect and disconnect
if (connection->peers.find(sender) != connection->peers.end())
{
client = connection->peers[sender];
if (client->state == PEER_CONNECTING)
{
//we got our connection response
netlog("Got Connection request response!\n");
//parse the packet, ensure it is correct
NetMsg msg(2048, buffer);
int seq = msg.ReadInt();//should be -1
int magic = msg.ReadInt();
if (magic == NET_MAGIC_ID && seq == -1)
{
unsigned char status = msg.ReadByte();
if (status == 1)
{
netlog("all good, got connection success response\n");
unsigned short port = msg.ReadShort();
//then mark as connected
client->state = PEER_CONNECTED;
}
else
{
netlog("Got Connection Denied response!\n");
char reason[500];
msg.ReadString(reason, 500);
//check and read error message if is valid at all
netlogf("Reason was: %s\n", reason);
client->state = PEER_DISCONNECTED;//tell the waitloop we were denied
}
}
else
{
netlog("it was a bad response!\n");//just ignore these
}
continue;//done with this packet
}
client->lastreceivetime = NetGetTime();
int rsequence = *(int*)&buffer[0];
if (rsequence == -1)
{//is OOB packet
//read in command packets
if (buffer[4] == (unsigned char)NetCommandPackets::Disconnect)//packetid of 99 is disconnect
{
if (client->state != PEER_DISCONNECTED)
{
client->state = PEER_DISCONNECTED;
TPacket p;
p.data = 0;
//memcpy(p.data, buffer+4, size-4);
p.size = 0;
p.sender = client;
p.addr = sender;
p.id = 2;
connection->incoming.push(p);
}
//netlogf("Client from %d.%d.%d.%d:%d Disconnected\n", sender.GetA(), sender.GetB(), sender.GetC(), sender.GetD(), sender.GetPort());
//disconnect
//connection->OnDisconnect(client);
//client->connection.Cleanup();
//delete client;
//connection->peers.erase(connection->peers.find(sender));//delete me
}
else if (buffer[4] == (unsigned char)NetCommandPackets::Ack)
{
//netlog("[NetCon] got keep alive/ack packet\n");
int ack = *(int*)&buffer[5];
int ackbits = *(int*)&buffer[9];
client->ProcessAck(ack, ackbits);
}
else if (buffer[4] == (unsigned char)NetCommandPackets::Ping)
{
char buffer2[100];
NetMsg msg(100, buffer2);
msg.WriteByte((unsigned char)NetCommandPackets::Pong);
//write acks
unsigned int time = *(unsigned int*)&buffer[5];
msg.WriteLong(time);
client->SendOOB(buffer2, msg.cursize);
}
else if (buffer[4] == (unsigned char)NetCommandPackets::Pong)
{
unsigned int time = *(unsigned int*)&buffer[5];
unsigned int rtt = NetGetTime() - time;
client->rtt = (client->rtt*2 + rtt*2)/4;
//printf("RTT is: %dms Avg: %dms\n", rtt, client->connection.rtt);
}
else if (buffer[4] == (unsigned char)NetCommandPackets::ConnectionRequest)//is another connection request packet, ignore it)
{
netlog("[NetCon] Got connection request packet while still connected\n");
}
else
{
netlog("[NetCon] Got Misc OOB Packet\n");
//other oob packet
TPacket p;
p.data = new char[size-4];
memcpy(p.data, &buffer[4], size-4);
p.size = size-4;
p.id = 0;
p.sender = client;
connection->incoming.push(p);
}
continue;
}
std::vector<Packet> returns;
client->ProcessPacket(buffer, size, returns);
//push all packets to the return queue
for (unsigned int i = 0; i < returns.size(); i++)
{
TPacket p;
auto pak = returns[i];
p.data = pak.data;
p.size = pak.size;
p.id = 0;
p.sender = client;
connection->incoming.push(p);
}
}
else
{
//new connection
/* just use username at first, then add passwords eventually */
ConnectionRequest* p = (ConnectionRequest*)(buffer+4);
if (p->packid != (unsigned char)NetCommandPackets::ConnectionRequest)
{
netlog("[NetCon] Got invalid connection request!\n");
continue;
}
char* msg = connection->CanConnect(sender, p);
if (msg == 0)//no error message
{
//its all good
netlogf( "Client Connected from %d.%d.%d.%d:%d, added to queue\n", sender.GetA(), sender.GetB(), sender.GetC(), sender.GetD(), sender.GetPort());
/*Peer* peer = new Peer;
peer->connection.remoteaddr = sender;
peer->connection.Init();
peer->connection.server = true;
peer->connection.connection = connection->connection;
//send reply
char t[500];
NetMsg msg(500,t);
msg.WriteInt(-1);
msg.WriteInt(51296165);//magic
msg.WriteShort(5007);//my port number, todo, changeme
peer->connection.SendOOB(&t[4], 5);
//move to a message queue like system
//connection->OnConnect(peer, p);
connection->peers[sender] = peer;*/
TPacket p;
p.data = new char[size-4];
memcpy(p.data, buffer+4, size-4);
p.size = size-4;
p.sender = 0;
p.addr = sender;
p.id = 1;
connection->incoming.push(p);
}
else
{
if (strcmp(msg, "Bad Protocol ID") == 0)
netlogf("Unknown unconnected packet from %i.%i.%i.%i:%i!\n",sender.GetA(), sender.GetB(), sender.GetC(), sender.GetD(), sender.GetPort());
else
{
netlogf("Client at %i.%i.%i.%i:%i could not join because '%s'\n", sender.GetA(), sender.GetB(), sender.GetC(), sender.GetD(), sender.GetPort(), msg);
//send reason to client
char buf[150];
NetMsg nmsg = NetMsg(150, buf);
nmsg.WriteInt(-1);//OOB
nmsg.WriteInt(NET_MAGIC_ID);//id
nmsg.WriteByte(69);//tell it we failed
nmsg.WriteString(msg);
connection->connection.Send(sender, nmsg.data, nmsg.cursize);
}
}
}
}
//send queued packets
connection->SendPackets();
//do keep alives and handle timeouts
for (auto ii: connection->peers)
{
unsigned int lastsendtime = ii.second->lastsendtime;
if ((lastsendtime + NET_PING_INTERVAL < NetGetTime() || ii.second->unsent_acks > MaxUnsentAcks) && ii.second->state == PEER_CONNECTED)
{
//send keep alive packet, with acks
//if (ii.second->connection.unsent_acks > 16)
//netlog("we got lots of unacked packets, sending keepalive/ack\n");
//else
//netlog("it has been a while since packet last sent, sending keepalive/ack\n");
ii.second->unsent_acks = 0;
char buffer[500];
NetMsg msg(500, buffer);
msg.WriteByte((unsigned char)NetCommandPackets::Ack);
//write acks
msg.WriteInt(ii.second->recieved_sequence);
msg.WriteInt(ii.second->GetAckBits());
ii.second->SendOOB(buffer, msg.cursize);
ii.second->lastsendtime = NetGetTime();
}
if (ii.second->lastpingtime + NET_PING_INTERVAL < NetGetTime() && ii.second->state == PEER_CONNECTED)
{
ii.second->lastpingtime = NetGetTime();
char buffer[100];
NetMsg msg(100, buffer);
msg.WriteByte((unsigned char)NetCommandPackets::Ping);
//write acks
msg.WriteLong(NetGetTime());
ii.second->SendOOB(buffer, msg.cursize);
}
if (ii.second->lastreceivetime < (NetGetTime() - connection->timeout < 0 ? 0 : NetGetTime() - connection->timeout) && ii.second->state == PEER_CONNECTED)
{
//connection timed out
Peer* client = ii.second;
Address sender = ii.second->remoteaddr;
netlogf("Client from %d.%d.%d.%d:%d Timed Out\n", sender.GetA(), sender.GetB(), sender.GetC(), sender.GetD(), sender.GetPort());
client->state = PEER_DISCONNECTED;
//disconnect
//connection->OnDisconnect(client);
//client->connection.Cleanup();
//delete client;
//connection->peers.erase(connection->peers.find(sender));//delete me
TPacket p;
p.data = 0;
p.size = 0;
p.sender = client;
p.addr = sender;
p.id = 2;
connection->incoming.push(p);
}
}
//update stats
if (connection->lastupdate + 500 < NetGetTime())
{
connection->lastupdate = NetGetTime();
int totalout = 0;
//need to sum up totals for all connections
for (auto ii: connection->peers)
{
//ok, poll the connection
totalout += ii.second->connection->sent;
ii.second->connection->sent = 0;
break;
}
connection->sent += totalout;
int deltain = connection->connection.received - connection->lastreceived;
int deltaout = totalout;//connection->connection.sent - connection->lastsent;
//int deltatcp = connection->data_connection.received - connection->lasttcp;
connection->datarate = 0.75f*connection->datarate + 0.25f*((float)deltain*2);
connection->outdatarate = 0.75f*connection->outdatarate + 0.25f*((float)deltaout*2);
//connection->tcprate = 0.75f*connection->tcprate + 0.25f*((float)deltatcp*2);
//connection->lasttcp = connection->data_connection.received;
connection->lastreceived = connection->connection.received;
connection->lastsent = totalout;//connection->connection.sent;
}
connection->peerincomingmutex.unlock();
NetSleep(1);//sleep then poll again
}
netlog("Network thread exited\n");
return;
};
void NetConnection::SendPackets()//actually sends to the server
{
//this->sendingmutex.lock();
#ifdef NETSIMULATE
this->connection.SendLaggedPackets();
#endif
for (auto client : this->peers)
{
client.second->SendPackets();
}
//this->sendingmutex.unlock();
}
void NetConnection::Open(unsigned short port, unsigned int maxpeers)
{
NetworkInit();//do this in case we havent already
//reset stats
lastreceived = lastupdate = lastsent = lasttcp = 0;
sent = recieved = 0;
//setup maxpeers
this->maxpeers = maxpeers;
this->running = true;//signal for thread
//open ports ahoy
this->connection.Open(port);
//start the thread
this->thread = std::thread(NetConnection::net_thread, this);
}
void NetConnection::Close()
{
//signal the thread to exit
this->running = false;
//kill the networking thread
if (this->thread.joinable())
this->thread.join();
this->Disconnect();
this->connection.Close();
//clean up remaining incoming paks
while(incoming.size() > 0)
{
TPacket p = this->incoming.front();
this->incoming.pop();
delete[] p.data;
}
}
void NetConnection::Send(Peer* client, char* data, unsigned int size, bool OOB)
{
if (OOB)
{
netlog("[Server] Sent OOB Packet\n");
client->SendOOB(data, size);
return;
}
client->Send(data, size);
}
char* NetConnection::Receive(Peer*& sender, int& size)
{
if (this->incoming.size() == 0)
return 0;//no messages to parse
peerincomingmutex.lock();
while (true)
{
TPacket p = this->incoming.front();
this->incoming.pop();
//ok, introduce callbacks here as different "packets"
if (p.id == 1)
{
//connect
Address sender = p.addr;
//this->peers[
netlogf("Client Connected from %d.%d.%d.%d:%d\n", sender.GetA(), sender.GetB(), sender.GetC(), sender.GetD(), sender.GetPort());
Peer* peer = new Peer;
peer->remoteaddr = sender;
peer->Init();
peer->server = true;
peer->connection = &this->connection;
peer->state = PEER_CONNECTED;
//send reply
char t[500];
NetMsg msg(500, t);
//msg.WriteInt(-1);
msg.WriteInt(NET_MAGIC_ID);//magic
msg.WriteByte(1);//success
msg.WriteShort(5007);//my port number, todo, changeme
peer->SendOOB(t, msg.cursize);
//connect
this->OnConnect(peer, (ConnectionRequest*)p.data);
this->peers[p.addr] = peer;
delete[] p.data;
}
else if (p.id == 2)
{
netlogf("Client from %d.%d.%d.%d:%d Disconnected\n", p.addr.GetA(), p.addr.GetB(), p.addr.GetC(), p.addr.GetD(), p.addr.GetPort());
//disconnect
this->OnDisconnect(p.sender);
this->peers.erase(this->peers.find(p.addr));
delete p.sender;
}
else
{
size = p.size;
sender = p.sender;
peerincomingmutex.unlock();
return p.data;
}
if (this->incoming.size() == 0)
{
size = 0;
sender = 0;
peerincomingmutex.unlock();
return 0;
}
}
peerincomingmutex.unlock();
}; | 26.194274 | 156 | 0.630182 | matt-attack |
c1e4e235c20b1d0a5ffb7cac803ef2e1d17e9172 | 8,095 | cpp | C++ | getic/bigterrain.cpp | circinusX1/qgetic | 112e20af4e940eae44af9cbf51362f362a743329 | [
"BSD-4-Clause"
] | null | null | null | getic/bigterrain.cpp | circinusX1/qgetic | 112e20af4e940eae44af9cbf51362f362a743329 | [
"BSD-4-Clause"
] | null | null | null | getic/bigterrain.cpp | circinusX1/qgetic | 112e20af4e940eae44af9cbf51362f362a743329 | [
"BSD-4-Clause"
] | null | null | null | // BigTerrain.cpp: implementation of the CBigTerrain class.
//
//---------------------------------------------------------------------------------------
#include "stdafx.h"
#include "geticapp.h"
#include "bigterrain.h"
#include "view3d.h"
#include "view2d.h"
#include "document.h"
#include "texadapter.h"
#include "texsys.h"
#include "texref.h"
//---------------------------------------------------------------------------------------
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
//---------------------------------------------------------------------------------------
void CBigTerrain::Serialize(FileWrap* pfv,
const vvector<Texture>& texNames,
map<int32_t,int32_t>& texassoc)
{
pfv->Serialize(n_xtiles);
pfv->Serialize(n_ztiles);
pfv->Serialize(b_box);
pfv->Serialize(n_stage);
pfv->Serialize(t_anim[0]);
pfv->Serialize(t_anim[1]);
pfv->Serialize(m_dummy[0]);
pfv->Serialize(m_dummy[1]);
pfv->Serialize(m_dummy[2]);
pfv->Serialize(m_dummy[3]);
pfv->Serialize(m_dummy[4]);
pfv->Serialize(m_dummy[5]);
pfv->Serialize(m_dummy[6]);
pfv->Serialize(m_dummy[7]);
if(pfv->_store)
{
int32_t nVxes = v_vxes.Size();
pfv->Write(nVxes);
for(int32_t i=0;i<nVxes;i++)
{
pfv->Write(v_vxes[i]);
}
}
else
{
u_int8_t hm;
int32_t nVxes;
pfv->Read(nVxes);
v_vxes.ObjReserve(nVxes);
for(int32_t i=0; i<nVxes ;i++)
{
pfv->Read(hm);
v_vxes[i] = hm;
}
}
}
//---------------------------------------------------------------------------------------
void CBigTerrain::Render(u_bool32 d3)
{
if(!n_xtiles || 0==p_dummyBrush) return;
v3d_t ex = b_box.GetExtends();
f32_t xS = (ex.x) / (f32_t)n_xtiles;
f32_t zS = (ex.z) / (f32_t)n_ztiles;
v3d_t vWalk1,vWalk2, vmin = b_box._min;
u_int8_t lc[4];
v2d_t tc0,tc1;
u_int32_t texAstage = 1<<GUtex;
u_bool32 untt[4] = {Flags()&TERR_UTT0,
Flags()&TERR_UTT1,
Flags()&TERR_UTT2,
Flags()&TERR_UTT3};
if(p_dummyBrush->IsSelected())
glColor4ubv(CLR_WHITE);
else
{
if(d3==0)
glColor4ubv(CLR_TERRAIN);
else
glColor4ubv(CLR_NORMAL);
}
if(d3)
{
Ta.Reset();
Ta.Bind(Texs(), GUtex);
}
for(int32_t x=0 ; x < n_xtiles; x++)
{
if(d3)
{
glBegin(GL_TRIANGLE_STRIP);
}
else
glBegin(GL_LINE_STRIP);
vWalk1.x = vmin.x + x * xS;
vWalk2.x = vmin.x + (x+1) * xS;
for(int32_t z=0 ; z < n_ztiles; z++)
{
vWalk1.z = vmin.z + z * zS;
vWalk1.y = *(element(&v_vxes, x, z, n_xtiles));
vWalk1.y /= 255.0;
vWalk1.y *= ex.y;
vWalk1.y += vmin.y;
vWalk2.z = vWalk1.z;
vWalk2.y = *(element(&v_vxes, (x+1), z, n_xtiles));
vWalk2.y /= 255.0;
vWalk2.y *= ex.y;
vWalk2.y += vmin.y;
if(GCullTerrCell && Pd->_cam.IsCulled(&vWalk1) && Pd->_cam.IsCulled(&vWalk2))
{
continue;
}
if(d3==0 && !p_dummyBrush->IsSelected())
{
lc[0] = CLR_TERRAIN[0] + ((vWalk1.y-b_box._min.z) / b_box.GetExtends().z * 64);
lc[1] = CLR_TERRAIN[1] + ((vWalk1.y-b_box._min.z) / b_box.GetExtends().z * 64);
lc[2] = CLR_TERRAIN[2] + ((vWalk1.y-b_box._min.z) / b_box.GetExtends().z * 64);
lc[3] = CLR_TERRAIN[3];
glColor4ubv(lc);
}
if(untt[GUtex])
{
tc0.setval((vWalk1.x-vmin.x)/ex.x, 1-(vWalk1.z-vmin.z)/ex.z);
}
else
{
if((z&1)==0)
tc0.setval(0,0);
else
tc0.setval(0,1);
}
if(untt[GUtex])
{
tc1.setval((vWalk2.x-vmin.x)/ex.x, 1-(vWalk2.z-vmin.z)/ex.z);
}
else
{
if((z&1)==0)
tc1.setval(1,0);
else
tc1.setval(1,1);
}
if(d3 && (n_stage & texAstage))
{
AnimateSurfaceTexture(tc0, tc1);
}
glTexCoord2fv((f32_t*)tc0);
glVertex3fv((f32_t*)vWalk1);
glTexCoord2fv((f32_t*)tc1);
glVertex3fv((f32_t*)vWalk2);
}
glEnd();
}
}
//---------------------------------------------------------------------------------------
void CBigTerrain::AnimateSurfaceTexture(v2d_t& tc0, v2d_t& tc1)
{
u_int32_t animbits = n_stage & 0xF0000000;
if(animbits == TERR_TA_SHIFT)
{
v2d_t depl(t_anim[0].u * PaintCounter, t_anim[0].v * PaintCounter);
tc0 += depl;
tc1 += depl;
}
else if(animbits == TERR_TA_OSC) //trmo
{
v2d_t depl(t_anim[0].u*Sinr((f32_t)PaintCounter/16.0), t_anim[0].v*Cosr((f32_t)PaintCounter/16.0));
tc0 += depl;
tc1 += depl;
}
}
//---------------------------------------------------------------------------------------
u_bool32 CBigTerrain::Create(const u_int8_t* hmap, const v3d_t& start, const v3d_t& size,
int32_t xt, int32_t yt)
{
Clear(1);
p_dummyBrush = new Brush();
p_dummyBrush->MakeCube((v3d_t&)size);
p_dummyBrush->Recalc();
p_dummyBrush->_brushflags = BRSH_BIGTERRAIN|TERR_GOR|TERR_UTT0;
p_dummyBrush->_pUsrData = this;
p_dummyBrush->Reverse();
p_dummyBrush->_pUsrData=this;
strcpy(p_dummyBrush->_name,"terrain");
n_xtiles = xt;
n_ztiles = yt;
b_box._min = start;
b_box._max = start + size;
u_int8_t* pwhmap = (u_int8_t*)hmap;
int32_t k=0;
u_int8_t bmin=255;
u_int8_t bmax=0;
v_vxes.ObjReserve((n_xtiles+1)*(n_ztiles+1));
for(int32_t x=0 ; x <= n_xtiles; x++)
{
for(int32_t z=0 ; z <= n_ztiles; z++)
{
bmin = tmin(*pwhmap,bmin);
bmax = tmax(*pwhmap,bmax);
v_vxes[k++] = *pwhmap++;
}
}
return 1;
}
//---------------------------------------------------------------------------------------
void CBigTerrain::Clear(int32_t delB)
{
if(delB && p_dummyBrush)
Pd->DeleteBrush(p_dummyBrush,0);
p_dummyBrush = 0;
v_vxes.Destroy();
n_xtiles=0;
n_ztiles=0;
}
//---------------------------------------------------------------------------------------
CBigTerrain& CBigTerrain::operator = (const CBigTerrain& cbt)
{
if(&cbt != this)
{
Clear(1);
if( ((CBigTerrain&)cbt).Exist() )
{
p_dummyBrush = new Brush(*cbt.p_dummyBrush);
p_dummyBrush->_pUsrData=this;
}
v_vxes = cbt.v_vxes;
n_xtiles = cbt.n_xtiles;
n_ztiles = cbt.n_ztiles;
b_box = cbt.b_box;
n_stage = cbt.n_stage;
t_anim[0] = cbt.t_anim[0];
t_anim[1] = cbt.t_anim[1];
memcpy(m_dummy,cbt.m_dummy,sizeof(m_dummy));
_clearing=0;
}
return *this;
}
//---------------------------------------------------------------------------------------
CBigTerrain::CBigTerrain(const CBigTerrain& cbt )
{
if( ((CBigTerrain&)cbt).Exist())
{
p_dummyBrush = new Brush(*cbt.p_dummyBrush);
p_dummyBrush->_pUsrData=this;
}
v_vxes = cbt.v_vxes;
n_xtiles = cbt.n_xtiles;
n_ztiles = cbt.n_ztiles;
b_box = cbt.b_box;
n_stage = cbt.n_stage;
t_anim[0] = cbt.t_anim[0];
t_anim[1] = cbt.t_anim[1];
memcpy(m_dummy,cbt.m_dummy,sizeof(m_dummy));
_clearing = 0;
}
/*
anim textures u and v is shift
*/
| 27.255892 | 107 | 0.45176 | circinusX1 |
c1e5448fd836290aa290b7afaa5c0cb1a374bebe | 1,954 | cc | C++ | src/cdi/CDI_integrateRosselandSpectrum.cc | keadyk/Draco | 129fbff1d74a3f5498670e952b7d4142f37b2aac | [
"BSD-3-Clause-Open-MPI"
] | 1 | 2020-03-19T07:05:08.000Z | 2020-03-19T07:05:08.000Z | src/cdi/CDI_integrateRosselandSpectrum.cc | 5l1v3r1/Draco | 0480d4c7c1ff7f40e0aece3be785dc0e4e23ece1 | [
"BSD-3-Clause-Open-MPI"
] | null | null | null | src/cdi/CDI_integrateRosselandSpectrum.cc | 5l1v3r1/Draco | 0480d4c7c1ff7f40e0aece3be785dc0e4e23ece1 | [
"BSD-3-Clause-Open-MPI"
] | null | null | null | //----------------------------------*-C++-*-----------------------------------//
/*!
* \file cdi/CDI_integrateRosselandSpectrum.cc
* \author Kelly Thompson
* \date Thu Jun 22 16:22:07 2000
* \brief CDI class implementation file.
* \note Copyright (C) 2016-2020 Triad National Security, LLC.
* All rights reserved. */
//----------------------------------------------------------------------------//
#include "CDI.hh"
namespace rtt_cdi {
//----------------------------------------------------------------------------//
// Rosseland Spectrum Integrators
//----------------------------------------------------------------------------//
//----------------------------------------------------------------------------//
/*!
* \brief Integrate the Rosseland spectrum over a frequency range.
*
* The arguments to this function must all be in consistent units. For example,
* if low and high are expressed in keV, then the temperature must also be
* expressed in keV. If low and high are in Hz and temperature is in K, then low
* and high must first be multiplied by Planck's constant and temperature by
* Boltzmann's constant before they are passed to this function.
*
* \param low lower frequency bound.
* \param high higher frequency bound.
* \param T the temperature (must be greater than 0.0)
*
* \return integrated normalized Rosseland from low to high
*/
double CDI::integrateRosselandSpectrum(const double low, const double high,
const double T) {
Require(low >= 0.0);
Require(high >= low);
Require(T >= 0.0);
double planck, rosseland;
integrate_Rosseland_Planckian_Spectrum(low, high, T, planck, rosseland);
return rosseland;
}
} // end namespace rtt_cdi
//----------------------------------------------------------------------------//
// end of CDI_integrateRosselandSpectrum.cc
//----------------------------------------------------------------------------//
| 37.576923 | 80 | 0.502559 | keadyk |
c1ec43f8e55f0858efbbb3353149b251d67b8c50 | 869 | cpp | C++ | FW/UI/PR/ui_string_property.cpp | JAntn/wblocks | e8aa383882b4726f6f7cca7213fa49e9e80d990f | [
"MIT"
] | null | null | null | FW/UI/PR/ui_string_property.cpp | JAntn/wblocks | e8aa383882b4726f6f7cca7213fa49e9e80d990f | [
"MIT"
] | null | null | null | FW/UI/PR/ui_string_property.cpp | JAntn/wblocks | e8aa383882b4726f6f7cca7213fa49e9e80d990f | [
"MIT"
] | null | null | null | #include "FW/UI/PR/ui_string_property.h"
#include "ui_stringproperty.h"
TypeUiStringProperty::TypeUiStringProperty( QString tag_name, QString value, TypeSaveCallback on_changed, QWidget* parent ):
TypeUiProperty( on_changed, parent ),
ui( new Ui::TypeUiStringProperty )
{
ui->setupUi( this );
ui->Label->setText( tag_name );
ui->PlainTextEdit->setPlainText( value );
connect(
ui->ApplyButton,
QPushButton::clicked,
this,
TypeUiStringProperty::OnApplyButtonClicked
);
}
TypeUiStringProperty::~TypeUiStringProperty()
{
delete ui;
}
void TypeUiStringProperty::SetValue( QString value )
{
ui->PlainTextEdit->setPlainText( value );
}
QString TypeUiStringProperty::Value()
{
return ui->PlainTextEdit->toPlainText();
}
void TypeUiStringProperty::OnApplyButtonClicked()
{
OnActionSave();
}
| 19.75 | 124 | 0.705409 | JAntn |
c1ec648730be9d1265f3fd5916ddb6bc595229f3 | 1,360 | cpp | C++ | Codeforces/277.5 Division 2/Problem C/C.cpp | VastoLorde95/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 170 | 2017-07-25T14:47:29.000Z | 2022-01-26T19:16:31.000Z | Codeforces/277.5 Division 2/Problem C/C.cpp | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | null | null | null | Codeforces/277.5 Division 2/Problem C/C.cpp | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 55 | 2017-07-28T06:17:33.000Z | 2021-10-31T03:06:22.000Z | #include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
#include<set>
#include<vector>
#include<utility>
#include<math.h>
#define sd(x) scanf("%d",&x);
#define sd2(x,y) scanf("%d%d",&x,&y);
#define sd3(x,y,z) scanf("%d%d%d",&x,&y,&z);
using namespace std;
int main(){
int m, s;
cin >> m >> s;
if(s == 0 and m == 1){
cout<<"0 0"<<endl;
return 0;
}
if(s >= 0 and s <= 9*m){
string s1, s2, s3, s4;
int sum = s;
for(int i = 0; i < m; i++){
for(int j = 0; j < 10; j++){
if ((i > 0 or j > 0 or (m == 1 and j == 0)) and ((sum - j) >= 0 and ((sum-j) <= 9*(m-i-1)))){
s1 += (char) ('0' + j);
sum -= j;
break;
}
}
}
sum = s;
for(int i = 0; i < m; i++){
for(int j = 9; j >= 0; j--){
if ((i > 0 or j > 0 or (m == 1 and j == 0)) and ((sum - j) >= 0 and ((sum-j) <= 9*(m-i-1)))){
s2 += (char)('0' + j);
sum -= j;
break;
}
}
}
int i = 0;
while(i < s1.length() and s1[i] == '0'){
i++;
}
while(i < s1.length()){
s3 += s1[i];
i++;
}
i = 0;
while(i < s2.length() and s2[i] == '0'){
i++;
}
while(i < s2.length()){
s4 += s2[i];
i++;
}
if(s3.length() != m or s4.length() != m){
cout<<"-1 -1"<<endl;
return 0;
}
cout<<s3<<" "<<s4<<endl;
}
else{
cout<<"-1 -1"<<endl;
}
return 0;
}
| 17.21519 | 97 | 0.438971 | VastoLorde95 |
c1ecac12f0dfc5f819fadd49fc92fe65cf0611cd | 4,556 | cpp | C++ | glhelper/texture.cpp | Wumpf/glhelper | de4658f4918533dfac25acf99fc3e5802743210b | [
"MIT"
] | 14 | 2015-01-18T21:13:21.000Z | 2021-12-21T01:03:16.000Z | glhelper/texture.cpp | Jojendersie/glhelper | 7e59fcb09bb7332cf48c1831db1ff5f59de0af81 | [
"MIT"
] | 7 | 2015-06-15T19:09:13.000Z | 2015-11-26T09:22:10.000Z | glhelper/texture.cpp | Wumpf/glhelper | de4658f4918533dfac25acf99fc3e5802743210b | [
"MIT"
] | 5 | 2015-06-15T13:22:18.000Z | 2021-10-31T00:26:01.000Z | #include "texture.hpp"
namespace gl
{
TextureId Texture::s_boundTextures[Texture::s_numTextureBindings];
Texture::Texture(GLsizei width, GLsizei height, GLsizei depth, TextureFormat format, GLsizei numMipLevels, GLsizei numMSAASamples) :
m_width(width),
m_height(height),
m_depth(depth),
m_format(format),
m_numMipLevels(ConvertMipMapSettingToActualCount(numMipLevels, width, height, depth)),
m_numMSAASamples(numMSAASamples)
{
GLHELPER_ASSERT(m_width > 0 || m_height > 0 || m_depth > 0, "Invalid texture size.");
GLHELPER_ASSERT(m_numMipLevels > 0, "Invalid mipmap level count.");
GLHELPER_ASSERT(m_numMipLevels == 1 || numMSAASamples == 0, "Texture must have either zero MSAA samples or only one miplevel!");
}
Texture::Texture(Texture&& _moved) :
m_textureHandle(_moved.m_textureHandle),
m_width(_moved.m_width),
m_height(_moved.m_height),
m_depth(_moved.m_depth),
m_format(_moved.m_format),
m_numMipLevels(_moved.m_numMipLevels),
m_numMSAASamples(_moved.m_numMSAASamples)
{
_moved.m_textureHandle = 0;
}
Texture::~Texture()
{
// According to the specification it is not necessary to unbind the texture. All bindings reset themselves to zero.
// http://docs.gl/gl4/glDeleteTextures
// However this means, that glhelper's saved bindings are wrong!
// Since they contain texture handles, this might result in rejected binding of new textures!
// Iterating over all bindings is rather costly but reliable, easy and zero overhead for all other operations.
for (unsigned int i = 0; i < s_numTextureBindings; ++i)
{
if (s_boundTextures[i] == m_textureHandle)
s_boundTextures[i] = 0;
}
GL_CALL(glDeleteTextures, 1, &m_textureHandle);
}
GLsizei Texture::ConvertMipMapSettingToActualCount(GLsizei _mipMapSetting, GLsizei _width, GLsizei _height, GLsizei _depth)
{
if (_mipMapSetting == 0)
{
GLsizei numMipLevels = 0;
while (_width > 0 || _height > 0 || _depth > 0)
{
_width /= 2;
_height /= 2;
_depth /= 2;
++numMipLevels;
}
return numMipLevels;
}
else
return _mipMapSetting;
}
void Texture::BindImage(GLuint _slotIndex, Texture::ImageAccess _access, TextureFormat _format, GLint _level) const
{
GL_CALL(glBindImageTexture, _slotIndex, m_textureHandle, _level, GL_TRUE, 0, static_cast<GLenum>(_access), gl::TextureFormatToGLSizedInternal[static_cast<unsigned int>(_format)]);
}
void Texture::ResetImageBinding(GLuint _slotIndex)
{
GL_CALL(glBindImageTexture, _slotIndex, 0, 0, false, 0, GL_READ_WRITE, GL_RGBA8);
}
void Texture::ResetBinding(GLuint _slotIndex)
{
GLHELPER_ASSERT(_slotIndex < sizeof(s_boundTextures) / sizeof(Texture*), "Can't bind texture to slot " + std::to_string(_slotIndex) +
". Maximum number of slots in glhelper is " + (std::to_string(sizeof(s_boundTextures) / sizeof(Texture*)) +
". For actual hardware restrictions see glGet GL_MAX_COMBINED_TEXTURE_IMAGE_UNITS"));
if (s_boundTextures[_slotIndex] != 0)
{
GL_CALL(glBindTextureUnit, _slotIndex, 0);
s_boundTextures[_slotIndex] = 0;
}
}
void Texture::ClearToZero(GLsizei _mipLevel)
{
GLHELPER_ASSERT(m_numMipLevels > _mipLevel, "Miplevel " + std::to_string(_mipLevel) + " not available, texture has only " + std::to_string(m_numMipLevels) + " levels!");
GL_CALL(glClearTexImage, m_textureHandle, _mipLevel, gl::TextureFormatToGLBaseInternal[static_cast<unsigned int>(m_format)], GL_UNSIGNED_INT, nullptr);
}
void Texture::Bind(GLuint _slotIndex) const
{
Bind(m_textureHandle, _slotIndex);
}
void Texture::Bind(TextureId textureHandle, GLuint _slotIndex)
{
GLHELPER_ASSERT(_slotIndex < sizeof(s_boundTextures) / sizeof(void*), "Can't bind texture to slot " + std::to_string(_slotIndex) + ". Maximum number of slots is " + std::to_string(sizeof(s_boundTextures) / sizeof(Texture*)));
if(s_boundTextures[_slotIndex] != textureHandle)
{
GL_CALL(glBindTextureUnit, _slotIndex, textureHandle);
s_boundTextures[_slotIndex] = textureHandle;
}
}
void Texture::ReadImage(GLsizei _mipLevel, TextureReadFormat _format, TextureReadType _type, GLsizei _bufferSize, void* _buffer) const
{
GLHELPER_ASSERT(m_numMipLevels > _mipLevel, "Miplevel " + std::to_string(_mipLevel) + " not available, texture has only " + std::to_string(m_numMipLevels) + " levels!");
GL_CALL(glGetTextureImage, m_textureHandle, _mipLevel, static_cast<GLenum>(_format), static_cast<GLenum>(_type), _bufferSize, _buffer);
}
void Texture::GenMipMaps()
{
GL_CALL(glGenerateTextureMipmap, m_textureHandle);
}
} | 35.874016 | 227 | 0.742098 | Wumpf |
c1f06b8d8c933801da8bae52bd33ec7af9778718 | 1,199 | cpp | C++ | examples/xtd.forms.examples/others/form_and_thread/src/form_and_thread.cpp | BaderEddineOuaich/xtd | 6f28634c7949a541d183879d2de18d824ec3c8b1 | [
"MIT"
] | 1 | 2022-02-25T16:53:06.000Z | 2022-02-25T16:53:06.000Z | examples/xtd.forms.examples/others/form_and_thread/src/form_and_thread.cpp | leanid/xtd | 2e1ea6537218788ca08901faf8915d4100990b53 | [
"MIT"
] | null | null | null | examples/xtd.forms.examples/others/form_and_thread/src/form_and_thread.cpp | leanid/xtd | 2e1ea6537218788ca08901faf8915d4100990b53 | [
"MIT"
] | null | null | null | #include <xtd/xtd>
using namespace std::literals;
using namespace xtd::forms;
class form_thread : public form {
public:
form_thread() {
text("Form and thread example");
form_closed += [&] {
closed = true;
for (auto index = 0U; index < threads.size(); index++)
threads[index].join();
};
messages.parent(*this);
messages.dock(dock_style::fill);
for (auto index = 0U; index < threads.size(); index++) {
threads[index] = std::thread([&](int user_thread_id) {
auto counter = 0;
while (!closed) {
/// simulate work...
std::this_thread::sleep_for(50ms);
counter++;
/// call invoke method to update ui in the main thread.
messages.begin_invoke([&] {
messages.items().push_back(xtd::ustring::format("thread: {}, counter: {}", user_thread_id, counter));
messages.selected_index(messages.items().size() - 1);
});
}
}, index);
}
}
private:
xtd::forms::list_box messages;
bool closed = false;
std::vector<std::thread> threads {std::thread::hardware_concurrency()};
};
int main() {
application::run(form_thread());
}
| 26.644444 | 113 | 0.57965 | BaderEddineOuaich |
c1f33ab648b50250a8e39f4377af2f655684cdcc | 56,641 | cpp | C++ | samples/pick/pick_main.cpp | shocker-0x15/OptiX_Utility | f3719a7151d79c7777fa5dbece7cfef186b7e30b | [
"Apache-2.0"
] | 32 | 2020-10-21T07:21:21.000Z | 2022-03-13T12:13:13.000Z | samples/pick/pick_main.cpp | shocker-0x15/OptiX_Utility | f3719a7151d79c7777fa5dbece7cfef186b7e30b | [
"Apache-2.0"
] | 6 | 2020-11-09T11:03:48.000Z | 2021-01-29T16:31:22.000Z | samples/pick/pick_main.cpp | shocker-0x15/OptiX_Utility | f3719a7151d79c7777fa5dbece7cfef186b7e30b | [
"Apache-2.0"
] | null | null | null | /*
JP: このサンプルはインタラクティブなアプリケーション上におけるオブジェクトピック実装の一例を示します。
APIの使い方として新しいものを示すサンプルではありません。
例として透視投影と正距円筒図法による投影を使ったカメラを示します。
EN: This sample demonstrates an example of implementing object picking in an interactive application.
This sample has nothing new for API usage.
As examples, cameras using perspective projection and equirectangular projection are provided.
*/
#include "pick_shared.h"
#include "../common/obj_loader.h"
// Include glfw3.h after our OpenGL definitions
#include "../common/gl_util.h"
#include <GLFW/glfw3.h>
#include "imgui.h"
#include "imgui_impl_glfw.h"
#include "imgui_impl_opengl3.h"
struct KeyState {
uint64_t timesLastChanged[5];
bool statesLastChanged[5];
uint32_t lastIndex;
KeyState() : lastIndex(0) {
for (int i = 0; i < 5; ++i) {
timesLastChanged[i] = 0;
statesLastChanged[i] = false;
}
}
void recordStateChange(bool state, uint64_t time) {
bool lastState = statesLastChanged[lastIndex];
if (state == lastState)
return;
lastIndex = (lastIndex + 1) % 5;
statesLastChanged[lastIndex] = !lastState;
timesLastChanged[lastIndex] = time;
}
bool getState(int32_t goBack = 0) const {
Assert(goBack >= -4 && goBack <= 0, "goBack must be in the range [-4, 0].");
return statesLastChanged[(lastIndex + goBack + 5) % 5];
}
uint64_t getTime(int32_t goBack = 0) const {
Assert(goBack >= -4 && goBack <= 0, "goBack must be in the range [-4, 0].");
return timesLastChanged[(lastIndex + goBack + 5) % 5];
}
};
KeyState g_keyForward;
KeyState g_keyBackward;
KeyState g_keyLeftward;
KeyState g_keyRightward;
KeyState g_keyUpward;
KeyState g_keyDownward;
KeyState g_keyTiltLeft;
KeyState g_keyTiltRight;
KeyState g_keyFasterPosMovSpeed;
KeyState g_keySlowerPosMovSpeed;
KeyState g_buttonRotate;
double g_mouseX;
double g_mouseY;
float g_cameraPositionalMovingSpeed;
float g_cameraDirectionalMovingSpeed;
float g_cameraTiltSpeed;
Quaternion g_cameraOrientation;
Quaternion g_tempCameraOrientation;
float3 g_cameraPosition;
static void glfw_error_callback(int32_t error, const char* description) {
hpprintf("Error %d: %s\n", error, description);
}
namespace ImGui {
template <typename EnumType>
bool RadioButtonE(const char* label, EnumType* v, EnumType v_button) {
return RadioButton(label, reinterpret_cast<int*>(v), static_cast<int>(v_button));
}
}
int32_t main(int32_t argc, const char* argv[]) try {
const std::filesystem::path exeDir = getExecutableDirectory();
bool takeScreenShot = false;
uint32_t argIdx = 1;
while (argIdx < argc) {
std::string_view arg = argv[argIdx];
if (arg == "--screen-shot")
takeScreenShot = true;
else
throw std::runtime_error("Unknown command line argument.");
++argIdx;
}
// ----------------------------------------------------------------
// JP: OpenGL, GLFWの初期化。
// EN: Initialize OpenGL and GLFW.
glfwSetErrorCallback(glfw_error_callback);
if (!glfwInit()) {
hpprintf("Failed to initialize GLFW.\n");
return -1;
}
GLFWmonitor* monitor = glfwGetPrimaryMonitor();
constexpr bool enableGLDebugCallback = DEBUG_SELECT(true, false);
// JP: OpenGL 4.6 Core Profileのコンテキストを作成する。
// EN: Create an OpenGL 4.6 core profile context.
const uint32_t OpenGLMajorVersion = 4;
const uint32_t OpenGLMinorVersion = 6;
const char* glsl_version = "#version 460";
glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, OpenGLMajorVersion);
glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, OpenGLMinorVersion);
glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);
if constexpr (enableGLDebugCallback)
glfwWindowHint(GLFW_OPENGL_DEBUG_CONTEXT, GL_TRUE);
glfwWindowHint(GLFW_SRGB_CAPABLE, GLFW_TRUE);
int32_t renderTargetSizeX = 800;
int32_t renderTargetSizeY = 800;
// JP: ウインドウの初期化。
// HiDPIディスプレイに対応する。
// EN: Initialize a window.
// Support Hi-DPI display.
float contentScaleX, contentScaleY;
glfwGetMonitorContentScale(monitor, &contentScaleX, &contentScaleY);
float UIScaling = contentScaleX;
GLFWwindow* window = glfwCreateWindow(static_cast<int32_t>(renderTargetSizeX * UIScaling),
static_cast<int32_t>(renderTargetSizeY * UIScaling),
"OptiX Utility - Pick", NULL, NULL);
glfwSetWindowUserPointer(window, nullptr);
if (!window) {
hpprintf("Failed to create a GLFW window.\n");
glfwTerminate();
return -1;
}
int32_t curFBWidth;
int32_t curFBHeight;
glfwGetFramebufferSize(window, &curFBWidth, &curFBHeight);
glfwMakeContextCurrent(window);
glfwSwapInterval(1); // Enable vsync
// JP: gl3wInit()は何らかのOpenGLコンテキストが作られた後に呼ぶ必要がある。
// EN: gl3wInit() must be called after some OpenGL context has been created.
int32_t gl3wRet = gl3wInit();
if (!gl3wIsSupported(OpenGLMajorVersion, OpenGLMinorVersion)) {
hpprintf("gl3w doesn't support OpenGL %u.%u\n", OpenGLMajorVersion, OpenGLMinorVersion);
glfwTerminate();
return -1;
}
if constexpr (enableGLDebugCallback) {
glu::enableDebugCallback(true);
glDebugMessageControl(GL_DONT_CARE, GL_DONT_CARE, GL_DEBUG_SEVERITY_NOTIFICATION, 0, nullptr, false);
}
// END: Initialize OpenGL and GLFW.
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// JP: ImGuiの初期化。
// EN: Initialize ImGui.
ImGui::CreateContext();
ImGuiIO& io = ImGui::GetIO(); (void)io;
//io.ConfigFlags |= ImGuiConfigFlags_NavEnableKeyboard; // Enable Keyboard Controls
//io.ConfigFlags |= ImGuiConfigFlags_NavEnableGamepad; // Enable Gamepad Controls
ImGui_ImplGlfw_InitForOpenGL(window, true);
ImGui_ImplOpenGL3_Init(glsl_version);
// Setup style
// JP: ガンマ補正が有効なレンダーターゲットで、同じUIの見た目を得るためにデガンマされたスタイルも用意する。
// EN: Prepare a degamma-ed style to have the identical UI appearance on gamma-corrected render target.
ImGuiStyle guiStyle/*, guiStyleWithGamma*/;
ImGui::StyleColorsDark(&guiStyle);
//guiStyleWithGamma = guiStyle;
//const auto degamma = [](const ImVec4 &color) {
// return ImVec4(sRGB_degamma_s(color.x),
// sRGB_degamma_s(color.y),
// sRGB_degamma_s(color.z),
// color.w);
//};
//for (int i = 0; i < ImGuiCol_COUNT; ++i) {
// guiStyleWithGamma.Colors[i] = degamma(guiStyleWithGamma.Colors[i]);
//}
ImGui::GetStyle() = guiStyle;
// END: Initialize ImGui.
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// JP: 入力コールバックの設定。
// EN: Set up input callbacks.
glfwSetMouseButtonCallback(window, [](GLFWwindow* window, int32_t button, int32_t action, int32_t mods) {
uint64_t &frameIndex = *(uint64_t*)glfwGetWindowUserPointer(window);
ImGui_ImplGlfw_MouseButtonCallback(window, button, action, mods);
switch (button) {
case GLFW_MOUSE_BUTTON_MIDDLE: {
devPrintf("Mouse Middle\n");
g_buttonRotate.recordStateChange(action == GLFW_PRESS, frameIndex);
break;
}
default:
break;
}
});
glfwSetCursorPosCallback(window, [](GLFWwindow* window, double x, double y) {
g_mouseX = x;
g_mouseY = y;
});
glfwSetKeyCallback(window, [](GLFWwindow* window, int32_t key, int32_t scancode, int32_t action, int32_t mods) {
uint64_t &frameIndex = *(uint64_t*)glfwGetWindowUserPointer(window);
ImGui_ImplGlfw_KeyCallback(window, key, scancode, action, mods);
switch (key) {
case GLFW_KEY_W: {
g_keyForward.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_S: {
g_keyBackward.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_A: {
g_keyLeftward.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_D: {
g_keyRightward.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_R: {
g_keyUpward.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_F: {
g_keyDownward.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_Q: {
g_keyTiltLeft.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_E: {
g_keyTiltRight.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_T: {
g_keyFasterPosMovSpeed.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
case GLFW_KEY_G: {
g_keySlowerPosMovSpeed.recordStateChange(action == GLFW_PRESS || action == GLFW_REPEAT, frameIndex);
break;
}
default:
break;
}
});
g_cameraPositionalMovingSpeed = 0.01f;
g_cameraDirectionalMovingSpeed = 0.0015f;
g_cameraTiltSpeed = 0.025f;
g_cameraPosition = make_float3(0, 0, 3.2f);
g_cameraOrientation = qRotateY(M_PI);
// END: Set up input callbacks.
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// JP: OptiXのコンテキストとパイプラインの設定。
// EN: Settings for OptiX context and pipeline.
CUcontext cuContext;
int32_t cuDeviceCount;
CUstream cuStream;
CUDADRV_CHECK(cuInit(0));
CUDADRV_CHECK(cuDeviceGetCount(&cuDeviceCount));
CUDADRV_CHECK(cuCtxCreate(&cuContext, 0, 0));
CUDADRV_CHECK(cuCtxSetCurrent(cuContext));
CUDADRV_CHECK(cuStreamCreate(&cuStream, 0));
optixu::Context optixContext = optixu::Context::create(cuContext);
struct Pipeline {
optixu::Pipeline pipeline;
optixu::Module module;
std::map<std::string, optixu::ProgramGroup> rayGenPrograms;
optixu::ProgramGroup missProgram;
optixu::ProgramGroup hitProgramGroup;
cudau::Buffer shaderBindingTable;
cudau::Buffer hitGroupShaderBindingTable;
void finalize() {
hitGroupShaderBindingTable.finalize();
shaderBindingTable.finalize();
hitProgramGroup.destroy();
missProgram.destroy();
for (auto it = rayGenPrograms.begin(); it != rayGenPrograms.end(); ++it)
it->second.destroy();
module.destroy();
pipeline.destroy();
}
};
optixu::Module emptyModule;
Pipeline pickPipeline;
{
Pipeline &p = pickPipeline;
optixu::Pipeline &optixPipeline = p.pipeline;
optixPipeline = optixContext.createPipeline();
optixPipeline.setPipelineOptions(
optixu::calcSumDwords<PickPayloadSignature>(),
optixu::calcSumDwords<float2>(),
"plp", sizeof(Shared::PickPipelineLaunchParameters),
false, OPTIX_TRAVERSABLE_GRAPH_FLAG_ALLOW_SINGLE_LEVEL_INSTANCING,
OPTIX_EXCEPTION_FLAG_STACK_OVERFLOW | OPTIX_EXCEPTION_FLAG_TRACE_DEPTH |
DEBUG_SELECT(OPTIX_EXCEPTION_FLAG_DEBUG, OPTIX_EXCEPTION_FLAG_NONE),
OPTIX_PRIMITIVE_TYPE_FLAGS_TRIANGLE);
const std::string ptx = readTxtFile(getExecutableDirectory() / "pick/ptxes/pick_kernels.ptx");
p.module = optixPipeline.createModuleFromPTXString(
ptx, OPTIX_COMPILE_DEFAULT_MAX_REGISTER_COUNT,
OPTIX_COMPILE_OPTIMIZATION_DEFAULT,
DEBUG_SELECT(OPTIX_COMPILE_DEBUG_LEVEL_LINEINFO, OPTIX_COMPILE_DEBUG_LEVEL_NONE));
p.rayGenPrograms["perspective"] = optixPipeline.createRayGenProgram(p.module, RT_RG_NAME_STR("perspectiveRaygen"));
p.rayGenPrograms["equirectangular"] = optixPipeline.createRayGenProgram(p.module, RT_RG_NAME_STR("equirectangularRaygen"));
p.missProgram = optixPipeline.createMissProgram(p.module, RT_MS_NAME_STR("miss"));
p.hitProgramGroup = optixPipeline.createHitProgramGroupForBuiltinIS(
OPTIX_PRIMITIVE_TYPE_TRIANGLE,
p.module, RT_CH_NAME_STR("closesthit"),
emptyModule, nullptr);
optixPipeline.link(1, DEBUG_SELECT(OPTIX_COMPILE_DEBUG_LEVEL_FULL, OPTIX_COMPILE_DEBUG_LEVEL_NONE));
optixPipeline.setNumMissRayTypes(Shared::NumPickRayTypes);
optixPipeline.setMissProgram(Shared::PickRayType_Primary, p.missProgram);
size_t sbtSize;
optixPipeline.generateShaderBindingTableLayout(&sbtSize);
p.shaderBindingTable.initialize(cuContext, cudau::BufferType::Device, sbtSize, 1);
p.shaderBindingTable.setMappedMemoryPersistent(true);
optixPipeline.setShaderBindingTable(p.shaderBindingTable, p.shaderBindingTable.getMappedPointer());
}
Pipeline renderPipeline;
{
Pipeline &p = renderPipeline;
optixu::Pipeline &optixPipeline = p.pipeline;
optixPipeline = optixContext.createPipeline();
optixPipeline.setPipelineOptions(
optixu::calcSumDwords<RenderPayloadSignature>(),
optixu::calcSumDwords<float2>(),
"plp", sizeof(Shared::RenderPipelineLaunchParameters),
false, OPTIX_TRAVERSABLE_GRAPH_FLAG_ALLOW_SINGLE_LEVEL_INSTANCING,
OPTIX_EXCEPTION_FLAG_STACK_OVERFLOW | OPTIX_EXCEPTION_FLAG_TRACE_DEPTH |
DEBUG_SELECT(OPTIX_EXCEPTION_FLAG_DEBUG, OPTIX_EXCEPTION_FLAG_NONE),
OPTIX_PRIMITIVE_TYPE_FLAGS_TRIANGLE);
const std::string ptx = readTxtFile(getExecutableDirectory() / "pick/ptxes/render_kernels.ptx");
p.module = optixPipeline.createModuleFromPTXString(
ptx, OPTIX_COMPILE_DEFAULT_MAX_REGISTER_COUNT,
OPTIX_COMPILE_OPTIMIZATION_DEFAULT,
DEBUG_SELECT(OPTIX_COMPILE_DEBUG_LEVEL_LINEINFO, OPTIX_COMPILE_DEBUG_LEVEL_NONE));
p.rayGenPrograms["perspective"] = optixPipeline.createRayGenProgram(p.module, RT_RG_NAME_STR("perspectiveRaygen"));
p.rayGenPrograms["equirectangular"] = optixPipeline.createRayGenProgram(p.module, RT_RG_NAME_STR("equirectangularRaygen"));
p.missProgram = optixPipeline.createMissProgram(p.module, RT_MS_NAME_STR("miss"));
p.hitProgramGroup = optixPipeline.createHitProgramGroupForBuiltinIS(
OPTIX_PRIMITIVE_TYPE_TRIANGLE,
p.module, RT_CH_NAME_STR("closesthit"),
emptyModule, nullptr);
optixPipeline.link(1, DEBUG_SELECT(OPTIX_COMPILE_DEBUG_LEVEL_FULL, OPTIX_COMPILE_DEBUG_LEVEL_NONE));
optixPipeline.setNumMissRayTypes(Shared::NumRayTypes);
optixPipeline.setMissProgram(Shared::RayType_Primary, p.missProgram);
size_t sbtSize;
optixPipeline.generateShaderBindingTableLayout(&sbtSize);
p.shaderBindingTable.initialize(cuContext, cudau::BufferType::Device, sbtSize, 1);
p.shaderBindingTable.setMappedMemoryPersistent(true);
optixPipeline.setShaderBindingTable(p.shaderBindingTable, p.shaderBindingTable.getMappedPointer());
}
uint32_t maxNumRayTypes = std::max<uint32_t>(Shared::NumPickRayTypes, Shared::NumRayTypes);
// END: Settings for OptiX context and pipeline.
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// JP: マテリアルのセットアップ。
// EN: Setup materials.
uint32_t matID = 0;
std::vector<std::string> matInfos;
optixu::Material ceilingMat = optixContext.createMaterial();
ceilingMat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
ceilingMat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
matInfos.push_back("Ceiling");
Shared::MaterialData ceilingMatData = {};
ceilingMatData.matID = matID++;
ceilingMatData.color = make_float3(sRGB_degamma_s(0.75), sRGB_degamma_s(0.75), sRGB_degamma_s(0.75));
ceilingMat.setUserData(ceilingMatData);
optixu::Material farSideWallMat = optixContext.createMaterial();
farSideWallMat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
farSideWallMat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
matInfos.push_back("Far side Wall");
Shared::MaterialData farSideWallMatData = {};
farSideWallMatData.matID = matID++;
farSideWallMatData.color = make_float3(sRGB_degamma_s(0.75), sRGB_degamma_s(0.75), sRGB_degamma_s(0.75));
farSideWallMat.setUserData(farSideWallMatData);
optixu::Material leftWallMat = optixContext.createMaterial();
leftWallMat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
leftWallMat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
matInfos.push_back("Left Wall");
Shared::MaterialData leftWallMatData = {};
leftWallMatData.matID = matID++;
leftWallMatData.color = make_float3(sRGB_degamma_s(0.75), sRGB_degamma_s(0.25), sRGB_degamma_s(0.25));
leftWallMat.setUserData(leftWallMatData);
optixu::Material rightWallMat = optixContext.createMaterial();
rightWallMat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
rightWallMat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
matInfos.push_back("Right Wall");
Shared::MaterialData rightWallMatData = {};
rightWallMatData.matID = matID++;
rightWallMatData.color = make_float3(sRGB_degamma_s(0.25), sRGB_degamma_s(0.25), sRGB_degamma_s(0.75));
rightWallMat.setUserData(rightWallMatData);
optixu::Material floorMat = optixContext.createMaterial();
floorMat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
floorMat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
matInfos.push_back("Floor");
Shared::MaterialData floorMatData = {};
floorMatData.matID = matID++;
floorMatData.color = make_float3(sRGB_degamma_s(0.75), sRGB_degamma_s(0.75), sRGB_degamma_s(0.75));
floorMat.setUserData(floorMatData);
optixu::Material areaLightMat = optixContext.createMaterial();
areaLightMat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
areaLightMat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
matInfos.push_back("Area Light");
Shared::MaterialData areaLightMatData = {};
areaLightMatData.matID = matID++;
areaLightMatData.color = make_float3(sRGB_degamma_s(0.9f), sRGB_degamma_s(0.9f), sRGB_degamma_s(0.9f));
areaLightMat.setUserData(areaLightMatData);
std::mt19937 rngColor(2493572);
std::uniform_real_distribution<float> uColor;
constexpr uint32_t NumBunnies = 10;
std::vector<optixu::Material> bunnyMats(NumBunnies);
for (int i = 0; i < NumBunnies; ++i) {
optixu::Material &mat = bunnyMats[i];
mat = optixContext.createMaterial();
mat.setHitGroup(Shared::PickRayType_Primary, pickPipeline.hitProgramGroup);
mat.setHitGroup(Shared::RayType_Primary, renderPipeline.hitProgramGroup);
char str[256];
snprintf(str, sizeof(str), "Bunny %u", i);
matInfos.push_back(str);
Shared::MaterialData matData = {};
matData.matID = matID++;
matData.color = HSVtoRGB(uColor(rngColor),
uColor(rngColor),
sRGB_degamma_s(0.75f + 0.25f * uColor(rngColor)));
mat.setUserData(matData);
}
// END: Setup materials.
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// JP: シーンのセットアップ。
// EN: Setup a scene.
optixu::Scene scene = optixContext.createScene();
uint32_t geomID = 0;
uint32_t gasID = 0;
std::vector<std::string> geomInfos;
std::vector<std::string> gasInfos;
size_t maxSizeOfScratchBuffer = 0;
OptixAccelBufferSizes asMemReqs;
cudau::Buffer asBuildScratchMem;
struct Mesh {
struct Group {
cudau::TypedBuffer<Shared::Triangle> triangleBuffer;
cudau::TypedBuffer<uint8_t> matIndexBuffer;
optixu::GeometryInstance optixGeomInst;
};
cudau::TypedBuffer<Shared::Vertex> vertexBuffer;
std::vector<Group> groups;
void finalize() {
for (auto it = groups.rbegin(); it != groups.rend(); ++it) {
it->optixGeomInst.destroy();
it->matIndexBuffer.finalize();
it->triangleBuffer.finalize();
}
vertexBuffer.finalize();
}
};
struct GeometryGroup {
optixu::GeometryAccelerationStructure optixGas;
cudau::Buffer gasMem;
size_t compactedSize;
void finalize() {
gasMem.finalize();
optixGas.destroy();
}
};
Mesh room;
{
Shared::Vertex vertices[] = {
// floor
{ make_float3(-1.0f, -1.0f, -1.0f), make_float3(0, 1, 0), make_float2(0, 0) },
{ make_float3(-1.0f, -1.0f, 1.0f), make_float3(0, 1, 0), make_float2(0, 1) },
{ make_float3(1.0f, -1.0f, 1.0f), make_float3(0, 1, 0), make_float2(1, 1) },
{ make_float3(1.0f, -1.0f, -1.0f), make_float3(0, 1, 0), make_float2(1, 0) },
// far side wall
{ make_float3(-1.0f, -1.0f, -1.0f), make_float3(0, 0, 1), make_float2(0, 2) },
{ make_float3(-1.0f, 1.0f, -1.0f), make_float3(0, 0, 1), make_float2(0, 0) },
{ make_float3(1.0f, 1.0f, -1.0f), make_float3(0, 0, 1), make_float2(2, 0) },
{ make_float3(1.0f, -1.0f, -1.0f), make_float3(0, 0, 1), make_float2(2, 2) },
// ceiling
{ make_float3(-1.0f, 1.0f, -1.0f), make_float3(0, -1, 0), make_float2(0, 0) },
{ make_float3(-1.0f, 1.0f, 1.0f), make_float3(0, -1, 0), make_float2(0, 1) },
{ make_float3(1.0f, 1.0f, 1.0f), make_float3(0, -1, 0), make_float2(1, 1) },
{ make_float3(1.0f, 1.0f, -1.0f), make_float3(0, -1, 0), make_float2(1, 0) },
// left wall
{ make_float3(-1.0f, -1.0f, -1.0f), make_float3(1, 0, 0), make_float2(0, 0) },
{ make_float3(-1.0f, 1.0f, -1.0f), make_float3(1, 0, 0), make_float2(0, 1) },
{ make_float3(-1.0f, 1.0f, 1.0f), make_float3(1, 0, 0), make_float2(1, 1) },
{ make_float3(-1.0f, -1.0f, 1.0f), make_float3(1, 0, 0), make_float2(1, 0) },
// right wall
{ make_float3(1.0f, -1.0f, -1.0f), make_float3(-1, 0, 0), make_float2(0, 0) },
{ make_float3(1.0f, 1.0f, -1.0f), make_float3(-1, 0, 0), make_float2(0, 1) },
{ make_float3(1.0f, 1.0f, 1.0f), make_float3(-1, 0, 0), make_float2(1, 1) },
{ make_float3(1.0f, -1.0f, 1.0f), make_float3(-1, 0, 0), make_float2(1, 0) },
};
Shared::Triangle triangles[] = {
// floor
{ 0, 1, 2 }, { 0, 2, 3 },
// far side wall
{ 4, 7, 6 }, { 4, 6, 5 },
// ceiling
{ 8, 11, 10 }, { 8, 10, 9 },
// left wall
{ 15, 12, 13 }, { 15, 13, 14 },
// right wall
{ 16, 19, 18 }, { 16, 18, 17 }
};
uint8_t matIndices[] = {
0, 0,
1, 1,
2, 2,
3, 3,
4, 4,
};
room.vertexBuffer.initialize(cuContext, cudau::BufferType::Device, vertices, lengthof(vertices));
Mesh::Group group;
group.triangleBuffer.initialize(cuContext, cudau::BufferType::Device, triangles, lengthof(triangles));
group.matIndexBuffer.initialize(cuContext, cudau::BufferType::Device, matIndices, lengthof(matIndices));
geomInfos.push_back("Room");
Shared::GeometryData geomData = {};
geomData.vertexBuffer = room.vertexBuffer.getDevicePointer();
geomData.triangleBuffer = group.triangleBuffer.getDevicePointer();
geomData.geomID = geomID++;
group.optixGeomInst = scene.createGeometryInstance();
group.optixGeomInst.setVertexBuffer(room.vertexBuffer);
group.optixGeomInst.setTriangleBuffer(group.triangleBuffer);
group.optixGeomInst.setNumMaterials(5, group.matIndexBuffer, sizeof(uint8_t));
group.optixGeomInst.setMaterial(0, 0, floorMat);
group.optixGeomInst.setMaterial(0, 1, farSideWallMat);
group.optixGeomInst.setMaterial(0, 2, ceilingMat);
group.optixGeomInst.setMaterial(0, 3, leftWallMat);
group.optixGeomInst.setMaterial(0, 4, rightWallMat);
group.optixGeomInst.setGeometryFlags(0, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setGeometryFlags(1, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setGeometryFlags(2, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setGeometryFlags(3, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setGeometryFlags(4, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setUserData(geomData);
room.groups.push_back(std::move(group));
}
Mesh areaLight;
{
Shared::Vertex vertices[] = {
{ make_float3(-0.25f, 0.9f, -0.25f), make_float3(0, -1, 0), make_float2(0, 0) },
{ make_float3(-0.25f, 0.9f, 0.25f), make_float3(0, -1, 0), make_float2(0, 1) },
{ make_float3(0.25f, 0.9f, 0.25f), make_float3(0, -1, 0), make_float2(1, 1) },
{ make_float3(0.25f, 0.9f, -0.25f), make_float3(0, -1, 0), make_float2(1, 0) },
};
Shared::Triangle triangles[] = {
{ 0, 1, 2 }, { 0, 2, 3 },
};
areaLight.vertexBuffer.initialize(cuContext, cudau::BufferType::Device, vertices, lengthof(vertices));
Mesh::Group group;
group.triangleBuffer.initialize(cuContext, cudau::BufferType::Device, triangles, lengthof(triangles));
geomInfos.push_back("Area Light");
Shared::GeometryData geomData = {};
geomData.vertexBuffer = areaLight.vertexBuffer.getDevicePointer();
geomData.triangleBuffer = group.triangleBuffer.getDevicePointer();
geomData.geomID = geomID++;
group.optixGeomInst = scene.createGeometryInstance();
group.optixGeomInst.setVertexBuffer(areaLight.vertexBuffer);
group.optixGeomInst.setTriangleBuffer(group.triangleBuffer);
group.optixGeomInst.setNumMaterials(1, optixu::BufferView());
group.optixGeomInst.setMaterial(0, 0, areaLightMat);
group.optixGeomInst.setGeometryFlags(0, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setUserData(geomData);
areaLight.groups.push_back(std::move(group));
}
Mesh bunny;
{
std::vector<Shared::Vertex> vertices;
std::vector<Shared::Triangle> triangles;
{
std::vector<obj::Vertex> objVertices;
std::vector<obj::Triangle> objTriangles;
obj::load("../../data/stanford_bunny_309_faces.obj", &objVertices, &objTriangles);
vertices.resize(objVertices.size());
for (int vIdx = 0; vIdx < objVertices.size(); ++vIdx) {
const obj::Vertex &objVertex = objVertices[vIdx];
vertices[vIdx] = Shared::Vertex{ objVertex.position, objVertex.normal, objVertex.texCoord };
}
static_assert(sizeof(Shared::Triangle) == sizeof(obj::Triangle),
"Assume triangle formats are the same.");
triangles.resize(objTriangles.size());
std::copy_n(reinterpret_cast<Shared::Triangle*>(objTriangles.data()),
triangles.size(),
triangles.data());
}
bunny.vertexBuffer.initialize(cuContext, cudau::BufferType::Device, vertices);
Mesh::Group group;
group.triangleBuffer.initialize(cuContext, cudau::BufferType::Device, triangles);
geomInfos.push_back("Bunny");
Shared::GeometryData geomData = {};
geomData.vertexBuffer = bunny.vertexBuffer.getDevicePointer();
geomData.triangleBuffer = group.triangleBuffer.getDevicePointer();
geomData.geomID = geomID++;
group.optixGeomInst = scene.createGeometryInstance();
group.optixGeomInst.setVertexBuffer(bunny.vertexBuffer);
group.optixGeomInst.setTriangleBuffer(group.triangleBuffer);
group.optixGeomInst.setNumMaterials(1, optixu::BufferView());
for (int matSetIdx = 0; matSetIdx < NumBunnies; ++matSetIdx)
group.optixGeomInst.setMaterial(matSetIdx, 0, bunnyMats[matSetIdx]);
group.optixGeomInst.setGeometryFlags(0, OPTIX_GEOMETRY_FLAG_NONE);
group.optixGeomInst.setUserData(geomData);
bunny.groups.push_back(std::move(group));
}
GeometryGroup roomGroup;
{
gasInfos.push_back("Room");
Shared::GASData gasData = {};
gasData.gasID = gasID++;
roomGroup.optixGas = scene.createGeometryAccelerationStructure();
roomGroup.optixGas.setConfiguration(optixu::ASTradeoff::PreferFastTrace, false, true, false);
roomGroup.optixGas.setNumMaterialSets(1);
roomGroup.optixGas.setNumRayTypes(0, maxNumRayTypes);
for (auto it = room.groups.cbegin(); it != room.groups.cend(); ++it)
roomGroup.optixGas.addChild(it->optixGeomInst);
for (auto it = areaLight.groups.cbegin(); it != areaLight.groups.cend(); ++it)
roomGroup.optixGas.addChild(it->optixGeomInst);
Shared::GASChildData childData = {};
childData.gasChildID = 0;
for (int i = 0; i < roomGroup.optixGas.getNumChildren(); ++i) {
roomGroup.optixGas.setChildUserData(childData.gasChildID, childData);
++childData.gasChildID;
}
roomGroup.optixGas.prepareForBuild(&asMemReqs);
roomGroup.optixGas.setUserData(gasData);
roomGroup.gasMem.initialize(cuContext, cudau::BufferType::Device, asMemReqs.outputSizeInBytes, 1);
maxSizeOfScratchBuffer = std::max(maxSizeOfScratchBuffer, asMemReqs.tempSizeInBytes);
}
GeometryGroup bunnyGroup;
{
gasInfos.push_back("Bunny");
Shared::GASData gasData = {};
gasData.gasID = gasID++;
bunnyGroup.optixGas = scene.createGeometryAccelerationStructure();
bunnyGroup.optixGas.setConfiguration(optixu::ASTradeoff::PreferFastTrace, false, true, false);
bunnyGroup.optixGas.setNumMaterialSets(NumBunnies);
for (int matSetIdx = 0; matSetIdx < NumBunnies; ++matSetIdx)
bunnyGroup.optixGas.setNumRayTypes(matSetIdx, maxNumRayTypes);
for (auto it = bunny.groups.cbegin(); it != bunny.groups.cend(); ++it)
bunnyGroup.optixGas.addChild(it->optixGeomInst);
Shared::GASChildData childData = {};
childData.gasChildID = 0;
for (int i = 0; i < bunnyGroup.optixGas.getNumChildren(); ++i) {
bunnyGroup.optixGas.setChildUserData(childData.gasChildID, childData);
++childData.gasChildID;
}
bunnyGroup.optixGas.prepareForBuild(&asMemReqs);
bunnyGroup.optixGas.setUserData(gasData);
bunnyGroup.gasMem.initialize(cuContext, cudau::BufferType::Device, asMemReqs.outputSizeInBytes, 1);
maxSizeOfScratchBuffer = std::max(maxSizeOfScratchBuffer, asMemReqs.tempSizeInBytes);
}
std::vector<std::string> instInfos;
uint32_t instID = 0;
// JP: GASを元にインスタンスを作成する。
// EN: Create instances based on GASs.
instInfos.push_back("Room");
optixu::Instance roomInst = scene.createInstance();
roomInst.setChild(roomGroup.optixGas);
roomInst.setID(instID++);
std::vector<optixu::Instance> bunnyInsts;
const float GoldenRatio = (1 + std::sqrt(5.0f)) / 2;
const float GoldenAngle = 2 * M_PI / (GoldenRatio * GoldenRatio);
for (int i = 0; i < NumBunnies; ++i) {
float t = static_cast<float>(i) / (NumBunnies - 1);
float r = 0.9f * std::pow(t, 0.5f);
float x = r * std::cos(GoldenAngle * i);
float z = r * std::sin(GoldenAngle * i);
char str[256];
snprintf(str, sizeof(str), "Bunny %u", i);
instInfos.push_back(str);
float tt = std::pow(t, 0.25f);
float scale = (1 - tt) * 0.006f + tt * 0.003f;
float bunnyInstXfm[] = {
scale, 0, 0, x,
0, scale, 0, -1 + (1 - tt),
0, 0, scale, z
};
optixu::Instance bunnyInst = scene.createInstance();
bunnyInst.setChild(bunnyGroup.optixGas, i);
bunnyInst.setTransform(bunnyInstXfm);
bunnyInst.setID(instID++);
bunnyInsts.push_back(bunnyInst);
}
// JP: Instance Acceleration Structureを生成する。
// EN: Create an instance acceleration structure.
optixu::InstanceAccelerationStructure ias = scene.createInstanceAccelerationStructure();
cudau::Buffer iasMem;
cudau::TypedBuffer<OptixInstance> instanceBuffer;
ias.setConfiguration(optixu::ASTradeoff::PreferFastTrace, false, false, false);
ias.addChild(roomInst);
for (int i = 0; i < bunnyInsts.size(); ++i)
ias.addChild(bunnyInsts[i]);
ias.prepareForBuild(&asMemReqs);
iasMem.initialize(cuContext, cudau::BufferType::Device, asMemReqs.outputSizeInBytes, 1);
instanceBuffer.initialize(cuContext, cudau::BufferType::Device, ias.getNumChildren());
maxSizeOfScratchBuffer = std::max(maxSizeOfScratchBuffer, asMemReqs.tempSizeInBytes);
// JP: ASビルド用のスクラッチメモリを確保する。
// EN: Allocate scratch memory for AS builds.
asBuildScratchMem.initialize(cuContext, cudau::BufferType::Device, maxSizeOfScratchBuffer, 1);
// JP: Mesh Acceleration Structureをビルドする。
// EN: Build geometry acceleration structures.
roomGroup.optixGas.rebuild(cuStream, roomGroup.gasMem, asBuildScratchMem);
bunnyGroup.optixGas.rebuild(cuStream, bunnyGroup.gasMem, asBuildScratchMem);
// JP: 静的なメッシュはコンパクションもしておく。
// 複数のメッシュのASをひとつのバッファーに詰めて記録する。
// EN: Perform compaction for static meshes.
// Record ASs of multiple meshes into single buffer back to back.
struct CompactedASInfo {
GeometryGroup* geomGroup;
size_t offset;
size_t size;
};
CompactedASInfo gasList[] = {
{ &roomGroup, 0, 0 },
{ &bunnyGroup, 0, 0 }
};
size_t compactedASMemOffset = 0;
for (int i = 0; i < lengthof(gasList); ++i) {
CompactedASInfo &info = gasList[i];
compactedASMemOffset = alignUp(compactedASMemOffset, OPTIX_ACCEL_BUFFER_BYTE_ALIGNMENT);
info.offset = compactedASMemOffset;
info.geomGroup->optixGas.prepareForCompact(&info.size);
compactedASMemOffset += info.size;
}
cudau::Buffer compactedASMem;
compactedASMem.initialize(cuContext, cudau::BufferType::Device, compactedASMemOffset, 1);
for (int i = 0; i < lengthof(gasList); ++i) {
const CompactedASInfo &info = gasList[i];
info.geomGroup->optixGas.compact(cuStream, optixu::BufferView(compactedASMem.getCUdeviceptr() + info.offset,
info.size, 1));
}
// JP: removeUncompacted()はcompact()がデバイス上で完了するまでホスト側で待つので呼び出しを分けたほうが良い。
// EN: removeUncompacted() waits on host-side until the compact() completes on the device,
// so separating calls is recommended.
for (int i = 0; i < lengthof(gasList); ++i) {
gasList[i].geomGroup->optixGas.removeUncompacted();
gasList[i].geomGroup->gasMem.finalize();
}
// JP: IASビルド時には各インスタンスのTraversable HandleとShader Binding Table中のオフセットが
// 確定している必要がある。
// EN: Traversable handle and offset in the shader binding table must be fixed for each instance
// when building an IAS.
size_t hitGroupSbtSize;
scene.generateShaderBindingTableLayout(&hitGroupSbtSize);
pickPipeline.hitGroupShaderBindingTable.initialize(cuContext, cudau::BufferType::Device, hitGroupSbtSize, 1);
pickPipeline.hitGroupShaderBindingTable.setMappedMemoryPersistent(true);
renderPipeline.hitGroupShaderBindingTable.initialize(cuContext, cudau::BufferType::Device, hitGroupSbtSize, 1);
renderPipeline.hitGroupShaderBindingTable.setMappedMemoryPersistent(true);
OptixTraversableHandle travHandle = ias.rebuild(cuStream, instanceBuffer, iasMem, asBuildScratchMem);
CUDADRV_CHECK(cuStreamSynchronize(cuStream));
// END: Setup a scene.
// ----------------------------------------------------------------
// JP: OpenGL用バッファーオブジェクトからCUDAバッファーを生成する。
// EN: Create a CUDA buffer from an OpenGL buffer instObject0.
glu::Texture2D outputTexture;
cudau::Array outputArray;
cudau::InteropSurfaceObjectHolder<2> outputBufferSurfaceHolder;
outputTexture.initialize(GL_RGBA32F, renderTargetSizeX, renderTargetSizeY, 1);
outputArray.initializeFromGLTexture2D(cuContext, outputTexture.getHandle(),
cudau::ArraySurface::Enable, cudau::ArrayTextureGather::Disable);
outputBufferSurfaceHolder.initialize(&outputArray);
glu::Sampler outputSampler;
outputSampler.initialize(glu::Sampler::MinFilter::Nearest, glu::Sampler::MagFilter::Nearest,
glu::Sampler::WrapMode::Repeat, glu::Sampler::WrapMode::Repeat);
// JP: フルスクリーンクアッド(or 三角形)用の空のVAO。
// EN: Empty VAO for full screen qud (or triangle).
glu::VertexArray vertexArrayForFullScreen;
vertexArrayForFullScreen.initialize();
// JP: OptiXの結果をフレームバッファーにコピーするシェーダー。
// EN: Shader to copy OptiX result to a frame buffer.
glu::GraphicsProgram drawOptiXResultShader;
drawOptiXResultShader.initializeVSPS(readTxtFile(exeDir / "pick/shaders/drawOptiXResult.vert"),
readTxtFile(exeDir / "pick/shaders/drawOptiXResult.frag"));
Shared::PerspectiveCamera perspCamera;
perspCamera.fovY = 50 * M_PI / 180;
perspCamera.aspect = (float)renderTargetSizeX / renderTargetSizeY;
Shared::EquirectangularCamera equirecCamera;
equirecCamera.horizentalExtent = M_PI * (float)renderTargetSizeX / renderTargetSizeY;
equirecCamera.verticalExtent = M_PI;
Shared::PickPipelineLaunchParameters pickPlp;
pickPlp.travHandle = travHandle;
pickPlp.imageSize = int2(renderTargetSizeX, renderTargetSizeY);
pickPlp.perspCamera = perspCamera;
pickPlp.equirecCamera = equirecCamera;
Shared::RenderPipelineLaunchParameters renderPlp;
renderPlp.travHandle = travHandle;
renderPlp.imageSize = int2(renderTargetSizeX, renderTargetSizeY);
renderPlp.perspCamera = perspCamera;
renderPlp.equirecCamera = equirecCamera;
renderPlp.colorInterp = 0.1f;
cudau::TypedBuffer<Shared::PickInfo> pickInfos[2];
for (int i = 0; i < lengthof(pickInfos); ++i) {
pickInfos[i].initialize(cuContext, cudau::BufferType::Device, 1);
pickInfos[i].setMappedMemoryPersistent(true);
auto value = pickInfos[i].map();
*value = {};
pickInfos[i].unmap();
}
pickPipeline.pipeline.setScene(scene);
pickPipeline.pipeline.setHitGroupShaderBindingTable(pickPipeline.hitGroupShaderBindingTable,
pickPipeline.hitGroupShaderBindingTable.getMappedPointer());
renderPipeline.pipeline.setScene(scene);
renderPipeline.pipeline.setHitGroupShaderBindingTable(renderPipeline.hitGroupShaderBindingTable,
renderPipeline.hitGroupShaderBindingTable.getMappedPointer());
CUdeviceptr pickPlpOnDevice;
CUDADRV_CHECK(cuMemAlloc(&pickPlpOnDevice, sizeof(pickPlp)));
CUdeviceptr renderPlpOnDevice;
CUDADRV_CHECK(cuMemAlloc(&renderPlpOnDevice, sizeof(renderPlp)));
pickPipeline.pipeline.setRayGenerationProgram(pickPipeline.rayGenPrograms.at("perspective"));
renderPipeline.pipeline.setRayGenerationProgram(renderPipeline.rayGenPrograms.at("perspective"));
enum class CameraType {
Perspective = 0,
Equirectangular,
};
CameraType cameraType = CameraType::Perspective;
uint64_t frameIndex = 0;
glfwSetWindowUserPointer(window, &frameIndex);
int32_t requestedSize[2];
while (true) {
uint32_t bufferIndex = frameIndex % 2;
cudau::TypedBuffer<Shared::PickInfo> &curPickInfo = pickInfos[bufferIndex];
if (glfwWindowShouldClose(window))
break;
glfwPollEvents();
bool resized = false;
int32_t newFBWidth;
int32_t newFBHeight;
glfwGetFramebufferSize(window, &newFBWidth, &newFBHeight);
if (newFBWidth != curFBWidth || newFBHeight != curFBHeight) {
curFBWidth = newFBWidth;
curFBHeight = newFBHeight;
renderTargetSizeX = curFBWidth / UIScaling;
renderTargetSizeY = curFBHeight / UIScaling;
requestedSize[0] = renderTargetSizeX;
requestedSize[1] = renderTargetSizeY;
outputTexture.finalize();
outputTexture.initialize(GL_RGBA32F, renderTargetSizeX, renderTargetSizeY, 1);
outputArray.finalize();
outputArray.initializeFromGLTexture2D(cuContext, outputTexture.getHandle(),
cudau::ArraySurface::Enable, cudau::ArrayTextureGather::Disable);
outputArray.resize(renderTargetSizeX, renderTargetSizeY);
// EN: update the pipeline parameters.
perspCamera.aspect = (float)renderTargetSizeX / renderTargetSizeY;
equirecCamera.horizentalExtent = M_PI * (float)renderTargetSizeX / renderTargetSizeY;
equirecCamera.verticalExtent = M_PI;
pickPlp.imageSize = int2(renderTargetSizeX, renderTargetSizeY);
pickPlp.perspCamera = perspCamera;
pickPlp.equirecCamera = equirecCamera;
renderPlp.imageSize = int2(renderTargetSizeX, renderTargetSizeY);
renderPlp.perspCamera = perspCamera;
renderPlp.equirecCamera = equirecCamera;
resized = true;
}
ImGui_ImplOpenGL3_NewFrame();
ImGui_ImplGlfw_NewFrame();
if (takeScreenShot) { // Fix mouse position input for the test.
g_mouseX = 400;
g_mouseY = 360;
}
ImGui::NewFrame();
bool operatingCamera;
bool cameraIsActuallyMoving;
static bool operatedCameraOnPrevFrame = false;
{
const auto decideDirection = [](const KeyState& a, const KeyState& b) {
int32_t dir = 0;
if (a.getState() == true) {
if (b.getState() == true)
dir = 0;
else
dir = 1;
}
else {
if (b.getState() == true)
dir = -1;
else
dir = 0;
}
return dir;
};
int32_t trackZ = decideDirection(g_keyForward, g_keyBackward);
int32_t trackX = decideDirection(g_keyLeftward, g_keyRightward);
int32_t trackY = decideDirection(g_keyUpward, g_keyDownward);
int32_t tiltZ = decideDirection(g_keyTiltRight, g_keyTiltLeft);
int32_t adjustPosMoveSpeed = decideDirection(g_keyFasterPosMovSpeed, g_keySlowerPosMovSpeed);
g_cameraPositionalMovingSpeed *= 1.0f + 0.02f * adjustPosMoveSpeed;
g_cameraPositionalMovingSpeed = std::clamp(g_cameraPositionalMovingSpeed, 1e-6f, 1e+6f);
static double deltaX = 0, deltaY = 0;
static double lastX, lastY;
static double g_prevMouseX = g_mouseX, g_prevMouseY = g_mouseY;
if (g_buttonRotate.getState() == true) {
if (g_buttonRotate.getTime() == frameIndex) {
lastX = g_mouseX;
lastY = g_mouseY;
}
else {
deltaX = g_mouseX - lastX;
deltaY = g_mouseY - lastY;
}
}
float deltaAngle = std::sqrt(deltaX * deltaX + deltaY * deltaY);
float3 axis = make_float3(deltaY, -deltaX, 0);
axis /= deltaAngle;
if (deltaAngle == 0.0f)
axis = make_float3(1, 0, 0);
g_cameraOrientation = g_cameraOrientation * qRotateZ(g_cameraTiltSpeed * tiltZ);
g_tempCameraOrientation = g_cameraOrientation * qRotate(g_cameraDirectionalMovingSpeed * deltaAngle, axis);
g_cameraPosition += g_tempCameraOrientation.toMatrix3x3() * (g_cameraPositionalMovingSpeed * make_float3(trackX, trackY, trackZ));
if (g_buttonRotate.getState() == false && g_buttonRotate.getTime() == frameIndex) {
g_cameraOrientation = g_tempCameraOrientation;
deltaX = 0;
deltaY = 0;
}
operatingCamera = (g_keyForward.getState() || g_keyBackward.getState() ||
g_keyLeftward.getState() || g_keyRightward.getState() ||
g_keyUpward.getState() || g_keyDownward.getState() ||
g_keyTiltLeft.getState() || g_keyTiltRight.getState() ||
g_buttonRotate.getState());
cameraIsActuallyMoving = (trackZ != 0 || trackX != 0 || trackY != 0 ||
tiltZ != 0 || (g_mouseX != g_prevMouseX) || (g_mouseY != g_prevMouseY))
&& operatingCamera;
g_prevMouseX = g_mouseX;
g_prevMouseY = g_mouseY;
}
{
ImGui::Begin("Camera & Rendering", nullptr, ImGuiWindowFlags_AlwaysAutoResize);
ImGui::Text("W/A/S/D/R/F: Move, Q/E: Tilt");
ImGui::Text("Mouse Middle Drag: Rotate");
ImGui::InputFloat3("Position", reinterpret_cast<float*>(&g_cameraPosition));
static float rollPitchYaw[3];
g_tempCameraOrientation.toEulerAngles(&rollPitchYaw[0], &rollPitchYaw[1], &rollPitchYaw[2]);
rollPitchYaw[0] *= 180 / M_PI;
rollPitchYaw[1] *= 180 / M_PI;
rollPitchYaw[2] *= 180 / M_PI;
if (ImGui::InputFloat3("Roll/Pitch/Yaw", rollPitchYaw, 3))
g_cameraOrientation = qFromEulerAngles(rollPitchYaw[0] * M_PI / 180,
rollPitchYaw[1] * M_PI / 180,
rollPitchYaw[2] * M_PI / 180);
ImGui::Text("Pos. Speed (T/G): %g", g_cameraPositionalMovingSpeed);
if (ImGui::RadioButtonE("Perspective", &cameraType, CameraType::Perspective)) {
pickPipeline.pipeline.setRayGenerationProgram(pickPipeline.rayGenPrograms.at("perspective"));
renderPipeline.pipeline.setRayGenerationProgram(renderPipeline.rayGenPrograms.at("perspective"));
}
if (ImGui::RadioButtonE("Equirectangular", &cameraType, CameraType::Equirectangular)) {
pickPipeline.pipeline.setRayGenerationProgram(pickPipeline.rayGenPrograms.at("equirectangular"));
renderPipeline.pipeline.setRayGenerationProgram(renderPipeline.rayGenPrograms.at("equirectangular"));
}
ImGui::Separator();
ImGui::SliderFloat("Material <-> Normal", &renderPlp.colorInterp, 0.0f, 1.0f);
ImGui::End();
}
{
const auto helpMarker = [](const char* desc) {
ImGui::TextDisabled("(?)");
if (ImGui::IsItemHovered()) {
ImGui::BeginTooltip();
ImGui::PushTextWrapPos(ImGui::GetFontSize() * 35.0f);
ImGui::TextUnformatted(desc);
ImGui::PopTextWrapPos();
ImGui::EndTooltip();
}
};
Shared::PickInfo pickInfo = curPickInfo.map()[0];
curPickInfo.unmap();
char instIndexStr[32], matIndexStr[32], primIndexStr[32];
char instIDStr[32], gasIDStr[32], gasChildIDStr[32], geomIDStr[32], matIDStr[32];
char instNameStr[64], gasNameStr[64], geomNameStr[64], matNameStr[64];
if (pickInfo.hit) {
snprintf(instIndexStr, sizeof(instIndexStr), "%3u", pickInfo.instanceIndex);
snprintf(matIndexStr, sizeof(matIndexStr), "%3u", pickInfo.matIndex);
snprintf(primIndexStr, sizeof(primIndexStr), "%3u", pickInfo.primIndex);
snprintf(instIDStr, sizeof(instIDStr), "%3u", pickInfo.instanceID);
snprintf(gasIDStr, sizeof(gasIDStr), "%3u", pickInfo.gasID);
snprintf(gasChildIDStr, sizeof(gasChildIDStr), "%3u", pickInfo.gasChildID);
snprintf(geomIDStr, sizeof(geomIDStr), "%3u", pickInfo.geomID);
snprintf(matIDStr, sizeof(matIDStr), "%3u", pickInfo.matID);
snprintf(instNameStr, sizeof(instNameStr), "%s", instInfos[pickInfo.instanceID].c_str());
snprintf(gasNameStr, sizeof(gasNameStr), "%s", gasInfos[pickInfo.gasID].c_str());
snprintf(geomNameStr, sizeof(geomNameStr), "%s", geomInfos[pickInfo.geomID].c_str());
snprintf(matNameStr, sizeof(matNameStr), "%s", matInfos[pickInfo.matID].c_str());
}
else {
snprintf(instIndexStr, sizeof(instIndexStr), "N/A");
snprintf(matIndexStr, sizeof(matIndexStr), "N/A");
snprintf(primIndexStr, sizeof(primIndexStr), "N/A");
snprintf(instIDStr, sizeof(instIDStr), "N/A");
snprintf(gasIDStr, sizeof(gasIDStr), "N/A");
snprintf(gasChildIDStr, sizeof(gasChildIDStr), "N/A");
snprintf(geomIDStr, sizeof(geomIDStr), "N/A");
snprintf(matIDStr, sizeof(matIDStr), "N/A");
snprintf(instNameStr, sizeof(instNameStr), "N/A");
snprintf(gasNameStr, sizeof(gasNameStr), "N/A");
snprintf(geomNameStr, sizeof(geomNameStr), "N/A");
snprintf(matNameStr, sizeof(matNameStr), "N/A");
}
ImGui::Begin("Pick Info", nullptr, ImGuiWindowFlags_AlwaysAutoResize);
ImGui::Text("Mouse: %d, %d", static_cast<int32_t>(g_mouseX), static_cast<int32_t>(g_mouseY));
ImGui::Separator();
ImGui::Text("System Values:");
helpMarker("Instance index in an IAS"); ImGui::SameLine();
ImGui::Text(" Instance Index: %s", instIndexStr);
helpMarker("Material index in a GAS"); ImGui::SameLine();
ImGui::Text(" Material Index: %s", matIndexStr);
helpMarker("Primitive index in a geometry"); ImGui::SameLine();
ImGui::Text("Primitive Index: %s", primIndexStr);
ImGui::Separator();
ImGui::Text("User Data:");
helpMarker("via Instance::setID()"); ImGui::SameLine();
ImGui::Text(" Instance: %s, Name: %s", instIDStr, instNameStr);
helpMarker("via GeometryAccelerationStructure::setUserData()"); ImGui::SameLine();
ImGui::Text(" GAS: %s, Name: %s", gasIDStr, gasNameStr);
helpMarker("via GeometryAccelerationStructure::setChildUserData()"); ImGui::SameLine();
ImGui::Text("GAS Child: %s", gasChildIDStr);
helpMarker("via GeometryInstance::setUserData()"); ImGui::SameLine();
ImGui::Text(" Geometry: %s, Name: %s", geomIDStr, geomNameStr);
helpMarker("via Material::setUserData()"); ImGui::SameLine();
ImGui::Text(" Material: %s, Name: %s", matIDStr, matNameStr);
ImGui::End();
}
Matrix3x3 oriMat = g_tempCameraOrientation.toMatrix3x3();
// Pick
pickPlp.position = g_cameraPosition;
pickPlp.orientation = oriMat;
pickPlp.mousePosition = int2(static_cast<int32_t>(g_mouseX),
static_cast<int32_t>(g_mouseY));
pickPlp.pickInfo = curPickInfo.getDevicePointer();
CUDADRV_CHECK(cuMemcpyHtoDAsync(pickPlpOnDevice, &pickPlp, sizeof(pickPlp), cuStream));
pickPipeline.pipeline.launch(cuStream, pickPlpOnDevice, 1, 1, 1);
// Render
outputBufferSurfaceHolder.beginCUDAAccess(cuStream);
renderPlp.position = g_cameraPosition;
renderPlp.orientation = oriMat;
renderPlp.pickInfo = curPickInfo.getDevicePointer();
renderPlp.resultBuffer = outputBufferSurfaceHolder.getNext();
CUDADRV_CHECK(cuMemcpyHtoDAsync(renderPlpOnDevice, &renderPlp, sizeof(renderPlp), cuStream));
renderPipeline.pipeline.launch(cuStream, renderPlpOnDevice, renderTargetSizeX, renderTargetSizeY, 1);
outputBufferSurfaceHolder.endCUDAAccess(cuStream);
if (takeScreenShot && frameIndex + 1 == 60) {
CUDADRV_CHECK(cuStreamSynchronize(cuStream));
auto rawImage = new float4[renderTargetSizeX * renderTargetSizeY];
glGetTextureSubImage(
outputTexture.getHandle(), 0,
0, 0, 0, renderTargetSizeX, renderTargetSizeY, 1,
GL_RGBA, GL_FLOAT, sizeof(float4) * renderTargetSizeX * renderTargetSizeY, rawImage);
saveImage("output.png", renderTargetSizeX, renderTargetSizeY, rawImage,
false, false);
delete[] rawImage;
break;
}
// ----------------------------------------------------------------
// JP: OptiXによる描画結果を表示用レンダーターゲットにコピーする。
// EN: Copy the OptiX rendering results to the display render target.
glViewport(0, 0, curFBWidth, curFBHeight);
glUseProgram(drawOptiXResultShader.getHandle());
glUniform2ui(0, curFBWidth, curFBHeight);
glBindTextureUnit(0, outputTexture.getHandle());
glBindSampler(0, outputSampler.getHandle());
glBindVertexArray(vertexArrayForFullScreen.getHandle());
glDrawArrays(GL_TRIANGLES, 0, 3);
ImGui::Render();
ImGui_ImplOpenGL3_RenderDrawData(ImGui::GetDrawData());
// END: Copy the OptiX rendering results to the display render target.
// ----------------------------------------------------------------
glfwSwapBuffers(window);
++frameIndex;
}
CUDADRV_CHECK(cuStreamSynchronize(cuStream));
CUDADRV_CHECK(cuMemFree(renderPlpOnDevice));
CUDADRV_CHECK(cuMemFree(pickPlpOnDevice));
for (int i = lengthof(pickInfos) - 1; i >= 0; --i)
pickInfos[i].finalize();
drawOptiXResultShader.finalize();
vertexArrayForFullScreen.finalize();
outputSampler.finalize();
outputBufferSurfaceHolder.finalize();
outputArray.finalize();
outputTexture.finalize();
compactedASMem.finalize();
asBuildScratchMem.finalize();
instanceBuffer.finalize();
iasMem.finalize();
ias.destroy();
for (int i = bunnyInsts.size() - 1; i >= 0; --i)
bunnyInsts[i].destroy();
roomInst.destroy();
bunnyGroup.finalize();
roomGroup.finalize();
bunny.finalize();
areaLight.finalize();
room.finalize();
scene.destroy();
for (int i = NumBunnies - 1; i >= 0; --i)
bunnyMats[i].destroy();
areaLightMat.destroy();
floorMat.destroy();
rightWallMat.destroy();
leftWallMat.destroy();
farSideWallMat.destroy();
ceilingMat.destroy();
renderPipeline.finalize();
pickPipeline.finalize();
optixContext.destroy();
CUDADRV_CHECK(cuStreamDestroy(cuStream));
CUDADRV_CHECK(cuCtxDestroy(cuContext));
ImGui_ImplOpenGL3_Shutdown();
ImGui_ImplGlfw_Shutdown();
ImGui::DestroyContext();
glfwDestroyWindow(window);
glfwTerminate();
return 0;
}
catch (const std::exception &ex) {
hpprintf("Error: %s\n", ex.what());
return -1;
}
| 41.073967 | 142 | 0.633093 | shocker-0x15 |
c1f373a26afd23a6c57cd671712c304a57fec586 | 3,495 | cc | C++ | test/lgf_test.cc | ucr-ufluidics/lemon | a8eb83f0cec960d1abb2696f5c635ce4a18c5cdc | [
"BSL-1.0"
] | null | null | null | test/lgf_test.cc | ucr-ufluidics/lemon | a8eb83f0cec960d1abb2696f5c635ce4a18c5cdc | [
"BSL-1.0"
] | null | null | null | test/lgf_test.cc | ucr-ufluidics/lemon | a8eb83f0cec960d1abb2696f5c635ce4a18c5cdc | [
"BSL-1.0"
] | null | null | null | /* -*- mode: C++; indent-tabs-mode: nil; -*-
*
* This file is a part of LEMON, a generic C++ optimization library.
*
* Copyright (C) 2003-2011
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
* Permission to use, modify and distribute this software is granted
* provided that this copyright notice appears in all copies. For
* precise terms see the accompanying LICENSE file.
*
* This software is provided "AS IS" with no warranty of any kind,
* express or implied, and with no claim as to its suitability for any
* purpose.
*
*/
#include <lemon/list_graph.h>
#include <lemon/lgf_reader.h>
#include "test_tools.h"
using namespace lemon;
char test_lgf[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" label\n"
"0 1 0\n"
"1 0 1\n"
"@attributes\n"
"source 0\n"
"target 1\n";
char test_lgf_nomap[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" -\n"
"0 1\n";
char test_lgf_bad1[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" - another\n"
"0 1\n";
char test_lgf_bad2[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" label -\n"
"0 1\n";
int main()
{
{
ListDigraph d;
ListDigraph::Node s,t;
ListDigraph::ArcMap<int> label(d);
std::istringstream input(test_lgf);
digraphReader(d, input).
node("source", s).
node("target", t).
arcMap("label", label).
run();
check(countNodes(d) == 2,"There should be 2 nodes");
check(countArcs(d) == 2,"There should be 2 arcs");
}
{
ListGraph g;
ListGraph::Node s,t;
ListGraph::EdgeMap<int> label(g);
std::istringstream input(test_lgf);
graphReader(g, input).
node("source", s).
node("target", t).
edgeMap("label", label).
run();
check(countNodes(g) == 2,"There should be 2 nodes");
check(countEdges(g) == 2,"There should be 2 arcs");
}
{
ListDigraph d;
std::istringstream input(test_lgf_nomap);
digraphReader(d, input).
run();
check(countNodes(d) == 2,"There should be 2 nodes");
check(countArcs(d) == 1,"There should be 1 arc");
}
{
ListGraph g;
std::istringstream input(test_lgf_nomap);
graphReader(g, input).
run();
check(countNodes(g) == 2,"There should be 2 nodes");
check(countEdges(g) == 1,"There should be 1 edge");
}
{
ListDigraph d;
std::istringstream input(test_lgf_bad1);
bool ok=false;
try {
digraphReader(d, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
{
ListGraph g;
std::istringstream input(test_lgf_bad1);
bool ok=false;
try {
graphReader(g, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
{
ListDigraph d;
std::istringstream input(test_lgf_bad2);
bool ok=false;
try {
digraphReader(d, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
{
ListGraph g;
std::istringstream input(test_lgf_bad2);
bool ok=false;
try {
graphReader(g, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
}
| 20.558824 | 70 | 0.583119 | ucr-ufluidics |
c1f4a92b026d6d6e8ada2733bca991f82310f2ec | 1,524 | cpp | C++ | source/Visitors/YFieldUpdater.cpp | badbrainz/pme | 1c8e6f3d154cc59613f5ef3f2f8293f488c64b28 | [
"WTFPL"
] | null | null | null | source/Visitors/YFieldUpdater.cpp | badbrainz/pme | 1c8e6f3d154cc59613f5ef3f2f8293f488c64b28 | [
"WTFPL"
] | null | null | null | source/Visitors/YFieldUpdater.cpp | badbrainz/pme | 1c8e6f3d154cc59613f5ef3f2f8293f488c64b28 | [
"WTFPL"
] | null | null | null | #include "YFieldUpdater.h"
#include "../Databases/TerrainDatabase.h"
#include "../Factories/TerrainVisuals.h"
#include "../Nodes/SpatialIndexNode.h"
#include "../Nodes/SpatialIndexCell.h"
#include "../Nodes/TransformGroupNode.h"
//#include "../Nodes/StaticModelNode.h"
#include "../Tools/NodeIterator.h"
#include "../Controllers/TileController.h"
#include "../Controllers/ModelController.h"
#include "../Geometry/Ray3D.h"
#include "../Math/Intersector.h"
#include "../Kernel/Gateway.h"
YFieldUpdater::YFieldUpdater()
{
}
void YFieldUpdater::visit(SpatialIndexCell *cell)
{
NodeIterator iter(cell->getFirstChild());
while (!iter.end())
{
iter.current()->accept(this);
iter++;
}
}
void YFieldUpdater::visit(TransformGroupNode *node)
{
TileController* tcontroller;
ModelController* mcontroller;
Intersector intersector;
Ray3D ray;
Tuple4f packet;
Tuple3f position;
mcontroller = node->getController();
if (mcontroller)
{
position = mcontroller->getPosition();
tcontroller = Gateway::getTerrainDatabase()->getController(Tuple2f(position.x, position.z));
if (tcontroller)
{
ray.setOrigin(Tuple3f(position.x, 1000, position.z));
ray.setDestination(Tuple3f(position.x, -1000, position.z));
packet = intersector.intersectTriangles(&ray, tcontroller->getVertices(), Gateway::getTerrainVisuals()->getTileIndices(0), 8);
mcontroller->translateModel(packet.x, packet.y + 0.05f, packet.z);
}
}
}
| 28.754717 | 133 | 0.685039 | badbrainz |
c1f7e05288ca5bd0b0a37a970ca9c17305a5a66f | 277 | cpp | C++ | BaekJoon/19939.cpp | falconlee236/Algorithm_Practice | 4e6e380a0e6c840525ca831a05c35253eeaaa25c | [
"MIT"
] | null | null | null | BaekJoon/19939.cpp | falconlee236/Algorithm_Practice | 4e6e380a0e6c840525ca831a05c35253eeaaa25c | [
"MIT"
] | null | null | null | BaekJoon/19939.cpp | falconlee236/Algorithm_Practice | 4e6e380a0e6c840525ca831a05c35253eeaaa25c | [
"MIT"
] | null | null | null | /*19939*/
/*Cheating*/
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
int res = 0;
for(int i = 1; i <= k; i++) res += i;
if(res > n){
cout << -1;
return 0;
}
if((n - res) % k == 0) cout << k - 1;
else cout << k;
return 0;
}
| 14.578947 | 38 | 0.476534 | falconlee236 |
c1f80d607186525bfac275bad1afe8ee1987adb4 | 418 | hpp | C++ | include/ph_concepts/typetraits.hpp | phiwen96/ph_image | 282bdd835d721a561c4f3afcbb76af5f9bda87ba | [
"Apache-2.0"
] | null | null | null | include/ph_concepts/typetraits.hpp | phiwen96/ph_image | 282bdd835d721a561c4f3afcbb76af5f9bda87ba | [
"Apache-2.0"
] | null | null | null | include/ph_concepts/typetraits.hpp | phiwen96/ph_image | 282bdd835d721a561c4f3afcbb76af5f9bda87ba | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "common.hpp"
#include "concepts.hpp"
/**
A C++ type trait is an interface (functions, types, values), parametrized on a type:
Traits class: A class used in place of template parameters. As a class, it aggregates
useful types and constants; as a template, it provides an avenue for that “extra level of
indirection” that solves all software problems.
*/
namespace ph::typetraits
{
}
| 24.588235 | 90 | 0.73445 | phiwen96 |
c1f946d022a27dabfee7d3b9bef7e59a89938a78 | 879 | cpp | C++ | ps6/test.cpp | Siroibma/Comp4 | d873928924d641e4730b6355264f02b9cfd08bb7 | [
"MIT"
] | null | null | null | ps6/test.cpp | Siroibma/Comp4 | d873928924d641e4730b6355264f02b9cfd08bb7 | [
"MIT"
] | null | null | null | ps6/test.cpp | Siroibma/Comp4 | d873928924d641e4730b6355264f02b9cfd08bb7 | [
"MIT"
] | null | null | null | /* Copyright 2020 Ambioris Lora */
#define BOOST_TEST_MODULE BigT
#define BOOST_TEST_DYN_LINK
#include <boost/test/included/unit_test.hpp>
#include "/home/osboxes/ps6/MModel.h"
#include <iostream>
#include <string>
BOOST_AUTO_TEST_CASE(TEST_UNO) {
BOOST_CHECK_NO_THROW(MModel a("abc", 1));
MModel a("abc",2);
BOOST_REQUIRE(a.kOrder() == 2);
}
BOOST_AUTO_TEST_CASE(TEST_DOS) {
MModel b("abc",2);
BOOST_CHECK_THROW(b.kRand(""), MModel);
}
BOOST_AUTO_TEST_CASE(TEST_TRES) {
MModel c("abc",2);
BOOST_REQUIRE(c.freq("bc") == 1);
BOOST_CHECK_NO_THROW(c.kRand(""));
}
BOOST_AUTO_TEST_CASE(TEST_QUATRO) {
MModel d("abc",2);
BOOST_REQUIRE(d.freq("ab",'c') == 1);
}
BOOST_AUTO_TEST_CASE(TEST_CINCO) {
MModel e("abcabc 123123",2);
BOOST_REQUIRE(e.freq("ab") == 2);
}
BOOST_AUTO_TEST_CASE(TEST_FINALE) {
MModel f("abc",2);
BOOST_REQUIRE(f.kOrder() == 2);
}
| 21.975 | 44 | 0.697383 | Siroibma |
c1f9cb7df21f191c33b2b05c900e1f329f85d2b8 | 2,059 | cpp | C++ | 2.cpp | Sherryhaha/LeetCode | 128e344575f8e745b28ff88e6c443b18281ffdc9 | [
"MIT"
] | null | null | null | 2.cpp | Sherryhaha/LeetCode | 128e344575f8e745b28ff88e6c443b18281ffdc9 | [
"MIT"
] | null | null | null | 2.cpp | Sherryhaha/LeetCode | 128e344575f8e745b28ff88e6c443b18281ffdc9 | [
"MIT"
] | null | null | null | //
// Created by sunguoyan on 2017/2/21.
//
#include "LeetCode.h"
//******************************************
// 每个链表以倒序的方式存放一个n位整数，求两个链表的和，以链表形式展现
//******************************************
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
while(l1==NULL && l2==NULL){
return NULL;
}
int sum = 0;
ListNode*root=NULL,*tail=NULL;
while(l1!=NULL | l2!=NULL){
if(l1!=NULL){
sum += l1->val;
l1 = l1->next;
}
if(l2!=NULL){
sum += l2->val;
l2 = l2->next;
}
ListNode*p = new ListNode(sum%10);
if(root==NULL){
root = p;
tail = p;
} else{
tail->next = p;
tail = p;
}
sum = sum/10;
}
if(sum!=0){
ListNode*p = new ListNode(sum%10);
if(root==NULL){
root = p;
tail = p;
} else{
tail->next = p;
tail = p;
}
}
return root;
}
int main(){
int data1[10] = {1,2,3,4,5,6,7,8,9,2};
int data2[10] = {2,3,4,5,6,7,8,9,0,1};
ListNode*l1 = NULL,*l2 = NULL;
ListNode*s1 = new ListNode(data1[0]);
ListNode*s2 = new ListNode(data2[0]);
// ListNode*s1 = NULL;
// ListNode*s2 = NULL;
l1 = s1;
l2 = s2;
//将数组组成链表
for(int i = 1;i< 10;i++){
ListNode*t1 = new ListNode(data1[i]);
ListNode*t2 = new ListNode(data2[i]);
s1->next = t1;
s2->next = t2;
s1 = s1->next;
s2 = s2->next;
}
// for(int i = 0;i<10;i++){
// cout<<l1->val<<" ";
// l1 = l1->next;
// }
// cout<<endl;
// for(int i = 0;i<10;i++){
// cout<<l2->val<<" ";
// l2 = l2->next;
// }
ListNode*result = NULL;
result = addTwoNumbers(l1,l2);
for(int i = 0;result!=NULL;i++){
cout<<result->val<<" ";
result = result->next;
}
return 0;
}
| 21.010204 | 53 | 0.42205 | Sherryhaha |
de03726714c00ca56f3ae49a22264128218867a4 | 2,967 | cpp | C++ | algorithms/tree/visit_tree.cpp | weidonglian/cpp-playground | a7bf348093e4f87ed7aaf970c1d8787671a1ae5f | [
"MIT"
] | 2 | 2019-08-18T19:13:10.000Z | 2020-05-08T11:51:49.000Z | algorithms/tree/visit_tree.cpp | weidonglian/cpp-playground | a7bf348093e4f87ed7aaf970c1d8787671a1ae5f | [
"MIT"
] | null | null | null | algorithms/tree/visit_tree.cpp | weidonglian/cpp-playground | a7bf348093e4f87ed7aaf970c1d8787671a1ae5f | [
"MIT"
] | null | null | null | #include <iostream>
#include "base.hpp"
namespace {
class vt_node {
public:
vt_node(std::string name) : name_(std::move(name)), left_(nullptr), right_(nullptr) {}
~vt_node() {
delete left_;
delete right_;
}
void set_left(vt_node* left) {
delete left_;
left_ = left;
}
vt_node* left() const { return left_; }
void set_right(vt_node* right) {
delete right_;
right_ = right;
}
vt_node* right() const { return right_; }
void insert_bfs(const std::string& name) {
size_t level = 0;
vt_node* node = nullptr;
while (!node) {
visit_bfs(this, level++, [&](vt_node* n) {
if (!node && !n->left_) {
node = new vt_node(name);
n->set_left(node);
}
if (!node && !n->right_) {
node = new vt_node(name);
n->set_right(node);
}
});
}
}
void insert_dfs(const std::string& name) { insert_dfs(this, name); }
void print_bfs() {
size_t level = 0;
size_t print_cnt = 0;
do {
print_cnt = 0;
std::cout << "level_" << level << ": -";
visit_bfs(this, level, [&](vt_node* n) {
++print_cnt;
std::cout << n->name_ << "-";
});
std::cout << std::endl;
level++;
} while (print_cnt);
}
void print_dfs() {
visit_dfs(this, [](vt_node* n) { std::cout << n->name_ << "-"; });
std::cout << std::endl;
}
private:
using node_cb = std::function<void(vt_node*)>;
using node_cb_t = std::function<bool(vt_node*)>;
// visit the tree in depth first search if callback return true
static void insert_dfs(vt_node* root, const std::string& name) {
if (!root) {
return;
}
if (!root->left()) {
root->set_left(new vt_node(name));
return;
}
if (!root->right()) {
root->set_right(new vt_node(name));
return;
}
insert_dfs(root->left(), name);
}
// visit the tree in depth first search
static void visit_dfs(vt_node* root, const node_cb& cb) {
if (!root) {
return;
}
cb(root);
visit_dfs(root->left_, cb);
visit_dfs(root->right_, cb);
}
// visit the tree in breadth first search
static void visit_bfs(vt_node* root, size_t level, const node_cb& cb) {
if (!root) {
return;
}
if (!level) {
cb(root);
} else {
visit_bfs(root->left_, level - 1, cb);
visit_bfs(root->right_, level - 1, cb);
}
}
std::string name_;
vt_node* left_;
vt_node* right_;
};
} // namespace
TEST_CASE("visit_tree_bst", "[tree]") {
auto root = std::make_unique<vt_node>("0");
for (int i = 1; i <= 50; ++i) {
root->insert_bfs(std::to_string(i));
}
// root->print_bfs();
std::cout << std::endl;
}
TEST_CASE("visit_tree_dst", "[tree]") {
auto root = std::make_unique<vt_node>("0");
for (int i = 1; i <= 10; ++i) {
root->insert_dfs(std::to_string(i));
}
// root->print_dfs();
// root->print_bfs();
std::cout << std::endl;
} | 21.5 | 88 | 0.555106 | weidonglian |
de066d1409095c59caabdf0be4a5084f9166af32 | 1,602 | c++ | C++ | 27.12_shortest_distance_between2_nodes.c++ | Sambitcr-7/DSA-C- | f3c80f54fa6160a99f39a934f330cdf40711de50 | [
"Apache-2.0"
] | null | null | null | 27.12_shortest_distance_between2_nodes.c++ | Sambitcr-7/DSA-C- | f3c80f54fa6160a99f39a934f330cdf40711de50 | [
"Apache-2.0"
] | null | null | null | 27.12_shortest_distance_between2_nodes.c++ | Sambitcr-7/DSA-C- | f3c80f54fa6160a99f39a934f330cdf40711de50 | [
"Apache-2.0"
] | null | null | null | #include<iostream>
using namespace std;
struct Node{
int data;
Node * left, *right;
Node(int val){
data = val;
left = NULL;
right = NULL;
}
};
Node * LCA(Node *root , int n1, int n2){
if(root == NULL){
return NULL;
}
if(root->data == n1 || root->data == n2){
return root;
}
Node* left = LCA(root->left, n1, n2);
Node* right = LCA(root->right, n1, n2);
if(left !=NULL && right != NULL){
return root;
}
if(left == NULL && right == NULL){
return NULL;
}
if(left != NULL){
return LCA(root->left, n1 , n2);
}
return LCA(root->right, n1 , n2);
}
int findDist(Node *root , int k , int dist){
if(root == NULL){
return -1;
}
if(root->data ==k){
return dist;
}
int left = findDist(root->left, k, dist+1);
if(left != -1){
return left;
}
return findDist(root->right, k, dist+1);
}
int distBtwNodes(Node *root , int n1, int n2){
Node *lca = LCA(root, n1, n2);
int d1 = findDist(lca, n1, 0);
int d2 = findDist(lca, n2, 0);
return d1+d2;
}
int main(){
/*
1
/ \
2 3
/ \
4 5
*/
Node *root = new Node(1);
root->left = new Node(2);
root->right = new Node(3);
root->left->left = new Node(4);
root->right->right = new Node(5);
//test
cout<<distBtwNodes(root, 4 , 5) << endl;
return 0;
} | 18.204545 | 48 | 0.445693 | Sambitcr-7 |
de06c1169936f8c2a438f34b1b6f624a03155f51 | 1,197 | cpp | C++ | src/espbot/espbot_cfgfile.cpp | quackmore/espbot | 05c42617988bbcccdd3430e04e631755fb4f1ae3 | [
"Beerware"
] | null | null | null | src/espbot/espbot_cfgfile.cpp | quackmore/espbot | 05c42617988bbcccdd3430e04e631755fb4f1ae3 | [
"Beerware"
] | null | null | null | src/espbot/espbot_cfgfile.cpp | quackmore/espbot | 05c42617988bbcccdd3430e04e631755fb4f1ae3 | [
"Beerware"
] | null | null | null | /*
* ----------------------------------------------------------------------------
* "THE BEER-WARE LICENSE" (Revision 42):
* <quackmore-ff@yahoo.com> wrote this file. As long as you retain this notice
* you can do whatever you want with this stuff. If we meet some day, and you
* think this stuff is worth it, you can buy me a beer in return. Quackmore
* ----------------------------------------------------------------------------
*/
#include "espbot_cfgfile.hpp"
#include "espbot_diagnostic.hpp"
#include "espbot_event_codes.h"
static char *get_file_content(Cfgfile *ptr, char *&str, char *filename)
{
int len = Espfile::size(filename) + 1;
char *tmp_ptr = new char[len];
if (tmp_ptr)
{
os_memset(tmp_ptr, 0, len);
ptr->n_read(tmp_ptr, len - 1);
}
else
{
dia_error_evnt(CFGFILE_HEAP_EXHAUSTED, len);
ERROR("Cfgfile heap exhasted [%d]", len);
tmp_ptr = (char *) f_str("");
}
str = tmp_ptr;
// TRACE("%s content: %s", filename, tmp_ptr);
return tmp_ptr;
}
Cfgfile::Cfgfile(char *filename)
: Espfile(filename)
, JSONP(get_file_content(this, this->_json_str, filename))
{
}
Cfgfile::~Cfgfile()
{
if (_json_str)
delete _json_str;
} | 27.204545 | 79 | 0.579783 | quackmore |
de06d20d48adc438f867ddf7ba1d4a20036049b0 | 928 | cpp | C++ | VGP332/FinalProject/Hive.cpp | CyroPCJr/OmegaEngine | 65fbd6cff54266a9c934e3a875a4493d26758661 | [
"MIT"
] | 1 | 2021-04-23T19:18:12.000Z | 2021-04-23T19:18:12.000Z | VGP332/FinalProject/Hive.cpp | CyroPCJr/OmegaEngine | 65fbd6cff54266a9c934e3a875a4493d26758661 | [
"MIT"
] | null | null | null | VGP332/FinalProject/Hive.cpp | CyroPCJr/OmegaEngine | 65fbd6cff54266a9c934e3a875a4493d26758661 | [
"MIT"
] | 1 | 2021-06-15T10:42:08.000Z | 2021-06-15T10:42:08.000Z | #include <XEngine.h>
#include "Hive.h"
using namespace FinalProject;
void Hive::Initialize(AI::AIWorld& world)
{
position = { static_cast<float>(X::GetScreenWidth()), static_cast<float>(X::GetScreenHeight()) };
for (size_t i = 0; i < maxInterceptor; ++i)
{
auto interceptor = mInterceptorList.emplace_back(std::make_unique<Interceptor>(world)).get();
interceptor->Load();
interceptor->position = { position.x * 0.5f , position.y * 0.5f };//{ X::RandomFloat(0, mSettings.worldSize.x), X::RandomFloat(0, mSettings.worldSize.y) };
}
}
void Hive::Terminate()
{
for (const auto& inter : mInterceptorList)
{
inter->Unload();
}
}
void Hive::Update(float deltaTime)
{
for (const auto& inter : mInterceptorList)
{
inter->Update(deltaTime);
inter->Render();
}
}
void Hive::Render()
{
X::DrawScreenCircle({ position.x * 0.5f , position.y * 0.5f }, 50.0f, X::Colors::Red);
} | 24.421053 | 158 | 0.649784 | CyroPCJr |
9009f4e1c5f5f98d5a09cc8655eea25e2fa6a6e0 | 332 | hpp | C++ | include/Jam/TrippingState.hpp | DrJonki/Kajak-Games-Back-to-School-Jam-2017 | 470a6f3c203c4b7fbd4dc46caf5a01bc9cf305dd | [
"MIT"
] | null | null | null | include/Jam/TrippingState.hpp | DrJonki/Kajak-Games-Back-to-School-Jam-2017 | 470a6f3c203c4b7fbd4dc46caf5a01bc9cf305dd | [
"MIT"
] | null | null | null | include/Jam/TrippingState.hpp | DrJonki/Kajak-Games-Back-to-School-Jam-2017 | 470a6f3c203c4b7fbd4dc46caf5a01bc9cf305dd | [
"MIT"
] | null | null | null | #pragma once
namespace jam
{
class TrippingState
{
public:
TrippingState();
void reset();
void update(const float dt);
void incrementIntensity(const float incr);
float getIntensity() const;
float getIntensityTarget() const;
private:
float m_intensity;
float m_targetIntensity;
};
} | 12.769231 | 46 | 0.665663 | DrJonki |
9011219d550c9f72fc98c833779d48b045bf63cc | 415 | cpp | C++ | HALLibTest/OutputTests/OutputTest.cpp | GerdHirsch/HALLib | dd14ef56cb8dfe98c296ddf2f49412fdd7a3fb4c | [
"MIT"
] | 1 | 2021-01-22T19:16:41.000Z | 2021-01-22T19:16:41.000Z | HALLibTest/OutputTests/OutputTest.cpp | GerdHirsch/HALLib | dd14ef56cb8dfe98c296ddf2f49412fdd7a3fb4c | [
"MIT"
] | null | null | null | HALLibTest/OutputTests/OutputTest.cpp | GerdHirsch/HALLib | dd14ef56cb8dfe98c296ddf2f49412fdd7a3fb4c | [
"MIT"
] | null | null | null | #include "OutputTest.h"
#include <LPC214x/Doc/CreateDoc.h>
#include <LPC213x/Doc/CreateDoc.h>
//CPPUNIT_TEST_SUITE_REGISTRATION (OutputTest);
using namespace Generator;
void OutputTest::CreateLPC21xxContextDoc(){
LPC214x::createContextDoc();
//LPC213x::createContextDoc();
}
void OutputTest::CreateLPC21xxComponentsDoc(){
// LPC214x::createComponentsDoc();
// LPC213x::createComponentsDoc();
}
| 24.411765 | 48 | 0.749398 | GerdHirsch |
901193318fb486186ad8be9d8b2cac9e0d6459f9 | 1,969 | cpp | C++ | Alhythm/src/Game_Util_Functions.cpp | Nao-Shirotsu/Siv3D_Alhythm | d602832e535831a07d0e7c3fb589caa5d356aaf2 | [
"MIT"
] | 4 | 2018-12-19T12:36:42.000Z | 2021-05-24T06:13:33.000Z | Alhythm/src/Game_Util_Functions.cpp | Nao-Shirotsu/Siv3D_Alhythm | d602832e535831a07d0e7c3fb589caa5d356aaf2 | [
"MIT"
] | 1 | 2019-01-07T03:04:11.000Z | 2019-01-07T03:04:11.000Z | Alhythm/src/Game_Util_Functions.cpp | Nao-Shirotsu/Siv3D_Alhythm | d602832e535831a07d0e7c3fb589caa5d356aaf2 | [
"MIT"
] | 2 | 2020-04-15T06:15:51.000Z | 2021-12-16T02:22:12.000Z | #include "Game_Util_Functions.h"
bool Game::Util::LaneKeyClicked( wchar_t keycode ){
if( s3d::IsAlnum( keycode ) ){
return s3d::Key( keycode ).clicked;
}
else if( keycode == L';' ){
return s3d::Input::KeySemicolon.clicked;
}
return false;
}
bool Game::Util::LaneKeyPressed( wchar_t keycode ){
if( s3d::IsAlnum( keycode ) ){
return s3d::Key( keycode ).pressed;
}
else if( keycode == L';' ){
return s3d::Input::KeySemicolon.pressed;
}
return false;
}
s3d::String Game::Util::FullTrackName( const Game::TrackFileID id ){
int num = static_cast<int>( id );
if( num < 3000 || 4000 <= num ){
return L"";
}
using ID = Game::TrackFileID;
switch( id ){
case ID::Senkou:
return L"閃光の足跡";
case ID::Cassi:
return L"Cassiopeia";
case ID::Orion:
return L"Orion";
default:
return L"";
}
}
s3d::String Game::Util::EmbeddedFilePath( const Game::SEBGMFileID id ){
return L"/" + s3d::Format( static_cast<int>( id ) );
}
s3d::String Game::Util::EmbeddedFilePath( const Game::TrackFileID id ){
if( id == TrackFileID::CassiEmp ){
return L"/" + s3d::Format( static_cast<int>( TrackFileID::Cassi ) );
}
return L"/" + s3d::Format( static_cast<int>( id ) );
}
s3d::String Game::Util::EmbeddedFilePath( const Game::ImageFileID id ){
return L"/" + s3d::Format( static_cast<int>( id ) );
}
s3d::String Game::Util::EmbeddedNotesInfoFilePath( const Game::TrackFileID id ){
#ifndef NOTESINFODEBUG
int num = static_cast< int >( id );
if( num < 3000 || 4000 <= num ){
return L"";
}
return L"/" + s3d::Format( ( num + 1000 ) );
#else
switch( id ){
case Game::TrackFileID::Senkou:
return L"NotesInfo/senkou.csv";
case Game::TrackFileID::Cassi:
return L"NotesInfo/cassi.csv";
case Game::TrackFileID::Orion:
return L"NotesInfo/orion.csv";
case Game::TrackFileID::CassiEmp:
return L"NotesInfo/cassi_emp.csv";
default:
return L"";
}
#endif
}
| 22.895349 | 81 | 0.631285 | Nao-Shirotsu |
901fd7ac50da624125e30061b3ebedd53f50b862 | 3,501 | cpp | C++ | soccer/src/soccer/planning/primitives/rrt_util.cpp | xiaoqingyu0113/robocup-software | 6127d25fc455051ef47610d0e421b2ca7330b4fa | [
"Apache-2.0"
] | 200 | 2015-01-26T01:45:34.000Z | 2022-03-19T13:05:31.000Z | soccer/src/soccer/planning/primitives/rrt_util.cpp | xiaoqingyu0113/robocup-software | 6127d25fc455051ef47610d0e421b2ca7330b4fa | [
"Apache-2.0"
] | 1,254 | 2015-01-03T01:57:35.000Z | 2022-03-16T06:32:21.000Z | soccer/src/soccer/planning/primitives/rrt_util.cpp | xiaoqingyu0113/robocup-software | 6127d25fc455051ef47610d0e421b2ca7330b4fa | [
"Apache-2.0"
] | 206 | 2015-01-21T02:03:18.000Z | 2022-02-01T17:57:46.000Z | #include "rrt_util.hpp"
#include <array>
#include <rrt/planning/Path.hpp>
#include "debug_drawer.hpp"
#include "path_smoothing.hpp"
#include "planning/instant.hpp"
#include "planning/motion_constraints.hpp"
#include "planning/planning_params.hpp"
#include "planning/trajectory.hpp"
#include "planning/trajectory_utils.hpp"
#include "velocity_profiling.hpp"
namespace planning {
using std::vector;
using namespace rj_geometry;
void draw_rrt(const RRT::Tree<Point>& rrt, DebugDrawer* debug_drawer, unsigned shell_id) {
// Draw each robot's rrts in a different color
// Note: feel free to change these, they're completely arbitrary
static const std::array<QColor, 6> colors = {QColor("green"), QColor("blue"),
QColor("yellow"), QColor("red"),
QColor("purple"), QColor("orange")};
QColor color = colors[shell_id % colors.size()];
for (const auto& node : rrt.allNodes()) {
if (node.parent() != nullptr) {
debug_drawer->draw_line(Segment(node.state(), node.parent()->state()), color,
QString("RobotRRT%1").arg(shell_id));
}
}
}
void draw_bi_rrt(const RRT::BiRRT<Point>& bi_rrt, DebugDrawer* debug_drawer, unsigned shell_id) {
draw_rrt(bi_rrt.startTree(), debug_drawer, shell_id);
draw_rrt(bi_rrt.goalTree(), debug_drawer, shell_id);
}
vector<Point> run_rrt_helper(Point start, Point goal, const ShapeSet& obstacles,
const vector<Point>& waypoints, bool straight_line) {
auto state_space =
std::make_shared<RoboCupStateSpace>(FieldDimensions::current_dimensions, obstacles);
RRT::BiRRT<Point> bi_rrt(state_space, Point::hash, 2);
bi_rrt.setStartState(start);
bi_rrt.setGoalState(goal);
if (straight_line) {
// TODO(#1511): Replace this with a check that a straight line doesn't
// hit any static obstacles. Set the step size to be the distance
// between the start and goal.
bi_rrt.setStepSize(state_space->distance(start, goal));
// Plan straight toward the goal.
bi_rrt.setGoalBias(1);
// Try up to five times. If unsuccessful after five tries, there
// probably doesn't exist
// a straight path.
bi_rrt.setMinIterations(0);
bi_rrt.setMaxIterations(5);
} else {
bi_rrt.setStepSize(rrt::PARAM_step_size);
bi_rrt.setMinIterations(rrt::PARAM_min_iterations);
bi_rrt.setMaxIterations(rrt::PARAM_max_iterations);
bi_rrt.setGoalBias(rrt::PARAM_goal_bias);
if (!waypoints.empty()) {
bi_rrt.setWaypoints(waypoints);
bi_rrt.setWaypointBias(rrt::PARAM_waypoint_bias);
}
}
bool success = bi_rrt.run();
if (!success) {
return {};
}
vector<Point> points = bi_rrt.getPath();
RRT::SmoothPath(points, *state_space);
return std::move(points);
}
vector<Point> generate_rrt(Point start, Point goal, const ShapeSet& obstacles,
const vector<Point>& waypoints) {
// note: we could just use state_space.transition_valid() for the straight
// line test, but this runs quicker
vector<Point> straight = run_rrt_helper(start, goal, obstacles, waypoints, true);
if (!straight.empty()) {
return std::move(straight);
}
return run_rrt_helper(start, goal, obstacles, waypoints, false);
}
} // namespace planning
| 36.852632 | 97 | 0.647244 | xiaoqingyu0113 |
90204ee925122d632a0afd6a8f1ac0cb3ee0194f | 3,656 | cpp | C++ | Tests/Source/Benchmarks/DataExpression.cpp | Fortahr/RmlUi | 7123e8680a90cff5cc6c089ab91533f35201f888 | [
"MIT"
] | null | null | null | Tests/Source/Benchmarks/DataExpression.cpp | Fortahr/RmlUi | 7123e8680a90cff5cc6c089ab91533f35201f888 | [
"MIT"
] | null | null | null | Tests/Source/Benchmarks/DataExpression.cpp | Fortahr/RmlUi | 7123e8680a90cff5cc6c089ab91533f35201f888 | [
"MIT"
] | null | null | null | /*
* This source file is part of RmlUi, the HTML/CSS Interface Middleware
*
* For the latest information, see http://github.com/mikke89/RmlUi
*
* Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
* Copyright (c) 2019 The RmlUi Team, and contributors
*
* 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 "../../../Source/Core/DataExpression.cpp"
#include <RmlUi/Core/DataModel.h>
#include <doctest.h>
#include <nanobench.h>
using namespace Rml;
using namespace ankerl;
static DataTypeRegister type_register;
static DataModel model(type_register.GetTransformFuncRegister());
static DataExpressionInterface interface(&model, nullptr);
TEST_CASE("data_expressions")
{
float radius = 6.0f;
String color_name = "color";
Colorb color_value = Colorb(180, 100, 255);
DataModelConstructor constructor(&model, &type_register);
constructor.Bind("radius", &radius);
constructor.Bind("color_name", &color_name);
constructor.BindFunc("color_value", [&](Variant& variant) {
variant = ToString(color_value);
});
nanobench::Bench bench;
bench.title("Data expression");
bench.relative(true);
auto bench_expression = [&](const String& expression, const char* parse_name, const char* execute_name) {
DataParser parser(expression, interface);
bool result = true;
bench.run(parse_name, [&] {
result &= parser.Parse(false);
});
REQUIRE(result);
Program program = parser.ReleaseProgram();
AddressList addresses = parser.ReleaseAddresses();
DataInterpreter interpreter(program, addresses, interface);
bench.run(execute_name, [&] {
result &= interpreter.Run();
});
REQUIRE(result);
};
bench_expression(
"2 * 2",
"Simple (parse)",
"Simple (execute)"
);
bench_expression(
"true || false ? true && radius==1+2 ? 'Absolutely!' : color_value : 'no'",
"Complex (parse)",
"Complex (execute)"
);
auto bench_assignment = [&](const String& expression, const char* parse_name, const char* execute_name) {
DataParser parser(expression, interface);
bool result = true;
bench.run(parse_name, [&] {
result &= parser.Parse(true);
});
REQUIRE(result);
Program program = parser.ReleaseProgram();
AddressList addresses = parser.ReleaseAddresses();
DataInterpreter interpreter(program, addresses, interface);
bench.run(execute_name, [&] {
result &= interpreter.Run();
});
REQUIRE(result);
};
bench_assignment(
"radius = 15",
"Simple assign (parse)",
"Simple assign (execute)"
);
bench_assignment(
"radius = radius*radius*3.14; color_name = 'image-color'",
"Complex assign (parse)",
"Complex assign (execute)"
);
}
| 28.787402 | 106 | 0.72046 | Fortahr |
9025682ee676b0dddb05fa0bab14e7bc958dfc60 | 5,116 | cpp | C++ | tpcc_silo/log.cpp | masa16/ccbench | c4b67dfd025775bba87785b44fa7fd43fbb90055 | [
"Apache-2.0"
] | 30 | 2019-03-20T07:23:53.000Z | 2022-02-01T01:00:02.000Z | tpcc_silo/log.cpp | masa16/ccbench | c4b67dfd025775bba87785b44fa7fd43fbb90055 | [
"Apache-2.0"
] | 8 | 2019-06-06T04:24:16.000Z | 2021-12-10T05:55:35.000Z | tpcc_silo/log.cpp | masa16/ccbench | c4b67dfd025775bba87785b44fa7fd43fbb90055 | [
"Apache-2.0"
] | 10 | 2019-07-21T15:24:19.000Z | 2022-03-15T02:07:23.000Z | /**
* @file log.cpp
* @brief implement about log
*/
#include "log.h"
namespace ccbench {
void Log::LogHeader::init() {
checksum_ = 0;
log_rec_num_ = 0;
}
void Log::LogHeader::compute_two_complement_of_checksum() {
checksum_ ^= mask_full_bits_uint;
++checksum_;
}
unsigned int Log::LogHeader::get_checksum() const { // NOLINT
return checksum_;
}
void Log::LogHeader::add_checksum(const int add) { checksum_ += add; }
unsigned int Log::LogHeader::get_log_rec_num() const { // NOLINT
return log_rec_num_;
}
void Log::LogHeader::inc_log_rec_num() { ++this->log_rec_num_; }
void Log::LogHeader::set_checksum(unsigned int checksum) {
this->checksum_ = checksum;
}
unsigned int Log::LogRecord::compute_checksum() { // NOLINT
// compute checksum
// tid_word
unsigned int chkSum = 0;
const char *charitr = reinterpret_cast<char *>(this); // NOLINT
for (std::size_t i = 0; i < sizeof(tid_word); ++i) {
chkSum += (*charitr);
++charitr; // NOLINT
}
// OP_TYPE
chkSum += static_cast<decltype(chkSum)>(op_);
// key_length
std::string_view key_view = tuple_->get_key();
std::size_t key_length = key_view.size();
charitr = reinterpret_cast<char *>(&(key_length)); // NOLINT
for (std::size_t i = 0; i < sizeof(std::size_t); ++i) {
chkSum += (*charitr);
++charitr; // NOLINT
}
// key_body
charitr = key_view.data();
for (std::size_t i = 0; i < key_view.size(); ++i) {
chkSum += (*charitr);
++charitr; // NOLINT
}
// value_length
std::string_view value_view = tuple_->get_val();
std::size_t value_length = value_view.size();
charitr = reinterpret_cast<char *>(&(value_length)); // NOLINT
for (std::size_t i = 0; i < sizeof(std::size_t); ++i) {
chkSum += (*charitr);
++charitr; // NOLINT
}
// value_body
charitr = value_view.data();
for (std::size_t i = 0; i < value_view.size(); ++i) {
chkSum += (*charitr);
++charitr; // NOLINT
}
return chkSum;
}
[[maybe_unused]] void Log::single_recovery_from_log() {
std::vector<LogRecord> log_set;
for (auto i = 0; i < KVS_MAX_PARALLEL_THREADS; ++i) {
File logfile{};
std::string filename(kLogDirectory);
filename.append("/log");
filename.append(std::to_string(i));
if (!logfile.try_open(filename, O_RDONLY)) {
/**
* the file doesn't exist.
*/
continue;
}
LogRecord log{};
LogHeader log_header{};
std::vector<Tuple> tuple_buffer;
const std::size_t fix_size = sizeof(tid_word) + sizeof(OP_TYPE);
while (sizeof(LogHeader) ==
logfile.read(reinterpret_cast<void *>(&log_header), // NOLINT
sizeof(LogHeader))) {
std::vector<LogRecord> log_tmp_buf;
for (unsigned int j = 0; j < log_header.get_log_rec_num(); ++j) {
if (fix_size != logfile.read(static_cast<void *>(&log), fix_size)) break;
std::unique_ptr<char[]> key_ptr; // NOLINT
std::unique_ptr<char[]> value_ptr; // NOLINT
std::size_t key_length{};
std::size_t value_length{};
// read key_length
if (sizeof(std::size_t) != logfile.read(static_cast<void *>(&key_length),
sizeof(std::size_t))) {
break;
}
// read key_body
if (key_length > 0) {
key_ptr = std::make_unique<char[]>(key_length); // NOLINT
if (key_length !=
logfile.read(static_cast<void *>(key_ptr.get()), key_length)) {
break;
}
}
// read value_length
if (sizeof(std::size_t) !=
logfile.read(static_cast<void *>(&value_length),
sizeof(std::size_t))) {
break;
}
// read value_body
if (value_length > 0) {
value_ptr = std::make_unique<char[]>(value_length); // NOLINT
if (value_length !=
logfile.read(static_cast<void *>(value_ptr.get()), value_length)) {
break;
}
}
log_header.set_checksum(log_header.get_checksum() +
log.compute_checksum());
log_tmp_buf.emplace_back(std::move(log));
}
if (log_header.get_checksum() == 0) {
for (auto &&itr : log_tmp_buf) {
log_set.emplace_back(std::move(itr));
}
} else {
break;
}
}
logfile.close();
}
/**
* If no log files exist, it return.
*/
if (log_set.empty()) return;
sort(log_set.begin(), log_set.end());
const epoch::epoch_t recovery_epoch =
log_set.back().get_tid().get_epoch() - 2;
Token s{};
Storage st{};
enter(s);
for (auto &&itr : log_set) {
if (itr.get_tid().get_epoch() > recovery_epoch) break;
if (itr.get_op() == OP_TYPE::UPDATE || itr.get_op() == OP_TYPE::INSERT) {
upsert(s, st, itr.get_tuple()->get_key(), itr.get_tuple()->get_val(), itr.get_tuple()->get_val_align());
} else if (itr.get_op() == OP_TYPE::DELETE) {
delete_record(s, st, itr.get_tuple()->get_key());
}
commit(s);
}
leave(s);
}
} // namespace ccbench
| 28.10989 | 110 | 0.581509 | masa16 |
90273de13690f908de9d4531de691c9ccfb03e4b | 7,829 | cpp | C++ | src/script/format/pcodereader.cpp | seedhartha/revan | b9a98007ca2f510b42894ecd09fb623571b433dc | [
"MIT"
] | 37 | 2020-06-27T18:50:48.000Z | 2020-08-02T14:13:51.000Z | src/script/format/pcodereader.cpp | seedhartha/revan | b9a98007ca2f510b42894ecd09fb623571b433dc | [
"MIT"
] | null | null | null | src/script/format/pcodereader.cpp | seedhartha/revan | b9a98007ca2f510b42894ecd09fb623571b433dc | [
"MIT"
] | 1 | 2020-07-14T13:32:15.000Z | 2020-07-14T13:32:15.000Z | /*
* Copyright (c) 2020-2022 The reone project contributors
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "pcodereader.h"
#include <boost/regex.hpp>
#include "../../common/exception/validation.h"
#include "../instrutil.h"
#include "../routines.h"
using namespace std;
namespace fs = boost::filesystem;
namespace reone {
namespace script {
void PcodeReader::load() {
vector<string> insLines;
map<int, string> labelByLineIdx;
map<int, uint32_t> addrByLineIdx;
fs::ifstream pcode(_path);
string line;
boost::smatch what;
boost::regex re("^([_\\d\\w]+):$");
uint32_t addr = 13;
while (getline(pcode, line)) {
boost::trim(line);
if (line.empty()) {
continue;
}
int lineIdx = static_cast<int>(insLines.size());
if (boost::regex_match(line, what, re)) {
labelByLineIdx[lineIdx] = what[1].str();
continue;
}
addrByLineIdx[lineIdx] = addr;
addr += getInstructionSize(line);
insLines.push_back(line);
}
fs::path filename(_path.filename());
filename.replace_extension(); // drop .pcode
filename.replace_extension(); // drop .ncs
_addrByLabel.clear();
for (auto &pair : labelByLineIdx) {
_addrByLabel[pair.second] = addrByLineIdx[pair.first];
}
_program = make_shared<ScriptProgram>(filename.string());
for (size_t i = 0; i < insLines.size(); ++i) {
uint32_t insAddr = addrByLineIdx.find(static_cast<int>(i))->second;
_program->add(parseInstruction(insLines[i], insAddr));
}
}
int PcodeReader::getInstructionSize(const string &line) {
int result = 2;
size_t spaceIdx = line.find(" ");
string typeDesc(spaceIdx != string::npos ? line.substr(0, spaceIdx) : line);
string argsLine(line.substr(typeDesc.length()));
InstructionType type = parseInstructionType(typeDesc);
switch (type) {
case InstructionType::CPDOWNSP:
case InstructionType::CPTOPSP:
case InstructionType::CPDOWNBP:
case InstructionType::CPTOPBP:
case InstructionType::DESTRUCT:
result += 6;
break;
case InstructionType::CONSTI:
case InstructionType::CONSTF:
case InstructionType::CONSTO:
case InstructionType::MOVSP:
case InstructionType::JMP:
case InstructionType::JSR:
case InstructionType::JZ:
case InstructionType::JNZ:
case InstructionType::DECISP:
case InstructionType::INCISP:
case InstructionType::DECIBP:
case InstructionType::INCIBP:
result += 4;
break;
case InstructionType::CONSTS:
result += 2;
applyArguments(argsLine, "^ \"(.*)\"$", 1, [&result](auto &args) {
result += args[0].length();
});
break;
case InstructionType::ACTION:
result += 3;
break;
case InstructionType::STORE_STATE:
result += 8;
break;
case InstructionType::EQUALTT:
case InstructionType::NEQUALTT:
result += 2;
break;
default:
break;
};
return result;
}
Instruction PcodeReader::parseInstruction(const string &line, uint32_t addr) const {
size_t spaceIdx = line.find(" ");
string typeDesc(spaceIdx != string::npos ? line.substr(0, spaceIdx) : line);
string argsLine(line.substr(typeDesc.length()));
InstructionType type = parseInstructionType(typeDesc);
Instruction ins;
ins.offset = addr;
ins.type = type;
switch (type) {
case InstructionType::CPDOWNSP:
case InstructionType::CPTOPSP:
case InstructionType::CPDOWNBP:
case InstructionType::CPTOPBP:
applyArguments(argsLine, "^ ([-\\d]+), (\\d+)$", 2, [&ins](auto &args) {
ins.stackOffset = atoi(args[0].c_str());
ins.size = atoi(args[1].c_str());
});
break;
case InstructionType::CONSTI:
applyArguments(argsLine, "^ ([-\\d]+)$", 1, [&ins](auto &args) {
ins.intValue = atoi(args[0].c_str());
});
break;
case InstructionType::CONSTF:
applyArguments(argsLine, "^ ([-\\.\\d]+)$", 1, [&ins](auto &args) {
ins.floatValue = atof(args[0].c_str());
});
break;
case InstructionType::CONSTS:
applyArguments(argsLine, "^ \"(.*)\"$", 1, [&ins](auto &args) {
ins.strValue = args[0];
});
break;
case InstructionType::CONSTO:
applyArguments(argsLine, "^ (\\d+)$", 1, [&ins](auto &args) {
ins.objectId = atoi(args[0].c_str());
});
break;
case InstructionType::ACTION:
applyArguments(argsLine, "^ (\\w+), (\\d+)$", 2, [this, &ins](auto &args) {
ins.routine = _routines.getIndexByName(args[0]);
ins.argCount = atoi(args[1].c_str());
});
break;
case InstructionType::MOVSP:
applyArguments(argsLine, "^ ([-\\d]+)$", 1, [&ins](auto &args) {
ins.stackOffset = atoi(args[0].c_str());
});
break;
case InstructionType::JMP:
case InstructionType::JSR:
case InstructionType::JZ:
case InstructionType::JNZ:
applyArguments(argsLine, "^ ([_\\d\\w]+)$", 1, [this, &ins](auto &args) {
const string &label = args[0];
auto maybeAddr = _addrByLabel.find(label);
if (maybeAddr == _addrByLabel.end()) {
throw ValidationException("Instruction address not found by label '" + label + "'");
}
ins.jumpOffset = maybeAddr->second - ins.offset;
});
break;
case InstructionType::DESTRUCT:
applyArguments(argsLine, "^ (\\d+), ([-\\d]+), (\\d+)$", 3, [&ins](auto &args) {
ins.size = atoi(args[0].c_str());
ins.stackOffset = atoi(args[1].c_str());
ins.sizeNoDestroy = atoi(args[2].c_str());
});
break;
case InstructionType::DECISP:
case InstructionType::INCISP:
case InstructionType::DECIBP:
case InstructionType::INCIBP:
applyArguments(argsLine, "^ ([-\\d]+)$", 1, [&ins](auto &args) {
ins.stackOffset = atoi(args[0].c_str());
});
break;
case InstructionType::STORE_STATE:
applyArguments(argsLine, "^ (\\d+), (\\d+)$", 2, [&ins](auto &args) {
ins.size = atoi(args[0].c_str());
ins.sizeLocals = atoi(args[1].c_str());
});
break;
case InstructionType::EQUALTT:
case InstructionType::NEQUALTT:
applyArguments(argsLine, "^ (\\d+)$", 1, [&ins](auto &args) {
ins.size = atoi(args[0].c_str());
});
break;
default:
break;
};
return move(ins);
}
void PcodeReader::applyArguments(const string &line, const string &restr, int numArgs, const function<void(const vector<string> &)> &fn) const {
boost::smatch what;
boost::regex re(restr);
if (!boost::regex_match(line, what, re)) {
throw invalid_argument(str(boost::format("Arguments line '%s' must match regular expression '%s'") % line % restr));
}
vector<string> args;
for (int i = 0; i < numArgs; ++i) {
args.push_back(what[1 + i].str());
}
fn(move(args));
}
} // namespace script
} // namespace reone
| 32.218107 | 144 | 0.596117 | seedhartha |
902a33402d253b260a899b57f5b65b6744ea077d | 6,699 | hpp | C++ | include/inet/Wifi.hpp | bander9289/StratifyAPI | 9b45091aa71a4e5718047438ea4044c1fdc814a3 | [
"MIT"
] | 2 | 2016-05-21T03:09:19.000Z | 2016-08-27T03:40:51.000Z | include/inet/Wifi.hpp | bander9289/StratifyAPI | 9b45091aa71a4e5718047438ea4044c1fdc814a3 | [
"MIT"
] | 75 | 2017-10-08T22:21:19.000Z | 2020-03-30T21:13:20.000Z | include/inet/Wifi.hpp | StratifyLabs/StratifyLib | 975a5c25a84296fd0dec64fe4dc579cf7027abe6 | [
"MIT"
] | 5 | 2018-03-27T16:44:09.000Z | 2020-07-08T16:45:55.000Z | #ifndef SAPI_INET_WIFI_HPP
#define SAPI_INET_WIFI_HPP
#if !defined __link
#include <sos/api/wifi_api.h>
#include "../api/InetObject.hpp"
#include "../chrono/MicroTime.hpp"
#include "../chrono/Timer.hpp"
#include "../var/String.hpp"
#include "IpAddress.hpp"
namespace inet {
typedef api::Api<wifi_api_t, WIFI_API_REQUEST> WifiApi;
class WifiSsidInfo {
public:
WifiSsidInfo(){
m_info = {0};
}
explicit WifiSsidInfo(const wifi_ssid_info_t & info) : m_info(info) {}
bool is_valid() const {
return m_info.ssid[0] != 0;
}
var::String get_name() const {
return var::String(m_info.ssid);
}
WifiSsidInfo& set_name(const var::String & value){
strncpy(m_info.ssid, value.cstring(), sizeof(m_info.ssid));
return *this;
}
API_ACCESS_MEMBER_FUNDAMENTAL(WifiSsidInfo,u8,info,channel)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiSsidInfo,u8,info,security)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiSsidInfo,s8,info,rssi)
const wifi_ssid_info_t & info() const {
return m_info;
}
bool operator == (const WifiSsidInfo & a) const {
return a.get_name() == get_name();
}
private:
wifi_ssid_info_t m_info;
};
class WifiAuthInfo {
public:
WifiAuthInfo(){
m_auth ={0};
}
explicit WifiAuthInfo(const wifi_auth_info_t & auth) : m_auth(auth) {}
explicit WifiAuthInfo(const var::String& passphrase){
strncpy(
(char*)(m_auth.password),
passphrase.cstring(),
sizeof(m_auth.password)
);
}
const wifi_auth_info_t & auth() const {
return m_auth;
}
private:
wifi_auth_info_t m_auth;
};
class WifiScanAttributes {
public:
enum scan_regions {
scan_region_north_america = WIFI_SCAN_REGION_NORTH_AMERICA,
scan_region_asia = WIFI_SCAN_REGION_ASIA
};
WifiScanAttributes(){
m_attributes = {0};
}
static WifiScanAttributes get_default(){
return WifiScanAttributes()
.set_region(scan_region_north_america)
.set_passive(false)
.set_channel(0xff)
.set_slot_count(5)
.set_slot_time(chrono::Milliseconds(100))
.set_probe_count(2)
.set_rssi_threshold(-90);
}
explicit WifiScanAttributes(const wifi_scan_attributes_t & attributes) : m_attributes(attributes){}
bool is_valid() const {
return m_attributes.slot_count != 0;
}
WifiScanAttributes& set_passive(bool value = true){
m_attributes.is_passive = value;
return *this;
}
WifiScanAttributes& set_slot_time(const chrono::MicroTime & value){
m_attributes.slot_time_ms = value.milliseconds();
return *this;
}
WifiScanAttributes& set_region(enum scan_regions value){
m_attributes.scan_region = value;
return *this;
}
chrono::MicroTime slot_time() const {
return chrono::Milliseconds(m_attributes.slot_time_ms);
}
API_ACCESS_MEMBER_FUNDAMENTAL(WifiScanAttributes,u8,attributes,channel)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiScanAttributes,u8,attributes,slot_count)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiScanAttributes,u8,attributes,probe_count)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiScanAttributes,u8,attributes,rssi_threshold)
API_READ_ACCESS_MEMBER_FUNDAMENTAL(WifiScanAttributes,u8,attributes,scan_region)
bool is_passive() const {
return m_attributes.is_passive;
}
const wifi_scan_attributes_t & attributes() const {
return m_attributes;
}
private:
wifi_scan_attributes_t m_attributes;
};
class WifiIpInfo {
public:
WifiIpInfo(){ m_info = {0}; }
explicit WifiIpInfo(const wifi_ip_info_t & info) : m_info(info){}
bool is_valid() const {
return m_info.ip_address != 0;
}
WifiIpInfo& set_lease_time(const chrono::MicroTime & value){
m_info.lease_time_s = value.seconds();
return *this;
}
chrono::MicroTime lease_time() const {
return chrono::Seconds(m_info.lease_time_s);
}
API_ACCESS_MEMBER_FUNDAMENTAL(WifiIpInfo,u32,info,ip_address)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiIpInfo,u32,info,dns_address)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiIpInfo,u32,info,subnet_mask)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiIpInfo,u32,info,gateway_address)
Ipv4Address get_ip_address() const {
return Ipv4Address(ip_address());
}
Ipv4Address get_dns_address() const {
return Ipv4Address(dns_address());
}
Ipv4Address get_gateway_address() const {
return Ipv4Address(gateway_address());
}
Ipv4Address get_subnet_mask() const {
return Ipv4Address(subnet_mask());
}
private:
wifi_ip_info_t m_info;
};
class WifiInfo {
public:
WifiInfo(){ m_info = {0}; }
WifiInfo(const wifi_info_t & info){ m_info = info; }
bool is_valid() const {
return m_info.resd0 == WIFI_API_INFO_RESD;
}
WifiIpInfo get_ip_info() const{
return WifiIpInfo(m_info.ip);
}
API_ACCESS_MEMBER_FUNDAMENTAL(WifiInfo,u8,info,security)
API_ACCESS_MEMBER_FUNDAMENTAL(WifiInfo,u8,info,rssi)
bool is_connected() const {
return m_info.is_connected;
}
const wifi_info_t & info() const {
return m_info;
}
private:
wifi_info_t m_info;
};
class Wifi : public api::WorkObject, public WifiApi {
public:
Wifi();
~Wifi(){
finalize();
}
int initialize(){
if( api().is_valid() == false ){
return set_error_number_if_error(api::error_code_inet_wifi_api_missing);
}
return set_error_number_if_error( api()->init(&m_context) );
}
void finalize(){
api()->deinit(&m_context);
}
WifiIpInfo connect(
const WifiSsidInfo & ssid_info,
const WifiAuthInfo & auth,
const chrono::MicroTime & timeout = chrono::Seconds(10)
);
int disconnect(){
return set_error_number_if_error(
api()->disconnect(m_context)
);
}
var::Vector<WifiSsidInfo> scan(
const WifiScanAttributes & attributes = WifiScanAttributes::get_default(),
const chrono::MicroTime & timeout = chrono::Seconds(20)
);
int start_scan(
const WifiScanAttributes & attributes
){
return set_error_number_if_error(
api()->start_scan(
m_context,
&attributes.attributes()
)
);
}
bool is_scan_busy() const {
int result
= api()->get_scan_count(m_context);
return result < 0;
}
WifiInfo get_info(){
wifi_info_t info;
if( set_error_number_if_error(
api()->get_info(
m_context,
&info
)
) < 0 ){
return WifiInfo();
}
return WifiInfo(info);
}
var::Vector<WifiSsidInfo> get_ssid_info_list();
int set_mode();
int set_mac_address(u8 mac_address[6]);
int get_mac_address(u8 mac_address[6]);
int get_factory_mac_address(u8 mac_address[6]);
int set_ip_address(
const wifi_ip_info_t * static_ip_address
);
int set_sleep_mode(void * context);
int sleep(void * context, u32 sleep_time_ms);
int set_device_name(
void * context,
const char * name
);
int set_tx_power(
void * context,
u8 power_level
);
static WifiApi & api(){ return m_api; }
private:
static WifiApi m_api;
void * m_context;
};
}
#endif
#endif // SAPI_INET_WIFI_HPP
| 20.804348 | 100 | 0.730706 | bander9289 |
9033a69c5ed0824d6b4c3858dd6c86671fa04978 | 7,002 | cpp | C++ | Sources/Extras/CoreAudio/PublicUtility/CACFPreferences.cpp | nnanhthu/QuickomVC | 6d4641336dd5d515238c94feb8f6a025fc8d181b | [
"MIT"
] | 170 | 2018-11-28T10:20:54.000Z | 2022-03-29T01:54:43.000Z | Sources/Extras/CoreAudio/PublicUtility/CACFPreferences.cpp | nnanhthu/QuickcomVirtualCamera | 4eba93196549a9ad8ee63fb5a741586098e9ca5b | [
"MIT"
] | 19 | 2018-12-03T15:06:54.000Z | 2022-02-11T00:02:59.000Z | Sources/Extras/CoreAudio/PublicUtility/CACFPreferences.cpp | nnanhthu/QuickcomVirtualCamera | 4eba93196549a9ad8ee63fb5a741586098e9ca5b | [
"MIT"
] | 25 | 2018-11-29T02:15:09.000Z | 2021-12-28T20:56:35.000Z | /*
File: CACFPreferences.cpp
Abstract: CACFPreferences.h
Version: 1.1
*/
//==================================================================================================
// Includes
//==================================================================================================
// Self Include
#include "CACFPreferences.h"
// PublicUtility Includes
#include "CACFDistributedNotification.h"
#include "CADebugMacros.h"
//==================================================================================================
// CACFPreferences
//==================================================================================================
CFPropertyListRef CACFPreferences::CopyValue(CFStringRef inKey, bool inCurrentUser, bool inCurrentHost)
{
// synchronize to make sure that what's in memory matches what's on disk
Synchronize(inCurrentUser, inCurrentHost, false);
CFPropertyListRef theAnswer = NULL;
CFStringRef theUser = inCurrentUser ? kCFPreferencesCurrentUser : kCFPreferencesAnyUser;
CFStringRef theHost = inCurrentHost ? kCFPreferencesCurrentHost : kCFPreferencesAnyHost;
theAnswer = CFPreferencesCopyValue(inKey, kCFPreferencesAnyApplication, theUser, theHost);
return theAnswer;
}
CFStringRef CACFPreferences::CopyStringValue(CFStringRef inKey, bool inCurrentUser, bool inCurrentHost)
{
CFStringRef theAnswer = NULL;
// get the raw value
CFPropertyListRef theRawValue = CopyValue(inKey, inCurrentUser, inCurrentHost);
if(theRawValue != NULL)
{
// get it's type ID and make sure it's a CFString
CFTypeID theTypeID = CFGetTypeID(theRawValue);
if(theTypeID == CFStringGetTypeID())
{
// cast the value
theAnswer = static_cast<CFStringRef>(theRawValue);
}
else
{
CFRelease(theRawValue);
DebugMessage("CACFPreferences::CopyStringValue: not a CFString");
}
}
return theAnswer;
}
CFNumberRef CACFPreferences::CopyNumberValue(CFStringRef inKey, bool inCurrentUser, bool inCurrentHost)
{
CFNumberRef theAnswer = NULL;
// get the raw value
CFPropertyListRef theRawValue = CopyValue(inKey, inCurrentUser, inCurrentHost);
if(theRawValue != NULL)
{
// get it's type ID and make sure it's a CFNumber
CFTypeID theTypeID = CFGetTypeID(theRawValue);
if(theTypeID == CFNumberGetTypeID())
{
// cast the value
theAnswer = static_cast<CFNumberRef>(theRawValue);
}
else
{
CFRelease(theRawValue);
DebugMessage("CACFPreferences::CopyNumberValue: not a CFNumber");
}
}
return theAnswer;
}
CFArrayRef CACFPreferences::CopyArrayValue(CFStringRef inKey, bool inCurrentUser, bool inCurrentHost)
{
CFArrayRef theAnswer = NULL;
// get the raw value
CFPropertyListRef theRawValue = CopyValue(inKey, inCurrentUser, inCurrentHost);
if(theRawValue != NULL)
{
// get it's type ID and make sure it's a CFArray
CFTypeID theTypeID = CFGetTypeID(theRawValue);
if(theTypeID == CFArrayGetTypeID())
{
// cast the value
theAnswer = static_cast<CFArrayRef>(theRawValue);
}
else
{
CFRelease(theRawValue);
DebugMessage("CACFPreferences::CopyArrayValue: not a CFArray");
}
}
return theAnswer;
}
CFDictionaryRef CACFPreferences::CopyDictionaryValue(CFStringRef inKey, bool inCurrentUser, bool inCurrentHost)
{
CFDictionaryRef theAnswer = NULL;
// get the raw value
CFPropertyListRef theRawValue = CopyValue(inKey, inCurrentUser, inCurrentHost);
if(theRawValue != NULL)
{
// get it's type ID and make sure it's a CFDictionary
CFTypeID theTypeID = CFGetTypeID(theRawValue);
if(theTypeID == CFDictionaryGetTypeID())
{
// cast the value
theAnswer = static_cast<CFDictionaryRef>(theRawValue);
}
else
{
CFRelease(theRawValue);
DebugMessage("CACFPreferences::CopyDictionaryValue: not a CFDictionary");
}
}
return theAnswer;
}
void CACFPreferences::SetValue(CFStringRef inKey, CFPropertyListRef inValue, bool inCurrentUser, bool inCurrentHost, bool inSynchronize)
{
CFStringRef theUser = inCurrentUser ? kCFPreferencesCurrentUser : kCFPreferencesAnyUser;
CFStringRef theHost = inCurrentHost ? kCFPreferencesCurrentHost : kCFPreferencesAnyHost;
CFPreferencesSetValue(inKey, inValue, kCFPreferencesAnyApplication, theUser, theHost);
if(inSynchronize)
{
Synchronize(inCurrentUser, inCurrentHost, true);
}
}
void CACFPreferences::DeleteValue(CFStringRef inKey, bool inCurrentUser, bool inCurrentHost, bool inSynchronize)
{
CFStringRef theUser = inCurrentUser ? kCFPreferencesCurrentUser : kCFPreferencesAnyUser;
CFStringRef theHost = inCurrentHost ? kCFPreferencesCurrentHost : kCFPreferencesAnyHost;
CFPreferencesSetValue(inKey, NULL, kCFPreferencesAnyApplication, theUser, theHost);
if(inSynchronize)
{
Synchronize(theUser, inCurrentHost, true);
}
}
void CACFPreferences::Synchronize(bool inCurrentUser, bool inCurrentHost, bool inForce)
{
if(inForce || ArePrefsOutOfDate(inCurrentUser, inCurrentHost))
{
CFStringRef theUser = inCurrentUser ? kCFPreferencesCurrentUser : kCFPreferencesAnyUser;
CFStringRef theHost = inCurrentHost ? kCFPreferencesCurrentHost : kCFPreferencesAnyHost;
CFPreferencesSynchronize(kCFPreferencesAnyApplication, theUser, theHost);
MarkPrefsClean(inCurrentUser, inCurrentHost);
}
}
void CACFPreferences::MarkPrefsOutOfDate(bool inCurrentUser, bool inCurrentHost)
{
if(!inCurrentUser && !inCurrentHost)
{
sAnyUserAnyHostPrefsOutOfDate = true;
}
else if(!inCurrentUser && inCurrentHost)
{
sAnyUserCurrentHostPrefsOutOfDate = true;
}
else if(inCurrentUser && !inCurrentHost)
{
sCurrentUserAnyHostPrefsOutOfDate = true;
}
else if(inCurrentUser && inCurrentHost)
{
sCurrentUserCurrentHostPrefsOutOfDate = true;
}
}
void CACFPreferences::MarkPrefsClean(bool inCurrentUser, bool inCurrentHost)
{
if(!inCurrentUser && !inCurrentHost)
{
sAnyUserAnyHostPrefsOutOfDate = false;
}
else if(!inCurrentUser && inCurrentHost)
{
sAnyUserCurrentHostPrefsOutOfDate = false;
}
else if(inCurrentUser && !inCurrentHost)
{
sCurrentUserAnyHostPrefsOutOfDate = false;
}
else if(inCurrentUser && inCurrentHost)
{
sCurrentUserCurrentHostPrefsOutOfDate = false;
}
}
void CACFPreferences::SendNotification(CFStringRef inName)
{
CACFDistributedNotification::PostNotification(inName, NULL, true);
}
bool CACFPreferences::ArePrefsOutOfDate(bool inCurrentUser, bool inCurrentHost)
{
bool theAnswer = false;
if(!inCurrentUser && !inCurrentHost)
{
theAnswer = sAnyUserAnyHostPrefsOutOfDate;
}
else if(!inCurrentUser && inCurrentHost)
{
theAnswer = sAnyUserCurrentHostPrefsOutOfDate;
}
else if(inCurrentUser && !inCurrentHost)
{
theAnswer = sCurrentUserAnyHostPrefsOutOfDate;
}
else if(inCurrentUser && inCurrentHost)
{
theAnswer = sCurrentUserCurrentHostPrefsOutOfDate;
}
return theAnswer;
}
bool CACFPreferences::sAnyUserAnyHostPrefsOutOfDate = false;
bool CACFPreferences::sAnyUserCurrentHostPrefsOutOfDate = false;
bool CACFPreferences::sCurrentUserAnyHostPrefsOutOfDate = false;
bool CACFPreferences::sCurrentUserCurrentHostPrefsOutOfDate = false;
| 28.233871 | 136 | 0.730077 | nnanhthu |
90360eb0e4659093a61b4cb444e2d5c798badec6 | 1,972 | cpp | C++ | Problem-Solving/03_compare_the_triplets.cpp | vkramer/HackerRank-Solutions | 5f7b61402e438f6a9bcfa680a668c28ece4772d2 | [
"MIT"
] | null | null | null | Problem-Solving/03_compare_the_triplets.cpp | vkramer/HackerRank-Solutions | 5f7b61402e438f6a9bcfa680a668c28ece4772d2 | [
"MIT"
] | null | null | null | Problem-Solving/03_compare_the_triplets.cpp | vkramer/HackerRank-Solutions | 5f7b61402e438f6a9bcfa680a668c28ece4772d2 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
/*
Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from to for three categories: problem clarity, originality, and difficulty.
We define the rating for Alice's challenge to be the triplet A = (a[0],a[1],a[2]), and the rating for Bob's challenge to be the triplet B = (b[0],b[1],b[2]).
Your task is to find their comparison points by comparing a[0] with b[0], a[1] with b[1], and a[2] with b[2].
If a[i] > b[i], then Alice is awarded point.
If a[i] < b[i], then Bob is awarded point.
If a[i] = b[i], then neither person receives a point.
Comparison points is the total points a person earned.
Given and , can you compare the two challenges and print their respective comparison points?
Input Format
The first line contains 3 space-separated integers, a[0], a[1], and a[2], describing the respective values in triplet .
The second line contains 3 space-separated integers, b[0], b[1], and b[2], describing the respective values in triplet .
Constraints
- 1 <= a[i] <= 100
- 1 <= b[i] <= 100
Output Format
Print two space-separated integers denoting the respective comparison points earned by Alice and Bob.
Sample Input
5 6 7
3 6 10
Sample Output
1 1
*/
using namespace std;
vector < int > solve(int a0, int a1, int a2, int b0, int b1, int b2){
// Complete this function
int a=((a0>b0)?1:0) + ((a1>b1)?1:0)+ ((a2>b2)?1:0);
int b=((b0>a0)?1:0) + ((b1>a1)?1:0)+ ((b2>a2)?1:0);
vector <int> result;
result.push_back(a);
result.push_back(b);
return result;
}
int main() {
int a0;
int a1;
int a2;
cin >> a0 >> a1 >> a2;
int b0;
int b1;
int b2;
cin >> b0 >> b1 >> b2;
vector < int > result = solve(a0, a1, a2, b0, b1, b2);
for (ssize_t i = 0; i < result.size(); i++) {
cout << result[i] << (i != result.size() - 1 ? " " : "");
}
cout << endl;
return 0;
}
| 27.013699 | 196 | 0.632353 | vkramer |
90368d9c76bdadfb78283fb8f597a0f5b5f7ac26 | 2,329 | cpp | C++ | libcaf_core/src/detail/pretty_type_name.cpp | niclasr/actor-framework | 5cde8506dfd0c85aeee5fb43e54cb8ddc26a94ac | [
"BSD-3-Clause"
] | null | null | null | libcaf_core/src/detail/pretty_type_name.cpp | niclasr/actor-framework | 5cde8506dfd0c85aeee5fb43e54cb8ddc26a94ac | [
"BSD-3-Clause"
] | null | null | null | libcaf_core/src/detail/pretty_type_name.cpp | niclasr/actor-framework | 5cde8506dfd0c85aeee5fb43e54cb8ddc26a94ac | [
"BSD-3-Clause"
] | null | null | null | // This file is part of CAF, the C++ Actor Framework. See the file LICENSE in
// the main distribution directory for license terms and copyright or visit
// https://github.com/actor-framework/actor-framework/blob/master/LICENSE.
#include "caf/detail/pretty_type_name.hpp"
#include "caf/config.hpp"
#if defined(CAF_LINUX) || defined(CAF_MACOS) || defined(CAF_NET_BSD)
# define CAF_HAS_CXX_ABI
#endif
#ifdef CAF_HAS_CXX_ABI
# include <cxxabi.h>
# include <sys/types.h>
# include <unistd.h>
#endif
#include "caf/string_algorithms.hpp"
namespace caf::detail {
void prettify_type_name(std::string& class_name) {
// replace_all(class_name, " ", "");
replace_all(class_name, "::", ".");
replace_all(class_name, "(anonymous namespace)", "ANON");
replace_all(class_name, ".__1.", "."); // gets rid of weird Clang-lib names
// hide CAF magic in logs
auto strip_magic = [&](const char* prefix_begin, const char* prefix_end) {
auto last = class_name.end();
auto i = std::search(class_name.begin(), last, prefix_begin, prefix_end);
auto comma_or_angle_bracket = [](char c) { return c == ',' || c == '>'; };
auto e = std::find_if(i, last, comma_or_angle_bracket);
if (i != e) {
std::string substr(i + (prefix_end - prefix_begin), e);
class_name.swap(substr);
}
};
char prefix1[] = "caf.detail.embedded<";
strip_magic(prefix1, prefix1 + (sizeof(prefix1) - 1));
// Drop template parameters, only leaving the template class name.
auto i = std::find(class_name.begin(), class_name.end(), '<');
if (i != class_name.end())
class_name.erase(i, class_name.end());
// Finally, replace any whitespace with %20 (should never happen).
replace_all(class_name, " ", "%20");
}
void prettify_type_name(std::string& class_name, const char* c_class_name) {
#ifdef CAF_HAS_CXX_ABI
int stat = 0;
std::unique_ptr<char, decltype(free)*> real_class_name{nullptr, free};
auto tmp = abi::__cxa_demangle(c_class_name, nullptr, nullptr, &stat);
real_class_name.reset(tmp);
class_name = stat == 0 ? real_class_name.get() : c_class_name;
#else
class_name = c_class_name;
#endif
prettify_type_name(class_name);
}
std::string pretty_type_name(const std::type_info& x) {
std::string result;
prettify_type_name(result, x.name());
return result;
}
} // namespace caf::detail
| 33.753623 | 78 | 0.694289 | niclasr |
9038138cd807fe1335ec21b808c528c8814df0e1 | 5,075 | hh | C++ | CommLocalizationObjects/smartsoft/src-gen/CommLocalizationObjects/CommBeaconLocalizationRawDataCore.hh | canonical-robots/DomainModelsRepositories | 68b9286d84837e5feb7b200833b158ab9c2922a4 | [
"BSD-3-Clause"
] | null | null | null | CommLocalizationObjects/smartsoft/src-gen/CommLocalizationObjects/CommBeaconLocalizationRawDataCore.hh | canonical-robots/DomainModelsRepositories | 68b9286d84837e5feb7b200833b158ab9c2922a4 | [
"BSD-3-Clause"
] | 2 | 2020-08-20T14:49:47.000Z | 2020-10-07T16:10:07.000Z | CommLocalizationObjects/smartsoft/src-gen/CommLocalizationObjects/CommBeaconLocalizationRawDataCore.hh | canonical-robots/DomainModelsRepositories | 68b9286d84837e5feb7b200833b158ab9c2922a4 | [
"BSD-3-Clause"
] | 8 | 2018-06-25T08:41:28.000Z | 2020-08-13T10:39:30.000Z | //--------------------------------------------------------------------------
// Code generated by the SmartSoft MDSD Toolchain
// The SmartSoft Toolchain has been developed by:
//
// Service Robotics Research Center
// University of Applied Sciences Ulm
// Prittwitzstr. 10
// 89075 Ulm (Germany)
//
// Information about the SmartSoft MDSD Toolchain is available at:
// www.servicerobotik-ulm.de
//
// Please do not modify this file. It will be re-generated
// running the code generator.
//--------------------------------------------------------------------------
#ifndef COMMLOCALIZATIONOBJECTS_COMMBEACONLOCALIZATIONRAWDATA_CORE_H_
#define COMMLOCALIZATIONOBJECTS_COMMBEACONLOCALIZATIONRAWDATA_CORE_H_
#include "CommLocalizationObjects/CommBeaconLocalizationRawDataData.hh"
#include "CommLocalizationObjects/CommBeaconMeasurement.hh"
#include <iostream>
#include <string>
#include <list>
namespace CommLocalizationObjects {
class CommBeaconLocalizationRawDataCore {
protected:
// data structure
CommLocalizationObjectsIDL::CommBeaconLocalizationRawData idl_CommBeaconLocalizationRawData;
public:
// give a publicly accessible type-name for the template parameter IDL
typedef CommLocalizationObjectsIDL::CommBeaconLocalizationRawData DATATYPE;
#ifdef ENABLE_HASH
static size_t generateDataHash(const DATATYPE &);
#endif
static const char* getCompiledHash();
static void getAllHashValues(std::list<std::string> &hashes);
static void checkAllHashValues(std::list<std::string> &hashes);
// default constructors
CommBeaconLocalizationRawDataCore();
CommBeaconLocalizationRawDataCore(const DATATYPE &data);
// default destructor
virtual ~CommBeaconLocalizationRawDataCore();
const DATATYPE& get() const { return idl_CommBeaconLocalizationRawData; }
operator const DATATYPE&() const { return idl_CommBeaconLocalizationRawData; }
DATATYPE& set() { return idl_CommBeaconLocalizationRawData; }
static inline std::string identifier(void) { return "CommLocalizationObjects::CommBeaconLocalizationRawData"; }
// helper method to easily implement output stream in derived classes
void to_ostream(std::ostream &os = std::cout) const;
// convert to xml stream
void to_xml(std::ostream &os, const std::string &indent = "") const;
// restore from xml stream
void from_xml(std::istream &is);
// User Interface
// getter and setter for element Measurements
/**
* Getter methods for element idl_CommBeaconLocalizationRawData.measurements of type vector<CommLocalizationObjects::CommBeaconMeasurement>
*/
inline std::vector<CommLocalizationObjects::CommBeaconMeasurement> getMeasurementsCopy() const {
return std::vector<CommLocalizationObjects::CommBeaconMeasurement>(idl_CommBeaconLocalizationRawData.measurements.begin(), idl_CommBeaconLocalizationRawData.measurements.end());
}
inline CommLocalizationObjects::CommBeaconMeasurement getMeasurementsElemAtPos(const size_t &pos) const {
return CommLocalizationObjects::CommBeaconMeasurement(idl_CommBeaconLocalizationRawData.measurements[pos]);
}
inline size_t getMeasurementsSize() const { return idl_CommBeaconLocalizationRawData.measurements.size(); }
inline bool isMeasurementsEmpty() const { return idl_CommBeaconLocalizationRawData.measurements.empty(); }
/**
* Setter methods for idl_CommBeaconLocalizationRawData.measurements of type vector<CommLocalizationObjects::CommBeaconMeasurement>
*/
inline CommBeaconLocalizationRawDataCore& setMeasurements(const std::vector<CommLocalizationObjects::CommBeaconMeasurement> &measurements) {
idl_CommBeaconLocalizationRawData.measurements.assign(measurements.begin(), measurements.end());
return *this;
}
inline bool setMeasurementsElemAtPos(const size_t &pos, const CommLocalizationObjects::CommBeaconMeasurement &elem) {
if(pos < idl_CommBeaconLocalizationRawData.measurements.size()) {
idl_CommBeaconLocalizationRawData.measurements[pos] = elem;
return true;
}
return false;
}
inline bool insertMeasurementsVectorAtPos(const size_t &pos, const std::vector<CommLocalizationObjects::CommBeaconMeasurement> &data) {
if(pos < idl_CommBeaconLocalizationRawData.measurements.size()) {
idl_CommBeaconLocalizationRawData.measurements.insert(idl_CommBeaconLocalizationRawData.measurements.begin()+pos, data.begin(), data.end());
return true;
}
return false;
}
inline void resizeMeasurements(const size_t &size) { idl_CommBeaconLocalizationRawData.measurements.resize(size); }
inline bool eraseMeasurementsElemsAtPos(const size_t &pos, const size_t &nbr_elems) {
if( (pos+nbr_elems) <= idl_CommBeaconLocalizationRawData.measurements.size() ) {
idl_CommBeaconLocalizationRawData.measurements.erase(idl_CommBeaconLocalizationRawData.measurements.begin()+pos, idl_CommBeaconLocalizationRawData.measurements.begin()+pos+nbr_elems);
return true;
}
return false;
}
inline void clearMeasurements() { idl_CommBeaconLocalizationRawData.measurements.clear(); }
};
} /* namespace CommLocalizationObjects */
#endif /* COMMLOCALIZATIONOBJECTS_COMMBEACONLOCALIZATIONRAWDATA_CORE_H_ */
| 44.517544 | 186 | 0.785419 | canonical-robots |
90387080e506a9b5fdb417868bf67d8f5cb4fc84 | 3,566 | cpp | C++ | bindings/python/src/OpenSpaceToolkitMathematicsPy/Geometry/3D/Objects/Cone.cpp | open-space-collective/library-mathematics | fdb4769a56a8fe35ffefb01a79c03cfca1f91958 | [
"Apache-2.0"
] | 5 | 2018-08-20T06:47:24.000Z | 2019-07-15T03:36:52.000Z | bindings/python/src/OpenSpaceToolkitMathematicsPy/Geometry/3D/Objects/Cone.cpp | open-space-collective/open-space-toolkit-mathematics | 4b97f97f4aaa87bff848381a3519c6f764461378 | [
"Apache-2.0"
] | 6 | 2020-01-05T20:18:18.000Z | 2021-10-14T09:36:44.000Z | bindings/python/src/OpenSpaceToolkitMathematicsPy/Geometry/3D/Objects/Cone.cpp | open-space-collective/open-space-toolkit-mathematics | 4b97f97f4aaa87bff848381a3519c6f764461378 | [
"Apache-2.0"
] | 2 | 2020-03-05T18:18:13.000Z | 2020-04-07T17:42:24.000Z | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/// @project Open Space Toolkit ▸ Mathematics
/// @file bindings/python/src/OpenSpaceToolkitMathematicsPy/Geometry/3D/Objects/Cone.cpp
/// @author Lucas Brémond <lucas@loftorbital.com>
/// @license Apache License 2.0
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <OpenSpaceToolkit/Mathematics/Geometry/3D/Intersection.hpp>
#include <OpenSpaceToolkit/Mathematics/Geometry/3D/Objects/Cone.hpp>
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
inline void OpenSpaceToolkitMathematicsPy_Geometry_3D_Objects_Cone ( pybind11::module& aModule )
{
using namespace pybind11 ;
using ostk::core::types::Size ;
using ostk::core::types::Real ;
using ostk::math::obj::Vector3d ;
using ostk::math::geom::Angle ;
using ostk::math::geom::d3::Object ;
using ostk::math::geom::d3::objects::Point ;
using ostk::math::geom::d3::objects::PointSet ;
using ostk::math::geom::d3::objects::Line ;
using ostk::math::geom::d3::objects::Ray ;
using ostk::math::geom::d3::objects::Segment ;
using ostk::math::geom::d3::objects::Plane ;
using ostk::math::geom::d3::objects::Polygon ;
using ostk::math::geom::d3::objects::Sphere ;
using ostk::math::geom::d3::objects::Ellipsoid ;
using ostk::math::geom::d3::objects::Cone ;
using ostk::math::geom::d3::Intersection ;
class_<Cone, Object>(aModule, "Cone")
.def(init<const Point&, const Vector3d&, const Angle&>())
.def(self == self)
.def(self != self)
.def("__str__", &(shiftToString<Cone>))
.def("__repr__", &(shiftToString<Cone>))
.def("is_defined", &Cone::isDefined)
.def("intersects_ellipsoid", +[] (const Cone& aCone, const Ellipsoid& anEllipsoid) -> bool { return aCone.intersects(anEllipsoid) ; })
.def("intersects_ellipsoid", +[] (const Cone& aCone, const Ellipsoid& anEllipsoid, const Size aDiscretizationLevel) -> bool { return aCone.intersects(anEllipsoid, aDiscretizationLevel) ; })
.def("get_apex", &Cone::getApex)
.def("get_axis", &Cone::getAxis)
.def("get_angle", &Cone::getAngle)
.def("get_rays_of_lateral_surface", &Cone::getRaysOfLateralSurface)
.def("intersection_with_ellipsoid", +[] (const Cone& aCone, const Ellipsoid& anEllipsoid) -> Intersection { return aCone.intersectionWith(anEllipsoid) ; })
.def("intersection_with_ellipsoid", +[] (const Cone& aCone, const Ellipsoid& anEllipsoid, const bool onlyInSight) -> Intersection { return aCone.intersectionWith(anEllipsoid, onlyInSight) ; })
.def("intersection_with_ellipsoid", +[] (const Cone& aCone, const Ellipsoid& anEllipsoid, const bool onlyInSight, const Size aDiscretizationLevel) -> Intersection { return aCone.intersectionWith(anEllipsoid, onlyInSight, aDiscretizationLevel) ; })
.def("apply_transformation", &Cone::applyTransformation)
.def_static("undefined", &Cone::Undefined)
;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
| 53.223881 | 255 | 0.544307 | open-space-collective |
903ba76e06cb434598d82a29a3f759db4b53dbf5 | 725 | cc | C++ | sdk/src/metrics/meter_provider.cc | sfc-gh-jallie/opentelemetry-cpp | c3f3236daf8d941da721f51e26c2d19e22f26635 | [
"Apache-2.0"
] | 284 | 2019-06-23T20:29:08.000Z | 2022-03-31T09:47:41.000Z | sdk/src/metrics/meter_provider.cc | sfc-gh-jallie/opentelemetry-cpp | c3f3236daf8d941da721f51e26c2d19e22f26635 | [
"Apache-2.0"
] | 1,183 | 2019-08-15T18:31:50.000Z | 2022-03-31T23:31:51.000Z | sdk/src/metrics/meter_provider.cc | sfc-gh-jallie/opentelemetry-cpp | c3f3236daf8d941da721f51e26c2d19e22f26635 | [
"Apache-2.0"
] | 185 | 2019-09-20T04:10:38.000Z | 2022-03-26T00:04:41.000Z | // Copyright The OpenTelemetry Authors
// SPDX-License-Identifier: Apache-2.0
#ifdef ENABLE_METRICS_PREVIEW
# include "opentelemetry/sdk/metrics/meter_provider.h"
OPENTELEMETRY_BEGIN_NAMESPACE
namespace sdk
{
namespace metrics
{
MeterProvider::MeterProvider(std::string library_name, std::string library_version) noexcept
: meter_(new Meter(library_name, library_version))
{}
opentelemetry::nostd::shared_ptr<opentelemetry::metrics::Meter> MeterProvider::GetMeter(
nostd::string_view library_name,
nostd::string_view library_version) noexcept
{
return opentelemetry::nostd::shared_ptr<opentelemetry::metrics::Meter>(meter_);
}
} // namespace metrics
} // namespace sdk
OPENTELEMETRY_END_NAMESPACE
#endif
| 26.851852 | 92 | 0.794483 | sfc-gh-jallie |
903d55a5baaae68e5b165e763b3df96c15919a16 | 323 | cpp | C++ | src/main.cpp | Hello56721/random-opengl-project | 20cb1ae49132cf5787437ce1fd83e3144939c9ad | [
"MIT"
] | null | null | null | src/main.cpp | Hello56721/random-opengl-project | 20cb1ae49132cf5787437ce1fd83e3144939c9ad | [
"MIT"
] | null | null | null | src/main.cpp | Hello56721/random-opengl-project | 20cb1ae49132cf5787437ce1fd83e3144939c9ad | [
"MIT"
] | null | null | null | #include <iostream>
#include <glad/glad.h>
#include <GLFW/glfw3.h>
#include <opengl-debug.hpp>
#include <window.hpp>
#include <program.hpp>
// And of course, the main function
int main() {
Program program;
while (!glfwWindowShouldClose(Window::window)) {
program.update();
}
return 0;
} | 17 | 52 | 0.640867 | Hello56721 |
90445022c5d6975e4c7ca650e72257f4c8fad7b2 | 913 | cpp | C++ | 00006_zigzag-conversion/191004-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | 6 | 2019-10-23T01:07:29.000Z | 2021-12-05T01:51:16.000Z | 00006_zigzag-conversion/191004-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | null | null | null | 00006_zigzag-conversion/191004-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | 1 | 2021-12-03T06:54:57.000Z | 2021-12-03T06:54:57.000Z | // https://leetcode-cn.com/problems/zigzag-conversion/
#include <string>
using namespace std;
class Solution {
public:
string convert(string s, int numRows) {
if (numRows <= 1) return s;
const char* p = s.c_str();
int n = s.size();
int step = (numRows - 1) * 2;
string r;
r.resize(n);
int t = 0;
for (int j = 0; j < numRows; ++j) {
for (int i = 0; i < n + numRows; i += step) {
for (int k = ((j == 0 || j == (numRows - 1)) ? 1 : -1); k <= 1; k += 2) {
int index = i + k * j;
if (index >= 0 && index < n) {
r[t++] = p[index];
}
}
}
}
return r;
}
};
int main()
{
Solution s;
printf("%s\n", s.convert("LEETCODEISHIRING", 3).c_str()); // answer: "LCIRETOESIIGEDHN"
printf("%s\n", s.convert("LEETCODEISHIRING", 4).c_str()); // answer: "LDREOEIIECIHNTSG"
printf("%s\n", s.convert("LEETCODEISHIRING", 1).c_str()); // answer: "LEETCODEISHIRING"
return 0;
}
| 24.675676 | 88 | 0.553122 | yanlinlin82 |
90486964ebe3219d3dbd2e33cecd3bdce332af76 | 355 | cc | C++ | cores/pico/picorv32/demo/src/decode_riscv_XORI.cc | yuex1994/iw_imdb | 946ce12d1b28075bfc513b2baf0f30601d36558c | [
"MIT"
] | 1 | 2020-05-30T17:34:03.000Z | 2020-05-30T17:34:03.000Z | cores/pico/picorv32/demo/src/decode_riscv_XORI.cc | yuex1994/iw_imdb | 946ce12d1b28075bfc513b2baf0f30601d36558c | [
"MIT"
] | null | null | null | cores/pico/picorv32/demo/src/decode_riscv_XORI.cc | yuex1994/iw_imdb | 946ce12d1b28075bfc513b2baf0f30601d36558c | [
"MIT"
] | 1 | 2020-02-26T03:35:51.000Z | 2020-02-26T03:35:51.000Z | #include "riscv.h"
bool riscv::decode_riscv_XORI() {
if (!1) {
return false;
}
uint7_t tmp_15 = 0 - 1;
c_15 = static_cast<uint7_t> ((riscv_inst >> 0) & tmp_15);
c_5613 = c_15 == 19;
uint3_t tmp_23 = 0 - 1;
c_23 = static_cast<uint3_t> ((riscv_inst >> 12) & tmp_23);
c_5609 = c_23 == 4;
c_5615 = (c_5613 & c_5609);
return c_5615;
};
| 23.666667 | 60 | 0.605634 | yuex1994 |
904e501349f30392f5e29aa8ea7ad3d65bfc9114 | 8,173 | cpp | C++ | src/ripple/protocol/impl/TxFormats.cpp | tlongwell-ripple/rippled | 4e3dc0e820aa5bcf187ebe1b5d4471932845cc89 | [
"BSL-1.0"
] | 3 | 2020-04-22T10:43:31.000Z | 2020-04-22T10:43:35.000Z | src/ripple/protocol/impl/TxFormats.cpp | tlongwell-ripple/rippled | 4e3dc0e820aa5bcf187ebe1b5d4471932845cc89 | [
"BSL-1.0"
] | 10 | 2020-02-03T14:00:08.000Z | 2020-04-23T17:29:21.000Z | src/ripple/protocol/impl/TxFormats.cpp | tlongwell-ripple/rippled | 4e3dc0e820aa5bcf187ebe1b5d4471932845cc89 | [
"BSL-1.0"
] | 3 | 2020-04-08T15:35:27.000Z | 2021-06-17T15:39:01.000Z | //------------------------------------------------------------------------------
/*
This file is part of rippled: https://github.com/ripple/rippled
Copyright (c) 2012, 2013 Ripple Labs Inc.
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
//==============================================================================
#include <ripple/protocol/TxFormats.h>
#include <ripple/protocol/jss.h>
namespace ripple {
TxFormats::TxFormats ()
{
// Fields shared by all txFormats:
static const std::initializer_list<SOElement> commonFields
{
{ sfTransactionType, soeREQUIRED },
{ sfFlags, soeOPTIONAL },
{ sfSourceTag, soeOPTIONAL },
{ sfAccount, soeREQUIRED },
{ sfSequence, soeREQUIRED },
{ sfPreviousTxnID, soeOPTIONAL }, // emulate027
{ sfLastLedgerSequence, soeOPTIONAL },
{ sfAccountTxnID, soeOPTIONAL },
{ sfFee, soeREQUIRED },
{ sfOperationLimit, soeOPTIONAL },
{ sfMemos, soeOPTIONAL },
{ sfSigningPubKey, soeREQUIRED },
{ sfTxnSignature, soeOPTIONAL },
{ sfSigners, soeOPTIONAL }, // submit_multisigned
};
add (jss::AccountSet, ttACCOUNT_SET,
{
{ sfEmailHash, soeOPTIONAL },
{ sfWalletLocator, soeOPTIONAL },
{ sfWalletSize, soeOPTIONAL },
{ sfMessageKey, soeOPTIONAL },
{ sfDomain, soeOPTIONAL },
{ sfTransferRate, soeOPTIONAL },
{ sfSetFlag, soeOPTIONAL },
{ sfClearFlag, soeOPTIONAL },
{ sfTickSize, soeOPTIONAL },
},
commonFields);
add (jss::TrustSet, ttTRUST_SET,
{
{ sfLimitAmount, soeOPTIONAL },
{ sfQualityIn, soeOPTIONAL },
{ sfQualityOut, soeOPTIONAL },
},
commonFields);
add (jss::OfferCreate, ttOFFER_CREATE,
{
{ sfTakerPays, soeREQUIRED },
{ sfTakerGets, soeREQUIRED },
{ sfExpiration, soeOPTIONAL },
{ sfOfferSequence, soeOPTIONAL },
},
commonFields);
add (jss::OfferCancel, ttOFFER_CANCEL,
{
{ sfOfferSequence, soeREQUIRED },
},
commonFields);
add (jss::SetRegularKey, ttREGULAR_KEY_SET,
{
{ sfRegularKey, soeOPTIONAL },
},
commonFields);
add (jss::Payment, ttPAYMENT,
{
{ sfDestination, soeREQUIRED },
{ sfAmount, soeREQUIRED },
{ sfSendMax, soeOPTIONAL },
{ sfPaths, soeDEFAULT },
{ sfInvoiceID, soeOPTIONAL },
{ sfDestinationTag, soeOPTIONAL },
{ sfDeliverMin, soeOPTIONAL },
},
commonFields);
add (jss::EscrowCreate, ttESCROW_CREATE,
{
{ sfDestination, soeREQUIRED },
{ sfAmount, soeREQUIRED },
{ sfCondition, soeOPTIONAL },
{ sfCancelAfter, soeOPTIONAL },
{ sfFinishAfter, soeOPTIONAL },
{ sfDestinationTag, soeOPTIONAL },
},
commonFields);
add (jss::EscrowFinish, ttESCROW_FINISH,
{
{ sfOwner, soeREQUIRED },
{ sfOfferSequence, soeREQUIRED },
{ sfFulfillment, soeOPTIONAL },
{ sfCondition, soeOPTIONAL },
},
commonFields);
add (jss::EscrowCancel, ttESCROW_CANCEL,
{
{ sfOwner, soeREQUIRED },
{ sfOfferSequence, soeREQUIRED },
},
commonFields);
add (jss::EnableAmendment, ttAMENDMENT,
{
{ sfLedgerSequence, soeREQUIRED },
{ sfAmendment, soeREQUIRED },
},
commonFields);
add (jss::SetFee, ttFEE,
{
{ sfLedgerSequence, soeOPTIONAL },
{ sfBaseFee, soeREQUIRED },
{ sfReferenceFeeUnits, soeREQUIRED },
{ sfReserveBase, soeREQUIRED },
{ sfReserveIncrement, soeREQUIRED },
},
commonFields);
add (jss::TicketCreate, ttTICKET_CREATE,
{
{ sfTarget, soeOPTIONAL },
{ sfExpiration, soeOPTIONAL },
},
commonFields);
add (jss::TicketCancel, ttTICKET_CANCEL,
{
{ sfTicketID, soeREQUIRED },
},
commonFields);
// The SignerEntries are optional because a SignerList is deleted by
// setting the SignerQuorum to zero and omitting SignerEntries.
add (jss::SignerListSet, ttSIGNER_LIST_SET,
{
{ sfSignerQuorum, soeREQUIRED },
{ sfSignerEntries, soeOPTIONAL },
},
commonFields);
add (jss::PaymentChannelCreate, ttPAYCHAN_CREATE,
{
{ sfDestination, soeREQUIRED },
{ sfAmount, soeREQUIRED },
{ sfSettleDelay, soeREQUIRED },
{ sfPublicKey, soeREQUIRED },
{ sfCancelAfter, soeOPTIONAL },
{ sfDestinationTag, soeOPTIONAL },
},
commonFields);
add (jss::PaymentChannelFund, ttPAYCHAN_FUND,
{
{ sfPayChannel, soeREQUIRED },
{ sfAmount, soeREQUIRED },
{ sfExpiration, soeOPTIONAL },
},
commonFields);
add (jss::PaymentChannelClaim, ttPAYCHAN_CLAIM,
{
{ sfPayChannel, soeREQUIRED },
{ sfAmount, soeOPTIONAL },
{ sfBalance, soeOPTIONAL },
{ sfSignature, soeOPTIONAL },
{ sfPublicKey, soeOPTIONAL },
},
commonFields);
add (jss::CheckCreate, ttCHECK_CREATE,
{
{ sfDestination, soeREQUIRED },
{ sfSendMax, soeREQUIRED },
{ sfExpiration, soeOPTIONAL },
{ sfDestinationTag, soeOPTIONAL },
{ sfInvoiceID, soeOPTIONAL },
},
commonFields);
add (jss::CheckCash, ttCHECK_CASH,
{
{ sfCheckID, soeREQUIRED },
{ sfAmount, soeOPTIONAL },
{ sfDeliverMin, soeOPTIONAL },
},
commonFields);
add (jss::CheckCancel, ttCHECK_CANCEL,
{
{ sfCheckID, soeREQUIRED },
},
commonFields);
add (jss::AccountDelete, ttACCOUNT_DELETE,
{
{ sfDestination, soeREQUIRED },
{ sfDestinationTag, soeOPTIONAL },
},
commonFields);
add (jss::DepositPreauth, ttDEPOSIT_PREAUTH,
{
{ sfAuthorize, soeOPTIONAL },
{ sfUnauthorize, soeOPTIONAL },
},
commonFields);
}
TxFormats const&
TxFormats::getInstance ()
{
static TxFormats const instance;
return instance;
}
} // ripple
| 33.633745 | 80 | 0.497002 | tlongwell-ripple |
904f2f402ba0e71c87448b98e6f074bcde1e5edb | 12,076 | cpp | C++ | 02.TestsFirst/11.ThreadingIsOrthogonal/Test/CallbackTimerQueueTest.cpp | XoDeR/CppTdd | dd06f234b121965a6144be6d82d8aedd067d9caa | [
"MIT"
] | null | null | null | 02.TestsFirst/11.ThreadingIsOrthogonal/Test/CallbackTimerQueueTest.cpp | XoDeR/CppTdd | dd06f234b121965a6144be6d82d8aedd067d9caa | [
"MIT"
] | null | null | null | 02.TestsFirst/11.ThreadingIsOrthogonal/Test/CallbackTimerQueueTest.cpp | XoDeR/CppTdd | dd06f234b121965a6144be6d82d8aedd067d9caa | [
"MIT"
] | null | null | null | #include "CallbackTimerQueueTest.h"
#include "../../Tools/CallbackTimerQueue.h"
#include "../Mock/MockTickCountProvider.h"
#include "../Mock/LoggingCallbackTimer.h"
#include "../../Tools/Utils.h"
#include "../../TestTools/TestException.h"
using AmstelTech::Test::CTestException;
using AmstelTech::Win32::Output;
using AmstelTech::Win32::_tstring;
using AmstelTech::Win32::Mock::CMockTickCountProvider;
using AmstelTech::Win32::Mock::CLoggingCallbackTimer;
namespace AmstelTech
{
namespace Win32
{
namespace Test
{
///////////////////////////////////////////////////////////////////////////////
// CCallbackTimerQueueTest
///////////////////////////////////////////////////////////////////////////////
void CCallbackTimerQueueTest::TestAll()
{
TestConstruct();
TestTimer();
TestCancelTimer();
TestTickCountWrap();
TestMaxTimeout();
TestMultipleTimers();
}
void CCallbackTimerQueueTest::TestConstruct()
{
const _tstring functionName = _T("CCallbackTimerQueueTest::TestConstruct");
Output(functionName + _T(" - start"));
CCallbackTimerQueue timerQueue;
CMockTickCountProvider tickProvider;
CCallbackTimerQueue timerQueue2(tickProvider);
tickProvider.CheckResult(_T("|"));
Output(functionName + _T(" - stop"));
}
void CCallbackTimerQueueTest::TestTimer()
{
const _tstring functionName = _T("CCallbackTimerQueueTest::TestTimer");
Output(functionName + _T(" - start"));
CMockTickCountProvider tickProvider;
CCallbackTimerQueue timerQueue(tickProvider);
tickProvider.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
CLoggingCallbackTimer timer;
timerQueue.SetTimer(timer, 100, 1);
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
// Prove that time is standing still
THROW_ON_FAILURE(functionName, 100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
timer.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, 100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
tickProvider.SetTickCount(100);
THROW_ON_FAILURE(functionName, 0 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
timer.CheckResult(_T("|OnTimer: 1|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
Output(functionName + _T(" - stop"));
}
void CCallbackTimerQueueTest::TestCancelTimer()
{
const _tstring functionName = _T("CCallbackTimerQueueTest::TestCancelTimer");
Output(functionName + _T(" - start"));
CMockTickCountProvider tickProvider;
CCallbackTimerQueue timerQueue(tickProvider);
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
CLoggingCallbackTimer timer;
CCallbackTimerQueue::Handle handle = timerQueue.SetTimer(timer, 100, 1);
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
THROW_ON_FAILURE(functionName, 100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
THROW_ON_FAILURE(functionName, true == timerQueue.CancelTimer(handle));
timer.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, false == timerQueue.CancelTimer(handle));
THROW_ON_FAILURE(functionName, false == timerQueue.CancelTimer(0));
tickProvider.SetTickCount(100);
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|"));
timer.CheckResult(_T("|"));
Output(functionName + _T(" - stop"));
}
void CCallbackTimerQueueTest::TestTickCountWrap()
{
const _tstring functionName = _T("CCallbackTimerQueueTest::TestTickCountWrap");
Output(functionName + _T(" - start"));
const DWORD rollOver = 0;
const DWORD beforeRollOver = rollOver - 1000;
CMockTickCountProvider tickProvider(beforeRollOver);
CCallbackTimerQueue timerQueue(tickProvider);
tickProvider.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
CLoggingCallbackTimer timer;
timerQueue.SetTimer(timer, 1100, 1);
const _tstring resultBeforeRollOver = _T("|GetTickCount: ") + ToString(beforeRollOver) + _T("|");
tickProvider.CheckResult(resultBeforeRollOver);
THROW_ON_FAILURE(functionName, 1100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(resultBeforeRollOver);
timerQueue.HandleTimeouts();
tickProvider.CheckResult(resultBeforeRollOver);
timer.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, 1100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(resultBeforeRollOver);
tickProvider.SetTickCount(rollOver);
THROW_ON_FAILURE(functionName, 100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
timer.CheckResult(_T("|"));
tickProvider.SetTickCount(100);
THROW_ON_FAILURE(functionName, 0 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
timer.CheckResult(_T("|OnTimer: 1|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
tickProvider.SetTickCount(beforeRollOver);
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
DWORD timeout2 = (0xFFFFFFFE / 4 * 3);
timerQueue.SetTimer(timer, timeout2, 1);
tickProvider.CheckResult(resultBeforeRollOver);
THROW_ON_FAILURE(functionName, timeout2 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(resultBeforeRollOver);
timerQueue.HandleTimeouts();
tickProvider.CheckResult(resultBeforeRollOver);
timer.CheckResult(_T("|"));
Output(functionName + _T(" - stop"));
}
void CCallbackTimerQueueTest::TestMaxTimeout()
{
const _tstring functionName = _T("CCallbackTimerQueueTest::TestMaxTimeout");
Output(functionName + _T(" - start"));
CMockTickCountProvider tickProvider(1000);
{
CCallbackTimerQueue timerQueue(tickProvider);
tickProvider.CheckResult(_T("|"));
CLoggingCallbackTimer timer;
const DWORD maxTimeout = (0xFFFFFFFF / 4 * 3);
CCallbackTimerQueue::Handle handle = timerQueue.SetTimer(timer, maxTimeout, 1);
tickProvider.CheckResult(_T("|GetTickCount: 1000|"));
timerQueue.CancelTimer(handle);
const DWORD minTimeout = 0;
handle = timerQueue.SetTimer(timer, minTimeout, 1);
tickProvider.CheckResult(_T("|GetTickCount: 1000|"));
timerQueue.CancelTimer(handle);
const DWORD illegalTimeout = maxTimeout + 1;
THROW_ON_NO_EXCEPTION_3(functionName, timerQueue.SetTimer, timer, illegalTimeout, 1);
}
{
CCallbackTimerQueue timerQueue(1000, tickProvider);
tickProvider.CheckResult(_T("|"));
CLoggingCallbackTimer timer;
const DWORD maxTimeout = 1000;
CCallbackTimerQueue::Handle handle = timerQueue.SetTimer(timer, maxTimeout, 1);
tickProvider.CheckResult(_T("|GetTickCount: 1000|"));
timerQueue.CancelTimer(handle);
const DWORD minTimeout = 0;
handle = timerQueue.SetTimer(timer, minTimeout, 1);
tickProvider.CheckResult(_T("|GetTickCount: 1000|"));
timerQueue.CancelTimer(handle);
const DWORD illegalTimeout = maxTimeout + 1;
THROW_ON_NO_EXCEPTION_3(functionName, timerQueue.SetTimer, timer, illegalTimeout, 1);
}
Output(functionName + _T(" - stop"));
}
void CCallbackTimerQueueTest::TestMultipleTimers()
{
const _tstring functionName = _T("CCallbackTimerQueueTest::TestMultipleTimers");
Output(functionName + _T(" - start"));
CMockTickCountProvider tickProvider;
CCallbackTimerQueue timerQueue(tickProvider);
tickProvider.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|"));
CLoggingCallbackTimer timer1;
CLoggingCallbackTimer timer2;
CLoggingCallbackTimer timer3;
CLoggingCallbackTimer timer4;
CLoggingCallbackTimer timer5;
CLoggingCallbackTimer timer6;
timerQueue.SetTimer(timer1, 300, 1);
timerQueue.SetTimer(timer2, 100, 2);
timerQueue.SetTimer(timer3, 200, 3);
timerQueue.SetTimer(timer4, 150, 4);
timerQueue.SetTimer(timer5, 150, 5);
timerQueue.SetTimer(timer6, 160, 6);
tickProvider.CheckResult(_T("|GetTickCount: 0|GetTickCount: 0|GetTickCount: 0|GetTickCount: 0|GetTickCount: 0|GetTickCount: 0|"));
THROW_ON_FAILURE(functionName, 100 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 0|"));
timer1.CheckResult(_T("|"));
timer2.CheckResult(_T("|"));
timer3.CheckResult(_T("|"));
timer4.CheckResult(_T("|"));
timer5.CheckResult(_T("|"));
timer6.CheckResult(_T("|"));
tickProvider.SetTickCount(100);
THROW_ON_FAILURE(functionName, 0 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
timer1.CheckResult(_T("|"));
timer2.CheckResult(_T("|OnTimer: 2|"));
timer3.CheckResult(_T("|"));
timer4.CheckResult(_T("|"));
timer5.CheckResult(_T("|"));
timer6.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, 50 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 100|"));
tickProvider.SetTickCount(155);
THROW_ON_FAILURE(functionName, 0 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 155|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 155|"));
timer1.CheckResult(_T("|"));
timer2.CheckResult(_T("|"));
timer3.CheckResult(_T("|"));
timer4.CheckResult(_T("|OnTimer: 4|"));
timer5.CheckResult(_T("|OnTimer: 5|"));
timer6.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, 5 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 155|"));
tickProvider.SetTickCount(201);
THROW_ON_FAILURE(functionName, 0 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 201|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 201|"));
timer1.CheckResult(_T("|"));
timer2.CheckResult(_T("|"));
timer3.CheckResult(_T("|OnTimer: 3|"));
timer4.CheckResult(_T("|"));
timer5.CheckResult(_T("|"));
timer6.CheckResult(_T("|OnTimer: 6|"));
THROW_ON_FAILURE(functionName, 99 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 201|"));
tickProvider.SetTickCount(300);
THROW_ON_FAILURE(functionName, 0 == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 300|"));
timerQueue.HandleTimeouts();
tickProvider.CheckResult(_T("|GetTickCount: 300|"));
timer1.CheckResult(_T("|OnTimer: 1|"));
timer2.CheckResult(_T("|"));
timer3.CheckResult(_T("|"));
timer4.CheckResult(_T("|"));
timer5.CheckResult(_T("|"));
timer6.CheckResult(_T("|"));
THROW_ON_FAILURE(functionName, INFINITE == timerQueue.GetNextTimeout());
tickProvider.CheckResult(_T("|GetTickCount: 300|"));
// timerQueue.SetTimer(timer1, 100, 1);
// timerQueue.SetTimer(timer2, 200, 2);
Output(functionName + _T(" - stop"));
}
} // End of namespace Test
} // End of namespace Win32
} // End of namespace AmstelTech | 26.082073 | 133 | 0.704538 | XoDeR |
90507d81e9fb35af0688e947975a9a278a1e7624 | 582 | cpp | C++ | Cpp/Maths/Fibonacci number.cpp | akshat-6397/hacktoberfest2021-easy | 4e71ab3cfc5e5514d81ca3eaacd8c6e2483cb703 | [
"MIT"
] | 15 | 2021-10-05T08:12:12.000Z | 2021-10-20T07:54:23.000Z | Cpp/Maths/Fibonacci number.cpp | akshat-6397/hacktoberfest2021-easy | 4e71ab3cfc5e5514d81ca3eaacd8c6e2483cb703 | [
"MIT"
] | 18 | 2021-10-05T08:09:12.000Z | 2021-10-20T07:47:43.000Z | Cpp/Maths/Fibonacci number.cpp | akshat-6397/hacktoberfest2021-easy | 4e71ab3cfc5e5514d81ca3eaacd8c6e2483cb703 | [
"MIT"
] | 54 | 2021-10-05T07:49:59.000Z | 2021-12-07T17:18:07.000Z | #include <iostream>
using namespace std;
int fibonacci(int n)
{
if (n <= 0)
{
return 0;
}
else if (n == 1)
{
return 1;
}
else
{
return fibonacci(n - 1) + fibonacci(n - 2);
}
}
int main()
{
int n;
do
{
cout << "Enter the number that you want for Fibonacci numbers(starting from 3): ";
cin >> n;
} while (n < 3);
cout << "The first " << n << " Fibonacci numbers are:\n";
for (int x = 0; x < n; x++)
{
cout << fibonacci(x) << " ";
}
cout << endl;
return 0;
} | 16.166667 | 90 | 0.453608 | akshat-6397 |
9051b6d4f6e93a540fcac6d8da28175be7d59935 | 8,165 | cpp | C++ | src/cursor.cpp | klei1984/max | dc0f9108bbcfd4cb73ea101883d551c612097469 | [
"MIT"
] | 19 | 2020-02-06T17:41:39.000Z | 2022-03-31T07:38:15.000Z | src/cursor.cpp | klei1984/max | dc0f9108bbcfd4cb73ea101883d551c612097469 | [
"MIT"
] | 9 | 2020-02-14T15:46:46.000Z | 2021-12-22T16:35:53.000Z | src/cursor.cpp | klei1984/max | dc0f9108bbcfd4cb73ea101883d551c612097469 | [
"MIT"
] | null | null | null | /* Copyright (c) 2021 M.A.X. Port Team
*
* 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 "cursor.hpp"
extern "C" {
#include "gnw.h"
}
#include "enums.hpp"
#include "resource_manager.hpp"
#include "units_manager.hpp"
#define CURSOR_CURSOR_COUNT 30
struct Cursor_Descriptor {
Rect bounds;
unsigned short frame_count;
char* data;
};
static ResourceID Cursor_ResourceLut[CURSOR_CURSOR_COUNT] = {
HIDDNPTR, HANDPTR, ARROW_N, ARROW_NE, ARROW_E, ARROW_SE, ARROW_S, ARROW_SW, ARROW_W, ARROW_NW,
MAP_PTR, MINI_PTR, FRND_FIX, FRND_XFR, FRND_FUE, PTR_RLD, FRND_LOD, FRND_PTR, ENMY_PTR, PTR_FTRG,
UNIT_GO, UNIT_NGO, WAY_PTR, GROUPPTR, ACTVTPTR, MAP_PTR, STEALPTR, DISBLPTR, PTR_PATH, PTR_HELP};
static Cursor_Descriptor Cursor_CursorDescriptorLut[CURSOR_CURSOR_COUNT];
static unsigned char Cursor_DefaultWindowCursorLut[] = {
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_MAP, CURSOR_ARROW_N, CURSOR_ARROW_NE, CURSOR_ARROW_NE,
CURSOR_ARROW_E, CURSOR_ARROW_SE, CURSOR_ARROW_SE, CURSOR_ARROW_S, CURSOR_ARROW_SW, CURSOR_ARROW_SW,
CURSOR_ARROW_W, CURSOR_ARROW_NW, CURSOR_ARROW_NW, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND,
CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND, CURSOR_HAND};
static unsigned char Cursor_ActiveCursorIndex = CURSOR_HIDDEN;
static void Cursor_DrawAttackPowerCursorHelper(int target_current_hits, int attacker_damage, int target_base_hits,
unsigned char cursor_index) {
Cursor_Descriptor* cursor = &Cursor_CursorDescriptorLut[cursor_index];
int lrx = cursor->bounds.lrx - 18;
int lry = cursor->bounds.lry + 15;
char* data = &cursor->data[lrx + cursor->bounds.ulx * lry];
if (target_base_hits) {
if (attacker_damage > target_current_hits) {
attacker_damage = target_current_hits;
}
target_current_hits -= attacker_damage;
attacker_damage = (attacker_damage + target_current_hits) * 35 / target_base_hits;
target_current_hits = target_current_hits * 35 / target_base_hits;
attacker_damage -= target_current_hits;
draw_box(reinterpret_cast<unsigned char*>(data), cursor->bounds.ulx, 0, 0, 36, 4, 0);
if (target_current_hits) {
buf_fill(reinterpret_cast<unsigned char*>(&data[cursor->bounds.ulx + 1]), target_current_hits, 3,
cursor->bounds.ulx, 2);
}
if (attacker_damage) {
buf_fill(reinterpret_cast<unsigned char*>(&data[cursor->bounds.ulx + 1 + target_current_hits]),
attacker_damage, 3, cursor->bounds.ulx, 1);
}
if ((attacker_damage + target_current_hits) < 35) {
buf_fill(
reinterpret_cast<unsigned char*>(&data[cursor->bounds.ulx + 1 + target_current_hits + attacker_damage]),
35 - target_current_hits - attacker_damage, 3, cursor->bounds.ulx, data[0]);
}
} else {
buf_fill(reinterpret_cast<unsigned char*>(data), 37, 5, cursor->bounds.ulx, data[0]);
}
}
void Cursor_Init() {
for (int cursor_index = 0; cursor_index < CURSOR_CURSOR_COUNT; ++cursor_index) {
struct SpriteHeader* sprite =
reinterpret_cast<SpriteHeader*>(ResourceManager_LoadResource(Cursor_ResourceLut[cursor_index]));
Cursor_Descriptor* cursor = &Cursor_CursorDescriptorLut[cursor_index];
cursor->data = sprite->data;
if (sprite) {
cursor->bounds.ulx = sprite->ulx;
cursor->bounds.uly = sprite->uly;
cursor->bounds.lrx = sprite->width;
cursor->bounds.lry = sprite->height;
cursor->frame_count = 1;
if (cursor->bounds.ulx < cursor->bounds.uly) {
cursor->frame_count = cursor->bounds.uly / cursor->bounds.ulx;
cursor->bounds.uly = cursor->bounds.uly / cursor->frame_count;
}
}
}
}
unsigned char Cursor_GetCursor() { return Cursor_ActiveCursorIndex; }
unsigned char Cursor_GetDefaultWindowCursor(unsigned char window_index) {
return Cursor_DefaultWindowCursorLut[window_index];
}
void Cursor_SetCursor(unsigned char cursor_index) {
if (cursor_index != Cursor_ActiveCursorIndex) {
Cursor_Descriptor* cursor = &Cursor_CursorDescriptorLut[cursor_index];
if (cursor->data) {
if (cursor->frame_count <= 1) {
mouse_set_shape(reinterpret_cast<unsigned char*>(cursor->data), cursor->bounds.ulx, cursor->bounds.uly,
cursor->bounds.ulx, cursor->bounds.lrx, cursor->bounds.lry, cursor->data[0]);
} else {
mouse_set_anim_frames(reinterpret_cast<unsigned char*>(cursor->data), cursor->frame_count, 0,
cursor->bounds.uly, cursor->bounds.ulx, cursor->bounds.lrx, cursor->bounds.lry,
cursor->data[0], 200);
}
}
Cursor_ActiveCursorIndex = cursor_index;
}
}
void Cursor_DrawAttackPowerCursor(UnitInfo* selected_unit, UnitInfo* target_unit, unsigned char cursor_index) {
if (target_unit) {
Cursor_DrawAttackPowerCursorHelper(target_unit->hits,
UnitsManager_CalculateAttackDamage(selected_unit, target_unit, 0),
target_unit->GetBaseValues()->GetAttribute(ATTRIB_HITS), cursor_index);
} else {
Cursor_DrawAttackPowerCursorHelper(0, 0, 0, cursor_index);
}
}
void Cursor_DrawStealthActionChanceCursor(int experience_level, unsigned char cursor_index) {
Cursor_Descriptor* cursor = &Cursor_CursorDescriptorLut[cursor_index];
int lrx = cursor->bounds.lrx - 18;
int lry = cursor->bounds.lry + 15;
char* data = &cursor->data[lrx + cursor->bounds.ulx * lry];
int chance = experience_level * 35 / 100;
int reminder = 35 - experience_level * 35 / 100;
draw_box(reinterpret_cast<unsigned char*>(data), cursor->bounds.ulx, 0, 0, 36, 4, 0);
if (chance) {
buf_fill(reinterpret_cast<unsigned char*>(&data[cursor->bounds.ulx + 1]), chance, 3, cursor->bounds.ulx, 1);
}
if (reminder) {
buf_fill(reinterpret_cast<unsigned char*>(&data[cursor->bounds.ulx + 1 + chance]), reminder, 3,
cursor->bounds.ulx, data[0]);
}
}
| 45.870787 | 121 | 0.655848 | klei1984 |
9057f732b231e8ec49e72f4b6de96df300dcf1fd | 1,851 | cpp | C++ | enzyme/test/Integration/ReverseMode/wcout.cpp | aneax/Enzyme | e9084808993c94661f33ec29955499b51a8ada03 | [
"Apache-2.0"
] | 31 | 2022-02-06T21:35:47.000Z | 2022-03-28T16:27:50.000Z | enzyme/test/Integration/ReverseMode/wcout.cpp | aneax/Enzyme | e9084808993c94661f33ec29955499b51a8ada03 | [
"Apache-2.0"
] | 47 | 2022-02-06T19:30:30.000Z | 2022-03-25T15:56:25.000Z | enzyme/test/Integration/ReverseMode/wcout.cpp | aneax/Enzyme | e9084808993c94661f33ec29955499b51a8ada03 | [
"Apache-2.0"
] | 3 | 2022-03-13T13:23:25.000Z | 2022-03-16T09:46:55.000Z | // RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O0 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O1 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O2 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O3 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O0 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -enzyme-inline=1 -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O1 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -enzyme-inline=1 -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O2 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -enzyme-inline=1 -S
// RUN: %clang++ -std=c++11 -fno-exceptions -ffast-math -O3 %s -S -emit-llvm -o - | %opt - %loadEnzyme -enzyme -enzyme-inline=1 -S
#include <iostream>
#include "test_utils.h"
#include <stdlib.h>
#include <stdio.h>
#include <stdbool.h>
#include <math.h>
extern double __enzyme_autodiff(void*, double);
// testing both std::wcout and std::locale
// https://en.cppreference.com/w/cpp/locale/locale
double fn(double vec) {
std::wcout.put('f');
std::wcout << 1 << 1.0 << "somerandomchars";
std::locale::global(std::locale(""));
std::wcout.sync_with_stdio();
std::wcout.imbue(std::locale());
// Currently not working
// std::wcout << "User-preferred locale setting is ";
// std::wcout << std::locale("").name().c_str();
// std::wcout << 1000.01 << '\n';
// std::wcout << 1000.01 << std::endl;
// std::wcout << 1000.01 << std::flush;
return vec * vec;
}
int main() {
double x = 2.1;
double dsq = __enzyme_autodiff((void*)fn, x);
APPROX_EQ(dsq, 2 * x, 1e-7);
}
| 39.382979 | 130 | 0.615883 | aneax |
905c64a3ded3becd903d39999c1c5b3e609a332b | 293 | cpp | C++ | 3D_Demo/source/main.cpp | subr3v/s-engine | d77b9ccd0fff3982a303f14ce809691a570f61a3 | [
"MIT"
] | 2 | 2016-04-01T21:10:33.000Z | 2018-02-26T19:36:56.000Z | 3D_Demo/source/main.cpp | subr3v/s-engine | d77b9ccd0fff3982a303f14ce809691a570f61a3 | [
"MIT"
] | 1 | 2017-04-05T01:33:08.000Z | 2017-04-05T01:33:08.000Z | 3D_Demo/source/main.cpp | subr3v/s-engine | d77b9ccd0fff3982a303f14ce809691a570f61a3 | [
"MIT"
] | null | null | null | #include "SEngine.hpp"
#include "SponzaScene.h"
// Entry point. The program start here
int WINAPI WinMain (HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR szCmdLine, int nCmdShow)
{
SEngine::Init(hInstance, nCmdShow);
SEngine::Run(new FSponzaScene());
SEngine::Shutdown();
return 0;
}
| 24.416667 | 95 | 0.750853 | subr3v |
905d24abc8ead88a8786bc479e86b02b966a48d6 | 4,345 | cpp | C++ | data-manager/tests/server/performanceServer/performanceServer.integ.cpp | Saafke/4dm | 68e235164afb1f127def35e9c15ca883ec1426d4 | [
"MIT"
] | 8 | 2021-03-16T06:48:57.000Z | 2021-11-30T09:34:09.000Z | data-manager/tests/server/performanceServer/performanceServer.integ.cpp | Saafke/4dm | 68e235164afb1f127def35e9c15ca883ec1426d4 | [
"MIT"
] | null | null | null | data-manager/tests/server/performanceServer/performanceServer.integ.cpp | Saafke/4dm | 68e235164afb1f127def35e9c15ca883ec1426d4 | [
"MIT"
] | 3 | 2021-05-02T15:38:17.000Z | 2021-07-07T09:19:48.000Z | #include "gtest/gtest.h"
#include <stdio.h>
#include <sys/socket.h>
#include <stdlib.h>
#include <netinet/in.h>
#include <string.h>
#include <arpa/inet.h>
#include <sys/ioctl.h>
#include "boost/chrono.hpp"
#include "boost/thread/thread.hpp"
#include "src/server/performanceServer/PerformanceMeasureTCPServer.hpp"
#define PORT 5959
#define TEST_DURATION 2
#ifndef htonll
#define htonll(x) ((1==htonl(1)) ? (x) : ((uint64_t)htonl((x) & 0xFFFFFFFF) << 32) | htonl((x) >> 32))
#endif
#ifndef ntohll
#define ntohll(x) ((1==ntohl(1)) ? (x) : ((uint64_t)ntohl((x) & 0xFFFFFFFF) << 32) | ntohl((x) >> 32))
#endif
performanceServer::PerformanceMeasureTCPServer* performanceServerInstance;
bool serverRun = false;
int performanceServerThreadFunction() {
boost::asio::io_context io_context;
performanceServerInstance = new performanceServer::PerformanceMeasureTCPServer(io_context, TEST_DURATION, PORT);
serverRun = true;
io_context.run();
return 0;
}
TEST(PerformanceServer, TestCalculationCorrectness) {
boost::thread* threadServerPerformance = new boost::thread(&performanceServerThreadFunction);
struct sockaddr_in address;
int sock = 0, valread;
struct sockaddr_in serv_addr;
char *message = new char[1500];
char buffer[150] = {0};
for(int c = 0; c <= 1500; c++) {
message[c] = 0xFF;
}
ASSERT_GE(sock = socket(AF_INET, SOCK_STREAM, 0), 0) << "Socket creation error";
memset(&serv_addr, '0', sizeof(serv_addr));
serv_addr.sin_family = AF_INET;
serv_addr.sin_port = htons(PORT);
ASSERT_GT(inet_pton(AF_INET, "127.0.0.1", &serv_addr.sin_addr), 0) << "Invalid address/ Address not supported";
// Wait for connection ready
int maxTry = 10;
while(maxTry >= 0 && serverRun == false) {
boost::this_thread::sleep_for(boost::chrono::milliseconds(100));
maxTry--;
}
ASSERT_TRUE(serverRun) << "Thread not start in time";
ASSERT_GE(connect(sock, (struct sockaddr *)&serv_addr, sizeof(serv_addr)), 0) << "Connection Failed";
int count;
int numberTry = 0;
while(numberTry < 20 && count == 0) {
ioctl(sock, FIONREAD, &count);
numberTry++;
boost::this_thread::sleep_for(boost::chrono::milliseconds(100));
}
ASSERT_NE(count, 0) << "No data available on response socket";
valread = read(sock, buffer, 150);
ASSERT_EQ(valread, 4) << "Expected 4 bytes, but " << valread << " bytes returned";
EXPECT_EQ(ntohl(*((uint32_t*)buffer)), TEST_DURATION);
#ifdef BOOST_CHRONO_HAS_CLOCK_STEADY
boost::chrono::steady_clock::time_point initTime = boost::chrono::steady_clock::now();
#else
boost::chrono::system_clock::time_point initTime = boost::chrono::system_clock::now();
#endif
bool sendingResult = true;
ssize_t result = send(sock, message, 1500, 0);
sendingResult = result && result >= 0;
result = send(sock, message, 1345, 0);
sendingResult = result && result >= 0;
result = send(sock, message, 1200, 0);
sendingResult = result && result >= 0;
EXPECT_EQ(sendingResult, true);
#ifdef BOOST_CHRONO_HAS_CLOCK_STEADY
boost::chrono::duration<double> remain = boost::chrono::steady_clock::now() - initTime;
#else
boost::chrono::duration<double> remain = boost::chrono::system_clock::now() - initTime;
#endif
while(remain.count() < TEST_DURATION + 0.1d) {
boost::this_thread::sleep_for(boost::chrono::milliseconds(100));
#ifdef BOOST_CHRONO_HAS_CLOCK_STEADY
remain = boost::chrono::steady_clock::now() - initTime;
#else
remain = boost::chrono::system_clock::now() - initTime;
#endif
}
std::cout << std::endl;
ssize_t sendByte = send(sock, message, 10, 0);
ASSERT_GT(sendByte, 0) << "Impossible write to socket";
boost::this_thread::sleep_for(boost::chrono::milliseconds(500));
ioctl(sock, FIONREAD, &count);
ASSERT_NE(count, 0) << "No data available on response socket";
valread = read(sock, buffer, 150);
ASSERT_EQ(valread, 16) << "Expected 16 bytes, but " << valread << " bytes returned";
EXPECT_EQ(ntohll(*((uint64_t*)buffer)), 1500 + 1345 + 1200);
EXPECT_EQ(ntohll(*((uint64_t*)(buffer + sizeof(uint64_t)))), (1500 + 1345 + 1200) / TEST_DURATION);
close(sock);
performanceServerInstance->Stop();
threadServerPerformance->interrupt();
}
| 30.598592 | 115 | 0.673188 | Saafke |
905e24bce343fff3f57214c777308b5ddbada387 | 2,767 | cpp | C++ | tests/src/texture/hipBindTex2DPitch.cpp | jiabaxie/HIP | 8de49ec202472b95612661aa7db940388b2bc3a9 | [
"MIT"
] | null | null | null | tests/src/texture/hipBindTex2DPitch.cpp | jiabaxie/HIP | 8de49ec202472b95612661aa7db940388b2bc3a9 | [
"MIT"
] | null | null | null | tests/src/texture/hipBindTex2DPitch.cpp | jiabaxie/HIP | 8de49ec202472b95612661aa7db940388b2bc3a9 | [
"MIT"
] | null | null | null | /*
Copyright (c) 2015 - present Advanced Micro Devices, Inc. All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
/*HIT_START
* BUILD: %t %s ../test_common.cpp
* TEST: %t
* HIT_END
*/
#include "test_common.h"
#define SIZE_H 8
#define SIZE_W 12
#define TYPE_t float
texture<TYPE_t, 2, hipReadModeElementType> tex;
// texture object is a kernel argument
__global__ void texture2dCopyKernel( TYPE_t* dst) {
int x = hipThreadIdx_x + hipBlockIdx_x * hipBlockDim_x;
int y = hipThreadIdx_y + hipBlockIdx_y * hipBlockDim_y;
if ( (x< SIZE_W) && (y< SIZE_H) ){
dst[SIZE_W*y+x] = tex2D(tex, x, y);
}
}
int main (void)
{
TYPE_t* B;
TYPE_t* A;
TYPE_t* devPtrB;
TYPE_t* devPtrA;
B = new TYPE_t[SIZE_H*SIZE_W];
A = new TYPE_t[SIZE_H*SIZE_W];
for(size_t i=1; i <= (SIZE_H*SIZE_W); i++){
A[i-1] = i;
}
size_t devPitchA, tex_ofs;
HIPCHECK(hipMallocPitch((void**)&devPtrA, &devPitchA ,SIZE_W*sizeof(TYPE_t), SIZE_H)) ;
HIPCHECK(hipMemcpy2D(devPtrA, devPitchA, A, SIZE_W*sizeof(TYPE_t),
SIZE_W*sizeof(TYPE_t), SIZE_H, hipMemcpyHostToDevice));
tex.normalized = false;
HIPCHECK(hipBindTexture2D(&tex_ofs, &tex, devPtrA, &tex.channelDesc,
SIZE_W, SIZE_H, devPitchA));
HIPCHECK(hipMalloc((void**)&devPtrB, SIZE_W*sizeof(TYPE_t)*SIZE_H)) ;
hipLaunchKernelGGL(texture2dCopyKernel, dim3(4,4,1), dim3(32,32,1), 0, 0, devPtrB);
hipDeviceSynchronize();
HIPCHECK(hipMemcpy2D(B, SIZE_W*sizeof(TYPE_t), devPtrB, SIZE_W*sizeof(TYPE_t),
SIZE_W*sizeof(TYPE_t), SIZE_H, hipMemcpyDeviceToHost));
HipTest::checkArray(A, B, SIZE_H, SIZE_W);
delete []A;
delete []B;
hipFree(devPtrA);
hipFree(devPtrB);
passed();
}
| 35.935065 | 91 | 0.70618 | jiabaxie |
90632fcb695a0f6bf8e1c6d00f52654f9cd84a11 | 17,413 | cpp | C++ | MIC/CoMCAISO/MCAXYCtrl.cpp | hnordquist/MIC | 18528ce80790925f05a409b0d08995576555298e | [
"Unlicense"
] | null | null | null | MIC/CoMCAISO/MCAXYCtrl.cpp | hnordquist/MIC | 18528ce80790925f05a409b0d08995576555298e | [
"Unlicense"
] | 1 | 2017-09-14T15:23:39.000Z | 2017-09-14T15:23:39.000Z | MIC/CoMCAISO/MCAXYCtrl.cpp | hnordquist/MIC | 18528ce80790925f05a409b0d08995576555298e | [
"Unlicense"
] | null | null | null | /*
This work was supported by the United States Member State Support Program to IAEA Safeguards;
the U.S. Department of Energy, Office of Nonproliferation and National Security, International
Safeguards Division; and the U.S. Department of Energy, Office of Safeguards and Security.
LA-CC-14-089. This software was exported from the United States in accordance with the Export
Administration Regulations. Diversion contrary to U.S. law prohibited.
Copyright 2015, Los Alamos National Security, LLC. This software application and associated
material ("The Software") was prepared by the Los Alamos National Security, LLC. (LANS), under
Contract DE-AC52-06NA25396 with the U.S. Department of Energy (DOE). All rights in the software
application and associated material are reserved by DOE on behalf of the Government and LANS
pursuant to the contract.
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 "Los Alamos National Security, LLC." 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 LOS ALAMOS NATIONAL SECURITY, LLC 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 LOS ALAMOS
NATIONAL SECURITY, LLC 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 CONTRAT, 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.
*/
// MCAXYCtrl.cpp
#include "stdafx.h"
#include "MCAXYCtrl.h"
#include "colors.h"
#include <math.h>
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// XYCtrl
CMCAXYCtrl::CMCAXYCtrl(UINT uMaxChannels)
{
//TRACE("CMCAXYCtrl::CTR\n");
CMCAXYCtrl::RegisterWndClass(AfxGetInstanceHandle());
m_colorLine = RGB(0,0,0);
m_colorDefault = RGB(0,0,255);
m_bRecalculateConstants = true;
m_iChannel = -1;
m_strTitle = _T("");
m_strLeftLabel = _T("");
m_strBottomLabel = _T("TEST");
m_crPixelColor = COLOR_RED;
m_uMaxChannels = uMaxChannels;
m_uMaxCountPerChannel = 0xFFFFFFFF; //DSPEC channels are 32-bits each
m_bHasFocus = false;
m_iThresholdLineOffsetFromTopInPixels = -1;
for (int i = 0; i < MAX_NUM_GRID_LINES; i++)
m_iHorizontalGridLinesOffsetFromTopInPixels[i] = -1;
}
CMCAXYCtrl::~CMCAXYCtrl()
{
//TRACE("CMCAXYCtrl::DTR\n");
Reset();
}
BEGIN_MESSAGE_MAP(CMCAXYCtrl, CWnd)
//{{AFX_MSG_MAP(CMCAXYCtrl)
ON_WM_PAINT()
ON_WM_SIZE()
ON_WM_LBUTTONDOWN()
ON_WM_KILLFOCUS()
ON_WM_KEYDOWN()
//}}AFX_MSG_MAP
END_MESSAGE_MAP()
/////////////////////////////////////////////////////////////////////////////
// XYCtrl message handlers
BOOL CMCAXYCtrl::RegisterWndClass(HINSTANCE hInstance)
{
//TRACE("CMCAXYCtrl::RegisterWndClass\n");
WNDCLASS wc;
wc.lpszClassName = "MCAXY_CTRL"; // matches class name in client
wc.hInstance = hInstance;
wc.lpfnWndProc = ::DefWindowProc;
wc.hCursor = ::LoadCursor(NULL, IDC_CROSS);
wc.hIcon = 0;
wc.lpszMenuName = NULL;
wc.hbrBackground = (HBRUSH) ::GetStockObject(LTGRAY_BRUSH);
wc.style = CS_BYTEALIGNWINDOW|CS_GLOBALCLASS; // To be modified
wc.cbClsExtra = 0;
wc.cbWndExtra = 0;
return (::RegisterClass(&wc) != 0);
}
void CMCAXYCtrl::OnSize(UINT nType, int cx, int cy)
{
//TRACE("CMCAXYCtrl::OnSize\n");
CWnd::OnSize(nType, cx, cy);
RecalcRect();
}
void CMCAXYCtrl::RecalcRect()
{
//TRACE("CMCAXYCtrl::RecalcRect\n");
CClientDC dc(this);
CSize sz(0,0);
GetClientRect(&m_ClientRect);
if (!m_strTitle.IsEmpty())
sz = dc.GetTextExtent(m_strTitle);
//
// determine the plot area rectangle dimensions
//
m_PlotRect = m_ClientRect; //Start out whole thing
m_PlotRect.top += sz.cy; //reduce by height of title
sz = dc.GetTextExtent(m_strLeftLabel);//"HITS"); //reduce by width of left label
m_PlotRect.DeflateRect(sz.cx,sz.cy); //Same height as "CHANNELS"
//only want to plot within the bounding box
m_d_x_axis_length_in_pixels = (double)m_PlotRect.Width()-2;
m_d_y_axis_length_in_pixels = (double)m_PlotRect.Height()-2;
// Byte align the size of the client rect to speed up
// the bitblt function in OnPaint
//rect.top &= 0xFFFFFFF8;
//rect.bottom &= 0xFFFFFFF8;
//rect.left &= 0xFFFFFFF8;
//rect.right &= 0xFFFFFFF8;
}
BOOL CMCAXYCtrl::AddPiece(COLORREF colorBack, COLORREF colorText,
UINT uX, UINT uY, int iSize)
{
//TRACE("CMCAXYCtrl::AddPiece\n");
CMCAXYPiece* pItem = new CMCAXYPiece;
pItem -> m_colorBack = colorBack;
pItem -> m_colorText = colorText;
pItem -> m_brushBack.CreateSolidBrush(colorBack);
pItem -> m_uX = uX;
pItem -> m_uY = uY;
pItem -> m_iSize = iSize;
try
{
m_chartPieces.Add(pItem);
return TRUE;
}
catch (CMemoryException* e)
{
if (pItem !=NULL)
delete pItem;
e->Delete();
return FALSE;
}
}
BOOL CMCAXYCtrl::AddPoint(UINT uX, UINT uY)
{
//TRACE("CMCAXYCtrl::AddPoint\n");
m_uMaxCountPerChannel = max(uY, m_uMaxCountPerChannel);
CMCAXYPiece* pItem = new CMCAXYPiece;
pItem->m_uX = uX;
pItem->m_uY = uY;
try
{
m_chartPieces.Add(pItem);
return TRUE;
}
catch (CMemoryException* e)
{
if (pItem !=NULL)
delete pItem;
e->Delete();
return FALSE;
}
}
void CMCAXYCtrl::CalculatePoint(UINT ux, UINT uy, CPoint& pt)
{
//TRACE("CMCAXYCtrl::CalculatePoint\n");
if (ux > m_uMaxChannels)
ux = m_uMaxChannels;
double dxmax = (double)m_uMaxChannels;
double dxinput = (double)ux;
// double dymax = log10((double)m_uMaxCountPerChannel);
// double dyinput = log10((double)uy);
double dymax = (double)(m_uMaxCountPerChannel-1);
double dyinput = (double)uy;
double dxpixels = (dxinput/dxmax) * m_d_x_axis_length_in_pixels;
double dypixels = (dyinput/dymax) * (m_d_y_axis_length_in_pixels-2);
pt.x = m_PlotRect.left + (int)(dxpixels) + 1;
pt.y = m_PlotRect.top + (int)((m_d_y_axis_length_in_pixels - dypixels))+2;
}
void CMCAXYCtrl::Reset()
{
//TRACE("CMCAXYCtrl::Reset\n");
m_uMaxCountPerChannel = 1;
int nCount = m_chartPieces.GetSize();
for (int i = 0; i < nCount; i++)
delete m_chartPieces.GetAt(i);
m_chartPieces.RemoveAll();
//m_iThresholdLineOffsetFromTopInPixels = -1;
if (::IsWindow(m_hWnd)) //fails when DTR calls Reset()
InvalidateRect(NULL, FALSE);
}
void CMCAXYCtrl::GetItemColor(int /*i*/, COLORREF& color)
{
//TRACE("CMCAXYCtrl::GetItemColor\n");
color = m_crPixelColor;
}
void CMCAXYCtrl::SetTitle(const CString & str)
{
//TRACE("CMCAXYCtrl::SetTitle() = %s\n", str);
m_strTitle = str;
RecalcRect();
InvalidateRect(NULL, FALSE);
}
void CMCAXYCtrl::SetLeftLabel(const CString &str)
{
//TRACE("CMCAXYCtrl::SetLeftLabel() = %s\n", str);
m_strLeftLabel = str;
RecalcRect();
InvalidateRect(NULL, FALSE);
}
void CMCAXYCtrl::SetBottomLabel(const CString &str)
{
//TRACE("CMCAXYCtrl::SetBottomLabel() = %s\n", str);
m_strBottomLabel = str;
RecalcRect();
InvalidateRect(NULL, FALSE);
}
void CMCAXYCtrl::DrawThresholdLine(COLORREF cThresholdLineColor, UINT uValue)
{
m_rgbThresholdLineColor = cThresholdLineColor;
if (uValue == 0)
uValue = 1;
double dymax = log10((double)m_uMaxCountPerChannel);
double dyinput = log10((double)uValue);
//double dxpixels = (dxinput/dxmax) * m_d_x_axis_length_in_pixels;
double dypixels = (dyinput/dymax) * m_d_y_axis_length_in_pixels;
//pt.y = m_PlotRect.top + (int)((m_d_y_axis_length_in_pixels - dypixels));
m_iThresholdLineOffsetFromTopInPixels =
m_PlotRect.top + (int)((m_d_y_axis_length_in_pixels - dypixels));
}
void CMCAXYCtrl::DrawHorizontalGridLines(COLORREF color)
{
m_rgbHorizonatlGridLinesColor = color;
double dyvalue, dypixels;
double dValue = 10.;
double dMaxCountPerChannel = (double)m_uMaxCountPerChannel;
double dymax = log10(dMaxCountPerChannel);
for (int j = 0; j < MAX_NUM_GRID_LINES; j++)
{
dyvalue = log10(dValue);
dypixels = (dyvalue/dymax) * m_d_y_axis_length_in_pixels;
m_iHorizontalGridLinesOffsetFromTopInPixels[j] =
m_PlotRect.top + (int)((m_d_y_axis_length_in_pixels - dypixels));
dValue *= 10.;
if (dValue > dMaxCountPerChannel)
break;
}
// UINT m_iHorizontalGridLinesOffsetFromTopInPixels[MAX_NUM_GRID_LINES];
}
void CMCAXYCtrl::OnPaint()
{
CPoint cTextExtent, cpoint;
CPaintDC dc(this);
CDC memoryDC;
CBitmap bitmap;
CPen pen, *oldpen;
CPen RedPen;
CPen GrayPen;
CPen BluePen;
CBrush defaultbrush, whitebrush;
if (m_hWnd == ::GetFocus())
m_bHasFocus = true;
if (m_bRecalculateConstants)
{
RecalcRect();
// <<QA>> could tuck some other 1-time calculations in here
m_bRecalculateConstants = false;
}
//Create memory device context compatible with a painting device context
memoryDC.CreateCompatibleDC(&dc);
//Create bitmap that will correspond to the clientRect and select it into memory DC
bitmap.CreateCompatibleBitmap( &dc, m_ClientRect.Width(), m_ClientRect.Height() );
memoryDC.SelectObject(&bitmap);
memoryDC.FillSolidRect(m_ClientRect, /*COLOR_GREEN*/GetSysColor(COLOR_3DFACE));
memoryDC.SelectStockObject(NULL_PEN);
defaultbrush.CreateSolidBrush(m_colorDefault);
memoryDC.SelectObject(&defaultbrush);
whitebrush.CreateSolidBrush(RGB(255,255,255)); //white
memoryDC.SelectObject(&whitebrush);
memoryDC.Rectangle(m_PlotRect);
pen.CreatePen(PS_SOLID, 1, m_colorLine);
memoryDC.SelectObject(&pen);
memoryDC.SelectStockObject(NULL_BRUSH);
memoryDC.Rectangle(m_PlotRect);
GrayPen.CreatePen(PS_SOLID, 1, RGB(191,191,191));
memoryDC.SelectObject(&GrayPen);
for (int index = 100; index < 1024; index+= 100)
{
CalculatePoint(index,0, cpoint);
memoryDC.MoveTo(cpoint.x,2);
memoryDC.LineTo(cpoint.x,m_ClientRect.bottom-2);
}
if (m_iChannel >= 0)
{
if (m_bHasFocus)
{
memoryDC.SetTextColor(COLOR_WHITE);
memoryDC.SetBkMode(OPAQUE);
memoryDC.SetBkColor(COLOR_BLUE);
}
else
{
memoryDC.SetTextColor(COLOR_BLACK);
memoryDC.SetBkMode(TRANSPARENT);
}
CRect cRect(m_ClientRect.left,1,m_ClientRect.right,m_ClientRect.bottom);
int i,j;
CPoint cPointTemp;
CalculatePoint(m_iChannel,0, cpoint);
cPointTemp = cpoint;
i = 0;
while (cpoint.x == cPointTemp.x)
{
i++;
CalculatePoint(m_iChannel+i,0,cPointTemp);
}
cPointTemp = cpoint;
j = 0;
while (cpoint.x == cPointTemp.x)
{
j--;
CalculatePoint(m_iChannel+j,0,cPointTemp);
}
i--;
j++;
CString cString;
if (i==j)
cString.Format(" Channel: %d ",m_iChannel+j);
else
cString.Format(" Channel: %d to %d ",
m_iChannel+j, m_iChannel+i);
// m_iChannel, m_iChannel+(int)((double)1024 / (double)m_d_x_axis_length_in_pixels));
memoryDC.DrawText(cString,cRect,DT_CENTER);
memoryDC.SetBkColor(COLOR_WHITE);
// if (m_bHasFocus)
// {
// cRect.DeflateRect(5,5,5,5);
// memoryDC.DrawFocusRect(&cRect);
// }
BluePen.CreatePen(PS_DASH, 1, RGB(127,127,255));
memoryDC.SelectObject(&BluePen);
memoryDC.MoveTo(cpoint.x,2);
memoryDC.LineTo(cpoint.x,m_ClientRect.bottom-2);
}
RedPen.CreatePen(PS_SOLID, 1, m_crPixelColor);
memoryDC.SelectObject(&RedPen);
memoryDC.SelectStockObject(NULL_BRUSH);
CMCAXYPiece* pItem;
int nCount = m_chartPieces.GetSize();
CalculatePoint(1,1,cpoint);
memoryDC.MoveTo(cpoint);
for (int i=0; i < nCount; i++)
{
pItem = m_chartPieces.GetAt(i);
CalculatePoint(i,pItem->m_uY, cpoint);
cpoint.y -= 2;//3;//5;
// memoryDC.SetPixel(cpoint,m_crPixelColor);
memoryDC.LineTo(cpoint);
}
/*
//Draw threshold line
if (m_iThresholdLineOffsetFromTopInPixels != -1)
{
CPen pen;
pen.CreatePen(PS_SOLID, 5, m_rgbThresholdLineColor);
CPen *oldpen = memoryDC.SelectObject(&pen);
memoryDC.MoveTo(m_PlotRect.left,m_iThresholdLineOffsetFromTopInPixels);
memoryDC.LineTo(m_PlotRect.right,m_iThresholdLineOffsetFromTopInPixels);
memoryDC.SelectObject(oldpen);
}
*/
//Draw Horizontal Grid Lines
CPen apen;
apen.CreatePen(PS_DASH, 1, m_rgbHorizonatlGridLinesColor);
/*CPen **/oldpen = memoryDC.SelectObject(&apen);
/*
for (int j = 0; j < MAX_NUM_GRID_LINES; j++)
{
if (m_iHorizontalGridLinesOffsetFromTopInPixels[j] == -1)
break;
memoryDC.MoveTo(m_PlotRect.left,m_iHorizontalGridLinesOffsetFromTopInPixels[j]);
memoryDC.LineTo(m_PlotRect.right,m_iHorizontalGridLinesOffsetFromTopInPixels[j]);
}
*/
memoryDC.SelectObject(oldpen);
//Draw left and bottom labels
CPoint centerPoint(m_PlotRect.CenterPoint());
cTextExtent = memoryDC.GetTextExtent(m_strBottomLabel); //"CHANNEL");
memoryDC.TextOut(centerPoint.x-cTextExtent.x/2,m_PlotRect.bottom,m_strBottomLabel); //"CHANNEL");
cTextExtent = memoryDC.GetTextExtent(m_strLeftLabel); //("HITS");
memoryDC.TextOut(m_PlotRect.left-cTextExtent.x,centerPoint.y-cTextExtent.y/2,m_strLeftLabel);//"HITS");
//Draw Title
if (!m_strTitle.IsEmpty())
{
memoryDC.SetTextColor(GetSysColor(COLOR_WINDOWTEXT));
memoryDC.SetBkMode(TRANSPARENT);
memoryDC.DrawText(m_strTitle,CRect(m_ClientRect.left,1,m_ClientRect.right,m_ClientRect.bottom),DT_CENTER);
}
dc.BitBlt( 0, 0, m_ClientRect.Width(), m_ClientRect.Height(), &memoryDC, 0, 0, SRCCOPY );
}
void CMCAXYCtrl::OnLButtonDown(UINT nFlags, CPoint point)
{
// TODO: Add your message handler code here and/or call default
m_iChannel = (int)(((double)point.x/(double)m_d_x_axis_length_in_pixels) * (double)1024.0);
CWnd::OnLButtonDown(nFlags, point);
SetFocus();
m_bHasFocus = true;
Invalidate(FALSE);
}
//I don't know why this isn't getting called in version 2.+. but on key down solves the problem
BOOL CMCAXYCtrl::PreTranslateMessage(MSG* pMsg)
{
// TODO: Add your specialized code here and/or call the base class
if ((pMsg->message == 0x101) && (pMsg->wParam == 0x09))
{
// m_bHasFocus = true;
Invalidate(FALSE);
}
else if ((pMsg->message == 0x100) && (pMsg->wParam == 0x27))//right
{
if (m_iChannel <= 1023 && m_bHasFocus)
{
CPoint cPoint2;
CPoint cPoint1;
CalculatePoint(m_iChannel,0, cPoint1);
cPoint2 = cPoint1;
while (cPoint1.x == cPoint2.x)
{
CalculatePoint(++m_iChannel,0,cPoint2);
}
if (m_iChannel > 1023)
m_iChannel = 1023;
Invalidate(FALSE);
return true;
}
}
else if ((pMsg->message == 0x100) && (pMsg->wParam == 0x28))//down
{
if (m_bHasFocus)
return true;
}
else if ((pMsg->message == 0x100) && (pMsg->wParam == 0x26))//up
{
if (m_bHasFocus)
return true;
}
else if ((pMsg->message == 0x0f) && (pMsg->wParam == 0x00))
{
if (!m_bHasFocus)
{
Invalidate(FALSE);
}
}
else if ((pMsg->message == 0x100) && (pMsg->wParam == 0x25))//left
{
if (m_iChannel > 0 && m_bHasFocus)
{
CPoint cPoint2;
CPoint cPoint1;
CalculatePoint(m_iChannel,0, cPoint1);
cPoint2 = cPoint1;
while (cPoint1.x == cPoint2.x)
{
CalculatePoint(--m_iChannel,0,cPoint2);
}
Invalidate(FALSE);
return true;
}
}
return CWnd::PreTranslateMessage(pMsg);
}
void CMCAXYCtrl::OnKillFocus(CWnd* pNewWnd)
{
CWnd::OnKillFocus(pNewWnd);
// TODO: Add your message handler code here
m_bHasFocus = false;
Invalidate(FALSE);
}
void CMCAXYCtrl::OnKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags)
{
// TODO: Add your message handler code here and/or call default
if (m_bHasFocus)
{
if ((nChar == 102) || (nChar == 39))//right
{
if (m_iChannel <= 1023 && m_bHasFocus)
{
CPoint cPoint2;
CPoint cPoint1;
CalculatePoint(m_iChannel,0, cPoint1);
cPoint2 = cPoint1;
while (cPoint1.x == cPoint2.x)
{
CalculatePoint(++m_iChannel,0,cPoint2);
}
if (m_iChannel > 1023)
m_iChannel = 1023;
Invalidate(FALSE);
}
}
else if ((nChar == 100) || (nChar == 37))//left
{
if (m_iChannel > 0 && m_bHasFocus)
{
CPoint cPoint2;
CPoint cPoint1;
CalculatePoint(m_iChannel,0, cPoint1);
cPoint2 = cPoint1;
while (cPoint1.x == cPoint2.x)
{
CalculatePoint(--m_iChannel,0,cPoint2);
}
Invalidate(FALSE);
}
}
}
CWnd::OnKeyDown(nChar, nRepCnt, nFlags);
}
| 28.085484 | 109 | 0.685407 | hnordquist |
90662a28a0b2e089477e8005ce526dc0a3963cb4 | 10,087 | cpp | C++ | modules/base/rendering/modelgeometry.cpp | nbartzokas/OpenSpace | 9df1e9b4821fade185b6e0a31b7cce1e67752a44 | [
"MIT"
] | null | null | null | modules/base/rendering/modelgeometry.cpp | nbartzokas/OpenSpace | 9df1e9b4821fade185b6e0a31b7cce1e67752a44 | [
"MIT"
] | null | null | null | modules/base/rendering/modelgeometry.cpp | nbartzokas/OpenSpace | 9df1e9b4821fade185b6e0a31b7cce1e67752a44 | [
"MIT"
] | null | null | null | /*****************************************************************************************
* *
* OpenSpace *
* *
* Copyright (c) 2014-2018 *
* *
* 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 <modules/base/rendering/modelgeometry.h>
#include <openspace/documentation/verifier.h>
#include <openspace/rendering/renderable.h>
#include <openspace/util/factorymanager.h>
#include <ghoul/filesystem/cachemanager.h>
#include <ghoul/filesystem/file.h>
#include <ghoul/filesystem/filesystem.h>
#include <ghoul/logging/logmanager.h>
#include <ghoul/misc/dictionary.h>
#include <ghoul/misc/invariants.h>
#include <ghoul/misc/templatefactory.h>
#include <fstream>
namespace {
constexpr const char* _loggerCat = "ModelGeometry";
constexpr const char* KeyType = "Type";
constexpr const char* KeyGeomModelFile = "GeometryFile";
constexpr const int8_t CurrentCacheVersion = 3;
} // namespace
namespace openspace::modelgeometry {
documentation:: Documentation ModelGeometry::Documentation() {
using namespace documentation;
return {
"Model Geometry",
"base_geometry_model",
{
{
KeyType,
new StringVerifier,
Optional::No,
"The type of the Model Geometry that should be generated"
},
{
KeyGeomModelFile,
new StringVerifier,
Optional::No,
"The file that should be loaded in this ModelGeometry. The file can "
"contain filesystem tokens or can be specified relatively to the "
"location of the .mod file."
}
}
};
}
std::unique_ptr<ModelGeometry> ModelGeometry::createFromDictionary(
const ghoul::Dictionary& dictionary)
{
if (!dictionary.hasKeyAndValue<std::string>(KeyType)) {
throw ghoul::RuntimeError("Dictionary did not contain a key 'Type'");
}
const std::string& geometryType = dictionary.value<std::string>(KeyType);
auto factory = FactoryManager::ref().factory<ModelGeometry>();
return factory->create(geometryType, dictionary);;
}
ModelGeometry::ModelGeometry(const ghoul::Dictionary& dictionary)
: properties::PropertyOwner({ "ModelGeometry" })
{
documentation::testSpecificationAndThrow(
Documentation(),
dictionary,
"ModelGeometry"
);
_file = absPath(dictionary.value<std::string>(KeyGeomModelFile));
}
double ModelGeometry::boundingRadius() const {
return _boundingRadius;
}
void ModelGeometry::render() {
glBindVertexArray(_vaoID);
glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, _ibo);
glDrawElements(
_mode,
static_cast<GLsizei>(_indices.size()),
GL_UNSIGNED_INT,
nullptr
);
glBindVertexArray(0);
}
void ModelGeometry::changeRenderMode(GLenum mode) {
_mode = mode;
}
bool ModelGeometry::initialize(Renderable* parent) {
float maximumDistanceSquared = 0;
for (const Vertex& v : _vertices) {
maximumDistanceSquared = glm::max(
glm::pow(v.location[0], 2.f) +
glm::pow(v.location[1], 2.f) +
glm::pow(v.location[2], 2.f), maximumDistanceSquared);
}
_boundingRadius = maximumDistanceSquared;
parent->setBoundingSphere(glm::sqrt(maximumDistanceSquared));
if (_vertices.empty()) {
return false;
}
glGenVertexArrays(1, &_vaoID);
glGenBuffers(1, &_vbo);
glGenBuffers(1, &_ibo);
glBindVertexArray(_vaoID);
glBindBuffer(GL_ARRAY_BUFFER, _vbo);
glBufferData(
GL_ARRAY_BUFFER,
_vertices.size() * sizeof(Vertex),
_vertices.data(),
GL_STATIC_DRAW
);
glEnableVertexAttribArray(0);
glEnableVertexAttribArray(1);
glEnableVertexAttribArray(2);
glVertexAttribPointer(0, 4, GL_FLOAT, GL_FALSE, sizeof(Vertex), nullptr);
glVertexAttribPointer(
1,
2,
GL_FLOAT,
GL_FALSE,
sizeof(Vertex),
reinterpret_cast<const GLvoid*>(offsetof(Vertex, tex)) // NOLINT
);
glVertexAttribPointer(
2,
3,
GL_FLOAT,
GL_FALSE,
sizeof(Vertex),
reinterpret_cast<const GLvoid*>(offsetof(Vertex, normal)) // NOLINT
);
glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, _ibo);
glBufferData(
GL_ELEMENT_ARRAY_BUFFER,
_indices.size() * sizeof(int),
_indices.data(),
GL_STATIC_DRAW
);
glBindVertexArray(0);
return true;
}
void ModelGeometry::deinitialize() {
glDeleteBuffers(1, &_vbo);
glDeleteVertexArrays(1, &_vaoID);
glDeleteBuffers(1, &_ibo);
}
bool ModelGeometry::loadObj(const std::string& filename) {
const std::string& cachedFile = FileSys.cacheManager()->cachedFilename(
filename,
ghoul::filesystem::CacheManager::Persistent::Yes
);
const bool hasCachedFile = FileSys.fileExists(cachedFile);
if (hasCachedFile) {
LINFO(fmt::format("Cached file '{}' used for file '{}", cachedFile, filename));
const bool success = loadCachedFile(cachedFile);
if (success) {
return true;
}
else {
FileSys.cacheManager()->removeCacheFile(filename);
}
}
else {
LINFO(fmt::format(
"Cached file '{}' for file '{}' not found",
cachedFile,
filename
));
}
LINFO(fmt::format("Loading Model file '{}'", filename));
const bool modelSuccess = loadModel(filename);
if (!modelSuccess) {
return false;
}
LINFO("Saving cache");
const bool cacheSuccess = saveCachedFile(cachedFile);
return cacheSuccess;
}
bool ModelGeometry::saveCachedFile(const std::string& filename) {
std::ofstream fileStream(filename, std::ofstream::binary);
if (fileStream.good()) {
fileStream.write(
reinterpret_cast<const char*>(&CurrentCacheVersion),
sizeof(int8_t)
);
const int64_t vSize = _vertices.size();
fileStream.write(reinterpret_cast<const char*>(&vSize), sizeof(int64_t));
const int64_t iSize = _indices.size();
fileStream.write(reinterpret_cast<const char*>(&iSize), sizeof(int64_t));
fileStream.write(
reinterpret_cast<const char*>(_vertices.data()),
sizeof(Vertex) * vSize
);
fileStream.write(
reinterpret_cast<const char*>(_indices.data()),
sizeof(int) * iSize
);
return fileStream.good();
}
else {
LERROR(fmt::format("Error opening file '{}' for save cache file", filename));
return false;
}
}
bool ModelGeometry::loadCachedFile(const std::string& filename) {
std::ifstream fileStream(filename, std::ifstream::binary);
if (fileStream.good()) {
int8_t version = 0;
fileStream.read(reinterpret_cast<char*>(&version), sizeof(int8_t));
if (version != CurrentCacheVersion) {
LINFO("The format of the cached file has changed, deleting old cache");
fileStream.close();
FileSys.deleteFile(filename);
return false;
}
int64_t vSize;
fileStream.read(reinterpret_cast<char*>(&vSize), sizeof(int64_t));
int64_t iSize;
fileStream.read(reinterpret_cast<char*>(&iSize), sizeof(int64_t));
if (vSize == 0 || iSize == 0) {
LERROR(
fmt::format("Error opening file '{}' for loading cache file", filename)
);
return false;
}
_vertices.resize(vSize);
_indices.resize(iSize);
fileStream.read(
reinterpret_cast<char*>(_vertices.data()), sizeof(Vertex) * vSize
);
fileStream.read(reinterpret_cast<char*>(_indices.data()), sizeof(int) * iSize);
return fileStream.good();
}
else {
LERROR(fmt::format(
"Error opening file '{}' for loading cache file",
filename
));
return false;
}
}
void ModelGeometry::setUniforms(ghoul::opengl::ProgramObject&) {}
} // namespace openspace::modelgeometry
| 33.400662 | 90 | 0.574304 | nbartzokas |
9066b0b5e75931943dad87cbfc560eb94aba8908 | 2,792 | inl | C++ | Engine/Src/SFCore/Util/SFUtility.inl | blue3k/StormForge | 1557e699a673ae9adcc8f987868139f601ec0887 | [
"Apache-2.0"
] | 1 | 2020-06-20T07:35:25.000Z | 2020-06-20T07:35:25.000Z | Engine/Src/SFCore/Util/SFUtility.inl | blue3k/StormForge | 1557e699a673ae9adcc8f987868139f601ec0887 | [
"Apache-2.0"
] | null | null | null | Engine/Src/SFCore/Util/SFUtility.inl | blue3k/StormForge | 1557e699a673ae9adcc8f987868139f601ec0887 | [
"Apache-2.0"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////
//
// CopyRight (c) 2013 Kyungkun Ko
//
// Author : KyungKun Ko
//
// Description : Utility library
//
//
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
//
// Generic utility functions
//
// Swap byte of data
uint16_t SwapByte( uint16_t uiData )
{
return (uint16_t)(((uiData&0xFF00)>>8) | (uiData<<8));
}
uint32_t SwapByte( uint32_t uiData )
{
return ( uiData<<24 ) | ((uiData&0xFF00)<<16) | ( uiData>>24 ) | ((uiData>>16)&0xFF00);
}
uint64_t SwapByte( uint64_t uiData )
{
return (((uint64_t)SwapByte((uint32_t)uiData))<<32) | ((uint64_t)SwapByte((uint32_t)(uiData>>32)));
}
template<class DupType>
Result ArrayDup(IHeap& memoryManager, DupType* &pDest, INT iSrcCount, const DupType* pSrc )
{
if( pDest != NULL )
{
IHeap::Delete(pDest);
pDest = NULL;
}
if( pSrc )
{
pDest = new(memoryManager) DupType[ iSrcCount ];
if( pDest == NULL )
return ResultCode::OUT_OF_MEMORY;
memcpy( pDest, pSrc, iSrcCount*sizeof(DupType) );
}
return ResultCode::SUCCESS;
}
// MemCopy Data to binary
template< size_t szDstSize, class DataType >
Result MemCpy( uint8_t (&Dest)[szDstSize], const DataType& Src )
{
static_assert( szDstSize >= sizeof(DataType), "Invalid Binary data size" );
memcpy( Dest, &Src, sizeof(DataType) );
if( szDstSize < sizeof(DataType) )
return ResultCode::FAIL;
return ResultCode::SUCCESS;
}
// MemCopy Data From binary
template< size_t szDstSize, class DataType >
Result MemCpy( DataType& Dest, const uint8_t (&Src)[szDstSize] )
{
static_assert( szDstSize >= sizeof(DataType), "Invalid Binary data size" );
memcpy( &Dest, Src, sizeof(DataType) );
if( szDstSize < sizeof(DataType) )
return ResultCode::FAIL;
return ResultCode::SUCCESS;
}
template<class ArrayType>
Result SafeDeleteArray( ArrayType* &pArray )
{
if( pArray != nullptr )
{
IHeap::Delete(pArray);
pArray = nullptr;
}
return ResultCode::SUCCESS;
}
template<class ValueType>
Result SafeDelete( ValueType* &pObj )
{
if( pObj != nullptr )
{
IHeap::Delete(pObj);
pObj = nullptr;
}
return ResultCode::SUCCESS;
}
//template<class ValueType>
//constexpr ValueType Min( ValueType val1, ValueType val2 )
//{
// return ( ((val1) < (val2)) ? (val1) : (val2) );
//}
//
//template<class ValueType>
//constexpr ValueType Max( ValueType val1, ValueType val2 )
//{
// return ( ((val1) > (val2)) ? (val1) : (val2) );
//}
//template<class ValType>
//constexpr ValType Abs( ValType value )
//{
// return value > 0 ? value : -value;
//}
//
| 21.476923 | 101 | 0.581304 | blue3k |
9066c0f9aef07ac7e08a5c0cd884a95563f99a62 | 842 | cpp | C++ | chapter6/exercises/Exist_Path.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | chapter6/exercises/Exist_Path.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | chapter6/exercises/Exist_Path.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | #include "../Graph.h"
#include "../../chapter3/Queue/LinkQueueWithHead.h"
//查找以邻接表方式存储的有向图中是否存在i到j的路径
//深度优先写法
bool visited[MaxVertexNum] = {false};
bool Exist_Path_DFS(ALGraph G, int i, int j)
{
int p;
if (i == j)
return true;
visited[i] = true;
for (p = FirstNeighbor(G, i); p >= 0; p = NextNeighbor(G, i, p))
if (!visited[p] && Exist_Path_DFS(G, p, j))
return true;
return false;
}
//广度优先写法
LinkQueue Q;
int Exist_Path_BFS(ALGraph G, int i, int j)
{
InitQueue(Q);
EnQueue(Q, i);
while (!Empty(Q))
{
int u;
DeQueue(Q, u);
visited[u] = true;
for (int p = FirstNeighbor(G, i); p >= 0; p = NextNeighbor(G, u, p))
{
int k = G.vertices[p].first->adjvex; //找到该结点的邻接表
if (k == j)
return true;
if (!visited[k])
EnQueue(Q, k);
}
}
return false;
} | 17.914894 | 72 | 0.571259 | verfallen |
9069acd02cd9d8a9010729e5f96d14d8231b61b1 | 326 | cpp | C++ | middleofthree.cpp | nsriramya/OWL-Coder | 8f5ebb05c41d66a726fc8b26fa2374671882d723 | [
"Apache-2.0"
] | null | null | null | middleofthree.cpp | nsriramya/OWL-Coder | 8f5ebb05c41d66a726fc8b26fa2374671882d723 | [
"Apache-2.0"
] | null | null | null | middleofthree.cpp | nsriramya/OWL-Coder | 8f5ebb05c41d66a726fc8b26fa2374671882d723 | [
"Apache-2.0"
] | null | null | null |
class Solution{
public:
int middle(int a, int b, int c){
if(a>b and a>c)
{
return max(b,c);
}
else if(b>a and b>c)
{
return max(a,c);
}
else return max(a,b);
//code here//Position this line where user code will be pasted.
}
};
| 19.176471 | 71 | 0.453988 | nsriramya |
906a634aeb8ff092991264ace9f360958188a652 | 7,903 | cpp | C++ | util/tests/test_util_ip.cpp | b1v1r/ironbee | 97b453afd9c3dc70342c6183a875bde22c9c4a76 | [
"Apache-2.0"
] | 148 | 2015-01-10T01:53:39.000Z | 2022-03-20T20:48:12.000Z | util/tests/test_util_ip.cpp | ErikHendriks/ironbee | 97b453afd9c3dc70342c6183a875bde22c9c4a76 | [
"Apache-2.0"
] | 8 | 2015-03-09T15:50:36.000Z | 2020-10-10T19:23:06.000Z | util/tests/test_util_ip.cpp | ErikHendriks/ironbee | 97b453afd9c3dc70342c6183a875bde22c9c4a76 | [
"Apache-2.0"
] | 46 | 2015-03-08T22:45:42.000Z | 2022-01-15T13:47:59.000Z | //////////////////////////////////////////////////////////////////////////////
// Licensed to Qualys, Inc. (QUALYS) under one or more
// contributor license agreements. See the NOTICE file distributed with
// this work for additional information regarding copyright ownership.
// QUALYS licenses this file to You under the Apache License, Version 2.0
// (the "License"); you may not use this file except in compliance with
// the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
/// @file
/// @brief IronBee --- IP Set tests
///
/// @author Christopher Alfeld <calfeld@qualys.com>
//////////////////////////////////////////////////////////////////////////////
#include <iostream>
#include "ironbee_config_auto.h"
#include "gtest/gtest.h"
#include <ironbee/ip.h>
#ifdef __clang__
#pragma clang diagnostic push
#if __has_warning("-Wunused-local-typedef")
#pragma clang diagnostic ignored "-Wunused-local-typedef"
#endif
#endif
#include <boost/format.hpp>
#ifdef __clang__
#pragma clang diagnostic pop
#endif
using namespace std;
namespace {
ib_ip4_t ip4(int a, int b, int c, int d)
{
return (a << 24) + (b << 16) + (c << 8) + d;
}
ib_ip4_network_t net4(int a, int b, int c, int d, size_t s)
{
ib_ip4_network_t net;
net.ip = ip4(a, b, c, d);
net.size = s;
return net;
}
ib_ip6_t ip6(
uint16_t a1, uint16_t a2,
uint16_t b1, uint16_t b2,
uint16_t c1, uint16_t c2,
uint16_t d1, uint16_t d2
)
{
ib_ip6_t ip;
ip.ip[0] = (a1 << 16) | a2;
ip.ip[1] = (b1 << 16) | b2;
ip.ip[2] = (c1 << 16) | c2;
ip.ip[3] = (d1 << 16) | d2;
return ip;
}
ib_ip6_network_t net6(
uint16_t a1, uint16_t a2,
uint16_t b1, uint16_t b2,
uint16_t c1, uint16_t c2,
uint16_t d1, uint16_t d2,
size_t s
)
{
ib_ip6_network_t net;
net.ip = ip6(a1, a2, b1, b2, c1, c2, d1, d2);
net.size = s;
return net;
}
}
static
bool operator==(
const ib_ip4_network_t& a,
const ib_ip4_network_t& b
)
{
return (a.ip == b.ip) && (a.size == b.size);
}
static
bool operator==(
const ib_ip6_t& a,
const ib_ip6_t& b
)
{
return
a.ip[0] == b.ip[0] &&
a.ip[1] == b.ip[1] &&
a.ip[2] == b.ip[2] &&
a.ip[3] == b.ip[3];
}
static
bool operator==(
const ib_ip6_network_t& a,
const ib_ip6_network_t& b
)
{
return (a.ip == b.ip) && (a.size == b.size);
}
static
ostream& operator<<(ostream& o, const ib_ip4_network_t& net)
{
o << (net.ip >> 24) << "."
<< ((net.ip >> 16) & 0xff) << "."
<< ((net.ip >> 8) & 0xff) << "."
<< (net.ip & 0xff)
<< "/" << int(net.size);
return o;
}
static
ostream& operator<<(ostream& o, const ib_ip6_t& ip)
{
for (int i = 0; i < 4; ++i) {
o << boost::format("%x:%x") % (ip.ip[i] >> 16) % (ip.ip[i] & 0xffff);
if (i < 3) {
o << ":";
}
}
return o;
}
static
ostream& operator<<(ostream& o, const ib_ip6_network_t& net)
{
o << net.ip << "/" << int(net.size);
return o;
}
TEST(TestIP, ip4_str_to_ip)
{
ib_ip4_t ip;
ib_status_t rc;
rc = ib_ip4_str_to_ip("1.2.3.4", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip4(1, 2, 3, 4), ip);
rc = ib_ip4_str_to_ip("1.2.3.4", NULL);
EXPECT_EQ(IB_OK, rc);
rc = ib_ip4_str_to_ip("0.0.0.0", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip4(0, 0, 0, 0), ip);
rc = ib_ip4_str_to_ip("255.255.255.255", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip4(255, 255, 255, 255), ip);
rc = ib_ip4_str_to_ip("", &ip);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_ip(NULL, &ip);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_ip("foobar", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_ip("-5.2.3.4", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_ip("256.2.3.4", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_ip("1.2.3.4hello", NULL);
EXPECT_EQ(IB_EINVAL, rc);
}
TEST(TestIP, ip4_str_to_net)
{
ib_ip4_network_t net;
ib_status_t rc;
rc = ib_ip4_str_to_net("1.2.3.4/16", &net);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(net4(1, 2, 3, 4, 16), net);
rc = ib_ip4_str_to_net("1.2.3.4/16", NULL);
EXPECT_EQ(IB_OK, rc);
rc = ib_ip4_str_to_net("1.2.3.4/0", &net);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(net4(1, 2, 3, 4, 0), net);
rc = ib_ip4_str_to_net("1.2.3.4/32", &net);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(net4(1, 2, 3, 4, 32), net);
rc = ib_ip4_str_to_net("", &net);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net(NULL, &net);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net("foobar", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net("1.2.3.4", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net("-5.2.3.4/16", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net("1.2.3.4/-16", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net("1.2.3.4/33", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip4_str_to_net("1.2.3.4/16hello", NULL);
EXPECT_EQ(IB_EINVAL, rc);
}
TEST(TestIP, ip6_str_to_ip)
{
ib_ip6_t ip;
ib_status_t rc;
rc = ib_ip6_str_to_ip("::1", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(0, 0, 0, 0, 0, 0, 0, 1), ip);
rc = ib_ip6_str_to_ip("1::", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 0, 0, 0, 0, 0, 0, 0), ip);
rc = ib_ip6_str_to_ip("1:2:3:4:5:6:7:8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 2, 3, 4, 5, 6, 7, 8), ip);
rc = ib_ip6_str_to_ip("1:2:3:4::6:7:8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 2, 3, 4, 0, 6, 7, 8), ip);
rc = ib_ip6_str_to_ip("1:2:3::6:7:8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 2, 3, 0, 0, 6, 7, 8), ip);
rc = ib_ip6_str_to_ip("1:2::6:7:8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 2, 0, 0, 0, 6, 7, 8), ip);
rc = ib_ip6_str_to_ip("1:2::7:8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 2, 0, 0, 0, 0, 7, 8), ip);
rc = ib_ip6_str_to_ip("1:2::8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 2, 0, 0, 0, 0, 0, 8), ip);
rc = ib_ip6_str_to_ip("1::8", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(1, 0, 0, 0, 0, 0, 0, 8), ip);
rc = ib_ip6_str_to_ip("aaaa:bbbb:cccc:AbAb:DDDD:abCd:0:dF", &ip);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(ip6(0xaaaa, 0xbbbb, 0xcccc, 0xabab, 0xdddd, 0xabcd, 0, 0x00df), ip);
}
TEST(TestIP, ip6_str_to_net)
{
ib_ip6_network_t net;
ib_status_t rc;
rc = ib_ip6_str_to_net("::1/128", &net);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(net6(0, 0, 0, 0, 0, 0, 0, 1, 128), net);
rc = ib_ip6_str_to_net("1:2:3:4:5:6:7:8/64", &net);
EXPECT_EQ(IB_OK, rc);
EXPECT_EQ(net6(1, 2, 3, 4, 5, 6, 7, 8, 64), net);
rc = ib_ip6_str_to_net("1:2:3:4:5:6:7:8/64hello", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip6_str_to_net("1:2:3:4:5:6:7:8/129", NULL);
EXPECT_EQ(IB_EINVAL, rc);
rc = ib_ip6_str_to_net("1:2:3:4:5:6:7:8/-5", NULL);
EXPECT_EQ(IB_EINVAL, rc);
}
TEST(TestIP, ip_validate)
{
EXPECT_EQ(IB_OK, ib_ip_validate("1.2.3.4"));
EXPECT_EQ(IB_OK, ib_ip_validate("::1"));
EXPECT_EQ(IB_OK, ib_ip_validate("1:2:3:4:5:6:7:8"));
EXPECT_EQ(IB_OK, ib_ip_validate("::ffff:1.2.3.4"));
EXPECT_EQ(IB_EINVAL, ib_ip_validate("foobar"));
EXPECT_EQ(IB_EINVAL, ib_ip_validate("1.2.3.4foobar"));
EXPECT_EQ(IB_EINVAL, ib_ip_validate("1.2.3.4:ffff::"));
}
| 26.880952 | 82 | 0.574592 | b1v1r |
906bc298df877de4c9206c767496bb86564555d5 | 3,348 | hpp | C++ | modules/core/container/table/include/nt2/core/functions/scalar/construct.hpp | psiha/nt2 | 5e829807f6b57b339ca1be918a6b60a2507c54d0 | [
"BSL-1.0"
] | 34 | 2017-05-19T18:10:17.000Z | 2022-01-04T02:18:13.000Z | modules/core/container/table/include/nt2/core/functions/scalar/construct.hpp | psiha/nt2 | 5e829807f6b57b339ca1be918a6b60a2507c54d0 | [
"BSL-1.0"
] | null | null | null | modules/core/container/table/include/nt2/core/functions/scalar/construct.hpp | psiha/nt2 | 5e829807f6b57b339ca1be918a6b60a2507c54d0 | [
"BSL-1.0"
] | 7 | 2017-12-02T12:59:17.000Z | 2021-07-31T12:46:14.000Z | //==============================================================================
// Copyright 2003 - 2011 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2011 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//==============================================================================
#ifndef NT2_CORE_FUNCTIONS_SCALAR_CONSTRUCT_HPP_INCLUDED
#define NT2_CORE_FUNCTIONS_SCALAR_CONSTRUCT_HPP_INCLUDED
#include <nt2/core/functions/construct.hpp>
#include <nt2/include/functions/scalar/numel.hpp>
#include <boost/simd/memory/iterator_category.hpp>
#include <boost/core/ignore_unused.hpp>
#include <boost/dispatch/meta/fusion.hpp>
namespace nt2 { namespace ext
{
using boost::dispatch::meta::iterator_;
//============================================================================
// Construct a terminal from a size and a Iterator pair
//============================================================================
BOOST_DISPATCH_IMPLEMENT ( construct_, tag::cpu_
, (A0)(A1)(A2)(A3)
, (scalar_< unspecified_<A0> >)
(fusion_sequence_<A1>)
(iterator_< scalar_< unspecified_<A2> > >)
(iterator_< scalar_< unspecified_<A3> > >)
)
{
typedef void result_type;
BOOST_FORCEINLINE result_type
operator()(A0& a0, A1 const& a1, A2 const& a2, A3 const&) const
{
//========================================================================
// Check we don't copy more than expected
//========================================================================
BOOST_ASSERT_MSG
( nt2::numel(a1) == 1
, "Source range is larger than destination container."
);
boost::ignore_unused(a1);
a0 = *a2;
}
};
//============================================================================
// Assign a container from a pair of iterators
//============================================================================
BOOST_DISPATCH_IMPLEMENT ( construct_, tag::cpu_
, (A0)(A1)(A2)(A3)
, (unspecified_<A0>)
(fusion_sequence_<A1>)
(iterator_< scalar_< unspecified_<A2> > >)
(iterator_< scalar_< unspecified_<A3> > >)
)
{
typedef void result_type;
BOOST_FORCEINLINE result_type
operator()(A0& a0, A1 const& a1, A2 const& a2, A3 const& a3) const
{
//========================================================================
// Check we don't copy more than expected
//========================================================================
std::size_t range_size = std::distance(a2,a3);
BOOST_ASSERT_MSG
( nt2::numel(a1) >= range_size
, "Source range is larger than destination container."
);
boost::ignore_unused(a1);
boost::ignore_unused(range_size);
a0.clear();
a0.insert(a0.begin(), a2, a3);
}
};
} }
#endif
| 38.930233 | 80 | 0.434289 | psiha |
907c5b3ab110901e254cadff49be699f36040038 | 1,624 | cc | C++ | src/ast/sint_literal_test.cc | dorba/tint | f81c1081ea7d27ea55f373c0bfaf651e491da7e6 | [
"Apache-2.0"
] | null | null | null | src/ast/sint_literal_test.cc | dorba/tint | f81c1081ea7d27ea55f373c0bfaf651e491da7e6 | [
"Apache-2.0"
] | null | null | null | src/ast/sint_literal_test.cc | dorba/tint | f81c1081ea7d27ea55f373c0bfaf651e491da7e6 | [
"Apache-2.0"
] | null | null | null | // Copyright 2020 The Tint Authors.
//
// 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 "src/ast/sint_literal.h"
#include "gtest/gtest.h"
#include "src/ast/type/i32_type.h"
#include "src/ast/type/u32_type.h"
namespace tint {
namespace ast {
namespace {
using SintLiteralTest = testing::Test;
TEST_F(SintLiteralTest, Value) {
ast::type::I32Type i32;
SintLiteral i{&i32, 47};
ASSERT_TRUE(i.IsSint());
EXPECT_EQ(i.value(), 47);
}
TEST_F(SintLiteralTest, Is) {
ast::type::I32Type i32;
SintLiteral i{&i32, 42};
EXPECT_FALSE(i.IsBool());
EXPECT_TRUE(i.IsSint());
EXPECT_FALSE(i.IsFloat());
EXPECT_FALSE(i.IsUint());
EXPECT_FALSE(i.IsNull());
}
TEST_F(SintLiteralTest, ToStr) {
ast::type::I32Type i32;
SintLiteral i{&i32, -42};
EXPECT_EQ(i.to_str(), "-42");
}
TEST_F(SintLiteralTest, Name_I32) {
ast::type::I32Type i32;
SintLiteral i{&i32, 2};
EXPECT_EQ("__sint__i32_2", i.name());
}
TEST_F(SintLiteralTest, Name_U32) {
ast::type::U32Type u32;
SintLiteral i{&u32, 2};
EXPECT_EQ("__sint__u32_2", i.name());
}
} // namespace
} // namespace ast
} // namespace tint
| 24.606061 | 75 | 0.702586 | dorba |
9080011a26fc33ecaedb1da8d0b1e304aa97550d | 19,151 | cpp | C++ | src/node.cpp | nassimeblinlaas/gepetto-viewer | f47dc13f73c5667c66f1c5273aa0740d62fe9240 | [
"BSD-3-Clause"
] | null | null | null | src/node.cpp | nassimeblinlaas/gepetto-viewer | f47dc13f73c5667c66f1c5273aa0740d62fe9240 | [
"BSD-3-Clause"
] | null | null | null | src/node.cpp | nassimeblinlaas/gepetto-viewer | f47dc13f73c5667c66f1c5273aa0740d62fe9240 | [
"BSD-3-Clause"
] | null | null | null | //
// node.cpp
// gepetto-viewer
//
// Created by Justin Carpentier, Mathieu Geisert in November 2014.
// Copyright (c) 2014 LAAS-CNRS. All rights reserved.
//
#include <gepetto/viewer/node.h>
#include <osg/Material>
#include <osg/LineWidth>
#include <climits>
namespace graphics {
bool Node::firstTime_ = true;
::osg::NodeRefPtr Node::arrow_ = 0;
::osg::NodeRefPtr Node::circle_ = 0;
/* Declaration of private function members */
void Node::init ()
{
if (firstTime_) {
const float factor = 0.1f;
::osg::GroupRefPtr group = new ::osg::Group;
::osg::GeodeRefPtr cylinder = new osg::Geode;
cylinder->addDrawable (new osg::ShapeDrawable (new osg::Cylinder (osg::Vec3(0,0,0), 1*factor, 4*factor)));
group->addChild (cylinder);
::osg::GeodeRefPtr cone = new osg::Geode;
cone->addDrawable (new osg::ShapeDrawable (new osg::Cone (osg::Vec3(0,0,0), 1.8f*factor, 2.0f*factor)));
::osg::PositionAttitudeTransformRefPtr cone_transform = new ::osg::PositionAttitudeTransform;
cone_transform->addChild (cone);
cone_transform->setPosition (osg::Vec3 (0,0,2*factor));
group->addChild (cone_transform);
arrow_ = group;
::osg::GeometryRefPtr circle = new ::osg::Geometry;
::osg::ref_ptr< ::osg::Vec3Array> v = new ::osg::Vec3Array;
const float radius = 1; const int POLYGON_SIZE = 256;
float theta, px, py;
for (int i = 1; i <= POLYGON_SIZE; ++i) {
theta = 2.f * (float)osg::PI / (float)(POLYGON_SIZE * i);
px = radius * cosf (theta);
py = radius * sinf (theta);
v->push_back (osg::Vec3(px,py,0));
}
circle->setVertexArray (v.get());
circle->addPrimitiveSet (
new ::osg::DrawArrays (::osg::PrimitiveSet::LINE_LOOP, 0, POLYGON_SIZE));
::osg::StateSetRefPtr stateset = new ::osg::StateSet;
::osg::LineWidthRefPtr linewidth = new ::osg::LineWidth;
linewidth->setWidth (2.0f);
stateset->setAttributeAndModes (linewidth, osg::StateAttribute::ON);
circle->setStateSet (stateset);
::osg::GeodeRefPtr circleNode = new ::osg::Geode;
circleNode->addDrawable (circle.get());
circle_ = circleNode;
firstTime_ = false;
}
/* Build local conformation
<- wireframe_node_ptr_
connected to the parent <- switch_node_ptr_ <- auto_transform_ptr_ <- connection of children here
<- normal_node_ptr_
*/
auto_transform_ptr_ = new ::osg::AutoTransform;
static_auto_transform_ptr_ = new ::osg::AutoTransform;
arrows_transform_ptr_ = new ::osg::PositionAttitudeTransform;
switch_node_ptr_ = new ::osg::Switch;
switch_node_ptr_->setName (id_name_);
hl_switch_node_ptr_ = new ::osg::Switch;
wireframe_node_ptr_ = new ::osg::Group;
normal_node_ptr_ = new ::osg::Group;
/* Building hierarchie */
switch_node_ptr_->addChild(normal_node_ptr_, true);
switch_node_ptr_->addChild(wireframe_node_ptr_, false);
switch_node_ptr_->getOrCreateStateSet()->setDataVariance(::osg::Object::DYNAMIC);
wireframe_node_ptr_->addChild(hl_switch_node_ptr_);
normal_node_ptr_->addChild(hl_switch_node_ptr_);
::osg::GroupRefPtr g = setupHighlightState (0);
hl_switch_node_ptr_->addChild (g, true);
g->addChild (auto_transform_ptr_);
for (unsigned int i = 1; i < 7; ++i) {
::osg::GroupRefPtr g = setupHighlightState (i);
hl_switch_node_ptr_->addChild (g, false);
g->addChild (auto_transform_ptr_);
}
auto_transform_ptr_->addChild(static_auto_transform_ptr_);
/* Allowing wireframe mode */
polygon_mode_ptr_ = new ::osg::PolygonMode;
polygon_mode_ptr_->setMode( ::osg::PolygonMode::FRONT_AND_BACK, ::osg::PolygonMode::LINE );
::osg::MaterialRefPtr material_wireframe_ptr = new osg::Material;
material_wireframe_ptr->setColorMode(osg::Material::DIFFUSE);
material_wireframe_ptr->setDiffuse(osg::Material::FRONT_AND_BACK, osgVector4(1.,1.,1.,1.));
wireframe_node_ptr_->getOrCreateStateSet()->setAttributeAndModes(polygon_mode_ptr_, ::osg::StateAttribute::PROTECTED | ::osg::StateAttribute::ON );
wireframe_node_ptr_->getOrCreateStateSet()->setMode(GL_BLEND, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED ); // PROTECTED attribut allows wireframe node to not be influenced by alpha
wireframe_node_ptr_->getOrCreateStateSet()->setAttributeAndModes(material_wireframe_ptr, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED );
}
Node::Node (const std::string& name) :
id_name_(name)
{
init();
}
Node::Node (const Node &other) :
id_name_(other.getID())
{
init();
}
void Node::applyConfiguration (const osgVector3 & position, const osgQuat & quat)
{
/* Update position */
auto_transform_ptr_->setPosition(position);
/* Update attitude */
auto_transform_ptr_->setRotation(quat);
}
void Node::setStaticTransform(const osgVector3 & position, const osgQuat & quat)
{
/* Update position */
static_auto_transform_ptr_->setPosition(position);
/* Update attitude */
static_auto_transform_ptr_->setRotation(quat);
}
osgQuat Node::getStaticRotation() const
{
return static_auto_transform_ptr_->getRotation();
}
osgVector3 Node::getStaticPosition() const
{
return static_auto_transform_ptr_->getPosition();
}
void Node::setScale(float scale)
{
static_auto_transform_ptr_->setScale(scale);
}
void Node::setScale(const osg::Vec3d &scale)
{
double lmin=scale._v[0];
if (lmin>scale._v[1])
lmin=scale._v[1];
if (lmin>scale._v[2])
lmin=scale._v[2];
if(lmin<static_auto_transform_ptr_->getMinimumScale())
static_auto_transform_ptr_->setMinimumScale(lmin);
static_auto_transform_ptr_->setScale(scale);
}
void Node::setVisibilityMode (const VisibilityMode& mode)
{
switch (mode) {
case VISIBILITY_ON:
auto_transform_ptr_->setNodeMask(0xffffffff);
auto_transform_ptr_->getOrCreateStateSet()->setRenderBinToInherit();
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED);
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE,::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
break;
case VISIBILITY_OFF:
auto_transform_ptr_->setNodeMask(0x0);
auto_transform_ptr_->getOrCreateStateSet()->setRenderBinToInherit();
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED);
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE,::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
break;
case ALWAYS_ON_TOP:
auto_transform_ptr_->setNodeMask(0xffffffff);
auto_transform_ptr_->getOrCreateStateSet()->setRenderBinDetails(INT_MAX, "DepthSortedBin");
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED );
break;
default:
ASSERT(false, "mode is not well defined");
break;
}
}
void Node::setLightingMode (const LightingMode& mode)
{
if(mode == LIGHT_INFLUENCE_ON)
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_LIGHTING, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED);
else
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_LIGHTING, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
}
void Node::setWireFrameMode (const WireFrameMode& mode)
{
switch (mode) {
case FILL:
switch_node_ptr_->setValue (0, true);
switch_node_ptr_->setValue (1, false);
break;
case WIREFRAME:
switch_node_ptr_->setValue (0, false);
switch_node_ptr_->setValue (1, true);
break;
case FILL_AND_WIREFRAME:
switch_node_ptr_->setValue (0, true);
switch_node_ptr_->setValue (1, true);
break;
default:
ASSERT(false, "WireFrameMode set with bad option");
break;
}
}
void Node::selectArrows (int arrows)
{
auto_transform_ptr_->removeChild(arrows_transform_ptr_);
arrows_transform_ptr_ = new ::osg::PositionAttitudeTransform;
auto_transform_ptr_->addChild(arrows_transform_ptr_);
float radius = static_auto_transform_ptr_->getBound ().radius();
::osg::PositionAttitudeTransformRefPtr axis = 0;
if (arrows & TRANS_X) {
axis = new ::osg::PositionAttitudeTransform;
axis->setPosition (osg::Vec3(radius, 0, 0));
axis->setAttitude (osg::Quat(osg::PI_2, osg::Vec3(0, 1, 0)));
axis->setScale (osg::Vec3 (radius, radius, radius));
axis->addChild (arrow_);
arrows_transform_ptr_->addChild (axis);
}
if (arrows & TRANS_Y) {
axis = new ::osg::PositionAttitudeTransform;
axis->setPosition (osg::Vec3(0, radius, 0));
axis->setAttitude (osg::Quat(-osg::PI_2, osg::Vec3(1, 0, 0)));
axis->setScale (osg::Vec3 (radius, radius, radius));
axis->addChild (arrow_);
arrows_transform_ptr_->addChild (axis);
}
if (arrows & TRANS_Z) {
axis = new ::osg::PositionAttitudeTransform;
axis->setPosition (osg::Vec3(0, 0, radius));
axis->setScale (osg::Vec3 (radius, radius, radius));
axis->addChild (arrow_);
arrows_transform_ptr_->addChild (axis);
}
if (arrows & ROT_X) {
axis = new ::osg::PositionAttitudeTransform;
axis->setScale (osg::Vec3 (radius, radius, radius));
axis->setAttitude (osg::Quat(osg::PI_2, osg::Vec3(0, 1, 0)));
axis->addChild (circle_);
arrows_transform_ptr_->addChild (axis);
}
if (arrows & ROT_Y) {
axis = new ::osg::PositionAttitudeTransform;
axis->setScale (osg::Vec3 (radius, radius, radius));
axis->setAttitude (osg::Quat(-osg::PI_2, osg::Vec3(1, 0, 0)));
axis->addChild (circle_);
arrows_transform_ptr_->addChild (axis);
}
if (arrows & ROT_Z) {
axis = new ::osg::PositionAttitudeTransform;
axis->setScale (osg::Vec3 (radius, radius, radius));
axis->addChild (circle_);
arrows_transform_ptr_->addChild (axis);
}
setArrowsVisibility (VISIBILITY_OFF);
}
void Node::setArrowsVisibility (const VisibilityMode& mode)
{
switch (mode) {
case VISIBILITY_ON:
arrows_transform_ptr_->setNodeMask(0xffffffff);
arrows_transform_ptr_->getOrCreateStateSet()->setRenderBinToInherit();
arrows_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED);
arrows_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE,::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
break;
case VISIBILITY_OFF:
arrows_transform_ptr_->setNodeMask(0x0);
arrows_transform_ptr_->getOrCreateStateSet()->setRenderBinToInherit();
arrows_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED);
arrows_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE,::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
break;
case ALWAYS_ON_TOP:
arrows_transform_ptr_->setNodeMask(0xffffffff);
arrows_transform_ptr_->getOrCreateStateSet()->setRenderBinDetails(INT_MAX, "DepthSortedBin");
arrows_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
arrows_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED );
break;
default:
ASSERT(false, "mode is not well defined");
break;
}
}
void Node::addLandmark(const float& size)
{
::osg::GeometryRefPtr geom_ptr = new ::osg::Geometry();
/* Define points of the beam */
::osg::Vec3ArrayRefPtr points_ptr = new ::osg::Vec3Array(6);
points_ptr->at(0) = osgVector3(0.,0.,0.);
points_ptr->at(1) = osgVector3(size,0.,0.);
points_ptr->at(2) = osgVector3(0.,0.,0.);
points_ptr->at(3) = osgVector3(0.,size,0.);
points_ptr->at(4) = osgVector3(0.,0.,0.);
points_ptr->at(5) = osgVector3(0.,0.,size);
/* Define the color */
::osg::Vec4ArrayRefPtr color_ptr = new ::osg::Vec4Array(3);
color_ptr->at(0) = osgVector4(1.,0.,0.,1.);
color_ptr->at(1) = osgVector4(0.,1.,0.,1.);
color_ptr->at(2) = osgVector4(0.,0.,1.,1.);
geom_ptr->setVertexArray(points_ptr.get());
geom_ptr->setColorArray(color_ptr .get());
geom_ptr->setColorBinding(::osg::Geometry::BIND_PER_PRIMITIVE_SET);
geom_ptr->addPrimitiveSet(new osg::DrawArrays(GL_LINES,0,2));
geom_ptr->addPrimitiveSet(new osg::DrawArrays(GL_LINES,2,2));
geom_ptr->addPrimitiveSet(new osg::DrawArrays(GL_LINES,4,2));
landmark_geode_ptr_ = new osg::Geode();
landmark_geode_ptr_->addDrawable(geom_ptr);
//set Landmark as ALWAYS ON TOP
landmark_geode_ptr_->setNodeMask(0xffffffff);
landmark_geode_ptr_->getOrCreateStateSet()->setRenderBinDetails(INT_MAX, "DepthSortedBin");
landmark_geode_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
landmark_geode_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED );
landmark_geode_ptr_->getOrCreateStateSet()->setMode(GL_LIGHTING, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
/*auto_transform_ptr_->setNodeMask(0xffffffff);
auto_transform_ptr_->getOrCreateStateSet()->setRenderBinToInherit();
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_DEPTH_TEST, ::osg::StateAttribute::ON | ::osg::StateAttribute::PROTECTED);
auto_transform_ptr_->getOrCreateStateSet()->setMode(GL_CULL_FACE,::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);
landmark_geode_ptr_->getOrCreateStateSet()->setMode(GL_LIGHTING, ::osg::StateAttribute::OFF | ::osg::StateAttribute::PROTECTED);*/
static_auto_transform_ptr_->addChild(landmark_geode_ptr_);
}
void Node::deleteLandmark()
{
static_auto_transform_ptr_->removeChild(landmark_geode_ptr_);
landmark_geode_ptr_.release();
}
::osg::Group* Node::setupHighlightState (unsigned int state)
{
::osg::MaterialRefPtr material_switch_ptr = new osg::Material;
int glModeValue = ::osg::StateAttribute::INHERIT;
/// Some color codes are taken from
/// http://devernay.free.fr/cours/opengl/materials.html
switch (state) {
case 1: /// collision
glModeValue = ::osg::StateAttribute::ON | ::osg::StateAttribute::OVERRIDE;
material_switch_ptr->setColorMode (osg::Material::AMBIENT);
material_switch_ptr->setDiffuse (osg::Material::FRONT_AND_BACK, osgVector4(1.0f,0.f,0.f,1.f));
material_switch_ptr->setTransparency(osg::Material::FRONT_AND_BACK, 0.5f);
break;
case 2: /// selection
glModeValue = ::osg::StateAttribute::ON | ::osg::StateAttribute::OVERRIDE | ::osg::StateAttribute::PROTECTED;
/// Blue
material_switch_ptr->setAmbient (osg::Material::FRONT_AND_BACK, osgVector4(0.f,0.f,0.f,1.f));
material_switch_ptr->setDiffuse (osg::Material::FRONT_AND_BACK, osgVector4(0.f,0.f,1.f,1.f));
material_switch_ptr->setSpecular (osg::Material::FRONT_AND_BACK, osgVector4(0.6f,0.6f,0.7f,1.f));
material_switch_ptr->setShininess(osg::Material::FRONT_AND_BACK, 128.f);
break;
case 3: /// selection
glModeValue = ::osg::StateAttribute::ON | ::osg::StateAttribute::OVERRIDE | ::osg::StateAttribute::PROTECTED;
/// Red
material_switch_ptr->setAmbient (osg::Material::FRONT_AND_BACK, osgVector4(0.f,0.f,0.f,1.f));
material_switch_ptr->setDiffuse (osg::Material::FRONT_AND_BACK, osgVector4(1.0f,0.f,0.f,1.f));
material_switch_ptr->setSpecular (osg::Material::FRONT_AND_BACK, osgVector4(0.7f,0.6f,0.6f,1.f));
material_switch_ptr->setShininess(osg::Material::FRONT_AND_BACK, 96.f);
break;
case 4: /// selection
glModeValue = ::osg::StateAttribute::ON | ::osg::StateAttribute::OVERRIDE | ::osg::StateAttribute::PROTECTED;
/// Red plastic
material_switch_ptr->setAmbient (osg::Material::FRONT_AND_BACK, osgVector4(0.f,0.f,0.f,1.f));
material_switch_ptr->setDiffuse (osg::Material::FRONT_AND_BACK, osgVector4(0.5f,0.f,0.f,1.f));
material_switch_ptr->setSpecular (osg::Material::FRONT_AND_BACK, osgVector4(0.7f,0.6f,0.6f,1.f));
material_switch_ptr->setShininess(osg::Material::FRONT_AND_BACK, 32.f);
break;
case 5: /// selection
glModeValue = ::osg::StateAttribute::ON | ::osg::StateAttribute::OVERRIDE | ::osg::StateAttribute::PROTECTED;
/// Bronze
material_switch_ptr->setAmbient (osg::Material::FRONT_AND_BACK, osgVector4(0.2125f,0.1275f,0.054f,1.f));
material_switch_ptr->setDiffuse (osg::Material::FRONT_AND_BACK, osgVector4(0.714f,0.4284f,0.18144f,1.f));
material_switch_ptr->setSpecular (osg::Material::FRONT_AND_BACK, osgVector4(0.393548f,0.271906f,0.166721f,1.f));
material_switch_ptr->setShininess(osg::Material::FRONT_AND_BACK, 26.f);
break;
case 6: /// selection
glModeValue = ::osg::StateAttribute::ON | ::osg::StateAttribute::OVERRIDE | ::osg::StateAttribute::PROTECTED;
/// Red rubber
material_switch_ptr->setAmbient (osg::Material::FRONT_AND_BACK, osgVector4(0.05f,0.f,0.f,1.f));
material_switch_ptr->setDiffuse (osg::Material::FRONT_AND_BACK, osgVector4(0.5f,0.5f,0.4f,1.f));
material_switch_ptr->setSpecular (osg::Material::FRONT_AND_BACK, osgVector4(0.7f,0.04f,0.04f,1.f));
material_switch_ptr->setShininess(osg::Material::FRONT_AND_BACK, 10.f);
break;
case 0:
default:
break;
}
osg::Group* node = new ::osg::Group;
node->getOrCreateStateSet()->setAttributeAndModes(material_switch_ptr, glModeValue);
return node;
}
void Node::setHighlightState (unsigned int state)
{
if (state < hl_switch_node_ptr_->getNumChildren ()) {
hl_switch_node_ptr_->setAllChildrenOff ();
hl_switch_node_ptr_->setSingleChildOn (state);
}
}
Node::~Node ()
{
/* Proper deletion */
normal_node_ptr_->removeChild (auto_transform_ptr_);
wireframe_node_ptr_->removeChild (auto_transform_ptr_);
auto_transform_ptr_ = NULL;
polygon_mode_ptr_ = NULL;
switch_node_ptr_->removeChild (wireframe_node_ptr_);
wireframe_node_ptr_ = NULL;
switch_node_ptr_->removeChild (normal_node_ptr_);
normal_node_ptr_ = NULL;
}
std::pair<osgVector3, osgQuat> Node::getGlobalTransform() const
{
return std::make_pair(auto_transform_ptr_->getPosition(),auto_transform_ptr_->getRotation());
}
/* End of declaration of public function members */
} /* namespace graphics */
| 42.09011 | 204 | 0.686962 | nassimeblinlaas |
90800d35f85e2c6cbf9a770e5ea0f43661ebe8e4 | 2,996 | cpp | C++ | MyVCR/MySetup/MySetup.cpp | kastaineibum/myvcr | 571613f17cb37ce89b8743d2efc7f80efd140910 | [
"MIT"
] | 1 | 2021-08-11T15:35:35.000Z | 2021-08-11T15:35:35.000Z | MyVCR/MySetup/MySetup.cpp | kevx/myvcr | f5c01442475bb08fac7b92832372ec23ca4eec2d | [
"MIT"
] | null | null | null | MyVCR/MySetup/MySetup.cpp | kevx/myvcr | f5c01442475bb08fac7b92832372ec23ca4eec2d | [
"MIT"
] | 1 | 2021-08-05T08:15:16.000Z | 2021-08-05T08:15:16.000Z | // Setup.cpp : Defines the entry point for the application.
//
#include "stdafx.h"
#include "Setup.h"
#define X264_DESC L"x264 H.264 Video Codec"
#define X264_FILE L"x264vfw.dll"
typedef HRESULT (*IDllRegisterServer)(void);
static wchar_t _szPath[MAX_PATH];
static wchar_t _szRascalDll[MAX_PATH];
static wchar_t _szX264Dll[MAX_PATH];
static wchar_t _szX264Dest[MAX_PATH];
static wchar_t _szX264Cfg[MAX_PATH];
void getPath() {
wchar_t szFullPath[MAX_PATH];
wchar_t drive[_MAX_DRIVE];
wchar_t dir[_MAX_DIR];
ZeroMemory(_szPath, sizeof(wchar_t)*MAX_PATH);
ZeroMemory(_szRascalDll, sizeof(wchar_t)*MAX_PATH);
ZeroMemory(_szX264Dll, sizeof(wchar_t)*MAX_PATH);
ZeroMemory(_szX264Dest, sizeof(wchar_t)*MAX_PATH);
ZeroMemory(_szX264Cfg, sizeof(wchar_t)*MAX_PATH);
ZeroMemory(szFullPath, sizeof(wchar_t)*MAX_PATH);
GetModuleFileName(NULL, szFullPath, MAX_PATH);
_wsplitpath(szFullPath, drive, dir, NULL, NULL);
StringCchPrintf(_szPath, sizeof(wchar_t)*MAX_PATH,
L"%s%s",drive, dir);
StringCchPrintf(_szRascalDll, sizeof(wchar_t)*MAX_PATH,
L"%sRascal.dll", _szPath);
StringCchPrintf(_szX264Cfg, sizeof(wchar_t)*MAX_PATH,
L"%sx264cfg.dat", _szPath);
StringCchPrintf(_szX264Dll, sizeof(wchar_t)*MAX_PATH,
L"%sx264vfw.dll", _szPath);
StringCchPrintf(_szX264Dest, sizeof(wchar_t)*MAX_PATH,
L"%sx264vfw.dll", L"C:\\Windows\\System32\\");
}
bool registerRascal()
{
HINSTANCE hDll = LoadLibrary(_szRascalDll);
IDllRegisterServer iDll = (IDllRegisterServer)
GetProcAddress(hDll, "DllRegisterServer");
if(iDll != NULL)
{
iDll();
}
return true;
}
bool registerX264Codec()
{
HKEY hKey;
size_t nLen = 0;
CopyFile(_szX264Dll, _szX264Dest, false);
StringCchLength(X264_FILE, MAX_PATH, &nLen);
RegOpenKeyEx(HKEY_LOCAL_MACHINE,
L"Software\\Microsoft\\Windows NT\\CurrentVersion\\drivers32",
0, KEY_ALL_ACCESS, &hKey
);
RegSetValueEx(hKey, L"vidc.x264", 0, REG_SZ, (const BYTE*)X264_FILE, (nLen + 1)*sizeof(wchar_t));
RegCloseKey(hKey);
StringCchLength(X264_DESC, MAX_PATH, &nLen);
RegOpenKeyEx(HKEY_LOCAL_MACHINE,
L"Software\\Microsoft\\Windows NT\\CurrentVersion\\drivers.desc",
0, KEY_ALL_ACCESS, &hKey
);
RegSetValueEx(hKey, X264_FILE, 0, REG_SZ,
(const BYTE*)X264_DESC,
(nLen + 1)*sizeof(wchar_t)
);
RegCloseKey(hKey);
return true;
}
bool importX264Cfg()
{
wchar_t cmdToRun[MAX_PATH];
ZeroMemory(cmdToRun, sizeof(wchar_t)*MAX_PATH);
StringCchPrintf(cmdToRun, MAX_PATH*sizeof(wchar_t), L"REG IMPORT %s", _szX264Cfg);
_wsystem(cmdToRun);
return true;
}
int APIENTRY wWinMain(HINSTANCE hInstance,
HINSTANCE hPrevInstance,
LPTSTR lpCmdLine,
int nCmdShow)
//int main()
{
getPath();
registerX264Codec();
registerRascal();
importX264Cfg();
MessageBox(NULL, L"Successfully~!", L"MyVCR Setup", MB_ICONINFORMATION);
return 0;
}
| 25.389831 | 99 | 0.700935 | kastaineibum |
9080fdbee7fc3b4d06dfb3df1690dbe6987b566d | 827 | hpp | C++ | src/main/include/cyng/parser/spirit_support.hpp | solosTec/cyng | 3862a6b7a2b536d1f00fef20700e64170772dcff | [
"MIT"
] | null | null | null | src/main/include/cyng/parser/spirit_support.hpp | solosTec/cyng | 3862a6b7a2b536d1f00fef20700e64170772dcff | [
"MIT"
] | null | null | null | src/main/include/cyng/parser/spirit_support.hpp | solosTec/cyng | 3862a6b7a2b536d1f00fef20700e64170772dcff | [
"MIT"
] | null | null | null | /*
* The MIT License (MIT)
*
* Copyright (c) 2017 Sylko Olzscher
*
*/
#ifndef CYNG_PARSER_SPIRIT_SUPPORT_HPP
#define CYNG_PARSER_SPIRIT_SUPPORT_HPP
#if defined(_MSC_VER) && (_MSC_VER >= 1200)
#pragma once
#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)
#include <cyng/io/serializer.h>
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
namespace boost
{
namespace spirit
{
namespace traits
{
/**
* Boost.Spirit Debug support for cyng objects.
*/
template <typename Out>
struct print_attribute_debug<Out, cyng::object>
{
static void call(Out& out, cyng::object const& val)
{
cyng::io::serialize_plain(out, val);
}
};
}
}
}
#endif // CYNG_PARSER_SPIRIT_SUPPORT_HPP
| 17.978261 | 56 | 0.623942 | solosTec |
9089f10bbda27d1b884e34b1816157757bb25339 | 4,166 | cpp | C++ | src/random-walking/random_walk.cpp | msanchez-beeckman/tfg-video-segmentation | b0a85df6d7a428abe21c5b6ed131cb047fecd1f6 | [
"BSD-3-Clause"
] | 1 | 2021-06-22T10:29:22.000Z | 2021-06-22T10:29:22.000Z | src/random-walking/random_walk.cpp | msanchez-beeckman/tfg-video-segmentation | b0a85df6d7a428abe21c5b6ed131cb047fecd1f6 | [
"BSD-3-Clause"
] | null | null | null | src/random-walking/random_walk.cpp | msanchez-beeckman/tfg-video-segmentation | b0a85df6d7a428abe21c5b6ed131cb047fecd1f6 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2020-2021, Marco Sánchez Beeckman
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <chrono>
#include <fstream>
#include <iostream>
#include <unordered_map>
#include <opencv2/core.hpp>
#include "TrackTable.h"
#include "RandomWalker.h"
#include "ImageUtils.h"
int main(int argc, char* argv[]) {
// Parse command line arguments
const cv::String keys =
"{h help usage ? | | Print usage }"
"{o outfolder | | Folder where the results of the track segmentation should be stored }"
"{w outweights | | Text file where the resulting weights should be stored }"
"{b brox | | Parse tracks using Brox's codification }"
"{D davis | | Use Davis' ground truth as seeds }"
"{d minTrackDuration | 5 | Minimum track duration to take it into account }"
"{l lambda | 0.1 | Scale parameter for affinity computations }"
"{F firstNameIndex | 0 | The first index that should be appended at the end of the images' names }"
"{@images | | Text file containing the path to the images to be segmented }"
"{@seeds | | Text file containing the path and frame number of the seeds for the random walker }"
"{@tracks | | Text file containing the path to the precomputed tracks }"
;
cv::CommandLineParser parser(argc, argv, keys);
parser.about("Track segmentation using propagation of seeds with random walker");
if(parser.has("help") || argc == 1) {
parser.printMessage();
return EXIT_SUCCESS;
}
if(!parser.check()) {
parser.printErrors();
return EXIT_FAILURE;
}
// Read the image sequence
const std::string imageNamesFileName = parser.get<std::string>("@images");
std::ifstream imageNamesFile(imageNamesFileName);
std::vector<cv::Mat> images;
tfg::readImages(imageNamesFile, images);
imageNamesFile.close();
// Read tracks from text file
const std::string trackFileName = parser.get<std::string>("@tracks");
std::ifstream trackFile(trackFileName);
std::shared_ptr<tfg::TrackTable> trackTable = std::make_shared<tfg::TrackTable>();
const int minTrackDuration = parser.get<int>("minTrackDuration");
const bool hasBroxFlag = parser.has("brox");
if(hasBroxFlag) {
trackTable->buildFromBroxFile(trackFile, minTrackDuration);
} else {
trackTable->buildFromFile(trackFile, minTrackDuration);
}
trackFile.close();
trackTable->addColorInfo(images);
// Read images that serve as seeds
const std::string seedFileName = parser.get<std::string>("@seeds");
std::ifstream seedFile(seedFileName);
std::unordered_map<int, cv::Mat> seedImages;
tfg::readSeedImages(seedFile, seedImages);
seedFile.close();
// Create the random walker than propagate the seeds to each track
const bool usingDavisGT = parser.has("davis");
tfg::RandomWalker walker(trackTable);
if(usingDavisGT) {
walker.seedDavis(seedImages);
} else {
walker.seed(seedImages);
}
const float lambda = parser.get<float>("lambda");
walker.propagateSeeds(lambda);
// Write the results in a file
const std::string weightsFileName = parser.get<std::string>("outweights");
std::ofstream weightsFile(weightsFileName);
std::cout << "Writing in a file the probabilities of each label for each track" << '\n';
walker.writeProbabilities(weightsFile);
weightsFile.close();
// Paint the tracks according to their most likely label (using the same color as the seeds for the label)
const std::string resultsFolder = parser.get<std::string>("outfolder");
const std::string fileName = "out";
const int firstNameIndex = parser.get<int>("firstNameIndex");
trackTable->paintLabeledTracks(images, resultsFolder, fileName, firstNameIndex);
std::cout << "Painted tracks according to seeds" << '\n';
return EXIT_SUCCESS;
}
| 39.67619 | 121 | 0.656745 | msanchez-beeckman |
908c9f3f74b7dbd38f84d2e7b999a6f20ef70b25 | 1,127 | cpp | C++ | src/sequencer.cpp | nounoursheureux/drums | 4de87172d5f2f64c08faabb566b8e4db96761411 | [
"MIT"
] | null | null | null | src/sequencer.cpp | nounoursheureux/drums | 4de87172d5f2f64c08faabb566b8e4db96761411 | [
"MIT"
] | null | null | null | src/sequencer.cpp | nounoursheureux/drums | 4de87172d5f2f64c08faabb566b8e4db96761411 | [
"MIT"
] | null | null | null | #include "sequencer.hpp"
Sequencer::Sequencer(unsigned int tracksNum, double bpm)
{
setBpm(bpm);
latest_time = 0.0;
elapsed_time = 0.0;
current_quarter_beat = 0;
for (unsigned int i = 0; i < 16; i++) {
tracks.at(i).assign(tracksNum, false);
}
}
void Sequencer::set(unsigned int quarterBeat, unsigned int instrument, bool val)
{
tracks.at(quarterBeat).at(instrument) = val;
}
void Sequencer::setBpm(double bpm)
{
double bps = bpm / 60.0;
double time_per_beat = 1.0 / bps;
time_per_quarter_beat = time_per_beat / 4.0;
}
std::vector<bool> Sequencer::get(unsigned int quarterBeat)
{
return tracks.at(quarterBeat);
}
std::vector<bool> Sequencer::getCurrent()
{
return tracks.at(current_quarter_beat);
}
bool Sequencer::update(double current_time)
{
elapsed_time += current_time - latest_time;
latest_time = current_time;
if (elapsed_time >= time_per_quarter_beat)
{
current_quarter_beat = (current_quarter_beat + 1) % 16;
// elapsed_time -= time_per_quarter_beat;
elapsed_time = 0;
return true;
}
return false;
}
| 22.54 | 80 | 0.668146 | nounoursheureux |
909d49450a7a5b486b088f3285a03848a92d06a2 | 9,530 | cpp | C++ | src/game/client/clientsideeffects_test.cpp | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | 6 | 2022-01-23T09:40:33.000Z | 2022-03-20T20:53:25.000Z | src/game/client/clientsideeffects_test.cpp | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | null | null | null | src/game/client/clientsideeffects_test.cpp | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | 1 | 2022-02-06T21:05:23.000Z | 2022-02-06T21:05:23.000Z | //========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $Workfile: $
// $NoKeywords: $
//=============================================================================//
#include "cbase.h"
#include "engine/IEngineSound.h"
#include "view.h"
#include "fx_line.h"
#include "fx_discreetline.h"
#include "fx_quad.h"
#include "clientsideeffects.h"
#include "SoundEmitterSystem/isoundemittersystembase.h"
#include "tier0/vprof.h"
#include "collisionutils.h"
#include "clienteffectprecachesystem.h"
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
//FIXME: All these functions will be moved out to FX_Main.CPP or a individual folder
CLIENTEFFECT_REGISTER_BEGIN(PrecacheEffectsTest)
CLIENTEFFECT_MATERIAL("effects/spark")
CLIENTEFFECT_MATERIAL("effects/gunshiptracer")
CLIENTEFFECT_MATERIAL("effects/bluespark")
CLIENTEFFECT_REGISTER_END()
//-----------------------------------------------------------------------------
// Purpose:
// Input : &data -
//-----------------------------------------------------------------------------
void FX_AddLine(const FXLineData_t &data) {
CFXLine *t = new CFXLine("Line", data);
assert(t);
//Throw it into the list
clienteffects->AddEffect(t);
}
/*
==================================================
FX_AddStaticLine
==================================================
*/
void FX_AddStaticLine(const Vector &start, const Vector &end, float scale, float life, const char *materialName,
unsigned char flags) {
CFXStaticLine *t = new CFXStaticLine("StaticLine", start, end, scale, life, materialName, flags);
assert(t);
//Throw it into the list
clienteffects->AddEffect(t);
}
/*
==================================================
FX_AddDiscreetLine
==================================================
*/
void FX_AddDiscreetLine(const Vector &start, const Vector &direction, float velocity, float length, float clipLength,
float scale, float life, const char *shader) {
CFXDiscreetLine *t = new CFXDiscreetLine("Line", start, direction, velocity, length, clipLength, scale, life,
shader);
assert(t);
//Throw it into the list
clienteffects->AddEffect(t);
}
//-----------------------------------------------------------------------------
// Purpose:
//-----------------------------------------------------------------------------
void FX_AddQuad(const FXQuadData_t &data) {
CFXQuad *quad = new CFXQuad(data);
Assert(quad != NULL);
clienteffects->AddEffect(quad);
}
//-----------------------------------------------------------------------------
// Purpose: Parameter heavy version
//-----------------------------------------------------------------------------
void FX_AddQuad(const Vector &origin,
const Vector &normal,
float startSize,
float endSize,
float sizeBias,
float startAlpha,
float endAlpha,
float alphaBias,
float yaw,
float deltaYaw,
const Vector &color,
float lifeTime,
const char *shader,
unsigned int flags) {
FXQuadData_t data;
//Setup the data
data.SetAlpha(startAlpha, endAlpha);
data.SetScale(startSize, endSize);
data.SetFlags(flags);
data.SetMaterial(shader);
data.SetNormal(normal);
data.SetOrigin(origin);
data.SetLifeTime(lifeTime);
data.SetColor(color[0], color[1], color[2]);
data.SetScaleBias(sizeBias);
data.SetAlphaBias(alphaBias);
data.SetYaw(yaw, deltaYaw);
//Output it
FX_AddQuad(data);
}
//-----------------------------------------------------------------------------
// Purpose: Creates a test effect
//-----------------------------------------------------------------------------
void CreateTestEffect(void) {
//NOTENOTE: Add any test effects here
//FX_BulletPass( NULL, NULL );
}
/*
==================================================
FX_PlayerTracer
==================================================
*/
#define TRACER_BASE_OFFSET 8
void FX_PlayerTracer(Vector &start, Vector &end) {
VPROF_BUDGET("FX_PlayerTracer", VPROF_BUDGETGROUP_PARTICLE_RENDERING);
Vector shotDir, dStart, dEnd;
float length;
//Find the direction of the tracer
VectorSubtract(end, start, shotDir);
length = VectorNormalize(shotDir);
//We don't want to draw them if they're too close to us
if (length < 256)
return;
//Randomly place the tracer along this line, with a random length
VectorMA(start, TRACER_BASE_OFFSET + random->RandomFloat(-24.0f, 64.0f), shotDir, dStart);
VectorMA(dStart, (length * random->RandomFloat(0.1f, 0.6f)), shotDir, dEnd);
//Create the line
CFXStaticLine *t;
const char *materialName;
//materialName = ( random->RandomInt( 0, 1 ) ) ? "effects/tracer_middle" : "effects/tracer_middle2";
materialName = "effects/spark";
t = new CFXStaticLine("Tracer", dStart, dEnd, random->RandomFloat(0.5f, 0.75f), 0.01f, materialName, 0);
assert(t);
//Throw it into the list
clienteffects->AddEffect(t);
}
/*
==================================================
FX_Tracer
==================================================
*/
// Tracer must be this close to be considered for hearing
#define TRACER_MAX_HEAR_DIST (6*12)
#define TRACER_SOUND_TIME_MIN 0.1f
#define TRACER_SOUND_TIME_MAX 0.1f
class CBulletWhizTimer : public CAutoGameSystem {
public:
CBulletWhizTimer(char const *name) : CAutoGameSystem(name) {
}
void LevelInitPreEntity() {
m_nextWhizTime = 0;
}
float m_nextWhizTime;
};
// Client-side tracking for whiz noises
CBulletWhizTimer g_BulletWhiz("CBulletWhizTimer");
//-----------------------------------------------------------------------------
// Purpose:
// Input : &vecStart -
// &vecDir -
// iTracerType -
//-----------------------------------------------------------------------------
#define LISTENER_HEIGHT 24
void FX_TracerSound(const Vector &start, const Vector &end, int iTracerType) {
const char *pszSoundName = NULL;
float flWhizDist = TRACER_MAX_HEAR_DIST;
float flMinWhizTime = TRACER_SOUND_TIME_MIN;
float flMaxWhizTime = TRACER_SOUND_TIME_MAX;
Vector vecListenOrigin = MainViewOrigin();
switch (iTracerType) {
case TRACER_TYPE_DEFAULT: {
pszSoundName = "Bullets.DefaultNearmiss";
flWhizDist = 24;
Ray_t bullet, listener;
bullet.Init(start, end);
Vector vecLower = vecListenOrigin;
vecLower.z -= LISTENER_HEIGHT;
listener.Init(vecListenOrigin, vecLower);
float s, t;
IntersectRayWithRay(bullet, listener, s, t);
t = clamp(t, 0.f, 1.f);
vecListenOrigin.z -= t * LISTENER_HEIGHT;
}
break;
case TRACER_TYPE_GUNSHIP:
pszSoundName = "Bullets.GunshipNearmiss";
break;
case TRACER_TYPE_STRIDER:
pszSoundName = "Bullets.StriderNearmiss";
break;
case TRACER_TYPE_WATERBULLET:
pszSoundName = "Underwater.BulletImpact";
flWhizDist = 48;
flMinWhizTime = 0.3f;
flMaxWhizTime = 0.6f;
break;
default:
return;
}
if (!pszSoundName)
return;
// Is it time yet?
float dt = g_BulletWhiz.m_nextWhizTime - gpGlobals->curtime;
if (dt > 0)
return;
// Did the thing pass close enough to our head?
float vDist = CalcDistanceSqrToLineSegment(vecListenOrigin, start, end);
if (vDist >= (flWhizDist * flWhizDist))
return;
CSoundParameters params;
if (C_BaseEntity::GetParametersForSound(pszSoundName, params, NULL)) {
// Get shot direction
Vector shotDir;
VectorSubtract(end, start, shotDir);
VectorNormalize(shotDir);
CLocalPlayerFilter filter;
enginesound->EmitSound(filter, SOUND_FROM_WORLD, CHAN_STATIC, params.soundname,
params.volume, SNDLVL_TO_ATTN(params.soundlevel), 0, params.pitch, 0, &start, &shotDir,
NULL);
}
// FIXME: This has a bad behavior when both bullet + strider shots are whizzing by at the same time
// Could use different timers for the different types.
// Don't play another bullet whiz for this client until this time has run out
g_BulletWhiz.m_nextWhizTime = gpGlobals->curtime + random->RandomFloat(flMinWhizTime, flMaxWhizTime);
}
void FX_Tracer(Vector &start, Vector &end, int velocity, bool makeWhiz) {
VPROF_BUDGET("FX_Tracer", VPROF_BUDGETGROUP_PARTICLE_RENDERING);
//Don't make small tracers
float dist;
Vector dir;
VectorSubtract(end, start, dir);
dist = VectorNormalize(dir);
// Don't make short tracers.
if (dist >= 256) {
float length = random->RandomFloat(64.0f, 128.0f);
float life = (dist + length) / velocity; //NOTENOTE: We want the tail to finish its run as well
//Add it
FX_AddDiscreetLine(start, dir, velocity, length, dist, random->RandomFloat(0.75f, 0.9f), life, "effects/spark");
}
if (makeWhiz) {
FX_TracerSound(start, end, TRACER_TYPE_DEFAULT);
}
}
| 31.245902 | 120 | 0.554774 | cstom4994 |
90a19929f46f94872812d7383340ac30ad7bb27c | 856 | cc | C++ | src/typed-ast/main.cc | brphelps/verona | aa205b94aafcc4b4064cb1d3c5584ad880eafa53 | [
"MIT"
] | null | null | null | src/typed-ast/main.cc | brphelps/verona | aa205b94aafcc4b4064cb1d3c5584ad880eafa53 | [
"MIT"
] | null | null | null | src/typed-ast/main.cc | brphelps/verona | aa205b94aafcc4b4064cb1d3c5584ad880eafa53 | [
"MIT"
] | null | null | null | // Copyright Microsoft and Project Verona Contributors.
// SPDX-License-Identifier: MIT
#include "ast/cli.h"
#include "ast/module.h"
#include "ast/pass.h"
#include "ast/prec.h"
#include "ast/ref.h"
#include "ast/sugar.h"
#include "ast/sym.h"
#include "typed-ast/conversion.h"
#include "typed-ast/print.h"
int main(int argc, char** argv)
{
pass::Passes passes = {{"sugar", sugar::build},
{"sym", sym::build},
{"ref", ref::build},
{"prec", prec::build}};
err::Errors err;
auto opt = cli::parse(argc, argv);
auto m =
module::build(opt.grammar, opt.stopAt, passes, opt.filename, "verona", err);
auto typedModule = verona::ast::convertModule(m->ast);
if (opt.ast)
verona::ast::print(std::cout, *typedModule);
std::cerr << err;
return err.empty() ? 0 : -1;
}
| 26.75 | 80 | 0.599299 | brphelps |
90a41626cd6a2870684afebfddb507f24fcc45a8 | 15,798 | hpp | C++ | perf/posit_performance.hpp | hypercubestart/universal | a183ae390b5178299a5cbda7b830b7a6cbf332e2 | [
"MIT"
] | 1 | 2021-12-08T06:32:18.000Z | 2021-12-08T06:32:18.000Z | perf/posit_performance.hpp | hypercubestart/universal | a183ae390b5178299a5cbda7b830b7a6cbf332e2 | [
"MIT"
] | null | null | null | perf/posit_performance.hpp | hypercubestart/universal | a183ae390b5178299a5cbda7b830b7a6cbf332e2 | [
"MIT"
] | 1 | 2021-07-02T12:40:39.000Z | 2021-07-02T12:40:39.000Z | #pragma once
// posit_performance.hpp : functions to aid in measuring arithmetic performance of posit types.
// Needs to be included after posit type is declared.
//
// Copyright (C) 2017-2020 Stillwater Supercomputing, Inc.
//
// This file is part of the universal numbers project, which is released under an MIT Open Source license.
#include <vector>
#include <iostream>
#include <typeinfo>
#include <random>
#include <limits>
#include <chrono>
namespace sw {
namespace unum {
// standardized structure to hold performance measurement results
//
struct OperatorPerformance {
OperatorPerformance() : intconvert(0), ieeeconvert(0), prefix(0), postfix(0), neg(0), add(0), sub(0), mul(0), div(0), sqrt(0) {}
float intconvert;
float ieeeconvert;
float prefix;
float postfix;
float neg;
float add;
float sub;
float mul;
float div;
float sqrt;
};
template<typename Ty>
std::string to_scientific(Ty value) {
const char* scales[] = { "", "K", "M", "G", "T" };
Ty lower_bound = Ty(1);
Ty scale_factor = 1.0;
int integer_value = 0;
int scale = 0;
for (unsigned i = 0; i < sizeof(scales); ++i) {
if (value > lower_bound && value < 1000 * lower_bound) {
integer_value = int(value / scale_factor);
scale = i;
break;
}
lower_bound *= 1000;
scale_factor *= 1000.0;
}
std::stringstream ss;
ss << std::setw(3) << std::right << integer_value << ' ' << scales[scale];
return ss.str();
}
static constexpr int NR_TEST_CASES = 100000;
static constexpr unsigned FLOAT_TABLE_WIDTH = 15;
template<size_t nbits, size_t es>
void ReportPerformance(std::ostream& ostr, const std::string& header, OperatorPerformance &perf) {
ostr << "Performance Report: " << header << '\n'
<< "Conversion int : " << to_scientific(perf.intconvert) << "POPS\n"
<< "Conversion ieee : " << to_scientific(perf.ieeeconvert) << "POPS\n"
<< "Prefix : " << to_scientific(perf.prefix) << "POPS\n"
<< "Postfix : " << to_scientific(perf.postfix) << "POPS\n"
<< "Negation : " << to_scientific(perf.neg) << "POPS\n"
<< "Addition : " << to_scientific(perf.add) << "POPS\n"
<< "Subtraction : " << to_scientific(perf.sub) << "POPS\n"
<< "Multiplication : " << to_scientific(perf.mul) << "POPS\n"
<< "Division : " << to_scientific(perf.div) << "POPS\n"
<< "Square Root : " << to_scientific(perf.sqrt) << "POPS\n"
<< std::endl;
}
// Integer conversion case for a posit configuration
template<size_t nbits, size_t es>
int MeasureIntegerConversionPerformance(int &positives, int &negatives) {
posit<nbits, es> p(0);
positives = 0, negatives = 0;
for (int i = -(NR_TEST_CASES >> 1); i < (NR_TEST_CASES >> 1); ++i) {
p = i;
p >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// IEEE conversion case for a posit configuration
template<size_t nbits, size_t es>
int MeasureIeeeConversionPerformance(int &positives, int &negatives) {
posit<nbits, es> p(0);
positives = 0, negatives = 0;
for (int i = 1; i < NR_TEST_CASES; i++) {
p = 1.0;
p >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of the postfix operator++
template<size_t nbits, size_t es>
int MeasurePostfixPerformance(int &positives, int &negatives) {
posit<nbits, es> p(0);
positives = 0; negatives = 0;
for (int i = 1; i < NR_TEST_CASES; i++) {
p++;
p >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of the prefix operator++
template<size_t nbits, size_t es>
int MeasurePrefixPerformance(int &positives, int &negatives) {
posit<nbits, es> p(0);
positives = 0; negatives = 0;
for (int i = 1; i < NR_TEST_CASES; i++) {
++p;
p >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// enumerate all negation cases for a posit configuration: executes within 10 sec till about nbits = 14
template<size_t nbits, size_t es>
int MeasureNegationPerformance(int &positives, int &negatives) {
posit<nbits, es> pa(0);
positives = 0; negatives = 0;
for (int i = 1; i < NR_TEST_CASES; i++) {
#if POSIT_THROW_ARITHMETIC_EXCEPTION
try {
pa = -pa;
}
catch (const operand_is_nar& err) {
if (pa.isnar()) {
// correctly caught the operand is nar condition
pa.setnar();
}
else {
throw err;
}
}
#else
pa = -pa;
#endif
pa >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// enumerate all SQRT cases for a posit configuration: executes within 10 sec till about nbits = 14
template<size_t nbits, size_t es>
int MeasureSqrtPerformance(int &positives, int &negatives) {
posit<nbits, es> pa, psqrt;
positives = 0; negatives = 0;
for (int i = 0; i < NR_TEST_CASES; i++) {
pa.set_raw_bits(i);
#if POSIT_THROW_ARITHMETIC_EXCEPTION
try {
psqrt = sw::unum::sqrt(pa);
}
catch (const operand_is_nar& err) {
if (pa.isnar()) {
// correctly caught the operand is nar condition
psqrt.setnar();
}
else {
throw err;
}
}
#else
psqrt = sw::unum::sqrt(pa);
#endif
psqrt >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of arithmetic addition
template<size_t nbits, size_t es>
int MeasureAdditionPerformance(int &positives, int &negatives) {
posit<nbits, es> pa(1), pb, psum;
positives = 0; negatives = 0;
for (int i = 0; i < NR_TEST_CASES; i++) {
pb.set_raw_bits(i);
#if POSIT_THROW_ARITHMETIC_EXCEPTION
try {
psum = pa + pb;
}
catch (const operand_is_nar& err) {
if (pa.isnar() || pb.isnar()) {
// correctly caught the operand is nar condition
psum.setnar();
}
else {
throw err;
}
}
#else
psum = pa + pb;
#endif
psum >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of arithmetic subtraction
template<size_t nbits, size_t es>
int MeasureSubtractionPerformance(int &positives, int &negatives) {
posit<nbits, es> pa(1), pb, pdif;
positives = 0; negatives = 0;
for (int i = 0; i < NR_TEST_CASES; i++) {
pb.set_raw_bits(i);
#if POSIT_THROW_ARITHMETIC_EXCEPTION
try {
pdif = pa - pb;
}
catch (const operand_is_nar& err) {
if (pa.isnar() || pb.isnar()) {
// correctly caught the operand is nar condition
pdif.setnar();
}
else {
throw err;
}
}
#else
pdif = pa - pb;
#endif
pdif >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of arithmetic multiplication
template<size_t nbits, size_t es>
int MeasureMultiplicationPerformance(int &positives, int &negatives) {
posit<nbits, es> pa(1), pb, pmul;
positives = 0; negatives = 0;
for (int i = 0; i < NR_TEST_CASES; i++) {
pb.set_raw_bits(i);
#if POSIT_THROW_ARITHMETIC_EXCEPTION
try {
pmul = pa * pb;
}
catch (const operand_is_nar& err) {
if (pa.isnar() || pb.isnar()) {
// correctly caught the operand is nar condition
pmul.setnar();
}
else {
throw err;
}
}
#else
pmul = pa * pb;
#endif
pmul >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of arithmetic reciprocation
template<size_t nbits, size_t es>
int MeasureReciprocationPerformance(int &positives, int &negatives) {
posit<nbits, es> pa(0); ++pa; // minpos
positives = 0; negatives = 0;
for (int i = 0; i < NR_TEST_CASES; i++) {
pa = pa.reciprocate();
pa >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
// measure performance of arithmetic division
template<size_t nbits, size_t es>
int MeasureDivisionPerformance(int &positives, int &negatives) {
posit<nbits, es> pa(1), pb, pdiv;
positives = 0; negatives = 0;
for (int i = 0; i < NR_TEST_CASES; i++) {
pb.set_raw_bits(i);
#if POSIT_THROW_ARITHMETIC_EXCEPTION
try {
pdiv = pa / pb;
}
catch (const divide_by_zero& err) {
if (pb.iszero()) {
// correctly caught the divide by zero condition
pdiv.setnar();
}
else {
throw err;
}
}
catch (const divide_by_nar& err) {
if (pb.isnar()) {
// correctly caught the divide by nar condition
pdiv = 0.0f;
}
else {
throw err;
}
}
catch (const operand_is_nar& err) {
if (pa.isnar()) {
// correctly caught the operand is nar condition
pdiv.setnar();
}
else {
throw err;
}
}
#else
pdiv = pa / pb;
#endif
pdiv >= 0 ? positives++ : negatives++;
}
return positives + negatives;
}
//////////////////////////////////// RANDOMIZED TEST SUITE FOR BINARY OPERATORS ////////////////////////
// for testing posit configs that are > 14-15, we need a more efficient approach.
// One simple, brute force approach is to generate randoms.
// A more white box approach is to focus on the testcases
// where something special happens in the posit arithmetic, such as rounding.
// operation opcodes
const int OPCODE_NOP = 0;
const int OPCODE_ADD = 1;
const int OPCODE_SUB = 2;
const int OPCODE_MUL = 3;
const int OPCODE_DIV = 4;
const int OPCODE_RAN = 5;
template<size_t nbits, size_t es>
void execute(int opcode, double da, double db, const posit<nbits, es>& pa, const posit<nbits, es>& pb, posit<nbits, es>& preference, posit<nbits, es>& presult) {
double reference;
switch (opcode) {
default:
case OPCODE_NOP:
preference.setzero();
presult.setzero();
return;
case OPCODE_ADD:
presult = pa + pb;
reference = da + db;
break;
case OPCODE_SUB:
presult = pa - pb;
reference = da - db;
break;
case OPCODE_MUL:
presult = pa * pb;
reference = da * db;
break;
case OPCODE_DIV:
presult = pa / pb;
reference = da / db;
break;
}
preference = reference;
}
// generate a random set of operands to test the binary operators for a posit configuration
// Basic design is that we generate nrOfRandom posit values and store them in an operand array.
// We will then execute the binary operator nrOfRandom combinations.
template<size_t nbits, size_t es>
int MeasureArithmeticPerformance(const std::string& tag, bool bReportIndividualTestCases, int opcode, uint32_t nrOfRandoms) {
const size_t SIZE_STATE_SPACE = nrOfRandoms;
int nrOfFailedTests = 0;
posit<nbits, es> pa, pb, presult, preference;
std::string operation_string;
switch (opcode) {
default:
case OPCODE_NOP:
operation_string = "nop";
break;
case OPCODE_ADD:
operation_string = "+";
break;
case OPCODE_SUB:
operation_string = "-";
break;
case OPCODE_MUL:
operation_string = "*";
break;
case OPCODE_DIV:
operation_string = "/";
break;
}
// generate the full state space set of valid posit values
std::random_device rd; //Get a random seed from the OS entropy device, or whatever
std::mt19937_64 eng(rd()); //Use the 64-bit Mersenne Twister 19937 generator and seed it with entropy.
//Define the distribution, by default it goes from 0 to MAX(unsigned long long)
std::uniform_int_distribution<unsigned long long> distr;
std::vector<long double> operand_values(SIZE_STATE_SPACE);
for (uint32_t i = 0; i < SIZE_STATE_SPACE; i++) {
presult.set_raw_bits(distr(eng)); // take the bottom nbits bits as posit encoding
operand_values[i] = (long double)(presult);
}
for (unsigned i = 1; i < nrOfRandoms; i++) {
unsigned ia = std::rand() % SIZE_STATE_SPACE; // random indices for picking operands to test
long double da = operand_values[ia];
pa = da;
unsigned ib = std::rand() % SIZE_STATE_SPACE;
long double db = operand_values[ib];
pb = db;
// in case you have numeric_limits<long double>::digits trouble... this will show that
//std::cout << "sizeof da: " << sizeof(da) << " bits in significant " << (std::numeric_limits<long double>::digits - 1) << " value da " << da << " at index " << ia << " pa " << pa << std::endl;
//std::cout << "sizeof db: " << sizeof(db) << " bits in significant " << (std::numeric_limits<long double>::digits - 1) << " value db " << db << " at index " << ia << " pa " << pb << std::endl;
execute(opcode, da, db, pa, pb, preference, presult);
if (presult != preference) {
nrOfFailedTests++;
if (bReportIndividualTestCases) ReportBinaryArithmeticErrorInBinary("FAIL", operation_string, pa, pb, preference, presult);
}
else {
//if (bReportIndividualTestCases) ReportBinaryArithmeticSuccessInBinary("PASS", operation_string, pa, pb, preference, presult);
}
}
return nrOfFailedTests;
}
// run and measure performance tests and generate an operator performance report
template<size_t nbits, size_t es>
void GeneratePerformanceReport(OperatorPerformance &report) {
using namespace std;
using namespace std::chrono;
int positives, negatives;
steady_clock::time_point begin, end;
duration<double> time_span;
double elapsed;
begin = steady_clock::now();
MeasureIntegerConversionPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.intconvert = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureIeeeConversionPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.ieeeconvert = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasurePrefixPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.prefix = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasurePostfixPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.postfix = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureNegationPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.neg = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureSqrtPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.sqrt = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureAdditionPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.add = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureSubtractionPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.sub = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureMultiplicationPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.mul = float((positives + negatives) / elapsed);
begin = steady_clock::now();
MeasureDivisionPerformance<nbits, es>(positives, negatives);
end = steady_clock::now();
time_span = duration_cast<duration<double>>(end - begin);
elapsed = time_span.count();
report.div = float((positives + negatives) / elapsed);
}
} // namespace unum
} // namespace sw
| 30.091429 | 196 | 0.658374 | hypercubestart |
90b2dd72d001c22353d1490049f12cc096e1f42a | 2,378 | cpp | C++ | src/mod/debug/sticky_detonation_order.cpp | sigsegv-mvm/sigsegv-mvm | d98dbafed212b203793ffd5eef34e0cad66cede8 | [
"BSD-2-Clause"
] | 33 | 2016-02-18T04:27:53.000Z | 2022-01-15T18:59:53.000Z | src/mod/debug/sticky_detonation_order.cpp | sigsegv-mvm/sigsegv-mvm | d98dbafed212b203793ffd5eef34e0cad66cede8 | [
"BSD-2-Clause"
] | 5 | 2018-01-10T18:41:38.000Z | 2020-10-01T13:34:53.000Z | src/mod/debug/sticky_detonation_order.cpp | sigsegv-mvm/sigsegv-mvm | d98dbafed212b203793ffd5eef34e0cad66cede8 | [
"BSD-2-Clause"
] | 14 | 2017-08-06T23:02:49.000Z | 2021-08-24T00:24:16.000Z | #include "mod.h"
#include "stub/baseplayer.h"
#include "util/clientmsg.h"
namespace Mod::Debug::Sticky_Detonation_Order
{
int indent = 0;
template<typename... ARGS>
void ClientMsgAllIndent(const char *fmt, ARGS&&... args)
{
size_t fmt2_len = strlen(fmt) + (2 * indent) + 1;
char *fmt2 = new char[fmt2_len];
memset(fmt2, ' ', (2 * indent));
V_strncpy(fmt2 + (2 * indent), fmt, fmt2_len);
ClientMsgAll(fmt2, std::forward<ARGS>(args)...);
delete[] fmt2;
}
DETOUR_DECL_MEMBER(int, CBaseEntity_TakeDamage, const CTakeDamageInfo& inputInfo)
{
ClientMsgAllIndent("CBaseEntity::TakeDamage\n");
++indent;
auto result = DETOUR_MEMBER_CALL(CBaseEntity_TakeDamage)(inputInfo);
--indent;
return result;
}
DETOUR_DECL_MEMBER(void, CTFWeaponBaseGrenadeProj_Explode, trace_t *pTrace, int bitsDamageType)
{
ClientMsgAllIndent("BEGIN CTFWeaponBaseGrenadeProj::Explode\n");
++indent;
DETOUR_MEMBER_CALL(CTFWeaponBaseGrenadeProj_Explode)(pTrace, bitsDamageType);
--indent;
ClientMsgAllIndent("END CTFWeaponBaseGrenadeProj::Explode\n");
}
DETOUR_DECL_MEMBER(bool, CTFPipebombLauncher_DetonateRemotePipebombs, bool bFizzle)
{
ClientMsgAllIndent("BEGIN CTFPipebombLauncher::DetonateRemotePipebombs [bFizzle: %s]\n",
(bFizzle ? "true" : "false"));
++indent;
auto result = DETOUR_MEMBER_CALL(CTFPipebombLauncher_DetonateRemotePipebombs)(bFizzle);
--indent;
ClientMsgAllIndent("END CTFPipebombLauncher::DetonateRemotePipebombs [%s]\n",
(result ? "true" : "false"));
return result;
}
class CMod : public IMod
{
public:
CMod() : IMod("Debug:Sticky_Detonation_Order")
{
MOD_ADD_DETOUR_MEMBER(CBaseEntity_TakeDamage, "CBaseEntity::TakeDamage");
MOD_ADD_DETOUR_MEMBER(CTFWeaponBaseGrenadeProj_Explode, "CTFWeaponBaseGrenadeProj::Explode");
MOD_ADD_DETOUR_MEMBER(CTFPipebombLauncher_DetonateRemotePipebombs, "CTFPipebombLauncher::DetonateRemotePipebombs");
}
};
CMod s_Mod;
ConVar cvar_enable("sig_debug_sticky_detonation_order", "0", FCVAR_NOTIFY,
"Debug: diagnose weird effects due to stickybomb detonation order",
[](IConVar *pConVar, const char *pOldValue, float flOldValue){
s_Mod.Toggle(static_cast<ConVar *>(pConVar)->GetBool());
});
}
| 28.309524 | 119 | 0.698066 | sigsegv-mvm |
ff9876082606c61d696022557835c51206cc6b38 | 3,891 | cpp | C++ | xfa/src/fgas/src/layout/fx_unicode.cpp | f100cleveland/external_pdfium | 12eec9c70519554387f199aa1eef42ed15478d02 | [
"BSD-3-Clause"
] | 1 | 2018-01-12T03:24:59.000Z | 2018-01-12T03:24:59.000Z | xfa/src/fgas/src/layout/fx_unicode.cpp | f100cleveland/external_pdfium | 12eec9c70519554387f199aa1eef42ed15478d02 | [
"BSD-3-Clause"
] | null | null | null | xfa/src/fgas/src/layout/fx_unicode.cpp | f100cleveland/external_pdfium | 12eec9c70519554387f199aa1eef42ed15478d02 | [
"BSD-3-Clause"
] | 1 | 2020-07-30T12:07:00.000Z | 2020-07-30T12:07:00.000Z | // Copyright 2014 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "xfa/src/fgas/src/fgas_base.h"
#include "fx_unicode.h"
void FX_TEXTLAYOUT_PieceSort(CFX_TPOArray& tpos, int32_t iStart, int32_t iEnd) {
FXSYS_assert(iStart > -1 && iStart < tpos.GetSize());
FXSYS_assert(iEnd > -1 && iEnd < tpos.GetSize());
if (iStart >= iEnd) {
return;
}
int32_t i = iStart, j = iEnd;
FX_TPO *pCur = tpos.GetPtrAt(iStart), *pSort;
int32_t v = pCur->pos;
while (i < j) {
while (j > i) {
pSort = tpos.GetPtrAt(j);
if (pSort->pos < v) {
FX_TPO t = *pSort;
*pSort = *pCur;
*pCur = t;
pCur = pSort;
break;
}
j--;
}
while (i < j) {
pSort = tpos.GetPtrAt(i);
if (pSort->pos > v) {
FX_TPO t = *pSort;
*pSort = *pCur;
*pCur = t;
pCur = pSort;
break;
}
i++;
}
}
i--, j++;
if (iStart < i) {
FX_TEXTLAYOUT_PieceSort(tpos, iStart, i);
}
if (j < iEnd) {
FX_TEXTLAYOUT_PieceSort(tpos, j, iEnd);
}
}
static const FX_JAPCHARPROPERTYEX gs_FX_JapCharPropertysEx[] = {
{0x3001, 0x13}, {0x3002, 0x13}, {0x3041, 0x23}, {0x3043, 0x23},
{0x3045, 0x23}, {0x3047, 0x23}, {0x3049, 0x23}, {0x3063, 0x23},
{0x3083, 0x23}, {0x3085, 0x23}, {0x3087, 0x23}, {0x308E, 0x23},
{0x3095, 0x23}, {0x3096, 0x23}, {0x30A1, 0x23}, {0x30A3, 0x23},
{0x30A5, 0x23}, {0x30A7, 0x23}, {0x30A9, 0x23}, {0x30C3, 0x23},
{0x30E3, 0x23}, {0x30E5, 0x23}, {0x30E7, 0x23}, {0x30EE, 0x23},
{0x30F5, 0x23}, {0x30F6, 0x23}, {0x30FB, 0x22}, {0x31F0, 0x23},
{0x31F1, 0x23}, {0x31F2, 0x23}, {0x31F3, 0x23}, {0x31F4, 0x23},
{0x31F5, 0x23}, {0x31F6, 0x23}, {0x31F7, 0x23}, {0x31F8, 0x23},
{0x31F9, 0x23}, {0x31FA, 0x23}, {0x31FB, 0x23}, {0x31FC, 0x23},
{0x31FD, 0x23}, {0x31FE, 0x23}, {0x31FF, 0x23},
};
FX_LPCJAPCHARPROPERTYEX FX_GetJapCharPropertyEx(FX_WCHAR wch) {
int32_t iStart = 0;
int32_t iEnd =
sizeof(gs_FX_JapCharPropertysEx) / sizeof(FX_JAPCHARPROPERTYEX);
while (iStart <= iEnd) {
int32_t iMid = (iStart + iEnd) / 2;
FX_WCHAR wJapChar = gs_FX_JapCharPropertysEx[iMid].wChar;
if (wch == wJapChar) {
return gs_FX_JapCharPropertysEx + iMid;
} else if (wch < wJapChar) {
iEnd = iMid - 1;
} else {
iStart = iMid + 1;
}
}
return NULL;
}
FX_BOOL FX_AdjustJapCharDisplayPos(FX_WCHAR wch,
FX_BOOL bMBCSCode,
IFX_Font* pFont,
FX_FLOAT fFontSize,
FX_BOOL bVertical,
CFX_PointF& ptOffset) {
if (pFont == NULL || !bVertical) {
return FALSE;
}
if (wch < 0x3001 || wch > 0x31FF) {
return FALSE;
}
FX_LPCJAPCHARPROPERTYEX pJapChar = FX_GetJapCharPropertyEx(wch);
if (pJapChar == NULL) {
return FALSE;
}
CFX_Rect rtBBox;
rtBBox.Reset();
if (pFont->GetCharBBox(wch, rtBBox, bMBCSCode)) {
switch (pJapChar->uAlign & 0xF0) {
case FX_JAPCHARPROPERTYEX_Top:
ptOffset.y = fFontSize * (1000 - rtBBox.height) / 1200.0f;
break;
case FX_JAPCHARPROPERTYEX_Middle:
ptOffset.y = fFontSize * (1000 - rtBBox.height) / 6000.0f;
break;
}
switch (pJapChar->uAlign & 0x0F) {
case FX_JAPCHARPROPERTYEX_Center:
ptOffset.x = fFontSize * (600 - rtBBox.right()) / 1000.0f;
break;
case FX_JAPCHARPROPERTYEX_Right:
ptOffset.x = fFontSize * (950 - rtBBox.right()) / 1000.0f;
break;
}
}
return TRUE;
}
| 32.974576 | 81 | 0.562066 | f100cleveland |
ff98fec67a7d27d3a21360c9bc03d606739c291a | 53,303 | cpp | C++ | gvirtus.cublas/frontend/Cublas_level3.cpp | RapidProjectH2020/GVirtuS | 8c29fac81baba927c516e8af1c0b6a858b80934c | [
"Apache-2.0"
] | 14 | 2016-12-14T11:09:55.000Z | 2019-12-16T08:37:21.000Z | gvirtus.cublas/frontend/Cublas_level3.cpp | RapidProjectH2020/GVirtuS | 8c29fac81baba927c516e8af1c0b6a858b80934c | [
"Apache-2.0"
] | null | null | null | gvirtus.cublas/frontend/Cublas_level3.cpp | RapidProjectH2020/GVirtuS | 8c29fac81baba927c516e8af1c0b6a858b80934c | [
"Apache-2.0"
] | 13 | 2016-05-30T14:44:17.000Z | 2021-03-02T01:51:08.000Z | /*
* gVirtuS -- A GPGPU transparent virtualization component.
*
* Copyright (C) 2009-2010 The University of Napoli Parthenope at Naples.
*
* This file is part of gVirtuS.
*
* gVirtuS is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* gVirtuS is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with gVirtuS; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* Written by: Vincenzo Santopietro <vincenzo.santopietro@uniparthenope.it>,
* Department of Science and Technologies
*/
#include <iostream>
#include <cstdio>
#include <string>
#include "CublasFrontend.h"
using namespace std;
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasSgemm_v2 (cublasHandle_t handle,
cublasOperation_t transa,
cublasOperation_t transb,
int m,
int n,
int k,
const float *alpha, /* host or device pointer */
const float *A,
int lda,
const float *B,
int ldb,
const float *beta, /* host or device pointer */
float *C,
int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasSgemm_v2");
if (CublasFrontend::Success())
C = (float *)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasSgemmBatched(cublasHandle_t handle,
cublasOperation_t transa, cublasOperation_t transb,
int m, int n, int k,
const float *alpha, const float *Aarray[], int lda,
const float *Barray[], int ldb,
const float *beta, float *Carray[], int ldc,
int batchCount){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(Aarray);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(Barray);
CublasFrontend::AddVariableForArguments<int>(ldb);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(Carray);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::AddVariableForArguments<int>(batchCount);
CublasFrontend::Execute("cublasSgemmBatched_v2");
if (CublasFrontend::Success())
Carray = (float **)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDgemm_v2 (cublasHandle_t handle,
cublasOperation_t transa,
cublasOperation_t transb,
int m,
int n,
int k,
const double *alpha, /* host or device pointer */
const double *A,
int lda,
const double *B,
int ldb,
const double *beta, /* host or device pointer */
double *C,
int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasDgemm_v2");
if (CublasFrontend::Success())
C = (double *)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDgemmBatched(cublasHandle_t handle,
cublasOperation_t transa, cublasOperation_t transb,
int m, int n, int k,
const double *alpha, const double *Aarray[], int lda,
const double *Barray[], int ldb,
const double *beta, double *Carray[], int ldc,
int batchCount){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(Aarray);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(Barray);
CublasFrontend::AddVariableForArguments<int>(ldb);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(Carray);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::AddVariableForArguments<int>(batchCount);
CublasFrontend::Execute("cublasDgemmBatched_v2");
if (CublasFrontend::Success())
Carray = (double **)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCgemm_v2 (cublasHandle_t handle,
cublasOperation_t transa,
cublasOperation_t transb,
int m,
int n,
int k,
const cuComplex *alpha, /* host or device pointer */
const cuComplex *A,
int lda,
const cuComplex *B,
int ldb,
const cuComplex *beta, /* host or device pointer */
cuComplex *C,
int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuComplex * _beta = const_cast<cuComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCgemm_v2");
if (CublasFrontend::Success())
C = (cuComplex *)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCgemmBatched(cublasHandle_t handle,
cublasOperation_t transa, cublasOperation_t transb,
int m, int n, int k,
const cuComplex *alpha, const cuComplex *Aarray[], int lda,
const cuComplex *Barray[], int ldb,
const cuComplex *beta, cuComplex *Carray[], int ldc,
int batchCount){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(Aarray);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(Barray);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuComplex * _beta = const_cast<cuComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(Carray);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::AddVariableForArguments<int>(batchCount);
CublasFrontend::Execute("cublasCgemmBatched_v2");
if (CublasFrontend::Success())
Carray = (cuComplex **)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZgemm_v2 (cublasHandle_t handle,
cublasOperation_t transa,
cublasOperation_t transb,
int m,
int n,
int k,
const cuDoubleComplex *alpha, /* host or device pointer */
const cuDoubleComplex *A,
int lda,
const cuDoubleComplex *B,
int ldb,
const cuDoubleComplex *beta, /* host or device pointer */
cuDoubleComplex *C,
int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuDoubleComplex * _beta = const_cast<cuDoubleComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZgemm_v2");
if (CublasFrontend::Success())
C = (cuDoubleComplex *)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZgemmBatched(cublasHandle_t handle,
cublasOperation_t transa, cublasOperation_t transb,
int m, int n, int k,
const cuDoubleComplex *alpha, const cuDoubleComplex *Aarray[], int lda,
const cuDoubleComplex *Barray[], int ldb,
const cuDoubleComplex *beta, cuDoubleComplex *Carray[], int ldc,
int batchCount){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transa);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(transb);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(Aarray);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(Barray);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuDoubleComplex * _beta = const_cast<cuDoubleComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(Carray);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::AddVariableForArguments<int>(batchCount);
CublasFrontend::Execute("cublasZgemmBatched_v2");
if (CublasFrontend::Success())
Carray = (cuDoubleComplex **)CublasFrontend::GetOutputDevicePointer();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasSnrm2_v2 (cublasHandle_t handle,int n, const float *x, int incx, float *result){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddDevicePointerForArguments(x);
CublasFrontend::AddVariableForArguments<int>(incx);
CublasFrontend::Execute("cublasSnrm2_v2");
if(CublasFrontend::Success())
*result = CublasFrontend::GetOutputVariable<float>();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDnrm2_v2 (cublasHandle_t handle,int n, const double *x, int incx, double *result){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddDevicePointerForArguments(x);
CublasFrontend::AddVariableForArguments<int>(incx);
CublasFrontend::Execute("cublasDnrm2_v2");
if(CublasFrontend::Success())
*result = CublasFrontend::GetOutputVariable<double>();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasScnrm2_v2 (cublasHandle_t handle,int n, const cuComplex *x, int incx, float *result){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddDevicePointerForArguments(x);
CublasFrontend::AddVariableForArguments<int>(incx);
CublasFrontend::Execute("cublasScnrm2_v2");
if(CublasFrontend::Success())
*result = CublasFrontend::GetOutputVariable<float>();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDznrm2_v2 (cublasHandle_t handle,int n, const cuDoubleComplex *x, int incx, double *result){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddDevicePointerForArguments(x);
CublasFrontend::AddVariableForArguments<int>(incx);
CublasFrontend::Execute("cublasDznrm2_v2");
if(CublasFrontend::Success())
*result = CublasFrontend::GetOutputVariable<double>();
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasSsyrk_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const float *alpha, const float *A, int lda, const float *beta, float *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasSsyrk_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDsyrk_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const double *alpha, const double *A, int lda, const double *beta, double *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasDsyrk_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCsyrk_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const cuComplex *alpha, const cuComplex *A, int lda, const cuComplex *beta, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
cuComplex * _beta = const_cast<cuComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCsyrk_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZsyrk_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, const cuDoubleComplex *beta, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
cuDoubleComplex * _beta = const_cast<cuDoubleComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZsyrk_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCherk_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const float *alpha, const cuComplex *A, int lda, const float *beta, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCherk_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZherk_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const double *alpha, const cuDoubleComplex *A, int lda, const double *beta, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZherk_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasSsyr2k_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const float *alpha, const float *A, int lda, const float *B, int ldb, const float *beta, float *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasSsyr2k_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDsyr2k_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const double *alpha, const double *A, int lda, const double *B, int ldb, const double *beta, double *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasDsyr2k_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCsyr2k_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const cuComplex *alpha, const cuComplex *A, int lda, const cuComplex *B, int ldb, const cuComplex *beta, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuComplex * _beta = const_cast<cuComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCsyr2k_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZsyr2k_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, const cuDoubleComplex *B, int ldb, const cuDoubleComplex *beta, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuDoubleComplex * _beta = const_cast<cuDoubleComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZsyr2k_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCher2k_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const cuComplex *alpha, const cuComplex *A, int lda, const cuComplex *B, int ldb, const float *beta, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCher2k_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZher2k_v2(cublasHandle_t handle, cublasFillMode_t uplo, cublasOperation_t trans, int n, int k, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, const cuDoubleComplex *B, int ldb, const double *beta, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<int>(n);
CublasFrontend::AddVariableForArguments<int>(k);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZher2k_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasSsymm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, int m, int n, const float *alpha, const float *A, int lda, const float *B, int ldb, const float *beta, float *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
float * _beta = const_cast<float *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasSsymm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDsymm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, int m, int n, const double *alpha, const double *A, int lda, const double *B, int ldb, const double *beta, double *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
double * _beta = const_cast<double *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasDsymm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCsymm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, int m, int n, const cuComplex *alpha, const cuComplex *A, int lda, const cuComplex *B, int ldb, const cuComplex *beta, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuComplex * _beta = const_cast<cuComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCsymm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZsymm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, int m, int n, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, const cuDoubleComplex *B, int ldb, const cuDoubleComplex *beta, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuDoubleComplex * _beta = const_cast<cuDoubleComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZsymm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasChemm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, int m, int n, const cuComplex *alpha, const cuComplex *A, int lda, const cuComplex *B, int ldb, const cuComplex *beta, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuComplex * _beta = const_cast<cuComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasChemm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZhemm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, int m, int n, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, const cuDoubleComplex *B, int ldb, const cuDoubleComplex *beta, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
cuDoubleComplex * _beta = const_cast<cuDoubleComplex *>(beta);
CublasFrontend::AddHostPointerForArguments(_beta);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZhemm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasStrsm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const float *alpha, const float *A, int lda, float *B, int ldb){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::Execute("cublasStrsm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDtrsm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const double *alpha, const double *A, int lda, double *B, int ldb){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::Execute("cublasDtrsm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCtrsm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const cuComplex *alpha, const cuComplex *A, int lda, cuComplex *B, int ldb){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::Execute("cublasCtrsm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZtrsm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, cuDoubleComplex *B, int ldb){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::Execute("cublasZtrsm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasStrmm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const float *alpha, const float *A, int lda, const float *B, int ldb, float *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
float * _alpha = const_cast<float *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasStrmm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasDtrmm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const double *alpha, const double *A, int lda, const double *B, int ldb, double *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
double * _alpha = const_cast<double *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasDtrmm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasCtrmm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const cuComplex *alpha, const cuComplex *A, int lda, const cuComplex *B, int ldb, cuComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuComplex * _alpha = const_cast<cuComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasCtrmm_v2");
return CublasFrontend::GetExitCode();
}
extern "C" CUBLASAPI cublasStatus_t CUBLASWINAPI cublasZtrmm_v2(cublasHandle_t handle, cublasSideMode_t side, cublasFillMode_t uplo, cublasOperation_t trans, cublasDiagType_t diag, int m, int n, const cuDoubleComplex *alpha, const cuDoubleComplex *A, int lda, const cuDoubleComplex *B, int ldb, cuDoubleComplex *C, int ldc){
CublasFrontend::Prepare();
CublasFrontend::AddVariableForArguments<long long int>((long long int)handle);
CublasFrontend::AddVariableForArguments<cublasSideMode_t>(side);
CublasFrontend::AddVariableForArguments<cublasFillMode_t>(uplo);
CublasFrontend::AddVariableForArguments<cublasOperation_t>(trans);
CublasFrontend::AddVariableForArguments<cublasDiagType_t>(diag);
CublasFrontend::AddVariableForArguments<int>(m);
CublasFrontend::AddVariableForArguments<int>(n);
cuDoubleComplex * _alpha = const_cast<cuDoubleComplex *>(alpha);
CublasFrontend::AddHostPointerForArguments(_alpha);
CublasFrontend::AddDevicePointerForArguments(A);
CublasFrontend::AddVariableForArguments<int>(lda);
CublasFrontend::AddDevicePointerForArguments(B);
CublasFrontend::AddVariableForArguments<int>(ldb);
CublasFrontend::AddDevicePointerForArguments(C);
CublasFrontend::AddVariableForArguments<int>(ldc);
CublasFrontend::Execute("cublasZtrmm_v2");
return CublasFrontend::GetExitCode();
} | 51.007656 | 324 | 0.702306 | RapidProjectH2020 |
ff9959a935ccdcd8336a47c1d3f64970a0669df2 | 745 | cpp | C++ | 1633-EducationalCodeforcesRound122/B.cpp | ReiRev/Codeforces | ad2d3e943f9e2c29850aade24d8d486fea57812a | [
"MIT"
] | null | null | null | 1633-EducationalCodeforcesRound122/B.cpp | ReiRev/Codeforces | ad2d3e943f9e2c29850aade24d8d486fea57812a | [
"MIT"
] | null | null | null | 1633-EducationalCodeforcesRound122/B.cpp | ReiRev/Codeforces | ad2d3e943f9e2c29850aade24d8d486fea57812a | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int t;
cin >> t;
for (int i = 0; i < t; i++)
{
string s;
cin >> s;
int c0 = 0;
int c1 = 0;
int ans = 0;
for (char c : s)
{
if (c == '0')
{
c0++;
}
else
{
c1++;
}
}
if (c0 == c1)
{
if (s.size() == 2)
{
cout << 0 << endl;
}
else
{
cout << c0 - 1 << endl;
}
}
else
{
cout << min(c0, c1) << endl;
}
}
} | 16.555556 | 40 | 0.261745 | ReiRev |
ff9f2b8591ed2e9cd9b26966609dbc07cfa95f9b | 2,844 | hpp | C++ | worker/include/RTC/RTCP/XrReceiverReferenceTime.hpp | liwf616/mediasoup | 99d1c696bd4b985ea8bf5348b7f520998e165c32 | [
"ISC"
] | null | null | null | worker/include/RTC/RTCP/XrReceiverReferenceTime.hpp | liwf616/mediasoup | 99d1c696bd4b985ea8bf5348b7f520998e165c32 | [
"ISC"
] | null | null | null | worker/include/RTC/RTCP/XrReceiverReferenceTime.hpp | liwf616/mediasoup | 99d1c696bd4b985ea8bf5348b7f520998e165c32 | [
"ISC"
] | 1 | 2021-06-11T10:53:24.000Z | 2021-06-11T10:53:24.000Z | #ifndef MS_RTC_RTCP_XR_RECEIVER_REFERENCE_TIME_HPP
#define MS_RTC_RTCP_XR_RECEIVER_REFERENCE_TIME_HPP
#include "common.hpp"
#include "RTC/RTCP/XR.hpp"
/* https://tools.ietf.org/html/rfc3611
* Receiver Reference Time Report Block
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| BT=4 | reserved | block length = 2 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| NTP timestamp, most significant word |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| NTP timestamp, least significant word |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
*/
namespace RTC
{
namespace RTCP
{
class ReceiverReferenceTime : public ExtendedReportBlock
{
public:
struct Body
{
uint32_t ntpSec;
uint32_t ntpFrac;
};
public:
static ReceiverReferenceTime* Parse(const uint8_t* data, size_t len);
public:
// Parsed Report. Points to an external data.
explicit ReceiverReferenceTime(CommonHeader* header);
// Locally generated Report. Holds the data internally.
ReceiverReferenceTime();
public:
uint32_t GetNtpSec() const;
void SetNtpSec(uint32_t ntpSec);
uint32_t GetNtpFrac() const;
void SetNtpFrac(uint32_t ntpFrac);
/* Pure virtual methods inherited from ExtendedReportBlock. */
public:
virtual void Dump() const override;
virtual size_t Serialize(uint8_t* buffer) override;
virtual size_t GetSize() const override;
private:
Body* body{ nullptr };
uint8_t raw[sizeof(Body)] = { 0 };
};
/* Inline ReceiverReferenceTime instance methods. */
inline ReceiverReferenceTime::ReceiverReferenceTime()
: ExtendedReportBlock(RTCP::ExtendedReportBlock::Type::RRT)
{
this->body = reinterpret_cast<Body*>(this->raw);
}
inline ReceiverReferenceTime::ReceiverReferenceTime(CommonHeader* header)
: ExtendedReportBlock(ExtendedReportBlock::Type::RRT)
{
this->header = header;
this->body = reinterpret_cast<Body*>((header) + 1);
}
inline size_t ReceiverReferenceTime::GetSize() const
{
size_t size{ 4 }; // Common header.
size += sizeof(Body);
return size;
}
inline uint32_t ReceiverReferenceTime::GetNtpSec() const
{
return uint32_t{ ntohl(this->body->ntpSec) };
}
inline void ReceiverReferenceTime::SetNtpSec(uint32_t ntpSec)
{
this->body->ntpSec = uint32_t{ htonl(ntpSec) };
}
inline uint32_t ReceiverReferenceTime::GetNtpFrac() const
{
return uint32_t{ ntohl(this->body->ntpFrac) };
}
inline void ReceiverReferenceTime::SetNtpFrac(uint32_t ntpFrac)
{
this->body->ntpFrac = uint32_t{ htonl(ntpFrac) };
}
} // namespace RTCP
} // namespace RTC
#endif
| 26.579439 | 75 | 0.617792 | liwf616 |
ffa4292694703d2644ef0315afa460a9f16ddd20 | 4,452 | cpp | C++ | src/ast/ast_util.cpp | Grossley/opengml | bc3494aae64092f1c32a16361fd781249e2ea630 | [
"MIT"
] | 26 | 2019-07-18T04:45:08.000Z | 2022-03-13T09:52:04.000Z | src/ast/ast_util.cpp | Grossley/opengml | bc3494aae64092f1c32a16361fd781249e2ea630 | [
"MIT"
] | 6 | 2021-09-10T00:48:00.000Z | 2021-11-27T22:00:48.000Z | src/ast/ast_util.cpp | Grossley/opengml | bc3494aae64092f1c32a16361fd781249e2ea630 | [
"MIT"
] | 9 | 2019-07-26T06:32:53.000Z | 2022-01-12T14:38:59.000Z | #include "ogm/ast/parse.h"
#include <iostream>
#include <cstring>
payload_type_t ogm_ast_tree_get_payload_type(
const ogm_ast_t* tree
)
{
switch (tree->m_subtype)
{
case ogm_ast_st_imp_assignment:
case ogm_ast_st_exp_arithmetic:
case ogm_ast_st_exp_accessor:
case ogm_ast_st_imp_body:
case ogm_ast_st_imp_loop:
case ogm_ast_st_imp_control:
return ogm_ast_payload_t_spec;
case ogm_ast_st_exp_literal_primitive:
return ogm_ast_payload_t_literal_primitive;
case ogm_ast_st_imp_var:
return ogm_ast_payload_t_declaration;
case ogm_ast_st_imp_enum:
case ogm_ast_st_exp_literal_struct:
return ogm_ast_payload_t_declaration_enum;
case ogm_ast_st_exp_literal_function:
return ogm_ast_payload_t_literal_function;
case ogm_ast_st_exp_identifier:
return ogm_ast_payload_t_string;
case ogm_ast_st_imp_body_list:
return ogm_ast_payload_t_string_list;
default:
return ogm_ast_payload_t_none;
}
}
const char* ogm_ast_tree_get_payload_string(
const ogm_ast_t* tree
)
{
if (ogm_ast_tree_get_payload_type(tree) == ogm_ast_payload_t_string)
{
return (const char*) tree->m_payload;
}
else
{
return nullptr;
}
}
const char* ogm_ast_tree_get_payload_string_list(
const ogm_ast_t* tree,
size_t i
)
{
if (ogm_ast_tree_get_payload_type(tree) == ogm_ast_payload_t_string_list)
{
if (i >= tree->m_sub_count) return nullptr;
return ((const char**) tree->m_payload)[i];
}
else
{
return nullptr;
}
}
bool ogm_ast_tree_get_spec(
const ogm_ast_t* tree,
ogm_ast_spec_t* out_spec
)
{
if (ogm_ast_tree_get_payload_type(tree) == ogm_ast_payload_t_spec)
{
*out_spec = tree->m_spec;
return true;
}
else
{
*out_spec = ogm_ast_spec_none;
return false;
}
}
bool ogm_ast_tree_get_payload_literal_primitive(
const ogm_ast_t* tree,
ogm_ast_literal_primitive_t** out_payload
)
{
if (tree->m_subtype == ogm_ast_st_exp_literal_primitive)
{
*out_payload = (ogm_ast_literal_primitive_t*)tree->m_payload;
return true;
}
return false;
}
bool ogm_ast_tree_get_payload_declaration(
const ogm_ast_t* tree,
ogm_ast_declaration_t** out_payload
)
{
if (tree->m_subtype == ogm_ast_st_imp_var || tree->m_subtype == ogm_ast_st_imp_enum || tree->m_subtype == ogm_ast_st_exp_literal_struct)
{
*out_payload = (ogm_ast_declaration_t*)tree->m_payload;
return true;
}
return false;
}
bool ogm_ast_tree_get_payload_function_literal(
const ogm_ast_t* tree,
ogm_ast_literal_function_t** out_payload
)
{
if (tree->m_subtype == ogm_ast_st_exp_literal_function)
{
*out_payload = (ogm_ast_literal_function_t*)tree->m_payload;
return true;
}
return false;
}
void print_indent(
int32_t indent
)
{
for (int32_t i = 0; i < indent; i++)
{
std::cout << " ";
}
}
void ogm_ast_tree_print_helper(
const ogm_ast_t* tree,
int32_t indent
)
{
print_indent(indent);
if (tree->m_type == ogm_ast_t_exp)
{
std::cout << "& ";
}
else
{
std::cout << "> ";
}
std::cout << ogm_ast_subtype_string[tree->m_subtype];
ogm_ast_spec_t spec;
if (ogm_ast_tree_get_spec(tree, &spec))
{
std::cout << " " << ogm_ast_spec_string[tree->m_spec];
}
// extra payload:
switch(tree->m_subtype)
{
case ogm_ast_st_exp_literal_primitive:
{
ogm_ast_literal_primitive_t* payload;
ogm_ast_tree_get_payload_literal_primitive(tree, &payload);
std::cout << ": " << payload->m_value;
}
break;
case ogm_ast_st_exp_identifier:
std::cout << ": " << (char*) tree->m_payload;
break;
default:
break;
}
std::cout << " [" << tree->m_start.m_line + 1<< ":" << tree->m_start.m_column + 1
<< " - " << tree->m_end.m_line + 1<< ":" << tree->m_end.m_column + 1 << "]";
std::cout << std::endl;
// subtrees
for (int32_t i = 0; i < tree->m_sub_count; i++)
{
ogm_ast_tree_print_helper(
tree->m_sub + i,
indent + 1
);
}
}
void ogm_ast_tree_print(
const ogm_ast_t* tree
)
{
ogm_ast_tree_print_helper(tree, 0);
}
| 22.948454 | 140 | 0.636792 | Grossley |
ffa48141431e91da1911dbdd016b5013b789a8bd | 2,211 | cxx | C++ | Source/VTKExtensions/Testing/delosMeshReader.cxx | developkits/cmb | caaf9cd7ffe0b7c1ac3be9edbce0f9430068d2cb | [
"BSD-3-Clause"
] | null | null | null | Source/VTKExtensions/Testing/delosMeshReader.cxx | developkits/cmb | caaf9cd7ffe0b7c1ac3be9edbce0f9430068d2cb | [
"BSD-3-Clause"
] | null | null | null | Source/VTKExtensions/Testing/delosMeshReader.cxx | developkits/cmb | caaf9cd7ffe0b7c1ac3be9edbce0f9430068d2cb | [
"BSD-3-Clause"
] | null | null | null | //=========================================================================
// Copyright (c) Kitware, Inc.
// All rights reserved.
// See LICENSE.txt for details.
//
// This software is distributed WITHOUT ANY WARRANTY; without even
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
// PURPOSE. See the above copyright notice for more information.
//=========================================================================
// Description: A simple program for creating VTK representations of meshes
// Generate by the Delos Mesher
#include "vtkActor.h"
#include "vtkDelosMeshReader.h"
#include "vtkDoubleArray.h"
#include "vtkInteractorStyleSwitch.h"
#include "vtkNew.h"
#include "vtkPolyData.h"
#include "vtkPolyDataMapper.h"
#include "vtkPolyDataNormals.h"
#include "vtkProperty.h"
#include "vtkRenderWindow.h"
#include "vtkRenderWindowInteractor.h"
#include "vtkRenderer.h"
#include "vtkXMLPolyDataWriter.h"
#include <string>
#include "vtkProperty.h"
int main(int argc, char* argv[])
{
if (argc != 3)
{
std::cerr << "Usage: delosMeshReader delosMeshFile vtkFileName\n";
return -1;
}
vtkNew<vtkRenderWindow> renWin;
vtkNew<vtkRenderer> renderer;
vtkNew<vtkRenderWindowInteractor> iren;
vtkNew<vtkInteractorStyleSwitch> style;
style->SetCurrentStyleToTrackballCamera();
iren->SetInteractorStyle(style.GetPointer());
iren->SetRenderWindow(renWin.GetPointer());
renWin->AddRenderer(renderer.GetPointer());
vtkNew<vtkDelosMeshReader> reader;
reader->SetFileName(argv[1]);
reader->Update();
vtkNew<vtkXMLPolyDataWriter> writer;
writer->SetInputData(reader->GetOutput());
writer->SetFileName(argv[2]);
writer->Write();
vtkNew<vtkPolyDataMapper> mapper;
mapper->SetInputConnection(reader->GetOutputPort(0));
vtkNew<vtkActor> actor;
actor->SetMapper(mapper.GetPointer());
vtkNew<vtkProperty> property;
property->SetDiffuseColor(1.0, 0.5, 0.2);
property->SetEdgeColor(0.2, 0.2, 1.0);
property->EdgeVisibilityOn();
property->SetRepresentationToSurface();
actor->SetProperty(property.GetPointer());
renderer->AddViewProp(actor.GetPointer());
iren->Initialize();
renWin->Render();
iren->Start();
return 0;
}
| 29.48 | 75 | 0.691542 | developkits |
ffad10098b09c0b34b903e2e33d8888fa016ff83 | 1,560 | cpp | C++ | tests/src/daw_parallel_observable_ptr_test.cpp | beached/parallel | e0db2d7eac7a173f44a4bce9fcfec7aa063d9c1e | [
"BSL-1.0"
] | null | null | null | tests/src/daw_parallel_observable_ptr_test.cpp | beached/parallel | e0db2d7eac7a173f44a4bce9fcfec7aa063d9c1e | [
"BSL-1.0"
] | null | null | null | tests/src/daw_parallel_observable_ptr_test.cpp | beached/parallel | e0db2d7eac7a173f44a4bce9fcfec7aa063d9c1e | [
"BSL-1.0"
] | null | null | null | // Copyright (c) Darrell Wright
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/beached/parallel
//
#include "daw/daw_benchmark.h"
#include "daw/parallel/daw_observable_ptr.h"
#include <atomic>
#include <cstdint>
void test_001( ) {
int *p = new int{ 4 };
auto t = daw::observable_ptr<int>( p );
auto obs = t.get_observer( );
obs.lock( []( int &val ) { val = 5; } );
daw::expecting( 5, *p );
}
void test_002( ) {
int *p = new int{ 4 };
auto t = daw::observable_ptr<int>( p );
auto obs = t.get_observer( );
{
auto lck = obs.try_borrow( );
if( lck ) {
*lck = 5;
}
}
daw::expecting( 5, *p );
}
void test_003( ) {
auto t = daw::make_observable_ptr<int>( 4 );
auto obs = t.get_observer( );
obs.lock( []( int &val ) { val = 5; } );
daw::expecting( 5, *t );
}
void test_004( ) {
auto t = daw::make_observable_ptr<std::atomic_int_least8_t>(
static_cast<int_least8_t>( 0 ) );
auto const obs = t.get_observer( );
daw::expecting( 0, obs.borrow( )->load( ) );
}
namespace {
struct test_005_t {
daw::observable_ptr<std::atomic_int_least8_t> value;
test_005_t( )
: value{ daw::make_observable_ptr<std::atomic_int_least8_t>(
static_cast<int_least8_t>( 0 ) ) } {}
};
} // namespace
void test_005( ) {
test_005_t tmp{ };
auto v = tmp.value->load( );
daw::expecting( 0, v );
}
int main( ) {
test_001( );
test_002( );
test_003( );
test_004( );
test_005( );
}
| 19.02439 | 79 | 0.625 | beached |
ffb7a388fd9b44294da70fff22e78b3497907216 | 696 | hpp | C++ | include/pdb/detail/symdata.hpp | MattiRegenhardt/pdb | 90a7cbedd5ae4dd4451dcf30159753882b559aa0 | [
"BSL-1.0"
] | null | null | null | include/pdb/detail/symdata.hpp | MattiRegenhardt/pdb | 90a7cbedd5ae4dd4451dcf30159753882b559aa0 | [
"BSL-1.0"
] | null | null | null | include/pdb/detail/symdata.hpp | MattiRegenhardt/pdb | 90a7cbedd5ae4dd4451dcf30159753882b559aa0 | [
"BSL-1.0"
] | null | null | null | //
// Created by Matti on 28.02.2021.
//
#ifndef PDB_INCLUDE_PDB_DETAIL_SYMDATA_HPP
#define PDB_INCLUDE_PDB_DETAIL_SYMDATA_HPP
#include <cstdint>
#include <cstring>
namespace pdb::detail
{
#pragma pack(push, 1)
struct pubsym32_t
{
std::uint16_t reclen{};
std::uint16_t rectyp{};
std::uint32_t pubsymflags{};
std::uint32_t off{};
std::uint16_t seg{};
//char name[N];
[[nodiscard]]
bool operator==(pubsym32_t const& rhs) const noexcept
{
return !std::memcmp(this, &rhs, sizeof(pubsym32_t));
}
[[nodiscard]]
bool operator!=(pubsym32_t const& rhs) const noexcept
{
return !(*this == rhs);
}
};
#pragma pack(pop)
}
#endif //PDB_INCLUDE_PDB_DETAIL_SYMDATA_HPP
| 18.315789 | 55 | 0.691092 | MattiRegenhardt |
ffb8e2763da68a8fa4a8c8a9204e7a4010fc537c | 52,753 | cpp | C++ | src/subcommand/gbwt_main.cpp | CominLab/VG-SNP-Aware | 6e28125879ad7b5b9b0d160d19406e69278a0e58 | [
"MIT"
] | 1 | 2021-11-16T21:23:49.000Z | 2021-11-16T21:23:49.000Z | src/subcommand/gbwt_main.cpp | CominLab/VG-SNP-Aware | 6e28125879ad7b5b9b0d160d19406e69278a0e58 | [
"MIT"
] | null | null | null | src/subcommand/gbwt_main.cpp | CominLab/VG-SNP-Aware | 6e28125879ad7b5b9b0d160d19406e69278a0e58 | [
"MIT"
] | null | null | null | /** \file gbwt_main.cpp
*
* Defines the "vg gbwt" subcommand for building, merging, and manipulating GBWT indexes
* and GBWTGraphs.
*/
#include <omp.h>
#include <unistd.h>
#include <getopt.h>
#include <set>
#include "subcommand.hpp"
#include "../gbwt_helper.hpp"
#include "../haplotype_indexer.hpp"
#include "../path.hpp"
#include "../region.hpp"
#include <vg/io/vpkg.hpp>
#include <gbwt/fast_locate.h>
#include <gbwtgraph/gbwtgraph.h>
#include <gbwtgraph/path_cover.h>
using namespace vg;
enum build_mode { build_none, build_vcf, build_paths, build_alignments };
enum merge_mode { merge_none, merge_insert, merge_fast, merge_parallel };
enum path_cover_mode { path_cover_none, path_cover_augment, path_cover_local, path_cover_greedy };
void use_or_save(std::unique_ptr<gbwt::DynamicGBWT>& index, GBWTHandler& gbwts, std::vector<std::string>& filenames, size_t i, bool show_progress);
void print_metadata(std::ostream& out, const GBWTHandler& gbwts);
void get_graph(std::unique_ptr<PathHandleGraph>& graph, bool& in_use, const std::string& filename, bool show_progress);
void clear_graph(std::unique_ptr<PathHandleGraph>& graph, bool& in_use);
struct job_type {
std::string filename;
std::vector<path_handle_t> paths;
size_t size;
// Large jobs first.
bool operator<(const job_type& another) const {
return (this->size > another.size);
}
typedef std::pair<path_handle_t, size_t> path_type;
void insert(path_type path) {
this->paths.push_back(path.first);
this->size += path.second;
}
};
std::vector<job_type> determine_jobs(const std::vector<std::string>& vcf_files, std::unique_ptr<PathHandleGraph>& graph, const std::map<std::string, std::string>& path_to_vcf, bool inputs_as_jobs);
size_t default_build_jobs() {
return std::max(static_cast<size_t>(1), static_cast<size_t>(omp_get_max_threads() / 2));
}
size_t default_merge_jobs() {
return std::min(static_cast<size_t>(gbwt::MergeParameters::MERGE_JOBS), std::max(static_cast<size_t>(1), static_cast<size_t>(omp_get_max_threads() / 2)));
}
void use_preset(HaplotypeIndexer& haplotype_indexer, std::string preset_name);
void help_gbwt(char** argv) {
std::cerr << "usage: " << argv[0] << " gbwt [options] [args]" << std::endl;
std::cerr << std::endl;
std::cerr << "Manipulate GBWTs. Input GBWTs are loaded from input args or built in earlier steps." << std::endl;
std::cerr << std::endl;
std::cerr << "General options:" << std::endl;
std::cerr << " -x, --xg-name FILE read the graph from FILE" << std::endl;
std::cerr << " -o, --output FILE write output GBWT to FILE" << std::endl;
std::cerr << " -d, --temp-dir DIR use directory DIR for temporary files" << std::endl;
std::cerr << " -p, --progress show progress and statistics" << std::endl;
std::cerr << std::endl;
std::cerr << "GBWT construction parameters (for steps 1 and 4):" << std::endl;
std::cerr << " --buffer-size N GBWT construction buffer size in millions of nodes (default " << (gbwt::DynamicGBWT::INSERT_BATCH_SIZE / gbwt::MILLION) << ")" << std::endl;
std::cerr << " --id-interval N store path ids at one out of N positions (default " << gbwt::DynamicGBWT::SAMPLE_INTERVAL << ")" << std::endl;
std::cerr << std::endl;
std::cerr << "Search parameters (for -b and -r):" << std::endl;
std::cerr << " --num-threads N use N parallel search threads (default " << omp_get_max_threads() << ")" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 1: GBWT construction (requires -o, -x, and one of { -v, -E, A }):" << std::endl;
std::cerr << " -v, --vcf-input index the haplotypes in the VCF files specified in input args in parallel" << std::endl;
std::cerr << " (inputs must be over different contigs; implies -f)" << std::endl;
std::cerr << " --preset X use preset X (available: 1000gp)" << std::endl;
std::cerr << " --num-jobs N use at most N parallel build jobs (default " << default_build_jobs() << ")" << std::endl;
std::cerr << " --inputs-as-jobs create one build job for each input instead of using first-fit heuristic" << std::endl;
std::cerr << " --parse-only store the VCF parses without building GBWTs" << std::endl;
std::cerr << " (use -o for the file name prefix; skips subsequent steps)" << std::endl;
std::cerr << " --ignore-missing do not warn when variants are missing from the graph" << std::endl;
std::cerr << " --actual-phasing do not interpret unphased homozygous genotypes as phased" << std::endl;
std::cerr << " --force-phasing replace unphased genotypes with randomly phased ones" << std::endl;
std::cerr << " --discard-overlaps skip overlapping alternate alleles if the overlap cannot be resolved" << std::endl;
std::cerr << " instead of creating a phase break" << std::endl;
std::cerr << " --batch-size N index the haplotypes in batches of N samples (default 200)" << std::endl; // FIXME source for the default
std::cerr << " --sample-range X-Y index samples X to Y (inclusive, 0-based)" << std::endl;
std::cerr << " --rename V=P VCF contig V matches path P in the graph (may repeat)" << std::endl;
std::cerr << " --vcf-variants variants in the graph use VCF contig names instead of path names" << std::endl;
std::cerr << " --vcf-region C:X-Y restrict VCF contig C to coordinates X to Y (inclusive, 1-based; may repeat)" << std::endl;
std::cerr << " --exclude-sample X do not index the sample with name X (faster than -R; may repeat)" << std::endl;
std::cerr << " -E, --index-paths index the embedded non-alt paths in the graph (no input args)" << std::endl;
std::cerr << " --paths-as-samples each path becomes a sample instead of a contig in the metadata" << std::endl;
std::cerr << " -A, --alignment-input index the alignments in the GAF files specified in input args" << std::endl;
std::cerr << " --gam-format the input files are in GAM format instead of GAF format" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 2: Merge multiple input GBWTs (requires -o):" << std::endl;
std::cerr << " -m, --merge use the insertion algorithm" << std::endl;
std::cerr << " -f, --fast fast merging algorithm (node ids must not overlap)" << std::endl;
std::cerr << " -b, --parallel use the parallel algorithm" << std::endl;
std::cerr << " --chunk-size N search in chunks of N sequences (default " << gbwt::MergeParameters::CHUNK_SIZE << ")" << std::endl;
std::cerr << " --pos-buffer N use N MiB position buffers for each search thread (default " << gbwt::MergeParameters::POS_BUFFER_SIZE << ")" << std::endl;
std::cerr << " --thread-buffer N use N MiB thread buffers for each search thread (default " << gbwt::MergeParameters::THREAD_BUFFER_SIZE << ")" << std::endl;
std::cerr << " --merge-buffers N merge 2^N thread buffers into one file per merge job (default " << gbwt::MergeParameters::MERGE_BUFFERS << ")" << std::endl;
std::cerr << " --merge-jobs N run N parallel merge jobs (default " << default_merge_jobs() << ")" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 3: Remove samples (requires -o and one input GBWT):" << std::endl;
std::cerr << " -R, --remove-sample X remove the sample with name X from the index (may repeat)" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 4: Path cover GBWT construction (requires -o, -x, and one of { -a, -l, -P }):" << std::endl;
std::cerr << " -a, --augment-gbwt add a path cover of missing components (one input GBWT)" << std::endl;
std::cerr << " -l, --local-haplotypes sample local haplotypes (one input GBWT)" << std::endl;
std::cerr << " -P, --path-cover build a greedy path cover (no input GBWTs)" << std::endl;
std::cerr << " -n, --num-paths N find N paths per component (default " << gbwtgraph::LOCAL_HAPLOTYPES_DEFAULT_N << " for -l, " << gbwtgraph::PATH_COVER_DEFAULT_N << " otherwise)" << std::endl;
std::cerr << " -k, --context-length N use N-node contexts (default " << gbwtgraph::PATH_COVER_DEFAULT_K << ")" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 5: GBWTGraph construction (requires -x and one input GBWT):" << std::endl;
std::cerr << " -g, --graph-name FILE build GBWTGraph and store it in FILE" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 6: R-index construction (one input GBWT):" << std::endl;
std::cerr << " -r, --r-index FILE build an r-index and store it in FILE" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 7: Metadata (one input GBWT):" << std::endl;
std::cerr << " -M, --metadata print basic metadata" << std::endl;
std::cerr << " -C, --contigs print the number of contigs" << std::endl;
std::cerr << " -H, --haplotypes print the number of haplotypes" << std::endl;
std::cerr << " -S, --samples print the number of samples" << std::endl;
std::cerr << " -L, --list-names list contig/sample names (use with -C or -S)" << std::endl;
std::cerr << " -T, --thread-names list thread names" << std::endl;
std::cerr << std::endl;
std::cerr << "Step 8: Threads (one input GBWT):" << std::endl;
std::cerr << " -c, --count-threads print the number of threads" << std::endl;
std::cerr << " -e, --extract FILE extract threads in SDSL format to FILE" << std::endl;
std::cerr << std::endl;
}
int main_gbwt(int argc, char** argv)
{
if (argc == 2) {
help_gbwt(argv);
std::exit(EXIT_FAILURE);
}
// Long options with no corresponding short options.
constexpr int OPT_BUFFER_SIZE = 1000;
constexpr int OPT_ID_INTERVAL = 1001;
constexpr int OPT_NUM_THREADS = 1002;
constexpr int OPT_PRESET = 1100;
constexpr int OPT_NUM_JOBS = 1101;
constexpr int OPT_INPUTS_AS_JOBS = 1102;
constexpr int OPT_PARSE_ONLY = 1103;
constexpr int OPT_IGNORE_MISSING = 1104;
constexpr int OPT_ACTUAL_PHASING = 1105;
constexpr int OPT_FORCE_PHASING = 1106;
constexpr int OPT_DISCARD_OVERLAPS = 1107;
constexpr int OPT_BATCH_SIZE = 1108;
constexpr int OPT_SAMPLE_RANGE = 1109;
constexpr int OPT_RENAME = 1110;
constexpr int OPT_VCF_VARIANTS = 1111;
constexpr int OPT_VCF_REGION = 1112;
constexpr int OPT_EXCLUDE_SAMPLE = 1113;
constexpr int OPT_PATHS_AS_SAMPLES = 1114;
constexpr int OPT_GAM_FORMAT = 1115;
constexpr int OPT_CHUNK_SIZE = 1200;
constexpr int OPT_POS_BUFFER = 1201;
constexpr int OPT_THREAD_BUFFER = 1202;
constexpr int OPT_MERGE_BUFFERS = 1203;
constexpr int OPT_MERGE_JOBS = 1204;
// Requirements and modes.
bool produces_one_gbwt = false; // Steps 1-4 eventually produce one input GBWT regardless of the number of input args.
build_mode build = build_none;
merge_mode merge = merge_none;
path_cover_mode path_cover = path_cover_none;
bool metadata_mode = false, thread_mode = false;
// Input GBWT construction.
HaplotypeIndexer haplotype_indexer;
bool gam_format = false, inputs_as_jobs = false, parse_only = false;
size_t build_jobs = default_build_jobs();
// Parallel merging.
gbwt::MergeParameters merge_parameters;
merge_parameters.setMergeJobs(default_merge_jobs());
// Other parameters and flags.
bool show_progress = false;
bool count_threads = false;
bool metadata = false, contigs = false, haplotypes = false, samples = false, list_names = false, thread_names = false;
size_t num_paths = gbwtgraph::PATH_COVER_DEFAULT_N, context_length = gbwtgraph::PATH_COVER_DEFAULT_K;
bool num_paths_set = false;
size_t search_threads = omp_get_max_threads();
// File/sample names.
std::string gbwt_output, thread_output;
std::string graph_output, xg_name;
std::string r_index_name;
std::set<std::string> to_remove;
int c;
optind = 2; // force optind past command positional argument
while (true) {
static struct option long_options[] =
{
// General
{ "xg-name", required_argument, 0, 'x' },
{ "output", required_argument, 0, 'o' },
{ "temp-dir", required_argument, 0, 'd' },
{ "progress", no_argument, 0, 'p' },
// GBWT construction parameters
{ "buffer-size", required_argument, 0, OPT_BUFFER_SIZE },
{ "id-interval", required_argument, 0, OPT_ID_INTERVAL },
// Search parameters
{ "num-threads", required_argument, 0, OPT_NUM_THREADS },
// Input GBWT construction
{ "vcf-input", no_argument, 0, 'v' },
{ "preset", required_argument, 0, OPT_PRESET },
{ "num-jobs", required_argument, 0, OPT_NUM_JOBS },
{ "inputs-as-jobs", no_argument, 0, OPT_INPUTS_AS_JOBS },
{ "parse-only", no_argument, 0, OPT_PARSE_ONLY },
{ "ignore-missing", no_argument, 0, OPT_IGNORE_MISSING },
{ "actual-phasing", no_argument, 0, OPT_ACTUAL_PHASING },
{ "force-phasing", no_argument, 0, OPT_FORCE_PHASING },
{ "discard-overlaps", no_argument, 0, OPT_DISCARD_OVERLAPS },
{ "batch-size", required_argument, 0, OPT_BATCH_SIZE },
{ "sample-range", required_argument, 0, OPT_SAMPLE_RANGE },
{ "rename", required_argument, 0, OPT_RENAME },
{ "vcf-variants", no_argument, 0, OPT_VCF_VARIANTS },
{ "vcf-region", required_argument, 0, OPT_VCF_REGION },
{ "exclude-sample", required_argument, 0, OPT_EXCLUDE_SAMPLE },
{ "index-paths", no_argument, 0, 'E' },
{ "paths-as-samples", no_argument, 0, OPT_PATHS_AS_SAMPLES },
{ "alignment-input", no_argument, 0, 'A' },
{ "gam-format", no_argument, 0, OPT_GAM_FORMAT },
// Merging
{ "merge", no_argument, 0, 'm' },
{ "fast", no_argument, 0, 'f' },
{ "parallel", no_argument, 0, 'b' },
{ "chunk-size", required_argument, 0, OPT_CHUNK_SIZE },
{ "pos-buffer", required_argument, 0, OPT_POS_BUFFER },
{ "thread-buffer", required_argument, 0, OPT_THREAD_BUFFER },
{ "merge-buffers", required_argument, 0, OPT_MERGE_BUFFERS },
{ "merge-jobs", required_argument, 0, OPT_MERGE_JOBS },
// Remove sample
{ "remove-sample", required_argument, 0, 'R' },
// Path cover
{ "augment-gbwt", no_argument, 0, 'a' },
{ "local-haplotypes", no_argument, 0, 'l' },
{ "path-cover", no_argument, 0, 'P' },
{ "num-paths", required_argument, 0, 'n' },
{ "context-length", required_argument, 0, 'k' },
// GBWTGraph
{ "graph-name", required_argument, 0, 'g' },
// R-index
{ "r-index", required_argument, 0, 'r' },
// Metadata
{ "metadata", no_argument, 0, 'M' },
{ "contigs", no_argument, 0, 'C' },
{ "haplotypes", no_argument, 0, 'H' },
{ "samples", no_argument, 0, 'S' },
{ "list-names", no_argument, 0, 'L' },
{ "thread-names", no_argument, 0, 'T' },
// Threads
{ "count-threads", no_argument, 0, 'c' },
{ "extract", required_argument, 0, 'e' },
{ "help", no_argument, 0, 'h' },
{ 0, 0, 0, 0 }
};
int option_index = 0;
c = getopt_long(argc, argv, "x:o:d:pvEAmfbR:alPn:k:g:r:MCHSLTce:h?", long_options, &option_index);
/* Detect the end of the options. */
if (c == -1)
break;
switch (c)
{
// General
case 'x':
xg_name = optarg;
break;
case 'o':
gbwt_output = optarg;
break;
case 'd':
temp_file::set_dir(optarg);
break;
case 'p':
show_progress = true;
haplotype_indexer.show_progress = true;
break;
// GBWT construction parameters
case OPT_BUFFER_SIZE:
haplotype_indexer.gbwt_buffer_size = std::max(parse<size_t>(optarg), 1ul);
break;
case OPT_ID_INTERVAL:
haplotype_indexer.id_interval = parse<size_t>(optarg);
break;
// Search parameters
case OPT_NUM_THREADS:
search_threads = std::max(parse<size_t>(optarg), 1ul);
break;
// Input GBWT construction
case 'v':
assert(build == build_none);
build = build_vcf;
produces_one_gbwt = true;
break;
case OPT_PRESET:
use_preset(haplotype_indexer, optarg);
break;
case OPT_NUM_JOBS:
build_jobs = parse<size_t>(optarg);
break;
case OPT_INPUTS_AS_JOBS:
inputs_as_jobs = true;
break;
case OPT_PARSE_ONLY:
parse_only = true;
break;
case OPT_IGNORE_MISSING:
haplotype_indexer.warn_on_missing_variants = false;
break;
case OPT_ACTUAL_PHASING:
haplotype_indexer.phase_homozygous = false;
break;
case OPT_FORCE_PHASING:
haplotype_indexer.force_phasing = true;
break;
case OPT_DISCARD_OVERLAPS:
haplotype_indexer.discard_overlaps = true;
break;
case OPT_BATCH_SIZE:
haplotype_indexer.samples_in_batch = std::max(parse<size_t>(optarg), 1ul);
break;
case OPT_SAMPLE_RANGE:
{
// Parse first-last
string range(optarg);
size_t found = range.find("-");
if(found == std::string::npos || found == 0 || found + 1 == range.size()) {
cerr << "error: [vg gbwt] could not parse range " << range << endl;
std::exit(EXIT_FAILURE);
}
haplotype_indexer.sample_range.first = parse<size_t>(range.substr(0, found));
haplotype_indexer.sample_range.second = parse<size_t>(range.substr(found + 1)) + 1;
}
break;
case OPT_RENAME:
{
// Parse old=new
string key_value(optarg);
auto found = key_value.find('=');
if (found == string::npos || found == 0 || found + 1 == key_value.size()) {
cerr << "error: [vg gbwt] could not parse rename " << key_value << endl;
std::exit(EXIT_FAILURE);
}
// Parse out the two parts
string vcf_contig = key_value.substr(0, found);
string graph_contig = key_value.substr(found + 1);
// Add the name mapping
haplotype_indexer.path_to_vcf[graph_contig] = vcf_contig;
}
break;
case OPT_VCF_VARIANTS:
haplotype_indexer.rename_variants = false;
break;
case OPT_VCF_REGION:
{
// Parse contig:first-last
std::string region(optarg);
Region parsed;
parse_region(region, parsed);
if (parsed.start <= 0 || parsed.end <= 0) {
// We need both range bounds, and we can't accept 0 since input is 1-based.
cerr << "error: [vg gbwt] could not parse 1-based region " << region << endl;
}
// Make sure to correct the coordinates to 0-based exclusive-end, from 1-based inclusive-end
haplotype_indexer.regions[parsed.seq] = std::make_pair((size_t) (parsed.start - 1), (size_t) parsed.end);
}
break;
case OPT_EXCLUDE_SAMPLE:
haplotype_indexer.excluded_samples.insert(optarg);
break;
case 'E':
assert(build == build_none);
build = build_paths;
produces_one_gbwt = true;
break;
case OPT_PATHS_AS_SAMPLES:
haplotype_indexer.paths_as_samples = true;
break;
case 'A':
assert(build == build_none);
build = build_alignments;
produces_one_gbwt = true;
break;
case OPT_GAM_FORMAT:
gam_format = true;
break;
// Merging
case 'm':
merge = merge_insert;
produces_one_gbwt = true;
break;
case 'f':
merge = merge_fast;
produces_one_gbwt = true;
break;
case 'b':
merge = merge_parallel;
produces_one_gbwt = true;
break;
case OPT_CHUNK_SIZE:
merge_parameters.setChunkSize(parse<size_t>(optarg));
break;
case OPT_POS_BUFFER:
merge_parameters.setPosBufferSize(parse<size_t>(optarg));
break;
case OPT_THREAD_BUFFER:
merge_parameters.setThreadBufferSize(parse<size_t>(optarg));
break;
case OPT_MERGE_BUFFERS:
merge_parameters.setMergeBuffers(parse<size_t>(optarg));
break;
case OPT_MERGE_JOBS:
merge_parameters.setMergeJobs(parse<size_t>(optarg));
break;
// Remove sample
case 'R':
to_remove.insert(optarg);
break;
// Path cover
case 'a':
assert(path_cover == path_cover_none);
path_cover = path_cover_augment;
break;
case 'l':
assert(path_cover == path_cover_none);
path_cover = path_cover_local;
if (!num_paths_set) {
num_paths = gbwtgraph::LOCAL_HAPLOTYPES_DEFAULT_N;
}
break;
case 'P':
assert(path_cover == path_cover_none);
path_cover = path_cover_greedy;
produces_one_gbwt = true;
break;
case 'n':
num_paths = parse<size_t>(optarg);
num_paths_set = true;
break;
case 'k':
context_length = parse<size_t>(optarg);
break;
// GBWTGraph
case 'g':
graph_output = optarg;
break;
// Build r-index
case 'r':
r_index_name = optarg;
break;
// Metadata
case 'M':
metadata = true;
metadata_mode = true;
break;
case 'C':
contigs = true;
metadata_mode = true;
break;
case 'H':
haplotypes = true;
metadata_mode = true;
break;
case 'S':
samples = true;
metadata_mode = true;
break;
case 'L':
list_names = true;
metadata_mode = true;
break;
case 'T':
thread_names = true;
metadata_mode = true;
break;
// Threads
case 'c':
count_threads = true;
thread_mode = true;
break;
case 'e':
thread_output = optarg;
thread_mode = true;
break;
case 'h':
case '?':
/* getopt_long already printed an error message. */
help_gbwt(argv);
std::exit(EXIT_FAILURE);
break;
default:
std::exit(EXIT_FAILURE);
}
}
std::vector<std::string> input_filenames;
for (int arg = optind; arg < argc; arg++) {
input_filenames.push_back(argv[arg]);
}
std::string gbwt_name = (input_filenames.empty() ? "" : input_filenames.front());
// Sanity checks.
if (build != build_none) {
if (xg_name.empty() || gbwt_output.empty()) {
std::cerr << "error: [vg gbwt]: GBWT construction requires a graph and output GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
if (build == build_vcf) {
if (input_filenames.empty()) {
std::cerr << "error: [vg gbwt]: GBWT construction from VCF files requires input args" << std::endl;
std::exit(EXIT_FAILURE);
}
if (parse_only) {
haplotype_indexer.batch_file_prefix = gbwt_output;
}
} else if (build == build_alignments) {
if (input_filenames.empty()) {
std::cerr << "error: [vg gbwt]: GBWT construction from alignments requires input args" << std::endl;
std::exit(EXIT_FAILURE);
}
} else if (build == build_paths) {
if (!input_filenames.empty()) {
std::cerr << "error: [vg gbwt]: GBWT construction from embedded paths does not use input args" << std::endl;
std::exit(EXIT_FAILURE);
}
}
}
if (merge != merge_none) {
if (input_filenames.size() < 2 || gbwt_output.empty()) {
std::cerr << "error: [vg gbwt]: merging requires multiple input GBWTs and output GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
}
if (!to_remove.empty()) {
if (!(input_filenames.size() == 1 || merge != merge_none) || gbwt_output.empty()) {
std::cerr << "error: [vg gbwt]: removing a sample requires one input GBWT and output GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
}
if (path_cover != path_cover_none) {
if (gbwt_output.empty() || xg_name.empty()) {
std::cerr << "error: [vg gbwt]: path cover options require output GBWT and a graph" << std::endl;
std::exit(EXIT_FAILURE);
}
if (path_cover == path_cover_greedy && !input_filenames.empty()) {
std::cerr << "error: [vg gbwt]: greedy path cover does not use input GBWTs" << std::endl;
std::exit(EXIT_FAILURE);
}
if ((path_cover == path_cover_local || path_cover == path_cover_augment) && !(input_filenames.size() == 1 || merge != merge_none)) {
std::cerr << "error: [vg gbwt]: path cover options -a and -l require one input GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
if (num_paths == 0) {
std::cerr << "error: [vg gbwt] number of paths must be non-zero for path cover" << std::endl;
std::exit(EXIT_FAILURE);
}
if (context_length < gbwtgraph::PATH_COVER_MIN_K) {
std::cerr << "error: [vg gbwt] context length must be at least " << gbwtgraph::PATH_COVER_MIN_K << " for path cover" << std::endl;
std::exit(EXIT_FAILURE);
}
}
if (!graph_output.empty()) {
if (xg_name.empty() || !(input_filenames.size() == 1 || produces_one_gbwt)) {
std::cerr << "error: [vg gbwt]: GBWTGraph construction requires a graph and one input GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
}
if (!r_index_name.empty()) {
if (!(input_filenames.size() == 1 || produces_one_gbwt)) {
std::cerr << "error: [vg gbwt]: r-index construction requires one input GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
}
if (metadata_mode) {
if (!(input_filenames.size() == 1 || produces_one_gbwt)) {
std::cerr << "error: [vg gbwt]: metadata operations require one input GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
}
if (thread_mode) {
if (!(input_filenames.size() == 1 || produces_one_gbwt)) {
std::cerr << "error: [vg gbwt]: thread operations require one input GBWT" << std::endl;
std::exit(EXIT_FAILURE);
}
}
// Let GBWT operate silently and use the same temporary directory as vg.
gbwt::Verbosity::set(gbwt::Verbosity::SILENT);
gbwt::TempFile::setDirectory(temp_file::get_dir());
// This is the data we are using.
GBWTHandler gbwts;
gbwts.filename = gbwt_name;
gbwts.show_progress = show_progress;
std::unique_ptr<PathHandleGraph> input_graph;
bool graph_in_use = false;
// Input GBWT construction.
if (build != build_none) {
double start = gbwt::readTimer();
if (show_progress) {
std::cerr << "Building input GBWTs" << std::endl;
}
gbwts.unbacked(); // We will build a new GBWT.
get_graph(input_graph, graph_in_use, xg_name, show_progress);
if (build == build_vcf) {
if (show_progress) {
std::cerr << "Input type: VCF" << std::endl;
}
omp_set_num_threads(build_jobs);
// Process each VCF contig corresponding to a non-alt path.
std::vector<job_type> jobs = determine_jobs(input_filenames, input_graph, haplotype_indexer.path_to_vcf, inputs_as_jobs);
if (jobs.size() > 1 && merge == merge_none) {
merge = merge_fast;
}
std::vector<std::vector<std::string>> vcf_parses(jobs.size());
if (show_progress) {
std::cerr << "Parsing " << jobs.size() << " VCF files using up to " << build_jobs << " parallel jobs" << std::endl;
}
#pragma omp parallel for schedule(dynamic, 1)
for (size_t i = 0; i < jobs.size(); i++) {
std::string job_name = "Job " + std::to_string(i);
if (show_progress) {
#pragma omp critical
{
std::cerr << job_name << ": File " << jobs[i].filename << ", paths {";
for (path_handle_t handle : jobs[i].paths) {
std::cerr << " " << input_graph->get_path_name(handle);
}
std::cerr << " }" << std::endl;
}
}
vcf_parses[i] = haplotype_indexer.parse_vcf(jobs[i].filename, *input_graph, jobs[i].paths, job_name);
}
// Delete the graph to save memory.
clear_graph(input_graph, graph_in_use);
if (!parse_only) {
std::vector<std::string> gbwt_files(vcf_parses.size(), "");
if (show_progress) {
std::cerr << "Building " << vcf_parses.size() << " GBWTs using up to " << build_jobs << " parallel jobs" << std::endl;
}
#pragma omp parallel for schedule(dynamic, 1)
for (size_t i = 0; i < vcf_parses.size(); i++) {
std::string job_name = "Job " + std::to_string(i);
std::unique_ptr<gbwt::DynamicGBWT> parsed = haplotype_indexer.build_gbwt(vcf_parses[i], job_name);
use_or_save(parsed, gbwts, gbwt_files, i, show_progress);
}
if (vcf_parses.size() > 1) {
input_filenames = gbwt_files; // Use the temporary GBWTs as inputs.
}
}
} else if (build == build_paths) {
if(show_progress) {
std::cerr << "Input type: embedded paths" << std::endl;
}
std::unique_ptr<gbwt::DynamicGBWT> temp = haplotype_indexer.build_gbwt(*input_graph);
gbwts.use(*temp);
} else if (build == build_alignments) {
if (show_progress) {
std::cerr << "Input type: " << (gam_format ? "GAM" : "GAF") << std::endl;
}
std::unique_ptr<gbwt::DynamicGBWT> temp = haplotype_indexer.build_gbwt(*input_graph, input_filenames, (gam_format ? "GAM" : "GAF"));
gbwts.use(*temp);
}
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "GBWTs built in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
if (parse_only) {
return 0; // VCF parsing does not produce GBWTs to continue with.
}
}
// Merge multiple input GBWTs.
if (merge != merge_none) {
double start = gbwt::readTimer();
if (show_progress) {
std::string algo_name;
if (merge == merge_fast) {
algo_name = "fast";
} else if (merge == merge_insert) {
algo_name = "insertion";
} else if (merge == merge_parallel) {
algo_name = "parallel";
}
std::cerr << "Merging " << input_filenames.size() << " input GBWTs (" << algo_name << " algorithm)" << std::endl;
}
if (merge == merge_fast) {
std::vector<gbwt::GBWT> indexes(input_filenames.size());
for (size_t i = 0; i < input_filenames.size(); i++) {
load_gbwt(input_filenames[i], indexes[i], show_progress);
}
if (show_progress) {
std::cerr << "Merging the GBWTs" << std::endl;
}
gbwt::GBWT merged(indexes);
gbwts.use(merged);
} else if (merge == merge_insert) {
gbwts.use_dynamic();
for (size_t i = 1; i < input_filenames.size(); i++) {
gbwt::GBWT next;
load_gbwt(input_filenames[i], next, show_progress);
if (next.size() > 2 * gbwts.dynamic.size()) {
std::cerr << "warning: [vg gbwt] merging " << input_filenames[i] << " into a substantially smaller index" << std::endl;
std::cerr << "warning: [vg gbwt] merging would be faster in another order" << std::endl;
}
if (show_progress) {
std::cerr << "Inserting " << next.sequences() << " sequences of total length " << next.size() << std::endl;
}
gbwts.dynamic.merge(next);
}
} else if (merge == merge_parallel) {
gbwts.use_dynamic();
omp_set_num_threads(search_threads);
for (size_t i = 1; i < input_filenames.size(); i++) {
gbwt::DynamicGBWT next;
load_gbwt(input_filenames[i], next, show_progress);
if (next.size() > 2 * gbwts.dynamic.size()) {
std::cerr << "warning: [vg gbwt] merging " << input_filenames[i] << " into a substantially smaller index" << std::endl;
std::cerr << "warning: [vg gbwt] merging would be faster in another order" << std::endl;
}
if (show_progress) {
std::cerr << "Inserting " << next.sequences() << " sequences of total length " << next.size() << std::endl;
}
gbwts.dynamic.merge(next, merge_parameters);
}
}
gbwts.unbacked(); // We modified the GBWT.
if (show_progress) {
print_metadata(std::cerr, gbwts);
double seconds = gbwt::readTimer() - start;
std::cerr << "GBWTs merged in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// Remove samples from the GBWT.
if (!to_remove.empty()) {
double start = gbwt::readTimer();
if (show_progress) {
std::cerr << "Removing " << to_remove.size() << " sample(s) from the index" << std::endl;
}
gbwts.use_dynamic();
if (!(gbwts.dynamic.hasMetadata() && gbwts.dynamic.metadata.hasPathNames() && gbwts.dynamic.metadata.hasSampleNames())) {
std::cerr << "error: [vg gbwt] the index does not contain metadata with thread and sample names" << std::endl;
std::exit(EXIT_FAILURE);
}
std::set<gbwt::size_type> sample_ids;
for (const std::string& sample_name : to_remove) {
gbwt::size_type sample_id = gbwts.dynamic.metadata.sample(sample_name);
if (sample_id >= gbwts.dynamic.metadata.samples()) {
std::cerr << "warning: [vg gbwt] the index does not contain sample " << sample_name << std::endl;
} else {
sample_ids.insert(sample_id);
}
}
std::vector<gbwt::size_type> path_ids;
for (gbwt::size_type sample_id : sample_ids) {
std::vector<gbwt::size_type> current_paths = gbwts.dynamic.metadata.removeSample(sample_id);
path_ids.insert(path_ids.end(), current_paths.begin(), current_paths.end());
}
if (path_ids.empty()) {
std::cerr << "warning: [vg gbwt] no threads associated with the removed samples" << std::endl;
} else {
if (show_progress) {
std::cerr << "Removing " << path_ids.size() << " threads" << std::endl;
}
size_t foo = gbwts.dynamic.remove(path_ids);
}
gbwts.unbacked(); // We modified the GBWT.
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "Samples removed in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// Path cover options.
if (path_cover != path_cover_none) {
double start = gbwt::readTimer();
if (show_progress) {
std::cerr << "Finding a " << num_paths << "-path cover with context length " << context_length << std::endl;
}
get_graph(input_graph, graph_in_use, xg_name, show_progress);
if (path_cover == path_cover_greedy) {
if (show_progress) {
std::cerr << "Algorithm: greedy" << std::endl;
}
gbwt::GBWT cover = gbwtgraph::path_cover_gbwt(*input_graph, num_paths, context_length, haplotype_indexer.gbwt_buffer_size * gbwt::MILLION, haplotype_indexer.id_interval, show_progress);
gbwts.use(cover);
} else if (path_cover == path_cover_augment) {
if (show_progress) {
std::cerr << "Algorithm: augment" << std::endl;
}
gbwts.use_dynamic();
gbwtgraph::augment_gbwt(*input_graph, gbwts.dynamic, num_paths, context_length, haplotype_indexer.gbwt_buffer_size * gbwt::MILLION, haplotype_indexer.id_interval, show_progress);
} else {
if (show_progress) {
std::cerr << "Algorithm: local haplotypes" << std::endl;
}
gbwts.use_compressed();
gbwt::GBWT cover = gbwtgraph::local_haplotypes(*input_graph, gbwts.compressed, num_paths, context_length, haplotype_indexer.gbwt_buffer_size * gbwt::MILLION, haplotype_indexer.id_interval, show_progress);
gbwts.use(cover);
}
gbwts.unbacked(); // We modified the GBWT.
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "Path cover built in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// Now we can serialize the GBWT.
if (!gbwt_output.empty()) {
double start = gbwt::readTimer();
gbwts.serialize(gbwt_output);
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "GBWT serialized in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// GBWTGraph construction.
if (!graph_output.empty()) {
double start = gbwt::readTimer();
if (show_progress) {
std::cerr << "Building GBWTGraph" << std::endl;
}
get_graph(input_graph, graph_in_use, xg_name, show_progress);
gbwts.use_compressed();
if (show_progress) {
std::cerr << "Starting the construction" << std::endl;
}
gbwtgraph::GBWTGraph graph(gbwts.compressed, *input_graph);
if (show_progress) {
std::cerr << "Serializing GBWTGraph to " << graph_output << std::endl;
}
vg::io::VPKG::save(graph, graph_output);
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "GBWTGraph built in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// We no longer need the graph.
clear_graph(input_graph, graph_in_use);
// R-index construction.
if (!r_index_name.empty()) {
double start = gbwt::readTimer();
if (show_progress) {
std::cerr << "Building r-index" << std::endl;
}
omp_set_num_threads(search_threads);
gbwts.use_compressed();
if (show_progress) {
std::cerr << "Starting the construction" << std::endl;
}
gbwt::FastLocate r_index(gbwts.compressed);
if (show_progress) {
std::cerr << "Serializing the r-index to " << r_index_name << std::endl;
}
vg::io::VPKG::save(r_index, r_index_name);
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "R-index built in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// Metadata options.
if (metadata_mode) {
gbwts.use_compressed();
if (!gbwts.compressed.hasMetadata()) {
std::cerr << "error: [vg gbwt] the GBWT does not contain metadata" << std::endl;
std::exit(EXIT_FAILURE);
}
if (metadata) {
print_metadata(std::cout, gbwts);
}
if (contigs) {
if (list_names) {
if (gbwts.compressed.metadata.hasContigNames()) {
for (size_t i = 0; i < gbwts.compressed.metadata.contigs(); i++) {
std::cout << gbwts.compressed.metadata.contig(i) << std::endl;
}
} else {
std::cerr << "error: [vg gbwt] the metadata does not contain contig names" << std::endl;
std::exit(EXIT_FAILURE);
}
} else {
std::cout << gbwts.compressed.metadata.contigs() << std::endl;
}
}
if (haplotypes) {
std::cout << gbwts.compressed.metadata.haplotypes() << std::endl;
}
if (samples) {
if (list_names) {
if (gbwts.compressed.metadata.hasSampleNames()) {
for (size_t i = 0; i < gbwts.compressed.metadata.samples(); i++) {
std::cout << gbwts.compressed.metadata.sample(i) << std::endl;
}
} else {
std::cerr << "error: [vg gbwt] the metadata does not contain sample names" << std::endl;
std::exit(EXIT_FAILURE);
}
} else {
std::cout << gbwts.compressed.metadata.samples() << std::endl;
}
}
if (thread_names) {
if (gbwts.compressed.metadata.hasPathNames()) {
for (size_t i = 0; i < gbwts.compressed.metadata.paths(); i++) {
std::cout << thread_name(gbwts.compressed, i) << std::endl;
}
} else {
std::cerr << "error: [vg gbwt] the metadata does not contain thread names" << std::endl;
}
}
}
// Thread options.
if (thread_mode) {
// Extract threads in SDSL format.
if (!thread_output.empty()) {
double start = gbwt::readTimer();
if (show_progress) {
std::cerr << "Extracting threads to " << thread_output << std::endl;
}
gbwts.use_compressed();
if (show_progress) {
std::cerr << "Starting the extraction" << std::endl;
}
gbwt::size_type node_width = gbwt::bit_length(gbwts.compressed.sigma() - 1);
gbwt::text_buffer_type out(thread_output, std::ios::out, gbwt::MEGABYTE, node_width);
for (gbwt::size_type id = 0; id < gbwts.compressed.sequences(); id += 2) { // Ignore reverse complements.
gbwt::vector_type sequence = gbwts.compressed.extract(id);
for (auto node : sequence) {
out.push_back(node);
}
out.push_back(gbwt::ENDMARKER);
}
out.close();
if (show_progress) {
double seconds = gbwt::readTimer() - start;
std::cerr << "Threads extracted in " << seconds << " seconds, " << gbwt::inGigabytes(gbwt::memoryUsage()) << " GiB" << std::endl;
std::cerr << std::endl;
}
}
// There are two sequences for each thread.
if (count_threads) {
gbwts.use_compressed();
std::cout << (gbwts.compressed.sequences() / 2) << std::endl;
}
}
return 0;
}
//----------------------------------------------------------------------------
// Utility functions
void print_metadata(std::ostream& out, const GBWTHandler& gbwts) {
if (gbwts.in_use == GBWTHandler::index_compressed) {
gbwt::operator<<(out, gbwts.compressed.metadata) << std::endl;
} else if (gbwts.in_use == GBWTHandler::index_dynamic) {
gbwt::operator<<(out, gbwts.dynamic.metadata) << std::endl;
}
}
void use_or_save(std::unique_ptr<gbwt::DynamicGBWT>& index, GBWTHandler& gbwts, std::vector<std::string>& filenames, size_t i, bool show_progress) {
if (filenames.size() == 1) {
gbwts.use(*index);
} else {
std::string temp = temp_file::create("gbwt-" + std::to_string(i) + "-");
if (show_progress) {
#pragma omp critical
{
std::cerr << "Job " << i << ": Saving the GBWT to " << temp << std::endl;
}
}
vg::io::VPKG::save(*index, temp);
filenames[i] = temp;
}
}
void get_graph(std::unique_ptr<PathHandleGraph>& graph, bool& in_use, const std::string& filename, bool show_progress) {
if (in_use) {
return;
} else {
if (show_progress) {
std::cerr << "Loading input graph from " << filename << std::endl;
}
graph = vg::io::VPKG::load_one<PathHandleGraph>(filename);
if (graph == nullptr) {
std::cerr << "error: [vg gbwt] could not load graph " << filename << std::endl;
std::exit(EXIT_FAILURE);
}
in_use = true;
}
}
void clear_graph(std::unique_ptr<PathHandleGraph>& graph, bool& in_use) {
if (!in_use) {
return;
} else {
graph.reset();
in_use = false;
}
}
//----------------------------------------------------------------------------
std::vector<job_type> determine_jobs(const std::vector<std::string>& vcf_files, std::unique_ptr<PathHandleGraph>& graph, const std::map<std::string, std::string>& path_to_vcf, bool inputs_as_jobs) {
std::vector<job_type> result;
// Determine the non-alt paths.
std::vector<job_type::path_type> paths;
size_t max_length = 0;
graph->for_each_path_handle([&](path_handle_t path_handle) {
if (!Paths::is_alt(graph->get_path_name(path_handle))) {
paths.emplace_back(path_handle, graph->get_step_count(path_handle));
max_length = std::max(max_length, paths.back().second);
}
});
if (paths.empty()) {
return result;
}
struct vcf_paths {
size_t file;
std::vector<job_type::path_type> paths;
// In descending order by length.
void sort_paths() {
std::sort(this->paths.begin(), this->paths.end(), [](job_type::path_type a, job_type::path_type b) -> bool {
return (a.second > b.second);
});
}
void insert(job_type::path_type path) {
this->paths.push_back(path);
}
bool empty() const {
return this->paths.empty();
}
};
// Initialize the files.
std::vector<vcf_paths> paths_by_file;
for (size_t i = 0; i < vcf_files.size(); i++) {
paths_by_file.push_back({ i, {} });
}
// Determine which VCF file contains each path.
std::vector<size_t> path_found_in(paths.size(), vcf_files.size());
for (size_t i = 0; i < vcf_files.size(); i++) {
std::string filename = vcf_files[i];
vcflib::VariantCallFile variant_file;
variant_file.parseSamples = false;
variant_file.open(filename);
if (!variant_file.is_open()) {
std::cerr << "error: [vg gbwt] could not open VCF file " << filename << std::endl;
std::exit(EXIT_FAILURE);
}
for (size_t j = 0; j < paths.size(); j++) {
std::string contig_name = graph->get_path_name(paths[j].first);
if (path_to_vcf.find(contig_name) != path_to_vcf.end()) {
contig_name = path_to_vcf.at(contig_name);
}
variant_file.setRegion(contig_name);
vcflib::Variant var(variant_file);
if (!(variant_file.is_open() && variant_file.getNextVariant(var) && var.sequenceName == contig_name)) {
continue;
}
if (path_found_in[j] < vcf_files.size()) {
std::cerr << "error: [vg gbwt] contig " << contig_name << " found in files " << vcf_files[path_found_in[j]] << " and " << filename << std::endl;
std::exit(EXIT_FAILURE);
}
paths_by_file[i].insert(paths[j]);
path_found_in[j] = i;
}
}
// Special case: Each input file is a single job.
if (inputs_as_jobs) {
for (const vcf_paths& curr : paths_by_file) {
if (curr.empty()) {
continue;
}
job_type job({ vcf_files[curr.file], {}, 0 });
for (auto path : curr.paths) {
job.insert(path);
}
result.push_back(job);
}
return result;
}
// First-fit heuristic: Create jobs of size at most max_length from each file.
for (size_t i = 0; i < paths_by_file.size(); i++) {
paths_by_file[i].sort_paths();
}
for (const vcf_paths& curr : paths_by_file) {
if (curr.empty()) {
continue;
}
std::vector<job_type> jobs;
for (auto path : curr.paths) {
bool inserted = false;
for (size_t i = 0; i < jobs.size(); i++) {
if (jobs[i].size + path.second <= max_length) {
jobs[i].insert(path);
inserted = true;
break;
}
}
if (!inserted) {
jobs.push_back({ vcf_files[curr.file], {}, 0 });
jobs.back().insert(path);
}
}
result.insert(result.end(), jobs.begin(), jobs.end());
}
// Sort the jobs in descending order by size.
std::sort(result.begin(), result.end());
return result;
}
//----------------------------------------------------------------------------
void use_preset(HaplotypeIndexer& haplotype_indexer, std::string preset_name) {
for (char& c : preset_name) {
c = std::tolower(c);
}
if (preset_name == "1000gp") {
haplotype_indexer.gbwt_buffer_size = 200;
haplotype_indexer.samples_in_batch = 100;
haplotype_indexer.force_phasing = true;
haplotype_indexer.discard_overlaps = true;
} else {
std::cerr << "error : [vg gbwt] invalid preset: " << preset_name << std::endl;
std::exit(EXIT_FAILURE);
}
}
//----------------------------------------------------------------------------
// Register subcommand
static vg::subcommand::Subcommand vg_gbwt("gbwt", "Manipulate GBWTs", main_gbwt);
| 43.134096 | 216 | 0.546187 | CominLab |
ffbd6720475d5d7449408ca454d34b6d49155402 | 7,340 | cpp | C++ | evoscript/Object.cpp | PumpkinCellOS/evogen | eed748959c446046b47168172ffc508c067a32c2 | [
"MIT"
] | null | null | null | evoscript/Object.cpp | PumpkinCellOS/evogen | eed748959c446046b47168172ffc508c067a32c2 | [
"MIT"
] | null | null | null | evoscript/Object.cpp | PumpkinCellOS/evogen | eed748959c446046b47168172ffc508c067a32c2 | [
"MIT"
] | null | null | null | #include <evoscript/Object.h>
#include <evoscript/AbstractOperations.h>
#include <evoscript/EscapeSequences.h>
#include <evoscript/Runtime.h>
#include <evoscript/objects/Exception.h>
#include <evoscript/objects/NativeFunction.h>
namespace evo::script
{
ClassWrapper::ClassWrapper()
: Class("ClassWrapper")
{
define_native_function<ClassWrapper>("__construct", [](Runtime& rt, Object& t, ArgumentList const& args) {
return Value::new_object(Object::create(rt, t.internal_data<InternalData>().underlying_class, args));
});
}
void ClassWrapper::print(Object const& object, std::ostream& out, bool detailed, bool dump) const
{
if(dump)
{
Class::print(object, out, detailed, dump);
return;
}
auto const& class_ = object.internal_data<InternalData>().underlying_class;
out << escapes::keyword("class") << " " << escapes::type(class_->name()) << " ";
if(detailed)
object.print_members_impl(out, false);
else
out << "{...}";
}
std::shared_ptr<MemoryValue> Class::resolve_class_member(StringId member) const
{
auto result = m_vtable.find(member);
if(result != m_vtable.end())
{
auto memval = MemoryValue::create_object(result->second);
memval->set_name(member);
return memval;
}
if(!m_base.expired())
return m_base.lock()->resolve_class_member(member);
return nullptr;
}
bool Class::is_same_or_base_of(Class& class_) const
{
return this == &class_ || (!m_base.expired() && m_base.lock()->is_same_or_base_of(class_));
}
void Class::define_virtual_member(StringId name, std::shared_ptr<Object> const& value)
{
m_vtable.insert({name, value});
}
Value Class::operator_add(Runtime& rt, Object const&, Value const& rhs) const
{
rt.throw_exception<Exception>("Add operator not defined for class");
return {};
}
// function operator<>(rhs: Value) : CompareResult
CompareResult Class::operator_compare(Runtime& rt, Object const&, Value const& rhs) const
{
rt.throw_exception<Exception>("Compare operator not defined for class");
return CompareResult::Unknown;
}
// function operator[](rhs: Value) : Value
Value Class::operator_subscript(Runtime& rt, Object& object, Value const& rhs) const
{
return object.get(rhs.to_string())->value();
}
void Class::print(Object const& object, std::ostream& output, bool detailed, bool dump) const
{
using namespace escapes;
output << type(name()) << " ";
if(detailed)
object.print_members_impl(output, dump);
else
output << "{...}";
}
Object::Object(Runtime& rt, std::shared_ptr<Class> const& class_, ArgumentList const& args)
: m_class(class_)
{
m_internal_data = class_->construct_internal_data(&rt, args);
class_->constructor(rt, *this, args);
}
Object::~Object()
{
if(m_class)
m_class->destructor(*this);
}
std::shared_ptr<MemoryValue> Object::get(StringId member)
{
if(m_class)
{
auto result = m_class->resolve_class_member(member);
if(result)
return result;
}
auto it = m_members.find(member);
if(it == m_members.end())
{
// Reference to newly-created undefined.
// TODO: Tidy up these undefineds after exiting an expression
return m_members.insert(std::make_pair(member, MemoryValue::create_undefined())).first->second;
}
return it->second;
}
std::shared_ptr<MemoryValue> Object::get_without_side_effects(StringId member) const
{
if(m_class)
{
auto result = m_class->resolve_class_member(member);
if(result)
return result;
}
auto it = m_members.find(member);
if(it == m_members.end())
return nullptr;
return it->second;
}
bool Object::is_instance_of(Class& class_) const
{
return m_class ? m_class->is_same_or_base_of(class_) : (&class_ == NativeClass<Class>::class_object().get());
}
std::string Object::to_string() const
{
return m_class ? m_class->to_string(*this) : "[object " + type_name() + "]";
}
Value Object::to_primitive(Runtime& rt, Value::Type type) const
{
if(!m_class)
{
rt.throw_exception<Exception>("Cannot convert " + type_name() + " to primitive");
return {};
}
return m_class->to_primitive(rt, *this, type);
}
Value Object::operator_add(Runtime& rt, Value const& rhs) const
{
if(!m_class)
{
rt.throw_exception<Exception>("Cannot call add operator without class");
return {};
}
return m_class->operator_add(rt, *this, rhs);
}
CompareResult Object::operator_compare(Runtime& rt, Value const& rhs) const
{
if(!m_class)
{
rt.throw_exception<Exception>("Cannot call compare operator without class");
return {};
}
return m_class->operator_compare(rt, *this, rhs);
}
Value Object::operator_subscript(Runtime& rt, Value const& rhs)
{
if(!m_class)
return get(rhs.to_string())->value();
return m_class->operator_subscript(rt, *this, rhs);
}
Value Object::call(Runtime& rt, Object& this_, ArgumentList const& args) const
{
if(!m_class)
{
rt.throw_exception<Exception>("Cannot call object without class");
return {};
}
return m_class->call(rt, *this, this_, args);
}
void Object::repl_print(std::ostream& output, bool print_members) const
{
print_impl(output, print_members, false);
}
void Object::print_impl(std::ostream& output, bool print_members, bool dump) const
{
if(m_class)
{
m_class->print(*this, output, print_members, dump);
return;
}
using namespace escapes;
output << type(type_name()) << " ";
if(print_members)
print_members_impl(output, dump);
else
output << "{...}";
}
void Object::print_members_impl(std::ostream& output, bool dump) const
{
using namespace escapes;
output << "{";
if(!m_members.empty() || (m_class && !m_class->m_vtable.empty()))
output << std::endl;
{
size_t counter = 0;
for(auto& pair: m_members)
{
auto id_string = pair.first.string();
auto const& value = pair.second->value();
if(value.is_object() && value.get_object().get() == this)
output << " " << literal(id_string) << ": " << constant("<recursive reference>");
else
{
output << " " << literal(id_string) << ": ";
if(dump)
output << pair.second->dump_string();
else
pair.second->repl_print(output, false);
}
if(counter < m_members.size() - 1)
output << std::endl;
counter++;
}
if(counter > 0)
output << std::endl;
}
if(m_class)
{
size_t counter = 0;
for(auto& pair: m_class->m_vtable)
{
auto id_string = pair.first.string();
output << " " << literal(id_string) << "#: ";
if(dump)
output << pair.second->dump_string();
else
pair.second->repl_print(output, false);
if(counter < m_class->m_vtable.size() - 1)
output << std::endl;
counter++;
}
if(counter > 0)
output << std::endl;
}
output << "}";
}
}
| 27.286245 | 113 | 0.613488 | PumpkinCellOS |
ffbf24f98a05858a99c8fcd50bd226ff7e29017b | 2,757 | hpp | C++ | include/protocol.hpp | tj314/mdpc-gf-p | 613f32cd498f864a9036759e958f5e606328b562 | [
"BSD-3-Clause"
] | null | null | null | include/protocol.hpp | tj314/mdpc-gf-p | 613f32cd498f864a9036759e958f5e606328b562 | [
"BSD-3-Clause"
] | null | null | null | include/protocol.hpp | tj314/mdpc-gf-p | 613f32cd498f864a9036759e958f5e606328b562 | [
"BSD-3-Clause"
] | 1 | 2022-03-29T09:14:52.000Z | 2022-03-29T09:14:52.000Z | #ifndef MCELIECE_QCMDPC_GF_P_PROTOCOL_HPP
#define MCELIECE_QCMDPC_GF_P_PROTOCOL_HPP
#include <fmpzxx.h>
#include <vector>
#include <optional>
#include <iostream>
#include "code.hpp"
using flint::fmpzxx;
using std::vector;
using std::optional;
using std::cerr;
using std::endl;
/**
* @brief Protocol class holds an instance of MDPC GF(p) cryptosystem and allows for encryption and decryption using this instance.
*/
class Protocol {
private:
/**
* @brief Parameters q and k of the MDPC GF(p) cryptosystem.
* @see Code
*/
unsigned q, k;
/**
* @brief Instance of MDPC GF(p) used for encoding and decoding.
* @see Code
*/
Code c;
public:
/**
* @brief Generate a new MDPC GF(p) instance with the given q and k settings.
*
* To achieve the best possible DFR value, q should be a power of 2 and k should be a prime. It is not required, however.
*
* @see Code
*
* @param q Parameter q, ideally a power of 2.
* @param k Parameter k, ideally a prime.
*/
Protocol(unsigned q, unsigned k): q(q), k(k), c(Code{q, k}) {}
/**
* @brief Encrypt a plaintext.
*
* Encryption is achieved as follows:
* -# Plaintext is encoded using the generated Code instance.
* -# An error vector is generated.
* -# Encoded plaintext is summed with the error vector.
* Encryption will fail if and only if the plaintext length is not k.
* Ciphertext is of length 2*k.
*
* @see Code::encode(const vector<unsigned>& plaintext)
* @param plaintext A vector of length k with values from Z_q.
* @param verbose Whether to print error messages.
* @return On success, return ciphertext.
*/
auto encrypt(const vector<unsigned>& plaintext, bool verbose=false) -> optional<vector<unsigned>>;
/**
* @brief Decrypt a ciphertext.
*
* Decryption is achieved as follows:
* -# Ciphertext is decoded using the generated Code instance to obtain the error vector used in encryption.
* -# The error vector is subtracted from the ciphertext.
* -# Plaintext is read as the first k positions from ciphertext.
* Decryption will fail if:
* - Ciphertext is not of length 2*k.
* - Decoding fails.
*
* @see Code::decode(const vector<unsigned>& ciphertext, unsigned num_iterations)
* @param ciphertext A vector of length 2*k with values from Z_q.
* @param num_iterations Number of iterations used in the decoding step.
* @param verbose Whether to print error messages.
* @return On success, return plaintext.
*/
auto decrypt(const vector<unsigned>& ciphertext, unsigned num_iterations=25, bool verbose=false) -> optional<vector<unsigned>>;
};
#endif
| 33.216867 | 131 | 0.664853 | tj314 |
ffc1f8f06e5987c83371cd119afd277a6b87f73e | 11,038 | cpp | C++ | tracker_patterns/src/tracker_patterns_node.cpp | FelipMarti/managing_interaction_patterns | e86ed6ce5c5c0136e3dd760e7ec2322be24a2718 | [
"MIT"
] | null | null | null | tracker_patterns/src/tracker_patterns_node.cpp | FelipMarti/managing_interaction_patterns | e86ed6ce5c5c0136e3dd760e7ec2322be24a2718 | [
"MIT"
] | null | null | null | tracker_patterns/src/tracker_patterns_node.cpp | FelipMarti/managing_interaction_patterns | e86ed6ce5c5c0136e3dd760e7ec2322be24a2718 | [
"MIT"
] | null | null | null | /**
*
* Lunds tekniska högskola | LTH 2015
* Felip Marti Carrillo
*
* MIT License (MIT)
* Copyright (c) 2015 Felip Marti Carrillo
*/
#include "tracker_patterns_node.h"
TrackerPatterns::TrackerPatterns (void)
{
/// Init publishers
heading_adj_pub = n.advertise<interaction_monitor::AnnotationVariable>("heading_adj",10);
dist_adj_pub = n.advertise<interaction_monitor::AnnotationVariable>("dist_adj",10);
}
TrackerPatterns::~TrackerPatterns (void)
{
}
int TrackerPatterns::Main (int argc, char **argv)
{
ros::Rate loop_rate(2000);
ROS_INFO("[tracker_patterns] Waiting 0.5s to get ready the publisher");
ros::Duration(0.5).sleep();
ROS_INFO("[tracker_patterns] Start Publishing!");
// For all the inputs
for (int i=0;i<argc-2;i+=2) {
/**
* Opening and extracting all data for each file entered as a parameter.
*/
char odometryPathFile[100];
// Concatenating absolute path with odometry file
strcpy (odometryPathFile,argv[1]);
strcat (odometryPathFile,"odom/");
strcat (odometryPathFile,argv[i+2]);
std::ifstream traj_file;
char trajectoryPathFile[100];
// Concatenating absolute path with trajectory file name, and opening
strcpy (trajectoryPathFile,argv[1]);
strcat (trajectoryPathFile,"traj/");
strcat (trajectoryPathFile,argv[i+3]);
traj_file.open( trajectoryPathFile );
if (traj_file.is_open() ) {
ROS_INFO("[tracker_patterns] Opening trajectory file: %s",trajectoryPathFile);
}
else {
ROS_ERROR("[tracker_patterns] NOT OPEN: %s",trajectoryPathFile);
ROS_ERROR("[tracker_patterns] ERROR, closing node");
exit(1);
}
bool endFile = false;
// TODO future work: This var currentTimeStamp will be updated by a subscriber
currentTimeStamp = INIT_CTS;
double timeStamp = currentTimeStamp; //TimeStamp read from the file
/**
* Main Loop. Looping and publishing until the end of the file.
*/
while (ros::ok() and !endFile) {
// Initialisations
std::string line;
double dummy, distance, angle;
distanceFilter.resize(0);
angleFilter.resize(0);
int len; //Var to store position of the line in a file
/**
* The main idea in this loop is to calc the average distance
* value and angle that happens in interval times of 0.5s
* For instance:
* 1274451145.0 - 1274451145.5
* 1274451145.5 - 1274451146.0
*/
const double FIVEMS = 0.5;
while ( !endFile and currentTimeStamp+FIVEMS > timeStamp ) {
// Get current position in buffer file
len = traj_file.tellg();
// Read a line
endFile = std::getline(traj_file, line).eof();
// Reading columns
std::istringstream ss(line);
ss >> timeStamp >> dummy >> dummy >> dummy >> dummy >> dummy
>> dummy >> distance >> angle;
// Storing values to calculate average value
distanceFilter.push_back(distance);
angleFilter.push_back(angle);
}
/**
* The last value stored belongs to the next time interval.
* because the time stamp value is updated after processing
* distance and angle values.
* Therefore, here we remove that value from the vector
* and return that line to the buffer.
*/
if ( distanceFilter.size() != 0) {
distanceFilter.pop_back();
angleFilter.pop_back();
// Return to position before "Read line".
traj_file.seekg(len ,std::ios_base::beg);
}
/**
* Filtering, updating last values and checking thresholds
* considering 0.5s and 1s before.
*
* If there are no previous values to compare, it doesn't publish
*/
bool distanceAdj=false;
bool angleAdj=false;
if (distanceFilter.size() != 0) {
// Filtering values
double sumElemsD =std::accumulate(distanceFilter.begin(),distanceFilter.end(),0);
double sumElemsA =std::accumulate(angleFilter.begin(),angleFilter.end(),0);
// Storing value
distancePrevious.push_back(sumElemsD/distanceFilter.size());
anglePrevious.push_back(sumElemsA/angleFilter.size());
// Checking DISTANCE threshold
if (distancePrevious.size() > 3) {
distancePrevious.erase (distancePrevious.begin());
// THRESHOLD
if ( abs (distancePrevious[2] - distancePrevious[1]) > MAX_DIST_TH or
abs (distancePrevious[2] - distancePrevious[0]) > MAX_DIST_TH) {
distanceAdj=true;
}
}
// Checking ANGLE threshold
if (anglePrevious.size() > 3) {
anglePrevious.erase (anglePrevious.begin());
// THRESHOLD +10 to add an offset and to calculate the threshold easily
// TODO: CHECK THRESHOLD
if ( abs ((anglePrevious[2]+10) - (anglePrevious[1]+10)) > MAX_ANGL_TH or
abs ((anglePrevious[2]+10) - (anglePrevious[0]+10)) > MAX_ANGL_TH) {
angleAdj=true;
}
}
}
/**
* Checking in odometry file if the distance or angle adjustment is
* because of the robot movement
*/
bool robotMoving = false;
if (distanceAdj or angleAdj) {
robotMoving = was_the_robot_moving(odometryPathFile, currentTimeStamp);
}
// Filling publisher varables
interaction_monitor::AnnotationVariable HeadPubVar;
interaction_monitor::AnnotationVariable DistPubVar;
if (robotMoving) {
// Publish no angleAdj and no distanceAdj
DistPubVar.tini=currentTimeStamp-INIT_CTS; //TODO future work
DistPubVar.tend=currentTimeStamp-INIT_CTS; //TODO future work
DistPubVar.value=0;
HeadPubVar.tini=currentTimeStamp-INIT_CTS; //TODO future work
HeadPubVar.tend=currentTimeStamp-INIT_CTS; //TODO future work
HeadPubVar.value=0;
}
if (distanceAdj and !robotMoving) {
// Fill distanceAdj var
DistPubVar.tini=currentTimeStamp-INIT_CTS; //TODO future work
DistPubVar.tend=currentTimeStamp-INIT_CTS; //TODO future work
DistPubVar.value=1;
// debug
int min,sec;
min=(currentTimeStamp-INIT_CTS)/60;
sec=(int)(currentTimeStamp-INIT_CTS)%60;
ROS_INFO("[tracker_patterns] Distance_Adjustment=1 %d:%d TS=%f"
,min,sec,currentTimeStamp);
}
if (angleAdj and !robotMoving) {
// Fill angleAdj var
HeadPubVar.tini=currentTimeStamp-INIT_CTS; //TODO future work
HeadPubVar.tend=currentTimeStamp-INIT_CTS; //TODO future work
HeadPubVar.value=1;
// debug
int min,sec;
min=(currentTimeStamp-INIT_CTS)/60;
sec=(int)(currentTimeStamp-INIT_CTS)%60;
ROS_INFO("[tracker_patterns] Heading_Adjustment=1 %d:%d TS=%f"
,min,sec,currentTimeStamp);
}
//Publish heading_adj and dist_adj topics
dist_adj_pub.publish(DistPubVar);
heading_adj_pub.publish(HeadPubVar);
//TODO future work: This var will be updated by a subscriber in a future
currentTimeStamp+=0.5;
ros::spinOnce();
loop_rate.sleep();
}
traj_file.close();
}
ROS_WARN("[tracker_patterns] No more data!");
ROS_WARN("[tracker_patterns] So, the node will be stopped gently :)");
exit(0);
}
/**
* Function to check in the odometry file if the heading or distance adjustament
* have been produced due to the robot movement.
*
* Input: path to odometry file
* current TimeStamp
* Output: boolean that return true in case that the robot was moving
*/
bool TrackerPatterns::was_the_robot_moving( const char *odometryPathFile,
const double currentTimeStamp)
{
// Opening odometry file
std::ifstream odom_file;
odom_file.open( odometryPathFile );
if ( odom_file.is_open() ) {
ROS_INFO("[tracker_patterns] Opening: %s",odometryPathFile);
}
else {
ROS_ERROR("[tracker_patterns] NOT OPEN: %s",odometryPathFile);
ROS_ERROR("[tracker_patterns] ERROR, Cannot open odometry file. ");
ROS_ERROR("[tracker_patterns] Heading_adjst and Distance_adjst without checking odom. ");
return false;
}
std::string line;
// Vars to store previous values
double x_ant=0;
double y_ant=0;
double theta_ant=0;
// Reading all the lines looking for the TimeStamp and checking odometry values
for(unsigned int curLine = 0; getline(odom_file, line); curLine++) {
// Reading columns
double dummy, tSs, x, y, theta;
std::string tSm;
std::istringstream ss(line);
ss >> dummy >> dummy >> dummy >> tSs >> tSm >> dummy >> dummy >> dummy >> x
>> y >> dummy >> theta >> dummy >> dummy;
// Processing Time Stamp milliseconds from string to double
tSm="0."+tSm;
tSs = tSs + std::atof(tSm.c_str());
// Checking period. If there is no robot movement in an interval of 1s
// then we have heading or distance adjustment
if (tSs >= currentTimeStamp -0.5 and tSs < currentTimeStamp +0.5) {
if (x!=x_ant or y!=y_ant or theta!=theta_ant) return true;
}
// Updating previous values
x_ant = x;
y_ant = y;
theta_ant = theta;
}
odom_file.close();
return false;
}
int main(int argc, char **argv)
{
ros::init(argc, argv, "tracker_patterns_node");
if (argc < 4) {
ROS_ERROR("[tracker_patterns] usage: tracker_patterns_node"
"PATH_FILE(s) ODOM_FILE_1 TRAJ_FILE_1 .. ODOM_FILE_N TRAJ_FILE_N");
exit(1);
}
TrackerPatterns foo;
return foo.Main(argc, argv);
}
| 35.152866 | 97 | 0.560246 | FelipMarti |
ffc80d5660db9282a9928e5162dca5044f078de9 | 328 | cpp | C++ | leetcode/cpp/119.cpp | xpharry/leetcode_and_lintcode_battle | a06d966ad45bdbed6dda51cf0b480592fc4000d6 | [
"MIT"
] | null | null | null | leetcode/cpp/119.cpp | xpharry/leetcode_and_lintcode_battle | a06d966ad45bdbed6dda51cf0b480592fc4000d6 | [
"MIT"
] | null | null | null | leetcode/cpp/119.cpp | xpharry/leetcode_and_lintcode_battle | a06d966ad45bdbed6dda51cf0b480592fc4000d6 | [
"MIT"
] | 2 | 2020-09-29T21:59:43.000Z | 2021-06-22T13:24:04.000Z | class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> curRow(rowIndex+1,0);
for(int i = 0; i <= rowIndex; i++) {
curRow[0] = 1;
for(int j = i; j >= 1; j--) {
curRow[j] = curRow[j-1] + curRow[j];
}
}
return curRow;
}
}; | 25.230769 | 52 | 0.429878 | xpharry |
ffca38a80e6d8da211abb5fedbcf5d4fdee812df | 17,462 | cc | C++ | ortools/sat/cp_constraints.cc | gnanakeethan/or-tools | 554cbccaa95b4c11eced13f145de1bf468e1f919 | [
"Apache-2.0"
] | null | null | null | ortools/sat/cp_constraints.cc | gnanakeethan/or-tools | 554cbccaa95b4c11eced13f145de1bf468e1f919 | [
"Apache-2.0"
] | null | null | null | ortools/sat/cp_constraints.cc | gnanakeethan/or-tools | 554cbccaa95b4c11eced13f145de1bf468e1f919 | [
"Apache-2.0"
] | null | null | null | // Copyright 2010-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
//
// 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 "ortools/sat/cp_constraints.h"
#include <algorithm>
#include <unordered_map>
#include "ortools/base/map_util.h"
#include "ortools/sat/sat_solver.h"
#include "ortools/util/sort.h"
namespace operations_research {
namespace sat {
bool BooleanXorPropagator::Propagate() {
bool sum = false;
int unassigned_index = -1;
for (int i = 0; i < literals_.size(); ++i) {
const Literal l = literals_[i];
if (trail_->Assignment().LiteralIsFalse(l)) {
sum ^= false;
} else if (trail_->Assignment().LiteralIsTrue(l)) {
sum ^= true;
} else {
// If we have more than one unassigned literal, we can't deduce anything.
if (unassigned_index != -1) return true;
unassigned_index = i;
}
}
// Propagates?
if (unassigned_index != -1) {
literal_reason_.clear();
for (int i = 0; i < literals_.size(); ++i) {
if (i == unassigned_index) continue;
const Literal l = literals_[i];
literal_reason_.push_back(
trail_->Assignment().LiteralIsFalse(l) ? l : l.Negated());
}
const Literal u = literals_[unassigned_index];
integer_trail_->EnqueueLiteral(sum == value_ ? u.Negated() : u,
literal_reason_, {});
return true;
}
// Ok.
if (sum == value_) return true;
// Conflict.
std::vector<Literal>* conflict = trail_->MutableConflict();
conflict->clear();
for (int i = 0; i < literals_.size(); ++i) {
const Literal l = literals_[i];
conflict->push_back(trail_->Assignment().LiteralIsFalse(l) ? l
: l.Negated());
}
return false;
}
void BooleanXorPropagator::RegisterWith(GenericLiteralWatcher* watcher) {
const int id = watcher->Register(this);
for (const Literal& l : literals_) {
watcher->WatchLiteral(l, id);
watcher->WatchLiteral(l.Negated(), id);
}
}
// ----- CpPropagator -----
CpPropagator::CpPropagator(IntegerTrail* integer_trail)
: integer_trail_(integer_trail) {}
CpPropagator::~CpPropagator() {}
IntegerValue CpPropagator::Min(IntegerVariable v) const {
return integer_trail_->LowerBound(v);
}
IntegerValue CpPropagator::Max(IntegerVariable v) const {
return integer_trail_->UpperBound(v);
}
bool CpPropagator::SetMin(IntegerVariable v, IntegerValue val,
const std::vector<IntegerLiteral>& reason) {
IntegerValue current_min = Min(v);
if (val > current_min &&
!integer_trail_->Enqueue(IntegerLiteral::GreaterOrEqual(v, val),
/*literal_reason=*/{}, reason)) {
return false;
}
return true;
}
bool CpPropagator::SetMax(IntegerVariable v, IntegerValue val,
const std::vector<IntegerLiteral>& reason) {
const IntegerValue current_max = Max(v);
if (val < current_max &&
!integer_trail_->Enqueue(IntegerLiteral::LowerOrEqual(v, val),
/*literal_reason=*/{}, reason)) {
return false;
}
return true;
}
bool CpPropagator::SetMin(IntegerValue v, IntegerValue val,
const std::vector<IntegerLiteral>& reason) {
if (val > v) {
return integer_trail_->ReportConflict(reason);
}
return true;
}
bool CpPropagator::SetMax(IntegerValue v, IntegerValue val,
const std::vector<IntegerLiteral>& reason) {
if (val < v) {
return integer_trail_->ReportConflict(reason);
}
return true;
}
void CpPropagator::AddLowerBoundReason(
IntegerVariable v, std::vector<IntegerLiteral>* reason) const {
reason->push_back(integer_trail_->LowerBoundAsLiteral(v));
}
void CpPropagator::AddUpperBoundReason(
IntegerVariable v, std::vector<IntegerLiteral>* reason) const {
reason->push_back(integer_trail_->UpperBoundAsLiteral(v));
}
void CpPropagator::AddBoundsReason(IntegerVariable v,
std::vector<IntegerLiteral>* reason) const {
reason->push_back(integer_trail_->LowerBoundAsLiteral(v));
reason->push_back(integer_trail_->UpperBoundAsLiteral(v));
}
template <class S>
NonOverlappingRectanglesPropagator<S>::NonOverlappingRectanglesPropagator(
const std::vector<IntegerVariable>& x,
const std::vector<IntegerVariable>& y, const std::vector<S>& dx,
const std::vector<S>& dy, bool strict, IntegerTrail* integer_trail)
: CpPropagator(integer_trail),
x_(x),
y_(y),
dx_(dx),
dy_(dy),
strict_(strict) {
const int n = x.size();
CHECK_GT(n, 0);
neighbors_.resize(n * (n - 1));
neighbors_begins_.resize(n);
neighbors_ends_.resize(n);
for (int i = 0; i < n; ++i) {
const int begin = i * (n - 1);
neighbors_begins_[i] = begin;
neighbors_ends_[i] = begin + (n - 1);
for (int j = 0; j < n; ++j) {
if (j == i) continue;
neighbors_[begin + (j > i ? j - 1 : j)] = j;
}
}
}
template <class S>
NonOverlappingRectanglesPropagator<S>::~NonOverlappingRectanglesPropagator() {}
template <class S>
bool NonOverlappingRectanglesPropagator<S>::Propagate() {
const int n = x_.size();
cached_areas_.resize(n);
cached_min_end_x_.resize(n);
cached_min_end_y_.resize(n);
for (int box = 0; box < n; ++box) {
// We never change the min-size of a box, so this stays valid.
cached_areas_[box] = Min(dx_[box]) * Min(dy_[box]);
// These will be update on each push.
cached_min_end_x_[box] = Min(x_[box]) + Min(dx_[box]);
cached_min_end_y_[box] = Min(y_[box]) + Min(dy_[box]);
}
while (true) {
const int64 saved_stamp = integer_trail_->num_enqueues();
for (int box = 0; box < n; ++box) {
if (!strict_ && cached_areas_[box] == 0) continue;
UpdateNeighbors(box);
if (!FailWhenEnergyIsTooLarge(box)) return false;
const int end = neighbors_ends_[box];
for (int i = neighbors_begins_[box]; i < end; ++i) {
if (!PushOneBox(box, neighbors_[i])) return false;
}
}
if (saved_stamp == integer_trail_->num_enqueues()) break;
}
return true;
}
template <class S>
void NonOverlappingRectanglesPropagator<S>::RegisterWith(
GenericLiteralWatcher* watcher) {
const int id = watcher->Register(this);
for (const IntegerVariable& var : x_) watcher->WatchIntegerVariable(var, id);
for (const IntegerVariable& var : y_) watcher->WatchIntegerVariable(var, id);
for (const S& var : dx_) watcher->WatchLowerBound(var, id);
for (const S& var : dy_) watcher->WatchLowerBound(var, id);
for (int i = 0; i < x_.size(); ++i) {
watcher->RegisterReversibleInt(id, &neighbors_ends_[i]);
}
}
template <class S>
void NonOverlappingRectanglesPropagator<S>::AddBoxReason(int box) {
AddBoundsReason(x_[box], &integer_reason_);
AddBoundsReason(y_[box], &integer_reason_);
AddLowerBoundReason(dx_[box], &integer_reason_);
AddLowerBoundReason(dy_[box], &integer_reason_);
}
template <class S>
void NonOverlappingRectanglesPropagator<S>::AddBoxReason(int box,
IntegerValue xmin,
IntegerValue xmax,
IntegerValue ymin,
IntegerValue ymax) {
integer_reason_.push_back(IntegerLiteral::GreaterOrEqual(x_[box], xmin));
integer_reason_.push_back(
IntegerLiteral::LowerOrEqual(x_[box], xmax - Min(dx_[box])));
integer_reason_.push_back(IntegerLiteral::GreaterOrEqual(y_[box], ymin));
integer_reason_.push_back(
IntegerLiteral::LowerOrEqual(y_[box], ymax - Min(dy_[box])));
AddLowerBoundReason(dx_[box], &integer_reason_);
AddLowerBoundReason(dy_[box], &integer_reason_);
}
namespace {
// Returns true iff the 2 given intervals are disjoint. If their union is one
// point, this also returns true.
bool IntervalAreDisjointForSure(IntegerValue min_a, IntegerValue max_a,
IntegerValue min_b, IntegerValue max_b) {
return min_a >= max_b || min_b >= max_a;
}
// Returns the distance from interval a to the "bounding interval" of a and b.
IntegerValue DistanceToBoundingInterval(IntegerValue min_a, IntegerValue max_a,
IntegerValue min_b,
IntegerValue max_b) {
return std::max(min_a - min_b, max_b - max_a);
}
} // namespace
template <class S>
void NonOverlappingRectanglesPropagator<S>::UpdateNeighbors(int box) {
tmp_removed_.clear();
cached_distance_to_bounding_box_.resize(x_.size());
const IntegerValue box_x_min = Min(x_[box]);
const IntegerValue box_x_max = Max(x_[box]) + Max(dx_[box]);
const IntegerValue box_y_min = Min(y_[box]);
const IntegerValue box_y_max = Max(y_[box]) + Max(dy_[box]);
int new_index = neighbors_begins_[box];
const int end = neighbors_ends_[box];
for (int i = new_index; i < end; ++i) {
const int other = neighbors_[i];
const IntegerValue other_x_min = Min(x_[other]);
const IntegerValue other_x_max = Max(x_[other]) + Max(dx_[other]);
if (IntervalAreDisjointForSure(box_x_min, box_x_max, other_x_min,
other_x_max)) {
tmp_removed_.push_back(other);
continue;
}
const IntegerValue other_y_min = Min(y_[other]);
const IntegerValue other_y_max = Max(y_[other]) + Max(dy_[other]);
if (IntervalAreDisjointForSure(box_y_min, box_y_max, other_y_min,
other_y_max)) {
tmp_removed_.push_back(other);
continue;
}
neighbors_[new_index++] = other;
cached_distance_to_bounding_box_[other] =
std::max(DistanceToBoundingInterval(box_x_min, box_x_max, other_x_min,
other_x_max),
DistanceToBoundingInterval(box_y_min, box_y_max, other_y_min,
other_y_max));
}
neighbors_ends_[box] = new_index;
for (int i = 0; i < tmp_removed_.size();) {
neighbors_[new_index++] = tmp_removed_[i++];
}
IncrementalSort(neighbors_.begin() + neighbors_begins_[box],
neighbors_.begin() + neighbors_ends_[box],
[this](int i, int j) {
return cached_distance_to_bounding_box_[i] <
cached_distance_to_bounding_box_[j];
});
}
template <class S>
bool NonOverlappingRectanglesPropagator<S>::FailWhenEnergyIsTooLarge(int box) {
// Note that we only consider the smallest dimension of each boxes here.
IntegerValue area_min_x = Min(x_[box]);
IntegerValue area_max_x = Max(x_[box]) + Min(dx_[box]);
IntegerValue area_min_y = Min(y_[box]);
IntegerValue area_max_y = Max(y_[box]) + Min(dy_[box]);
IntegerValue sum_of_areas = cached_areas_[box];
IntegerValue total_sum_of_areas = sum_of_areas;
const int end = neighbors_ends_[box];
for (int i = neighbors_begins_[box]; i < end; ++i) {
const int other = neighbors_[i];
total_sum_of_areas += cached_areas_[other];
}
// TODO(user): Is there a better order, maybe sort by distance
// with the current box.
for (int i = neighbors_begins_[box]; i < end; ++i) {
const int other = neighbors_[i];
if (cached_areas_[other] == 0) continue;
// Update Bounding box.
area_min_x = std::min(area_min_x, Min(x_[other]));
area_max_x = std::max(area_max_x, Max(x_[other]) + Min(dx_[other]));
area_min_y = std::min(area_min_y, Min(y_[other]));
area_max_y = std::max(area_max_y, Max(y_[other]) + Min(dy_[other]));
// Update sum of areas.
sum_of_areas += cached_areas_[other];
const IntegerValue bounding_area =
(area_max_x - area_min_x) * (area_max_y - area_min_y);
if (bounding_area >= total_sum_of_areas) {
// Nothing will be deduced. Exiting.
return true;
}
if (sum_of_areas > bounding_area) {
integer_reason_.clear();
AddBoxReason(box, area_min_x, area_max_x, area_min_y, area_max_y);
for (int j = neighbors_begins_[box]; j <= i; ++j) {
const int other = neighbors_[j];
if (cached_areas_[other] == 0) continue;
AddBoxReason(other, area_min_x, area_max_x, area_min_y, area_max_y);
}
return integer_trail_->ReportConflict(integer_reason_);
}
}
return true;
}
template <class S>
bool NonOverlappingRectanglesPropagator<S>::FirstBoxIsBeforeSecondBox(
const std::vector<IntegerVariable>& pos, const std::vector<S>& size,
int box, int other, std::vector<IntegerValue>* min_end) {
const IntegerValue other_min_pos = (*min_end)[box];
if (other_min_pos > Min(pos[other])) {
if (integer_reason_.empty()) {
AddBoxReason(box);
AddBoxReason(other);
}
(*min_end)[other] = other_min_pos + Min(size[other]);
if (!SetMin(pos[other], other_min_pos, integer_reason_)) return false;
}
const IntegerValue box_max_pos = Max(pos[other]) - Min(size[box]);
if (box_max_pos < Max(pos[box])) {
if (integer_reason_.empty()) {
AddBoxReason(box);
AddBoxReason(other);
}
if (!SetMax(pos[box], box_max_pos, integer_reason_)) return false;
}
const IntegerValue box_max_size = Max(pos[other]) - Min(pos[box]);
if (box_max_size < Max(size[box])) {
if (integer_reason_.empty()) {
AddBoxReason(box);
AddBoxReason(other);
}
if (!SetMax(size[box], box_max_size, integer_reason_)) return false;
}
return true;
}
template <class S>
bool NonOverlappingRectanglesPropagator<S>::PushOneBox(int box, int other) {
if (!strict_ && cached_areas_[other] == 0) return true;
// For each direction and each order, we test if the boxes can be disjoint.
const int state = (cached_min_end_x_[box] <= Max(x_[other])) +
2 * (cached_min_end_x_[other] <= Max(x_[box])) +
4 * (cached_min_end_y_[box] <= Max(y_[other])) +
8 * (cached_min_end_y_[other] <= Max(y_[box]));
// This is an "hack" to be able to easily test for none or for one
// and only one of the conditions below.
integer_reason_.clear();
switch (state) {
case 0: {
AddBoxReason(box);
AddBoxReason(other);
return integer_trail_->ReportConflict(integer_reason_);
}
case 1:
return FirstBoxIsBeforeSecondBox(x_, dx_, box, other, &cached_min_end_x_);
case 2:
return FirstBoxIsBeforeSecondBox(x_, dx_, other, box, &cached_min_end_x_);
case 4:
return FirstBoxIsBeforeSecondBox(y_, dy_, box, other, &cached_min_end_y_);
case 8:
return FirstBoxIsBeforeSecondBox(y_, dy_, other, box, &cached_min_end_y_);
default:
break;
}
return true;
}
template class NonOverlappingRectanglesPropagator<IntegerVariable>;
template class NonOverlappingRectanglesPropagator<IntegerValue>;
GreaterThanAtLeastOneOfPropagator::GreaterThanAtLeastOneOfPropagator(
IntegerVariable target_var, const std::vector<IntegerVariable>& vars,
const std::vector<IntegerValue>& offsets,
const std::vector<Literal>& selectors, Model* model)
: target_var_(target_var),
vars_(vars),
offsets_(offsets),
selectors_(selectors),
trail_(model->GetOrCreate<Trail>()),
integer_trail_(model->GetOrCreate<IntegerTrail>()) {}
bool GreaterThanAtLeastOneOfPropagator::Propagate() {
// Compute the min of the lower-bound for the still possible variables.
// TODO(user): This could be optimized by keeping more info from the last
// Propagate() calls.
IntegerValue target_min = kMaxIntegerValue;
const IntegerValue current_min = integer_trail_->LowerBound(target_var_);
for (int i = 0; i < vars_.size(); ++i) {
if (trail_->Assignment().LiteralIsTrue(selectors_[i])) return true;
if (trail_->Assignment().LiteralIsFalse(selectors_[i])) continue;
target_min = std::min(target_min,
integer_trail_->LowerBound(vars_[i]) + offsets_[i]);
// Abort if we can't get a better bound.
if (target_min <= current_min) return true;
}
if (target_min == kMaxIntegerValue) {
// All false, conflit.
*(trail_->MutableConflict()) = selectors_;
return false;
}
literal_reason_.clear();
integer_reason_.clear();
for (int i = 0; i < vars_.size(); ++i) {
if (trail_->Assignment().LiteralIsFalse(selectors_[i])) {
literal_reason_.push_back(selectors_[i]);
} else {
integer_reason_.push_back(
IntegerLiteral::GreaterOrEqual(vars_[i], target_min - offsets_[i]));
}
}
return integer_trail_->Enqueue(
IntegerLiteral::GreaterOrEqual(target_var_, target_min), literal_reason_,
integer_reason_);
}
void GreaterThanAtLeastOneOfPropagator::RegisterWith(
GenericLiteralWatcher* watcher) {
const int id = watcher->Register(this);
for (const Literal l : selectors_) watcher->WatchLiteral(l.Negated(), id);
for (const IntegerVariable v : vars_) watcher->WatchLowerBound(v, id);
}
} // namespace sat
} // namespace operations_research
| 35.709611 | 80 | 0.656168 | gnanakeethan |
ffcbe941cda17bbdf3dba6b4419ab258561ab0f9 | 2,831 | cpp | C++ | Userland/Libraries/LibGUI/RegularEditingEngine.cpp | nickwanninger/serenity | d9290558423bac8ae9fa4cc5fd26171ed120b3dd | [
"BSD-2-Clause"
] | 2 | 2021-02-04T13:13:22.000Z | 2021-03-12T21:37:35.000Z | Userland/Libraries/LibGUI/RegularEditingEngine.cpp | nickwanninger/serenity | d9290558423bac8ae9fa4cc5fd26171ed120b3dd | [
"BSD-2-Clause"
] | 78 | 2020-08-25T08:13:30.000Z | 2021-03-02T10:20:05.000Z | Userland/Libraries/LibGUI/RegularEditingEngine.cpp | nickwanninger/serenity | d9290558423bac8ae9fa4cc5fd26171ed120b3dd | [
"BSD-2-Clause"
] | 1 | 2021-06-10T00:18:29.000Z | 2021-06-10T00:18:29.000Z | /*
* Copyright (c) 2020, the SerenityOS developers.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <AK/QuickSort.h>
#include <LibGUI/RegularEditingEngine.h>
#include <LibGUI/TextEditor.h>
namespace GUI {
CursorWidth RegularEditingEngine::cursor_width() const
{
return CursorWidth::NARROW;
}
bool RegularEditingEngine::on_key(const KeyEvent& event)
{
if (EditingEngine::on_key(event))
return true;
if (event.key() == KeyCode::Key_Escape) {
if (m_editor->on_escape_pressed)
m_editor->on_escape_pressed();
return true;
}
if (event.alt() && event.shift() && event.key() == KeyCode::Key_S) {
sort_selected_lines();
return true;
}
return false;
}
static int strcmp_utf32(const u32* s1, const u32* s2, size_t n)
{
while (n-- > 0) {
if (*s1++ != *s2++)
return s1[-1] < s2[-1] ? -1 : 1;
}
return 0;
}
void RegularEditingEngine::sort_selected_lines()
{
if (!m_editor->is_editable())
return;
if (!m_editor->has_selection())
return;
size_t first_line;
size_t last_line;
get_selection_line_boundaries(first_line, last_line);
auto& lines = m_editor->document().lines();
auto start = lines.begin() + (int)first_line;
auto end = lines.begin() + (int)last_line + 1;
quick_sort(start, end, [](auto& a, auto& b) {
return strcmp_utf32(a.code_points(), b.code_points(), min(a.length(), b.length())) < 0;
});
m_editor->did_change();
m_editor->update();
}
}
| 30.771739 | 95 | 0.689156 | nickwanninger |
ffd0687b521036b9551e3fcb2b5749401248f5e5 | 471 | cpp | C++ | src/switchStatements/switch-statements.cpp | learning-lab-cpp/cpp-notes-introduction | 17f34f0e74b967e39226ac038e2c90bb2964c9de | [
"CC0-1.0"
] | null | null | null | src/switchStatements/switch-statements.cpp | learning-lab-cpp/cpp-notes-introduction | 17f34f0e74b967e39226ac038e2c90bb2964c9de | [
"CC0-1.0"
] | null | null | null | src/switchStatements/switch-statements.cpp | learning-lab-cpp/cpp-notes-introduction | 17f34f0e74b967e39226ac038e2c90bb2964c9de | [
"CC0-1.0"
] | null | null | null | #include <iostream>
int main()
{
char response = 'y';
switch (response)
{
case 'y':
// Block of code executes if the value of response is y.
break;
case 'Y':
// Block of code executes if the value of response is Y.
break;
case 'n':
// Block of code executes if the value of response is n.
break;
default:
// Block executes if none of the above conditions are met.
break;
}
} | 22.428571 | 66 | 0.556263 | learning-lab-cpp |
ffdb6df75ee06a245401adda5eaa9a6f3a197348 | 1,973 | cpp | C++ | Tests/ExhaustiveSearchTests.cpp | erwinbonsma/BusyBeaverFinder | e83caa11d93ebbc46f4d92e5de96ad5dcfdc977f | [
"MIT"
] | null | null | null | Tests/ExhaustiveSearchTests.cpp | erwinbonsma/BusyBeaverFinder | e83caa11d93ebbc46f4d92e5de96ad5dcfdc977f | [
"MIT"
] | null | null | null | Tests/ExhaustiveSearchTests.cpp | erwinbonsma/BusyBeaverFinder | e83caa11d93ebbc46f4d92e5de96ad5dcfdc977f | [
"MIT"
] | null | null | null | //
// ExhaustiveSearchTests.cpp
// BusyBeaverFinder
//
// Created by Erwin on 03/02/19.
// Copyright © 2019 Erwin Bonsma.
//
#include <stdio.h>
#include "catch.hpp"
#include "ExhaustiveSearcher.h"
TEST_CASE( "3x3 Search", "[search][3x3][exhaustive]" ) {
ExhaustiveSearcher searcher(3, 3, 16);
ProgressTracker tracker(searcher);
tracker.setDumpBestSofarLimit(INT_MAX);
searcher.setProgressTracker(&tracker);
SECTION( "Find all" ) {
searcher.search();
REQUIRE(tracker.getMaxStepsFound() == 5);
REQUIRE(tracker.getTotalSuccess() == 59);
}
SECTION( "Find one" ) {
searcher.findOne();
REQUIRE(tracker.getMaxStepsFound() == 4);
REQUIRE(tracker.getTotalSuccess() == 1);
}
}
TEST_CASE( "4x4 Search", "[search][4x4][exhaustive]" ) {
ExhaustiveSearcher searcher(4, 4, 32);
ProgressTracker tracker(searcher);
tracker.setDumpBestSofarLimit(INT_MAX);
searcher.setProgressTracker(&tracker);
SearchSettings settings = searcher.getSettings();
settings.maxSteps = 1024;
searcher.configure(settings);
searcher.search();
REQUIRE(tracker.getMaxStepsFound() == 15);
REQUIRE(tracker.getTotalSuccess() == 854);
REQUIRE(tracker.getTotalErrors() == 0);
REQUIRE(tracker.getTotalDetectedHangs() == tracker.getTotalHangs());
}
TEST_CASE( "5x5 Search", "[search][5x5][exhaustive]" ) {
ExhaustiveSearcher searcher(5, 5, 128);
ProgressTracker tracker(searcher);
tracker.setDumpBestSofarLimit(INT_MAX);
tracker.setDumpUndetectedHangs(true);
searcher.setProgressTracker(&tracker);
SearchSettings settings = searcher.getSettings();
settings.maxSteps = 2048;
searcher.configure(settings);
searcher.search();
REQUIRE(tracker.getMaxStepsFound() == 44);
REQUIRE(tracker.getTotalSuccess() == 51410);
REQUIRE(tracker.getTotalErrors() == 0);
REQUIRE(tracker.getTotalHangs() == tracker.getTotalDetectedHangs());
}
| 27.027397 | 72 | 0.682717 | erwinbonsma |
ffdcdf8b045222cca68714d9cdd1e19cf0e57f8a | 2,270 | cc | C++ | src/player/player_provider.cc | kevinscroggins-youi/NativePlayer | 8de394aeb964add1568ddcfc12216930bd895647 | [
"MIT"
] | 26 | 2017-02-24T15:17:19.000Z | 2021-02-11T04:38:16.000Z | src/player/player_provider.cc | kevinscroggins-youi/NativePlayer | 8de394aeb964add1568ddcfc12216930bd895647 | [
"MIT"
] | 8 | 2019-04-17T13:19:17.000Z | 2021-09-21T13:49:53.000Z | src/player/player_provider.cc | kevinscroggins-youi/NativePlayer | 8de394aeb964add1568ddcfc12216930bd895647 | [
"MIT"
] | 14 | 2016-08-31T08:40:36.000Z | 2021-11-12T18:45:14.000Z | /*!
* player_provider.cc (https://github.com/SamsungDForum/NativePlayer)
* Copyright 2016, Samsung Electronics Co., Ltd
* Licensed under the MIT license
*
* 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 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.
*
* @author Michal Murgrabia
*/
#include "player/player_provider.h"
#include "player/es_dash_player/es_dash_player_controller.h"
#include "player/url_player/url_player_controller.h"
#include "logger.h"
using Samsung::NaClPlayer::Rect;
std::shared_ptr<PlayerController> PlayerProvider::CreatePlayer(
PlayerType type, const std::string& url,
const Samsung::NaClPlayer::Rect view_rect,
const std::string& subtitle, const std::string& encoding,
const std::string& drm_license_url,
const std::unordered_map<std::string, std::string>&
drm_key_request_properties) {
switch (type) {
case kUrl: {
std::shared_ptr<UrlPlayerController> controller =
std::make_shared<UrlPlayerController>(instance_, message_sender_);
controller->SetViewRect(view_rect);
controller->InitPlayer(url, subtitle, encoding);
return controller;
}
case kEsDash: {
std::shared_ptr<EsDashPlayerController> controller =
std::make_shared<EsDashPlayerController>(instance_, message_sender_);
controller->SetViewRect(view_rect);
controller->InitPlayer(url, subtitle, encoding,
drm_license_url, drm_key_request_properties);
return controller;
}
default:
Logger::Error("Not known type of player %d", type);
}
return 0;
}
| 39.824561 | 80 | 0.730837 | kevinscroggins-youi |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.